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.06767
|
Generation and detection of non-Gaussian phonon-added coherent states in
optomechanical systems
|
Adding excitations on a coherent state provides an effective way to observe
nonclassical properties of radiation fields. Here we describe and analyse how
to apply this concept to the motional state of a mechanical oscillator and
present a full scheme to prepare non-Gaussian {\it phonon}-added coherent
states of the mechanical motion in cavity optomechanics. We first generate a
mechanical coherent state using electromagnetically induced transparency. We
then add a single phonon onto the coherent state via optomechanical parametric
down-conversion combined with single photon detection. We validate this
single-phonon-added coherent state by using a red-detuned beam and reading out
the state of the optical output field. This approach allows us to verify
nonclassical properties of the phonon state, such as sub-Poissonian character
and quadrature squeezing. We further show that our scheme can be directly
implemented using existing devices, and is generic in nature and hence
applicable to a variety of systems in opto- and electromechanics.
|
quant-ph cond-mat.mes-hall physics.optics
|
adding excitations on a coherent state provides an effective way to observe nonclassical properties of radiation fields here we describe and analyse how to apply this concept to the motional state of a mechanical oscillator and present a full scheme to prepare nongaussian it phononadded coherent states of the mechanical motion in cavity optomechanics we first generate a mechanical coherent state using electromagnetically induced transparency we then add a single phonon onto the coherent state via optomechanical parametric downconversion combined with single photon detection we validate this singlephononadded coherent state by using a reddetuned beam and reading out the state of the optical output field this approach allows us to verify nonclassical properties of the phonon state such as subpoissonian character and quadrature squeezing we further show that our scheme can be directly implemented using existing devices and is generic in nature and hence applicable to a variety of systems in opto and electromechanics
|
[['adding', 'excitations', 'on', 'a', 'coherent', 'state', 'provides', 'an', 'effective', 'way', 'to', 'observe', 'nonclassical', 'properties', 'of', 'radiation', 'fields', 'here', 'we', 'describe', 'and', 'analyse', 'how', 'to', 'apply', 'this', 'concept', 'to', 'the', 'motional', 'state', 'of', 'a', 'mechanical', 'oscillator', 'and', 'present', 'a', 'full', 'scheme', 'to', 'prepare', 'nongaussian', 'it', 'phononadded', 'coherent', 'states', 'of', 'the', 'mechanical', 'motion', 'in', 'cavity', 'optomechanics', 'we', 'first', 'generate', 'a', 'mechanical', 'coherent', 'state', 'using', 'electromagnetically', 'induced', 'transparency', 'we', 'then', 'add', 'a', 'single', 'phonon', 'onto', 'the', 'coherent', 'state', 'via', 'optomechanical', 'parametric', 'downconversion', 'combined', 'with', 'single', 'photon', 'detection', 'we', 'validate', 'this', 'singlephononadded', 'coherent', 'state', 'by', 'using', 'a', 'reddetuned', 'beam', 'and', 'reading', 'out', 'the', 'state', 'of', 'the', 'optical', 'output', 'field', 'this', 'approach', 'allows', 'us', 'to', 'verify', 'nonclassical', 'properties', 'of', 'the', 'phonon', 'state', 'such', 'as', 'subpoissonian', 'character', 'and', 'quadrature', 'squeezing', 'we', 'further', 'show', 'that', 'our', 'scheme', 'can', 'be', 'directly', 'implemented', 'using', 'existing', 'devices', 'and', 'is', 'generic', 'in', 'nature', 'and', 'hence', 'applicable', 'to', 'a', 'variety', 'of', 'systems', 'in', 'opto', 'and', 'electromechanics']]
|
[-0.09782176897370894, 0.18079457706919225, -0.1287837924495474, -0.005479166261226821, -0.07343530340585858, -0.14083790448555528, 0.09551033510682541, 0.42763769298816395, -0.28291236601561603, -0.23426156917182533, 0.017628422062874672, -0.2245321423873209, -0.11395012712608532, 0.2593557122653644, -0.04134148462847071, 0.08627418437543766, 0.07241227407939732, -0.007507148529647996, 0.01803383888967035, -0.16168357177230064, 0.321507172508925, 0.0130400374335678, 0.33858185923523515, 0.004035771677368565, 0.16808213431106292, 0.02720192740410934, 0.07422319907192632, -0.028129048029720587, -0.09068502323254124, 0.14553034967110234, 0.23871559556420452, 0.08310815659167833, 0.2567287069242938, -0.423226324633058, -0.2185660925093352, 0.08044818290631826, 0.11628746527333676, 0.24160191607600273, -0.029791234181366713, -0.34039623559281035, 0.023177608023520167, -0.2033460094673118, -0.1288630236077121, -0.19304958763639565, -0.05529445794940999, -0.00252680665327812, -0.24050435714276605, 0.04031481413001434, 0.048531733480079935, 0.021547099838866608, -0.024135706551150132, -0.0012861100442119334, 0.0058353851797475825, 0.08122379299694378, -0.09985605105190955, -0.012321349282405879, 0.1710837958051247, -0.15232604509717357, -0.1632518920768665, 0.364247974369439, -0.11294953655574079, -0.1747356421669553, 0.18125348930908858, -0.10765541902755534, -0.03719552304889811, 0.12335371857165899, 0.18458538956665985, 0.10036192164682832, -0.1279295037690501, -0.010005529301691385, 0.007833588028963851, 0.23222113748718248, 0.06710512576912726, 0.13423733004999935, 0.1937902971036046, 0.14964487515757546, 0.020573061660367164, 0.24872857761357936, -0.10036940297619654, -0.05812183110346699, -0.3025822739459966, -0.16950899043953732, -0.1884389027943957, 0.0992041534689059, 0.02515092945577635, -0.1275472450238579, 0.43081882235602326, 0.1889253298010628, 0.1358934704621788, -0.0511126531928312, 0.3182408615799719, 0.12905314932638584, 0.02385688813305215, 0.014663955224310294, 0.3021026501971248, 0.1800148740095258, 0.06373633670859578, -0.3019019067302763, -0.022883494340165175, -0.027011737012990603]
|
1,803.06768
|
Gallai's path decomposition conjecture for triangle-free planar graphs
|
A path decomposition of a graph $G$ is a collection of edge-disjoint paths of
$G$ that covers the edge set of $G$. Gallai (1968) conjectured that every
connected graph on $n$ vertices admits a path decomposition of cardinality at
most $\lfloor (n+1)/2\rfloor$. Gallai's Conjecture has been verified for many
classes of graphs. In particular, Lov\'asz (1968) verified this conjecture for
graphs with at most one vertex with even degree, and Pyber (1996) verified it
for graphs in which every cycle contains a vertex with odd degree. Recently,
Bonamy and Perrett (2016) verified Gallai's Conjecture for graphs with maximum
degree at most $5$, and Botler et al. (2017) verified it for graphs with
treewidth at most $3$. In this paper, we verify Gallai's Conjecture for
triangle-free planar graphs.
|
math.CO cs.DM
|
a path decomposition of a graph g is a collection of edgedisjoint paths of g that covers the edge set of g gallai 1968 conjectured that every connected graph on n vertices admits a path decomposition of cardinality at most lfloor n12rfloor gallais conjecture has been verified for many classes of graphs in particular lovasz 1968 verified this conjecture for graphs with at most one vertex with even degree and pyber 1996 verified it for graphs in which every cycle contains a vertex with odd degree recently bonamy and perrett 2016 verified gallais conjecture for graphs with maximum degree at most 5 and botler et al 2017 verified it for graphs with treewidth at most 3 in this paper we verify gallais conjecture for trianglefree planar graphs
|
[['a', 'path', 'decomposition', 'of', 'a', 'graph', 'g', 'is', 'a', 'collection', 'of', 'edgedisjoint', 'paths', 'of', 'g', 'that', 'covers', 'the', 'edge', 'set', 'of', 'g', 'gallai', '1968', 'conjectured', 'that', 'every', 'connected', 'graph', 'on', 'n', 'vertices', 'admits', 'a', 'path', 'decomposition', 'of', 'cardinality', 'at', 'most', 'lfloor', 'n12rfloor', 'gallais', 'conjecture', 'has', 'been', 'verified', 'for', 'many', 'classes', 'of', 'graphs', 'in', 'particular', 'lovasz', '1968', 'verified', 'this', 'conjecture', 'for', 'graphs', 'with', 'at', 'most', 'one', 'vertex', 'with', 'even', 'degree', 'and', 'pyber', '1996', 'verified', 'it', 'for', 'graphs', 'in', 'which', 'every', 'cycle', 'contains', 'a', 'vertex', 'with', 'odd', 'degree', 'recently', 'bonamy', 'and', 'perrett', '2016', 'verified', 'gallais', 'conjecture', 'for', 'graphs', 'with', 'maximum', 'degree', 'at', 'most', '5', 'and', 'botler', 'et', 'al', '2017', 'verified', 'it', 'for', 'graphs', 'with', 'treewidth', 'at', 'most', '3', 'in', 'this', 'paper', 'we', 'verify', 'gallais', 'conjecture', 'for', 'trianglefree', 'planar', 'graphs']]
|
[-0.181736805267632, 0.0902554523809813, -0.052103967435657976, -0.022642849416472016, -0.08959690251946449, -0.18061461838707327, 0.022758653947152197, 0.35749315794929865, -0.2136296564154327, -0.3620550447702408, 0.08470847620535642, -0.3199139203205705, -0.16342351946793496, 0.16126011326164008, -0.12894999539293348, 0.026351000142283736, 0.1762106619058177, 0.06303358335793019, 0.12989685171283782, -0.36256208836520093, 0.2448588526575477, -0.0577303017526865, 0.152150099940598, 0.1605583592802286, 0.1050145288258791, 0.09635237672552466, 0.026696177303791046, 0.11267056106030941, -0.194072449695901, 0.07348208912089467, 0.29860175999999045, 0.17487476365454496, 0.2302411856651306, -0.34162971371924505, -0.17551102343201638, 0.21435069832205772, 0.07086458417307585, 0.04885177115350962, 0.01779237076174468, -0.19009745255857707, 0.166001736483071, -0.10986813070753124, -0.14925521970540284, 0.05155370288342238, 0.2051911010965705, -0.07721452806144953, -0.25930539137125014, -0.031671622402966025, 0.14018268013000487, 0.09360118502005935, 0.1416487365067005, -0.1982352511808276, -0.07679943699203431, 0.0613191209025681, -0.11533489248342813, 0.10754849566984921, -0.0695308342659846, -0.10071380099817179, -0.2630823414847255, 0.31713565659150483, 0.030833277493715287, -0.0546863476075232, 0.12319234716519713, -0.13728484383225442, -0.2977143437638879, 0.12235212756693363, 0.04377810434252024, 0.18364965503662825, -0.07679802434891463, 0.1692093934440054, -0.1863244729042053, 0.08851950893923641, 0.25364306665956976, -0.04585722108185291, 0.09882608681975398, 0.1346274798028171, 0.14968651165394112, 0.16457546750456095, 0.06165652383491397, 0.07403574399789795, -0.25250684944167734, -0.11536804001033306, -0.2844425999093801, 0.0743356576487422, -0.17601936064253096, -0.16347775604575873, 0.43087298822402953, 0.08327712874859572, 0.1292147171497345, 0.1671887786248699, 0.15986370449513196, 0.05432605152495671, 0.022860022687353192, 0.279293979105074, 0.1402433177046478, 0.24738711632043123, -0.03284966976568103, -0.10070271631143987, 0.05899292164295912, 0.21060579372569918]
|
1,803.06769
|
High temperature magnetism and microstructure of semiconducting
ferromagnetic alloy (GaSb)$_{1-x}$(MnSb)$_{x}$
|
We have studied the properties of relatively thick (about 120 nm) magnetic
composite films grown by pulsed laser deposition method using
(GaSb)$_{0.59}$(MnSb)$_{0.41}$ eutectic compound as a target for sputtering.
For the studied films we have observed ferromagnetism and anomalous Hall effect
above the room temperature, it manifests the presence of spin-polarized
carriers. Electron microscopy, atomic and magnetic force microscopy results
suggests that films under study have homogenous columnar structure in the bulk
while MnSb inclusions accumulate near it's surface. This is in good agreement
with high mobility values of charge carriers. Based on our data we conclude
that room temperature magnetic and magnetotransport properties of the films are
defined by MnSb inclusions.
|
cond-mat.mes-hall cond-mat.mtrl-sci
|
we have studied the properties of relatively thick about 120 nm magnetic composite films grown by pulsed laser deposition method using gasb_059mnsb_041 eutectic compound as a target for sputtering for the studied films we have observed ferromagnetism and anomalous hall effect above the room temperature it manifests the presence of spinpolarized carriers electron microscopy atomic and magnetic force microscopy results suggests that films under study have homogenous columnar structure in the bulk while mnsb inclusions accumulate near its surface this is in good agreement with high mobility values of charge carriers based on our data we conclude that room temperature magnetic and magnetotransport properties of the films are defined by mnsb inclusions
|
[['we', 'have', 'studied', 'the', 'properties', 'of', 'relatively', 'thick', 'about', '120', 'nm', 'magnetic', 'composite', 'films', 'grown', 'by', 'pulsed', 'laser', 'deposition', 'method', 'using', 'gasb_059mnsb_041', 'eutectic', 'compound', 'as', 'a', 'target', 'for', 'sputtering', 'for', 'the', 'studied', 'films', 'we', 'have', 'observed', 'ferromagnetism', 'and', 'anomalous', 'hall', 'effect', 'above', 'the', 'room', 'temperature', 'it', 'manifests', 'the', 'presence', 'of', 'spinpolarized', 'carriers', 'electron', 'microscopy', 'atomic', 'and', 'magnetic', 'force', 'microscopy', 'results', 'suggests', 'that', 'films', 'under', 'study', 'have', 'homogenous', 'columnar', 'structure', 'in', 'the', 'bulk', 'while', 'mnsb', 'inclusions', 'accumulate', 'near', 'its', 'surface', 'this', 'is', 'in', 'good', 'agreement', 'with', 'high', 'mobility', 'values', 'of', 'charge', 'carriers', 'based', 'on', 'our', 'data', 'we', 'conclude', 'that', 'room', 'temperature', 'magnetic', 'and', 'magnetotransport', 'properties', 'of', 'the', 'films', 'are', 'defined', 'by', 'mnsb', 'inclusions']]
|
[-0.11441241845757037, 0.23297933878184104, -0.04164608507123482, -0.03451171720102597, 0.02186750483841778, -0.12449668148985586, 0.07539751312615736, 0.4793789734275223, -0.2205169758558072, -0.3155564162041153, 0.024179470744235692, -0.3313235345690905, -0.0856451815652854, 0.22726004657142604, 0.01895666446301851, 0.04070816750636614, -0.07336488726070604, -0.11950486366477636, -0.08446496600486539, -0.210219068727498, 0.2673724617238517, 0.049471884628187295, 0.3606561732222536, 0.12712698955212612, 0.08794399828813668, -0.02744921635383287, 0.14968819812208684, 0.06795254691193502, -0.1845095410345485, 0.036005006203226546, 0.2249548134649894, -0.1683003622996579, 0.1535296137130039, -0.5025912367545806, -0.2621933968553135, -0.05047618688780579, 0.11013485062531791, 0.09724555682414002, -0.1811912743980904, -0.2490912643471011, 0.12916058439526473, -0.08430969153807776, -0.12256689440156962, -0.0993636344341343, -0.03492354915418604, 0.007219092129113001, -0.21766494867142272, 0.11105006381969999, 0.05520016813298335, 0.17785702660042155, -0.16189095294124003, -0.13820585756361284, -0.10410725880993178, 0.02104182141992423, 0.07602537342615694, 0.03147464502930037, 0.276516503843202, -0.11436176815003089, -0.08897837280371301, 0.31402023868249346, -0.06925364359709862, -0.040774964601606935, 0.1648512691918022, -0.25008289047793764, -0.03992317464236204, 0.2111805538051166, 0.08575373240285092, 0.1528822391352675, -0.1671347934254529, 0.08190492180916523, -0.06645074683694623, 0.20981299200909095, 0.13437364904444898, 0.08332992157932143, 0.24125766919858688, 0.2283597966773553, -0.0020291462544821674, 0.15339639030086497, -0.14997707569325627, 0.031195729014438553, -0.14090402542638616, -0.19098604932796578, -0.20502621640224714, 0.08281278856484606, -0.06191545547374738, -0.19791458945654267, 0.31591003288321934, 0.16049208015471966, 0.17004594872579784, -0.08934261140765974, 0.25242418664935473, 0.058363858513903244, 0.07165916056607154, 0.0032818692753108234, 0.24504696104784604, 0.20964068502003141, 0.16147531896015746, -0.2569882104588622, 0.1416043104763302, -0.04520660565970969]
|
1,803.0677
|
Kepler's laws without calculus
|
Kepler's laws are derived from the inverse square law without the use of
calculus and are simplified over previous such derivations.
|
physics.hist-ph gr-qc physics.pop-ph
|
keplers laws are derived from the inverse square law without the use of calculus and are simplified over previous such derivations
|
[['keplers', 'laws', 'are', 'derived', 'from', 'the', 'inverse', 'square', 'law', 'without', 'the', 'use', 'of', 'calculus', 'and', 'are', 'simplified', 'over', 'previous', 'such', 'derivations']]
|
[-0.03605801851621696, 0.026179731901114184, -0.0709467057493471, 0.047202047581473984, -0.17027697428351357, -0.10705168518636908, 0.00968623777762765, 0.327517377744828, -0.3505460271345718, -0.3371611989679791, 0.16750909556590377, -0.299353232385502, -0.1323121167009785, 0.2864069575000377, -0.0847921381881904, 0.08224568524885745, -0.01131261675618589, 0.0548663501228605, -0.07911901870032861, -0.17241535647328765, 0.3106819707456799, 0.020169252219299477, 0.18863441608846188, -0.056030587548212635, 0.10100017820617982, 0.008311592352886995, -0.17198843400304517, 0.01632016302929038, -0.15137277472586858, 0.1287332157648745, 0.13016517655480475, 0.10459369279089428, 0.17267834466128124, -0.4482265217673211, -0.22940441868489697, 0.06223473059279578, 0.12532905824593313, 0.07340690595585675, 0.025615263065057143, -0.255447172448926, 0.09375264936880696, -0.25659857495200067, -0.1468559019267559, -0.04106918660302957, -0.0006522268411659059, 0.1520196130454895, -0.21570711405504317, 0.14420157576733755, 0.14008215859177567, 0.1567918351030953, -0.10001727614906572, -0.20313319634823573, 0.050804545127210166, 0.13621160742782412, 0.03836255556061154, -0.13003909778559491, 0.10006884875751677, -0.07957122953874725, -0.13686198161338411, 0.39680962042794343, 0.0124704082097326, -0.21959415220078968, 0.13809794363831834, -0.13082441545668103, -0.062237966539604325, 0.12227428207794826, 0.08817835765269895, 0.08483809563837158, -0.1629687606223992, 0.162052361203158, -0.09198585250193164, 0.1082489930448078, 0.06929108527089868, -0.011271047938082899, 0.1907559310618256, 0.06459520140751487, 0.012975834842239107, 0.08097325921768234, -0.06206661196691649, -0.20933663117743673, -0.40550475886889864, -0.12294144365226939, -0.15996920610112803, 0.11376488691617158, -0.13205626471608412, -0.0896539461932012, 0.2640493104589127, 0.08698468052205585, 0.0941976812623796, 0.20978955729376703, 0.2805566152646428, 0.24029817303553933, 0.1392982897481748, 0.017702215572907812, 0.2646482169982933, 0.1889654885356625, 0.1328442509762854, -0.12778572581841477, 0.013045423331537418, 0.14575531351424398]
|
1,803.06771
|
Tuning phase-stability and short-range order through Al-doping in
(CoCrFeMn)100-xAlx high entropy alloys
|
For (CoCrFeMn)$_{100-x}$Al$_{x}$ high-entropy alloys, we investigate the
phase evolution with increasing Al-content (0 $\le$ x $\le$ 20 at.%). From
first-principles theory, the Al-doping drives the alloy structurally from FCC
to BCC separated by a narrow two-phase region (FCC+BCC), which is well
supported by our experiments. We highlight the effect of Al-doping on the
formation enthalpy and electronic structure of (CoCrFeMn)$_{100-x}$Al$_{x}$
alloys. As chemical short-range order (SRO) in multicomponent alloys indicates
the nascent local order (and entropy changes), as well as expected
low-temperature ordering behavior, we use thermodynamic linear-response within
density-functional theory to predict SRO and ordering transformation and
temperatures inherent in (CoCrFeMn)$_{100-x}$Al$_{x}$. The predictions agree
with our present experimental findings, and other reported ones.
|
cond-mat.mtrl-sci
|
for cocrfemn_100xal_x highentropy alloys we investigate the phase evolution with increasing alcontent 0 le x le 20 at from firstprinciples theory the aldoping drives the alloy structurally from fcc to bcc separated by a narrow twophase region fccbcc which is well supported by our experiments we highlight the effect of aldoping on the formation enthalpy and electronic structure of cocrfemn_100xal_x alloys as chemical shortrange order sro in multicomponent alloys indicates the nascent local order and entropy changes as well as expected lowtemperature ordering behavior we use thermodynamic linearresponse within densityfunctional theory to predict sro and ordering transformation and temperatures inherent in cocrfemn_100xal_x the predictions agree with our present experimental findings and other reported ones
|
[['for', 'cocrfemn_100xal_x', 'highentropy', 'alloys', 'we', 'investigate', 'the', 'phase', 'evolution', 'with', 'increasing', 'alcontent', '0', 'le', 'x', 'le', '20', 'at', 'from', 'firstprinciples', 'theory', 'the', 'aldoping', 'drives', 'the', 'alloy', 'structurally', 'from', 'fcc', 'to', 'bcc', 'separated', 'by', 'a', 'narrow', 'twophase', 'region', 'fccbcc', 'which', 'is', 'well', 'supported', 'by', 'our', 'experiments', 'we', 'highlight', 'the', 'effect', 'of', 'aldoping', 'on', 'the', 'formation', 'enthalpy', 'and', 'electronic', 'structure', 'of', 'cocrfemn_100xal_x', 'alloys', 'as', 'chemical', 'shortrange', 'order', 'sro', 'in', 'multicomponent', 'alloys', 'indicates', 'the', 'nascent', 'local', 'order', 'and', 'entropy', 'changes', 'as', 'well', 'as', 'expected', 'lowtemperature', 'ordering', 'behavior', 'we', 'use', 'thermodynamic', 'linearresponse', 'within', 'densityfunctional', 'theory', 'to', 'predict', 'sro', 'and', 'ordering', 'transformation', 'and', 'temperatures', 'inherent', 'in', 'cocrfemn_100xal_x', 'the', 'predictions', 'agree', 'with', 'our', 'present', 'experimental', 'findings', 'and', 'other', 'reported', 'ones']]
|
[-0.07821844992832395, 0.16801196316322475, -0.03624016211547872, 0.03257009877288191, 0.004405437462162553, -0.09028317979455255, 0.1006064484153237, 0.39734887109513867, -0.26535581550642584, -0.3021845576892558, 0.014609485204952458, -0.3636229425145869, -0.13698179829404117, 0.09611219005953324, 0.07663965167599249, 0.03175092290008539, -0.044936001450926265, -0.046817413290754256, -0.1564720949860649, -0.1902383369160816, 0.2499575924920735, 0.06408247045290313, 0.2822503179491481, 0.069984878349555, 0.0037571378767065574, -0.004890702568860561, 0.09592947854840181, 0.04969421023142467, -0.2273855869568427, 0.026278594634947552, 0.275648160102336, -0.05210589025202289, 0.16611136850827424, -0.4435757153357069, -0.2571578114793897, -0.02088016274858985, 0.10701614343806316, 0.10270153644817408, -0.08720328224916828, -0.24810585538088753, 0.0982288385929311, -0.17067194473521227, -0.10356226418240878, -0.14097014767232172, -0.026328042950154396, 0.046207818474820736, -0.242984106917886, 0.1520063172896092, 0.03442940247559659, 0.09861739752242309, -0.1502886151102486, -0.16990998230584523, -0.09480252334227164, 0.04274930182554383, 0.01505109894685774, 0.061288811585032625, 0.1898985680421455, -0.042552012558540776, -0.07283138122977362, 0.40934866875115977, -0.04433507351163905, -0.02984825762911912, 0.1927178967825807, -0.16616454694354743, -0.12947227230720354, 0.11918953174251344, 0.0799421854725663, 0.10638070274797971, -0.0906736428870844, 0.06719072384651538, 0.07222311740834061, 0.20853892617385117, 0.023591219496570136, 0.03949034820400636, 0.20467466124937983, 0.2116712773088039, -0.04392212156406522, 0.12283080956937435, -0.08247039543685357, -0.12721716890953025, -0.21903634873594632, -0.14446519127344354, -0.19219728355426668, 0.038824741655078376, -0.10837963045298493, -0.1741812787613047, 0.3168197943943373, 0.13814271517402263, 0.18665295073010943, -0.0072712361835057665, 0.18607298706666098, 0.02174623653684792, 0.02183567105563717, 0.014792872282365957, 0.22808165159975097, 0.16591766173134379, 0.14928596523966184, -0.24997309868207626, 0.15065587962683485, 0.030174777849185232]
|
1,803.06772
|
SybilFuse: Combining Local Attributes with Global Structure to Perform
Robust Sybil Detection
|
Sybil attacks are becoming increasingly widespread and pose a significant
threat to online social systems; a single adversary can inject multiple
colluding identities in the system to compromise security and privacy. Recent
works have leveraged social network-based trust relationships to defend against
Sybil attacks. However, existing defenses are based on oversimplified
assumptions about network structure, which do not necessarily hold in
real-world social networks. Recognizing these limitations, we propose
SybilFuse, a defense-in-depth framework for Sybil detection when the
oversimplified assumptions are relaxed. SybilFuse adopts a collective
classification approach by first training local classifiers to compute local
trust scores for nodes and edges, and then propagating the local scores through
the global network structure via weighted random walk and loopy belief
propagation mechanisms. We evaluate our framework on both synthetic and
real-world network topologies, including a large-scale, labeled Twitter network
comprising 20M nodes and 265M edges, and demonstrate that SybilFuse outperforms
state-of-the-art approaches significantly. In particular, SybilFuse achieves
98% of Sybil coverage among top-ranked nodes.
|
cs.CR cs.SI
|
sybil attacks are becoming increasingly widespread and pose a significant threat to online social systems a single adversary can inject multiple colluding identities in the system to compromise security and privacy recent works have leveraged social networkbased trust relationships to defend against sybil attacks however existing defenses are based on oversimplified assumptions about network structure which do not necessarily hold in realworld social networks recognizing these limitations we propose sybilfuse a defenseindepth framework for sybil detection when the oversimplified assumptions are relaxed sybilfuse adopts a collective classification approach by first training local classifiers to compute local trust scores for nodes and edges and then propagating the local scores through the global network structure via weighted random walk and loopy belief propagation mechanisms we evaluate our framework on both synthetic and realworld network topologies including a largescale labeled twitter network comprising 20m nodes and 265m edges and demonstrate that sybilfuse outperforms stateoftheart approaches significantly in particular sybilfuse achieves 98 of sybil coverage among topranked nodes
|
[['sybil', 'attacks', 'are', 'becoming', 'increasingly', 'widespread', 'and', 'pose', 'a', 'significant', 'threat', 'to', 'online', 'social', 'systems', 'a', 'single', 'adversary', 'can', 'inject', 'multiple', 'colluding', 'identities', 'in', 'the', 'system', 'to', 'compromise', 'security', 'and', 'privacy', 'recent', 'works', 'have', 'leveraged', 'social', 'networkbased', 'trust', 'relationships', 'to', 'defend', 'against', 'sybil', 'attacks', 'however', 'existing', 'defenses', 'are', 'based', 'on', 'oversimplified', 'assumptions', 'about', 'network', 'structure', 'which', 'do', 'not', 'necessarily', 'hold', 'in', 'realworld', 'social', 'networks', 'recognizing', 'these', 'limitations', 'we', 'propose', 'sybilfuse', 'a', 'defenseindepth', 'framework', 'for', 'sybil', 'detection', 'when', 'the', 'oversimplified', 'assumptions', 'are', 'relaxed', 'sybilfuse', 'adopts', 'a', 'collective', 'classification', 'approach', 'by', 'first', 'training', 'local', 'classifiers', 'to', 'compute', 'local', 'trust', 'scores', 'for', 'nodes', 'and', 'edges', 'and', 'then', 'propagating', 'the', 'local', 'scores', 'through', 'the', 'global', 'network', 'structure', 'via', 'weighted', 'random', 'walk', 'and', 'loopy', 'belief', 'propagation', 'mechanisms', 'we', 'evaluate', 'our', 'framework', 'on', 'both', 'synthetic', 'and', 'realworld', 'network', 'topologies', 'including', 'a', 'largescale', 'labeled', 'twitter', 'network', 'comprising', '20m', 'nodes', 'and', '265m', 'edges', 'and', 'demonstrate', 'that', 'sybilfuse', 'outperforms', 'stateoftheart', 'approaches', 'significantly', 'in', 'particular', 'sybilfuse', 'achieves', '98', 'of', 'sybil', 'coverage', 'among', 'topranked', 'nodes']]
|
[-0.16134873893900425, -0.04025090193415941, -0.0069521351151762565, 0.097683605677991, -0.1423448679163092, -0.24209004285048258, 0.11468777272484602, 0.4400610005814422, -0.22747613480771703, -0.33489731006735673, 0.050770158288811845, -0.34170157600735585, -0.23982521854169622, 0.12664430761678383, -0.12758622551336884, 0.07345526481255821, 0.10812209059478589, 0.03239948685749497, 0.03339945829467722, -0.346150468618529, 0.32348858910052825, 0.03768299983248709, 0.39022948279794006, 0.06308021560665562, 0.07405826136858368, -0.001424808830788439, -0.027104101684430122, 0.042985667878807594, -0.020717201401857, 0.14970798545768427, 0.32941663546339134, 0.24462624490718168, 0.36895796484913834, -0.46518782549109194, -0.2522508241107653, 0.11204647087703454, 0.14576950367323002, 0.13598608436631437, -0.008307063188603822, -0.40994368074176135, 0.14506818773796312, -0.22398962094762756, 0.015045945655463114, -0.1387605892281488, -0.04032227349256171, 0.04545515676334706, -0.2669640741535274, 0.03474935064195124, 0.04112861329472504, 0.06783707344767415, -0.0018410628870061021, -0.08325112908664359, -0.016571990084303028, 0.15636745614283204, 0.018092216399606842, -0.04690282768141364, 0.21817695300031933, -0.16182728159394755, -0.2209149573838904, 0.335425615412086, 0.012324257355263353, -0.1726667156251593, 0.19393537616238649, 0.04280493904617215, -0.17951774755149988, 0.0750687562373461, 0.2839965923043665, 0.09889852776094997, -0.16584687025767988, -0.026160038212039993, -0.06194293631406421, 0.1714244767454984, 0.05080683640507193, 0.03584391929542141, 0.1408735955151175, 0.18793840493515498, 0.10536318343486979, 0.0536849039386775, -0.10376808712397491, -0.10653445607428354, -0.14402459930675676, -0.0504589213723991, -0.1604613856429611, 0.014430396656017962, -0.14571993403705236, -0.15960727905657462, 0.38254885730316485, 0.2500732091049795, 0.16877124864933726, 0.1334369826763354, 0.3769852855625602, -0.06250303872379594, 0.09700617811248347, 0.19673624639313644, 0.20332203872340798, -0.0066823664855531935, 0.09785970222766288, -0.09861287740601993, 0.2131232190870057, 0.004236688197481852]
|
1,803.06773
|
Composable Deep Reinforcement Learning for Robotic Manipulation
|
Model-free deep reinforcement learning has been shown to exhibit good
performance in domains ranging from video games to simulated robotic
manipulation and locomotion. However, model-free methods are known to perform
poorly when the interaction time with the environment is limited, as is the
case for most real-world robotic tasks. In this paper, we study how maximum
entropy policies trained using soft Q-learning can be applied to real-world
robotic manipulation. The application of this method to real-world manipulation
is facilitated by two important features of soft Q-learning. First, soft
Q-learning can learn multimodal exploration strategies by learning policies
represented by expressive energy-based models. Second, we show that policies
learned with soft Q-learning can be composed to create new policies, and that
the optimality of the resulting policy can be bounded in terms of the
divergence between the composed policies. This compositionality provides an
especially valuable tool for real-world manipulation, where constructing new
policies by composing existing skills can provide a large gain in efficiency
over training from scratch. Our experimental evaluation demonstrates that soft
Q-learning is substantially more sample efficient than prior model-free deep
reinforcement learning methods, and that compositionality can be performed for
both simulated and real-world tasks.
|
cs.LG cs.AI cs.RO stat.ML
|
modelfree deep reinforcement learning has been shown to exhibit good performance in domains ranging from video games to simulated robotic manipulation and locomotion however modelfree methods are known to perform poorly when the interaction time with the environment is limited as is the case for most realworld robotic tasks in this paper we study how maximum entropy policies trained using soft qlearning can be applied to realworld robotic manipulation the application of this method to realworld manipulation is facilitated by two important features of soft qlearning first soft qlearning can learn multimodal exploration strategies by learning policies represented by expressive energybased models second we show that policies learned with soft qlearning can be composed to create new policies and that the optimality of the resulting policy can be bounded in terms of the divergence between the composed policies this compositionality provides an especially valuable tool for realworld manipulation where constructing new policies by composing existing skills can provide a large gain in efficiency over training from scratch our experimental evaluation demonstrates that soft qlearning is substantially more sample efficient than prior modelfree deep reinforcement learning methods and that compositionality can be performed for both simulated and realworld tasks
|
[['modelfree', 'deep', 'reinforcement', 'learning', 'has', 'been', 'shown', 'to', 'exhibit', 'good', 'performance', 'in', 'domains', 'ranging', 'from', 'video', 'games', 'to', 'simulated', 'robotic', 'manipulation', 'and', 'locomotion', 'however', 'modelfree', 'methods', 'are', 'known', 'to', 'perform', 'poorly', 'when', 'the', 'interaction', 'time', 'with', 'the', 'environment', 'is', 'limited', 'as', 'is', 'the', 'case', 'for', 'most', 'realworld', 'robotic', 'tasks', 'in', 'this', 'paper', 'we', 'study', 'how', 'maximum', 'entropy', 'policies', 'trained', 'using', 'soft', 'qlearning', 'can', 'be', 'applied', 'to', 'realworld', 'robotic', 'manipulation', 'the', 'application', 'of', 'this', 'method', 'to', 'realworld', 'manipulation', 'is', 'facilitated', 'by', 'two', 'important', 'features', 'of', 'soft', 'qlearning', 'first', 'soft', 'qlearning', 'can', 'learn', 'multimodal', 'exploration', 'strategies', 'by', 'learning', 'policies', 'represented', 'by', 'expressive', 'energybased', 'models', 'second', 'we', 'show', 'that', 'policies', 'learned', 'with', 'soft', 'qlearning', 'can', 'be', 'composed', 'to', 'create', 'new', 'policies', 'and', 'that', 'the', 'optimality', 'of', 'the', 'resulting', 'policy', 'can', 'be', 'bounded', 'in', 'terms', 'of', 'the', 'divergence', 'between', 'the', 'composed', 'policies', 'this', 'compositionality', 'provides', 'an', 'especially', 'valuable', 'tool', 'for', 'realworld', 'manipulation', 'where', 'constructing', 'new', 'policies', 'by', 'composing', 'existing', 'skills', 'can', 'provide', 'a', 'large', 'gain', 'in', 'efficiency', 'over', 'training', 'from', 'scratch', 'our', 'experimental', 'evaluation', 'demonstrates', 'that', 'soft', 'qlearning', 'is', 'substantially', 'more', 'sample', 'efficient', 'than', 'prior', 'modelfree', 'deep', 'reinforcement', 'learning', 'methods', 'and', 'that', 'compositionality', 'can', 'be', 'performed', 'for', 'both', 'simulated', 'and', 'realworld', 'tasks']]
|
[-0.022435297275836947, 0.04480381224681024, -0.10782764114514747, 0.06159109887525891, -0.16074702987386233, -0.18829778266477992, 0.03055117493365995, 0.522721502137361, -0.2909188054042229, -0.3722693951273657, 0.06962771077565096, -0.20445048900772678, -0.2232400726978526, 0.2548495607375346, -0.16454654341478916, 0.11139209322558452, 0.11942538661844652, -0.008692602879653516, -0.027291292083600177, -0.27574357194967114, 0.2744104281124292, 0.013149039614933892, 0.30962612269907214, 0.01804089490935733, 0.12921427680306474, -0.009728403348061774, 0.05102517974393612, 0.01952602324720397, -0.02210731048332739, 0.17966543206700472, 0.39930457316540463, 0.22270115487385692, 0.35002878958340544, -0.41159390220212055, -0.23192815640247474, 0.10999161218389436, 0.14710057427521062, 0.0446517996847479, -0.0341624506115543, -0.3378152483215819, 0.08886276904112575, -0.19705731279188485, -0.009648116783625822, -0.22609734337664011, -0.04681043002420491, 0.014329531286770215, -0.31576839563051107, -0.006820068022029268, 0.04492407550828324, 0.06096255794082853, -0.04716254892697878, -0.10043254384484067, 0.03263956796486081, 0.18710068440505168, 0.04434057698359318, 0.021394581683309315, 0.18010635870141964, -0.19866560827917185, -0.2340364676178198, 0.3493967716760858, -0.032637825872260495, -0.16639606302811039, 0.23813157804155102, 0.0014282258161616445, -0.12617263700954165, 0.11069215694677574, 0.2633667198251439, 0.18871862122629102, -0.19602212476265685, 0.0171785532235817, -0.03133148471166314, 0.19735769864002412, 0.01673194790738776, -0.03743362912644792, 0.1338621300693385, 0.29200710343770836, 0.06607966998479131, 0.19699328298435895, -0.04753521830078704, -0.14319315840574828, -0.18755833116933854, -0.058840918679241884, -0.18915230298245495, -0.0036066822646505605, -0.11703961021460903, -0.081717470529324, 0.31731275181201374, 0.21399135023562443, 0.16565803638682935, 0.1315591063943099, 0.38260354285100195, 0.06540632809305356, 0.09328022305830147, 0.11279104575938122, 0.24016176766687722, -0.01969022213744771, 0.1695244863712831, -0.1906593062227293, 0.14184833743910522, 0.004302043544414872]
|
1,803.06774
|
Toda type equations over multi-dimensional lattices
|
We introduce a class of recursions defined over the $d$-dimensional integer
lattice. The discrete equations we study are interpreted as higher dimensional
extensions to the discrete Toda lattice equation. We shall prove that the
equations satisfy the coprimeness property, which is one of integrability
detectors analogous to the singularity confinement test. While the degree of
their iterates grows exponentially, their singularities exhibit a nature
similar to that of integrable systems in terms of the coprimeness property. We
also prove that the equations can be expressed as mutations of a seed in the
sense of the Laurent phenomenon algebra.
|
math-ph math.AC math.MP nlin.SI
|
we introduce a class of recursions defined over the ddimensional integer lattice the discrete equations we study are interpreted as higher dimensional extensions to the discrete toda lattice equation we shall prove that the equations satisfy the coprimeness property which is one of integrability detectors analogous to the singularity confinement test while the degree of their iterates grows exponentially their singularities exhibit a nature similar to that of integrable systems in terms of the coprimeness property we also prove that the equations can be expressed as mutations of a seed in the sense of the laurent phenomenon algebra
|
[['we', 'introduce', 'a', 'class', 'of', 'recursions', 'defined', 'over', 'the', 'ddimensional', 'integer', 'lattice', 'the', 'discrete', 'equations', 'we', 'study', 'are', 'interpreted', 'as', 'higher', 'dimensional', 'extensions', 'to', 'the', 'discrete', 'toda', 'lattice', 'equation', 'we', 'shall', 'prove', 'that', 'the', 'equations', 'satisfy', 'the', 'coprimeness', 'property', 'which', 'is', 'one', 'of', 'integrability', 'detectors', 'analogous', 'to', 'the', 'singularity', 'confinement', 'test', 'while', 'the', 'degree', 'of', 'their', 'iterates', 'grows', 'exponentially', 'their', 'singularities', 'exhibit', 'a', 'nature', 'similar', 'to', 'that', 'of', 'integrable', 'systems', 'in', 'terms', 'of', 'the', 'coprimeness', 'property', 'we', 'also', 'prove', 'that', 'the', 'equations', 'can', 'be', 'expressed', 'as', 'mutations', 'of', 'a', 'seed', 'in', 'the', 'sense', 'of', 'the', 'laurent', 'phenomenon', 'algebra']]
|
[-0.1906292038893669, 0.10875423561439526, -0.1041483901041959, 0.10578287980752066, -0.07765957259820128, -0.13847548804692544, -0.04792313341868623, 0.28808092425235227, -0.3393653878295908, -0.17849414879266096, 0.11274780638572969, -0.25659701791686973, -0.189801798905341, 0.1440192306585306, -0.07939385679759542, 0.04810322570253392, 0.04802314366917221, 0.06660234540871972, -0.11159954079645401, -0.30693967046206627, 0.33127106102753656, -0.021083208063215834, 0.2290921145479898, 0.026208962211670468, 0.16419319002604, -0.014883787352211622, 0.03644291445974032, 0.035997446032469065, -0.14472393841090392, 0.0759596007315404, 0.2568790342810811, 0.0754711707550272, 0.24890195747495306, -0.3863545757224213, -0.17468939225274918, 0.16050285082643054, 0.19685735163036544, 0.09308875308310309, 0.004967090219962506, -0.25043905771584535, 0.12185465305929585, -0.14809028328796112, -0.24869401038538816, -0.06429333397548417, -0.013250542988725083, 0.08228427952580743, -0.25573044468895817, 0.07927785924729673, 0.14430389535252233, 0.06496810175868094, -0.08020770294016835, -0.057063370791016796, -0.06204741649633767, 0.04610841202891755, 0.03513018440393427, -0.004405424072483212, 0.05160747752144781, -0.11127431406641002, -0.14462709718987307, 0.382130528766928, -0.06474143886173676, -0.27298988452539374, 0.16712186278357188, -0.165376104576019, -0.15482263167255692, 0.0905575115015084, 0.15475484213259602, 0.13031683571883762, -0.0947198788350334, 0.15515311097613227, -0.08941615572465318, 0.0851379730073469, 0.11375673631757345, 0.10269194373347777, 0.15005364951829672, 0.07251569202017723, 0.06669566142182722, 0.1847445979804675, 0.038419431386686555, -0.1372240318593626, -0.3499967275681544, -0.18529762235013958, -0.15891621998102612, 0.12985540877039337, -0.11456630537666533, -0.21397464427792903, 0.3799789743307902, 0.150564132258296, 0.18437493250857354, 0.10275983697216844, 0.15515169660959924, 0.20208401926460542, 0.09273297089028495, 0.02243119906824158, 0.15652359238046468, 0.1708423316630782, 0.07082626467442368, -0.2114092697988131, 0.012839335563345527, 0.1946345036374215]
|
1,803.06775
|
Comparing and Integrating Constraint Programming and Temporal Planning
for Quantum Circuit Compilation
|
Recently, the makespan-minimization problem of compiling a general class of
quantum algorithms into near-term quantum processors has been introduced to the
AI community. The research demonstrated that temporal planning is a strong
approach for a class of quantum circuit compilation (QCC) problems. In this
paper, we explore the use of constraint programming (CP) as an alternative and
complementary approach to temporal planning. We extend previous work by
introducing two new problem variations that incorporate important
characteristics identified by the quantum computing community. We apply
temporal planning and CP to the baseline and extended QCC problems as both
stand-alone and hybrid approaches. Our hybrid methods use solutions found by
temporal planning to warm start CP, leveraging the ability of the former to
find satisficing solutions to problems with a high degree of task optionality,
an area that CP typically struggles with. The CP model, benefiting from
inferred bounds on planning horizon length and task counts provided by the warm
start, is then used to find higher quality solutions. Our empirical evaluation
indicates that while stand-alone CP is only competitive for the smallest
problems, CP in our hybridization with temporal planning out-performs
stand-alone temporal planning in the majority of problem classes.
|
quant-ph cs.AI cs.ET cs.SY
|
recently the makespanminimization problem of compiling a general class of quantum algorithms into nearterm quantum processors has been introduced to the ai community the research demonstrated that temporal planning is a strong approach for a class of quantum circuit compilation qcc problems in this paper we explore the use of constraint programming cp as an alternative and complementary approach to temporal planning we extend previous work by introducing two new problem variations that incorporate important characteristics identified by the quantum computing community we apply temporal planning and cp to the baseline and extended qcc problems as both standalone and hybrid approaches our hybrid methods use solutions found by temporal planning to warm start cp leveraging the ability of the former to find satisficing solutions to problems with a high degree of task optionality an area that cp typically struggles with the cp model benefiting from inferred bounds on planning horizon length and task counts provided by the warm start is then used to find higher quality solutions our empirical evaluation indicates that while standalone cp is only competitive for the smallest problems cp in our hybridization with temporal planning outperforms standalone temporal planning in the majority of problem classes
|
[['recently', 'the', 'makespanminimization', 'problem', 'of', 'compiling', 'a', 'general', 'class', 'of', 'quantum', 'algorithms', 'into', 'nearterm', 'quantum', 'processors', 'has', 'been', 'introduced', 'to', 'the', 'ai', 'community', 'the', 'research', 'demonstrated', 'that', 'temporal', 'planning', 'is', 'a', 'strong', 'approach', 'for', 'a', 'class', 'of', 'quantum', 'circuit', 'compilation', 'qcc', 'problems', 'in', 'this', 'paper', 'we', 'explore', 'the', 'use', 'of', 'constraint', 'programming', 'cp', 'as', 'an', 'alternative', 'and', 'complementary', 'approach', 'to', 'temporal', 'planning', 'we', 'extend', 'previous', 'work', 'by', 'introducing', 'two', 'new', 'problem', 'variations', 'that', 'incorporate', 'important', 'characteristics', 'identified', 'by', 'the', 'quantum', 'computing', 'community', 'we', 'apply', 'temporal', 'planning', 'and', 'cp', 'to', 'the', 'baseline', 'and', 'extended', 'qcc', 'problems', 'as', 'both', 'standalone', 'and', 'hybrid', 'approaches', 'our', 'hybrid', 'methods', 'use', 'solutions', 'found', 'by', 'temporal', 'planning', 'to', 'warm', 'start', 'cp', 'leveraging', 'the', 'ability', 'of', 'the', 'former', 'to', 'find', 'satisficing', 'solutions', 'to', 'problems', 'with', 'a', 'high', 'degree', 'of', 'task', 'optionality', 'an', 'area', 'that', 'cp', 'typically', 'struggles', 'with', 'the', 'cp', 'model', 'benefiting', 'from', 'inferred', 'bounds', 'on', 'planning', 'horizon', 'length', 'and', 'task', 'counts', 'provided', 'by', 'the', 'warm', 'start', 'is', 'then', 'used', 'to', 'find', 'higher', 'quality', 'solutions', 'our', 'empirical', 'evaluation', 'indicates', 'that', 'while', 'standalone', 'cp', 'is', 'only', 'competitive', 'for', 'the', 'smallest', 'problems', 'cp', 'in', 'our', 'hybridization', 'with', 'temporal', 'planning', 'outperforms', 'standalone', 'temporal', 'planning', 'in', 'the', 'majority', 'of', 'problem', 'classes']]
|
[-0.07489866477606649, 0.03702298481845782, -0.05434283582173815, 0.07620120249398175, -0.14164812966588547, -0.1586481428662823, 0.04512523716571976, 0.3709900199877794, -0.2789531221326365, -0.3545328741869654, 0.09743701519428122, -0.2332526194237436, -0.13810884823665173, 0.21451138008757484, -0.09047371087915669, 0.09925103028107321, 0.10175419669137384, -0.015796694528273862, -0.07511920458637178, -0.22968784414791513, 0.25452561141814883, 0.03955509850633039, 0.28249593181629673, 0.05362052771126419, 0.09873442487048004, -0.01014898618509184, -0.03360120583774823, 0.07822341010717657, -0.09008397374286274, 0.151883635249558, 0.31624790753303755, 0.2251591139315449, 0.30654543168334797, -0.41040338734823345, -0.23735592819072984, 0.10745452832722521, 0.13461555936608952, 0.09784446979256704, -0.03310923462538425, -0.3168827501040968, 0.06790049529088793, -0.1631020104008841, -0.05997061968846905, -0.08653454242198906, 0.0015780832336255999, -0.03836855845498815, -0.2668623790671729, 0.02619478422231182, 0.043630804264485235, 0.030038116845499837, -0.01146565461672391, -0.13095358363881876, 0.0574682706795313, 0.11314289792525498, 0.04027580483898878, 0.026842738955629743, 0.0777918070841656, -0.12889115189583125, -0.2361706169404447, 0.4010097435910744, -0.035854805493727326, -0.1740522337607061, 0.17899389458218157, -0.041637120318053424, -0.19668160773333954, 0.08521015528175566, 0.1853848078018854, 0.139847200570835, -0.16940952943534487, 0.0809123829754441, -0.019793218782529085, 0.18094871870731238, 0.02874748774679528, 0.031772074933725906, 0.20298191578823585, 0.22520103190809188, 0.12306514463500318, 0.14985974359730578, -0.07075948511236206, -0.134257497251824, -0.22667650508252207, -0.12022843193486239, -0.1474635066309323, -0.023352353831263956, -0.07284306289092814, -0.1299848463521527, 0.3866922576744768, 0.18909739222579797, 0.12380461394786835, 0.09811611527417119, 0.33671791207943713, 0.08469756051658117, 0.06777753502440949, 0.09288426945303482, 0.21714862938053114, 0.0651383105120998, 0.16505414421430253, -0.2668831927497222, 0.07873847103099141, 0.033552964053333106]
|
1,803.06776
|
A Decade of MWC 758 Disk Images: Where Are the Spiral-Arm-Driving
Planets?
|
Large-scale spiral arms have been revealed in scattered light images of a few
protoplanetary disks. Theoretical models suggest that such arms may be driven
by and co-rotate with giant planets, which has called for remarkable
observational efforts to look for them. By examining the rotation of the spiral
arms for the MWC 758 system over a 10-yr timescale, we are able to provide
dynamical constraints on the locations of their perturbers. We present
reprocessed Hubble Space Telescope (HST)/NICMOS F110W observations of the
target in 2005, and the new Keck/NIRC2 $L'$-band observations in 2017.
MWC~758's two well-known spiral arms are revealed in the NICMOS archive at the
earliest observational epoch. With additional Very Large Telescope (VLT)/SPHERE
data, our joint analysis leads to a pattern speed of
${0.6^\circ}^{+3.3^\circ}_{-0.6^\circ}\, \mathrm{yr}^{-1}$ at $3\sigma$ for the
two major spiral arms. If the two arms are induced by a perturber on a
near-circular orbit, its best fit orbit is at $89$ au ($0.59"$), with a
$3\sigma$ lower limit of 30 au ($0.20"$). This finding is consistent with the
simulation prediction of the location of an arm-driving planet for the two
major arms in the system.
|
astro-ph.EP astro-ph.SR
|
largescale spiral arms have been revealed in scattered light images of a few protoplanetary disks theoretical models suggest that such arms may be driven by and corotate with giant planets which has called for remarkable observational efforts to look for them by examining the rotation of the spiral arms for the mwc 758 system over a 10yr timescale we are able to provide dynamical constraints on the locations of their perturbers we present reprocessed hubble space telescope hstnicmos f110w observations of the target in 2005 and the new kecknirc2 lband observations in 2017 mwc758s two wellknown spiral arms are revealed in the nicmos archive at the earliest observational epoch with additional very large telescope vltsphere data our joint analysis leads to a pattern speed of 06circ33circ_06circ mathrmyr1 at 3sigma for the two major spiral arms if the two arms are induced by a perturber on a nearcircular orbit its best fit orbit is at 89 au 059 with a 3sigma lower limit of 30 au 020 this finding is consistent with the simulation prediction of the location of an armdriving planet for the two major arms in the system
|
[['largescale', 'spiral', 'arms', 'have', 'been', 'revealed', 'in', 'scattered', 'light', 'images', 'of', 'a', 'few', 'protoplanetary', 'disks', 'theoretical', 'models', 'suggest', 'that', 'such', 'arms', 'may', 'be', 'driven', 'by', 'and', 'corotate', 'with', 'giant', 'planets', 'which', 'has', 'called', 'for', 'remarkable', 'observational', 'efforts', 'to', 'look', 'for', 'them', 'by', 'examining', 'the', 'rotation', 'of', 'the', 'spiral', 'arms', 'for', 'the', 'mwc', '758', 'system', 'over', 'a', '10yr', 'timescale', 'we', 'are', 'able', 'to', 'provide', 'dynamical', 'constraints', 'on', 'the', 'locations', 'of', 'their', 'perturbers', 'we', 'present', 'reprocessed', 'hubble', 'space', 'telescope', 'hstnicmos', 'f110w', 'observations', 'of', 'the', 'target', 'in', '2005', 'and', 'the', 'new', 'kecknirc2', 'lband', 'observations', 'in', '2017', 'mwc758s', 'two', 'wellknown', 'spiral', 'arms', 'are', 'revealed', 'in', 'the', 'nicmos', 'archive', 'at', 'the', 'earliest', 'observational', 'epoch', 'with', 'additional', 'very', 'large', 'telescope', 'vltsphere', 'data', 'our', 'joint', 'analysis', 'leads', 'to', 'a', 'pattern', 'speed', 'of', '06circ33circ_06circ', 'mathrmyr1', 'at', '3sigma', 'for', 'the', 'two', 'major', 'spiral', 'arms', 'if', 'the', 'two', 'arms', 'are', 'induced', 'by', 'a', 'perturber', 'on', 'a', 'nearcircular', 'orbit', 'its', 'best', 'fit', 'orbit', 'is', 'at', '89', 'au', '059', 'with', 'a', '3sigma', 'lower', 'limit', 'of', '30', 'au', '020', 'this', 'finding', 'is', 'consistent', 'with', 'the', 'simulation', 'prediction', 'of', 'the', 'location', 'of', 'an', 'armdriving', 'planet', 'for', 'the', 'two', 'major', 'arms', 'in', 'the', 'system']]
|
[-0.14963429427946046, 0.06329013161201302, -0.09916951319438115, 0.02748502871855312, -0.10749177270073203, -0.07427157382624755, 0.029802447517267277, 0.407868579170236, -0.1890747769164943, -0.3569239385310881, 0.10788978305107022, -0.282674937882343, -0.07914410674724207, 0.2071574654565343, -0.04586599651043133, 0.015087737789066503, 0.11706644902193558, -0.08558821082174632, -0.024879011109841222, -0.2524216208126276, 0.2541057094956638, 0.07879763213236646, 0.11274174714438437, -0.07030095033577934, 0.08802209818618052, -0.08377666538862902, -0.050851747568856964, -0.04536757450716655, -0.18419411776091194, 0.04919230761206759, 0.22482238957491063, 0.12856511225277978, 0.24895032351368399, -0.41865169161790483, -0.1557032192696727, 0.021359766825973507, 0.159796435613766, 0.04097432475123975, -0.04710985741124899, -0.33567925453967146, 0.07272286643868722, -0.14206643601776323, -0.1581379578809344, 0.05471838082725768, 0.08339164607409608, -0.001951885817732702, -0.26036076972972083, 0.07356701058245474, 0.020185313417084304, 0.11898184229459574, -0.11361085313625173, -0.12690320214311723, -0.030338932924042706, 0.08046576219187769, 0.02062537260253423, 0.11440075751924787, 0.13338938290635075, -0.11540293787050271, -0.07996722371117161, 0.36094321843026383, -0.09756562304970938, -0.027501480877950228, 0.2406736640499026, -0.2514653200113405, -0.15744514734188836, 0.16016487456277334, 0.16896468170878468, 0.09052605630319205, -0.14156701147145723, 0.006624919960090029, -0.07885587109147661, 0.2006871149980373, 0.0726690530070975, 0.037330851114044585, 0.36393247376526555, 0.15210131634908017, 0.07237652998345012, 0.09365270872317474, -0.2694276428747965, -0.07539233685501161, -0.20933935724909827, -0.07399354279116396, -0.11347942925508946, -0.00017722731804154732, -0.11949978136161457, -0.06599991269890339, 0.34548692474321974, 0.11225457043419541, 0.24977656135771184, 0.02826777534327477, 0.32508658434474663, 0.03906490133326721, 0.11108595909555793, 0.10617514666149853, 0.35673299876432263, 0.09548315499353432, 0.05998662226490416, -0.21751069365149384, 0.08583519534303016, -0.044899739585572765]
|
1,803.06777
|
Dual-phase-modulated plug-and-play measurement-device-independent
continuous-variable quantum key distribution
|
We suggest an improved plug-and-play measurement-device-independent (MDI)
continuous-variable quantum key distribution (CVQKD) via the dual-phase
modulation (DPM), aiming to solve an implementation problem with no extra
performance penalty. The synchronous loophole of different lasers from Alice
and Bob can be elegantly eliminated in the plug-and-play configuration, which
gives birth to the convenient implementation when comparing to the
Gaussian-modulated coherent-state protocol. While the local oscillator (LO) can
be locally generated by the trusted part Charlie, the LO-aimed attacks can be
accurately detected in the data post-processing. We derive the security bounds
of the DPM-based MDI-CVQKD against optimal Gaussian collective attacks. Taking
the finite-size effect into account, the secret key rate can be increased due
to the fact that almost all raw keys of the MDI-CVQKD system can be fully
exploited for the final secret key generation without sacrificing raw keys in
parameter estimation. Moreover, we give an experimental concept of the proposed
scheme which can be deemed guideline for final implementation.
|
quant-ph
|
we suggest an improved plugandplay measurementdeviceindependent mdi continuousvariable quantum key distribution cvqkd via the dualphase modulation dpm aiming to solve an implementation problem with no extra performance penalty the synchronous loophole of different lasers from alice and bob can be elegantly eliminated in the plugandplay configuration which gives birth to the convenient implementation when comparing to the gaussianmodulated coherentstate protocol while the local oscillator lo can be locally generated by the trusted part charlie the loaimed attacks can be accurately detected in the data postprocessing we derive the security bounds of the dpmbased mdicvqkd against optimal gaussian collective attacks taking the finitesize effect into account the secret key rate can be increased due to the fact that almost all raw keys of the mdicvqkd system can be fully exploited for the final secret key generation without sacrificing raw keys in parameter estimation moreover we give an experimental concept of the proposed scheme which can be deemed guideline for final implementation
|
[['we', 'suggest', 'an', 'improved', 'plugandplay', 'measurementdeviceindependent', 'mdi', 'continuousvariable', 'quantum', 'key', 'distribution', 'cvqkd', 'via', 'the', 'dualphase', 'modulation', 'dpm', 'aiming', 'to', 'solve', 'an', 'implementation', 'problem', 'with', 'no', 'extra', 'performance', 'penalty', 'the', 'synchronous', 'loophole', 'of', 'different', 'lasers', 'from', 'alice', 'and', 'bob', 'can', 'be', 'elegantly', 'eliminated', 'in', 'the', 'plugandplay', 'configuration', 'which', 'gives', 'birth', 'to', 'the', 'convenient', 'implementation', 'when', 'comparing', 'to', 'the', 'gaussianmodulated', 'coherentstate', 'protocol', 'while', 'the', 'local', 'oscillator', 'lo', 'can', 'be', 'locally', 'generated', 'by', 'the', 'trusted', 'part', 'charlie', 'the', 'loaimed', 'attacks', 'can', 'be', 'accurately', 'detected', 'in', 'the', 'data', 'postprocessing', 'we', 'derive', 'the', 'security', 'bounds', 'of', 'the', 'dpmbased', 'mdicvqkd', 'against', 'optimal', 'gaussian', 'collective', 'attacks', 'taking', 'the', 'finitesize', 'effect', 'into', 'account', 'the', 'secret', 'key', 'rate', 'can', 'be', 'increased', 'due', 'to', 'the', 'fact', 'that', 'almost', 'all', 'raw', 'keys', 'of', 'the', 'mdicvqkd', 'system', 'can', 'be', 'fully', 'exploited', 'for', 'the', 'final', 'secret', 'key', 'generation', 'without', 'sacrificing', 'raw', 'keys', 'in', 'parameter', 'estimation', 'moreover', 'we', 'give', 'an', 'experimental', 'concept', 'of', 'the', 'proposed', 'scheme', 'which', 'can', 'be', 'deemed', 'guideline', 'for', 'final', 'implementation']]
|
[-0.13867809931234193, 0.0832833306193583, -0.1282694643118586, 0.04692368698978008, -0.0341187425596544, -0.25602146461367226, 0.06702226117471209, 0.3560940219172969, -0.292822120023163, -0.3116447458592936, 0.08820965087103944, -0.20072944181111568, -0.0719443695494332, 0.23232636645060176, -0.13977462459260073, 0.12483796245308043, 0.056687574091856964, -0.022657295194967914, -0.024741758205868207, -0.29381906832434024, 0.2838820217592188, 0.11529992071938558, 0.3399840137616803, 0.028822842116754215, 0.08472546539344013, 0.0388681893565286, -0.007655181524266179, -0.07031480896134432, -0.05484329688218937, 0.07786886359770925, 0.29407011522935367, 0.15799295892103168, 0.26371764795084557, -0.4298651267099791, -0.19198613192659253, 0.13979714556943434, 0.17417133138186705, 0.18220534559804946, -0.039359495313151575, -0.36967139922004816, 0.10905159372972169, -0.2434796688075249, -0.08976281620562077, -0.10999227035865307, -0.10607981037658949, -0.011101335385972515, -0.3130120391933582, 0.018022927855595183, 0.03861809893248555, -0.001313422508060168, 0.01105260284533963, -0.06102087046019733, 0.00017483054827421138, 0.18902874008087495, -0.03695264586713165, 0.015382881480036303, 0.1521048757784182, -0.07088193190522873, -0.14022567284365112, 0.33932917186608297, -0.056231441526996113, -0.2115107225481785, 0.06557725198590794, -0.0635843274410432, -0.08733757387381047, 0.11548159712662873, 0.17781965433655736, 0.04398597444509132, -0.18174085947462934, -0.0004092995679970138, 0.00031190456670279114, 0.24395963797966638, 0.04234116837883798, 0.1151826358840574, 0.1622719113395597, 0.11169421426110113, 0.07223613781463474, 0.15396377182146237, -0.08982409938210204, -0.12263610119967219, -0.2989907846890557, -0.16461648603674406, -0.2221209612034727, 0.02185874431205985, -0.09882802909935261, -0.0574581740977756, 0.37297202391147993, 0.1978219641993443, 0.14154074920747334, -0.0014706102531188382, 0.41118931854054186, 0.09709834467727117, 0.08228093598415562, 0.12847105679938045, 0.24514380836775765, 0.0678674644829395, 0.06324052876488377, -0.21203736546419513, 0.16488087876067042, 0.025927333449288152]
|
1,803.06778
|
Weighted composition operator on quaternionic Fock space
|
In this paper, we study the weighted composition operator on the Fock space
$\mf$ of slice regular functions. First, we characterize the boundedness and
compactness of the weighted composition operator. Subsequently, we describe all
the isometric composition operators. Finally, we introduce a kind of
(right)-anti-complex-linear weighted composition operator on $\mf$ and obtain
some concrete forms such that this (right)-anti-linear weighted composition
operator is a (right)-conjugation. Specially, we present equivalent conditions
ensuring weighted composition operators which are conjugate
$\mathcal{C}_{a,b,c}-$commuting or complex $\mathcal{C}_{a,b,c}-$ symmetric on
$\mf$, which generalized the classical results on $\mathcal{F}^2(\mathbb{C}).$
At last part of the paper, we exhibit the closed expression for the kernel
function of $\mf.$
|
math.FA
|
in this paper we study the weighted composition operator on the fock space mf of slice regular functions first we characterize the boundedness and compactness of the weighted composition operator subsequently we describe all the isometric composition operators finally we introduce a kind of rightanticomplexlinear weighted composition operator on mf and obtain some concrete forms such that this rightantilinear weighted composition operator is a rightconjugation specially we present equivalent conditions ensuring weighted composition operators which are conjugate mathcalc_abccommuting or complex mathcalc_abc symmetric on mf which generalized the classical results on mathcalf2mathbbc at last part of the paper we exhibit the closed expression for the kernel function of mf
|
[['in', 'this', 'paper', 'we', 'study', 'the', 'weighted', 'composition', 'operator', 'on', 'the', 'fock', 'space', 'mf', 'of', 'slice', 'regular', 'functions', 'first', 'we', 'characterize', 'the', 'boundedness', 'and', 'compactness', 'of', 'the', 'weighted', 'composition', 'operator', 'subsequently', 'we', 'describe', 'all', 'the', 'isometric', 'composition', 'operators', 'finally', 'we', 'introduce', 'a', 'kind', 'of', 'rightanticomplexlinear', 'weighted', 'composition', 'operator', 'on', 'mf', 'and', 'obtain', 'some', 'concrete', 'forms', 'such', 'that', 'this', 'rightantilinear', 'weighted', 'composition', 'operator', 'is', 'a', 'rightconjugation', 'specially', 'we', 'present', 'equivalent', 'conditions', 'ensuring', 'weighted', 'composition', 'operators', 'which', 'are', 'conjugate', 'mathcalc_abccommuting', 'or', 'complex', 'mathcalc_abc', 'symmetric', 'on', 'mf', 'which', 'generalized', 'the', 'classical', 'results', 'on', 'mathcalf2mathbbc', 'at', 'last', 'part', 'of', 'the', 'paper', 'we', 'exhibit', 'the', 'closed', 'expression', 'for', 'the', 'kernel', 'function', 'of', 'mf']]
|
[-0.09058652622807845, 0.10753377776720799, -0.07744317871116686, 0.11359677211650848, -0.07524563545388553, -0.01692794393930657, 0.012450337782045644, 0.41269270104228284, -0.3006417676076001, -0.19285688772523665, 0.12949530458004743, -0.2438831674117668, -0.20577044971972047, 0.14141768800989524, -0.0655693858382566, 0.010295980427341134, 0.061637762751357225, 0.10696542894869458, -0.17882858501409418, -0.22258047037073136, 0.4781471807874885, 0.0009393721223151421, 0.1997897325896238, 0.0626928785578439, 0.09775933228871402, 0.0392005741002732, -0.04161621090116016, -0.0030671179425268086, -0.16554107762881448, 0.15014996078303633, 0.18150698926811124, 0.143434221066498, 0.24356667323074505, -0.38530161810637104, -0.16172124064007007, 0.19380495713695006, 0.107352208026557, -0.044198872489562516, -0.04501864702130357, -0.24404981596322328, 0.11471932361988972, -0.15537347837679966, -0.1263853937693342, -0.09822296608905948, -0.06649313114273052, 0.058963330186373904, -0.27862809537270783, 0.051022370519372175, 0.11147705560513571, 0.05105127871730456, -0.17496464936080955, -0.13857335099429988, 0.024103368166834116, 0.10979768732224829, -0.07031758238479276, -0.003370555243272261, 0.08182342879145461, -0.04276320623352612, -0.053994720774319244, 0.2990966230772399, -0.10449811055007682, -0.2589612664956161, 0.13668113115572317, -0.15533574898818545, -0.1501070073504439, 0.0008313803221372997, 0.15899634574923446, 0.19340221871001026, -0.1523918985462218, 0.14429084703157308, -0.09155670786790057, 0.10458933169766348, 0.08484416531042799, 0.062147112668254505, 0.08551035498214118, 0.10479029961952976, 0.1660617157433401, 0.1837321449728573, 0.008672226982775564, -0.09645208549758821, -0.3450401547894466, -0.20522602807328688, -0.13057634952437022, 0.049356260656506994, -0.0916433411090539, -0.2556622255931371, 0.4569741097397591, 0.07046998147430428, 0.20959258373534562, 0.09651362453359087, 0.2587699169640009, 0.18877199489404173, 0.06864956087505847, 0.045461338045367714, 0.14181155420745056, 0.17098175684976227, 0.09073861791551405, -0.17553638339992247, 0.04301139487264057, 0.18931084703288825]
|
1,803.06779
|
A novel Dual Chiral Density Wave in nuclear matter based on a parity
doublet structure
|
We study the Dual Chiral Density Wave (DCDW) in nuclear matter using a
hadronic model with the parity doublet structure. We first extend the ordinary
DCDW ansatz so as to incorporate the effect of an explicit chiral symmetry
breaking. Then via numerically evaluating and minimizing the effective
potential, we determine the phase structure. We find, in addition to the
ordinary DCDW phase where the space average of the chiral condensate vanishes,
a new DCDW phase (sDCDW) with a nonvanishing space average depending on the
value of the chiral invariant mass parameter.
|
hep-ph nucl-th
|
we study the dual chiral density wave dcdw in nuclear matter using a hadronic model with the parity doublet structure we first extend the ordinary dcdw ansatz so as to incorporate the effect of an explicit chiral symmetry breaking then via numerically evaluating and minimizing the effective potential we determine the phase structure we find in addition to the ordinary dcdw phase where the space average of the chiral condensate vanishes a new dcdw phase sdcdw with a nonvanishing space average depending on the value of the chiral invariant mass parameter
|
[['we', 'study', 'the', 'dual', 'chiral', 'density', 'wave', 'dcdw', 'in', 'nuclear', 'matter', 'using', 'a', 'hadronic', 'model', 'with', 'the', 'parity', 'doublet', 'structure', 'we', 'first', 'extend', 'the', 'ordinary', 'dcdw', 'ansatz', 'so', 'as', 'to', 'incorporate', 'the', 'effect', 'of', 'an', 'explicit', 'chiral', 'symmetry', 'breaking', 'then', 'via', 'numerically', 'evaluating', 'and', 'minimizing', 'the', 'effective', 'potential', 'we', 'determine', 'the', 'phase', 'structure', 'we', 'find', 'in', 'addition', 'to', 'the', 'ordinary', 'dcdw', 'phase', 'where', 'the', 'space', 'average', 'of', 'the', 'chiral', 'condensate', 'vanishes', 'a', 'new', 'dcdw', 'phase', 'sdcdw', 'with', 'a', 'nonvanishing', 'space', 'average', 'depending', 'on', 'the', 'value', 'of', 'the', 'chiral', 'invariant', 'mass', 'parameter']]
|
[-0.1665099959406588, 0.21819181209058217, -0.1020286818060817, 0.06827660007919702, -0.10243241250928906, -0.0621522872036116, 0.03291148462643226, 0.32686779519750014, -0.21680309142296514, -0.2540860592905018, 0.053026368678547445, -0.2455877715566506, -0.15581870822546381, 0.013213644241396752, 0.08846248533162805, 0.046013122243392796, -0.09832597266003075, 0.0883910508102013, -0.19288837709464132, -0.1886854104542484, 0.3675586350158685, 0.00042688047720326316, 0.27562203492141435, 0.07947594430815015, 0.09551880868255264, 0.017055052120445502, 0.045854543868659274, -0.010876383312279359, -0.16119395775927436, 0.042796148577084143, 0.1670837942071052, -0.00493502750630594, 0.14143084112244347, -0.4282408096517126, -0.20727466436930828, 0.1469087872395499, 0.12718437982516156, 0.1707145442487672, -0.06092212539192082, -0.3288748794131809, 0.03896509507774479, -0.2207375654252246, -0.18585825579033957, -0.11655402402910921, -0.022330082301050425, -0.05441673704578231, -0.28540538075095456, 0.10480776802061074, -0.011212716996669769, 0.017034311075177458, -0.08008287748735812, -0.11991645246744156, -0.07498285662796762, 0.057319936989289194, 0.0729296832642932, 0.05840570173071077, 0.11295009308830939, -0.17888787167353762, -0.06461748809864123, 0.3912182379513979, -0.12249279472356041, -0.18524567022298774, 0.06955128928077303, -0.13141261715338462, -0.1266619462933805, 0.12944139770180402, 0.15578420397101178, 0.12040355867292318, -0.08352219257633098, 0.11513328918501631, -0.04131805046781665, 0.17739478207400275, 0.029979081307020452, 0.036657189143200715, 0.22653309393467175, 0.16048592555647095, 0.06690830344127284, 0.1508651939375947, -0.10057036319695827, -0.14370225305255088, -0.36026033341056773, -0.1514510490000248, -0.17848995862942602, 0.017186109872192094, -0.06776398692988247, -0.15301845636115305, 0.4146127371220953, 0.13142053437315757, 0.23556132977828384, -0.012070194916385743, 0.28961349388894936, 0.16040492142524776, 0.04588677961793211, 0.0431380453829964, 0.2738372445416947, 0.1629747176128957, 0.05073580487126795, -0.3355215730714715, -0.02258568859866096, 0.11660560049478792]
|
1,803.0678
|
Giant photoinduced lattice distortion in oxygen-vacancy ordered SrCoO2.5
thin films
|
Despite of the tremendous efforts spent on the oxygen vacancy migration in
determining the property optimization of oxygen-vacancy enrichment transition
metal oxides, few has focused on their dynamic behaviors non-equilibrium
states. In this work, we performed multi-timescale ultrafast X-ray diffraction
measurements by using picosecond synchrotron X-ray pulses and femtosecond
table-top X-ray pulses to monitor the structural dynamics in the oxygen-vacancy
ordered SrCoO2.5 thin films. A giant photoinduced strain ({\Delta}c/c > 1%) was
observed, whose distinct correlation with the pump photon energy indicates a
non-thermal origin of the photoinduced strain. The sub-picosecond resolution
X-ray diffraction reveals the formation and propagation of the coherent
acoustic phonons inside the film. We also simulate the effect of photoexcited
electron-hole pairs and the resulting lattice changes using the Density
Function Theory method to obtain further insight on the microscopic mechanism
of the measured photostriction effect. Comparable photostrictive responses and
the strong dependence on excitation wavelength are predicted, revealing a
bonding to anti-bonding charge transfer or high spin to intermediate spin
crossover induced lattice expansion in the oxygen-vacancy films.
|
cond-mat.mtrl-sci
|
despite of the tremendous efforts spent on the oxygen vacancy migration in determining the property optimization of oxygenvacancy enrichment transition metal oxides few has focused on their dynamic behaviors nonequilibrium states in this work we performed multitimescale ultrafast xray diffraction measurements by using picosecond synchrotron xray pulses and femtosecond tabletop xray pulses to monitor the structural dynamics in the oxygenvacancy ordered srcoo25 thin films a giant photoinduced strain deltacc 1 was observed whose distinct correlation with the pump photon energy indicates a nonthermal origin of the photoinduced strain the subpicosecond resolution xray diffraction reveals the formation and propagation of the coherent acoustic phonons inside the film we also simulate the effect of photoexcited electronhole pairs and the resulting lattice changes using the density function theory method to obtain further insight on the microscopic mechanism of the measured photostriction effect comparable photostrictive responses and the strong dependence on excitation wavelength are predicted revealing a bonding to antibonding charge transfer or high spin to intermediate spin crossover induced lattice expansion in the oxygenvacancy films
|
[['despite', 'of', 'the', 'tremendous', 'efforts', 'spent', 'on', 'the', 'oxygen', 'vacancy', 'migration', 'in', 'determining', 'the', 'property', 'optimization', 'of', 'oxygenvacancy', 'enrichment', 'transition', 'metal', 'oxides', 'few', 'has', 'focused', 'on', 'their', 'dynamic', 'behaviors', 'nonequilibrium', 'states', 'in', 'this', 'work', 'we', 'performed', 'multitimescale', 'ultrafast', 'xray', 'diffraction', 'measurements', 'by', 'using', 'picosecond', 'synchrotron', 'xray', 'pulses', 'and', 'femtosecond', 'tabletop', 'xray', 'pulses', 'to', 'monitor', 'the', 'structural', 'dynamics', 'in', 'the', 'oxygenvacancy', 'ordered', 'srcoo25', 'thin', 'films', 'a', 'giant', 'photoinduced', 'strain', 'deltacc', '1', 'was', 'observed', 'whose', 'distinct', 'correlation', 'with', 'the', 'pump', 'photon', 'energy', 'indicates', 'a', 'nonthermal', 'origin', 'of', 'the', 'photoinduced', 'strain', 'the', 'subpicosecond', 'resolution', 'xray', 'diffraction', 'reveals', 'the', 'formation', 'and', 'propagation', 'of', 'the', 'coherent', 'acoustic', 'phonons', 'inside', 'the', 'film', 'we', 'also', 'simulate', 'the', 'effect', 'of', 'photoexcited', 'electronhole', 'pairs', 'and', 'the', 'resulting', 'lattice', 'changes', 'using', 'the', 'density', 'function', 'theory', 'method', 'to', 'obtain', 'further', 'insight', 'on', 'the', 'microscopic', 'mechanism', 'of', 'the', 'measured', 'photostriction', 'effect', 'comparable', 'photostrictive', 'responses', 'and', 'the', 'strong', 'dependence', 'on', 'excitation', 'wavelength', 'are', 'predicted', 'revealing', 'a', 'bonding', 'to', 'antibonding', 'charge', 'transfer', 'or', 'high', 'spin', 'to', 'intermediate', 'spin', 'crossover', 'induced', 'lattice', 'expansion', 'in', 'the', 'oxygenvacancy', 'films']]
|
[-0.11259934687201843, 0.23337047633195165, -0.07669527180524012, 0.054587092787314336, -0.031108871619433685, -0.07217757740101322, 0.09925919621885039, 0.47164535237649496, -0.28730134093094356, -0.28393866737957957, -0.022234314582906232, -0.3333574481698316, -0.08380960541788142, 0.17381504146236015, 0.07950997368573363, 0.027179815836229124, -0.018422052352730662, -0.11521758893125712, -0.06757645540854482, -0.15508736627106012, 0.24514240990419936, 0.07258064918548984, 0.35883216914547567, 0.12347719443388024, 0.08548008973255407, 0.016099610047815585, 0.060836183597593636, -0.04452143412903709, -0.1520315247403761, 0.08035937964793215, 0.23622424950075963, -0.0626124917965404, 0.20521372021446654, -0.4933036285517521, -0.2523236928729687, -0.016042843733123657, 0.13124731641285106, 0.13225993872782604, -0.09717831791711559, -0.25394565283136744, 0.011138995332361828, -0.12398841784898798, -0.11050870918417025, -0.044004801817801455, 0.0004192175300315369, 0.020082095921510657, -0.2187466175545164, 0.10275132945304882, 0.044758428462109597, 0.09576172667804586, -0.13078025802645052, -0.04079683967811857, -0.09123173535146295, 0.039085977249183196, 0.03876582749707754, 0.04274819724310493, 0.23542470185540962, -0.09868135380011789, -0.12665942382506706, 0.34641071198898, -0.04308099700760659, -0.01252067007319352, 0.17318058499070102, -0.24447982328951354, -0.05678496935721595, 0.23038640091477267, 0.1290370089727519, 0.14742452675628281, -0.1267244479738089, 0.010021131499237272, 0.03881115018495705, 0.23551888433339205, 0.11128955726599088, 0.11410880414633687, 0.24314374815087852, 0.23347402608555437, -0.010673114984414032, 0.14427908640936948, -0.14583936878642456, -0.02187651873912749, -0.1650371742827363, -0.08711069264025481, -0.20732549879006867, 0.12044178430589328, -0.06081228427620074, -0.17381793361828599, 0.4163184020489584, 0.0928174569985564, 0.13793352989481253, -0.07602318174471039, 0.25267013590200804, 0.10517536020339575, 0.043303488079610084, -0.020305654564655797, 0.2597193443121627, 0.18101902965044733, 0.1265917223030302, -0.3792661887933338, 0.11916594372163418, -0.006026827311955479]
|
1,803.06781
|
Orbital Stability Close to Asteroid 624 Hektor using the Polyhedral
Model
|
We investigate the orbital stability close to the unique L4-point Jupiter
binary Trojan asteroid 624 Hektor. The gravitational potential of 624 Hektor is
calculated using the polyhedron model with observational data of 2038 faces and
1021 vertexes. Previous studies have presented three different density values
for 624 Hektor. The equilibrium points in the gravitational potential of 624
Hektor with different density values have been studied in detail. There are
five equilibrium points in the gravitational potential of 624 Hektor no matter
the density value. The positions, Jacobian, eigenvalues, topological cases,
stability, as well as the Hessian matrix of the equilibrium points are
investigated. For the three different density values the number, topological
cases, and the stability of the equilibrium points with different density
values are the same. However, the positions of the equilibrium points vary with
the density value of the asteroid 624 Hektor. The outer equilibrium points move
away from the asteroid s mass center when the density increases, and the inner
equilibrium point moves close to the asteroid s mass center when the density
increases. There exist unstable periodic orbits near the surface of 624 Hektor.
We calculated an orbit near the primary s equatorial plane of this binary
Trojan asteroid, the results indicate that the orbit remains stable after
28.8375 d.
|
astro-ph.EP
|
we investigate the orbital stability close to the unique l4point jupiter binary trojan asteroid 624 hektor the gravitational potential of 624 hektor is calculated using the polyhedron model with observational data of 2038 faces and 1021 vertexes previous studies have presented three different density values for 624 hektor the equilibrium points in the gravitational potential of 624 hektor with different density values have been studied in detail there are five equilibrium points in the gravitational potential of 624 hektor no matter the density value the positions jacobian eigenvalues topological cases stability as well as the hessian matrix of the equilibrium points are investigated for the three different density values the number topological cases and the stability of the equilibrium points with different density values are the same however the positions of the equilibrium points vary with the density value of the asteroid 624 hektor the outer equilibrium points move away from the asteroid s mass center when the density increases and the inner equilibrium point moves close to the asteroid s mass center when the density increases there exist unstable periodic orbits near the surface of 624 hektor we calculated an orbit near the primary s equatorial plane of this binary trojan asteroid the results indicate that the orbit remains stable after 288375 d
|
[['we', 'investigate', 'the', 'orbital', 'stability', 'close', 'to', 'the', 'unique', 'l4point', 'jupiter', 'binary', 'trojan', 'asteroid', '624', 'hektor', 'the', 'gravitational', 'potential', 'of', '624', 'hektor', 'is', 'calculated', 'using', 'the', 'polyhedron', 'model', 'with', 'observational', 'data', 'of', '2038', 'faces', 'and', '1021', 'vertexes', 'previous', 'studies', 'have', 'presented', 'three', 'different', 'density', 'values', 'for', '624', 'hektor', 'the', 'equilibrium', 'points', 'in', 'the', 'gravitational', 'potential', 'of', '624', 'hektor', 'with', 'different', 'density', 'values', 'have', 'been', 'studied', 'in', 'detail', 'there', 'are', 'five', 'equilibrium', 'points', 'in', 'the', 'gravitational', 'potential', 'of', '624', 'hektor', 'no', 'matter', 'the', 'density', 'value', 'the', 'positions', 'jacobian', 'eigenvalues', 'topological', 'cases', 'stability', 'as', 'well', 'as', 'the', 'hessian', 'matrix', 'of', 'the', 'equilibrium', 'points', 'are', 'investigated', 'for', 'the', 'three', 'different', 'density', 'values', 'the', 'number', 'topological', 'cases', 'and', 'the', 'stability', 'of', 'the', 'equilibrium', 'points', 'with', 'different', 'density', 'values', 'are', 'the', 'same', 'however', 'the', 'positions', 'of', 'the', 'equilibrium', 'points', 'vary', 'with', 'the', 'density', 'value', 'of', 'the', 'asteroid', '624', 'hektor', 'the', 'outer', 'equilibrium', 'points', 'move', 'away', 'from', 'the', 'asteroid', 's', 'mass', 'center', 'when', 'the', 'density', 'increases', 'and', 'the', 'inner', 'equilibrium', 'point', 'moves', 'close', 'to', 'the', 'asteroid', 's', 'mass', 'center', 'when', 'the', 'density', 'increases', 'there', 'exist', 'unstable', 'periodic', 'orbits', 'near', 'the', 'surface', 'of', '624', 'hektor', 'we', 'calculated', 'an', 'orbit', 'near', 'the', 'primary', 's', 'equatorial', 'plane', 'of', 'this', 'binary', 'trojan', 'asteroid', 'the', 'results', 'indicate', 'that', 'the', 'orbit', 'remains', 'stable', 'after', '288375', 'd']]
|
[-0.15925200036199727, 0.14033565941143986, -0.12580094495041402, 0.04167960429089671, 0.043062326392896894, -0.06467628898153978, 0.03110698805924259, 0.29546819423448367, -0.21304361529665877, -0.31647558304709644, 0.07443822060963183, -0.34320846005158395, -0.055459050562689606, 0.1271456372144386, -0.02972887149783519, 0.10087500686371778, 0.09807660370595085, 0.03913611836593053, -0.09826125305053725, -0.20974108807408726, 0.30300331938098063, 0.06445500538969975, 0.15551233374571893, 0.020670406746607767, 0.03059987875441845, 0.0010600092926255937, 0.0645256145497046, -0.00536882375983177, -0.20935876090162603, 0.04655649839682979, 0.23273969653396392, 0.0636948666629768, 0.20462589823192795, -0.3433371229615625, -0.18455303997956743, 0.12439603387501161, 0.06160988692273298, 0.0556687582547794, -0.0441755979583557, -0.277854985158829, 0.1261896259274404, -0.19456045388657037, -0.2633759064099066, 0.015918145969923022, 0.1143389839288023, 0.0747719087433685, -0.2089411489020831, 0.10146990291475547, 0.003402171591143036, 0.10755097895491657, -0.16955763282350986, -0.251104507639231, -0.18485492388915517, 0.10927508435489935, 0.08350667330702187, 0.03578001442409279, 0.19851077269797898, -0.04818091486505988, -0.043395224438084044, 0.4006829820661191, -0.03135289275087416, -0.09435911861441608, 0.2162960405320913, -0.19435412041900046, -0.1013756694180456, 0.1982000302951695, 0.15705583900222028, 0.11703191406998502, -0.11257487065051704, 0.08154268813333782, -0.034788317557749394, 0.13950111226572431, 0.14956216368440403, -0.004982425001524565, 0.30863625557109153, 0.09170819755494243, 0.09979979856431766, 0.07618650384269268, -0.18396104246659098, -0.12592115545126978, -0.27004027776068673, -0.07299601213725389, -0.18707516584007228, 0.009567606492398554, -0.13348442365017002, -0.12409908340284673, 0.3709563885876944, 0.1192967747030604, 0.23881898243375616, -0.007822410456115767, 0.2521355339822377, 0.09775075928652922, 0.01660483089530454, 0.15580279613023554, 0.34148497005841116, 0.10432463199370277, 0.07530099819282526, -0.2320322722209209, 0.02312395858736533, 0.03241346510707067]
|
1,803.06782
|
White matter hyperintensity segmentation from T1 and FLAIR images using
fully convolutional neural networks enhanced with residual connections
|
Segmentation and quantification of white matter hyperintensities (WMHs) are
of great importance in studying and understanding various neurological and
geriatric disorders. Although automatic methods have been proposed for WMH
segmentation on magnetic resonance imaging (MRI), manual corrections are often
necessary to achieve clinically practical results. Major challenges for WMH
segmentation stem from their inhomogeneous MRI intensities, random location and
size distributions, and MRI noise. The presence of other brain anatomies or
diseases with enhanced intensities adds further difficulties. To cope with
these challenges, we present a specifically designed fully convolutional neural
network (FCN) with residual connections to segment WMHs by using combined T1
and fluid-attenuated inversion recovery (FLAIR) images. Our customized FCN is
designed to be straightforward and generalizable, providing efficient
end-to-end training due to its enhanced information propagation. We tested our
method on the open WMH Segmentation Challenge MICCAI2017 dataset, and, despite
our method's relative simplicity, results show that it performs amongst the
leading techniques across five metrics. More importantly, our method achieves
the best score for hausdorff distance and average volume difference in testing
datasets from two MRI scanners that were not included in training,
demonstrating better generalization ability of our proposed method over its
competitors.
|
cs.CV
|
segmentation and quantification of white matter hyperintensities wmhs are of great importance in studying and understanding various neurological and geriatric disorders although automatic methods have been proposed for wmh segmentation on magnetic resonance imaging mri manual corrections are often necessary to achieve clinically practical results major challenges for wmh segmentation stem from their inhomogeneous mri intensities random location and size distributions and mri noise the presence of other brain anatomies or diseases with enhanced intensities adds further difficulties to cope with these challenges we present a specifically designed fully convolutional neural network fcn with residual connections to segment wmhs by using combined t1 and fluidattenuated inversion recovery flair images our customized fcn is designed to be straightforward and generalizable providing efficient endtoend training due to its enhanced information propagation we tested our method on the open wmh segmentation challenge miccai2017 dataset and despite our methods relative simplicity results show that it performs amongst the leading techniques across five metrics more importantly our method achieves the best score for hausdorff distance and average volume difference in testing datasets from two mri scanners that were not included in training demonstrating better generalization ability of our proposed method over its competitors
|
[['segmentation', 'and', 'quantification', 'of', 'white', 'matter', 'hyperintensities', 'wmhs', 'are', 'of', 'great', 'importance', 'in', 'studying', 'and', 'understanding', 'various', 'neurological', 'and', 'geriatric', 'disorders', 'although', 'automatic', 'methods', 'have', 'been', 'proposed', 'for', 'wmh', 'segmentation', 'on', 'magnetic', 'resonance', 'imaging', 'mri', 'manual', 'corrections', 'are', 'often', 'necessary', 'to', 'achieve', 'clinically', 'practical', 'results', 'major', 'challenges', 'for', 'wmh', 'segmentation', 'stem', 'from', 'their', 'inhomogeneous', 'mri', 'intensities', 'random', 'location', 'and', 'size', 'distributions', 'and', 'mri', 'noise', 'the', 'presence', 'of', 'other', 'brain', 'anatomies', 'or', 'diseases', 'with', 'enhanced', 'intensities', 'adds', 'further', 'difficulties', 'to', 'cope', 'with', 'these', 'challenges', 'we', 'present', 'a', 'specifically', 'designed', 'fully', 'convolutional', 'neural', 'network', 'fcn', 'with', 'residual', 'connections', 'to', 'segment', 'wmhs', 'by', 'using', 'combined', 't1', 'and', 'fluidattenuated', 'inversion', 'recovery', 'flair', 'images', 'our', 'customized', 'fcn', 'is', 'designed', 'to', 'be', 'straightforward', 'and', 'generalizable', 'providing', 'efficient', 'endtoend', 'training', 'due', 'to', 'its', 'enhanced', 'information', 'propagation', 'we', 'tested', 'our', 'method', 'on', 'the', 'open', 'wmh', 'segmentation', 'challenge', 'miccai2017', 'dataset', 'and', 'despite', 'our', 'methods', 'relative', 'simplicity', 'results', 'show', 'that', 'it', 'performs', 'amongst', 'the', 'leading', 'techniques', 'across', 'five', 'metrics', 'more', 'importantly', 'our', 'method', 'achieves', 'the', 'best', 'score', 'for', 'hausdorff', 'distance', 'and', 'average', 'volume', 'difference', 'in', 'testing', 'datasets', 'from', 'two', 'mri', 'scanners', 'that', 'were', 'not', 'included', 'in', 'training', 'demonstrating', 'better', 'generalization', 'ability', 'of', 'our', 'proposed', 'method', 'over', 'its', 'competitors']]
|
[-0.0015809129785301949, 0.010753743350505829, -0.030508834414827036, 0.0876363524913003, -0.08277003010167612, -0.1737307077108263, -7.491929782790884e-05, 0.46749955151929773, -0.21166905892426668, -0.33545536840060336, 0.10584561825584535, -0.26998502326902324, -0.19470616530858662, 0.23819159756433503, -0.15390475313202834, 0.08970504723605109, 0.16195294576895608, 0.002928648071062484, -0.033661994780531994, -0.29205972623543314, 0.24838055410365653, 0.04061747862848685, 0.3671230849110271, 0.058041672839221445, 0.10539768897067887, -0.05727218561876698, -0.06802478757554542, 0.00924640526075559, -0.06510051348883963, 0.16435356380838692, 0.31828588426117854, 0.17717925462810333, 0.316755386019778, -0.4193332982084095, -0.24886654335639066, 0.07773956789299467, 0.15661555646474326, 0.0924232678005837, -0.05643495541518887, -0.364620783504543, 0.11619452644744652, -0.12240407562478998, -0.01816419931808203, -0.17166652703104626, -0.030329762371186033, -0.034705147816714486, -0.2969038935465653, 0.12855920642330712, 0.054071260088066946, 0.09101637498261986, -0.08442008718410933, -0.1295539401707991, 0.019890953304463534, 0.19065296993033043, 0.04297173682595532, 0.0847416438468434, 0.15243940876246084, -0.1808785456407054, -0.12462532546827428, 0.31529627162472673, -0.005302668968688337, -0.19702571428553461, 0.22541656461426146, -0.08311170549530815, -0.11801581166928095, 0.16300012076717948, 0.1850229245114145, 0.08979139730853128, -0.14465800355375286, -0.03438941732806575, 0.059907083058030094, 0.16799609507918642, 0.0653427845377683, -0.01349197625452038, 0.14075832771903216, 0.25427366421749426, 0.0010138353419154504, 0.11093449594422249, -0.20285732431932907, -0.03585548949047337, -0.17830168222240292, -0.10056404983193429, -0.16090824444622256, -0.04545652857639763, -0.09478271834522446, -0.15136969155575228, 0.39574230961066664, 0.2556112205338142, 0.14486491530991827, 0.06987651417296034, 0.37068094067313345, -0.033120458980202015, 0.14773151475042673, 0.05334893538413314, 0.19526394565180796, 0.08288060458433734, 0.08807464958928515, -0.21325296002823085, 0.10823305648353262, 0.015694426404558086]
|
1,803.06783
|
Low Rank Matrix Approximation for Geometry Filtering
|
We propose a robust normal estimation method for both point clouds and meshes
using a low rank matrix approximation algorithm. First, we compute a local
feature descriptor for each point and find similar, non-local neighbors that we
organize into a matrix. We then show that a low rank matrix approximation
algorithm can robustly estimate normals for both point clouds and meshes.
Furthermore, we provide a new filtering method for point cloud data to smooth
the position data to fit the estimated normals. We show applications of our
method to point cloud filtering, point set upsampling, surface reconstruction,
mesh denoising, and geometric texture removal. Our experiments show that our
method outperforms current methods in both visual quality and accuracy.
|
cs.GR
|
we propose a robust normal estimation method for both point clouds and meshes using a low rank matrix approximation algorithm first we compute a local feature descriptor for each point and find similar nonlocal neighbors that we organize into a matrix we then show that a low rank matrix approximation algorithm can robustly estimate normals for both point clouds and meshes furthermore we provide a new filtering method for point cloud data to smooth the position data to fit the estimated normals we show applications of our method to point cloud filtering point set upsampling surface reconstruction mesh denoising and geometric texture removal our experiments show that our method outperforms current methods in both visual quality and accuracy
|
[['we', 'propose', 'a', 'robust', 'normal', 'estimation', 'method', 'for', 'both', 'point', 'clouds', 'and', 'meshes', 'using', 'a', 'low', 'rank', 'matrix', 'approximation', 'algorithm', 'first', 'we', 'compute', 'a', 'local', 'feature', 'descriptor', 'for', 'each', 'point', 'and', 'find', 'similar', 'nonlocal', 'neighbors', 'that', 'we', 'organize', 'into', 'a', 'matrix', 'we', 'then', 'show', 'that', 'a', 'low', 'rank', 'matrix', 'approximation', 'algorithm', 'can', 'robustly', 'estimate', 'normals', 'for', 'both', 'point', 'clouds', 'and', 'meshes', 'furthermore', 'we', 'provide', 'a', 'new', 'filtering', 'method', 'for', 'point', 'cloud', 'data', 'to', 'smooth', 'the', 'position', 'data', 'to', 'fit', 'the', 'estimated', 'normals', 'we', 'show', 'applications', 'of', 'our', 'method', 'to', 'point', 'cloud', 'filtering', 'point', 'set', 'upsampling', 'surface', 'reconstruction', 'mesh', 'denoising', 'and', 'geometric', 'texture', 'removal', 'our', 'experiments', 'show', 'that', 'our', 'method', 'outperforms', 'current', 'methods', 'in', 'both', 'visual', 'quality', 'and', 'accuracy']]
|
[-0.03839252354040489, -0.05611970948876213, -0.13909379942974043, 0.06010854307668662, -0.045085250597320874, -0.14836954663239293, 0.08508038977792455, 0.47204747530868496, -0.30407473560170095, -0.2815799533421079, 0.0943087346731464, -0.2703214035945613, -0.2213421711067756, 0.1366885194902198, -0.08816037644332243, 0.0779167238259846, 0.12661838642384668, -0.022572750622017895, -0.1398876067586401, -0.248632662250834, 0.29465322719760617, 0.0009478500499626842, 0.32286179769721074, 0.03136442638085208, 0.1589546947428262, -0.016039074424228045, -0.04287407942948926, 0.040005500775651404, -0.06428650690343031, 0.14140855862514384, 0.2564213397218135, 0.14361995708007932, 0.2322475283201468, -0.39228027784344505, -0.21991476160079493, 0.0871839469685456, 0.13318528292574366, 0.1402757402541021, -0.10966165524994229, -0.29378430966792973, 0.14805152591602025, -0.12793795377315986, -0.09803466899399409, -0.19394535092060786, -0.04518455346470099, -0.002521785276042203, -0.3567703212848154, 0.0644373665031014, 0.030374003728157132, 0.030366775295618226, -0.08180970834347151, -0.15656262614085512, 0.013870572473980108, 0.1105143171261554, -0.05238756616757709, 0.05323379831309667, 0.16836407731787373, -0.12937184448464442, -0.06879540771972072, 0.37737697650189117, -0.07586910576417537, -0.2426007149634504, 0.18030712683290495, -0.09744435445784386, -0.13638231933306336, 0.12696958813121764, 0.2354595318902284, 0.13526627323165993, -0.1185204843434079, 0.0216776886974635, -0.05421970794135231, 0.15995137938801435, 0.03870332463431346, -0.06016859199883322, 0.16042234601010963, 0.16597214161213172, 0.1681322339464421, 0.09691484689503371, -0.21742657990336922, -0.04709016809524116, -0.26014339998048747, -0.14045284910253802, -0.23608521205152116, -0.06991578053319984, -0.19557582404229187, -0.18954769061815183, 0.38688248174928, 0.24203911161255406, 0.259720839449536, 0.08849441683732794, 0.3799482089925115, 0.0801683274884284, 0.036351249679544215, 0.14520069973353864, 0.13031250529654198, 0.039690243182861705, 0.030246246266731266, -0.16393631424999527, 0.023178685546292276, 0.1562651734842556]
|
1,803.06784
|
TOMAAT: volumetric medical image analysis as a cloud service
|
Deep learning has been recently applied to a multitude of computer vision and
medical image analysis problems. Although recent research efforts have improved
the state of the art, most of the methods cannot be easily accessed, compared
or used by either researchers or the general public. Researchers often publish
their code and trained models on the internet, but this does not always enable
these approaches to be easily used or integrated in stand-alone applications
and existing workflows. In this paper we propose a framework which allows easy
deployment and access of deep learning methods for segmentation through a
cloud-based architecture. Our approach comprises three parts: a server, which
wraps trained deep learning models and their pre- and post-processing data
pipelines and makes them available on the cloud; a client which interfaces with
the server to obtain predictions on user data; a service registry that informs
clients about available prediction endpoints that are available in the cloud.
These three parts constitute the open-source TOMAAT framework.
|
cs.CV cs.DC
|
deep learning has been recently applied to a multitude of computer vision and medical image analysis problems although recent research efforts have improved the state of the art most of the methods cannot be easily accessed compared or used by either researchers or the general public researchers often publish their code and trained models on the internet but this does not always enable these approaches to be easily used or integrated in standalone applications and existing workflows in this paper we propose a framework which allows easy deployment and access of deep learning methods for segmentation through a cloudbased architecture our approach comprises three parts a server which wraps trained deep learning models and their pre and postprocessing data pipelines and makes them available on the cloud a client which interfaces with the server to obtain predictions on user data a service registry that informs clients about available prediction endpoints that are available in the cloud these three parts constitute the opensource tomaat framework
|
[['deep', 'learning', 'has', 'been', 'recently', 'applied', 'to', 'a', 'multitude', 'of', 'computer', 'vision', 'and', 'medical', 'image', 'analysis', 'problems', 'although', 'recent', 'research', 'efforts', 'have', 'improved', 'the', 'state', 'of', 'the', 'art', 'most', 'of', 'the', 'methods', 'can', 'not', 'be', 'easily', 'accessed', 'compared', 'or', 'used', 'by', 'either', 'researchers', 'or', 'the', 'general', 'public', 'researchers', 'often', 'publish', 'their', 'code', 'and', 'trained', 'models', 'on', 'the', 'internet', 'but', 'this', 'does', 'not', 'always', 'enable', 'these', 'approaches', 'to', 'be', 'easily', 'used', 'or', 'integrated', 'in', 'standalone', 'applications', 'and', 'existing', 'workflows', 'in', 'this', 'paper', 'we', 'propose', 'a', 'framework', 'which', 'allows', 'easy', 'deployment', 'and', 'access', 'of', 'deep', 'learning', 'methods', 'for', 'segmentation', 'through', 'a', 'cloudbased', 'architecture', 'our', 'approach', 'comprises', 'three', 'parts', 'a', 'server', 'which', 'wraps', 'trained', 'deep', 'learning', 'models', 'and', 'their', 'pre', 'and', 'postprocessing', 'data', 'pipelines', 'and', 'makes', 'them', 'available', 'on', 'the', 'cloud', 'a', 'client', 'which', 'interfaces', 'with', 'the', 'server', 'to', 'obtain', 'predictions', 'on', 'user', 'data', 'a', 'service', 'registry', 'that', 'informs', 'clients', 'about', 'available', 'prediction', 'endpoints', 'that', 'are', 'available', 'in', 'the', 'cloud', 'these', 'three', 'parts', 'constitute', 'the', 'opensource', 'tomaat', 'framework']]
|
[-0.05366347019032507, -0.031681728647260855, -0.10744213770149366, 0.03836439163906772, -0.1369638629484831, -0.22858453040556392, 0.05353352313977666, 0.44713740643659017, -0.24947991588780452, -0.36066507295955247, 0.141220786224727, -0.26144694150917064, -0.11410884215729311, 0.22917041365517213, -0.09578565761685462, 0.10371361385886103, 0.1579531319524593, 0.03565513755467425, -0.021574704555749166, -0.3164905229435734, 0.26919655559411293, 0.02473976373443204, 0.3630113036246834, 0.054822334446149264, 0.04953163996389953, -0.024947982550479426, -0.06888981560449593, -0.015477570054893633, -0.08474174468600966, 0.20911614362451406, 0.36469665828655884, 0.2390220378931589, 0.32022978281659054, -0.4761057490164914, -0.21481285138884787, 0.06283546721551386, 0.17963835763710936, 0.09901273335974732, -0.04062205450978448, -0.3347298169392161, 0.06167605511202454, -0.23108085668532224, -0.01625392519266958, -0.1235927430225718, -0.044124418512915216, -0.007778711139974071, -0.26172865784113725, -0.03404895905632435, -0.00026974524797235684, 0.06612296200573171, -0.030434436480324466, -0.1015682553953389, 0.02099017990134066, 0.20096204205694404, 0.01735858842957674, 0.07097734907562504, 0.16934663389323892, -0.16273122117570715, -0.1383214625501551, 0.3679256544153138, -0.0074555648138701185, -0.1735690509880575, 0.2553721602960694, 0.011837948738347466, -0.1706368833604246, 0.07666001502969642, 0.24380582252733138, 0.10401857394736441, -0.21009299288810482, 0.056402850100023834, 0.0077445427773565785, 0.18404398684350137, 0.004270342090621409, -0.025277641205409564, 0.2289359026614054, 0.19133938884322826, 0.002417736598389882, 0.0993695033120741, -0.07629061635976186, -0.07818876815925739, -0.19146899628543818, -0.1325480646990444, -0.17784789376948937, -0.02596454419214818, -0.041796227964723806, -0.1637240761845577, 0.3723242204954348, 0.23670191662215695, 0.14186154324674932, 0.03467851316360416, 0.39912335406534555, -0.003023506450983582, 0.1995796906256412, 0.15954963642558673, 0.17344976051301672, -0.022779531187729955, 0.2000278189739996, -0.0891172259466768, 0.11841687969735643, -0.010627985604514834]
|
1,803.06785
|
Multiple jets and $\gamma$-jet correlation in high-energy heavy-ion
collisions
|
$\gamma$-jet production is considered one of the best probes of the hot
quark-gluon plasma in high-energy heavy-ion collisions since the direct
$\gamma$ can be used to gauge the initial energy and momentum of the associated
jet. This is investigated within the Linear Boltzmann Transport (LBT) model for
jet propagation and jet-induced medium excitation. With both parton energy loss
and medium response from jet-medium interaction included, LBT can describe
experimental data well on $\gamma$-jet correlation in Pb+Pb collisions at the
Large Hadron Collider. Multiple jets associated with direct $\gamma$ production
are found to contribute significantly to $\gamma$-jet correlation at small
$p_T^{\rm jet}<p_T^\gamma$ and large azimuthal angle relative to the opposite
direction of $\gamma$. Jet medium interaction not only suppresses the leading
jet at large $p_T^{\rm jet}$ but also sub-leading jets at large azimuthal
angle. This effectively leads to the narrowing of $\gamma$-jet correlation in
azimuthal angle instead of broadening due to jet-medium interaction. The
$\gamma$-jet profile on the other hand will be broadened due to jet-medium
interaction and jet-induced medium response. Energy flow measurements relative
to the direct photon is illustrated to reflect well the broadening and
jet-induced medium response.
|
hep-ph
|
gammajet production is considered one of the best probes of the hot quarkgluon plasma in highenergy heavyion collisions since the direct gamma can be used to gauge the initial energy and momentum of the associated jet this is investigated within the linear boltzmann transport lbt model for jet propagation and jetinduced medium excitation with both parton energy loss and medium response from jetmedium interaction included lbt can describe experimental data well on gammajet correlation in pbpb collisions at the large hadron collider multiple jets associated with direct gamma production are found to contribute significantly to gammajet correlation at small p_trm jetp_tgamma and large azimuthal angle relative to the opposite direction of gamma jet medium interaction not only suppresses the leading jet at large p_trm jet but also subleading jets at large azimuthal angle this effectively leads to the narrowing of gammajet correlation in azimuthal angle instead of broadening due to jetmedium interaction the gammajet profile on the other hand will be broadened due to jetmedium interaction and jetinduced medium response energy flow measurements relative to the direct photon is illustrated to reflect well the broadening and jetinduced medium response
|
[['gammajet', 'production', 'is', 'considered', 'one', 'of', 'the', 'best', 'probes', 'of', 'the', 'hot', 'quarkgluon', 'plasma', 'in', 'highenergy', 'heavyion', 'collisions', 'since', 'the', 'direct', 'gamma', 'can', 'be', 'used', 'to', 'gauge', 'the', 'initial', 'energy', 'and', 'momentum', 'of', 'the', 'associated', 'jet', 'this', 'is', 'investigated', 'within', 'the', 'linear', 'boltzmann', 'transport', 'lbt', 'model', 'for', 'jet', 'propagation', 'and', 'jetinduced', 'medium', 'excitation', 'with', 'both', 'parton', 'energy', 'loss', 'and', 'medium', 'response', 'from', 'jetmedium', 'interaction', 'included', 'lbt', 'can', 'describe', 'experimental', 'data', 'well', 'on', 'gammajet', 'correlation', 'in', 'pbpb', 'collisions', 'at', 'the', 'large', 'hadron', 'collider', 'multiple', 'jets', 'associated', 'with', 'direct', 'gamma', 'production', 'are', 'found', 'to', 'contribute', 'significantly', 'to', 'gammajet', 'correlation', 'at', 'small', 'p_trm', 'jetp_tgamma', 'and', 'large', 'azimuthal', 'angle', 'relative', 'to', 'the', 'opposite', 'direction', 'of', 'gamma', 'jet', 'medium', 'interaction', 'not', 'only', 'suppresses', 'the', 'leading', 'jet', 'at', 'large', 'p_trm', 'jet', 'but', 'also', 'subleading', 'jets', 'at', 'large', 'azimuthal', 'angle', 'this', 'effectively', 'leads', 'to', 'the', 'narrowing', 'of', 'gammajet', 'correlation', 'in', 'azimuthal', 'angle', 'instead', 'of', 'broadening', 'due', 'to', 'jetmedium', 'interaction', 'the', 'gammajet', 'profile', 'on', 'the', 'other', 'hand', 'will', 'be', 'broadened', 'due', 'to', 'jetmedium', 'interaction', 'and', 'jetinduced', 'medium', 'response', 'energy', 'flow', 'measurements', 'relative', 'to', 'the', 'direct', 'photon', 'is', 'illustrated', 'to', 'reflect', 'well', 'the', 'broadening', 'and', 'jetinduced', 'medium', 'response']]
|
[-0.09365059306567654, 0.2318147169128853, -0.13018201108021227, 0.1522574004961148, -0.08518639181126306, -0.0957411877969478, -0.07187016377847226, 0.41470631261534513, -0.2722718446030024, -0.2951379489609377, -0.05719231619645762, -0.3223488453399152, 0.08348326893780936, 0.13927287636993532, 0.07268206202152601, 0.05593051072804535, 0.09983348504001116, -0.05682898749736078, -0.0006737997383095988, -0.12370021066856274, 0.32857620483759714, 0.1713000374506822, 0.2526723705281682, 0.2000920894986732, 0.06356568179066055, 0.07347687851870432, -0.08172501649823971, 0.025381535997594448, -0.08618991762086033, 0.0031170777563486207, 0.23448472817681057, -0.017233563523908008, 0.14926459933950026, -0.3836075505192213, -0.1646274506916946, 0.05178064079162605, 0.17320371052483097, 0.07830342656358126, -0.0351688803803359, -0.22957079046148252, 0.027540903748384617, -0.2583476176146081, -0.15720669209196708, -0.016838559199699222, -0.031361391816159434, 0.034822427559931306, -0.2946973337786906, 0.15090188684367373, -0.036064246561278546, 0.021364986470484352, 0.014215862141932024, -0.10975321065238182, -0.1001902398915882, 0.021022565529107095, 0.13781066537039613, 0.12141248899229624, 0.22464998305448272, -0.20029503335566953, -0.10086371409217579, 0.4118884133492061, -0.034493739896285486, -0.12611983410711897, 0.22597286440283457, -0.2697391954919093, -0.08720153494567134, 0.22938398232663723, 0.28986340028844076, 0.056373807359821206, -0.1320577667099721, -0.02835015503335447, -0.0026975335835657537, 0.15951820039140813, 0.0664173150413417, 0.10502196606397232, 0.1954380123915666, 0.13353492061488648, -0.009864608360890379, 0.08708333281429852, -0.14033840694328512, -0.044731308720966284, -0.3503180137575985, -0.05751736004009565, -0.13205693259542967, 0.05257284859923876, -0.09736239919754766, -0.07866507324023529, 0.37982783648383583, 0.09437282300465047, 0.2426254865540033, -0.05875360303399886, 0.32447901525178013, 0.10116789548873327, 0.07012742188554183, 0.1216895934085187, 0.3467514351325511, 0.1690653462862061, 0.2061217560660728, -0.31113479561122886, 0.10701336148640815, 0.01995615803814949]
|
1,803.06786
|
The Optimal Compression Rate of Variable-to-Fixed Length Source Coding
with a Non-Vanishing Excess-Distortion Probability
|
We consider the variable-to-fixed length lossy source coding (VFSC) problem.
The optimal compression rate of the average length of variable-to-fixed source
coding, allowing a non-vanishing probability of excess-distortion
$\varepsilon$, is shown to be equal to $(1-\varepsilon)R(D)$, where $R(D)$ is
the rate-distortion function of the source. In comparison to the related
results of Koga and Yamamoto as well as Kostina, Polyanskiy, and Verd\'{u} for
fixed-to-variable length source coding, our results demonstrate an interesting
feature that variable-to-fixed length source coding has the same first-order
compression rate as fixed-to-variable length source coding.
|
cs.IT math.IT
|
we consider the variabletofixed length lossy source coding vfsc problem the optimal compression rate of the average length of variabletofixed source coding allowing a nonvanishing probability of excessdistortion varepsilon is shown to be equal to 1varepsilonrd where rd is the ratedistortion function of the source in comparison to the related results of koga and yamamoto as well as kostina polyanskiy and verdu for fixedtovariable length source coding our results demonstrate an interesting feature that variabletofixed length source coding has the same firstorder compression rate as fixedtovariable length source coding
|
[['we', 'consider', 'the', 'variabletofixed', 'length', 'lossy', 'source', 'coding', 'vfsc', 'problem', 'the', 'optimal', 'compression', 'rate', 'of', 'the', 'average', 'length', 'of', 'variabletofixed', 'source', 'coding', 'allowing', 'a', 'nonvanishing', 'probability', 'of', 'excessdistortion', 'varepsilon', 'is', 'shown', 'to', 'be', 'equal', 'to', '1varepsilonrd', 'where', 'rd', 'is', 'the', 'ratedistortion', 'function', 'of', 'the', 'source', 'in', 'comparison', 'to', 'the', 'related', 'results', 'of', 'koga', 'and', 'yamamoto', 'as', 'well', 'as', 'kostina', 'polyanskiy', 'and', 'verdu', 'for', 'fixedtovariable', 'length', 'source', 'coding', 'our', 'results', 'demonstrate', 'an', 'interesting', 'feature', 'that', 'variabletofixed', 'length', 'source', 'coding', 'has', 'the', 'same', 'firstorder', 'compression', 'rate', 'as', 'fixedtovariable', 'length', 'source', 'coding']]
|
[-0.17190003435625212, 0.05483085928292779, -0.05293872089114511, 0.0605956227491856, -9.696872305424735e-05, -0.22896671251811343, 0.06471627177777646, 0.37236211740079966, -0.3346369927641989, -0.20190793331498388, 0.13230940408271405, -0.25777930754033485, -0.1092776967341016, 0.22208448692128577, -0.11948634656253217, 0.11552403999984949, -0.0321655087708228, 0.10744363472036932, -0.04302719215080998, -0.2615284264628272, 0.23687410129009392, 0.18734490375794555, 0.36004172057855405, 0.10178329084796467, 0.08885860570503035, 0.02080547304666098, -0.05003226189285345, -0.05303880684720031, -0.13837549013352282, 0.06952002754263666, 0.30480915572943873, 0.17364778667260175, 0.20987656810481486, -0.27718195413378466, -0.28414147569070003, 0.012595735672304684, 0.16687138923497377, 0.1128747252180059, -0.04558073919287872, -0.23842651206443363, 0.12271034735891882, -0.16290856335830142, -0.013449174820327725, 0.10184075940271904, 0.046594630905437744, 0.058249362102099536, -0.3371630296346614, 0.09136578009059738, 0.08905660509982885, -0.01674928378592106, -0.05024641512855673, -0.12837637657963338, 0.08973661928983598, 0.15316321160216098, 0.06387331997092556, 0.16013746870810103, 0.06259030184505143, -0.10325616255172411, -0.11516992312095974, 0.31969591320074836, -0.09092160781989966, -0.2148989677126787, 0.1027865966209264, -0.03341508017660215, -0.058970711193978786, 0.1437352444821348, 0.16446192353835393, 0.08670040286392316, -0.1131061543014714, 0.05709407104837612, -0.08026603451962101, 0.28868072974527703, 0.1871194939032711, 0.12874712132923732, 0.09119389209382493, 0.13912528595919238, 0.07539276888957996, 0.2595303493388661, -0.12668967066097192, -0.08407412848338999, -0.2964009378191041, -0.11051707197751465, -0.22448819867153277, 0.03448882400347241, -0.17666353055660014, -0.1396332156329935, 0.28884043013837574, 0.08988219305830097, 0.1485042967887103, 0.12889459105101467, 0.2694443057066408, 0.08700666787777224, 0.03379763805189694, 0.16579632171504627, 0.15476713616443777, 0.15800967231130592, -0.0007072506451058662, -0.21397280171727653, 0.09125743067727007, 0.09852094722419293]
|
1,803.06787
|
Depletion of heavy nitrogen in the cold gas of star-forming regions
|
We investigate nitrogen isotope fractionation in forming and evolving
molecular clouds using gas-ice astrochemical simulations. We find that the bulk
gas can become depleted in heavy nitrogen (15N) due to the formation of
15N-enriched ices. Around the chemical transition from atomic nitrogen to N2,
N15N is selectively photodissociated, which results in the enrichment of 15N in
atomic nitrogen. As 15N-enriched atomic nitrogen is converted to ammonia ice
via grain surface reactions, the bulk gas is depleted in 15N. The level of 15N
depletion in the bulk gas can be up to a factor of two compared to the
elemental nitrogen isotope ratio, depending on the photodesorption yield of
ammonia ice. Once the nitrogen isotopes are differentially partitioned between
gas and solids in a molecular cloud, it should remain in the later stages of
star formation (e.g., prestellar core) as long as the sublimation of ammonia
ice is inefficient. Our model suggests that all the N-bearing molecules in the
cold gas of star-forming regions can be depleted in 15N, which is at least
qualitatively consistent with the observations toward prestellar core L1544. In
our models, icy species show both 15N and deuterium fractionation. The
fractionation pattern within ice mantles is different between 15N and
deuterium, reflecting their fractionation mechanisms; while the concentration
of deuterium almost monotonically increases from the lower layers of the ice
mantles to the upper layers, the concentration of 15N reaches the maximum at a
certain depth and declines towards the surface.
|
astro-ph.GA astro-ph.EP
|
we investigate nitrogen isotope fractionation in forming and evolving molecular clouds using gasice astrochemical simulations we find that the bulk gas can become depleted in heavy nitrogen 15n due to the formation of 15nenriched ices around the chemical transition from atomic nitrogen to n2 n15n is selectively photodissociated which results in the enrichment of 15n in atomic nitrogen as 15nenriched atomic nitrogen is converted to ammonia ice via grain surface reactions the bulk gas is depleted in 15n the level of 15n depletion in the bulk gas can be up to a factor of two compared to the elemental nitrogen isotope ratio depending on the photodesorption yield of ammonia ice once the nitrogen isotopes are differentially partitioned between gas and solids in a molecular cloud it should remain in the later stages of star formation eg prestellar core as long as the sublimation of ammonia ice is inefficient our model suggests that all the nbearing molecules in the cold gas of starforming regions can be depleted in 15n which is at least qualitatively consistent with the observations toward prestellar core l1544 in our models icy species show both 15n and deuterium fractionation the fractionation pattern within ice mantles is different between 15n and deuterium reflecting their fractionation mechanisms while the concentration of deuterium almost monotonically increases from the lower layers of the ice mantles to the upper layers the concentration of 15n reaches the maximum at a certain depth and declines towards the surface
|
[['we', 'investigate', 'nitrogen', 'isotope', 'fractionation', 'in', 'forming', 'and', 'evolving', 'molecular', 'clouds', 'using', 'gasice', 'astrochemical', 'simulations', 'we', 'find', 'that', 'the', 'bulk', 'gas', 'can', 'become', 'depleted', 'in', 'heavy', 'nitrogen', '15n', 'due', 'to', 'the', 'formation', 'of', '15nenriched', 'ices', 'around', 'the', 'chemical', 'transition', 'from', 'atomic', 'nitrogen', 'to', 'n2', 'n15n', 'is', 'selectively', 'photodissociated', 'which', 'results', 'in', 'the', 'enrichment', 'of', '15n', 'in', 'atomic', 'nitrogen', 'as', '15nenriched', 'atomic', 'nitrogen', 'is', 'converted', 'to', 'ammonia', 'ice', 'via', 'grain', 'surface', 'reactions', 'the', 'bulk', 'gas', 'is', 'depleted', 'in', '15n', 'the', 'level', 'of', '15n', 'depletion', 'in', 'the', 'bulk', 'gas', 'can', 'be', 'up', 'to', 'a', 'factor', 'of', 'two', 'compared', 'to', 'the', 'elemental', 'nitrogen', 'isotope', 'ratio', 'depending', 'on', 'the', 'photodesorption', 'yield', 'of', 'ammonia', 'ice', 'once', 'the', 'nitrogen', 'isotopes', 'are', 'differentially', 'partitioned', 'between', 'gas', 'and', 'solids', 'in', 'a', 'molecular', 'cloud', 'it', 'should', 'remain', 'in', 'the', 'later', 'stages', 'of', 'star', 'formation', 'eg', 'prestellar', 'core', 'as', 'long', 'as', 'the', 'sublimation', 'of', 'ammonia', 'ice', 'is', 'inefficient', 'our', 'model', 'suggests', 'that', 'all', 'the', 'nbearing', 'molecules', 'in', 'the', 'cold', 'gas', 'of', 'starforming', 'regions', 'can', 'be', 'depleted', 'in', '15n', 'which', 'is', 'at', 'least', 'qualitatively', 'consistent', 'with', 'the', 'observations', 'toward', 'prestellar', 'core', 'l1544', 'in', 'our', 'models', 'icy', 'species', 'show', 'both', '15n', 'and', 'deuterium', 'fractionation', 'the', 'fractionation', 'pattern', 'within', 'ice', 'mantles', 'is', 'different', 'between', '15n', 'and', 'deuterium', 'reflecting', 'their', 'fractionation', 'mechanisms', 'while', 'the', 'concentration', 'of', 'deuterium', 'almost', 'monotonically', 'increases', 'from', 'the', 'lower', 'layers', 'of', 'the', 'ice', 'mantles', 'to', 'the', 'upper', 'layers', 'the', 'concentration', 'of', '15n', 'reaches', 'the', 'maximum', 'at', 'a', 'certain', 'depth', 'and', 'declines', 'towards', 'the', 'surface']]
|
[0.0026737491542484886, 0.24690853784788308, -0.005571841087657958, 0.004677656955433033, 0.1229712633801563, -0.06290012433529511, 0.08390746323547334, 0.4115118212982646, -0.22940190155517126, -0.31149111270186963, -0.0009040308970248051, -0.2782527545169301, 0.027655998753482996, 0.05048272237238917, 0.0021109058148332956, -0.05612349790734712, 0.029797675875282738, -0.09487315504353677, -0.039330896724885725, -0.2608319704447583, 0.26237282028696574, 0.1297746558776736, 0.17305727908256574, 0.12958771008311115, -0.0071284686860277275, -0.21812293413247852, 0.04380375781997305, -0.06913768622230311, -0.1291422908346204, 0.09859035566514053, 0.2918147433386023, 0.07575662494026368, 0.1251594067165212, -0.5099294941059359, -0.24292196852792453, 0.07448676861579279, 0.17858422393823514, 0.13413197254823123, -0.07246497243721053, -0.19728934551831565, -0.01142440843882543, -0.15525953078520346, -0.1412944437622963, 0.04035311648011452, 0.05255932814573304, -0.001969557019097532, -0.2333733625046825, 0.10614628585381815, 0.021711765964072746, 0.08320363398465294, -0.15783051317595861, -0.24189292108563737, -0.15654416998359758, 0.06953024586565319, -0.029049983657953773, 0.02978345550480776, 0.33700779639184475, -0.09700235433983387, 0.04694409244483887, 0.4415927775219449, -0.13712015079017575, -0.03693659053962739, 0.27870492442114064, -0.21123809820483821, -0.2066627064149409, 0.2572449909296024, 0.0918040394689506, 0.1286197903300788, -0.12548756358961835, -0.047476110297883095, -0.0699290886118657, 0.2055517161688691, 0.146133995747583, 0.033873144392168424, 0.3150080708580733, 0.21092591833010255, 0.04472409923881537, 0.13061297291385957, -0.18087380916761905, -0.11975914873106436, -0.1370172181517863, -0.2362545755516249, -0.10265035261438213, 0.027749155972488834, -0.10026717816686333, -0.09634759124441428, 0.22189552039595045, 0.08006576227227448, 0.21971877324242206, -0.06166250830359726, 0.3004830910091395, 0.04083408739324278, 0.10447788216124984, 0.07875284971406905, 0.2460506214573216, 0.18607435837678124, 0.09470033872973739, -0.3172289621706128, 0.22082075225399259, 0.015914162139973192]
|
1,803.06788
|
The Cohomology for Wu Characteristics
|
While Euler characteristic X(G)=sum_x w(x) super counts simplices, Wu
characteristics w_k(G) = sum_(x_1,x_2,...,x_k) w(x_1)...w(x_k) super counts
simultaneously pairwise interacting k-tuples of simplices in a finite abstract
simplicial complex G. More general is the k-intersection number
w_k(G_1,...G_k), where x_i in G_i. We define interaction cohomology
H^p(G_1,...,G_k) compatible with w_k and invariant under Barycentric
subdivison. It allows to distinguish spaces which simplicial cohomology can
not: it can identify algebraically the Moebius strip and the cylinder for
example. The cohomology satisfies the Kuenneth formula: the Poincare
polynomials p_k(t) are ring homomorphisms from the strong ring to the ring of
polynomials in t. The Dirac operator D=d+d^* defines the block diagonal Hodge
Laplacian L=D^2 which leads to the generalized Hodge correspondence
b_p(G)=dim(H^p_k(G)) = dim(ker(L_p)) and Euler-Poincare w_k(G)=sum_p (-1)^p
dim(H^p_k(G)) for Wu characteristic. Also, like for traditional simplicial
cohomology, isospectral Lax deformation D' = [B(D),D], with
B(t)=d(t)-d^*(t)-ib(t), D(t)=d(t)+d(t)^* + b(t) can deform the exterior
derivative d. The Brouwer-Lefschetz fixed point theorem generalizes to all Wu
characteristics: given an endomorphism T of G, the super trace of its induced
map on k'th cohomology defines a Lefschetz number L_k(T). The Brouwer index
i_T,k(x_1,...,x_k) = product_j=1^k w(x_j) sign(T|x_j) attached to simplex tuple
which is invariant under T leads to the formula L_k(T) = sum_T(x)=x i_T,k(x).
For T=Id, the Lefschetz number L_k(Id) is equal to the k'th Wu characteristic
w_k(G) of the graph G and the Lefschetz formula reduces to the Euler-Poincare
formula for Wu characteristic.
|
math.CO cs.DM math.AT
|
while euler characteristic xgsum_x wx super counts simplices wu characteristics w_kg sum_x_1x_2x_k wx_1wx_k super counts simultaneously pairwise interacting ktuples of simplices in a finite abstract simplicial complex g more general is the kintersection number w_kg_1g_k where x_i in g_i we define interaction cohomology hpg_1g_k compatible with w_k and invariant under barycentric subdivison it allows to distinguish spaces which simplicial cohomology can not it can identify algebraically the moebius strip and the cylinder for example the cohomology satisfies the kuenneth formula the poincare polynomials p_kt are ring homomorphisms from the strong ring to the ring of polynomials in t the dirac operator ddd defines the block diagonal hodge laplacian ld2 which leads to the generalized hodge correspondence b_pgdimhp_kg dimkerl_p and eulerpoincare w_kgsum_p 1p dimhp_kg for wu characteristic also like for traditional simplicial cohomology isospectral lax deformation d bdd with btdtdtibt dtdtdt bt can deform the exterior derivative d the brouwerlefschetz fixed point theorem generalizes to all wu characteristics given an endomorphism t of g the super trace of its induced map on kth cohomology defines a lefschetz number l_kt the brouwer index i_tkx_1x_k product_j1k wx_j signtx_j attached to simplex tuple which is invariant under t leads to the formula l_kt sum_txx i_tkx for tid the lefschetz number l_kid is equal to the kth wu characteristic w_kg of the graph g and the lefschetz formula reduces to the eulerpoincare formula for wu characteristic
|
[['while', 'euler', 'characteristic', 'xgsum_x', 'wx', 'super', 'counts', 'simplices', 'wu', 'characteristics', 'w_kg', 'sum_x_1x_2x_k', 'wx_1wx_k', 'super', 'counts', 'simultaneously', 'pairwise', 'interacting', 'ktuples', 'of', 'simplices', 'in', 'a', 'finite', 'abstract', 'simplicial', 'complex', 'g', 'more', 'general', 'is', 'the', 'kintersection', 'number', 'w_kg_1g_k', 'where', 'x_i', 'in', 'g_i', 'we', 'define', 'interaction', 'cohomology', 'hpg_1g_k', 'compatible', 'with', 'w_k', 'and', 'invariant', 'under', 'barycentric', 'subdivison', 'it', 'allows', 'to', 'distinguish', 'spaces', 'which', 'simplicial', 'cohomology', 'can', 'not', 'it', 'can', 'identify', 'algebraically', 'the', 'moebius', 'strip', 'and', 'the', 'cylinder', 'for', 'example', 'the', 'cohomology', 'satisfies', 'the', 'kuenneth', 'formula', 'the', 'poincare', 'polynomials', 'p_kt', 'are', 'ring', 'homomorphisms', 'from', 'the', 'strong', 'ring', 'to', 'the', 'ring', 'of', 'polynomials', 'in', 't', 'the', 'dirac', 'operator', 'ddd', 'defines', 'the', 'block', 'diagonal', 'hodge', 'laplacian', 'ld2', 'which', 'leads', 'to', 'the', 'generalized', 'hodge', 'correspondence', 'b_pgdimhp_kg', 'dimkerl_p', 'and', 'eulerpoincare', 'w_kgsum_p', '1p', 'dimhp_kg', 'for', 'wu', 'characteristic', 'also', 'like', 'for', 'traditional', 'simplicial', 'cohomology', 'isospectral', 'lax', 'deformation', 'd', 'bdd', 'with', 'btdtdtibt', 'dtdtdt', 'bt', 'can', 'deform', 'the', 'exterior', 'derivative', 'd', 'the', 'brouwerlefschetz', 'fixed', 'point', 'theorem', 'generalizes', 'to', 'all', 'wu', 'characteristics', 'given', 'an', 'endomorphism', 't', 'of', 'g', 'the', 'super', 'trace', 'of', 'its', 'induced', 'map', 'on', 'kth', 'cohomology', 'defines', 'a', 'lefschetz', 'number', 'l_kt', 'the', 'brouwer', 'index', 'i_tkx_1x_k', 'product_j1k', 'wx_j', 'signtx_j', 'attached', 'to', 'simplex', 'tuple', 'which', 'is', 'invariant', 'under', 't', 'leads', 'to', 'the', 'formula', 'l_kt', 'sum_txx', 'i_tkx', 'for', 'tid', 'the', 'lefschetz', 'number', 'l_kid', 'is', 'equal', 'to', 'the', 'kth', 'wu', 'characteristic', 'w_kg', 'of', 'the', 'graph', 'g', 'and', 'the', 'lefschetz', 'formula', 'reduces', 'to', 'the', 'eulerpoincare', 'formula', 'for', 'wu', 'characteristic']]
|
[-0.21130570147280525, 0.07583250062374296, -0.11133984189224758, 0.07230952582617199, -0.13333325337907168, -0.1953333192177012, -0.04329953384287467, 0.2838066919551541, -0.36067488596953906, -0.21219584609036435, 0.03151803019734213, -0.27002204852972556, -0.1392421521964601, 0.12102704094679143, -0.16365245903160056, -0.003863772749299612, 0.011009333258442265, 0.13277168263202455, -0.08232749098290999, -0.25703192567805316, 0.3727352771636956, -0.03413479566298635, 0.204127971009688, 0.04964211748250511, 0.10097493485661285, 0.026620089723575564, -0.00928375121269445, -0.023894441265945143, -0.16855771038812442, 0.08630306139793859, 0.28125058283112253, 0.04318336902996263, 0.1384149142021768, -0.3571780780986161, -0.08409261791376581, 0.21088997639951781, 0.10723334117770685, -0.04567217120972895, 0.06498857357170588, -0.25816920394856185, 0.1276634312234819, -0.1520054528813267, -0.18129686113914797, -0.060744748799515094, 0.1314154112790252, 0.02576459690839918, -0.26932062566971204, 0.007954842147407529, 0.09247477323105427, 0.08588584174922374, -0.018434388500456853, -0.12501334235730183, -0.10631316739348738, 0.03536906399864686, -0.04169275079189227, 0.07836575895775232, 0.11128267583091844, -0.0571574581004876, -0.09950273654078234, 0.3611409540808467, -0.059682175237248204, -0.23063681006186726, 0.09231752945774807, -0.17799105491716538, -0.16573382873402934, 0.15312396192818079, 0.012980090226855636, 0.1650514560128549, -0.015086394150417841, 0.2080295522043595, -0.11413031674816575, 0.03363713712451713, 0.17142820703040615, -0.01033140794033001, 0.12238044501610205, 0.021117005598875627, 0.10214986136943395, 0.16060655026482373, -0.03177555027076791, -0.06739085044371873, -0.34232389105335226, -0.19926211714499714, -0.17775283865860178, 0.16278077746276085, -0.18313530374492165, -0.1639521596505101, 0.3772701493075266, 0.05086079761459702, 0.17913712963610537, 0.15094216571554558, 0.2015866624779492, 0.10617532950996512, 0.07929377251265335, 0.05633095583962899, 0.048653302784187134, 0.28390908539688714, 0.02147361790617062, -0.17638156116948825, -0.008911416239538034, 0.2836880890670027]
|
1,803.06789
|
Clear variation of spin splitting by changing electron distribution at
non-magnetic metal/Bi2O3 interfaces
|
Large spin splitting at Rashba interface, giving rise to strong spin-momentum
locking, is essential for efficient spin-to-charge conversion. Recently, a
Cu/Bismuth oxide (Bi2O3) interface has been found to exhibit an efficient
spin-to-charge conversion similar to a Ag/Bi interface with large Rashba spin
splitting. However, the guiding principle of designing the metal/oxide
interface for the efficient conversion has not been clarified yet. Here we
report strong non-magnetic (NM) material dependence of spin splitting at
NM/Bi2O3 interfaces. We employed spin pumping technique to inject spin current
into the interface and evaluated the magnitude of interfacial spin-to-charge
conversion. We observed large modulation and sign change in conversion
coefficient which corresponds to the variation of spin splitting. Our
experimental results together with first-principles calculations indicate that
such large variation is caused by material dependent electron distribution near
the interface. The results suggest that control of interfacial electron
distribution by tuning the difference in work function across the interface may
be an effective way to tune the magnitude and sign of spin-to-charge conversion
and Rashba parameter at interface.
|
cond-mat.mtrl-sci
|
large spin splitting at rashba interface giving rise to strong spinmomentum locking is essential for efficient spintocharge conversion recently a cubismuth oxide bi2o3 interface has been found to exhibit an efficient spintocharge conversion similar to a agbi interface with large rashba spin splitting however the guiding principle of designing the metaloxide interface for the efficient conversion has not been clarified yet here we report strong nonmagnetic nm material dependence of spin splitting at nmbi2o3 interfaces we employed spin pumping technique to inject spin current into the interface and evaluated the magnitude of interfacial spintocharge conversion we observed large modulation and sign change in conversion coefficient which corresponds to the variation of spin splitting our experimental results together with firstprinciples calculations indicate that such large variation is caused by material dependent electron distribution near the interface the results suggest that control of interfacial electron distribution by tuning the difference in work function across the interface may be an effective way to tune the magnitude and sign of spintocharge conversion and rashba parameter at interface
|
[['large', 'spin', 'splitting', 'at', 'rashba', 'interface', 'giving', 'rise', 'to', 'strong', 'spinmomentum', 'locking', 'is', 'essential', 'for', 'efficient', 'spintocharge', 'conversion', 'recently', 'a', 'cubismuth', 'oxide', 'bi2o3', 'interface', 'has', 'been', 'found', 'to', 'exhibit', 'an', 'efficient', 'spintocharge', 'conversion', 'similar', 'to', 'a', 'agbi', 'interface', 'with', 'large', 'rashba', 'spin', 'splitting', 'however', 'the', 'guiding', 'principle', 'of', 'designing', 'the', 'metaloxide', 'interface', 'for', 'the', 'efficient', 'conversion', 'has', 'not', 'been', 'clarified', 'yet', 'here', 'we', 'report', 'strong', 'nonmagnetic', 'nm', 'material', 'dependence', 'of', 'spin', 'splitting', 'at', 'nmbi2o3', 'interfaces', 'we', 'employed', 'spin', 'pumping', 'technique', 'to', 'inject', 'spin', 'current', 'into', 'the', 'interface', 'and', 'evaluated', 'the', 'magnitude', 'of', 'interfacial', 'spintocharge', 'conversion', 'we', 'observed', 'large', 'modulation', 'and', 'sign', 'change', 'in', 'conversion', 'coefficient', 'which', 'corresponds', 'to', 'the', 'variation', 'of', 'spin', 'splitting', 'our', 'experimental', 'results', 'together', 'with', 'firstprinciples', 'calculations', 'indicate', 'that', 'such', 'large', 'variation', 'is', 'caused', 'by', 'material', 'dependent', 'electron', 'distribution', 'near', 'the', 'interface', 'the', 'results', 'suggest', 'that', 'control', 'of', 'interfacial', 'electron', 'distribution', 'by', 'tuning', 'the', 'difference', 'in', 'work', 'function', 'across', 'the', 'interface', 'may', 'be', 'an', 'effective', 'way', 'to', 'tune', 'the', 'magnitude', 'and', 'sign', 'of', 'spintocharge', 'conversion', 'and', 'rashba', 'parameter', 'at', 'interface']]
|
[-0.1666283541745697, 0.17438353286196248, -0.05019037543158782, 0.018142940241663734, -0.10064875844141676, -0.16199881573104197, 0.0395868954341314, 0.42505602009202303, -0.2917019712292094, -0.37876200741320326, 0.0006016135686866895, -0.2479260027196193, -0.09218120316795089, 0.21838542160425575, 0.051144261474105696, 0.028368069606149647, -0.019791629029252723, -0.1492157467866959, -0.09850022934747545, -0.11723223226199374, 0.25407893650440705, 0.05010273449983426, 0.3847568127141492, 0.16538077705861096, 0.11455270860681845, 0.01475957615235657, 0.08617782733288773, -0.01954693247547798, -0.1365041323473346, 0.08354654339583296, 0.26228243175945765, -0.09864685927621192, 0.18245100993486066, -0.438917947606298, -0.17659415716471488, -0.02470173028962175, 0.15605216830075658, 0.17709754092267535, -0.14468256560459253, -0.23003772881470227, 0.05873142179116683, -0.18189631451203145, -0.07061944297332404, -0.08024122818149844, 0.02635526525847919, -0.035497656615576245, -0.2829345044767081, 0.06318989402545774, 0.0660849971756644, 0.07430578873601534, -0.04919024293272816, -0.13469729839949407, -0.07181427392928877, 0.08400688847841434, 0.046777236248143235, 0.0562835114610474, 0.1926308927719879, -0.09521075906313695, -0.10919802739933046, 0.318965398199987, -0.1075277087409376, -0.15800055627961648, 0.18418227391295702, -0.1680295903852471, -0.032987815912061354, 0.1755736592873844, 0.15647866911859365, 0.08150098129987107, -0.14130238124458064, 0.039785817293423, 0.04672334266044281, 0.19132667413112103, 0.04649024780251478, 0.06924909004146418, 0.23936060652931967, 0.19153569320663374, 0.10195246095937943, 0.12548095027831715, -0.13462566938360185, -0.045041463524375484, -0.1954593717485492, -0.20694222836619058, -0.220282202764899, 0.0673213240933742, -0.05683806451406515, -0.1408616910186155, 0.4094040578133182, 0.17380937995261114, 0.1520821590675041, -0.08403721701967182, 0.27276823474148737, 0.18364212381155148, 0.12676181864233044, 0.016728015089944027, 0.29515063912983525, 0.14109422429737073, 0.09296570294291566, -0.3372509616171146, 0.143301632143666, -0.022972640672655045]
|
1,803.0679
|
Simultaneous high-probability bounds on the false discovery proportion
in structured, regression, and online settings
|
While traditional multiple testing procedures prohibit adaptive analysis
choices made by users, Goeman and Solari (2011) proposed a simultaneous
inference framework that allows users such flexibility while preserving
high-probability bounds on the false discovery proportion (FDP) of the chosen
set. In this paper, we propose a new class of such simultaneous FDP bounds,
tailored for nested sequences of rejection sets. While most existing
simultaneous FDP bounds are based on closed testing using global null tests
based on sorted p-values, we additionally consider the setting where side
information can be leveraged to boost power, the variable selection setting
where knockoff statistics can be used to order variables, and the online
setting where decisions about rejections must be made as data arrives. Our
finite-sample, closed form bounds are based on repurposing the FDP estimates
from false discovery rate (FDR) controlling procedures designed for each of the
above settings. These results establish a novel connection between the parallel
literatures of simultaneous FDP bounds and FDR control methods, and use proof
techniques employing martingales and filtrations that are new to both these
literatures. We demonstrate the utility of our results by augmenting a recent
knockoffs analysis of the UK Biobank dataset.
|
math.ST stat.TH
|
while traditional multiple testing procedures prohibit adaptive analysis choices made by users goeman and solari 2011 proposed a simultaneous inference framework that allows users such flexibility while preserving highprobability bounds on the false discovery proportion fdp of the chosen set in this paper we propose a new class of such simultaneous fdp bounds tailored for nested sequences of rejection sets while most existing simultaneous fdp bounds are based on closed testing using global null tests based on sorted pvalues we additionally consider the setting where side information can be leveraged to boost power the variable selection setting where knockoff statistics can be used to order variables and the online setting where decisions about rejections must be made as data arrives our finitesample closed form bounds are based on repurposing the fdp estimates from false discovery rate fdr controlling procedures designed for each of the above settings these results establish a novel connection between the parallel literatures of simultaneous fdp bounds and fdr control methods and use proof techniques employing martingales and filtrations that are new to both these literatures we demonstrate the utility of our results by augmenting a recent knockoffs analysis of the uk biobank dataset
|
[['while', 'traditional', 'multiple', 'testing', 'procedures', 'prohibit', 'adaptive', 'analysis', 'choices', 'made', 'by', 'users', 'goeman', 'and', 'solari', '2011', 'proposed', 'a', 'simultaneous', 'inference', 'framework', 'that', 'allows', 'users', 'such', 'flexibility', 'while', 'preserving', 'highprobability', 'bounds', 'on', 'the', 'false', 'discovery', 'proportion', 'fdp', 'of', 'the', 'chosen', 'set', 'in', 'this', 'paper', 'we', 'propose', 'a', 'new', 'class', 'of', 'such', 'simultaneous', 'fdp', 'bounds', 'tailored', 'for', 'nested', 'sequences', 'of', 'rejection', 'sets', 'while', 'most', 'existing', 'simultaneous', 'fdp', 'bounds', 'are', 'based', 'on', 'closed', 'testing', 'using', 'global', 'null', 'tests', 'based', 'on', 'sorted', 'pvalues', 'we', 'additionally', 'consider', 'the', 'setting', 'where', 'side', 'information', 'can', 'be', 'leveraged', 'to', 'boost', 'power', 'the', 'variable', 'selection', 'setting', 'where', 'knockoff', 'statistics', 'can', 'be', 'used', 'to', 'order', 'variables', 'and', 'the', 'online', 'setting', 'where', 'decisions', 'about', 'rejections', 'must', 'be', 'made', 'as', 'data', 'arrives', 'our', 'finitesample', 'closed', 'form', 'bounds', 'are', 'based', 'on', 'repurposing', 'the', 'fdp', 'estimates', 'from', 'false', 'discovery', 'rate', 'fdr', 'controlling', 'procedures', 'designed', 'for', 'each', 'of', 'the', 'above', 'settings', 'these', 'results', 'establish', 'a', 'novel', 'connection', 'between', 'the', 'parallel', 'literatures', 'of', 'simultaneous', 'fdp', 'bounds', 'and', 'fdr', 'control', 'methods', 'and', 'use', 'proof', 'techniques', 'employing', 'martingales', 'and', 'filtrations', 'that', 'are', 'new', 'to', 'both', 'these', 'literatures', 'we', 'demonstrate', 'the', 'utility', 'of', 'our', 'results', 'by', 'augmenting', 'a', 'recent', 'knockoffs', 'analysis', 'of', 'the', 'uk', 'biobank', 'dataset']]
|
[-0.08207926091142377, 0.016523540632646806, -0.07253573000960543, 0.07805190757945236, -0.13231964120499526, -0.19085997598231558, 0.1711247879302668, 0.35841258563961703, -0.20651207475031863, -0.3239385863591156, 0.16920457544398546, -0.2419625796782601, -0.1344197867461835, 0.2508658543607305, -0.1376109728849668, 0.10825875560873599, 0.07766149070841936, -0.0035361772554401818, -0.0355346236841252, -0.33424569441946367, 0.284284461750578, 0.07232378032395313, 0.3564202618704835, 0.0008678130975683328, 0.09826324655506571, 0.057609836682015414, -0.07984398219847891, 0.021409292853683197, -0.14089835320960145, 0.1788673388670071, 0.28476613006308715, 0.2081621215692934, 0.35019383312860114, -0.37886998033727787, -0.16757256322928, 0.12377539975568652, 0.13481866555858102, 0.07702974877840257, -0.0677771409784401, -0.3222988520271433, 0.09912832851550037, -0.13081259470090842, -0.03890888728579591, -0.13745908771977206, -0.09205003954035225, 0.0418601245705043, -0.3863203153581486, 0.0582193700364986, 0.03697466292225893, 0.051400691374833815, -0.0431717997266164, -0.14717047552337048, 0.07079871519832744, 0.11626257727792497, 0.10070143813955205, -0.04499314784315807, 0.1322465718222716, -0.08414567994109833, -0.20243963098796416, 0.2654671639742963, -0.03542395919823764, -0.20008530680960054, 0.17700518079682342, -0.0772235294624331, -0.19104486297896406, 0.08237439541023243, 0.21148100415916007, 0.13640012883292843, -0.1934446385839415, 0.07122656630220951, -0.024166083431372484, 0.1463667321911786, 0.08087515032041799, 0.035997337122745623, 0.1567948284100382, 0.13887137803130872, 0.09445045653052231, 0.10074139766804023, -0.11491810889154683, -0.05768340410485032, -0.3019745039572197, -0.13149191332435256, -0.16044175937100488, -0.01747896559985572, -0.13535697169465705, -0.13030985999216566, 0.3534784620464661, 0.16969593082552276, 0.16761934958625263, 0.13664578434155525, 0.2948629068929305, 0.07554372812883968, 0.04717356613825364, 0.11661954105803317, 0.19786417468032577, 0.06859540459546284, 0.027347073350148986, -0.1390105593496896, 0.1224247348751296, 0.05904875387943487]
|
1,803.06791
|
Depth-aware CNN for RGB-D Segmentation
|
Convolutional neural networks (CNN) are limited by the lack of capability to
handle geometric information due to the fixed grid kernel structure. The
availability of depth data enables progress in RGB-D semantic segmentation with
CNNs. State-of-the-art methods either use depth as additional images or process
spatial information in 3D volumes or point clouds. These methods suffer from
high computation and memory cost. To address these issues, we present
Depth-aware CNN by introducing two intuitive, flexible and effective
operations: depth-aware convolution and depth-aware average pooling. By
leveraging depth similarity between pixels in the process of information
propagation, geometry is seamlessly incorporated into CNN. Without introducing
any additional parameters, both operators can be easily integrated into
existing CNNs. Extensive experiments and ablation studies on challenging RGB-D
semantic segmentation benchmarks validate the effectiveness and flexibility of
our approach.
|
cs.CV
|
convolutional neural networks cnn are limited by the lack of capability to handle geometric information due to the fixed grid kernel structure the availability of depth data enables progress in rgbd semantic segmentation with cnns stateoftheart methods either use depth as additional images or process spatial information in 3d volumes or point clouds these methods suffer from high computation and memory cost to address these issues we present depthaware cnn by introducing two intuitive flexible and effective operations depthaware convolution and depthaware average pooling by leveraging depth similarity between pixels in the process of information propagation geometry is seamlessly incorporated into cnn without introducing any additional parameters both operators can be easily integrated into existing cnns extensive experiments and ablation studies on challenging rgbd semantic segmentation benchmarks validate the effectiveness and flexibility of our approach
|
[['convolutional', 'neural', 'networks', 'cnn', 'are', 'limited', 'by', 'the', 'lack', 'of', 'capability', 'to', 'handle', 'geometric', 'information', 'due', 'to', 'the', 'fixed', 'grid', 'kernel', 'structure', 'the', 'availability', 'of', 'depth', 'data', 'enables', 'progress', 'in', 'rgbd', 'semantic', 'segmentation', 'with', 'cnns', 'stateoftheart', 'methods', 'either', 'use', 'depth', 'as', 'additional', 'images', 'or', 'process', 'spatial', 'information', 'in', '3d', 'volumes', 'or', 'point', 'clouds', 'these', 'methods', 'suffer', 'from', 'high', 'computation', 'and', 'memory', 'cost', 'to', 'address', 'these', 'issues', 'we', 'present', 'depthaware', 'cnn', 'by', 'introducing', 'two', 'intuitive', 'flexible', 'and', 'effective', 'operations', 'depthaware', 'convolution', 'and', 'depthaware', 'average', 'pooling', 'by', 'leveraging', 'depth', 'similarity', 'between', 'pixels', 'in', 'the', 'process', 'of', 'information', 'propagation', 'geometry', 'is', 'seamlessly', 'incorporated', 'into', 'cnn', 'without', 'introducing', 'any', 'additional', 'parameters', 'both', 'operators', 'can', 'be', 'easily', 'integrated', 'into', 'existing', 'cnns', 'extensive', 'experiments', 'and', 'ablation', 'studies', 'on', 'challenging', 'rgbd', 'semantic', 'segmentation', 'benchmarks', 'validate', 'the', 'effectiveness', 'and', 'flexibility', 'of', 'our', 'approach']]
|
[-0.023096933029592037, -0.007385279183034544, -0.029134448649603184, 0.051069854550129364, -0.12299525814337862, -0.182859801011229, 0.026509334115932384, 0.5197369968449628, -0.2939605768218085, -0.3722442708081669, 0.1007170439189024, -0.26750931258278865, -0.16096215930732863, 0.14959767176985259, -0.1606625238879739, 0.13583857849869807, 0.1839618609243728, -0.02727301279341595, -0.08846727529825228, -0.25917154954470417, 0.30216914661383876, 0.061844576960774486, 0.3523876867636486, 0.06698647320908667, 0.1425604874604485, -0.025543775130063295, -0.0941072910575679, 0.0028312004386895784, -0.0385321463096059, 0.23104082215922297, 0.28793681354986295, 0.18758395098373984, 0.29374501884707976, -0.5258851512300747, -0.2876401923890053, 0.0516817773864777, 0.15578160982027098, 0.06583660894452974, -0.0009983212971645926, -0.3840339678719088, 0.06582836126218791, -0.14439969260797456, 0.02913987522047979, -0.175995404192212, -0.05148048870248237, -0.013557983865892445, -0.2762958753496167, 0.038403427822265294, 0.07443008290224329, 0.08662222267163021, -0.014068525982589496, -0.10034165583481944, 0.0009318700629389948, 0.18750674061270223, -0.031013164650735066, 0.04939433325909906, 0.17221173279470317, -0.22484985791767637, -0.12327027289127862, 0.3159478260963051, -0.02843876701986624, -0.25151080185099056, 0.1993596704262826, 0.004863712304763289, -0.09954983398870186, 0.14268090526607854, 0.22655070097728944, 0.06414704071357846, -0.1676610047070965, 0.03624194226253571, 0.016011053644534614, 0.19669934678930548, 0.07440493555429081, 0.04917464126753017, 0.1861831384917928, 0.2621629449159459, 0.02121421198308882, 0.14552579930448836, -0.17850329022751085, -0.05773484783799008, -0.1743909470047112, -0.0776036847796705, -0.19355072747846996, -0.03502774447961538, -0.16385799399350717, -0.10925618248336293, 0.37005084826162565, 0.27031618339457997, 0.22618750365864898, 0.08372172586861308, 0.4427294840415319, 0.0101715047257366, 0.20139268926448292, 0.08989808913320303, 0.11852139962009257, 0.019019388719634326, 0.1278517955362245, -0.13915222976098043, 0.06760611036206009, 0.09899649274431997]
|
1,803.06792
|
Zenith angle distribution of cosmic ray showers measured with the
Yakutsk array and its application to analysis of arrival directions in
equatorial coordinates
|
The Yakutsk array dataset in the energy interval $(10^{17},10^{19})$ eV is
revisited in order to interpret the zenith angle distribution of an extensive
air shower event rate of ultra-high energy cosmic rays. The close relation of
the distribution to the attenuation of the main measurable parameter of
showers, $S_{600}$, is examined. Measured and expected distributions are used
to analyze the arrival directions of cosmic rays on an equatorial map including
the energy range below $10^{18}$ eV, which was previously avoided due to the
reduced trigger efficiency of the array in the range. While the null hypothesis
cannot be rejected with data from the Yakutsk array, an upper limit on the
fraction of cosmic rays from a separable source in the uniform background is
derived as a function of declination and energy.
|
astro-ph.HE
|
the yakutsk array dataset in the energy interval 10171019 ev is revisited in order to interpret the zenith angle distribution of an extensive air shower event rate of ultrahigh energy cosmic rays the close relation of the distribution to the attenuation of the main measurable parameter of showers s_600 is examined measured and expected distributions are used to analyze the arrival directions of cosmic rays on an equatorial map including the energy range below 1018 ev which was previously avoided due to the reduced trigger efficiency of the array in the range while the null hypothesis cannot be rejected with data from the yakutsk array an upper limit on the fraction of cosmic rays from a separable source in the uniform background is derived as a function of declination and energy
|
[['the', 'yakutsk', 'array', 'dataset', 'in', 'the', 'energy', 'interval', '10171019', 'ev', 'is', 'revisited', 'in', 'order', 'to', 'interpret', 'the', 'zenith', 'angle', 'distribution', 'of', 'an', 'extensive', 'air', 'shower', 'event', 'rate', 'of', 'ultrahigh', 'energy', 'cosmic', 'rays', 'the', 'close', 'relation', 'of', 'the', 'distribution', 'to', 'the', 'attenuation', 'of', 'the', 'main', 'measurable', 'parameter', 'of', 'showers', 's_600', 'is', 'examined', 'measured', 'and', 'expected', 'distributions', 'are', 'used', 'to', 'analyze', 'the', 'arrival', 'directions', 'of', 'cosmic', 'rays', 'on', 'an', 'equatorial', 'map', 'including', 'the', 'energy', 'range', 'below', '1018', 'ev', 'which', 'was', 'previously', 'avoided', 'due', 'to', 'the', 'reduced', 'trigger', 'efficiency', 'of', 'the', 'array', 'in', 'the', 'range', 'while', 'the', 'null', 'hypothesis', 'can', 'not', 'be', 'rejected', 'with', 'data', 'from', 'the', 'yakutsk', 'array', 'an', 'upper', 'limit', 'on', 'the', 'fraction', 'of', 'cosmic', 'rays', 'from', 'a', 'separable', 'source', 'in', 'the', 'uniform', 'background', 'is', 'derived', 'as', 'a', 'function', 'of', 'declination', 'and', 'energy']]
|
[-0.1135250557327771, 0.1859989931787149, -0.0388092246539322, 0.11457742233351868, -0.018353617081830975, 0.03054941126468897, 0.019141262183890086, 0.4010830989164364, -0.25775551935835594, -0.39549539913778825, 0.06724734686115999, -0.31891457487665514, 0.036251259573116784, 0.21994882256133866, -0.0059849982405834985, 0.032757790827633144, 0.06704978403308294, 0.02221783514770871, -0.03292343321163918, -0.17826653224725333, 0.23747791797775802, 0.2513429888165094, 0.3013724502574169, 0.07627019584703237, 0.1372986443754897, -0.02322608766053583, -0.051736485522297274, -0.030512422383656257, -0.12287132160112489, 0.06738065473934393, 0.2306093601794302, 0.12242975812547534, 0.13937465737565805, -0.37541218957231015, -0.21082139328719324, 0.14077415742968272, 0.10843104131711746, -0.007554277145163377, -0.012060127029095898, -0.30634546596983464, 0.07269190615114138, -0.1540611697279116, -0.15878105323534203, 0.09155667637375305, -0.03620593926606287, 0.06422739335867214, -0.22789769946199395, 0.07611839246282084, -0.0054314857569189015, 0.03714639846860246, -0.08206471312348552, -0.13810079963522331, -0.016698229318584196, 0.0968909069952619, 0.1256426164635123, 0.08422438271045116, 0.1307603089273943, -0.10221733252397021, -0.05641443985478796, 0.3768636660209594, -0.06622728400682419, -0.13533269044168236, 0.131966536862861, -0.209223200766128, -0.08494188642228832, 0.235494609716, 0.18795860425092792, 0.06386340905126639, -0.18277018863480282, 0.0927222834336607, 0.014213793822173172, 0.19416128691883033, 0.10084236767285197, -0.0013388770522251155, 0.24480885242375025, 0.13246714121676298, 0.12056561168069944, 0.11284368856141756, -0.20285316490930796, 0.005408490572537061, -0.31396566385417496, -0.11063589831771514, -0.22433351502106844, 0.07185104502845317, -0.10189430296526802, -0.14722926412417575, 0.39440797562248836, 0.12944513188456433, 0.20091878298584742, 0.02017276284537271, 0.27308809300813514, 0.09913210111016138, -0.003219203760435108, 0.04967928456341606, 0.3057923452459446, 0.11515050506901764, 0.08923159757334, -0.17574129476147982, 0.06384377239648793, -0.004772192691914908]
|
1,803.06793
|
$Z^\prime$ portal dark matter in the minimal $B-L$ model
|
In this review article, we consider a dark matter scenario in the context of
the minimal extension of the Standard Model (SM) with a $B-L$ (baryon number
minus lepton number) gauge symmetry, where three right-handed neutrinos with a
$B-L$ charge $-1$ and a $B-L$ Higgs field with a $B-L$ charge $+2$ are
introduced to make the model anomaly-free and to break the $B-L$ gauge
symmetry, respectively. The $B-L$ gauge symmetry breaking generates the
Majorana masses for the right-handed neutrinos. We introduce a Z$_2$ symmetry
to the model and assign an odd parity only for one right-handed neutrino, and
hence the Z$_2$-odd right-handed neutrino is stable and the unique dark matter
candidate in the model. The so-called minimal seesaw works with the other two
right-handed neutrinos and reproduces the current neutrino oscillation data. We
consider the case that the dark matter particle communicates with the SM
particles through the $B-L$ gauge boson ($Z^{\prime}_{B-L}$ boson), and obtain
a lower bound on the $B-L$ gauge coupling ($\alpha_{B-L}$) as a function of the
$Z^{\prime}_{B-L}$ boson mass ($m_{Z^{\prime}}$) from the observed dark matter
relic density. On the other hand, we interpret the recent LHC Run-2 results on
the search for a $Z^{\prime}$ boson resonance to an upper bound on
$\alpha_{B-L}$ as a function of $m_{Z^{\prime}}$. These two constraints are
complementary to narrow down an allowed parameter region for this "$Z^{\prime}$
portal" dark matter scenario, leading to a lower mass bound of $m_{Z^{\prime}}
\geq 3.9$ TeV.
|
hep-ph astro-ph.CO hep-ex
|
in this review article we consider a dark matter scenario in the context of the minimal extension of the standard model sm with a bl baryon number minus lepton number gauge symmetry where three righthanded neutrinos with a bl charge 1 and a bl higgs field with a bl charge 2 are introduced to make the model anomalyfree and to break the bl gauge symmetry respectively the bl gauge symmetry breaking generates the majorana masses for the righthanded neutrinos we introduce a z_2 symmetry to the model and assign an odd parity only for one righthanded neutrino and hence the z_2odd righthanded neutrino is stable and the unique dark matter candidate in the model the socalled minimal seesaw works with the other two righthanded neutrinos and reproduces the current neutrino oscillation data we consider the case that the dark matter particle communicates with the sm particles through the bl gauge boson zprime_bl boson and obtain a lower bound on the bl gauge coupling alpha_bl as a function of the zprime_bl boson mass m_zprime from the observed dark matter relic density on the other hand we interpret the recent lhc run2 results on the search for a zprime boson resonance to an upper bound on alpha_bl as a function of m_zprime these two constraints are complementary to narrow down an allowed parameter region for this zprime portal dark matter scenario leading to a lower mass bound of m_zprime geq 39 tev
|
[['in', 'this', 'review', 'article', 'we', 'consider', 'a', 'dark', 'matter', 'scenario', 'in', 'the', 'context', 'of', 'the', 'minimal', 'extension', 'of', 'the', 'standard', 'model', 'sm', 'with', 'a', 'bl', 'baryon', 'number', 'minus', 'lepton', 'number', 'gauge', 'symmetry', 'where', 'three', 'righthanded', 'neutrinos', 'with', 'a', 'bl', 'charge', '1', 'and', 'a', 'bl', 'higgs', 'field', 'with', 'a', 'bl', 'charge', '2', 'are', 'introduced', 'to', 'make', 'the', 'model', 'anomalyfree', 'and', 'to', 'break', 'the', 'bl', 'gauge', 'symmetry', 'respectively', 'the', 'bl', 'gauge', 'symmetry', 'breaking', 'generates', 'the', 'majorana', 'masses', 'for', 'the', 'righthanded', 'neutrinos', 'we', 'introduce', 'a', 'z_2', 'symmetry', 'to', 'the', 'model', 'and', 'assign', 'an', 'odd', 'parity', 'only', 'for', 'one', 'righthanded', 'neutrino', 'and', 'hence', 'the', 'z_2odd', 'righthanded', 'neutrino', 'is', 'stable', 'and', 'the', 'unique', 'dark', 'matter', 'candidate', 'in', 'the', 'model', 'the', 'socalled', 'minimal', 'seesaw', 'works', 'with', 'the', 'other', 'two', 'righthanded', 'neutrinos', 'and', 'reproduces', 'the', 'current', 'neutrino', 'oscillation', 'data', 'we', 'consider', 'the', 'case', 'that', 'the', 'dark', 'matter', 'particle', 'communicates', 'with', 'the', 'sm', 'particles', 'through', 'the', 'bl', 'gauge', 'boson', 'zprime_bl', 'boson', 'and', 'obtain', 'a', 'lower', 'bound', 'on', 'the', 'bl', 'gauge', 'coupling', 'alpha_bl', 'as', 'a', 'function', 'of', 'the', 'zprime_bl', 'boson', 'mass', 'm_zprime', 'from', 'the', 'observed', 'dark', 'matter', 'relic', 'density', 'on', 'the', 'other', 'hand', 'we', 'interpret', 'the', 'recent', 'lhc', 'run2', 'results', 'on', 'the', 'search', 'for', 'a', 'zprime', 'boson', 'resonance', 'to', 'an', 'upper', 'bound', 'on', 'alpha_bl', 'as', 'a', 'function', 'of', 'm_zprime', 'these', 'two', 'constraints', 'are', 'complementary', 'to', 'narrow', 'down', 'an', 'allowed', 'parameter', 'region', 'for', 'this', 'zprime', 'portal', 'dark', 'matter', 'scenario', 'leading', 'to', 'a', 'lower', 'mass', 'bound', 'of', 'm_zprime', 'geq', '39', 'tev']]
|
[-0.11902022206534942, 0.2884247111056538, -0.016119241828952604, 0.1983784201569506, -0.14762302556579623, -0.20875625128974207, 0.04800407671912884, 0.2871569664156899, -0.17463034434282843, -0.3697720079993208, 0.011266265964998941, -0.269068525529777, 0.027998982866605123, 0.09843096789894237, 0.04993108737289731, -0.0037184347049333153, -0.04031782853223073, 0.04485534480384861, -0.02487199493237616, -0.24909419409329228, 0.2787241514675164, 0.009296176930850683, 0.20730096894937258, 0.03836347711427758, 0.10007506158872274, -0.006761777360225096, -0.01388947584394676, -0.15238798550950985, -0.1184294415299822, 0.050402997985171775, 0.10829008875104289, 0.038279834996016386, 0.10422770426084753, -0.3493878196265238, -0.16347864211614554, 0.210529588519906, 0.15520317135572745, 0.0892397958484556, -0.1357171431397243, -0.3426217311304451, 0.09475527296502453, -0.24596276230489214, -0.11382804865085443, 0.003746783973959585, -0.0698221240498242, -0.13678774333869417, -0.3292451566007609, 0.10502655829380576, -0.06100103156253075, -0.03602556873144446, -0.040643492490441226, -0.1600068879003326, -0.10431396018636102, -0.05279584897410435, 0.21756134796887636, -0.004834616380200411, 0.15161210986649773, -0.23602803887939292, -0.15899213669860426, 0.42315652381488084, -0.12000377552806943, -0.1706120274233399, 0.15851644045324065, -0.13619682783610187, -0.20528580815383368, 0.09101440962792064, 0.1497317162861388, 0.06888776639219335, -0.14338104864388393, 0.19885664585769217, -0.14962340938557947, 0.18308557278651277, 0.009674513500855634, 0.05354720717101979, 0.32691644205090903, 0.19516928068624112, 0.10704379620146938, 0.017423127565901572, -0.1123405561040272, -0.019107338252554958, -0.4390368192146222, -0.1482071051914924, -0.11267305539222434, 0.03713944254971769, -0.06671365435037539, -0.07261031265855612, 0.45344025921464587, 0.11735658604108418, 0.2399042394356608, 0.05030893450893927, 0.2794232495119407, 0.08176024637117128, 0.08680716179078445, 0.031443576140494166, 0.3123652652720921, 0.1585429068421945, 0.09797373657662926, -0.23334852763509845, -0.10270486332155997, 0.09779724101438964]
|
1,803.06794
|
Short Proof of a Conjecture Concerning Split-By-Nilpotent Extensions
|
Let C be a finite dimensional algebra with B a split extension by a nilpotent
bimodule E. We provide a short proof to a conjecture by Assem and Zacharia
concerning properties of mod B inherited by mod C. We show if B is a tilted
algebra, then C is a tilted algebra.
|
math.RT
|
let c be a finite dimensional algebra with b a split extension by a nilpotent bimodule e we provide a short proof to a conjecture by assem and zacharia concerning properties of mod b inherited by mod c we show if b is a tilted algebra then c is a tilted algebra
|
[['let', 'c', 'be', 'a', 'finite', 'dimensional', 'algebra', 'with', 'b', 'a', 'split', 'extension', 'by', 'a', 'nilpotent', 'bimodule', 'e', 'we', 'provide', 'a', 'short', 'proof', 'to', 'a', 'conjecture', 'by', 'assem', 'and', 'zacharia', 'concerning', 'properties', 'of', 'mod', 'b', 'inherited', 'by', 'mod', 'c', 'we', 'show', 'if', 'b', 'is', 'a', 'tilted', 'algebra', 'then', 'c', 'is', 'a', 'tilted', 'algebra']]
|
[-0.20913965477106664, 0.11621671854160152, -0.10318972245575143, -0.06409290672476906, -0.10572196776047349, -0.2621075166478896, 0.00033163724023884593, 0.31443461985327303, -0.3851619569154886, -0.18363617887147343, 0.08242153485592169, -0.19920537874657804, -0.10790476084758456, 0.12994381939419186, -0.13863272020647016, -0.13279715922768587, 0.10903858536711106, 0.08451584959010898, -0.09184564157532385, -0.2336655676078338, 0.31117423867376953, -0.026084064255253628, 0.12859174924401137, 0.024989398545585573, 0.08987469838645595, 0.05232391977467789, 0.007420138133546481, 0.047171616474560536, -0.17764547056196114, 0.10636098321097401, 0.23038810011572564, 0.087006833189382, 0.2493230907533031, -0.29277214150016123, -0.06416081841766405, 0.16230374762716776, 0.13860682380170777, -0.028450604993849993, -0.03245706184623906, -0.2751969485185467, 0.20724516324340725, -0.24181448843759987, -0.14155816035166097, -0.07185748601086044, 0.20771255222364113, -0.03101461181918589, -0.33114649078701264, -0.00761763289427528, 0.14161424045092785, 0.19546246765038142, -0.04603084058572467, -0.08828567758637991, -0.11643917675918111, -0.060569753198741146, -0.0947681626645275, 0.11689433462631243, 0.07619634114850599, -0.009726137963438165, -0.16281874183242998, 0.36736012749875396, -0.0830367318032166, -0.2055739473614197, 0.12908850422648427, -0.179057477051034, -0.11831540612575527, 0.05592356220138474, 0.03644655544597369, 0.12939531957873932, -0.015528267934524383, 0.2938584539347525, -0.1666054061223314, 0.04810931079331427, 0.05986722230982895, -0.09272404982206914, 0.18365745719235677, 0.07188074401794718, 0.020245540327428337, 0.14237174597488214, 0.039695978110942706, 0.09969409072520928, -0.3709470209522316, -0.21957484688251638, -0.11253581722625174, 0.22576928625886256, -0.03986346006114708, -0.11159920593938576, 0.3781676748767495, 0.05465959350448639, 0.23651456653785247, 0.08020177211325902, 0.1827463575710471, 0.0665653115675713, 0.09157510381751657, 0.10552282189019024, 0.05869940294024463, 0.2912693054621251, -0.02354918334346551, -0.12010486209944177, -0.06942866381723434, 0.209726497459297]
|
1,803.06795
|
Nonlocal Low-Rank Tensor Factor Analysis for Image Restoration
|
Low-rank signal modeling has been widely leveraged to capture non-local
correlation in image processing applications. We propose a new method that
employs low-rank tensor factor analysis for tensors generated by grouped image
patches. The low-rank tensors are fed into the alternative direction multiplier
method (ADMM) to further improve image reconstruction. The motivating
application is compressive sensing (CS), and a deep convolutional architecture
is adopted to approximate the expensive matrix inversion in CS applications. An
iterative algorithm based on this low-rank tensor factorization strategy,
called NLR-TFA, is presented in detail. Experimental results on noiseless and
noisy CS measurements demonstrate the superiority of the proposed approach,
especially at low CS sampling rates.
|
cs.CV stat.ML
|
lowrank signal modeling has been widely leveraged to capture nonlocal correlation in image processing applications we propose a new method that employs lowrank tensor factor analysis for tensors generated by grouped image patches the lowrank tensors are fed into the alternative direction multiplier method admm to further improve image reconstruction the motivating application is compressive sensing cs and a deep convolutional architecture is adopted to approximate the expensive matrix inversion in cs applications an iterative algorithm based on this lowrank tensor factorization strategy called nlrtfa is presented in detail experimental results on noiseless and noisy cs measurements demonstrate the superiority of the proposed approach especially at low cs sampling rates
|
[['lowrank', 'signal', 'modeling', 'has', 'been', 'widely', 'leveraged', 'to', 'capture', 'nonlocal', 'correlation', 'in', 'image', 'processing', 'applications', 'we', 'propose', 'a', 'new', 'method', 'that', 'employs', 'lowrank', 'tensor', 'factor', 'analysis', 'for', 'tensors', 'generated', 'by', 'grouped', 'image', 'patches', 'the', 'lowrank', 'tensors', 'are', 'fed', 'into', 'the', 'alternative', 'direction', 'multiplier', 'method', 'admm', 'to', 'further', 'improve', 'image', 'reconstruction', 'the', 'motivating', 'application', 'is', 'compressive', 'sensing', 'cs', 'and', 'a', 'deep', 'convolutional', 'architecture', 'is', 'adopted', 'to', 'approximate', 'the', 'expensive', 'matrix', 'inversion', 'in', 'cs', 'applications', 'an', 'iterative', 'algorithm', 'based', 'on', 'this', 'lowrank', 'tensor', 'factorization', 'strategy', 'called', 'nlrtfa', 'is', 'presented', 'in', 'detail', 'experimental', 'results', 'on', 'noiseless', 'and', 'noisy', 'cs', 'measurements', 'demonstrate', 'the', 'superiority', 'of', 'the', 'proposed', 'approach', 'especially', 'at', 'low', 'cs', 'sampling', 'rates']]
|
[-0.04952119722099411, -0.044551759546941974, -0.07140505285250075, 0.018260784171641283, -0.0938509309604559, -0.18710421736206895, -0.05229305253159084, 0.4723367365675235, -0.3245634132432281, -0.23430135811961025, 0.13917369360142653, -0.2001275446590617, -0.24082617653072427, 0.12257118159990518, -0.09650178486908521, 0.11950834154219735, 0.10056053191731008, -0.018142216210894353, -0.13792285524573553, -0.25210308169074563, 0.22693093823602234, 0.09987515308269419, 0.3982455199157153, -0.014599282076633578, 0.14991175638802282, 0.00086398065355051, -0.0842172555249492, -0.012307795465265938, -0.005406635209243561, 0.18945247103425955, 0.33958823831939916, 0.23121730635765234, 0.28381387585850965, -0.4656613529787971, -0.2264347164218801, 0.07492460699008624, 0.15760771273165394, 0.11501402144294677, -0.12802699442158258, -0.33463206683251356, 0.1331335280278544, -0.16184033726025884, 0.05038049953339254, -0.1973711345451585, -0.06466715948852719, -0.07917719837619898, -0.3787812820780988, 0.08944051234700948, 0.03433698660976023, -0.005388153819452732, -0.06514556853339896, -0.21186288676455345, 0.1329948506745245, 0.05664430603538768, 0.024729909223649617, 0.033018094786536806, 0.17831184412566348, -0.10094768470879473, -0.10321455652165491, 0.3373702420178083, -0.07331302023274876, -0.23091927844894314, 0.15559296451141597, -0.009825636395637731, -0.16392386355223731, 0.16905280923334146, 0.24117390165498498, 0.12242936138747208, -0.13610510010306442, 0.07683394033672211, -0.04812583397356195, 0.16961195224195447, 0.03577516641501987, 0.00835908069745253, 0.10631837752869848, 0.1901220745244704, 0.09245914833432217, 0.15555864948578554, -0.16012891390950446, -0.04610714295861918, -0.17177695565677564, -0.1201294528047016, -0.281107122360498, -0.05522117498992951, -0.1371936668909407, -0.11160818971009977, 0.40197858136625736, 0.2053387390124962, 0.19475881306245205, 0.011053278790188765, 0.42719160688511276, 0.07573706040547631, 0.10498201746254339, 0.0658662139027969, 0.20420469514547138, 0.20701141768442724, 0.1129571733469733, -0.16719938325482087, 0.04335121895771884, 0.1407238838536272]
|
1,803.06796
|
Different Statistical Future of Dynamical Orbits over Expanding or
Hyperbolic Systems (II): Nonempty Syndetic Center
|
In [30] different statistical behavior of dynamical orbits without syndetic
center are considered. In present paper we continue this project and consider
different statistical behavior of dynamical orbits with nonempty syndetic
center: Two of sixteen cases appear (for which other fourteen cases are still
unknown) in transive topologically expanding or hyperbolic systems and are
discovered to have full topological entropy for which it is also true if
combined with non-recurrence and multifractal analysis such as quasi-regular
set, irregular set and level sets. In this process a strong entropy-dense
property, called minimal-entropy-dense, is established. In particular, we show
that points that are minimal (or called almost periodic), a classical and
important concept in the study of dynamical systems, form a set with full
topological entropy if the dynamical system satisfies shadowing or almost
specification property.
|
math.DS
|
in 30 different statistical behavior of dynamical orbits without syndetic center are considered in present paper we continue this project and consider different statistical behavior of dynamical orbits with nonempty syndetic center two of sixteen cases appear for which other fourteen cases are still unknown in transive topologically expanding or hyperbolic systems and are discovered to have full topological entropy for which it is also true if combined with nonrecurrence and multifractal analysis such as quasiregular set irregular set and level sets in this process a strong entropydense property called minimalentropydense is established in particular we show that points that are minimal or called almost periodic a classical and important concept in the study of dynamical systems form a set with full topological entropy if the dynamical system satisfies shadowing or almost specification property
|
[['in', '30', 'different', 'statistical', 'behavior', 'of', 'dynamical', 'orbits', 'without', 'syndetic', 'center', 'are', 'considered', 'in', 'present', 'paper', 'we', 'continue', 'this', 'project', 'and', 'consider', 'different', 'statistical', 'behavior', 'of', 'dynamical', 'orbits', 'with', 'nonempty', 'syndetic', 'center', 'two', 'of', 'sixteen', 'cases', 'appear', 'for', 'which', 'other', 'fourteen', 'cases', 'are', 'still', 'unknown', 'in', 'transive', 'topologically', 'expanding', 'or', 'hyperbolic', 'systems', 'and', 'are', 'discovered', 'to', 'have', 'full', 'topological', 'entropy', 'for', 'which', 'it', 'is', 'also', 'true', 'if', 'combined', 'with', 'nonrecurrence', 'and', 'multifractal', 'analysis', 'such', 'as', 'quasiregular', 'set', 'irregular', 'set', 'and', 'level', 'sets', 'in', 'this', 'process', 'a', 'strong', 'entropydense', 'property', 'called', 'minimalentropydense', 'is', 'established', 'in', 'particular', 'we', 'show', 'that', 'points', 'that', 'are', 'minimal', 'or', 'called', 'almost', 'periodic', 'a', 'classical', 'and', 'important', 'concept', 'in', 'the', 'study', 'of', 'dynamical', 'systems', 'form', 'a', 'set', 'with', 'full', 'topological', 'entropy', 'if', 'the', 'dynamical', 'system', 'satisfies', 'shadowing', 'or', 'almost', 'specification', 'property']]
|
[-0.17002526443195706, 0.12230477595829782, -0.08741944247700331, 0.08901654211109167, -0.028324944356399526, -0.13730523886713591, 0.028213207162952208, 0.36157468255104513, -0.27608510101825456, -0.23586669771484178, 0.15077849890492884, -0.3004879341283031, -0.16884799493442978, 0.19688951567824903, -0.06996001903579094, 0.08302108098162722, 0.07869262261607662, 0.06619931124008567, -0.06344000775480771, -0.2299029936583869, 0.3691816740875481, -0.06395404711934446, 0.22156616647102167, -0.009901368187185917, 0.07632987007839989, -0.004545851647924945, -0.00015603236939388377, 0.07764039873093867, -0.12048573080747556, 0.07474129309545392, 0.22607767879820734, 0.12637683295268026, 0.2513504387892584, -0.3680416285806826, -0.2144054875670015, 0.14229652659171296, 0.13455735970260077, 0.05120584381469223, -0.059196862079316875, -0.24822239347961056, 0.16865643094834082, -0.1669680058693101, -0.18046210705523044, -0.08078581792967152, 0.06633636524957669, 0.010387548325469589, -0.21910683526337602, 0.058932241466285604, 0.12240201808807248, 0.1122074120007953, -0.04746654577453742, -0.07007094175032276, -0.053411653160494364, 0.1197437955233631, 0.01792180489722945, 0.007605940724930989, 0.08594945822895739, -0.04997387230893924, -0.09832923455370007, 0.3937648703763617, -0.030608801002336938, -0.20460670747090387, 0.258087771951811, -0.19572501330999018, -0.2048843573727325, 0.10930639437847693, 0.15926694466185023, 0.07714016361602845, -0.17197982778502557, 0.11563064060875976, -0.07230043882603636, 0.14135520785464017, 0.06322906771408152, 0.08132801976282406, 0.207900901389031, 0.12498445569836172, 0.09698078671171692, 0.14735731188934795, -0.019053298397032358, -0.10757670576421131, -0.29003509786068854, -0.11870473641760022, -0.11964697334097826, 0.06661615207816211, -0.033732066588020415, -0.23502066904920657, 0.35916712694758735, 0.11122378762518162, 0.1876405360788562, 0.043093889182120676, 0.23437787316213468, 0.07916935133285205, 0.020082201837128354, 0.10910938997603668, 0.20126529798117815, 0.0761063548057333, 0.011134132842412431, -0.1422333793647104, 0.03542059829826502, 0.08446174813079015]
|
1,803.06797
|
Revenue Management on an On-Demand Service Platform
|
I consider the optimal hourly (or per-unit-time in general) pricing problem
faced by a freelance worker (or a service provider) on an on-demand service
platform. Service requests arriving while the worker is busy are lost forever.
Thus, the optimal hourly prices need to capture the average hourly opportunity
costs incurred by accepting jobs. Due to potential asymmetries in these costs,
price discrimination across jobs based on duration, characteristics of the
arrival process, etc., may be necessary for optimality, even if the customers'
hourly willingness to pay is identically distributed. I first establish that
such price discrimination is not necessary if the customer arrival process is
Poisson: in this case, the optimal policy charges an identical hourly rate for
all jobs. This result holds even if the earnings are discounted over time. I
then consider the case where the customers belong to different classes that are
differentiated in their willingness to pay. I present a simple and practical
iterative procedure to compute the optimal prices in this case under standard
regularity assumptions on the distributions of customer valuations. I finally
show that these insights continue to hold in the presence of competition
between multiple quality-differentiated workers, assuming a natural customer
choice model in which a customer always chooses the best available worker that
she can afford.
|
cs.GT
|
i consider the optimal hourly or perunittime in general pricing problem faced by a freelance worker or a service provider on an ondemand service platform service requests arriving while the worker is busy are lost forever thus the optimal hourly prices need to capture the average hourly opportunity costs incurred by accepting jobs due to potential asymmetries in these costs price discrimination across jobs based on duration characteristics of the arrival process etc may be necessary for optimality even if the customers hourly willingness to pay is identically distributed i first establish that such price discrimination is not necessary if the customer arrival process is poisson in this case the optimal policy charges an identical hourly rate for all jobs this result holds even if the earnings are discounted over time i then consider the case where the customers belong to different classes that are differentiated in their willingness to pay i present a simple and practical iterative procedure to compute the optimal prices in this case under standard regularity assumptions on the distributions of customer valuations i finally show that these insights continue to hold in the presence of competition between multiple qualitydifferentiated workers assuming a natural customer choice model in which a customer always chooses the best available worker that she can afford
|
[['i', 'consider', 'the', 'optimal', 'hourly', 'or', 'perunittime', 'in', 'general', 'pricing', 'problem', 'faced', 'by', 'a', 'freelance', 'worker', 'or', 'a', 'service', 'provider', 'on', 'an', 'ondemand', 'service', 'platform', 'service', 'requests', 'arriving', 'while', 'the', 'worker', 'is', 'busy', 'are', 'lost', 'forever', 'thus', 'the', 'optimal', 'hourly', 'prices', 'need', 'to', 'capture', 'the', 'average', 'hourly', 'opportunity', 'costs', 'incurred', 'by', 'accepting', 'jobs', 'due', 'to', 'potential', 'asymmetries', 'in', 'these', 'costs', 'price', 'discrimination', 'across', 'jobs', 'based', 'on', 'duration', 'characteristics', 'of', 'the', 'arrival', 'process', 'etc', 'may', 'be', 'necessary', 'for', 'optimality', 'even', 'if', 'the', 'customers', 'hourly', 'willingness', 'to', 'pay', 'is', 'identically', 'distributed', 'i', 'first', 'establish', 'that', 'such', 'price', 'discrimination', 'is', 'not', 'necessary', 'if', 'the', 'customer', 'arrival', 'process', 'is', 'poisson', 'in', 'this', 'case', 'the', 'optimal', 'policy', 'charges', 'an', 'identical', 'hourly', 'rate', 'for', 'all', 'jobs', 'this', 'result', 'holds', 'even', 'if', 'the', 'earnings', 'are', 'discounted', 'over', 'time', 'i', 'then', 'consider', 'the', 'case', 'where', 'the', 'customers', 'belong', 'to', 'different', 'classes', 'that', 'are', 'differentiated', 'in', 'their', 'willingness', 'to', 'pay', 'i', 'present', 'a', 'simple', 'and', 'practical', 'iterative', 'procedure', 'to', 'compute', 'the', 'optimal', 'prices', 'in', 'this', 'case', 'under', 'standard', 'regularity', 'assumptions', 'on', 'the', 'distributions', 'of', 'customer', 'valuations', 'i', 'finally', 'show', 'that', 'these', 'insights', 'continue', 'to', 'hold', 'in', 'the', 'presence', 'of', 'competition', 'between', 'multiple', 'qualitydifferentiated', 'workers', 'assuming', 'a', 'natural', 'customer', 'choice', 'model', 'in', 'which', 'a', 'customer', 'always', 'chooses', 'the', 'best', 'available', 'worker', 'that', 'she', 'can', 'afford']]
|
[-0.11502158476440148, 0.08926895350148732, -0.055027423761610954, 0.09780356168339835, -0.1165003477177957, -0.21782282582989015, 0.18282287533582128, 0.45200414687534357, -0.2896378094191167, -0.27289702275889777, 0.12172905900722335, -0.2950848445653149, -0.049612968963153106, 0.12455140740097126, -0.1803069400772992, 0.030056848739617652, 0.0710646426783892, 0.07466051177117347, 0.04923394967357968, -0.3725570483855625, 0.2718520417062035, 0.06607272923776061, 0.32907083234532136, 0.039111341779266055, 0.07773770816693797, 0.018303023129005298, -0.014411891751844331, -0.059061006597182324, -0.10126287844992203, 0.06929163322495688, 0.3049945568852997, 0.1747913563367802, 0.36245580564827495, -0.48002559796114946, -0.10701073606054638, 0.17603875561421475, 0.07079364858550306, 0.003037900468617434, -0.0011622614377378442, -0.2137496558313963, 0.06834076910896991, -0.2191069896591862, -0.07656808913833349, -0.02364199176848492, 0.01937995253948965, 0.06858992609973327, -0.35367941817869303, 0.00667923367332023, 0.01335543176272414, 0.006852153919051863, -0.09703747353409896, -0.07950370631748636, -0.016439100427152676, 0.1959281809939176, 0.1360093517580927, -0.05425058757542484, 0.13360391680595127, -0.10912737299614177, -0.15624532244107295, 0.42987210673245246, -0.0037959313444971654, -0.1918982368247653, 0.10341217025007975, -0.11076183708288889, -0.1519595897238632, 0.09007118875160813, 0.22917292865915834, 0.07400759761047628, -0.2067858491459574, 0.0303052610858609, -0.04019464084266024, 0.13412851407671364, 0.0846925553817859, 0.005334694637257658, 0.19273335260565383, 0.13861841078473378, 0.1785950032862504, 0.08050421493674115, 0.009756848970036432, -0.12366139472388253, -0.27389111453215764, -0.151925640178531, -0.17122432151994293, 0.10215137171713803, -0.11471500204407956, -0.10873194682525, 0.36405865235306395, 0.19085114273170845, 0.14056342829042767, 0.12885620367697498, 0.3136980031556058, 0.1281825253613746, -0.005582793653838197, 0.17891391753610747, 0.12051203668201299, -0.08399610490555588, 0.17639321867848756, -0.170207352089156, 0.213336715437189, 0.0013075699413926385]
|
1,803.06798
|
Attention-GAN for Object Transfiguration in Wild Images
|
This paper studies the object transfiguration problem in wild images. The
generative network in classical GANs for object transfiguration often
undertakes a dual responsibility: to detect the objects of interests and to
convert the object from source domain to target domain. In contrast, we
decompose the generative network into two separat networks, each of which is
only dedicated to one particular sub-task. The attention network predicts
spatial attention maps of images, and the transformation network focuses on
translating objects. Attention maps produced by attention network are
encouraged to be sparse, so that major attention can be paid to objects of
interests. No matter before or after object transfiguration, attention maps
should remain constant. In addition, learning attention network can receive
more instructions, given the available segmentation annotations of images.
Experimental results demonstrate the necessity of investigating attention in
object transfiguration, and that the proposed algorithm can learn accurate
attention to improve quality of generated images.
|
cs.CV
|
this paper studies the object transfiguration problem in wild images the generative network in classical gans for object transfiguration often undertakes a dual responsibility to detect the objects of interests and to convert the object from source domain to target domain in contrast we decompose the generative network into two separat networks each of which is only dedicated to one particular subtask the attention network predicts spatial attention maps of images and the transformation network focuses on translating objects attention maps produced by attention network are encouraged to be sparse so that major attention can be paid to objects of interests no matter before or after object transfiguration attention maps should remain constant in addition learning attention network can receive more instructions given the available segmentation annotations of images experimental results demonstrate the necessity of investigating attention in object transfiguration and that the proposed algorithm can learn accurate attention to improve quality of generated images
|
[['this', 'paper', 'studies', 'the', 'object', 'transfiguration', 'problem', 'in', 'wild', 'images', 'the', 'generative', 'network', 'in', 'classical', 'gans', 'for', 'object', 'transfiguration', 'often', 'undertakes', 'a', 'dual', 'responsibility', 'to', 'detect', 'the', 'objects', 'of', 'interests', 'and', 'to', 'convert', 'the', 'object', 'from', 'source', 'domain', 'to', 'target', 'domain', 'in', 'contrast', 'we', 'decompose', 'the', 'generative', 'network', 'into', 'two', 'separat', 'networks', 'each', 'of', 'which', 'is', 'only', 'dedicated', 'to', 'one', 'particular', 'subtask', 'the', 'attention', 'network', 'predicts', 'spatial', 'attention', 'maps', 'of', 'images', 'and', 'the', 'transformation', 'network', 'focuses', 'on', 'translating', 'objects', 'attention', 'maps', 'produced', 'by', 'attention', 'network', 'are', 'encouraged', 'to', 'be', 'sparse', 'so', 'that', 'major', 'attention', 'can', 'be', 'paid', 'to', 'objects', 'of', 'interests', 'no', 'matter', 'before', 'or', 'after', 'object', 'transfiguration', 'attention', 'maps', 'should', 'remain', 'constant', 'in', 'addition', 'learning', 'attention', 'network', 'can', 'receive', 'more', 'instructions', 'given', 'the', 'available', 'segmentation', 'annotations', 'of', 'images', 'experimental', 'results', 'demonstrate', 'the', 'necessity', 'of', 'investigating', 'attention', 'in', 'object', 'transfiguration', 'and', 'that', 'the', 'proposed', 'algorithm', 'can', 'learn', 'accurate', 'attention', 'to', 'improve', 'quality', 'of', 'generated', 'images']]
|
[-0.026587588420211847, -0.013029916385073795, -0.04274245903996581, 0.08088849541540681, -0.1809378125729015, -0.1813665157087244, 0.017766764669455346, 0.5019470550990724, -0.2438777156065327, -0.3221616167575121, 0.07432993931707914, -0.26380057612361457, -0.17553908521363923, 0.15157671756558605, -0.19903135488970908, 0.05789494268519066, 0.15074446329366198, 0.08101414879421134, -0.024380532900693936, -0.2671096751386263, 0.329003839085314, 0.036957020739807035, 0.321457561262726, -0.006345766091525748, 0.11781915120233165, -0.034313487282095406, -0.08553973708132451, -0.006083489992873526, -0.0280631113357656, 0.1990121353724548, 0.30305524540206347, 0.1976628955929879, 0.3270054694934893, -0.4428221970530493, -0.27054011681443685, 0.13175402012617363, 0.12302351791060881, 0.12324000049197997, -0.053096898267209654, -0.3833018858771916, 0.09941277189131875, -0.17174232389789995, 0.03817388959918413, -0.08125638824815003, 0.026228789609022342, -0.041182150869243234, -0.2511324925936287, -0.045326682099360596, 0.10765301722726277, 0.020496230419761466, -0.04237355891306727, -0.06546845546675628, -0.04451942970589191, 0.2281990102114301, 0.06708738103648043, 0.09055537772032299, 0.1476219531629452, -0.24429139377422293, -0.09385992430585932, 0.4016918054019863, 0.0035210746860542853, -0.21024633986972174, 0.15629191801115241, -0.08608835034205445, -0.1775083209481695, 0.1510403177870268, 0.2603600462112431, 0.1188988542583372, -0.14842255247829408, 0.003193279424782044, -0.042508642827977075, 0.18633944121478185, 0.07390880427782895, 0.004036121886048176, 0.23783357209199435, 0.20046923009454962, 0.009123404327002899, 0.19705121347668592, -0.13404447779319456, -0.06125060520165104, -0.16439713954973917, -0.08147279202834894, -0.21376388586525405, -0.03516687140815178, -0.03080960532150295, -0.0907322501945317, 0.4148118589496748, 0.2089859012483359, 0.23434773798655512, 0.06461319290842353, 0.3066725248271333, -0.010524258201990228, 0.13268606723951443, 0.04318635417118233, 0.19506009317353948, 0.03814350056866231, 0.1480029607766199, -0.11974489401161138, 0.08381047979444749, 0.07458484706819637]
|
1,803.06799
|
Revisiting RCNN: On Awakening the Classification Power of Faster RCNN
|
Recent region-based object detectors are usually built with separate
classification and localization branches on top of shared feature extraction
networks. In this paper, we analyze failure cases of state-of-the-art detectors
and observe that most hard false positives result from classification instead
of localization. We conjecture that: (1) Shared feature representation is not
optimal due to the mismatched goals of feature learning for classification and
localization; (2) multi-task learning helps, yet optimization of the multi-task
loss may result in sub-optimal for individual tasks; (3) large receptive field
for different scales leads to redundant context information for small
objects.We demonstrate the potential of detector classification power by a
simple, effective, and widely-applicable Decoupled Classification Refinement
(DCR) network. DCR samples hard false positives from the base classifier in
Faster RCNN and trains a RCNN-styled strong classifier. Experiments show new
state-of-the-art results on PASCAL VOC and COCO without any bells and whistles.
|
cs.CV
|
recent regionbased object detectors are usually built with separate classification and localization branches on top of shared feature extraction networks in this paper we analyze failure cases of stateoftheart detectors and observe that most hard false positives result from classification instead of localization we conjecture that 1 shared feature representation is not optimal due to the mismatched goals of feature learning for classification and localization 2 multitask learning helps yet optimization of the multitask loss may result in suboptimal for individual tasks 3 large receptive field for different scales leads to redundant context information for small objectswe demonstrate the potential of detector classification power by a simple effective and widelyapplicable decoupled classification refinement dcr network dcr samples hard false positives from the base classifier in faster rcnn and trains a rcnnstyled strong classifier experiments show new stateoftheart results on pascal voc and coco without any bells and whistles
|
[['recent', 'regionbased', 'object', 'detectors', 'are', 'usually', 'built', 'with', 'separate', 'classification', 'and', 'localization', 'branches', 'on', 'top', 'of', 'shared', 'feature', 'extraction', 'networks', 'in', 'this', 'paper', 'we', 'analyze', 'failure', 'cases', 'of', 'stateoftheart', 'detectors', 'and', 'observe', 'that', 'most', 'hard', 'false', 'positives', 'result', 'from', 'classification', 'instead', 'of', 'localization', 'we', 'conjecture', 'that', '1', 'shared', 'feature', 'representation', 'is', 'not', 'optimal', 'due', 'to', 'the', 'mismatched', 'goals', 'of', 'feature', 'learning', 'for', 'classification', 'and', 'localization', '2', 'multitask', 'learning', 'helps', 'yet', 'optimization', 'of', 'the', 'multitask', 'loss', 'may', 'result', 'in', 'suboptimal', 'for', 'individual', 'tasks', '3', 'large', 'receptive', 'field', 'for', 'different', 'scales', 'leads', 'to', 'redundant', 'context', 'information', 'for', 'small', 'objectswe', 'demonstrate', 'the', 'potential', 'of', 'detector', 'classification', 'power', 'by', 'a', 'simple', 'effective', 'and', 'widelyapplicable', 'decoupled', 'classification', 'refinement', 'dcr', 'network', 'dcr', 'samples', 'hard', 'false', 'positives', 'from', 'the', 'base', 'classifier', 'in', 'faster', 'rcnn', 'and', 'trains', 'a', 'rcnnstyled', 'strong', 'classifier', 'experiments', 'show', 'new', 'stateoftheart', 'results', 'on', 'pascal', 'voc', 'and', 'coco', 'without', 'any', 'bells', 'and', 'whistles']]
|
[-0.05959436016436033, 0.009653444715528463, -0.02562887239947814, 0.06426751341268445, -0.0916157600431874, -0.24021066523467502, 0.058298358418123454, 0.41086771711707115, -0.24382020883518746, -0.3626346413400911, 0.06114557426071213, -0.28024598374981813, -0.17817813535593133, 0.20484402530005386, -0.17676281344246905, 0.0894849685434138, 0.17115978653294028, 0.03858615232150064, -0.0787679038555393, -0.32119512724924554, 0.29618477150100936, 0.05330344822359125, 0.3735141084865242, 0.044534903532844415, 0.12260516589431435, 0.006235870165230871, -0.05425675281127091, -0.016774347028133265, -0.0006825959245194396, 0.15119024389581817, 0.33235508527251933, 0.18551148386152627, 0.29648467260381195, -0.3499604444760753, -0.20838701656740793, 0.09441650894527533, 0.1348979218536671, 0.11373917424265727, -0.02568903542123735, -0.3453630048965364, 0.12371975762395784, -0.18113864561048698, 0.047251056848081195, -0.1328853345476091, -0.006994517655491981, -0.01404132610594784, -0.283463055081032, 0.07752397404346127, 0.128512229005407, 0.040171121277206505, -0.05772581990637189, -0.11856558420980463, 0.05718974562260468, 0.13150956661307386, 0.03496510072509904, 0.047309982728967, 0.151049292880763, -0.24757379942437394, -0.1818779939943988, 0.3010501508429951, -0.05239547306408814, -0.1829704571860608, 0.26707439773342234, -0.041612107534797826, -0.15237241387557315, 0.1505220773927614, 0.244737894077893, 0.13711448352416458, -0.13176391945778057, -0.027302314945081643, -0.015691066552016908, 0.21589063727581986, 0.11459780105731773, -0.004984976673105947, 0.18909077751957082, 0.254732244062795, 0.0690892585228533, 0.13690757466999648, -0.19431831188449245, -0.012606217614596798, -0.2469383238428304, -0.09892852240096346, -0.1987331180966326, 0.0003842964981639834, -0.1137307867888705, -0.1221670378094577, 0.38918271889200523, 0.20785506362123984, 0.20345035777744033, 0.12426718157798457, 0.32326235846445267, -0.005090506384656036, 0.1259074053746097, 0.08349680633531237, 0.22689654125331515, 0.006801159965305202, 0.07344768295178608, -0.15625114250313618, 0.04511316156499468, 0.06962999189272523]
|
1,803.068
|
Computational topology and the Unique Games Conjecture
|
Covering spaces of graphs have long been useful for studying expanders (as
"graph lifts") and unique games (as the "label-extended graph"). In this paper
we advocate for the thesis that there is a much deeper relationship between
computational topology and the Unique Games Conjecture. Our starting point is
Linial's 2005 observation that the only known problems whose inapproximability
is equivalent to the Unique Games Conjecture - Unique Games and Max-2Lin - are
instances of Maximum Section of a Covering Space on graphs. We then observe
that the reduction between these two problems (Khot-Kindler-Mossel-O'Donnell,
FOCS 2004; SICOMP, 2007) gives a well-defined map of covering spaces. We
further prove that inapproximability for Maximum Section of a Covering Space on
(cell decompositions of) closed 2-manifolds is also equivalent to the Unique
Games Conjecture. This gives the first new "Unique Games-complete" problem in
over a decade.
Our results partially settle an open question of Chen and Freedman (SODA
2010; Disc. Comput. Geom., 2011) from computational topology, by showing that
their question is almost equivalent to the Unique Games Conjecture. (The main
difference is that they ask for inapproximability over
$\mathbb{Z}/2\mathbb{Z}$, and we show Unique Games-completeness over
$\mathbb{Z}/k\mathbb{Z}$ for large $k$.) This equivalence comes from the fact
that when the structure group $G$ of the covering space is Abelian - or more
generally for principal $G$-bundles - Maximum Section of a $G$-Covering Space
is the same as the well-studied problem of 1-Homology Localization.
Although our most technically demanding result is an application of Unique
Games to computational topology, we hope that our observations on the
topological nature of the Unique Games Conjecture will lead to applications of
algebraic topology to the Unique Games Conjecture in the future.
|
cs.CC cs.CG cs.DM math.AT
|
covering spaces of graphs have long been useful for studying expanders as graph lifts and unique games as the labelextended graph in this paper we advocate for the thesis that there is a much deeper relationship between computational topology and the unique games conjecture our starting point is linials 2005 observation that the only known problems whose inapproximability is equivalent to the unique games conjecture unique games and max2lin are instances of maximum section of a covering space on graphs we then observe that the reduction between these two problems khotkindlermosselodonnell focs 2004 sicomp 2007 gives a welldefined map of covering spaces we further prove that inapproximability for maximum section of a covering space on cell decompositions of closed 2manifolds is also equivalent to the unique games conjecture this gives the first new unique gamescomplete problem in over a decade our results partially settle an open question of chen and freedman soda 2010 disc comput geom 2011 from computational topology by showing that their question is almost equivalent to the unique games conjecture the main difference is that they ask for inapproximability over mathbbz2mathbbz and we show unique gamescompleteness over mathbbzkmathbbz for large k this equivalence comes from the fact that when the structure group g of the covering space is abelian or more generally for principal gbundles maximum section of a gcovering space is the same as the wellstudied problem of 1homology localization although our most technically demanding result is an application of unique games to computational topology we hope that our observations on the topological nature of the unique games conjecture will lead to applications of algebraic topology to the unique games conjecture in the future
|
[['covering', 'spaces', 'of', 'graphs', 'have', 'long', 'been', 'useful', 'for', 'studying', 'expanders', 'as', 'graph', 'lifts', 'and', 'unique', 'games', 'as', 'the', 'labelextended', 'graph', 'in', 'this', 'paper', 'we', 'advocate', 'for', 'the', 'thesis', 'that', 'there', 'is', 'a', 'much', 'deeper', 'relationship', 'between', 'computational', 'topology', 'and', 'the', 'unique', 'games', 'conjecture', 'our', 'starting', 'point', 'is', 'linials', '2005', 'observation', 'that', 'the', 'only', 'known', 'problems', 'whose', 'inapproximability', 'is', 'equivalent', 'to', 'the', 'unique', 'games', 'conjecture', 'unique', 'games', 'and', 'max2lin', 'are', 'instances', 'of', 'maximum', 'section', 'of', 'a', 'covering', 'space', 'on', 'graphs', 'we', 'then', 'observe', 'that', 'the', 'reduction', 'between', 'these', 'two', 'problems', 'khotkindlermosselodonnell', 'focs', '2004', 'sicomp', '2007', 'gives', 'a', 'welldefined', 'map', 'of', 'covering', 'spaces', 'we', 'further', 'prove', 'that', 'inapproximability', 'for', 'maximum', 'section', 'of', 'a', 'covering', 'space', 'on', 'cell', 'decompositions', 'of', 'closed', '2manifolds', 'is', 'also', 'equivalent', 'to', 'the', 'unique', 'games', 'conjecture', 'this', 'gives', 'the', 'first', 'new', 'unique', 'gamescomplete', 'problem', 'in', 'over', 'a', 'decade', 'our', 'results', 'partially', 'settle', 'an', 'open', 'question', 'of', 'chen', 'and', 'freedman', 'soda', '2010', 'disc', 'comput', 'geom', '2011', 'from', 'computational', 'topology', 'by', 'showing', 'that', 'their', 'question', 'is', 'almost', 'equivalent', 'to', 'the', 'unique', 'games', 'conjecture', 'the', 'main', 'difference', 'is', 'that', 'they', 'ask', 'for', 'inapproximability', 'over', 'mathbbz2mathbbz', 'and', 'we', 'show', 'unique', 'gamescompleteness', 'over', 'mathbbzkmathbbz', 'for', 'large', 'k', 'this', 'equivalence', 'comes', 'from', 'the', 'fact', 'that', 'when', 'the', 'structure', 'group', 'g', 'of', 'the', 'covering', 'space', 'is', 'abelian', 'or', 'more', 'generally', 'for', 'principal', 'gbundles', 'maximum', 'section', 'of', 'a', 'gcovering', 'space', 'is', 'the', 'same', 'as', 'the', 'wellstudied', 'problem', 'of', '1homology', 'localization', 'although', 'our', 'most', 'technically', 'demanding', 'result', 'is', 'an', 'application', 'of', 'unique', 'games', 'to', 'computational', 'topology', 'we', 'hope', 'that', 'our', 'observations', 'on', 'the', 'topological', 'nature', 'of', 'the', 'unique', 'games', 'conjecture', 'will', 'lead', 'to', 'applications', 'of', 'algebraic', 'topology', 'to', 'the', 'unique', 'games', 'conjecture', 'in', 'the', 'future']]
|
[-0.12917910533447174, 0.03993024346565797, -0.12128403572699963, 0.0782817486531166, -0.08665990443122419, -0.1166624071813383, 0.05908803781835642, 0.3737116680777335, -0.3051034786926937, -0.31623928814114927, 0.10435141551699796, -0.2468348187565012, -0.16954259465076713, 0.20487885352653953, -0.151397309914204, 0.00789573589372261, 0.09923621609588683, -0.010823594641636361, -0.031180868823773775, -0.3180193328821005, 0.3389889706235768, 0.007681136445957662, 0.21356241845085724, 0.11329664355365648, 0.10149900665875156, 0.010566727584057347, -0.011264138387673067, 0.0589879794760979, -0.16354973039655066, 0.13816073128758272, 0.2839860865008768, 0.1567463882420137, 0.28517924679951545, -0.33029855302477, -0.17714805608050685, 0.14270358039842299, 0.10202368708317178, 0.06660820597410884, -0.011818911253243101, -0.25954390119679355, 0.11248144604186373, -0.1085368771286811, -0.08575172590999267, -0.04450530910053403, 0.09528008026783884, -0.038436909494478075, -0.23714464573695362, -0.012076928094050749, 0.11320168232087272, 0.05143308113994343, -0.044332197768402186, -0.11174425511448662, -0.008630706521003565, 0.13743725358033057, 0.0038617647849125687, 0.06207169857960972, 0.0033875217801130515, -0.12560435610221216, -0.19403150725099957, 0.3771012739650223, -0.029326534743042112, -0.10931649940572816, 0.1872058048701057, -0.11733023648153677, -0.2029568029400439, 0.14170002358651723, 0.13229119342252024, 0.12582900473291922, -0.06614091962362911, 0.15444091469072482, -0.19266973454641662, 0.14695555193278506, 0.10834526257621868, 0.009566433623692382, 0.14302309456745319, 0.14785368864137965, 0.18701314072520386, 0.13287221692969867, 0.02322179975581693, -0.09637749168276445, -0.2843651311342424, -0.16814695388333908, -0.1597225122365268, 0.11559454503643153, -0.07856652227070672, -0.171676614687645, 0.37992789193769516, 0.11460334176347751, 0.15464140811505225, 0.10862646694103215, 0.2129253059277659, 0.050605440534047454, 0.005612286882331738, 0.11448968461102332, 0.20775239668691006, 0.1882576127528066, 0.07465970833511211, -0.13816407633495037, 0.028577618431402267, 0.09065352869305364]
|
1,803.06801
|
On the existence problem of Einstein-Maxwell K\"ahler metrics
|
In this expository paper we review on the existence problem of
Einstein-Maxwell K\"ahler metrics, and make several remarks. Firstly, we
consider a slightly more general set-up than Einstein-Maxwell K\"ahler metrics,
and give extensions of volume minimization principle, the notion of toric
K-stability and other related results to the general set-up. Secondly, we
consider the toric case when the manifold is the one point blow-up of the
complex project plane and the K\"ahler class $\Omega$ is chosen so that the
area of the exceptional curve is sufficiently close to the area of the rational
curve of self-intersection number 1. We observe by numerical analysis that
there should be a Killing vector field $K$ which gives a toric K-stable pair
$(\Omega, K)$ in the sense of Apostolov-Maschler.
|
math.DG
|
in this expository paper we review on the existence problem of einsteinmaxwell kahler metrics and make several remarks firstly we consider a slightly more general setup than einsteinmaxwell kahler metrics and give extensions of volume minimization principle the notion of toric kstability and other related results to the general setup secondly we consider the toric case when the manifold is the one point blowup of the complex project plane and the kahler class omega is chosen so that the area of the exceptional curve is sufficiently close to the area of the rational curve of selfintersection number 1 we observe by numerical analysis that there should be a killing vector field k which gives a toric kstable pair omega k in the sense of apostolovmaschler
|
[['in', 'this', 'expository', 'paper', 'we', 'review', 'on', 'the', 'existence', 'problem', 'of', 'einsteinmaxwell', 'kahler', 'metrics', 'and', 'make', 'several', 'remarks', 'firstly', 'we', 'consider', 'a', 'slightly', 'more', 'general', 'setup', 'than', 'einsteinmaxwell', 'kahler', 'metrics', 'and', 'give', 'extensions', 'of', 'volume', 'minimization', 'principle', 'the', 'notion', 'of', 'toric', 'kstability', 'and', 'other', 'related', 'results', 'to', 'the', 'general', 'setup', 'secondly', 'we', 'consider', 'the', 'toric', 'case', 'when', 'the', 'manifold', 'is', 'the', 'one', 'point', 'blowup', 'of', 'the', 'complex', 'project', 'plane', 'and', 'the', 'kahler', 'class', 'omega', 'is', 'chosen', 'so', 'that', 'the', 'area', 'of', 'the', 'exceptional', 'curve', 'is', 'sufficiently', 'close', 'to', 'the', 'area', 'of', 'the', 'rational', 'curve', 'of', 'selfintersection', 'number', '1', 'we', 'observe', 'by', 'numerical', 'analysis', 'that', 'there', 'should', 'be', 'a', 'killing', 'vector', 'field', 'k', 'which', 'gives', 'a', 'toric', 'kstable', 'pair', 'omega', 'k', 'in', 'the', 'sense', 'of', 'apostolovmaschler']]
|
[-0.20408348561357706, 0.03554874335974455, -0.08049843247979879, 0.08673341351933778, -0.12455194685049355, -0.184235603813082, 0.013808196227066218, 0.3303306135833263, -0.2250218319706619, -0.227027166724205, 0.10219240088178776, -0.2785630059838295, -0.16586674416111782, 0.18670515041984617, -0.13547888608276845, -0.016465675238519908, 0.0626077181249857, 0.08143410990387201, -0.09014538699761034, -0.34181607446447015, 0.45433907479047775, -0.012981977264396847, 0.2535704040527344, 0.08687295427173376, 0.09470487096905708, -0.012061543218791484, 0.016635630160570146, 0.038349917210638525, -0.20420837193971966, 0.13570746896322816, 0.2722502188105136, 0.12268597969785333, 0.2088147442266345, -0.35730827897042033, -0.17621227765176445, 0.19339046926423908, 0.08382207658141852, 0.0746257692212239, -0.018745548814185897, -0.23476811368949713, 0.10648689204454422, -0.0932555946558714, -0.21825575022026897, -0.07835354527086019, 0.02121423175372183, -0.0018035326208919286, -0.19730171857774256, -0.023847603380680083, 0.09941744342446328, 0.0823794619962573, -0.04730491078272462, -0.09218976513436064, -0.014224352652207017, 0.013263687732862309, 0.08980300486925989, 0.1118131466023624, 0.11033184768259525, -0.0863048623148352, -0.07518937501404434, 0.38354871746897695, -0.0852072430314729, -0.25828664502501486, 0.09600972884707153, -0.1350586327277124, -0.12094119939394295, 0.1288398521845229, 0.13522246422991158, 0.1939761806614697, -0.08733218029758427, 0.1466287343967706, -0.0910361737832427, 0.08962296790932305, 0.09080297920852899, -0.01389412670303136, 0.16413148844474926, 0.11311182010360062, 0.13630315312743188, 0.15621080788318067, -0.0387596391942352, -0.10409438659250736, -0.39487560437619684, -0.17328745920211078, -0.11254241932649166, 0.16297122262138874, -0.11395533129596151, -0.15607649506628513, 0.39739286998659373, 0.06195633845031261, 0.19514262728393078, 0.09062451882194728, 0.2397572676241398, 0.04334988041222095, -0.008286369122564793, 0.06833832943439484, 0.21009938172250986, 0.15423235171847047, 0.07149591507017612, -0.15318062737211585, -0.053391757740057076, 0.11374755739048123]
|
1,803.06802
|
Alive Caricature from 2D to 3D
|
Caricature is an art form that expresses subjects in abstract, simple and
exaggerated view. While many caricatures are 2D images, this paper presents an
algorithm for creating expressive 3D caricatures from 2D caricature images with
a minimum of user interaction. The key idea of our approach is to introduce an
intrinsic deformation representation that has a capacity of extrapolation
enabling us to create a deformation space from standard face dataset, which
maintains face constraints and meanwhile is sufficiently large for producing
exaggerated face models. Built upon the proposed deformation representation, an
optimization model is formulated to find the 3D caricature that captures the
style of the 2D caricature image automatically. The experiments show that our
approach has better capability in expressing caricatures than those fitting
approaches directly using classical parametric face models such as 3DMM and
FaceWareHouse. Moreover, our approach is based on standard face datasets and
avoids constructing complicated 3D caricature training set, which provides
great flexibility in real applications.
|
cs.CV
|
caricature is an art form that expresses subjects in abstract simple and exaggerated view while many caricatures are 2d images this paper presents an algorithm for creating expressive 3d caricatures from 2d caricature images with a minimum of user interaction the key idea of our approach is to introduce an intrinsic deformation representation that has a capacity of extrapolation enabling us to create a deformation space from standard face dataset which maintains face constraints and meanwhile is sufficiently large for producing exaggerated face models built upon the proposed deformation representation an optimization model is formulated to find the 3d caricature that captures the style of the 2d caricature image automatically the experiments show that our approach has better capability in expressing caricatures than those fitting approaches directly using classical parametric face models such as 3dmm and facewarehouse moreover our approach is based on standard face datasets and avoids constructing complicated 3d caricature training set which provides great flexibility in real applications
|
[['caricature', 'is', 'an', 'art', 'form', 'that', 'expresses', 'subjects', 'in', 'abstract', 'simple', 'and', 'exaggerated', 'view', 'while', 'many', 'caricatures', 'are', '2d', 'images', 'this', 'paper', 'presents', 'an', 'algorithm', 'for', 'creating', 'expressive', '3d', 'caricatures', 'from', '2d', 'caricature', 'images', 'with', 'a', 'minimum', 'of', 'user', 'interaction', 'the', 'key', 'idea', 'of', 'our', 'approach', 'is', 'to', 'introduce', 'an', 'intrinsic', 'deformation', 'representation', 'that', 'has', 'a', 'capacity', 'of', 'extrapolation', 'enabling', 'us', 'to', 'create', 'a', 'deformation', 'space', 'from', 'standard', 'face', 'dataset', 'which', 'maintains', 'face', 'constraints', 'and', 'meanwhile', 'is', 'sufficiently', 'large', 'for', 'producing', 'exaggerated', 'face', 'models', 'built', 'upon', 'the', 'proposed', 'deformation', 'representation', 'an', 'optimization', 'model', 'is', 'formulated', 'to', 'find', 'the', '3d', 'caricature', 'that', 'captures', 'the', 'style', 'of', 'the', '2d', 'caricature', 'image', 'automatically', 'the', 'experiments', 'show', 'that', 'our', 'approach', 'has', 'better', 'capability', 'in', 'expressing', 'caricatures', 'than', 'those', 'fitting', 'approaches', 'directly', 'using', 'classical', 'parametric', 'face', 'models', 'such', 'as', '3dmm', 'and', 'facewarehouse', 'moreover', 'our', 'approach', 'is', 'based', 'on', 'standard', 'face', 'datasets', 'and', 'avoids', 'constructing', 'complicated', '3d', 'caricature', 'training', 'set', 'which', 'provides', 'great', 'flexibility', 'in', 'real', 'applications']]
|
[0.006876118708169088, -0.033947529471697636, -0.08373618291516323, 0.03512570717721246, -0.12271535165491514, -0.16881570138502866, -0.0413344040287484, 0.3847829792459379, -0.257384629920125, -0.3415076785488054, 0.0637252186985279, -0.26817859295406377, -0.21372957849089289, 0.228671476324962, -0.14809835804917384, 0.0669379932071024, 0.11829209677962353, 0.012980320099450183, -0.06470451484929071, -0.22508820531220408, 0.3147458536026534, 0.03363133562670555, 0.34410394077422096, 0.02403143995179562, 0.14518435407808283, 0.010685702967020917, 0.010862159730459097, 0.022415286447903783, -0.0629522254161202, 0.2118590183541528, 0.2450979650030149, 0.19113936327339615, 0.25766852078377267, -0.4164761159219779, -0.2465273293571954, 0.058018703252309935, 0.13950401356851216, 0.14309689679948862, -0.07360138513395213, -0.30458662937162445, 0.08473706417717039, -0.1663948706474912, -0.06247182593651814, -0.16480058572124107, -0.010926237022795248, -0.06310871212226629, -0.33276147256256083, 0.026635683672793675, 0.08079895847622538, 0.07687715385836782, -0.06983993596513756, -0.09117092078231508, 0.01475939752854174, 0.15434841348178452, 0.010436121404200093, 0.0734646128694294, 0.09471659325135988, -0.21419038162566723, -0.10360025767877232, 0.43073143581241313, -0.01752679722749235, -0.2212769543410104, 0.2241967430600198, -0.053430978432879785, -0.10189694593573222, 0.1462792493926827, 0.17069273615124986, 0.09150096485682298, -0.13319829615356865, 0.06976801073324168, -0.09788024011504604, 0.18424016943245078, 0.03017492739163572, -0.040709721771418114, 0.1975414421307505, 0.24033411592245102, 0.02099533131076896, 0.14811791432730387, -0.11516580516035901, -0.0885653143923264, -0.21936456369003282, -0.12156306648030295, -0.19662609896913635, -0.023399811970011796, -0.09886573800431506, -0.18774046441103565, 0.4150631757467636, 0.23009522706670396, 0.21393425602000207, 0.09739226657693507, 0.33642935862299056, 0.061473910133008756, 0.11803546312148683, 0.03229789934848668, 0.15270718175743242, 0.0002575619495473802, 0.08216983775055269, -0.13579979845089837, 0.07459442013205261, 0.09445743528867752]
|
1,803.06803
|
Hadamard powers of some positive matrices
|
Positivity properties of the Hadamard powers of the matrix
$\begin{bmatrix}1+x_ix_j\end{bmatrix}$ for distinct positive real numbers
$x_1,\ldots,x_n$ and the matrix
$\begin{bmatrix}|\cos((i-j)\pi/n)|\end{bmatrix}$ are studied. In particular, it
is shown that $\begin{bmatrix}(1+x_ix_j)^r\end{bmatrix}$ is not positive
semidefinite for any positive real number $r<n-2$ that is not an integer, and
$\begin{bmatrix}|\cos((i-j)\pi/n)|^r\end{bmatrix}$ is positive semidefinite for
every odd integer $n\ge 3$ and $n-3\le r<n-2.$
|
math.CA math.FA
|
positivity properties of the hadamard powers of the matrix beginbmatrix1x_ix_jendbmatrix for distinct positive real numbers x_1ldotsx_n and the matrix beginbmatrixcosijpinendbmatrix are studied in particular it is shown that beginbmatrix1x_ix_jrendbmatrix is not positive semidefinite for any positive real number rn2 that is not an integer and beginbmatrixcosijpinrendbmatrix is positive semidefinite for every odd integer nge 3 and n3le rn2
|
[['positivity', 'properties', 'of', 'the', 'hadamard', 'powers', 'of', 'the', 'matrix', 'beginbmatrix1x_ix_jendbmatrix', 'for', 'distinct', 'positive', 'real', 'numbers', 'x_1ldotsx_n', 'and', 'the', 'matrix', 'beginbmatrixcosijpinendbmatrix', 'are', 'studied', 'in', 'particular', 'it', 'is', 'shown', 'that', 'beginbmatrix1x_ix_jrendbmatrix', 'is', 'not', 'positive', 'semidefinite', 'for', 'any', 'positive', 'real', 'number', 'rn2', 'that', 'is', 'not', 'an', 'integer', 'and', 'beginbmatrixcosijpinrendbmatrix', 'is', 'positive', 'semidefinite', 'for', 'every', 'odd', 'integer', 'nge', '3', 'and', 'n3le', 'rn2']]
|
[-0.21179578233431182, 0.16671820838286602, 0.020071764968616783, 0.058632404200803, -0.0536477258956095, -0.23255783024261584, -0.09965512014152307, 0.34833535460649795, -0.2703404902076384, -0.19420635788086452, 0.16751684667322925, -0.33490998993785875, -0.2405060795399378, 0.1817968548363391, -0.016554469910432707, 0.044969388002635176, -0.005584412649765892, 0.11102387463709093, -0.1022271512269552, -0.3447539907229959, 0.36005853742079913, -0.09307320015329235, 0.12142027006045265, 0.1446679124766785, 0.13926752523150085, -0.012057952916706508, 0.02557032348869263, 0.054608120442420804, -0.0634874290413825, 0.011388424792731146, 0.29599149720435786, 0.21721188492088947, 0.2812701200820365, -0.36304432519806007, -0.10723011371380878, 0.2501594308271723, 0.10202824571257774, -0.013228637596838316, -0.06658051950408954, -0.18053579660800267, 0.26203528292617706, -0.06437188912323623, -0.11141778932849192, -0.08813510351058729, 0.17040883482627148, -0.06532846714528102, -0.3824937719992309, 0.016492313951394468, 0.09931001952796611, 0.04899523393163141, -0.053829181403413695, -0.2724414653021772, -0.008855527864312226, 0.11036650695012144, -0.024430557962436723, 0.005197546901708504, 0.02034467202940745, -0.00454175786800542, -0.1298298378527727, 0.28809517087801445, -0.002367114138631326, -0.33479530069063296, 0.08179530230754951, -0.22954942257899158, -0.12396920218466306, 0.16244248405344924, 0.09679407717765502, 0.17323835454178307, 0.002736055186756377, 0.17720913115278203, -0.17748435804585241, 0.18278109315642208, 0.08882290591433081, -0.034811702732629374, 0.1427756763889261, -0.0337239577707325, 0.16212562151815532, 0.09350620746120529, 0.04986214992713253, -0.023271939875382296, -0.32194934251173485, -0.23211505436250623, -0.36004369607511555, 0.16117681718468754, -0.17058291275604442, -0.16922150947810327, 0.3555781547472162, 0.00983414500248882, 0.16043156882712864, 0.16155831709082397, 0.2536886619790545, 0.16106839695910238, 0.021179127199399583, 0.07673246956557774, 0.07402924267258847, 0.19482688328145809, 0.02634372298588168, -0.1971909468642102, 0.06956379152482974, 0.08551577339827451]
|
1,803.06804
|
Stochastic maximum principle, dynamic programming principle, and their
relationship for fully coupled forward-backward stochastic control systems
|
Within the framework of viscosity solution, we study the relationship between
the maximum principle (MP) in [9] and the dynamic programming principle (DPP)
in [10] for a fully coupled forward-backward stochastic controlled system
(FBSCS) with a nonconvex control domain. For a fully coupled FBSCS, both the
corresponding MP and the corresponding Hamilton-Jacobi-Bellman (HJB) equation
combine an algebra equation respectively. So this relationship becomes more
complicated and almost no work involves this issue. With the help of a new
decoupling technique, we obtain the desirable estimates for the fully coupled
forward-backward variational equations and establish the relationship.
Furthermore, for the smooth case, we discover the connection between the
derivatives of the solution to the algebra equation and some terms in the first
and second-order adjoint equations. Finally, we study the local case under the
monotonicity conditions as in [14,27] and obtain the relationship between the
MP in [27] and the DPP in [14].
|
math.OC
|
within the framework of viscosity solution we study the relationship between the maximum principle mp in 9 and the dynamic programming principle dpp in 10 for a fully coupled forwardbackward stochastic controlled system fbscs with a nonconvex control domain for a fully coupled fbscs both the corresponding mp and the corresponding hamiltonjacobibellman hjb equation combine an algebra equation respectively so this relationship becomes more complicated and almost no work involves this issue with the help of a new decoupling technique we obtain the desirable estimates for the fully coupled forwardbackward variational equations and establish the relationship furthermore for the smooth case we discover the connection between the derivatives of the solution to the algebra equation and some terms in the first and secondorder adjoint equations finally we study the local case under the monotonicity conditions as in 1427 and obtain the relationship between the mp in 27 and the dpp in 14
|
[['within', 'the', 'framework', 'of', 'viscosity', 'solution', 'we', 'study', 'the', 'relationship', 'between', 'the', 'maximum', 'principle', 'mp', 'in', '9', 'and', 'the', 'dynamic', 'programming', 'principle', 'dpp', 'in', '10', 'for', 'a', 'fully', 'coupled', 'forwardbackward', 'stochastic', 'controlled', 'system', 'fbscs', 'with', 'a', 'nonconvex', 'control', 'domain', 'for', 'a', 'fully', 'coupled', 'fbscs', 'both', 'the', 'corresponding', 'mp', 'and', 'the', 'corresponding', 'hamiltonjacobibellman', 'hjb', 'equation', 'combine', 'an', 'algebra', 'equation', 'respectively', 'so', 'this', 'relationship', 'becomes', 'more', 'complicated', 'and', 'almost', 'no', 'work', 'involves', 'this', 'issue', 'with', 'the', 'help', 'of', 'a', 'new', 'decoupling', 'technique', 'we', 'obtain', 'the', 'desirable', 'estimates', 'for', 'the', 'fully', 'coupled', 'forwardbackward', 'variational', 'equations', 'and', 'establish', 'the', 'relationship', 'furthermore', 'for', 'the', 'smooth', 'case', 'we', 'discover', 'the', 'connection', 'between', 'the', 'derivatives', 'of', 'the', 'solution', 'to', 'the', 'algebra', 'equation', 'and', 'some', 'terms', 'in', 'the', 'first', 'and', 'secondorder', 'adjoint', 'equations', 'finally', 'we', 'study', 'the', 'local', 'case', 'under', 'the', 'monotonicity', 'conditions', 'as', 'in', '1427', 'and', 'obtain', 'the', 'relationship', 'between', 'the', 'mp', 'in', '27', 'and', 'the', 'dpp', 'in', '14']]
|
[-0.10803773462073878, 0.015594374875169403, -0.08925815884334345, 0.07026138665309797, -0.08972950324571381, -0.12891920626163483, 0.04492094003284971, 0.31224187403296433, -0.34055824735201895, -0.3044443150485555, 0.12274184946125995, -0.2668315488131096, -0.1691519223169113, 0.14064187402526537, -0.026332929648148515, 0.06586001108245303, 0.036841967850923536, 0.01618793905635054, -0.1306208674206088, -0.17477100989470878, 0.3284426669900616, -0.024869056379732985, 0.2572206314653158, 0.05273696482564749, 0.15970170125054817, 0.017600444306929905, 0.007353938541685542, 0.006062290657622119, -0.15192785142183615, 0.1277536586796244, 0.223479052882952, 0.08529797045513987, 0.28687150318796434, -0.41527793436932064, -0.13470256575693687, 0.09169441608712077, 0.10850607523597622, 0.08660565399875243, -0.04170306865872893, -0.24024904858631393, 0.10008072250833114, -0.150688733033215, -0.1336529650259763, -0.0466346050457408, -0.013914621636892359, 0.011107347964619596, -0.30082620420182743, 0.11290630337782204, 0.06449452692021926, 0.03209848809987306, -0.11389447938806067, -0.06736503712910538, -0.007935622211468096, 0.07107129391593238, 0.021177566023543478, 0.008418525941669941, 0.010858122256274024, -0.1209203058667481, -0.09139270028099418, 0.3431608142144978, -0.09499384846266669, -0.2783550147603576, 0.18964563253646097, -0.117274806497929, -0.12329043658450246, 0.0768418783787638, 0.17292789344986279, 0.1877214351048072, -0.22121713827053704, 0.0959948000839601, -0.021284046278645594, 0.14913069474510848, 0.04786923410836607, -0.007315983676817268, 0.1219572233967483, 0.168727132488663, 0.1315358431544155, 0.14716844559647144, -0.03989075120848914, -0.1589714473656689, -0.3362003101905187, -0.18761968995754918, -0.09508056643729408, 0.02418953268478314, -0.1207028523576446, -0.11479337569636604, 0.3774535794804494, 0.15431189691958327, 0.17328879486769438, 0.1017523168368886, 0.23776323843747377, 0.20254278156828756, 0.0012033092597751724, 0.0917137785224865, 0.26118964893529967, 0.21787284990462163, 0.15832605895896754, -0.26463451989072684, 0.038280756634970506, 0.08269468865357339]
|
1,803.06805
|
Acoustic feature learning using cross-domain articulatory measurements
|
Previous work has shown that it is possible to improve speech recognition by
learning acoustic features from paired acoustic-articulatory data, for example
by using canonical correlation analysis (CCA) or its deep extensions. One
limitation of this prior work is that the learned feature models are difficult
to port to new datasets or domains, and articulatory data is not available for
most speech corpora. In this work we study the problem of acoustic feature
learning in the setting where we have access to an external, domain-mismatched
dataset of paired speech and articulatory measurements, either with or without
labels. We develop methods for acoustic feature learning in these settings,
based on deep variational CCA and extensions that use both source and target
domain data and labels. Using this approach, we improve phonetic recognition
accuracies on both TIMIT and Wall Street Journal and analyze a number of design
choices.
|
cs.CL
|
previous work has shown that it is possible to improve speech recognition by learning acoustic features from paired acousticarticulatory data for example by using canonical correlation analysis cca or its deep extensions one limitation of this prior work is that the learned feature models are difficult to port to new datasets or domains and articulatory data is not available for most speech corpora in this work we study the problem of acoustic feature learning in the setting where we have access to an external domainmismatched dataset of paired speech and articulatory measurements either with or without labels we develop methods for acoustic feature learning in these settings based on deep variational cca and extensions that use both source and target domain data and labels using this approach we improve phonetic recognition accuracies on both timit and wall street journal and analyze a number of design choices
|
[['previous', 'work', 'has', 'shown', 'that', 'it', 'is', 'possible', 'to', 'improve', 'speech', 'recognition', 'by', 'learning', 'acoustic', 'features', 'from', 'paired', 'acousticarticulatory', 'data', 'for', 'example', 'by', 'using', 'canonical', 'correlation', 'analysis', 'cca', 'or', 'its', 'deep', 'extensions', 'one', 'limitation', 'of', 'this', 'prior', 'work', 'is', 'that', 'the', 'learned', 'feature', 'models', 'are', 'difficult', 'to', 'port', 'to', 'new', 'datasets', 'or', 'domains', 'and', 'articulatory', 'data', 'is', 'not', 'available', 'for', 'most', 'speech', 'corpora', 'in', 'this', 'work', 'we', 'study', 'the', 'problem', 'of', 'acoustic', 'feature', 'learning', 'in', 'the', 'setting', 'where', 'we', 'have', 'access', 'to', 'an', 'external', 'domainmismatched', 'dataset', 'of', 'paired', 'speech', 'and', 'articulatory', 'measurements', 'either', 'with', 'or', 'without', 'labels', 'we', 'develop', 'methods', 'for', 'acoustic', 'feature', 'learning', 'in', 'these', 'settings', 'based', 'on', 'deep', 'variational', 'cca', 'and', 'extensions', 'that', 'use', 'both', 'source', 'and', 'target', 'domain', 'data', 'and', 'labels', 'using', 'this', 'approach', 'we', 'improve', 'phonetic', 'recognition', 'accuracies', 'on', 'both', 'timit', 'and', 'wall', 'street', 'journal', 'and', 'analyze', 'a', 'number', 'of', 'design', 'choices']]
|
[-0.003772775635297876, -0.0011188442205012608, -0.06272984061959302, 0.04310659970764795, -0.169214636417261, -0.16735339601938096, 0.038837316664285026, 0.4685848094522953, -0.25890551480713636, -0.3240453275272254, 0.10478584961593798, -0.3155937374944592, -0.17284167393518146, 0.22647981389147592, -0.11782508020729034, 0.07724032299827538, 0.1466867949735994, 0.06752567506757462, -0.03541700796672052, -0.2521431777745925, 0.3494451815883319, 0.016446010348267412, 0.3728311670080681, 0.010843409044254158, 0.09519169752780322, -0.01973030208480648, -0.05172172814006141, -0.04243133755598036, -0.05862949459126159, 0.1793654084491815, 0.3416150292593506, 0.22158865144916084, 0.28707248882468167, -0.4042740607142655, -0.25328606709081214, 0.10185519027678917, 0.13542515177848852, 0.14846635851841306, -0.030568713140382897, -0.34421683295578176, 0.0741179242434858, -0.15794393610364446, 0.05199257659195508, -0.13849822199618858, -0.007433715837477293, -0.04278729993610694, -0.27469103037340875, 0.05906312266274148, 0.11360938727820111, 0.12643689319439647, -0.06787976960751824, -0.10936027903355555, 0.05254006567783007, 0.15377909231109596, 0.06250994644910356, 0.06470893071996721, 0.09848701197188348, -0.19985471697711749, -0.14519655946666413, 0.3587137616187748, -0.08957181469304487, -0.2532460020803329, 0.23682359771434372, -0.02340737384575833, -0.14373347824342395, 0.03799168377493819, 0.2552755958006148, 0.09714185213670135, -0.17622126567099863, 0.022870266050530417, -0.044451763284289174, 0.19945335332643785, 0.07831850708882687, -0.02231926941830251, 0.13586764864157885, 0.2314564896061913, -0.0031206474183515334, 0.1429712700385911, -0.15228868993451922, -0.00568941657588261, -0.20637830110111585, -0.07448904852693279, -0.23300972279523396, -0.056497709499732686, -0.04273628371619351, -0.13907979718573593, 0.38347340653773343, 0.23511810439393027, 0.20274207505604458, 0.07439267326844856, 0.3421689745478539, 0.019077945603284106, 0.11913340987262523, 0.0889168195200101, 0.1787191967127405, 0.006129513305495493, 0.12050263660916648, -0.16376553505930738, 0.05203379929541067, 0.016177331016580056]
|
1,803.06806
|
On certain unimodal sequences and strict partitions
|
Building on a bijection of Vandervelde, we enumerate certain unimodal
sequences whose alternating sum equals zero. This enables us to refine the
enumeration of strict partitions with respect to the number of parts and the
BG-rank.
|
math.CO
|
building on a bijection of vandervelde we enumerate certain unimodal sequences whose alternating sum equals zero this enables us to refine the enumeration of strict partitions with respect to the number of parts and the bgrank
|
[['building', 'on', 'a', 'bijection', 'of', 'vandervelde', 'we', 'enumerate', 'certain', 'unimodal', 'sequences', 'whose', 'alternating', 'sum', 'equals', 'zero', 'this', 'enables', 'us', 'to', 'refine', 'the', 'enumeration', 'of', 'strict', 'partitions', 'with', 'respect', 'to', 'the', 'number', 'of', 'parts', 'and', 'the', 'bgrank']]
|
[-0.18727808218339786, 0.10814915104385685, -0.04692762832650367, 0.0015744009048349278, -0.138062789433581, -0.07636986475657015, 0.12699602270731702, 0.30818555756088567, -0.320668106460396, -0.2905621120983543, 0.0741136804332628, -0.27261229352477717, -0.10045617950313232, 0.1516031959258458, -0.12819275799590876, 0.01936871262595934, -0.0004033371258307906, 0.06643976523157429, -0.12547220210270846, -0.2942670650561066, 0.31381809810066924, -0.042974761057206816, 0.2523428986177725, -0.0072068615118041635, 0.12256947409032899, 0.06569597597562653, -0.07762234216994222, -0.028088096310110652, -0.1757488402996815, 0.20497730045634158, 0.21386706034707673, 0.15684455861885319, 0.20681781343677463, -0.37484627658062997, -0.010624715592712164, 0.2532777889248203, 0.19357590243110762, 0.026970904347870278, 0.05853232304113643, -0.2086811728282448, 0.13220087489496699, -0.15539458311875076, -0.1502480028087602, -0.07439998107250123, 0.013285416287972647, 0.09798856972552397, -0.2941244549720603, -0.06813543220393031, 0.10025628667790443, 0.03673059150905294, -0.026009094319306314, -0.1473111548625371, 0.0026930805076571074, 0.16707486646962078, 0.035790884839918685, 0.025203988277901185, 0.003700773245381082, -0.06835832265342641, -0.14398762061918044, 0.3212703096351641, 0.04216173518558636, -0.24956658359288292, 0.21399369550978437, -0.1591085441520109, -0.15127738874734326, 0.1740211712963441, 0.08521269065985347, 0.12411606218665838, -0.03544066540181281, 0.055980908490977636, -0.15177231249125564, 0.11251622005639707, 0.18616219108705134, -0.030567326473400873, 0.24012065393959775, 0.07607275140745674, 0.18630213253473973, 0.288230607395663, -0.009040402049910934, -0.08848996857020264, -0.2747538992587258, -0.15571513435091167, -0.1854795950519688, 0.04111913443707368, -0.12210599397375892, -0.263169170685989, 0.46092679855578084, 0.15187754369724324, 0.24558089559842997, 0.24266665585010366, 0.2384572482722647, 0.0677540768211817, 0.09359096592251102, -0.03929509222507477, 0.034457599627785385, 0.22955361266127405, -0.04160547989201458, -0.19888005563852323, 0.05557121031041093, 0.1727812627933043]
|
1,803.06807
|
Centralized Caching with Unequal Cache Sizes
|
We address a centralized caching problem with unequal cache sizes. We
consider a system with a server of files connected through a shared error-free
link to a group of cache-enabled users where one subgroup has a larger cache
size than the other. We propose an explicit caching scheme for the considered
system aimed at minimizing the load of worst-case demands over the shared link.
As suggested by numerical evaluations, our scheme improves upon the best
existing explicit scheme by having a lower worst-case load; also, our scheme
performs within a multiplicative factor of 1.11 from the scheme that can be
obtained by solving an optimisation problem in which the number of parameters
grows exponentially with the number of users.
|
cs.IT math.IT
|
we address a centralized caching problem with unequal cache sizes we consider a system with a server of files connected through a shared errorfree link to a group of cacheenabled users where one subgroup has a larger cache size than the other we propose an explicit caching scheme for the considered system aimed at minimizing the load of worstcase demands over the shared link as suggested by numerical evaluations our scheme improves upon the best existing explicit scheme by having a lower worstcase load also our scheme performs within a multiplicative factor of 111 from the scheme that can be obtained by solving an optimisation problem in which the number of parameters grows exponentially with the number of users
|
[['we', 'address', 'a', 'centralized', 'caching', 'problem', 'with', 'unequal', 'cache', 'sizes', 'we', 'consider', 'a', 'system', 'with', 'a', 'server', 'of', 'files', 'connected', 'through', 'a', 'shared', 'errorfree', 'link', 'to', 'a', 'group', 'of', 'cacheenabled', 'users', 'where', 'one', 'subgroup', 'has', 'a', 'larger', 'cache', 'size', 'than', 'the', 'other', 'we', 'propose', 'an', 'explicit', 'caching', 'scheme', 'for', 'the', 'considered', 'system', 'aimed', 'at', 'minimizing', 'the', 'load', 'of', 'worstcase', 'demands', 'over', 'the', 'shared', 'link', 'as', 'suggested', 'by', 'numerical', 'evaluations', 'our', 'scheme', 'improves', 'upon', 'the', 'best', 'existing', 'explicit', 'scheme', 'by', 'having', 'a', 'lower', 'worstcase', 'load', 'also', 'our', 'scheme', 'performs', 'within', 'a', 'multiplicative', 'factor', 'of', '111', 'from', 'the', 'scheme', 'that', 'can', 'be', 'obtained', 'by', 'solving', 'an', 'optimisation', 'problem', 'in', 'which', 'the', 'number', 'of', 'parameters', 'grows', 'exponentially', 'with', 'the', 'number', 'of', 'users']]
|
[-0.21888377142584875, 0.023490997072663392, -0.03626669682327564, -0.009197786215598844, -0.05655445442182802, -0.2281187223387929, 0.190789254523125, 0.36727765092172293, -0.26075319302495287, -0.3385889600618046, 0.0904441153965186, -0.24201572907916388, -0.10342900782134853, 0.1893281560007702, -0.114294335584571, 0.06428272650330602, 0.04246809187462845, 0.05314936205948226, -0.04652402305607723, -0.3272001566306664, 0.31512243217985697, 0.09708561399998535, 0.3049231050614299, 0.010777082075090968, 0.09204503601150853, -0.00602605558164856, -0.04053021177547757, 0.016872980868998532, -0.08028744255270107, 0.10224990488006537, 0.2739438691211692, 0.1551928205235603, 0.3293644878074151, -0.42118290861865054, -0.2019163594197701, 0.08201154614916119, 0.17223312526534335, 0.0804612001378731, -0.04460560858734891, -0.24394983815678842, 0.1343457018310877, -0.251356981455998, -0.05988662379613819, 0.005720984699408046, -0.044843742103480244, 0.0339092527117048, -0.327881962342673, 0.007343636713912241, -0.00961779719296874, 0.02063410161963093, -0.019467237358521513, -0.11787491970883385, 0.04467965880048876, 0.14200198388963686, 0.04596366757084811, 0.03267335287537895, 0.10397725149660426, -0.08800726081831615, -0.1400436226262891, 0.3957689629531145, -0.03231732598410532, -0.23471312099449462, 0.12237661685246755, -0.017288325679245868, -0.10182184837915066, 0.1588791697794775, 0.19532353534684085, 0.10042845327094072, -0.12131245935946203, 0.046452358130271695, -0.11450374781881936, 0.20924810879519445, 0.05375258571139591, 0.05642149415446304, 0.09855948412837852, 0.23172582072370193, 0.168203332046626, 0.16875360598503963, -0.03112933084666103, -0.09246511355105068, -0.2349595889104765, -0.13540792793129422, -0.21338753679282024, 0.009332117429903137, -0.15429406066839935, -0.08758956948373497, 0.3730162190260381, 0.1167315292532141, 0.1944503807267096, 0.15138743379634625, 0.3882087877317637, 0.09709971065695609, 0.0948249588900504, 0.19414186982844933, 0.10321158230179499, 0.017574518805510607, 0.09002100712201018, -0.23607891296944386, 0.0977238584818522, 0.07021645319201991]
|
1,803.06808
|
Local martingales associated with Schramm-Loewner evolutions with
internal symmetry
|
We consider Schramm-Loewner evolutions (SLEs) with internal degrees of
freedom that are associated with representations of affine Lie algebras,
following group theoretical formulation of SLEs. We reconstruct the SLEs
considered by Bettelheim {\it et al.} [Phys. Rev. Lett. {\bf 95}, 251601
(2005)] and Alekseev {\it et al.} [Lett. Math. Phys. {\bf 97}, 243-261 (2011)]
in correlation function formulation. We also explicitly formulate stochastic
differential equations on internal degrees of freedom for Heisenberg algebras
and the affine $\mathfrak{sl}_{2}$. Our formulation enables us to find several
local martingales associated with SLEs with internal degrees of freedom from
computation on a representation of an affine Lie algebra. Indeed, we formulate
local martingales associated with SLEs with internal degrees of freedom
described by Heisenberg algebras and the affine $\mathfrak{sl}_{2}$. We also
find an affine $\mathfrak{sl}_{2}$ symmetry of a space of SLE local martingales
for the affine $\mathfrak{sl}_{2}$.
|
math-ph cond-mat.stat-mech math.MP math.PR math.QA math.RT
|
we consider schrammloewner evolutions sles with internal degrees of freedom that are associated with representations of affine lie algebras following group theoretical formulation of sles we reconstruct the sles considered by bettelheim it et al phys rev lett bf 95 251601 2005 and alekseev it et al lett math phys bf 97 243261 2011 in correlation function formulation we also explicitly formulate stochastic differential equations on internal degrees of freedom for heisenberg algebras and the affine mathfraksl_2 our formulation enables us to find several local martingales associated with sles with internal degrees of freedom from computation on a representation of an affine lie algebra indeed we formulate local martingales associated with sles with internal degrees of freedom described by heisenberg algebras and the affine mathfraksl_2 we also find an affine mathfraksl_2 symmetry of a space of sle local martingales for the affine mathfraksl_2
|
[['we', 'consider', 'schrammloewner', 'evolutions', 'sles', 'with', 'internal', 'degrees', 'of', 'freedom', 'that', 'are', 'associated', 'with', 'representations', 'of', 'affine', 'lie', 'algebras', 'following', 'group', 'theoretical', 'formulation', 'of', 'sles', 'we', 'reconstruct', 'the', 'sles', 'considered', 'by', 'bettelheim', 'it', 'et', 'al', 'phys', 'rev', 'lett', 'bf', '95', '251601', '2005', 'and', 'alekseev', 'it', 'et', 'al', 'lett', 'math', 'phys', 'bf', '97', '243261', '2011', 'in', 'correlation', 'function', 'formulation', 'we', 'also', 'explicitly', 'formulate', 'stochastic', 'differential', 'equations', 'on', 'internal', 'degrees', 'of', 'freedom', 'for', 'heisenberg', 'algebras', 'and', 'the', 'affine', 'mathfraksl_2', 'our', 'formulation', 'enables', 'us', 'to', 'find', 'several', 'local', 'martingales', 'associated', 'with', 'sles', 'with', 'internal', 'degrees', 'of', 'freedom', 'from', 'computation', 'on', 'a', 'representation', 'of', 'an', 'affine', 'lie', 'algebra', 'indeed', 'we', 'formulate', 'local', 'martingales', 'associated', 'with', 'sles', 'with', 'internal', 'degrees', 'of', 'freedom', 'described', 'by', 'heisenberg', 'algebras', 'and', 'the', 'affine', 'mathfraksl_2', 'we', 'also', 'find', 'an', 'affine', 'mathfraksl_2', 'symmetry', 'of', 'a', 'space', 'of', 'sle', 'local', 'martingales', 'for', 'the', 'affine', 'mathfraksl_2']]
|
[-0.13452721019275488, 0.0841581755419611, -0.048497193506253616, -0.06054926756104188, -0.14607145122052836, -0.09251829046489937, 0.0005601216614845076, 0.328251303772309, -0.2791171303418066, -0.28932609262743164, 0.030266732591137824, -0.22144936780179186, -0.212078976225374, 0.13780503325563456, -0.167471344000452, -0.016840428014152815, -0.004488026410607355, -0.004113104260925736, -0.12629283772881275, -0.3037070631299035, 0.263488040851163, 0.06713914382437776, 0.23155506045690605, -0.06556379651052079, 0.21610232603603174, 0.11632610711551804, -0.046526001037896746, -0.042023671046107276, -0.2176949769876436, 0.09373622305741135, 0.2640529743096392, 0.05110643991003079, 0.17844385495243062, -0.38635555556310075, -0.16005273593057479, 0.1206741155457816, 0.08767241791585027, 0.08706460601783224, 0.07595441167775009, -0.3635725591863905, -0.04814937386420622, -0.22637439815859708, -0.18423301801750702, -0.1280810324076031, 0.10645533298208777, -0.011252920216481601, -0.281335767085797, 0.18236274884672768, 0.07804896552115678, 0.14072696068324148, -0.05102430796915931, -0.09194193521980196, -0.12430583054166554, -0.026846538730231777, -0.09976963801226313, 0.051913296032164775, 0.08552249965307834, -0.038574049954435655, -0.24530241344390172, 0.31473636824770695, 0.020795060354950174, -0.27258571942303594, 0.1935660484646048, -0.1256435717589089, -0.20951962465021226, 0.07194776639807969, 0.1352176988613792, 0.1118143606315633, -0.1350861623151494, 0.22848010287567116, -0.10878204724618366, 0.024770164858948972, 0.07847934295755944, 0.03603991138349686, 0.13261864987268512, 0.02511185549332627, 0.007543000166437455, 0.10750734064994114, 0.03415835296410868, -0.16618931041448376, -0.3911086993158928, -0.17227152633391338, -0.10319634693774528, 0.13909692677137042, -0.0990415635025004, -0.10699146950750478, 0.3876710124546662, 0.13477942182882025, 0.1660348317752193, 0.0930175929629643, 0.08748297048067408, 0.10620932719819913, 0.029966451320797206, 0.18325402469241192, 0.16289234926391924, 0.30384407169351885, 0.0009526821593421378, -0.22108511802507563, -0.07965374226249489, 0.18242165346496872]
|
1,803.06809
|
Absorption interferometer based on phase modulation
|
We propose a scheme in which an arbitrary incidence can be made perfectly
reflected/transmitted if a phase setup is adjusted under a specific condition.
We analyze the intracavity field variation as well as the output field with
changing closed-loop phase of atomic system and relative phase of input probe
beams. And we obtain the condition for perfect transmitter or reflector. By
adjusting two phase setups, the medium absorption and light interference can be
controlled so that photon escape from cavity can be modulated, thus the
intensity switching based on phase control can be realized. Then based on the
transmission/reflection analysis, total absorption of this system can be
investigated. Therefore our scheme can be used as an absorption interferometer
to explore the optical absorption in some complicated system. The phase delay
dependent on phi_1 or phi_2 in output light intensity can be applied in the
realization of quantum phase gate and subtle wave filter. And based on this
scheme, we implement the state transfer between perfect transmitter/reflector
and non-perfect coherent photon absorber via relative-phase modulation.
|
quant-ph physics.optics
|
we propose a scheme in which an arbitrary incidence can be made perfectly reflectedtransmitted if a phase setup is adjusted under a specific condition we analyze the intracavity field variation as well as the output field with changing closedloop phase of atomic system and relative phase of input probe beams and we obtain the condition for perfect transmitter or reflector by adjusting two phase setups the medium absorption and light interference can be controlled so that photon escape from cavity can be modulated thus the intensity switching based on phase control can be realized then based on the transmissionreflection analysis total absorption of this system can be investigated therefore our scheme can be used as an absorption interferometer to explore the optical absorption in some complicated system the phase delay dependent on phi_1 or phi_2 in output light intensity can be applied in the realization of quantum phase gate and subtle wave filter and based on this scheme we implement the state transfer between perfect transmitterreflector and nonperfect coherent photon absorber via relativephase modulation
|
[['we', 'propose', 'a', 'scheme', 'in', 'which', 'an', 'arbitrary', 'incidence', 'can', 'be', 'made', 'perfectly', 'reflectedtransmitted', 'if', 'a', 'phase', 'setup', 'is', 'adjusted', 'under', 'a', 'specific', 'condition', 'we', 'analyze', 'the', 'intracavity', 'field', 'variation', 'as', 'well', 'as', 'the', 'output', 'field', 'with', 'changing', 'closedloop', 'phase', 'of', 'atomic', 'system', 'and', 'relative', 'phase', 'of', 'input', 'probe', 'beams', 'and', 'we', 'obtain', 'the', 'condition', 'for', 'perfect', 'transmitter', 'or', 'reflector', 'by', 'adjusting', 'two', 'phase', 'setups', 'the', 'medium', 'absorption', 'and', 'light', 'interference', 'can', 'be', 'controlled', 'so', 'that', 'photon', 'escape', 'from', 'cavity', 'can', 'be', 'modulated', 'thus', 'the', 'intensity', 'switching', 'based', 'on', 'phase', 'control', 'can', 'be', 'realized', 'then', 'based', 'on', 'the', 'transmissionreflection', 'analysis', 'total', 'absorption', 'of', 'this', 'system', 'can', 'be', 'investigated', 'therefore', 'our', 'scheme', 'can', 'be', 'used', 'as', 'an', 'absorption', 'interferometer', 'to', 'explore', 'the', 'optical', 'absorption', 'in', 'some', 'complicated', 'system', 'the', 'phase', 'delay', 'dependent', 'on', 'phi_1', 'or', 'phi_2', 'in', 'output', 'light', 'intensity', 'can', 'be', 'applied', 'in', 'the', 'realization', 'of', 'quantum', 'phase', 'gate', 'and', 'subtle', 'wave', 'filter', 'and', 'based', 'on', 'this', 'scheme', 'we', 'implement', 'the', 'state', 'transfer', 'between', 'perfect', 'transmitterreflector', 'and', 'nonperfect', 'coherent', 'photon', 'absorber', 'via', 'relativephase', 'modulation']]
|
[-0.14769627318200737, 0.18398531574121343, -0.10244113695404003, 0.007347821680602828, -0.04909556131336214, -0.20933600728577703, 0.0649060350203499, 0.4706309379180732, -0.2787279075689915, -0.30457344267388126, 0.09540251116510588, -0.19453459986986193, -0.14130051097041266, 0.2142092247649683, -0.053930181377389697, 0.04947599447251572, 0.0021373351357575785, -0.014652659076217541, -0.032372501725869286, -0.1768842209238193, 0.3018957599190015, 0.04224099790222534, 0.30042076203433765, 0.03367351371938944, 0.1147068057160803, 0.03513537793732491, 0.03758567972700892, 0.027260736855032257, -0.06828635198157852, 0.026442354680927243, 0.21881261282745815, 0.07950733510933472, 0.16138039726623996, -0.42972869791004353, -0.21414640972746074, 0.1051673543521047, 0.14397315814572312, 0.14818419731084817, -0.0414352690702778, -0.31181571073022624, 0.006089557185661414, -0.1436135864324028, -0.09643800280762115, -0.0562724017651181, -0.07164818220341179, 0.04324734453757891, -0.3142176816789056, 0.011840585885687887, -0.015152622896273192, 0.028378356721876673, -0.02611354994318432, -0.02754352632654303, -0.0278952708656259, 0.08816418724203202, -0.06159150185241132, 0.02424552877476665, 0.1610274949956233, -0.09136475734897173, -0.0821463969116223, 0.3700250541250291, -0.12614796779150778, -0.18445871655177865, 0.09878299044003722, -0.13357351878334936, 0.005250716993768264, 0.1586787374528674, 0.19283886259755476, 0.09795374692299247, -0.11533445519034487, -0.0024016121923223655, -0.0045038108481598935, 0.2671377096174425, 0.10898811582508201, 0.10167805163386262, 0.2172058171436535, 0.13425669189531766, 0.07112202893221223, 0.17331034535167986, -0.1082911915761537, -0.04838013253780351, -0.29441030206417157, -0.13828916385274576, -0.17591150953418258, 0.04502935365279477, -0.05724663926087282, -0.11499673599980212, 0.3793775072596394, 0.13667588087878488, 0.18411735970946835, -0.06591725659710113, 0.3589349329643856, 0.19675716222263873, 0.018785948595947267, 0.013550406787544489, 0.29426522876120526, 0.14916269644432717, 0.08502604715752206, -0.2594761454858252, 0.07177121070216308, -0.00459051295940635]
|
1,803.0681
|
Learning to Coordinate in a Decentralized Cognitive Radio Network in
Presence of Jammers
|
Efficient utilization of licensed spectrum in the cognitive radio network is
challenging due to lack of coordination among the Secondary Users (SUs).
Distributed algorithms proposed in the literature aim to maximize the network
throughput by ensuring orthogonal channel allocation for the SUs. However,
these algorithms work under the assumption that all the SUs faithfully follow
the algorithms which may not always hold due to the decentralized nature of the
network. In this paper, we study distributed algorithms that are robust against
malicious behavior (jamming attack). We consider both the cases of jammers
launching coordinated and uncoordinated attacks. In the coordinated attack, the
jammers select non-overlapping channels to attack in each time slot and can
significantly increase the number of collisions for SUs. We setup the problem
in each scenario as a multi-player bandit and develop algorithms. The analysis
shows that when the SUs faithfully implement proposed algorithms, the regret is
constant with high probability. We validate our claims through exhaustive
synthetic experiments and also through a realistic USRP based experiments.
|
eess.SP
|
efficient utilization of licensed spectrum in the cognitive radio network is challenging due to lack of coordination among the secondary users sus distributed algorithms proposed in the literature aim to maximize the network throughput by ensuring orthogonal channel allocation for the sus however these algorithms work under the assumption that all the sus faithfully follow the algorithms which may not always hold due to the decentralized nature of the network in this paper we study distributed algorithms that are robust against malicious behavior jamming attack we consider both the cases of jammers launching coordinated and uncoordinated attacks in the coordinated attack the jammers select nonoverlapping channels to attack in each time slot and can significantly increase the number of collisions for sus we setup the problem in each scenario as a multiplayer bandit and develop algorithms the analysis shows that when the sus faithfully implement proposed algorithms the regret is constant with high probability we validate our claims through exhaustive synthetic experiments and also through a realistic usrp based experiments
|
[['efficient', 'utilization', 'of', 'licensed', 'spectrum', 'in', 'the', 'cognitive', 'radio', 'network', 'is', 'challenging', 'due', 'to', 'lack', 'of', 'coordination', 'among', 'the', 'secondary', 'users', 'sus', 'distributed', 'algorithms', 'proposed', 'in', 'the', 'literature', 'aim', 'to', 'maximize', 'the', 'network', 'throughput', 'by', 'ensuring', 'orthogonal', 'channel', 'allocation', 'for', 'the', 'sus', 'however', 'these', 'algorithms', 'work', 'under', 'the', 'assumption', 'that', 'all', 'the', 'sus', 'faithfully', 'follow', 'the', 'algorithms', 'which', 'may', 'not', 'always', 'hold', 'due', 'to', 'the', 'decentralized', 'nature', 'of', 'the', 'network', 'in', 'this', 'paper', 'we', 'study', 'distributed', 'algorithms', 'that', 'are', 'robust', 'against', 'malicious', 'behavior', 'jamming', 'attack', 'we', 'consider', 'both', 'the', 'cases', 'of', 'jammers', 'launching', 'coordinated', 'and', 'uncoordinated', 'attacks', 'in', 'the', 'coordinated', 'attack', 'the', 'jammers', 'select', 'nonoverlapping', 'channels', 'to', 'attack', 'in', 'each', 'time', 'slot', 'and', 'can', 'significantly', 'increase', 'the', 'number', 'of', 'collisions', 'for', 'sus', 'we', 'setup', 'the', 'problem', 'in', 'each', 'scenario', 'as', 'a', 'multiplayer', 'bandit', 'and', 'develop', 'algorithms', 'the', 'analysis', 'shows', 'that', 'when', 'the', 'sus', 'faithfully', 'implement', 'proposed', 'algorithms', 'the', 'regret', 'is', 'constant', 'with', 'high', 'probability', 'we', 'validate', 'our', 'claims', 'through', 'exhaustive', 'synthetic', 'experiments', 'and', 'also', 'through', 'a', 'realistic', 'usrp', 'based', 'experiments']]
|
[-0.19626965484965372, 0.0039108907146488915, -0.035337944547919664, 0.04202700562788831, -0.08413856740054838, -0.2322731009027099, 0.13382714153062003, 0.4310930786846096, -0.24499702899826362, -0.3052982014439562, 0.07943625572712763, -0.24858593945665394, -0.20776988094234292, 0.11789167021702537, -0.142350145834772, 0.0662592119687949, 0.06732993877547629, 0.022929985654156874, 0.04299494634409819, -0.2942539887680836, 0.2866123192519059, 0.14409754933405886, 0.3861543030751979, 0.02139878272976014, 0.027277393998605584, 0.03174548707217636, -0.023123918109409072, -0.008471881006495523, -0.07128828366022551, 0.06991464980306131, 0.36735116478795293, 0.21459364885847795, 0.3093150082811275, -0.43839977007797537, -0.20210150384535902, 0.13467741934308672, 0.16481998565894387, 0.07445996479501071, -0.03542600616484004, -0.29690152775386675, 0.16364035708144964, -0.21389563638059533, -0.013744610567193697, -0.027777716742061517, -0.0818389375529745, 0.04724369552551413, -0.3301872757181306, -0.016754763342118274, 0.010841910264399998, -0.003263615449780927, -0.0784034046015757, -0.04868963688940686, 0.04473122599764097, 0.17671615784005126, 0.09237982715096543, -0.06997467670726645, 0.1459725288537276, -0.08197967639014891, -0.18707747033468503, 0.3947765135589768, 0.0013201154467156705, -0.17840948302901405, 0.17819236099843264, -0.05291555003701326, -0.15865219490164342, 0.13143724181470187, 0.2630031165721662, 0.1335528660154737, -0.1516764882613857, 0.024340952000142458, -0.05451358908458668, 0.1656501312110135, 0.037477872674764295, 0.07041586300577311, 0.12548937003183014, 0.15829212179352695, 0.16012199844493913, 0.12282066389315707, -0.06810337634044973, -0.11119273991789669, -0.21367404177401433, -0.10417166261331123, -0.20529003727783943, -0.032032396842174314, -0.07093826337847585, -0.07573096965275267, 0.377733534727903, 0.17532518085927756, 0.14529258652097163, 0.13480217312805026, 0.4107978973975953, 0.03264562166569864, 0.031593015380477645, 0.19593818664057727, 0.2209295287817333, 0.03114468135206741, 0.12989831902086735, -0.25125623024890525, 0.12547488245876165, -0.04456254573460148]
|
1,803.06811
|
Categorical Buechi and Parity Conditions via Alternating Fixed Points of
Functors
|
Categorical studies of recursive data structures and their associated
reasoning principles have mostly focused on two extremes: initial algebras and
induction, and final coalgebras and coinduction. In this paper we study their
in-betweens. We formalize notions of alternating fixed points of functors using
constructions that are similar to that of free monads. We find their use in
categorical modeling of accepting run trees under the Buechi and parity
acceptance condition. This modeling abstracts away from states of an automaton;
it can thus be thought of as the "behaviors" of systems with the Buechi or
parity conditions, in a way that follows the tradition of coalgebraic modeling
of system behaviors.
|
cs.LO
|
categorical studies of recursive data structures and their associated reasoning principles have mostly focused on two extremes initial algebras and induction and final coalgebras and coinduction in this paper we study their inbetweens we formalize notions of alternating fixed points of functors using constructions that are similar to that of free monads we find their use in categorical modeling of accepting run trees under the buechi and parity acceptance condition this modeling abstracts away from states of an automaton it can thus be thought of as the behaviors of systems with the buechi or parity conditions in a way that follows the tradition of coalgebraic modeling of system behaviors
|
[['categorical', 'studies', 'of', 'recursive', 'data', 'structures', 'and', 'their', 'associated', 'reasoning', 'principles', 'have', 'mostly', 'focused', 'on', 'two', 'extremes', 'initial', 'algebras', 'and', 'induction', 'and', 'final', 'coalgebras', 'and', 'coinduction', 'in', 'this', 'paper', 'we', 'study', 'their', 'inbetweens', 'we', 'formalize', 'notions', 'of', 'alternating', 'fixed', 'points', 'of', 'functors', 'using', 'constructions', 'that', 'are', 'similar', 'to', 'that', 'of', 'free', 'monads', 'we', 'find', 'their', 'use', 'in', 'categorical', 'modeling', 'of', 'accepting', 'run', 'trees', 'under', 'the', 'buechi', 'and', 'parity', 'acceptance', 'condition', 'this', 'modeling', 'abstracts', 'away', 'from', 'states', 'of', 'an', 'automaton', 'it', 'can', 'thus', 'be', 'thought', 'of', 'as', 'the', 'behaviors', 'of', 'systems', 'with', 'the', 'buechi', 'or', 'parity', 'conditions', 'in', 'a', 'way', 'that', 'follows', 'the', 'tradition', 'of', 'coalgebraic', 'modeling', 'of', 'system', 'behaviors']]
|
[-0.12139645921032988, 0.11136870808951682, -0.13149528499020058, 0.12261560819913736, -0.08359923171411976, -0.1300196139598955, 0.07807321876127928, 0.3829238483061393, -0.34378706103328754, -0.2931962864456215, 0.0961085744859668, -0.23402564540905318, -0.11928435114289944, 0.14767438265348407, -0.11666040219952939, 0.023342188413220423, 0.07916927152459889, 0.022328619127317022, -0.07236650099986475, -0.21006339974270236, 0.39232136427286873, 0.03743021460939889, 0.26998674539262774, -0.00706654276830334, 0.08916566068957629, 0.013735323780026563, -0.033898471971042454, 0.03368888211035584, -0.11802085011617304, 0.1115120786335966, 0.3060233509232704, 0.20805044876221843, 0.2657393564349385, -0.46454712717483443, -0.12638311980602643, 0.08019603053280325, 0.10051668188275976, 0.10853643815412566, -0.002568543034916123, -0.2968722205798797, 0.09356150924469586, -0.196171804613658, -0.0648126956851532, -0.0667910201612998, 0.027936621646707255, 0.04594257090852975, -0.19976945949666616, -0.030591150061270497, 0.16806095009842129, 0.16631806372768349, -0.07819250617952396, -0.1197280748908977, -0.0547472326412659, 0.12564808267591246, 0.03241957727543734, -0.07188501183797295, 0.12001537310425192, -0.1288935009894582, -0.2340521923335338, 0.36358358193602824, -0.004632125477116831, -0.18874113454862876, 0.23743976405994208, -0.09006586904568528, -0.1830374343941609, 0.062208874526226685, 0.1252094583965286, 0.1475578729684154, -0.13166595547658358, 0.10228272039967123, -0.0813770431128365, 0.11778394438119398, 0.10684782407608712, 0.03535156861956542, 0.18449213294553812, 0.14203096235265816, 0.03207085988833569, 0.14920912409541887, 0.03997369309945498, -0.10303309808390353, -0.2989706324706613, -0.1353686779944433, -0.07340951336340772, 0.03144078061019105, -0.01931700057765637, -0.18013455600595518, 0.37227005180385375, 0.17937245672240992, 0.17750581165051293, 0.14108661783609056, 0.2545916612984406, 0.09160012167046296, 0.06742437783395872, 0.015296222667934166, 0.12886740938820704, 0.1553999215959468, 0.09440281307346325, -0.13297178871127674, 0.10516547063081008, 0.08809729983719687]
|
1,803.06812
|
Quantifying the effect of interactions in quantum many-body systems
|
Free fermion systems enjoy a privileged place in physics. With their simple
structure they can explain a variety of effects, ranging from insulating and
metallic behaviours to superconductivity and the integer quantum Hall effect.
Interactions, e.g. in the form of Coulomb repulsion, can dramatically alter
this picture by giving rise to emerging physics that may not resemble free
fermions. Examples of such phenomena include high-temperature
superconductivity, fractional quantum Hall effect, Kondo effect and quantum
spin liquids. The non-perturbative behaviour of such systems remains a major
obstacle to their theoretical understanding that could unlock further
technological applications. Here, we present a pedagogical review of
"interaction distance" [Nat. Commun. 8, 14926 (2017)] -- a systematic method
that quantifies the effect interactions can have on the energy spectrum and on
the quantum correlations of generic many-body systems. In particular, the
interaction distance is a diagnostic tool that identifies the emergent physics
of interacting systems. We illustrate this method on the simple example of a
one-dimensional Fermi-Hubbard dimer.
|
quant-ph cond-mat.stat-mech cond-mat.str-el
|
free fermion systems enjoy a privileged place in physics with their simple structure they can explain a variety of effects ranging from insulating and metallic behaviours to superconductivity and the integer quantum hall effect interactions eg in the form of coulomb repulsion can dramatically alter this picture by giving rise to emerging physics that may not resemble free fermions examples of such phenomena include hightemperature superconductivity fractional quantum hall effect kondo effect and quantum spin liquids the nonperturbative behaviour of such systems remains a major obstacle to their theoretical understanding that could unlock further technological applications here we present a pedagogical review of interaction distance nat commun 8 14926 2017 a systematic method that quantifies the effect interactions can have on the energy spectrum and on the quantum correlations of generic manybody systems in particular the interaction distance is a diagnostic tool that identifies the emergent physics of interacting systems we illustrate this method on the simple example of a onedimensional fermihubbard dimer
|
[['free', 'fermion', 'systems', 'enjoy', 'a', 'privileged', 'place', 'in', 'physics', 'with', 'their', 'simple', 'structure', 'they', 'can', 'explain', 'a', 'variety', 'of', 'effects', 'ranging', 'from', 'insulating', 'and', 'metallic', 'behaviours', 'to', 'superconductivity', 'and', 'the', 'integer', 'quantum', 'hall', 'effect', 'interactions', 'eg', 'in', 'the', 'form', 'of', 'coulomb', 'repulsion', 'can', 'dramatically', 'alter', 'this', 'picture', 'by', 'giving', 'rise', 'to', 'emerging', 'physics', 'that', 'may', 'not', 'resemble', 'free', 'fermions', 'examples', 'of', 'such', 'phenomena', 'include', 'hightemperature', 'superconductivity', 'fractional', 'quantum', 'hall', 'effect', 'kondo', 'effect', 'and', 'quantum', 'spin', 'liquids', 'the', 'nonperturbative', 'behaviour', 'of', 'such', 'systems', 'remains', 'a', 'major', 'obstacle', 'to', 'their', 'theoretical', 'understanding', 'that', 'could', 'unlock', 'further', 'technological', 'applications', 'here', 'we', 'present', 'a', 'pedagogical', 'review', 'of', 'interaction', 'distance', 'nat', 'commun', '8', '14926', '2017', 'a', 'systematic', 'method', 'that', 'quantifies', 'the', 'effect', 'interactions', 'can', 'have', 'on', 'the', 'energy', 'spectrum', 'and', 'on', 'the', 'quantum', 'correlations', 'of', 'generic', 'manybody', 'systems', 'in', 'particular', 'the', 'interaction', 'distance', 'is', 'a', 'diagnostic', 'tool', 'that', 'identifies', 'the', 'emergent', 'physics', 'of', 'interacting', 'systems', 'we', 'illustrate', 'this', 'method', 'on', 'the', 'simple', 'example', 'of', 'a', 'onedimensional', 'fermihubbard', 'dimer']]
|
[-0.15517708007246256, 0.1973574482635852, -0.12051707131151064, 0.08406925591782301, -0.07315657566518642, -0.1769558943928065, 0.034457350879667635, 0.31977736687521946, -0.26567415061172533, -0.3188998979213505, 0.008063473276639688, -0.3089307837032547, -0.20640101600895447, 0.19851388901177838, -0.013605868018180863, 0.010553531144308912, -0.0015519051405492644, -0.024296134103238127, -0.08795703624652276, -0.2139921754715033, 0.29144581630783145, 0.0198766007288102, 0.26982832069514445, 0.1455515446077084, 0.043779409987612004, 0.016609013951212122, 0.06926366733672794, 0.03355527881024394, -0.1372470003818776, 0.07426682253442476, 0.2550077156850817, -0.0028107005022923273, 0.24062308082585596, -0.44657441907354484, -0.250876520891771, 0.05303022252721426, 0.15413181498342127, 0.17765981299185588, -0.09345154696718384, -0.30210966967686187, -0.01353751170946045, -0.21708192621990524, -0.14135674596049944, -0.10917733863647455, 0.01766219778569198, -0.026950717380876007, -0.20011791909017823, 0.095691402745576, 0.0845932488963922, 0.0823711205582403, -0.029132559895515442, -0.09443274502316776, 0.018836548363367105, 0.10815377059775444, -0.013379781194134084, -0.007169753127371424, 0.1503513837590288, -0.17235515634614998, -0.18302285528464665, 0.41817007585217253, -0.004148489753844251, -0.12750263654975438, 0.26880203426866994, -0.1324565077594773, -0.10537948094571203, 0.0889756042464562, 0.19413136417886093, 0.03918644307792598, -0.1394179448277541, 0.12480093232081757, -0.020209468918298286, 0.14003108661072586, -0.028080279551420728, 0.11439744175977411, 0.29589112042420845, 0.1817959683670154, 0.008922766401301041, 0.10691842240812771, -0.053405964912766696, -0.12249375310686468, -0.27757604895488136, -0.17411340033475514, -0.20329191020341372, 0.1114120693032614, -0.03503193348707585, -0.1858874265085963, 0.3982341657887267, 0.206287300146322, 0.1526652971942225, -0.05749445619844357, 0.2126226572339863, 0.09040958849296112, 0.050575576816182695, 0.0035180069986113743, 0.2392715626236257, 0.13414702627185068, 0.09637502777287336, -0.26762086075467795, 0.04951775348830991, 0.04718220343261934]
|
1,803.06813
|
Weakly Supervised Object Localization on grocery shelves using simple
FCN and Synthetic Dataset
|
We propose a weakly supervised method using two algorithms to predict object
bounding boxes given only an image classification dataset. First algorithm is a
simple Fully Convolutional Network (FCN) trained to classify object instances.
We use the property of FCN to return a mask for images larger than training
images to get a primary output segmentation mask during test time by passing an
image pyramid to it. We enhance the FCN output mask into final output bounding
boxes by a Convolutional Encoder-Decoder (ConvAE) viz. the second algorithm.
ConvAE is trained to localize objects on an artificially generated dataset of
output segmentation masks. We demonstrate the effectiveness of this method in
localizing objects in grocery shelves where annotating data for object
detection is hard due to variety of objects. This method can be extended to any
problem domain where collecting images of objects is easy and annotating their
coordinates is hard.
|
cs.CV
|
we propose a weakly supervised method using two algorithms to predict object bounding boxes given only an image classification dataset first algorithm is a simple fully convolutional network fcn trained to classify object instances we use the property of fcn to return a mask for images larger than training images to get a primary output segmentation mask during test time by passing an image pyramid to it we enhance the fcn output mask into final output bounding boxes by a convolutional encoderdecoder convae viz the second algorithm convae is trained to localize objects on an artificially generated dataset of output segmentation masks we demonstrate the effectiveness of this method in localizing objects in grocery shelves where annotating data for object detection is hard due to variety of objects this method can be extended to any problem domain where collecting images of objects is easy and annotating their coordinates is hard
|
[['we', 'propose', 'a', 'weakly', 'supervised', 'method', 'using', 'two', 'algorithms', 'to', 'predict', 'object', 'bounding', 'boxes', 'given', 'only', 'an', 'image', 'classification', 'dataset', 'first', 'algorithm', 'is', 'a', 'simple', 'fully', 'convolutional', 'network', 'fcn', 'trained', 'to', 'classify', 'object', 'instances', 'we', 'use', 'the', 'property', 'of', 'fcn', 'to', 'return', 'a', 'mask', 'for', 'images', 'larger', 'than', 'training', 'images', 'to', 'get', 'a', 'primary', 'output', 'segmentation', 'mask', 'during', 'test', 'time', 'by', 'passing', 'an', 'image', 'pyramid', 'to', 'it', 'we', 'enhance', 'the', 'fcn', 'output', 'mask', 'into', 'final', 'output', 'bounding', 'boxes', 'by', 'a', 'convolutional', 'encoderdecoder', 'convae', 'viz', 'the', 'second', 'algorithm', 'convae', 'is', 'trained', 'to', 'localize', 'objects', 'on', 'an', 'artificially', 'generated', 'dataset', 'of', 'output', 'segmentation', 'masks', 'we', 'demonstrate', 'the', 'effectiveness', 'of', 'this', 'method', 'in', 'localizing', 'objects', 'in', 'grocery', 'shelves', 'where', 'annotating', 'data', 'for', 'object', 'detection', 'is', 'hard', 'due', 'to', 'variety', 'of', 'objects', 'this', 'method', 'can', 'be', 'extended', 'to', 'any', 'problem', 'domain', 'where', 'collecting', 'images', 'of', 'objects', 'is', 'easy', 'and', 'annotating', 'their', 'coordinates', 'is', 'hard']]
|
[-0.021591830481082906, -0.010581598314004353, -0.04255047997434598, 0.07145381507989196, -0.12780367327551986, -0.1941090085814279, -0.00885927862711125, 0.5078341907355934, -0.2750482733040494, -0.35729656857438385, 0.08349567905817232, -0.26736948601398114, -0.13722133913983567, 0.16218386323354836, -0.19401676683195843, 0.06043377469885289, 0.17771626675872737, 0.05664029771562766, -0.031789786484394525, -0.3083174026892143, 0.28855058111602794, 0.012778775256781562, 0.28440605122847734, -0.04092002855425046, 0.18078202349715866, -0.04030325113185304, -0.028908767561252054, -0.0012539696220522495, -0.0072737923002097055, 0.16793871038149716, 0.29477922148716235, 0.19639111300175255, 0.2668598369393196, -0.3888148490616397, -0.18149110667936103, 0.11571926363064228, 0.1468753047488831, 0.12914877150182588, -0.006374347954201889, -0.41201253610386235, 0.15747353291403302, -0.15605695898065697, 0.039052476886206784, -0.11357953863193256, 0.006308171047822799, -0.07000023656449206, -0.31446511924858334, -0.0031916968795042988, 0.08803556700287438, 0.025714368255796365, -0.0790027002992763, -0.013539871299242903, 0.017427260222895122, 0.19659528938889806, -0.033583376422914604, 0.08870533535043029, 0.15026679786702468, -0.2358306857467805, -0.1042759281911925, 0.34153709867717447, -0.008173642710430981, -0.24625892105285782, 0.15132862998084542, -0.0565836860018002, -0.10332698872111537, 0.1870652522098877, 0.25777312696005245, 0.19345553503434704, -0.1610796193818788, -0.04430174221783385, -0.06910760690005043, 0.24016229812106168, 0.0833748427937059, -0.08913481815220989, 0.20487907286135582, 0.2654888964560185, 0.03413499367181086, 0.25044135739193046, -0.2381275694154996, 0.027581690108982492, -0.2236272913759348, -0.11747441576035517, -0.26448946111407634, -0.05709048422569459, -0.08416831421630844, -0.19395207854403132, 0.3846554820350296, 0.2372306399959819, 0.25502697234451016, 0.10372689299637804, 0.3857085887103568, -0.008127798150117332, 0.1633755117450287, 0.051440554749648516, 0.16162930407114579, -0.007108651809520214, 0.0840586348141015, -0.09240223770993415, 0.058235182665993236, 0.1591039148436205]
|
1,803.06814
|
Proton-$\eta^\prime$ interactions at threshold
|
Recent data on photoproduction of $\eta'$ mesons off protons have been
included in the data base for the Bonn-Gatchina partial wave analysis. The real
and imaginary parts of the $S$-wave $\eta^\prime p\to \eta^\prime p$ scattering
amplitude in the threshold region were fit to yield the $\eta^\prime p$
scattering length and the interaction range. This new analysis found
$|a_{\eta^\prime p}|= (0.403\pm 0.015\pm 0.060)$ fm and a phase
$\phi=(87\pm2)^\circ$, while the range parameter is not well-constrained. The
striking behavior of the GRAAL data on the beam asymmetry in the threshold
region suggests that a narrow proton-$\eta'$ resonance might exist. However,
the scattering length was found to be relatively insensitive to the possible
existence of this narrow resonance.
|
nucl-ex
|
recent data on photoproduction of eta mesons off protons have been included in the data base for the bonngatchina partial wave analysis the real and imaginary parts of the swave etaprime pto etaprime p scattering amplitude in the threshold region were fit to yield the etaprime p scattering length and the interaction range this new analysis found a_etaprime p 0403pm 0015pm 0060 fm and a phase phi87pm2circ while the range parameter is not wellconstrained the striking behavior of the graal data on the beam asymmetry in the threshold region suggests that a narrow protoneta resonance might exist however the scattering length was found to be relatively insensitive to the possible existence of this narrow resonance
|
[['recent', 'data', 'on', 'photoproduction', 'of', 'eta', 'mesons', 'off', 'protons', 'have', 'been', 'included', 'in', 'the', 'data', 'base', 'for', 'the', 'bonngatchina', 'partial', 'wave', 'analysis', 'the', 'real', 'and', 'imaginary', 'parts', 'of', 'the', 'swave', 'etaprime', 'pto', 'etaprime', 'p', 'scattering', 'amplitude', 'in', 'the', 'threshold', 'region', 'were', 'fit', 'to', 'yield', 'the', 'etaprime', 'p', 'scattering', 'length', 'and', 'the', 'interaction', 'range', 'this', 'new', 'analysis', 'found', 'a_etaprime', 'p', '0403pm', '0015pm', '0060', 'fm', 'and', 'a', 'phase', 'phi87pm2circ', 'while', 'the', 'range', 'parameter', 'is', 'not', 'wellconstrained', 'the', 'striking', 'behavior', 'of', 'the', 'graal', 'data', 'on', 'the', 'beam', 'asymmetry', 'in', 'the', 'threshold', 'region', 'suggests', 'that', 'a', 'narrow', 'protoneta', 'resonance', 'might', 'exist', 'however', 'the', 'scattering', 'length', 'was', 'found', 'to', 'be', 'relatively', 'insensitive', 'to', 'the', 'possible', 'existence', 'of', 'this', 'narrow', 'resonance']]
|
[-0.14275231504359762, 0.1801889704368371, -0.11506692482041078, 0.11695786851965864, -0.08215542818914663, -0.09982612284387017, 0.06466992605511132, 0.3293499190628797, -0.21316004019264165, -0.2459897497052176, -0.017276845972036926, -0.3391215149984435, -0.032933080526958175, 0.16263023814236796, 0.0950947192760797, 0.09900440326010859, 0.0535317143112807, 0.057477977487619396, -0.019095478821147302, -0.14486629791087932, 0.317323389058295, 0.030294557460709602, 0.25656956399010644, 0.14923796513294046, -0.026565021809047875, 0.04396479599060373, 0.011972499830933573, -0.07921899588325539, -0.14530732578563615, 0.019839787201301473, 0.29582521109894205, 0.05014308135713207, 0.14347452313328782, -0.3330932496585422, -0.19438073922552773, 0.11622612761031534, 0.21379370766750597, 0.0656248091985912, -0.012804115226760775, -0.3142028769797033, 0.09297228341099915, -0.13406247247916622, -0.15243424779865555, -0.048417815120538346, 0.09485082981294138, -0.026957319696488378, -0.32225336530875115, 0.0768385374087941, -0.0011962123093539263, 0.08032871699925545, -0.05706320449013498, -0.211589968482217, 0.007450082716909614, 0.03063499309995153, 0.11992736306536507, 0.09855808305075846, 0.14720772477789773, -0.08271555520007717, -0.04268909809714485, 0.3441739452516173, -0.019983708269071875, -0.12513245653092592, 0.12103906172319306, -0.22383284711631368, -0.08757299645006791, 0.2490307129982456, 0.19727721588837133, 0.06049279830007403, -0.12659358222306044, 0.08363137776629899, -0.0560185235529364, 0.22934996398786703, 0.12197570522894731, 0.018524504388338543, 0.145952836014666, 0.18242203764751688, -0.04714595475905315, 0.05033120234719234, -0.1510401315156471, -0.04982633192379548, -0.3309433257693912, -0.05061162860543878, -0.1011547807704758, 0.036784840412626696, -0.05594422538890105, -0.09168487173077222, 0.3432897900541623, 0.06256858230912471, 0.28657116570619046, -0.024053455246528528, 0.2914908122908962, 0.12394690007676144, 0.09171726452270607, 0.027474526701881004, 0.33236316857054027, 0.16404461764587877, 0.15293070054109636, -0.28577944955962653, 0.06958916606402511, -0.06101665771692186]
|
1,803.06815
|
ESPNet: Efficient Spatial Pyramid of Dilated Convolutions for Semantic
Segmentation
|
We introduce a fast and efficient convolutional neural network, ESPNet, for
semantic segmentation of high resolution images under resource constraints.
ESPNet is based on a new convolutional module, efficient spatial pyramid (ESP),
which is efficient in terms of computation, memory, and power. ESPNet is 22
times faster (on a standard GPU) and 180 times smaller than the
state-of-the-art semantic segmentation network PSPNet, while its category-wise
accuracy is only 8% less. We evaluated ESPNet on a variety of semantic
segmentation datasets including Cityscapes, PASCAL VOC, and a breast biopsy
whole slide image dataset. Under the same constraints on memory and
computation, ESPNet outperforms all the current efficient CNN networks such as
MobileNet, ShuffleNet, and ENet on both standard metrics and our newly
introduced performance metrics that measure efficiency on edge devices. Our
network can process high resolution images at a rate of 112 and 9 frames per
second on a standard GPU and edge device, respectively.
|
cs.CV
|
we introduce a fast and efficient convolutional neural network espnet for semantic segmentation of high resolution images under resource constraints espnet is based on a new convolutional module efficient spatial pyramid esp which is efficient in terms of computation memory and power espnet is 22 times faster on a standard gpu and 180 times smaller than the stateoftheart semantic segmentation network pspnet while its categorywise accuracy is only 8 less we evaluated espnet on a variety of semantic segmentation datasets including cityscapes pascal voc and a breast biopsy whole slide image dataset under the same constraints on memory and computation espnet outperforms all the current efficient cnn networks such as mobilenet shufflenet and enet on both standard metrics and our newly introduced performance metrics that measure efficiency on edge devices our network can process high resolution images at a rate of 112 and 9 frames per second on a standard gpu and edge device respectively
|
[['we', 'introduce', 'a', 'fast', 'and', 'efficient', 'convolutional', 'neural', 'network', 'espnet', 'for', 'semantic', 'segmentation', 'of', 'high', 'resolution', 'images', 'under', 'resource', 'constraints', 'espnet', 'is', 'based', 'on', 'a', 'new', 'convolutional', 'module', 'efficient', 'spatial', 'pyramid', 'esp', 'which', 'is', 'efficient', 'in', 'terms', 'of', 'computation', 'memory', 'and', 'power', 'espnet', 'is', '22', 'times', 'faster', 'on', 'a', 'standard', 'gpu', 'and', '180', 'times', 'smaller', 'than', 'the', 'stateoftheart', 'semantic', 'segmentation', 'network', 'pspnet', 'while', 'its', 'categorywise', 'accuracy', 'is', 'only', '8', 'less', 'we', 'evaluated', 'espnet', 'on', 'a', 'variety', 'of', 'semantic', 'segmentation', 'datasets', 'including', 'cityscapes', 'pascal', 'voc', 'and', 'a', 'breast', 'biopsy', 'whole', 'slide', 'image', 'dataset', 'under', 'the', 'same', 'constraints', 'on', 'memory', 'and', 'computation', 'espnet', 'outperforms', 'all', 'the', 'current', 'efficient', 'cnn', 'networks', 'such', 'as', 'mobilenet', 'shufflenet', 'and', 'enet', 'on', 'both', 'standard', 'metrics', 'and', 'our', 'newly', 'introduced', 'performance', 'metrics', 'that', 'measure', 'efficiency', 'on', 'edge', 'devices', 'our', 'network', 'can', 'process', 'high', 'resolution', 'images', 'at', 'a', 'rate', 'of', '112', 'and', '9', 'frames', 'per', 'second', 'on', 'a', 'standard', 'gpu', 'and', 'edge', 'device', 'respectively']]
|
[-0.08188489436382247, -0.029649240799969244, -0.00554372244514525, 0.03952161286279959, -0.06552477291514797, -0.1766868777452938, 0.03784854189763146, 0.4742572759608588, -0.18381248869362377, -0.3644965259538543, 0.129164276604781, -0.26182795126111275, -0.12452913394926356, 0.23604318133945906, -0.15130830919933355, 0.08120046901937214, 0.18860987034596263, 0.05509965098913639, -0.08484991779701123, -0.2964515171757328, 0.21768121040245939, 0.08880583734341686, 0.3935122745126606, 0.05531369139803686, 0.18989837048274855, -0.06765629495193641, -0.024810914798159032, -0.03188557694140341, -0.03849765647736926, 0.17364857472749728, 0.20939457016966997, 0.17826776125903931, 0.2694970779601605, -0.4259448599862686, -0.19353665159038838, 0.0361911500563785, 0.10934088517941774, 0.022477710117950224, 0.005676011005867152, -0.33647180443569535, 0.15821905411148984, -0.17847910531826558, 0.1212227934221324, -0.11718724835063181, 0.02209265010521537, -0.03775550108740947, -0.2789987579273481, 0.08380446951055238, 0.043262700547253896, 0.0636516323741225, -0.03487634885607423, -0.14879831441738192, 0.0036075623315428534, 0.11940641466963796, -0.08428398309774968, 0.11019679625488578, 0.18563408171758056, -0.22899587513022726, -0.1617768578651932, 0.3549036822326842, -0.0729088105739192, -0.19739620494055413, 0.19922538356434916, -0.02735189462621366, -0.12932188757094404, 0.12045987292733644, 0.21571217034492762, 0.13524184743423134, -0.13597223996935834, 0.008470103099206162, -0.020102133121221295, 0.21410138962730285, 0.10746580281805608, 0.01975814430343528, 0.1328638217396914, 0.3181328567345777, 0.058180843573439146, 0.11388795529642413, -0.22618598491103659, -0.04763747773869263, -0.1813670925390456, -0.16093277106842688, -0.19316753446905605, -0.017958689689816485, -0.17671232838099146, -0.1268307918847929, 0.4482669101246903, 0.1936867355308946, 0.18717970950829407, 0.15366061739698653, 0.37812843953199204, -0.008677111757588722, 0.19026087641198705, 0.12587997124139821, 0.1262004391620717, -0.0018217317459564054, 0.13170385748718774, -0.1407609797264975, 0.023808218592837934, 0.07429010075246614]
|
1,803.06816
|
Swapping Colored Tokens on Graphs
|
We investigate the computational complexity of the following problem. We are
given a graph in which each vertex has an initial and a target color. Each pair
of adjacent vertices can swap their current colors. Our goal is to perform the
minimum number of swaps so that the current and target colors agree at each
vertex. When the colors are chosen from {1,2,...,c}, we call this problem
c-Colored Token Swapping since the current color of a vertex can be seen as a
colored token placed on the vertex. We show that c-Colored Token Swapping is
NP-complete for c = 3 even if input graphs are restricted to connected planar
bipartite graphs of maximum degree 3. We then show that 2-Colored Token
Swapping can be solved in polynomial time for general graphs and in linear time
for trees. Besides, we show that, the problem for complete graphs is
fixed-parameter tractable when parameterized by the number of colors, while it
is known to be NP-complete when the number of colors is unbounded.
|
cs.DS
|
we investigate the computational complexity of the following problem we are given a graph in which each vertex has an initial and a target color each pair of adjacent vertices can swap their current colors our goal is to perform the minimum number of swaps so that the current and target colors agree at each vertex when the colors are chosen from 12c we call this problem ccolored token swapping since the current color of a vertex can be seen as a colored token placed on the vertex we show that ccolored token swapping is npcomplete for c 3 even if input graphs are restricted to connected planar bipartite graphs of maximum degree 3 we then show that 2colored token swapping can be solved in polynomial time for general graphs and in linear time for trees besides we show that the problem for complete graphs is fixedparameter tractable when parameterized by the number of colors while it is known to be npcomplete when the number of colors is unbounded
|
[['we', 'investigate', 'the', 'computational', 'complexity', 'of', 'the', 'following', 'problem', 'we', 'are', 'given', 'a', 'graph', 'in', 'which', 'each', 'vertex', 'has', 'an', 'initial', 'and', 'a', 'target', 'color', 'each', 'pair', 'of', 'adjacent', 'vertices', 'can', 'swap', 'their', 'current', 'colors', 'our', 'goal', 'is', 'to', 'perform', 'the', 'minimum', 'number', 'of', 'swaps', 'so', 'that', 'the', 'current', 'and', 'target', 'colors', 'agree', 'at', 'each', 'vertex', 'when', 'the', 'colors', 'are', 'chosen', 'from', '12c', 'we', 'call', 'this', 'problem', 'ccolored', 'token', 'swapping', 'since', 'the', 'current', 'color', 'of', 'a', 'vertex', 'can', 'be', 'seen', 'as', 'a', 'colored', 'token', 'placed', 'on', 'the', 'vertex', 'we', 'show', 'that', 'ccolored', 'token', 'swapping', 'is', 'npcomplete', 'for', 'c', '3', 'even', 'if', 'input', 'graphs', 'are', 'restricted', 'to', 'connected', 'planar', 'bipartite', 'graphs', 'of', 'maximum', 'degree', '3', 'we', 'then', 'show', 'that', '2colored', 'token', 'swapping', 'can', 'be', 'solved', 'in', 'polynomial', 'time', 'for', 'general', 'graphs', 'and', 'in', 'linear', 'time', 'for', 'trees', 'besides', 'we', 'show', 'that', 'the', 'problem', 'for', 'complete', 'graphs', 'is', 'fixedparameter', 'tractable', 'when', 'parameterized', 'by', 'the', 'number', 'of', 'colors', 'while', 'it', 'is', 'known', 'to', 'be', 'npcomplete', 'when', 'the', 'number', 'of', 'colors', 'is', 'unbounded']]
|
[-0.10217458013852937, 0.16478028009893972, -0.019359743060026118, 0.05310671467929197, -0.12022538966025341, -0.19232890463417626, 0.05793896730239751, 0.4603703065910349, -0.30824324958158666, -0.32051069467168675, 0.08639082257544964, -0.2903965063470267, -0.09561422636412834, 0.1037538626132059, -0.13411239773784517, 0.019654140766357353, 0.1260368422461817, 0.12253922685848538, 0.04671902279920612, -0.3175709881310381, 0.2854050122939888, -0.06280261122472805, 0.17598951375938554, 0.07527323294783661, 0.08791030063321428, 0.05297510398651016, -0.0013506634783594918, 0.1107265427267763, -0.11795864626438049, 0.024071860151949544, 0.2727823543621326, 0.18836936126215129, 0.2391970600662808, -0.4213446966488157, -0.12262510288418574, 0.20498935062887377, 0.11434173599001263, 0.13721234695751705, 0.01336675422395629, -0.1855592259299561, 0.13839995020383297, -0.12506086416978227, -0.07040541964864148, 0.04604826199604452, 0.10684308905936998, 0.013745309751599299, -0.28351424376000844, -0.04247815918574143, 0.080050998218578, -0.010200209821954635, 0.0633750821480296, -0.15136612473350547, -0.08035964165130884, 0.1366303140879953, -0.07824595117825772, 0.07518022317720367, 0.03521245961578993, -0.16694511074335838, -0.18800769965357242, 0.3771842093173877, -0.006522789098785297, -0.18359486841095182, 0.12513962971148518, -0.10104530540256369, -0.16794793856793122, 0.07009338019636167, 0.11867130841348959, 0.16770874583796108, -0.12646550557032962, 0.08999690746223091, -0.12575567796958623, 0.13889417920768612, 0.1269146172776157, 0.01999272917123159, 0.16695148948498742, 0.14951462392177234, 0.1567376036687407, 0.20621569582037957, -0.029089487070967195, -0.018258883030230964, -0.2895628902937159, -0.07569497368111104, -0.25628956441337675, 0.012243172721441329, -0.15678121228042793, -0.1344806232913976, 0.42688572209482717, 0.14206194961250665, 0.20173952138304888, 0.12475970354738518, 0.28027874233267275, 0.13868740507671554, 0.06431574020851624, 0.1574325675844661, 0.15425892935558802, 0.0749307515157508, -0.02936784226651243, -0.20760882219724006, 0.09510294629189257, 0.11203323934673602]
|
1,803.06817
|
Annular Representations of Free Product Categories
|
We provide a description of the annular representation category of the free
product of two rigid C*-tensor categories.
|
math.QA math.CT math.OA
|
we provide a description of the annular representation category of the free product of two rigid ctensor categories
|
[['we', 'provide', 'a', 'description', 'of', 'the', 'annular', 'representation', 'category', 'of', 'the', 'free', 'product', 'of', 'two', 'rigid', 'ctensor', 'categories']]
|
[-0.18989793583750725, 0.05045759186355604, -0.11971193559778233, 0.0362981456435389, -0.05369103958623277, -0.0943470323820495, -0.07405579540257652, 0.4120325884885258, -0.3469553275499493, -0.23161012591380212, 0.06072364951897827, -0.1652480142398013, -0.08897569651405017, 0.16128969358073342, -0.15741175273433328, -0.10321295292427142, 0.14831793792028394, 0.19951384534134478, -0.07785132879184352, -0.1477299371941222, 0.46370932025214034, -0.11592643438941902, 0.29295488219294286, 0.01795092835608456, 0.11948155766973893, 0.05207773463593589, -0.05682973480886883, 0.014044664800167084, -0.22979375489133722, 0.30241453564829296, 0.2691009829027785, 0.06425867105523746, 0.15836780410285833, -0.4192393169634872, -0.059616554942395955, 0.09467302759488423, 0.0698698161997729, 0.04313940593662361, -0.023471163171860907, -0.3127646669745445, 0.019406688270262547, -0.38485178930891883, -0.07529757813447052, -0.04971965071227816, 0.062326022941205234, -0.0041293415447904, -0.2254194672892077, -0.029237907483345933, 0.1202835790399048, 0.12414828993173109, -0.20895796817623907, -0.04217241735508045, -0.032287116110738784, 0.2051963091879669, -0.05509481196188264, -0.05204211382402314, 0.15684293813279104, -0.19730923490391838, -0.08747755166971022, 0.3820122550759051, -0.04734742486228546, -0.27913557427624863, 0.22432906118532023, -0.11567789248915182, -0.07645056639901465, 0.15779206389561296, 0.019828101413117513, 0.11759000602695677, -0.05157560348096821, 0.1456612409092486, -0.23676050371593899, 0.05527234594855043, 0.12483393302601245, 0.01238919970475965, 0.1981875008593003, 0.19903464056551456, 0.006336555298831727, 0.21421348864936995, -0.0453080579948922, -0.053016928748952016, -0.4207427278161049, -0.22986565773478812, -0.0447380301840086, 0.09566095843911171, -0.05272089558032652, -0.2898033774561352, 0.4387315693828795, 0.03395951187445058, 0.18495659669861197, 0.11220064723036355, 0.2864541115446223, -0.0029775373016794524, 0.030329727684147656, -0.0462534147211247, 0.11986221455865437, 0.2420447592675272, -0.0994955836277869, -0.006587804812524054, -0.08886753554300715, 0.2645892968608273]
|
1,803.06818
|
Artificial Intelligence Enabled Software Defined Networking: A
Comprehensive Overview
|
Software defined networking (SDN) represents a promising networking
architecture that combines central management and network programmability. SDN
separates the control plane from the data plane and moves the network
management to a central point, called the controller, that can be programmed
and used as the brain of the network. Recently, the research community has
showed an increased tendency to benefit from the recent advancements in the
artificial intelligence (AI) field to provide learning abilities and better
decision making in SDN. In this study, we provide a detailed overview of the
recent efforts to include AI in SDN. Our study showed that the research efforts
focused on three main sub-fields of AI namely: machine learning,
meta-heuristics and fuzzy inference systems. Accordingly, in this work we
investigate their different application areas and potential use, as well as the
improvements achieved by including AI-based techniques in the SDN paradigm.
|
cs.AI cs.NI
|
software defined networking sdn represents a promising networking architecture that combines central management and network programmability sdn separates the control plane from the data plane and moves the network management to a central point called the controller that can be programmed and used as the brain of the network recently the research community has showed an increased tendency to benefit from the recent advancements in the artificial intelligence ai field to provide learning abilities and better decision making in sdn in this study we provide a detailed overview of the recent efforts to include ai in sdn our study showed that the research efforts focused on three main subfields of ai namely machine learning metaheuristics and fuzzy inference systems accordingly in this work we investigate their different application areas and potential use as well as the improvements achieved by including aibased techniques in the sdn paradigm
|
[['software', 'defined', 'networking', 'sdn', 'represents', 'a', 'promising', 'networking', 'architecture', 'that', 'combines', 'central', 'management', 'and', 'network', 'programmability', 'sdn', 'separates', 'the', 'control', 'plane', 'from', 'the', 'data', 'plane', 'and', 'moves', 'the', 'network', 'management', 'to', 'a', 'central', 'point', 'called', 'the', 'controller', 'that', 'can', 'be', 'programmed', 'and', 'used', 'as', 'the', 'brain', 'of', 'the', 'network', 'recently', 'the', 'research', 'community', 'has', 'showed', 'an', 'increased', 'tendency', 'to', 'benefit', 'from', 'the', 'recent', 'advancements', 'in', 'the', 'artificial', 'intelligence', 'ai', 'field', 'to', 'provide', 'learning', 'abilities', 'and', 'better', 'decision', 'making', 'in', 'sdn', 'in', 'this', 'study', 'we', 'provide', 'a', 'detailed', 'overview', 'of', 'the', 'recent', 'efforts', 'to', 'include', 'ai', 'in', 'sdn', 'our', 'study', 'showed', 'that', 'the', 'research', 'efforts', 'focused', 'on', 'three', 'main', 'subfields', 'of', 'ai', 'namely', 'machine', 'learning', 'metaheuristics', 'and', 'fuzzy', 'inference', 'systems', 'accordingly', 'in', 'this', 'work', 'we', 'investigate', 'their', 'different', 'application', 'areas', 'and', 'potential', 'use', 'as', 'well', 'as', 'the', 'improvements', 'achieved', 'by', 'including', 'aibased', 'techniques', 'in', 'the', 'sdn', 'paradigm']]
|
[-0.10974968856197387, -0.02481345666087255, -0.059922843249769854, 0.007100124249780193, -0.123210226498187, -0.1403783623556517, 0.04631620688261847, 0.41268138521134035, -0.2706590254810218, -0.32329671456134074, 0.0930920733292013, -0.2390990311292651, -0.2396373723008453, 0.2325585620694679, -0.12898212470024925, 0.08877527967018828, 0.05003417178124113, 0.012068325344693197, -0.0044614963778868725, -0.24196978074208234, 0.3079462214787682, 0.04001857024260273, 0.37386744835873276, 0.07333174698080307, 0.06266423054629529, 0.0020718580169271526, -0.034571631825911775, 0.011087863209293773, -0.10650154679597233, 0.2151656857698084, 0.3645644991161072, 0.2694138191251263, 0.39250536946809456, -0.4469107297721179, -0.2426845239099013, 0.04741867222625456, 0.18529685749353408, 0.07534703890129618, -0.06111337266597667, -0.31769578662152365, 0.05780708066934133, -0.22784137313113842, -0.09193363982214503, -0.09310126939488651, 0.007500243792230621, 0.036718475305051096, -0.1891394604558814, -0.11398209384578752, 0.04577764579212956, 0.11256558830811553, -0.009996940094773492, -0.1269466664374181, 0.003255305384375053, 0.17596328344948794, 0.026273905800349297, 0.124242055854977, 0.1935332971465557, -0.1539977833992253, -0.23039437006610408, 0.3454929837663594, 0.014374015100096187, -0.1305717854530946, 0.1962547397036871, -0.004311857311284705, -0.2021752756522739, 0.02300630139875902, 0.24829265923631594, 0.031045549076723498, -0.1732884427589964, 0.08493815799967756, 0.0376527584987144, 0.12428396369098552, 0.0038346285678203893, -0.004433088964616803, 0.22966502251084384, 0.2782873757094247, 0.11473608052689735, 0.13281592505598083, -0.053728541402363106, -0.13945803117032532, -0.1791379064551159, -0.15518256557359017, -0.13522625855036233, 0.007772565192992684, -0.04515374380690907, -0.13391316224731606, 0.40729592472621023, 0.22009407874030915, 0.15137210189466913, 0.03751290940890114, 0.36383507406492144, 0.025535312323346222, 0.14535204765278437, 0.10128319650977748, 0.2306084153154699, 0.05889277487565853, 0.21820529809776593, -0.17054630686092023, 0.08004438085322052, -0.0260859917058316]
|
1,803.06819
|
Generalized Hermite Polynomials and Monodromy-Free Schr\"odinger
Operators
|
The paper gives a review of recent progress in the classification of
monodromy-free Schr\"odinger operators with rational potentials. We concentrate
on a class of potentials constituted by generalized Hermite polynomials. These
polynomials defined as Wronskians of classic Hermite polynomials appear in a
number of mathematical physics problems as well as in the theory of random
matrices and 1D SUSY quantum mechanics. Being quadratic at infinity, those
potentials demonstrate localized oscillatory behavior near the origin. We
derive an explicit condition of non-singularity of the corresponding potentials
and estimate a localization range with respect to indices of polynomials and
distribution of their zeros in the complex plane. It turns out that 1D SUSY
quantum non-singular potentials come as a dressing of the harmonic oscillator
by polynomial Heisenberg algebra ladder operators. To this end, all generalized
Hermite polynomials are produced by appropriate periodic closure of this
algebra which leads to rational solutions of the Painlev\'e IV equation. We
discuss the structure of the discrete spectrum of Schr\"odinger operators and
its link to the monodromy-free condition.
|
nlin.SI
|
the paper gives a review of recent progress in the classification of monodromyfree schrodinger operators with rational potentials we concentrate on a class of potentials constituted by generalized hermite polynomials these polynomials defined as wronskians of classic hermite polynomials appear in a number of mathematical physics problems as well as in the theory of random matrices and 1d susy quantum mechanics being quadratic at infinity those potentials demonstrate localized oscillatory behavior near the origin we derive an explicit condition of nonsingularity of the corresponding potentials and estimate a localization range with respect to indices of polynomials and distribution of their zeros in the complex plane it turns out that 1d susy quantum nonsingular potentials come as a dressing of the harmonic oscillator by polynomial heisenberg algebra ladder operators to this end all generalized hermite polynomials are produced by appropriate periodic closure of this algebra which leads to rational solutions of the painleve iv equation we discuss the structure of the discrete spectrum of schrodinger operators and its link to the monodromyfree condition
|
[['the', 'paper', 'gives', 'a', 'review', 'of', 'recent', 'progress', 'in', 'the', 'classification', 'of', 'monodromyfree', 'schrodinger', 'operators', 'with', 'rational', 'potentials', 'we', 'concentrate', 'on', 'a', 'class', 'of', 'potentials', 'constituted', 'by', 'generalized', 'hermite', 'polynomials', 'these', 'polynomials', 'defined', 'as', 'wronskians', 'of', 'classic', 'hermite', 'polynomials', 'appear', 'in', 'a', 'number', 'of', 'mathematical', 'physics', 'problems', 'as', 'well', 'as', 'in', 'the', 'theory', 'of', 'random', 'matrices', 'and', '1d', 'susy', 'quantum', 'mechanics', 'being', 'quadratic', 'at', 'infinity', 'those', 'potentials', 'demonstrate', 'localized', 'oscillatory', 'behavior', 'near', 'the', 'origin', 'we', 'derive', 'an', 'explicit', 'condition', 'of', 'nonsingularity', 'of', 'the', 'corresponding', 'potentials', 'and', 'estimate', 'a', 'localization', 'range', 'with', 'respect', 'to', 'indices', 'of', 'polynomials', 'and', 'distribution', 'of', 'their', 'zeros', 'in', 'the', 'complex', 'plane', 'it', 'turns', 'out', 'that', '1d', 'susy', 'quantum', 'nonsingular', 'potentials', 'come', 'as', 'a', 'dressing', 'of', 'the', 'harmonic', 'oscillator', 'by', 'polynomial', 'heisenberg', 'algebra', 'ladder', 'operators', 'to', 'this', 'end', 'all', 'generalized', 'hermite', 'polynomials', 'are', 'produced', 'by', 'appropriate', 'periodic', 'closure', 'of', 'this', 'algebra', 'which', 'leads', 'to', 'rational', 'solutions', 'of', 'the', 'painleve', 'iv', 'equation', 'we', 'discuss', 'the', 'structure', 'of', 'the', 'discrete', 'spectrum', 'of', 'schrodinger', 'operators', 'and', 'its', 'link', 'to', 'the', 'monodromyfree', 'condition']]
|
[-0.15815756543875173, 0.10071560562336832, -0.0653090296600144, 0.057779471223448335, -0.08322786062084095, -0.16078596390772956, -0.0210596879539459, 0.30459407605988864, -0.29431264081747854, -0.1987634467513999, 0.09295565884852738, -0.2756151892569696, -0.18569978387643268, 0.17113707728682595, -0.03350878214506909, 0.09299597368801694, 0.028547523475555312, 0.054809232648505374, -0.13742629570621173, -0.25202891538542327, 0.3563150337363897, 0.014036067747944143, 0.19096948170281816, 0.02147087700486313, 0.07721950065075192, -0.010791211930471797, -0.011997651236015372, -0.06762140122077125, -0.1085029171448865, 0.12677687683500088, 0.24766717041127903, 0.06970058450865191, 0.2298565774595603, -0.4129744181084598, -0.1711472617272764, 0.16220468768124405, 0.17403448924021578, 0.06379903443523163, -0.002822327019435592, -0.28896801708655995, 0.0066616732882996375, -0.149848070526279, -0.25466083529741007, -0.08565409948540376, 0.014710128621393165, 0.09544433729024604, -0.2618343472676379, 0.07994929590664511, 0.07694308623518567, 0.09698149830314093, -0.04733070297515951, -0.10716566100965666, -0.0257251474405314, 0.03764138103538561, -0.008627699883004953, -0.00855977067095769, 0.06517228997464097, -0.12905952297854995, -0.13864169930389456, 0.3982532788284643, -0.03749888984291533, -0.25477175400077995, 0.13691021934785166, -0.16074283801149145, -0.13761049899716624, 0.09229612325014937, 0.13070487826087968, 0.11244971049018204, -0.11788097328674264, 0.171351074970728, -0.05130166921569684, 0.06871081778825651, 0.1274717387399463, 0.03603201490274609, 0.16901211904870822, 0.031827392763198285, 0.05136698807947078, 0.1584042473587879, 0.0339275031387102, -0.14959183659913494, -0.34655623423845267, -0.13271017900538132, -0.18715112018371868, 0.09247510843276761, -0.11877415886894681, -0.23972828145853656, 0.45556415904443276, 0.09097350845492423, 0.20022655182333968, 0.08308584164072716, 0.1839229554197816, 0.19384282643007938, 0.03789766484649505, -0.006874925689771771, 0.18559052482339403, 0.2168546600600124, 0.10042398948449814, -0.1906245896419467, -0.05041994528302132, 0.1821731489996404]
|
1,803.0682
|
Rescaled weighted determinantal random balls
|
We consider a collection of weighted Euclidian random balls in R^d
distributed according a determinantal point process. We perform a zoom-out
procedure by shrinking the radii while increasing the number of balls. We
observe that the repulsion between the balls is erased and three different
regimes are obtained, the same as in the weighted Poissonian case.
|
math.PR
|
we consider a collection of weighted euclidian random balls in rd distributed according a determinantal point process we perform a zoomout procedure by shrinking the radii while increasing the number of balls we observe that the repulsion between the balls is erased and three different regimes are obtained the same as in the weighted poissonian case
|
[['we', 'consider', 'a', 'collection', 'of', 'weighted', 'euclidian', 'random', 'balls', 'in', 'rd', 'distributed', 'according', 'a', 'determinantal', 'point', 'process', 'we', 'perform', 'a', 'zoomout', 'procedure', 'by', 'shrinking', 'the', 'radii', 'while', 'increasing', 'the', 'number', 'of', 'balls', 'we', 'observe', 'that', 'the', 'repulsion', 'between', 'the', 'balls', 'is', 'erased', 'and', 'three', 'different', 'regimes', 'are', 'obtained', 'the', 'same', 'as', 'in', 'the', 'weighted', 'poissonian', 'case']]
|
[-0.11662068405920374, 0.18096590496134013, -0.05772871779377705, 0.07435471464659063, 0.04522537509079224, -0.11003509357604864, 0.08376406542707368, 0.388138636747109, -0.2489224033197388, -0.2162487785930612, 0.0779193879945004, -0.34565469988488723, -0.10148166765325836, 0.13115257706626185, -0.08544046948996506, 0.04451171386920448, 0.054242629483009557, 0.049912146043165455, -0.07004101978132635, -0.2819919053706274, 0.3592742854982914, -0.019436664363768483, 0.26627440261654556, -0.004312127329675215, 0.08307665905782155, 0.049282249936368316, -0.058064577469070046, 0.0805573570571921, -0.15796128675057325, 0.06720950039536026, 0.18964782407108163, 0.09574080677703023, 0.30983009448807153, -0.396326650100361, -0.19835161672173335, 0.19978647264153032, 0.17430808625483354, 0.0405391796749817, -0.029618891222136363, -0.23834354410064407, 0.08716060190012545, -0.11524274449662439, -0.14298007037723437, 0.004061839559913746, 0.0051334418655772296, 0.11848720765036498, -0.2850818541067253, 0.04613687934553517, 0.11429407101656709, 0.006597830373461225, -0.032894240268173496, -0.1120710687911404, 0.03036209149286151, 0.1574473608883896, 0.010186508823348308, 0.040166483144275844, 0.1262331944973474, -0.033925158813612404, -0.10573616804322228, 0.35903707429367515, -0.04882703199109528, -0.22759590723684855, 0.13652028775374805, -0.16608163200518383, -0.10585566607603271, 0.10283254093207818, 0.18863101647938102, 0.1270330401436825, -0.1321150203667847, 0.09074544766813883, -0.052179664764220694, 0.06266626466458547, 0.12025832458831635, 0.0036438644788826685, 0.20424116469387496, 0.16743860550091735, 0.11804338291819606, 0.20538847630710474, -0.09355193209401998, -0.1447018811346165, -0.34088749358696596, -0.11537882502722953, -0.24685161429390842, 0.044332031139804585, -0.2013630692794582, -0.18033591290337167, 0.3005960330774542, 0.07951041567139328, 0.30681981132199454, 0.11778687933526401, 0.23046064865775406, 0.07664848330023233, 0.023409954729556506, 0.06588058578615476, 0.1536322625387194, 0.0670174648860536, 0.09109513131884991, -0.1478553777103246, -0.017017027309131145, 0.12245386354542072]
|
1,803.06821
|
Development of co-located ${}^{129}$Xe and ${}^{131}$Xe nuclear spin
masers with external feedback scheme
|
We report on the operation of co-located ${}^{129}$Xe and ${}^{131}$Xe
nuclear spin masers with an external feedback scheme, and discuss the use of
${}^{131}$Xe as a comagnetometer in measurements of the ${}^{129}$Xe spin
precession frequency. By applying a correction based on the observed change in
the ${}^{131}$Xe frequency, the frequency instability due to magnetic field and
cell temperature drifts are eliminated by two orders of magnitude. The
frequency precision of 6.2 $\mu$Hz is obtained for a 10$^4$ s averaging time,
suggesting the possibility of future improvement to $\approx$ 1 nHz by
improving the signal-to-noise ratio of the observation.
|
physics.atom-ph
|
we report on the operation of colocated 129xe and 131xe nuclear spin masers with an external feedback scheme and discuss the use of 131xe as a comagnetometer in measurements of the 129xe spin precession frequency by applying a correction based on the observed change in the 131xe frequency the frequency instability due to magnetic field and cell temperature drifts are eliminated by two orders of magnitude the frequency precision of 62 muhz is obtained for a 104 s averaging time suggesting the possibility of future improvement to approx 1 nhz by improving the signaltonoise ratio of the observation
|
[['we', 'report', 'on', 'the', 'operation', 'of', 'colocated', '129xe', 'and', '131xe', 'nuclear', 'spin', 'masers', 'with', 'an', 'external', 'feedback', 'scheme', 'and', 'discuss', 'the', 'use', 'of', '131xe', 'as', 'a', 'comagnetometer', 'in', 'measurements', 'of', 'the', '129xe', 'spin', 'precession', 'frequency', 'by', 'applying', 'a', 'correction', 'based', 'on', 'the', 'observed', 'change', 'in', 'the', '131xe', 'frequency', 'the', 'frequency', 'instability', 'due', 'to', 'magnetic', 'field', 'and', 'cell', 'temperature', 'drifts', 'are', 'eliminated', 'by', 'two', 'orders', 'of', 'magnitude', 'the', 'frequency', 'precision', 'of', '62', 'muhz', 'is', 'obtained', 'for', 'a', '104', 's', 'averaging', 'time', 'suggesting', 'the', 'possibility', 'of', 'future', 'improvement', 'to', 'approx', '1', 'nhz', 'by', 'improving', 'the', 'signaltonoise', 'ratio', 'of', 'the', 'observation']]
|
[-0.17873370030191632, 0.1905464128632994, 0.025265842410070554, -0.03656063776591564, -0.008937766205291358, -0.06268417664651511, 0.09307418723248553, 0.3713920163750953, -0.18239003759618772, -0.33229973680833924, 0.10023871066324337, -0.23386665531529152, -0.005172504753596625, 0.24949099587000984, 0.015068595484136698, -0.010970592040245478, 0.000803200442496003, 0.018032078989971504, -0.07656637253714915, -0.18207091458464916, 0.23067026067292318, 0.11478787267162484, 0.2584978275153102, 0.03433618764868196, 0.11761039886528588, -0.012686680151833867, -0.032741822083765755, -0.041157373026422014, -0.09601067767415566, 0.04411826491574472, 0.2350719567122204, 0.038096716075099776, 0.22554878977944656, -0.3888543112659637, -0.16966485692549269, 0.0524813942765646, 0.09147210395894945, 0.10460999407520404, -0.042052916576610685, -0.289961599440751, 0.031407934222109045, -0.19648248649069242, -0.15133773860977773, -0.0461657091842166, 0.040549151861935626, 0.04781607738708289, -0.2984916448346054, 0.13055484518598842, 0.0629254994172679, 0.10258737342356115, -0.09749513778037258, -0.1586909071751395, 0.04209276510174481, 0.026845949243431037, 0.022662673865406945, 0.10517332283779979, 0.1943293900789731, -0.07310430601011125, -0.14916630567298556, 0.3448129888452894, -0.13063219690467326, -0.09866517405405793, 0.13383479410906, -0.23160326994518388, -0.07333909547222513, 0.16687033008974123, 0.15561357601450718, 0.08882475514154957, -0.11377987919888478, 0.015582887107169027, 0.08515483595796727, 0.23533551725891552, 0.12735634821239022, 0.07013809883358832, 0.2177956280849722, 0.18396846922494622, 0.06087830030283301, 0.08291760618247244, -0.21835731924511492, 0.005286363290850909, -0.218839552719146, -0.07755760462985527, -0.15327117897983528, 0.06208604326642746, -0.08539075556413712, -0.04499412467228059, 0.3947192930121005, 0.1609343072893668, 0.19004860880537605, -0.026473219727394075, 0.3193053491508626, 0.1177434326810002, 0.07969309563501453, 0.030995927280651366, 0.3250937674631726, 0.1938223395453842, 0.10005552678045873, -0.3238502836605648, 0.028836588647302087, -0.011933083156579915]
|
1,803.06822
|
The Strong Decays of $P-$wave Mixing Heavy-Light $1^+$ States
|
Many $P-$wave mixing heavy-light $1^+$ states have not been discovered by
experiment, some of them have been discovered but without the information of
width, or with large uncertainty widths. In this paper, we study the strong
decays of $P-$wave mixing heavy-light $1^+$ states $D^0$, $D^\pm$, $D_s^\pm$,
$B^0$, $B^\pm$ and $B_s$ by the improved Bethe-Salpeter(B-S) method in two
conditions of mixing angle $\theta$: one is $\theta=35.3^\circ$; another is
considering the correction to mixing angle $\theta=35.3^\circ+\theta_1$. And we
get some valuable predictions of the strong decay widths:
$\Gamma(D_1^{\prime0})=232$ MeV, $\Gamma(D_1^0)=21.5$ MeV,
$\Gamma(D_1^{\prime\pm})=232$ MeV, $\Gamma(D_1^\pm)=21.5$ MeV,
$\Gamma(D_{s1}^{\prime\pm})=0.0101$ MeV, $\Gamma(D_{s1}^{\pm})=0.950$ MeV,
$\Gamma(B_1^{\prime\pm})=263$ MeV, $\Gamma(B_1^{\pm})=16.8$ MeV,
$\Gamma(B_{s1}^{\prime})=0.01987$ MeV and $\Gamma(B_{s1})=0.412$ MeV. We find
that the decay widths of $D_{s1}^{\pm}$ and $B_{s1}$ are very sensitive to the
mixing angle. And our results will provide the theoretical assistance by the
future experiments.
|
hep-ph
|
many pwave mixing heavylight 1 states have not been discovered by experiment some of them have been discovered but without the information of width or with large uncertainty widths in this paper we study the strong decays of pwave mixing heavylight 1 states d0 dpm d_spm b0 bpm and b_s by the improved bethesalpeterbs method in two conditions of mixing angle theta one is theta353circ another is considering the correction to mixing angle theta353circtheta_1 and we get some valuable predictions of the strong decay widths gammad_1prime0232 mev gammad_10215 mev gammad_1primepm232 mev gammad_1pm215 mev gammad_s1primepm00101 mev gammad_s1pm0950 mev gammab_1primepm263 mev gammab_1pm168 mev gammab_s1prime001987 mev and gammab_s10412 mev we find that the decay widths of d_s1pm and b_s1 are very sensitive to the mixing angle and our results will provide the theoretical assistance by the future experiments
|
[['many', 'pwave', 'mixing', 'heavylight', '1', 'states', 'have', 'not', 'been', 'discovered', 'by', 'experiment', 'some', 'of', 'them', 'have', 'been', 'discovered', 'but', 'without', 'the', 'information', 'of', 'width', 'or', 'with', 'large', 'uncertainty', 'widths', 'in', 'this', 'paper', 'we', 'study', 'the', 'strong', 'decays', 'of', 'pwave', 'mixing', 'heavylight', '1', 'states', 'd0', 'dpm', 'd_spm', 'b0', 'bpm', 'and', 'b_s', 'by', 'the', 'improved', 'bethesalpeterbs', 'method', 'in', 'two', 'conditions', 'of', 'mixing', 'angle', 'theta', 'one', 'is', 'theta353circ', 'another', 'is', 'considering', 'the', 'correction', 'to', 'mixing', 'angle', 'theta353circtheta_1', 'and', 'we', 'get', 'some', 'valuable', 'predictions', 'of', 'the', 'strong', 'decay', 'widths', 'gammad_1prime0232', 'mev', 'gammad_10215', 'mev', 'gammad_1primepm232', 'mev', 'gammad_1pm215', 'mev', 'gammad_s1primepm00101', 'mev', 'gammad_s1pm0950', 'mev', 'gammab_1primepm263', 'mev', 'gammab_1pm168', 'mev', 'gammab_s1prime001987', 'mev', 'and', 'gammab_s10412', 'mev', 'we', 'find', 'that', 'the', 'decay', 'widths', 'of', 'd_s1pm', 'and', 'b_s1', 'are', 'very', 'sensitive', 'to', 'the', 'mixing', 'angle', 'and', 'our', 'results', 'will', 'provide', 'the', 'theoretical', 'assistance', 'by', 'the', 'future', 'experiments']]
|
[-0.09906518021712965, 0.2996531927912328, -0.02275089403904486, 0.11813515495436389, -0.043855797093395966, -0.18518355710157117, 0.08857725119431976, 0.39574216567285236, -0.20747861069947726, -0.3040626208740668, 0.0059355153667847394, -0.33644754226609574, 0.035719426136967714, 0.14940448261637118, 0.10226044445832977, 0.11856110684848467, 0.14955334595908396, -0.017284219792316913, -0.10142856719331114, -0.15526064756883645, 0.2697471600468652, 0.021814290434122086, 0.21592650962153787, 0.2096714925242313, -0.050538758838885145, -0.05593305529232641, 0.01881381193725545, -0.1066840073383856, -0.20844220421969992, 0.060996012734516415, 0.18431448268505637, 0.06877066522119109, 0.1740864215754583, -0.3070973433309891, -0.13334916004544642, 0.10551932180056074, 0.14944860063966547, 0.08252939034146486, -0.02666442776213354, -0.4014900446732025, 0.11886997078306835, -0.15822842964696407, -0.14869989935293426, -0.11370164108630575, 0.008039670992551035, -0.05166957623775682, -0.28632957378753504, 0.10330795161387898, -0.02782681963375968, 0.02615814357919649, 0.02487606131929721, -0.2711422918593419, 0.01871898155048734, 0.07307797550323007, 0.1455926948387298, 0.06652252844889786, 0.10423518394761276, -0.08797545941569461, -0.11897988673910255, 0.37169091376002694, -0.0607852327358741, -0.14835672227848992, 0.11044486799491111, -0.16061840220507173, -0.1054119690756512, 0.1730060517219216, 0.15394581479524247, 0.055544823148577914, -0.14578576305056692, 0.05759331353579373, -0.05487967158866222, 0.20573090392424434, 0.10753242468621704, 0.0809321070135739, 0.15023209073687674, 0.15947938560637967, -0.009210607308424918, 0.033473877089296576, -0.16396693803477827, -0.04182237124196483, -0.31490265052826677, -0.12028311326199012, -0.0648047447196956, 0.10543343719139363, -0.026860272646743278, -0.03710767090106841, 0.3895577354753604, 0.10392958293363574, 0.25929315609964315, -0.01013839854591633, 0.28942051004679475, 0.08251425163910082, 0.08546318423354113, 0.05791169582087485, 0.3621654540742175, 0.2080062940071688, 0.11486016269620569, -0.246973040597666, 0.04662078189220829, -0.026069029654208264]
|
1,803.06823
|
Nonparametric forecasting of multivariate probability density functions
|
The study of dependence between random variables is the core of theoretical
and applied statistics. Static and dynamic copula models are useful for
describing the dependence structure, which is fully encrypted in the copula
probability density function. However, these models are not always able to
describe the temporal change of the dependence patterns, which is a key
characteristic of financial data. We propose a novel nonparametric framework
for modelling a time series of copula probability density functions, which
allows to forecast the entire function without the need of post-processing
procedures to grant positiveness and unit integral. We exploit a suitable
isometry that allows to transfer the analysis in a subset of the space of
square integrable functions, where we build on nonparametric functional data
analysis techniques to perform the analysis. The framework does not assume the
densities to belong to any parametric family and it can be successfully applied
also to general multivariate probability density functions with bounded or
unbounded support. Finally, a noteworthy field of application pertains the
study of time varying networks represented through vine copula models. We apply
the proposed methodology for estimating and forecasting the time varying
dependence structure between the S\&P500 and NASDAQ indices.
|
stat.ME
|
the study of dependence between random variables is the core of theoretical and applied statistics static and dynamic copula models are useful for describing the dependence structure which is fully encrypted in the copula probability density function however these models are not always able to describe the temporal change of the dependence patterns which is a key characteristic of financial data we propose a novel nonparametric framework for modelling a time series of copula probability density functions which allows to forecast the entire function without the need of postprocessing procedures to grant positiveness and unit integral we exploit a suitable isometry that allows to transfer the analysis in a subset of the space of square integrable functions where we build on nonparametric functional data analysis techniques to perform the analysis the framework does not assume the densities to belong to any parametric family and it can be successfully applied also to general multivariate probability density functions with bounded or unbounded support finally a noteworthy field of application pertains the study of time varying networks represented through vine copula models we apply the proposed methodology for estimating and forecasting the time varying dependence structure between the sp500 and nasdaq indices
|
[['the', 'study', 'of', 'dependence', 'between', 'random', 'variables', 'is', 'the', 'core', 'of', 'theoretical', 'and', 'applied', 'statistics', 'static', 'and', 'dynamic', 'copula', 'models', 'are', 'useful', 'for', 'describing', 'the', 'dependence', 'structure', 'which', 'is', 'fully', 'encrypted', 'in', 'the', 'copula', 'probability', 'density', 'function', 'however', 'these', 'models', 'are', 'not', 'always', 'able', 'to', 'describe', 'the', 'temporal', 'change', 'of', 'the', 'dependence', 'patterns', 'which', 'is', 'a', 'key', 'characteristic', 'of', 'financial', 'data', 'we', 'propose', 'a', 'novel', 'nonparametric', 'framework', 'for', 'modelling', 'a', 'time', 'series', 'of', 'copula', 'probability', 'density', 'functions', 'which', 'allows', 'to', 'forecast', 'the', 'entire', 'function', 'without', 'the', 'need', 'of', 'postprocessing', 'procedures', 'to', 'grant', 'positiveness', 'and', 'unit', 'integral', 'we', 'exploit', 'a', 'suitable', 'isometry', 'that', 'allows', 'to', 'transfer', 'the', 'analysis', 'in', 'a', 'subset', 'of', 'the', 'space', 'of', 'square', 'integrable', 'functions', 'where', 'we', 'build', 'on', 'nonparametric', 'functional', 'data', 'analysis', 'techniques', 'to', 'perform', 'the', 'analysis', 'the', 'framework', 'does', 'not', 'assume', 'the', 'densities', 'to', 'belong', 'to', 'any', 'parametric', 'family', 'and', 'it', 'can', 'be', 'successfully', 'applied', 'also', 'to', 'general', 'multivariate', 'probability', 'density', 'functions', 'with', 'bounded', 'or', 'unbounded', 'support', 'finally', 'a', 'noteworthy', 'field', 'of', 'application', 'pertains', 'the', 'study', 'of', 'time', 'varying', 'networks', 'represented', 'through', 'vine', 'copula', 'models', 'we', 'apply', 'the', 'proposed', 'methodology', 'for', 'estimating', 'and', 'forecasting', 'the', 'time', 'varying', 'dependence', 'structure', 'between', 'the', 'sp500', 'and', 'nasdaq', 'indices']]
|
[-0.047711695051850314, 0.04115152742301849, -0.1439701536630547, 0.11442050483281345, -0.09973222621711879, -0.12453289676326604, 0.051907722077720875, 0.399063214706491, -0.2682445387884825, -0.27963686965396584, 0.10822086394577282, -0.2214195756640943, -0.15758338294708024, 0.16083989441529356, -0.045946697956044696, 0.10331916318616675, 0.010151745360134048, 0.011977856938993961, -0.08472848093475276, -0.22946189081263565, 0.3286206221451337, 0.04578365948303935, 0.3383522662685145, 0.022748101342366493, 0.1129489233963023, 0.0505657035473678, -0.06408690908062623, 0.00834579657498237, -0.12964966357937907, 0.13314413398401298, 0.2603026474359316, 0.16892216712863525, 0.3137858543994289, -0.42644080906596277, -0.24720047561723232, 0.1463513580717184, 0.10114288525468665, 0.055942082817984476, 0.015031902456478258, -0.2463302409935078, 0.05717178785602501, -0.18273453287143804, -0.11431235094419002, -0.14047228741043027, 0.005445574567625159, 0.06663606192825372, -0.34295849956340396, 0.08803367938266612, 0.03581596670371607, 0.03856165418749437, -0.06268983231401118, -0.07461078185646622, -0.011706002646280293, 0.12635034010698784, 0.050130523211233805, 0.008551267898833407, 0.11710577879578399, -0.08099358513642421, -0.09259909502085505, 0.313778831399439, -0.08512787716656259, -0.2482045903408797, 0.16369280835845268, -0.16793703242209762, -0.1563542629077319, 0.08032764051572874, 0.21870022430435646, 0.09895465183001592, -0.15818485935703014, 0.09325621572227204, -0.022167072663008793, 0.19681285981243318, 0.01730227153444073, -0.0263657426299532, 0.17709971888952575, 0.1475672870546804, 0.05219314045427208, 0.13438832954019214, -0.10684289888422656, -0.10732068517362353, -0.3125056214911405, -0.13380304763641152, -0.1851946988585288, -0.00479335568470286, -0.12537870862262077, -0.2188013746524838, 0.4366753020314453, 0.17769258323677783, 0.1979044207638532, 0.08982129396938593, 0.2641894049502572, 0.1483775325746617, 0.0654496351378647, 0.08261153924784356, 0.11456848820261938, 0.12681005744675372, 0.07285602972023751, -0.14658894362665206, 0.1292032210306082, 0.02243452737990933]
|
1,803.06824
|
Indeterminism in Physics, Classical Chaos and Bohmian Mechanics. Are
Real Numbers Really Real?
|
It is usual to identify initial conditions of classical dynamical systems
with mathematical real numbers. However, almost all real numbers contain an
infinite amount of information. I argue that a finite volume of space can't
contain more than a finite amount of information, hence that the mathematical
real numbers are not physically relevant. Moreover, a better terminology for
the so-called real numbers is ``random numbers'', as their series of bits are
truly random. I propose an alternative classical mechanics, which is
empirically equivalent to classical mechanics, but uses only finite-information
numbers. This alternative classical mechanics is non-deterministic, despite the
use of deterministic equations, in a way similar to quantum theory.
Interestingly, both alternative classical mechanics and quantum theories can be
supplemented by additional variables in such a way that the supplemented theory
is deterministic. Most physicists straightforwardly supplement classical theory
with real numbers to which they attribute physical existence, while most
physicists reject Bohmian mechanics as supplemented quantum theory, arguing
that Bohmian positions have no physical reality.
|
quant-ph physics.hist-ph
|
it is usual to identify initial conditions of classical dynamical systems with mathematical real numbers however almost all real numbers contain an infinite amount of information i argue that a finite volume of space cant contain more than a finite amount of information hence that the mathematical real numbers are not physically relevant moreover a better terminology for the socalled real numbers is random numbers as their series of bits are truly random i propose an alternative classical mechanics which is empirically equivalent to classical mechanics but uses only finiteinformation numbers this alternative classical mechanics is nondeterministic despite the use of deterministic equations in a way similar to quantum theory interestingly both alternative classical mechanics and quantum theories can be supplemented by additional variables in such a way that the supplemented theory is deterministic most physicists straightforwardly supplement classical theory with real numbers to which they attribute physical existence while most physicists reject bohmian mechanics as supplemented quantum theory arguing that bohmian positions have no physical reality
|
[['it', 'is', 'usual', 'to', 'identify', 'initial', 'conditions', 'of', 'classical', 'dynamical', 'systems', 'with', 'mathematical', 'real', 'numbers', 'however', 'almost', 'all', 'real', 'numbers', 'contain', 'an', 'infinite', 'amount', 'of', 'information', 'i', 'argue', 'that', 'a', 'finite', 'volume', 'of', 'space', 'cant', 'contain', 'more', 'than', 'a', 'finite', 'amount', 'of', 'information', 'hence', 'that', 'the', 'mathematical', 'real', 'numbers', 'are', 'not', 'physically', 'relevant', 'moreover', 'a', 'better', 'terminology', 'for', 'the', 'socalled', 'real', 'numbers', 'is', 'random', 'numbers', 'as', 'their', 'series', 'of', 'bits', 'are', 'truly', 'random', 'i', 'propose', 'an', 'alternative', 'classical', 'mechanics', 'which', 'is', 'empirically', 'equivalent', 'to', 'classical', 'mechanics', 'but', 'uses', 'only', 'finiteinformation', 'numbers', 'this', 'alternative', 'classical', 'mechanics', 'is', 'nondeterministic', 'despite', 'the', 'use', 'of', 'deterministic', 'equations', 'in', 'a', 'way', 'similar', 'to', 'quantum', 'theory', 'interestingly', 'both', 'alternative', 'classical', 'mechanics', 'and', 'quantum', 'theories', 'can', 'be', 'supplemented', 'by', 'additional', 'variables', 'in', 'such', 'a', 'way', 'that', 'the', 'supplemented', 'theory', 'is', 'deterministic', 'most', 'physicists', 'straightforwardly', 'supplement', 'classical', 'theory', 'with', 'real', 'numbers', 'to', 'which', 'they', 'attribute', 'physical', 'existence', 'while', 'most', 'physicists', 'reject', 'bohmian', 'mechanics', 'as', 'supplemented', 'quantum', 'theory', 'arguing', 'that', 'bohmian', 'positions', 'have', 'no', 'physical', 'reality']]
|
[-0.10147791524510269, 0.17066893605841463, -0.15194375614961048, 0.12651889252999562, -0.1214970821326778, -0.189229880498178, 0.016139072639564704, 0.29921108163915666, -0.266393537387667, -0.3008078392959727, 0.06877056108955967, -0.25989873472780706, -0.18178728200405478, 0.20745690356580967, -0.10864958065808807, 0.04772779541454805, 0.03896942164984543, 0.07521412778555987, -0.03171178769020094, -0.25952122430036584, 0.26639746670773906, -0.006676559909443225, 0.233753301562315, -0.042563459929219075, 0.07125137709025069, 0.008223477223641184, -0.01660027346259589, 0.06692209776967108, -0.053337149143377484, 0.1136068889327033, 0.2656694907493081, 0.16859574888058634, 0.2964631885455652, -0.463545027029061, -0.2522808728930372, 0.12914145473918193, 0.11794260703027248, 0.1394607027395101, -0.015780744150281655, -0.2573767739785723, 0.0714348562185215, -0.15039818457058485, -0.16575612210954752, -0.11286551641098347, 0.053048581743321145, -0.019806991936148044, -0.2074496682357402, 0.07452394958537813, 0.030319826109916903, 0.0898955969577543, 0.0006249749272814896, -0.09699471457019808, 0.015337685496176043, 0.09909159303025668, -0.006443725783849157, -0.0029129199248862014, 0.09764104792623814, -0.11403985473142196, -0.16957651418409345, 0.424770023006138, 0.027728189703295183, -0.2641175069975252, 0.2233836192368384, -0.11292933168854699, -0.1408361856578793, 0.11518054861148977, 0.050500176950773024, 0.09391809033835868, -0.14422610819519285, 0.0971877122776869, -0.08037214198834207, 0.1823611546262919, 0.05907582661911217, 0.08734913255825796, 0.22018460872167922, 0.05790554203586765, 0.011778361120552992, 0.06801414317963364, 0.027412986276244902, -0.2309346901286528, -0.3609151132292597, -0.18718096655646216, -0.21241856966776415, 0.12933426202320092, -0.08049261805323353, -0.20677409090483226, 0.26813625206705183, 0.19361129961136436, 0.15963704034781465, 0.06633558526567845, 0.2967014427083623, 0.11621068452670048, 0.0361850082843441, 0.03537417342044772, 0.19474806913163467, 0.15473073297208287, 0.08892180726453887, -0.1111712994682322, 0.044991277475246644, 0.07218219992053886]
|
1,803.06825
|
A counterexample to Las Vergnas' strong map conjecture on realizable
oriented matroids
|
The Las Vergnas' strong map conjecture, states that any strong map of
oriented matroids $f:\mathcal{M}_1\rightarrow\mathcal{M}_2$ can be factored
into extensions and contractions. The conjecture is known to be false due to a
construction by Richter-Gebert, he find a non-factorizable strong map
$f:\mathcal{M}_1\rightarrow\mathcal{M}_2$, however in his example
$\mathcal{M}_1$ is not realizable. The problem that whether there exists a
non-factorizable strong map between realizable oriented matroids still remains
open. In this paper we provide a counterexample to the strong map conjecture on
realizable oriented matroids, which is a strong map
$f:\mathcal{M}_1\rightarrow\mathcal{M}_2$, $\mathcal{M}_1$ is an alternating
oriented matroid of rank $4$ and $f$ has corank $2$. We prove it is not
factorizable by showing that there is no uniform oriented matroid
$\mathcal{M}^{\prime}$ of rank $3$ such that
$\mathcal{M}_1\rightarrow\mathcal{M}^{\prime}\rightarrow\mathcal{M}_2$.
|
math.CO
|
the las vergnas strong map conjecture states that any strong map of oriented matroids fmathcalm_1rightarrowmathcalm_2 can be factored into extensions and contractions the conjecture is known to be false due to a construction by richtergebert he find a nonfactorizable strong map fmathcalm_1rightarrowmathcalm_2 however in his example mathcalm_1 is not realizable the problem that whether there exists a nonfactorizable strong map between realizable oriented matroids still remains open in this paper we provide a counterexample to the strong map conjecture on realizable oriented matroids which is a strong map fmathcalm_1rightarrowmathcalm_2 mathcalm_1 is an alternating oriented matroid of rank 4 and f has corank 2 we prove it is not factorizable by showing that there is no uniform oriented matroid mathcalmprime of rank 3 such that mathcalm_1rightarrowmathcalmprimerightarrowmathcalm_2
|
[['the', 'las', 'vergnas', 'strong', 'map', 'conjecture', 'states', 'that', 'any', 'strong', 'map', 'of', 'oriented', 'matroids', 'fmathcalm_1rightarrowmathcalm_2', 'can', 'be', 'factored', 'into', 'extensions', 'and', 'contractions', 'the', 'conjecture', 'is', 'known', 'to', 'be', 'false', 'due', 'to', 'a', 'construction', 'by', 'richtergebert', 'he', 'find', 'a', 'nonfactorizable', 'strong', 'map', 'fmathcalm_1rightarrowmathcalm_2', 'however', 'in', 'his', 'example', 'mathcalm_1', 'is', 'not', 'realizable', 'the', 'problem', 'that', 'whether', 'there', 'exists', 'a', 'nonfactorizable', 'strong', 'map', 'between', 'realizable', 'oriented', 'matroids', 'still', 'remains', 'open', 'in', 'this', 'paper', 'we', 'provide', 'a', 'counterexample', 'to', 'the', 'strong', 'map', 'conjecture', 'on', 'realizable', 'oriented', 'matroids', 'which', 'is', 'a', 'strong', 'map', 'fmathcalm_1rightarrowmathcalm_2', 'mathcalm_1', 'is', 'an', 'alternating', 'oriented', 'matroid', 'of', 'rank', '4', 'and', 'f', 'has', 'corank', '2', 'we', 'prove', 'it', 'is', 'not', 'factorizable', 'by', 'showing', 'that', 'there', 'is', 'no', 'uniform', 'oriented', 'matroid', 'mathcalmprime', 'of', 'rank', '3', 'such', 'that', 'mathcalm_1rightarrowmathcalmprimerightarrowmathcalm_2']]
|
[-0.19529823047829972, 0.10585406036296909, -0.04957159607100391, 0.09338539682756809, -0.08974160783315799, -0.20107939233627892, 0.013593438763505659, 0.41646871147977726, -0.3145135278558178, -0.22062277121116378, 0.0847458566164395, -0.21905356304036575, -0.19703086151651317, 0.16298679630610072, -0.12937925101423095, -0.06601510060417856, 0.06814572624036021, 0.024744028426686136, -0.05754967704190001, -0.30176738077293963, 0.3311458090282676, -0.016205418729148203, 0.21900486964788737, 0.1341460781329642, 0.12062338075690693, 0.01259579289058644, 0.04799002846477613, 0.08139855351914922, -0.12261305633681684, 0.10197608327519359, 0.2989413183062307, 0.1806412942147994, 0.19019515403816778, -0.32890102453529835, -0.10718305854689172, 0.20272206395372538, 0.07879321781858321, 0.0793715945788614, -0.0497504296579263, -0.22775392189261415, 0.13888219459312817, -0.12991846752383054, -0.11004293322443001, -0.05956719175822312, 0.07703954581032327, -0.044283585815367496, -0.2764419267900408, -0.04008315080465118, 0.1892503906011341, 0.10735458897186383, -0.0008002241750458075, -0.07477569282655755, -0.03288583268201159, 0.10062802878148373, -0.022535883382173074, 0.19204724734018166, 0.019662195459879454, -0.10062116904995375, -0.149197454797104, 0.34651329428438216, -0.05012594144265618, -0.1943691449780618, 0.15215232125633665, -0.11566748853863007, -0.21034756162477988, 0.14761965877691946, 0.07790322278836562, 0.11838509498075807, -0.05520136232277559, 0.16848419890494928, -0.21878743208118626, 0.17064461001146194, 0.12111473616002308, -0.06561653459193034, 0.20533198568662028, 0.0335030576154109, 0.16509076129577513, 0.16178501521954464, 0.037995911911205056, 0.00011134504400674374, -0.2718878302670595, -0.17683034779474838, -0.167640800080863, 0.1372356614843856, -0.07844783576752713, -0.19623425747868756, 0.3018861229816872, 0.08274275485628975, 0.1596399624907081, 0.09597327582812268, 0.2384865510440807, 0.079445299298142, 0.05224768624776193, 0.12472638318825874, 0.21940181543299508, 0.1936276593553503, -0.04248770660225062, -0.07593443419694179, 0.09196765641982277, 0.13537294052601342]
|
1,803.06826
|
Terahertz radiation by subpicosecond spin-polarized photocurrent
originating from Dirac electrons in a Rashba-type polar semiconductor
|
The spin-splitting energy bands induced by the relativistic spin-orbit
interaction in solids provide a new opportunity to manipulate the
spin-polarized electrons on the sub-picosecond time scale. Here, we report one
such example in a bulk Rashba-type polar semiconductor BiTeBr. Strong terahertz
electromagnetic waves are emitted after the resonant excitation of the
interband transition between the Rashba-type spin-splitting energy bands with a
femtosecond laser pulse circularly polarized. The phase of the emitted
terahertz waves is reversed by switching the circular polarization. This
suggests that the observed terahertz radiation originates from the
subpicosecond spin-polarized photocurrents, which are generated by the
asymmetric depopulation of the Dirac state. Our result provides a new way for
the current-induced terahertz radiation and its phase control by the circular
polarization of incident light without external electric fields.
|
cond-mat.str-el
|
the spinsplitting energy bands induced by the relativistic spinorbit interaction in solids provide a new opportunity to manipulate the spinpolarized electrons on the subpicosecond time scale here we report one such example in a bulk rashbatype polar semiconductor bitebr strong terahertz electromagnetic waves are emitted after the resonant excitation of the interband transition between the rashbatype spinsplitting energy bands with a femtosecond laser pulse circularly polarized the phase of the emitted terahertz waves is reversed by switching the circular polarization this suggests that the observed terahertz radiation originates from the subpicosecond spinpolarized photocurrents which are generated by the asymmetric depopulation of the dirac state our result provides a new way for the currentinduced terahertz radiation and its phase control by the circular polarization of incident light without external electric fields
|
[['the', 'spinsplitting', 'energy', 'bands', 'induced', 'by', 'the', 'relativistic', 'spinorbit', 'interaction', 'in', 'solids', 'provide', 'a', 'new', 'opportunity', 'to', 'manipulate', 'the', 'spinpolarized', 'electrons', 'on', 'the', 'subpicosecond', 'time', 'scale', 'here', 'we', 'report', 'one', 'such', 'example', 'in', 'a', 'bulk', 'rashbatype', 'polar', 'semiconductor', 'bitebr', 'strong', 'terahertz', 'electromagnetic', 'waves', 'are', 'emitted', 'after', 'the', 'resonant', 'excitation', 'of', 'the', 'interband', 'transition', 'between', 'the', 'rashbatype', 'spinsplitting', 'energy', 'bands', 'with', 'a', 'femtosecond', 'laser', 'pulse', 'circularly', 'polarized', 'the', 'phase', 'of', 'the', 'emitted', 'terahertz', 'waves', 'is', 'reversed', 'by', 'switching', 'the', 'circular', 'polarization', 'this', 'suggests', 'that', 'the', 'observed', 'terahertz', 'radiation', 'originates', 'from', 'the', 'subpicosecond', 'spinpolarized', 'photocurrents', 'which', 'are', 'generated', 'by', 'the', 'asymmetric', 'depopulation', 'of', 'the', 'dirac', 'state', 'our', 'result', 'provides', 'a', 'new', 'way', 'for', 'the', 'currentinduced', 'terahertz', 'radiation', 'and', 'its', 'phase', 'control', 'by', 'the', 'circular', 'polarization', 'of', 'incident', 'light', 'without', 'external', 'electric', 'fields']]
|
[-0.2373116534239111, 0.2922860104483194, -0.03811355978966906, 0.017523293709830166, -0.07790600411020793, -0.10308672310605359, 0.05364971703204971, 0.46406654466230135, -0.29645250082875674, -0.3044817912177398, -0.08797617111032685, -0.2785447966146211, -0.08918512332647179, 0.23826938884046214, 0.10435036573415765, -0.015000067544259274, -0.028431640656736607, -0.14256739996243806, -0.01730226404212702, -0.0901396924092506, 0.29218432642161274, 0.050678100107380976, 0.30534976617827153, 0.10120122029374425, 0.07502634265603354, 0.029631664170525394, 0.09732295367530941, -0.07564745009070835, -0.061161556745299515, 0.06356834899992324, 0.24083266386520474, -0.1088372667087242, 0.18695730592768925, -0.49415733775553794, -0.22114625221807868, -0.0058209576626093345, 0.06441194269662866, 0.20613562560980567, -0.1428835791723731, -0.33843669211491945, -0.04521633989822406, -0.12760190766734572, -0.13293910058027206, -0.029257145801630732, 0.0006459631204891663, 0.030423080251337244, -0.24918942121305288, 0.045603993334449255, 0.07088049936663503, 0.022331539176117916, -0.10009807884209575, -0.030288817586663824, -0.11730246934860658, 0.004951777152466373, 0.06177111477770198, 0.07620519035889839, 0.18079506669623346, -0.12034648928540544, -0.14043747352507824, 0.37083627619297027, -0.12980487803355434, -0.0476882953554965, 0.10652497075856306, -0.24877537754722512, 0.03659232802814446, 0.26315857838803475, 0.148734748770053, 0.17170144692779735, -0.11454098877282097, 0.0696184460427433, -0.006773059893972599, 0.15983648501838055, 0.11073131283315328, 0.14227957628452434, 0.3329254943375977, 0.15293113187743493, 0.03863403258415369, 0.1642328958886747, -0.17200155441398518, 0.033195915203899716, -0.24104817331983494, -0.09204304084325066, -0.2455408229277684, 0.12348139771761803, -0.010681394244714353, -0.12781055107569464, 0.4933317513563312, 0.1290051975645698, 0.07110871547976365, -0.06853553612018004, 0.342187705825871, 0.16051479181579242, 0.029645964059566793, 0.03894022747408599, 0.3648187280560915, 0.1703969180261573, 0.13772413513551537, -0.3496472527935671, 0.007002166431182279, -0.07024348674055475]
|
1,803.06827
|
$AdS_2$ dilaton gravity from reductions of some nonrelativistic theories
|
We study dilaton-gravity theories in 2-dimensions obtained by dimensional
reduction of higher dimensional nonrelativistic theories. Focussing on certain
families of extremal charged hyperscaling violating Lifshitz black branes in
Einstein-Maxwell-scalar theories with an extra gauge field in 4-dimensions, we
obtain $AdS_2$ backgrounds in the near horizon throats. We argue that these
backgrounds can be obtained in equivalent theories of 2-dim dilaton-gravity
with an extra scalar, descending from the higher dimensional scalar, and an
interaction potential with the dilaton. A simple subcase here is the
relativistic black brane in Einstein-Maxwell theory. We then study linearized
fluctuations of the metric, dilaton and the extra scalar about these $AdS_2$
backgrounds. The coefficient of the leading Schwarzian derivative term is
proportional to the entropy of the (compactified) extremal black branes.
|
hep-th
|
we study dilatongravity theories in 2dimensions obtained by dimensional reduction of higher dimensional nonrelativistic theories focussing on certain families of extremal charged hyperscaling violating lifshitz black branes in einsteinmaxwellscalar theories with an extra gauge field in 4dimensions we obtain ads_2 backgrounds in the near horizon throats we argue that these backgrounds can be obtained in equivalent theories of 2dim dilatongravity with an extra scalar descending from the higher dimensional scalar and an interaction potential with the dilaton a simple subcase here is the relativistic black brane in einsteinmaxwell theory we then study linearized fluctuations of the metric dilaton and the extra scalar about these ads_2 backgrounds the coefficient of the leading schwarzian derivative term is proportional to the entropy of the compactified extremal black branes
|
[['we', 'study', 'dilatongravity', 'theories', 'in', '2dimensions', 'obtained', 'by', 'dimensional', 'reduction', 'of', 'higher', 'dimensional', 'nonrelativistic', 'theories', 'focussing', 'on', 'certain', 'families', 'of', 'extremal', 'charged', 'hyperscaling', 'violating', 'lifshitz', 'black', 'branes', 'in', 'einsteinmaxwellscalar', 'theories', 'with', 'an', 'extra', 'gauge', 'field', 'in', '4dimensions', 'we', 'obtain', 'ads_2', 'backgrounds', 'in', 'the', 'near', 'horizon', 'throats', 'we', 'argue', 'that', 'these', 'backgrounds', 'can', 'be', 'obtained', 'in', 'equivalent', 'theories', 'of', '2dim', 'dilatongravity', 'with', 'an', 'extra', 'scalar', 'descending', 'from', 'the', 'higher', 'dimensional', 'scalar', 'and', 'an', 'interaction', 'potential', 'with', 'the', 'dilaton', 'a', 'simple', 'subcase', 'here', 'is', 'the', 'relativistic', 'black', 'brane', 'in', 'einsteinmaxwell', 'theory', 'we', 'then', 'study', 'linearized', 'fluctuations', 'of', 'the', 'metric', 'dilaton', 'and', 'the', 'extra', 'scalar', 'about', 'these', 'ads_2', 'backgrounds', 'the', 'coefficient', 'of', 'the', 'leading', 'schwarzian', 'derivative', 'term', 'is', 'proportional', 'to', 'the', 'entropy', 'of', 'the', 'compactified', 'extremal', 'black', 'branes']]
|
[-0.1709499395955354, 0.17354964138322976, -0.04749330137576908, 0.136214682104066, -0.0857325771972537, -0.22337278101965785, -0.09338469452876598, 0.24568708850257098, -0.11419358839094639, -0.23001298734761075, 0.07647389907669276, -0.3532799953371286, -0.143560355335474, 0.08288411849737168, -0.08098620520718396, 0.03244331763032824, -0.09692164088785649, 0.09622866553068161, -0.13170605675969274, -0.28249976108409464, 0.40340317875519394, 0.05112154556810856, 0.236310059864074, 0.040239575212821364, 0.12150765140727163, -0.010589085258543492, 0.03283613271266222, 0.08433136607334017, -0.18311455138243035, 0.10133829040080308, 0.1833905860488303, 0.05027070150151849, 0.09103006544709205, -0.43966341111063956, -0.260584539629519, 0.09865861454606056, 0.18008532869815827, 0.1723112339414656, -0.03892520666029304, -0.29562135664373634, 0.029151060171425342, -0.19095821896661072, -0.19820839092601092, -0.06875499145127834, -0.0015867359125986695, -0.12665120777487754, -0.2391440662778914, 0.10168386649060994, -0.0007144215032458306, 0.005877050824463367, -0.12423957400768995, -0.02522449376061559, -0.09129876881092787, -0.01214105474203825, 0.24501295322738587, 0.06434550406038761, 0.13758147652819752, -0.19706513315666235, -0.17629256216716022, 0.31842182745039466, -0.13897584800980986, -0.2784688475914299, 0.13028489115089179, -0.2073973003104329, -0.14009018349274993, 0.10090780282467313, 0.14772526359558105, 0.22108904907805846, -0.14002533158659936, 0.2840018056919798, 0.014079225525259972, 0.12894029017537834, 0.14181688764691353, 0.04979896003846079, 0.3274293709918857, 0.0574176155179739, 0.03078397674486041, 0.19280949336569755, 0.014405748510733247, -0.1272747578471899, -0.4498007543981075, -0.14948138657957316, -0.06149348902003839, 0.1784857052527368, -0.2782810683993157, -0.18288529107999058, 0.3097840184867382, 0.09695445883693174, 0.1334847233891487, 0.0276086629293859, 0.15308636824786664, 0.11678000855073332, 0.03955490414053202, 0.07922372706234455, 0.30289977629482745, 0.13455120356567205, 0.10021478997543454, -0.25312626236118374, -0.22633922536531464, 0.20127143303304912]
|
1,803.06828
|
Multipole Modes for Triaxially Deformed Superfluid Nuclei
|
To study shape fluctuations of nuclei in transitional regions, the collective
Hamiltonian method has often been employed. We intend to construct the
quadrupole collective Hamiltonian with the collective inertial functions given
by the local quasiparticle random-phase approximation (QRPA) based on the
Skyrme energy density functional. For this purpose, we first construct a
practical framework of Skyrme QRPA for triaxial nuclear shapes with the finite
amplitude method (FAM). We show quadrupole strength functions for a triaxial
superfluid nucleus $^{188}$Os and the Thouless-Valatin rotational moment of
inertia by the local FAM-QRPA for $^{106}$Pd.
|
nucl-th nucl-ex
|
to study shape fluctuations of nuclei in transitional regions the collective hamiltonian method has often been employed we intend to construct the quadrupole collective hamiltonian with the collective inertial functions given by the local quasiparticle randomphase approximation qrpa based on the skyrme energy density functional for this purpose we first construct a practical framework of skyrme qrpa for triaxial nuclear shapes with the finite amplitude method fam we show quadrupole strength functions for a triaxial superfluid nucleus 188os and the thoulessvalatin rotational moment of inertia by the local famqrpa for 106pd
|
[['to', 'study', 'shape', 'fluctuations', 'of', 'nuclei', 'in', 'transitional', 'regions', 'the', 'collective', 'hamiltonian', 'method', 'has', 'often', 'been', 'employed', 'we', 'intend', 'to', 'construct', 'the', 'quadrupole', 'collective', 'hamiltonian', 'with', 'the', 'collective', 'inertial', 'functions', 'given', 'by', 'the', 'local', 'quasiparticle', 'randomphase', 'approximation', 'qrpa', 'based', 'on', 'the', 'skyrme', 'energy', 'density', 'functional', 'for', 'this', 'purpose', 'we', 'first', 'construct', 'a', 'practical', 'framework', 'of', 'skyrme', 'qrpa', 'for', 'triaxial', 'nuclear', 'shapes', 'with', 'the', 'finite', 'amplitude', 'method', 'fam', 'we', 'show', 'quadrupole', 'strength', 'functions', 'for', 'a', 'triaxial', 'superfluid', 'nucleus', '188os', 'and', 'the', 'thoulessvalatin', 'rotational', 'moment', 'of', 'inertia', 'by', 'the', 'local', 'famqrpa', 'for', '106pd']]
|
[-0.07919185739624632, 0.13571324652818206, -0.13863593001675967, 0.12422328258501264, -0.01839139838293604, -0.05557018101911296, -0.0037744994765239676, 0.35696819580190786, -0.1784279997777808, -0.24586554248254378, -0.10471059939859864, -0.23095642153050874, -0.11343883139920513, 0.09459492956175582, 0.025789905820492204, 0.07705651192444858, -0.01304199507941011, 0.037445488767084346, -0.12558172561693937, -0.12030436244158708, 0.3091876301837696, 0.050966789188620805, 0.28356271389626214, 0.0005276747020556346, 0.05560113863180299, 0.04267615442430334, 0.058115561840707784, 0.011938931522788583, -0.17540721356827807, 0.11130946252372238, 0.23152406738845857, 0.01763073174067988, 0.25715247750446035, -0.47138429703293266, -0.19869667251055784, 0.10280170654980364, 0.15893178351305343, 0.21080685347564274, -0.0357614613667765, -0.319388454565062, 0.0342240687255021, -0.30818160504593956, -0.20965128451340145, -0.22581407116664634, 0.062249908807104105, 0.12733191121523116, -0.23576080416851156, 0.11514890167329993, 0.01699480702998219, 0.06343048371906791, -0.16943937956590902, -0.1905115333099205, 0.020577674004975913, 0.031614966759621936, 0.08152089698833752, 0.04652166860638657, 0.1913163719217774, -0.0610947965025124, -0.02690924300842888, 0.39981772773131563, -0.01710495334323291, -0.20973410350424085, 0.05356068701667527, -0.13909778136831635, -0.15884216338048104, 0.1442700602359824, 0.16754106763791252, 0.12725787011108228, -0.12889394537254062, 0.09063951117383152, -0.00558040458529901, 0.17611254332075407, -0.020580660173116803, -0.0063788494003097435, 0.16445748621577416, 0.15657300469823754, 0.03797956564780939, 0.10162527885308469, -0.17142089774862831, -0.1362080568969659, -0.299312014194144, -0.004873463658841102, -0.21716940945914978, -0.02756830096081063, -0.056306590551125385, -0.18241554786768424, 0.4372464095825677, 0.04498161055188585, 0.1221150919426601, 0.022588321422277898, 0.3022436535825114, 0.11313767007623728, 0.057725052850750774, 0.060791017119209846, 0.3161415067593475, 0.22033975335800057, 0.008880925518307057, -0.33648165609114444, -0.009593019502462594, 0.1667263675724146]
|
1,803.06829
|
Exact confirmation of 1D nonlinear fluctuating hydrodynamics for a
two-species exclusion process
|
We consider current statistics for a two species exclusion process of
particles hopping in opposite directions on a one-dimensional lattice. We
derive an exact formula for the Green's function as well as for a joint current
distribution of the model, and study its long time behavior. For a step type
initial condition, we show that the limiting distribution is a product of the
Gaussian and the GUE Tracy-Widom distribution. This is the first analytic
confirmation for a multi-component system of a prediction from the recently
proposed non-linear fluctuating hydrodynamics for one dimensional systems.
|
cond-mat.stat-mech math-ph math.MP math.PR
|
we consider current statistics for a two species exclusion process of particles hopping in opposite directions on a onedimensional lattice we derive an exact formula for the greens function as well as for a joint current distribution of the model and study its long time behavior for a step type initial condition we show that the limiting distribution is a product of the gaussian and the gue tracywidom distribution this is the first analytic confirmation for a multicomponent system of a prediction from the recently proposed nonlinear fluctuating hydrodynamics for one dimensional systems
|
[['we', 'consider', 'current', 'statistics', 'for', 'a', 'two', 'species', 'exclusion', 'process', 'of', 'particles', 'hopping', 'in', 'opposite', 'directions', 'on', 'a', 'onedimensional', 'lattice', 'we', 'derive', 'an', 'exact', 'formula', 'for', 'the', 'greens', 'function', 'as', 'well', 'as', 'for', 'a', 'joint', 'current', 'distribution', 'of', 'the', 'model', 'and', 'study', 'its', 'long', 'time', 'behavior', 'for', 'a', 'step', 'type', 'initial', 'condition', 'we', 'show', 'that', 'the', 'limiting', 'distribution', 'is', 'a', 'product', 'of', 'the', 'gaussian', 'and', 'the', 'gue', 'tracywidom', 'distribution', 'this', 'is', 'the', 'first', 'analytic', 'confirmation', 'for', 'a', 'multicomponent', 'system', 'of', 'a', 'prediction', 'from', 'the', 'recently', 'proposed', 'nonlinear', 'fluctuating', 'hydrodynamics', 'for', 'one', 'dimensional', 'systems']]
|
[-0.1172567779518744, 0.0965928560767826, -0.11699723521678118, 0.08083494882026493, -0.001044754009012894, -0.11916791305186288, 0.02872509237939632, 0.343128193340074, -0.23780506779940458, -0.22380458910058262, 0.09671518423779797, -0.2559675392244131, -0.12430556420667438, 0.169037012573612, 0.024661885684616462, 0.0748521238058475, 0.050901465856480185, 0.028873294539329027, -0.05972676184679311, -0.1790719980158673, 0.3169856312564544, 0.03027231259251474, 0.3071650772690973, 0.030518586647206095, 0.13350289408117533, 0.05798377913563082, 0.0007947797396330423, -0.019169063238810086, -0.13526832413778614, 0.06168504950330062, 0.1559998516070967, 0.052832191594706104, 0.24690556454081689, -0.38487699247335877, -0.23528368214285503, 0.09901610748862387, 0.16410507376916628, 0.15373097085243753, -0.047882636227915366, -0.2552472989485469, 0.01593321531019624, -0.20651039721504336, -0.19198914888685428, -0.020649814127033116, 0.059797228594380684, 0.06099898008359296, -0.34169362721744406, 0.13071429380841593, 0.09746823324796854, 0.020754419918101962, -0.07366906883450405, -0.11943339782151123, 0.02850783391485131, 0.12106360390441873, 0.029250839211594975, -0.02155094764756179, 0.07763398844768764, -0.16612596522307246, -0.11449769821258322, 0.3601387568839615, -0.09503356106729517, -0.23490989518662295, 0.16308589279651642, -0.14379833423362304, -0.14709959944750192, 0.08083942709290372, 0.16814038766327724, 0.13307249579097954, -0.19221055356945882, 0.06754370409149116, -0.07139906917087814, 0.10465480147589308, 0.014897295964821693, -0.02723624213268199, 0.22749039724028558, 0.18934271258292018, 0.08319750086276702, 0.16916480601855344, -0.09378706489849875, -0.14139545560684255, -0.3307941600840579, -0.21032555616005094, -0.257608477927504, 0.07352456888834875, -0.09763967150650789, -0.20515189135587344, 0.4215365189217752, 0.14426218322478235, 0.2412924805395706, 0.11623656122584737, 0.27317925614695393, 0.18382400144842925, -0.009377867378975434, 0.026750143126694746, 0.15991603770363394, 0.13780768143804242, 0.09731418667210927, -0.19424729057467513, 0.05666641700826335, 0.08680509448411965]
|
1,803.0683
|
IRAS 22150+6109 - a young B-type star with a large disc
|
We present the results of a spectroscopic analysis and spectral energy
distribution (SED) modelling of the optical counterpart of the infrared source
IRAS 22150+6109. The source was suggested to be as a Herbig Be star located in
the star forming region L 1188. Absorption lines in the optical spectrum
indicate a spectral type B3, while weak Balmer emission lines reflect the
presence of a circumstellar gaseous disc. The star shows no excess radiation in
the near-infrared spectral region and a strong excess in the far-infrared that
we interpret as radiation from a large disc, whose inner edge is located very
far from the star (550 au) and does not attenuate its radiation. We conclude
that IRAS 22150+6109 is an intermediate-mass star that is currently undergoing
a short pre-main-sequence evolutionary stage.
|
astro-ph.EP astro-ph.SR
|
we present the results of a spectroscopic analysis and spectral energy distribution sed modelling of the optical counterpart of the infrared source iras 221506109 the source was suggested to be as a herbig be star located in the star forming region l 1188 absorption lines in the optical spectrum indicate a spectral type b3 while weak balmer emission lines reflect the presence of a circumstellar gaseous disc the star shows no excess radiation in the nearinfrared spectral region and a strong excess in the farinfrared that we interpret as radiation from a large disc whose inner edge is located very far from the star 550 au and does not attenuate its radiation we conclude that iras 221506109 is an intermediatemass star that is currently undergoing a short premainsequence evolutionary stage
|
[['we', 'present', 'the', 'results', 'of', 'a', 'spectroscopic', 'analysis', 'and', 'spectral', 'energy', 'distribution', 'sed', 'modelling', 'of', 'the', 'optical', 'counterpart', 'of', 'the', 'infrared', 'source', 'iras', '221506109', 'the', 'source', 'was', 'suggested', 'to', 'be', 'as', 'a', 'herbig', 'be', 'star', 'located', 'in', 'the', 'star', 'forming', 'region', 'l', '1188', 'absorption', 'lines', 'in', 'the', 'optical', 'spectrum', 'indicate', 'a', 'spectral', 'type', 'b3', 'while', 'weak', 'balmer', 'emission', 'lines', 'reflect', 'the', 'presence', 'of', 'a', 'circumstellar', 'gaseous', 'disc', 'the', 'star', 'shows', 'no', 'excess', 'radiation', 'in', 'the', 'nearinfrared', 'spectral', 'region', 'and', 'a', 'strong', 'excess', 'in', 'the', 'farinfrared', 'that', 'we', 'interpret', 'as', 'radiation', 'from', 'a', 'large', 'disc', 'whose', 'inner', 'edge', 'is', 'located', 'very', 'far', 'from', 'the', 'star', '550', 'au', 'and', 'does', 'not', 'attenuate', 'its', 'radiation', 'we', 'conclude', 'that', 'iras', '221506109', 'is', 'an', 'intermediatemass', 'star', 'that', 'is', 'currently', 'undergoing', 'a', 'short', 'premainsequence', 'evolutionary', 'stage']]
|
[-0.054322835778293665, 0.06173249587038754, -0.09154429006230203, 0.07512206111005071, -0.1183812178496737, -0.06193050019646762, 0.02233087474724016, 0.4701588225434534, -0.17371754194027744, -0.29402475936194605, 0.08121152831881773, -0.29374345367978094, -0.012724274973152205, 0.14429624865260848, -0.04896895895080888, -0.0782009083527555, 0.08597521964975385, -0.08390374550799606, 0.0007314040576602565, -0.12651591274152452, 0.2980440660721797, 0.10693909921610611, 0.1271707411378884, 0.025582630529243033, 0.008004073908523424, -0.12133349358737178, -0.06887685247056652, -0.04402389924507588, -0.13086322704197073, 0.03493570380487654, 0.23944374368147692, 0.11559915302859736, 0.20849677818932832, -0.3108855607933947, -0.2620815576719906, 0.06977885852757026, 0.19088760296290275, 0.019231864518587827, -0.07689342798403231, -0.2316151498525869, 0.07583449358207872, -0.18374906146345893, -0.1752607219677884, 0.1211611502658343, 0.03480881437280914, 0.024068133395758196, -0.24493531246480416, 0.08520719763328088, 0.07320656445062923, 0.1057069065154792, -0.13761271147723164, -0.07301821186410962, -0.10544931829645066, 0.06598250825845753, -0.021322810693163774, 0.10336953051955788, 0.18949168369726976, -0.15066439707879908, -0.02442454688025464, 0.37606479771784507, -0.1431184619918895, 0.030729984675417654, 0.2428147003010963, -0.2295229970368382, -0.1695543546738918, 0.23710479475266766, 0.06573261819357867, 0.17488479842722882, -0.15862580552857253, 0.0220369835483325, -0.017951915120647755, 0.2420870606729295, 0.044445564431953244, 0.11696240700894123, 0.3769714502923307, 0.09734309993109491, 0.005508092184754787, 0.17993264633423678, -0.28411790475365706, -0.036754580680280924, -0.26968763090553693, -0.08878696986357681, -0.1858538972282986, 0.09873493585212145, -0.0993625155421114, -0.15599799486062693, 0.3208628462757588, 0.061555940638299944, 0.22269171287916834, -0.018357868138082267, 0.30284885635774117, 0.09512220396391058, 0.11696376171312295, 0.15562968088124762, 0.3457667391994619, 0.15613740933258669, 0.14122202773614845, -0.27633798146416666, 0.057752723596422584, -0.021147986702089838]
|
1,803.06831
|
Electromagnetic multipole moments of the $P_c^+(4380)$ pentaquark in
light-cone QCD
|
We calculate the electromagnetic multipole moments of the $P_c^+(4380)$
pentaquark by modeling it as the diquark-diquark-antiquark and $\bar
D^*\Sigma_c$ molecular state with quantum numbers $J^P = \frac{3}{2}^-$. In
particular, the magnetic dipole, electric quadrupole and magnetic octupole
moments of this particle are extracted in the framework of light-cone QCD sum
rule. The values of the electromagnetic multipole moments obtained via two
pictures differ substantially from each other, which can be used to pin down
the underlying structure of $P_c^+(4380)$. The comparison of any future
experimental data on the electromagnetic multipole moments of the $P_c^+(4380)$
pentaquark with the results of the present work can shed light on the nature
and inner quark organization of this state.
|
hep-ph hep-ex hep-lat
|
we calculate the electromagnetic multipole moments of the p_c4380 pentaquark by modeling it as the diquarkdiquarkantiquark and bar dsigma_c molecular state with quantum numbers jp frac32 in particular the magnetic dipole electric quadrupole and magnetic octupole moments of this particle are extracted in the framework of lightcone qcd sum rule the values of the electromagnetic multipole moments obtained via two pictures differ substantially from each other which can be used to pin down the underlying structure of p_c4380 the comparison of any future experimental data on the electromagnetic multipole moments of the p_c4380 pentaquark with the results of the present work can shed light on the nature and inner quark organization of this state
|
[['we', 'calculate', 'the', 'electromagnetic', 'multipole', 'moments', 'of', 'the', 'p_c4380', 'pentaquark', 'by', 'modeling', 'it', 'as', 'the', 'diquarkdiquarkantiquark', 'and', 'bar', 'dsigma_c', 'molecular', 'state', 'with', 'quantum', 'numbers', 'jp', 'frac32', 'in', 'particular', 'the', 'magnetic', 'dipole', 'electric', 'quadrupole', 'and', 'magnetic', 'octupole', 'moments', 'of', 'this', 'particle', 'are', 'extracted', 'in', 'the', 'framework', 'of', 'lightcone', 'qcd', 'sum', 'rule', 'the', 'values', 'of', 'the', 'electromagnetic', 'multipole', 'moments', 'obtained', 'via', 'two', 'pictures', 'differ', 'substantially', 'from', 'each', 'other', 'which', 'can', 'be', 'used', 'to', 'pin', 'down', 'the', 'underlying', 'structure', 'of', 'p_c4380', 'the', 'comparison', 'of', 'any', 'future', 'experimental', 'data', 'on', 'the', 'electromagnetic', 'multipole', 'moments', 'of', 'the', 'p_c4380', 'pentaquark', 'with', 'the', 'results', 'of', 'the', 'present', 'work', 'can', 'shed', 'light', 'on', 'the', 'nature', 'and', 'inner', 'quark', 'organization', 'of', 'this', 'state']]
|
[-0.10565392326628953, 0.20198429525388698, -0.07555215552923057, 0.09296355801511948, -0.09856690108222609, -0.04344072245192109, 0.04739620614992945, 0.31971478491629424, -0.1916666995415366, -0.2907602359630625, -0.03199926342022719, -0.28314396352180393, -0.0455087552402626, 0.11243934519772761, 0.13674292930508064, 0.05444229934213932, 0.020346631422606214, 0.07138149283434216, -0.049188243253810104, -0.1783281653037544, 0.3161147162563315, 0.0030822135260933194, 0.23570906027759375, 0.08827078887955858, 0.002076154632959515, 0.0012007394888266724, 0.02525213314016072, -0.04156114824377654, -0.10260789588950534, 0.13699459257380417, 0.20421872175811268, 0.0923243068718237, 0.12921242882995948, -0.44656410041314204, -0.11965246612753458, 0.07791958519731436, 0.1529398556326908, 0.13082388503652623, -0.00956251350713469, -0.3654792944230793, 0.1081361060236017, -0.17696283655567913, -0.15962495954233435, -0.17039793593964228, -0.028884239987012717, 0.07403497046611288, -0.28686666745016465, 0.08618328270038769, 0.026724054529168234, 0.03218301088271434, -0.08148036722355244, -0.26661189623471154, -0.019607342908305948, 0.06609780993312597, 0.08984005101037358, 0.09410490040062812, 0.15402704419306756, -0.14317979771652045, -0.18969489570314946, 0.38842961473161713, -0.025010286604683324, -0.19561685159344944, 0.0765046748790171, -0.2216229015642679, -0.13845184733764382, 0.10331712944204346, 0.15526607515813226, 0.10297785989997353, -0.12429220716340321, 0.06502235532389022, -0.026180824612087587, 0.14508685084435632, 0.08803348184824643, 0.079154396850387, 0.28580256374149476, 0.10566237763902009, -0.057157219738879224, 0.11384641361298252, -0.11586192130160175, -0.10026143467576619, -0.29972049902732434, -0.10673137886547729, -0.21178730259437048, 0.056843336500031386, -0.07897981789535966, -0.10664732566332086, 0.4169018369886959, 0.10551592829359467, 0.2112943086029733, -0.03508052683186211, 0.3180281500650668, 0.09472934647540872, 0.052833054111576065, 0.0545052080987054, 0.2968747678821449, 0.20306555439285084, 0.11686144652425387, -0.30169521888775197, 0.037533361248247195, 0.04284468786627577]
|
1,803.06832
|
Boosting the Maxwell double layer potential using a right spin factor
|
We construct new spin singular integral equations for solving scattering
problems for Maxwell's equations, both against perfect conductors and in media
with piecewise constant permittivity, permeability and conductivity, improving
and extending earlier formulations by the author. These differ in a fundamental
way from classical integral equations, which use double layer potential
operators, and have the advantage of having a better condition number, in
particular in Fredholm sense and on Lipschitz regular interfaces, and do not
suffer from spurious resonances. The construction of the integral equations
builds on the observation that the double layer potential factorises into a
boundary value problem and an ansatz. We modify the ansatz, inspired by a
non-selfadjoint local elliptic boundary condition for Dirac equations.
|
math.AP math.NA
|
we construct new spin singular integral equations for solving scattering problems for maxwells equations both against perfect conductors and in media with piecewise constant permittivity permeability and conductivity improving and extending earlier formulations by the author these differ in a fundamental way from classical integral equations which use double layer potential operators and have the advantage of having a better condition number in particular in fredholm sense and on lipschitz regular interfaces and do not suffer from spurious resonances the construction of the integral equations builds on the observation that the double layer potential factorises into a boundary value problem and an ansatz we modify the ansatz inspired by a nonselfadjoint local elliptic boundary condition for dirac equations
|
[['we', 'construct', 'new', 'spin', 'singular', 'integral', 'equations', 'for', 'solving', 'scattering', 'problems', 'for', 'maxwells', 'equations', 'both', 'against', 'perfect', 'conductors', 'and', 'in', 'media', 'with', 'piecewise', 'constant', 'permittivity', 'permeability', 'and', 'conductivity', 'improving', 'and', 'extending', 'earlier', 'formulations', 'by', 'the', 'author', 'these', 'differ', 'in', 'a', 'fundamental', 'way', 'from', 'classical', 'integral', 'equations', 'which', 'use', 'double', 'layer', 'potential', 'operators', 'and', 'have', 'the', 'advantage', 'of', 'having', 'a', 'better', 'condition', 'number', 'in', 'particular', 'in', 'fredholm', 'sense', 'and', 'on', 'lipschitz', 'regular', 'interfaces', 'and', 'do', 'not', 'suffer', 'from', 'spurious', 'resonances', 'the', 'construction', 'of', 'the', 'integral', 'equations', 'builds', 'on', 'the', 'observation', 'that', 'the', 'double', 'layer', 'potential', 'factorises', 'into', 'a', 'boundary', 'value', 'problem', 'and', 'an', 'ansatz', 'we', 'modify', 'the', 'ansatz', 'inspired', 'by', 'a', 'nonselfadjoint', 'local', 'elliptic', 'boundary', 'condition', 'for', 'dirac', 'equations']]
|
[-0.1241774787155564, 0.06758151456856236, -0.08139089819328008, 0.008168794889539734, -0.15733397630698412, -0.1615003709902324, -0.004364154187141586, 0.3091504529702588, -0.2841771492829262, -0.26428651185390556, 0.09134559241869344, -0.2883331760038006, -0.16635629333658303, 0.20125900430040497, -0.04503474202228047, 0.09899713823540231, 0.06533955614540284, -0.009301550654789149, -0.1051839344830931, -0.20222437852930467, 0.3994886430633507, -0.03693042021102698, 0.2422619416690195, 0.059247205057576045, 0.12170921169395038, 0.041518199820884394, -0.0035260933810466175, 0.03280840293105723, -0.13327020256795133, 0.10518168764469071, 0.24666486448071645, -0.009705266975442547, 0.23641573932116566, -0.47226408412048626, -0.24262679284374364, 0.06466840281766856, 0.14144209410474337, 0.10045190009000411, -0.04606118812067908, -0.2861138470155203, 0.04333643732450397, -0.11918618047602032, -0.19877995910533405, -0.07399586349196921, -0.021893153914203076, 0.010030887980542887, -0.28164984283069056, 0.10304309130583147, 0.07277497744692837, 0.029222107855445247, -0.14660406787879765, -0.1430033477638864, 0.007947338141216818, 0.07383095405569648, 0.009173009369001424, -0.022847175976987613, 0.06851300232159763, -0.15526166076621956, -0.09077660591732237, 0.325114926111182, -0.08385987419998116, -0.27923576873371975, 0.1295255201718754, -0.11375707657455261, -0.0825996292968107, 0.13940656794456102, 0.1334070707039939, 0.15005268646656708, -0.15352104734471542, 0.15978332095576245, -0.04901556801484992, 0.10068358405950968, 0.13599356397260295, 0.0012062351037827083, 0.13279414065261136, 0.06975898307440329, 0.09267776297263296, 0.10038705561675083, 0.028520372712006, -0.1152907408856771, -0.313663742015675, -0.15362495787405228, -0.15498817538037518, 0.08308639349941248, -0.11455304341667462, -0.23848318462496845, 0.35592825538715567, 0.14294173044568892, 0.15898077212810768, 0.065621020123402, 0.25575418249404025, 0.17982901513608077, 0.07999777877742772, 0.08568233172251385, 0.2112171464654917, 0.18959570187143981, 0.14217512025813556, -0.21085141876207317, 0.008194855631376475, 0.17266218967625271]
|
1,803.06833
|
An adaptive minimum spanning tree multi-element method for uncertainty
quantification of smooth and discontinuous responses
|
A novel approach for non-intrusive uncertainty propagation is proposed. Our
approach overcomes the limitation of many traditional methods, such as
generalised polynomial chaos methods, which may lack sufficient accuracy when
the quantity of interest depends discontinuously on the input parameters. As a
remedy we propose an adaptive sampling algorithm based on minimum spanning
trees combined with a domain decomposition method based on support vector
machines. The minimum spanning tree determines new sample locations based on
both the probability density of the input parameters and the gradient in the
quantity of interest. The support vector machine efficiently decomposes the
random space in multiple elements, avoiding the appearance of Gibbs phenomena
near discontinuities. On each element, local approximations are constructed by
means of least orthogonal interpolation, in order to produce stable
interpolation on the unstructured sample set. The resulting minimum spanning
tree multi-element method does not require initial knowledge of the behaviour
of the quantity of interest and automatically detects whether discontinuities
are present. We present several numerical examples that demonstrate accuracy,
efficiency and generality of the method.
|
math.NA
|
a novel approach for nonintrusive uncertainty propagation is proposed our approach overcomes the limitation of many traditional methods such as generalised polynomial chaos methods which may lack sufficient accuracy when the quantity of interest depends discontinuously on the input parameters as a remedy we propose an adaptive sampling algorithm based on minimum spanning trees combined with a domain decomposition method based on support vector machines the minimum spanning tree determines new sample locations based on both the probability density of the input parameters and the gradient in the quantity of interest the support vector machine efficiently decomposes the random space in multiple elements avoiding the appearance of gibbs phenomena near discontinuities on each element local approximations are constructed by means of least orthogonal interpolation in order to produce stable interpolation on the unstructured sample set the resulting minimum spanning tree multielement method does not require initial knowledge of the behaviour of the quantity of interest and automatically detects whether discontinuities are present we present several numerical examples that demonstrate accuracy efficiency and generality of the method
|
[['a', 'novel', 'approach', 'for', 'nonintrusive', 'uncertainty', 'propagation', 'is', 'proposed', 'our', 'approach', 'overcomes', 'the', 'limitation', 'of', 'many', 'traditional', 'methods', 'such', 'as', 'generalised', 'polynomial', 'chaos', 'methods', 'which', 'may', 'lack', 'sufficient', 'accuracy', 'when', 'the', 'quantity', 'of', 'interest', 'depends', 'discontinuously', 'on', 'the', 'input', 'parameters', 'as', 'a', 'remedy', 'we', 'propose', 'an', 'adaptive', 'sampling', 'algorithm', 'based', 'on', 'minimum', 'spanning', 'trees', 'combined', 'with', 'a', 'domain', 'decomposition', 'method', 'based', 'on', 'support', 'vector', 'machines', 'the', 'minimum', 'spanning', 'tree', 'determines', 'new', 'sample', 'locations', 'based', 'on', 'both', 'the', 'probability', 'density', 'of', 'the', 'input', 'parameters', 'and', 'the', 'gradient', 'in', 'the', 'quantity', 'of', 'interest', 'the', 'support', 'vector', 'machine', 'efficiently', 'decomposes', 'the', 'random', 'space', 'in', 'multiple', 'elements', 'avoiding', 'the', 'appearance', 'of', 'gibbs', 'phenomena', 'near', 'discontinuities', 'on', 'each', 'element', 'local', 'approximations', 'are', 'constructed', 'by', 'means', 'of', 'least', 'orthogonal', 'interpolation', 'in', 'order', 'to', 'produce', 'stable', 'interpolation', 'on', 'the', 'unstructured', 'sample', 'set', 'the', 'resulting', 'minimum', 'spanning', 'tree', 'multielement', 'method', 'does', 'not', 'require', 'initial', 'knowledge', 'of', 'the', 'behaviour', 'of', 'the', 'quantity', 'of', 'interest', 'and', 'automatically', 'detects', 'whether', 'discontinuities', 'are', 'present', 'we', 'present', 'several', 'numerical', 'examples', 'that', 'demonstrate', 'accuracy', 'efficiency', 'and', 'generality', 'of', 'the', 'method']]
|
[-0.10269529989934446, 0.07434615167990573, -0.08582250248634503, 0.03692820022446209, -0.11567326156761158, -0.07219075036647898, 0.09439223498338833, 0.38419552922211797, -0.28191339037783275, -0.319300101358253, 0.11851526236238318, -0.22183183388022537, -0.15781439960383895, 0.20652052738957785, -0.0838651167710354, 0.11121183123561257, 0.10155258145955899, 0.05427060284736482, -0.06840453007672212, -0.24067369831358187, 0.31386000667804514, 0.024221452257320794, 0.3345546956473051, 0.010704810852819885, 0.15523305648556826, 0.020292987158014017, -0.0633877835180928, 0.03257626466785785, -0.09467191879118465, 0.13587044489461483, 0.2258836973328884, 0.19371722223687274, 0.3169303291942924, -0.381175880933783, -0.23998207388318737, 0.1276580095506109, 0.14336799654516985, 0.09752953696972161, -0.028751831786146133, -0.2282926100306213, 0.08556069906361782, -0.1189499787091005, -0.11059771495109255, -0.11908900554143739, -0.043937769922195, 0.05307830064239996, -0.30210000931401737, 0.05742079446182205, 0.03888641534418143, 0.05604731280684725, -0.03192325955288569, -0.15105493733161976, 0.007051563516142778, 0.10610732047858949, -0.027913644519602796, 0.021760516191451727, 0.11081921169865051, -0.08813592621167614, -0.14036310918957248, 0.35943210309117357, -0.05712313501399793, -0.24177393012029247, 0.1936955332520566, -0.07826822485020041, -0.13088619709014893, 0.15840055418216667, 0.21139719914009963, 0.14284925700601228, -0.11675838979441654, 0.07309535889924684, -0.014452743913517968, 0.16285396151413972, 0.05995730686779346, 0.01458194535437294, 0.1673473953269422, 0.18036721523491328, 0.11263315151121457, 0.11874913291169585, -0.11394744819633408, -0.08618977919104509, -0.2945925551469951, -0.11691936004949226, -0.2484747881720647, -0.04487298443952816, -0.14553104096731576, -0.22765020065178926, 0.39551796988234855, 0.2032589922647193, 0.21661625331034884, 0.05722736209612445, 0.3205087972243994, 0.09449719152102758, 0.04987384637140415, 0.10600197518413718, 0.16112838500306348, 0.10377996291208547, 0.03705226238633424, -0.21285403523076887, 0.11872993151403287, 0.13214496392703784]
|
1,803.06834
|
Ground-state wavefunction of macroscopic electron systems
|
Wavefunctions for large electron numbers $N$ are plagued by the Exponential
Wall Problem (EWP), i.e., an exponential increase in the dimensions of Hilbert
space with $N$. Therefore they loose their meaning for macroscopic systems, a
point stressed in particular by W. Kohn. The EWP has to be resolved in order to
be able to perform electronic structure calculations, e.g., for solids. The
origin of the EWP is the multiplicative property of wavefunctions when
independent subsystems are considered. Therefore it can only be avoided when
wavefunctions are formulated so that they are additive instead, in particular
when matrix elements involving them are calculated. We describe how this is
done for the ground state of a macroscopic electron system. Going over from a
multiplicative to an additive quantity requires taking a logarithm. Here it
implies going over from Hilbert space to the operator- or Liouville space with
a metric based on cumulants. The operators which define the ground-state
wavefunction generate fluctuations from a mean-field state. The latter does not
suffer from an EWP and therefore may serve as a vacuum state. The fluctuations
have to be {\it connected} like the ones caused by pair interactions in a
classical gas when the free energy is calculated (Meyer's cluster expansion).
This fixes the metric in Liouville space. The scheme presented here provides a
solid basis for electronic structure calculations for the ground state of
solids. In fact, its applicability has already been proven. We discuss also
matrix product states, which have been applied to one-dimensional systems with
results of high precision. Although these states are formulated in Hilbert
space they are processed by using operators in Liouville space. We show that
they fit into the general formalism described above.
|
cond-mat.other quant-ph
|
wavefunctions for large electron numbers n are plagued by the exponential wall problem ewp ie an exponential increase in the dimensions of hilbert space with n therefore they loose their meaning for macroscopic systems a point stressed in particular by w kohn the ewp has to be resolved in order to be able to perform electronic structure calculations eg for solids the origin of the ewp is the multiplicative property of wavefunctions when independent subsystems are considered therefore it can only be avoided when wavefunctions are formulated so that they are additive instead in particular when matrix elements involving them are calculated we describe how this is done for the ground state of a macroscopic electron system going over from a multiplicative to an additive quantity requires taking a logarithm here it implies going over from hilbert space to the operator or liouville space with a metric based on cumulants the operators which define the groundstate wavefunction generate fluctuations from a meanfield state the latter does not suffer from an ewp and therefore may serve as a vacuum state the fluctuations have to be it connected like the ones caused by pair interactions in a classical gas when the free energy is calculated meyers cluster expansion this fixes the metric in liouville space the scheme presented here provides a solid basis for electronic structure calculations for the ground state of solids in fact its applicability has already been proven we discuss also matrix product states which have been applied to onedimensional systems with results of high precision although these states are formulated in hilbert space they are processed by using operators in liouville space we show that they fit into the general formalism described above
|
[['wavefunctions', 'for', 'large', 'electron', 'numbers', 'n', 'are', 'plagued', 'by', 'the', 'exponential', 'wall', 'problem', 'ewp', 'ie', 'an', 'exponential', 'increase', 'in', 'the', 'dimensions', 'of', 'hilbert', 'space', 'with', 'n', 'therefore', 'they', 'loose', 'their', 'meaning', 'for', 'macroscopic', 'systems', 'a', 'point', 'stressed', 'in', 'particular', 'by', 'w', 'kohn', 'the', 'ewp', 'has', 'to', 'be', 'resolved', 'in', 'order', 'to', 'be', 'able', 'to', 'perform', 'electronic', 'structure', 'calculations', 'eg', 'for', 'solids', 'the', 'origin', 'of', 'the', 'ewp', 'is', 'the', 'multiplicative', 'property', 'of', 'wavefunctions', 'when', 'independent', 'subsystems', 'are', 'considered', 'therefore', 'it', 'can', 'only', 'be', 'avoided', 'when', 'wavefunctions', 'are', 'formulated', 'so', 'that', 'they', 'are', 'additive', 'instead', 'in', 'particular', 'when', 'matrix', 'elements', 'involving', 'them', 'are', 'calculated', 'we', 'describe', 'how', 'this', 'is', 'done', 'for', 'the', 'ground', 'state', 'of', 'a', 'macroscopic', 'electron', 'system', 'going', 'over', 'from', 'a', 'multiplicative', 'to', 'an', 'additive', 'quantity', 'requires', 'taking', 'a', 'logarithm', 'here', 'it', 'implies', 'going', 'over', 'from', 'hilbert', 'space', 'to', 'the', 'operator', 'or', 'liouville', 'space', 'with', 'a', 'metric', 'based', 'on', 'cumulants', 'the', 'operators', 'which', 'define', 'the', 'groundstate', 'wavefunction', 'generate', 'fluctuations', 'from', 'a', 'meanfield', 'state', 'the', 'latter', 'does', 'not', 'suffer', 'from', 'an', 'ewp', 'and', 'therefore', 'may', 'serve', 'as', 'a', 'vacuum', 'state', 'the', 'fluctuations', 'have', 'to', 'be', 'it', 'connected', 'like', 'the', 'ones', 'caused', 'by', 'pair', 'interactions', 'in', 'a', 'classical', 'gas', 'when', 'the', 'free', 'energy', 'is', 'calculated', 'meyers', 'cluster', 'expansion', 'this', 'fixes', 'the', 'metric', 'in', 'liouville', 'space', 'the', 'scheme', 'presented', 'here', 'provides', 'a', 'solid', 'basis', 'for', 'electronic', 'structure', 'calculations', 'for', 'the', 'ground', 'state', 'of', 'solids', 'in', 'fact', 'its', 'applicability', 'has', 'already', 'been', 'proven', 'we', 'discuss', 'also', 'matrix', 'product', 'states', 'which', 'have', 'been', 'applied', 'to', 'onedimensional', 'systems', 'with', 'results', 'of', 'high', 'precision', 'although', 'these', 'states', 'are', 'formulated', 'in', 'hilbert', 'space', 'they', 'are', 'processed', 'by', 'using', 'operators', 'in', 'liouville', 'space', 'we', 'show', 'that', 'they', 'fit', 'into', 'the', 'general', 'formalism', 'described', 'above']]
|
[-0.09589511314590805, 0.1808461742391381, -0.10093138723556573, 0.09297612260234657, -0.02532456221075304, -0.11340455098665858, 0.02892499844412924, 0.35441666058215654, -0.282100586789219, -0.2557814983454974, 0.09398113423141471, -0.2743091648321991, -0.11514405525093407, 0.177267135875994, -0.035789150533495115, 0.05596318835282306, 0.050740365799630816, 0.05077385117397889, -0.0860941274810517, -0.23596804461262205, 0.34794765821935836, 0.0330654188559652, 0.23357680449180565, 0.04072340023132008, 0.07455683791552457, -0.002693351629402554, 0.013986658131736412, 0.041286768668878565, -0.09082823702437484, 0.08877512798072737, 0.2648048459225449, 0.06898513880620605, 0.24811692278538094, -0.4493434583474147, -0.21780454261410215, 0.10827902501547022, 0.15879951382741095, 0.10852746971670472, 0.0021761035616101143, -0.2877811779072018, 0.0591336350544895, -0.17504524852623018, -0.14518758299057943, -0.1395642482675612, 0.007389142310344859, -0.009465392073003674, -0.24867634441286915, 0.06076548623254016, 0.035945616409247906, 0.0037515568476999507, -0.05999943863870086, -0.11422276692056473, -0.02204133201014708, 0.11038828749299506, 0.013339759973939835, 0.046335484106257034, 0.10623130289135141, -0.10186324346741138, -0.09092573203644796, 0.40102717375644203, -0.04633649426549183, -0.24834858398729315, 0.1547612951615041, -0.1529528892893148, -0.11845319710279766, 0.1298618385470227, 0.12285180234497314, 0.09076349327316213, -0.12945511832061274, 0.13584383351449025, -0.028493285548399416, 0.1456760605061917, 0.048536278175092054, 0.0767091586362783, 0.1721830814349743, 0.10230751338806984, 0.05080174189387706, 0.11511095423341255, -0.02598993132031817, -0.12478178368652598, -0.2850524878488821, -0.16224343279008233, -0.22841116218631596, 0.08513895838951341, -0.03736888997317006, -0.1770068218829437, 0.34583689060613354, 0.09746435533559537, 0.19496993615308353, 0.007653502199243297, 0.23781961020850167, 0.16574141243431847, 0.07804923886433243, 0.07014506763483504, 0.24481364402821973, 0.1300394242351646, 0.059516084618997156, -0.18026231725438777, 0.05243066000147608, 0.08924324943504312]
|
1,803.06835
|
Prediction of two-dimensional nodal-line semimetal in a carbon nitride
covalent network
|
Carbon nitride compounds have emerged recently as a prominent member of 2D
materials beyond graphene. The experimental realizations of 2D graphitic carbon
nitride g-C$_3$N$_4$, nitrogenated holey grahpene C$_2$N, polyaniline C$_3$N
have shown their promising potential in energy and environmental applications.
In this work, we predict a new type of carbon nitride network with a C$_9$N$_4$
stoichiometry from first principle calculations. Unlike common C-N compounds
and covalent organic frameworks (COFs), which are typically insulating,
surprisingly C$_9$N$_4$ is found to be a 2D nodal-line semimetal (NLSM). The
nodal line in C$_9$N$_4$ forms a closed ring centered at $\Gamma$ point, which
originates from the pz orbitals of both C and N. The linear crossing happens
right at Fermi level contributed by two sets of dispersive Kagome and Dirac
bands, which is robust due to negligible spin-orbital-coupling (SOC) in C and
N. Besides, it is revealed that the formation of nodal ring is of accidental
band degeneracy in nature induced by the chemical potential difference of C and
N, as validated by a single orbital tight-binding model, rather than protected
by crystal in-plane mirror symmetry or band topology. Interestingly, a new
structure of nodal line, i.e., nodal-cylinder, is found in momentum space for
AA-stacking C$_9$N$_4$. Our results imply possible functionalization for a
novel metal-free C-N covalent network with interesting semimetallic properties.
|
cond-mat.mtrl-sci
|
carbon nitride compounds have emerged recently as a prominent member of 2d materials beyond graphene the experimental realizations of 2d graphitic carbon nitride gc_3n_4 nitrogenated holey grahpene c_2n polyaniline c_3n have shown their promising potential in energy and environmental applications in this work we predict a new type of carbon nitride network with a c_9n_4 stoichiometry from first principle calculations unlike common cn compounds and covalent organic frameworks cofs which are typically insulating surprisingly c_9n_4 is found to be a 2d nodalline semimetal nlsm the nodal line in c_9n_4 forms a closed ring centered at gamma point which originates from the pz orbitals of both c and n the linear crossing happens right at fermi level contributed by two sets of dispersive kagome and dirac bands which is robust due to negligible spinorbitalcoupling soc in c and n besides it is revealed that the formation of nodal ring is of accidental band degeneracy in nature induced by the chemical potential difference of c and n as validated by a single orbital tightbinding model rather than protected by crystal inplane mirror symmetry or band topology interestingly a new structure of nodal line ie nodalcylinder is found in momentum space for aastacking c_9n_4 our results imply possible functionalization for a novel metalfree cn covalent network with interesting semimetallic properties
|
[['carbon', 'nitride', 'compounds', 'have', 'emerged', 'recently', 'as', 'a', 'prominent', 'member', 'of', '2d', 'materials', 'beyond', 'graphene', 'the', 'experimental', 'realizations', 'of', '2d', 'graphitic', 'carbon', 'nitride', 'gc_3n_4', 'nitrogenated', 'holey', 'grahpene', 'c_2n', 'polyaniline', 'c_3n', 'have', 'shown', 'their', 'promising', 'potential', 'in', 'energy', 'and', 'environmental', 'applications', 'in', 'this', 'work', 'we', 'predict', 'a', 'new', 'type', 'of', 'carbon', 'nitride', 'network', 'with', 'a', 'c_9n_4', 'stoichiometry', 'from', 'first', 'principle', 'calculations', 'unlike', 'common', 'cn', 'compounds', 'and', 'covalent', 'organic', 'frameworks', 'cofs', 'which', 'are', 'typically', 'insulating', 'surprisingly', 'c_9n_4', 'is', 'found', 'to', 'be', 'a', '2d', 'nodalline', 'semimetal', 'nlsm', 'the', 'nodal', 'line', 'in', 'c_9n_4', 'forms', 'a', 'closed', 'ring', 'centered', 'at', 'gamma', 'point', 'which', 'originates', 'from', 'the', 'pz', 'orbitals', 'of', 'both', 'c', 'and', 'n', 'the', 'linear', 'crossing', 'happens', 'right', 'at', 'fermi', 'level', 'contributed', 'by', 'two', 'sets', 'of', 'dispersive', 'kagome', 'and', 'dirac', 'bands', 'which', 'is', 'robust', 'due', 'to', 'negligible', 'spinorbitalcoupling', 'soc', 'in', 'c', 'and', 'n', 'besides', 'it', 'is', 'revealed', 'that', 'the', 'formation', 'of', 'nodal', 'ring', 'is', 'of', 'accidental', 'band', 'degeneracy', 'in', 'nature', 'induced', 'by', 'the', 'chemical', 'potential', 'difference', 'of', 'c', 'and', 'n', 'as', 'validated', 'by', 'a', 'single', 'orbital', 'tightbinding', 'model', 'rather', 'than', 'protected', 'by', 'crystal', 'inplane', 'mirror', 'symmetry', 'or', 'band', 'topology', 'interestingly', 'a', 'new', 'structure', 'of', 'nodal', 'line', 'ie', 'nodalcylinder', 'is', 'found', 'in', 'momentum', 'space', 'for', 'aastacking', 'c_9n_4', 'our', 'results', 'imply', 'possible', 'functionalization', 'for', 'a', 'novel', 'metalfree', 'cn', 'covalent', 'network', 'with', 'interesting', 'semimetallic', 'properties']]
|
[-0.1668999016712701, 0.10607137044642641, 0.001306833278355297, -0.011006160010719065, -0.029261878785828865, -0.22909693597750955, 0.10318551443430574, 0.4076543802086827, -0.24789754755924953, -0.26144148495134917, -0.015298338542417569, -0.323076123036011, -0.17806716968933511, 0.15092051689334343, 0.025631889259052833, 0.012680143958260847, 0.01174996767063127, -0.07815342955452019, -0.0892225835225978, -0.19370665851720545, 0.2889908201494362, 0.021607948589506883, 0.297723608360041, 0.06972738533973867, -0.000970048110845477, -0.055542214055610606, 0.10893977948486112, 0.01090349773429659, -0.12763928558347817, 0.12498923714088579, 0.24895037083215146, -0.09313078112142203, 0.1853847603616846, -0.43110975157036335, -0.22175133696020863, 0.016820727045063016, 0.13130355635008148, 0.10454307979373478, -0.08303149407946094, -0.27447524025689723, 0.0720940145777625, -0.14279454588933393, -0.14234623836006882, -0.06082804085697632, 0.04411340556703075, -0.010121668838397707, -0.2076670750317727, 0.06374046377577754, 0.04611916354976508, 0.09674465332344732, -0.07377433663580653, -0.17680140850621515, -0.1755778645739219, 0.010258785277323493, 0.01671591002553658, 0.032017880953918755, 0.12851386469691387, -0.07504460979253054, -0.09398485320555262, 0.45351056211389773, -0.05441227005503606, -0.07902130869996929, 0.17719754983216177, -0.13668868867247258, -0.13782397352787124, 0.19273281985633942, 0.09354832744588643, 0.08570511534615138, -0.1186281529950996, 0.13165278507147504, -0.05498113763832682, 0.13820444338286275, 0.07150685894736197, 0.07479297812963122, 0.2781073779734068, 0.18704709806750247, 0.04499358402505561, 0.09572990084575289, -0.11402962060082097, -0.01846034244747919, -0.199707148570654, -0.20264400408040126, -0.2366114599348674, 0.077709133459626, -0.05251270126521609, -0.21108482445219293, 0.38737195427637805, 0.04284198086283733, 0.17983207182612185, -0.06843442379031331, 0.19158958111304877, 0.04564561250153929, 0.11385976404092427, 0.030192959399150718, 0.22685184759022883, 0.13900061817460715, 0.05605565880284493, -0.20368084144388693, 0.06619249486126179, 0.02664409589542206]
|
1,803.06836
|
The art of the state
|
Quantum field theory on curved spacetimes lacks an obvious distinguished
vacuum state. We review a recent no-go theorem that establishes the
impossibility of finding a preferred state in each globally hyperbolic
spacetime, subject to certain natural conditions. The result applies in
particular to the free scalar field, but the proof is model-independent and
therefore of wider applicability. In addition, we critically examine the
recently proposed "SJ states", that are determined by the spacetime geometry
alone, but which fail to be Hadamard in general. We describe a modified
construction that can yield an infinite family of Hadamard states, and also
explain recent results that motivate the Hadamard condition without direct
reference to ultra-high energies or ultra-short distance structure.
|
gr-qc
|
quantum field theory on curved spacetimes lacks an obvious distinguished vacuum state we review a recent nogo theorem that establishes the impossibility of finding a preferred state in each globally hyperbolic spacetime subject to certain natural conditions the result applies in particular to the free scalar field but the proof is modelindependent and therefore of wider applicability in addition we critically examine the recently proposed sj states that are determined by the spacetime geometry alone but which fail to be hadamard in general we describe a modified construction that can yield an infinite family of hadamard states and also explain recent results that motivate the hadamard condition without direct reference to ultrahigh energies or ultrashort distance structure
|
[['quantum', 'field', 'theory', 'on', 'curved', 'spacetimes', 'lacks', 'an', 'obvious', 'distinguished', 'vacuum', 'state', 'we', 'review', 'a', 'recent', 'nogo', 'theorem', 'that', 'establishes', 'the', 'impossibility', 'of', 'finding', 'a', 'preferred', 'state', 'in', 'each', 'globally', 'hyperbolic', 'spacetime', 'subject', 'to', 'certain', 'natural', 'conditions', 'the', 'result', 'applies', 'in', 'particular', 'to', 'the', 'free', 'scalar', 'field', 'but', 'the', 'proof', 'is', 'modelindependent', 'and', 'therefore', 'of', 'wider', 'applicability', 'in', 'addition', 'we', 'critically', 'examine', 'the', 'recently', 'proposed', 'sj', 'states', 'that', 'are', 'determined', 'by', 'the', 'spacetime', 'geometry', 'alone', 'but', 'which', 'fail', 'to', 'be', 'hadamard', 'in', 'general', 'we', 'describe', 'a', 'modified', 'construction', 'that', 'can', 'yield', 'an', 'infinite', 'family', 'of', 'hadamard', 'states', 'and', 'also', 'explain', 'recent', 'results', 'that', 'motivate', 'the', 'hadamard', 'condition', 'without', 'direct', 'reference', 'to', 'ultrahigh', 'energies', 'or', 'ultrashort', 'distance', 'structure']]
|
[-0.13515586029483467, 0.14863313933755828, -0.1057708780042445, 0.09908275714275451, -0.11350404304993522, -0.15231923149643928, 0.006261633224506727, 0.3585990670367948, -0.21885276563131276, -0.26296911380675614, 0.08542933290362613, -0.1891484294229975, -0.15261570149515238, 0.19774859191443867, -0.1155899306281637, 0.028198598247244317, 0.06156161725998689, 0.032726415667810246, -0.09366690100401513, -0.23833487644536883, 0.3574531322034697, 0.05566591736721273, 0.3056096101943881, 0.0856412164031122, 0.07896999568224718, 0.019534104507671207, -0.004314615040953852, 0.03776135938799279, -0.15796689477547182, 0.1027815649435163, 0.2322521842817147, 0.1213777760306421, 0.2155920582719975, -0.43171903984541565, -0.22247332678167508, 0.10694649727601144, 0.10009909343595307, 0.1627247547561653, -0.07265216006368048, -0.3016041394752952, 0.08901399082273372, -0.1410885661139957, -0.20010754152829957, -0.09658258589000529, -0.004177320014255552, -0.05941361260926749, -0.2262064478480512, 0.07163001516307545, 0.1029357781721295, -0.0069438268661371665, -0.07155128476074618, -0.06682993167450126, 0.0020651001499122023, 0.060502155797365, 0.034661513150263674, 0.0419193957414892, 0.09782540075815259, -0.08722388393516278, -0.14286148108036503, 0.32757218052487835, -0.059449314296993815, -0.22328509768529828, 0.17781445977047214, -0.138770212391471, -0.13116939753715873, 0.09035665306668633, 0.11421219249152476, 0.151668930796381, -0.1298642922075899, 0.12760982522243458, -0.06993057086275747, 0.1519450413244259, 0.10241317469029664, 0.07367342380800834, 0.18305069110833871, 0.05236465710963513, 0.08513184981500237, 0.12045931255815025, 0.004193748182290767, -0.14163489419415703, -0.35452694084463465, -0.18327656194282116, -0.18465033096149883, 0.11456884145060092, -0.0657070514265424, -0.19883428955784974, 0.37433261073266083, 0.15477393086776775, 0.1615811169036051, 0.02015249162980029, 0.22221133773191235, 0.08546905920285588, 0.024959044427507453, 0.058343473662677996, 0.2843864129967669, 0.15995980330153853, 0.062169400612927146, -0.15188406083064201, 0.003950949843861481, 0.06379758506121798]
|
1,803.06837
|
Nonhomogeneous Dirichlet problems without the Ambrosetti-Rabinowitz
condition
|
We consider the existence of solutions of the following $p(x)$-Laplacian
Dirichlet problem without the Ambrosetti-Rabinowitz condition:
$-\mbox{div}(|\nabla u|^{p(x)-2}\nabla u)=f(x,u) \text{ in }\Omega,$ and
$u=0,\text{ on }\partial \Omega.$ We give a new growth condition and we point
out its importance for checking the Cerami compactness condition. We prove the
existence of solutions of the above problem via the critical point theory, and
also provide some multiplicity properties. Our results extend previous work by
Q. Zhang and C. Zhao, Existence of strong solutions of a $p(x)$-Laplacian
Dirichlet problem without the Ambrosetti-Rabinowitz condition, Comp. Math.
Appl. 69 (2015), 1-12, and we establish the existence of solutions under weaker
hypotheses on the nonlinear term.
|
math.AP
|
we consider the existence of solutions of the following pxlaplacian dirichlet problem without the ambrosettirabinowitz condition mboxdivnabla upx2nabla ufxu text in omega and u0text on partial omega we give a new growth condition and we point out its importance for checking the cerami compactness condition we prove the existence of solutions of the above problem via the critical point theory and also provide some multiplicity properties our results extend previous work by q zhang and c zhao existence of strong solutions of a pxlaplacian dirichlet problem without the ambrosettirabinowitz condition comp math appl 69 2015 112 and we establish the existence of solutions under weaker hypotheses on the nonlinear term
|
[['we', 'consider', 'the', 'existence', 'of', 'solutions', 'of', 'the', 'following', 'pxlaplacian', 'dirichlet', 'problem', 'without', 'the', 'ambrosettirabinowitz', 'condition', 'mboxdivnabla', 'upx2nabla', 'ufxu', 'text', 'in', 'omega', 'and', 'u0text', 'on', 'partial', 'omega', 'we', 'give', 'a', 'new', 'growth', 'condition', 'and', 'we', 'point', 'out', 'its', 'importance', 'for', 'checking', 'the', 'cerami', 'compactness', 'condition', 'we', 'prove', 'the', 'existence', 'of', 'solutions', 'of', 'the', 'above', 'problem', 'via', 'the', 'critical', 'point', 'theory', 'and', 'also', 'provide', 'some', 'multiplicity', 'properties', 'our', 'results', 'extend', 'previous', 'work', 'by', 'q', 'zhang', 'and', 'c', 'zhao', 'existence', 'of', 'strong', 'solutions', 'of', 'a', 'pxlaplacian', 'dirichlet', 'problem', 'without', 'the', 'ambrosettirabinowitz', 'condition', 'comp', 'math', 'appl', '69', '2015', '112', 'and', 'we', 'establish', 'the', 'existence', 'of', 'solutions', 'under', 'weaker', 'hypotheses', 'on', 'the', 'nonlinear', 'term']]
|
[-0.17704571568491784, -0.018861040871111484, -0.06004644546827132, 0.051211277228272095, -0.12384492051364346, -0.1149231755301695, 0.08979847723596983, 0.2647252599708736, -0.2475429929242554, -0.2465987172104757, 0.1567343765086579, -0.2708941870623014, -0.11382123030383479, 0.15096704810540276, -0.08033714558590542, 0.09201370303212157, 0.07211968874431808, -0.005638224684199403, -0.05413576450876214, -0.24132670495151118, 0.3935981413899836, -0.046689230086154894, 0.2424183629389683, 0.12952028014855882, 0.06319758660075339, 0.020873756097121672, 0.030476445313119754, -0.03727178667375648, -0.27438436427619306, 0.0722795391169546, 0.17923339144750075, 0.11933828094254502, 0.3350442995147949, -0.38970257929441604, -0.20355800665830345, 0.140251936361363, 0.04645534030331129, 0.02418343757533214, -0.04043888797221536, -0.3088544978506186, 0.17979748420766556, -0.0643366842446002, -0.18142900099046527, -0.04051458934660662, 0.02553733812899075, 0.06386489427108741, -0.3377088906920769, 0.15657732036065267, 0.19793655259365386, 0.06669021809515967, -0.165964744719465, -0.11731139233505183, -0.014455139049625193, 0.010030211224644021, 0.05067145781570368, 0.016211660142818635, -0.008705282088538463, -0.12361335567283359, -0.10282053117724982, 0.3125759741122072, -0.0622750355608084, -0.2403053693473339, 0.18933098581407898, -0.09484385169026527, -0.1690497892316092, 0.05991607519628649, 0.12156175986906005, 0.1780687584287741, -0.11962017514319583, 0.19869854125691663, -0.11154523755593056, 0.12362806229608726, 0.17911704214797777, -0.025342429166829043, 0.06603680846958675, 0.08514729385179552, 0.14370758737522094, 0.13658453305675225, -0.020274877351370048, -0.04886019500819119, -0.36343807550993834, -0.155546970682388, -0.09867060897787186, 0.11585876102643934, -0.08201560457514874, -0.14972866307097402, 0.3409948510160162, 0.1489417831117118, 0.17376937022940678, 0.07778107932006771, 0.13562754688318818, 0.1559542036668228, -0.07897654674333436, 0.10029951825907285, 0.2024310060832332, 0.18778778343165123, 0.175485707299297, -0.21522643628784202, 0.012773692667145621, 0.16945809078064156]
|
1,803.06838
|
NLOS Mitigation Using Sparsity Feature And Iterative Methods
|
Well-known methods are employed to localize mobile station (MS) using line of
sight (LOS) measurements. These methods may result in large error if they are
fed with non LOS (NLOS) measurements. Our proposed algorithm, referred to as
Sparse Recovery of NLOS using IMAT (SRNI), considers NLOS as unknown variables
and solves the resultant underdetermined system emphasizing on its sparsity
feature based on IMAT methods. Simulations are conducted to investigate the
performance of SRNI in comparison of other conventional algorithms. Results
demonstrate that SRNI is fast enough to deal with large combination of BSs and
also accurate in lower number of BSs
|
eess.SP
|
wellknown methods are employed to localize mobile station ms using line of sight los measurements these methods may result in large error if they are fed with non los nlos measurements our proposed algorithm referred to as sparse recovery of nlos using imat srni considers nlos as unknown variables and solves the resultant underdetermined system emphasizing on its sparsity feature based on imat methods simulations are conducted to investigate the performance of srni in comparison of other conventional algorithms results demonstrate that srni is fast enough to deal with large combination of bss and also accurate in lower number of bss
|
[['wellknown', 'methods', 'are', 'employed', 'to', 'localize', 'mobile', 'station', 'ms', 'using', 'line', 'of', 'sight', 'los', 'measurements', 'these', 'methods', 'may', 'result', 'in', 'large', 'error', 'if', 'they', 'are', 'fed', 'with', 'non', 'los', 'nlos', 'measurements', 'our', 'proposed', 'algorithm', 'referred', 'to', 'as', 'sparse', 'recovery', 'of', 'nlos', 'using', 'imat', 'srni', 'considers', 'nlos', 'as', 'unknown', 'variables', 'and', 'solves', 'the', 'resultant', 'underdetermined', 'system', 'emphasizing', 'on', 'its', 'sparsity', 'feature', 'based', 'on', 'imat', 'methods', 'simulations', 'are', 'conducted', 'to', 'investigate', 'the', 'performance', 'of', 'srni', 'in', 'comparison', 'of', 'other', 'conventional', 'algorithms', 'results', 'demonstrate', 'that', 'srni', 'is', 'fast', 'enough', 'to', 'deal', 'with', 'large', 'combination', 'of', 'bss', 'and', 'also', 'accurate', 'in', 'lower', 'number', 'of', 'bss']]
|
[-0.14392058819009101, -0.014038173036908012, -0.02390819406690131, 0.037825606529379614, -0.08085689744174407, -0.19621355167248905, 0.03891066055154741, 0.43543695994090326, -0.20701106130560437, -0.31875740839076216, 0.10831257109968269, -0.24907270409535653, -0.1479044727022105, 0.21541755899123036, -0.14147131014523087, 0.06619921432621316, 0.11032463356594344, 0.005549388001719028, -0.07088223641789011, -0.26400496074146046, 0.2559556167902388, 0.08585681658673866, 0.3128739744079032, -0.026474981983699422, 0.11287460962568621, 0.009091771079231939, -0.1082061557652484, 0.04207661661254888, -0.03573932314078648, 0.07390124932632293, 0.32672638962008427, 0.17665986015027998, 0.25266514858692, -0.41825841718565415, -0.21630149212951708, 0.07152432769924255, 0.16872662404957828, 0.06849323699970057, -0.018707653058065783, -0.33400049095622975, 0.13437959516540834, -0.12112104641227513, -0.06154268692100033, -0.05258142440994777, -0.10890268705932811, 0.10373390678980268, -0.3069479628327754, 0.09183390190079117, -0.014876433698884627, 0.044281100619141714, -0.03502313684473866, -0.18393341841355962, 0.03943987727617052, 0.1216827215048217, 0.054507453633140364, 0.009027395531129424, 0.10703605134962219, -0.061502954586049416, -0.09092154130708463, 0.3736172774161148, -0.05227046876472633, -0.213030112408203, 0.22909101983762836, -0.10051108513368608, -0.15146187276551776, 0.16866745063942848, 0.2777903236167524, 0.09367243064991614, -0.09757958967607505, -3.3633381192858266e-05, -0.028663793030093507, 0.13778905708822284, 0.026904085678703123, 0.02189252980625128, 0.13121939482084374, 0.15000835672887688, 0.1018630376749552, 0.059179078149586214, -0.19541690566364933, -0.07073273337768889, -0.18617772745512573, -0.07282315461194987, -0.2068457678698077, -0.039507645426668445, -0.09032878274124549, -0.11266027920243174, 0.29067882534005857, 0.20219125388775686, 0.1692339033810514, 0.06535403308744478, 0.39805419778100926, 0.06920094893770384, 0.03034553319349191, 0.1251643347636898, 0.22558689188433462, 0.17400613932473824, 0.08823447804068132, -0.21154080151054677, 0.079655726223557, 0.03378824460882657]
|
1,803.06839
|
Using a Model-driven Approach in Building a Provenance Framework for
Tracking Policy-making Processes in Smart Cities
|
The significance of provenance in various settings has emphasised its
potential in the policy-making process for analytics in Smart Cities. At
present, there exists no framework that can capture the provenance in a
policy-making setting. This research therefore aims at defining a novel
framework, namely, the Policy Cycle Provenance (PCP) Framework, to capture the
provenance of the policy-making process. However, it is not straightforward to
design the provenance framework due to a number of associated policy design
challenges. The design challenges revealed the need for an adaptive system for
tracking policies therefore a model-driven approach has been considered in
designing the PCP framework. Also, suitability of a networking approach is
proposed for designing workflows for tracking the policy-making process.
|
cs.SE
|
the significance of provenance in various settings has emphasised its potential in the policymaking process for analytics in smart cities at present there exists no framework that can capture the provenance in a policymaking setting this research therefore aims at defining a novel framework namely the policy cycle provenance pcp framework to capture the provenance of the policymaking process however it is not straightforward to design the provenance framework due to a number of associated policy design challenges the design challenges revealed the need for an adaptive system for tracking policies therefore a modeldriven approach has been considered in designing the pcp framework also suitability of a networking approach is proposed for designing workflows for tracking the policymaking process
|
[['the', 'significance', 'of', 'provenance', 'in', 'various', 'settings', 'has', 'emphasised', 'its', 'potential', 'in', 'the', 'policymaking', 'process', 'for', 'analytics', 'in', 'smart', 'cities', 'at', 'present', 'there', 'exists', 'no', 'framework', 'that', 'can', 'capture', 'the', 'provenance', 'in', 'a', 'policymaking', 'setting', 'this', 'research', 'therefore', 'aims', 'at', 'defining', 'a', 'novel', 'framework', 'namely', 'the', 'policy', 'cycle', 'provenance', 'pcp', 'framework', 'to', 'capture', 'the', 'provenance', 'of', 'the', 'policymaking', 'process', 'however', 'it', 'is', 'not', 'straightforward', 'to', 'design', 'the', 'provenance', 'framework', 'due', 'to', 'a', 'number', 'of', 'associated', 'policy', 'design', 'challenges', 'the', 'design', 'challenges', 'revealed', 'the', 'need', 'for', 'an', 'adaptive', 'system', 'for', 'tracking', 'policies', 'therefore', 'a', 'modeldriven', 'approach', 'has', 'been', 'considered', 'in', 'designing', 'the', 'pcp', 'framework', 'also', 'suitability', 'of', 'a', 'networking', 'approach', 'is', 'proposed', 'for', 'designing', 'workflows', 'for', 'tracking', 'the', 'policymaking', 'process']]
|
[-0.10093226681361679, -0.02142227286394165, -0.09714465018580942, 0.06506165918112894, -0.10897615645472117, -0.15309343256150224, 0.046285646425622724, 0.4062149222595852, -0.27291696064737664, -0.31978205486568584, 0.10172898793385654, -0.21081925391712608, -0.19325162842869759, 0.206715073546066, -0.13595566911888973, 0.12272727454987065, 0.06720469154793174, 0.00024130987981725642, 0.03148016947352899, -0.20052909572851382, 0.2910470083148508, 0.09495952437600481, 0.35867154920872835, 0.098633322257259, 0.08375460280402869, 0.0027647755057903147, -0.040046556535795204, 0.006610089343651628, -0.08485045406348395, 0.1688951643950799, 0.38992933016426923, 0.29371137443749906, 0.40351513006231365, -0.38998570769023494, -0.2219427664521612, 0.08351899539863988, 0.14558556215923688, 0.05833091798919339, -0.11191768992786147, -0.2735639845858477, 0.11276074814289308, -0.2343447930923029, -0.1290524169066999, -0.1293696283339327, 0.017076739147716367, -0.07683559859801523, -0.2868538036543344, -0.06657615881007235, 0.06610737747254491, 0.06861271719377832, -0.030552517592382592, -0.07434012589706186, 0.05787127687959705, 0.1814397927217123, 0.028056162882238205, 0.009332022254018723, 0.141072657569742, -0.12021119434566495, -0.19425684751692315, 0.40542750173256176, 0.0520559889988332, -0.18678538527871882, 0.1565173462810026, -0.028598820986304462, -0.2226606860302952, 0.10575643464719423, 0.2226198319846592, 0.08440332942908364, -0.25886316120061054, 0.0959553824964629, 0.01534612469782098, 0.13733271960200383, -0.00017567869361896976, -0.012418529598879777, 0.23166425479967304, 0.2946657210024966, 0.12379981807487853, 0.0880545688785237, -0.031092927603837604, -0.12448697561445106, -0.25296779984936996, -0.17467317295832044, -0.12166032435552475, -0.05925583918840613, -0.07812987559889796, -0.14825247078664414, 0.35879830785972233, 0.25239619786240663, 0.12149791664858701, 0.009412404110639537, 0.35504752243653787, 0.045970831242460417, 0.09371850727724709, 0.10301117930060424, 0.1555075091427239, 0.024802760706290977, 0.23084199337773964, -0.1822679949701302, 0.1839105181646447, 0.0162994502847936]
|
1,803.0684
|
On n-Hom-Leibniz algebras and cohomology
|
The purpose of this paper is to provide a cohomology of $n$-Hom-Leibniz
algebras. Moreover, we study some higher operations on cohomology spaces and
deformations.
|
math.RA math-ph math.MP math.QA
|
the purpose of this paper is to provide a cohomology of nhomleibniz algebras moreover we study some higher operations on cohomology spaces and deformations
|
[['the', 'purpose', 'of', 'this', 'paper', 'is', 'to', 'provide', 'a', 'cohomology', 'of', 'nhomleibniz', 'algebras', 'moreover', 'we', 'study', 'some', 'higher', 'operations', 'on', 'cohomology', 'spaces', 'and', 'deformations']]
|
[-0.21531258798811748, 0.02139870883168086, -0.11378578161415846, 0.11237571307498476, -0.08493845901735451, -0.054896227995176676, -0.030035714573307854, 0.36022870955259906, -0.3075724367214286, -0.21380365299789802, 0.20363636385730427, -0.19179647128381158, -0.23570240143200624, 0.17441706901983076, -0.24508353594042684, -0.05747881288761678, 0.05756714049240817, 0.08561606390487767, -0.16339445587895488, -0.3218283722906009, 0.5050120120463164, 0.03539769062974855, 0.21491789137539657, 0.07671689914296502, 0.06741407801113698, -0.021272888467849596, -0.024622261564692726, -0.028552965787441834, -0.21687977732685598, 0.2347925065247261, 0.3244402956055558, 0.025293634536311678, 0.2290692439545756, -0.4010660794928022, -0.054811935669378094, 0.18783335241934526, 0.1041334354845078, 0.09766594859083062, -0.015383348501611339, -0.23351797137571417, 0.11620281867520965, -0.22632078551079915, -0.09623286415539357, -0.17320341552081314, 0.039579416260771126, 0.011660532529830285, -0.210723963363663, -0.05526522664434236, 0.08436821757451347, 0.1779411556199193, -0.16093808760785538, -0.013609569195819937, -0.0255208483532719, 0.08379223954904338, -0.038083192254619105, 0.004658407136878889, 0.12984960370332652, -0.08555040499397917, -0.17855057994956555, 0.40185395190897194, 0.01055522813745167, -0.23486164082651553, 0.14145079109331835, -0.21772764399445252, -0.2776831313967705, 0.03560198357571726, 0.1252594789409119, 0.2052929785264575, -0.048800409528548305, 0.1340049974918973, -0.03520958975929281, 0.038352448290780834, 0.06433964893221855, 0.050162499689537544, 0.08333997713887821, 0.16418039381666027, 0.10270692505266356, 0.18568677297266928, 0.013750205150521968, -0.0045950462631678774, -0.3785876432514709, -0.27597477809404547, -0.07659600820878278, 0.09711858112891407, -0.0418222049123395, -0.1456499494936155, 0.46083038948152377, 0.1742743086879668, 0.18867350726023965, 0.1839200535627163, 0.2613239191148592, 0.0284227951956184, 0.07305143546798955, -0.016115973926270784, 0.12478715592980101, 0.25780775171259174, 0.05113385870809788, -0.0855632108717185, -0.06261115901820037, 0.2073070863261819]
|
1,803.06841
|
Music Style Transfer: A Position Paper
|
Led by the success of neural style transfer on visual arts, there has been a
rising trend very recently in the effort of music style transfer. However,
"music style" is not yet a well-defined concept from a scientific point of
view. The difficulty lies in the intrinsic multi-level and multi-modal
character of music representation (which is very different from image
representation). As a result, depending on their interpretation of "music
style", current studies under the category of "music style transfer", are
actually solving completely different problems that belong to a variety of
sub-fields of Computer Music. Also, a vanilla end-to-end approach, which aims
at dealing with all levels of music representation at once by directly adopting
the method of image style transfer, leads to poor results. Thus, we vitally
propose a more scientifically-viable definition of music style transfer by
breaking it down into precise concepts of timbre style transfer, performance
style transfer and composition style transfer, as well as to connect different
aspects of music style transfer with existing well-established sub-fields of
computer music studies. In addition, we discuss the current limitations of
music style modeling and its future directions by drawing spirit from some deep
generative models, especially the ones using unsupervised learning and
disentanglement techniques.
|
cs.SD eess.AS
|
led by the success of neural style transfer on visual arts there has been a rising trend very recently in the effort of music style transfer however music style is not yet a welldefined concept from a scientific point of view the difficulty lies in the intrinsic multilevel and multimodal character of music representation which is very different from image representation as a result depending on their interpretation of music style current studies under the category of music style transfer are actually solving completely different problems that belong to a variety of subfields of computer music also a vanilla endtoend approach which aims at dealing with all levels of music representation at once by directly adopting the method of image style transfer leads to poor results thus we vitally propose a more scientificallyviable definition of music style transfer by breaking it down into precise concepts of timbre style transfer performance style transfer and composition style transfer as well as to connect different aspects of music style transfer with existing wellestablished subfields of computer music studies in addition we discuss the current limitations of music style modeling and its future directions by drawing spirit from some deep generative models especially the ones using unsupervised learning and disentanglement techniques
|
[['led', 'by', 'the', 'success', 'of', 'neural', 'style', 'transfer', 'on', 'visual', 'arts', 'there', 'has', 'been', 'a', 'rising', 'trend', 'very', 'recently', 'in', 'the', 'effort', 'of', 'music', 'style', 'transfer', 'however', 'music', 'style', 'is', 'not', 'yet', 'a', 'welldefined', 'concept', 'from', 'a', 'scientific', 'point', 'of', 'view', 'the', 'difficulty', 'lies', 'in', 'the', 'intrinsic', 'multilevel', 'and', 'multimodal', 'character', 'of', 'music', 'representation', 'which', 'is', 'very', 'different', 'from', 'image', 'representation', 'as', 'a', 'result', 'depending', 'on', 'their', 'interpretation', 'of', 'music', 'style', 'current', 'studies', 'under', 'the', 'category', 'of', 'music', 'style', 'transfer', 'are', 'actually', 'solving', 'completely', 'different', 'problems', 'that', 'belong', 'to', 'a', 'variety', 'of', 'subfields', 'of', 'computer', 'music', 'also', 'a', 'vanilla', 'endtoend', 'approach', 'which', 'aims', 'at', 'dealing', 'with', 'all', 'levels', 'of', 'music', 'representation', 'at', 'once', 'by', 'directly', 'adopting', 'the', 'method', 'of', 'image', 'style', 'transfer', 'leads', 'to', 'poor', 'results', 'thus', 'we', 'vitally', 'propose', 'a', 'more', 'scientificallyviable', 'definition', 'of', 'music', 'style', 'transfer', 'by', 'breaking', 'it', 'down', 'into', 'precise', 'concepts', 'of', 'timbre', 'style', 'transfer', 'performance', 'style', 'transfer', 'and', 'composition', 'style', 'transfer', 'as', 'well', 'as', 'to', 'connect', 'different', 'aspects', 'of', 'music', 'style', 'transfer', 'with', 'existing', 'wellestablished', 'subfields', 'of', 'computer', 'music', 'studies', 'in', 'addition', 'we', 'discuss', 'the', 'current', 'limitations', 'of', 'music', 'style', 'modeling', 'and', 'its', 'future', 'directions', 'by', 'drawing', 'spirit', 'from', 'some', 'deep', 'generative', 'models', 'especially', 'the', 'ones', 'using', 'unsupervised', 'learning', 'and', 'disentanglement', 'techniques']]
|
[0.005103839538173153, 0.013359298210735749, -0.12762644000744755, 0.09212543583334903, -0.1412771539977363, -0.13681098789844698, 0.011739400729708808, 0.4436297040676825, -0.30008038408484633, -0.3493198284910974, 0.08004222282274057, -0.24054799675579788, -0.20034135379195575, 0.23189710257168028, -0.13662710981172266, 0.02813185234435436, 0.12140497847152784, 0.020797983643788737, -0.08543411151899333, -0.21263438656709147, 0.3629595184477173, 0.025106104736604042, 0.37293811741587934, 0.015039839955596072, 0.12182618487960867, -0.009724517687431817, -0.0673749311601074, -0.04867195224308056, -0.055556698573604325, 0.20540988828887422, 0.34750600262142467, 0.22574163092982966, 0.33695123935608845, -0.3935274544162947, -0.2087172707514521, 0.03637110634517033, 0.131700223008876, 0.12062027747516782, -0.08648477291759811, -0.27849724089209155, 0.06290605891969515, -0.1955023851636707, 0.015202251418795464, -0.09644098018660002, 0.007060313418742667, 0.0026927784761160757, -0.19994750348353776, 0.010353548360566915, 0.13952626863966958, 0.12897155447752842, -0.015837026432775937, -0.1557988034362353, 0.029788738287289094, 0.21858530233894446, 0.0825510913776279, 0.07095243203797315, 0.13241304473011095, -0.24730641946300538, -0.14377337497505313, 0.38895210139091735, -0.07878695733142221, -0.19273345955213514, 0.2223618408411886, -0.03526045966868569, -0.09701532842500986, 0.08746359501321103, 0.14651584368678333, 0.10105070399427876, -0.13917766982074647, 0.032876815811902715, -0.043991212425663055, 0.1857501943693191, 0.09848147309023561, 0.0009311999180761066, 0.26963663791352654, 0.20724780333581047, -0.018419589241514506, 0.122770655238481, -0.03593900495941199, -0.1060815089703221, -0.17377003917958841, -0.12152409481276867, -0.1764044300568272, 0.01886713105030369, -0.05440208213646824, -0.13348397358888037, 0.424079296929599, 0.18604114153919724, 0.18554647127844537, 0.06736968344306908, 0.32786924540047147, 0.042376772619815525, 0.09737017906827002, 0.02534166426913252, 0.14836740640381427, 0.056217235023635036, 0.21656808645964049, -0.14840058582208743, 0.10071617953402433, 0.06767034343696986]
|
1,803.06842
|
Production Line Technique for Autonomous Vehicle Scheduling
|
This paper considers the problem of scheduling autonomous vehicles in
intersections. A new system is proposed that could be an additional choice to
the recently introduced Autonomous Intersection Management (AIM) model. The
proposed system is based on the production line technique, where the
environment of the intersection, vehicles position, speeds and turning are
specified and determined in advance. The goal of the proposed system is to
eliminate vehicle collision and the waiting time inside the intersection. Three
different patterns of the vehicles flow toward the intersection have been
considered for the evaluation of the model. The system requires less waiting
time (compared to the other models) in the random case where the flow is
unpredictable. The KNN algorithm is used to predict the right turn vehicle. The
experimental results show that there is no single chance of collision inside
the intersection, however, the system requires more free space in the traffic
lane.
|
cs.SY
|
this paper considers the problem of scheduling autonomous vehicles in intersections a new system is proposed that could be an additional choice to the recently introduced autonomous intersection management aim model the proposed system is based on the production line technique where the environment of the intersection vehicles position speeds and turning are specified and determined in advance the goal of the proposed system is to eliminate vehicle collision and the waiting time inside the intersection three different patterns of the vehicles flow toward the intersection have been considered for the evaluation of the model the system requires less waiting time compared to the other models in the random case where the flow is unpredictable the knn algorithm is used to predict the right turn vehicle the experimental results show that there is no single chance of collision inside the intersection however the system requires more free space in the traffic lane
|
[['this', 'paper', 'considers', 'the', 'problem', 'of', 'scheduling', 'autonomous', 'vehicles', 'in', 'intersections', 'a', 'new', 'system', 'is', 'proposed', 'that', 'could', 'be', 'an', 'additional', 'choice', 'to', 'the', 'recently', 'introduced', 'autonomous', 'intersection', 'management', 'aim', 'model', 'the', 'proposed', 'system', 'is', 'based', 'on', 'the', 'production', 'line', 'technique', 'where', 'the', 'environment', 'of', 'the', 'intersection', 'vehicles', 'position', 'speeds', 'and', 'turning', 'are', 'specified', 'and', 'determined', 'in', 'advance', 'the', 'goal', 'of', 'the', 'proposed', 'system', 'is', 'to', 'eliminate', 'vehicle', 'collision', 'and', 'the', 'waiting', 'time', 'inside', 'the', 'intersection', 'three', 'different', 'patterns', 'of', 'the', 'vehicles', 'flow', 'toward', 'the', 'intersection', 'have', 'been', 'considered', 'for', 'the', 'evaluation', 'of', 'the', 'model', 'the', 'system', 'requires', 'less', 'waiting', 'time', 'compared', 'to', 'the', 'other', 'models', 'in', 'the', 'random', 'case', 'where', 'the', 'flow', 'is', 'unpredictable', 'the', 'knn', 'algorithm', 'is', 'used', 'to', 'predict', 'the', 'right', 'turn', 'vehicle', 'the', 'experimental', 'results', 'show', 'that', 'there', 'is', 'no', 'single', 'chance', 'of', 'collision', 'inside', 'the', 'intersection', 'however', 'the', 'system', 'requires', 'more', 'free', 'space', 'in', 'the', 'traffic', 'lane']]
|
[-0.18929469104209842, 0.06136088398689983, -0.08932250504394208, 0.014689630868624112, -0.04354199383554882, -0.13789868315277426, 0.04368433992356969, 0.3676532075103176, -0.2439796428539251, -0.29788204542924895, 0.10123602747549548, -0.26974106651246793, -0.10539435553456362, 0.187014551533043, -0.12510063882157402, 0.10029665992815832, 0.06767682990558617, 0.0897321068531662, 0.017071389008043825, -0.24818289217900633, 0.3065674898404579, 0.03254036046717757, 0.3047695461887327, 0.05832501078686236, 0.10476559308651638, 0.016778867558490385, -0.014398685783242783, 0.012497051291000772, -0.05193308858542878, 0.11516838167613298, 0.23343185292002855, 0.15634048421174826, 0.260745569009726, -0.4519131605170275, -0.21124126638996563, 0.14274296109368534, 0.14735101666041087, 0.05915085808373988, 0.0023717323229472016, -0.2954161195926932, 0.09964512063398663, -0.18609387078935183, -0.1248101440601443, -0.0011771617206058611, 0.03419036394916475, 0.034503600684968806, -0.25471279180706724, -0.026915960145599552, 0.025693428727160943, 0.04725716198874196, -0.07070730973837751, -0.06026801428953676, -0.021429275603670823, 0.1751011344542923, 0.057646150297889685, 0.03182375397974331, 0.13713436768586307, -0.12114311613013821, -0.12845541014470846, 0.4485104537054308, 0.009249971556097367, -0.19470862291602412, 0.18814270961937787, -0.09145783267127913, -0.09548743283314827, 0.1437766503812255, 0.20514901954141496, 0.1305246711892419, -0.16819364055501004, 0.01673141815148196, -0.038176984982304644, 0.1319315441635952, 0.03632559585170575, -0.04751210889279671, 0.17124744988732823, 0.22432338487430425, 0.1531649096577894, 0.10590076088211438, -0.11199184209812972, -0.15290484008820435, -0.2845493984243244, -0.1499663654141937, -0.1713137840974684, -0.030888545325261044, -0.06304524797537613, -0.0972684234025349, 0.37828027339051723, 0.19027072438161427, 0.1949910645091318, 0.03660720359154144, 0.3470609087058907, 0.13154752551283883, 0.04653542867163196, 0.11867009089818518, 0.20646756776381822, 0.023048074741382152, 0.14009741895623798, -0.23533957113824344, 0.13359808938969908, 0.06937019625911489]
|
1,803.06843
|
Linear-time geometric algorithm for evaluating B\'ezier curves
|
A new algorithm for computing a point on a polynomial or rational curve in
B\'{e}zier form is proposed. The method has a geometric interpretation and uses
only convex combinations of control points. The new algorithm's computational
complexity is linear with respect to the number of control points and its
memory complexity is $O(1)$. Some remarks on similar methods for surfaces in
rectangular and triangular B\'{e}zier form are also given.
|
cs.NA cs.GR
|
a new algorithm for computing a point on a polynomial or rational curve in bezier form is proposed the method has a geometric interpretation and uses only convex combinations of control points the new algorithms computational complexity is linear with respect to the number of control points and its memory complexity is o1 some remarks on similar methods for surfaces in rectangular and triangular bezier form are also given
|
[['a', 'new', 'algorithm', 'for', 'computing', 'a', 'point', 'on', 'a', 'polynomial', 'or', 'rational', 'curve', 'in', 'bezier', 'form', 'is', 'proposed', 'the', 'method', 'has', 'a', 'geometric', 'interpretation', 'and', 'uses', 'only', 'convex', 'combinations', 'of', 'control', 'points', 'the', 'new', 'algorithms', 'computational', 'complexity', 'is', 'linear', 'with', 'respect', 'to', 'the', 'number', 'of', 'control', 'points', 'and', 'its', 'memory', 'complexity', 'is', 'o1', 'some', 'remarks', 'on', 'similar', 'methods', 'for', 'surfaces', 'in', 'rectangular', 'and', 'triangular', 'bezier', 'form', 'are', 'also', 'given']]
|
[-0.14096884301229232, -0.008133626515990582, -0.10816239465729914, 0.022844427519990808, -0.11478465512070966, -0.19667262542803865, 0.07491190525689635, 0.3788373548051585, -0.28667477502460603, -0.2661013372041676, 0.13291727165367617, -0.27457002794666996, -0.18075771070004482, 0.2726811980659925, -0.15327511178464562, 0.1415813465904701, 0.017535133256941386, 0.06073265672539887, -0.12479871920431437, -0.312100424417767, 0.2780379570507701, -0.014204600205024084, 0.22372691337680578, 0.020314589083748127, 0.11116728607727133, -0.02270447418930522, -0.0012453027150553205, 0.041883125145366226, -0.10026280164880597, 0.16961056594669388, 0.21300138875950073, 0.13628694222079238, 0.2587449845682452, -0.4075127268021089, -0.13587402532120113, 0.1270377808959102, 0.11172742864278995, 0.08923056655549917, -0.06866656933182283, -0.18717965464769065, 0.07761953149557761, -0.05934929253830426, -0.1194655596535059, -0.11675201716792324, 0.015462518642670002, 0.0622163127189961, -0.2745036269821551, -0.035976535226032814, 0.051482088134988495, 0.09862770515399566, -0.02326239453986341, -0.15134339979377345, 0.021014324456885242, 0.030346466582673398, -0.03589220816924142, 0.06886799451287674, 0.07324120065575276, -0.10619776975363493, -0.1501319571060763, 0.38868571159200394, 0.01296260240285293, -0.28193407494952716, 0.1604044960433806, -0.06178606780704813, -0.13780186972175928, 0.2005534613289047, 0.21822082647459878, 0.11277371141519668, -0.08954374099393254, 0.1683873214355697, -0.07046376291554475, 0.15620895299556045, 0.08917903204354038, 0.0031377422164423742, 0.1454289006744174, 0.16762556178846222, 0.13487639396275947, 0.1424672917827316, -0.04915175462087643, -0.11774266802746317, -0.3169956285020579, -0.19853547335588845, -0.2169586605378899, -0.052719703720261656, -0.1685829269031208, -0.2087475473628096, 0.4115385529720157, 0.03658531186427327, 0.21641028437601484, 0.10501670503678422, 0.31113301131172455, 0.11114277200692374, 0.05356592085023505, 0.12323877035194765, 0.1360332113880482, 0.10790343571832214, 0.03508132058398231, -0.18816745781974084, 0.0903829107519941, 0.15719011038595784]
|
1,803.06844
|
Revealing memory effects in phase-covariant quantum master equations
|
We study and compare the sensitivity of multiple non-Markovianity indicators
for a qubit subjected to general phase-covariant noise. For each of the
indicators, we derive analytical conditions to detect the dynamics as
non-Markovian. We present these conditions as relations between the
time-dependent decay rates for the general open system dynamics and its
commutative and unital subclasses. These relations tell directly if the
dynamics is non-Markovian w.r.t.~each indicator, without the need to explicitly
derive and specify the analytic form of the time-dependent coefficients.
Moreover, with a shift in perspective, we show that if one assumes only the
general form of the master equation, measuring the non-Markovianity indicators
gives us directly non-trivial information on the relations between the unknown
decay rates.
|
quant-ph
|
we study and compare the sensitivity of multiple nonmarkovianity indicators for a qubit subjected to general phasecovariant noise for each of the indicators we derive analytical conditions to detect the dynamics as nonmarkovian we present these conditions as relations between the timedependent decay rates for the general open system dynamics and its commutative and unital subclasses these relations tell directly if the dynamics is nonmarkovian wrteach indicator without the need to explicitly derive and specify the analytic form of the timedependent coefficients moreover with a shift in perspective we show that if one assumes only the general form of the master equation measuring the nonmarkovianity indicators gives us directly nontrivial information on the relations between the unknown decay rates
|
[['we', 'study', 'and', 'compare', 'the', 'sensitivity', 'of', 'multiple', 'nonmarkovianity', 'indicators', 'for', 'a', 'qubit', 'subjected', 'to', 'general', 'phasecovariant', 'noise', 'for', 'each', 'of', 'the', 'indicators', 'we', 'derive', 'analytical', 'conditions', 'to', 'detect', 'the', 'dynamics', 'as', 'nonmarkovian', 'we', 'present', 'these', 'conditions', 'as', 'relations', 'between', 'the', 'timedependent', 'decay', 'rates', 'for', 'the', 'general', 'open', 'system', 'dynamics', 'and', 'its', 'commutative', 'and', 'unital', 'subclasses', 'these', 'relations', 'tell', 'directly', 'if', 'the', 'dynamics', 'is', 'nonmarkovian', 'wrteach', 'indicator', 'without', 'the', 'need', 'to', 'explicitly', 'derive', 'and', 'specify', 'the', 'analytic', 'form', 'of', 'the', 'timedependent', 'coefficients', 'moreover', 'with', 'a', 'shift', 'in', 'perspective', 'we', 'show', 'that', 'if', 'one', 'assumes', 'only', 'the', 'general', 'form', 'of', 'the', 'master', 'equation', 'measuring', 'the', 'nonmarkovianity', 'indicators', 'gives', 'us', 'directly', 'nontrivial', 'information', 'on', 'the', 'relations', 'between', 'the', 'unknown', 'decay', 'rates']]
|
[-0.11360479340818513, 0.08177026916863554, -0.10312082462202189, 0.12612038831842148, -0.060394837138227235, -0.19327529534397614, 0.06717906224391407, 0.34546760565964346, -0.2944741462617797, -0.25802096539034935, 0.08039513279356346, -0.24546305562953574, -0.1520586159332829, 0.2240888124166088, -0.01594634027362375, 0.015842626123369466, 0.05873170921626359, 0.06824234740658647, -0.10046062025565149, -0.2006774642129855, 0.36550448954863063, 0.0032149069011211395, 0.25729551387485117, 0.04826418469438992, 0.10520967448690623, -0.020145181401719545, -0.043327496929678244, -0.024915259236753997, -0.2005810880172387, 0.08190604164245364, 0.2109056095892595, 0.1497466953873824, 0.24890526173383756, -0.4212439724922938, -0.17780087949802814, 0.12693726689696816, 0.08763511592553834, 0.12181291622662191, 0.00011906078602266261, -0.3099961469652352, 0.015461319576064914, -0.1610503597342867, -0.12442140079940021, -0.11664920549255685, 0.05248175285188323, 0.022005105016247955, -0.2981239117433364, 0.10629300007565042, 0.03757220303829191, 0.022926022898468932, -0.0767279011838659, -0.01338905107103667, 0.012442680565103635, 0.2224170336484025, -0.011205582376332733, -0.043896670452263836, 0.1327119383771541, -0.11113261985513619, -0.08589187621235674, 0.3344824636765456, -0.1090133364778012, -0.2694947713259923, 0.1908283686133149, -0.17751279912525947, -0.12885000351500714, 0.06283763414090973, 0.1504859938207319, 0.08344003506067951, -0.21720383699857077, 0.052731123620691565, -0.023593713918116765, 0.15623516717558664, 0.03255466647225164, 0.10302560881393867, 0.16618498968812873, 0.06924242754091935, 0.028810043890281755, 0.17778259328708557, -0.04432624589328228, -0.12206072402502394, -0.32599967815646885, -0.1474628357524526, -0.1086940006589738, 0.10612068750690352, -0.09700625371217522, -0.13840616312493587, 0.4001137739781417, 0.17097450134944234, 0.1690152845744012, 0.07261165764115719, 0.25659128894508515, 0.17742401429144192, 0.023746283231618797, 0.06582111593383222, 0.21914150302251012, 0.17638862541860947, 0.04898581741638166, -0.29122852030510116, 0.11339619805468089, 0.05029311075696122]
|
1,803.06845
|
Cloud Provider Capacity Augmentation Through Automated Resource
Bartering
|
Growing interest in Cloud Computing places a heavy workload on cloud
providers which is becoming increasingly difficult for them to manage with
their primary datacenter infrastructures. Resource limitations can make
providers vulnerable to significant reputational damage and it often forces
customers to select services from the larger, more established companies,
sometimes at a higher price. Funding limitations, however, commonly prevent
emerging and even established providers from making continual investment in
hardware speculatively assuming a certain level of growth in demand. As an
alternative, they may strive to use the current inter-cloud resource sharing
platforms which mainly rely on monetary payments and thus putting pressure on
already stretched cash flows. To address such issues, we have designed and
implemented a new multi-agent based Cloud Resource Bartering System (CRBS) that
fosters the management and bartering of pooled resources without requiring
costly financial transactions between providers. Agents in CRBS not only
strengthen the trading relationship among providers but also enable them to
handle surges in demand with their primary setup. Unlike existing systems, CRBS
assigns resources by considering resource urgency which comparatively improves
customers satisfaction and the resource utilization rate by more than 50%.The
evaluation results provide evidence that our system assists providers to timely
acquire the additional resources and to maintain sustainable service delivery.
We conclude that the existence of such a system is economically beneficial for
cloud providers and enables them to adapt to fluctuating workloads.
|
cs.SE cs.DC cs.MA
|
growing interest in cloud computing places a heavy workload on cloud providers which is becoming increasingly difficult for them to manage with their primary datacenter infrastructures resource limitations can make providers vulnerable to significant reputational damage and it often forces customers to select services from the larger more established companies sometimes at a higher price funding limitations however commonly prevent emerging and even established providers from making continual investment in hardware speculatively assuming a certain level of growth in demand as an alternative they may strive to use the current intercloud resource sharing platforms which mainly rely on monetary payments and thus putting pressure on already stretched cash flows to address such issues we have designed and implemented a new multiagent based cloud resource bartering system crbs that fosters the management and bartering of pooled resources without requiring costly financial transactions between providers agents in crbs not only strengthen the trading relationship among providers but also enable them to handle surges in demand with their primary setup unlike existing systems crbs assigns resources by considering resource urgency which comparatively improves customers satisfaction and the resource utilization rate by more than 50the evaluation results provide evidence that our system assists providers to timely acquire the additional resources and to maintain sustainable service delivery we conclude that the existence of such a system is economically beneficial for cloud providers and enables them to adapt to fluctuating workloads
|
[['growing', 'interest', 'in', 'cloud', 'computing', 'places', 'a', 'heavy', 'workload', 'on', 'cloud', 'providers', 'which', 'is', 'becoming', 'increasingly', 'difficult', 'for', 'them', 'to', 'manage', 'with', 'their', 'primary', 'datacenter', 'infrastructures', 'resource', 'limitations', 'can', 'make', 'providers', 'vulnerable', 'to', 'significant', 'reputational', 'damage', 'and', 'it', 'often', 'forces', 'customers', 'to', 'select', 'services', 'from', 'the', 'larger', 'more', 'established', 'companies', 'sometimes', 'at', 'a', 'higher', 'price', 'funding', 'limitations', 'however', 'commonly', 'prevent', 'emerging', 'and', 'even', 'established', 'providers', 'from', 'making', 'continual', 'investment', 'in', 'hardware', 'speculatively', 'assuming', 'a', 'certain', 'level', 'of', 'growth', 'in', 'demand', 'as', 'an', 'alternative', 'they', 'may', 'strive', 'to', 'use', 'the', 'current', 'intercloud', 'resource', 'sharing', 'platforms', 'which', 'mainly', 'rely', 'on', 'monetary', 'payments', 'and', 'thus', 'putting', 'pressure', 'on', 'already', 'stretched', 'cash', 'flows', 'to', 'address', 'such', 'issues', 'we', 'have', 'designed', 'and', 'implemented', 'a', 'new', 'multiagent', 'based', 'cloud', 'resource', 'bartering', 'system', 'crbs', 'that', 'fosters', 'the', 'management', 'and', 'bartering', 'of', 'pooled', 'resources', 'without', 'requiring', 'costly', 'financial', 'transactions', 'between', 'providers', 'agents', 'in', 'crbs', 'not', 'only', 'strengthen', 'the', 'trading', 'relationship', 'among', 'providers', 'but', 'also', 'enable', 'them', 'to', 'handle', 'surges', 'in', 'demand', 'with', 'their', 'primary', 'setup', 'unlike', 'existing', 'systems', 'crbs', 'assigns', 'resources', 'by', 'considering', 'resource', 'urgency', 'which', 'comparatively', 'improves', 'customers', 'satisfaction', 'and', 'the', 'resource', 'utilization', 'rate', 'by', 'more', 'than', '50the', 'evaluation', 'results', 'provide', 'evidence', 'that', 'our', 'system', 'assists', 'providers', 'to', 'timely', 'acquire', 'the', 'additional', 'resources', 'and', 'to', 'maintain', 'sustainable', 'service', 'delivery', 'we', 'conclude', 'that', 'the', 'existence', 'of', 'such', 'a', 'system', 'is', 'economically', 'beneficial', 'for', 'cloud', 'providers', 'and', 'enables', 'them', 'to', 'adapt', 'to', 'fluctuating', 'workloads']]
|
[-0.15950408666735869, 0.050189149881683486, -0.059675775259102955, 0.1001098441303274, -0.13683924283972812, -0.2120532227804531, 0.17480705034365107, 0.4142860580778406, -0.26189486550243474, -0.33939533510068753, 0.1277408123157862, -0.27531647110550567, -0.06958424773444583, 0.18058162787929177, -0.17060499173862026, 0.04559840219785813, 0.05503007420715033, -0.01557358390245695, 0.046921428541752214, -0.31043959838129453, 0.28268453754045086, 0.09348333558792264, 0.3641278189687251, 0.11551676146487368, 0.00915395459039779, -0.030237537948213968, -0.0636964768315826, -0.04257912915360568, -0.05848648674794998, 0.18021096822360114, 0.36098353631276603, 0.21769347496602082, 0.3776968291655568, -0.5256982155160272, -0.17158219938824787, 0.12887118240127918, 0.12885049847356075, 0.019639201180764537, -0.03604293543534807, -0.2629362101052438, 0.05687462032550809, -0.2997297036114293, -0.10745362521365992, -0.1251525563460871, 0.011521506071058583, 0.046221307296444386, -0.2940573444665429, -0.020656473957858218, -0.04764039496487761, 0.03915897869215957, -0.04563621417338286, -0.08053541456596075, -0.04545486058963559, 0.2023993880419735, 0.09840355953251831, -0.02829858462327734, 0.1986583530609817, -0.1789926115748601, -0.11004648555736539, 0.42300008158681207, 0.050042809103301965, -0.14463619006685272, 0.24431681417401455, -0.02398561852169223, -0.1652654545654639, 0.08729450816212318, 0.2156636785737897, 0.005828655168317772, -0.22627862587426628, -0.015553527402266025, 0.05020768501783785, 0.18947556653814712, 0.0765156215056777, 0.08485672608862685, 0.23506363489562726, 0.1794738163689858, 0.19126719636927914, 0.09942228631578097, 0.036662215222067654, -0.15120252404374007, -0.1461967212902703, -0.12365312282305115, -0.15065317128831118, 0.042181360851765055, -0.06300654559890972, -0.12669082258221823, 0.28043232546770014, 0.20619534313977808, 0.09644196756938793, 0.08293468952389707, 0.39111484690962744, 0.05680649906195146, 0.15555461404387486, 0.17784669187425733, 0.1367841372050642, -0.06549207444085964, 0.22968115627661284, -0.16612797444997404, 0.15477154634585344, -0.06132765093934722]
|
1,803.06846
|
A primal discontinuous Galerkin method with static condensation on very
general meshes
|
We propose an efficient variant of a primal Discontinuous Galerkin method
with interior penalty for the second order elliptic equations on very general
meshes (polytopes with eventually curved boundaries). Efficiency, especially
when higher order polynomials are used, is achieved by static condensation,
i.e. a local elimination of certain degrees of freedom element by element. This
alters the original method in a way that preserves the optimal error estimates.
Numerical experiments confirm that the solutions produced by the new method are
indeed very close to that produced by the classical one.
|
math.NA
|
we propose an efficient variant of a primal discontinuous galerkin method with interior penalty for the second order elliptic equations on very general meshes polytopes with eventually curved boundaries efficiency especially when higher order polynomials are used is achieved by static condensation ie a local elimination of certain degrees of freedom element by element this alters the original method in a way that preserves the optimal error estimates numerical experiments confirm that the solutions produced by the new method are indeed very close to that produced by the classical one
|
[['we', 'propose', 'an', 'efficient', 'variant', 'of', 'a', 'primal', 'discontinuous', 'galerkin', 'method', 'with', 'interior', 'penalty', 'for', 'the', 'second', 'order', 'elliptic', 'equations', 'on', 'very', 'general', 'meshes', 'polytopes', 'with', 'eventually', 'curved', 'boundaries', 'efficiency', 'especially', 'when', 'higher', 'order', 'polynomials', 'are', 'used', 'is', 'achieved', 'by', 'static', 'condensation', 'ie', 'a', 'local', 'elimination', 'of', 'certain', 'degrees', 'of', 'freedom', 'element', 'by', 'element', 'this', 'alters', 'the', 'original', 'method', 'in', 'a', 'way', 'that', 'preserves', 'the', 'optimal', 'error', 'estimates', 'numerical', 'experiments', 'confirm', 'that', 'the', 'solutions', 'produced', 'by', 'the', 'new', 'method', 'are', 'indeed', 'very', 'close', 'to', 'that', 'produced', 'by', 'the', 'classical', 'one']]
|
[-0.09878314356837008, 0.08474208812581815, -0.10001198777204587, 0.045585644974683724, -0.07508163299773717, -0.1416601537157678, 0.031316787896988295, 0.342395220655534, -0.296927276522749, -0.2782684959794602, 0.12674259987866712, -0.2435473477260934, -0.14074951836114957, 0.17532427126748695, -0.10193026139168068, 0.0637751704495814, 0.10942699958880743, 0.0039377521930469405, -0.12168110662088212, -0.27072538702438276, 0.33033321785430114, 0.03667773484355873, 0.2624949322806464, 0.0098677356623941, 0.1307159756620725, -0.05301264762464497, 0.0010207416696680917, 0.061270736654599506, -0.09575942626292494, 0.17318320386111735, 0.24870069215798543, 0.05007014618151718, 0.2992711589412971, -0.4200967859890726, -0.20210683822062694, 0.08089103505869086, 0.14489870123668677, 0.12201803865739042, -0.10507886265404523, -0.24221363513626987, 0.13342092014435264, -0.12721782776320145, -0.18646997868426196, -0.12804181148660265, -0.06387181606454154, 0.04002425538169013, -0.31246489002886746, 0.09379442754563772, 0.06368337872877924, 0.03269023354061776, -0.02555183630126218, -0.1130574916373007, -0.015150462546282344, 0.04634767920199213, 0.007159675078259574, 0.024448555873499977, 0.048636462109991244, -0.10333322272635996, -0.09762082624300901, 0.39418823736098907, -0.0654861406203256, -0.28257906389577936, 0.16284615710998576, -0.12814063612992566, -0.067170652119805, 0.20043586909305305, 0.14831026406997505, 0.23301428839460844, -0.11215730280334052, 0.06181587361627155, -0.02287640443019983, 0.162118342001405, 0.08265124357357208, -0.021228028944460676, 0.13968806221770744, 0.1290830989956804, 0.13320289666040075, 0.14657812610061632, -0.04094443848718786, -0.12727901616858112, -0.3160514212627378, -0.12676994167785677, -0.17414484025858756, -0.03822603915662815, -0.17760782730894992, -0.1765460838149819, 0.35366855647492534, 0.14296171603168153, 0.1310215003995432, 0.045732363277218406, 0.30051611494272945, 0.12828417718410492, 0.05906424837691399, 0.10161896880405645, 0.2348607504248826, 0.11947496155173415, 0.07907213510221077, -0.2438756652567665, 0.07744847956216998, 0.20480913328938186]
|
1,803.06847
|
The square negative correlation on l_p^n balls
|
In this paper we prove that for any $p\in[2,\infty)$ the $\ell_p^n$ unit
ball, $B_p^n$, satisfies the square negative correlation property with respect
to every orthonormal basis, while we show it is not always the case for $1\le
p\le 2$. In order to do that we regard $B_p^n$ as the orthogonal projection of
$B_p^{n+1}$ onto the hyperplane $e_{n+1}^\perp$. We will also study the
orthogonal projection of $B_p^n$ onto the hyperplane orthogonal to the diagonal
vector $(1,\dots,1)$. In this case, the property holds for all $p\ge 1$ and $n$
large enough.
|
math.MG math.PR
|
in this paper we prove that for any pin2infty the ell_pn unit ball b_pn satisfies the square negative correlation property with respect to every orthonormal basis while we show it is not always the case for 1le ple 2 in order to do that we regard b_pn as the orthogonal projection of b_pn1 onto the hyperplane e_n1perp we will also study the orthogonal projection of b_pn onto the hyperplane orthogonal to the diagonal vector 1dots1 in this case the property holds for all pge 1 and n large enough
|
[['in', 'this', 'paper', 'we', 'prove', 'that', 'for', 'any', 'pin2infty', 'the', 'ell_pn', 'unit', 'ball', 'b_pn', 'satisfies', 'the', 'square', 'negative', 'correlation', 'property', 'with', 'respect', 'to', 'every', 'orthonormal', 'basis', 'while', 'we', 'show', 'it', 'is', 'not', 'always', 'the', 'case', 'for', '1le', 'ple', '2', 'in', 'order', 'to', 'do', 'that', 'we', 'regard', 'b_pn', 'as', 'the', 'orthogonal', 'projection', 'of', 'b_pn1', 'onto', 'the', 'hyperplane', 'e_n1perp', 'we', 'will', 'also', 'study', 'the', 'orthogonal', 'projection', 'of', 'b_pn', 'onto', 'the', 'hyperplane', 'orthogonal', 'to', 'the', 'diagonal', 'vector', '1dots1', 'in', 'this', 'case', 'the', 'property', 'holds', 'for', 'all', 'pge', '1', 'and', 'n', 'large', 'enough']]
|
[-0.13321851141451077, 0.09257343419474261, -0.027726432929436367, 0.014336049135228426, -0.039405550491921175, -0.14161420884360185, -0.021405345758947748, 0.41668715159644254, -0.2782996145515949, -0.1165940872849843, 0.12417992725888075, -0.29599903776556596, -0.12994310717986918, 0.1465090094040544, -0.07855557042291794, 0.03710231649817835, 0.04025109332247541, 0.08625487419616046, -0.11320596989565368, -0.2662802088695268, 0.3323047971874797, -0.018527740773198933, 0.2408170808620494, 0.023537011198892163, 0.11152087108114328, 0.08610744216083281, 0.036365513272326566, 0.0018607154756184966, -0.1383141948406293, 0.09300388246252812, 0.24994355333091198, 0.15021999039815676, 0.2723989610870679, -0.3540418219800113, -0.10316072998504186, 0.2340182519903214, 0.18115165734920521, 0.027300984071482015, -0.02405923766742364, -0.1744428891635061, 0.15310412255683165, -0.10438650435414808, -0.20943774431729797, -0.05315179270745694, 0.030355354021678025, 0.018509296335724193, -0.3250443333246071, 0.010379986481235266, 0.1844557448472271, 0.007578081761797269, -0.08273568959242997, -0.13379546218476762, 0.0046959992166308836, 0.08339351054345226, -0.011767155777170569, 0.10615348148202502, 0.02092816035635234, -0.030171659737611295, -0.0676135924054663, 0.3783798301913615, -0.07042965400648228, -0.30034774124365426, 0.11545265076318006, -0.2554270553498946, -0.1696710305973545, 0.06703698948753634, 0.135960533572682, 0.08810970007345595, -0.03387899605300406, 0.14103391694223466, -0.12769299107550205, 0.13518417710652467, 0.10596466836273327, 0.027542369560627587, 0.09088032368313649, 0.021510204684321136, 0.16413747717562163, 0.13978460192380623, -0.07126415620461621, -0.02582472668768003, -0.33641216963872145, -0.23333397068768397, -0.22149757365562323, 0.08696744963811073, -0.11049248035124037, -0.1263120207164822, 0.325720123026049, 0.09856002202428792, 0.21772464164586244, 0.10159392131695888, 0.23648749103491334, 0.0788651699743544, 0.07244815593906517, 0.09013280962411871, 0.1729686009087439, 0.11230231613862789, 0.029529355725958602, -0.15568319194275757, 0.020130671892614884, 0.1168924319375863]
|
1,803.06848
|
Period Increase and Amplitude Distribution of Kink Oscillation of
Coronal Loop
|
Coronal loops exist ubiquitously in the solar atmosphere. These loops puzzle
astronomers over half a century. Solar magneto-seismology (SMS) provides a
unique way to constrain the physical parameters of coronal loops. Here, we
study the evolution of oscillations of a coronal loop observed by the
Atmospheric Imaging Assembly (AIA). We measure geometric and physical
parameters of the loop oscillations. In particular, we find that the mean
period of the oscillations increased from 1048 to 1264 s during three
oscillatory cycles. We employ the differential emission measure method and
apply the tools of SMS. The evolution of densities inside and outside the loop
is analyzed. We found that an increase of density inside the loop and decrease
of the magnetic field strength along the loop are the main reasons for the
increase in the period during the oscillations. Besides, we also found that the
amplitude profile of the loop is different from a profile would it be a
homogeneous loop. It is proposed that the distribution of magnetic strength
along the loop rather than density stratification is responsible for this
deviation. The variation in period and distribution of amplitude provide, in
terms of SMS, a new and unprecedented insight into coronal loop diagnostics.
|
astro-ph.SR
|
coronal loops exist ubiquitously in the solar atmosphere these loops puzzle astronomers over half a century solar magnetoseismology sms provides a unique way to constrain the physical parameters of coronal loops here we study the evolution of oscillations of a coronal loop observed by the atmospheric imaging assembly aia we measure geometric and physical parameters of the loop oscillations in particular we find that the mean period of the oscillations increased from 1048 to 1264 s during three oscillatory cycles we employ the differential emission measure method and apply the tools of sms the evolution of densities inside and outside the loop is analyzed we found that an increase of density inside the loop and decrease of the magnetic field strength along the loop are the main reasons for the increase in the period during the oscillations besides we also found that the amplitude profile of the loop is different from a profile would it be a homogeneous loop it is proposed that the distribution of magnetic strength along the loop rather than density stratification is responsible for this deviation the variation in period and distribution of amplitude provide in terms of sms a new and unprecedented insight into coronal loop diagnostics
|
[['coronal', 'loops', 'exist', 'ubiquitously', 'in', 'the', 'solar', 'atmosphere', 'these', 'loops', 'puzzle', 'astronomers', 'over', 'half', 'a', 'century', 'solar', 'magnetoseismology', 'sms', 'provides', 'a', 'unique', 'way', 'to', 'constrain', 'the', 'physical', 'parameters', 'of', 'coronal', 'loops', 'here', 'we', 'study', 'the', 'evolution', 'of', 'oscillations', 'of', 'a', 'coronal', 'loop', 'observed', 'by', 'the', 'atmospheric', 'imaging', 'assembly', 'aia', 'we', 'measure', 'geometric', 'and', 'physical', 'parameters', 'of', 'the', 'loop', 'oscillations', 'in', 'particular', 'we', 'find', 'that', 'the', 'mean', 'period', 'of', 'the', 'oscillations', 'increased', 'from', '1048', 'to', '1264', 's', 'during', 'three', 'oscillatory', 'cycles', 'we', 'employ', 'the', 'differential', 'emission', 'measure', 'method', 'and', 'apply', 'the', 'tools', 'of', 'sms', 'the', 'evolution', 'of', 'densities', 'inside', 'and', 'outside', 'the', 'loop', 'is', 'analyzed', 'we', 'found', 'that', 'an', 'increase', 'of', 'density', 'inside', 'the', 'loop', 'and', 'decrease', 'of', 'the', 'magnetic', 'field', 'strength', 'along', 'the', 'loop', 'are', 'the', 'main', 'reasons', 'for', 'the', 'increase', 'in', 'the', 'period', 'during', 'the', 'oscillations', 'besides', 'we', 'also', 'found', 'that', 'the', 'amplitude', 'profile', 'of', 'the', 'loop', 'is', 'different', 'from', 'a', 'profile', 'would', 'it', 'be', 'a', 'homogeneous', 'loop', 'it', 'is', 'proposed', 'that', 'the', 'distribution', 'of', 'magnetic', 'strength', 'along', 'the', 'loop', 'rather', 'than', 'density', 'stratification', 'is', 'responsible', 'for', 'this', 'deviation', 'the', 'variation', 'in', 'period', 'and', 'distribution', 'of', 'amplitude', 'provide', 'in', 'terms', 'of', 'sms', 'a', 'new', 'and', 'unprecedented', 'insight', 'into', 'coronal', 'loop', 'diagnostics']]
|
[-0.14655959465089116, 0.20812524908222546, -0.06952666817694017, 0.12750847464240628, -0.055186304337538704, -0.05045018865182848, 0.0533291958825718, 0.3629011570540543, -0.22611744216375865, -0.34177352390528687, 0.10591037107987726, -0.2398558086900059, -0.1450160649319244, 0.23551941626171563, -0.018280846752585973, -0.015050844961920256, 0.06626770243228478, 0.04077367392950115, -0.06252511153412559, -0.17398542088299696, 0.28765557861096214, 0.07495342557074151, 0.23293827050181087, 0.0346753053450127, 0.08833924615479047, -0.060968573495058694, -0.027122526545864806, 0.035998527882712905, -0.12093875273738845, 0.0784433378623614, 0.1538589206710919, 0.12325996198334978, 0.20819297895794459, -0.4299179131331125, -0.24535905462828014, 0.04315798096865932, 0.1928490859036804, 0.0461287715790406, -0.019632566520842807, -0.2027979497751682, 0.07011497715683447, -0.13870732337098088, -0.16699502273839623, 0.01614319359293521, 0.04143483617105567, -0.009264340756765318, -0.24806326340496687, 0.07350714298729936, 0.00907525591411637, 0.08416230149917525, -0.08884982749506241, -0.05385773675055197, -0.04512800866366816, 0.17285269400851783, 0.06999190309831854, 0.040768141474454934, 0.15961924783129355, -0.106028935233463, -0.07217133010156673, 0.3255941591382322, -0.10328092451801231, -0.07595362858201313, 0.1334450458738916, -0.2223599292234158, -0.11376370996061602, 0.16793563871616773, 0.1467502290235445, 0.06878232160526372, -0.13477122088165788, 0.03941741967769709, -0.012394190107767314, 0.16801895429685684, 0.06349209991818534, 0.014151687902112556, 0.2719629395679377, 0.12967542876918237, 0.04970763705205172, 0.13190432540821095, -0.17178540082537744, -0.10580422387154091, -0.29983229678824985, -0.16662735303421275, -0.05435965786282305, 0.03670587376541559, -0.08103723011609504, -0.207167992681855, 0.4543948831257991, 0.17090035371694456, 0.2111300955720172, -0.02923039656298438, 0.3118425187024306, 0.1296130127347268, 0.09590866474143983, 0.08183088648999755, 0.2757414940267451, 0.18552160491973235, 0.14971371222515636, -0.2733997445237145, 0.05418691101096718, 0.049358492495842496]
|
1,803.06849
|
The arithmetic derivative and Leibniz-additive functions
|
An arithmetic function $f$ is Leibniz-additive if there is a completely
multiplicative function $h_f$, i.e., $h_f(1)=1$ and $h_f(mn)=h_f(m)h_f(n)$ for
all positive integers $m$ and $n$, satisfying $$ f(mn)=f(m)h_f(n)+f(n)h_f(m) $$
for all positive integers $m$ and $n$. A motivation for the present study is
the fact that Leibniz-additive functions are generalizations of the arithmetic
derivative $D$; namely, $D$ is Leibniz-additive with $h_D(n)=n$. In this paper,
we study the basic properties of Leibniz-additive functions and, among other
things, show that a Leibniz-additive function $f$ is totally determined by the
values of $f$ and $h_f$ at primes. We also consider properties of
Leibniz-additive functions with respect to the usual product, composition and
Dirichlet convolution of arithmetic functions.
|
math.NT
|
an arithmetic function f is leibnizadditive if there is a completely multiplicative function h_f ie h_f11 and h_fmnh_fmh_fn for all positive integers m and n satisfying fmnfmh_fnfnh_fm for all positive integers m and n a motivation for the present study is the fact that leibnizadditive functions are generalizations of the arithmetic derivative d namely d is leibnizadditive with h_dnn in this paper we study the basic properties of leibnizadditive functions and among other things show that a leibnizadditive function f is totally determined by the values of f and h_f at primes we also consider properties of leibnizadditive functions with respect to the usual product composition and dirichlet convolution of arithmetic functions
|
[['an', 'arithmetic', 'function', 'f', 'is', 'leibnizadditive', 'if', 'there', 'is', 'a', 'completely', 'multiplicative', 'function', 'h_f', 'ie', 'h_f11', 'and', 'h_fmnh_fmh_fn', 'for', 'all', 'positive', 'integers', 'm', 'and', 'n', 'satisfying', 'fmnfmh_fnfnh_fm', 'for', 'all', 'positive', 'integers', 'm', 'and', 'n', 'a', 'motivation', 'for', 'the', 'present', 'study', 'is', 'the', 'fact', 'that', 'leibnizadditive', 'functions', 'are', 'generalizations', 'of', 'the', 'arithmetic', 'derivative', 'd', 'namely', 'd', 'is', 'leibnizadditive', 'with', 'h_dnn', 'in', 'this', 'paper', 'we', 'study', 'the', 'basic', 'properties', 'of', 'leibnizadditive', 'functions', 'and', 'among', 'other', 'things', 'show', 'that', 'a', 'leibnizadditive', 'function', 'f', 'is', 'totally', 'determined', 'by', 'the', 'values', 'of', 'f', 'and', 'h_f', 'at', 'primes', 'we', 'also', 'consider', 'properties', 'of', 'leibnizadditive', 'functions', 'with', 'respect', 'to', 'the', 'usual', 'product', 'composition', 'and', 'dirichlet', 'convolution', 'of', 'arithmetic', 'functions']]
|
[-0.18475916940304968, 0.1336529879644567, -0.05456512658404083, 0.06016547285037598, -0.029073594965868525, -0.1301525519962457, -0.010753064227712996, 0.32809630527885425, -0.30656136932817324, -0.21281400576279136, 0.05126305344768938, -0.3096381966886973, -0.18366953862089389, 0.18404805430435334, -0.03822398700436612, 0.02310233038790304, 0.0018196955788880587, 0.08853146531705365, -0.0962586143631833, -0.28124898217006206, 0.4059131116071647, -0.06511673833140069, 0.14366811303490842, 0.05870608715512962, 0.08521449079961274, 0.023298952961340547, -0.012353880654296113, -0.02683619063679577, -0.1627696447244994, 0.08903760062013236, 0.2323942646142785, 0.13412657825069296, 0.2875729220125962, -0.3357798678421036, -0.12399697883665795, 0.2107326381503501, 0.08468451376366257, -0.07667890057227514, -0.0021269007034047886, -0.18580058304144553, 0.17231226637657662, -0.12688667097784304, -0.13894302830427746, -0.060279817212614474, 0.12907458826278648, 0.09267144329108608, -0.3304990308954277, 0.028273914084517553, 0.09342277332864425, 0.08340262876892532, -0.057040745987453394, -0.19573607454421343, 0.006375697760463313, 0.06944362374660731, 0.027287915858862647, 0.07576970097013852, 0.05396514086276983, -0.09226132930834191, -0.067301277830093, 0.336267086090865, -0.09822718425722862, -0.25971938862494426, 0.13012509783557444, -0.19379687150595365, -0.15381589127894216, 0.04352944126197111, 0.07549443753453454, 0.15303641349008237, -0.0804668091478999, 0.2119354510224959, -0.10687553146164175, 0.1475249161529872, 0.09764902281178231, 0.05237385114930846, 0.128415429087235, 0.03266556986124703, 0.0976306718075648, 0.16692223190815034, 0.042791427065687324, -0.010798369361846536, -0.3470866847438393, -0.18496596792937015, -0.1847103906437513, 0.10553369897900632, -0.07894209403187873, -0.18963015303705577, 0.37699333436925103, 0.043416292829163095, 0.21728494304611726, 0.15859775309864846, 0.24809403921029083, 0.1485461794719514, 0.04848804557695985, 0.08177336116097178, 0.06889883811689085, 0.16704423303922844, -0.007878441880974505, -0.1393060643954582, 0.06492899707949686, 0.11592328211258131]
|
1,803.0685
|
An Adaptable System to Support Provenance Management for the Public
Policy-Making Process in Smart Cities
|
Government policies aim to address public issues and problems and therefore
play a pivotal role in peoples lives. The creation of public policies, however,
is complex given the perspective of large and diverse stakeholders involvement,
considerable human participation, lengthy processes, complex task specification
and the non-deterministic nature of the process. The inherent complexities of
the policy process impart challenges for designing a computing system that
assists in supporting and automating the business process pertaining to policy
setup, which also raises concerns for setting up a tracking service in the
policy-making environment. A tracking service informs how decisions have been
taken during policy creation and can provide useful and intrinsic information
regarding the policy process. At present, there exists no computing system that
assists in tracking the complete process that has been employed for policy
creation. To design such a system, it is important to consider the policy
environment challenges; for this a novel network and goal based approach has
been framed and is covered in detail in this paper. Furthermore, smart
governance objectives that include stakeholders participation and citizens
involvement have been considered. Thus, the proposed approach has been devised
by considering smart governance principles and the knowledge environment of
policy making where tasks are largely dependent on policy makers decisions and
on individual policy objectives. Our approach reckons the human dimension for
deciding and defining autonomous process activities at run time. Furthermore,
with the network-based approach, so-called provenance data tracking is employed
which enables the capture of policy process.
|
cs.DB cs.CY
|
government policies aim to address public issues and problems and therefore play a pivotal role in peoples lives the creation of public policies however is complex given the perspective of large and diverse stakeholders involvement considerable human participation lengthy processes complex task specification and the nondeterministic nature of the process the inherent complexities of the policy process impart challenges for designing a computing system that assists in supporting and automating the business process pertaining to policy setup which also raises concerns for setting up a tracking service in the policymaking environment a tracking service informs how decisions have been taken during policy creation and can provide useful and intrinsic information regarding the policy process at present there exists no computing system that assists in tracking the complete process that has been employed for policy creation to design such a system it is important to consider the policy environment challenges for this a novel network and goal based approach has been framed and is covered in detail in this paper furthermore smart governance objectives that include stakeholders participation and citizens involvement have been considered thus the proposed approach has been devised by considering smart governance principles and the knowledge environment of policy making where tasks are largely dependent on policy makers decisions and on individual policy objectives our approach reckons the human dimension for deciding and defining autonomous process activities at run time furthermore with the networkbased approach socalled provenance data tracking is employed which enables the capture of policy process
|
[['government', 'policies', 'aim', 'to', 'address', 'public', 'issues', 'and', 'problems', 'and', 'therefore', 'play', 'a', 'pivotal', 'role', 'in', 'peoples', 'lives', 'the', 'creation', 'of', 'public', 'policies', 'however', 'is', 'complex', 'given', 'the', 'perspective', 'of', 'large', 'and', 'diverse', 'stakeholders', 'involvement', 'considerable', 'human', 'participation', 'lengthy', 'processes', 'complex', 'task', 'specification', 'and', 'the', 'nondeterministic', 'nature', 'of', 'the', 'process', 'the', 'inherent', 'complexities', 'of', 'the', 'policy', 'process', 'impart', 'challenges', 'for', 'designing', 'a', 'computing', 'system', 'that', 'assists', 'in', 'supporting', 'and', 'automating', 'the', 'business', 'process', 'pertaining', 'to', 'policy', 'setup', 'which', 'also', 'raises', 'concerns', 'for', 'setting', 'up', 'a', 'tracking', 'service', 'in', 'the', 'policymaking', 'environment', 'a', 'tracking', 'service', 'informs', 'how', 'decisions', 'have', 'been', 'taken', 'during', 'policy', 'creation', 'and', 'can', 'provide', 'useful', 'and', 'intrinsic', 'information', 'regarding', 'the', 'policy', 'process', 'at', 'present', 'there', 'exists', 'no', 'computing', 'system', 'that', 'assists', 'in', 'tracking', 'the', 'complete', 'process', 'that', 'has', 'been', 'employed', 'for', 'policy', 'creation', 'to', 'design', 'such', 'a', 'system', 'it', 'is', 'important', 'to', 'consider', 'the', 'policy', 'environment', 'challenges', 'for', 'this', 'a', 'novel', 'network', 'and', 'goal', 'based', 'approach', 'has', 'been', 'framed', 'and', 'is', 'covered', 'in', 'detail', 'in', 'this', 'paper', 'furthermore', 'smart', 'governance', 'objectives', 'that', 'include', 'stakeholders', 'participation', 'and', 'citizens', 'involvement', 'have', 'been', 'considered', 'thus', 'the', 'proposed', 'approach', 'has', 'been', 'devised', 'by', 'considering', 'smart', 'governance', 'principles', 'and', 'the', 'knowledge', 'environment', 'of', 'policy', 'making', 'where', 'tasks', 'are', 'largely', 'dependent', 'on', 'policy', 'makers', 'decisions', 'and', 'on', 'individual', 'policy', 'objectives', 'our', 'approach', 'reckons', 'the', 'human', 'dimension', 'for', 'deciding', 'and', 'defining', 'autonomous', 'process', 'activities', 'at', 'run', 'time', 'furthermore', 'with', 'the', 'networkbased', 'approach', 'socalled', 'provenance', 'data', 'tracking', 'is', 'employed', 'which', 'enables', 'the', 'capture', 'of', 'policy', 'process']]
|
[-0.09928367131575942, 0.034193714812397955, -0.08134950768575072, 0.06650297580521874, -0.1286609918642789, -0.1571884447745979, 0.10781811964185908, 0.43176304912567137, -0.24307034727255813, -0.33597626294475047, 0.12920008197985589, -0.23095975079387426, -0.1818262680885382, 0.1823756187222898, -0.14244633885286748, 0.0891495600529015, 0.0853399294950068, 0.007035839093965478, 0.05083350103162229, -0.2571893558949232, 0.3357014435566962, 0.08866419311333448, 0.35920034429430964, 0.07879997057560831, 0.11977675439184532, 0.027889047701843084, -0.05564799065515399, -0.03548470446327701, -0.07806791707559023, 0.13805956823192536, 0.37426541646569966, 0.24744180531241, 0.40465242697671056, -0.4259946537613869, -0.18549748097360133, 0.09229864642070607, 0.1422156734727323, 0.04449381623789668, -0.05461562585923821, -0.31369704004377125, 0.05715271803783253, -0.21828003521915526, -0.09341104811988771, -0.10994875361025333, 0.013724454150767998, -0.035984771588351575, -0.28313640087097885, -0.042222267550532704, 0.05146858888003044, 0.07307055631396361, -0.05800609730836004, -0.07551997953327373, 0.009631164950318634, 0.25926807963964527, 0.08039945282984991, 0.011311841908376663, 0.1812940185321495, -0.15097210263833405, -0.19772192422673107, 0.39631590233556924, 0.05889421459380537, -0.1765557835108484, 0.17286753021646292, -0.03783788024447858, -0.18282586844079196, 0.09596229810267687, 0.2521909810565412, 0.07570730391703547, -0.21356503405421973, 0.068855035999557, 0.022793969221413135, 0.1550578253325075, 0.018721748736687003, 0.024858598832041025, 0.19972899425961077, 0.25465822089463475, 0.1092344302739948, 0.09289781314134597, 0.019317867916077376, -0.15896374135557562, -0.21023781518638135, -0.15400406356342136, -0.11810701454221272, -0.00951402138674166, -0.05281937387137441, -0.09731072858162225, 0.3448592537026852, 0.2064348352300003, 0.1053757641557604, 0.024428077251650394, 0.32699240956967696, 0.07483380154753104, 0.06727623727917671, 0.09529195526032709, 0.16905836942838504, -0.022091670100577176, 0.21588304268103092, -0.19555049351137133, 0.2057304086871445, 0.00023767648357897998]
|
1,803.06851
|
Cosmological Tests With Strong Gravitational Lenses using Gaussian
Processes
|
Strong gravitational lenses provide source/lens distance ratios D_obs useful
in cosmological tests. Previously, a catalog of 69 such systems was used in a
one-on-one comparison between the standard model, LCDM, and the R_h=ct
universe, which has thus far been favored by the application of model selection
tools to many other kinds of data. But in that work, the use of model
parametric fits to the observations could not easily distinguish between these
two cosmologies, in part due to the limited measurement precision. Here, we
instead use recently developed methods based on Gaussian Processes (GP), in
which D_obs may be reconstructed directly from the data without assuming any
parametric form. This approach not only smooths out the reconstructed function
representing the data, but also reduces the size of the 1-sigma confidence
regions, thereby providing greater power to discern between different models.
With the current sample size, we show that analyzing strong lenses with a GP
approach can definitely improve the model comparisons, producing probability
differences in the range ~10-30%. These results are still marginal, however,
given the relatively small sample. Nonetheless, we conclude that the
probability of R_h=ct being the correct cosmology is somewhat higher than that
of LCDM, with a degree of significance that grows with the number of sources in
the subsamples we consider. Future surveys will significantly grow the catalog
of strong lenses and will therefore benefit considerably from the GP method we
describe here. In addition, we point out that if the R_h=ct universe is
eventually shown to be the correct cosmology, the lack of free parameters in
the study of strong lenses should provide a remarkably powerful tool for
uncovering the mass structure in lensing galaxies.
|
astro-ph.CO astro-ph.GA astro-ph.HE gr-qc hep-ph
|
strong gravitational lenses provide sourcelens distance ratios d_obs useful in cosmological tests previously a catalog of 69 such systems was used in a oneonone comparison between the standard model lcdm and the r_hct universe which has thus far been favored by the application of model selection tools to many other kinds of data but in that work the use of model parametric fits to the observations could not easily distinguish between these two cosmologies in part due to the limited measurement precision here we instead use recently developed methods based on gaussian processes gp in which d_obs may be reconstructed directly from the data without assuming any parametric form this approach not only smooths out the reconstructed function representing the data but also reduces the size of the 1sigma confidence regions thereby providing greater power to discern between different models with the current sample size we show that analyzing strong lenses with a gp approach can definitely improve the model comparisons producing probability differences in the range 1030 these results are still marginal however given the relatively small sample nonetheless we conclude that the probability of r_hct being the correct cosmology is somewhat higher than that of lcdm with a degree of significance that grows with the number of sources in the subsamples we consider future surveys will significantly grow the catalog of strong lenses and will therefore benefit considerably from the gp method we describe here in addition we point out that if the r_hct universe is eventually shown to be the correct cosmology the lack of free parameters in the study of strong lenses should provide a remarkably powerful tool for uncovering the mass structure in lensing galaxies
|
[['strong', 'gravitational', 'lenses', 'provide', 'sourcelens', 'distance', 'ratios', 'd_obs', 'useful', 'in', 'cosmological', 'tests', 'previously', 'a', 'catalog', 'of', '69', 'such', 'systems', 'was', 'used', 'in', 'a', 'oneonone', 'comparison', 'between', 'the', 'standard', 'model', 'lcdm', 'and', 'the', 'r_hct', 'universe', 'which', 'has', 'thus', 'far', 'been', 'favored', 'by', 'the', 'application', 'of', 'model', 'selection', 'tools', 'to', 'many', 'other', 'kinds', 'of', 'data', 'but', 'in', 'that', 'work', 'the', 'use', 'of', 'model', 'parametric', 'fits', 'to', 'the', 'observations', 'could', 'not', 'easily', 'distinguish', 'between', 'these', 'two', 'cosmologies', 'in', 'part', 'due', 'to', 'the', 'limited', 'measurement', 'precision', 'here', 'we', 'instead', 'use', 'recently', 'developed', 'methods', 'based', 'on', 'gaussian', 'processes', 'gp', 'in', 'which', 'd_obs', 'may', 'be', 'reconstructed', 'directly', 'from', 'the', 'data', 'without', 'assuming', 'any', 'parametric', 'form', 'this', 'approach', 'not', 'only', 'smooths', 'out', 'the', 'reconstructed', 'function', 'representing', 'the', 'data', 'but', 'also', 'reduces', 'the', 'size', 'of', 'the', '1sigma', 'confidence', 'regions', 'thereby', 'providing', 'greater', 'power', 'to', 'discern', 'between', 'different', 'models', 'with', 'the', 'current', 'sample', 'size', 'we', 'show', 'that', 'analyzing', 'strong', 'lenses', 'with', 'a', 'gp', 'approach', 'can', 'definitely', 'improve', 'the', 'model', 'comparisons', 'producing', 'probability', 'differences', 'in', 'the', 'range', '1030', 'these', 'results', 'are', 'still', 'marginal', 'however', 'given', 'the', 'relatively', 'small', 'sample', 'nonetheless', 'we', 'conclude', 'that', 'the', 'probability', 'of', 'r_hct', 'being', 'the', 'correct', 'cosmology', 'is', 'somewhat', 'higher', 'than', 'that', 'of', 'lcdm', 'with', 'a', 'degree', 'of', 'significance', 'that', 'grows', 'with', 'the', 'number', 'of', 'sources', 'in', 'the', 'subsamples', 'we', 'consider', 'future', 'surveys', 'will', 'significantly', 'grow', 'the', 'catalog', 'of', 'strong', 'lenses', 'and', 'will', 'therefore', 'benefit', 'considerably', 'from', 'the', 'gp', 'method', 'we', 'describe', 'here', 'in', 'addition', 'we', 'point', 'out', 'that', 'if', 'the', 'r_hct', 'universe', 'is', 'eventually', 'shown', 'to', 'be', 'the', 'correct', 'cosmology', 'the', 'lack', 'of', 'free', 'parameters', 'in', 'the', 'study', 'of', 'strong', 'lenses', 'should', 'provide', 'a', 'remarkably', 'powerful', 'tool', 'for', 'uncovering', 'the', 'mass', 'structure', 'in', 'lensing', 'galaxies']]
|
[-0.052997852187761166, 0.06342826620173111, -0.10329982508040911, 0.11451870164199122, -0.09022902329820845, -0.12006012811124486, 0.05084431448301448, 0.37545942757010675, -0.2195606968757569, -0.3460848134387077, 0.07166410624652618, -0.2665583195546709, -0.08621632623094261, 0.22572695833577258, -0.023732158071495486, 0.014975621673218208, 0.07701128403649485, -0.020350223874276263, -0.0581408262599541, -0.2728669055906734, 0.29673523503345633, 0.10883625193076918, 0.26975124876229295, -0.004589817706971235, 0.05483154870114095, -0.05130198384570661, -0.08067638988848676, 0.0644723123421879, -0.1369832064473282, 0.08503633480047533, 0.23489107505859158, 0.16683281896545438, 0.26531818937996016, -0.37406504570594246, -0.2299954769915144, 0.1603557253993458, 0.1609471708740503, 0.13813591731139357, -0.03518329550790192, -0.2739056792368161, 0.10389699922768204, -0.1658727284518247, -0.13812693353347053, -0.06169067252688646, -0.0217995759836321, 0.0007064675840234263, -0.2391258821256958, 0.11143076886842111, 0.031584420123115756, 0.02070881901794656, -0.03809583512228652, -0.11000705083577539, -0.0142320029893153, 0.09284055708168852, 0.05023482509280669, 0.04079709788734134, 0.10526075387346766, -0.15733708746617378, -0.07044655759232588, 0.39340675553841276, -0.06720722499878268, -0.17727527863902154, 0.20643968858652273, -0.18958540270674518, -0.15625817171740178, 0.10429632883225173, 0.15690500890897258, 0.06169044519623862, -0.16771208152376793, 0.05826134712681536, -0.007373875832828365, 0.2180737484513033, 0.037538771471092414, 0.022814350450585642, 0.26983349150291264, 0.13354487029379972, 0.041955896154701, 0.08404033233578277, -0.1302160596426429, -0.06158580860246991, -0.28740043448713076, -0.10546874816583054, -0.1575038936307399, 0.03233897917254463, -0.11737504806493078, -0.1431625226711253, 0.35311441491408235, 0.1990277191130746, 0.20854604371702767, 0.07966706519041934, 0.3014950458925191, 0.07523314428571008, 0.1018200137706058, 0.0408423141134139, 0.30986234213212144, 0.09112162675989939, 0.033956755805683574, -0.15285518161932396, 0.0902799264470906, -0.03888100021930827]
|
1,803.06852
|
Confounder Detection in High Dimensional Linear Models using First
Moments of Spectral Measures
|
In this paper, we study the confounder detection problem in the linear model,
where the target variable $Y$ is predicted using its $n$ potential causes
$X_n=(x_1,...,x_n)^T$. Based on an assumption of rotation invariant generating
process of the model, recent study shows that the spectral measure induced by
the regression coefficient vector with respect to the covariance matrix of
$X_n$ is close to a uniform measure in purely causal cases, but it differs from
a uniform measure characteristically in the presence of a scalar confounder.
Then, analyzing spectral measure pattern could help to detect confounding. In
this paper, we propose to use the first moment of the spectral measure for
confounder detection. We calculate the first moment of the regression vector
induced spectral measure, and compare it with the first moment of a uniform
spectral measure, both defined with respect to the covariance matrix of $X_n$.
The two moments coincide in non-confounding cases, and differ from each other
in the presence of confounding. This statistical causal-confounding asymmetry
can be used for confounder detection. Without the need of analyzing the
spectral measure pattern, our method does avoid the difficulty of metric choice
and multiple parameter optimization. Experiments on synthetic and real data
show the performance of this method.
|
stat.ML cs.LG
|
in this paper we study the confounder detection problem in the linear model where the target variable y is predicted using its n potential causes x_nx_1x_nt based on an assumption of rotation invariant generating process of the model recent study shows that the spectral measure induced by the regression coefficient vector with respect to the covariance matrix of x_n is close to a uniform measure in purely causal cases but it differs from a uniform measure characteristically in the presence of a scalar confounder then analyzing spectral measure pattern could help to detect confounding in this paper we propose to use the first moment of the spectral measure for confounder detection we calculate the first moment of the regression vector induced spectral measure and compare it with the first moment of a uniform spectral measure both defined with respect to the covariance matrix of x_n the two moments coincide in nonconfounding cases and differ from each other in the presence of confounding this statistical causalconfounding asymmetry can be used for confounder detection without the need of analyzing the spectral measure pattern our method does avoid the difficulty of metric choice and multiple parameter optimization experiments on synthetic and real data show the performance of this method
|
[['in', 'this', 'paper', 'we', 'study', 'the', 'confounder', 'detection', 'problem', 'in', 'the', 'linear', 'model', 'where', 'the', 'target', 'variable', 'y', 'is', 'predicted', 'using', 'its', 'n', 'potential', 'causes', 'x_nx_1x_nt', 'based', 'on', 'an', 'assumption', 'of', 'rotation', 'invariant', 'generating', 'process', 'of', 'the', 'model', 'recent', 'study', 'shows', 'that', 'the', 'spectral', 'measure', 'induced', 'by', 'the', 'regression', 'coefficient', 'vector', 'with', 'respect', 'to', 'the', 'covariance', 'matrix', 'of', 'x_n', 'is', 'close', 'to', 'a', 'uniform', 'measure', 'in', 'purely', 'causal', 'cases', 'but', 'it', 'differs', 'from', 'a', 'uniform', 'measure', 'characteristically', 'in', 'the', 'presence', 'of', 'a', 'scalar', 'confounder', 'then', 'analyzing', 'spectral', 'measure', 'pattern', 'could', 'help', 'to', 'detect', 'confounding', 'in', 'this', 'paper', 'we', 'propose', 'to', 'use', 'the', 'first', 'moment', 'of', 'the', 'spectral', 'measure', 'for', 'confounder', 'detection', 'we', 'calculate', 'the', 'first', 'moment', 'of', 'the', 'regression', 'vector', 'induced', 'spectral', 'measure', 'and', 'compare', 'it', 'with', 'the', 'first', 'moment', 'of', 'a', 'uniform', 'spectral', 'measure', 'both', 'defined', 'with', 'respect', 'to', 'the', 'covariance', 'matrix', 'of', 'x_n', 'the', 'two', 'moments', 'coincide', 'in', 'nonconfounding', 'cases', 'and', 'differ', 'from', 'each', 'other', 'in', 'the', 'presence', 'of', 'confounding', 'this', 'statistical', 'causalconfounding', 'asymmetry', 'can', 'be', 'used', 'for', 'confounder', 'detection', 'without', 'the', 'need', 'of', 'analyzing', 'the', 'spectral', 'measure', 'pattern', 'our', 'method', 'does', 'avoid', 'the', 'difficulty', 'of', 'metric', 'choice', 'and', 'multiple', 'parameter', 'optimization', 'experiments', 'on', 'synthetic', 'and', 'real', 'data', 'show', 'the', 'performance', 'of', 'this', 'method']]
|
[-0.08225036680648502, 0.0549959645950232, -0.08942632350079678, 0.07008055216675113, -0.07939201689513373, -0.10341867620786055, 0.0407806611467919, 0.39172692223465794, -0.2884665560871913, -0.2938395050288926, 0.08761843832799238, -0.2693581713014856, -0.1435627093265668, 0.13807383946514704, -0.0776736537072569, 0.050846158503612106, 0.04301099797648841, 0.07635815573966341, -0.08532321080680147, -0.19963734965769142, 0.36795663089477665, 0.048650467489602896, 0.3019875517273276, 0.021256409415727474, 0.09012271459340554, 0.021726326925193735, -0.09902133365514977, 0.023079520150034297, -0.0835223045555162, 0.12168522960485735, 0.1974785225729692, 0.14800727468332633, 0.2550562270114134, -0.34926315365483057, -0.2117713777935637, 0.19210900784713295, 0.0976540302041129, 0.05360089114000057, -0.03138897628259611, -0.28421976888010947, 0.09449510681419977, -0.13432015472188077, -0.12403421298706252, -0.08629935648145494, -0.015175029094069462, 0.016791601550623113, -0.3303409813412378, 0.09068475456637665, 0.07582872650205282, 0.05667184066174212, -0.05257552839400421, -0.10335019753392548, 0.025289673860565635, 0.11128597274156553, 0.09783173307619893, 0.03011033574825731, 0.0946035246373948, -0.0981891161771927, -0.11695246735250513, 0.36054936394535847, -0.13762235952073276, -0.24259817760937796, 0.1440443415016973, -0.17740769088818817, -0.14281650150901284, 0.08418076965164191, 0.20212135454777427, 0.14185171752360654, -0.15535219459165933, 0.07714879595252497, -0.02210080122954804, 0.1755426009208551, 0.03820292580427758, -0.007147499116990954, 0.16779505042818013, 0.12483453483141849, 0.09007212606699119, 0.14364412609055371, -0.1544348140788526, -0.058229327839546895, -0.28999164590659077, -0.14626758472547807, -0.21444274718056575, 0.0299938564175015, -0.1298851607905889, -0.176155900912419, 0.4114118138089629, 0.19033512733005023, 0.24555327171996566, 0.04326644721739178, 0.2939622229437706, 0.1404593063115826, 0.03015218880669824, 0.016091881611205526, 0.20596935621834375, 0.16277177904943563, 0.024440555538514198, -0.2417631234280912, 0.12186955322747765, 0.016195752278094756]
|
1,803.06853
|
A turnover in the radio light curve of GW170817
|
We present 2-9 GHz radio observations of GW170817 covering the period 125-200
days post-merger, taken with the Australia Telescope Compact Array and the Karl
G. Jansky Very Large Array. Our observations demonstrate that the radio
afterglow peaked at $149\pm2$ days post-merger and is now declining in flux
density. We see no evidence for evolution in the radio-only spectral index,
which remains consistent with optically-thin synchrotron emission connecting
the radio, optical, and X-ray regimes. The peak implies a total energy in the
synchrotron-emitting component of a ${\rm few}\times 10^{50}\,$erg. The
temporal decay rate is most consistent with mildly- or non-relativistic
material and we do not see evidence for a very energetic off-axis jet, but we
cannot distinguish between a lower-energy jet and more isotropic emission.
|
astro-ph.HE
|
we present 29 ghz radio observations of gw170817 covering the period 125200 days postmerger taken with the australia telescope compact array and the karl g jansky very large array our observations demonstrate that the radio afterglow peaked at 149pm2 days postmerger and is now declining in flux density we see no evidence for evolution in the radioonly spectral index which remains consistent with opticallythin synchrotron emission connecting the radio optical and xray regimes the peak implies a total energy in the synchrotronemitting component of a rm fewtimes 1050erg the temporal decay rate is most consistent with mildly or nonrelativistic material and we do not see evidence for a very energetic offaxis jet but we cannot distinguish between a lowerenergy jet and more isotropic emission
|
[['we', 'present', '29', 'ghz', 'radio', 'observations', 'of', 'gw170817', 'covering', 'the', 'period', '125200', 'days', 'postmerger', 'taken', 'with', 'the', 'australia', 'telescope', 'compact', 'array', 'and', 'the', 'karl', 'g', 'jansky', 'very', 'large', 'array', 'our', 'observations', 'demonstrate', 'that', 'the', 'radio', 'afterglow', 'peaked', 'at', '149pm2', 'days', 'postmerger', 'and', 'is', 'now', 'declining', 'in', 'flux', 'density', 'we', 'see', 'no', 'evidence', 'for', 'evolution', 'in', 'the', 'radioonly', 'spectral', 'index', 'which', 'remains', 'consistent', 'with', 'opticallythin', 'synchrotron', 'emission', 'connecting', 'the', 'radio', 'optical', 'and', 'xray', 'regimes', 'the', 'peak', 'implies', 'a', 'total', 'energy', 'in', 'the', 'synchrotronemitting', 'component', 'of', 'a', 'rm', 'fewtimes', '1050erg', 'the', 'temporal', 'decay', 'rate', 'is', 'most', 'consistent', 'with', 'mildly', 'or', 'nonrelativistic', 'material', 'and', 'we', 'do', 'not', 'see', 'evidence', 'for', 'a', 'very', 'energetic', 'offaxis', 'jet', 'but', 'we', 'can', 'not', 'distinguish', 'between', 'a', 'lowerenergy', 'jet', 'and', 'more', 'isotropic', 'emission']]
|
[-0.10927957556176386, 0.1553237032901488, -0.07915098007344376, 0.10939466011543887, -0.1360022369128599, -0.11821941588058825, 0.020318536775004937, 0.5173463301384836, -0.1374639617023626, -0.31385327706007454, 0.11280270850918127, -0.2850800740373571, -0.014150705288838201, 0.2263595591350345, 0.02811033917000381, -0.08329711623236204, 0.12484895359209883, -0.1074828747735639, -0.06167192893610071, -0.11697629365948885, 0.22546281192330567, 0.12570625120524045, 0.21727646002167367, 0.03144432349524241, 0.07920418054289449, -0.07443746169688316, -0.08686618172734922, -0.008583568309138461, -0.06393613636985135, 0.015178473454301919, 0.2553321271680477, 0.10806492985627515, 0.15660799399957182, -0.3811705752419747, -0.214490107314593, 0.09481072475247812, 0.12377080708984436, 0.004132710066926855, -0.0135878426893813, -0.2593053165762647, 0.0479143608240335, -0.2502417487122603, -0.18112086277545952, 0.1066750689386958, 0.07774289969990893, 0.0016733276907627175, -0.21698247390322206, 0.1408480637760883, -0.017657648349877417, 0.037825053111968064, -0.09302078220024099, -0.04711082772677386, -0.016491925600363413, 0.010339541684427276, 0.04009357633493174, 0.08718679649225337, 0.1058042168019082, -0.12573292839333294, -0.04566135148449642, 0.37179867104377323, -0.08946394813587753, 0.07091939710534928, 0.21174267188804904, -0.2704636057710078, -0.22545179779966915, 0.22807188869673548, 0.12581876472464, 0.0735261549934654, -0.07497614563813781, 0.0015651177235394412, -0.03777183677596078, 0.2780924923263672, 0.07126497188052995, 0.06767600922319068, 0.32034497334795997, 0.12078076463885515, 0.04445041370260098, 0.10276935605816846, -0.2505181442295027, 0.035294659306083206, -0.293490326910363, -0.061817263275748345, -0.15243980525879236, 0.1728288303586045, -0.11352730494281713, -0.11032145326044714, 0.38327444495057794, 0.03262932394532775, 0.1779112853734504, 0.08054769893718232, 0.2752751635493544, 0.0888181673731973, 0.05233516033828293, 0.20565200031818293, 0.34044909237967275, 0.1671735830302161, 0.14384991994763657, -0.19051550282543994, 0.02469781722600867, -0.05101485412314201]
|
1,803.06854
|
MONICA in Hamburg: Towards Large-Scale IoT Deployments in a Smart City
|
Modern cities and metropolitan areas all over the world face new management
challenges in the 21st century primarily due to increasing demands on living
standards by the urban population. These challenges range from climate change,
pollution, transportation, and citizen engagement, to urban planning, and
security threats. The primary goal of a Smart City is to counteract these
problems and mitigate their effects by means of modern ICT to improve urban
administration and infrastructure. Key ideas are to utilise network
communication to inter-connect public authorities; but also to deploy and
integrate numerous sensors and actuators throughout the city infrastructure -
which is also widely known as the Internet of Things (IoT). Thus, IoT
technologies will be an integral part and key enabler to achieve many
objectives of the Smart City vision.
The contributions of this paper are as follows. We first examine a number of
IoT platforms, technologies and network standards that can help to foster a
Smart City environment. Second, we introduce the EU project MONICA which aims
for demonstration of large-scale IoT deployments at public, inner-city events
and give an overview on its IoT platform architecture. And third, we provide a
case-study report on SmartCity activities by the City of Hamburg and provide
insights on recent (on-going) field tests of a vertically integrated,
end-to-end IoT sensor application.
|
cs.NI
|
modern cities and metropolitan areas all over the world face new management challenges in the 21st century primarily due to increasing demands on living standards by the urban population these challenges range from climate change pollution transportation and citizen engagement to urban planning and security threats the primary goal of a smart city is to counteract these problems and mitigate their effects by means of modern ict to improve urban administration and infrastructure key ideas are to utilise network communication to interconnect public authorities but also to deploy and integrate numerous sensors and actuators throughout the city infrastructure which is also widely known as the internet of things iot thus iot technologies will be an integral part and key enabler to achieve many objectives of the smart city vision the contributions of this paper are as follows we first examine a number of iot platforms technologies and network standards that can help to foster a smart city environment second we introduce the eu project monica which aims for demonstration of largescale iot deployments at public innercity events and give an overview on its iot platform architecture and third we provide a casestudy report on smartcity activities by the city of hamburg and provide insights on recent ongoing field tests of a vertically integrated endtoend iot sensor application
|
[['modern', 'cities', 'and', 'metropolitan', 'areas', 'all', 'over', 'the', 'world', 'face', 'new', 'management', 'challenges', 'in', 'the', '21st', 'century', 'primarily', 'due', 'to', 'increasing', 'demands', 'on', 'living', 'standards', 'by', 'the', 'urban', 'population', 'these', 'challenges', 'range', 'from', 'climate', 'change', 'pollution', 'transportation', 'and', 'citizen', 'engagement', 'to', 'urban', 'planning', 'and', 'security', 'threats', 'the', 'primary', 'goal', 'of', 'a', 'smart', 'city', 'is', 'to', 'counteract', 'these', 'problems', 'and', 'mitigate', 'their', 'effects', 'by', 'means', 'of', 'modern', 'ict', 'to', 'improve', 'urban', 'administration', 'and', 'infrastructure', 'key', 'ideas', 'are', 'to', 'utilise', 'network', 'communication', 'to', 'interconnect', 'public', 'authorities', 'but', 'also', 'to', 'deploy', 'and', 'integrate', 'numerous', 'sensors', 'and', 'actuators', 'throughout', 'the', 'city', 'infrastructure', 'which', 'is', 'also', 'widely', 'known', 'as', 'the', 'internet', 'of', 'things', 'iot', 'thus', 'iot', 'technologies', 'will', 'be', 'an', 'integral', 'part', 'and', 'key', 'enabler', 'to', 'achieve', 'many', 'objectives', 'of', 'the', 'smart', 'city', 'vision', 'the', 'contributions', 'of', 'this', 'paper', 'are', 'as', 'follows', 'we', 'first', 'examine', 'a', 'number', 'of', 'iot', 'platforms', 'technologies', 'and', 'network', 'standards', 'that', 'can', 'help', 'to', 'foster', 'a', 'smart', 'city', 'environment', 'second', 'we', 'introduce', 'the', 'eu', 'project', 'monica', 'which', 'aims', 'for', 'demonstration', 'of', 'largescale', 'iot', 'deployments', 'at', 'public', 'innercity', 'events', 'and', 'give', 'an', 'overview', 'on', 'its', 'iot', 'platform', 'architecture', 'and', 'third', 'we', 'provide', 'a', 'casestudy', 'report', 'on', 'smartcity', 'activities', 'by', 'the', 'city', 'of', 'hamburg', 'and', 'provide', 'insights', 'on', 'recent', 'ongoing', 'field', 'tests', 'of', 'a', 'vertically', 'integrated', 'endtoend', 'iot', 'sensor', 'application']]
|
[-0.14711216137401678, 0.04409891625446233, -0.018994780203696632, 0.03971306771503478, -0.11496850149920597, -0.12131043031064939, 0.04644161248381125, 0.34934407746857077, -0.2405975474525363, -0.3636844156627556, 0.16790356112736352, -0.31104833174852037, -0.19544861914213396, 0.24995840701364702, -0.20082223123531737, 0.0421735029450343, 0.048066928340036265, -0.04032721780192253, 0.06672474393548126, -0.2916861499395771, 0.2952475943345113, 0.06119610559761799, 0.38586982797449326, 0.12238246833901285, 0.058736753069274214, -0.05680975731470824, -0.07670602307081961, -0.064475409318811, -0.08833217464537228, 0.20680242271295615, 0.42417748955031215, 0.24408226084899723, 0.3839067001548094, -0.4966535487722966, -0.2007721877208383, 0.05492210958618671, 0.14759600981731988, 0.018150392222359844, -0.051437362553744925, -0.354692531101543, 0.06380628105167145, -0.2752297681333574, -0.16514240083937032, -0.03978496780704861, 0.018816864985461916, 0.04880783790164554, -0.2036642643734641, -0.06607476101940378, -0.057723670809482513, 0.12992685916940874, -0.018893130367711907, -0.07721087119589272, -0.00013816355585983273, 0.2482989711390834, 0.028771628619253222, -0.004322534053122908, 0.21481822299436248, -0.14131813380418748, -0.15472609999113232, 0.3855891912780736, 0.04638141706614854, -0.06792209850203607, 0.17219348067110876, -0.03826273264243237, -0.15199101575723237, -0.00047742670363304525, 0.3072309853153117, 0.004052279860533405, -0.22970084001391713, 0.012612441012791136, 0.04959351068989198, 0.14663561939128808, 0.01598074022907987, 0.04738875074003081, 0.2468929508326389, 0.259986393591432, 0.18684398380300235, 0.05746586329769343, -0.0634088284955124, -0.1172597247228447, -0.19843902200737257, -0.17460436866863327, -0.14559875885646978, 0.027836735555601698, -0.054397884031279174, -0.11631950816302668, 0.3696285159056706, 0.22902860085818968, 0.07190381713138576, 0.020746130365363328, 0.3839527208117708, -0.02972875025728503, 0.13173554464638199, 0.10051595639493231, 0.14371250747394004, -0.0070696337739878, 0.28911418665344246, -0.1266912970680385, 0.08649373615658434, -0.017982163447200016]
|
1,803.06855
|
Einstein@Home discovers a radio-quiet gamma-ray millisecond pulsar
|
Millisecond pulsars (MSPs) are old neutron stars that spin hundreds of times
per second and appear to pulsate as their emission beams cross our line of
sight. To date, radio pulsations have been detected from all rotation-powered
MSPs. In an attempt to discover radio-quiet gamma-ray MSPs, we used the
aggregated power from the computers of tens of thousands of volunteers
participating in the Einstein@Home distributed computing project to search for
pulsations from unidentified gamma-ray sources in Fermi Large Area Telescope
data. This survey discovered two isolated MSPs, one of which is the only known
rotation-powered MSP to remain undetected in radio observations. These
gamma-ray MSPs were discovered in completely blind searches without prior
constraints from other observations, raising hopes for detecting MSPs from a
predicted Galactic bulge population.
|
astro-ph.HE
|
millisecond pulsars msps are old neutron stars that spin hundreds of times per second and appear to pulsate as their emission beams cross our line of sight to date radio pulsations have been detected from all rotationpowered msps in an attempt to discover radioquiet gammaray msps we used the aggregated power from the computers of tens of thousands of volunteers participating in the einsteinhome distributed computing project to search for pulsations from unidentified gammaray sources in fermi large area telescope data this survey discovered two isolated msps one of which is the only known rotationpowered msp to remain undetected in radio observations these gammaray msps were discovered in completely blind searches without prior constraints from other observations raising hopes for detecting msps from a predicted galactic bulge population
|
[['millisecond', 'pulsars', 'msps', 'are', 'old', 'neutron', 'stars', 'that', 'spin', 'hundreds', 'of', 'times', 'per', 'second', 'and', 'appear', 'to', 'pulsate', 'as', 'their', 'emission', 'beams', 'cross', 'our', 'line', 'of', 'sight', 'to', 'date', 'radio', 'pulsations', 'have', 'been', 'detected', 'from', 'all', 'rotationpowered', 'msps', 'in', 'an', 'attempt', 'to', 'discover', 'radioquiet', 'gammaray', 'msps', 'we', 'used', 'the', 'aggregated', 'power', 'from', 'the', 'computers', 'of', 'tens', 'of', 'thousands', 'of', 'volunteers', 'participating', 'in', 'the', 'einsteinhome', 'distributed', 'computing', 'project', 'to', 'search', 'for', 'pulsations', 'from', 'unidentified', 'gammaray', 'sources', 'in', 'fermi', 'large', 'area', 'telescope', 'data', 'this', 'survey', 'discovered', 'two', 'isolated', 'msps', 'one', 'of', 'which', 'is', 'the', 'only', 'known', 'rotationpowered', 'msp', 'to', 'remain', 'undetected', 'in', 'radio', 'observations', 'these', 'gammaray', 'msps', 'were', 'discovered', 'in', 'completely', 'blind', 'searches', 'without', 'prior', 'constraints', 'from', 'other', 'observations', 'raising', 'hopes', 'for', 'detecting', 'msps', 'from', 'a', 'predicted', 'galactic', 'bulge', 'population']]
|
[-0.10589379168231972, 0.15847527067410283, -0.02857298351773352, 0.18167892160272459, -0.2281121349933528, -0.10537845381622901, 0.1316976669993437, 0.3994963575314614, -0.1848778239072999, -0.4251397947227815, 0.03234945508575038, -0.38902790774682217, 0.018243990610699257, 0.3206380936080677, 0.002112162677804008, -0.00459856197994668, 0.09055032108153682, -0.07657057001051726, 0.016326067716363468, -0.29152823709864606, 0.22091232210459566, 0.07205391528259497, 0.11955361357468064, -0.12564163114984694, 0.06473976311553997, -0.13130838327560923, -0.07870872807689011, -0.11850505901384167, -0.036153293191375724, 0.07183515637370874, 0.362250111742469, 0.1702228569356521, 0.14878433506237343, -0.40524713356717257, -0.21928385236606118, 0.14815850302056788, 0.21688619173073675, 0.020578279097207997, -0.06251465319655836, -0.33662895615816524, 0.07044710290756484, -0.23564319732759031, -0.20422797613173316, 0.06451597826526267, 0.0332678974045848, 0.09993848008161876, -0.03985434815217559, 0.0758890383040125, 0.01981502719081618, 0.06563464218197623, -0.142801502724069, -0.12445949346147245, 0.06133331036198797, 0.07268117287094356, 0.09875307311267534, 0.03512031986247166, 0.12153376849164488, -0.1425815545644582, -0.17288056031247834, 0.35327338505885564, -2.561694236646872e-05, 0.05977977045949956, 0.17130268626715406, -0.24216278584390238, -0.30436085383007594, 0.20233263298086968, 0.2121480242058169, 0.1325745359499706, -0.2348702972085448, -0.03202636678042836, -0.028726165157422656, 0.2523305746508413, 0.06207221395743545, 0.06244965726727969, 0.38720362416643184, 0.11840258602751419, 0.04190008790283173, 0.10688639201589467, -0.3402878752531251, -0.00620588423407753, -0.17440325021379977, -0.028968721786441165, -0.16101484878981864, 0.15544890921592014, -0.008625347454540133, -0.09316120414177931, 0.3654844997145119, 0.0955672533455072, 0.11265112948422029, 0.04852091622774424, 0.32717015880916733, 0.04099875714746304, 0.15707326830147395, 0.1807298160274513, 0.35400711547845276, 0.1462090723161964, 0.09029963212742587, -0.1400675526622308, 0.09834914921475502, -0.10515641911479179]
|
1,803.06856
|
Ultrafast Photodynamics of Glucose
|
We have investigated the photodynamics of $\beta$-D-glucose employing our
field-induced surface hopping method (FISH), which allows us to simulate the
coupled electron-nuclear dynamics, including explicitly nonadiabatic effects
and light-induced excitation. Our results reveal that from the initially
populated S$_{1}$ and S$_{2}$ states, glucose returns nonradiatively to the
ground state within about 200 fs. This takes place mainly via conical
intersections (CIs) whose geometries in most cases involve the elongation of a
single O-H bond, while in some instances ring-opening due to dissociation of a
C-O bond is observed. Experimentally, excitation to a distinct excited
electronic state is improbable due to the presence of a dense manifold of
states bearing similar oscillator strengths. Our FISH simulations explicitly
including a UV laser pulse of 6.43 eV photon energy reveals that after initial
excitation the population is almost equally spread over several close-lying
electronic states. This is followed by a fast nonradiative decay on the time
scale of 100-200 fs, with the final return to the ground state proceeding via
the S$_{1}$ state through the same types of CIs as observed in the field-free
simulations.
|
physics.chem-ph
|
we have investigated the photodynamics of betadglucose employing our fieldinduced surface hopping method fish which allows us to simulate the coupled electronnuclear dynamics including explicitly nonadiabatic effects and lightinduced excitation our results reveal that from the initially populated s_1 and s_2 states glucose returns nonradiatively to the ground state within about 200 fs this takes place mainly via conical intersections cis whose geometries in most cases involve the elongation of a single oh bond while in some instances ringopening due to dissociation of a co bond is observed experimentally excitation to a distinct excited electronic state is improbable due to the presence of a dense manifold of states bearing similar oscillator strengths our fish simulations explicitly including a uv laser pulse of 643 ev photon energy reveals that after initial excitation the population is almost equally spread over several closelying electronic states this is followed by a fast nonradiative decay on the time scale of 100200 fs with the final return to the ground state proceeding via the s_1 state through the same types of cis as observed in the fieldfree simulations
|
[['we', 'have', 'investigated', 'the', 'photodynamics', 'of', 'betadglucose', 'employing', 'our', 'fieldinduced', 'surface', 'hopping', 'method', 'fish', 'which', 'allows', 'us', 'to', 'simulate', 'the', 'coupled', 'electronnuclear', 'dynamics', 'including', 'explicitly', 'nonadiabatic', 'effects', 'and', 'lightinduced', 'excitation', 'our', 'results', 'reveal', 'that', 'from', 'the', 'initially', 'populated', 's_1', 'and', 's_2', 'states', 'glucose', 'returns', 'nonradiatively', 'to', 'the', 'ground', 'state', 'within', 'about', '200', 'fs', 'this', 'takes', 'place', 'mainly', 'via', 'conical', 'intersections', 'cis', 'whose', 'geometries', 'in', 'most', 'cases', 'involve', 'the', 'elongation', 'of', 'a', 'single', 'oh', 'bond', 'while', 'in', 'some', 'instances', 'ringopening', 'due', 'to', 'dissociation', 'of', 'a', 'co', 'bond', 'is', 'observed', 'experimentally', 'excitation', 'to', 'a', 'distinct', 'excited', 'electronic', 'state', 'is', 'improbable', 'due', 'to', 'the', 'presence', 'of', 'a', 'dense', 'manifold', 'of', 'states', 'bearing', 'similar', 'oscillator', 'strengths', 'our', 'fish', 'simulations', 'explicitly', 'including', 'a', 'uv', 'laser', 'pulse', 'of', '643', 'ev', 'photon', 'energy', 'reveals', 'that', 'after', 'initial', 'excitation', 'the', 'population', 'is', 'almost', 'equally', 'spread', 'over', 'several', 'closelying', 'electronic', 'states', 'this', 'is', 'followed', 'by', 'a', 'fast', 'nonradiative', 'decay', 'on', 'the', 'time', 'scale', 'of', '100200', 'fs', 'with', 'the', 'final', 'return', 'to', 'the', 'ground', 'state', 'proceeding', 'via', 'the', 's_1', 'state', 'through', 'the', 'same', 'types', 'of', 'cis', 'as', 'observed', 'in', 'the', 'fieldfree', 'simulations']]
|
[-0.11031209692894095, 0.19735574808475967, -0.05853217036221485, 0.053554559549707816, 0.03758004140520458, -0.11986793310237401, 0.08168926798591894, 0.41107862496758857, -0.2339516939365084, -0.28785742935370806, 0.021107415004262896, -0.27409514379972216, -0.059448249932013204, 0.17168186203890495, 0.05135692784547271, -0.003747529722621551, 0.07092284233288747, -0.008884980753630152, -0.01346399127737264, -0.18283886877119312, 0.27838395898184065, 0.04994823798766869, 0.2764752738085159, 0.07421358779474105, 0.08214689128728614, -0.019176251491665512, 0.07527061703599454, -0.05348893183531172, -0.12146569269000827, 0.08660922598933739, 0.23969241995390156, 0.027939015423791555, 0.2331317816886701, -0.45946378875986893, -0.20003946590654098, 0.05028677103238294, 0.14284745653710476, 0.16957015383188503, -0.00889728565955051, -0.3100667750071837, 0.011022192706451725, -0.14009678707257406, -0.12148142691948631, -0.052233888640310304, 0.03374757180221955, 0.022563663094873072, -0.23864529188272146, 0.10292088855006501, 0.01006510961564124, 0.03227006295665028, -0.09364033816028541, -0.09751783582659758, -0.11188943591612026, 0.09337886690692102, 0.04666936241646004, 0.04104351667810787, 0.19326105822927386, -0.07860082316145466, -0.10344883028703397, 0.37590903395051084, -0.05553367014688784, -0.10345346516111444, 0.20154243850699774, -0.14671380473403722, -0.08883178950794227, 0.2409464653841225, 0.09706072235937895, 0.13131385575979948, -0.09384936641243116, 0.018613404925598747, 0.011652457213945151, 0.1889689011532731, 0.09303735288307688, 0.05403381384759936, 0.18365725861522703, 0.14983574310780723, 0.04677085361497487, 0.15310886571568422, -0.14916968364165634, -0.14635034613774378, -0.23760098046288716, -0.1055524890061509, -0.1723373800809418, 0.09923032998205136, -0.028856729203417062, -0.13959913041432342, 0.4547951255374439, 0.08958605431195205, 0.1991953680597925, -0.02449780753209096, 0.2530093463703743, 0.08313064879573141, 0.0358183727630553, 0.05149574682517852, 0.23764710145624926, 0.13798419932207062, 0.05015341366206435, -0.2918373044690848, 0.08541330598932768, -0.01118194195313266]
|
1,803.06857
|
Anomalous heat equation in a system connected to thermal reservoirs
|
We study anomalous transport in a one-dimensional system with two conserved
quantities in presence of thermal baths. In this system we derive exact
expressions of the temperature profile and the two point correlations in steady
state as well as in the non-stationary state where the later describes the
relaxation to the steady state. In contrast to the Fourier heat equation in the
diffusive case, here we show that the evolution of the temperature profile is
governed by a non-local anomalous heat equation. We provide numerical
verifications of our results.
|
cond-mat.stat-mech math-ph math.MP nlin.CD
|
we study anomalous transport in a onedimensional system with two conserved quantities in presence of thermal baths in this system we derive exact expressions of the temperature profile and the two point correlations in steady state as well as in the nonstationary state where the later describes the relaxation to the steady state in contrast to the fourier heat equation in the diffusive case here we show that the evolution of the temperature profile is governed by a nonlocal anomalous heat equation we provide numerical verifications of our results
|
[['we', 'study', 'anomalous', 'transport', 'in', 'a', 'onedimensional', 'system', 'with', 'two', 'conserved', 'quantities', 'in', 'presence', 'of', 'thermal', 'baths', 'in', 'this', 'system', 'we', 'derive', 'exact', 'expressions', 'of', 'the', 'temperature', 'profile', 'and', 'the', 'two', 'point', 'correlations', 'in', 'steady', 'state', 'as', 'well', 'as', 'in', 'the', 'nonstationary', 'state', 'where', 'the', 'later', 'describes', 'the', 'relaxation', 'to', 'the', 'steady', 'state', 'in', 'contrast', 'to', 'the', 'fourier', 'heat', 'equation', 'in', 'the', 'diffusive', 'case', 'here', 'we', 'show', 'that', 'the', 'evolution', 'of', 'the', 'temperature', 'profile', 'is', 'governed', 'by', 'a', 'nonlocal', 'anomalous', 'heat', 'equation', 'we', 'provide', 'numerical', 'verifications', 'of', 'our', 'results']]
|
[-0.16362352413386944, 0.12968858972380168, -0.10679799910592899, 0.02449098876101917, 0.007624245588824655, -0.10300363119942753, 0.017977231778623013, 0.31642459245042853, -0.2680970258210273, -0.25802224901703635, 0.09996574033663891, -0.3141120637065909, -0.12485349347051024, 0.19529991253969795, 0.035346002794090614, 0.07026607750161562, 0.008624107922228534, 0.031066388302820137, -0.07843592278973273, -0.15871767713845278, 0.3411707523163785, 0.008572224391561545, 0.28339688180098205, 0.06114913820383254, 0.08962282357904851, -0.03129537478403262, 0.0181324499230204, 0.03530943845764974, -0.15475505991523963, 0.00499164569976457, 0.21132001909688952, 0.004274397962883617, 0.19615861541706692, -0.45939916650649537, -0.24561838511628717, 0.06986992556099476, 0.14235422458876384, 0.16350729658864857, -0.03782938684472877, -0.2408951982787779, -0.02372251537869151, -0.15859272752710607, -0.17667138313330458, -0.09162987309267347, 0.01763335765297577, 0.0502346467378476, -0.23584928397047386, 0.20412256917131416, 0.0859768406443528, 0.005743529951053389, -0.14024211627985822, -0.07564868258699524, -0.01851379151424665, 0.11644404509178038, 0.046160389363158784, -0.040033378892086365, 0.11381834938996628, -0.17116975584172048, -0.08976719296129232, 0.3235661931900998, -0.17181835446527668, -0.22987539490705797, 0.19398537874117158, -0.21226492174116246, -0.09626485968238851, 0.09966495693818236, 0.14365508658497522, 0.12098816515527289, -0.2156590667940425, 0.04593216049618328, -0.03734629565661543, 0.1211913737764038, -0.00864154797340377, 0.02542306370300691, 0.17076703963612908, 0.17435043882787898, 0.03706146676218911, 0.22170242336787954, -0.06534667230430949, -0.15436558626341015, -0.3293135209490409, -0.19922298261388258, -0.2005518629749337, 0.09789582980754838, -0.05942324068108861, -0.16386171223156237, 0.4139324834758646, 0.19485427590945129, 0.19570258268144694, 0.0018112178724468424, 0.2797979262102856, 0.21199401332395088, -0.04761473388212283, 0.14310299650650848, 0.2240425114090858, 0.15983436219237243, 0.1685008884308169, -0.33652053872814003, 0.049678809479077796, 0.05570868690487709]
|
1,803.06858
|
An improved isomorphism test for bounded-tree-width graphs
|
We give a new fpt algorithm testing isomorphism of $n$-vertex graphs of tree
width $k$ in time $2^{k\operatorname{polylog} (k)}\operatorname{poly} (n)$,
improving the fpt algorithm due to Lokshtanov, Pilipczuk, Pilipczuk, and
Saurabh (FOCS 2014), which runs in time $2^{\mathcal{O}(k^5\log
k)}\operatorname{poly} (n)$. Based on an improved version of the
isomorphism-invariant graph decomposition technique introduced by Lokshtanov et
al., we prove restrictions on the structure of the automorphism groups of
graphs of tree width $k$. Our algorithm then makes heavy use of the group
theoretic techniques introduced by Luks (JCSS 1982) in his isomorphism test for
bounded degree graphs and Babai (STOC 2016) in his quasipolynomial isomorphism
test. In fact, we even use Babai's algorithm as a black box in one place.
We also give a second algorithm which, at the price of a slightly worse
running time $2^{\mathcal{O}(k^2 \log k)}\operatorname{poly} (n)$, avoids the
use of Babai's algorithm and, more importantly, has the additional benefit that
it can also used as a canonization algorithm.
|
cs.DS cs.DM math.CO
|
we give a new fpt algorithm testing isomorphism of nvertex graphs of tree width k in time 2koperatornamepolylog koperatornamepoly n improving the fpt algorithm due to lokshtanov pilipczuk pilipczuk and saurabh focs 2014 which runs in time 2mathcalok5log koperatornamepoly n based on an improved version of the isomorphisminvariant graph decomposition technique introduced by lokshtanov et al we prove restrictions on the structure of the automorphism groups of graphs of tree width k our algorithm then makes heavy use of the group theoretic techniques introduced by luks jcss 1982 in his isomorphism test for bounded degree graphs and babai stoc 2016 in his quasipolynomial isomorphism test in fact we even use babais algorithm as a black box in one place we also give a second algorithm which at the price of a slightly worse running time 2mathcalok2 log koperatornamepoly n avoids the use of babais algorithm and more importantly has the additional benefit that it can also used as a canonization algorithm
|
[['we', 'give', 'a', 'new', 'fpt', 'algorithm', 'testing', 'isomorphism', 'of', 'nvertex', 'graphs', 'of', 'tree', 'width', 'k', 'in', 'time', '2koperatornamepolylog', 'koperatornamepoly', 'n', 'improving', 'the', 'fpt', 'algorithm', 'due', 'to', 'lokshtanov', 'pilipczuk', 'pilipczuk', 'and', 'saurabh', 'focs', '2014', 'which', 'runs', 'in', 'time', '2mathcalok5log', 'koperatornamepoly', 'n', 'based', 'on', 'an', 'improved', 'version', 'of', 'the', 'isomorphisminvariant', 'graph', 'decomposition', 'technique', 'introduced', 'by', 'lokshtanov', 'et', 'al', 'we', 'prove', 'restrictions', 'on', 'the', 'structure', 'of', 'the', 'automorphism', 'groups', 'of', 'graphs', 'of', 'tree', 'width', 'k', 'our', 'algorithm', 'then', 'makes', 'heavy', 'use', 'of', 'the', 'group', 'theoretic', 'techniques', 'introduced', 'by', 'luks', 'jcss', '1982', 'in', 'his', 'isomorphism', 'test', 'for', 'bounded', 'degree', 'graphs', 'and', 'babai', 'stoc', '2016', 'in', 'his', 'quasipolynomial', 'isomorphism', 'test', 'in', 'fact', 'we', 'even', 'use', 'babais', 'algorithm', 'as', 'a', 'black', 'box', 'in', 'one', 'place', 'we', 'also', 'give', 'a', 'second', 'algorithm', 'which', 'at', 'the', 'price', 'of', 'a', 'slightly', 'worse', 'running', 'time', '2mathcalok2', 'log', 'koperatornamepoly', 'n', 'avoids', 'the', 'use', 'of', 'babais', 'algorithm', 'and', 'more', 'importantly', 'has', 'the', 'additional', 'benefit', 'that', 'it', 'can', 'also', 'used', 'as', 'a', 'canonization', 'algorithm']]
|
[-0.11593025319994416, 0.04771506417142242, -0.12913635522834485, 0.06640306390789515, -0.11161497075853374, -0.1808443992145218, 0.11879613427327404, 0.35763407064177377, -0.24575906050910207, -0.41318580044339165, 0.08470784228359926, -0.2245793385266126, -0.1727381946174192, 0.1798972035198225, -0.12916112238470512, 0.06673068898918602, 0.0754298756747872, 0.009680274711874656, 0.022171769285268043, -0.38933633294349235, 0.2274690481798747, 0.08316678641646912, 0.17950218967073656, 0.0751183179613863, 0.08958355992549111, 0.0727045243205149, -0.03603030933963158, 0.010883821076507197, -0.16749373613732396, 0.057435239364593466, 0.23363389680162072, 0.18208043281831837, 0.26737353822387333, -0.35873190673728345, -0.09882146355849278, 0.15529949210961408, 0.12834287079086504, 0.07723270580275692, -0.003902763464724604, -0.27647527825983265, 0.08163874734876843, -0.12710230779486686, -0.07269175105899148, -0.019419913687094857, 0.09707118935670846, -0.05581737119598385, -0.2638641489375695, 0.01633006506975257, 0.1529127852696501, 0.024269354930501197, 0.0506356904825455, -0.16094764645647588, 0.0416713839306944, 0.043069764562805854, -0.07322687556660629, 0.09191276668865658, 0.025920089944324726, -0.04760725519110012, -0.2297894072783757, 0.32792177750681867, -0.05069929887717472, -0.09188855867803426, 0.10498054570052773, -0.05660322051542469, -0.23128680020859582, 0.11693827886299431, 0.16284606923478878, 0.17542341416937451, -0.04655130338874245, 0.21289786265439448, -0.12201341255597441, 0.1477943503694267, 0.18493059206801124, -0.06847573362609159, -0.004154193726047001, 0.13133800609768193, 0.12807190869905385, 0.16031719786203408, 0.03495674932676167, -0.014077300723432858, -0.21956951146403067, -0.14987720151968253, -0.19181387355297663, 0.035602920255446924, -0.16221384976703535, -0.15930468301786865, 0.3698485019451738, 0.15382116707926027, 0.1838823805115174, 0.15105402429405412, 0.24497100626283524, 0.045558262120525626, 0.010353860513106742, 0.20803211479082326, 0.13928060859362182, 0.1521534394690932, 0.060738292331158926, -0.1917008264227903, 0.08473572537414965, 0.19941312387684004]
|
1,803.06859
|
Approximation of non-archimedean Lyapunov exponents and applications
over global fields
|
Let $K$ be an algebraically closed field of characteristic 0 that is complete
with respect to a non-archimedean absolute value. We establish a locally
uniform approximation formula of the Lyapunov exponent of a rational map $f$ of
$\mathbb{P}^1$ of degree $d>1$ over $K$, in terms of the multipliers of
$n$-periodic points of $f$, with an explicit control in terms of $n$, $f$ and
$K$. As an immediate consequence, we obtain an estimate for the blow-up of the
Lyapunov exponent near a pole in one-dimensional families of rational maps over
$K$. Combined with our former archimedean version, this non-archimedean
quantitative approximation allows us to show:
- a quantified version of Silverman's and Ingram's recent comparison between
the critical height and any ample height on the moduli space
$\mathcal{M}_d(\bar{\mathbb{Q}})$,
- two improvements of McMullen's finiteness of the multiplier maps: reduction
to multipliers of cycles of exact given period and an effective bound from
below on the period,
- a characterization of non-affine isotrivial rational maps defined over the
function field $\mathbb{C}(X)$ of a normal projective variety $X$ in terms of
the growth of the degree of the multipliers.
|
math.DS math.NT
|
let k be an algebraically closed field of characteristic 0 that is complete with respect to a nonarchimedean absolute value we establish a locally uniform approximation formula of the lyapunov exponent of a rational map f of mathbbp1 of degree d1 over k in terms of the multipliers of nperiodic points of f with an explicit control in terms of n f and k as an immediate consequence we obtain an estimate for the blowup of the lyapunov exponent near a pole in onedimensional families of rational maps over k combined with our former archimedean version this nonarchimedean quantitative approximation allows us to show a quantified version of silvermans and ingrams recent comparison between the critical height and any ample height on the moduli space mathcalm_dbarmathbbq two improvements of mcmullens finiteness of the multiplier maps reduction to multipliers of cycles of exact given period and an effective bound from below on the period a characterization of nonaffine isotrivial rational maps defined over the function field mathbbcx of a normal projective variety x in terms of the growth of the degree of the multipliers
|
[['let', 'k', 'be', 'an', 'algebraically', 'closed', 'field', 'of', 'characteristic', '0', 'that', 'is', 'complete', 'with', 'respect', 'to', 'a', 'nonarchimedean', 'absolute', 'value', 'we', 'establish', 'a', 'locally', 'uniform', 'approximation', 'formula', 'of', 'the', 'lyapunov', 'exponent', 'of', 'a', 'rational', 'map', 'f', 'of', 'mathbbp1', 'of', 'degree', 'd1', 'over', 'k', 'in', 'terms', 'of', 'the', 'multipliers', 'of', 'nperiodic', 'points', 'of', 'f', 'with', 'an', 'explicit', 'control', 'in', 'terms', 'of', 'n', 'f', 'and', 'k', 'as', 'an', 'immediate', 'consequence', 'we', 'obtain', 'an', 'estimate', 'for', 'the', 'blowup', 'of', 'the', 'lyapunov', 'exponent', 'near', 'a', 'pole', 'in', 'onedimensional', 'families', 'of', 'rational', 'maps', 'over', 'k', 'combined', 'with', 'our', 'former', 'archimedean', 'version', 'this', 'nonarchimedean', 'quantitative', 'approximation', 'allows', 'us', 'to', 'show', 'a', 'quantified', 'version', 'of', 'silvermans', 'and', 'ingrams', 'recent', 'comparison', 'between', 'the', 'critical', 'height', 'and', 'any', 'ample', 'height', 'on', 'the', 'moduli', 'space', 'mathcalm_dbarmathbbq', 'two', 'improvements', 'of', 'mcmullens', 'finiteness', 'of', 'the', 'multiplier', 'maps', 'reduction', 'to', 'multipliers', 'of', 'cycles', 'of', 'exact', 'given', 'period', 'and', 'an', 'effective', 'bound', 'from', 'below', 'on', 'the', 'period', 'a', 'characterization', 'of', 'nonaffine', 'isotrivial', 'rational', 'maps', 'defined', 'over', 'the', 'function', 'field', 'mathbbcx', 'of', 'a', 'normal', 'projective', 'variety', 'x', 'in', 'terms', 'of', 'the', 'growth', 'of', 'the', 'degree', 'of', 'the', 'multipliers']]
|
[-0.21053421081208434, 0.05155016475291833, -0.11227928389645907, 0.019940861732343943, -0.03129176644014081, -0.08892340532334223, 0.05354282993164675, 0.29666935201497613, -0.3112175297815332, -0.2176362136716553, 0.07265636451974593, -0.2374671874092718, -0.11522773664363645, 0.2656610991023687, -0.07875283661385926, 0.004053592248382407, -0.040186103047463444, 0.11194536270566018, -0.1250636407073834, -0.30580183712299913, 0.3309033663598666, -0.010977287632696207, 0.19915061386415314, 0.04534066340934938, 0.12383981302859087, 0.038631472453920075, 0.006347270927826735, 0.00667240930761684, -0.2055802648665222, 0.14071175979851688, 0.25668459131449295, 0.07281047835410959, 0.2451170017207633, -0.34310540866662453, -0.15956435192026486, 0.20619028413061113, 0.1429241690897249, -0.010789904475870712, 0.01948164181670596, -0.24387854282121632, 0.109292035115219, -0.1211703371680123, -0.20112699372127898, -0.06470430287846379, 0.07788037344972855, 0.06400527330842229, -0.304415053163156, 0.008472150369985955, 0.10436000167366467, 0.20207100852459506, -0.09142085874372147, -0.11430953683856443, -0.03868010390462426, 0.0744601253198861, 0.005879923087693957, 0.11512689348773321, 0.08253443489756142, -0.10083163558062969, -0.09889181544335343, 0.2969470824891938, -0.13798291115759156, -0.18397719079618297, 0.1314131441932604, -0.1656889027519697, -0.06077851461328936, 0.17994361365013317, 0.1377551092236246, 0.16535313087657033, -0.03428229687539912, 0.18057960875265464, -0.11027607988586742, 0.1433214673009323, 0.09164396339502617, -0.008496539914229297, 0.13783472861183899, 0.059506547632138376, 0.17910548561453327, 0.1473380546733539, -0.022531426182397493, -0.05810156536612721, -0.381906958080787, -0.19352873622212116, -0.14393188412435023, 0.1450767407903849, -0.1683228942356587, -0.21262941627572832, 0.4225730511478215, 0.0630085071013695, 0.22973450548555804, 0.12526720491860535, 0.217873670767931, 0.1265009399278357, 0.022496911079155857, 0.03798704424060017, 0.12761700632776138, 0.2138049402981688, -0.010599440008077709, -0.1757435808176926, 0.02612361553908475, 0.15857194457460422]
|
1,803.0686
|
Combined readout of a triple-GEM detector
|
Optical readout of GEM based devices by means of high granularity and low
noise CMOS sensors allows to obtain very interesting tracking performance.
Space resolution of the order of tens of $\mu$m were measured on the GEM plane
along with an energy resolution of 20%$\div$30%. The main limitation of CMOS
sensors is represented by their poor information about time structure of the
event. In this paper, the use of a concurrent light readout by means of a
suitable photomultiplier and the acquisition of the electric signal induced on
the GEM electrode are exploited to provide the necessary timing informations.
The analysis of the PMT waveform allows a 3D reconstruction of each single
clusters with a resolution on z of 100 $\mu$m. Moreover, from the PMT signals
it is possible to obtain a fast reconstruction of the energy released within
the detector with a resolution of the order of 25% even in the tens of keV
range useful, for example, for triggering purpose.
|
physics.ins-det hep-ex
|
optical readout of gem based devices by means of high granularity and low noise cmos sensors allows to obtain very interesting tracking performance space resolution of the order of tens of mum were measured on the gem plane along with an energy resolution of 20div30 the main limitation of cmos sensors is represented by their poor information about time structure of the event in this paper the use of a concurrent light readout by means of a suitable photomultiplier and the acquisition of the electric signal induced on the gem electrode are exploited to provide the necessary timing informations the analysis of the pmt waveform allows a 3d reconstruction of each single clusters with a resolution on z of 100 mum moreover from the pmt signals it is possible to obtain a fast reconstruction of the energy released within the detector with a resolution of the order of 25 even in the tens of kev range useful for example for triggering purpose
|
[['optical', 'readout', 'of', 'gem', 'based', 'devices', 'by', 'means', 'of', 'high', 'granularity', 'and', 'low', 'noise', 'cmos', 'sensors', 'allows', 'to', 'obtain', 'very', 'interesting', 'tracking', 'performance', 'space', 'resolution', 'of', 'the', 'order', 'of', 'tens', 'of', 'mum', 'were', 'measured', 'on', 'the', 'gem', 'plane', 'along', 'with', 'an', 'energy', 'resolution', 'of', '20div30', 'the', 'main', 'limitation', 'of', 'cmos', 'sensors', 'is', 'represented', 'by', 'their', 'poor', 'information', 'about', 'time', 'structure', 'of', 'the', 'event', 'in', 'this', 'paper', 'the', 'use', 'of', 'a', 'concurrent', 'light', 'readout', 'by', 'means', 'of', 'a', 'suitable', 'photomultiplier', 'and', 'the', 'acquisition', 'of', 'the', 'electric', 'signal', 'induced', 'on', 'the', 'gem', 'electrode', 'are', 'exploited', 'to', 'provide', 'the', 'necessary', 'timing', 'informations', 'the', 'analysis', 'of', 'the', 'pmt', 'waveform', 'allows', 'a', '3d', 'reconstruction', 'of', 'each', 'single', 'clusters', 'with', 'a', 'resolution', 'on', 'z', 'of', '100', 'mum', 'moreover', 'from', 'the', 'pmt', 'signals', 'it', 'is', 'possible', 'to', 'obtain', 'a', 'fast', 'reconstruction', 'of', 'the', 'energy', 'released', 'within', 'the', 'detector', 'with', 'a', 'resolution', 'of', 'the', 'order', 'of', '25', 'even', 'in', 'the', 'tens', 'of', 'kev', 'range', 'useful', 'for', 'example', 'for', 'triggering', 'purpose']]
|
[-0.0943228995217074, 0.0783872861967036, -0.03761649153756429, 0.0013755743937011553, -0.026464838433362867, -0.12357957540831951, 0.023430451544678498, 0.3957149417758543, -0.23117912455421427, -0.3965264115922199, 0.12508320326407826, -0.277209792329723, -0.033043749913897205, 0.2343147933694262, -0.074266195125149, 0.08750719355523401, 0.07944852363619005, 0.03757988870225598, -0.07760660876758593, -0.19949945702321642, 0.22004696125199336, 0.14485736757586276, 0.2661359372508267, 0.02149949065750893, 0.18949179930658722, 0.016135782298417934, -0.06419264667765787, -0.02498485215651074, -0.0934222388104391, 0.1385709705450919, 0.2552433578320634, 0.083501722904787, 0.2161900315777925, -0.444089791049128, -0.17985957043002482, 0.04021191664375596, 0.10564342211434467, 0.028937612025910317, -0.07934251248833625, -0.2747567950152092, 0.13829345332447046, -0.1625798472683437, -0.09706219926218702, -0.019329739213915346, -0.025883053024501904, 0.07507460472110358, -0.24451580586856209, 0.03497845750672292, 0.030449719559791734, 0.045045104496736335, -0.0415085124938137, -0.06302379771072117, 0.025292349771035384, 0.11391883683304146, -0.022698007764074928, 0.027120879337174227, 0.15669262677037754, -0.13378449351387967, -0.07644175860874633, 0.34711022336059105, -0.03975668131888653, -0.15420593337520308, 0.1833436483609843, -0.1837196010208301, -0.05304586800879666, 0.21162905610565627, 0.15642596166204917, 0.1064327198387303, -0.1935557201190169, 0.041007847532048614, 0.07859000406135452, 0.24572327658996818, 0.09837131893482082, 0.10212748006610951, 0.2248610498351826, 0.26994551130446104, 0.08763000085625959, 0.1494996976259205, -0.23150731999027943, 0.020125399927553717, -0.29733426744076397, -0.16730744648371934, -0.17164068897066764, 0.05834562401070335, -0.10156186228825549, -0.1280316136985647, 0.4441308466896924, 0.15257867711440007, 0.18917468086937847, -0.00752424757916087, 0.34529405710813793, 0.07509125248523232, 0.11307590529872162, -0.024485341065002154, 0.22712488936387604, 0.15197692068527968, 0.1561371192032571, -0.17783214580643666, 0.03303596223212825, -0.0027920472788514556]
|
1,803.06861
|
Analytical and numerical study of the non-linear noisy voter model on
complex networks
|
We study the noisy voter model using a specific non-linear dependence of the
rates that takes into account collective interaction between individuals. The
resulting model is solved exactly under the all-to-all coupling configuration
and approximately in some random networks environments. In the all-to-all setup
we find that the non-linear interactions induce "bona fide" phase transitions
that, contrary to the linear version of the model, survive in the thermodynamic
limit. The main effect of the complex network is to shift the transition lines
and modify the finite-size dependence, a modification that can be captured with
the introduction of an effective system size that decreases with the degree
heterogeneity of the network. While a non-trivial finite-size dependence of the
moments of the probability distribution is derived from our treatment,
mean-field exponents are nevertheless obtained in the thermodynamic limit.
These theoretical predictions are well confirmed by numerical simulations of
the stochastic process.
|
physics.soc-ph cond-mat.stat-mech
|
we study the noisy voter model using a specific nonlinear dependence of the rates that takes into account collective interaction between individuals the resulting model is solved exactly under the alltoall coupling configuration and approximately in some random networks environments in the alltoall setup we find that the nonlinear interactions induce bona fide phase transitions that contrary to the linear version of the model survive in the thermodynamic limit the main effect of the complex network is to shift the transition lines and modify the finitesize dependence a modification that can be captured with the introduction of an effective system size that decreases with the degree heterogeneity of the network while a nontrivial finitesize dependence of the moments of the probability distribution is derived from our treatment meanfield exponents are nevertheless obtained in the thermodynamic limit these theoretical predictions are well confirmed by numerical simulations of the stochastic process
|
[['we', 'study', 'the', 'noisy', 'voter', 'model', 'using', 'a', 'specific', 'nonlinear', 'dependence', 'of', 'the', 'rates', 'that', 'takes', 'into', 'account', 'collective', 'interaction', 'between', 'individuals', 'the', 'resulting', 'model', 'is', 'solved', 'exactly', 'under', 'the', 'alltoall', 'coupling', 'configuration', 'and', 'approximately', 'in', 'some', 'random', 'networks', 'environments', 'in', 'the', 'alltoall', 'setup', 'we', 'find', 'that', 'the', 'nonlinear', 'interactions', 'induce', 'bona', 'fide', 'phase', 'transitions', 'that', 'contrary', 'to', 'the', 'linear', 'version', 'of', 'the', 'model', 'survive', 'in', 'the', 'thermodynamic', 'limit', 'the', 'main', 'effect', 'of', 'the', 'complex', 'network', 'is', 'to', 'shift', 'the', 'transition', 'lines', 'and', 'modify', 'the', 'finitesize', 'dependence', 'a', 'modification', 'that', 'can', 'be', 'captured', 'with', 'the', 'introduction', 'of', 'an', 'effective', 'system', 'size', 'that', 'decreases', 'with', 'the', 'degree', 'heterogeneity', 'of', 'the', 'network', 'while', 'a', 'nontrivial', 'finitesize', 'dependence', 'of', 'the', 'moments', 'of', 'the', 'probability', 'distribution', 'is', 'derived', 'from', 'our', 'treatment', 'meanfield', 'exponents', 'are', 'nevertheless', 'obtained', 'in', 'the', 'thermodynamic', 'limit', 'these', 'theoretical', 'predictions', 'are', 'well', 'confirmed', 'by', 'numerical', 'simulations', 'of', 'the', 'stochastic', 'process']]
|
[-0.12831954780736338, 0.14019900115901032, -0.0869745227133999, 0.061394888542469175, -0.019731199600102518, -0.12176973808669304, 0.07771674713476143, 0.33992211212757223, -0.2525842583038213, -0.28553386628252747, 0.04780588164806816, -0.2885256827990181, -0.1797087216568523, 0.12944153293923494, 0.016066585217396286, 0.020565643653448595, 0.046793912360819694, 0.022299853841080363, -0.04896051214614121, -0.2159935782746343, 0.3078183752418989, 0.05531972389818238, 0.2903636481687927, 0.03876967967023773, 0.061978025027494506, 0.0077121600699329735, 0.02200164260723997, 0.06992859172559775, -0.10735755300290153, 0.042105730466744644, 0.17452376445750675, 0.05327616887629632, 0.2404316237990138, -0.42417077986436, -0.2398252960485125, 0.09956351701238961, 0.13808092354283505, 0.152982382780416, -0.001233245278146093, -0.2915060333813847, 0.053648182394095516, -0.17539693755435604, -0.14618006697777758, -0.07856467946888816, -0.006858739911284823, 0.04336085717542247, -0.29229897519904846, 0.11506338353208641, 0.07373008153310683, 0.044505839417344775, -0.04883408324496864, -0.0855737792026414, -0.040336549397707984, 0.15999590754337084, 0.03848382180373828, -0.00925762102714171, 0.1381677138390982, -0.14169553720943892, -0.08711935894176263, 0.3761889447126813, -0.0652744290497054, -0.18151405924968672, 0.16762772363598064, -0.14436348231709342, -0.13704785580540563, 0.13754451270496484, 0.17400554850097472, 0.0913881113652715, -0.16554809484830837, 0.06854403952071006, -0.02034593317595204, 0.18297894612179708, -0.017151211116512948, 0.031525434683945856, 0.16378121778693974, 0.17452227103761428, 0.016383892456507124, 0.155049495872082, -0.06730111594618167, -0.2017889211154324, -0.30294787907510395, -0.07417360497576078, -0.17939912877358097, 0.04719352419947152, -0.13933909551889773, -0.15316278499632374, 0.3830346670126755, 0.1862894531384137, 0.21712617238908505, 0.07878995018592416, 0.2580449057636695, 0.17548994699589934, 0.06439981204668535, 0.05116957061511508, 0.2588340286808104, 0.14390213127035473, 0.06195251889301826, -0.283802388375, 0.1068589839296753, 0.046434014215252846]
|
1,803.06862
|
Reconstruction of cosmic ray air showers with Tunka-Rex data using
template fitting of radio pulses
|
We present an improved method for the precise reconstruction of cosmic ray
air showers above $10^{17}$ eV with sparse radio arrays. The method is based on
the comparison of predictions for radio pulse shapes by CoREAS simulations to
measured pulses. We applied our method to the data of Tunka-Rex, a 1 km$^2$
radio array in Siberia operating in the frequency band of 30-80 MHz. Tunka-Rex
is triggered by the air-Cherenkov detector Tunka-133 and by scintillators
(Tunka-Grande). The instrument collects air-shower data since 2012. The present
paper describes updated data and signal analyses of Tunka-Rex and details of a
new method applied. After efficiency cuts, when Tunka-Rex reaches its full
efficiency, the energy resolution of about 10% given by the new method has
reached the limit of systematic uncertainties due to the calibration
uncertainty and shower-to-shower fluctuations. At the same time the shower
maximum reconstruction is significantly improved up to an accuracy of 35
g/cm$^2$ compared to the previous method based on the slope of the lateral
distribution. We also define and now achieved conditions of the measurements,
at which the shower maximum resolution of Tunka-Rex reaches a value of 25
g/cm$^2$ and becomes competitive to optical detectors. To check and validate
our reconstruction and efficiency cuts we compare individual events to the
reconstruction of Tunka-133. Furthermore, we compare the mean of shower maximum
as a function of primary energy to the measurements of other experiments.
|
astro-ph.IM astro-ph.HE
|
we present an improved method for the precise reconstruction of cosmic ray air showers above 1017 ev with sparse radio arrays the method is based on the comparison of predictions for radio pulse shapes by coreas simulations to measured pulses we applied our method to the data of tunkarex a 1 km2 radio array in siberia operating in the frequency band of 3080 mhz tunkarex is triggered by the aircherenkov detector tunka133 and by scintillators tunkagrande the instrument collects airshower data since 2012 the present paper describes updated data and signal analyses of tunkarex and details of a new method applied after efficiency cuts when tunkarex reaches its full efficiency the energy resolution of about 10 given by the new method has reached the limit of systematic uncertainties due to the calibration uncertainty and showertoshower fluctuations at the same time the shower maximum reconstruction is significantly improved up to an accuracy of 35 gcm2 compared to the previous method based on the slope of the lateral distribution we also define and now achieved conditions of the measurements at which the shower maximum resolution of tunkarex reaches a value of 25 gcm2 and becomes competitive to optical detectors to check and validate our reconstruction and efficiency cuts we compare individual events to the reconstruction of tunka133 furthermore we compare the mean of shower maximum as a function of primary energy to the measurements of other experiments
|
[['we', 'present', 'an', 'improved', 'method', 'for', 'the', 'precise', 'reconstruction', 'of', 'cosmic', 'ray', 'air', 'showers', 'above', '1017', 'ev', 'with', 'sparse', 'radio', 'arrays', 'the', 'method', 'is', 'based', 'on', 'the', 'comparison', 'of', 'predictions', 'for', 'radio', 'pulse', 'shapes', 'by', 'coreas', 'simulations', 'to', 'measured', 'pulses', 'we', 'applied', 'our', 'method', 'to', 'the', 'data', 'of', 'tunkarex', 'a', '1', 'km2', 'radio', 'array', 'in', 'siberia', 'operating', 'in', 'the', 'frequency', 'band', 'of', '3080', 'mhz', 'tunkarex', 'is', 'triggered', 'by', 'the', 'aircherenkov', 'detector', 'tunka133', 'and', 'by', 'scintillators', 'tunkagrande', 'the', 'instrument', 'collects', 'airshower', 'data', 'since', '2012', 'the', 'present', 'paper', 'describes', 'updated', 'data', 'and', 'signal', 'analyses', 'of', 'tunkarex', 'and', 'details', 'of', 'a', 'new', 'method', 'applied', 'after', 'efficiency', 'cuts', 'when', 'tunkarex', 'reaches', 'its', 'full', 'efficiency', 'the', 'energy', 'resolution', 'of', 'about', '10', 'given', 'by', 'the', 'new', 'method', 'has', 'reached', 'the', 'limit', 'of', 'systematic', 'uncertainties', 'due', 'to', 'the', 'calibration', 'uncertainty', 'and', 'showertoshower', 'fluctuations', 'at', 'the', 'same', 'time', 'the', 'shower', 'maximum', 'reconstruction', 'is', 'significantly', 'improved', 'up', 'to', 'an', 'accuracy', 'of', '35', 'gcm2', 'compared', 'to', 'the', 'previous', 'method', 'based', 'on', 'the', 'slope', 'of', 'the', 'lateral', 'distribution', 'we', 'also', 'define', 'and', 'now', 'achieved', 'conditions', 'of', 'the', 'measurements', 'at', 'which', 'the', 'shower', 'maximum', 'resolution', 'of', 'tunkarex', 'reaches', 'a', 'value', 'of', '25', 'gcm2', 'and', 'becomes', 'competitive', 'to', 'optical', 'detectors', 'to', 'check', 'and', 'validate', 'our', 'reconstruction', 'and', 'efficiency', 'cuts', 'we', 'compare', 'individual', 'events', 'to', 'the', 'reconstruction', 'of', 'tunka133', 'furthermore', 'we', 'compare', 'the', 'mean', 'of', 'shower', 'maximum', 'as', 'a', 'function', 'of', 'primary', 'energy', 'to', 'the', 'measurements', 'of', 'other', 'experiments']]
|
[-0.06332725544380856, 0.10218503301123534, -0.06993171524137576, 0.04118673817819341, -0.01822429029568237, -0.035979557369013336, 0.03782084479759586, 0.4310093669656743, -0.1924731854052144, -0.41846058879126896, 0.10973549896276537, -0.3071417619662478, -0.023739369548460905, 0.23064413088017163, -0.04464424162548273, 0.07410300979440279, 0.14814679606996, -0.017560244969865108, -0.08996359301839975, -0.20135501886500007, 0.18774575246299835, 0.23732725293078322, 0.310020614471881, 0.08551528257456549, 0.15661196397924598, -0.016159158458368496, -0.08655606521333152, -0.020496481051668524, -0.12104836662716054, 0.09557425092727422, 0.23165712893452556, 0.15231719458317186, 0.16930491719989382, -0.39634454924454715, -0.17306255911850926, 0.06669115717027416, 0.09463932812659744, 0.02099510960508772, -0.012478693367596319, -0.30124225713352254, 0.13196213382947694, -0.18512005673701618, -0.13423029756213123, 0.04908434988019314, -0.05071086061999519, 0.029635125245418902, -0.25126958265157534, 0.06331554386242134, -0.022093719409461667, 0.05617397698633214, -0.017606249284197358, -0.1592041668918063, 0.03363879799565419, 0.09630161223529363, 0.04048225766721558, 0.07194258183379598, 0.15098372706945273, -0.10456918032760633, -0.11051432150564691, 0.3456511562947739, -0.0726709418276206, -0.08549406839914848, 0.13834708621527286, -0.19200984549094388, -0.09509962775764313, 0.22341733500163288, 0.19021730210255594, 0.08070080816377935, -0.15363977012562596, 0.005635988942169129, 0.04390210985661821, 0.21708809740524343, 0.0703584056714193, -0.0060274622583900515, 0.17039408159164832, 0.2417321476575106, 0.11916973312048519, 0.1131565856185068, -0.22395535076750403, 0.041231435144993854, -0.2777135946728448, -0.08377845902156897, -0.19956343260375745, 0.018156333241928765, -0.09073602781046498, -0.09730899714334729, 0.45242257293393, 0.1942826045954481, 0.14005848180027083, 0.05487410344153722, 0.35144778974651497, 0.07581004429400522, 0.040861669172869715, 0.04860605262120829, 0.30180248026240697, 0.14900764572097266, 0.11965251311342767, -0.21776389316358466, 0.013429095415755155, -0.002977196848455896]
|
1,803.06863
|
Approximation property on entropies for surface diffeomorphisms
|
In this paper, we prove that for any $C^1$ surface diffeomorphism $f$ with
positive topological entropy, there exists a diffeomorphism $g$ arbitrarily
close (in the $C^1$ topology) to $f$ exhibiting a horseshoe $\Lambda$, such
that the topological entropy of $g$ restricted on $\Lambda$ can arbitrarily
approximate the topological entropy of $f$. This extends the Theorem
\cite[Theorem 1.1]{Gan} of Gan.
|
math.DS
|
in this paper we prove that for any c1 surface diffeomorphism f with positive topological entropy there exists a diffeomorphism g arbitrarily close in the c1 topology to f exhibiting a horseshoe lambda such that the topological entropy of g restricted on lambda can arbitrarily approximate the topological entropy of f this extends the theorem citetheorem 11gan of gan
|
[['in', 'this', 'paper', 'we', 'prove', 'that', 'for', 'any', 'c1', 'surface', 'diffeomorphism', 'f', 'with', 'positive', 'topological', 'entropy', 'there', 'exists', 'a', 'diffeomorphism', 'g', 'arbitrarily', 'close', 'in', 'the', 'c1', 'topology', 'to', 'f', 'exhibiting', 'a', 'horseshoe', 'lambda', 'such', 'that', 'the', 'topological', 'entropy', 'of', 'g', 'restricted', 'on', 'lambda', 'can', 'arbitrarily', 'approximate', 'the', 'topological', 'entropy', 'of', 'f', 'this', 'extends', 'the', 'theorem', 'citetheorem', '11gan', 'of', 'gan']]
|
[-0.26051795238564757, 0.14334335504099727, -0.11469847293056805, 0.05480184956405569, -0.036317084562675704, -0.20019993553708854, 0.05059429841188329, 0.307036021820687, -0.2870277603445896, -0.20853727325347476, 0.01020520784619168, -0.27453933232303324, -0.13537171913375115, 0.1508410532541316, -0.1341128926503408, 0.08337464992856157, 0.033975874234376285, 0.11899100423886858, -0.0989278001341455, -0.19738394969367776, 0.3507943978083545, -0.109162211257579, 0.18394653552115478, 0.11380905446050496, 0.08964828462821656, -0.07095547062184276, 0.09050179353979385, 0.06974482320345424, -0.24956777573945524, 0.13549475253214419, 0.29531591449832095, 0.07119899373983257, 0.2678850579621463, -0.3020123874062094, -0.2530744416831896, 0.20268256556050018, 0.0641936088012981, 0.006738999762154859, -0.056182271766813535, -0.2752466305191147, 0.18525314241133886, -0.13952217665340366, -0.15348575325233155, -0.07796105814712315, 0.10592745262166035, -0.02618748651303608, -0.2507890570780327, 0.05064438546782937, 0.22877713617194315, 0.07186265696032808, -0.024199226694502706, -0.019518734766812675, -0.16485406015196752, 0.051636196560515414, 0.04578477548282786, 0.18255880719717144, 0.06899122297282106, -0.056011951797449125, -0.07407602709557476, 0.3112218908259067, -0.15702442850532203, -0.25112263057109946, 0.16753148274287452, -0.1795730558705741, -0.20570784893914543, 0.1092801461044442, 0.0862093436339035, 0.16064130797468382, -0.0013376429098947294, 0.2818962337513422, -0.09712209403595148, 0.15573293346397835, 0.11858048204910653, 0.02349373664514258, 0.16168062290244992, 0.029071433814884775, 0.21643938088853812, 0.19389595399642812, -0.002603426451216741, 0.008373698083170015, -0.3627237319175539, -0.17585884420008496, -0.2451134031028326, 0.19507289986961104, -0.11665448563269756, -0.23204346421849112, 0.34462289191011725, 0.08128438613393568, 0.20212801828466612, 0.10101544804036103, 0.1847164474712717, 0.08824300884815126, 0.029952732043276573, 0.1252583274778364, 0.15173140675600233, 0.17450347814130887, -0.01273171567550764, -0.18280143528807394, 0.024378477989150018, 0.15242878685641134]
|
1,803.06864
|
On the hierarchical structure of Pareto critical sets
|
In this article we show that the boundary of the Pareto critical set of an
unconstrained multiobjective optimization problem (MOP) consists of Pareto
critical points of subproblems considering subsets of the objective functions.
If the Pareto critical set is completely described by its boundary (e.g. if we
have more objective functions than dimensions in the parameter space), this can
be used to solve the MOP by solving a number of MOPs with fewer objective
functions. If this is not the case, the results can still give insight into the
structure of the Pareto critical set. This technique is especially useful for
efficiently solving many-objective optimization problems by breaking them down
into MOPs with a reduced number of objective functions.
|
math.OC
|
in this article we show that the boundary of the pareto critical set of an unconstrained multiobjective optimization problem mop consists of pareto critical points of subproblems considering subsets of the objective functions if the pareto critical set is completely described by its boundary eg if we have more objective functions than dimensions in the parameter space this can be used to solve the mop by solving a number of mops with fewer objective functions if this is not the case the results can still give insight into the structure of the pareto critical set this technique is especially useful for efficiently solving manyobjective optimization problems by breaking them down into mops with a reduced number of objective functions
|
[['in', 'this', 'article', 'we', 'show', 'that', 'the', 'boundary', 'of', 'the', 'pareto', 'critical', 'set', 'of', 'an', 'unconstrained', 'multiobjective', 'optimization', 'problem', 'mop', 'consists', 'of', 'pareto', 'critical', 'points', 'of', 'subproblems', 'considering', 'subsets', 'of', 'the', 'objective', 'functions', 'if', 'the', 'pareto', 'critical', 'set', 'is', 'completely', 'described', 'by', 'its', 'boundary', 'eg', 'if', 'we', 'have', 'more', 'objective', 'functions', 'than', 'dimensions', 'in', 'the', 'parameter', 'space', 'this', 'can', 'be', 'used', 'to', 'solve', 'the', 'mop', 'by', 'solving', 'a', 'number', 'of', 'mops', 'with', 'fewer', 'objective', 'functions', 'if', 'this', 'is', 'not', 'the', 'case', 'the', 'results', 'can', 'still', 'give', 'insight', 'into', 'the', 'structure', 'of', 'the', 'pareto', 'critical', 'set', 'this', 'technique', 'is', 'especially', 'useful', 'for', 'efficiently', 'solving', 'manyobjective', 'optimization', 'problems', 'by', 'breaking', 'them', 'down', 'into', 'mops', 'with', 'a', 'reduced', 'number', 'of', 'objective', 'functions']]
|
[-0.10228967802313414, 0.04196000858437477, -0.09395745986125612, 0.0638989060442159, -0.08089842609943775, -0.1295582932623557, 0.06420385672421265, 0.34001508663494545, -0.3284175929089053, -0.31493073683075545, 0.11296773235657949, -0.2360353405516939, -0.1730941852687725, 0.2018002368854124, -0.06478001041134365, 0.11366307769829657, 0.0471618698299432, -0.02061332869069541, -0.06092581005391328, -0.30744678908939466, 0.3669756310874549, -0.026524070086849837, 0.22909741983514184, 0.036679755129358345, 0.07834582107861628, 0.0008447598352903078, 0.05007903784623041, 0.07951189317332558, -0.11564248692306167, 0.12575818346020914, 0.3060778717377356, 0.23442186235191942, 0.3609111903708804, -0.38602070634042013, -0.16925750230536835, 0.1877068705590708, 0.17922612878984573, 0.019858066704781616, 0.0022526358252052733, -0.2285341877850289, 0.10097639850426872, -0.06626305842631254, -0.12817389843618585, -0.0617381325568769, -0.042034764817188014, 0.01904110680138614, -0.29886775496738627, 0.006263272022875417, 0.00530138036124643, -0.005732081220054827, -0.08290835731455415, -0.1563052372036486, 0.011854990688739579, 0.06978414673358202, 0.038655996895903925, 0.05710608559511915, 0.07145190098080315, -0.16468303001822293, -0.07639504660570509, 0.4013942607341945, 0.06563911750604998, -0.28584626469635915, 0.14311003356295474, -0.10214584554396883, -0.11336551916574229, 0.18014737505841405, 0.17614760365681487, 0.1594546772128738, -0.1834655828434512, 0.09158121701336061, -0.08874863785096765, 0.14408428459858694, 0.04401844134162955, -0.03128383302779383, 0.1799152690580725, 0.1944079737985084, 0.1813255279821915, 0.22249109318241195, 0.010581026434606849, -0.0885604522680128, -0.2826221685919191, -0.13433200197623058, -0.19286858857640637, 0.0029750779338871686, -0.1101592846073899, -0.16791942219461212, 0.4274434568086529, 0.1328819615281179, 0.18072586552779965, 0.07484981814446319, 0.27785588367724745, 0.17867623861943188, 0.04413374537110971, 0.11535836470571637, 0.195257923925812, 0.044057392137626016, 0.05168590562402451, -0.2052140071999845, 0.08026934139618352, 0.0911983374991462]
|
1,803.06865
|
Spatio-temporal Poisson processes for visits to small sets
|
For many measure preserving dynamical systems $(\Omega,T,m)$ the successive
hitting times to a small set is well approximated by a Poisson process on the
real line. In this work we define a new process obtained from recording not
only the successive times $n$ of visits to a set $A$, but also the position
$T^n(x)$ in $A$ of the orbit, in the limit where $m(A)\to0$.
We obtain a convergence of this process, suitably normalized, to a Poisson
point process in time and space under some decorrelation condition. We present
several new applications to hyperbolic maps and SRB measures, including the
case of a neighborhood of a periodic point, and some billiards such as Sinai
billiards, Bunimovich stadium and diamond billiard.
|
math.DS
|
for many measure preserving dynamical systems omegatm the successive hitting times to a small set is well approximated by a poisson process on the real line in this work we define a new process obtained from recording not only the successive times n of visits to a set a but also the position tnx in a of the orbit in the limit where mato0 we obtain a convergence of this process suitably normalized to a poisson point process in time and space under some decorrelation condition we present several new applications to hyperbolic maps and srb measures including the case of a neighborhood of a periodic point and some billiards such as sinai billiards bunimovich stadium and diamond billiard
|
[['for', 'many', 'measure', 'preserving', 'dynamical', 'systems', 'omegatm', 'the', 'successive', 'hitting', 'times', 'to', 'a', 'small', 'set', 'is', 'well', 'approximated', 'by', 'a', 'poisson', 'process', 'on', 'the', 'real', 'line', 'in', 'this', 'work', 'we', 'define', 'a', 'new', 'process', 'obtained', 'from', 'recording', 'not', 'only', 'the', 'successive', 'times', 'n', 'of', 'visits', 'to', 'a', 'set', 'a', 'but', 'also', 'the', 'position', 'tnx', 'in', 'a', 'of', 'the', 'orbit', 'in', 'the', 'limit', 'where', 'mato0', 'we', 'obtain', 'a', 'convergence', 'of', 'this', 'process', 'suitably', 'normalized', 'to', 'a', 'poisson', 'point', 'process', 'in', 'time', 'and', 'space', 'under', 'some', 'decorrelation', 'condition', 'we', 'present', 'several', 'new', 'applications', 'to', 'hyperbolic', 'maps', 'and', 'srb', 'measures', 'including', 'the', 'case', 'of', 'a', 'neighborhood', 'of', 'a', 'periodic', 'point', 'and', 'some', 'billiards', 'such', 'as', 'sinai', 'billiards', 'bunimovich', 'stadium', 'and', 'diamond', 'billiard']]
|
[-0.14412497440313235, 0.08076244676246858, -0.09187629634641811, 0.054697931247962836, 0.007784975529449363, -0.09771353661174226, 0.09633254718720022, 0.37028555857001716, -0.2983906478859866, -0.20737979394726008, 0.14769384557874793, -0.28711739462665004, -0.14590679413368368, 0.22491844011566195, -0.11029007073300771, 0.10971906951541065, 0.060138248378793016, 0.05447598885044328, -0.06549195069262487, -0.21432985354047746, 0.32027769246353555, 0.00909347739070654, 0.1988095237642654, 0.020206204120768234, 0.14248719125086617, 0.011446531953560745, 0.011987590656862555, 0.025287188706734482, -0.140930890201185, 0.07115751571762256, 0.16561861238919962, 0.08983668690929428, 0.24782795814646041, -0.38613840588169474, -0.2031885695635763, 0.1517565314156505, 0.12894003875115806, 0.0727146182081893, -0.04621526279136475, -0.32506173281357265, 0.07216607220072904, -0.10174828180326866, -0.16357302442431831, -0.026903017274299078, 0.049419688482760876, 0.053483480611481726, -0.28629233171112645, 0.01992821512504035, 0.11885321491301402, 0.06273565261871514, -0.020352486483195525, -0.042938413050694346, 0.024158168172177214, 0.13243242183254442, 0.015429788393477917, 0.03399387335914195, 0.12664195573212117, -0.03999667208737288, -0.11501684548476568, 0.3977539106550762, -0.06992885566209085, -0.24331691859560645, 0.1991881584533705, -0.21822344133447313, -0.15538017810163143, 0.12637021803718984, 0.19271411075710487, 0.12918157771659586, -0.1730022692384246, 0.10523729158453962, -0.06426628129397574, 0.08773529136197196, 0.1171265470309772, 0.005958892373193024, 0.1606323481258801, 0.15271238989045477, 0.14452789784319556, 0.14426924930248633, -0.08623483267007793, -0.1271192513517717, -0.3274044645870598, -0.1638450243542146, -0.20107631447414556, 0.09120815109004342, -0.09563033397928374, -0.22275708556875715, 0.3783082647774464, 0.1056538879011686, 0.3020793032617523, 0.07609650896042267, 0.25205717239186615, 0.12406209876942927, -0.0015299946903529712, 0.0718263460872456, 0.1092726781961317, 0.09214216340174022, 0.0914854129545518, -0.1345308585008845, -0.0039876833016801085, 0.08238363119526806]
|
1,803.06866
|
The planar 3-body problem II:reduction to pure shape and spherical
geometry (2nd version)
|
Geometric reduction of the Newtonian planar three-body problem is
investigated in the framework of equivariant Riemannian geometry, which reduces
the study of trajectories of three-body motions to the study of their moduli
curves, that is, curves which record the change of size and shape, in the
moduli space of oriented mass-triangles. The latter space is a Riemannian cone
over the shape 2-sphere, and the shape curve is the image curve on this sphere.
It is shown that the time parametrized moduli curve is in general determined by
the relative geometry of the shape curve and the shape potential function. This
also entails the reconstruction of time, namely the geometric shape curve
determines the time parametrization of the moduli curve, hence also the
three-body motion itself, modulo a fixed rotation of the plane. The first
version of this work is an (unpublished) paper from 2012, and the present
version is an editorial revision of this.
|
math-ph math.DG math.MP
|
geometric reduction of the newtonian planar threebody problem is investigated in the framework of equivariant riemannian geometry which reduces the study of trajectories of threebody motions to the study of their moduli curves that is curves which record the change of size and shape in the moduli space of oriented masstriangles the latter space is a riemannian cone over the shape 2sphere and the shape curve is the image curve on this sphere it is shown that the time parametrized moduli curve is in general determined by the relative geometry of the shape curve and the shape potential function this also entails the reconstruction of time namely the geometric shape curve determines the time parametrization of the moduli curve hence also the threebody motion itself modulo a fixed rotation of the plane the first version of this work is an unpublished paper from 2012 and the present version is an editorial revision of this
|
[['geometric', 'reduction', 'of', 'the', 'newtonian', 'planar', 'threebody', 'problem', 'is', 'investigated', 'in', 'the', 'framework', 'of', 'equivariant', 'riemannian', 'geometry', 'which', 'reduces', 'the', 'study', 'of', 'trajectories', 'of', 'threebody', 'motions', 'to', 'the', 'study', 'of', 'their', 'moduli', 'curves', 'that', 'is', 'curves', 'which', 'record', 'the', 'change', 'of', 'size', 'and', 'shape', 'in', 'the', 'moduli', 'space', 'of', 'oriented', 'masstriangles', 'the', 'latter', 'space', 'is', 'a', 'riemannian', 'cone', 'over', 'the', 'shape', '2sphere', 'and', 'the', 'shape', 'curve', 'is', 'the', 'image', 'curve', 'on', 'this', 'sphere', 'it', 'is', 'shown', 'that', 'the', 'time', 'parametrized', 'moduli', 'curve', 'is', 'in', 'general', 'determined', 'by', 'the', 'relative', 'geometry', 'of', 'the', 'shape', 'curve', 'and', 'the', 'shape', 'potential', 'function', 'this', 'also', 'entails', 'the', 'reconstruction', 'of', 'time', 'namely', 'the', 'geometric', 'shape', 'curve', 'determines', 'the', 'time', 'parametrization', 'of', 'the', 'moduli', 'curve', 'hence', 'also', 'the', 'threebody', 'motion', 'itself', 'modulo', 'a', 'fixed', 'rotation', 'of', 'the', 'plane', 'the', 'first', 'version', 'of', 'this', 'work', 'is', 'an', 'unpublished', 'paper', 'from', '2012', 'and', 'the', 'present', 'version', 'is', 'an', 'editorial', 'revision', 'of', 'this']]
|
[-0.1494602924570429, 0.06188791417657532, -0.17160417508406967, 0.03397953813725145, -0.08376915009807966, -0.056583818693468776, -0.0018724849138688905, 0.33662135034702184, -0.31669049539292854, -0.2717003410414251, 0.08529977524254374, -0.21596608885557822, -0.17564620302679637, 0.20880823247621652, -0.15738652106617984, 0.036561774662117554, 0.06597627697853384, 0.03227813440919823, -0.0989426653695238, -0.26449628334604297, 0.3751545707235612, 0.03268221093743455, 0.24001839447133486, 0.040056339107466, 0.09300398991558871, 0.07167917158564224, -0.02249255358527591, 0.011675077780785977, -0.1598208970866764, 0.15921622152771994, 0.16409300796511078, 0.1116306867231341, 0.13253815778610267, -0.3493544210746787, -0.20789405511040848, 0.1539884852991117, 0.09872713460308481, 0.07037330499631078, 0.011873054951946769, -0.2417829928971413, 0.03519995159049537, -0.08319143852328553, -0.1888205811223076, -0.022030322240312504, 0.1019906894200378, 0.002593696430885519, -0.1440450101725611, 0.029829406626507324, 0.11006709303748924, 0.0879144316502646, -0.09846775409966416, -0.0613701700048789, -0.036033832754184994, 0.08426198239127795, 0.05455626460291397, 0.10437232160672935, 0.12105986188938903, -0.13590974647710038, -0.06180946704523723, 0.4280218164515651, -0.046805086487818975, -0.20570047609747716, 0.07446487117071751, -0.14562754381715862, -0.0796843819071773, 0.16979451322915898, 0.1751706388024187, 0.15999211208420058, -0.11683215041724003, 0.1625492031658616, -0.06829491159056916, 0.16168666534351026, 0.06639904359026867, -0.06575804229428553, 0.17381113288723224, 0.13819645740870945, 0.07603944500214328, 0.1588252725702059, -0.12099478857780448, -0.11665668459365668, -0.36277610015617134, -0.18763747523398766, -0.15608823332962962, 0.04995184001555435, -0.13720417840960222, -0.19006158637999118, 0.43994267735922454, 0.024057058550514817, 0.2450296355295756, 0.06244134028697861, 0.28404076782122156, 0.10694045967915479, 0.022463300890818824, 0.03993367230568349, 0.25466405611570464, 0.11780273774030064, 0.05286185092709691, -0.24835966062865958, 0.044261328799930076, 0.12822228935516738]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.