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.06367
|
The supernova remnant population in the very-high-energy sky: prospects
for CTA
|
The detection of very-high-energy gamma rays from supernova remnant shells
testifies of the acceleration of particles at strong shocks. Many aspects of
the particle acceleration remain however unclear. The study of individual
objects is very helpful, but the study of the entire population of SNRs
detected in this range and its characteristics can also bring valuable science.
Using Monte-Carlo simulations, the population of shells bright in the TeV and
multi-TeV range can be simulated. The results of these simulations aim at being
compared with observations of in struments operating in these ranges, such as
the Cherenkov Telescope Array (CTA). Our results suggest that CTA should be
able to effectively constrain the slope of particles accelerated at SNRs and
the electron-to-proton ratio.
|
astro-ph.HE
|
the detection of veryhighenergy gamma rays from supernova remnant shells testifies of the acceleration of particles at strong shocks many aspects of the particle acceleration remain however unclear the study of individual objects is very helpful but the study of the entire population of snrs detected in this range and its characteristics can also bring valuable science using montecarlo simulations the population of shells bright in the tev and multitev range can be simulated the results of these simulations aim at being compared with observations of in struments operating in these ranges such as the cherenkov telescope array cta our results suggest that cta should be able to effectively constrain the slope of particles accelerated at snrs and the electrontoproton ratio
|
[['the', 'detection', 'of', 'veryhighenergy', 'gamma', 'rays', 'from', 'supernova', 'remnant', 'shells', 'testifies', 'of', 'the', 'acceleration', 'of', 'particles', 'at', 'strong', 'shocks', 'many', 'aspects', 'of', 'the', 'particle', 'acceleration', 'remain', 'however', 'unclear', 'the', 'study', 'of', 'individual', 'objects', 'is', 'very', 'helpful', 'but', 'the', 'study', 'of', 'the', 'entire', 'population', 'of', 'snrs', 'detected', 'in', 'this', 'range', 'and', 'its', 'characteristics', 'can', 'also', 'bring', 'valuable', 'science', 'using', 'montecarlo', 'simulations', 'the', 'population', 'of', 'shells', 'bright', 'in', 'the', 'tev', 'and', 'multitev', 'range', 'can', 'be', 'simulated', 'the', 'results', 'of', 'these', 'simulations', 'aim', 'at', 'being', 'compared', 'with', 'observations', 'of', 'in', 'struments', 'operating', 'in', 'these', 'ranges', 'such', 'as', 'the', 'cherenkov', 'telescope', 'array', 'cta', 'our', 'results', 'suggest', 'that', 'cta', 'should', 'be', 'able', 'to', 'effectively', 'constrain', 'the', 'slope', 'of', 'particles', 'accelerated', 'at', 'snrs', 'and', 'the', 'electrontoproton', 'ratio']]
|
[-0.05340356180095114, 0.16533898419002072, -0.060053236505094296, 0.12226177069048087, -0.0543979547607402, -0.06889186165838813, -0.0029043006206241747, 0.4110474232894679, -0.23809658075527598, -0.3910187465352161, 0.0718393706503169, -0.2667279014829546, -0.02825062652506555, 0.2512042922714803, 0.034300545261551935, -0.04191668108154166, 0.1360671169270063, -0.06688276048904905, -0.00486019134017018, -0.22207771585672162, 0.2483221440265576, 0.20878484328277408, 0.19751164536573923, 0.05771151753360755, 0.08895544452049459, -0.10072623634090026, -0.041267548207057796, -0.018812634531059302, -0.10375371960138485, 0.058284572698175906, 0.26394187919613615, 0.13709050260173777, 0.19343581129796802, -0.40140686825228233, -0.2397841565388565, 0.12517654025771965, 0.21287936506948124, 0.012955909222364425, -0.0468624928034842, -0.3198573965424051, 0.08130040108056467, -0.16924741342663766, -0.22154878764413297, 0.042315902762735884, -0.05070398717264955, 0.10082525122658505, -0.18647286548900108, 0.05083720995826298, -0.011499085104636228, 0.0075768676343917225, -0.08488432935652478, -0.11767446011072025, 0.02410472092208996, 0.11037753594379561, 0.10335751595169616, -0.007589081189750383, 0.15686240758586792, -0.1655002003593836, -0.06708648173759381, 0.4346172748502189, -0.019691375681820014, -0.0665583516859139, 0.2670960938790813, -0.23491312395393227, -0.1685985613691931, 0.19460743121647586, 0.2128904798417352, 0.10173713859403506, -0.15089613248904546, 0.05354707971224949, -0.004233586678553062, 0.17692797123939574, 0.034904564633810274, 0.05524416936368652, 0.2980785026680678, 0.1777815652390321, 0.015609727838212469, 0.11850699301382216, -0.21753363593791922, -0.025615028423878052, -0.30602528021360437, -0.13007769886753523, -0.1723004380929827, 0.06525279912166297, -0.12035401050973936, -0.08411786790626745, 0.3753332233405672, 0.1748849664349109, 0.14944491682302516, -0.00018090755329467357, 0.2535034747910686, 0.030056678717179843, 0.051848449228176226, 0.0804458097050277, 0.3440831891658794, 0.08914492627761016, 0.11486307165275017, -0.2199624180192283, 0.06558642007876188, -0.045077613966229065]
|
1,803.06368
|
Doppelg\"anger dark energy: modified gravity with non-universal
couplings after GW170817
|
Gravitational Wave (GW) astronomy severely narrowed down the theoretical
space for scalar-tensor theories. We propose a new class of attractor models
for Horndeski action in which GWs propagate at the speed of light in the nearby
universe but not in the past. To do so we derive new solutions to the
interacting dark sector in which the ratio of dark energy and dark matter
remains constant, which we refer to as doppelg\"anger dark energy (DDE). We
then remove the interaction between dark matter and dark energy by a suitable
change of variables. The accelerated expansion that (we) baryons observe is due
to a conformal coupling to the dark energy scalar field. We show how in this
context it is possible to find a non trivial subset of solutions in which GWs
propagate at the speed of light only at low red-shifts. The model is an
attractor, thus reaching the limit $c_{T}\to1$ relatively fast. However, the
effect of baryons turns out to be non-negligible and severely constrains the
form of the Lagrangian. In passing, we found that in the simplest DDE models
the no-ghost conditions for perturbations require a non-universal coupling to
gravity. In the end, we comment on possible ways to solve the lack of matter
domination stage for DDE models.
|
gr-qc
|
gravitational wave gw astronomy severely narrowed down the theoretical space for scalartensor theories we propose a new class of attractor models for horndeski action in which gws propagate at the speed of light in the nearby universe but not in the past to do so we derive new solutions to the interacting dark sector in which the ratio of dark energy and dark matter remains constant which we refer to as doppelganger dark energy dde we then remove the interaction between dark matter and dark energy by a suitable change of variables the accelerated expansion that we baryons observe is due to a conformal coupling to the dark energy scalar field we show how in this context it is possible to find a non trivial subset of solutions in which gws propagate at the speed of light only at low redshifts the model is an attractor thus reaching the limit c_tto1 relatively fast however the effect of baryons turns out to be nonnegligible and severely constrains the form of the lagrangian in passing we found that in the simplest dde models the noghost conditions for perturbations require a nonuniversal coupling to gravity in the end we comment on possible ways to solve the lack of matter domination stage for dde models
|
[['gravitational', 'wave', 'gw', 'astronomy', 'severely', 'narrowed', 'down', 'the', 'theoretical', 'space', 'for', 'scalartensor', 'theories', 'we', 'propose', 'a', 'new', 'class', 'of', 'attractor', 'models', 'for', 'horndeski', 'action', 'in', 'which', 'gws', 'propagate', 'at', 'the', 'speed', 'of', 'light', 'in', 'the', 'nearby', 'universe', 'but', 'not', 'in', 'the', 'past', 'to', 'do', 'so', 'we', 'derive', 'new', 'solutions', 'to', 'the', 'interacting', 'dark', 'sector', 'in', 'which', 'the', 'ratio', 'of', 'dark', 'energy', 'and', 'dark', 'matter', 'remains', 'constant', 'which', 'we', 'refer', 'to', 'as', 'doppelganger', 'dark', 'energy', 'dde', 'we', 'then', 'remove', 'the', 'interaction', 'between', 'dark', 'matter', 'and', 'dark', 'energy', 'by', 'a', 'suitable', 'change', 'of', 'variables', 'the', 'accelerated', 'expansion', 'that', 'we', 'baryons', 'observe', 'is', 'due', 'to', 'a', 'conformal', 'coupling', 'to', 'the', 'dark', 'energy', 'scalar', 'field', 'we', 'show', 'how', 'in', 'this', 'context', 'it', 'is', 'possible', 'to', 'find', 'a', 'non', 'trivial', 'subset', 'of', 'solutions', 'in', 'which', 'gws', 'propagate', 'at', 'the', 'speed', 'of', 'light', 'only', 'at', 'low', 'redshifts', 'the', 'model', 'is', 'an', 'attractor', 'thus', 'reaching', 'the', 'limit', 'c_tto1', 'relatively', 'fast', 'however', 'the', 'effect', 'of', 'baryons', 'turns', 'out', 'to', 'be', 'nonnegligible', 'and', 'severely', 'constrains', 'the', 'form', 'of', 'the', 'lagrangian', 'in', 'passing', 'we', 'found', 'that', 'in', 'the', 'simplest', 'dde', 'models', 'the', 'noghost', 'conditions', 'for', 'perturbations', 'require', 'a', 'nonuniversal', 'coupling', 'to', 'gravity', 'in', 'the', 'end', 'we', 'comment', 'on', 'possible', 'ways', 'to', 'solve', 'the', 'lack', 'of', 'matter', 'domination', 'stage', 'for', 'dde', 'models']]
|
[-0.15356673119212721, 0.15382404817618883, -0.10341327564258661, 0.11462413883169315, -0.13424387100108323, -0.11398088564164936, 0.03068736955590014, 0.30661652222985314, -0.2502415215053285, -0.3223017603425043, 0.05747123250704525, -0.2421448548324406, -0.0732128199101204, 0.14417316462633953, -0.0015096260899943965, -0.003306276717090181, 0.012797445718509456, 0.0522008545031505, -0.0404548730662403, -0.2478058269446982, 0.3307376465227987, 0.06568803224585108, 0.20058972715799298, 0.0433861902892767, 0.11000415019114457, -0.06680396815229739, -0.005412388938878264, -0.01975001505190795, -0.13941179230356024, 0.03514835425608215, 0.20369836119219448, 0.11641240765429324, 0.2300496975569764, -0.431792148158309, -0.2561786774412862, 0.18963978370163767, 0.16863506599994643, 0.1589302247124059, -0.053965018999518916, -0.28585224383998487, 0.0538806420817439, -0.17722812096610488, -0.1490113373934513, -0.06728882426396013, 0.011476493501132133, -0.025025437186316897, -0.23125177340227224, 0.11578691935366285, -0.013480281171255878, -0.08534039343441172, -0.06309728272428315, -0.051697202055670674, -0.02062380580852429, 0.017532555056026293, 0.12057770932331636, 0.02817380321988215, 0.13109695006028882, -0.2283239724064645, -0.0350519394041926, 0.42047171179382575, -0.1417316414110939, -0.1775758248132964, 0.1832833206037148, -0.14351674076613216, -0.17024471667329116, 0.11938964737734446, 0.18674553512551245, 0.11054566257101084, -0.1387096959299275, 0.12709331739558064, 0.023597509835339484, 0.1842635956282417, 0.0759107430243776, 0.05621954023704997, 0.31448922520946887, 0.12776636739061878, 0.06495654823347216, 0.07588900873781226, -0.06523525011393108, -0.08424075261102103, -0.3401480515620538, -0.1357488899469553, -0.13079738272742059, 0.042493667383955436, -0.08037439862999322, -0.15647415421858785, 0.3951541856385856, 0.1767665591863555, 0.16912494704703845, 0.05771712908809561, 0.27612226761966235, 0.10722549958376303, 0.045909851080172565, 0.10171955722339807, 0.3643791599310048, 0.1154024209017821, 0.10254148996180101, -0.210924175108916, -0.030762988019601575, 0.008530864592952032]
|
1,803.06369
|
A Family of Minimal and Renormalizable Rectangle Exchange Maps
|
A domain exchange map (DEM) is a dynamical system defined on a smooth Jordan
domain which is a piecewise translation. We explain how to use cut-and-project
sets to construct minimal DEMs. Specializing to the case in which the domain is
a square and the cut-and-project set is associated to a Galois lattice, we
construct an infinite family of DEMs in which each map is associated to a PV
number. We develop a renormalization scheme for these DEMs. Certain DEMs in the
family can be composed to create multistage, renormalizable DEMs.
|
math.DS
|
a domain exchange map dem is a dynamical system defined on a smooth jordan domain which is a piecewise translation we explain how to use cutandproject sets to construct minimal dems specializing to the case in which the domain is a square and the cutandproject set is associated to a galois lattice we construct an infinite family of dems in which each map is associated to a pv number we develop a renormalization scheme for these dems certain dems in the family can be composed to create multistage renormalizable dems
|
[['a', 'domain', 'exchange', 'map', 'dem', 'is', 'a', 'dynamical', 'system', 'defined', 'on', 'a', 'smooth', 'jordan', 'domain', 'which', 'is', 'a', 'piecewise', 'translation', 'we', 'explain', 'how', 'to', 'use', 'cutandproject', 'sets', 'to', 'construct', 'minimal', 'dems', 'specializing', 'to', 'the', 'case', 'in', 'which', 'the', 'domain', 'is', 'a', 'square', 'and', 'the', 'cutandproject', 'set', 'is', 'associated', 'to', 'a', 'galois', 'lattice', 'we', 'construct', 'an', 'infinite', 'family', 'of', 'dems', 'in', 'which', 'each', 'map', 'is', 'associated', 'to', 'a', 'pv', 'number', 'we', 'develop', 'a', 'renormalization', 'scheme', 'for', 'these', 'dems', 'certain', 'dems', 'in', 'the', 'family', 'can', 'be', 'composed', 'to', 'create', 'multistage', 'renormalizable', 'dems']]
|
[-0.12754163951095607, 0.09249490349078163, -0.06454393609116475, 0.061726670413433264, -0.10241437045236429, -0.10870248158591696, -0.0010317013909419378, 0.37747172964219416, -0.3308910142164677, -0.21393720380858414, 0.13040689419463483, -0.26476257993943164, -0.13657171168209364, 0.23063348585532772, -0.1341792911498083, 0.03897581622004509, -0.006565406199337708, 0.05143671660011427, -0.0703519956053545, -0.23906105870587957, 0.3333226157248848, -0.03487585664519833, 0.2345605209366315, -0.015310247260559764, 0.14532851645878206, -0.07164914918183866, 0.015436819225497958, 0.025325865814617526, -0.11492206174880266, 0.13384976786716532, 0.2414557201580869, 0.09026166934830447, 0.2091095134201977, -0.34474637104819217, -0.22459934820524521, 0.17994898206864793, 0.10937166078430083, 0.10538481212764357, -0.01335241026762459, -0.23469877522180063, 0.10592239414626319, -0.19241075103895533, -0.11073659321086274, -0.09457297451380227, -0.023277437562743822, 0.007185005049945579, -0.3352972589433193, -0.018394250484804312, 0.008157328364581594, 0.08463492669786016, -0.03800025680619809, -0.01257073211664748, -0.026307254421731666, 0.09167286417860952, -0.05546112820350876, 0.09095543681954345, 0.07627745143448313, -0.04533016505754656, -0.10100859710687979, 0.39193906562997854, -0.08548168614636072, -0.28460168678106534, 0.18042514676021204, -0.10537176104262472, -0.11907579111349252, 0.15850961386329598, 0.18455298824442756, 0.07736249185270733, -0.16035798111309607, 0.11588679139127231, -0.11215901176134745, 0.17235441826697853, 0.07337158998060557, -0.07866020364065965, 0.17034107938201892, 0.12496145379005207, 0.0943003069402443, 0.19327479243770035, -0.06779335141052595, -0.13070014177097214, -0.33575354003243973, -0.1451794009241793, -0.15616949169586103, 0.045925306083841454, -0.0469393998434599, -0.242725310050365, 0.44121555631035236, 0.11277852901774976, 0.24097909803191822, 0.07584549387684092, 0.22748869689077966, 0.11009862302792801, 0.09539484601571328, 0.05236833703497218, 0.09156389667445587, 0.10901752199149795, 0.01107675878641506, -0.16356486780310256, -0.040512711715160146, 0.15641518033420046]
|
1,803.0637
|
First Calorimetric Measurement of Electron Capture in ${}^{193}$Pt with
a Transition Edge Sensor
|
The neutrino mass can be extracted from a high statistics, high resolution
calorimetric spectrum of electron capture in ${}^{163}$Ho. In order to better
understand the shape of the calorimetric electron capture spectrum, a second
isotope was measured with a close to ideal absorber-source configuration.
${}^{193}$Pt was created by irradiating a ${}^{192}$Pt-enriched platinum foil
in a nuclear reactor. This Pt-in-Pt absorber was designed to have a nearly
ideal absorber-source configuration. The measured ${}^{193}$Pt calorimetric
electron-capture spectrum provides an independent check on the corresponding
theoretical calculations, which have thus far been compared only for
${}^{163}$Ho. The first experimental and theoretically-calculated spectra from
this ${}^{193}$Pt-in-Pt absorber are presented and overlaid for preliminary
comparison of theory with experiment.
|
physics.atom-ph physics.ins-det
|
the neutrino mass can be extracted from a high statistics high resolution calorimetric spectrum of electron capture in 163ho in order to better understand the shape of the calorimetric electron capture spectrum a second isotope was measured with a close to ideal absorbersource configuration 193pt was created by irradiating a 192ptenriched platinum foil in a nuclear reactor this ptinpt absorber was designed to have a nearly ideal absorbersource configuration the measured 193pt calorimetric electroncapture spectrum provides an independent check on the corresponding theoretical calculations which have thus far been compared only for 163ho the first experimental and theoreticallycalculated spectra from this 193ptinpt absorber are presented and overlaid for preliminary comparison of theory with experiment
|
[['the', 'neutrino', 'mass', 'can', 'be', 'extracted', 'from', 'a', 'high', 'statistics', 'high', 'resolution', 'calorimetric', 'spectrum', 'of', 'electron', 'capture', 'in', '163ho', 'in', 'order', 'to', 'better', 'understand', 'the', 'shape', 'of', 'the', 'calorimetric', 'electron', 'capture', 'spectrum', 'a', 'second', 'isotope', 'was', 'measured', 'with', 'a', 'close', 'to', 'ideal', 'absorbersource', 'configuration', '193pt', 'was', 'created', 'by', 'irradiating', 'a', '192ptenriched', 'platinum', 'foil', 'in', 'a', 'nuclear', 'reactor', 'this', 'ptinpt', 'absorber', 'was', 'designed', 'to', 'have', 'a', 'nearly', 'ideal', 'absorbersource', 'configuration', 'the', 'measured', '193pt', 'calorimetric', 'electroncapture', 'spectrum', 'provides', 'an', 'independent', 'check', 'on', 'the', 'corresponding', 'theoretical', 'calculations', 'which', 'have', 'thus', 'far', 'been', 'compared', 'only', 'for', '163ho', 'the', 'first', 'experimental', 'and', 'theoreticallycalculated', 'spectra', 'from', 'this', '193ptinpt', 'absorber', 'are', 'presented', 'and', 'overlaid', 'for', 'preliminary', 'comparison', 'of', 'theory', 'with', 'experiment']]
|
[0.00332476267668017, 0.13422310587732705, -0.08661416672819525, 0.06459663143817233, -0.000755843428741081, -0.13230006072943637, 0.006435421003891719, 0.3947895509404464, -0.19030052361104194, -0.3530779065854779, 0.03311251779834509, -0.35764641259207364, 0.011059536564445823, 0.214559023625243, -0.005623612766487336, 0.09032395220289025, 0.07170366086578424, 0.022309316065880137, -0.08886987818704081, -0.14808420412490195, 0.22558216065800654, 0.21814123665862675, 0.2886133297440519, 0.05672264119627279, 0.0817200510523393, -0.04372700782003599, -0.025329168168229794, 0.001533965910186803, -0.11931363699974817, 0.08142508282710653, 0.2623165427117583, 0.04293946789009144, 0.14608368017804732, -0.4000000555170785, -0.20664120709027992, 0.063565412309841, 0.11351082329168369, 0.0712191939744842, -0.09853807153765522, -0.25150085860914595, 0.1225405358677354, -0.23111255757228702, -0.10573014857700316, -0.06235822794292498, -0.04227995684096983, 0.030255246435937154, -0.27344961383234745, 0.017253837849914924, -0.02823711595062269, 0.05883615981906796, -0.09032726174203354, -0.12076077878543544, 0.019590454757076884, 0.10069613049977348, 0.008024945923494637, 0.024776076069187133, 0.15095906962486788, -0.04756577232630428, -0.07543787021198473, 0.3832803211866989, -0.05443216944775553, -0.10178820788860321, 0.13748924523045164, -0.22373048225075964, -0.0873703594798, 0.1996885102857417, 0.13218088801779332, 0.08790860787061269, -0.18224093664027408, 0.02283993452988189, -0.05877925563227693, 0.22602428867558547, 0.06200513003154769, 0.00206935351475253, 0.22415321780830075, 0.23621141230217566, 0.01562369169310641, 0.08521985762150223, -0.15938210121622023, 0.02108539084459595, -0.23408017664669303, -0.13291619910320285, -0.19605672180037434, 0.08379267316969505, 0.01383734784658289, -0.12710857055568642, 0.40552467710142015, 0.08527839919893977, 0.21131841465830803, -0.07150466381166336, 0.32476942114737056, 0.08010842773738668, 0.05020720300872366, -0.02395231150295756, 0.32634641066056874, 0.1786536211767362, 0.12715962705193856, -0.2286072707280555, 0.09481753661818461, 0.014709575716918761]
|
1,803.06371
|
Ludvig Lorenz (1867) on Light and Electricity
|
Independent of Maxwell, in 1867 the Danish physicist L. V. Lorenz proposed a
theory in which he identified light with electrical oscillations propagating in
a very poor conductor. Lorenz's electrodynamic theory of light, which formally
was equivalent to Maxwell's theory but physically quite different from it, was
published in well-known journals in German and English but soon fell into
oblivion. In 1867 Lorenz also published a paper on his new theory in a
semi-popular Danish journal which has generally been overlooked. This other
paper is here translated into English and provided with the necessary
annotations.
|
physics.hist-ph
|
independent of maxwell in 1867 the danish physicist l v lorenz proposed a theory in which he identified light with electrical oscillations propagating in a very poor conductor lorenzs electrodynamic theory of light which formally was equivalent to maxwells theory but physically quite different from it was published in wellknown journals in german and english but soon fell into oblivion in 1867 lorenz also published a paper on his new theory in a semipopular danish journal which has generally been overlooked this other paper is here translated into english and provided with the necessary annotations
|
[['independent', 'of', 'maxwell', 'in', '1867', 'the', 'danish', 'physicist', 'l', 'v', 'lorenz', 'proposed', 'a', 'theory', 'in', 'which', 'he', 'identified', 'light', 'with', 'electrical', 'oscillations', 'propagating', 'in', 'a', 'very', 'poor', 'conductor', 'lorenzs', 'electrodynamic', 'theory', 'of', 'light', 'which', 'formally', 'was', 'equivalent', 'to', 'maxwells', 'theory', 'but', 'physically', 'quite', 'different', 'from', 'it', 'was', 'published', 'in', 'wellknown', 'journals', 'in', 'german', 'and', 'english', 'but', 'soon', 'fell', 'into', 'oblivion', 'in', '1867', 'lorenz', 'also', 'published', 'a', 'paper', 'on', 'his', 'new', 'theory', 'in', 'a', 'semipopular', 'danish', 'journal', 'which', 'has', 'generally', 'been', 'overlooked', 'this', 'other', 'paper', 'is', 'here', 'translated', 'into', 'english', 'and', 'provided', 'with', 'the', 'necessary', 'annotations']]
|
[-0.06387213156007132, 0.1153613401895487, -0.13259273904718852, 0.06079522687083992, -0.12579975286988834, -0.20125485944904778, 0.061767082597668235, 0.2901054545844856, -0.19806830520790658, -0.3357842943042909, 0.029717501190392986, -0.30437677034029836, -0.1583992033412582, 0.22876942611642573, -0.15479543166431156, -0.012162449308916141, 0.058748712075727155, 0.0457363514915893, 0.026023217212212714, -0.3110411914457616, 0.22032088805480224, 0.05713427388109267, 0.2979341298635853, 0.030451862964975207, 0.09480396724355064, -0.04223498948604653, -0.07330037070144164, 0.0736071266331955, -0.07603225515263866, 0.09437234075985064, 0.2857070926380785, 0.10366400000937957, 0.2890817125376902, -0.4176502665994983, -0.19657878500507459, -0.006163307651877403, 0.10486613721831849, 0.08901660937546312, -0.008607958008437172, -0.33987077778499375, -0.0025872505318961644, -0.1780866187629535, -0.07258051856371918, 0.00016405360871239713, 0.11032460069675978, -0.046378462849871106, -0.14905736077772944, 0.03870259286854171, 0.04095220486388395, 0.1437178562909953, -0.05009422033633056, -0.1434866110808032, -0.014272670869372393, 0.09488536926280511, 0.0856659288934775, 0.07831362814942718, 0.05206442661093254, -0.0892066926111798, -0.06261729564223635, 0.41861821730670173, -0.08259798506961057, -0.16188691361366134, 0.17317228546170027, -0.13977907976429713, -0.16695966414347488, 0.08664992660725195, 0.11615538936549503, 0.0494037825418146, -0.21605542270025532, 0.10327504539837766, -0.11543135178324423, 0.16225468992794814, 0.14095794003652898, -0.0273009344273688, 0.1627697153114959, 0.10655797282111291, -0.07342978836968542, 0.11428708385149212, 0.005110606632048363, -0.08448738194266825, -0.28192545217094256, -0.14253069647881939, -0.12875789185299685, 0.115274632874092, 0.047758417596464584, -0.1675954185769354, 0.3694887493099821, 0.14862937131210377, 0.06799470053887681, -0.03401403168927094, 0.27462057781062627, 0.09081597707577442, 0.07615823275654723, 0.0710686085181997, 0.27440032351173854, 0.13525325978468908, 0.21578299724741987, -0.0968598387522721, -0.0021800049727684575, 0.07721392051561883]
|
1,803.06372
|
Stochastic basins of attraction and generalized committor functions
|
We generalize the concept of basin of attraction of a stable state in order
to facilitate the analysis of dynamical systems with noise and to assess
stability properties of metastable states and long transients. To this end we
examine the notions of mean sojourn times and absorption probabilities for
Markov chains and study their relation to the basins of attraction. Our
approach is applicable to a large variety of problems since in most cases the
transfer operator associated to a dynamical system can be approximated by a
Markov chain.
|
math.DS nlin.CD
|
we generalize the concept of basin of attraction of a stable state in order to facilitate the analysis of dynamical systems with noise and to assess stability properties of metastable states and long transients to this end we examine the notions of mean sojourn times and absorption probabilities for markov chains and study their relation to the basins of attraction our approach is applicable to a large variety of problems since in most cases the transfer operator associated to a dynamical system can be approximated by a markov chain
|
[['we', 'generalize', 'the', 'concept', 'of', 'basin', 'of', 'attraction', 'of', 'a', 'stable', 'state', 'in', 'order', 'to', 'facilitate', 'the', 'analysis', 'of', 'dynamical', 'systems', 'with', 'noise', 'and', 'to', 'assess', 'stability', 'properties', 'of', 'metastable', 'states', 'and', 'long', 'transients', 'to', 'this', 'end', 'we', 'examine', 'the', 'notions', 'of', 'mean', 'sojourn', 'times', 'and', 'absorption', 'probabilities', 'for', 'markov', 'chains', 'and', 'study', 'their', 'relation', 'to', 'the', 'basins', 'of', 'attraction', 'our', 'approach', 'is', 'applicable', 'to', 'a', 'large', 'variety', 'of', 'problems', 'since', 'in', 'most', 'cases', 'the', 'transfer', 'operator', 'associated', 'to', 'a', 'dynamical', 'system', 'can', 'be', 'approximated', 'by', 'a', 'markov', 'chain']]
|
[-0.12488369043822285, 0.11437684997623221, -0.10200420091075174, 0.10547060938552022, -0.0009722817856609152, -0.07914755580517767, 0.07877620517830836, 0.3559784516064304, -0.30076274824239774, -0.2528241306041064, 0.14442023140734084, -0.2653944802606541, -0.11709639999303925, 0.17015332255638047, -0.04854438200676709, 0.06931518514907468, 0.05813991681023846, 0.024450293310467948, -0.06424020645156335, -0.18754833205760027, 0.3195412355276306, 0.035949298075996755, 0.2502663154678231, 0.03551301729127639, 0.0958753670147212, -0.015820523119646678, 0.030049053763740518, 0.02102329513841499, -0.1494430328792568, 0.13135633598476795, 0.24589258312048873, 0.10971081824031438, 0.28375558628899494, -0.38291581630120786, -0.22393289254455084, 0.16525955639486567, 0.13151975087507556, 0.11809739383628194, 0.039782750033093305, -0.32972544992572805, 0.10254196284255118, -0.19224686670546118, -0.17860339072878273, -0.09049729981035873, 0.04124963609240112, 0.07701254607534057, -0.2636723291714875, 0.06453650204459561, 0.07262987161010734, 0.039236294189363384, -0.07370297026067052, -0.047991524925298484, -0.01369504310096499, 0.13300461338812045, 0.06701782645835552, -0.049665895217422686, 0.12439565830393119, -0.1131224032789678, -0.1287032094145759, 0.35090182690221944, -0.07750791073332049, -0.1796701125005323, 0.26091032574643913, -0.13158171654291703, -0.11851633992046118, 0.13589005150800842, 0.2135977747358298, 0.1351294324136852, -0.1608756109130349, 0.04698069540919799, 0.0390062787141023, 0.15428374965120567, 0.021861045276013652, 0.05176175475706545, 0.19244871734317098, 0.1899905429336797, 0.10297546376019005, 0.19179814326540265, -0.05959804081475739, -0.18210126121536294, -0.23911536765399943, -0.1683769938379024, -0.16692621708753402, 0.03760159183215099, -0.05141324869009112, -0.19303791598531972, 0.41146250666129625, 0.17276588760499212, 0.21007603443531173, 0.08312173742078914, 0.20337476751903136, 0.11786962144228556, 0.007015899836158987, 0.02735867690860053, 0.19613636211816515, 0.17722235616620924, 0.07271189066801179, -0.22664815147428283, 0.075709754287192, 0.06478468085942643]
|
1,803.06373
|
Adversarial Logit Pairing
|
In this paper, we develop improved techniques for defending against
adversarial examples at scale. First, we implement the state of the art version
of adversarial training at unprecedented scale on ImageNet and investigate
whether it remains effective in this setting - an important open scientific
question (Athalye et al., 2018). Next, we introduce enhanced defenses using a
technique we call logit pairing, a method that encourages logits for pairs of
examples to be similar. When applied to clean examples and their adversarial
counterparts, logit pairing improves accuracy on adversarial examples over
vanilla adversarial training; we also find that logit pairing on clean examples
only is competitive with adversarial training in terms of accuracy on two
datasets. Finally, we show that adversarial logit pairing achieves the state of
the art defense on ImageNet against PGD white box attacks, with an accuracy
improvement from 1.5% to 27.9%. Adversarial logit pairing also successfully
damages the current state of the art defense against black box attacks on
ImageNet (Tramer et al., 2018), dropping its accuracy from 66.6% to 47.1%. With
this new accuracy drop, adversarial logit pairing ties with Tramer et al.(2018)
for the state of the art on black box attacks on ImageNet.
|
cs.LG stat.ML
|
in this paper we develop improved techniques for defending against adversarial examples at scale first we implement the state of the art version of adversarial training at unprecedented scale on imagenet and investigate whether it remains effective in this setting an important open scientific question athalye et al 2018 next we introduce enhanced defenses using a technique we call logit pairing a method that encourages logits for pairs of examples to be similar when applied to clean examples and their adversarial counterparts logit pairing improves accuracy on adversarial examples over vanilla adversarial training we also find that logit pairing on clean examples only is competitive with adversarial training in terms of accuracy on two datasets finally we show that adversarial logit pairing achieves the state of the art defense on imagenet against pgd white box attacks with an accuracy improvement from 15 to 279 adversarial logit pairing also successfully damages the current state of the art defense against black box attacks on imagenet tramer et al 2018 dropping its accuracy from 666 to 471 with this new accuracy drop adversarial logit pairing ties with tramer et al2018 for the state of the art on black box attacks on imagenet
|
[['in', 'this', 'paper', 'we', 'develop', 'improved', 'techniques', 'for', 'defending', 'against', 'adversarial', 'examples', 'at', 'scale', 'first', 'we', 'implement', 'the', 'state', 'of', 'the', 'art', 'version', 'of', 'adversarial', 'training', 'at', 'unprecedented', 'scale', 'on', 'imagenet', 'and', 'investigate', 'whether', 'it', 'remains', 'effective', 'in', 'this', 'setting', 'an', 'important', 'open', 'scientific', 'question', 'athalye', 'et', 'al', '2018', 'next', 'we', 'introduce', 'enhanced', 'defenses', 'using', 'a', 'technique', 'we', 'call', 'logit', 'pairing', 'a', 'method', 'that', 'encourages', 'logits', 'for', 'pairs', 'of', 'examples', 'to', 'be', 'similar', 'when', 'applied', 'to', 'clean', 'examples', 'and', 'their', 'adversarial', 'counterparts', 'logit', 'pairing', 'improves', 'accuracy', 'on', 'adversarial', 'examples', 'over', 'vanilla', 'adversarial', 'training', 'we', 'also', 'find', 'that', 'logit', 'pairing', 'on', 'clean', 'examples', 'only', 'is', 'competitive', 'with', 'adversarial', 'training', 'in', 'terms', 'of', 'accuracy', 'on', 'two', 'datasets', 'finally', 'we', 'show', 'that', 'adversarial', 'logit', 'pairing', 'achieves', 'the', 'state', 'of', 'the', 'art', 'defense', 'on', 'imagenet', 'against', 'pgd', 'white', 'box', 'attacks', 'with', 'an', 'accuracy', 'improvement', 'from', '15', 'to', '279', 'adversarial', 'logit', 'pairing', 'also', 'successfully', 'damages', 'the', 'current', 'state', 'of', 'the', 'art', 'defense', 'against', 'black', 'box', 'attacks', 'on', 'imagenet', 'tramer', 'et', 'al', '2018', 'dropping', 'its', 'accuracy', 'from', '666', 'to', '471', 'with', 'this', 'new', 'accuracy', 'drop', 'adversarial', 'logit', 'pairing', 'ties', 'with', 'tramer', 'et', 'al2018', 'for', 'the', 'state', 'of', 'the', 'art', 'on', 'black', 'box', 'attacks', 'on', 'imagenet']]
|
[-0.04224638216083451, -0.010692053770127335, -0.018990812870692843, 0.1237455368581304, -0.09174277189387274, -0.19778979417620873, 0.10870523235050258, 0.4047042673848075, -0.17864267034836265, -0.3549684159343644, 0.038695182768290634, -0.313572526975934, -0.17724360107463233, 0.2234648911499808, -0.21127293380666334, 0.07485779800080476, 0.09170048042691707, -0.002641505518113263, -0.0547946859780718, -0.4396237809797844, 0.3571372688525209, 0.0766608512589746, 0.3335263192694045, 0.01621022240771931, 0.11556787821654306, -0.03984963519935857, 0.05863360609777262, -0.01626048886991695, -0.09534674001632974, 0.06879876935569455, 0.25913140046284344, 0.14329713905629302, 0.3313320676168921, -0.3772880582385982, -0.19653337788815628, 0.07818781326843273, 0.07308377788226329, 0.1905139440104718, -0.05006528570677857, -0.404651280910689, 0.1289891859710131, -0.2792197392911327, -0.0005830232236933495, -0.16888162508435853, -0.007589476876797116, -0.026311188202104246, -0.295069903976341, 0.056457522846859336, 0.11207643814613016, 0.06944788434086557, -0.03924940718986493, -0.13200574144554725, -0.009284196079385524, 0.06644815842966116, 0.039347833985871425, 0.059716621844444845, 0.12809043747286208, -0.18982941736063294, -0.18887471883291646, 0.27821851822776883, -0.08278247713225974, -0.15857198854435559, 0.1864316868191889, 0.04109920027941389, -0.12993203269374765, 0.06910539725415256, 0.2524358498607287, 0.11299716082772202, -0.04992223849286365, 0.04726631586542068, -0.06189146027805246, 0.17993366734626018, 0.06596818116816636, -0.015446169926708907, 0.09544165306534542, 0.251768351075173, 0.07260753732645048, 0.16364218326218957, -0.13795742730619576, -0.09580011357973824, -0.24159587187958614, -0.05573009983256307, -0.18134538394432248, 0.02609912246199591, -0.05589112430280526, -0.13588293579083924, 0.40598459793634867, 0.2651469495755677, 0.20205154564060576, 0.09213502878057105, 0.33232593172400887, -0.056296037856907566, 0.014406267093846157, 0.1489551174668215, 0.24187175682757753, -0.002808162548142124, 0.06945037423384766, -0.1951538120480777, 0.12909724564310543, 0.03505147214873803]
|
1,803.06374
|
Ab Initio Electron-Phonon Interactions Using Atomic Orbital
Wavefunctions
|
The interaction between electrons and lattice vibrations determines key
physical properties of materials, including their electrical and heat
transport, excited electron dynamics, phase transitions, and superconductivity.
We present a new ab initio method that employs atomic orbital (AO)
wavefunctions to compute the electron-phonon (e-ph) interactions in materials
and interpolate the e-ph coupling matrix elements to fine Brillouin zone grids.
We detail the numerical implementation of such AO-based e-ph calculations, and
benchmark them against direct density functional theory calculations and
Wannier function (WF) interpolation. The key advantages of AOs over WFs for
e-ph calculations are outlined. Since AOs are fixed basis functions associated
with the atoms, they circumvent the need to generate a material-specific
localized basis set with a trial-and-error approach, as is needed in WFs.
Therefore, AOs are ideal to compute e-ph interactions in chemically and
structurally complex materials for which WFs are challenging to generate, and
are also promising for high-throughput materials discovery. While our results
focus on AOs, the formalism we present generalizes e-ph calculations to
arbitrary localized basis sets, with WFs recovered as a special case.
|
cond-mat.mtrl-sci
|
the interaction between electrons and lattice vibrations determines key physical properties of materials including their electrical and heat transport excited electron dynamics phase transitions and superconductivity we present a new ab initio method that employs atomic orbital ao wavefunctions to compute the electronphonon eph interactions in materials and interpolate the eph coupling matrix elements to fine brillouin zone grids we detail the numerical implementation of such aobased eph calculations and benchmark them against direct density functional theory calculations and wannier function wf interpolation the key advantages of aos over wfs for eph calculations are outlined since aos are fixed basis functions associated with the atoms they circumvent the need to generate a materialspecific localized basis set with a trialanderror approach as is needed in wfs therefore aos are ideal to compute eph interactions in chemically and structurally complex materials for which wfs are challenging to generate and are also promising for highthroughput materials discovery while our results focus on aos the formalism we present generalizes eph calculations to arbitrary localized basis sets with wfs recovered as a special case
|
[['the', 'interaction', 'between', 'electrons', 'and', 'lattice', 'vibrations', 'determines', 'key', 'physical', 'properties', 'of', 'materials', 'including', 'their', 'electrical', 'and', 'heat', 'transport', 'excited', 'electron', 'dynamics', 'phase', 'transitions', 'and', 'superconductivity', 'we', 'present', 'a', 'new', 'ab', 'initio', 'method', 'that', 'employs', 'atomic', 'orbital', 'ao', 'wavefunctions', 'to', 'compute', 'the', 'electronphonon', 'eph', 'interactions', 'in', 'materials', 'and', 'interpolate', 'the', 'eph', 'coupling', 'matrix', 'elements', 'to', 'fine', 'brillouin', 'zone', 'grids', 'we', 'detail', 'the', 'numerical', 'implementation', 'of', 'such', 'aobased', 'eph', 'calculations', 'and', 'benchmark', 'them', 'against', 'direct', 'density', 'functional', 'theory', 'calculations', 'and', 'wannier', 'function', 'wf', 'interpolation', 'the', 'key', 'advantages', 'of', 'aos', 'over', 'wfs', 'for', 'eph', 'calculations', 'are', 'outlined', 'since', 'aos', 'are', 'fixed', 'basis', 'functions', 'associated', 'with', 'the', 'atoms', 'they', 'circumvent', 'the', 'need', 'to', 'generate', 'a', 'materialspecific', 'localized', 'basis', 'set', 'with', 'a', 'trialanderror', 'approach', 'as', 'is', 'needed', 'in', 'wfs', 'therefore', 'aos', 'are', 'ideal', 'to', 'compute', 'eph', 'interactions', 'in', 'chemically', 'and', 'structurally', 'complex', 'materials', 'for', 'which', 'wfs', 'are', 'challenging', 'to', 'generate', 'and', 'are', 'also', 'promising', 'for', 'highthroughput', 'materials', 'discovery', 'while', 'our', 'results', 'focus', 'on', 'aos', 'the', 'formalism', 'we', 'present', 'generalizes', 'eph', 'calculations', 'to', 'arbitrary', 'localized', 'basis', 'sets', 'with', 'wfs', 'recovered', 'as', 'a', 'special', 'case']]
|
[-0.1338690130778864, 0.13135368781163964, -0.024046226096984685, 0.04224648075236798, -0.06820866071317325, -0.1639257223246484, 0.06686909464461073, 0.43385101137838883, -0.26371947755287894, -0.25036941153158604, -0.007369592111406837, -0.31646851525256964, -0.19174584627213925, 0.1819551326734451, 0.056593355504202775, 0.07289834457381977, 0.06947428156626957, -0.11027110171343028, -0.09412429325332002, -0.1833793229960665, 0.28580879460884956, 0.06507254619016078, 0.27512660411878503, 0.08506893124119197, 0.025664720377317686, 0.033414041300892164, 0.03014818381377647, -0.019472755444907276, -0.11921665153626967, 0.1414082731522214, 0.30497374793146503, -0.014428972003867007, 0.21893000507508742, -0.47641899190093884, -0.18701169033750745, -0.009330235257765601, 0.1260373001767312, 0.1496954378710966, -0.06753249602020307, -0.2391178713572945, 0.033401861693189795, -0.14753661999562184, -0.1351447726740351, -0.21199702712780064, -0.004289433534397593, 0.046766120528440674, -0.3068545912795664, 0.0366128417648643, -0.04370310117572536, 0.04680267607454372, -0.09097957880855356, -0.16338028217920794, -0.06290147243868872, 0.0727815761428597, -0.020905047766317995, 0.05292396189114235, 0.1445538769970393, -0.07444906981815402, -0.10261940014647455, 0.42618340958305245, -0.01762168813371958, -0.17598823581265505, 0.20922440798971387, -0.11837218311100199, -0.0978920487348802, 0.11783017167189372, 0.1210313751180162, 0.1096535769765826, -0.1339252415248427, 0.09409700417318824, 0.025599419505481072, 0.1368159203160575, 0.004515537320943185, 0.11396255814756512, 0.18577617249196635, 0.15451024000288388, 0.005816576711042633, 0.05216578365428446, -0.06822926570663317, -0.09049405307150003, -0.2433290411640146, -0.1555471866749178, -0.24246068151313915, 0.01193497140433993, -0.044602510910682826, -0.20802027616108762, 0.39540037022143937, 0.18544691115586534, 0.12247524724482407, -0.03723728299263199, 0.26907615381287797, 0.09020037505414412, 0.08870756511014559, 0.026050675496479818, 0.23728438918400743, 0.15972215066372558, 0.059218693410785214, -0.2578472157071381, 0.046248816488331505, 0.07689673386581825]
|
1,803.06375
|
Mobile phone records to feed activity-based travel demand models: MATSim
for studying a cordon toll policy in Barcelona
|
Activity-based models appeared as an answer to the limitations of the
traditional trip-based and tour-based four-stage models. The fundamental
assumption of activity-based models is that travel demand is originated from
people performing their daily activities. This is why they include a consistent
representation of time, of the persons and households, time-dependent routing,
and microsimulation of travel demand and traffic. In spite of their potential
to simulate traffic demand management policies, their practical application is
still limited. One of the main reasons is that these models require a huge
amount of very detailed input data hard to get with surveys. However, the
pervasive use of mobile devices has brought a valuable new source of data. The
work presented here has a twofold objective: first, to demonstrate the
capability of mobile phone records to feed activity-based transport models,
and, second, to assert the advantages of using activity-based models to
estimate the effects of traffic demand management policies. Activity diaries
for the metropolitan area of Barcelona are reconstructed from mobile phone
records. This information is then employed as input for building a transport
MATSim model of the city. The model calibration and validation process proves
the quality of the activity diaries obtained. The possible impacts of a cordon
toll policy applied to two different areas of the city and at different times
of the day is then studied. Our results show the way in which the modal share
is modified in each of the considered scenario. The possibility of evaluating
the effects of the policy at both aggregated and traveller level, together with
the ability of the model to capture policy impacts beyond the cordon toll area
confirm the advantages of activity-based models for the evaluation of traffic
demand management policies.
|
physics.soc-ph cs.SI
|
activitybased models appeared as an answer to the limitations of the traditional tripbased and tourbased fourstage models the fundamental assumption of activitybased models is that travel demand is originated from people performing their daily activities this is why they include a consistent representation of time of the persons and households timedependent routing and microsimulation of travel demand and traffic in spite of their potential to simulate traffic demand management policies their practical application is still limited one of the main reasons is that these models require a huge amount of very detailed input data hard to get with surveys however the pervasive use of mobile devices has brought a valuable new source of data the work presented here has a twofold objective first to demonstrate the capability of mobile phone records to feed activitybased transport models and second to assert the advantages of using activitybased models to estimate the effects of traffic demand management policies activity diaries for the metropolitan area of barcelona are reconstructed from mobile phone records this information is then employed as input for building a transport matsim model of the city the model calibration and validation process proves the quality of the activity diaries obtained the possible impacts of a cordon toll policy applied to two different areas of the city and at different times of the day is then studied our results show the way in which the modal share is modified in each of the considered scenario the possibility of evaluating the effects of the policy at both aggregated and traveller level together with the ability of the model to capture policy impacts beyond the cordon toll area confirm the advantages of activitybased models for the evaluation of traffic demand management policies
|
[['activitybased', 'models', 'appeared', 'as', 'an', 'answer', 'to', 'the', 'limitations', 'of', 'the', 'traditional', 'tripbased', 'and', 'tourbased', 'fourstage', 'models', 'the', 'fundamental', 'assumption', 'of', 'activitybased', 'models', 'is', 'that', 'travel', 'demand', 'is', 'originated', 'from', 'people', 'performing', 'their', 'daily', 'activities', 'this', 'is', 'why', 'they', 'include', 'a', 'consistent', 'representation', 'of', 'time', 'of', 'the', 'persons', 'and', 'households', 'timedependent', 'routing', 'and', 'microsimulation', 'of', 'travel', 'demand', 'and', 'traffic', 'in', 'spite', 'of', 'their', 'potential', 'to', 'simulate', 'traffic', 'demand', 'management', 'policies', 'their', 'practical', 'application', 'is', 'still', 'limited', 'one', 'of', 'the', 'main', 'reasons', 'is', 'that', 'these', 'models', 'require', 'a', 'huge', 'amount', 'of', 'very', 'detailed', 'input', 'data', 'hard', 'to', 'get', 'with', 'surveys', 'however', 'the', 'pervasive', 'use', 'of', 'mobile', 'devices', 'has', 'brought', 'a', 'valuable', 'new', 'source', 'of', 'data', 'the', 'work', 'presented', 'here', 'has', 'a', 'twofold', 'objective', 'first', 'to', 'demonstrate', 'the', 'capability', 'of', 'mobile', 'phone', 'records', 'to', 'feed', 'activitybased', 'transport', 'models', 'and', 'second', 'to', 'assert', 'the', 'advantages', 'of', 'using', 'activitybased', 'models', 'to', 'estimate', 'the', 'effects', 'of', 'traffic', 'demand', 'management', 'policies', 'activity', 'diaries', 'for', 'the', 'metropolitan', 'area', 'of', 'barcelona', 'are', 'reconstructed', 'from', 'mobile', 'phone', 'records', 'this', 'information', 'is', 'then', 'employed', 'as', 'input', 'for', 'building', 'a', 'transport', 'matsim', 'model', 'of', 'the', 'city', 'the', 'model', 'calibration', 'and', 'validation', 'process', 'proves', 'the', 'quality', 'of', 'the', 'activity', 'diaries', 'obtained', 'the', 'possible', 'impacts', 'of', 'a', 'cordon', 'toll', 'policy', 'applied', 'to', 'two', 'different', 'areas', 'of', 'the', 'city', 'and', 'at', 'different', 'times', 'of', 'the', 'day', 'is', 'then', 'studied', 'our', 'results', 'show', 'the', 'way', 'in', 'which', 'the', 'modal', 'share', 'is', 'modified', 'in', 'each', 'of', 'the', 'considered', 'scenario', 'the', 'possibility', 'of', 'evaluating', 'the', 'effects', 'of', 'the', 'policy', 'at', 'both', 'aggregated', 'and', 'traveller', 'level', 'together', 'with', 'the', 'ability', 'of', 'the', 'model', 'to', 'capture', 'policy', 'impacts', 'beyond', 'the', 'cordon', 'toll', 'area', 'confirm', 'the', 'advantages', 'of', 'activitybased', 'models', 'for', 'the', 'evaluation', 'of', 'traffic', 'demand', 'management', 'policies']]
|
[-0.09681660956604747, 0.039877821829526205, -0.08279754690871849, 0.08009737437208021, -0.082345263929185, -0.12627051549006096, 0.1072228234441636, 0.37372667706591195, -0.2633263401418242, -0.3355972036968549, 0.12626211379341531, -0.3094237705587711, -0.12216116240587083, 0.2109717872381353, -0.13313455884443254, 0.0596449691982625, 0.07724874887761371, 0.05040407999382603, 0.009517437479381686, -0.26697490457445383, 0.27198403953774636, 0.06087079470236064, 0.35118412233161095, 0.08281569180249328, 0.10127638597213531, -0.021480647651937752, -0.07588406421349082, -0.008649341988337922, -0.06527125883609111, 0.17535324939026523, 0.2865318829229143, 0.19184526968845755, 0.31241508520824807, -0.4764773192992565, -0.2526130579489047, 0.07508122256356882, 0.0960702277510099, 0.06764076660677436, -0.027754300642056837, -0.2864645747795806, 0.07593165069300367, -0.2099790866011229, -0.11764045297671363, -0.04053448131931028, 0.012284985316333584, 0.04593694812255833, -0.2581123579129524, 0.015818402149819468, 0.004821171410198153, 0.06835095449305684, -0.06010162845176266, -0.08561103335175087, -0.043432115327114315, 0.23419276151058435, 0.10316824051656241, -0.030193554034065553, 0.14918860148566343, -0.16459654647165017, -0.13665095171141012, 0.41986700627480594, -0.006005733738764858, -0.13803414500344702, 0.17330527567701468, -0.0811626272945022, -0.12978763040155172, 0.07547273572319528, 0.24489505192027985, 0.07385057807115233, -0.1889255992059012, 0.007134846250959476, -0.015018641818347583, 0.15913834506285074, 0.01161863234199085, 0.011353048024548245, 0.19771096930252124, 0.22959948077955297, 0.07434928582400792, 0.09242393833939248, -0.10696307821264885, -0.10833053515660807, -0.23119043833149833, -0.1281799109583773, -0.15817670379666954, 0.005625168808070208, -0.07543172460815109, -0.13282749169952118, 0.4174925834756233, 0.21849694449215157, 0.1488144727617266, 0.06794469042977935, 0.3431130484743437, 0.07271423485641643, 0.08787526416225018, 0.08066403021721143, 0.16694254301075206, 0.01998310723763392, 0.1948968683136627, -0.18325839931004712, 0.11817582130586256, -0.014630095996323342]
|
1,803.06376
|
A Generalised Method for Empirical Game Theoretic Analysis
|
This paper provides theoretical bounds for empirical game theoretical
analysis of complex multi-agent interactions. We provide insights in the
empirical meta game showing that a Nash equilibrium of the meta-game is an
approximate Nash equilibrium of the true underlying game. We investigate and
show how many data samples are required to obtain a close enough approximation
of the underlying game. Additionally, we extend the meta-game analysis
methodology to asymmetric games. The state-of-the-art has only considered
empirical games in which agents have access to the same strategy sets and the
payoff structure is symmetric, implying that agents are interchangeable.
Finally, we carry out an empirical illustration of the generalised method in
several domains, illustrating the theory and evolutionary dynamics of several
versions of the AlphaGo algorithm (symmetric), the dynamics of the Colonel
Blotto game played by human players on Facebook (symmetric), and an example of
a meta-game in Leduc Poker (asymmetric), generated by the PSRO multi-agent
learning algorithm.
|
cs.GT cs.MA
|
this paper provides theoretical bounds for empirical game theoretical analysis of complex multiagent interactions we provide insights in the empirical meta game showing that a nash equilibrium of the metagame is an approximate nash equilibrium of the true underlying game we investigate and show how many data samples are required to obtain a close enough approximation of the underlying game additionally we extend the metagame analysis methodology to asymmetric games the stateoftheart has only considered empirical games in which agents have access to the same strategy sets and the payoff structure is symmetric implying that agents are interchangeable finally we carry out an empirical illustration of the generalised method in several domains illustrating the theory and evolutionary dynamics of several versions of the alphago algorithm symmetric the dynamics of the colonel blotto game played by human players on facebook symmetric and an example of a metagame in leduc poker asymmetric generated by the psro multiagent learning algorithm
|
[['this', 'paper', 'provides', 'theoretical', 'bounds', 'for', 'empirical', 'game', 'theoretical', 'analysis', 'of', 'complex', 'multiagent', 'interactions', 'we', 'provide', 'insights', 'in', 'the', 'empirical', 'meta', 'game', 'showing', 'that', 'a', 'nash', 'equilibrium', 'of', 'the', 'metagame', 'is', 'an', 'approximate', 'nash', 'equilibrium', 'of', 'the', 'true', 'underlying', 'game', 'we', 'investigate', 'and', 'show', 'how', 'many', 'data', 'samples', 'are', 'required', 'to', 'obtain', 'a', 'close', 'enough', 'approximation', 'of', 'the', 'underlying', 'game', 'additionally', 'we', 'extend', 'the', 'metagame', 'analysis', 'methodology', 'to', 'asymmetric', 'games', 'the', 'stateoftheart', 'has', 'only', 'considered', 'empirical', 'games', 'in', 'which', 'agents', 'have', 'access', 'to', 'the', 'same', 'strategy', 'sets', 'and', 'the', 'payoff', 'structure', 'is', 'symmetric', 'implying', 'that', 'agents', 'are', 'interchangeable', 'finally', 'we', 'carry', 'out', 'an', 'empirical', 'illustration', 'of', 'the', 'generalised', 'method', 'in', 'several', 'domains', 'illustrating', 'the', 'theory', 'and', 'evolutionary', 'dynamics', 'of', 'several', 'versions', 'of', 'the', 'alphago', 'algorithm', 'symmetric', 'the', 'dynamics', 'of', 'the', 'colonel', 'blotto', 'game', 'played', 'by', 'human', 'players', 'on', 'facebook', 'symmetric', 'and', 'an', 'example', 'of', 'a', 'metagame', 'in', 'leduc', 'poker', 'asymmetric', 'generated', 'by', 'the', 'psro', 'multiagent', 'learning', 'algorithm']]
|
[-0.0902250884605014, -0.009239103817577463, -0.18685250997040598, 0.13550435682643014, -0.050225310307885906, -0.15759703399803324, 0.08099562058130362, 0.4270566405170852, -0.2565078322069755, -0.3023481967526779, 0.0766604425664398, -0.25790447413114603, -0.2204582059257634, 0.1099094105053954, -0.08944592414761947, 0.011607706351027747, 0.0737675785703976, 0.048843136423743466, 0.039581069266008344, -0.28219238555675763, 0.3205359307937858, 0.027614933945784334, 0.23925033330347886, 0.032978649793940176, 0.09174716126864811, -0.007594552015660295, -0.018568246586805885, 0.058219449386997205, -0.15158147448838827, 0.12387319135696147, 0.2862122119967915, 0.19935604243481436, 0.36348035298792086, -0.4168626683627724, -0.1308529400800586, 0.14818212793914565, 0.11936259914484694, 0.11788620030919719, -0.06020057334632844, -0.3082031125950206, 0.06535972939555053, -0.1868765467279561, -0.09850576421198477, -0.09970573325208418, -0.02407453460103512, 0.05125603010094944, -0.3166339200328899, -0.03036302502213675, 0.07771300275032972, 0.0889351721081859, -0.06713530307659393, -0.14243682853990253, 0.003932257696013352, 0.16042872037513145, 0.014956830932527402, -0.052390799893267975, 0.12663998234139126, -0.13099758204363382, -0.2172609450722671, 0.35667479371319816, -0.03707085793821592, -0.1621757680995117, 0.1584566574748368, -0.055687403442800806, -0.1363243244530538, 0.07673492754667191, 0.18868016566168058, 0.13810444212144918, -0.13391278413723884, 0.08737067023594715, -0.13953634782747668, 0.15096842942560673, 0.024319536017793807, -0.020248288394005342, 0.1433490609548464, 0.19075892370336564, 0.13298644972661106, 0.136412959379755, 0.01452351296112938, -0.27014499035171546, -0.24559810863819662, -0.10151727436033262, -0.14290845018787796, 0.03808078082770726, -0.1237172314235021, -0.15021149573809092, 0.3603361169837273, 0.1486803159580394, 0.1093252844527174, 0.09672793669842635, 0.27989032180018864, 0.06827388573764188, -0.0403323691778751, 0.08754030039391605, 0.21764857648237115, 0.11603660660256056, 0.11613006480512725, -0.22501545425676472, 0.11264755338308799, 0.019230209055926154]
|
1,803.06377
|
Spread of Information with Confirmation Bias in Cyber-Social Networks
|
This paper provides a model to investigate information spreading over
cyber-social network of agents communicating with each other. The cyber-social
network considered here comprises individuals and news agencies. Each
individual holds a belief represented by a scalar. Individuals receive
information from news agencies that are closer to their belief, confirmation
bias is explicitly incorporated into the model. The proposed dynamics of
cyber-social networks is adopted from DeGroot-Friedkin model, where the
individual's opinion update mechanism is a convex combination of his innate
opinion, his neighbors' opinions at the previous time step (obtained from the
social network), and the opinions passed along by news agencies from cyber
layer which he follows. The characteristics of the interdependent social and
cyber networks are radically different here: the social network relies on trust
and hence static while the news agencies are highly dynamic since they are
weighted as a function of the distance between an individual state and the
state of news agency to account for confirmation bias. The conditions for
convergence of the aforementioned dynamics to a unique equilibrium are
characterized. The estimation and exact computation of the steady-state values
under non-linear and linear state-dependent weight functions are provided.
Finally, the impact of polarization in the opinions of news agencies on the
public opinion evolution is numerically analyzed in the context of the
well-known Krackhardt's advice network.
|
cs.SI cs.MA cs.SY math.OC
|
this paper provides a model to investigate information spreading over cybersocial network of agents communicating with each other the cybersocial network considered here comprises individuals and news agencies each individual holds a belief represented by a scalar individuals receive information from news agencies that are closer to their belief confirmation bias is explicitly incorporated into the model the proposed dynamics of cybersocial networks is adopted from degrootfriedkin model where the individuals opinion update mechanism is a convex combination of his innate opinion his neighbors opinions at the previous time step obtained from the social network and the opinions passed along by news agencies from cyber layer which he follows the characteristics of the interdependent social and cyber networks are radically different here the social network relies on trust and hence static while the news agencies are highly dynamic since they are weighted as a function of the distance between an individual state and the state of news agency to account for confirmation bias the conditions for convergence of the aforementioned dynamics to a unique equilibrium are characterized the estimation and exact computation of the steadystate values under nonlinear and linear statedependent weight functions are provided finally the impact of polarization in the opinions of news agencies on the public opinion evolution is numerically analyzed in the context of the wellknown krackhardts advice network
|
[['this', 'paper', 'provides', 'a', 'model', 'to', 'investigate', 'information', 'spreading', 'over', 'cybersocial', 'network', 'of', 'agents', 'communicating', 'with', 'each', 'other', 'the', 'cybersocial', 'network', 'considered', 'here', 'comprises', 'individuals', 'and', 'news', 'agencies', 'each', 'individual', 'holds', 'a', 'belief', 'represented', 'by', 'a', 'scalar', 'individuals', 'receive', 'information', 'from', 'news', 'agencies', 'that', 'are', 'closer', 'to', 'their', 'belief', 'confirmation', 'bias', 'is', 'explicitly', 'incorporated', 'into', 'the', 'model', 'the', 'proposed', 'dynamics', 'of', 'cybersocial', 'networks', 'is', 'adopted', 'from', 'degrootfriedkin', 'model', 'where', 'the', 'individuals', 'opinion', 'update', 'mechanism', 'is', 'a', 'convex', 'combination', 'of', 'his', 'innate', 'opinion', 'his', 'neighbors', 'opinions', 'at', 'the', 'previous', 'time', 'step', 'obtained', 'from', 'the', 'social', 'network', 'and', 'the', 'opinions', 'passed', 'along', 'by', 'news', 'agencies', 'from', 'cyber', 'layer', 'which', 'he', 'follows', 'the', 'characteristics', 'of', 'the', 'interdependent', 'social', 'and', 'cyber', 'networks', 'are', 'radically', 'different', 'here', 'the', 'social', 'network', 'relies', 'on', 'trust', 'and', 'hence', 'static', 'while', 'the', 'news', 'agencies', 'are', 'highly', 'dynamic', 'since', 'they', 'are', 'weighted', 'as', 'a', 'function', 'of', 'the', 'distance', 'between', 'an', 'individual', 'state', 'and', 'the', 'state', 'of', 'news', 'agency', 'to', 'account', 'for', 'confirmation', 'bias', 'the', 'conditions', 'for', 'convergence', 'of', 'the', 'aforementioned', 'dynamics', 'to', 'a', 'unique', 'equilibrium', 'are', 'characterized', 'the', 'estimation', 'and', 'exact', 'computation', 'of', 'the', 'steadystate', 'values', 'under', 'nonlinear', 'and', 'linear', 'statedependent', 'weight', 'functions', 'are', 'provided', 'finally', 'the', 'impact', 'of', 'polarization', 'in', 'the', 'opinions', 'of', 'news', 'agencies', 'on', 'the', 'public', 'opinion', 'evolution', 'is', 'numerically', 'analyzed', 'in', 'the', 'context', 'of', 'the', 'wellknown', 'krackhardts', 'advice', 'network']]
|
[-0.11708804031321361, 0.06481911140477604, -0.07601334907859982, 0.06376048429626888, -0.11964691447557656, -0.15762911493902518, 0.10933197729421086, 0.3956089899896105, -0.2649566869715003, -0.2567536578202545, 0.06846520324595766, -0.32460560144296946, -0.1710886870283266, 0.1150491272523214, -0.05674852576143852, 0.012214278760055527, 0.039307321007300854, 0.08553691497364921, 0.0436214273664975, -0.31190921809950284, 0.3411609207492973, 0.052507603172455064, 0.32700163063764437, 0.033302609421126964, 0.11966046665674034, 0.022796264248733062, -0.08254295440323885, 0.016408818727463585, -0.09736647916819526, 0.11624463921441015, 0.29803049159779177, 0.20070979684265539, 0.39355824059794237, -0.42626874955713484, -0.2091873437917954, 0.08648977388581887, 0.09279107373633794, 0.10840592963147007, 0.022288150092453232, -0.3810783160887993, 0.03660334630100884, -0.20805694909678613, -0.07846574502216126, -0.04041762632863897, -0.004594385110242752, 0.07083303740038223, -0.25726944991207845, 0.05831881320091474, 0.026014804381735188, 0.060805165415604684, -0.05597438952350997, -0.1027792838157777, -0.0707450363191989, 0.20797138693721573, 0.09115118895304461, -0.02343274665069286, 0.1773345888181978, -0.16898172318250476, -0.13745820272015408, 0.3742547045303133, -0.008962026834561002, -0.17190716641583384, 0.1327104273089312, -0.06007719973954184, -0.1052568996609126, 0.06535397318292058, 0.22401354891653152, 0.0629905409768491, -0.20391119311818426, 0.0013408353659240821, -0.05016019185712653, 0.17609655454043807, 0.03585289510681123, 0.01329968829175683, 0.20180148145939839, 0.16298670345508062, 0.07431084214555175, 0.07906195873654585, -0.018838371377805824, -0.1834834006201526, -0.2137970164112304, -0.1023981769056573, -0.1798415579154436, 0.045478972234667146, -0.12342210121682767, -0.11391397122076541, 0.41076773128601735, 0.14277376620007068, 0.1554105826966765, 0.08201969649920432, 0.28012774156765685, 0.037678352631774686, 0.03296458214049482, 0.1021347324522588, 0.2090679992453901, 0.03888972757296478, 0.1702112850864656, -0.1573382330853612, 0.20796740406065983, 0.033303705935607636]
|
1,803.06378
|
Characterizing Ion Flows Across a Dipolarization Jet
|
The structure of dipolarization jets with finite width in the dawn-dusk
direction relevant to magnetic reconnection in the Earth's magnetotail is
explored with particle-in-cell simulations. We carry out Riemann simulations of
the evolution of the jet in the dawn-dusk, north-south plane to investigate the
dependence of the jet structure on the jet width in the dawn-dusk direction. We
find that the magnetic field and Earth-directed ion flow structure depend on
the dawn-dusk width. A reversal in the usual Hall magnetic field near the
center of the current sheet on the dusk side of larger jets is observed. For
small widths, the maximum velocity of the Earthward flow is significantly
reduced below the theoretical limit of the upstream Alfv\'en speed. However,
the ion flow speed approaches this limit once the width exceeds the ion Larmor
radius based on the normal magnetic field, $B_z$.
|
physics.space-ph physics.plasm-ph
|
the structure of dipolarization jets with finite width in the dawndusk direction relevant to magnetic reconnection in the earths magnetotail is explored with particleincell simulations we carry out riemann simulations of the evolution of the jet in the dawndusk northsouth plane to investigate the dependence of the jet structure on the jet width in the dawndusk direction we find that the magnetic field and earthdirected ion flow structure depend on the dawndusk width a reversal in the usual hall magnetic field near the center of the current sheet on the dusk side of larger jets is observed for small widths the maximum velocity of the earthward flow is significantly reduced below the theoretical limit of the upstream alfven speed however the ion flow speed approaches this limit once the width exceeds the ion larmor radius based on the normal magnetic field b_z
|
[['the', 'structure', 'of', 'dipolarization', 'jets', 'with', 'finite', 'width', 'in', 'the', 'dawndusk', 'direction', 'relevant', 'to', 'magnetic', 'reconnection', 'in', 'the', 'earths', 'magnetotail', 'is', 'explored', 'with', 'particleincell', 'simulations', 'we', 'carry', 'out', 'riemann', 'simulations', 'of', 'the', 'evolution', 'of', 'the', 'jet', 'in', 'the', 'dawndusk', 'northsouth', 'plane', 'to', 'investigate', 'the', 'dependence', 'of', 'the', 'jet', 'structure', 'on', 'the', 'jet', 'width', 'in', 'the', 'dawndusk', 'direction', 'we', 'find', 'that', 'the', 'magnetic', 'field', 'and', 'earthdirected', 'ion', 'flow', 'structure', 'depend', 'on', 'the', 'dawndusk', 'width', 'a', 'reversal', 'in', 'the', 'usual', 'hall', 'magnetic', 'field', 'near', 'the', 'center', 'of', 'the', 'current', 'sheet', 'on', 'the', 'dusk', 'side', 'of', 'larger', 'jets', 'is', 'observed', 'for', 'small', 'widths', 'the', 'maximum', 'velocity', 'of', 'the', 'earthward', 'flow', 'is', 'significantly', 'reduced', 'below', 'the', 'theoretical', 'limit', 'of', 'the', 'upstream', 'alfven', 'speed', 'however', 'the', 'ion', 'flow', 'speed', 'approaches', 'this', 'limit', 'once', 'the', 'width', 'exceeds', 'the', 'ion', 'larmor', 'radius', 'based', 'on', 'the', 'normal', 'magnetic', 'field', 'b_z']]
|
[-0.18444585341724082, 0.20786888855443875, -0.02843008739349078, 0.06261655926855254, -0.0751587966142196, -0.028116453219283844, -0.030835125047687283, 0.3954248425327766, -0.26912052688044563, -0.2726377507435604, 0.043668808034312924, -0.2274772736676772, 0.02240121058962295, 0.21834726499813334, 0.05069115824840018, -0.0002739902054497474, 0.05668733865153831, 0.043358469949248184, -0.07347934809431407, -0.13092288649706563, 0.261929723421033, 0.11066077743094532, 0.29663679532339454, 0.09400591237509859, 0.06316988675159887, -0.044641808062319606, 0.02305584560266473, 0.07635232429741554, -0.17654739876637854, 0.03542290090150397, 0.0919609207243488, 0.01726227585869041, 0.19869980905233706, -0.452975978550147, -0.2008464449793625, -0.032445647547178914, 0.18062209102905577, 0.07634181721942683, -0.005045087483357376, -0.24114068003345124, 0.09242952688479088, -0.10831525138067738, -0.1594215313548183, 0.07569894567131996, 0.034127649640448024, 0.038292513460963705, -0.21914905844162821, 0.11342057895282624, 0.0446201087447854, 0.1136479755784844, -0.049165166312710604, -0.09640870675523307, -0.09288699148406446, 0.045877488082419086, 0.1495909933656664, 0.09928809615298057, 0.247540211164627, -0.17331687449707164, -0.08538386548056044, 0.3629953588529582, -0.06710293510777902, -0.14809291681248538, 0.12578811632587353, -0.30313082943788505, -0.07174970283710831, 0.20017223214914262, 0.1939032257626384, 0.0994880836929234, -0.022653081268646007, 0.04751934814816144, -0.08008648618042442, 0.13812129989814756, 0.06863253713834663, -0.03374620046057496, 0.25702149636099036, 0.1599239146133596, 0.08187071817786053, 0.10044711272174436, -0.23647713266693476, -0.08752064078121485, -0.3092896594784, -0.1259482328347127, -0.10560880160093648, 0.034310573748063664, -0.09553447044132733, -0.17857862869277596, 0.43041103415873266, 0.17772553422370216, 0.20125753873250854, -0.051003430401053755, 0.3326125264325192, 0.1431554954558034, 0.08130402397036447, 0.16506468806035396, 0.32581623062543885, 0.23388312179857576, 0.17238465731333888, -0.3326546180071834, 0.09219802714536675, 0.06513140800172909]
|
1,803.06379
|
Photon detector system timing performance in the DUNE 35-ton prototype
liquid argon time projection chamber
|
The 35-ton prototype for the Deep Underground Neutrino Experiment far
detector was a single-phase liquid argon time projection chamber with an
integrated photon detector system, all situated inside a membrane cryostat. The
detector took cosmic-ray data for six weeks during the period of February 1,
2016 to March 12, 2016. The performance of the photon detection system was
checked with these data. An installed photon detector was demonstrated to
measure the arrival times of cosmic-ray muons with a resolution better than 32
ns, limited by the timing of the trigger system. A measurement of the timing
resolution using closely-spaced calibration pulses yielded a resolution of 15
ns for pulses at a level of 6 photo-electrons. Scintillation light from
cosmic-ray muons was observed to be attenuated with increasing distance with a
characteristic length of $155 \pm 28$ cm.
|
physics.ins-det hep-ex
|
the 35ton prototype for the deep underground neutrino experiment far detector was a singlephase liquid argon time projection chamber with an integrated photon detector system all situated inside a membrane cryostat the detector took cosmicray data for six weeks during the period of february 1 2016 to march 12 2016 the performance of the photon detection system was checked with these data an installed photon detector was demonstrated to measure the arrival times of cosmicray muons with a resolution better than 32 ns limited by the timing of the trigger system a measurement of the timing resolution using closelyspaced calibration pulses yielded a resolution of 15 ns for pulses at a level of 6 photoelectrons scintillation light from cosmicray muons was observed to be attenuated with increasing distance with a characteristic length of 155 pm 28 cm
|
[['the', '35ton', 'prototype', 'for', 'the', 'deep', 'underground', 'neutrino', 'experiment', 'far', 'detector', 'was', 'a', 'singlephase', 'liquid', 'argon', 'time', 'projection', 'chamber', 'with', 'an', 'integrated', 'photon', 'detector', 'system', 'all', 'situated', 'inside', 'a', 'membrane', 'cryostat', 'the', 'detector', 'took', 'cosmicray', 'data', 'for', 'six', 'weeks', 'during', 'the', 'period', 'of', 'february', '1', '2016', 'to', 'march', '12', '2016', 'the', 'performance', 'of', 'the', 'photon', 'detection', 'system', 'was', 'checked', 'with', 'these', 'data', 'an', 'installed', 'photon', 'detector', 'was', 'demonstrated', 'to', 'measure', 'the', 'arrival', 'times', 'of', 'cosmicray', 'muons', 'with', 'a', 'resolution', 'better', 'than', '32', 'ns', 'limited', 'by', 'the', 'timing', 'of', 'the', 'trigger', 'system', 'a', 'measurement', 'of', 'the', 'timing', 'resolution', 'using', 'closelyspaced', 'calibration', 'pulses', 'yielded', 'a', 'resolution', 'of', '15', 'ns', 'for', 'pulses', 'at', 'a', 'level', 'of', '6', 'photoelectrons', 'scintillation', 'light', 'from', 'cosmicray', 'muons', 'was', 'observed', 'to', 'be', 'attenuated', 'with', 'increasing', 'distance', 'with', 'a', 'characteristic', 'length', 'of', '155', 'pm', '28', 'cm']]
|
[-0.06155547990826616, 0.19124576624209808, -0.07465435119742966, 0.01945620380437878, 0.025986851004691905, -0.14482939707608344, 0.011187382449861616, 0.3828506205977379, -0.1565648488159401, -0.4419691990102258, 0.07861056440400288, -0.3701290602193159, 0.07465746920227984, 0.2333444970769479, -0.020774577321550598, 0.07084569537918843, 0.12722913702600636, -0.012800454626010512, -0.07993743912426426, -0.24253412549767425, 0.1405511805051527, 0.21053756480871336, 0.2668129094886621, 0.02227289878304445, 0.2257704971867925, -0.02732605635195368, -0.05316338020223638, -0.0865078877626836, -0.05604017225628281, 0.0025616537245428737, 0.25687739491866735, 0.08825483213534907, 0.13630190670065692, -0.44191181550131126, -0.17277992394006372, 0.0836046451689018, 0.0715524218052023, 0.0007144651214783901, -0.030217159553157055, -0.3436874360263841, 0.0653946869116386, -0.19222185352598042, -0.14397003099678413, 0.12332844048711088, 0.026413704159066957, 0.03049462653507362, -0.2153188162466155, 0.026251842867007807, -0.021249160639640382, 0.1057039120933041, -0.04762593649545178, -0.11716057139753555, 0.06585991220987018, 0.06770970707635998, 0.0009597142857006367, 0.08121605524609228, 0.18163297978154494, -0.07275723672458245, -0.10859478726685184, 0.2929795390844126, -0.06584108999798927, -0.04204976827125339, 0.14798751656267353, -0.21948189713293687, -0.04283874642501092, 0.29162870363250154, 0.1774371412188082, 0.07587547717519234, -0.20030351497253457, -0.014777239504516782, 0.012132743842598489, 0.313484608387465, 0.13244325412533192, -0.0057417449921451725, 0.22387548719416372, 0.28941029645776484, 0.06851214651011533, 0.06677483078280655, -0.29823171867824655, 0.05192581256372197, -0.29439801573650637, -0.14314443149658687, -0.13503464260772008, 0.10242900408133317, -0.039908996560638225, -0.04535735055790557, 0.4179797907400986, 0.07297111135523986, 0.14238373336197316, -0.013185736327774493, 0.29809378376504514, 0.0671348449160338, 0.06357853714539755, 0.03669236459331039, 0.31715651632711184, 0.11545710241582985, 0.1874109726974412, -0.21119533398921383, 0.010347013306968352, -0.0022709039913024753]
|
1,803.0638
|
Distributed Optimization for Second-Order Multi-Agent Systems with
Dynamic Event-Triggered Communication
|
In this paper, we propose a fully distributed algorithm for second-order
continuous-time multi-agent systems to solve the distributed optimization
problem. The global objective function is a sum of private cost functions
associated with the individual agents and the interaction between agents is
described by a weighted undirected graph. We show the exponential convergence
of the proposed algorithm if the underlying graph is connected, each private
cost function is locally gradient-Lipschitz-continuous, and the global
objective function is restricted strongly convex with respect to the global
minimizer. Moreover, to reduce the overall need of communication, we then
propose a dynamic event-triggered communication mechanism that is free of Zeno
behavior. It is shown that the exponential convergence is achieved if the
private cost functions are also globally gradient-Lipschitz-continuous.
Numerical simulations are provided to illustrate the effectiveness of the
theoretical results.
|
math.OC
|
in this paper we propose a fully distributed algorithm for secondorder continuoustime multiagent systems to solve the distributed optimization problem the global objective function is a sum of private cost functions associated with the individual agents and the interaction between agents is described by a weighted undirected graph we show the exponential convergence of the proposed algorithm if the underlying graph is connected each private cost function is locally gradientlipschitzcontinuous and the global objective function is restricted strongly convex with respect to the global minimizer moreover to reduce the overall need of communication we then propose a dynamic eventtriggered communication mechanism that is free of zeno behavior it is shown that the exponential convergence is achieved if the private cost functions are also globally gradientlipschitzcontinuous numerical simulations are provided to illustrate the effectiveness of the theoretical results
|
[['in', 'this', 'paper', 'we', 'propose', 'a', 'fully', 'distributed', 'algorithm', 'for', 'secondorder', 'continuoustime', 'multiagent', 'systems', 'to', 'solve', 'the', 'distributed', 'optimization', 'problem', 'the', 'global', 'objective', 'function', 'is', 'a', 'sum', 'of', 'private', 'cost', 'functions', 'associated', 'with', 'the', 'individual', 'agents', 'and', 'the', 'interaction', 'between', 'agents', 'is', 'described', 'by', 'a', 'weighted', 'undirected', 'graph', 'we', 'show', 'the', 'exponential', 'convergence', 'of', 'the', 'proposed', 'algorithm', 'if', 'the', 'underlying', 'graph', 'is', 'connected', 'each', 'private', 'cost', 'function', 'is', 'locally', 'gradientlipschitzcontinuous', 'and', 'the', 'global', 'objective', 'function', 'is', 'restricted', 'strongly', 'convex', 'with', 'respect', 'to', 'the', 'global', 'minimizer', 'moreover', 'to', 'reduce', 'the', 'overall', 'need', 'of', 'communication', 'we', 'then', 'propose', 'a', 'dynamic', 'eventtriggered', 'communication', 'mechanism', 'that', 'is', 'free', 'of', 'zeno', 'behavior', 'it', 'is', 'shown', 'that', 'the', 'exponential', 'convergence', 'is', 'achieved', 'if', 'the', 'private', 'cost', 'functions', 'are', 'also', 'globally', 'gradientlipschitzcontinuous', 'numerical', 'simulations', 'are', 'provided', 'to', 'illustrate', 'the', 'effectiveness', 'of', 'the', 'theoretical', 'results']]
|
[-0.15971667360152222, 0.03282578524409069, -0.09057007364031894, 0.06725869169372513, -0.0853872344173767, -0.15643917785750494, 0.05920271579676342, 0.42367722833598104, -0.35350412221418487, -0.2577092883681568, 0.09636167480213637, -0.25279909410962353, -0.21320810923007905, 0.12731050210142578, -0.11385584145232483, 0.11482371272243283, 0.06524259760561917, 0.051033724658191205, -0.01603760277395378, -0.31568300901541346, 0.30113633393775674, 0.03341281910392421, 0.2684122960738562, 0.0583196679647598, 0.12233863676104832, 0.012277923486436958, 0.009748003631830215, 0.04514950027482377, -0.099323752090115, 0.12788128787910358, 0.2636139235084152, 0.19211280723274857, 0.37616100245051914, -0.3989272625013082, -0.15756492836883776, 0.18242653680068474, 0.13382086739357973, 0.04571869856229535, -0.033968659214399476, -0.2425965858830346, 0.13215597003387908, -0.15063138425488162, -0.07976483740947313, -0.07262184857218354, -0.045084914385720536, 0.0866841835125039, -0.3482369665608362, 0.05275487925801254, 0.01863364197348279, 0.011037026490602229, -0.07957048906289317, -0.05289471193251234, -0.009802940570645862, 0.11400566243273379, 0.022114617678474772, 0.059106254522447235, 0.12216501668164576, -0.09311999834349585, -0.15806994986961836, 0.35486806928766546, -0.01596390909894749, -0.25973410974084227, 0.16252011692203167, -0.08160033300863924, -0.10068884239773508, 0.12514554327698768, 0.20046182586639016, 0.12132474931853789, -0.18317955358436813, 0.11284541279790035, -0.06420232988204118, 0.17270186343402774, -0.04152008567557291, 0.01176584593054873, 0.09270243689253996, 0.20396766778150643, 0.20863221436738968, 0.17925965462259397, 0.023673948174756435, -0.16847870533389073, -0.28924255063843535, -0.11662381696342318, -0.24039119171427079, -0.0026690443753506297, -0.1099517872865329, -0.13649113152102843, 0.3931957820499385, 0.12323842207314792, 0.1498436806033607, 0.17258122845000967, 0.35588958691115735, 0.15159941447415837, 0.013554715826089874, 0.15841975689691026, 0.20664639088187228, 0.09162029498084276, 0.058408150083764834, -0.2585552885404064, 0.1360118592640868, 0.08159928075900233]
|
1,803.06381
|
An Edge Computing Empowered Radio Access Network With UAV-Mounted FSO
Fronthaul and Backhaul: Key Challenges and Approaches
|
One promising approach to address the supply-demand mismatch between the
terrestrial infrastructure and the temporary and/or unexpected traffic demands
is to leverage the unmanned aerial vehicle (UAV) technologies. Motivated by the
recent advancement of UAV technologies and retromodulator based free space
optical communication, we propose a novel edge-computing empowered radio access
network architecture where the fronthaul and backhaul links are mounted on the
UAVs for rapid event response and flexible deployment. The implementation of
hardware and networking technologies for the proposed architecture are
investigated. Due to the limited payload and endurance as well as the high
mobility of UAVs, research challenges related to the communication resource
management and recent research progress are reported.
|
cs.NI
|
one promising approach to address the supplydemand mismatch between the terrestrial infrastructure and the temporary andor unexpected traffic demands is to leverage the unmanned aerial vehicle uav technologies motivated by the recent advancement of uav technologies and retromodulator based free space optical communication we propose a novel edgecomputing empowered radio access network architecture where the fronthaul and backhaul links are mounted on the uavs for rapid event response and flexible deployment the implementation of hardware and networking technologies for the proposed architecture are investigated due to the limited payload and endurance as well as the high mobility of uavs research challenges related to the communication resource management and recent research progress are reported
|
[['one', 'promising', 'approach', 'to', 'address', 'the', 'supplydemand', 'mismatch', 'between', 'the', 'terrestrial', 'infrastructure', 'and', 'the', 'temporary', 'andor', 'unexpected', 'traffic', 'demands', 'is', 'to', 'leverage', 'the', 'unmanned', 'aerial', 'vehicle', 'uav', 'technologies', 'motivated', 'by', 'the', 'recent', 'advancement', 'of', 'uav', 'technologies', 'and', 'retromodulator', 'based', 'free', 'space', 'optical', 'communication', 'we', 'propose', 'a', 'novel', 'edgecomputing', 'empowered', 'radio', 'access', 'network', 'architecture', 'where', 'the', 'fronthaul', 'and', 'backhaul', 'links', 'are', 'mounted', 'on', 'the', 'uavs', 'for', 'rapid', 'event', 'response', 'and', 'flexible', 'deployment', 'the', 'implementation', 'of', 'hardware', 'and', 'networking', 'technologies', 'for', 'the', 'proposed', 'architecture', 'are', 'investigated', 'due', 'to', 'the', 'limited', 'payload', 'and', 'endurance', 'as', 'well', 'as', 'the', 'high', 'mobility', 'of', 'uavs', 'research', 'challenges', 'related', 'to', 'the', 'communication', 'resource', 'management', 'and', 'recent', 'research', 'progress', 'are', 'reported']]
|
[-0.26472726745316677, 0.05427206823585835, 0.06265886255078414, -0.021982381249617256, -0.12783189567498268, -0.21960866421180886, 0.09485929892439626, 0.41861150443422057, -0.2542448392945581, -0.36169128119945526, 0.13099652541537596, -0.23063158033728864, -0.20584098063409328, 0.20726909683357958, -0.2043348386826043, 0.1339410626704483, 0.07419364821924045, -0.0334785411740134, 0.023137944582046165, -0.20293797006180503, 0.23418979351491198, 0.11994198012058582, 0.44515288872561887, 0.11732119532813014, 0.10144948438263243, -0.015467656965870245, -0.04628140135643493, -0.07759778946251773, -0.08580675193693786, 0.21830812758823806, 0.3502088738358126, 0.1997428116701807, 0.30803383366757, -0.5243422725460435, -0.2793843113957385, 0.0591556569891034, 0.1430653882278871, 0.00043189554733834106, -0.06473718506626093, -0.35976132717543996, 0.051625197607018385, -0.3103410121778735, -0.0859617578036737, -0.020383968281732723, 0.003687057957316922, 0.08570127255093735, -0.23547186143902352, -0.08829037965722464, -0.10871504868516715, 0.061042091768004195, -0.05436564869642983, -0.05461009095661935, 0.020718735504681163, 0.2003164354349132, 0.050198384146494544, 0.026207667158347908, 0.17001076559567066, -0.15416377798481062, -0.14394388776025283, 0.4127874483181312, 0.08326596263136747, -0.12324027684352369, 0.1917418569915689, -0.018046897613501128, -0.13037095398155857, 0.08410578735370551, 0.2647644252247441, 0.017352108489227507, -0.1838311506435275, 0.017389441123829775, 0.07598988943634373, 0.08123689672324509, 0.04473339919561306, 0.11969090826743473, 0.2234718557447195, 0.3017999597586098, 0.18316028575388205, 0.08985191870447809, -0.13015433828824455, -0.1056826911223805, -0.16118657082912669, -0.13028774426969808, -0.21977888120222935, -0.005457423087539135, -0.017154944962868263, -0.07169561807902744, 0.3159854323273541, 0.16286171863959953, 0.0987963721329198, 0.069174966780032, 0.4737004481783483, -0.0007290728905328871, 0.13661056884721054, 0.12681515525152856, 0.17228234616475, 0.029536138451452143, 0.2609984812458598, -0.20106650247708358, 0.09232758307639938, -0.03025186539883107]
|
1,803.06382
|
Harmonic spinors on the Davis hyperbolic 4-manifold
|
In this paper we use the G-spin theorem to show that the Davis hyperbolic
4-manifold admits harmonic spinors. This is the first example of a closed
hyperbolic 4-manifold that admits harmonic spinors. We also explicitly describe
the Spinor bundle of a spin hyperbolic 2- or 4-manifold and show how to
calculated the subtle sign terms in the G-spin theorem for an isometry, with
isolated fixed points, of a closed spin hyperbolic 2- or 4-manifold.
|
math.GT math.DG
|
in this paper we use the gspin theorem to show that the davis hyperbolic 4manifold admits harmonic spinors this is the first example of a closed hyperbolic 4manifold that admits harmonic spinors we also explicitly describe the spinor bundle of a spin hyperbolic 2 or 4manifold and show how to calculated the subtle sign terms in the gspin theorem for an isometry with isolated fixed points of a closed spin hyperbolic 2 or 4manifold
|
[['in', 'this', 'paper', 'we', 'use', 'the', 'gspin', 'theorem', 'to', 'show', 'that', 'the', 'davis', 'hyperbolic', '4manifold', 'admits', 'harmonic', 'spinors', 'this', 'is', 'the', 'first', 'example', 'of', 'a', 'closed', 'hyperbolic', '4manifold', 'that', 'admits', 'harmonic', 'spinors', 'we', 'also', 'explicitly', 'describe', 'the', 'spinor', 'bundle', 'of', 'a', 'spin', 'hyperbolic', '2', 'or', '4manifold', 'and', 'show', 'how', 'to', 'calculated', 'the', 'subtle', 'sign', 'terms', 'in', 'the', 'gspin', 'theorem', 'for', 'an', 'isometry', 'with', 'isolated', 'fixed', 'points', 'of', 'a', 'closed', 'spin', 'hyperbolic', '2', 'or', '4manifold']]
|
[-0.22662783303373568, 0.11950725724317315, -0.08586800654695646, 0.07244437854151821, -0.13519931026117726, -0.1529725644850751, -0.017026154738158692, 0.3562888725585229, -0.23327788841482755, -0.21099534708805182, 0.06706994674734872, -0.2695744041152097, -0.21227045490947627, 0.18507475112061444, -0.12998183279273076, -0.03358846519620636, 0.06564809371893471, 0.10354753978852485, -0.14171310025267303, -0.22553621685742778, 0.4374008835167498, -0.10819273154452644, 0.1912962394086896, 0.11486822822307413, 0.2146006868145353, -0.013314152795607475, 0.057919613387737726, -0.0012017218584849223, -0.13589776656059455, 0.09303792078847166, 0.28353230484031344, 0.014554847950568876, 0.13673051406402845, -0.40046340330327684, -0.16346121328329113, 0.19004084699711687, 0.13390329271252896, 0.02727057394647115, -0.06086513739884705, -0.28407064094082324, 0.051034871715347506, -0.12208955850754236, -0.25667425339437416, -0.10192912677302957, 0.018478162467127312, -0.06755011798058813, -0.17649194919755934, 0.02916477398743941, 0.19559208437095624, 0.06782105179956636, -0.06312075184305778, -0.04194911063422222, -0.08300965301994537, 0.09251275819701117, 0.004585034714231419, 0.1018265618288235, 0.08618637837620603, -0.02251163266624349, -0.1586443539213301, 0.3645748766894276, -0.14415852213278413, -0.3429525119277674, 0.05516807779015319, -0.14768175955710783, -0.19369184237124548, 0.14049223927478935, 0.10911806737626525, 0.15833762668803134, -0.07463237051726193, 0.18127120652383924, -0.14302983653505105, 0.11105760566676287, 0.12045899206910886, -0.08388613466475461, 0.1478263749489309, 0.0829930482369319, 0.10536011295216913, 0.14260276286183177, 0.01236824829735466, -0.040731099937614555, -0.33491908426623085, -0.2856132533728472, -0.1401602216536884, 0.22435492648415872, -0.1114697594168467, -0.21622155485926448, 0.39103193787505497, -0.004981287755072117, 0.15810327413114342, 0.11470501345733332, 0.2712759949845841, 0.08874160031523756, 0.019639835718113022, 0.1047703736033794, 0.16369882762130047, 0.1658020434976631, -0.01866218063829316, -0.1597841027180186, -0.14113514897463894, 0.16760144105835542]
|
1,803.06383
|
A prediction criterion for working correlation structure selection in
GEE
|
Generalized estimating equations (GEE) is one of the most commonly used
methods for marginal regression analysis of longitudinal data, especially with
discrete outcomes. The GEE method models the association among the responses of
a subject through a working correlation matrix and correct specification of the
working correlation structure ensures efficient estimation of the regression
parameters. This study proposes a predicted residual sum of squares (PRESS)
statistic as a working correlation selection criterion in GEE. An extensive
simulation study is designed to assess the performance of the proposed GEE
PRESS criterion and to compare its performance with well-known existing
criteria in the literature. The results show that the GEE PRESS criterion has
better performance than the weighted error sum of squares SC criterion in all
cases and is comparable with that of other existing criteria when the true
working correlation structure is AR(1) or exchangeable. Lastly, the working
correlation selection criteria are illustrated with the Coronary Artery Risk
Development in Young Adults study.
|
stat.ME
|
generalized estimating equations gee is one of the most commonly used methods for marginal regression analysis of longitudinal data especially with discrete outcomes the gee method models the association among the responses of a subject through a working correlation matrix and correct specification of the working correlation structure ensures efficient estimation of the regression parameters this study proposes a predicted residual sum of squares press statistic as a working correlation selection criterion in gee an extensive simulation study is designed to assess the performance of the proposed gee press criterion and to compare its performance with wellknown existing criteria in the literature the results show that the gee press criterion has better performance than the weighted error sum of squares sc criterion in all cases and is comparable with that of other existing criteria when the true working correlation structure is ar1 or exchangeable lastly the working correlation selection criteria are illustrated with the coronary artery risk development in young adults study
|
[['generalized', 'estimating', 'equations', 'gee', 'is', 'one', 'of', 'the', 'most', 'commonly', 'used', 'methods', 'for', 'marginal', 'regression', 'analysis', 'of', 'longitudinal', 'data', 'especially', 'with', 'discrete', 'outcomes', 'the', 'gee', 'method', 'models', 'the', 'association', 'among', 'the', 'responses', 'of', 'a', 'subject', 'through', 'a', 'working', 'correlation', 'matrix', 'and', 'correct', 'specification', 'of', 'the', 'working', 'correlation', 'structure', 'ensures', 'efficient', 'estimation', 'of', 'the', 'regression', 'parameters', 'this', 'study', 'proposes', 'a', 'predicted', 'residual', 'sum', 'of', 'squares', 'press', 'statistic', 'as', 'a', 'working', 'correlation', 'selection', 'criterion', 'in', 'gee', 'an', 'extensive', 'simulation', 'study', 'is', 'designed', 'to', 'assess', 'the', 'performance', 'of', 'the', 'proposed', 'gee', 'press', 'criterion', 'and', 'to', 'compare', 'its', 'performance', 'with', 'wellknown', 'existing', 'criteria', 'in', 'the', 'literature', 'the', 'results', 'show', 'that', 'the', 'gee', 'press', 'criterion', 'has', 'better', 'performance', 'than', 'the', 'weighted', 'error', 'sum', 'of', 'squares', 'sc', 'criterion', 'in', 'all', 'cases', 'and', 'is', 'comparable', 'with', 'that', 'of', 'other', 'existing', 'criteria', 'when', 'the', 'true', 'working', 'correlation', 'structure', 'is', 'ar1', 'or', 'exchangeable', 'lastly', 'the', 'working', 'correlation', 'selection', 'criteria', 'are', 'illustrated', 'with', 'the', 'coronary', 'artery', 'risk', 'development', 'in', 'young', 'adults', 'study']]
|
[-0.05833016900075485, -0.01667277143474447, -0.11168637527382852, 0.12601673207676936, -0.07740728470732539, -0.15291294313242865, 0.039811730218108424, 0.3730447010631547, -0.20143390432600922, -0.2864427878003981, 0.1484830594394517, -0.26072279564938566, -0.17384016070727626, 0.17678955253529835, -0.08544825302023026, 0.10017249164391412, 0.10566460928034589, 0.030429128078128684, -0.08687414496815131, -0.3156468322943252, 0.2717644678612734, 0.09704240790013523, 0.35326892166415713, -0.023996856152712378, 0.08180578776263707, 0.051240056595063685, -0.10588106139919456, 0.028559917031526747, -0.1206258652351091, 0.10970073178508262, 0.27632320480073824, 0.18141936831302757, 0.37577222949066375, -0.3268592369003957, -0.21317439037950042, 0.09859021919790978, 0.08350423454841668, 0.016210281416589832, 0.011950266740089397, -0.23682770796442104, 0.06616366610367909, -0.19166623427781254, -0.09436441767356434, -0.06193613301810627, -0.053741951320711294, 0.03154774644357486, -0.3575664406655253, 0.13603131018900944, 0.059782407693911625, 0.1012960505257878, -0.04526948512252995, -0.1911382160356475, 0.008059827915542288, 0.10120221726789662, 0.09157004015790414, -0.018511129599237057, 0.08509553661339997, -0.13470240468073083, -0.12951309617751072, 0.3613652714275192, -0.03199755948478497, -0.22164471375031602, 0.18636622429928845, -0.09641032245148111, -0.09832613577169401, 0.0909279371485298, 0.1756672597501749, 0.08238957068353983, -0.20245510477683706, -0.008513212360277841, -0.04526954289830439, 0.137203085634363, 0.043968959434107405, -0.03096536327768577, 0.13902347394190498, 0.195332578528546, 0.015144204901585953, 0.14199032502164086, -0.12017577912954522, -0.0913962721767157, -0.257206666092877, -0.1425469409858371, -0.15767549905124018, -0.04955148769551198, -0.11352847245161458, -0.1805617042046822, 0.3918273728340864, 0.17784093565618897, 0.12248030526816477, 0.08803775802381872, 0.2987337643352487, 0.10225291252294326, 0.045472017319893275, 0.06041174628024484, 0.21628904234284513, 0.14717469227580746, 0.024738338008454, -0.23093602806329727, 0.13440159476436905, 0.06446028751016444]
|
1,803.06384
|
Star formation toward the H~II region IRAS 10427-6032
|
The formation and properties of star clusters formed at the edges of H II
regions are poorly known. We study stellar content, physical conditions, and
star formation processes around a relatively unknown young H II region IRAS
10427-6032, located in the southern outskirts of the Carina Nebula. We make use
of near-IR data from VISTA, mid-IR from Spitzer and WISE, far-IR from Herschel,
sub-mm from ATLASGAL, and 843 MHz radio-continuum data. Using multi-band
photometry, we find a total of 5 Class I and 29 Class II young stellar object
(YSO) candidates, most of which newly identified, in the 5'$\times$5' region
centered on the IRAS source position. Modeling of the spectral energy
distribution for selected YSO candidates using radiative transfer models shows
that most of these candidates are intermediate mass YSOs in their early
evolutionary stages. A majority of the YSO candidates are found to be
coincident with the cold dense clump at the western rim of the H II region.
Lyman continuum luminosity calculation using radio emission indicates the
spectral type of the ionizing source to be earlier than B0.5-B1. We identified
a candidate massive star possibly responsible for the H II region with an
estimated spectral type B0-B0.5. The temperature and column density maps of the
region constructed by performing pixel-wise modified blackbody fits to the
thermal dust emission using the far-IR data show a high column density
shell-like morphology around the H II region, and low column density (0.6
$\times$ 10$^{22}$ cm$^{-2}$) and high temperature ($\sim$21 K) matter within
the H II region. Based on the morphology of the region in the ionized and the
molecular gas, and the comparison between the estimated timescales of the H II
region and the YSO candidates in the clump, we argue that the enhanced
star-formation at the western rim of the H II region is likely due to
compression by the ionized gas.
|
astro-ph.GA astro-ph.SR
|
the formation and properties of star clusters formed at the edges of h ii regions are poorly known we study stellar content physical conditions and star formation processes around a relatively unknown young h ii region iras 104276032 located in the southern outskirts of the carina nebula we make use of nearir data from vista midir from spitzer and wise farir from herschel submm from atlasgal and 843 mhz radiocontinuum data using multiband photometry we find a total of 5 class i and 29 class ii young stellar object yso candidates most of which newly identified in the 5times5 region centered on the iras source position modeling of the spectral energy distribution for selected yso candidates using radiative transfer models shows that most of these candidates are intermediate mass ysos in their early evolutionary stages a majority of the yso candidates are found to be coincident with the cold dense clump at the western rim of the h ii region lyman continuum luminosity calculation using radio emission indicates the spectral type of the ionizing source to be earlier than b05b1 we identified a candidate massive star possibly responsible for the h ii region with an estimated spectral type b0b05 the temperature and column density maps of the region constructed by performing pixelwise modified blackbody fits to the thermal dust emission using the farir data show a high column density shelllike morphology around the h ii region and low column density 06 times 1022 cm2 and high temperature sim21 k matter within the h ii region based on the morphology of the region in the ionized and the molecular gas and the comparison between the estimated timescales of the h ii region and the yso candidates in the clump we argue that the enhanced starformation at the western rim of the h ii region is likely due to compression by the ionized gas
|
[['the', 'formation', 'and', 'properties', 'of', 'star', 'clusters', 'formed', 'at', 'the', 'edges', 'of', 'h', 'ii', 'regions', 'are', 'poorly', 'known', 'we', 'study', 'stellar', 'content', 'physical', 'conditions', 'and', 'star', 'formation', 'processes', 'around', 'a', 'relatively', 'unknown', 'young', 'h', 'ii', 'region', 'iras', '104276032', 'located', 'in', 'the', 'southern', 'outskirts', 'of', 'the', 'carina', 'nebula', 'we', 'make', 'use', 'of', 'nearir', 'data', 'from', 'vista', 'midir', 'from', 'spitzer', 'and', 'wise', 'farir', 'from', 'herschel', 'submm', 'from', 'atlasgal', 'and', '843', 'mhz', 'radiocontinuum', 'data', 'using', 'multiband', 'photometry', 'we', 'find', 'a', 'total', 'of', '5', 'class', 'i', 'and', '29', 'class', 'ii', 'young', 'stellar', 'object', 'yso', 'candidates', 'most', 'of', 'which', 'newly', 'identified', 'in', 'the', '5times5', 'region', 'centered', 'on', 'the', 'iras', 'source', 'position', 'modeling', 'of', 'the', 'spectral', 'energy', 'distribution', 'for', 'selected', 'yso', 'candidates', 'using', 'radiative', 'transfer', 'models', 'shows', 'that', 'most', 'of', 'these', 'candidates', 'are', 'intermediate', 'mass', 'ysos', 'in', 'their', 'early', 'evolutionary', 'stages', 'a', 'majority', 'of', 'the', 'yso', 'candidates', 'are', 'found', 'to', 'be', 'coincident', 'with', 'the', 'cold', 'dense', 'clump', 'at', 'the', 'western', 'rim', 'of', 'the', 'h', 'ii', 'region', 'lyman', 'continuum', 'luminosity', 'calculation', 'using', 'radio', 'emission', 'indicates', 'the', 'spectral', 'type', 'of', 'the', 'ionizing', 'source', 'to', 'be', 'earlier', 'than', 'b05b1', 'we', 'identified', 'a', 'candidate', 'massive', 'star', 'possibly', 'responsible', 'for', 'the', 'h', 'ii', 'region', 'with', 'an', 'estimated', 'spectral', 'type', 'b0b05', 'the', 'temperature', 'and', 'column', 'density', 'maps', 'of', 'the', 'region', 'constructed', 'by', 'performing', 'pixelwise', 'modified', 'blackbody', 'fits', 'to', 'the', 'thermal', 'dust', 'emission', 'using', 'the', 'farir', 'data', 'show', 'a', 'high', 'column', 'density', 'shelllike', 'morphology', 'around', 'the', 'h', 'ii', 'region', 'and', 'low', 'column', 'density', '06', 'times', '1022', 'cm2', 'and', 'high', 'temperature', 'sim21', 'k', 'matter', 'within', 'the', 'h', 'ii', 'region', 'based', 'on', 'the', 'morphology', 'of', 'the', 'region', 'in', 'the', 'ionized', 'and', 'the', 'molecular', 'gas', 'and', 'the', 'comparison', 'between', 'the', 'estimated', 'timescales', 'of', 'the', 'h', 'ii', 'region', 'and', 'the', 'yso', 'candidates', 'in', 'the', 'clump', 'we', 'argue', 'that', 'the', 'enhanced', 'starformation', 'at', 'the', 'western', 'rim', 'of', 'the', 'h', 'ii', 'region', 'is', 'likely', 'due', 'to', 'compression', 'by', 'the', 'ionized', 'gas']]
|
[-0.008145169164717173, 0.08206740866418405, -0.018094658737845454, 0.06236239731338924, -0.057380845624814866, -0.0603782183239779, 0.06926497093079352, 0.44991907482201227, -0.1628664018846988, -0.3504292053203656, 0.07656456324653127, -0.2754976085920646, 0.0020410480312279705, 0.1133798636808015, -0.002978212537860323, -0.0706842694767603, 0.03739797327898045, -0.0943886202407404, -0.016990038071243652, -0.2060151629750451, 0.30293571801997815, 0.09691848781812804, 0.16971921072790586, -0.008899050258389376, 0.04261036112627262, -0.15221381288012006, -0.11950757287059907, -0.04561769767607107, -0.16388156905930984, 0.07685252002754601, 0.2396992026384443, 0.13122868917062638, 0.20412745338813387, -0.32331856066198317, -0.21893749206739818, 0.04662446654232183, 0.18651371678747358, -0.016261319113325654, -0.04691432820012172, -0.2975021720348487, 0.06322317839145034, -0.17088290828228914, -0.17853590700335342, 0.13189594278904732, 0.06962853197828177, 0.02394297729757943, -0.24073007044195527, 0.144095276456596, -0.04579766154248557, 0.08196318787025306, -0.137884631980524, -0.15453367551161779, -0.12292397055702592, 0.047663246986718436, -0.05562502405347007, 0.0848753218750792, 0.22632938900866023, -0.2066018716989742, -0.0063874102898339915, 0.3677595536432509, -0.07916725299444123, 0.036098615861645506, 0.24703270664309004, -0.2244003652459354, -0.1972318283345514, 0.236246682983796, 0.10248055048723943, 0.1418391187783801, -0.1518450577029036, 0.026245131153100197, -0.02314508643037486, 0.205168288791082, 0.038709679168639974, 0.09506810484393756, 0.3378988130599815, 0.08888575337031512, 0.009400546089610428, 0.1631699424187282, -0.3337884835980254, -0.04867058164819858, -0.27919630985575183, -0.09704242371667694, -0.15878160545055403, 0.047385184781687656, -0.14117028131806195, -0.11127813344498837, 0.30915636363773435, 0.07169394330106507, 0.2349403125239976, -0.0023754380332926908, 0.2638266832691325, 0.0729722645496166, 0.11623395563700029, 0.17507625336632204, 0.25980535321070247, 0.15943763343900635, 0.09623869096492584, -0.23205255952601178, 0.07029598403245838, 0.016690636042378915]
|
1,803.06385
|
The $\alpha$-normal labeling method for computing the $p$-spectral radii
of uniform hypergraphs
|
Let $G$ be an $r$-uniform hypergraph of order $n$. For each $p\geq 1$, the
$p$-spectral radius $\lambda^{(p)}(G)$ is defined as \[
\lambda^{(p)}(G):=\max_{|x_1|^p+\cdots+|x_n|^p=1} r\sum_{\{i_1,\ldots,i_r\}\in
E(G)}x_{i_1}\cdots x_{i_r}. \] The $p$-spectral radius was introduced by
Keevash-Lenz-Mubayi, and subsequently studied by Nikiforov in 2014. The most
extensively studied case is when $p=r$, and $\lambda^{(r)}(G)$ is called the
spectral radius of $G$. The $\alpha$-normal labeling method, which was
introduced by Lu and Man in 2014, is effective method for computing the
spectral radii of uniform hypergraphs. It labels each corner of an edge by a
positive number so that the sum of the corner labels at any vertex is $1$ while
the product of all corner labels at any edge is $\alpha$. Since then, this
method has been used by many researchers in studying $\lambda^{(r)}(G)$. In
this paper, we extend Lu and Man's $\alpha$-normal labeling method to the
$p$-spectral radii of uniform hypergraphs for $p\ne r$; and find some
applications.
|
math.CO
|
let g be an runiform hypergraph of order n for each pgeq 1 the pspectral radius lambdapg is defined as lambdapgmax_x_1pcdotsx_np1 rsum_i_1ldotsi_rin egx_i_1cdots x_i_r the pspectral radius was introduced by keevashlenzmubayi and subsequently studied by nikiforov in 2014 the most extensively studied case is when pr and lambdarg is called the spectral radius of g the alphanormal labeling method which was introduced by lu and man in 2014 is effective method for computing the spectral radii of uniform hypergraphs it labels each corner of an edge by a positive number so that the sum of the corner labels at any vertex is 1 while the product of all corner labels at any edge is alpha since then this method has been used by many researchers in studying lambdarg in this paper we extend lu and mans alphanormal labeling method to the pspectral radii of uniform hypergraphs for pne r and find some applications
|
[['let', 'g', 'be', 'an', 'runiform', 'hypergraph', 'of', 'order', 'n', 'for', 'each', 'pgeq', '1', 'the', 'pspectral', 'radius', 'lambdapg', 'is', 'defined', 'as', 'lambdapgmax_x_1pcdotsx_np1', 'rsum_i_1ldotsi_rin', 'egx_i_1cdots', 'x_i_r', 'the', 'pspectral', 'radius', 'was', 'introduced', 'by', 'keevashlenzmubayi', 'and', 'subsequently', 'studied', 'by', 'nikiforov', 'in', '2014', 'the', 'most', 'extensively', 'studied', 'case', 'is', 'when', 'pr', 'and', 'lambdarg', 'is', 'called', 'the', 'spectral', 'radius', 'of', 'g', 'the', 'alphanormal', 'labeling', 'method', 'which', 'was', 'introduced', 'by', 'lu', 'and', 'man', 'in', '2014', 'is', 'effective', 'method', 'for', 'computing', 'the', 'spectral', 'radii', 'of', 'uniform', 'hypergraphs', 'it', 'labels', 'each', 'corner', 'of', 'an', 'edge', 'by', 'a', 'positive', 'number', 'so', 'that', 'the', 'sum', 'of', 'the', 'corner', 'labels', 'at', 'any', 'vertex', 'is', '1', 'while', 'the', 'product', 'of', 'all', 'corner', 'labels', 'at', 'any', 'edge', 'is', 'alpha', 'since', 'then', 'this', 'method', 'has', 'been', 'used', 'by', 'many', 'researchers', 'in', 'studying', 'lambdarg', 'in', 'this', 'paper', 'we', 'extend', 'lu', 'and', 'mans', 'alphanormal', 'labeling', 'method', 'to', 'the', 'pspectral', 'radii', 'of', 'uniform', 'hypergraphs', 'for', 'pne', 'r', 'and', 'find', 'some', 'applications']]
|
[-0.07646834724646522, 0.09361330706690764, -0.04307972123744349, 0.007468905771942171, -0.04039834582323387, -0.15680670925441567, -0.002226809533281022, 0.37504349980656415, -0.22576132204705748, -0.3200076257216757, 0.10018340362019021, -0.2908644723284939, -0.11248430942842252, 0.11882959733627839, -0.11683633059505628, 0.04541039331704506, 0.04704642796582759, 0.09042523970049232, -0.015609146476952895, -0.26989053538203084, 0.2954883462468749, 0.0343878033590082, 0.1848830373332619, 0.08860954960604032, 0.023071022608559835, 0.028184059276947216, -0.007885033382766256, 0.0889221442917566, -0.18507488707443484, 0.10080305337012835, 0.2462326836045066, 0.14403519045708268, 0.31551617127524256, -0.33170024860548236, -0.17828923347725034, 0.1347242055192896, 0.14201841773529064, 0.020715531874735113, -0.0026638448550939968, -0.2569495052185343, 0.17605404704107508, -0.17012578325524721, -0.09587770760974731, -0.013931007647555168, 0.1358599919851308, 0.014907736542924908, -0.3145489532433527, -0.00662183767756326, 0.10109364788952181, 0.054546010004330986, 0.01312718526396441, -0.18055508726544373, -0.018907237223872584, 0.1146028653380847, -0.020460579477327122, 0.06829654650319342, 0.03583219201520902, -0.08925385755799353, -0.1043948751064145, 0.3525983195449704, -0.010241304824849565, -0.14746021611092944, 0.11888029791689031, -0.12675564454498459, -0.12832725596652456, 0.11534397297041261, 0.0877979755503674, 0.1970538483845253, -0.1196823050751397, 0.16334461680835125, -0.10437613884935934, 0.11183142780696284, 0.13250734632809277, -0.023231540120857423, 0.15076845895406496, 0.10796412272850843, 0.13221548114742204, 0.12752298752008617, -0.090832825711839, 0.03178171750974573, -0.23771035470298096, -0.14064513278283078, -0.284557479616312, 0.017782236626435532, -0.12304045751079684, -0.1300801021423293, 0.38959295274562217, 0.09299882482067516, 0.21726008262549054, 0.03280358551443261, 0.254853322434204, 0.1054019062542229, 0.07250165374158588, 0.16370540403773728, 0.17022541539694902, 0.1823211854837248, 0.03607557939958746, -0.15688559349804912, 0.04917220400059468, 0.16326168603391375]
|
1,803.06386
|
Forecasting Economics and Financial Time Series: ARIMA vs. LSTM
|
Forecasting time series data is an important subject in economics, business,
and finance. Traditionally, there are several techniques to effectively
forecast the next lag of time series data such as univariate Autoregressive
(AR), univariate Moving Average (MA), Simple Exponential Smoothing (SES), and
more notably Autoregressive Integrated Moving Average (ARIMA) with its many
variations. In particular, ARIMA model has demonstrated its outperformance in
precision and accuracy of predicting the next lags of time series. With the
recent advancement in computational power of computers and more importantly
developing more advanced machine learning algorithms and approaches such as
deep learning, new algorithms are developed to forecast time series data. The
research question investigated in this article is that whether and how the
newly developed deep learning-based algorithms for forecasting time series
data, such as "Long Short-Term Memory (LSTM)", are superior to the traditional
algorithms. The empirical studies conducted and reported in this article show
that deep learning-based algorithms such as LSTM outperform traditional-based
algorithms such as ARIMA model. More specifically, the average reduction in
error rates obtained by LSTM is between 84 - 87 percent when compared to ARIMA
indicating the superiority of LSTM to ARIMA. Furthermore, it was noticed that
the number of training times, known as "epoch" in deep learning, has no effect
on the performance of the trained forecast model and it exhibits a truly random
behavior.
|
cs.LG q-fin.ST stat.ML
|
forecasting time series data is an important subject in economics business and finance traditionally there are several techniques to effectively forecast the next lag of time series data such as univariate autoregressive ar univariate moving average ma simple exponential smoothing ses and more notably autoregressive integrated moving average arima with its many variations in particular arima model has demonstrated its outperformance in precision and accuracy of predicting the next lags of time series with the recent advancement in computational power of computers and more importantly developing more advanced machine learning algorithms and approaches such as deep learning new algorithms are developed to forecast time series data the research question investigated in this article is that whether and how the newly developed deep learningbased algorithms for forecasting time series data such as long shortterm memory lstm are superior to the traditional algorithms the empirical studies conducted and reported in this article show that deep learningbased algorithms such as lstm outperform traditionalbased algorithms such as arima model more specifically the average reduction in error rates obtained by lstm is between 84 87 percent when compared to arima indicating the superiority of lstm to arima furthermore it was noticed that the number of training times known as epoch in deep learning has no effect on the performance of the trained forecast model and it exhibits a truly random behavior
|
[['forecasting', 'time', 'series', 'data', 'is', 'an', 'important', 'subject', 'in', 'economics', 'business', 'and', 'finance', 'traditionally', 'there', 'are', 'several', 'techniques', 'to', 'effectively', 'forecast', 'the', 'next', 'lag', 'of', 'time', 'series', 'data', 'such', 'as', 'univariate', 'autoregressive', 'ar', 'univariate', 'moving', 'average', 'ma', 'simple', 'exponential', 'smoothing', 'ses', 'and', 'more', 'notably', 'autoregressive', 'integrated', 'moving', 'average', 'arima', 'with', 'its', 'many', 'variations', 'in', 'particular', 'arima', 'model', 'has', 'demonstrated', 'its', 'outperformance', 'in', 'precision', 'and', 'accuracy', 'of', 'predicting', 'the', 'next', 'lags', 'of', 'time', 'series', 'with', 'the', 'recent', 'advancement', 'in', 'computational', 'power', 'of', 'computers', 'and', 'more', 'importantly', 'developing', 'more', 'advanced', 'machine', 'learning', 'algorithms', 'and', 'approaches', 'such', 'as', 'deep', 'learning', 'new', 'algorithms', 'are', 'developed', 'to', 'forecast', 'time', 'series', 'data', 'the', 'research', 'question', 'investigated', 'in', 'this', 'article', 'is', 'that', 'whether', 'and', 'how', 'the', 'newly', 'developed', 'deep', 'learningbased', 'algorithms', 'for', 'forecasting', 'time', 'series', 'data', 'such', 'as', 'long', 'shortterm', 'memory', 'lstm', 'are', 'superior', 'to', 'the', 'traditional', 'algorithms', 'the', 'empirical', 'studies', 'conducted', 'and', 'reported', 'in', 'this', 'article', 'show', 'that', 'deep', 'learningbased', 'algorithms', 'such', 'as', 'lstm', 'outperform', 'traditionalbased', 'algorithms', 'such', 'as', 'arima', 'model', 'more', 'specifically', 'the', 'average', 'reduction', 'in', 'error', 'rates', 'obtained', 'by', 'lstm', 'is', 'between', '84', '87', 'percent', 'when', 'compared', 'to', 'arima', 'indicating', 'the', 'superiority', 'of', 'lstm', 'to', 'arima', 'furthermore', 'it', 'was', 'noticed', 'that', 'the', 'number', 'of', 'training', 'times', 'known', 'as', 'epoch', 'in', 'deep', 'learning', 'has', 'no', 'effect', 'on', 'the', 'performance', 'of', 'the', 'trained', 'forecast', 'model', 'and', 'it', 'exhibits', 'a', 'truly', 'random', 'behavior']]
|
[-0.01218382895199789, 0.009748606802442938, -0.07100760176156957, 0.09845822386624706, -0.05392897675641709, -0.18754090891969907, 0.025007570947572173, 0.46736867452661196, -0.2547292761815091, -0.33739209992940433, 0.1314350474729306, -0.2763840169004268, -0.18442602388974694, 0.2470383369312104, -0.10642627716685335, 0.145656303543494, 0.08211825085829737, 0.0634284434840083, -0.03611807452411287, -0.3541543349209759, 0.1732686914751927, 0.10816128513724026, 0.3282715983130038, -0.0393461467905177, 0.10038677673686631, -0.03559002466603286, -0.0836638563229806, -0.008091577127989795, -0.04291133531210815, 0.10920504507712192, 0.3010283235501912, 0.16668110206102332, 0.37292857463575074, -0.44880849407778844, -0.26818744715510145, 0.12023247919718011, 0.13669214857392945, 0.04188123271697097, -0.00563937732613542, -0.2831923213073363, 0.03700405672709975, -0.20502345701265667, -0.022671803070309884, -0.13396665713982656, 0.07538065215986636, 0.028510661196584502, -0.27457580636358925, 0.0803989930011125, 0.06602684769986404, 0.10701120408251881, -0.03097730817221519, -0.14900861576613453, 0.03817426597389082, 0.10439472239632677, 0.11224340928925408, 0.05719317440305733, 0.11624217196471161, -0.14295883311605495, -0.20486515377803396, 0.33280133130649725, -0.12525626376064286, -0.1354478552689155, 0.17642237438923783, -0.06471918656594224, -0.16232134892087843, 0.0851808538681103, 0.24442166909989382, 0.0678755880271395, -0.14907532404209228, 0.011088458670096266, -0.002882076533925202, 0.15578855459888777, 0.04320442133376168, -0.010182753725287815, 0.1261892954358417, 0.27841124812968904, 0.009359361621189034, 0.07543455797144108, -0.16087346128188074, -0.13154681712388994, -0.1893517388858729, -0.12149526617593236, -0.16770646303064293, -0.020174329560250046, -0.11679000060151641, -0.15413158199620536, 0.4009581867605448, 0.22486568212095234, 0.1615173346383704, 0.13064301699503428, 0.33369631525543003, 0.0948795672557834, 0.08010465772201618, 0.12436480071560557, 0.1974619607322125, 0.04839676852544977, 0.17866034736649858, -0.16068228791286754, 0.11622150442821698, 0.007033980573630996]
|
1,803.06387
|
Improving the efficiency and robustness of nested sampling using
posterior repartitioning
|
In real-world Bayesian inference applications, prior assumptions regarding
the parameters of interest may be unrepresentative of their actual values for a
given dataset. In particular, if the likelihood is concentrated far out in the
wings of the assumed prior distribution, this can lead to extremely inefficient
exploration of the resulting posterior by nested sampling algorithms, with
unnecessarily high associated computational costs. Simple solutions such as
broadening the prior range in such cases might not be appropriate or possible
in real-world applications, for example when one wishes to assume a single
standardised prior across the analysis of a large number of datasets for which
the true values of the parameters of interest may vary. This work therefore
introduces a posterior repartitioning (PR) method for nested sampling
algorithms, which addresses the problem by redefining the likelihood and prior
while keeping their product fixed, so that the posterior inferences and
evidence estimates remain unchanged but the efficiency of the nested sampling
process is significantly increased. Numerical results show that the PR method
provides a simple yet powerful refinement for nested sampling algorithms to
address the issue of unrepresentative priors.
|
stat.CO astro-ph.IM
|
in realworld bayesian inference applications prior assumptions regarding the parameters of interest may be unrepresentative of their actual values for a given dataset in particular if the likelihood is concentrated far out in the wings of the assumed prior distribution this can lead to extremely inefficient exploration of the resulting posterior by nested sampling algorithms with unnecessarily high associated computational costs simple solutions such as broadening the prior range in such cases might not be appropriate or possible in realworld applications for example when one wishes to assume a single standardised prior across the analysis of a large number of datasets for which the true values of the parameters of interest may vary this work therefore introduces a posterior repartitioning pr method for nested sampling algorithms which addresses the problem by redefining the likelihood and prior while keeping their product fixed so that the posterior inferences and evidence estimates remain unchanged but the efficiency of the nested sampling process is significantly increased numerical results show that the pr method provides a simple yet powerful refinement for nested sampling algorithms to address the issue of unrepresentative priors
|
[['in', 'realworld', 'bayesian', 'inference', 'applications', 'prior', 'assumptions', 'regarding', 'the', 'parameters', 'of', 'interest', 'may', 'be', 'unrepresentative', 'of', 'their', 'actual', 'values', 'for', 'a', 'given', 'dataset', 'in', 'particular', 'if', 'the', 'likelihood', 'is', 'concentrated', 'far', 'out', 'in', 'the', 'wings', 'of', 'the', 'assumed', 'prior', 'distribution', 'this', 'can', 'lead', 'to', 'extremely', 'inefficient', 'exploration', 'of', 'the', 'resulting', 'posterior', 'by', 'nested', 'sampling', 'algorithms', 'with', 'unnecessarily', 'high', 'associated', 'computational', 'costs', 'simple', 'solutions', 'such', 'as', 'broadening', 'the', 'prior', 'range', 'in', 'such', 'cases', 'might', 'not', 'be', 'appropriate', 'or', 'possible', 'in', 'realworld', 'applications', 'for', 'example', 'when', 'one', 'wishes', 'to', 'assume', 'a', 'single', 'standardised', 'prior', 'across', 'the', 'analysis', 'of', 'a', 'large', 'number', 'of', 'datasets', 'for', 'which', 'the', 'true', 'values', 'of', 'the', 'parameters', 'of', 'interest', 'may', 'vary', 'this', 'work', 'therefore', 'introduces', 'a', 'posterior', 'repartitioning', 'pr', 'method', 'for', 'nested', 'sampling', 'algorithms', 'which', 'addresses', 'the', 'problem', 'by', 'redefining', 'the', 'likelihood', 'and', 'prior', 'while', 'keeping', 'their', 'product', 'fixed', 'so', 'that', 'the', 'posterior', 'inferences', 'and', 'evidence', 'estimates', 'remain', 'unchanged', 'but', 'the', 'efficiency', 'of', 'the', 'nested', 'sampling', 'process', 'is', 'significantly', 'increased', 'numerical', 'results', 'show', 'that', 'the', 'pr', 'method', 'provides', 'a', 'simple', 'yet', 'powerful', 'refinement', 'for', 'nested', 'sampling', 'algorithms', 'to', 'address', 'the', 'issue', 'of', 'unrepresentative', 'priors']]
|
[-0.06000837576650684, 0.0680984345900636, -0.07041629507476764, 0.09785537819929994, -0.10549197155075969, -0.12645919221673682, 0.11486830476731542, 0.40532976885636646, -0.28771058811996414, -0.35948328512610606, 0.1303263551409116, -0.20143739414972164, -0.09943739938429527, 0.20676499017876052, -0.11671419867054028, 0.06697044426826285, 0.11492021047818143, 0.014455020943436252, -0.08730185504718584, -0.25768537348466775, 0.2844734383491619, 0.10390045987542278, 0.30045222859048554, -0.005278352104748289, 0.0865139879726915, 0.0017247756126947621, -0.052690518916063814, 0.008856779745421532, -0.12301630746820123, 0.1163883349033303, 0.28721175247663133, 0.19960735742783836, 0.3537914151105509, -0.37726081358969854, -0.23428783027495267, 0.1409291895532039, 0.17769084024112872, 0.10533869505419599, -0.036366076917157215, -0.2419122758631905, 0.05897769702458253, -0.17022825780034226, -0.0938620833649991, -0.09801403965340347, -0.026113339709819005, 0.02735188316086918, -0.32997511940888097, 0.0727434284329134, 0.06917395859816543, 0.031635639207657947, -0.0004790001611415577, -0.15319789626625596, 0.0057223617920391665, 0.11671515500191124, 0.09077924291302214, -0.01389225730822692, 0.12393341951012131, -0.14913806607646327, -0.09193886529218646, 0.35299510647472676, 0.010568683508843664, -0.23619251533020888, 0.17051917490279, -0.10071687999692175, -0.17349563757275602, 0.15289164191332236, 0.15619325153379432, 0.13166092617327088, -0.13674921509773805, 0.07747417280853536, -0.028543060452061435, 0.1482680458250025, 0.042864077941699816, -0.003464750279622373, 0.20182136339836462, 0.15544232417033205, 0.08180292579032461, 0.10723866243165747, -0.0942097247120679, -0.11094584544370782, -0.24129611887638608, -0.11041246821242635, -0.21134092691179204, 0.0036900014278099633, -0.14064955937294965, -0.20523369487535248, 0.34787853761145504, 0.2155950091408706, 0.20973708982841033, 0.06085215067295032, 0.32116619587415246, 0.08781645946412457, 0.059873958451232764, 0.08313832670370097, 0.19496912639200067, 0.05682379457353544, 0.05597879251550322, -0.14231554065049895, 0.1817707603807331, -0.04050622995121665]
|
1,803.06388
|
Pressure-Tunable Photonic Band Gaps in an Entropic Colloidal Crystal
|
Materials adopting the diamond structure possess useful properties in atomic
and colloidal systems, and are a popular target for synthesis in colloids where
a photonic band gap is possible. The desirable photonic properties of the
diamond structure pose an interesting opportunity for reconfigurable matter:
can we create a colloidal crystal able to switch reversibly to and from the
diamond structure? Drawing inspiration from high-pressure transitions of
diamond-forming atomic systems, we design a system of polyhedrally-shaped
particles that transitions from diamond to a tetragonal diamond derivative upon
a small pressure change. The transition can alternatively be triggered by
changing the shape of the particle in-situ. We propose that the transition
provides a reversible reconfiguration process for a potential new colloidal
material, and draw parallels between this transition and phase behavior of the
atomic transitions from which we take inspiration.
|
cond-mat.mtrl-sci cond-mat.mes-hall cond-mat.soft
|
materials adopting the diamond structure possess useful properties in atomic and colloidal systems and are a popular target for synthesis in colloids where a photonic band gap is possible the desirable photonic properties of the diamond structure pose an interesting opportunity for reconfigurable matter can we create a colloidal crystal able to switch reversibly to and from the diamond structure drawing inspiration from highpressure transitions of diamondforming atomic systems we design a system of polyhedrallyshaped particles that transitions from diamond to a tetragonal diamond derivative upon a small pressure change the transition can alternatively be triggered by changing the shape of the particle insitu we propose that the transition provides a reversible reconfiguration process for a potential new colloidal material and draw parallels between this transition and phase behavior of the atomic transitions from which we take inspiration
|
[['materials', 'adopting', 'the', 'diamond', 'structure', 'possess', 'useful', 'properties', 'in', 'atomic', 'and', 'colloidal', 'systems', 'and', 'are', 'a', 'popular', 'target', 'for', 'synthesis', 'in', 'colloids', 'where', 'a', 'photonic', 'band', 'gap', 'is', 'possible', 'the', 'desirable', 'photonic', 'properties', 'of', 'the', 'diamond', 'structure', 'pose', 'an', 'interesting', 'opportunity', 'for', 'reconfigurable', 'matter', 'can', 'we', 'create', 'a', 'colloidal', 'crystal', 'able', 'to', 'switch', 'reversibly', 'to', 'and', 'from', 'the', 'diamond', 'structure', 'drawing', 'inspiration', 'from', 'highpressure', 'transitions', 'of', 'diamondforming', 'atomic', 'systems', 'we', 'design', 'a', 'system', 'of', 'polyhedrallyshaped', 'particles', 'that', 'transitions', 'from', 'diamond', 'to', 'a', 'tetragonal', 'diamond', 'derivative', 'upon', 'a', 'small', 'pressure', 'change', 'the', 'transition', 'can', 'alternatively', 'be', 'triggered', 'by', 'changing', 'the', 'shape', 'of', 'the', 'particle', 'insitu', 'we', 'propose', 'that', 'the', 'transition', 'provides', 'a', 'reversible', 'reconfiguration', 'process', 'for', 'a', 'potential', 'new', 'colloidal', 'material', 'and', 'draw', 'parallels', 'between', 'this', 'transition', 'and', 'phase', 'behavior', 'of', 'the', 'atomic', 'transitions', 'from', 'which', 'we', 'take', 'inspiration']]
|
[-0.07005549103418804, 0.2054826785068358, -0.11233670323631753, -0.03247850231249525, -0.08436942702118198, -0.16295412588207162, 0.1212027966599528, 0.46640969643040614, -0.30825831758899286, -0.29386637945358146, 0.04752323898206027, -0.26678109231836383, -0.17301310668699443, 0.1317315216164228, 0.0013711673399323925, 0.06206186410460813, -0.0013462828912238097, -0.05752913688603953, -0.09081384523725479, -0.09978680906522855, 0.2715651035165031, 0.04205050883705125, 0.29226166518021596, 0.033358209130443246, 0.10915767131647204, -0.01508334475768018, 0.1385710075709914, 0.019404831537565982, -0.17102149692896895, 0.13402606642750256, 0.25649720576920493, 0.026261189267696702, 0.19983314722262815, -0.4681132177082712, -0.2303728220970644, 0.08345990002271719, 0.11479227081016528, 0.16132869789469304, -0.16785452365858125, -0.28837900097920177, 0.025377963399103677, -0.13422120158793405, -0.11165531457963344, -0.0992233479012023, -0.014809622311183964, 0.02016874643980854, -0.2323416493322036, 0.004830998022739282, 0.06585960156200385, 0.034407408261733295, -0.09169275163303074, -0.06337031765296534, -0.013131846146493712, 0.13017956788911866, -0.058866015856491524, 0.016876442862934816, 0.22417468390674056, -0.11225897442679578, -0.13557245238916948, 0.45271778691676445, -0.00325023997335366, -0.09306692068382878, 0.21046065344297163, -0.11001563359818914, -0.1296088471546468, 0.1714567518594429, 0.18222388281163363, 0.07536382416797363, -0.14324737088677733, 0.05441536055663806, 0.02001983785371789, 0.21795405509114704, 0.05495373258257613, 0.0364939358414096, 0.2836200152112938, 0.2208814357736093, 0.04735953988925116, 0.22916828373169718, -0.06791862658728325, -0.07856819228918004, -0.19963516735280043, -0.21245196820510662, -0.20535915944834843, 0.04993806564872263, -0.08654601775699977, -0.18702131305026876, 0.373329165384776, 0.11954918901798972, 0.18928099945461488, -0.056122703011223005, 0.22058000968536362, 0.040331189609680546, 0.08976540271439315, -0.015540518609615153, 0.25670108930481705, 0.1434435871487949, 0.1291860641392893, -0.22054305904791416, 0.06845816424431499, -0.014845349295201767]
|
1,803.06389
|
Mechanistic Regimes of Vibronic Transport in a Heterodimer and the
Design Principle of Incoherent Vibronic Transport in Phycobiliproteins
|
Following the observation of coherent oscillations in non-linear spectra of
photosynthetic pigment protein complexes, particularly phycobilliprotein such
as PC645, coherent vibronic transport has been suggested as a design principle
for novel light harvesting materials operating at room temperature. Vibronic
transport between energetically remote pigments is coherent when the presence
of a resonant vibration supports transient delocalization between the pair of
electronic excited states. Here, we establish the mechanism of vibronic
transport for a model heterodimer across a wide range of molecular parameter
values. The resulting mechanistic map demonstrates that the molecular
parameters of phycobiliproteins in fact support incoherent vibronic transport.
This result points to an important design principle: incoherent vibronic
transport is more efficient than a coherent mechanism when energetic disorder
exceeds the coupling between the donor and vibrationally excited acceptor
states. Finally, our results suggest that the role of coherent vibronic
transport in pigment protein complexes should be reevaluated.
|
physics.chem-ph
|
following the observation of coherent oscillations in nonlinear spectra of photosynthetic pigment protein complexes particularly phycobilliprotein such as pc645 coherent vibronic transport has been suggested as a design principle for novel light harvesting materials operating at room temperature vibronic transport between energetically remote pigments is coherent when the presence of a resonant vibration supports transient delocalization between the pair of electronic excited states here we establish the mechanism of vibronic transport for a model heterodimer across a wide range of molecular parameter values the resulting mechanistic map demonstrates that the molecular parameters of phycobiliproteins in fact support incoherent vibronic transport this result points to an important design principle incoherent vibronic transport is more efficient than a coherent mechanism when energetic disorder exceeds the coupling between the donor and vibrationally excited acceptor states finally our results suggest that the role of coherent vibronic transport in pigment protein complexes should be reevaluated
|
[['following', 'the', 'observation', 'of', 'coherent', 'oscillations', 'in', 'nonlinear', 'spectra', 'of', 'photosynthetic', 'pigment', 'protein', 'complexes', 'particularly', 'phycobilliprotein', 'such', 'as', 'pc645', 'coherent', 'vibronic', 'transport', 'has', 'been', 'suggested', 'as', 'a', 'design', 'principle', 'for', 'novel', 'light', 'harvesting', 'materials', 'operating', 'at', 'room', 'temperature', 'vibronic', 'transport', 'between', 'energetically', 'remote', 'pigments', 'is', 'coherent', 'when', 'the', 'presence', 'of', 'a', 'resonant', 'vibration', 'supports', 'transient', 'delocalization', 'between', 'the', 'pair', 'of', 'electronic', 'excited', 'states', 'here', 'we', 'establish', 'the', 'mechanism', 'of', 'vibronic', 'transport', 'for', 'a', 'model', 'heterodimer', 'across', 'a', 'wide', 'range', 'of', 'molecular', 'parameter', 'values', 'the', 'resulting', 'mechanistic', 'map', 'demonstrates', 'that', 'the', 'molecular', 'parameters', 'of', 'phycobiliproteins', 'in', 'fact', 'support', 'incoherent', 'vibronic', 'transport', 'this', 'result', 'points', 'to', 'an', 'important', 'design', 'principle', 'incoherent', 'vibronic', 'transport', 'is', 'more', 'efficient', 'than', 'a', 'coherent', 'mechanism', 'when', 'energetic', 'disorder', 'exceeds', 'the', 'coupling', 'between', 'the', 'donor', 'and', 'vibrationally', 'excited', 'acceptor', 'states', 'finally', 'our', 'results', 'suggest', 'that', 'the', 'role', 'of', 'coherent', 'vibronic', 'transport', 'in', 'pigment', 'protein', 'complexes', 'should', 'be', 'reevaluated']]
|
[-0.16380966295903837, 0.20134621770865355, -0.04937310743414416, 0.0716427357847046, 0.01632179272823636, -0.16355562224771653, 0.0877733051326851, 0.40658805739359566, -0.2960079862992436, -0.24345007562703586, -0.04694305675576172, -0.23592326407252043, -0.165828342115094, 0.21521344965155043, 0.038753428823008335, -0.02667278667430209, 0.09015633905894005, -0.0806912261017617, 0.06574737690639176, -0.09631146364314044, 0.2705150487787409, 0.0799168963610326, 0.30343372469467905, 0.12900322882908602, 0.09631575316490742, 0.011980841014434227, 0.10157939595101564, -0.10013492830838358, -0.11581057064440695, 0.15589600261660205, 0.32348436379692697, -0.0044955167374042355, 0.26086340207081515, -0.4233343649980606, -0.28146645671144227, 0.06104450723181335, 0.14867088621292396, 0.1970272183202632, -0.03955389734643946, -0.24782028988053734, 0.0069863816755261245, -0.12426091716531039, -0.09928304855610187, -0.10135186693924886, 0.010084782289528606, 0.011246444835583836, -0.24260142161792156, 0.11854063229472846, -0.0007128118843640257, 0.0692730712260576, -0.1355786872855794, -0.10715596740534092, -0.11971683868350799, 0.0861707457842074, -0.02414579442921001, -0.03700741217393528, 0.23972117869595952, -0.09285486892847057, -0.1145973357859524, 0.3609101162112362, -0.0631101503008203, -0.09612236255561095, 0.20018129918924313, -0.11507526048827892, -0.11277918606971535, 0.19617348016808497, 0.1037916937661701, 0.13076577302155978, -0.1666386148639589, -0.00547014322520965, -0.030452989218381528, 0.18131780870971365, 0.049919163073794355, 0.17495552963310002, 0.23246920476948854, 0.2218161550797397, 0.031030171282039394, 0.13903028208327997, -0.11179925238201083, -0.11468305446570051, -0.21927673670685155, -0.1505936874868192, -0.1923457808767589, 0.10976071901394417, -0.02385972099268931, -0.13856282927120891, 0.4067462768980721, 0.08075017434382349, 0.14451099627795036, -0.06836813374367018, 0.2505840846406133, 0.08475782756534274, 0.012684727836112748, 0.0026119604234852447, 0.27165047325750175, 0.17504898766633872, 0.07090856766034442, -0.3472802645820599, 0.0824499263009369, -0.01716783637455946]
|
1,803.0639
|
Corpus Statistics in Text Classification of Online Data
|
Transformation of Machine Learning (ML) from a boutique science to a
generally accepted technology has increased importance of reproduction and
transportability of ML studies. In the current work, we investigate how corpus
characteristics of textual data sets correspond to text classification results.
We work with two data sets gathered from sub-forums of an online health-related
forum. Our empirical results are obtained for a multi-class sentiment analysis
application.
|
cs.CL cs.IR cs.LG
|
transformation of machine learning ml from a boutique science to a generally accepted technology has increased importance of reproduction and transportability of ml studies in the current work we investigate how corpus characteristics of textual data sets correspond to text classification results we work with two data sets gathered from subforums of an online healthrelated forum our empirical results are obtained for a multiclass sentiment analysis application
|
[['transformation', 'of', 'machine', 'learning', 'ml', 'from', 'a', 'boutique', 'science', 'to', 'a', 'generally', 'accepted', 'technology', 'has', 'increased', 'importance', 'of', 'reproduction', 'and', 'transportability', 'of', 'ml', 'studies', 'in', 'the', 'current', 'work', 'we', 'investigate', 'how', 'corpus', 'characteristics', 'of', 'textual', 'data', 'sets', 'correspond', 'to', 'text', 'classification', 'results', 'we', 'work', 'with', 'two', 'data', 'sets', 'gathered', 'from', 'subforums', 'of', 'an', 'online', 'healthrelated', 'forum', 'our', 'empirical', 'results', 'are', 'obtained', 'for', 'a', 'multiclass', 'sentiment', 'analysis', 'application']]
|
[-0.03993745116660228, -0.019117854787887505, -0.09969191364943981, 0.07684374660826647, -0.1317892776730542, -0.11018078926807413, 0.095367865722913, 0.413423626526044, -0.2446876944687504, -0.33680322928210865, 0.09844146839951953, -0.37716039903461934, -0.16952030698840434, 0.2723747710482432, -0.1159357516381603, 0.07315823265279715, 0.15792319979518651, 0.050014824685282434, -0.03427377135421221, -0.316722266175426, 0.33113331966675247, 0.032503419304982975, 0.4138752970557946, 0.03080101039690467, 0.03186631824176472, -0.016278969403356314, -0.12311096230091957, -0.004298653439260446, -0.13821569887491372, 0.22973468569465555, 0.40495456611880887, 0.2996847176781067, 0.3335955598463233, -0.34602649555756493, -0.1833387070407088, 0.05048879294727857, 0.12128046310435121, 0.11920819408618487, -0.075173023615319, -0.3133667959903295, 0.07236960585085818, -0.17869233828611097, -0.002478483233314294, -0.10903512611985207, 0.019864197669980616, 0.014677731399066174, -0.24988500349796736, 0.026676584655013776, 0.07281434159152783, 0.18379223646882634, -0.07478540019633678, -0.15410714679612564, 0.024777957041246388, 0.16871617273785747, 0.11315771752538589, 0.04566056948298445, 0.1255998008669569, -0.15769397190127235, -0.18937336788154566, 0.34521295434007276, -0.0460357070255738, -0.1565168456389354, 0.21238287466649824, -0.019724608613894537, -0.18734566138412517, 0.039642261212261824, 0.2841594288125634, 0.03679972750564607, -0.1806634634303359, 0.00174887065972703, -0.05709742887232166, 0.19124067975924566, 0.03020573866625245, -0.04767260764940427, 0.16718710801707437, 0.26912804363438714, -0.04761109175876929, 0.12013351624258435, -0.0726283324165986, -0.05397582794897832, -0.22045033012445156, -0.11373560625629929, -0.18749384860006663, 0.017155206233907778, -0.07708193532240469, -0.13721923869676314, 0.3652182005918943, 0.2197556365854465, 0.17950391309479108, 0.07195577887961498, 0.28448169793073946, 0.01262620453400394, 0.05258650705218315, 0.06558987611385349, 0.14352064081109486, 0.06056495787432561, 0.19016045517323968, -0.1196526567863587, 0.05613034749403596, -0.010632914720246425]
|
1,803.06391
|
The route to massive black hole formation via merger-driven direct
collapse: a review
|
In this paper we review a new scenario for the formation of massive black
hole seeds that relies on multi-scale gas inflows initiated by the merger of
massive gas-rich galaxies at $z > 6$, where gas has already achieved solar
composition. Hydrodynamical simulations undertaken to explore our scenario show
that supermassive, gravitationally bound gaseous disks, weighing a billion
solar masses and of a few pc in size, form in the nuclei of merger remnants in
less than $10^5$ yr. These could later produce a supermassive protostar or
supermassive star at their center via various mechanisms. Moreover, we present
a new analytical model, based on angular momentum transport in mass-loaded
gravitoturbulent disks. This naturally predicts that a nuclear disk accreting
at rates exceeding $1000 M_{\odot}$/yr, as seen in the simulations, is stable
against fragmentation irrespective of its metallicity. This is at variance with
conventional direct collapse scenarios, which require the suppression of gas
cooling in metal-free protogalaxies for gas collapse to take place. Such high
accretion rates reflect the high free-fall velocities in massive halos
appearing at $z < 10$, and occur naturally as a result of the efficient angular
momentum loss provided by mergers. We discuss the implications of our scenario
on the observed population of high-z quasars and on its evolution to lower
redshifts using a semi-analytical galaxy formation model. Finally, we consider
the intriguing possibility that the secondary gas inflows in the unstable disks
might drive gas to collapse into a supermassive black hole directly via the
General Relativistic radial instability. Such {\it dark collapse} route could
generate gravitational wave emission detectable via the future Laser
Interferometer Space Antenna (LISA). [Abridged]
|
astro-ph.GA
|
in this paper we review a new scenario for the formation of massive black hole seeds that relies on multiscale gas inflows initiated by the merger of massive gasrich galaxies at z 6 where gas has already achieved solar composition hydrodynamical simulations undertaken to explore our scenario show that supermassive gravitationally bound gaseous disks weighing a billion solar masses and of a few pc in size form in the nuclei of merger remnants in less than 105 yr these could later produce a supermassive protostar or supermassive star at their center via various mechanisms moreover we present a new analytical model based on angular momentum transport in massloaded gravitoturbulent disks this naturally predicts that a nuclear disk accreting at rates exceeding 1000 m_odotyr as seen in the simulations is stable against fragmentation irrespective of its metallicity this is at variance with conventional direct collapse scenarios which require the suppression of gas cooling in metalfree protogalaxies for gas collapse to take place such high accretion rates reflect the high freefall velocities in massive halos appearing at z 10 and occur naturally as a result of the efficient angular momentum loss provided by mergers we discuss the implications of our scenario on the observed population of highz quasars and on its evolution to lower redshifts using a semianalytical galaxy formation model finally we consider the intriguing possibility that the secondary gas inflows in the unstable disks might drive gas to collapse into a supermassive black hole directly via the general relativistic radial instability such it dark collapse route could generate gravitational wave emission detectable via the future laser interferometer space antenna lisa abridged
|
[['in', 'this', 'paper', 'we', 'review', 'a', 'new', 'scenario', 'for', 'the', 'formation', 'of', 'massive', 'black', 'hole', 'seeds', 'that', 'relies', 'on', 'multiscale', 'gas', 'inflows', 'initiated', 'by', 'the', 'merger', 'of', 'massive', 'gasrich', 'galaxies', 'at', 'z', '6', 'where', 'gas', 'has', 'already', 'achieved', 'solar', 'composition', 'hydrodynamical', 'simulations', 'undertaken', 'to', 'explore', 'our', 'scenario', 'show', 'that', 'supermassive', 'gravitationally', 'bound', 'gaseous', 'disks', 'weighing', 'a', 'billion', 'solar', 'masses', 'and', 'of', 'a', 'few', 'pc', 'in', 'size', 'form', 'in', 'the', 'nuclei', 'of', 'merger', 'remnants', 'in', 'less', 'than', '105', 'yr', 'these', 'could', 'later', 'produce', 'a', 'supermassive', 'protostar', 'or', 'supermassive', 'star', 'at', 'their', 'center', 'via', 'various', 'mechanisms', 'moreover', 'we', 'present', 'a', 'new', 'analytical', 'model', 'based', 'on', 'angular', 'momentum', 'transport', 'in', 'massloaded', 'gravitoturbulent', 'disks', 'this', 'naturally', 'predicts', 'that', 'a', 'nuclear', 'disk', 'accreting', 'at', 'rates', 'exceeding', '1000', 'm_odotyr', 'as', 'seen', 'in', 'the', 'simulations', 'is', 'stable', 'against', 'fragmentation', 'irrespective', 'of', 'its', 'metallicity', 'this', 'is', 'at', 'variance', 'with', 'conventional', 'direct', 'collapse', 'scenarios', 'which', 'require', 'the', 'suppression', 'of', 'gas', 'cooling', 'in', 'metalfree', 'protogalaxies', 'for', 'gas', 'collapse', 'to', 'take', 'place', 'such', 'high', 'accretion', 'rates', 'reflect', 'the', 'high', 'freefall', 'velocities', 'in', 'massive', 'halos', 'appearing', 'at', 'z', '10', 'and', 'occur', 'naturally', 'as', 'a', 'result', 'of', 'the', 'efficient', 'angular', 'momentum', 'loss', 'provided', 'by', 'mergers', 'we', 'discuss', 'the', 'implications', 'of', 'our', 'scenario', 'on', 'the', 'observed', 'population', 'of', 'highz', 'quasars', 'and', 'on', 'its', 'evolution', 'to', 'lower', 'redshifts', 'using', 'a', 'semianalytical', 'galaxy', 'formation', 'model', 'finally', 'we', 'consider', 'the', 'intriguing', 'possibility', 'that', 'the', 'secondary', 'gas', 'inflows', 'in', 'the', 'unstable', 'disks', 'might', 'drive', 'gas', 'to', 'collapse', 'into', 'a', 'supermassive', 'black', 'hole', 'directly', 'via', 'the', 'general', 'relativistic', 'radial', 'instability', 'such', 'it', 'dark', 'collapse', 'route', 'could', 'generate', 'gravitational', 'wave', 'emission', 'detectable', 'via', 'the', 'future', 'laser', 'interferometer', 'space', 'antenna', 'lisa', 'abridged']]
|
[-0.11476224648458642, 0.14806067484269447, -0.040940543165004284, 0.12655053703360108, -0.07034461067755779, -0.0461622564967488, 0.033925830990564065, 0.364311185069176, -0.15034787704606672, -0.3147224764446161, 0.048561342034361764, -0.23781357008905402, -0.023208615696143593, 0.20976327801496134, 0.029040358104052304, -0.020784104848194634, 0.06182796543857557, -0.08846588820438983, -0.06150643458603658, -0.2631493645773451, 0.34597397907602695, 0.13392447697761645, 0.1304117377634363, -0.024797416250032418, 0.09172286909946491, -0.11765687309834433, -0.021950016565435323, -0.06335335374714006, -0.19191454418263024, 0.006637322407119608, 0.22275707897097835, 0.14264364089550793, 0.27363796610981433, -0.4476014608964049, -0.2544652902541813, 0.0607745963083477, 0.2282651724350532, 0.11499645499206694, -0.16188225698645736, -0.24434654148257073, 0.08212623936257314, -0.2690986031202455, -0.16465808597317727, 0.04723069510797238, 0.02696718649794365, 0.0007858230292924243, -0.23806250994944278, 0.17115258222713903, 0.04486372547243066, -0.025458669942903342, -0.09132256284029638, -0.03590559851287132, -0.07148350651738512, 0.01202572934068327, 0.03368619201074241, 0.0693911616613133, 0.2701757012417959, -0.11454748153678791, -0.053619982841393715, 0.4193217468575138, -0.060719412549218844, -0.04178093903529633, 0.2676683624805127, -0.2625956053508796, -0.16210381455403303, 0.16302945057438803, 0.22623575177057423, 0.1295980309863056, -0.10604641979035742, -0.032114387599612174, -0.009554319006313117, 0.17272550265589984, 0.09126932752607356, 0.06284460857343246, 0.4213182480380324, 0.1738055583280322, 0.014445797343930828, 0.0826897288185486, -0.1506842988993409, -0.07194405985047621, -0.21453025922045194, -0.1209862371075407, -0.1305189088852114, 0.12527596158149687, -0.1292059655119025, -0.08553303644744975, 0.2776073087427793, 0.11534389092610992, 0.23845422958673365, 0.03584404219744376, 0.3290889721030431, 0.054516285925509056, 0.09165016911336224, 0.12123722432188112, 0.3286826760470317, 0.13897289490117606, 0.09439623190306567, -0.25320844053431685, 0.05433162567429107, 0.033048170982994056]
|
1,803.06392
|
MESA Models of the Evolutionary State of the Interacting Binary epsilon
Aurigae
|
Using MESA code (Modules for Experiments in Stellar Astrophysics, version
9575), an evaluation was made of the evolutionary state of the epsilon Aurigae
binary system (HD 31964, F0Iap + disk). We sought to satisfy several
observational constraints: 1) requiring evolutionary tracks to pass close to
the current temperature and luminosity of the primary star; 2) obtaining a
period near the observed value of 27.1 years; 3) matching a mass function of
3.0; 4) concurrent Roche lobe overflow and mass transfer; 5) an isotopic ratio
12 C/ 13 C = 5 and, (6) matching the interferometrically determined angular
diameter. A MESA model starting with binary masses of 9.85 + 4.5 Msun , with a
100 day initial period, produces a 1.2 + 10.6 Msun result having a 547 day
period, and a single digit 12 C/ 13 C ratio. These values were reached near an
age of 20 Myr, when the donor star comes close to the observed luminosity and
temperature for epsilon Aurigae A, as a post-RGB/pre-AGB star.
Contemporaneously, the accretor then appears as an upper main sequence, early
B-type star. This benchmark model can provide a basis for further exploration
of this interacting binary, and other long period binary stars.
|
astro-ph.SR
|
using mesa code modules for experiments in stellar astrophysics version 9575 an evaluation was made of the evolutionary state of the epsilon aurigae binary system hd 31964 f0iap disk we sought to satisfy several observational constraints 1 requiring evolutionary tracks to pass close to the current temperature and luminosity of the primary star 2 obtaining a period near the observed value of 271 years 3 matching a mass function of 30 4 concurrent roche lobe overflow and mass transfer 5 an isotopic ratio 12 c 13 c 5 and 6 matching the interferometrically determined angular diameter a mesa model starting with binary masses of 985 45 msun with a 100 day initial period produces a 12 106 msun result having a 547 day period and a single digit 12 c 13 c ratio these values were reached near an age of 20 myr when the donor star comes close to the observed luminosity and temperature for epsilon aurigae a as a postrgbpreagb star contemporaneously the accretor then appears as an upper main sequence early btype star this benchmark model can provide a basis for further exploration of this interacting binary and other long period binary stars
|
[['using', 'mesa', 'code', 'modules', 'for', 'experiments', 'in', 'stellar', 'astrophysics', 'version', '9575', 'an', 'evaluation', 'was', 'made', 'of', 'the', 'evolutionary', 'state', 'of', 'the', 'epsilon', 'aurigae', 'binary', 'system', 'hd', '31964', 'f0iap', 'disk', 'we', 'sought', 'to', 'satisfy', 'several', 'observational', 'constraints', '1', 'requiring', 'evolutionary', 'tracks', 'to', 'pass', 'close', 'to', 'the', 'current', 'temperature', 'and', 'luminosity', 'of', 'the', 'primary', 'star', '2', 'obtaining', 'a', 'period', 'near', 'the', 'observed', 'value', 'of', '271', 'years', '3', 'matching', 'a', 'mass', 'function', 'of', '30', '4', 'concurrent', 'roche', 'lobe', 'overflow', 'and', 'mass', 'transfer', '5', 'an', 'isotopic', 'ratio', '12', 'c', '13', 'c', '5', 'and', '6', 'matching', 'the', 'interferometrically', 'determined', 'angular', 'diameter', 'a', 'mesa', 'model', 'starting', 'with', 'binary', 'masses', 'of', '985', '45', 'msun', 'with', 'a', '100', 'day', 'initial', 'period', 'produces', 'a', '12', '106', 'msun', 'result', 'having', 'a', '547', 'day', 'period', 'and', 'a', 'single', 'digit', '12', 'c', '13', 'c', 'ratio', 'these', 'values', 'were', 'reached', 'near', 'an', 'age', 'of', '20', 'myr', 'when', 'the', 'donor', 'star', 'comes', 'close', 'to', 'the', 'observed', 'luminosity', 'and', 'temperature', 'for', 'epsilon', 'aurigae', 'a', 'as', 'a', 'postrgbpreagb', 'star', 'contemporaneously', 'the', 'accretor', 'then', 'appears', 'as', 'an', 'upper', 'main', 'sequence', 'early', 'btype', 'star', 'this', 'benchmark', 'model', 'can', 'provide', 'a', 'basis', 'for', 'further', 'exploration', 'of', 'this', 'interacting', 'binary', 'and', 'other', 'long', 'period', 'binary', 'stars']]
|
[-0.11374642029814808, 0.13484274577186564, -0.028475786087590563, 0.06671766590669635, -0.046374345731492024, -0.13367116723663217, 0.10026016544099473, 0.38439561660676574, -0.19351156828490718, -0.4233265967817659, 0.12109987757354493, -0.2666751472810235, 0.01793191481835252, 0.19273472566415745, -0.043803926832356295, 0.011411253966157654, 0.15541433108912617, 0.02919768068563661, -0.09748289309721922, -0.27709242974412795, 0.24551673450174263, 0.06356295080942348, 0.08504741088278504, -0.02173828377287082, 0.05499086696220263, -0.05836687466115184, -0.010032820291551786, -0.09912386701630496, -0.18107969232127938, 0.006329757865962278, 0.20826853140784485, 0.15521325690459478, 0.2076446161885297, -0.3008797440311143, -0.13320302518345223, 0.02531006799919116, 0.15340732576668148, 0.02773583839753633, -0.04652799229943459, -0.19438356304254112, 0.1080632047278932, -0.25573121893057993, -0.17099798484729517, 0.09844959427207803, 0.12586636851913263, -0.02813694145472556, -0.28624876166351254, 0.06004774093343225, 0.04298229650546039, 0.11059515189407804, -0.14170675443659098, -0.18325662452587616, -0.06132035032324879, 0.08859226443166024, -0.011628416907934983, 0.1719115832241474, 0.13189366888230752, -0.09006027628214056, -0.07066423795789172, 0.3423634984535334, -0.1082824185512323, -0.016317360607848063, 0.22532070396284673, -0.1560721842745811, -0.12652595059637348, 0.15569536360897548, 0.13299833111937875, 0.133101497355781, -0.14975199388218574, -0.01190449935782199, 0.015406958488602712, 0.2776357675540633, 0.11537907613137341, -0.017987108471504185, 0.3365589630466746, 0.19460276195446483, -0.0213458685884783, 0.06483005609277664, -0.2287323155411437, -0.05904052134149664, -0.20487213918970598, -0.10952824128353172, -0.11481856609154203, 0.13414754326590408, -0.16483112505394024, -0.10944614486908781, 0.33821400659342193, 0.0692121157551744, 0.23791678706328795, 0.06620899200502185, 0.2389893178403416, 0.09543484664000956, 0.05958264160550253, 0.11976739483731051, 0.27243694497291676, 0.16942117529091247, 0.11902350786146877, -0.21073285508762146, 0.03882650691784262, 0.00043232276205726236]
|
1,803.06393
|
Phylogeny-based tumor subclone identification using a Bayesian feature
allocation model
|
Tumor cells acquire different genetic alterations during the course of
evolution in cancer patients. As a result of competition and selection, only a
few subgroups of cells with distinct genotypes survive. These subgroups of
cells are often referred to as subclones. In recent years, many statistical and
computational methods have been developed to identify tumor subclones, leading
to biologically significant discoveries and shedding light on tumor
progression, metastasis, drug resistance and other processes. However, most
existing methods are either not able to infer the phylogenetic structure among
subclones, or not able to incorporate copy number variations (CNV). In this
article, we propose SIFA (tumor Subclone Identification by Feature Allocation),
a Bayesian model which takes into account both CNV and tumor phylogeny
structure to infer tumor subclones. We compare the performance of SIFA with two
other commonly used methods using simulation studies with varying sequencing
depth, evolutionary tree size, and tree complexity. SIFA consistently yields
better results in terms of Rand Index and cellularity estimation accuracy. The
usefulness of SIFA is also demonstrated through its application to whole genome
sequencing (WGS) samples from four patients in a breast cancer study.
|
stat.AP q-bio.TO
|
tumor cells acquire different genetic alterations during the course of evolution in cancer patients as a result of competition and selection only a few subgroups of cells with distinct genotypes survive these subgroups of cells are often referred to as subclones in recent years many statistical and computational methods have been developed to identify tumor subclones leading to biologically significant discoveries and shedding light on tumor progression metastasis drug resistance and other processes however most existing methods are either not able to infer the phylogenetic structure among subclones or not able to incorporate copy number variations cnv in this article we propose sifa tumor subclone identification by feature allocation a bayesian model which takes into account both cnv and tumor phylogeny structure to infer tumor subclones we compare the performance of sifa with two other commonly used methods using simulation studies with varying sequencing depth evolutionary tree size and tree complexity sifa consistently yields better results in terms of rand index and cellularity estimation accuracy the usefulness of sifa is also demonstrated through its application to whole genome sequencing wgs samples from four patients in a breast cancer study
|
[['tumor', 'cells', 'acquire', 'different', 'genetic', 'alterations', 'during', 'the', 'course', 'of', 'evolution', 'in', 'cancer', 'patients', 'as', 'a', 'result', 'of', 'competition', 'and', 'selection', 'only', 'a', 'few', 'subgroups', 'of', 'cells', 'with', 'distinct', 'genotypes', 'survive', 'these', 'subgroups', 'of', 'cells', 'are', 'often', 'referred', 'to', 'as', 'subclones', 'in', 'recent', 'years', 'many', 'statistical', 'and', 'computational', 'methods', 'have', 'been', 'developed', 'to', 'identify', 'tumor', 'subclones', 'leading', 'to', 'biologically', 'significant', 'discoveries', 'and', 'shedding', 'light', 'on', 'tumor', 'progression', 'metastasis', 'drug', 'resistance', 'and', 'other', 'processes', 'however', 'most', 'existing', 'methods', 'are', 'either', 'not', 'able', 'to', 'infer', 'the', 'phylogenetic', 'structure', 'among', 'subclones', 'or', 'not', 'able', 'to', 'incorporate', 'copy', 'number', 'variations', 'cnv', 'in', 'this', 'article', 'we', 'propose', 'sifa', 'tumor', 'subclone', 'identification', 'by', 'feature', 'allocation', 'a', 'bayesian', 'model', 'which', 'takes', 'into', 'account', 'both', 'cnv', 'and', 'tumor', 'phylogeny', 'structure', 'to', 'infer', 'tumor', 'subclones', 'we', 'compare', 'the', 'performance', 'of', 'sifa', 'with', 'two', 'other', 'commonly', 'used', 'methods', 'using', 'simulation', 'studies', 'with', 'varying', 'sequencing', 'depth', 'evolutionary', 'tree', 'size', 'and', 'tree', 'complexity', 'sifa', 'consistently', 'yields', 'better', 'results', 'in', 'terms', 'of', 'rand', 'index', 'and', 'cellularity', 'estimation', 'accuracy', 'the', 'usefulness', 'of', 'sifa', 'is', 'also', 'demonstrated', 'through', 'its', 'application', 'to', 'whole', 'genome', 'sequencing', 'wgs', 'samples', 'from', 'four', 'patients', 'in', 'a', 'breast', 'cancer', 'study']]
|
[0.009124945935413794, 0.06706905904073249, -0.04134795296488813, 0.08827952085563016, -0.076236959512311, -0.14986474043320094, 0.08249248325253132, 0.38827787718375917, -0.23738843358673709, -0.3139882230054508, 0.09017813887857344, -0.267597255607446, -0.209420186463773, 0.16594450105050648, -0.1735179125671349, 0.035420937877562314, 0.13500149935119288, 0.00699095593188845, 0.08150890675033369, -0.3074597954212949, 0.2272004764613316, 0.01891685050059721, 0.3300795071713981, -0.021764705778055247, 0.09281554336600478, -0.047272234790460776, -0.08220608202770116, 0.02220763939201201, -0.13589493834004596, 0.15625397598114674, 0.3479262046089701, 0.24590874814290414, 0.3232223747332615, -0.4515127847907404, -0.2668167999181798, 0.13431519043888088, 0.20867364775763933, 0.12420517767141401, -0.01658299162050108, -0.24141115894961224, 0.08289897269889633, -0.14448280971532407, -0.028978523510020403, -0.08623306373954706, 0.0020499758289328645, 0.009023440839161002, -0.24995326508075572, 0.12926970844920208, -0.03519547831084796, 0.10430531192259251, -0.08091407294431947, -0.1869235666192792, -0.037716238840764006, 0.20088543903412762, 0.09852631976791022, 0.028891909294071847, 0.16989696059725864, -0.13774273193579306, -0.16357116093218485, 0.3209829773438513, 0.02716862194230238, -0.1877968242618615, 0.23402134525939508, -0.12053371286610999, -0.15030426460579432, 0.14770254252291232, 0.19783527375736012, 0.06994749203776428, -0.2112482892892634, -0.03322975144064961, 0.04979193760402422, 0.1813346161051264, 0.09312824466852127, -0.02900693229542523, 0.13739023003579368, 0.2471420309585199, -0.016178798750005958, 0.08954613797413431, -0.13634152853831885, -0.05089662295751392, -0.16807489037986786, -0.15299388664286762, -0.08285856939773395, -0.004986214542499048, -0.10853046290374734, -0.2193950422393976, 0.4270081671432804, 0.1323090523762244, 0.17565192473453603, 0.07423826862464132, 0.2552259350096974, -0.03903528770170712, 0.13009302036974718, -0.016637059050567803, 0.11562851383523257, 0.10386132232711784, 0.025891835357816445, -0.24560736472627256, 0.16947803063325526, 0.02217902775937642]
|
1,803.06394
|
Combinatorial proofs of two Euler type identities due to Andrews
|
We prove combinatorially some identities related to Euler's partition
identity (the number of partitions of $n$ into distinct parts equals the number
of partitions of $n$ into odd parts). They were conjectured by Beck and proved
by Andrews via generating functions.
Let $a(n)$ be the number of partitions of $n$ such that the set of even parts
has exactly one element, $b(n)$ be the difference between the number of parts
in all odd partitions of $n$ and the number of parts in all distinct partitions
of $n$, and $c(n)$ be the number of partitions of $n$ in which exactly one part
is repeated. Then, $a(n)=b(n)=c(n)$. The identity $a(n)=c(n)$ was proved
combinatorially (in greater generality) by Fu and Tang. We prove
combinatorially that $a(n)=b(n)$ and $b(n)=c(n)$. Our proof relies on
bijections between a set and a multiset, where the partitions in the multiset
are decorated with bit strings. Let $c_1(n)$ be the number of partitions of $n$
such that there is exactly one part occurring three times while all other parts
occur only once and let $b_1(n)$ to be the difference between the total number
of parts in the partitions of $n$ into distinct parts and the total number of
different parts in the partitions of $n$ into odd parts. We prove
combinatorially that $c_1(n)=b_1(n)$. In addition to these results by Andrews,
we prove combinatorially that $b_1(n)=a_1(n)$, where $a_1(n)$ counts partitions
of $n$ such that the set of even parts has exactly one element and satisfying
some additional conditions. We also treat the case when exactly one part occurs
twice while all other parts occur only once.
|
math.CO math.NT
|
we prove combinatorially some identities related to eulers partition identity the number of partitions of n into distinct parts equals the number of partitions of n into odd parts they were conjectured by beck and proved by andrews via generating functions let an be the number of partitions of n such that the set of even parts has exactly one element bn be the difference between the number of parts in all odd partitions of n and the number of parts in all distinct partitions of n and cn be the number of partitions of n in which exactly one part is repeated then anbncn the identity ancn was proved combinatorially in greater generality by fu and tang we prove combinatorially that anbn and bncn our proof relies on bijections between a set and a multiset where the partitions in the multiset are decorated with bit strings let c_1n be the number of partitions of n such that there is exactly one part occurring three times while all other parts occur only once and let b_1n to be the difference between the total number of parts in the partitions of n into distinct parts and the total number of different parts in the partitions of n into odd parts we prove combinatorially that c_1nb_1n in addition to these results by andrews we prove combinatorially that b_1na_1n where a_1n counts partitions of n such that the set of even parts has exactly one element and satisfying some additional conditions we also treat the case when exactly one part occurs twice while all other parts occur only once
|
[['we', 'prove', 'combinatorially', 'some', 'identities', 'related', 'to', 'eulers', 'partition', 'identity', 'the', 'number', 'of', 'partitions', 'of', 'n', 'into', 'distinct', 'parts', 'equals', 'the', 'number', 'of', 'partitions', 'of', 'n', 'into', 'odd', 'parts', 'they', 'were', 'conjectured', 'by', 'beck', 'and', 'proved', 'by', 'andrews', 'via', 'generating', 'functions', 'let', 'an', 'be', 'the', 'number', 'of', 'partitions', 'of', 'n', 'such', 'that', 'the', 'set', 'of', 'even', 'parts', 'has', 'exactly', 'one', 'element', 'bn', 'be', 'the', 'difference', 'between', 'the', 'number', 'of', 'parts', 'in', 'all', 'odd', 'partitions', 'of', 'n', 'and', 'the', 'number', 'of', 'parts', 'in', 'all', 'distinct', 'partitions', 'of', 'n', 'and', 'cn', 'be', 'the', 'number', 'of', 'partitions', 'of', 'n', 'in', 'which', 'exactly', 'one', 'part', 'is', 'repeated', 'then', 'anbncn', 'the', 'identity', 'ancn', 'was', 'proved', 'combinatorially', 'in', 'greater', 'generality', 'by', 'fu', 'and', 'tang', 'we', 'prove', 'combinatorially', 'that', 'anbn', 'and', 'bncn', 'our', 'proof', 'relies', 'on', 'bijections', 'between', 'a', 'set', 'and', 'a', 'multiset', 'where', 'the', 'partitions', 'in', 'the', 'multiset', 'are', 'decorated', 'with', 'bit', 'strings', 'let', 'c_1n', 'be', 'the', 'number', 'of', 'partitions', 'of', 'n', 'such', 'that', 'there', 'is', 'exactly', 'one', 'part', 'occurring', 'three', 'times', 'while', 'all', 'other', 'parts', 'occur', 'only', 'once', 'and', 'let', 'b_1n', 'to', 'be', 'the', 'difference', 'between', 'the', 'total', 'number', 'of', 'parts', 'in', 'the', 'partitions', 'of', 'n', 'into', 'distinct', 'parts', 'and', 'the', 'total', 'number', 'of', 'different', 'parts', 'in', 'the', 'partitions', 'of', 'n', 'into', 'odd', 'parts', 'we', 'prove', 'combinatorially', 'that', 'c_1nb_1n', 'in', 'addition', 'to', 'these', 'results', 'by', 'andrews', 'we', 'prove', 'combinatorially', 'that', 'b_1na_1n', 'where', 'a_1n', 'counts', 'partitions', 'of', 'n', 'such', 'that', 'the', 'set', 'of', 'even', 'parts', 'has', 'exactly', 'one', 'element', 'and', 'satisfying', 'some', 'additional', 'conditions', 'we', 'also', 'treat', 'the', 'case', 'when', 'exactly', 'one', 'part', 'occurs', 'twice', 'while', 'all', 'other', 'parts', 'occur', 'only', 'once']]
|
[-0.18052644424240366, 0.16213688893218917, -0.04653730258074414, 0.01155299740358188, -0.02852593560092476, -0.11901300260440315, 0.02227122594613111, 0.2802845555040058, -0.28552507665507865, -0.3345808513922852, 0.05815166200179307, -0.32609040122407834, -0.12306959444828246, 0.1578851552034275, -0.040647575497927, -0.034571141064331165, 0.024471890101016594, 0.07834754584150182, 0.017528448883226404, -0.34113528638707036, 0.33825127913891356, -0.11780480293635551, 0.166328312855899, 0.02442597144665161, 0.06981356782344494, 0.02220276830864221, -0.011142829855925393, 0.058224150776270765, -0.06664084562387494, 0.0723312264504589, 0.28695845382709156, 0.1571172258559743, 0.24354664379395402, -0.44884503923242347, -0.09334914615356374, 0.19900730230142558, 0.18129989984034922, -0.0004259636826363617, 0.033692461760960864, -0.21136458727202853, 0.13721975586930169, -0.11409235714089083, -0.10273958935127575, -0.0036206337894487883, 0.12254745421049781, 0.027381841164221453, -0.2779165231997425, -0.019305756195270817, 0.09649417712888413, 0.03495091125832949, 0.0015535124441987025, -0.21271664609818566, -0.042796119879859845, 0.15169801096080882, 0.039035600825066595, 0.007387930445258873, 0.011243224325964505, -0.08625411879542459, -0.09122007144026287, 0.34090794674281416, 0.04841021843383025, -0.25599508423543754, 0.13762712881118022, -0.18716620319474744, -0.15913671019426423, 0.13358711500177553, 0.06559515419466086, 0.11875220861863987, -0.05489393856165212, 0.11312598875483812, -0.12943464987893444, 0.14498268129924932, 0.17885755834801273, 0.020918900350472707, 0.1663436855785406, 0.04213036888928449, 0.063808916943055, 0.21417508948566677, -0.012478708351116585, -0.0401829849935085, -0.31748187866854083, -0.19006184562933684, -0.24072327228776855, 0.06319249428583887, -0.14410381863143257, -0.15067408414079425, 0.38436064490570304, 0.09275678403932473, 0.25460156788014704, 0.09779392388404858, 0.2520161655256917, 0.09160209851538169, 0.08267108436095817, 0.06287377435152894, 0.07871577527014524, 0.11865058032549575, -0.030569921228035542, -0.15516575118054018, 0.05121082911210784, 0.19259038082434585]
|
1,803.06395
|
Singular genuine rigidity
|
We extend the concept of genuine rigidity of submanifolds by allowing mild
singularities, mainly to obtain new global rigidity results and unify the known
ones. As one of the consequences, we simultaneously extend and unify Sacksteder
and Dajczer-Gromoll theorems by showing that any compact $n$-dimensional
submanifold of ${\mathbb R}^{n+p}$ is singularly genuinely rigid in ${\mathbb
R}^{n+q}$, for any $q < \min\{5,n\} - p$. Unexpectedly, the singular theory
becomes much simpler and natural than the regular one, even though all
technical codimension assumptions, needed in the regular case, are removed.
|
math.DG
|
we extend the concept of genuine rigidity of submanifolds by allowing mild singularities mainly to obtain new global rigidity results and unify the known ones as one of the consequences we simultaneously extend and unify sacksteder and dajczergromoll theorems by showing that any compact ndimensional submanifold of mathbb rnp is singularly genuinely rigid in mathbb rnq for any q min5n p unexpectedly the singular theory becomes much simpler and natural than the regular one even though all technical codimension assumptions needed in the regular case are removed
|
[['we', 'extend', 'the', 'concept', 'of', 'genuine', 'rigidity', 'of', 'submanifolds', 'by', 'allowing', 'mild', 'singularities', 'mainly', 'to', 'obtain', 'new', 'global', 'rigidity', 'results', 'and', 'unify', 'the', 'known', 'ones', 'as', 'one', 'of', 'the', 'consequences', 'we', 'simultaneously', 'extend', 'and', 'unify', 'sacksteder', 'and', 'dajczergromoll', 'theorems', 'by', 'showing', 'that', 'any', 'compact', 'ndimensional', 'submanifold', 'of', 'mathbb', 'rnp', 'is', 'singularly', 'genuinely', 'rigid', 'in', 'mathbb', 'rnq', 'for', 'any', 'q', 'min5n', 'p', 'unexpectedly', 'the', 'singular', 'theory', 'becomes', 'much', 'simpler', 'and', 'natural', 'than', 'the', 'regular', 'one', 'even', 'though', 'all', 'technical', 'codimension', 'assumptions', 'needed', 'in', 'the', 'regular', 'case', 'are', 'removed']]
|
[-0.13475576149165092, 0.09492182424740798, -0.06863557809896498, 0.11446339793710869, -0.08803258238764233, -0.1992369592638619, -0.037154799485747445, 0.29516229500253516, -0.24255732491791968, -0.19683167333882975, 0.1241849541119917, -0.2469148682093764, -0.1613752607407654, 0.19829874337617173, -0.1591514422928533, 0.02021130845399506, 0.04660941852279097, 0.06031091944931681, -0.10100785849324193, -0.2646956017005246, 0.40040214304217553, -0.04547037314399179, 0.18580026392746402, 0.05697439104902098, 0.051916108200191914, 0.034281976857637786, -0.005491926334798336, 0.032211388829472776, -0.18560721083722675, 0.12670505929917816, 0.23957451028435164, 0.08456557508591697, 0.22843230480934124, -0.4360768501422402, -0.22977165507534184, 0.2007485893961738, 0.12656777547896805, 0.07085400861295232, 0.011846240217157876, -0.2751364883860147, 0.13268565055521497, -0.08111618872709482, -0.2501405073576663, -0.11190565888831638, 0.04901145385712924, 0.0009783860127699662, -0.23701476088040566, 0.0675644894040762, 0.20172941050189266, 0.043033687964485715, -0.06425670881374144, -0.1208599539787834, -0.04191186938277749, 0.08852112567029803, 0.04575284428793533, 0.047118794520845615, 0.09132322587117732, -0.06183082444301571, -0.09762887433395688, 0.38012460064064396, -0.02722147471605974, -0.2471505376140037, 0.2132217202290713, -0.18303479647533183, -0.18913585233995803, 0.13295602152146488, 0.08470399333276303, 0.18297379863369895, -0.08821672666958164, 0.1705583495632128, -0.046597346315631664, 0.08861927205629377, 0.13539471187774677, 0.05157636299572257, 0.09188725626522518, 0.08874831435057413, 0.14635190596041012, 0.1361204590592309, 0.028083704102711462, -0.06360106229086418, -0.3392461429136884, -0.13097672669935118, -0.12269677089931197, 0.13746989265656526, -0.1270173508751049, -0.13625143339201046, 0.3478223911811968, 0.09765621753274856, 0.19790975635040955, 0.12210334057033241, 0.26898623598144805, 0.030595043153748905, 0.05352162222198424, 0.07998272529186075, 0.2179361478122602, 0.16364592031564518, 0.02576733290790075, -0.07579712630866701, 0.004082445605063295, 0.10547171391726258]
|
1,803.06396
|
Reviving and Improving Recurrent Back-Propagation
|
In this paper, we revisit the recurrent back-propagation (RBP) algorithm,
discuss the conditions under which it applies as well as how to satisfy them in
deep neural networks. We show that RBP can be unstable and propose two variants
based on conjugate gradient on the normal equations (CG-RBP) and Neumann series
(Neumann-RBP). We further investigate the relationship between Neumann-RBP and
back propagation through time (BPTT) and its truncated version (TBPTT). Our
Neumann-RBP has the same time complexity as TBPTT but only requires constant
memory, whereas TBPTT's memory cost scales linearly with the number of
truncation steps. We examine all RBP variants along with BPTT and TBPTT in
three different application domains: associative memory with continuous
Hopfield networks, document classification in citation networks using graph
neural networks and hyperparameter optimization for fully connected networks.
All experiments demonstrate that RBPs, especially the Neumann-RBP variant, are
efficient and effective for optimizing convergent recurrent neural networks.
Code is released at: \url{https://github.com/lrjconan/RBP}.
|
cs.LG stat.ML
|
in this paper we revisit the recurrent backpropagation rbp algorithm discuss the conditions under which it applies as well as how to satisfy them in deep neural networks we show that rbp can be unstable and propose two variants based on conjugate gradient on the normal equations cgrbp and neumann series neumannrbp we further investigate the relationship between neumannrbp and back propagation through time bptt and its truncated version tbptt our neumannrbp has the same time complexity as tbptt but only requires constant memory whereas tbptts memory cost scales linearly with the number of truncation steps we examine all rbp variants along with bptt and tbptt in three different application domains associative memory with continuous hopfield networks document classification in citation networks using graph neural networks and hyperparameter optimization for fully connected networks all experiments demonstrate that rbps especially the neumannrbp variant are efficient and effective for optimizing convergent recurrent neural networks code is released at urlhttpsgithubcomlrjconanrbp
|
[['in', 'this', 'paper', 'we', 'revisit', 'the', 'recurrent', 'backpropagation', 'rbp', 'algorithm', 'discuss', 'the', 'conditions', 'under', 'which', 'it', 'applies', 'as', 'well', 'as', 'how', 'to', 'satisfy', 'them', 'in', 'deep', 'neural', 'networks', 'we', 'show', 'that', 'rbp', 'can', 'be', 'unstable', 'and', 'propose', 'two', 'variants', 'based', 'on', 'conjugate', 'gradient', 'on', 'the', 'normal', 'equations', 'cgrbp', 'and', 'neumann', 'series', 'neumannrbp', 'we', 'further', 'investigate', 'the', 'relationship', 'between', 'neumannrbp', 'and', 'back', 'propagation', 'through', 'time', 'bptt', 'and', 'its', 'truncated', 'version', 'tbptt', 'our', 'neumannrbp', 'has', 'the', 'same', 'time', 'complexity', 'as', 'tbptt', 'but', 'only', 'requires', 'constant', 'memory', 'whereas', 'tbptts', 'memory', 'cost', 'scales', 'linearly', 'with', 'the', 'number', 'of', 'truncation', 'steps', 'we', 'examine', 'all', 'rbp', 'variants', 'along', 'with', 'bptt', 'and', 'tbptt', 'in', 'three', 'different', 'application', 'domains', 'associative', 'memory', 'with', 'continuous', 'hopfield', 'networks', 'document', 'classification', 'in', 'citation', 'networks', 'using', 'graph', 'neural', 'networks', 'and', 'hyperparameter', 'optimization', 'for', 'fully', 'connected', 'networks', 'all', 'experiments', 'demonstrate', 'that', 'rbps', 'especially', 'the', 'neumannrbp', 'variant', 'are', 'efficient', 'and', 'effective', 'for', 'optimizing', 'convergent', 'recurrent', 'neural', 'networks', 'code', 'is', 'released', 'at', 'urlhttpsgithubcomlrjconanrbp']]
|
[-0.09978494698683694, 0.05163525808118768, -0.026176564156549512, 0.08275533132194601, -0.08044851597023571, -0.18469808302674587, 0.043876022848643836, 0.4796016924430967, -0.3206325221697909, -0.2610789324465365, 0.1280875234265945, -0.2331739776259796, -0.23149343636174166, 0.17384798055538883, -0.07457102841528301, 0.07788907150494527, 0.12666410339887363, 0.03347729695295649, -0.0561442287376471, -0.30965767951637607, 0.28758466385029763, 0.04579004636106184, 0.30726542218146824, 0.0024423047884325074, 0.12910145000469955, -0.0203292268122752, -0.010233422094206144, 0.008090853001680467, -0.05947004959590857, 0.09013991323360182, 0.22908169004080406, 0.15777337453146648, 0.32012055738067086, -0.4848760304633867, -0.2253758117357003, 0.11620113459210117, 0.16902517985443694, 0.09302676145165747, 0.0007467812277579245, -0.24001673943447796, 0.10082722712888734, -0.16054422940829066, 0.009076953584093196, -0.14788755424496078, -0.012460687400337744, 0.054877557005588114, -0.23512482871724802, 0.05324189558488395, 0.053759694261954157, 0.017029191901780327, -0.03700586056636114, -0.11357801374918841, 0.020180047444346084, 0.09568099444429692, 0.026673607053477075, 0.03949060926346907, 0.09326631595231684, -0.10611838726296585, -0.14849078760470275, 0.3154721542098257, -0.08526296741041875, -0.2031243281475232, 0.1832056522940878, -0.016739891827833694, -0.16676411605379604, 0.03470834672856205, 0.22199536177220863, 0.11210149802364312, -0.13806990614650747, 0.06102724557828654, -0.01365321044894782, 0.15139749679599537, 0.0854294649824234, -0.0006443171976617985, 0.10438867057552682, 0.22980166608225797, 0.07239045388543035, 0.17200390582030348, -0.07979980276995066, -0.12399359388797024, -0.22455382583566108, -0.11844174413527543, -0.18223135183299227, 0.005775516341718567, -0.12125901542779727, -0.16746123621615205, 0.41117963153723774, 0.15694928461347113, 0.20224208294643792, 0.19892094449469722, 0.3035231449266339, 0.06293977416186992, 0.11677191636144099, 0.16579524169422008, 0.15248059067427627, 0.09749251278570865, 0.14095937065453595, -0.19552470252595164, 0.09468312263330021, 0.09717631052768269]
|
1,803.06397
|
Deep learning for affective computing: text-based emotion recognition in
decision support
|
Emotions widely affect human decision-making. This fact is taken into account
by affective computing with the goal of tailoring decision support to the
emotional states of individuals. However, the accurate recognition of emotions
within narrative documents presents a challenging undertaking due to the
complexity and ambiguity of language. Performance improvements can be achieved
through deep learning; yet, as demonstrated in this paper, the specific nature
of this task requires the customization of recurrent neural networks with
regard to bidirectional processing, dropout layers as a means of
regularization, and weighted loss functions. In addition, we propose
sent2affect, a tailored form of transfer learning for affective computing: here
the network is pre-trained for a different task (i.e. sentiment analysis),
while the output layer is subsequently tuned to the task of emotion
recognition. The resulting performance is evaluated in a holistic setting
across 6 benchmark datasets, where we find that both recurrent neural networks
and transfer learning consistently outperform traditional machine learning.
Altogether, the findings have considerable implications for the use of
affective computing.
|
cs.CL
|
emotions widely affect human decisionmaking this fact is taken into account by affective computing with the goal of tailoring decision support to the emotional states of individuals however the accurate recognition of emotions within narrative documents presents a challenging undertaking due to the complexity and ambiguity of language performance improvements can be achieved through deep learning yet as demonstrated in this paper the specific nature of this task requires the customization of recurrent neural networks with regard to bidirectional processing dropout layers as a means of regularization and weighted loss functions in addition we propose sent2affect a tailored form of transfer learning for affective computing here the network is pretrained for a different task ie sentiment analysis while the output layer is subsequently tuned to the task of emotion recognition the resulting performance is evaluated in a holistic setting across 6 benchmark datasets where we find that both recurrent neural networks and transfer learning consistently outperform traditional machine learning altogether the findings have considerable implications for the use of affective computing
|
[['emotions', 'widely', 'affect', 'human', 'decisionmaking', 'this', 'fact', 'is', 'taken', 'into', 'account', 'by', 'affective', 'computing', 'with', 'the', 'goal', 'of', 'tailoring', 'decision', 'support', 'to', 'the', 'emotional', 'states', 'of', 'individuals', 'however', 'the', 'accurate', 'recognition', 'of', 'emotions', 'within', 'narrative', 'documents', 'presents', 'a', 'challenging', 'undertaking', 'due', 'to', 'the', 'complexity', 'and', 'ambiguity', 'of', 'language', 'performance', 'improvements', 'can', 'be', 'achieved', 'through', 'deep', 'learning', 'yet', 'as', 'demonstrated', 'in', 'this', 'paper', 'the', 'specific', 'nature', 'of', 'this', 'task', 'requires', 'the', 'customization', 'of', 'recurrent', 'neural', 'networks', 'with', 'regard', 'to', 'bidirectional', 'processing', 'dropout', 'layers', 'as', 'a', 'means', 'of', 'regularization', 'and', 'weighted', 'loss', 'functions', 'in', 'addition', 'we', 'propose', 'sent2affect', 'a', 'tailored', 'form', 'of', 'transfer', 'learning', 'for', 'affective', 'computing', 'here', 'the', 'network', 'is', 'pretrained', 'for', 'a', 'different', 'task', 'ie', 'sentiment', 'analysis', 'while', 'the', 'output', 'layer', 'is', 'subsequently', 'tuned', 'to', 'the', 'task', 'of', 'emotion', 'recognition', 'the', 'resulting', 'performance', 'is', 'evaluated', 'in', 'a', 'holistic', 'setting', 'across', '6', 'benchmark', 'datasets', 'where', 'we', 'find', 'that', 'both', 'recurrent', 'neural', 'networks', 'and', 'transfer', 'learning', 'consistently', 'outperform', 'traditional', 'machine', 'learning', 'altogether', 'the', 'findings', 'have', 'considerable', 'implications', 'for', 'the', 'use', 'of', 'affective', 'computing']]
|
[-0.040264733341995027, 0.0157034256733502, -0.04687068870921126, 0.06979178943301496, -0.12322245958425543, -0.1767563384396079, 0.05853600643698455, 0.46677169556565146, -0.2624791383085882, -0.3348897350185058, 0.043581658613402394, -0.23783264182069722, -0.23179524207816404, 0.18362045091138604, -0.13698224005467421, 0.08924390814705369, 0.14586261798326364, 0.058023267820039214, -0.046583610925796055, -0.2807448233833865, 0.32238918335505706, 0.03328626907810651, 0.3724831232088892, 0.0707431885509697, 0.12269102781737114, -0.0245569877066266, -0.03535547352889005, -0.03173201827688471, -0.007916391361718792, 0.22357810159480912, 0.3839401765699115, 0.20640516716110355, 0.3979789955240181, -0.41064179338076534, -0.24748797683620496, 0.07725811304031488, 0.18210176141001283, 0.09445432734561002, -0.01626942490830141, -0.33636885491364144, 0.076151275260867, -0.19691734891932677, 0.058075152674470755, -0.1542864537688301, 0.013815913458957392, -0.04604620063362424, -0.27504801332662976, 0.015970691145562075, 0.08980358165195759, 0.116925670857103, -0.05077105212326655, -0.11629616743337144, 0.029447205879670733, 0.23308489812154543, 0.05615556174478329, 0.059480614895822806, 0.1610387540901737, -0.23443691409843537, -0.18217457921572905, 0.3753813987091074, -0.04637161657104597, -0.22506442717978428, 0.17820782135240734, -0.007946884121252771, -0.1522919716039563, 0.06701395975918893, 0.2586612496415482, 0.07487684771802057, -0.17909838572034942, -0.0064628254577709255, -0.009300525873036617, 0.19489719824016313, 0.05489627447335378, 0.005644381284604177, 0.19333833892939284, 0.29745745385640904, -0.018334603028522585, 0.15988158454420046, -0.08531874680107542, -0.082064024462392, -0.16569651287487325, -0.12773482300784536, -0.1895050872760989, -0.0028788092292790467, -0.08627754042433533, -0.148700621817261, 0.3940725055865615, 0.21688957652496516, 0.18558235802304218, 0.12305934279592133, 0.32731411435148294, 0.06625753229840056, 0.12239763417335994, 0.10204481285147587, 0.18237063847619164, 0.006490947641706203, 0.1734476345604943, -0.20549744660418262, 0.13246517239878064, 0.009543441357912824]
|
1,803.06398
|
Parabolic semi-orthogonal decompositions and Kummer flat invariants of
log schemes
|
We construct semi-orthogonal decompositions on triangulated categories of
parabolic sheaves on certain kinds of logarithmic schemes. This provides a
categorification of the decomposition theorems in Kummer flat K-theory due to
Hagihara and Nizio{\l}. Our techniques allow us to generalize Hagihara and
Nizio{\l}'s results to a much larger class of invariants in addition to
K-theory, and also to extend them to more general logarithmic stacks.
|
math.AG
|
we construct semiorthogonal decompositions on triangulated categories of parabolic sheaves on certain kinds of logarithmic schemes this provides a categorification of the decomposition theorems in kummer flat ktheory due to hagihara and niziol our techniques allow us to generalize hagihara and niziols results to a much larger class of invariants in addition to ktheory and also to extend them to more general logarithmic stacks
|
[['we', 'construct', 'semiorthogonal', 'decompositions', 'on', 'triangulated', 'categories', 'of', 'parabolic', 'sheaves', 'on', 'certain', 'kinds', 'of', 'logarithmic', 'schemes', 'this', 'provides', 'a', 'categorification', 'of', 'the', 'decomposition', 'theorems', 'in', 'kummer', 'flat', 'ktheory', 'due', 'to', 'hagihara', 'and', 'niziol', 'our', 'techniques', 'allow', 'us', 'to', 'generalize', 'hagihara', 'and', 'niziols', 'results', 'to', 'a', 'much', 'larger', 'class', 'of', 'invariants', 'in', 'addition', 'to', 'ktheory', 'and', 'also', 'to', 'extend', 'them', 'to', 'more', 'general', 'logarithmic', 'stacks']]
|
[-0.09383168030858467, -0.027515969689569025, -0.1471926634062509, 0.12929221580652367, -0.12894202055806508, -0.1621965429913558, 0.011305724748708003, 0.3422427283080875, -0.3418529732000144, -0.23054448854689655, 0.06392900371011805, -0.186685743178699, -0.14350204366320346, 0.24995849780036045, -0.2567376541737162, -0.01558460515816925, 0.011802501020357624, -0.00684158799055292, -0.132095639345801, -0.3200783581992031, 0.44287203374456185, -0.0007889959045120927, 0.2759497037432233, 0.0807806083161506, 0.0413210020537992, -0.007719697713180155, -0.0709894353096358, -0.015449021866575617, -0.19547713338779132, 0.22808333052719226, 0.33738657634048796, -0.0008796252478219447, 0.17923416862966585, -0.41104497027690295, -0.11442706046900789, 0.15756982210718218, 0.08895155709603282, 0.1284467148228136, 0.041562000525014124, -0.2913370508334187, 0.13081048531305106, -0.21754811432395801, -0.1488613320178673, -0.15742132373032022, 0.02030680098067053, -0.0015017658044568828, -0.22160267678745946, -0.025210128994525, 0.07025051279543121, 0.03465925482269682, -0.11121692692433469, -0.07792170331851564, -0.030304469607129205, 0.08743517253486836, -0.0032930155513716526, -0.011284603118957555, 0.07853109763599321, -0.10373030688048752, -0.15455481683316288, 0.34507653294283835, -0.05823192197722612, -0.23668415177247074, 0.19836561607777095, -0.13176946906892004, -0.1887786712375332, 0.13191523277353434, 0.12231390411797606, 0.17436456160436645, 0.010194440173809646, 0.09378066058671407, -0.09171332821982806, 0.07899671859397996, 0.13425550197602296, 0.0687019539601933, 0.07686471914658781, 0.04667259344342546, 0.0829003046068256, 0.18411783204169668, 0.0029325281440654434, -0.0763878549952976, -0.2841580701747634, -0.19482720282203594, -0.013369947671890259, 0.1509414079797561, -0.09797486120793915, -0.18945275653978108, 0.44035717087690945, 0.13366659200887698, 0.19021897958438905, 0.18093563483447814, 0.28496692393291895, 0.006724414104580512, 0.11997184569596267, 0.008399967216317862, 0.1247907869124663, 0.28346644888525124, 0.026185276471536425, -0.04044282541908018, -0.06988085491857568, 0.22409972608028378]
|
1,803.06399
|
Generation of Electron Whistler Waves at the Mirror Mode Magnetic Holes:
MMS Observations and PIC Simulation
|
The Magnetospheric Multiscale (MMS) mission has observed electron whistler
waves at the center and at the edges of magnetic holes in the dayside
magnetosheath. The magnetic holes are nonlinear mirror structures since their
magnitude is anti-correlated with particle density. In this article, we examine
the growth mechanisms of these whistler waves and their interaction with the
host magnetic hole. In the observations, as magnetic holes develop and get
deeper, an electron population gets trapped and develops a temperature
anisotropy favorable for whistler waves to be generated. In addition, the
decrease in magnetic field magnitude and the increase in density reduces the
electron resonance energy, which promotes the electron cyclotron resonance. To
investigate this process, we used an expanding box particle-in-cell simulations
to produce the mirror instability, which then evolves into magnetic holes. The
simulation shows that whistler waves can be generated at the center and edges
of magnetic holes, which reproduces the primary features of the MMS
observations. The simulation shows that the electron temperature anisotropy
develops in the center of the magnetic hole once the mirror instability reaches
its nonlinear stage of evolution. The plasma is then unstable to whistler waves
at the minimum of the magnetic field structures. In the saturation regime of
mirror instability, when magnetic holes are developed, the electron temperature
anisotropy appears at the edges of the holes and electron distributions become
more isotropic at the magnetic field minimum. At the edges, the expansion of
magnetic holes decelerates the electrons which leads to temperature
anisotropies.
|
physics.space-ph
|
the magnetospheric multiscale mms mission has observed electron whistler waves at the center and at the edges of magnetic holes in the dayside magnetosheath the magnetic holes are nonlinear mirror structures since their magnitude is anticorrelated with particle density in this article we examine the growth mechanisms of these whistler waves and their interaction with the host magnetic hole in the observations as magnetic holes develop and get deeper an electron population gets trapped and develops a temperature anisotropy favorable for whistler waves to be generated in addition the decrease in magnetic field magnitude and the increase in density reduces the electron resonance energy which promotes the electron cyclotron resonance to investigate this process we used an expanding box particleincell simulations to produce the mirror instability which then evolves into magnetic holes the simulation shows that whistler waves can be generated at the center and edges of magnetic holes which reproduces the primary features of the mms observations the simulation shows that the electron temperature anisotropy develops in the center of the magnetic hole once the mirror instability reaches its nonlinear stage of evolution the plasma is then unstable to whistler waves at the minimum of the magnetic field structures in the saturation regime of mirror instability when magnetic holes are developed the electron temperature anisotropy appears at the edges of the holes and electron distributions become more isotropic at the magnetic field minimum at the edges the expansion of magnetic holes decelerates the electrons which leads to temperature anisotropies
|
[['the', 'magnetospheric', 'multiscale', 'mms', 'mission', 'has', 'observed', 'electron', 'whistler', 'waves', 'at', 'the', 'center', 'and', 'at', 'the', 'edges', 'of', 'magnetic', 'holes', 'in', 'the', 'dayside', 'magnetosheath', 'the', 'magnetic', 'holes', 'are', 'nonlinear', 'mirror', 'structures', 'since', 'their', 'magnitude', 'is', 'anticorrelated', 'with', 'particle', 'density', 'in', 'this', 'article', 'we', 'examine', 'the', 'growth', 'mechanisms', 'of', 'these', 'whistler', 'waves', 'and', 'their', 'interaction', 'with', 'the', 'host', 'magnetic', 'hole', 'in', 'the', 'observations', 'as', 'magnetic', 'holes', 'develop', 'and', 'get', 'deeper', 'an', 'electron', 'population', 'gets', 'trapped', 'and', 'develops', 'a', 'temperature', 'anisotropy', 'favorable', 'for', 'whistler', 'waves', 'to', 'be', 'generated', 'in', 'addition', 'the', 'decrease', 'in', 'magnetic', 'field', 'magnitude', 'and', 'the', 'increase', 'in', 'density', 'reduces', 'the', 'electron', 'resonance', 'energy', 'which', 'promotes', 'the', 'electron', 'cyclotron', 'resonance', 'to', 'investigate', 'this', 'process', 'we', 'used', 'an', 'expanding', 'box', 'particleincell', 'simulations', 'to', 'produce', 'the', 'mirror', 'instability', 'which', 'then', 'evolves', 'into', 'magnetic', 'holes', 'the', 'simulation', 'shows', 'that', 'whistler', 'waves', 'can', 'be', 'generated', 'at', 'the', 'center', 'and', 'edges', 'of', 'magnetic', 'holes', 'which', 'reproduces', 'the', 'primary', 'features', 'of', 'the', 'mms', 'observations', 'the', 'simulation', 'shows', 'that', 'the', 'electron', 'temperature', 'anisotropy', 'develops', 'in', 'the', 'center', 'of', 'the', 'magnetic', 'hole', 'once', 'the', 'mirror', 'instability', 'reaches', 'its', 'nonlinear', 'stage', 'of', 'evolution', 'the', 'plasma', 'is', 'then', 'unstable', 'to', 'whistler', 'waves', 'at', 'the', 'minimum', 'of', 'the', 'magnetic', 'field', 'structures', 'in', 'the', 'saturation', 'regime', 'of', 'mirror', 'instability', 'when', 'magnetic', 'holes', 'are', 'developed', 'the', 'electron', 'temperature', 'anisotropy', 'appears', 'at', 'the', 'edges', 'of', 'the', 'holes', 'and', 'electron', 'distributions', 'become', 'more', 'isotropic', 'at', 'the', 'magnetic', 'field', 'minimum', 'at', 'the', 'edges', 'the', 'expansion', 'of', 'magnetic', 'holes', 'decelerates', 'the', 'electrons', 'which', 'leads', 'to', 'temperature', 'anisotropies']]
|
[-0.16669253264227882, 0.2464294963470893, -0.040087624908424914, 0.10001470306449482, -0.04112309762090444, -0.0632561060525477, -0.045777603024151174, 0.3401505717970431, -0.25166449138522146, -0.33289536816999316, 0.03521199057623744, -0.3163575717434287, -0.04954399923607707, 0.17434673203201964, 0.06362238919129595, -0.025208402239019052, 0.01149372673779726, 0.0038330619260668755, -0.029472282215952873, -0.1702221017833799, 0.29407586055621504, 0.15825323117896914, 0.27600510535854844, 0.04962216500192881, 0.06481284474581481, -0.0298524499097839, 0.08475126593839377, 0.02970478541648481, -0.14837302161054686, 0.03423648346401751, 0.19014834707812406, 0.008655732814222574, 0.23382042368873954, -0.5035436940607615, -0.23743190628290176, 0.005432679297402501, 0.1784259929135442, 0.13523756587394747, -0.08304450767528034, -0.22867448496678844, 0.057996702209333305, -0.1148614165247418, -0.18909654592350125, 0.00449461421201704, 0.00979899776680395, 0.024907848329516126, -0.29384875917248426, 0.12178001072444021, 0.07109035307448357, 0.02993804273940623, -0.11893881693435833, -0.03864127525314689, -0.10795771084167063, 0.041251540806260895, 0.1287696871625958, 0.07544985901517794, 0.2081117609143257, -0.12657658337056638, -0.06646981922537089, 0.3223076546639204, -0.04107829078286886, -0.0782270518084988, 0.18512701891362668, -0.28342945797555147, -0.04771730986982584, 0.21535446002334357, 0.17420961157791318, 0.08394984415080399, -0.06007602219033288, 0.04952455360093154, 0.014559207390062511, 0.1426508487155661, 0.09680545125156641, 0.023096784240566194, 0.3431725936755538, 0.15451612039096654, 0.05050088789314031, 0.14008750273566692, -0.17497217915393412, -0.0030614364799112083, -0.22188824223726988, -0.122475442443043, -0.16406042594776954, 0.008394235746003688, -0.08714270830486202, -0.18458090668264776, 0.43453049489110707, 0.17172159262653441, 0.15291556575149298, -0.0659367537451908, 0.29926489568932446, 0.1531999851972796, 0.05483612265624106, 0.1521810299102217, 0.32745135502517225, 0.18373927938938142, 0.15354152054712175, -0.2932080604601651, 0.00035473830811679364, 0.028337832541204987]
|
1,803.064
|
The Unruh effect for mixing neutrinos
|
Recently, the inverse $\beta$-decay rate calculated with respect to uniformly
accelerated observers (experiencing the Unruh thermal bath) was revisited.
Concerns have been raised regarding the compatibility of inertial and
accelerated observers' results when neutrino mixing is taken into account.
Here, we show that these concerns are unfounded by discussing the properties of
the Unruh thermal bath with mixing neutrinos and explicitly calculating the
decay rates according to both sets of observers and confirming that they are in
agreement. The Unruh effect is perfectly valid for mixing neutrinos.
|
gr-qc hep-th
|
recently the inverse betadecay rate calculated with respect to uniformly accelerated observers experiencing the unruh thermal bath was revisited concerns have been raised regarding the compatibility of inertial and accelerated observers results when neutrino mixing is taken into account here we show that these concerns are unfounded by discussing the properties of the unruh thermal bath with mixing neutrinos and explicitly calculating the decay rates according to both sets of observers and confirming that they are in agreement the unruh effect is perfectly valid for mixing neutrinos
|
[['recently', 'the', 'inverse', 'betadecay', 'rate', 'calculated', 'with', 'respect', 'to', 'uniformly', 'accelerated', 'observers', 'experiencing', 'the', 'unruh', 'thermal', 'bath', 'was', 'revisited', 'concerns', 'have', 'been', 'raised', 'regarding', 'the', 'compatibility', 'of', 'inertial', 'and', 'accelerated', 'observers', 'results', 'when', 'neutrino', 'mixing', 'is', 'taken', 'into', 'account', 'here', 'we', 'show', 'that', 'these', 'concerns', 'are', 'unfounded', 'by', 'discussing', 'the', 'properties', 'of', 'the', 'unruh', 'thermal', 'bath', 'with', 'mixing', 'neutrinos', 'and', 'explicitly', 'calculating', 'the', 'decay', 'rates', 'according', 'to', 'both', 'sets', 'of', 'observers', 'and', 'confirming', 'that', 'they', 'are', 'in', 'agreement', 'the', 'unruh', 'effect', 'is', 'perfectly', 'valid', 'for', 'mixing', 'neutrinos']]
|
[-0.08062880441824767, 0.2947713271928844, -0.08603288018647795, 0.11481298280855769, -0.021805855948692082, -0.15206509229095502, 0.010879117339828062, 0.39362035640354814, -0.2247649285856677, -0.2492670255329128, 0.053108035823619316, -0.30927794466287584, -0.002009788498646398, 0.20308059296602832, -0.06754332591897283, 0.058986599123555014, 0.07954646610579956, 0.007183396096887259, -0.044558915894360805, -0.2517022483436198, 0.3162096710286863, 0.170187603350429, 0.2779256588479654, 0.05713057013806598, 0.1080389420030874, -0.04377481485743761, -0.07577647107664025, 0.041115484898157244, -0.10373323217610395, 0.013873631839811716, 0.1835081521047001, 0.10072020973057497, 0.21509104620279937, -0.406610651733889, -0.22687692427472478, 0.13193962520159697, 0.13824763793455458, 0.11993899772307653, -0.09077792356176109, -0.3383904631308483, 0.0520732241853986, -0.17280673145198788, -0.1146218686675032, -0.04605984852124734, 0.018945068784657567, -0.03231834189366849, -0.2347308418274611, 0.11358884656694772, 0.05077108693705208, -0.003368298908502891, -0.11317487211962199, -0.13597565354650903, 0.033894079657078816, 0.14458261900641634, 0.20107449254492063, -0.07119649398707967, 0.13978296033395776, -0.056262427009642124, -0.08721958882317225, 0.3982495462050897, -0.05179348340439985, -0.15751217123677677, 0.17203165721362348, -0.19088037688306522, -0.04891767390821686, 0.1121089829870596, 0.08482768607657702, 0.04755866438171816, -0.1868572023346948, 0.0863148757375659, -0.024802983460155713, 0.10312792186989267, 0.09484872505625432, 0.05404349104907757, 0.24779068104837132, 0.07271564238297956, -0.013688752125284967, 0.10110838991996629, -0.018479680610371047, -0.10372941531562085, -0.32662368176141005, -0.13896420612481647, -0.16215484214668302, 0.07745674433422158, -0.05008868336220588, -0.0923011202964632, 0.3316765517001736, 0.17964191441477714, 0.15823495191061634, 0.020357390030704695, 0.2716271304150765, 0.13047619696556664, -0.008894479737199586, 0.11334063142709348, 0.3684434243129973, 0.19562052422866824, 0.08490641872216573, -0.3092428357458316, 0.09311979797122807, 0.049515955118012836]
|
1,803.06401
|
Evaluating Conditional Cash Transfer Policies with Machine Learning
Methods
|
This paper presents an out-of-sample prediction comparison between major
machine learning models and the structural econometric model. Over the past
decade, machine learning has established itself as a powerful tool in many
prediction applications, but this approach is still not widely adopted in
empirical economic studies. To evaluate the benefits of this approach, I use
the most common machine learning algorithms, CART, C4.5, LASSO, random forest,
and adaboost, to construct prediction models for a cash transfer experiment
conducted by the Progresa program in Mexico, and I compare the prediction
results with those of a previous structural econometric study. Two prediction
tasks are performed in this paper: the out-of-sample forecast and the long-term
within-sample simulation. For the out-of-sample forecast, both the mean
absolute error and the root mean square error of the school attendance rates
found by all machine learning models are smaller than those found by the
structural model. Random forest and adaboost have the highest accuracy for the
individual outcomes of all subgroups. For the long-term within-sample
simulation, the structural model has better performance than do all of the
machine learning models. The poor within-sample fitness of the machine learning
model results from the inaccuracy of the income and pregnancy prediction
models. The result shows that the machine learning model performs better than
does the structural model when there are many data to learn; however, when the
data are limited, the structural model offers a more sensible prediction. The
findings of this paper show promise for adopting machine learning in economic
policy analyses in the era of big data.
|
econ.EM stat.ML
|
this paper presents an outofsample prediction comparison between major machine learning models and the structural econometric model over the past decade machine learning has established itself as a powerful tool in many prediction applications but this approach is still not widely adopted in empirical economic studies to evaluate the benefits of this approach i use the most common machine learning algorithms cart c45 lasso random forest and adaboost to construct prediction models for a cash transfer experiment conducted by the progresa program in mexico and i compare the prediction results with those of a previous structural econometric study two prediction tasks are performed in this paper the outofsample forecast and the longterm withinsample simulation for the outofsample forecast both the mean absolute error and the root mean square error of the school attendance rates found by all machine learning models are smaller than those found by the structural model random forest and adaboost have the highest accuracy for the individual outcomes of all subgroups for the longterm withinsample simulation the structural model has better performance than do all of the machine learning models the poor withinsample fitness of the machine learning model results from the inaccuracy of the income and pregnancy prediction models the result shows that the machine learning model performs better than does the structural model when there are many data to learn however when the data are limited the structural model offers a more sensible prediction the findings of this paper show promise for adopting machine learning in economic policy analyses in the era of big data
|
[['this', 'paper', 'presents', 'an', 'outofsample', 'prediction', 'comparison', 'between', 'major', 'machine', 'learning', 'models', 'and', 'the', 'structural', 'econometric', 'model', 'over', 'the', 'past', 'decade', 'machine', 'learning', 'has', 'established', 'itself', 'as', 'a', 'powerful', 'tool', 'in', 'many', 'prediction', 'applications', 'but', 'this', 'approach', 'is', 'still', 'not', 'widely', 'adopted', 'in', 'empirical', 'economic', 'studies', 'to', 'evaluate', 'the', 'benefits', 'of', 'this', 'approach', 'i', 'use', 'the', 'most', 'common', 'machine', 'learning', 'algorithms', 'cart', 'c45', 'lasso', 'random', 'forest', 'and', 'adaboost', 'to', 'construct', 'prediction', 'models', 'for', 'a', 'cash', 'transfer', 'experiment', 'conducted', 'by', 'the', 'progresa', 'program', 'in', 'mexico', 'and', 'i', 'compare', 'the', 'prediction', 'results', 'with', 'those', 'of', 'a', 'previous', 'structural', 'econometric', 'study', 'two', 'prediction', 'tasks', 'are', 'performed', 'in', 'this', 'paper', 'the', 'outofsample', 'forecast', 'and', 'the', 'longterm', 'withinsample', 'simulation', 'for', 'the', 'outofsample', 'forecast', 'both', 'the', 'mean', 'absolute', 'error', 'and', 'the', 'root', 'mean', 'square', 'error', 'of', 'the', 'school', 'attendance', 'rates', 'found', 'by', 'all', 'machine', 'learning', 'models', 'are', 'smaller', 'than', 'those', 'found', 'by', 'the', 'structural', 'model', 'random', 'forest', 'and', 'adaboost', 'have', 'the', 'highest', 'accuracy', 'for', 'the', 'individual', 'outcomes', 'of', 'all', 'subgroups', 'for', 'the', 'longterm', 'withinsample', 'simulation', 'the', 'structural', 'model', 'has', 'better', 'performance', 'than', 'do', 'all', 'of', 'the', 'machine', 'learning', 'models', 'the', 'poor', 'withinsample', 'fitness', 'of', 'the', 'machine', 'learning', 'model', 'results', 'from', 'the', 'inaccuracy', 'of', 'the', 'income', 'and', 'pregnancy', 'prediction', 'models', 'the', 'result', 'shows', 'that', 'the', 'machine', 'learning', 'model', 'performs', 'better', 'than', 'does', 'the', 'structural', 'model', 'when', 'there', 'are', 'many', 'data', 'to', 'learn', 'however', 'when', 'the', 'data', 'are', 'limited', 'the', 'structural', 'model', 'offers', 'a', 'more', 'sensible', 'prediction', 'the', 'findings', 'of', 'this', 'paper', 'show', 'promise', 'for', 'adopting', 'machine', 'learning', 'in', 'economic', 'policy', 'analyses', 'in', 'the', 'era', 'of', 'big', 'data']]
|
[-0.0012461305977992396, 0.01011822715229274, -0.1058605881362909, 0.10687234987860768, -0.06261566954459923, -0.17019771406980785, 0.05063762037491634, 0.41941511284732563, -0.2595662855274407, -0.3386262518112839, 0.107692923796863, -0.29900962287473803, -0.17092604184357815, 0.2221233642109019, -0.11516018490878771, 0.11691447780746247, 0.13360271955620942, 0.06434362637720513, -0.046117093770056385, -0.3123541036620736, 0.2428425748088185, 0.10510904056426411, 0.3659581328637927, -0.02013032916622258, 0.07108950307979302, -0.008193732782952042, -0.054220101146142514, 0.004194775484789983, -0.10684347650613012, 0.18398455417608037, 0.3046567607217188, 0.20112021318834605, 0.3971491007342877, -0.3668814911237382, -0.26186084187071335, 0.15118818494228783, 0.10364201155753669, 0.08394873579856167, -0.015620126116863078, -0.25972870532800824, 0.06257721530516276, -0.1968280261842728, -0.02594536676477914, -0.12778961055455407, -0.044934894396963035, 0.004709061150462456, -0.26474314645062197, 0.07535999857763936, 0.07027755164303978, 0.13286687099126718, -0.06350016505745128, -0.17901496901122932, 0.008984903287156898, 0.1456922099873438, 0.10793397591034001, 0.04105182159710028, 0.11606256416135802, -0.17847703797645526, -0.19157155654231323, 0.3806190048596142, -0.05541118842626708, -0.1394951552036668, 0.19139242463835748, -0.08566497705164851, -0.16357261817551733, 0.05166349765165029, 0.24532708359552316, 0.050816493633411765, -0.17181703595062053, 0.01915254711616662, -0.026465327925728383, 0.15258359455622186, -0.030405949461399705, -0.06718370701909122, 0.15473050188046653, 0.2568601461335959, 0.010346145512496614, 0.06999615182862778, -0.09776460133047063, -0.12211333666155007, -0.2141253663223366, -0.10455177005508044, -0.1382521827022894, -0.02431803318561984, -0.14591160210814286, -0.1533851364893685, 0.39525387115762156, 0.23533103644531436, 0.16292530499420282, 0.13416893689616308, 0.33274377480196016, 0.04580664619017737, 0.07204615965244651, 0.10328054779593951, 0.24280953890658397, 0.05344200550585726, 0.11630919736425274, -0.17536200875412802, 0.15792312134780048, 0.01093997507316553]
|
1,803.06402
|
Shadowing for nonautonomous dynamics
|
We prove that whenever a sequence of invertible and bounded operators
$(A_m)_{m\in \mathbb{Z}}$ acting on a Banach space $X$ admits an exponential
dichotomy and a sequence of differentiable maps $f_m \colon X\to X$, $m\in
\mathbb{Z}$, has bounded and H\"{o}lder derivatives, the nonautonomous dynamics
given by $x_{m+1}=A_mx_m+f_m(x_m)$, $m\in \mathbb{Z}$ has various shadowing
properties. Hence, we extend recent results of Bernardes Jr. et al. in several
directions. As a nontrivial application of our results, we give a new proof of
the nonautonomous Grobman-Hartman theorem.
|
math.DS
|
we prove that whenever a sequence of invertible and bounded operators a_m_min mathbbz acting on a banach space x admits an exponential dichotomy and a sequence of differentiable maps f_m colon xto x min mathbbz has bounded and holder derivatives the nonautonomous dynamics given by x_m1a_mx_mf_mx_m min mathbbz has various shadowing properties hence we extend recent results of bernardes jr et al in several directions as a nontrivial application of our results we give a new proof of the nonautonomous grobmanhartman theorem
|
[['we', 'prove', 'that', 'whenever', 'a', 'sequence', 'of', 'invertible', 'and', 'bounded', 'operators', 'a_m_min', 'mathbbz', 'acting', 'on', 'a', 'banach', 'space', 'x', 'admits', 'an', 'exponential', 'dichotomy', 'and', 'a', 'sequence', 'of', 'differentiable', 'maps', 'f_m', 'colon', 'xto', 'x', 'min', 'mathbbz', 'has', 'bounded', 'and', 'holder', 'derivatives', 'the', 'nonautonomous', 'dynamics', 'given', 'by', 'x_m1a_mx_mf_mx_m', 'min', 'mathbbz', 'has', 'various', 'shadowing', 'properties', 'hence', 'we', 'extend', 'recent', 'results', 'of', 'bernardes', 'jr', 'et', 'al', 'in', 'several', 'directions', 'as', 'a', 'nontrivial', 'application', 'of', 'our', 'results', 'we', 'give', 'a', 'new', 'proof', 'of', 'the', 'nonautonomous', 'grobmanhartman', 'theorem']]
|
[-0.19423819578951224, 0.08457122337586043, -0.0852188986435067, 0.026921374222729354, -0.06938426345877816, -0.11984830824076198, 0.009284357065916992, 0.37952630161307754, -0.33061606021365153, -0.12758759343996645, 0.12736155093734852, -0.2823975805091322, -0.1821335970889777, 0.22590057608904318, -0.14739666071545798, 0.049023967623361385, 0.041621982876677066, 0.01732674991362728, -0.10846605067781638, -0.2799484932053019, 0.3201731227018172, -0.09410456572659313, 0.12060722142341547, 0.04337420545052737, 0.1574677613854874, 0.016392646217718722, -0.011095036691403947, -0.030791289842818516, -0.2292920451412101, 0.04123481441056356, 0.20743759342003615, 0.10738720699446276, 0.3139345705450978, -0.3620141678584332, -0.20404623738722877, 0.21833264962770044, 0.11587397510011214, -0.0595265474752523, -0.05895313093060395, -0.3167933106655255, 0.09888328458182513, -0.15786733652639667, -0.14801692270557396, -0.11030380349839106, 0.15145136051578448, 0.0960828211682383, -0.3356022456224309, 0.030099965224508196, 0.22539052786305547, 0.0798998428217601, -0.0682622060077847, -0.08705623362911866, -0.07838801289180992, 0.0772233524650801, -0.022333764587529004, 0.16676722486736253, 0.06998472556879279, -0.0010265619261190296, -0.13996438885806128, 0.2950255740201101, -0.10830863545415922, -0.19466724965022877, 0.14523934252138132, -0.14160101992893032, -0.2069378634681925, 0.08966331400442869, 0.09754181392490864, 0.1694339749868959, -0.0536292377859354, 0.24424572278585402, -0.15683668798883446, 0.141897904680809, 0.08799335324438289, 0.040095309681782966, 0.04820491666614544, 0.09841748124454171, 0.15138912116526626, 0.1400573288119631, 0.028348551236558706, -0.01709892178841983, -0.337984600791242, -0.1381875591701828, -0.14484055160428397, 0.17671379174571483, -0.10798112287247932, -0.16787388836964964, 0.38033405345049687, 0.07185558572527953, 0.22557000461383722, 0.15315293173771352, 0.1760417140321806, 0.12791884914622642, -0.03573146552662365, 0.06240526875362775, 0.060453917330596595, 0.1838844070007326, 0.0622560262796469, -0.11340057261404582, 0.01310176571860211, 0.1995909219211171]
|
1,803.06403
|
Characterizing Earth Analogs in Reflected Light: Atmospheric Retrieval
Studies for Future Space Telescopes
|
Space-based high contrast imaging mission concepts for studying rocky
exoplanets in reflected light are currently under community study. We develop
an inverse modeling framework to estimate the science return of such missions
given different instrument design considerations. By combining an exoplanet
albedo model, an instrument noise model, and an ensemble Markov chain Monte
Carlo sampler, we explore retrievals of atmospheric and planetary properties
for Earth twins as a function of signal-to-noise ratio (SNR) and resolution
($R$). Our forward model includes Rayleigh scattering, single-layer water
clouds with patchy coverage, and pressure-dependent absorption due to water
vapor, oxygen, and ozone. We simulate data at $R = 70$ and $R = 140$ from
0.4-1.0 $\mu$m with SNR $ = 5, 10, 15, 20$ at 550 nm (i.e., for
HabEx/LUVOIR-type instruments). At these same SNR, we simulate data for WFIRST
paired with a starshade, which includes two photometric points between 0.48-0.6
$\mu$m and $R = 50$ spectroscopy from 0.6-0.97 $\mu$m. Given our noise model
for WFIRST-type detectors, we find that weak detections of water vapor, ozone,
and oxygen can be achieved with observations with at least $R = 70$ / SNR$\ =
15$, or $R = 140$ / SNR$\ = 10$ for improved detections. Meaningful constraints
are only achieved with $R = 140$ / SNR$\ = 20$ data. The WFIRST data offer
limited diagnostic information, needing at least SNR = 20 to weakly detect
gases. Most scenarios place limits on planetary radius, but cannot constrain
surface gravity and, thus, planetary mass.
|
astro-ph.EP
|
spacebased high contrast imaging mission concepts for studying rocky exoplanets in reflected light are currently under community study we develop an inverse modeling framework to estimate the science return of such missions given different instrument design considerations by combining an exoplanet albedo model an instrument noise model and an ensemble markov chain monte carlo sampler we explore retrievals of atmospheric and planetary properties for earth twins as a function of signaltonoise ratio snr and resolution r our forward model includes rayleigh scattering singlelayer water clouds with patchy coverage and pressuredependent absorption due to water vapor oxygen and ozone we simulate data at r 70 and r 140 from 0410 mum with snr 5 10 15 20 at 550 nm ie for habexluvoirtype instruments at these same snr we simulate data for wfirst paired with a starshade which includes two photometric points between 04806 mum and r 50 spectroscopy from 06097 mum given our noise model for wfirsttype detectors we find that weak detections of water vapor ozone and oxygen can be achieved with observations with at least r 70 snr 15 or r 140 snr 10 for improved detections meaningful constraints are only achieved with r 140 snr 20 data the wfirst data offer limited diagnostic information needing at least snr 20 to weakly detect gases most scenarios place limits on planetary radius but cannot constrain surface gravity and thus planetary mass
|
[['spacebased', 'high', 'contrast', 'imaging', 'mission', 'concepts', 'for', 'studying', 'rocky', 'exoplanets', 'in', 'reflected', 'light', 'are', 'currently', 'under', 'community', 'study', 'we', 'develop', 'an', 'inverse', 'modeling', 'framework', 'to', 'estimate', 'the', 'science', 'return', 'of', 'such', 'missions', 'given', 'different', 'instrument', 'design', 'considerations', 'by', 'combining', 'an', 'exoplanet', 'albedo', 'model', 'an', 'instrument', 'noise', 'model', 'and', 'an', 'ensemble', 'markov', 'chain', 'monte', 'carlo', 'sampler', 'we', 'explore', 'retrievals', 'of', 'atmospheric', 'and', 'planetary', 'properties', 'for', 'earth', 'twins', 'as', 'a', 'function', 'of', 'signaltonoise', 'ratio', 'snr', 'and', 'resolution', 'r', 'our', 'forward', 'model', 'includes', 'rayleigh', 'scattering', 'singlelayer', 'water', 'clouds', 'with', 'patchy', 'coverage', 'and', 'pressuredependent', 'absorption', 'due', 'to', 'water', 'vapor', 'oxygen', 'and', 'ozone', 'we', 'simulate', 'data', 'at', 'r', '70', 'and', 'r', '140', 'from', '0410', 'mum', 'with', 'snr', '5', '10', '15', '20', 'at', '550', 'nm', 'ie', 'for', 'habexluvoirtype', 'instruments', 'at', 'these', 'same', 'snr', 'we', 'simulate', 'data', 'for', 'wfirst', 'paired', 'with', 'a', 'starshade', 'which', 'includes', 'two', 'photometric', 'points', 'between', '04806', 'mum', 'and', 'r', '50', 'spectroscopy', 'from', '06097', 'mum', 'given', 'our', 'noise', 'model', 'for', 'wfirsttype', 'detectors', 'we', 'find', 'that', 'weak', 'detections', 'of', 'water', 'vapor', 'ozone', 'and', 'oxygen', 'can', 'be', 'achieved', 'with', 'observations', 'with', 'at', 'least', 'r', '70', 'snr', '15', 'or', 'r', '140', 'snr', '10', 'for', 'improved', 'detections', 'meaningful', 'constraints', 'are', 'only', 'achieved', 'with', 'r', '140', 'snr', '20', 'data', 'the', 'wfirst', 'data', 'offer', 'limited', 'diagnostic', 'information', 'needing', 'at', 'least', 'snr', '20', 'to', 'weakly', 'detect', 'gases', 'most', 'scenarios', 'place', 'limits', 'on', 'planetary', 'radius', 'but', 'can', 'not', 'constrain', 'surface', 'gravity', 'and', 'thus', 'planetary', 'mass']]
|
[-0.06003089335771973, 0.12000567839998451, -0.012920748684392616, 0.057635181020197, -0.03648938957853934, -0.17672831774587586, 0.08890302830648214, 0.4181563429469365, -0.21203602375676164, -0.4153342599854459, 0.10718762648533867, -0.32367666112869065, -0.039177792352435126, 0.19983257698789889, -0.03935860179712402, 0.01748783657923097, 0.11239857609916527, -0.10011169306962349, -0.02458951778315398, -0.2457460234435804, 0.19551247905219973, 0.16832394927422878, 0.17547227437790955, 0.03360857021172356, 0.10245085915949147, -0.0470009264353191, -0.062054645369748494, -0.04023956332923072, -0.18277771302156876, 0.03584487641262761, 0.293035357688273, 0.15193635283757864, 0.18924766210595137, -0.37017625144656896, -0.25037905270860056, 0.0759896596285665, 0.12047601678379706, 0.01697801635651463, -0.0007539860635800654, -0.27333390282865566, 0.05433255260722309, -0.17848670501648306, -0.13968152131917824, 0.008740180808497698, -0.005474212882414005, -0.0010732357546801, -0.2990875537324225, 0.03653943609836711, -0.02863618711164164, 0.19193295884153533, -0.10444677617059264, -0.18589099340942, -0.027995998440432365, 0.04630050917286182, -0.026773121584650113, 0.02971670189801213, 0.1738936336808655, -0.10995304118028504, 0.009063729084519807, 0.3759475516980945, -0.12961623329042932, -0.059582971941321825, 0.24758880419908783, -0.20010892164539626, -0.09558719878520117, 0.2259308092802454, 0.16529403819868294, 0.09909398570315156, -0.1782663833862374, 0.017350293315416324, 0.01948070162795403, 0.243653740935174, 0.11041962229809418, 0.07719251479369926, 0.29860332455307115, 0.1689335481450775, 0.0621575659870955, 0.09378516010016887, -0.3026299880579618, 0.006863290291507301, -0.19347965267718684, -0.13158354359805, -0.16429327274967537, 0.05176621267789879, -0.1623624351874424, -0.08753622709122776, 0.2839151581212488, 0.19608680817324914, 0.14048404880701748, 0.05914550616586882, 0.31534174327051273, 0.03597439192367644, 0.04894881006930121, 0.059546106734910904, 0.2832238132146281, 0.10682266972339854, 0.10806858006104274, -0.14891802740278734, 0.04303755859059473, -0.04264607078265643]
|
1,803.06404
|
Helical Network Model for Twisted Bilayer Graphene
|
In the presence of a finite interlayer displacement field bilayer graphene
has an energy gap that is dependent on stacking and largest for the stable AB
and BA stacking arrangements. When the relative orientations between layers are
twisted through a small angle to form a moir$\mathrm{\acute{e}}$ pattern, the
local stacking arrangement changes slowly. We show that for non-zero
displacement fields the low-energy physics of twisted bilayers is captured by a
phenomenological helical network model that describes electrons localized on
domain walls separating regions with approximate AB and BA stacking. The
network band structure is gapless and has of a series of two-dimensional bands
with Dirac band-touching points and a density-of-states that is periodic in
energy with one zero and one divergence per period.
|
cond-mat.mes-hall
|
in the presence of a finite interlayer displacement field bilayer graphene has an energy gap that is dependent on stacking and largest for the stable ab and ba stacking arrangements when the relative orientations between layers are twisted through a small angle to form a moirmathrmacutee pattern the local stacking arrangement changes slowly we show that for nonzero displacement fields the lowenergy physics of twisted bilayers is captured by a phenomenological helical network model that describes electrons localized on domain walls separating regions with approximate ab and ba stacking the network band structure is gapless and has of a series of twodimensional bands with dirac bandtouching points and a densityofstates that is periodic in energy with one zero and one divergence per period
|
[['in', 'the', 'presence', 'of', 'a', 'finite', 'interlayer', 'displacement', 'field', 'bilayer', 'graphene', 'has', 'an', 'energy', 'gap', 'that', 'is', 'dependent', 'on', 'stacking', 'and', 'largest', 'for', 'the', 'stable', 'ab', 'and', 'ba', 'stacking', 'arrangements', 'when', 'the', 'relative', 'orientations', 'between', 'layers', 'are', 'twisted', 'through', 'a', 'small', 'angle', 'to', 'form', 'a', 'moirmathrmacutee', 'pattern', 'the', 'local', 'stacking', 'arrangement', 'changes', 'slowly', 'we', 'show', 'that', 'for', 'nonzero', 'displacement', 'fields', 'the', 'lowenergy', 'physics', 'of', 'twisted', 'bilayers', 'is', 'captured', 'by', 'a', 'phenomenological', 'helical', 'network', 'model', 'that', 'describes', 'electrons', 'localized', 'on', 'domain', 'walls', 'separating', 'regions', 'with', 'approximate', 'ab', 'and', 'ba', 'stacking', 'the', 'network', 'band', 'structure', 'is', 'gapless', 'and', 'has', 'of', 'a', 'series', 'of', 'twodimensional', 'bands', 'with', 'dirac', 'bandtouching', 'points', 'and', 'a', 'densityofstates', 'that', 'is', 'periodic', 'in', 'energy', 'with', 'one', 'zero', 'and', 'one', 'divergence', 'per', 'period']]
|
[-0.2214366361483565, 0.17232641267514365, -0.03716451447212794, 0.0023364880500117043, -0.019477173304337948, -0.133690572588048, 0.05589801413923136, 0.42442191902120585, -0.3066715838952509, -0.2665792006663367, -0.00660540780518204, -0.30522009174599024, -0.13810557186542477, 0.11859024695281062, 0.03250197134148635, -0.030557532539399395, 0.036188372485263305, -0.028530132594197743, -0.10115005319449501, -0.18442980177532575, 0.323590262518188, 0.011136718594362258, 0.3011106071711258, 0.025725488249426248, 0.028322454198400994, 0.03246327165941723, 0.08693781506425709, 0.05595772494905491, -0.12758347287236857, 0.09914839937554178, 0.18008186895644568, -0.10037080094706817, 0.19718388960979208, -0.43619263868351454, -0.19129304923727863, 0.02618483095200824, 0.14908051047069554, 0.10042719900050796, -0.028243989388832488, -0.24260641448963127, 0.11350227109171816, -0.10624909324792871, -0.12004423163999177, -0.050099910188229665, 0.0443609170892398, 0.030766104912904442, -0.2584453565626764, 0.1076413333858745, 0.012767467208191862, 0.10691504205432033, -0.09290274138634902, -0.11031299015339159, -0.12097727902019854, 0.08459756029345149, 0.044997511937074956, 0.06203627233683574, 0.1360756426125948, -0.12162508265130588, -0.09442829211876101, 0.3589436224906049, -0.0577836465281358, -0.17998846179278966, 0.16419519460760057, -0.155079842915331, -0.08295029737284315, 0.17496474765119005, 0.08982544210663096, 0.08194624830693861, -0.08838815292113052, 0.10679701623816013, -0.058171867873886084, 0.1901118832384618, 0.08564360618026408, 0.0033145972344352575, 0.2860423954600682, 0.16144555390117782, 0.10595537666574914, 0.1256776305915574, -0.17292477335059467, -0.05500286128410123, -0.2576423424799911, -0.15786906192842565, -0.23559006406605, 0.02700388391853356, -0.07766124754538187, -0.25344046240397655, 0.4556803444885176, 0.05910984002298019, 0.20689994649633336, -0.03949741535957475, 0.24660646305877532, 0.10283353552222252, 0.08929713392121141, 0.035536713806576414, 0.23657422652849774, 0.13544934504230308, 0.06105381324810938, -0.19841734816121762, 0.007823705932766687, 0.04683183487810073]
|
1,803.06405
|
Control of interlayer excitons in two-dimensional van der Waals
heterostructures
|
Long-lived interlayer excitons with distinct spin-valley physics in van der
Waals heterostructures based on transition metal dichalcogenides make them
promising for information processing in next-generation devices. While the
emission characteristics of interlayer excitons in different types of hetero
stacks have been extensively studied, the manipulation of these excitons
required to alter the valley-state or tune the emission energy and intensity is
still lacking. Here, we demonstrate such control over interlayer excitons in
MoSe2/WSe2 heterostructures. The encapsulation of our stack with h-BN ensures
ultraclean interfaces, allowing us to resolve four separate narrow interlayer
emission peaks. We observe two main interlayer transitions with opposite
helicities under circularly polarized excitation, either conserving or
inverting the polarization of incoming light. We further demonstrate control
over the wavelength, intensity, and polarization of exciton emission by
electrical and magnetic fields. Such ability to manipulate the interlayer
excitons and their polarization could pave the way for novel excitonic and
valleytronic device applications.
|
cond-mat.mes-hall
|
longlived interlayer excitons with distinct spinvalley physics in van der waals heterostructures based on transition metal dichalcogenides make them promising for information processing in nextgeneration devices while the emission characteristics of interlayer excitons in different types of hetero stacks have been extensively studied the manipulation of these excitons required to alter the valleystate or tune the emission energy and intensity is still lacking here we demonstrate such control over interlayer excitons in mose2wse2 heterostructures the encapsulation of our stack with hbn ensures ultraclean interfaces allowing us to resolve four separate narrow interlayer emission peaks we observe two main interlayer transitions with opposite helicities under circularly polarized excitation either conserving or inverting the polarization of incoming light we further demonstrate control over the wavelength intensity and polarization of exciton emission by electrical and magnetic fields such ability to manipulate the interlayer excitons and their polarization could pave the way for novel excitonic and valleytronic device applications
|
[['longlived', 'interlayer', 'excitons', 'with', 'distinct', 'spinvalley', 'physics', 'in', 'van', 'der', 'waals', 'heterostructures', 'based', 'on', 'transition', 'metal', 'dichalcogenides', 'make', 'them', 'promising', 'for', 'information', 'processing', 'in', 'nextgeneration', 'devices', 'while', 'the', 'emission', 'characteristics', 'of', 'interlayer', 'excitons', 'in', 'different', 'types', 'of', 'hetero', 'stacks', 'have', 'been', 'extensively', 'studied', 'the', 'manipulation', 'of', 'these', 'excitons', 'required', 'to', 'alter', 'the', 'valleystate', 'or', 'tune', 'the', 'emission', 'energy', 'and', 'intensity', 'is', 'still', 'lacking', 'here', 'we', 'demonstrate', 'such', 'control', 'over', 'interlayer', 'excitons', 'in', 'mose2wse2', 'heterostructures', 'the', 'encapsulation', 'of', 'our', 'stack', 'with', 'hbn', 'ensures', 'ultraclean', 'interfaces', 'allowing', 'us', 'to', 'resolve', 'four', 'separate', 'narrow', 'interlayer', 'emission', 'peaks', 'we', 'observe', 'two', 'main', 'interlayer', 'transitions', 'with', 'opposite', 'helicities', 'under', 'circularly', 'polarized', 'excitation', 'either', 'conserving', 'or', 'inverting', 'the', 'polarization', 'of', 'incoming', 'light', 'we', 'further', 'demonstrate', 'control', 'over', 'the', 'wavelength', 'intensity', 'and', 'polarization', 'of', 'exciton', 'emission', 'by', 'electrical', 'and', 'magnetic', 'fields', 'such', 'ability', 'to', 'manipulate', 'the', 'interlayer', 'excitons', 'and', 'their', 'polarization', 'could', 'pave', 'the', 'way', 'for', 'novel', 'excitonic', 'and', 'valleytronic', 'device', 'applications']]
|
[-0.15232365206186357, 0.16512563880895834, 0.002889127540099737, 0.028744405663538992, -0.055760612941117255, -0.2089369078408685, 0.06705910430815942, 0.5096279419535263, -0.2864878210904343, -0.3148895623767144, -0.08679402361143163, -0.28736603053818854, -0.12031385793302257, 0.21088590754450046, 0.07176278243385642, 0.02401493851083343, -0.03775420351265386, -0.19156097371566605, -0.01782937774997108, -0.1826920333203509, 0.27936902801300606, -0.01682980867199503, 0.3621799909515766, 0.16066978855002612, 0.048811865779994565, 0.029481745477729512, 0.08033026501482697, -0.05189100380793407, -0.13193863313403223, 0.11658597149313185, 0.2767914111707843, -0.11700402162122456, 0.21143900873986157, -0.4905188468877565, -0.19351976776084343, 0.038960678114362254, 0.1861995175154275, 0.19317245765667795, -0.09293264963788089, -0.3056538527432297, 0.03191104114007253, -0.12536166756196165, -0.055850219179467184, -0.10609884676523507, 0.0019820031026595987, 0.0692419819681234, -0.20838720076294107, 0.04528829669458913, 0.008150616443758323, 0.047096582946016805, -0.08842544093723907, -0.09940692582209262, -0.09257730071330081, 0.09218625047594889, 0.007886664789206311, -0.019628068144764303, 0.22066822899928826, -0.14187413630454054, -0.1498484324373595, 0.3600773717361418, -0.060989053540427676, -0.06632293185654592, 0.19564225379522746, -0.16328149062865596, -0.0355153559025244, 0.1547753055558794, 0.1270015183685033, 0.12024619765640177, -0.11470757205607732, 0.029454737452279122, 0.0525877254186561, 0.19299996065508043, 0.12973036697132864, 0.2086223669338052, 0.32653943927922324, 0.1689626478541691, 0.052506867047798424, 0.12759236764320014, -0.12332254298225608, -0.02896691691553728, -0.16714977405288003, -0.2103597965278941, -0.19162848930467258, 0.12272884840351324, -0.02118612649234831, -0.18007404550716474, 0.4559801065532321, 0.16750777956376506, 0.1478202349019491, -0.06180405144446662, 0.3020383072669267, 0.06758306945247769, 0.11240820627048757, -0.02216063310126109, 0.31264868648359917, 0.1686766144559513, 0.12090517476793718, -0.2608700801690968, 0.05850984832701309, -0.061209930289935856]
|
1,803.06406
|
Self-Calibration of Mobile Manipulator Kinematic and Sensor Extrinsic
Parameters Through Contact-Based Interaction
|
We present a novel approach for mobile manipulator self-calibration using
contact information. Our method, based on point cloud registration, is applied
to estimate the extrinsic transform between a fixed vision sensor mounted on a
mobile base and an end effector. Beyond sensor calibration, we demonstrate that
the method can be extended to include manipulator kinematic model parameters,
which involves a non-rigid registration process. Our procedure uses on-board
sensing exclusively and does not rely on any external measurement devices,
fiducial markers, or calibration rigs. Further, it is fully automatic in the
general case. We experimentally validate the proposed method on a custom mobile
manipulator platform, and demonstrate centimetre-level post-calibration
accuracy in positioning of the end effector using visual guidance only. We also
discuss the stability properties of the registration algorithm, in order to
determine the conditions under which calibration is possible.
|
cs.RO
|
we present a novel approach for mobile manipulator selfcalibration using contact information our method based on point cloud registration is applied to estimate the extrinsic transform between a fixed vision sensor mounted on a mobile base and an end effector beyond sensor calibration we demonstrate that the method can be extended to include manipulator kinematic model parameters which involves a nonrigid registration process our procedure uses onboard sensing exclusively and does not rely on any external measurement devices fiducial markers or calibration rigs further it is fully automatic in the general case we experimentally validate the proposed method on a custom mobile manipulator platform and demonstrate centimetrelevel postcalibration accuracy in positioning of the end effector using visual guidance only we also discuss the stability properties of the registration algorithm in order to determine the conditions under which calibration is possible
|
[['we', 'present', 'a', 'novel', 'approach', 'for', 'mobile', 'manipulator', 'selfcalibration', 'using', 'contact', 'information', 'our', 'method', 'based', 'on', 'point', 'cloud', 'registration', 'is', 'applied', 'to', 'estimate', 'the', 'extrinsic', 'transform', 'between', 'a', 'fixed', 'vision', 'sensor', 'mounted', 'on', 'a', 'mobile', 'base', 'and', 'an', 'end', 'effector', 'beyond', 'sensor', 'calibration', 'we', 'demonstrate', 'that', 'the', 'method', 'can', 'be', 'extended', 'to', 'include', 'manipulator', 'kinematic', 'model', 'parameters', 'which', 'involves', 'a', 'nonrigid', 'registration', 'process', 'our', 'procedure', 'uses', 'onboard', 'sensing', 'exclusively', 'and', 'does', 'not', 'rely', 'on', 'any', 'external', 'measurement', 'devices', 'fiducial', 'markers', 'or', 'calibration', 'rigs', 'further', 'it', 'is', 'fully', 'automatic', 'in', 'the', 'general', 'case', 'we', 'experimentally', 'validate', 'the', 'proposed', 'method', 'on', 'a', 'custom', 'mobile', 'manipulator', 'platform', 'and', 'demonstrate', 'centimetrelevel', 'postcalibration', 'accuracy', 'in', 'positioning', 'of', 'the', 'end', 'effector', 'using', 'visual', 'guidance', 'only', 'we', 'also', 'discuss', 'the', 'stability', 'properties', 'of', 'the', 'registration', 'algorithm', 'in', 'order', 'to', 'determine', 'the', 'conditions', 'under', 'which', 'calibration', 'is', 'possible']]
|
[-0.09618803783585983, -0.014105380701429178, -0.10122704976570926, -0.018967534736748348, -0.1177810021410031, -0.1942926746959399, 0.05851585685907464, 0.46359760319547993, -0.21839523161974544, -0.3482655756175518, 0.10955417595022092, -0.20932725274137087, -0.20971479949117305, 0.2261129741789773, -0.16137808567312148, 0.08769473501015454, 0.11431138993773077, 0.0331989502068609, -0.04585257392651069, -0.19300818358814079, 0.2484130196406373, 0.047340643552265, 0.33154384076728355, 0.03932811648576587, 0.1707914437832577, 0.060153123753012294, -0.03253638712423188, -0.014940524999318378, -0.0983978624275291, 0.11600756816499468, 0.22930894972689983, 0.12675078936985562, 0.24138308464150343, -0.4177105089183897, -0.18487640651209014, 0.07381430757076098, 0.1351959217206708, 0.0850964280044926, -0.06614471012726426, -0.32914347939825217, 0.09571257265051827, -0.16523997773017202, -0.10656581475621871, -0.10320535881910473, -0.06455913534321422, 0.0066017608603163224, -0.30252348686002994, -0.005411307023314294, -0.01599545446889741, 0.08242692736509655, -0.09484440963351518, -0.045827297639334574, 0.02231358028532538, 0.18666295992110724, -0.050390289870015946, 0.013647943707681926, 0.22497431420987204, -0.10878638021780976, -0.09765799626974123, 0.3750134985311888, -0.007268939402586381, -0.2641885418245303, 0.18248750491599952, -0.054266462518301396, -0.13708016379470273, 0.08625784506356078, 0.2200003159398745, 0.1558256909550567, -0.21029688555614223, 0.03532878776355314, 0.02706445669090109, 0.20519792987137667, 0.02180446766932229, -0.05687371362291742, 0.176052943029416, 0.23881383283462906, 0.12009873361592846, 0.11692363115476577, -0.197060821411599, -0.04524744549541668, -0.298174562764221, -0.15405426093160973, -0.18864441283512862, -0.02490520144087246, -0.07732266276444924, -0.13563008747462715, 0.34694597019614387, 0.248245099892977, 0.16346614302601664, 0.03973530810492645, 0.40799286655882105, 0.033662457340064324, 0.10520014415295528, 0.04083552834511336, 0.24817232566087374, 0.02569034656376711, 0.10517684410525752, -0.21193640420096926, 0.0710534189428602, 0.07342257863908475]
|
1,803.06407
|
Deep Component Analysis via Alternating Direction Neural Networks
|
Despite a lack of theoretical understanding, deep neural networks have
achieved unparalleled performance in a wide range of applications. On the other
hand, shallow representation learning with component analysis is associated
with rich intuition and theory, but smaller capacity often limits its
usefulness. To bridge this gap, we introduce Deep Component Analysis (DeepCA),
an expressive multilayer model formulation that enforces hierarchical structure
through constraints on latent variables in each layer. For inference, we
propose a differentiable optimization algorithm implemented using recurrent
Alternating Direction Neural Networks (ADNNs) that enable parameter learning
using standard backpropagation. By interpreting feed-forward networks as
single-iteration approximations of inference in our model, we provide both a
novel theoretical perspective for understanding them and a practical technique
for constraining predictions with prior knowledge. Experimentally, we
demonstrate performance improvements on a variety of tasks, including
single-image depth prediction with sparse output constraints.
|
cs.LG cs.CV stat.ML
|
despite a lack of theoretical understanding deep neural networks have achieved unparalleled performance in a wide range of applications on the other hand shallow representation learning with component analysis is associated with rich intuition and theory but smaller capacity often limits its usefulness to bridge this gap we introduce deep component analysis deepca an expressive multilayer model formulation that enforces hierarchical structure through constraints on latent variables in each layer for inference we propose a differentiable optimization algorithm implemented using recurrent alternating direction neural networks adnns that enable parameter learning using standard backpropagation by interpreting feedforward networks as singleiteration approximations of inference in our model we provide both a novel theoretical perspective for understanding them and a practical technique for constraining predictions with prior knowledge experimentally we demonstrate performance improvements on a variety of tasks including singleimage depth prediction with sparse output constraints
|
[['despite', 'a', 'lack', 'of', 'theoretical', 'understanding', 'deep', 'neural', 'networks', 'have', 'achieved', 'unparalleled', 'performance', 'in', 'a', 'wide', 'range', 'of', 'applications', 'on', 'the', 'other', 'hand', 'shallow', 'representation', 'learning', 'with', 'component', 'analysis', 'is', 'associated', 'with', 'rich', 'intuition', 'and', 'theory', 'but', 'smaller', 'capacity', 'often', 'limits', 'its', 'usefulness', 'to', 'bridge', 'this', 'gap', 'we', 'introduce', 'deep', 'component', 'analysis', 'deepca', 'an', 'expressive', 'multilayer', 'model', 'formulation', 'that', 'enforces', 'hierarchical', 'structure', 'through', 'constraints', 'on', 'latent', 'variables', 'in', 'each', 'layer', 'for', 'inference', 'we', 'propose', 'a', 'differentiable', 'optimization', 'algorithm', 'implemented', 'using', 'recurrent', 'alternating', 'direction', 'neural', 'networks', 'adnns', 'that', 'enable', 'parameter', 'learning', 'using', 'standard', 'backpropagation', 'by', 'interpreting', 'feedforward', 'networks', 'as', 'singleiteration', 'approximations', 'of', 'inference', 'in', 'our', 'model', 'we', 'provide', 'both', 'a', 'novel', 'theoretical', 'perspective', 'for', 'understanding', 'them', 'and', 'a', 'practical', 'technique', 'for', 'constraining', 'predictions', 'with', 'prior', 'knowledge', 'experimentally', 'we', 'demonstrate', 'performance', 'improvements', 'on', 'a', 'variety', 'of', 'tasks', 'including', 'singleimage', 'depth', 'prediction', 'with', 'sparse', 'output', 'constraints']]
|
[-0.050519336199587477, -0.035148119332630554, -0.06841491383467135, 0.055972090203847205, -0.16667188121937215, -0.18805602351536177, 0.06932676803304015, 0.47593382853748545, -0.29820813845976124, -0.33909777288458176, 0.07057782593432681, -0.20817999773342827, -0.24086318172921892, 0.21746657677992645, -0.07285557007749698, 0.0964279082865687, 0.15506858245602675, -0.00022229139306416203, -0.10500281293789157, -0.21679360042409307, 0.257825619724047, 0.052662059418175235, 0.3485401614120097, 0.02390970544490431, 0.1438275123647015, 0.0015271244271259222, -0.006400050814928753, 0.003030456575964178, -0.07814042897048888, 0.22282135955590224, 0.2905690099478566, 0.19207280427716406, 0.34219965418035697, -0.44422879632828494, -0.32366746903696497, 0.07562402782205027, 0.14445005951316228, 0.07326309447609154, -0.05365824626143356, -0.2952008636269186, 0.07696128774633897, -0.18225610741480652, -0.014311829280839967, -0.19029382816515863, -0.05306917799337368, -0.008216708126877035, -0.28002224194892084, 0.02918797175682682, 0.0944845936710148, 0.08592886184342205, -0.04577249793718303, -0.14351885971014522, 0.05132870492691707, 0.10645745168440043, 0.004525247844867408, 0.04293999329924451, 0.12730695880018175, -0.21630661510696103, -0.1578763126902881, 0.3090802302184914, -0.09750256203364448, -0.21802164279589695, 0.19442880436545237, -0.008986821015631514, -0.19755191825928964, 0.0778877885280443, 0.25353818403610995, 0.09174334477699761, -0.14879745090771135, 0.05589211983689373, -0.03881703898244138, 0.19503229285889703, -0.014560606639965305, 0.029054638224520854, 0.2131122615770437, 0.32907215699420445, 0.038705779470702896, 0.12684555908573591, -0.11240303023576936, -0.12592193518149933, -0.20756583511164145, -0.08054806605338984, -0.1588399857798192, -0.017636057783550183, -0.13622926833486418, -0.15187366789073817, 0.3951439701685948, 0.2142396833281964, 0.23300136164429464, 0.15397536887321622, 0.36403993341539587, 0.07237891130748071, 0.10000444705531533, 0.08538045760443701, 0.21002082698313254, 0.12795831865098858, 0.10640595561957784, -0.12936949161396893, 0.11944958616347451, 0.035575053341952816]
|
1,803.06408
|
Three \'Etudes on a sequence transformation pipeline
|
We study a sequence transformation pipeline that maps certain sequences with
rational generating functions to permutation-based sequence families of
combinatorial significance. Many of the number triangles we encounter can be
related to simplicial objects such as the associahedron and the permutahedron.
The linkages between these objects is facilitated by the use of the previously
introduced $\mathcal{T}$ transform.
|
math.CO
|
we study a sequence transformation pipeline that maps certain sequences with rational generating functions to permutationbased sequence families of combinatorial significance many of the number triangles we encounter can be related to simplicial objects such as the associahedron and the permutahedron the linkages between these objects is facilitated by the use of the previously introduced mathcalt transform
|
[['we', 'study', 'a', 'sequence', 'transformation', 'pipeline', 'that', 'maps', 'certain', 'sequences', 'with', 'rational', 'generating', 'functions', 'to', 'permutationbased', 'sequence', 'families', 'of', 'combinatorial', 'significance', 'many', 'of', 'the', 'number', 'triangles', 'we', 'encounter', 'can', 'be', 'related', 'to', 'simplicial', 'objects', 'such', 'as', 'the', 'associahedron', 'and', 'the', 'permutahedron', 'the', 'linkages', 'between', 'these', 'objects', 'is', 'facilitated', 'by', 'the', 'use', 'of', 'the', 'previously', 'introduced', 'mathcalt', 'transform']]
|
[-0.12547870643391976, 0.08006585510284231, -0.07993708920191255, 0.09950501204819598, -0.11471539366532836, -0.06867709996080712, 0.026192044287821965, 0.38174513590178993, -0.3840349771474537, -0.31980598260436144, 0.10018751927929227, -0.26771555180873785, -0.2580296197219899, 0.18462074528399267, -0.1444166102119836, 0.05762535267052028, 0.0705870156944321, -0.006578756038818443, -0.025824926105167578, -0.26834062912721973, 0.3839952623177516, -0.008983818520056574, 0.18159702371217704, -0.046004333729414565, 0.10416628446495324, 0.0067698752768991285, -0.034146531909834923, 0.022856825178391056, -0.13390384168885425, 0.1662804356106279, 0.23355968178887115, 0.1966387923365753, 0.18028974508572565, -0.3729315006353876, -0.14163782969607333, 0.20191518277779483, 0.13986973217770196, 0.07145075475502956, -0.03807973459755119, -0.27814114673814755, 0.08326947060822133, -0.12220592697543141, -0.10149264753093584, -0.09166174756134288, 0.0349483037645226, 0.07899981615819822, -0.22887973227587186, -0.02297537381284137, 0.08411043393629881, 0.09335083194207727, -0.006103723473324065, -0.12274059021780104, -0.05027551712108809, 0.16238684224969657, 0.013809327113752564, 0.056955955877671376, 0.08497880627564564, -0.1045819600521211, -0.14842962909882007, 0.3764514749412212, 0.032243919477128145, -0.24670588863980875, 0.19469596811553888, -0.1284193138902386, -0.2059670029404132, 0.13676383316909013, 0.09304589634401757, 0.14631408124573922, -0.12538708382073724, 0.06685973635135349, -0.0877774220548178, 0.08359928931959235, 0.17171696852892637, 0.025712222130478996, 0.22016228598199392, 0.088925426825881, 0.04767909473759988, 0.21874662947620413, -0.050866810735641865, -0.06783894328563883, -0.2757956178556605, -0.1526872990489529, -0.1795919831972896, 0.029417933618421096, -0.14087034560093584, -0.19401504156555524, 0.3786769241682793, 0.11068825228466538, 0.23305409209059322, 0.1219214410602785, 0.20111599553523488, 0.07268354910009198, 0.10093113410147724, -0.0189793934931227, 0.07968366222063962, 0.14853266476686194, -0.015131387859582901, -0.11531812811205, 0.04867294408164494, 0.2009208208244098]
|
1,803.06409
|
Integral comparisons of nonnegative positive definite functions on LCA
groups
|
In this paper we investigate the following questions. Let $\mu, \nu$ be two
regular Borel measures of finite total variation. When do we have a constant
$C$ satisfying $$\int f d\nu \le C \int f d\mu$$ whenever $f$ is a continuous
nonnegative positive definite function? How the admissible constants $C$ can be
characterized, and what is their optimal value? We first discuss the problem in
locally compact abelian groups. Then we make further specializations when the
Borel measures $\mu, \nu$ are both either purely atomic or absolutely
continuous with respect to a reference Haar measure. In addition, we prove a
duality conjecture posed in our former paper.
|
math.FA math.CA
|
in this paper we investigate the following questions let mu nu be two regular borel measures of finite total variation when do we have a constant c satisfying int f dnu le c int f dmu whenever f is a continuous nonnegative positive definite function how the admissible constants c can be characterized and what is their optimal value we first discuss the problem in locally compact abelian groups then we make further specializations when the borel measures mu nu are both either purely atomic or absolutely continuous with respect to a reference haar measure in addition we prove a duality conjecture posed in our former paper
|
[['in', 'this', 'paper', 'we', 'investigate', 'the', 'following', 'questions', 'let', 'mu', 'nu', 'be', 'two', 'regular', 'borel', 'measures', 'of', 'finite', 'total', 'variation', 'when', 'do', 'we', 'have', 'a', 'constant', 'c', 'satisfying', 'int', 'f', 'dnu', 'le', 'c', 'int', 'f', 'dmu', 'whenever', 'f', 'is', 'a', 'continuous', 'nonnegative', 'positive', 'definite', 'function', 'how', 'the', 'admissible', 'constants', 'c', 'can', 'be', 'characterized', 'and', 'what', 'is', 'their', 'optimal', 'value', 'we', 'first', 'discuss', 'the', 'problem', 'in', 'locally', 'compact', 'abelian', 'groups', 'then', 'we', 'make', 'further', 'specializations', 'when', 'the', 'borel', 'measures', 'mu', 'nu', 'are', 'both', 'either', 'purely', 'atomic', 'or', 'absolutely', 'continuous', 'with', 'respect', 'to', 'a', 'reference', 'haar', 'measure', 'in', 'addition', 'we', 'prove', 'a', 'duality', 'conjecture', 'posed', 'in', 'our', 'former', 'paper']]
|
[-0.1541432362206489, 0.16338112280120917, -0.08271760918704846, 0.05682563309222634, -0.08034166140116264, -0.17498102350264927, 0.05894496386748887, 0.3985560429151927, -0.32273358484364556, -0.1671274555482571, 0.08328172282716172, -0.2807525734473716, -0.10622069401727449, 0.13628025847230385, -0.11454823880378052, 0.05234474152387512, 0.0025941513013094664, 0.08058007364378911, -0.09998825905087326, -0.2586261896921374, 0.3653779975182124, -0.06612614890403837, 0.2030274859394565, 0.07789838614777844, 0.06332957827503506, -0.03146183738380531, -0.05675877195077939, 0.02082457160794777, -0.22684039972574563, 0.06799570452443664, 0.2629746161183673, 0.143351557009601, 0.31096976586382524, -0.30303171642612076, -0.11069807218100493, 0.2800579848568712, 0.09023114011696949, -0.07159260868434315, 0.015950304797685173, -0.2689981823047258, 0.15430355114562036, -0.13344750169742958, -0.13902074684362822, -0.08153564717063558, 0.12882768955064294, 0.042334094547849394, -0.32837122501631344, 0.040477016714410244, 0.08477281571026439, 0.07361239617011536, -0.08118899959513795, -0.1269480907749907, -0.013502797729849258, 0.06971295212371553, 0.012287002844544493, 0.15022640868642795, 0.08378647552002395, -0.030650199706465982, -0.09982383667238962, 0.3633222234235189, -0.1442163458581422, -0.32095243235197024, 0.14666733707118534, -0.2204314577871951, -0.1656272492619562, 0.04247518306789554, 0.10613272082719899, 0.15045291393403418, -0.08171842853613763, 0.23061553686889863, -0.09429807715535721, 0.1308022636189082, 0.10004380324019868, 0.013898357522682609, 0.1425614669357609, 0.020939367805894848, 0.12032707340560557, 0.12731270595001073, 0.022548648167540816, 0.009610566528183278, -0.3559972479173513, -0.1824045838770744, -0.16205580383713278, 0.15764178329138695, -0.04891729845312341, -0.15316578884452373, 0.3098294320733887, 0.06757095448724995, 0.19206278346409308, 0.13434802285160555, 0.2021549322477011, 0.15456817032242734, -0.04709425783568175, 0.07998105482346266, 0.11117980415958946, 0.13168334889565117, 0.010819821244227552, -0.1709080561864947, 0.016657677772846595, 0.0886990270429404]
|
1,803.0641
|
Accurate evaluation of size and refractive index for spherical objects
in quantitative phase imaging
|
Measuring the average refractive index (RI) of spherical objects, such as
suspended cells, in quantitative phase imaging (QPI) requires a decoupling of
RI and size from the QPI data. This has been commonly achieved by determining
the object's radius with geometrical approaches, neglecting light-scattering.
Here, we present a novel QPI fitting algorithm that reliably uncouples the RI
using Mie theory and a semi-analytical, corrected Rytov approach. We assess the
range of validity of this algorithm in silico and experimentally investigate
various objects (oil and protein droplets, microgel beads, cells) and noise
conditions. In addition, we provide important practical cues for future studies
in cell biology.
|
q-bio.QM physics.bio-ph
|
measuring the average refractive index ri of spherical objects such as suspended cells in quantitative phase imaging qpi requires a decoupling of ri and size from the qpi data this has been commonly achieved by determining the objects radius with geometrical approaches neglecting lightscattering here we present a novel qpi fitting algorithm that reliably uncouples the ri using mie theory and a semianalytical corrected rytov approach we assess the range of validity of this algorithm in silico and experimentally investigate various objects oil and protein droplets microgel beads cells and noise conditions in addition we provide important practical cues for future studies in cell biology
|
[['measuring', 'the', 'average', 'refractive', 'index', 'ri', 'of', 'spherical', 'objects', 'such', 'as', 'suspended', 'cells', 'in', 'quantitative', 'phase', 'imaging', 'qpi', 'requires', 'a', 'decoupling', 'of', 'ri', 'and', 'size', 'from', 'the', 'qpi', 'data', 'this', 'has', 'been', 'commonly', 'achieved', 'by', 'determining', 'the', 'objects', 'radius', 'with', 'geometrical', 'approaches', 'neglecting', 'lightscattering', 'here', 'we', 'present', 'a', 'novel', 'qpi', 'fitting', 'algorithm', 'that', 'reliably', 'uncouples', 'the', 'ri', 'using', 'mie', 'theory', 'and', 'a', 'semianalytical', 'corrected', 'rytov', 'approach', 'we', 'assess', 'the', 'range', 'of', 'validity', 'of', 'this', 'algorithm', 'in', 'silico', 'and', 'experimentally', 'investigate', 'various', 'objects', 'oil', 'and', 'protein', 'droplets', 'microgel', 'beads', 'cells', 'and', 'noise', 'conditions', 'in', 'addition', 'we', 'provide', 'important', 'practical', 'cues', 'for', 'future', 'studies', 'in', 'cell', 'biology']]
|
[-0.040774052245320665, 0.10767400891387037, -0.11415881850712356, 0.07675516473883319, -0.005708691355816665, -0.11278243839208568, 0.04180189093597056, 0.42302703932814656, -0.22172681146434375, -0.3092994391785136, 0.03089152331508341, -0.2319579221219534, -0.23709559735975094, 0.16755363738519094, -0.1259564561907956, 0.09262458337914375, 0.03262670436521321, -0.0687974673604393, -0.0006640966515988111, -0.14862483923234754, 0.23271906455269173, 0.05024501606822014, 0.298043096752926, 0.046910660350251765, 0.09395765127902407, 0.03749089714228397, -0.03930489682104616, 0.07800785333716444, -0.21620099711283167, 0.1265580660530499, 0.2769665974303193, 0.09771732065072726, 0.2161353280856496, -0.45010019239215626, -0.24529071669316008, 0.08578197302385455, 0.18222781154049916, 0.1347682972227977, -0.10916936128355917, -0.256156708985301, 0.0786705942220232, -0.1395844187410105, -0.14142798354317035, -0.10292539401423363, 0.02318347862788609, 0.01901204108837105, -0.2542159276171809, 0.11347471364729461, -0.014428138830477283, 0.13703191950473756, -0.08742234663195199, -0.12647431712331517, 0.03302846083229053, 0.1430802108409504, -0.01122022077796005, -0.035869846107172115, 0.20924741385859394, -0.14147949331839169, -0.07167688325668374, 0.39329574646516924, -0.007005532740627781, -0.17112029557604166, 0.1699631312507249, -0.14021824026657712, -0.06923227249422953, 0.12738511628426966, 0.17037918722656156, 0.12901671899571304, -0.15840978667339575, 0.047381560701233824, -0.044400753846968566, 0.20461360023667416, 0.1337736820181211, 0.0355615246464454, 0.1964418108619395, 0.2316920770820053, -0.03792621222812505, 0.10987049269356898, -0.18758947368977325, -0.005014270983104195, -0.20583935776237575, -0.16808274971942108, -0.1706879914605192, -0.02426102061622909, -0.1424957488080032, -0.15690192015220722, 0.3676884375202159, 0.16935071213436978, 0.14943441158781448, 0.006047139052922527, 0.3529908727233609, 0.03564648479555867, 0.05923202337608451, -0.03327174529521948, 0.2584330490125077, 0.13023019340998004, 0.1182244844302269, -0.2486602098703207, 0.04120153686076048, 0.05163390331768564]
|
1,803.06411
|
The 21 reducible polars of Klein's quartic
|
We describe the singularities and related properties of the arrangement of 21
reducible polars of Klein's quartic, containing Klein's well-known arrangement
of $21$ lines.
|
math.AG math.AC math.CO
|
we describe the singularities and related properties of the arrangement of 21 reducible polars of kleins quartic containing kleins wellknown arrangement of 21 lines
|
[['we', 'describe', 'the', 'singularities', 'and', 'related', 'properties', 'of', 'the', 'arrangement', 'of', '21', 'reducible', 'polars', 'of', 'kleins', 'quartic', 'containing', 'kleins', 'wellknown', 'arrangement', 'of', '21', 'lines']]
|
[-0.23563008848577738, 0.030205147767749924, 0.008961129700765014, 0.04077002099559953, -0.13889348290589018, -0.13760364055633545, -0.041620663832873106, 0.26287522273681435, -0.24483306628341475, -0.23168937970573703, 0.09070603207995494, -0.3219538911556204, -0.21447218231332954, 0.12911425158381462, -0.09123793547041714, -0.05649082805030048, -0.04190684897669902, 0.005153873780121406, -0.12332101208933939, -0.34766581654548645, 0.3786638200593491, -0.069150462319764, 0.1823797915906956, 0.03021151393962403, 0.10314659463862579, 0.07741242682095617, -0.05734106457869833, 0.017618653364479542, -0.10499681594471137, 0.12946835936357579, 0.2212917904059092, 0.10792396151615928, -0.0006417447002604604, -0.30250970150033635, -0.0992606808237421, 0.1171220209216699, 0.13127524591982365, 0.021724274692436058, 0.042257614084519446, -0.21765886817593127, -0.0031486093842734895, -0.05405917117604986, -0.36326145225514966, -0.0005555835862954458, -0.016193292879809935, 0.09173715929500759, -0.0920995941075186, 0.045507816753039755, 0.14262594860823205, 0.2642773475575571, -0.02960862056352198, -0.128984344114239, -0.06927486058945458, 0.014477025717496872, -0.023868322527656954, -0.03808776712200294, 0.0368029055534862, -0.12516509248719862, -0.19436574168503284, 0.4890709075455864, -0.018936264251048367, -0.13709880551323295, 0.20288002060260624, -0.1616505915299058, -0.16812134482703792, 0.25897501570095, 0.11773826577700675, 0.13179144761913145, -0.03680739462530861, 0.16005016645794967, -0.0910423370078206, 0.12003867886960506, 0.1679569452050297, -0.02066491630588037, 0.21608873223885894, 0.005870232901846369, -0.06903702920923631, 0.1809498407844027, -0.06540460186079144, -0.1028888631456842, -0.3364088151283795, -0.18335620476864278, -0.08664726157561138, 0.1351559634495061, -0.08864869012359122, -0.21729954751208425, 0.5021049653490385, 0.030186987792452175, 0.21808818991606435, -0.10822147802294542, 0.16321000375319272, 0.01541850452000896, 0.050564655025179185, -0.004502039402723312, 0.19837187013278404, 0.20336122314135233, 0.025436400319449604, -0.2586527341045439, -0.12181018836175402, 0.1870953687466681]
|
1,803.06412
|
Symplectic invariance of rational surfaces on K\"{a}hler manifolds
|
Kollar and Ruan proved symplectic deformation invariance for uniruledness of
Kaehler manifolds. Zhiyu Tian proved the same for rational connectedness in
dimension < 4. Kollar conjectured this in all dimensions. We prove Kollar's
conjecture, as well as existence of a covering family of rational surfaces, for
all Kaehler manifolds that are symplectically deformation equivalent to G/P or
to a low degree complete intersection in such.
|
math.AG
|
kollar and ruan proved symplectic deformation invariance for uniruledness of kaehler manifolds zhiyu tian proved the same for rational connectedness in dimension 4 kollar conjectured this in all dimensions we prove kollars conjecture as well as existence of a covering family of rational surfaces for all kaehler manifolds that are symplectically deformation equivalent to gp or to a low degree complete intersection in such
|
[['kollar', 'and', 'ruan', 'proved', 'symplectic', 'deformation', 'invariance', 'for', 'uniruledness', 'of', 'kaehler', 'manifolds', 'zhiyu', 'tian', 'proved', 'the', 'same', 'for', 'rational', 'connectedness', 'in', 'dimension', '4', 'kollar', 'conjectured', 'this', 'in', 'all', 'dimensions', 'we', 'prove', 'kollars', 'conjecture', 'as', 'well', 'as', 'existence', 'of', 'a', 'covering', 'family', 'of', 'rational', 'surfaces', 'for', 'all', 'kaehler', 'manifolds', 'that', 'are', 'symplectically', 'deformation', 'equivalent', 'to', 'gp', 'or', 'to', 'a', 'low', 'degree', 'complete', 'intersection', 'in', 'such']]
|
[-0.20950349747011113, 0.02481114525081856, -0.06946799626189565, 0.1325615280407614, -0.07294259107457327, -0.20924320525770623, -0.07572961716897904, 0.3035819603514577, -0.2598686077676359, -0.22115445495509203, 0.09594665671188739, -0.21152633644034347, -0.2038942145161508, 0.17366023212375623, -0.2375729613316556, 0.048520505945715636, 0.004606599786451885, 0.01041296377245869, -0.07825229273340295, -0.4051919589853949, 0.4264842335075613, -0.07435488110058941, 0.22336750897941077, 0.1652757667433766, 0.1435464101858319, 0.031029239296913147, 0.03407750782068996, 0.017694466865606724, -0.1795487060357811, 0.10814606383561141, 0.3435279576196557, 0.04591060069108766, 0.1344287907261224, -0.3177368269996747, -0.21011848146990236, 0.18920606077604352, 0.11199264991880646, 0.0279301560321261, 0.021683311847496837, -0.25185328831393566, 0.12041383159775583, -0.08590876207883757, -0.294668589836903, -0.16739855755475305, 0.08054623719570893, -0.0006308518202295379, -0.19438386191835716, -0.025607967217053686, 0.1704486992139931, 0.1621443813311912, -0.06262359508712377, -0.11764216573820227, -0.13254765437782876, 0.04134225747585001, -0.011015047555759785, 0.05168726712849642, 0.03409899409771675, -0.05099058449490085, -0.1069356549590353, 0.3209037918455174, -0.047297731130605654, -0.24407762243220257, 0.11185136283673937, -0.11756484906026532, -0.2586354365468853, 0.13496360818796332, 0.07289110388032101, 0.18290712614543736, 0.016709811530918592, 0.1994400961829963, -0.09978661557570809, 0.007507942402587523, 0.26032430676388596, -0.04316369295563726, 0.08347122159801305, 0.06481155642633518, 0.16608328938794634, 0.07500459518401868, 0.054343281520737544, -0.04571661276240197, -0.3535217335152011, -0.25791667957627584, -0.1334645205790857, 0.2724318744851247, -0.12132903930175835, -0.19040825549838325, 0.3378666617005827, -0.05192061151481337, 0.18525182582911046, 0.19364312953419155, 0.17641140703880598, -0.06278477816487707, 0.006666925159238633, 0.0942919888637132, 0.21005710255768564, 0.24711943036388784, -0.035592850524976495, -0.05182506136655334, -0.08806428928963012, 0.24681395048364288]
|
1,803.06413
|
Thermal kinetic inductance detectors for ground-based millimeter-wave
cosmology
|
We show measurements of thermal kinetic inductance detectors (TKID) intended
for millimeter wave cosmology in the 200-300 GHz atmospheric window. The TKID
is a type of bolometer which uses the kinetic inductance of a superconducting
resonator to measure the temperature of the thermally isolated bolometer
island. We measure bolometer thermal conductance, time constant and noise
equivalent power. We also measure the quality factor of our resonators as the
bath temperature varies to show they are limited by effects consistent with
coupling to two level systems.
|
astro-ph.IM
|
we show measurements of thermal kinetic inductance detectors tkid intended for millimeter wave cosmology in the 200300 ghz atmospheric window the tkid is a type of bolometer which uses the kinetic inductance of a superconducting resonator to measure the temperature of the thermally isolated bolometer island we measure bolometer thermal conductance time constant and noise equivalent power we also measure the quality factor of our resonators as the bath temperature varies to show they are limited by effects consistent with coupling to two level systems
|
[['we', 'show', 'measurements', 'of', 'thermal', 'kinetic', 'inductance', 'detectors', 'tkid', 'intended', 'for', 'millimeter', 'wave', 'cosmology', 'in', 'the', '200300', 'ghz', 'atmospheric', 'window', 'the', 'tkid', 'is', 'a', 'type', 'of', 'bolometer', 'which', 'uses', 'the', 'kinetic', 'inductance', 'of', 'a', 'superconducting', 'resonator', 'to', 'measure', 'the', 'temperature', 'of', 'the', 'thermally', 'isolated', 'bolometer', 'island', 'we', 'measure', 'bolometer', 'thermal', 'conductance', 'time', 'constant', 'and', 'noise', 'equivalent', 'power', 'we', 'also', 'measure', 'the', 'quality', 'factor', 'of', 'our', 'resonators', 'as', 'the', 'bath', 'temperature', 'varies', 'to', 'show', 'they', 'are', 'limited', 'by', 'effects', 'consistent', 'with', 'coupling', 'to', 'two', 'level', 'systems']]
|
[-0.17394697677124948, 0.19480752737863977, -0.028173954730086468, -0.005093435037826353, -0.054138952975763995, -0.1534599317730788, 0.024553272100713324, 0.3796337653170614, -0.18949379031272495, -0.3259127903784461, 0.045450024130096765, -0.32617836143164075, -0.027150056642644544, 0.22326524409958545, 0.0014306337723289343, 0.04347688120461124, 0.015764239014071577, -0.03469890031744452, -0.008365700022755738, -0.15340617689139702, 0.2797202145379475, 0.16541167649385682, 0.3178522506619201, 0.06920288245686713, 0.15630506485810175, -0.14738762138466185, -0.012588786739198601, 0.05287980873356847, -0.18687744745436838, -0.022733021685031846, 0.26713628184379024, -0.003403717717703651, 0.2143234260599403, -0.41468547803952416, -0.21033959155628348, 0.07531871141537147, 0.04820242681376198, 0.07293735288275296, 0.05479474635246922, -0.25374382646644816, 0.016445540121811278, -0.1433710592908456, -0.11150707600857405, 0.00675414236372008, -0.049531900022617155, 0.017950846528743996, -0.24556907458121285, 0.07408525257556262, -0.008598922395750004, -0.0031714040019056376, -0.02507200913832468, -0.13572722819140728, 0.0023519779582891393, 0.04496141298509696, -0.04293905432226465, -0.006605853905613699, 0.26258009119945414, -0.09432508717017139, -0.03298738250947174, 0.29340200600049954, -0.1698144532630549, -0.10802143927225295, 0.15277764564927887, -0.19495331065948396, -0.06233555773163543, 0.17889098058290342, 0.11798305112033096, 0.012779979353003642, -0.1934469378224629, 0.04015921888914069, 0.07335868379227845, 0.26892472156597413, 0.08109761853976284, 0.13673855059725395, 0.25503634625278854, 0.21688693246858962, 0.07583695152664886, 0.16269748000400688, -0.15672177321222774, 0.012160151742179603, -0.2821999927106149, -0.1709771301542573, -0.20877687620985158, 0.11204018289110322, -0.09976874320367214, -0.1842276909717304, 0.3812729192459408, 0.20384794864803552, 0.12087290082126856, 0.05027380966827931, 0.33203272363718817, 0.13147536523174494, 0.08614073816056857, 0.007998044881969691, 0.27491819202790363, 0.19490184119135578, 0.13965883666978163, -0.29439103141810524, -0.03922896848114974, -0.03889223075033549]
|
1,803.06414
|
Learning to Segment via Cut-and-Paste
|
This paper presents a weakly-supervised approach to object instance
segmentation. Starting with known or predicted object bounding boxes, we learn
object masks by playing a game of cut-and-paste in an adversarial learning
setup. A mask generator takes a detection box and Faster R-CNN features, and
constructs a segmentation mask that is used to cut-and-paste the object into a
new image location. The discriminator tries to distinguish between real
objects, and those cut and pasted via the generator, giving a learning signal
that leads to improved object masks. We verify our method experimentally using
Cityscapes, COCO, and aerial image datasets, learning to segment objects
without ever having seen a mask in training. Our method exceeds the performance
of existing weakly supervised methods, without requiring hand-tuned segment
proposals, and reaches 90% of supervised performance.
|
cs.CV
|
this paper presents a weaklysupervised approach to object instance segmentation starting with known or predicted object bounding boxes we learn object masks by playing a game of cutandpaste in an adversarial learning setup a mask generator takes a detection box and faster rcnn features and constructs a segmentation mask that is used to cutandpaste the object into a new image location the discriminator tries to distinguish between real objects and those cut and pasted via the generator giving a learning signal that leads to improved object masks we verify our method experimentally using cityscapes coco and aerial image datasets learning to segment objects without ever having seen a mask in training our method exceeds the performance of existing weakly supervised methods without requiring handtuned segment proposals and reaches 90 of supervised performance
|
[['this', 'paper', 'presents', 'a', 'weaklysupervised', 'approach', 'to', 'object', 'instance', 'segmentation', 'starting', 'with', 'known', 'or', 'predicted', 'object', 'bounding', 'boxes', 'we', 'learn', 'object', 'masks', 'by', 'playing', 'a', 'game', 'of', 'cutandpaste', 'in', 'an', 'adversarial', 'learning', 'setup', 'a', 'mask', 'generator', 'takes', 'a', 'detection', 'box', 'and', 'faster', 'rcnn', 'features', 'and', 'constructs', 'a', 'segmentation', 'mask', 'that', 'is', 'used', 'to', 'cutandpaste', 'the', 'object', 'into', 'a', 'new', 'image', 'location', 'the', 'discriminator', 'tries', 'to', 'distinguish', 'between', 'real', 'objects', 'and', 'those', 'cut', 'and', 'pasted', 'via', 'the', 'generator', 'giving', 'a', 'learning', 'signal', 'that', 'leads', 'to', 'improved', 'object', 'masks', 'we', 'verify', 'our', 'method', 'experimentally', 'using', 'cityscapes', 'coco', 'and', 'aerial', 'image', 'datasets', 'learning', 'to', 'segment', 'objects', 'without', 'ever', 'having', 'seen', 'a', 'mask', 'in', 'training', 'our', 'method', 'exceeds', 'the', 'performance', 'of', 'existing', 'weakly', 'supervised', 'methods', 'without', 'requiring', 'handtuned', 'segment', 'proposals', 'and', 'reaches', '90', 'of', 'supervised', 'performance']]
|
[-0.0272798724066833, -0.0371048148521037, -0.0839956077168498, 0.05836296494376394, -0.1375595703967988, -0.2297420723674198, 0.04931008885967347, 0.47648222558905906, -0.20364077148295825, -0.39204434858578624, 0.046255328394402044, -0.292820671040593, -0.12744877076263286, 0.19277703511761501, -0.19072466145735234, 0.08298794024581597, 0.1823433658432667, 0.05687966027515799, -0.0674868729635791, -0.2613045641002386, 0.2808237103604232, 0.0350411551348357, 0.30078499653433083, -0.03573135265050399, 0.19551928354441328, -0.027418109281411904, -0.02235462270310205, 0.011448491766879504, -0.04900884607890144, 0.15477500098870334, 0.2943294127524661, 0.20666043343248242, 0.25893053578241076, -0.37504568595128757, -0.20020642772909591, 0.09718953995439789, 0.14324628325024, 0.12407229140246107, -0.06686509449729894, -0.4369201993174625, 0.11951972231282994, -0.1681377913844313, 0.033884452849936984, -0.10615118584510955, -0.022403278553886623, -0.08092531892576847, -0.3251188350841403, -0.023804702870124442, 0.13377453127847702, 0.024268604744451517, -0.036735781179176585, -0.05225049614532371, 0.03663404941978639, 0.17667503764845827, -0.019673153322373488, 0.10174210528158724, 0.1991165156941861, -0.24138957334886954, -0.15740073081388167, 0.33381916001918865, -0.038209435254843396, -0.2117546971377592, 0.2045515984804793, -0.015055530665752789, -0.08285239644376843, 0.14232195082656812, 0.18990389376201414, 0.18242019759914416, -0.11505452685312113, -0.02766258476538386, -0.03651464156097394, 0.20224919464354488, 0.08866508714643052, -0.08396355202421546, 0.20184157693151836, 0.2695225075056607, 0.0442879041894974, 0.22607911791243224, -0.24391282192487834, -0.03325556478441947, -0.21977111431029203, -0.10452847480138933, -0.20084173512066517, -0.04557212150768575, -0.1072222309208662, -0.17872062036346478, 0.3883965871240379, 0.2461641439339005, 0.2431437952433374, 0.11247501630339574, 0.38463864199266856, -0.029252762336523807, 0.14996060530767974, 0.06256296568652474, 0.19617377665814606, -0.020038918216331778, 0.09853460476380971, -0.1087672660959828, 0.07001525367674978, 0.13820242765006807]
|
1,803.06415
|
Connection Blocking In Quotients of $Sol$
|
Let $G$ be a connected Lie group and $\Gamma \subset G$ a lattice. Connection
curves of the homogeneous space $M=G/\Gamma$ are the orbits of one parameter
subgroups of $G$. To $block$ a pair of points $m_1,m_2 \in M$ is to find a
finite set $B \subset M\setminus \{m_1, m_2 \}$ such that every connecting
curve joining $m_1$ and $m_2$ intersects $B$. The homogeneous space $M$ is
$blockable$ if every pair of points in $M$ can be blocked, otherwise we call it
$non-blockable$. $Sol$ is an important Lie group and one of the eight
homogeneous Thurston 3-geometries. It is a unimodular solvable Lie group
diffeomorphic to $R^3$, and together with the left invariant metric
$ds^2=e^{-2z}dx^2+e^{2z}dy^2+dz^2$ includes copies of the hyperbolic plane,
which makes studying its geometrical properties more interesting. In this paper
we prove that all quotients of $Sol$ are non-blockable. In particular, we show
that for any lattice $\Gamma \subset Sol$, the set of non-blockable pairs is a
dense subset of $Sol/\Gamma \times Sol/\Gamma$.
|
math.DG
|
let g be a connected lie group and gamma subset g a lattice connection curves of the homogeneous space mggamma are the orbits of one parameter subgroups of g to block a pair of points m_1m_2 in m is to find a finite set b subset msetminus m_1 m_2 such that every connecting curve joining m_1 and m_2 intersects b the homogeneous space m is blockable if every pair of points in m can be blocked otherwise we call it nonblockable sol is an important lie group and one of the eight homogeneous thurston 3geometries it is a unimodular solvable lie group diffeomorphic to r3 and together with the left invariant metric ds2e2zdx2e2zdy2dz2 includes copies of the hyperbolic plane which makes studying its geometrical properties more interesting in this paper we prove that all quotients of sol are nonblockable in particular we show that for any lattice gamma subset sol the set of nonblockable pairs is a dense subset of solgamma times solgamma
|
[['let', 'g', 'be', 'a', 'connected', 'lie', 'group', 'and', 'gamma', 'subset', 'g', 'a', 'lattice', 'connection', 'curves', 'of', 'the', 'homogeneous', 'space', 'mggamma', 'are', 'the', 'orbits', 'of', 'one', 'parameter', 'subgroups', 'of', 'g', 'to', 'block', 'a', 'pair', 'of', 'points', 'm_1m_2', 'in', 'm', 'is', 'to', 'find', 'a', 'finite', 'set', 'b', 'subset', 'msetminus', 'm_1', 'm_2', 'such', 'that', 'every', 'connecting', 'curve', 'joining', 'm_1', 'and', 'm_2', 'intersects', 'b', 'the', 'homogeneous', 'space', 'm', 'is', 'blockable', 'if', 'every', 'pair', 'of', 'points', 'in', 'm', 'can', 'be', 'blocked', 'otherwise', 'we', 'call', 'it', 'nonblockable', 'sol', 'is', 'an', 'important', 'lie', 'group', 'and', 'one', 'of', 'the', 'eight', 'homogeneous', 'thurston', '3geometries', 'it', 'is', 'a', 'unimodular', 'solvable', 'lie', 'group', 'diffeomorphic', 'to', 'r3', 'and', 'together', 'with', 'the', 'left', 'invariant', 'metric', 'ds2e2zdx2e2zdy2dz2', 'includes', 'copies', 'of', 'the', 'hyperbolic', 'plane', 'which', 'makes', 'studying', 'its', 'geometrical', 'properties', 'more', 'interesting', 'in', 'this', 'paper', 'we', 'prove', 'that', 'all', 'quotients', 'of', 'sol', 'are', 'nonblockable', 'in', 'particular', 'we', 'show', 'that', 'for', 'any', 'lattice', 'gamma', 'subset', 'sol', 'the', 'set', 'of', 'nonblockable', 'pairs', 'is', 'a', 'dense', 'subset', 'of', 'solgamma', 'times', 'solgamma']]
|
[-0.2408615246458794, 0.14345232591958848, -0.06573592695349362, -0.001455127153894864, -0.11242248946946347, -0.14834970124356914, 0.033617197257262886, 0.3989163778955117, -0.27894519205437973, -0.1892496426415164, 0.10279187800042563, -0.2999350580736063, -0.11447858123865444, 0.18818748836783925, -0.08196629562007729, -0.06977293114796339, 0.08537645888573024, 0.11978522661156603, -0.07529549075698014, -0.26482708923285825, 0.35819457228062673, -0.08943369661283214, 0.16446744360291632, -0.024973028880776838, 0.09574569706746842, 0.0017794420709833503, 0.011288620658888249, 0.03592766423644207, -0.16180082397108891, 0.07429195937584154, 0.24960159837501122, 0.09296523244556738, 0.18121741807626676, -0.294396611004413, -0.15460950321576092, 0.22642765265482012, 0.13553940253332258, -0.04658050056968932, 0.018535761172370258, -0.24899087065132336, 0.14546865152660757, -0.1255357566929888, -0.1539012200315483, -0.0124925515439827, 0.12669798797578552, -0.025273591408040374, -0.24721760594838998, -0.007877436734270304, 0.07255868576467037, 0.029829349731585353, -0.0048003016789152754, -0.09923190163681284, -0.1074045338871656, 0.10535810272558592, -0.02479453619889682, 0.10966320575389546, 0.08720709534172784, -0.00790389175672317, -0.04390508187643718, 0.4475538820581278, -0.03885141946957447, -0.2259328083062428, 0.15819845028745477, -0.190764350417885, -0.16270411278383107, 0.14188302927359472, 0.10606815837672912, 0.13466573172190693, -0.0828453966702, 0.2121563027096272, -0.14627276094979608, 0.09209165106876753, 0.07899654118227772, -0.03974508612591308, 0.18896398812066764, 0.13115626554936172, 0.1349372319848044, 0.10047014896081237, -0.005182347202207893, 0.027373764364165255, -0.3664238125900738, -0.1842154543090146, -0.1513068952175672, 0.13950710496283136, -0.11757819561280484, -0.16525565646588802, 0.3382918266172055, 0.0073517550394171845, 0.2378027649159776, 0.03165384015374002, 0.18054501597653144, 0.02688303729864856, 0.029287327643396567, 0.15984641429095064, 0.10433770114323124, 0.17180446604033933, -0.10548544001067058, -0.14962004791377695, -0.06274189024697989, 0.1420567450724775]
|
1,803.06416
|
Differential Privacy for Growing Databases
|
We study the design of differentially private algorithms for adaptive
analysis of dynamically growing databases, where a database accumulates new
data entries while the analysis is ongoing. We provide a collection of tools
for machine learning and other types of data analysis that guarantee
differential privacy and accuracy as the underlying databases grow arbitrarily
large. We give both a general technique and a specific algorithm for adaptive
analysis of dynamically growing databases. Our general technique is illustrated
by two algorithms that schedule black box access to some algorithm that
operates on a fixed database to generically transform private and accurate
algorithms for static databases into private and accurate algorithms for
dynamically growing databases. These results show that almost any private and
accurate algorithm can be rerun at appropriate points of data growth with
minimal loss of accuracy, even when data growth is unbounded. Our specific
algorithm directly adapts the private multiplicative weights algorithm to the
dynamic setting, maintaining the accuracy guarantee of the static setting
through unbounded data growth. Along the way, we develop extensions of several
other differentially private algorithms to the dynamic setting, which may be of
independent interest for future work on the design of differentially private
algorithms for growing databases.
|
cs.DS cs.DB
|
we study the design of differentially private algorithms for adaptive analysis of dynamically growing databases where a database accumulates new data entries while the analysis is ongoing we provide a collection of tools for machine learning and other types of data analysis that guarantee differential privacy and accuracy as the underlying databases grow arbitrarily large we give both a general technique and a specific algorithm for adaptive analysis of dynamically growing databases our general technique is illustrated by two algorithms that schedule black box access to some algorithm that operates on a fixed database to generically transform private and accurate algorithms for static databases into private and accurate algorithms for dynamically growing databases these results show that almost any private and accurate algorithm can be rerun at appropriate points of data growth with minimal loss of accuracy even when data growth is unbounded our specific algorithm directly adapts the private multiplicative weights algorithm to the dynamic setting maintaining the accuracy guarantee of the static setting through unbounded data growth along the way we develop extensions of several other differentially private algorithms to the dynamic setting which may be of independent interest for future work on the design of differentially private algorithms for growing databases
|
[['we', 'study', 'the', 'design', 'of', 'differentially', 'private', 'algorithms', 'for', 'adaptive', 'analysis', 'of', 'dynamically', 'growing', 'databases', 'where', 'a', 'database', 'accumulates', 'new', 'data', 'entries', 'while', 'the', 'analysis', 'is', 'ongoing', 'we', 'provide', 'a', 'collection', 'of', 'tools', 'for', 'machine', 'learning', 'and', 'other', 'types', 'of', 'data', 'analysis', 'that', 'guarantee', 'differential', 'privacy', 'and', 'accuracy', 'as', 'the', 'underlying', 'databases', 'grow', 'arbitrarily', 'large', 'we', 'give', 'both', 'a', 'general', 'technique', 'and', 'a', 'specific', 'algorithm', 'for', 'adaptive', 'analysis', 'of', 'dynamically', 'growing', 'databases', 'our', 'general', 'technique', 'is', 'illustrated', 'by', 'two', 'algorithms', 'that', 'schedule', 'black', 'box', 'access', 'to', 'some', 'algorithm', 'that', 'operates', 'on', 'a', 'fixed', 'database', 'to', 'generically', 'transform', 'private', 'and', 'accurate', 'algorithms', 'for', 'static', 'databases', 'into', 'private', 'and', 'accurate', 'algorithms', 'for', 'dynamically', 'growing', 'databases', 'these', 'results', 'show', 'that', 'almost', 'any', 'private', 'and', 'accurate', 'algorithm', 'can', 'be', 'rerun', 'at', 'appropriate', 'points', 'of', 'data', 'growth', 'with', 'minimal', 'loss', 'of', 'accuracy', 'even', 'when', 'data', 'growth', 'is', 'unbounded', 'our', 'specific', 'algorithm', 'directly', 'adapts', 'the', 'private', 'multiplicative', 'weights', 'algorithm', 'to', 'the', 'dynamic', 'setting', 'maintaining', 'the', 'accuracy', 'guarantee', 'of', 'the', 'static', 'setting', 'through', 'unbounded', 'data', 'growth', 'along', 'the', 'way', 'we', 'develop', 'extensions', 'of', 'several', 'other', 'differentially', 'private', 'algorithms', 'to', 'the', 'dynamic', 'setting', 'which', 'may', 'be', 'of', 'independent', 'interest', 'for', 'future', 'work', 'on', 'the', 'design', 'of', 'differentially', 'private', 'algorithms', 'for', 'growing', 'databases']]
|
[-0.11777013296024035, 0.010730143647878339, -0.08938263626951798, 0.07443996563533266, -0.10588143046319887, -0.1969102763538888, 0.099881114120174, 0.37940549966365594, -0.29563737621156533, -0.3278473005287678, 0.16553590314544955, -0.26512713310327013, -0.12530603003688157, 0.25064172564010484, -0.09711426396325788, 0.11679594675261601, 0.10385164852007567, 0.04517855830208111, 0.007912816633881234, -0.32259966730706247, 0.3193461509037982, 0.04484486615960943, 0.3007130112416823, -0.00681664869896885, 0.06636136108778266, 0.027677549005887817, -0.06820587258256387, 0.03684491305509308, -0.11111256534144666, 0.17659656770582147, 0.29836291066535253, 0.24512666331368868, 0.33012012139821023, -0.39826882492486093, -0.15453210853578925, 0.10793859783021331, 0.15356231541783713, 0.14580394563495694, -0.10936449227201771, -0.2552968347079906, 0.13225044986414586, -0.14092185370414062, -0.06397048880884826, -0.17525236618787268, -0.00034676501573081695, 0.024648047864948418, -0.363425343566775, 0.015030791378105242, 0.05073703325344432, 0.06639482106388017, -0.08191439495125201, -0.0902967941890215, 0.028161406106151202, 0.1593068226660869, 0.024690119425798126, 0.03915248876414718, 0.15457086763618624, -0.09422445216948878, -0.1634533403004182, 0.32916316836524534, -0.05073350936165262, -0.18881392273960598, 0.16013586804711297, -0.07542825795427038, -0.1666058911919119, 0.13290207484947042, 0.2748067171093734, 0.12075994134761904, -0.15712073292075623, 0.07840300982592024, -0.04152251432156738, 0.1748110030391984, 0.029139802510982526, 0.040795532003268783, 0.14806242342399178, 0.17125237923384845, 0.1027850301105383, 0.1303822552270539, -0.024374659218843662, -0.12720339575681983, -0.23689498245207063, -0.13178411634405218, -0.17235422559201205, -0.05765632500954192, -0.1534145594109135, -0.18265417725528024, 0.34432289689121875, 0.1695988967852934, 0.17959021784903884, 0.09394192346022179, 0.3934405548634994, 0.004236563391625132, 0.08264527891707771, 0.16669460509985903, 0.14791388690826032, 0.0235590455590236, 0.11769860482480213, -0.17044142424927877, 0.12413469249169758, -0.0030790806420412206]
|
1,803.06417
|
Coding for Channels with SNR Variation: Spatial Coupling and Efficient
Interleaving
|
In magnetic-recording systems, consecutive sections experience different
signal to noise ratios (SNRs). To perform error correction over these systems,
one approach is to use an individual block code for each section. However, the
performance over a section affected by a lower SNR is weaker compared to the
performance over a section affected by a higher SNR. Spatially-coupled (SC)
codes are a family of graph-based codes with capacity approaching performance
and low latency decoding. An SC code is constructed by partitioning an
underlying block code to several component matrices, and coupling copies of the
component matrices together. The contribution of this paper is threefold.
First, we present a new partitioning technique to efficiently construct SC
codes with column weights 4 and 6. Second, we present an SC code construction
for channels with SNR variation. Our SC code construction provides local error
correction for each section by means of the underlying codes that cover one
section each, and simultaneously, an added level of error correction by means
of coupling among the underlying codes. Third, we introduce a low-complexity
interleaving scheme specific to SC codes that further improves their
performance over channels with SNR variation. Our simulation results show that
our SC codes outperform individual block codes by more than 1 and 2 orders of
magnitudes in the error floor region compared to the block codes with and
without regular interleaving, respectively. This improvement is more pronounced
by increasing the memory and column weight.
|
cs.IT math.IT
|
in magneticrecording systems consecutive sections experience different signal to noise ratios snrs to perform error correction over these systems one approach is to use an individual block code for each section however the performance over a section affected by a lower snr is weaker compared to the performance over a section affected by a higher snr spatiallycoupled sc codes are a family of graphbased codes with capacity approaching performance and low latency decoding an sc code is constructed by partitioning an underlying block code to several component matrices and coupling copies of the component matrices together the contribution of this paper is threefold first we present a new partitioning technique to efficiently construct sc codes with column weights 4 and 6 second we present an sc code construction for channels with snr variation our sc code construction provides local error correction for each section by means of the underlying codes that cover one section each and simultaneously an added level of error correction by means of coupling among the underlying codes third we introduce a lowcomplexity interleaving scheme specific to sc codes that further improves their performance over channels with snr variation our simulation results show that our sc codes outperform individual block codes by more than 1 and 2 orders of magnitudes in the error floor region compared to the block codes with and without regular interleaving respectively this improvement is more pronounced by increasing the memory and column weight
|
[['in', 'magneticrecording', 'systems', 'consecutive', 'sections', 'experience', 'different', 'signal', 'to', 'noise', 'ratios', 'snrs', 'to', 'perform', 'error', 'correction', 'over', 'these', 'systems', 'one', 'approach', 'is', 'to', 'use', 'an', 'individual', 'block', 'code', 'for', 'each', 'section', 'however', 'the', 'performance', 'over', 'a', 'section', 'affected', 'by', 'a', 'lower', 'snr', 'is', 'weaker', 'compared', 'to', 'the', 'performance', 'over', 'a', 'section', 'affected', 'by', 'a', 'higher', 'snr', 'spatiallycoupled', 'sc', 'codes', 'are', 'a', 'family', 'of', 'graphbased', 'codes', 'with', 'capacity', 'approaching', 'performance', 'and', 'low', 'latency', 'decoding', 'an', 'sc', 'code', 'is', 'constructed', 'by', 'partitioning', 'an', 'underlying', 'block', 'code', 'to', 'several', 'component', 'matrices', 'and', 'coupling', 'copies', 'of', 'the', 'component', 'matrices', 'together', 'the', 'contribution', 'of', 'this', 'paper', 'is', 'threefold', 'first', 'we', 'present', 'a', 'new', 'partitioning', 'technique', 'to', 'efficiently', 'construct', 'sc', 'codes', 'with', 'column', 'weights', '4', 'and', '6', 'second', 'we', 'present', 'an', 'sc', 'code', 'construction', 'for', 'channels', 'with', 'snr', 'variation', 'our', 'sc', 'code', 'construction', 'provides', 'local', 'error', 'correction', 'for', 'each', 'section', 'by', 'means', 'of', 'the', 'underlying', 'codes', 'that', 'cover', 'one', 'section', 'each', 'and', 'simultaneously', 'an', 'added', 'level', 'of', 'error', 'correction', 'by', 'means', 'of', 'coupling', 'among', 'the', 'underlying', 'codes', 'third', 'we', 'introduce', 'a', 'lowcomplexity', 'interleaving', 'scheme', 'specific', 'to', 'sc', 'codes', 'that', 'further', 'improves', 'their', 'performance', 'over', 'channels', 'with', 'snr', 'variation', 'our', 'simulation', 'results', 'show', 'that', 'our', 'sc', 'codes', 'outperform', 'individual', 'block', 'codes', 'by', 'more', 'than', '1', 'and', '2', 'orders', 'of', 'magnitudes', 'in', 'the', 'error', 'floor', 'region', 'compared', 'to', 'the', 'block', 'codes', 'with', 'and', 'without', 'regular', 'interleaving', 'respectively', 'this', 'improvement', 'is', 'more', 'pronounced', 'by', 'increasing', 'the', 'memory', 'and', 'column', 'weight']]
|
[-0.15657407562369674, 0.036462734904307584, -0.010007113998290152, 0.06375022494612495, 0.014220098855245548, -0.20613771599989075, 0.06121409152062066, 0.41538651859931025, -0.2790317339783845, -0.30860889561396715, 0.08864374226977816, -0.25978462360799315, -0.11359187236230354, 0.19974330899713094, -0.08157672610553467, 0.03366401066693167, 0.09117067667345206, 0.007289680000394583, -0.14979512248925556, -0.3462429932046992, 0.3136306654952932, 0.19838517607810596, 0.25849149754455236, -0.0025839234391848245, 0.0686223165019328, -0.010228389688806298, -0.029289008215224992, -0.0017388669812741378, -0.10931178441530089, 0.11394585860640898, 0.2558029689748461, 0.1479082911973819, 0.20291040860271703, -0.34145390859727437, -0.22238008083926009, 0.04582067526062019, 0.1524641522167561, 0.13997024243678122, -0.026603745945249103, -0.2156417055928614, 0.14641284927347442, -0.23840578224432343, -0.018886247163754886, 0.0005587420571828261, -0.03400786789716222, 0.007119308904414841, -0.29791663157908865, 0.005867755512008443, 0.05997399413608946, 0.06244851672381628, 0.004880026196284841, -0.19104116502179144, 0.05272388722611746, 0.11588094206720902, -0.010507811766001397, 0.056830328959646674, 0.07126279451379863, -0.07391646109584447, -0.1256082278889759, 0.3278086739415206, -0.062098231969685, -0.19351605775397426, 0.1364928040925103, -0.05708942089501458, -0.08277832264235864, 0.2248606123806288, 0.19791897029499522, 0.06030560235861534, -0.11542373042126806, 0.029915853845280557, 0.018031258954821775, 0.22945651800449315, 0.05706814105869853, 0.08090331915591378, 0.13106161884497852, 0.14318940817417267, 0.0825585992153113, 0.15674719896245126, -0.11314293541848504, -0.0552452623572511, -0.2676486774599956, -0.13558262833030313, -0.14904983403393998, -0.013839267549337819, -0.13535290029206712, -0.14003849911193053, 0.38902864305957036, 0.15393663089786666, 0.1808214568028537, 0.1130050659722959, 0.3346575451432727, 0.05453374485296081, 0.11937196302363494, 0.17022339644414994, 0.1594541140269333, 0.15721388483361806, 0.01872973186788537, -0.20762663507230172, 0.07208738859299046, 0.08231224510624695]
|
1,803.06418
|
Leveraging Sparsity to Speed Up Polynomial Feature Expansions of CSR
Matrices Using $K$-Simplex Numbers
|
An algorithm is provided for performing polynomial feature expansions that
both operates on and produces compressed sparse row (CSR) matrices. Previously,
no such algorithm existed, and performing polynomial expansions on CSR matrices
required an intermediate densification step. The algorithm performs a
$K$-degree expansion by using a bijective function involving $K$-simplex
numbers of column indices in the original matrix to column indices in the
expanded matrix. Not only is space saved by operating in CSR format, but the
bijective function allows for only the nonzero elements to be iterated over and
multiplied together during the expansion, greatly improving average time
complexity. For a vector of dimensionality $D$ and density $0 \le d \le 1$, the
algorithm has average time complexity $\Theta(d^KD^K)$ where $K$ is the
polynomial-feature order; this is an improvement by a factor $d^K$ over the
standard method. This work derives the required function for the cases of $K=2$
and $K=3$ and shows its use in the $K=2$ algorithm.
|
cs.DS cs.NA
|
an algorithm is provided for performing polynomial feature expansions that both operates on and produces compressed sparse row csr matrices previously no such algorithm existed and performing polynomial expansions on csr matrices required an intermediate densification step the algorithm performs a kdegree expansion by using a bijective function involving ksimplex numbers of column indices in the original matrix to column indices in the expanded matrix not only is space saved by operating in csr format but the bijective function allows for only the nonzero elements to be iterated over and multiplied together during the expansion greatly improving average time complexity for a vector of dimensionality d and density 0 le d le 1 the algorithm has average time complexity thetadkdk where k is the polynomialfeature order this is an improvement by a factor dk over the standard method this work derives the required function for the cases of k2 and k3 and shows its use in the k2 algorithm
|
[['an', 'algorithm', 'is', 'provided', 'for', 'performing', 'polynomial', 'feature', 'expansions', 'that', 'both', 'operates', 'on', 'and', 'produces', 'compressed', 'sparse', 'row', 'csr', 'matrices', 'previously', 'no', 'such', 'algorithm', 'existed', 'and', 'performing', 'polynomial', 'expansions', 'on', 'csr', 'matrices', 'required', 'an', 'intermediate', 'densification', 'step', 'the', 'algorithm', 'performs', 'a', 'kdegree', 'expansion', 'by', 'using', 'a', 'bijective', 'function', 'involving', 'ksimplex', 'numbers', 'of', 'column', 'indices', 'in', 'the', 'original', 'matrix', 'to', 'column', 'indices', 'in', 'the', 'expanded', 'matrix', 'not', 'only', 'is', 'space', 'saved', 'by', 'operating', 'in', 'csr', 'format', 'but', 'the', 'bijective', 'function', 'allows', 'for', 'only', 'the', 'nonzero', 'elements', 'to', 'be', 'iterated', 'over', 'and', 'multiplied', 'together', 'during', 'the', 'expansion', 'greatly', 'improving', 'average', 'time', 'complexity', 'for', 'a', 'vector', 'of', 'dimensionality', 'd', 'and', 'density', '0', 'le', 'd', 'le', '1', 'the', 'algorithm', 'has', 'average', 'time', 'complexity', 'thetadkdk', 'where', 'k', 'is', 'the', 'polynomialfeature', 'order', 'this', 'is', 'an', 'improvement', 'by', 'a', 'factor', 'dk', 'over', 'the', 'standard', 'method', 'this', 'work', 'derives', 'the', 'required', 'function', 'for', 'the', 'cases', 'of', 'k2', 'and', 'k3', 'and', 'shows', 'its', 'use', 'in', 'the', 'k2', 'algorithm']]
|
[-0.12543517957251685, 0.10503781309815133, -0.07049694572201674, 0.00814923684551695, -0.026162235140444558, -0.12727452112898635, 0.06928617123864401, 0.37194416596358465, -0.2804188603345471, -0.2799225361234728, 0.11544469335994381, -0.22988426419589328, -0.14508023079051666, 0.16960058539177464, -0.02710594230622148, 0.060927919829546054, 0.03140241518367533, 0.066897783787316, -0.10106396674664964, -0.30912189537683016, 0.23723449136699984, 0.0813444789727426, 0.21705071654935978, -0.0036738499951590397, 0.1148136221702881, 0.032877195157869986, -0.06964579864055108, -0.01987983279662093, -0.0660337243145454, 0.08427387130725536, 0.23851079683733073, 0.1994506747159324, 0.25839538326498807, -0.38082656537176696, -0.16079466402008655, 0.13081524013927218, 0.16931289150290618, 0.05282154848953341, -0.006335157218869705, -0.20382841957946587, 0.10161315719671192, -0.15964999310316363, -0.09929546695439868, -0.08160717289295688, 0.048329082412562174, -0.02638516615435576, -0.36822793258733716, 0.05828120697446903, 0.06263773089903556, 0.06087831902958358, -2.796307412290554e-05, -0.1930773798257682, 0.04846777417548713, 0.09317966953963991, -0.016896385429604987, 0.08317810128840386, 0.07140116463563624, -0.11381760263477399, -0.08199960132615913, 0.3522853479975728, -0.07775181837181211, -0.17338442367021065, 0.11471609883662906, -0.13536499125384696, -0.13912766514595148, 0.1873154540065747, 0.12653301067792685, 0.115994549338605, -0.041826540509321886, 0.15380704403887532, -0.044743160661576895, 0.21283978848142704, 0.12013782222405266, -0.016985694694653105, 0.08205953418539695, 0.11045551742834875, 0.08724643690600564, 0.13311806648216937, -0.04926979434706128, -0.03693781281928205, -0.26678515770205646, -0.16675115572466592, -0.2567463605323581, -0.0012087805750357152, -0.1678060635349307, -0.13006666032182182, 0.3853752242703774, 0.09011032409182969, 0.21634920167434177, 0.11042801042793284, 0.3154473335001689, 0.12826830228482178, 0.07090858754273326, 0.11775844184693637, 0.14457926906758006, 0.12607487789978078, 0.09894045346244505, -0.17486188244549142, 0.09562102503552558, 0.15308026729335497]
|
1,803.06419
|
Topological Wave-Guiding Near an Exceptional Point: Defect-Immune,
Slow-Light, Loss-Immune Propagation
|
Electromagnetic waves propagating, at finite speeds, in conventional
wave-guiding structures are reflected by discontinuities and decay in lossy
regions. In this Letter, we drastically modify this typical guided-wave
behavior by combining concepts from non-Hermitian physics and topological
photonics. To this aim, we theoretically study, for the first time, the
possibility of realizing an exceptional point between \emph{coupled topological
modes in a non-Hermitian non-reciprocal waveguide}. Our proposed system is
composed of oppositely-biased gyrotropic materials (e.g., biased plasmas or
graphene layers) with a balanced loss/gain distribution. To study this complex
wave-guiding problem, we put forward an exact analysis based on classical
Green's function theory, and we illustrate the behavior of coupled topological
modes and the nature of their non-Hermitian degeneracies. We find that, by
operating near an exceptional point, we can realize anomalous topological wave
propagation with, at the same time, low group-velocity, inherent immunity to
back-scattering at discontinuities, and immunity to losses. These theoretical
findings may open exciting research directions and stimulate further
investigations of non-Hermitian topological waveguides to realize robust wave
propagation in practical scenarios.
|
physics.optics
|
electromagnetic waves propagating at finite speeds in conventional waveguiding structures are reflected by discontinuities and decay in lossy regions in this letter we drastically modify this typical guidedwave behavior by combining concepts from nonhermitian physics and topological photonics to this aim we theoretically study for the first time the possibility of realizing an exceptional point between emphcoupled topological modes in a nonhermitian nonreciprocal waveguide our proposed system is composed of oppositelybiased gyrotropic materials eg biased plasmas or graphene layers with a balanced lossgain distribution to study this complex waveguiding problem we put forward an exact analysis based on classical greens function theory and we illustrate the behavior of coupled topological modes and the nature of their nonhermitian degeneracies we find that by operating near an exceptional point we can realize anomalous topological wave propagation with at the same time low groupvelocity inherent immunity to backscattering at discontinuities and immunity to losses these theoretical findings may open exciting research directions and stimulate further investigations of nonhermitian topological waveguides to realize robust wave propagation in practical scenarios
|
[['electromagnetic', 'waves', 'propagating', 'at', 'finite', 'speeds', 'in', 'conventional', 'waveguiding', 'structures', 'are', 'reflected', 'by', 'discontinuities', 'and', 'decay', 'in', 'lossy', 'regions', 'in', 'this', 'letter', 'we', 'drastically', 'modify', 'this', 'typical', 'guidedwave', 'behavior', 'by', 'combining', 'concepts', 'from', 'nonhermitian', 'physics', 'and', 'topological', 'photonics', 'to', 'this', 'aim', 'we', 'theoretically', 'study', 'for', 'the', 'first', 'time', 'the', 'possibility', 'of', 'realizing', 'an', 'exceptional', 'point', 'between', 'emphcoupled', 'topological', 'modes', 'in', 'a', 'nonhermitian', 'nonreciprocal', 'waveguide', 'our', 'proposed', 'system', 'is', 'composed', 'of', 'oppositelybiased', 'gyrotropic', 'materials', 'eg', 'biased', 'plasmas', 'or', 'graphene', 'layers', 'with', 'a', 'balanced', 'lossgain', 'distribution', 'to', 'study', 'this', 'complex', 'waveguiding', 'problem', 'we', 'put', 'forward', 'an', 'exact', 'analysis', 'based', 'on', 'classical', 'greens', 'function', 'theory', 'and', 'we', 'illustrate', 'the', 'behavior', 'of', 'coupled', 'topological', 'modes', 'and', 'the', 'nature', 'of', 'their', 'nonhermitian', 'degeneracies', 'we', 'find', 'that', 'by', 'operating', 'near', 'an', 'exceptional', 'point', 'we', 'can', 'realize', 'anomalous', 'topological', 'wave', 'propagation', 'with', 'at', 'the', 'same', 'time', 'low', 'groupvelocity', 'inherent', 'immunity', 'to', 'backscattering', 'at', 'discontinuities', 'and', 'immunity', 'to', 'losses', 'these', 'theoretical', 'findings', 'may', 'open', 'exciting', 'research', 'directions', 'and', 'stimulate', 'further', 'investigations', 'of', 'nonhermitian', 'topological', 'waveguides', 'to', 'realize', 'robust', 'wave', 'propagation', 'in', 'practical', 'scenarios']]
|
[-0.1886839170434184, 0.19216241363953795, -0.05609555522012228, 0.01511756127304532, -0.1070995834007364, -0.16388953206360857, 0.0522890188051603, 0.4187008703472039, -0.27631187687138087, -0.24529197687186258, 0.024280007819596657, -0.2936519466372842, -0.23098536296693792, 0.19081411414209085, -0.018519477498841422, 0.09856688843857002, 0.0028727677559232437, -0.09005865444579952, -0.0720327999483191, -0.1521425386769643, 0.29569447225476536, 0.040468018582747504, 0.33589028711888314, 0.0773674868049929, 0.04275877097879962, 0.004830889664913361, 0.042334691555416915, -0.021733063437324555, -0.12715105575697283, 0.09417641145462588, 0.28231403996058974, -0.007247631966992352, 0.23297822784438643, -0.4880963755243948, -0.26075031518979225, 0.046632949671320444, 0.17298841800746262, 0.14621193999306142, -0.08172614521846966, -0.3310579432099196, 0.06320133352197298, -0.10413387043110897, -0.20051727906230168, -0.05674668256128799, -0.00880181664033023, -0.018544561716504503, -0.20074349840042435, 0.018355307314609517, 0.04745081315258507, 0.05046526302120546, -0.019882474213063373, -0.025926596787219834, -0.0007965824596390042, 0.04875584569829651, 0.017136181915324247, -0.042124433445641936, 0.0952238060878536, -0.1379410454551178, -0.1689931262685578, 0.3735815968682096, -0.034468847013353184, -0.18268385046091729, 0.21720442910829418, -0.13621314280199404, -0.05961485933297114, 0.14495080616728892, 0.22044342671752493, 0.062452293758824294, -0.1108493598297809, 0.05027560061170192, 0.018427471226690917, 0.11661038899119955, 0.09217292817331033, 0.11820539675997516, 0.25740642056159807, 0.1664804420753576, 0.039827944574247764, 0.15771883450222413, -0.053622551458871605, -0.05686927005894902, -0.2909904921298168, -0.14300409120216837, -0.19951870322302845, 0.04823156943624823, -0.05894860991613598, -0.17970530494423098, 0.4599819935406047, 0.19732582330807366, 0.14062737056990882, -0.01991718230268385, 0.2881107298991067, 0.16641152339026527, 0.022868668197551904, 0.05804595561574262, 0.27825307959120055, 0.1547323604722674, 0.09024521407558223, -0.25008298781420496, -0.015199063924501913, -0.01921082022895961]
|
1,803.0642
|
Exclusive vector meson production at an electron-ion collider
|
Coherent exclusive vector meson electroproduction is a key physics channel at
an electron-ion collider. It probes the gluon structure of nuclei over a wide
range of $Q^2$, and can be used to measure nuclear shadowing and to search for
gluon saturation and/or the colored glass condensate. In this paper, we present
calculations of the kinematic distributions for a variety of exclusive vector
meson final states: the $\rho$, $\phi$, J/$\psi$, $\psi'$ and the $\Upsilon$
states. The cross-sections for light and $c\overline c$ mesons are large, while
$\Upsilon$ states should be produced in moderate numbers at a medium energy EIC
(the proposed U.S. designs) and in large numbers at the LHeC. We investigate
the acceptances for these states, as a function of detector rapidity coverage.
A large-acceptance detector is needed to cover the full range photon-nucleon
collision energies produced at an EIC; a forward detector is required to
observe vector mesons from the most energetic photon interactions, and thereby
probe gluons at the lowest possible Bjorken-$x$ values.
|
nucl-ex hep-ph nucl-th
|
coherent exclusive vector meson electroproduction is a key physics channel at an electronion collider it probes the gluon structure of nuclei over a wide range of q2 and can be used to measure nuclear shadowing and to search for gluon saturation andor the colored glass condensate in this paper we present calculations of the kinematic distributions for a variety of exclusive vector meson final states the rho phi jpsi psi and the upsilon states the crosssections for light and coverline c mesons are large while upsilon states should be produced in moderate numbers at a medium energy eic the proposed us designs and in large numbers at the lhec we investigate the acceptances for these states as a function of detector rapidity coverage a largeacceptance detector is needed to cover the full range photonnucleon collision energies produced at an eic a forward detector is required to observe vector mesons from the most energetic photon interactions and thereby probe gluons at the lowest possible bjorkenx values
|
[['coherent', 'exclusive', 'vector', 'meson', 'electroproduction', 'is', 'a', 'key', 'physics', 'channel', 'at', 'an', 'electronion', 'collider', 'it', 'probes', 'the', 'gluon', 'structure', 'of', 'nuclei', 'over', 'a', 'wide', 'range', 'of', 'q2', 'and', 'can', 'be', 'used', 'to', 'measure', 'nuclear', 'shadowing', 'and', 'to', 'search', 'for', 'gluon', 'saturation', 'andor', 'the', 'colored', 'glass', 'condensate', 'in', 'this', 'paper', 'we', 'present', 'calculations', 'of', 'the', 'kinematic', 'distributions', 'for', 'a', 'variety', 'of', 'exclusive', 'vector', 'meson', 'final', 'states', 'the', 'rho', 'phi', 'jpsi', 'psi', 'and', 'the', 'upsilon', 'states', 'the', 'crosssections', 'for', 'light', 'and', 'coverline', 'c', 'mesons', 'are', 'large', 'while', 'upsilon', 'states', 'should', 'be', 'produced', 'in', 'moderate', 'numbers', 'at', 'a', 'medium', 'energy', 'eic', 'the', 'proposed', 'us', 'designs', 'and', 'in', 'large', 'numbers', 'at', 'the', 'lhec', 'we', 'investigate', 'the', 'acceptances', 'for', 'these', 'states', 'as', 'a', 'function', 'of', 'detector', 'rapidity', 'coverage', 'a', 'largeacceptance', 'detector', 'is', 'needed', 'to', 'cover', 'the', 'full', 'range', 'photonnucleon', 'collision', 'energies', 'produced', 'at', 'an', 'eic', 'a', 'forward', 'detector', 'is', 'required', 'to', 'observe', 'vector', 'mesons', 'from', 'the', 'most', 'energetic', 'photon', 'interactions', 'and', 'thereby', 'probe', 'gluons', 'at', 'the', 'lowest', 'possible', 'bjorkenx', 'values']]
|
[-0.07141078332100402, 0.2621838523739963, -0.14456268927879687, 0.1490791461388157, -0.006687631999904459, -0.10593861653892832, 0.020925173107675756, 0.35747629774339273, -0.2092012637104331, -0.23751690077284973, -0.051922323659175276, -0.31943390811934613, 0.07232862258414653, 0.13984707181737052, 0.08657549298791722, 0.12899075555765055, 0.09615351419444337, 0.0008986131203445522, -0.018768887418308153, -0.17141456501135094, 0.31767051448255323, 0.06941495506149349, 0.20612631233507825, 0.17876571274334283, 0.09340488194403324, 0.08697535239696277, -0.001371949160238728, -0.03815985722185084, -0.11213986509564249, 0.0427517683146465, 0.31962557608600367, 0.09750586472818572, 0.16545917517505587, -0.33891624906735324, -0.11996423350929311, 0.12750182341163357, 0.1340371193732911, 0.09425764501969697, -0.017348743526434358, -0.27129236092847403, 0.1047619690582382, -0.2371183572957913, -0.13920851312013285, -0.08798741523977228, 0.025682450399846967, -0.021035282730449443, -0.3511874193921826, -0.0002783400613363042, -0.08357131145259535, 0.019874576220569328, -0.02265212385576557, -0.21666454585889974, -0.016461202156532444, 0.0202819163530049, 0.04133837801037413, 0.12187035325279628, 0.18183063429526308, -0.22385413472533622, -0.12419624998742207, 0.3643987985214952, -0.01205228419805115, -0.1726973069295513, 0.1788597017064493, -0.23893223933762672, -0.10551375511356376, 0.19471649589637915, 0.28439406452684624, 0.0908888678341596, -0.1544411001229574, 0.06744313282595778, -0.029594602819645044, 0.164819605624529, 0.0881060858429974, 0.12856086248560158, 0.2035779224112489, 0.19754604257530337, 0.0019255184459104908, 0.08113382308123013, -0.13793202937919308, -0.03844581863059747, -0.405730053869951, -0.12752954620077755, -0.10120207063119971, 0.058034663533114574, -0.04933113294713566, -0.0568260277085232, 0.3779220179513548, 0.037461587946921955, 0.2666354260770745, -0.015339503356848251, 0.30766224470553977, 0.08659106094996924, 0.06777668669625807, 0.07888236162561402, 0.2767266085879369, 0.20186964067009588, 0.1645309641823229, -0.229909728073769, 0.029819111823753425, -0.002230655561398828]
|
1,803.06421
|
Uncertainties in permittivities computed from molecular dynamics
simulations and temperature correction of dielectric properties of condensed
polar systems
|
A robust, simple and fast procedure for the calculation of uncertainties in
relative static dielectric permittivity ($\varepsilon_s$) computed via
molecular dynamics (MD) is proposed. It arises as a direct application of well
founded statistical methods for auto-correlated variables. Also, in order to
deal with the lack of experimental data about $\varepsilon_s$ and relaxation
times ($\tau$) at different temperatures, a method for their prediction is
suggested. It requires one experimental value and at least two MD simulations.
In the case of relaxation times, a theoretical justification is provided.
|
physics.chem-ph
|
a robust simple and fast procedure for the calculation of uncertainties in relative static dielectric permittivity varepsilon_s computed via molecular dynamics md is proposed it arises as a direct application of well founded statistical methods for autocorrelated variables also in order to deal with the lack of experimental data about varepsilon_s and relaxation times tau at different temperatures a method for their prediction is suggested it requires one experimental value and at least two md simulations in the case of relaxation times a theoretical justification is provided
|
[['a', 'robust', 'simple', 'and', 'fast', 'procedure', 'for', 'the', 'calculation', 'of', 'uncertainties', 'in', 'relative', 'static', 'dielectric', 'permittivity', 'varepsilon_s', 'computed', 'via', 'molecular', 'dynamics', 'md', 'is', 'proposed', 'it', 'arises', 'as', 'a', 'direct', 'application', 'of', 'well', 'founded', 'statistical', 'methods', 'for', 'autocorrelated', 'variables', 'also', 'in', 'order', 'to', 'deal', 'with', 'the', 'lack', 'of', 'experimental', 'data', 'about', 'varepsilon_s', 'and', 'relaxation', 'times', 'tau', 'at', 'different', 'temperatures', 'a', 'method', 'for', 'their', 'prediction', 'is', 'suggested', 'it', 'requires', 'one', 'experimental', 'value', 'and', 'at', 'least', 'two', 'md', 'simulations', 'in', 'the', 'case', 'of', 'relaxation', 'times', 'a', 'theoretical', 'justification', 'is', 'provided']]
|
[-0.06964292693026793, 0.05828337310331649, -0.08996917684455456, 0.06236676824006156, -0.04107063250541259, -0.12552150472698884, 0.04553993292495437, 0.4062017420756406, -0.23622783793714539, -0.2969619265768206, 0.11562957394809259, -0.2505494596479439, -0.10156530355392344, 0.23000070097288866, 0.010156829728364902, 0.0848854648099206, 0.05872775576794627, 0.006524110348739971, -0.07928621025499084, -0.18441757787789764, 0.20412405674484954, 0.0709909712521081, 0.25308580086405935, 0.06940976563498549, 0.11591651981787478, -0.011361729024491948, -0.036224187488250174, 0.048123700752982806, -0.11071938407960637, 0.08453503186311359, 0.25363494336990444, 0.08594673585103846, 0.26121118501492446, -0.4198696705587636, -0.20674578981452632, 0.044213607650378656, 0.08703364822050107, 0.1256815393498146, -0.027780781799777485, -0.22400897987261842, 0.08531924988539226, -0.12631979960702017, -0.12406153555145893, -0.11926310463144776, 0.05008302670207688, -0.031062708557422818, -0.3211120819009241, 0.14500146582100443, 0.01367385314428582, 0.08096539072863672, -0.059235438353906586, -0.16682281348875713, 0.045181679536706244, 0.08500618969448896, 0.10078907143806332, 0.041961038586865555, 0.13551922176225945, -0.07375820168433175, -0.11576110165801713, 0.41165132722121545, -0.047725901161534606, -0.1831718278492148, 0.22893079995156276, -0.1136943581995779, -0.12154250706535304, 0.1591406476325302, 0.12149056667480725, 0.13462102883655963, -0.14611640548461985, 0.040727800660868355, 0.013702065437689594, 0.1745160268325273, 0.026285827684419595, -0.007889198219596312, 0.1558498327390173, 0.2202816124384602, 0.02330683222061944, 0.0894788983010355, -0.07124736638547018, -0.13065714507909684, -0.28344988529623927, -0.1330991392345007, -0.22407857989678268, 0.046393410013667466, -0.10584283615619709, -0.126684272447708, 0.36171332474840784, 0.1366329457418158, 0.1992305694040896, 0.06900215752679727, 0.3422598935149867, 0.10884668615288047, 0.025235981019427894, 0.050786550242410994, 0.21340963252199194, 0.1526887590472383, 0.09248422274644348, -0.24474346016844115, 0.08811502828765874, 0.016516453918369336]
|
1,803.06422
|
A New Result on the Complexity of Heuristic Estimates for the A*
Algorithm
|
Relaxed models are abstract problem descriptions generated by ignoring
constraints that are present in base-level problems. They play an important
role in planning and search algorithms, as it has been shown that the length of
an optimal solution to a relaxed model yields a monotone heuristic for an A?
search of a base-level problem. Optimal solutions to a relaxed model may be
computed algorithmically or by search in a further relaxed model, leading to a
search that explores a hierarchy of relaxed models. In this paper, we review
the traditional definition of problem relaxation and show that searching in the
abstraction hierarchy created by problem relaxation will not reduce the
computational effort required to find optimal solutions to the base- level
problem, unless the relaxed problem found in the hierarchy can be transformed
by some optimization (e.g., subproblem factoring). Specifically, we prove that
any A* search of the base-level using a heuristic h2 will largely dominate an
A* search of the base-level using a heuristic h1, if h1 must be computed by an
A* search of the relaxed model using h2.
|
cs.AI
|
relaxed models are abstract problem descriptions generated by ignoring constraints that are present in baselevel problems they play an important role in planning and search algorithms as it has been shown that the length of an optimal solution to a relaxed model yields a monotone heuristic for an a search of a baselevel problem optimal solutions to a relaxed model may be computed algorithmically or by search in a further relaxed model leading to a search that explores a hierarchy of relaxed models in this paper we review the traditional definition of problem relaxation and show that searching in the abstraction hierarchy created by problem relaxation will not reduce the computational effort required to find optimal solutions to the base level problem unless the relaxed problem found in the hierarchy can be transformed by some optimization eg subproblem factoring specifically we prove that any a search of the baselevel using a heuristic h2 will largely dominate an a search of the baselevel using a heuristic h1 if h1 must be computed by an a search of the relaxed model using h2
|
[['relaxed', 'models', 'are', 'abstract', 'problem', 'descriptions', 'generated', 'by', 'ignoring', 'constraints', 'that', 'are', 'present', 'in', 'baselevel', 'problems', 'they', 'play', 'an', 'important', 'role', 'in', 'planning', 'and', 'search', 'algorithms', 'as', 'it', 'has', 'been', 'shown', 'that', 'the', 'length', 'of', 'an', 'optimal', 'solution', 'to', 'a', 'relaxed', 'model', 'yields', 'a', 'monotone', 'heuristic', 'for', 'an', 'a', 'search', 'of', 'a', 'baselevel', 'problem', 'optimal', 'solutions', 'to', 'a', 'relaxed', 'model', 'may', 'be', 'computed', 'algorithmically', 'or', 'by', 'search', 'in', 'a', 'further', 'relaxed', 'model', 'leading', 'to', 'a', 'search', 'that', 'explores', 'a', 'hierarchy', 'of', 'relaxed', 'models', 'in', 'this', 'paper', 'we', 'review', 'the', 'traditional', 'definition', 'of', 'problem', 'relaxation', 'and', 'show', 'that', 'searching', 'in', 'the', 'abstraction', 'hierarchy', 'created', 'by', 'problem', 'relaxation', 'will', 'not', 'reduce', 'the', 'computational', 'effort', 'required', 'to', 'find', 'optimal', 'solutions', 'to', 'the', 'base', 'level', 'problem', 'unless', 'the', 'relaxed', 'problem', 'found', 'in', 'the', 'hierarchy', 'can', 'be', 'transformed', 'by', 'some', 'optimization', 'eg', 'subproblem', 'factoring', 'specifically', 'we', 'prove', 'that', 'any', 'a', 'search', 'of', 'the', 'baselevel', 'using', 'a', 'heuristic', 'h2', 'will', 'largely', 'dominate', 'an', 'a', 'search', 'of', 'the', 'baselevel', 'using', 'a', 'heuristic', 'h1', 'if', 'h1', 'must', 'be', 'computed', 'by', 'an', 'a', 'search', 'of', 'the', 'relaxed', 'model', 'using', 'h2']]
|
[-0.09246612913348295, 0.060684231316779476, -0.11345953460350551, 0.12341843274465726, -0.08020717071019401, -0.12422849313813926, 0.06533850971750853, 0.35568189202133793, -0.3432332817362158, -0.3469654414339701, 0.14876310784403152, -0.20629138603178754, -0.1423572882925011, 0.17210614040895308, -0.0233598864837987, 0.049090079952916386, 0.09611774911815867, 0.006602698597460162, -0.08785387083890626, -0.2587713908805455, 0.2663410616915117, 0.07167365778628634, 0.21142706182883095, 0.018454785287658072, 0.08599258087786399, -0.025563275392645794, -0.020820001644488856, 0.08927822791204597, -0.12582079298735258, 0.13777862244944258, 0.2733161138267805, 0.2030789337213568, 0.3311523743570674, -0.4236628948530769, -0.18385379465981205, 0.16487997946926283, 0.19462424366584097, 0.11638236361252174, -0.08879624175818544, -0.2535619622312527, 0.126046241026948, -0.12230699397983719, -0.07226221236202207, -0.05739886972227376, -0.020096040215055094, -0.025448994700750592, -0.2877872278759493, 0.032800011161858864, 0.07325204102404786, -0.04444187731116763, -0.10248577420905912, -0.10838033306767433, 0.016381375049112253, 0.05450618446120241, 0.01865791804954739, 0.06454882738698217, 0.08917755156611376, -0.14367613705127238, -0.16751518932451592, 0.4112455867519036, -0.041729480722785324, -0.254301436834593, 0.14908252468651664, -0.014763891910465218, -0.1641058228570371, 0.13543875036421565, 0.18941768055887204, 0.15977421911653306, -0.18393812419136585, 0.10206576688884042, -0.09004018827758277, 0.21087194936998313, 0.04326955965869334, -0.02601986570613078, 0.17367637903913238, 0.1959596526222458, 0.15697127900302452, 0.15767753231583564, -0.0073453607047512135, -0.07883035373817408, -0.2618793684073328, -0.12347609960623292, -0.1302356883633923, 0.008328080801431537, -0.05380740940029918, -0.1302263487954637, 0.33423069293111646, 0.14746517151946623, 0.1951938397868521, 0.08398080746018076, 0.2683808947218716, 0.16246203282649901, 0.07348676094301662, 0.09312174858998774, 0.21943004038239552, 0.028557287892506802, 0.06770436398978268, -0.21399039397458675, 0.08087578715077338, 0.10711187259577092]
|
1,803.06423
|
Relativistic Viscous Radiation Hydrodynamic Simulations of Geometrically
Thin Disks: I. Thermal and Other Instabilities
|
We present results from two-dimensional, general relativistic, viscous,
radiation hydrodynamic numerical simulations of Shakura-Sunyaev thin disks
accreting onto stellar mass Schwarzschild black holes. We consider cases on
both the gas- and radiation-pressure-dominated branches of the thermal
equilibrium curve, with mass accretion rates spanning the range from $\dot{M} =
0.01 L_\mathrm{Edd}/c^2$ to $10 L_\mathrm{Edd}/c^2$. The simulations directly
test the stability of this standard disk model on the different branches. We
find clear evidence of thermal instability for all radiation-pressure-dominated
disks, resulting universally in the vertical collapse of the disks, which in
some cases then settle onto the stable, gas-pressure-dominated branch. Although
these results are consistent with decades-old theoretical predictions, they
appear to be in conflict with available observational data from black hole
X-ray binaries. We also find evidence for a radiation-pressure-driven
instability that breaks the unstable disks up into alternating rings of high
and low surface density on a timescale comparable to the thermal collapse.
Since radiation is included self-consistently in the simulations, we are able
to calculate lightcurves and power density spectra (PDS). For the most part, we
measure radiative efficiencies (ratio of luminosity to mass accretion rate)
close to 6%, as expected for a non-rotating black hole. The PDS appear as
broken power laws, with a break typically around 100 Hz. There is no evidence
of significant excess power at any frequencies, i.e. no quasi-periodic
oscillations are observed.
|
astro-ph.HE
|
we present results from twodimensional general relativistic viscous radiation hydrodynamic numerical simulations of shakurasunyaev thin disks accreting onto stellar mass schwarzschild black holes we consider cases on both the gas and radiationpressuredominated branches of the thermal equilibrium curve with mass accretion rates spanning the range from dotm 001 l_mathrmeddc2 to 10 l_mathrmeddc2 the simulations directly test the stability of this standard disk model on the different branches we find clear evidence of thermal instability for all radiationpressuredominated disks resulting universally in the vertical collapse of the disks which in some cases then settle onto the stable gaspressuredominated branch although these results are consistent with decadesold theoretical predictions they appear to be in conflict with available observational data from black hole xray binaries we also find evidence for a radiationpressuredriven instability that breaks the unstable disks up into alternating rings of high and low surface density on a timescale comparable to the thermal collapse since radiation is included selfconsistently in the simulations we are able to calculate lightcurves and power density spectra pds for the most part we measure radiative efficiencies ratio of luminosity to mass accretion rate close to 6 as expected for a nonrotating black hole the pds appear as broken power laws with a break typically around 100 hz there is no evidence of significant excess power at any frequencies ie no quasiperiodic oscillations are observed
|
[['we', 'present', 'results', 'from', 'twodimensional', 'general', 'relativistic', 'viscous', 'radiation', 'hydrodynamic', 'numerical', 'simulations', 'of', 'shakurasunyaev', 'thin', 'disks', 'accreting', 'onto', 'stellar', 'mass', 'schwarzschild', 'black', 'holes', 'we', 'consider', 'cases', 'on', 'both', 'the', 'gas', 'and', 'radiationpressuredominated', 'branches', 'of', 'the', 'thermal', 'equilibrium', 'curve', 'with', 'mass', 'accretion', 'rates', 'spanning', 'the', 'range', 'from', 'dotm', '001', 'l_mathrmeddc2', 'to', '10', 'l_mathrmeddc2', 'the', 'simulations', 'directly', 'test', 'the', 'stability', 'of', 'this', 'standard', 'disk', 'model', 'on', 'the', 'different', 'branches', 'we', 'find', 'clear', 'evidence', 'of', 'thermal', 'instability', 'for', 'all', 'radiationpressuredominated', 'disks', 'resulting', 'universally', 'in', 'the', 'vertical', 'collapse', 'of', 'the', 'disks', 'which', 'in', 'some', 'cases', 'then', 'settle', 'onto', 'the', 'stable', 'gaspressuredominated', 'branch', 'although', 'these', 'results', 'are', 'consistent', 'with', 'decadesold', 'theoretical', 'predictions', 'they', 'appear', 'to', 'be', 'in', 'conflict', 'with', 'available', 'observational', 'data', 'from', 'black', 'hole', 'xray', 'binaries', 'we', 'also', 'find', 'evidence', 'for', 'a', 'radiationpressuredriven', 'instability', 'that', 'breaks', 'the', 'unstable', 'disks', 'up', 'into', 'alternating', 'rings', 'of', 'high', 'and', 'low', 'surface', 'density', 'on', 'a', 'timescale', 'comparable', 'to', 'the', 'thermal', 'collapse', 'since', 'radiation', 'is', 'included', 'selfconsistently', 'in', 'the', 'simulations', 'we', 'are', 'able', 'to', 'calculate', 'lightcurves', 'and', 'power', 'density', 'spectra', 'pds', 'for', 'the', 'most', 'part', 'we', 'measure', 'radiative', 'efficiencies', 'ratio', 'of', 'luminosity', 'to', 'mass', 'accretion', 'rate', 'close', 'to', '6', 'as', 'expected', 'for', 'a', 'nonrotating', 'black', 'hole', 'the', 'pds', 'appear', 'as', 'broken', 'power', 'laws', 'with', 'a', 'break', 'typically', 'around', '100', 'hz', 'there', 'is', 'no', 'evidence', 'of', 'significant', 'excess', 'power', 'at', 'any', 'frequencies', 'ie', 'no', 'quasiperiodic', 'oscillations', 'are', 'observed']]
|
[-0.10052889940123881, 0.12292684333819269, -0.046276672689689206, 0.12098331059652702, -0.04579440966161973, -0.08771189251519014, 0.034588450604052474, 0.37390520072962463, -0.18858636443029814, -0.3287854106000633, 0.10914778843752843, -0.29894744207571566, -0.015905603609847285, 0.2420504940251317, -0.011189553420475593, 0.034059384682697896, 0.05175597480842349, -0.05889848673271131, -0.07892895849221757, -0.17804757792572698, 0.3110126675584609, 0.08511022890637736, 0.187722335831495, -0.01408029187252267, 0.026384867844686934, -0.10152081734772804, -0.0021684900095142357, 0.0176263540681441, -0.22549219504361268, -0.006921875103071859, 0.21920509699451846, 0.07181599391088615, 0.193927325423708, -0.43556815888567835, -0.22463759614682172, 0.0773657417889124, 0.16130938444469964, 0.09372324251056756, -0.10160356948362866, -0.14909879520712668, 0.08931440196465701, -0.2105952377258017, -0.14442417857678097, -0.00882798145459223, 0.05451280163164226, -0.0033852985026768152, -0.24000184406836483, 0.15846769895805848, 0.07415279143992647, -0.0006911464208588663, -0.13331551450630238, -0.06979912681354672, -0.11370290541893646, 0.04818091650268854, 0.10387492127226154, 0.028111880092955795, 0.18575457670000603, -0.11103370656420072, -0.06659246025920178, 0.382250008605981, -0.08276780222880498, -0.09174891850556684, 0.2498699191924745, -0.2431953907305523, -0.11231407389432126, 0.19264694317697292, 0.1734115494805619, 0.12279557323276964, -0.09375521397698193, 0.008376587036377916, -0.026767856175640384, 0.20926218050783418, 0.08463209921667204, 0.01742948017075897, 0.3794927127263715, 0.11510036316900144, -0.020405179817864126, 0.1136704191902397, -0.1395622937599701, -0.09309231599512617, -0.25586045797568113, -0.08358067500845949, -0.11924340134791503, 0.0938811373033569, -0.13040756367887957, -0.1610536226823481, 0.3203605858946994, 0.1154117572865144, 0.21218596355561004, 0.07304052068116308, 0.30407606894482947, 0.12749502067021465, 0.06854541041832664, 0.16592652661791812, 0.3417923681844135, 0.1387844977074146, 0.08264092904567333, -0.2415570126654811, -0.004356958930673226, -0.0064077280169204534]
|
1,803.06424
|
Thermal entanglement in the mixed-spin Ising-Heisenberg double sawtooth
frustrated ladder
|
The entanglement between spin-1/2 interstitial Heisenberg dimers in the mixed
spin-(1,1/2) Ising-XXZ double sawtooth ladder is investigated at low
temperature. Here, we consider a cyclic four-spin exchange interaction in
square plaquette of each block, and investigate the effects of this amazing
interaction on the bipartite entanglement between spin-1/2 interstitial dimers.
Interestingly, we observe a remarkable difference in concurrence behavior with
respect to the cyclic four-spin exchange interaction and magnetic field. Also,
the critical points at which the concurrence vanishes are changed versus
alteration of the anisotropic parameter of the interstitial Heisenberg dimers.
|
cond-mat.stat-mech
|
the entanglement between spin12 interstitial heisenberg dimers in the mixed spin112 isingxxz double sawtooth ladder is investigated at low temperature here we consider a cyclic fourspin exchange interaction in square plaquette of each block and investigate the effects of this amazing interaction on the bipartite entanglement between spin12 interstitial dimers interestingly we observe a remarkable difference in concurrence behavior with respect to the cyclic fourspin exchange interaction and magnetic field also the critical points at which the concurrence vanishes are changed versus alteration of the anisotropic parameter of the interstitial heisenberg dimers
|
[['the', 'entanglement', 'between', 'spin12', 'interstitial', 'heisenberg', 'dimers', 'in', 'the', 'mixed', 'spin112', 'isingxxz', 'double', 'sawtooth', 'ladder', 'is', 'investigated', 'at', 'low', 'temperature', 'here', 'we', 'consider', 'a', 'cyclic', 'fourspin', 'exchange', 'interaction', 'in', 'square', 'plaquette', 'of', 'each', 'block', 'and', 'investigate', 'the', 'effects', 'of', 'this', 'amazing', 'interaction', 'on', 'the', 'bipartite', 'entanglement', 'between', 'spin12', 'interstitial', 'dimers', 'interestingly', 'we', 'observe', 'a', 'remarkable', 'difference', 'in', 'concurrence', 'behavior', 'with', 'respect', 'to', 'the', 'cyclic', 'fourspin', 'exchange', 'interaction', 'and', 'magnetic', 'field', 'also', 'the', 'critical', 'points', 'at', 'which', 'the', 'concurrence', 'vanishes', 'are', 'changed', 'versus', 'alteration', 'of', 'the', 'anisotropic', 'parameter', 'of', 'the', 'interstitial', 'heisenberg', 'dimers']]
|
[-0.22553293130603497, 0.28182943119748455, 0.03217282938851934, 0.06590544061391088, 0.0323497292170625, -0.21192171491439576, 0.03546754969030862, 0.39806514180710784, -0.26034953062544053, -0.21993734887307612, -0.017899526828525424, -0.36270628276321554, -0.11083283397854994, 0.07030959507328985, 0.10899412512030128, -0.07600542142450728, 0.0015691337074436572, 0.10303563240956029, -0.127423489431986, -0.27042507708487706, 0.2709835656493416, 0.03742380813776475, 0.28769548190251476, 0.12576815033706068, 0.06777192994132233, 0.08507574063665031, 0.15002018240098233, 0.007395204313544799, -0.2088620430263488, 0.04866007804040513, 0.1956018175943704, -0.12843980774303657, 0.140948790396341, -0.4104394217467178, -0.1337441370680766, 0.12203236497209771, 0.15853443750403012, 0.15477730538670742, -0.02030383300101992, -0.2837471774090891, -0.08479758452006575, -0.21668693912974762, -0.104094144290961, -0.046666859487152615, 0.009106060964531143, 0.020063923120766918, -0.2513185783245717, 0.16585876365190969, 0.0517573112004396, 0.15455645205372054, -0.06255972475754908, -0.09235248036439651, -0.08060521715189047, 0.09335157304556797, 0.012977312117784648, 0.027350767115738406, 0.09558397751686204, -0.10041777466540225, -0.14768121981709872, 0.3408050851734436, -0.06493093462094017, -0.137896387098843, 0.1313963437227674, -0.16632834592145745, -0.10854347078028419, 0.07576294597137072, 0.083176090518701, 0.009524009484068854, -0.12333854560679554, 0.10912245293508496, -0.01297127572900575, 0.17118333196887522, 0.04287585902088524, 0.03574630629230777, 0.21176563456411596, 0.12035450728043266, 0.0733082834833666, 0.27259881401677494, -0.07643250755348202, -0.21389300275452272, -0.2225276344941686, -0.19185596294498639, -0.2417075644682526, 0.032625993737146135, -0.18506493405204863, -0.21187867693420823, 0.39647847761238075, 0.09915629530872178, 0.14638093587152823, -0.081728921381949, 0.15579209637666203, 0.03899442462210098, 0.062208626793859446, 0.025385014404056837, 0.24616980351224219, 0.19600971624174196, 0.061454967003437166, -0.3714279144971996, 0.054976467430368874, 0.07240341953001916]
|
1,803.06425
|
Reinforcement Learning of Artificial Microswimmers
|
The behavior of living systems is based on the experience they gained through
their interactions with the environment [1]. This experience is stored in the
complex biochemical networks of cells and organisms to provide a relationship
between a sensed situation and what to do in this situation [2-4]. An
implementation of such processes in artificial systems has been achieved
through different machine learning algorithms [5, 6]. However, for microscopic
systems such as artificial microswimmers which mimic propulsion as one of the
basic functionalities of living systems [7, 8] such adaptive behavior and
learning processes have not been implemented so far. Here we introduce machine
learning algorithms to the motion of artificial microswimmers with a hybrid
approach. We employ self-thermophoretic artificial microswimmers in a real
world environment [9, 10] which are controlled by a real-time microscopy system
to introduce reinforcement learning [11-13]. We demonstrate the solution of a
standard problem of reinforcement learning - the navigation in a grid world.
Due to the size of the microswimmer, noise introduced by Brownian motion if
found to contribute considerably to both the learning process and the actions
within a learned behavior. We extend the learning process to multiple swimmers
and sharing of information. Our work represents a first step towards the
integration of learning strategies into microsystems and provides a platform
for the study of the emergence of adaptive and collective behavior.
|
cond-mat.soft physics.bio-ph
|
the behavior of living systems is based on the experience they gained through their interactions with the environment 1 this experience is stored in the complex biochemical networks of cells and organisms to provide a relationship between a sensed situation and what to do in this situation 24 an implementation of such processes in artificial systems has been achieved through different machine learning algorithms 5 6 however for microscopic systems such as artificial microswimmers which mimic propulsion as one of the basic functionalities of living systems 7 8 such adaptive behavior and learning processes have not been implemented so far here we introduce machine learning algorithms to the motion of artificial microswimmers with a hybrid approach we employ selfthermophoretic artificial microswimmers in a real world environment 9 10 which are controlled by a realtime microscopy system to introduce reinforcement learning 1113 we demonstrate the solution of a standard problem of reinforcement learning the navigation in a grid world due to the size of the microswimmer noise introduced by brownian motion if found to contribute considerably to both the learning process and the actions within a learned behavior we extend the learning process to multiple swimmers and sharing of information our work represents a first step towards the integration of learning strategies into microsystems and provides a platform for the study of the emergence of adaptive and collective behavior
|
[['the', 'behavior', 'of', 'living', 'systems', 'is', 'based', 'on', 'the', 'experience', 'they', 'gained', 'through', 'their', 'interactions', 'with', 'the', 'environment', '1', 'this', 'experience', 'is', 'stored', 'in', 'the', 'complex', 'biochemical', 'networks', 'of', 'cells', 'and', 'organisms', 'to', 'provide', 'a', 'relationship', 'between', 'a', 'sensed', 'situation', 'and', 'what', 'to', 'do', 'in', 'this', 'situation', '24', 'an', 'implementation', 'of', 'such', 'processes', 'in', 'artificial', 'systems', 'has', 'been', 'achieved', 'through', 'different', 'machine', 'learning', 'algorithms', '5', '6', 'however', 'for', 'microscopic', 'systems', 'such', 'as', 'artificial', 'microswimmers', 'which', 'mimic', 'propulsion', 'as', 'one', 'of', 'the', 'basic', 'functionalities', 'of', 'living', 'systems', '7', '8', 'such', 'adaptive', 'behavior', 'and', 'learning', 'processes', 'have', 'not', 'been', 'implemented', 'so', 'far', 'here', 'we', 'introduce', 'machine', 'learning', 'algorithms', 'to', 'the', 'motion', 'of', 'artificial', 'microswimmers', 'with', 'a', 'hybrid', 'approach', 'we', 'employ', 'selfthermophoretic', 'artificial', 'microswimmers', 'in', 'a', 'real', 'world', 'environment', '9', '10', 'which', 'are', 'controlled', 'by', 'a', 'realtime', 'microscopy', 'system', 'to', 'introduce', 'reinforcement', 'learning', '1113', 'we', 'demonstrate', 'the', 'solution', 'of', 'a', 'standard', 'problem', 'of', 'reinforcement', 'learning', 'the', 'navigation', 'in', 'a', 'grid', 'world', 'due', 'to', 'the', 'size', 'of', 'the', 'microswimmer', 'noise', 'introduced', 'by', 'brownian', 'motion', 'if', 'found', 'to', 'contribute', 'considerably', 'to', 'both', 'the', 'learning', 'process', 'and', 'the', 'actions', 'within', 'a', 'learned', 'behavior', 'we', 'extend', 'the', 'learning', 'process', 'to', 'multiple', 'swimmers', 'and', 'sharing', 'of', 'information', 'our', 'work', 'represents', 'a', 'first', 'step', 'towards', 'the', 'integration', 'of', 'learning', 'strategies', 'into', 'microsystems', 'and', 'provides', 'a', 'platform', 'for', 'the', 'study', 'of', 'the', 'emergence', 'of', 'adaptive', 'and', 'collective', 'behavior']]
|
[-0.09983040834366783, 0.11348889535248109, -0.10100293494704578, 0.022322251840132635, -0.06503517432179351, -0.14222186252819416, 0.035323271624044424, 0.4072107306562594, -0.28155489993540134, -0.343570844364652, 0.08347917919196927, -0.2505007342144125, -0.23488581437506767, 0.18929863484993797, -0.09829569809671779, 0.06438662438747772, 0.039500408476661676, 0.033580960174699394, 0.026579278924206008, -0.22925944855161798, 0.2838290622160413, 0.029774969082637506, 0.2921080779292444, -0.0008232844278376882, 0.15949582739113646, -0.004343780237639791, 0.015207902970416102, 0.004423560957744357, -0.08005668675641853, 0.17077357160893683, 0.2719562689585012, 0.15714456803075116, 0.3371726805692957, -0.4555060946288219, -0.23657876653966006, 0.10912401113035526, 0.18042455886240374, 0.1145248466558777, -0.07283253922888246, -0.2898942911494852, 0.05386430690975835, -0.17964398323472114, -0.08996747951700233, -0.10189627833451075, 0.010857684714186296, 0.015861321822740138, -0.24711970245211265, -0.014546400266607182, 0.07704087614701315, 0.12726010350584327, -0.06965883675909351, -0.0745682133169894, 0.04639754472361952, 0.18077319189865093, 0.008348993766008742, 0.00011776817915345734, 0.21817079355267374, -0.164689044656831, -0.1892735624279712, 0.40000319514538485, -0.016718302034908324, -0.223042847211206, 0.2538302549066654, -0.07566441461189531, -0.11664345145527076, 0.097138337879175, 0.2555333963238392, 0.10703542050885012, -0.18429755215996688, 0.028767410005465364, 0.026142723292177993, 0.13928218594124533, 0.0005274995374759979, -0.0009137384946322651, 0.17954783764614474, 0.2651459727162446, 0.040496787111713894, 0.11014950948065795, -0.07094090085759726, -0.12733332707550754, -0.19576829034114043, -0.15617711303164847, -0.17414512800458934, 0.04001207915879632, -0.047925470857986145, -0.14192629463371662, 0.3386404144819744, 0.19170263217195935, 0.21464869726735097, 0.060189195484997876, 0.3099293320651047, 0.03862013304883015, 0.09204406985908051, 0.05762603564294556, 0.2358213228969486, 0.06031103673522332, 0.2009029387678984, -0.19931332785472078, 0.06043711615652502, 0.007000439611595895]
|
1,803.06426
|
Entanglement in a fermionic spin chain containing a single mobile boson
under decoherence
|
The concurrence between first and the last sites of a fermionic spin chain
containing a single boson is rigorously investigated at finite low temperature
in the vicinity of a weak homogeneous magnetic field. We consider the boson as
a mobile spin-1 particle through the chain and study concurrence without/under
decoherence and express some interesting phase flip and bit flip reactions of
the pairwise entanglement between first and the last half-spins in the chain.
Our investigations show that the concurrence between two considered half-spins
has different behavior for various positions of the single boson along the
chain. Indeed, we realize that the single boson mobility has an essential role
to probe the pairwise entanglement intensity between two spins located at the
opposite ends of a fermionic chain. Interestingly, the entanglement remains
alive for higher temperatures when the boson is the nearest neighbor of the
first fermion. When the boson is at the middle of chain, it is demonstrated
that the threshold temperature (at which the concurrence vanishes) versus
decoherence rate can be considered as a threshold temperature boundary. These
results pave the way to set and interpret the numerical and analytical
expressions for utilizing quantum information in realistic scenarios such as
quantum state transmission, quantum communication science and quantum
information processing, where the both fermion-fermion and fermion-boson
correlations should be taken in to account.
|
cond-mat.stat-mech quant-ph
|
the concurrence between first and the last sites of a fermionic spin chain containing a single boson is rigorously investigated at finite low temperature in the vicinity of a weak homogeneous magnetic field we consider the boson as a mobile spin1 particle through the chain and study concurrence withoutunder decoherence and express some interesting phase flip and bit flip reactions of the pairwise entanglement between first and the last halfspins in the chain our investigations show that the concurrence between two considered halfspins has different behavior for various positions of the single boson along the chain indeed we realize that the single boson mobility has an essential role to probe the pairwise entanglement intensity between two spins located at the opposite ends of a fermionic chain interestingly the entanglement remains alive for higher temperatures when the boson is the nearest neighbor of the first fermion when the boson is at the middle of chain it is demonstrated that the threshold temperature at which the concurrence vanishes versus decoherence rate can be considered as a threshold temperature boundary these results pave the way to set and interpret the numerical and analytical expressions for utilizing quantum information in realistic scenarios such as quantum state transmission quantum communication science and quantum information processing where the both fermionfermion and fermionboson correlations should be taken in to account
|
[['the', 'concurrence', 'between', 'first', 'and', 'the', 'last', 'sites', 'of', 'a', 'fermionic', 'spin', 'chain', 'containing', 'a', 'single', 'boson', 'is', 'rigorously', 'investigated', 'at', 'finite', 'low', 'temperature', 'in', 'the', 'vicinity', 'of', 'a', 'weak', 'homogeneous', 'magnetic', 'field', 'we', 'consider', 'the', 'boson', 'as', 'a', 'mobile', 'spin1', 'particle', 'through', 'the', 'chain', 'and', 'study', 'concurrence', 'withoutunder', 'decoherence', 'and', 'express', 'some', 'interesting', 'phase', 'flip', 'and', 'bit', 'flip', 'reactions', 'of', 'the', 'pairwise', 'entanglement', 'between', 'first', 'and', 'the', 'last', 'halfspins', 'in', 'the', 'chain', 'our', 'investigations', 'show', 'that', 'the', 'concurrence', 'between', 'two', 'considered', 'halfspins', 'has', 'different', 'behavior', 'for', 'various', 'positions', 'of', 'the', 'single', 'boson', 'along', 'the', 'chain', 'indeed', 'we', 'realize', 'that', 'the', 'single', 'boson', 'mobility', 'has', 'an', 'essential', 'role', 'to', 'probe', 'the', 'pairwise', 'entanglement', 'intensity', 'between', 'two', 'spins', 'located', 'at', 'the', 'opposite', 'ends', 'of', 'a', 'fermionic', 'chain', 'interestingly', 'the', 'entanglement', 'remains', 'alive', 'for', 'higher', 'temperatures', 'when', 'the', 'boson', 'is', 'the', 'nearest', 'neighbor', 'of', 'the', 'first', 'fermion', 'when', 'the', 'boson', 'is', 'at', 'the', 'middle', 'of', 'chain', 'it', 'is', 'demonstrated', 'that', 'the', 'threshold', 'temperature', 'at', 'which', 'the', 'concurrence', 'vanishes', 'versus', 'decoherence', 'rate', 'can', 'be', 'considered', 'as', 'a', 'threshold', 'temperature', 'boundary', 'these', 'results', 'pave', 'the', 'way', 'to', 'set', 'and', 'interpret', 'the', 'numerical', 'and', 'analytical', 'expressions', 'for', 'utilizing', 'quantum', 'information', 'in', 'realistic', 'scenarios', 'such', 'as', 'quantum', 'state', 'transmission', 'quantum', 'communication', 'science', 'and', 'quantum', 'information', 'processing', 'where', 'the', 'both', 'fermionfermion', 'and', 'fermionboson', 'correlations', 'should', 'be', 'taken', 'in', 'to', 'account']]
|
[-0.1547674012982899, 0.23082854467511507, -0.034662785805627566, 0.082303732956617, 0.014202898588484607, -0.19916549215915505, 0.05340955491562643, 0.3695987623084236, -0.2528785434719343, -0.25090421320501344, 0.04750815548027891, -0.2915746654690084, -0.07058634510398046, 0.17845612093606997, 0.061271379368279026, 0.030895685045015032, 0.03375037275029237, 0.1070603863805478, -0.06530930056878542, -0.24194930911773127, 0.2839288565639993, 0.042969190338332845, 0.2846063783744702, 0.10683048197471008, 0.09655204673217996, 0.061311482502197895, 0.07790842646237899, -0.024289707426686544, -0.12967533279188173, 0.04500038704165556, 0.24290993756736284, 0.03585015206392183, 0.22617610303689265, -0.3997352112856534, -0.18886382019132594, 0.11504660398317322, 0.15993549467614004, 0.1708379606459382, -0.04632559386296995, -0.3023677054071077, 0.035895082017255796, -0.17842919922953993, -0.1029242420304768, -0.04285026873673757, 0.008037494187692163, -0.03019227199193493, -0.24873594652341158, 0.0872340478917567, 0.027661550419849787, 0.07256786344019142, 0.0048373150062403295, -0.07435368808921897, -0.05589407176326809, 0.16262236288890267, 0.03203178226668807, 0.018877827307536593, 0.13141122381811174, -0.1373322603244519, -0.14015774112110874, 0.3417877047070982, -0.058248335075027705, -0.16152085969224572, 0.19941981351170857, -0.1575590969637028, -0.1171477712367804, 0.08779245912651154, 0.11733713866261816, 0.06774345533880363, -0.17047860285936883, 0.06956128184859292, -0.0072116548020333925, 0.139992420550075, 0.05254873750848813, 0.09042001987318718, 0.26956415674565276, 0.13955994633913696, 0.059028163790358815, 0.196307112873943, -0.11734052592005396, -0.17774021758295194, -0.3060653096312439, -0.21000487317419234, -0.21179024827758874, 0.04440895045020928, -0.08879287346356143, -0.11348147905087685, 0.38135081107166036, 0.14723764297891526, 0.2141518103958292, 0.008455628262274806, 0.2880785389276859, 0.13036030220128186, 0.040859981713741014, 0.0541844437368684, 0.2432317411688813, 0.1662923061972702, 0.07273597616140169, -0.2755856860957637, 0.04718722207555631, 0.03628122326624286]
|
1,803.06427
|
Nonlinear nano-electromechanical lattices for high-frequency, tunable
stress propagation
|
Active manipulation of mechanical waves at high frequencies opens
opportunities in heat management, radio-frequency (RF) signal processing, and
quantum technologies. Nanoelectromechanical systems (NEMS) are appropriate
platforms for developing these technologies, offering energy transducibility
between different physical domains, for example, converting optical or
electrical signals into mechanical vibrations and viceversa. Existing NEMS
platforms, however, are mostly linear, passive, and not dynamically
controllable. Here, we report the realization of active manipulation of
frequency band dispersion in one-dimensional (1D) nonlinear
nanoelectromechanical lattices (NEML) in the RF domain (10-30 MHz). Our NEML is
comprised of a periodic arrangement of mechanically coupled free-standing
nano-membranes, with circular clamped boundaries. This design forms a flexural
phononic crystals with a well-defined band gaps, 1.8 MHz wide. The application
a DC gate voltage creates voltage-dependent on-site potentials, which can
significantly shift the frequency bands of the device. Dynamic modulation of
the voltage triggers nonlinear effects, which induce the formation of phononic
band gaps in the acoustic branch. These devices could be used in tunable
filters, ultrasonic delay lines and transducers for implantable medical
devices.
|
physics.app-ph
|
active manipulation of mechanical waves at high frequencies opens opportunities in heat management radiofrequency rf signal processing and quantum technologies nanoelectromechanical systems nems are appropriate platforms for developing these technologies offering energy transducibility between different physical domains for example converting optical or electrical signals into mechanical vibrations and viceversa existing nems platforms however are mostly linear passive and not dynamically controllable here we report the realization of active manipulation of frequency band dispersion in onedimensional 1d nonlinear nanoelectromechanical lattices neml in the rf domain 1030 mhz our neml is comprised of a periodic arrangement of mechanically coupled freestanding nanomembranes with circular clamped boundaries this design forms a flexural phononic crystals with a welldefined band gaps 18 mhz wide the application a dc gate voltage creates voltagedependent onsite potentials which can significantly shift the frequency bands of the device dynamic modulation of the voltage triggers nonlinear effects which induce the formation of phononic band gaps in the acoustic branch these devices could be used in tunable filters ultrasonic delay lines and transducers for implantable medical devices
|
[['active', 'manipulation', 'of', 'mechanical', 'waves', 'at', 'high', 'frequencies', 'opens', 'opportunities', 'in', 'heat', 'management', 'radiofrequency', 'rf', 'signal', 'processing', 'and', 'quantum', 'technologies', 'nanoelectromechanical', 'systems', 'nems', 'are', 'appropriate', 'platforms', 'for', 'developing', 'these', 'technologies', 'offering', 'energy', 'transducibility', 'between', 'different', 'physical', 'domains', 'for', 'example', 'converting', 'optical', 'or', 'electrical', 'signals', 'into', 'mechanical', 'vibrations', 'and', 'viceversa', 'existing', 'nems', 'platforms', 'however', 'are', 'mostly', 'linear', 'passive', 'and', 'not', 'dynamically', 'controllable', 'here', 'we', 'report', 'the', 'realization', 'of', 'active', 'manipulation', 'of', 'frequency', 'band', 'dispersion', 'in', 'onedimensional', '1d', 'nonlinear', 'nanoelectromechanical', 'lattices', 'neml', 'in', 'the', 'rf', 'domain', '1030', 'mhz', 'our', 'neml', 'is', 'comprised', 'of', 'a', 'periodic', 'arrangement', 'of', 'mechanically', 'coupled', 'freestanding', 'nanomembranes', 'with', 'circular', 'clamped', 'boundaries', 'this', 'design', 'forms', 'a', 'flexural', 'phononic', 'crystals', 'with', 'a', 'welldefined', 'band', 'gaps', '18', 'mhz', 'wide', 'the', 'application', 'a', 'dc', 'gate', 'voltage', 'creates', 'voltagedependent', 'onsite', 'potentials', 'which', 'can', 'significantly', 'shift', 'the', 'frequency', 'bands', 'of', 'the', 'device', 'dynamic', 'modulation', 'of', 'the', 'voltage', 'triggers', 'nonlinear', 'effects', 'which', 'induce', 'the', 'formation', 'of', 'phononic', 'band', 'gaps', 'in', 'the', 'acoustic', 'branch', 'these', 'devices', 'could', 'be', 'used', 'in', 'tunable', 'filters', 'ultrasonic', 'delay', 'lines', 'and', 'transducers', 'for', 'implantable', 'medical', 'devices']]
|
[-0.2367112363991869, 0.21099035632404023, 0.029066933467875908, -0.08522488769796287, -0.11755195451727093, -0.23024154202146238, 0.08250704038682459, 0.46967727840921386, -0.28783460290727564, -0.2869106138904774, 0.06285049301926805, -0.2634918644190441, -0.14579569884822272, 0.290879659970605, 0.003853342479614671, 0.09279038614680081, 0.023022216029308172, -0.12246793223447491, -0.009865359794402624, -0.08810827333810414, 0.17973131486918603, 0.026145482199607675, 0.3827340620661934, 0.049143972925755175, 0.06710981381353164, -0.020296889207011826, 0.0756271894612393, -0.0445973098739646, -0.0912658063807189, 0.12830334594256657, 0.35441621991285926, -0.06910498476543919, 0.2861047720422882, -0.49408709649862936, -0.2519949323106503, 0.032574466722042755, 0.11985480964866055, 0.14182065019985055, -0.08973438912517998, -0.28136246526873737, 0.027467719950648242, -0.14664688020359812, -0.1036603758109904, -0.053071598477017264, 0.017892600857479454, 0.07441303266285443, -0.20677986268636359, 0.05734383000797311, 0.02523990295594558, 0.10138141129268767, -0.10697416131649312, -0.07791187173448676, -0.021278469973557822, 0.08816995018136113, -0.1053527988037257, -0.06571953736995563, 0.2545555527619801, -0.09740178578067571, -0.13976313951587693, 0.3706142011011929, -0.0289326595510681, -0.14242457358442723, 0.21098738991612093, -0.11128437806186157, -0.017729031424265528, 0.1332336966681692, 0.20671817930523567, 0.02002680903235667, -0.1752326223893676, 0.036694505407615714, 0.10068914291670893, 0.21293619686455417, 0.13594331281654926, 0.14221054307851116, 0.29980609647870105, 0.23157892129004953, 0.06588759027194059, 0.17323422600443442, -0.09111523982286344, 0.03784477774752304, -0.22509889037796393, -0.11879564396668832, -0.17215169155103868, 0.05551091784429953, -0.048219891842711866, -0.21641432546447356, 0.4379622920329661, 0.100660722360264, 0.08782599401270408, -0.05027528320834092, 0.330624048600818, 0.11698607695735666, 0.13403607272207305, 0.021219424246864522, 0.26366061942928015, 0.14513749468578893, 0.15962901597417523, -0.25613865531757385, -0.05181114494764696, -0.06994163024585781]
|
1,803.06428
|
Intrinsic spin-orbit torque in an antiferromagnet with a weakly
noncollinear spin configuration
|
An antiferromagnet is a promising material for spin-orbit torque generation.
Earlier studies of the spin-orbit torque in an antiferromagnet are limited to
collinear spin configurations. We calculate the spin-orbit torque in an
antiferromagnet whose spin ordering is weakly noncollinear. Such
noncollinearity may be induced spontaneously during the magnetization dynamics
even when the equilibrium spin configuration is perfectly collinear. It is
shown that deviation from perfect collinearity can modify properties of the
spin-orbit torque since noncollinearity generates extra Berry phase
contributions to the spin-orbit torque, which are forbidden for collinear spin
configurations. In sufficiently clean antiferromagnets, this modification can
be significant. We estimate this effect to be of relevance for fast
antiferromagnetic domain wall motion.
|
cond-mat.mes-hall
|
an antiferromagnet is a promising material for spinorbit torque generation earlier studies of the spinorbit torque in an antiferromagnet are limited to collinear spin configurations we calculate the spinorbit torque in an antiferromagnet whose spin ordering is weakly noncollinear such noncollinearity may be induced spontaneously during the magnetization dynamics even when the equilibrium spin configuration is perfectly collinear it is shown that deviation from perfect collinearity can modify properties of the spinorbit torque since noncollinearity generates extra berry phase contributions to the spinorbit torque which are forbidden for collinear spin configurations in sufficiently clean antiferromagnets this modification can be significant we estimate this effect to be of relevance for fast antiferromagnetic domain wall motion
|
[['an', 'antiferromagnet', 'is', 'a', 'promising', 'material', 'for', 'spinorbit', 'torque', 'generation', 'earlier', 'studies', 'of', 'the', 'spinorbit', 'torque', 'in', 'an', 'antiferromagnet', 'are', 'limited', 'to', 'collinear', 'spin', 'configurations', 'we', 'calculate', 'the', 'spinorbit', 'torque', 'in', 'an', 'antiferromagnet', 'whose', 'spin', 'ordering', 'is', 'weakly', 'noncollinear', 'such', 'noncollinearity', 'may', 'be', 'induced', 'spontaneously', 'during', 'the', 'magnetization', 'dynamics', 'even', 'when', 'the', 'equilibrium', 'spin', 'configuration', 'is', 'perfectly', 'collinear', 'it', 'is', 'shown', 'that', 'deviation', 'from', 'perfect', 'collinearity', 'can', 'modify', 'properties', 'of', 'the', 'spinorbit', 'torque', 'since', 'noncollinearity', 'generates', 'extra', 'berry', 'phase', 'contributions', 'to', 'the', 'spinorbit', 'torque', 'which', 'are', 'forbidden', 'for', 'collinear', 'spin', 'configurations', 'in', 'sufficiently', 'clean', 'antiferromagnets', 'this', 'modification', 'can', 'be', 'significant', 'we', 'estimate', 'this', 'effect', 'to', 'be', 'of', 'relevance', 'for', 'fast', 'antiferromagnetic', 'domain', 'wall', 'motion']]
|
[-0.25275185490496815, 0.2496929289848419, -0.040979187604726144, 0.03807534067942597, -0.16202928310488923, -0.11168787132932298, -0.02663812460888406, 0.4378249492136794, -0.3101557224474259, -0.26679880786360355, 0.004076530961850821, -0.29122277721762657, -0.10064853233614071, 0.17732203675009178, 0.036171323719859254, -0.021973744415669915, -0.008798460811049793, -0.03866239590161856, -0.07350125827973611, -0.17205568360217863, 0.24405982872479381, -0.019590439405619053, 0.2786592878360432, 0.08194322608158058, 0.05078839394672398, 0.03757122803577467, 0.21594683908660317, 0.009536246475028364, -0.10864036122834557, -0.014778729185069861, 0.2207988274953606, -0.14410053459894762, 0.11187947814744946, -0.46917948420894773, -0.15961736977956126, 0.04287888677055506, 0.12099101083974044, 0.2479493292324294, -0.03997616186582794, -0.27941399587220267, 0.02990878852116957, -0.2163606592895169, -0.13786331803196827, -0.1878975615754985, 0.018216566558469805, -0.05834429461116854, -0.3486056297061671, 0.07374899213921213, 0.17833140671759712, 0.07272266115066023, -0.05707637511863651, -0.10778280490551863, -0.1265669274123451, 0.0607511636000964, 0.10690774145258362, 0.121249356774793, 0.13579308452736177, -0.13481997052746775, -0.16905511361383424, 0.348635255767588, -0.04851401812527655, -0.21071273516536804, 0.09621761344258853, -0.19472215653054023, -0.08487672105905388, 0.17130911011624625, 0.12500054316887257, 0.1237042732600617, -0.16513569090832453, 0.08373266390704534, 0.002825586639932896, 0.15964028260184518, 0.0054868988349641625, 0.05004434186450549, 0.34531199934345, 0.15672434428339138, 0.08692276889556333, 0.17660369537464393, -0.14318820166712007, -0.12111559605609887, -0.19624385942721315, -0.09888259279786756, -0.3081672454024093, 0.09737509609151043, -0.08381245487467631, -0.15806202328301305, 0.33083304504071476, 0.18972910842306814, 0.13183038999538935, -0.10754874899979322, 0.3136561109210577, 0.0933815009663241, 0.07801511217104762, 0.043410899661881684, 0.329937703400981, 0.17967590030993483, 0.06192447078054804, -0.33336171563183725, 0.10534858524292838, -0.006948638484270002]
|
1,803.06429
|
How to automate a kinematic mount using a 3D printed Arduino-based
system
|
We demonstrate a simple, flexible and cost-effective system to automatize
most of the kinematic mounts available nowadays on the market. It combines 3D
printed components, an Arduino board, stepper motors, and simple electronics.
The system developed can control independently and simultaneously up to ten
stepper motors using commands sent through the serial port, and it is suitable
for applications where optical realignment using flat mirrors is required on a
periodic basis.
|
physics.ins-det
|
we demonstrate a simple flexible and costeffective system to automatize most of the kinematic mounts available nowadays on the market it combines 3d printed components an arduino board stepper motors and simple electronics the system developed can control independently and simultaneously up to ten stepper motors using commands sent through the serial port and it is suitable for applications where optical realignment using flat mirrors is required on a periodic basis
|
[['we', 'demonstrate', 'a', 'simple', 'flexible', 'and', 'costeffective', 'system', 'to', 'automatize', 'most', 'of', 'the', 'kinematic', 'mounts', 'available', 'nowadays', 'on', 'the', 'market', 'it', 'combines', '3d', 'printed', 'components', 'an', 'arduino', 'board', 'stepper', 'motors', 'and', 'simple', 'electronics', 'the', 'system', 'developed', 'can', 'control', 'independently', 'and', 'simultaneously', 'up', 'to', 'ten', 'stepper', 'motors', 'using', 'commands', 'sent', 'through', 'the', 'serial', 'port', 'and', 'it', 'is', 'suitable', 'for', 'applications', 'where', 'optical', 'realignment', 'using', 'flat', 'mirrors', 'is', 'required', 'on', 'a', 'periodic', 'basis']]
|
[-0.12193133970591384, 0.07490827145344335, -0.05189652361867713, -0.0476563517364975, -0.12384702551873847, -0.24531291198300223, 0.010577674974805452, 0.4575852126827542, -0.2602089738135528, -0.30229337128292455, 0.1298013972495617, -0.24230208931963, -0.15374214284804086, 0.3277066425538399, -0.11088648779501378, 0.10372489835479966, 0.06806359999537678, -0.017854087258046363, 0.061195177199896165, -0.19075068078515395, 0.1787531781141502, 0.06627171400370417, 0.322255437485349, -0.046326475034297356, 0.23128026304110674, 0.049447413107616384, -0.010334421447674992, -0.010301811751765264, -0.08327197675711252, 0.14516970803502055, 0.22768320770881756, 0.10861041311594383, 0.2293394092916393, -0.5058155938668151, -0.11225744805128222, -0.003144275567586153, 0.11688533954282987, 0.06901937088286372, -0.02320915425497986, -0.27680707782585645, 0.07364877679345894, -0.1952626621350646, -0.09442565268771329, -0.11453897180691572, 0.015196670686275187, 0.04818584402682076, -0.24969158736123165, -0.09495108063057275, -0.04906719437026432, 0.09258886661485467, -0.0031153957234879193, -0.03843049822755578, -0.015751786564450553, 0.19598342936066254, -0.09393805170326795, 0.007574608388789733, 0.2493500225508297, -0.07478812916702787, -0.10597361727866908, 0.3917052547388356, -0.007678190357720768, -0.20074538130995254, 0.22012132645623994, -0.027573521104706844, -0.08117388708280845, 0.12665582800441436, 0.17961015362574548, 0.08426793307905465, -0.2151913247399137, 0.025992416366803606, 0.015650699006944473, 0.24134375291719087, 0.0701375979484177, -0.05447504002417267, 0.1997696395281335, 0.21534796699251926, 0.07121701097404043, 0.14462084372029443, -0.0795650756262033, -0.04742347833398782, -0.25493872249630134, -0.17876605844964655, -0.1686510986543562, -0.001172976837244252, -0.022062339130493904, -0.13624042742164202, 0.390179397459601, 0.1201708279175005, 0.10019008790365827, 0.004862593375408734, 0.4246305709403061, 0.043796899390708605, 0.13930025772834329, 0.07939272805471236, 0.19065365817358482, 0.06117785170766145, 0.14237645795752465, -0.16344582631816745, 0.030772664590778067, 0.0102282217244657]
|
1,803.0643
|
The effects of metallicity and cooling physics on fragmentation:
implications on direct-collapse black hole formation
|
A promising supermassive black hole seed formation channel is that of direct
collapse from primordial gas clouds. We perform a suite of 3D hydrodynamics
simulations of an isolated turbulent gas cloud to investigate conditions
conducive to forming massive black hole seeds via direct collapse, probing the
impact of cloud metallicity, gas temperature floor and cooling physics on cloud
fragmentation. We find there is no threshold in metallicity which produces a
sharp drop in fragmentation. When molecular cooling is not present, metallicity
has little effect on fragmentation. When molecular cooling is present,
fragmentation is suppressed by at most $\sim 25\%$, with the greatest
suppression seen at metallicities below $2\%$ solar. A gas temperature floor
$\sim 10^{4}$K produces the largest drop in fragmentation of any parameter
choice, reducing fragmentation by $\sim 60\%$. At metallicities below $2\%$
solar or at temperatures $\sim 10^{3}$K we see a reduction in fragmentation
$\sim 20-25 \%$. For a cloud of metallicity $2\%$ solar above and a temperature
below $10^3$K, the detailed choices of temperature floor, metallicity, and
cooling physics have little impact on fragmentation.
|
astro-ph.GA
|
a promising supermassive black hole seed formation channel is that of direct collapse from primordial gas clouds we perform a suite of 3d hydrodynamics simulations of an isolated turbulent gas cloud to investigate conditions conducive to forming massive black hole seeds via direct collapse probing the impact of cloud metallicity gas temperature floor and cooling physics on cloud fragmentation we find there is no threshold in metallicity which produces a sharp drop in fragmentation when molecular cooling is not present metallicity has little effect on fragmentation when molecular cooling is present fragmentation is suppressed by at most sim 25 with the greatest suppression seen at metallicities below 2 solar a gas temperature floor sim 104k produces the largest drop in fragmentation of any parameter choice reducing fragmentation by sim 60 at metallicities below 2 solar or at temperatures sim 103k we see a reduction in fragmentation sim 2025 for a cloud of metallicity 2 solar above and a temperature below 103k the detailed choices of temperature floor metallicity and cooling physics have little impact on fragmentation
|
[['a', 'promising', 'supermassive', 'black', 'hole', 'seed', 'formation', 'channel', 'is', 'that', 'of', 'direct', 'collapse', 'from', 'primordial', 'gas', 'clouds', 'we', 'perform', 'a', 'suite', 'of', '3d', 'hydrodynamics', 'simulations', 'of', 'an', 'isolated', 'turbulent', 'gas', 'cloud', 'to', 'investigate', 'conditions', 'conducive', 'to', 'forming', 'massive', 'black', 'hole', 'seeds', 'via', 'direct', 'collapse', 'probing', 'the', 'impact', 'of', 'cloud', 'metallicity', 'gas', 'temperature', 'floor', 'and', 'cooling', 'physics', 'on', 'cloud', 'fragmentation', 'we', 'find', 'there', 'is', 'no', 'threshold', 'in', 'metallicity', 'which', 'produces', 'a', 'sharp', 'drop', 'in', 'fragmentation', 'when', 'molecular', 'cooling', 'is', 'not', 'present', 'metallicity', 'has', 'little', 'effect', 'on', 'fragmentation', 'when', 'molecular', 'cooling', 'is', 'present', 'fragmentation', 'is', 'suppressed', 'by', 'at', 'most', 'sim', '25', 'with', 'the', 'greatest', 'suppression', 'seen', 'at', 'metallicities', 'below', '2', 'solar', 'a', 'gas', 'temperature', 'floor', 'sim', '104k', 'produces', 'the', 'largest', 'drop', 'in', 'fragmentation', 'of', 'any', 'parameter', 'choice', 'reducing', 'fragmentation', 'by', 'sim', '60', 'at', 'metallicities', 'below', '2', 'solar', 'or', 'at', 'temperatures', 'sim', '103k', 'we', 'see', 'a', 'reduction', 'in', 'fragmentation', 'sim', '2025', 'for', 'a', 'cloud', 'of', 'metallicity', '2', 'solar', 'above', 'and', 'a', 'temperature', 'below', '103k', 'the', 'detailed', 'choices', 'of', 'temperature', 'floor', 'metallicity', 'and', 'cooling', 'physics', 'have', 'little', 'impact', 'on', 'fragmentation']]
|
[-0.08903291280545421, 0.21736975083604193, -0.03537539927691052, 0.09148969170696959, -0.005070530416560359, -0.05260887111944612, 0.0773454072795258, 0.35648713482607325, -0.1522297174014966, -0.34241581997908227, 0.04230803254970603, -0.2645635592264377, 0.03473353824665537, 0.19524587066023907, 0.022040555052543907, -0.02745368556522656, 0.020986780627440152, -0.06529391808759431, -0.08570459004973104, -0.2265424771837636, 0.3358553596639963, 0.14486001778145277, 0.1666683080680245, 0.10434181651428596, 0.03923220848082565, -0.15949204974723133, 0.0156953670821994, -0.043834043555596676, -0.21809740282155457, -0.08454261598605874, 0.19410689146025106, 0.10896670783139681, 0.2690647271863947, -0.38980963367926463, -0.2466785652134356, 0.04717989210489164, 0.19745421173601327, 0.08609258218348259, -0.15946126917432676, -0.15252433942144059, 0.07558968669565563, -0.22454331338469108, -0.1704556049318688, 0.04774384772860107, 0.04716273763386363, -0.037591974543333476, -0.27652736272482964, 0.1702747160253983, 0.01630149976567323, 0.09484673838332211, -0.038915740959716706, -0.11505679251091681, -0.07529088795788332, 0.030456088391722667, -0.020825782327764584, 0.10356917083514748, 0.30084569546372886, -0.16193235148305327, 0.03253889841091057, 0.40655857146008534, -0.06873845862256447, -0.013197431317662862, 0.24875383189150438, -0.2470268697599584, -0.1335360928853995, 0.21557157032128255, 0.17926559448030524, 0.08847297256579623, -0.10820873066421138, -0.0026289807815994045, 0.007742272341023305, 0.2255285554142161, 0.13221547173187984, 0.0181093675260358, 0.3486831189683554, 0.21646904568875802, 0.04128692725531768, 0.069464383630971, -0.1629281502047723, -0.09184385081806051, -0.21993458533622537, -0.10796667494948699, -0.10434600091750988, 0.1325848249300014, -0.13836252385433248, -0.14048291054363785, 0.24906580511544069, 0.15321196819951927, 0.24210437540684573, 0.02742944018642778, 0.3426813542080874, 0.08021894930491479, 0.10980998639768752, 0.13346523571949961, 0.270498571496732, 0.13631950586303984, 0.11732294407159895, -0.25536141746785934, 0.0939501228091434, 0.012121075749746524]
|
1,803.06431
|
Is Quintessence an Indication of a Time-Varying Gravitational Constant?
|
A model is presented where the quintessence parameter, w, is related to a
time-varying gravitational constant. Assuming a present value of w equals -.98,
we predict a current variation of G dot/G = -.06 H0. H0 is Hubbles parameter, G
is Newtons constant and G dot is the derivative of G with respect to time.
Thus, G has a cosmic origin, is decreasing with respect to cosmological time,
and is proportional to H0, as originally proposed by the Dirac-Jordan
hypothesis. Within our model, we can explain the cosmological constant
fine-tuning problem, the discrepancy between the present very weak value of the
cosmological constant, and the much greater vacuum energy found in earlier
epochs. To formalize and solidify our model, we give two distinct functions of
G(a), the cosmic scale parameter. We treat inverse G as an order parameter,
which vanishes at high energies; at low temperatures, it reaches a saturation
value, a value we are close to today. Our first function for inverse G is
motivated by a charging capacitor; the second treats inverse G by analogy to a
magnetic response. Both functions, even though very distinct, give a remarkably
similar tracking behavior for w(a). Interestingly, both functions indicate the
onset of G formation at a temperature of approximately 7 *1021 degrees Kelvin,
in contrast to the concordance model. At the temperature of formation, we find
that G has increased to roughly 4*1020 times its present value. For most of
cosmic evolution, however, our variable G model gives results similar to the
predictions of the concordance model, except in the very early universe, as we
shall demonstrate. Within our framework, the weakening of G to its current
value G0 is speculated as the true cause for the observed unanticipated
acceleration of the universe.
|
gr-qc
|
a model is presented where the quintessence parameter w is related to a timevarying gravitational constant assuming a present value of w equals 98 we predict a current variation of g dotg 06 h0 h0 is hubbles parameter g is newtons constant and g dot is the derivative of g with respect to time thus g has a cosmic origin is decreasing with respect to cosmological time and is proportional to h0 as originally proposed by the diracjordan hypothesis within our model we can explain the cosmological constant finetuning problem the discrepancy between the present very weak value of the cosmological constant and the much greater vacuum energy found in earlier epochs to formalize and solidify our model we give two distinct functions of ga the cosmic scale parameter we treat inverse g as an order parameter which vanishes at high energies at low temperatures it reaches a saturation value a value we are close to today our first function for inverse g is motivated by a charging capacitor the second treats inverse g by analogy to a magnetic response both functions even though very distinct give a remarkably similar tracking behavior for wa interestingly both functions indicate the onset of g formation at a temperature of approximately 7 1021 degrees kelvin in contrast to the concordance model at the temperature of formation we find that g has increased to roughly 41020 times its present value for most of cosmic evolution however our variable g model gives results similar to the predictions of the concordance model except in the very early universe as we shall demonstrate within our framework the weakening of g to its current value g0 is speculated as the true cause for the observed unanticipated acceleration of the universe
|
[['a', 'model', 'is', 'presented', 'where', 'the', 'quintessence', 'parameter', 'w', 'is', 'related', 'to', 'a', 'timevarying', 'gravitational', 'constant', 'assuming', 'a', 'present', 'value', 'of', 'w', 'equals', '98', 'we', 'predict', 'a', 'current', 'variation', 'of', 'g', 'dotg', '06', 'h0', 'h0', 'is', 'hubbles', 'parameter', 'g', 'is', 'newtons', 'constant', 'and', 'g', 'dot', 'is', 'the', 'derivative', 'of', 'g', 'with', 'respect', 'to', 'time', 'thus', 'g', 'has', 'a', 'cosmic', 'origin', 'is', 'decreasing', 'with', 'respect', 'to', 'cosmological', 'time', 'and', 'is', 'proportional', 'to', 'h0', 'as', 'originally', 'proposed', 'by', 'the', 'diracjordan', 'hypothesis', 'within', 'our', 'model', 'we', 'can', 'explain', 'the', 'cosmological', 'constant', 'finetuning', 'problem', 'the', 'discrepancy', 'between', 'the', 'present', 'very', 'weak', 'value', 'of', 'the', 'cosmological', 'constant', 'and', 'the', 'much', 'greater', 'vacuum', 'energy', 'found', 'in', 'earlier', 'epochs', 'to', 'formalize', 'and', 'solidify', 'our', 'model', 'we', 'give', 'two', 'distinct', 'functions', 'of', 'ga', 'the', 'cosmic', 'scale', 'parameter', 'we', 'treat', 'inverse', 'g', 'as', 'an', 'order', 'parameter', 'which', 'vanishes', 'at', 'high', 'energies', 'at', 'low', 'temperatures', 'it', 'reaches', 'a', 'saturation', 'value', 'a', 'value', 'we', 'are', 'close', 'to', 'today', 'our', 'first', 'function', 'for', 'inverse', 'g', 'is', 'motivated', 'by', 'a', 'charging', 'capacitor', 'the', 'second', 'treats', 'inverse', 'g', 'by', 'analogy', 'to', 'a', 'magnetic', 'response', 'both', 'functions', 'even', 'though', 'very', 'distinct', 'give', 'a', 'remarkably', 'similar', 'tracking', 'behavior', 'for', 'wa', 'interestingly', 'both', 'functions', 'indicate', 'the', 'onset', 'of', 'g', 'formation', 'at', 'a', 'temperature', 'of', 'approximately', '7', '1021', 'degrees', 'kelvin', 'in', 'contrast', 'to', 'the', 'concordance', 'model', 'at', 'the', 'temperature', 'of', 'formation', 'we', 'find', 'that', 'g', 'has', 'increased', 'to', 'roughly', '41020', 'times', 'its', 'present', 'value', 'for', 'most', 'of', 'cosmic', 'evolution', 'however', 'our', 'variable', 'g', 'model', 'gives', 'results', 'similar', 'to', 'the', 'predictions', 'of', 'the', 'concordance', 'model', 'except', 'in', 'the', 'very', 'early', 'universe', 'as', 'we', 'shall', 'demonstrate', 'within', 'our', 'framework', 'the', 'weakening', 'of', 'g', 'to', 'its', 'current', 'value', 'g0', 'is', 'speculated', 'as', 'the', 'true', 'cause', 'for', 'the', 'observed', 'unanticipated', 'acceleration', 'of', 'the', 'universe']]
|
[-0.13411791919257743, 0.1366550721443851, -0.06515199207753596, 0.06150816160348593, -0.08068243622431, -0.1240076054542892, 0.02267011817339872, 0.3511608926790584, -0.24792918252808288, -0.3537780930503364, 0.06091341541566377, -0.2566015355703437, -0.06450682708631907, 0.16805797439753445, -0.018509928116261242, -0.018019965227334872, 0.008518256408664882, 0.0739393404169293, -0.05234710331302123, -0.23469436394940435, 0.2885003040410271, 0.09736607422495318, 0.22368438376267394, 0.05264199885485303, 0.1081973289810057, -0.06969895135675855, 0.010755505812869654, 0.03461997471293723, -0.17373874800170622, 0.02602840722434517, 0.21425173111272738, 0.06821619764152799, 0.27839660790870513, -0.342167190113665, -0.2162117385289462, 0.1415135697697696, 0.09325044713690366, 0.08615891112749148, -0.019390380699099506, -0.21377377481243007, 0.10584027653670457, -0.1478914100928008, -0.1406438058174993, -0.004895177657021485, 0.08146037489073384, -0.040805570586405285, -0.2757533953598736, 0.13500391574307663, -0.006100370166215188, -0.011583710218942965, -0.06261656791511026, -0.13134138508262977, -0.00825330093775034, 0.06492163371806804, 0.08425231914986502, 0.11141878577538117, 0.11979137434979382, -0.139896589909805, -0.0707341073868201, 0.4039288792611961, -0.15217480571465278, -0.10717999156167622, 0.1693976111302018, -0.19094603376373445, -0.11263206199770057, 0.11113708973910112, 0.09894006674360369, 0.10796643730374597, -0.08934524739833222, 0.10699609067313824, -0.009886928289949484, 0.17702891008129912, 0.046452062647338456, -0.030523501303657722, 0.217727867825216, 0.16426780587222262, 0.08035027809581909, 0.10918307117997794, -0.0643886219873333, -0.020261883368508416, -0.34312043192754804, -0.1222399965111051, -0.17690227673424222, 0.07406055908554147, -0.13155434858930037, -0.14480288694948726, 0.3818378642431854, 0.15952735079798042, 0.24599477545521461, 0.07946300310836032, 0.24074146141621358, 0.13246246501647377, 0.05189037319957647, 0.08378588536648636, 0.2679732001108146, 0.14848032779191522, 0.07453216980707503, -0.2293379764542459, 0.07561799528915755, 0.040754699521086776]
|
1,803.06432
|
Pseudo-differential operators with nonlinear quantizing functions
|
In this paper we develop the calculus of pseudo-differential operators
corresponding to the quantizations of the form $$
Au(x)=\int_{\mathbb{R}^n}\int_{\mathbb{R}^n}e^{i(x-y)\cdot\xi}\sigma(x+\tau(y-x),\xi)u(y)dyd\xi,
$$ where $\tau:\mathbb{R}^n\to\mathbb{R}^n$ is a general function. In
particular, for the linear choices $\tau(x)=0$, $\tau(x)=x$, and
$\tau(x)=\frac{x}{2}$ this covers the well-known Kohn-Nirenberg,
anti-Kohn-Nirenberg, and Weyl quantizations, respectively. Quantizations of
such type appear naturally in the analysis on nilpotent Lie groups for
polynomial functions $\tau$ and here we investigate the corresponding calculus
in the model case of $\mathbb{R}^n$. We also give examples of nonlinear $\tau$
appearing on the polarised and non-polarised Heisenberg groups, inspired by the
recent joint work with Marius Mantoiu.
|
math.FA math.AP math.OA
|
in this paper we develop the calculus of pseudodifferential operators corresponding to the quantizations of the form auxint_mathbbrnint_mathbbrneixycdotxisigmaxtauyxxiuydydxi where taumathbbrntomathbbrn is a general function in particular for the linear choices taux0 tauxx and tauxfracx2 this covers the wellknown kohnnirenberg antikohnnirenberg and weyl quantizations respectively quantizations of such type appear naturally in the analysis on nilpotent lie groups for polynomial functions tau and here we investigate the corresponding calculus in the model case of mathbbrn we also give examples of nonlinear tau appearing on the polarised and nonpolarised heisenberg groups inspired by the recent joint work with marius mantoiu
|
[['in', 'this', 'paper', 'we', 'develop', 'the', 'calculus', 'of', 'pseudodifferential', 'operators', 'corresponding', 'to', 'the', 'quantizations', 'of', 'the', 'form', 'auxint_mathbbrnint_mathbbrneixycdotxisigmaxtauyxxiuydydxi', 'where', 'taumathbbrntomathbbrn', 'is', 'a', 'general', 'function', 'in', 'particular', 'for', 'the', 'linear', 'choices', 'taux0', 'tauxx', 'and', 'tauxfracx2', 'this', 'covers', 'the', 'wellknown', 'kohnnirenberg', 'antikohnnirenberg', 'and', 'weyl', 'quantizations', 'respectively', 'quantizations', 'of', 'such', 'type', 'appear', 'naturally', 'in', 'the', 'analysis', 'on', 'nilpotent', 'lie', 'groups', 'for', 'polynomial', 'functions', 'tau', 'and', 'here', 'we', 'investigate', 'the', 'corresponding', 'calculus', 'in', 'the', 'model', 'case', 'of', 'mathbbrn', 'we', 'also', 'give', 'examples', 'of', 'nonlinear', 'tau', 'appearing', 'on', 'the', 'polarised', 'and', 'nonpolarised', 'heisenberg', 'groups', 'inspired', 'by', 'the', 'recent', 'joint', 'work', 'with', 'marius', 'mantoiu']]
|
[-0.10757603970072839, 0.07325864493917755, -0.044314899259125407, 0.059601033684726724, -0.09422497047141762, -0.0847974062907388, -0.007506116352843768, 0.33398577867774293, -0.30014591167539195, -0.2204254296274208, 0.10004068817690258, -0.23172105316315655, -0.19913443590959776, 0.20375845352258615, -0.11135732457446663, 0.005675296268790313, 0.015985684061888605, 0.06509566201787928, -0.1317012139049399, -0.22137557155371684, 0.4281887196753498, -0.025210902849009828, 0.19693327220865403, 0.009943703629845835, 0.09339690202361216, 0.048901156259133764, -0.06553928909377883, -0.03992073160960623, -0.16782544802307434, 0.1439958942836434, 0.2630337876389208, 0.036583143941875874, 0.207638663737073, -0.3817071863095802, -0.13841654680689555, 0.14168383015582905, 0.13477074856991353, 0.04612710591122184, -0.008194022146357305, -0.30775541613516194, 0.05773536070330959, -0.1568043816596796, -0.10765657956590471, -0.05906858455652938, 0.03892808296697457, 0.017820500702921137, -0.2455813768370401, 0.07885807892529081, 0.09782541521986865, 0.07089725353390626, -0.10205626826854827, -0.11366665455510805, 0.0220814486105076, 0.054221281331315964, 0.013873127386550945, 0.0003487860414442485, 0.05151081769524709, -0.06726342835969737, -0.16252368301882045, 0.3628357097648246, -0.06088298131995227, -0.25717398650822754, 0.14404959114187438, -0.18153786557503854, -0.20643873302438093, 0.012827425030991435, 0.15806809364332128, 0.1712178737330048, -0.07622438765373891, 0.19030413802703033, -0.082637645370003, 0.05344027801639522, 0.07370893747302824, 0.03349496662406676, 0.10218061736035768, 0.12301144756075581, 0.04718709641905582, 0.12329016857193378, -0.02346893518899932, -0.08423300678133154, -0.3949362202990375, -0.17343015654984376, -0.09042496111689378, 0.08007979101587451, -0.0733850396171202, -0.1508379800842427, 0.4568888496521496, 0.0947611008355718, 0.20058702944737414, 0.11348774005739909, 0.20097542236275648, 0.1455501380133564, 0.057578497525790466, 0.04168698037772075, 0.17789390795540228, 0.19100596874689116, 0.06843159897961533, -0.1652335844232964, -0.03644693033888673, 0.11956677654677111]
|
1,803.06433
|
Thermal conduction of one-dimensional carbon nanomaterials and
nanoarchitectures
|
This review summarizes the current studies of the thermal transport
properties of one-dimensional (1D) carbon nanomaterials and nanoarchitectures.
Considering different hybridization states of carbon, emphases are laid on a
variety of 1D carbon nanomaterials, such as diamond nanothreads, penta-graphene
nanotubes, supernanotubes, and carbyne. Based on experimental measurements and
simulation/calculation results, we discuss the dependence of the thermal
conductivity of these 1D carbon nanomaterials on a wide range of factors,
including the size effect, temperature influence, strain effect, and others.
This review provides an overall understanding of the thermal transport
properties of 1D carbon nanomaterials and nanoarchitectures, which paves the
way for effective thermal management at nanoscale.
|
cond-mat.mtrl-sci physics.app-ph
|
this review summarizes the current studies of the thermal transport properties of onedimensional 1d carbon nanomaterials and nanoarchitectures considering different hybridization states of carbon emphases are laid on a variety of 1d carbon nanomaterials such as diamond nanothreads pentagraphene nanotubes supernanotubes and carbyne based on experimental measurements and simulationcalculation results we discuss the dependence of the thermal conductivity of these 1d carbon nanomaterials on a wide range of factors including the size effect temperature influence strain effect and others this review provides an overall understanding of the thermal transport properties of 1d carbon nanomaterials and nanoarchitectures which paves the way for effective thermal management at nanoscale
|
[['this', 'review', 'summarizes', 'the', 'current', 'studies', 'of', 'the', 'thermal', 'transport', 'properties', 'of', 'onedimensional', '1d', 'carbon', 'nanomaterials', 'and', 'nanoarchitectures', 'considering', 'different', 'hybridization', 'states', 'of', 'carbon', 'emphases', 'are', 'laid', 'on', 'a', 'variety', 'of', '1d', 'carbon', 'nanomaterials', 'such', 'as', 'diamond', 'nanothreads', 'pentagraphene', 'nanotubes', 'supernanotubes', 'and', 'carbyne', 'based', 'on', 'experimental', 'measurements', 'and', 'simulationcalculation', 'results', 'we', 'discuss', 'the', 'dependence', 'of', 'the', 'thermal', 'conductivity', 'of', 'these', '1d', 'carbon', 'nanomaterials', 'on', 'a', 'wide', 'range', 'of', 'factors', 'including', 'the', 'size', 'effect', 'temperature', 'influence', 'strain', 'effect', 'and', 'others', 'this', 'review', 'provides', 'an', 'overall', 'understanding', 'of', 'the', 'thermal', 'transport', 'properties', 'of', '1d', 'carbon', 'nanomaterials', 'and', 'nanoarchitectures', 'which', 'paves', 'the', 'way', 'for', 'effective', 'thermal', 'management', 'at', 'nanoscale']]
|
[-0.10025013201923755, 0.1546169352784021, -0.022753333708701227, -0.07385890622166559, -0.0060359346277367035, -0.10508980427403003, 0.07435512193478644, 0.4319636673362066, -0.2662664487814674, -0.28499537718016654, 0.057696697543948315, -0.30535773866218874, -0.12018560956662092, 0.2302867601885317, 0.030679227504431486, 0.05105866677835225, 0.06806167846438117, -0.1307373451642119, -0.06201958984736568, -0.18139403553504962, 0.2556230265830751, 0.0834735395502111, 0.39504292104035044, 0.17977650459999076, 0.018732603854284838, 0.00700206209708435, 0.012272289206381314, 0.039923978611253776, -0.21863325780185944, 0.15042962937318058, 0.21201922950478128, -0.07084261140195079, 0.19544113645903194, -0.5085208534907836, -0.2921889182468406, 0.0012851210021835868, 0.10840891373496, 0.16108920322641587, -0.08208176101862381, -0.1949404191445165, 0.0026642329578932663, -0.13171306214420697, -0.14463430579389053, -0.07023025021995775, 0.012508370438948847, 0.05110657091539066, -0.1566273316543979, 0.05468552185154225, 0.04729902415196053, 0.10533349000615999, -0.10151572277894817, -0.2332987861815267, -0.07465354067748055, 0.09528290208590288, -0.009020270775251377, -0.09234225232033239, 0.2809008037617717, -0.15392741194451587, -0.10477332731422323, 0.4321711996140388, -0.07344846835789773, -0.09389999284982108, 0.2126776167715434, -0.11563621178412667, -0.12771945663889012, 0.08404493775182906, 0.15883352962555364, 0.10781774286610576, -0.19468319880811927, 0.029359055716038432, -0.005188235874251964, 0.08072291488077518, 0.014657715429516079, 0.15792948515333521, 0.2833957048491217, 0.32057276509630567, -0.014396113567412473, 0.15817422055540822, -0.09045840983610386, -0.01858131154977645, -0.1785564681944939, -0.2168478987251337, -0.140285573375877, 0.11799146387224588, -0.08773345415535844, -0.2371831570008698, 0.4374863074447673, 0.15793309367906588, 0.13764386478130922, -0.040030676206067886, 0.2273487577084989, 0.05587065288608965, 0.05072974913771479, -0.03765958788482329, 0.232153722917876, 0.19080573811124152, 0.11719238932486266, -0.2880501081593908, 0.07659479393959583, -0.0276655462042142]
|
1,803.06434
|
Probable Decay Modes at Limits of Nuclear Stability of the Superheavy
Nuclei
|
The modes of decay for the even-even isotopes of superheavy nuclei of Z = 118
and 120 with neutron number $160 \leq N \leq 204$ are investigated in the
framework of the axially deformed relativistic mean field model. The asymmetry
parameter $\eta$ and the relative neutron-proton asymmetry of the surface to
the center ($R_{\eta}$) are estimated from the ground state density
distributions of the nucleus. We analyze the resulting asymmetry parameter
$\eta$ and the relative neutron-proton asymmetry $R_{\eta}$ of the density play
a crucial role in the mode(s) of decay and its half-life. Moreover, the excess
neutron richness on the surface facets a superheavy nucleus for $\beta^-$
decays.
|
nucl-th
|
the modes of decay for the eveneven isotopes of superheavy nuclei of z 118 and 120 with neutron number 160 leq n leq 204 are investigated in the framework of the axially deformed relativistic mean field model the asymmetry parameter eta and the relative neutronproton asymmetry of the surface to the center r_eta are estimated from the ground state density distributions of the nucleus we analyze the resulting asymmetry parameter eta and the relative neutronproton asymmetry r_eta of the density play a crucial role in the modes of decay and its halflife moreover the excess neutron richness on the surface facets a superheavy nucleus for beta decays
|
[['the', 'modes', 'of', 'decay', 'for', 'the', 'eveneven', 'isotopes', 'of', 'superheavy', 'nuclei', 'of', 'z', '118', 'and', '120', 'with', 'neutron', 'number', '160', 'leq', 'n', 'leq', '204', 'are', 'investigated', 'in', 'the', 'framework', 'of', 'the', 'axially', 'deformed', 'relativistic', 'mean', 'field', 'model', 'the', 'asymmetry', 'parameter', 'eta', 'and', 'the', 'relative', 'neutronproton', 'asymmetry', 'of', 'the', 'surface', 'to', 'the', 'center', 'r_eta', 'are', 'estimated', 'from', 'the', 'ground', 'state', 'density', 'distributions', 'of', 'the', 'nucleus', 'we', 'analyze', 'the', 'resulting', 'asymmetry', 'parameter', 'eta', 'and', 'the', 'relative', 'neutronproton', 'asymmetry', 'r_eta', 'of', 'the', 'density', 'play', 'a', 'crucial', 'role', 'in', 'the', 'modes', 'of', 'decay', 'and', 'its', 'halflife', 'moreover', 'the', 'excess', 'neutron', 'richness', 'on', 'the', 'surface', 'facets', 'a', 'superheavy', 'nucleus', 'for', 'beta', 'decays']]
|
[-0.07205647153553561, 0.23305835129223137, -0.07954285291206335, 0.11657574586570263, 0.06203193268869246, -0.07221125258202447, 0.0669389075575675, 0.316605709876134, -0.20825068367575514, -0.3020261593628675, -0.03930353407452109, -0.3351352232221131, 0.05066823766775708, 0.12486377080427004, 0.08630438867921585, 0.02443260890072664, -0.0004267343885709192, 0.0652315282201934, -0.07421789925423598, -0.1475958193806827, 0.30288305413848327, 0.07951768069902312, 0.25459705354759, 0.054508784714739154, 0.0300602345231259, 0.009096388000054894, 0.014764295373042332, -0.07208930513012075, -0.16529951632353607, 0.08700120824641575, 0.18512381403924566, 0.05671948427334428, 0.15130575948664657, -0.35702516153350333, -0.10887667580255281, 0.1623930668580198, 0.19062076262677105, 0.08315517538375108, -0.08339352772253453, -0.3108105006253469, 0.07358279894758886, -0.2227142158173303, -0.18337693815685321, -0.019300914256372183, 0.11129425806929052, 0.05533508660498066, -0.26727500147562666, 0.13277466515096548, -0.02683989248588294, 0.05572296558035033, -0.1110938064434139, -0.24699670207799873, -0.07912788161938296, 0.05502655507265546, 0.1487236788711798, 0.04147068565389333, 0.20335497220142562, -0.12921786038466146, -0.013328576073154946, 0.35967094754086476, -0.011282191106997361, -0.11284071698819644, 0.04816809171271101, -0.2172356633399831, -0.1088876463342284, 0.189462393792085, 0.18393260563036132, 0.14982860862651717, -0.06557676450253647, 0.1192648346105016, -0.018783983245718283, 0.20047253819844016, 0.04741436224642958, 0.0542480380352691, 0.20297763268376273, 0.18354043174996346, -0.025852077100948195, 0.045695371629896564, -0.2448318000843696, -0.07336855845995874, -0.3574322827212582, -0.14234713475420097, -0.09184016655939066, 0.042596897717715444, -0.10707156267833122, -0.07490704848815112, 0.3710478849047534, 0.003838190747964605, 0.22201939615003208, -0.014608924483845586, 0.19306832551956177, 0.07222471287839602, 0.020322342011555333, 0.0431307599929849, 0.3308976824856668, 0.2724251078189325, 0.0387987564328762, -0.3492473918296153, 0.04902811636538985, 0.01216940535014826]
|
1,803.06435
|
Chapter 7 - Thermal Conductivity of Diamond Nanothread
|
This chapter introduces the thermal conductivity of a novel one-dimensional
carbon nanostructure - diamond nanothread. It starts by introducing the family
of the diamond nanothread as acquired from density functional theory
calculations and also its successful experimental synthesisation. It then
briefs the mechanical properties of the diamond nanothreads as a fundamental
for their engineering applications. After that, it focuses on the thermal
transport properties of the diamond nanothreads by examining the influences
from various parameters such as size, geometry, and temperature. Then, the
application of diamond nanothread as reinforcements for nanocomposites is
discussed. By the end of the chapter, future directions and their potential
applications are discussed.
|
cond-mat.mtrl-sci physics.app-ph
|
this chapter introduces the thermal conductivity of a novel onedimensional carbon nanostructure diamond nanothread it starts by introducing the family of the diamond nanothread as acquired from density functional theory calculations and also its successful experimental synthesisation it then briefs the mechanical properties of the diamond nanothreads as a fundamental for their engineering applications after that it focuses on the thermal transport properties of the diamond nanothreads by examining the influences from various parameters such as size geometry and temperature then the application of diamond nanothread as reinforcements for nanocomposites is discussed by the end of the chapter future directions and their potential applications are discussed
|
[['this', 'chapter', 'introduces', 'the', 'thermal', 'conductivity', 'of', 'a', 'novel', 'onedimensional', 'carbon', 'nanostructure', 'diamond', 'nanothread', 'it', 'starts', 'by', 'introducing', 'the', 'family', 'of', 'the', 'diamond', 'nanothread', 'as', 'acquired', 'from', 'density', 'functional', 'theory', 'calculations', 'and', 'also', 'its', 'successful', 'experimental', 'synthesisation', 'it', 'then', 'briefs', 'the', 'mechanical', 'properties', 'of', 'the', 'diamond', 'nanothreads', 'as', 'a', 'fundamental', 'for', 'their', 'engineering', 'applications', 'after', 'that', 'it', 'focuses', 'on', 'the', 'thermal', 'transport', 'properties', 'of', 'the', 'diamond', 'nanothreads', 'by', 'examining', 'the', 'influences', 'from', 'various', 'parameters', 'such', 'as', 'size', 'geometry', 'and', 'temperature', 'then', 'the', 'application', 'of', 'diamond', 'nanothread', 'as', 'reinforcements', 'for', 'nanocomposites', 'is', 'discussed', 'by', 'the', 'end', 'of', 'the', 'chapter', 'future', 'directions', 'and', 'their', 'potential', 'applications', 'are', 'discussed']]
|
[-0.027149833537017307, 0.15390294220276354, -0.05084432635811113, -0.04768560550929535, -0.015271198909197535, -0.10628082683487307, 0.04542444270170693, 0.41494283269913423, -0.30198028578112524, -0.27617146152382094, 0.1507574424724139, -0.2871611422903481, -0.18933963921098482, 0.20954247633039597, -0.019868654881914458, 0.06472376164525659, 0.029581810347735882, 0.008567317561911685, -0.053522740164771675, -0.2039603800113712, 0.2814589096965002, 0.1055601865762756, 0.3315845024128932, 0.11014227985980965, 0.07566486701724075, 0.06111814329134566, 0.03967410640879756, 0.05097700702469973, -0.178236666669961, 0.1714720066725498, 0.21427614429876918, 0.049466871093249036, 0.2445979706943035, -0.44596903031425816, -0.25878840538540054, 0.01285454568763574, 0.08247112389875665, 0.12115776639963899, -0.12206635181681208, -0.24518789454097195, 0.07020700940407724, -0.1400346288147072, -0.174629907616015, -0.05491364537073033, 0.0036090336385227384, 0.04207808083544175, -0.14224803721133086, 0.03720044418032991, 0.058228695970181085, 0.05202300044468194, -0.0636970710996095, -0.16869013102813846, -0.06448250130107183, 0.0965283359977461, 0.006734086721692057, -0.038183248502346466, 0.22321402535640766, -0.13740995832098027, -0.11494498300765242, 0.4046513248695105, -0.007708337406317393, -0.09361817590182736, 0.1677072833336535, -0.04566409736428233, -0.11557554508160267, 0.04768362018235382, 0.12632731352489265, 0.12043007410441836, -0.20034596942187774, 0.11103965941472865, 0.029014223631072256, 0.0924009748931331, 0.07299626793801076, 0.07945432531248246, 0.23499356994538434, 0.23538829584029458, 0.008783471158572606, 0.19460263493515195, -0.07816797844134271, -0.030797509004228882, -0.276532369785543, -0.1992811072351677, -0.21117059360036539, 0.08363992611744574, -0.09231113785880596, -0.17974156348833015, 0.4127525648013467, 0.12658545460019793, 0.16832423933194063, -0.06789512735392367, 0.26343104226426, 0.059211183343792245, 0.06635482583549761, -0.030775345234377752, 0.2343527411864627, 0.20460004540204646, 0.1286225584446497, -0.23067156445855896, 0.05574481079266185, -0.00498910248501315]
|
1,803.06436
|
The Kepler Light Curves of AGN: A Detailed Analysis
|
We present a comprehensive analysis of 21 light curves of Type 1 AGN from the
Kepler spacecraft. First, we describe the necessity and development of a
customized pipeline for treating Kepler data of stochastically variable sources
like AGN. We then present the light curves, power spectral density functions
(PSDs), and flux histograms. The light curves display an astonishing variety of
behaviors, many of which would not be detected in ground-based studies,
including switching between distinct flux levels. Six objects exhibit PSD
flattening at characteristic timescales which roughly correlate with black hole
mass. These timescales are consistent with orbital timescales or freefall
accretion timescales. We check for correlations of variability and
high-frequency PSD slope with accretion rate, black hole mass, redshift and
luminosity. We find that bolometric luminosity is anticorrelated with both
variability and steepness of the PSD slope. We do not find evidence of the
linear rms-flux relationships or lognormal flux distributions found in X-ray
AGN light curves, indicating that reprocessing is not a significant contributor
to optical variability at the 0.1-10% level.
|
astro-ph.HE
|
we present a comprehensive analysis of 21 light curves of type 1 agn from the kepler spacecraft first we describe the necessity and development of a customized pipeline for treating kepler data of stochastically variable sources like agn we then present the light curves power spectral density functions psds and flux histograms the light curves display an astonishing variety of behaviors many of which would not be detected in groundbased studies including switching between distinct flux levels six objects exhibit psd flattening at characteristic timescales which roughly correlate with black hole mass these timescales are consistent with orbital timescales or freefall accretion timescales we check for correlations of variability and highfrequency psd slope with accretion rate black hole mass redshift and luminosity we find that bolometric luminosity is anticorrelated with both variability and steepness of the psd slope we do not find evidence of the linear rmsflux relationships or lognormal flux distributions found in xray agn light curves indicating that reprocessing is not a significant contributor to optical variability at the 0110 level
|
[['we', 'present', 'a', 'comprehensive', 'analysis', 'of', '21', 'light', 'curves', 'of', 'type', '1', 'agn', 'from', 'the', 'kepler', 'spacecraft', 'first', 'we', 'describe', 'the', 'necessity', 'and', 'development', 'of', 'a', 'customized', 'pipeline', 'for', 'treating', 'kepler', 'data', 'of', 'stochastically', 'variable', 'sources', 'like', 'agn', 'we', 'then', 'present', 'the', 'light', 'curves', 'power', 'spectral', 'density', 'functions', 'psds', 'and', 'flux', 'histograms', 'the', 'light', 'curves', 'display', 'an', 'astonishing', 'variety', 'of', 'behaviors', 'many', 'of', 'which', 'would', 'not', 'be', 'detected', 'in', 'groundbased', 'studies', 'including', 'switching', 'between', 'distinct', 'flux', 'levels', 'six', 'objects', 'exhibit', 'psd', 'flattening', 'at', 'characteristic', 'timescales', 'which', 'roughly', 'correlate', 'with', 'black', 'hole', 'mass', 'these', 'timescales', 'are', 'consistent', 'with', 'orbital', 'timescales', 'or', 'freefall', 'accretion', 'timescales', 'we', 'check', 'for', 'correlations', 'of', 'variability', 'and', 'highfrequency', 'psd', 'slope', 'with', 'accretion', 'rate', 'black', 'hole', 'mass', 'redshift', 'and', 'luminosity', 'we', 'find', 'that', 'bolometric', 'luminosity', 'is', 'anticorrelated', 'with', 'both', 'variability', 'and', 'steepness', 'of', 'the', 'psd', 'slope', 'we', 'do', 'not', 'find', 'evidence', 'of', 'the', 'linear', 'rmsflux', 'relationships', 'or', 'lognormal', 'flux', 'distributions', 'found', 'in', 'xray', 'agn', 'light', 'curves', 'indicating', 'that', 'reprocessing', 'is', 'not', 'a', 'significant', 'contributor', 'to', 'optical', 'variability', 'at', 'the', '0110', 'level']]
|
[-0.08921563358320667, 0.13223534445973137, -0.10628937453979012, 0.15135771072351217, -0.08417024368533293, -0.12181477453909556, 0.03847900947732205, 0.4718146726079931, -0.16953189197606058, -0.36909723832578845, 0.07098784974393989, -0.32031742208825714, -0.0686467724281627, 0.2634796265094148, -0.06735376826081374, 0.017065309273412807, 0.02619440724933251, -0.10839519572761878, -0.08554025019868614, -0.2165844268199175, 0.3014391388291913, 0.041004497078758785, 0.19742008733611577, -0.006090683727982761, 0.07022162322749012, -0.061840186929168726, -0.07558279147780786, -0.014287772945752852, -0.09690939871141098, 0.031076710603894355, 0.24417852023831768, 0.14438520950895084, 0.1616327074690146, -0.36823244487215373, -0.25408170266414054, 0.13044561965880927, 0.14443606375905044, 0.0007201762630394256, -0.04039348434183122, -0.16110941502561718, 0.0015480204894492736, -0.18729931936058286, -0.1579530257408674, -0.00010651063323397771, 0.10307377477908626, 0.07784289542068808, -0.19057192881806953, 0.1546992958668684, 0.02804293728438933, 0.1122079579256518, -0.15987828711042384, -0.06768753960717878, -0.08084916884202047, 0.048733482759101374, 0.10505641950698127, 0.028468655530838403, 0.17644972820642452, -0.10433472203887525, -0.07859684849787783, 0.32979265724798673, -0.08341532688307969, -0.01895883155184545, 0.1735866967174144, -0.23951120973387033, -0.15285410655452467, 0.19735279978479048, 0.19090993233520342, 0.093270214632099, -0.12289743518962853, -0.05255396485852207, 0.02547140218885454, 0.31058900895383146, 0.022707424472446818, 0.09310370032551747, 0.36035926180361433, 0.10599878793811113, 0.0021772544216660705, 0.08143409638399139, -0.22723603850995014, -0.010816993077441706, -0.27928244337342634, -0.051273091394734176, -0.11620180745813673, 0.11144882191140461, -0.13519522121451685, -0.15013147184774656, 0.4003333340000598, 0.0786533715173796, 0.2249746932513538, 0.10801323068952673, 0.26072700544411176, 0.14242715939254946, 0.07209361513613621, 0.13871188944130275, 0.31804662533212086, 0.09680482372136873, 0.10059167186304324, -0.2585723118148636, 0.042685499320592665, -0.018248961599156087]
|
1,803.06437
|
Graphene and Carbon Nanotube Hybrid Structure: A Review
|
Graphene has been reported with record-breaking properties which have opened
up huge potential applications. Considerable amount of researches have been
devoted to manipulating or modify the properties of graphene to target a more
smart nanoscale device. Graphene and carbon nanotube hybrid structure (GNHS) is
one of the promising graphene derivate. The synthesis process and the
mechanical properties are essential for the GNHS based devices. Therefore, this
review will summarise the recent progress of the highly ordered GNHS
synthesis/assembly, and discuss the mechanical properties of GNHS under various
conditions as obtained from molecular dynamics simulations.
|
cond-mat.mtrl-sci physics.app-ph
|
graphene has been reported with recordbreaking properties which have opened up huge potential applications considerable amount of researches have been devoted to manipulating or modify the properties of graphene to target a more smart nanoscale device graphene and carbon nanotube hybrid structure gnhs is one of the promising graphene derivate the synthesis process and the mechanical properties are essential for the gnhs based devices therefore this review will summarise the recent progress of the highly ordered gnhs synthesisassembly and discuss the mechanical properties of gnhs under various conditions as obtained from molecular dynamics simulations
|
[['graphene', 'has', 'been', 'reported', 'with', 'recordbreaking', 'properties', 'which', 'have', 'opened', 'up', 'huge', 'potential', 'applications', 'considerable', 'amount', 'of', 'researches', 'have', 'been', 'devoted', 'to', 'manipulating', 'or', 'modify', 'the', 'properties', 'of', 'graphene', 'to', 'target', 'a', 'more', 'smart', 'nanoscale', 'device', 'graphene', 'and', 'carbon', 'nanotube', 'hybrid', 'structure', 'gnhs', 'is', 'one', 'of', 'the', 'promising', 'graphene', 'derivate', 'the', 'synthesis', 'process', 'and', 'the', 'mechanical', 'properties', 'are', 'essential', 'for', 'the', 'gnhs', 'based', 'devices', 'therefore', 'this', 'review', 'will', 'summarise', 'the', 'recent', 'progress', 'of', 'the', 'highly', 'ordered', 'gnhs', 'synthesisassembly', 'and', 'discuss', 'the', 'mechanical', 'properties', 'of', 'gnhs', 'under', 'various', 'conditions', 'as', 'obtained', 'from', 'molecular', 'dynamics', 'simulations']]
|
[-0.11674867209262385, 0.1159093328501268, -0.06361118805724927, -0.058887896839849574, -0.07045251593464405, -0.12353850019374682, 0.01732566787971444, 0.4191067393428536, -0.25536388573386976, -0.3114261953260309, 0.08633367317698655, -0.2721108119954826, -0.17923312148790285, 0.24968838855694298, -0.016472193372425854, 0.13058389469941137, 0.07032126273399078, -0.06186638201176319, -0.06037692189897581, -0.20759706997052235, 0.23736989033478562, 0.08982270210668425, 0.3527426975228453, 0.10441424982729919, 0.04810844106669788, -0.04639242852847743, 0.020192905972581558, 0.0032640219207913162, -0.15930897984853995, 0.17860676321170985, 0.21286913653415057, 0.007037307220881665, 0.29777667896010945, -0.5265669874165968, -0.2687343905181674, 0.04383146606195751, 0.10460204500654932, 0.12624095618519532, -0.14409705619305818, -0.2596933547287218, 0.12212825970103343, -0.1606003962136725, -0.13689677058002456, -0.09861723698865903, 0.048947240456297836, 0.060542712533866526, -0.12630301845442723, -0.019106707212725473, 0.019730666712407145, 0.056999917239731836, -0.04209415691917867, -0.17016180502551218, -0.042787591186952925, 0.14541052030875118, 0.021837514431794144, -0.02399960066372108, 0.2081636597642735, -0.16646545851272682, -0.12259568888143266, 0.4152674730266294, -0.0006193272664301819, -0.1293182179271694, 0.20501101850361442, -0.11294813986782545, -0.14741401235392737, 0.11733331485721533, 0.15082714545931067, 0.11449124315573324, -0.22223358415129785, 0.07362029628179748, 0.014093186260671705, 0.12296076381318671, 0.05288241752072848, 0.15042991665822844, 0.274380263617082, 0.2521447515295398, 0.017067376071066464, 0.16388538481807838, -0.06535370817648307, -0.04405210230259165, -0.16671648036728623, -0.17786079778220826, -0.16062454501747764, 0.10142361649852846, -0.002479148181987756, -0.16975537032609986, 0.4085145295955621, 0.17859340031501106, 0.14052787373187922, -0.08152470449912011, 0.2630826008095536, 0.05597889953998909, 0.10200331031635243, -0.03389379921399297, 0.2598281243956217, 0.16819680186729596, 0.13514875882976157, -0.20365493367325954, 0.10429042122722353, -0.0377441563953956]
|
1,803.06438
|
The morphology and temperature dependent tensile properties of diamond
nanothreads
|
The ultrathin one-dimensional sp3 diamond nanothreads (NTHs), as successfully
synthesised recently, have greatly augmented the interests from the carbon
community. In principle, there can exist different stable NTH structures. In
this work, we studied the mechanical behaviours of three representative NTHs
using molecular dynamics simulations. It is found that the mechanical
properties of NTH can vary significantly due to morphology differences, which
are believed to originate from the different stress distributions determined by
its structure. Further studies have shown that the temperature has a
significant impact on the mechanical properties of the NTH. Specifically, the
failure strength/strain decreases with increasing temperature, and the
effective Young's modulus appears independent of temperature. The remarkable
reduction of the failure strength/strain is believed to be resulted from the
increased bond re-arrangement process and free lateral vibration at high
temperatures. In addition, the NTH is found to have a relatively high bending
rigidity, and behaves more like flexible elastic rod. This study highlights the
importance of structure-property relation and provides a fundamental
understanding of the tensile behaviours of different NTHs, which should shed
light on the design and also application of the NTH-based nanostructures as
strain sensors and mechanical connectors.
|
cond-mat.mtrl-sci
|
the ultrathin onedimensional sp3 diamond nanothreads nths as successfully synthesised recently have greatly augmented the interests from the carbon community in principle there can exist different stable nth structures in this work we studied the mechanical behaviours of three representative nths using molecular dynamics simulations it is found that the mechanical properties of nth can vary significantly due to morphology differences which are believed to originate from the different stress distributions determined by its structure further studies have shown that the temperature has a significant impact on the mechanical properties of the nth specifically the failure strengthstrain decreases with increasing temperature and the effective youngs modulus appears independent of temperature the remarkable reduction of the failure strengthstrain is believed to be resulted from the increased bond rearrangement process and free lateral vibration at high temperatures in addition the nth is found to have a relatively high bending rigidity and behaves more like flexible elastic rod this study highlights the importance of structureproperty relation and provides a fundamental understanding of the tensile behaviours of different nths which should shed light on the design and also application of the nthbased nanostructures as strain sensors and mechanical connectors
|
[['the', 'ultrathin', 'onedimensional', 'sp3', 'diamond', 'nanothreads', 'nths', 'as', 'successfully', 'synthesised', 'recently', 'have', 'greatly', 'augmented', 'the', 'interests', 'from', 'the', 'carbon', 'community', 'in', 'principle', 'there', 'can', 'exist', 'different', 'stable', 'nth', 'structures', 'in', 'this', 'work', 'we', 'studied', 'the', 'mechanical', 'behaviours', 'of', 'three', 'representative', 'nths', 'using', 'molecular', 'dynamics', 'simulations', 'it', 'is', 'found', 'that', 'the', 'mechanical', 'properties', 'of', 'nth', 'can', 'vary', 'significantly', 'due', 'to', 'morphology', 'differences', 'which', 'are', 'believed', 'to', 'originate', 'from', 'the', 'different', 'stress', 'distributions', 'determined', 'by', 'its', 'structure', 'further', 'studies', 'have', 'shown', 'that', 'the', 'temperature', 'has', 'a', 'significant', 'impact', 'on', 'the', 'mechanical', 'properties', 'of', 'the', 'nth', 'specifically', 'the', 'failure', 'strengthstrain', 'decreases', 'with', 'increasing', 'temperature', 'and', 'the', 'effective', 'youngs', 'modulus', 'appears', 'independent', 'of', 'temperature', 'the', 'remarkable', 'reduction', 'of', 'the', 'failure', 'strengthstrain', 'is', 'believed', 'to', 'be', 'resulted', 'from', 'the', 'increased', 'bond', 'rearrangement', 'process', 'and', 'free', 'lateral', 'vibration', 'at', 'high', 'temperatures', 'in', 'addition', 'the', 'nth', 'is', 'found', 'to', 'have', 'a', 'relatively', 'high', 'bending', 'rigidity', 'and', 'behaves', 'more', 'like', 'flexible', 'elastic', 'rod', 'this', 'study', 'highlights', 'the', 'importance', 'of', 'structureproperty', 'relation', 'and', 'provides', 'a', 'fundamental', 'understanding', 'of', 'the', 'tensile', 'behaviours', 'of', 'different', 'nths', 'which', 'should', 'shed', 'light', 'on', 'the', 'design', 'and', 'also', 'application', 'of', 'the', 'nthbased', 'nanostructures', 'as', 'strain', 'sensors', 'and', 'mechanical', 'connectors']]
|
[-0.10913380074028585, 0.1704153759704544, -0.09487284997885581, 0.005933144915360344, -0.03786252319696359, -0.10595963901626722, 0.026829112249591464, 0.3904298334406728, -0.30030040199198993, -0.3023949988176658, 0.05440733464941635, -0.2625018025646568, -0.17908297126026204, 0.18793915347790366, -0.03741890423286046, 0.02969809003085781, 0.02581494019947665, 0.0023719905448160716, -0.07195079508225415, -0.18393038977349838, 0.24761111314364825, 0.08968796760927944, 0.3612226802179066, 0.08632602758249656, 0.062176441055271425, -0.026978762509922188, 0.02841391964587577, 0.04985031086835079, -0.1538404122115177, 0.13001374440257982, 0.21494619626537315, 0.016230993667970022, 0.25225991121139185, -0.439590845402563, -0.238013167011862, 0.07629762569073743, 0.1336413625710217, 0.09656416552631224, -0.041169644737616785, -0.21360989279795226, 0.094610283257983, -0.15212613555498442, -0.15080559249327052, -0.05586807442015621, 0.033605699130021094, 0.058701231943511324, -0.17585441755272768, 0.062334766799722274, 0.0383801866688979, 0.07126218139092089, -0.07674598541901408, -0.13527613330309882, -0.08855036497455633, 0.12813011203312877, 0.08212928913887178, 0.00407474077049604, 0.201342523717661, -0.10610576168983243, -0.07815746900026473, 0.43916803676984273, -0.022213291496882448, -0.13501404408498274, 0.22556052871368593, -0.13611514482302786, -0.12626288418929713, 0.15994972784149772, 0.15634696805500425, 0.056999362265438926, -0.13700056463161067, 0.03907330809367219, 0.01617701277852272, 0.16310141165361833, 0.09882193819066742, 0.040294908403363174, 0.2132341252132998, 0.1892092255972481, 0.00400453851398197, 0.17778285181399647, -0.07289177336012169, -0.04125903111222821, -0.21077814977616072, -0.1537555785641113, -0.17476135707935705, 0.06056401464957162, -0.11245275090626212, -0.15815192132428516, 0.36870585694365826, 0.12764956744528413, 0.16708594768958088, -0.014456248326799445, 0.22169862240358876, 0.09694378648782731, 0.11085133210387237, -0.00834639141248772, 0.3009920335874388, 0.17194288359920998, 0.09464559890693636, -0.24117063227367908, 0.12880017056158977, -0.019937296889111167]
|
1,803.06439
|
Global surfaces of section for dynamically convex Reeb flows on lens
spaces
|
We show that a dynamically convex Reeb flow on the standard tight lens space
$(L(p, 1),\xi_{\mathrm{std}})$, $p>1,$ admits a $p$-unknotted closed Reeb orbit
$P$ which is the binding of a rational open book decomposition with disk-like
pages. Each page is a rational global surface of section for the Reeb flow and
the Conley-Zehnder index of the $p$-th iterate of $P$ is $3$. We also check
dynamical convexity in the H\'enon-Heiles system for low positive energies. In
this case the rational open book decomposition follows from the fact that the
sphere-like component of the energy surface admits a $\mathbb{Z}_{3}$-symmetric
periodic orbit and the flow descends to a Reeb flow on the standard tight
$(L(3,2),\xi_{\mathrm{std}})$.
|
math.SG math.DS
|
we show that a dynamically convex reeb flow on the standard tight lens space lp 1xi_mathrmstd p1 admits a punknotted closed reeb orbit p which is the binding of a rational open book decomposition with disklike pages each page is a rational global surface of section for the reeb flow and the conleyzehnder index of the pth iterate of p is 3 we also check dynamical convexity in the henonheiles system for low positive energies in this case the rational open book decomposition follows from the fact that the spherelike component of the energy surface admits a mathbbz_3symmetric periodic orbit and the flow descends to a reeb flow on the standard tight l32xi_mathrmstd
|
[['we', 'show', 'that', 'a', 'dynamically', 'convex', 'reeb', 'flow', 'on', 'the', 'standard', 'tight', 'lens', 'space', 'lp', '1xi_mathrmstd', 'p1', 'admits', 'a', 'punknotted', 'closed', 'reeb', 'orbit', 'p', 'which', 'is', 'the', 'binding', 'of', 'a', 'rational', 'open', 'book', 'decomposition', 'with', 'disklike', 'pages', 'each', 'page', 'is', 'a', 'rational', 'global', 'surface', 'of', 'section', 'for', 'the', 'reeb', 'flow', 'and', 'the', 'conleyzehnder', 'index', 'of', 'the', 'pth', 'iterate', 'of', 'p', 'is', '3', 'we', 'also', 'check', 'dynamical', 'convexity', 'in', 'the', 'henonheiles', 'system', 'for', 'low', 'positive', 'energies', 'in', 'this', 'case', 'the', 'rational', 'open', 'book', 'decomposition', 'follows', 'from', 'the', 'fact', 'that', 'the', 'spherelike', 'component', 'of', 'the', 'energy', 'surface', 'admits', 'a', 'mathbbz_3symmetric', 'periodic', 'orbit', 'and', 'the', 'flow', 'descends', 'to', 'a', 'reeb', 'flow', 'on', 'the', 'standard', 'tight', 'l32xi_mathrmstd']]
|
[-0.22596545590257103, 0.07149002197071572, -0.14694016112268649, 0.08984214942267334, -0.08009315123993226, -0.14747395013056866, 0.007641710444692184, 0.31275977621024303, -0.3275267095051029, -0.218284609452398, 0.07536715006413446, -0.2732125137255273, -0.13643336549761112, 0.19891952934082258, -0.10741531850600784, 0.05104025559161197, 0.1135655793022703, 0.12667744677640835, -0.06695021942511878, -0.25122132236984646, 0.35780948444523597, -0.04618776545605876, 0.17508273741061037, 0.08382149040699005, 0.12954892992089628, 0.03143673443066126, 0.027212300811978903, 0.02143819357390219, -0.20165285229833732, 0.15411349252205003, 0.19600608634593134, 0.07797595300203697, 0.20210203620160677, -0.33248632763597097, -0.16804555089805615, 0.12110377246254674, 0.11235609314489094, -0.0032337658922187984, -0.021352199839682066, -0.22091468255755237, 0.14688151897439225, -0.13377509382976727, -0.17384488784115423, -0.02042438111860644, 0.10187493039464408, 0.03267168860819021, -0.23733998728408054, 0.013141473693593236, 0.15201269139572765, 0.08634597191756421, -0.12479533910201016, -0.06347174765859646, -0.10944456735371866, 0.0852949820204892, 0.047237195542336186, 0.12268525745021179, 0.1557956143494018, -0.0649437528505752, -0.07822306936141103, 0.3883726079270921, -0.10776109930064359, -0.22868322660638526, 0.1251543210734698, -0.1254310949705541, -0.15135078249414535, 0.1771086426536468, 0.15319839546626265, 0.10652075336163927, -0.06012732181645168, 0.18793756740130696, -0.11682654630223459, 0.15706792513585904, 0.12074823058633642, -0.08421161800876938, 0.1724113347897814, 0.11162996837361293, 0.18770353595133532, 0.13047652774575083, -0.051111832972806456, -0.0952374553011561, -0.30076194644312965, -0.1793992090927945, -0.13222725194116886, 0.10350842254913666, -0.1488706095649501, -0.22055863680487328, 0.4155785653189841, -0.020077437577261166, 0.17456050096926365, 0.08958006062907357, 0.29407711571945006, 0.09617583425715566, 0.007891482972296547, 0.15030345109460705, 0.2024681600847874, 0.14890345438933847, 0.03638453230431134, -0.15768766926643862, -0.008467485937448642, 0.16533379756676203]
|
1,803.0644
|
Failure mechanism of monolayer graphene under hypervelocity impact of
spherical projectile
|
The excellent mechanical properties of graphene have enabled it as appealing
candidate in the field of impact protection or protective shield. By
considering a monolayer graphene membrane, in this work, we assessed its
deformation mechanisms under hypervelocity impact (from 2 to 6 km/s), based on
a serial of in silico studies. It is found that the cracks are formed
preferentially in the zigzag directions which are consistent with that observed
from tensile deformation. Specifically, the boundary condition is found to
exert an obvious influence on the stress distribution and transmission during
the impact process, which eventually influences the penetration energy and
crack growth. For similar sample size, the circular shape graphene possesses
the best impact resistance, followed by hexagonal graphene membrane. Moreover,
it is found the failure shape of graphene membrane has a strong relationship
with the initial kinetic energy of the projectile. The higher kinetic energy,
the more number the cracks. This study provides a fundamental understanding of
the deformation mechanisms of monolayer graphene under impact, which is crucial
in order to facilitate their emerging future applications for impact
protection, such as protective shield from orbital debris for spacecraft.
|
cond-mat.mtrl-sci physics.app-ph
|
the excellent mechanical properties of graphene have enabled it as appealing candidate in the field of impact protection or protective shield by considering a monolayer graphene membrane in this work we assessed its deformation mechanisms under hypervelocity impact from 2 to 6 kms based on a serial of in silico studies it is found that the cracks are formed preferentially in the zigzag directions which are consistent with that observed from tensile deformation specifically the boundary condition is found to exert an obvious influence on the stress distribution and transmission during the impact process which eventually influences the penetration energy and crack growth for similar sample size the circular shape graphene possesses the best impact resistance followed by hexagonal graphene membrane moreover it is found the failure shape of graphene membrane has a strong relationship with the initial kinetic energy of the projectile the higher kinetic energy the more number the cracks this study provides a fundamental understanding of the deformation mechanisms of monolayer graphene under impact which is crucial in order to facilitate their emerging future applications for impact protection such as protective shield from orbital debris for spacecraft
|
[['the', 'excellent', 'mechanical', 'properties', 'of', 'graphene', 'have', 'enabled', 'it', 'as', 'appealing', 'candidate', 'in', 'the', 'field', 'of', 'impact', 'protection', 'or', 'protective', 'shield', 'by', 'considering', 'a', 'monolayer', 'graphene', 'membrane', 'in', 'this', 'work', 'we', 'assessed', 'its', 'deformation', 'mechanisms', 'under', 'hypervelocity', 'impact', 'from', '2', 'to', '6', 'kms', 'based', 'on', 'a', 'serial', 'of', 'in', 'silico', 'studies', 'it', 'is', 'found', 'that', 'the', 'cracks', 'are', 'formed', 'preferentially', 'in', 'the', 'zigzag', 'directions', 'which', 'are', 'consistent', 'with', 'that', 'observed', 'from', 'tensile', 'deformation', 'specifically', 'the', 'boundary', 'condition', 'is', 'found', 'to', 'exert', 'an', 'obvious', 'influence', 'on', 'the', 'stress', 'distribution', 'and', 'transmission', 'during', 'the', 'impact', 'process', 'which', 'eventually', 'influences', 'the', 'penetration', 'energy', 'and', 'crack', 'growth', 'for', 'similar', 'sample', 'size', 'the', 'circular', 'shape', 'graphene', 'possesses', 'the', 'best', 'impact', 'resistance', 'followed', 'by', 'hexagonal', 'graphene', 'membrane', 'moreover', 'it', 'is', 'found', 'the', 'failure', 'shape', 'of', 'graphene', 'membrane', 'has', 'a', 'strong', 'relationship', 'with', 'the', 'initial', 'kinetic', 'energy', 'of', 'the', 'projectile', 'the', 'higher', 'kinetic', 'energy', 'the', 'more', 'number', 'the', 'cracks', 'this', 'study', 'provides', 'a', 'fundamental', 'understanding', 'of', 'the', 'deformation', 'mechanisms', 'of', 'monolayer', 'graphene', 'under', 'impact', 'which', 'is', 'crucial', 'in', 'order', 'to', 'facilitate', 'their', 'emerging', 'future', 'applications', 'for', 'impact', 'protection', 'such', 'as', 'protective', 'shield', 'from', 'orbital', 'debris', 'for', 'spacecraft']]
|
[-0.12748466333754263, 0.12956798092506544, -0.07611663076340368, 0.001724868108823629, -0.04931767368781086, -0.10687649159594194, 0.035847790405693414, 0.3988231017768971, -0.26210099635400663, -0.3023235039473021, 0.04098847455675959, -0.2558458772806549, -0.17440339738233504, 0.19149962077530003, -0.028706172204233313, 0.06624848410260471, 0.052101897117436714, -0.010827728777535652, -0.009197035386521174, -0.21225152161021374, 0.27305600156786997, 0.1306334663182497, 0.34407381059871495, 0.08672813638542337, 0.048416355722828916, -0.007997984611919444, 0.040762026762393745, 0.035640930820648606, -0.1743019608905582, 0.08947044101568233, 0.17691659354359696, -0.003667339219368602, 0.2771720209011906, -0.5017073072148043, -0.22716268783827362, 0.03822807063299574, 0.119289032176235, 0.1018756696176225, -0.09127168732696814, -0.23316220443720292, 0.0917181117101695, -0.15313131756786452, -0.14112459398732569, 0.004381198933544128, 0.04071263659218522, 0.014851556101041895, -0.22432226261007598, 0.0817233762507768, 0.04070671957819477, 0.06982857190366638, -0.11387878702830916, -0.11039262629653278, -0.12499853675498775, 0.10575549866342426, 0.11041627940706492, 0.014520405175311392, 0.24501551134560845, -0.13429277383379246, -0.054834571647715116, 0.4106302033619661, 0.010441621840857949, -0.1587916194203947, 0.18218970670928492, -0.1471018090672595, -0.07285470091737807, 0.16914113240904713, 0.1619554569381044, 0.052838876728262554, -0.1477702862567783, 0.02888466595169647, 0.026080242589140604, 0.13759120744162875, 0.11593039161770752, 0.05056014578593405, 0.2554028896958028, 0.23062313114243901, 0.059393471480641315, 0.15292227327529537, -0.12562504826530227, -0.02812610124329742, -0.2406506057338495, -0.18786511814809945, -0.14263784088145354, 0.0743369727680386, -0.07732640488401031, -0.18728943516647345, 0.38436217860220684, 0.14095712870751556, 0.17203826649990667, -0.0334674754271921, 0.26562008670972365, 0.05890946004564237, 0.10487175284468225, 0.020527387307466644, 0.3082553301398691, 0.11216972012464937, 0.08966410861497646, -0.23880197787289753, 0.14071570114036533, -0.031238037641895446]
|
1,803.06441
|
A Novel Blaschke Unwinding Adaptive Fourier Decomposition based Signal
Compression Algorithm with Application on ECG Signals
|
This paper presents a novel signal compression algorithm based on the
Blaschke unwinding adaptive Fourier decomposition (AFD). The Blaschke unwinding
AFD is a newly developed signal decomposition theory. It utilizes the
Nevanlinna factorization and the maximal selection principle in each
decomposition step, and achieves a faster convergence rate with higher
fidelity. The proposed compression algorithm is applied to the
electrocardiogram signal. To assess the performance of the proposed compression
algorithm, in addition to the generic assessment criteria, we consider the less
discussed criteria related to the clinical needs -- for the heart rate
variability analysis purpose, how accurate the R peak information is preserved
is evaluated. The experiments are conducted on the MIT-BIH arrhythmia benchmark
database. The results show that the proposed algorithm performs better than
other state-of-the-art approaches. Meanwhile, it also well preserves the R peak
information.
|
eess.SP physics.data-an stat.ML
|
this paper presents a novel signal compression algorithm based on the blaschke unwinding adaptive fourier decomposition afd the blaschke unwinding afd is a newly developed signal decomposition theory it utilizes the nevanlinna factorization and the maximal selection principle in each decomposition step and achieves a faster convergence rate with higher fidelity the proposed compression algorithm is applied to the electrocardiogram signal to assess the performance of the proposed compression algorithm in addition to the generic assessment criteria we consider the less discussed criteria related to the clinical needs for the heart rate variability analysis purpose how accurate the r peak information is preserved is evaluated the experiments are conducted on the mitbih arrhythmia benchmark database the results show that the proposed algorithm performs better than other stateoftheart approaches meanwhile it also well preserves the r peak information
|
[['this', 'paper', 'presents', 'a', 'novel', 'signal', 'compression', 'algorithm', 'based', 'on', 'the', 'blaschke', 'unwinding', 'adaptive', 'fourier', 'decomposition', 'afd', 'the', 'blaschke', 'unwinding', 'afd', 'is', 'a', 'newly', 'developed', 'signal', 'decomposition', 'theory', 'it', 'utilizes', 'the', 'nevanlinna', 'factorization', 'and', 'the', 'maximal', 'selection', 'principle', 'in', 'each', 'decomposition', 'step', 'and', 'achieves', 'a', 'faster', 'convergence', 'rate', 'with', 'higher', 'fidelity', 'the', 'proposed', 'compression', 'algorithm', 'is', 'applied', 'to', 'the', 'electrocardiogram', 'signal', 'to', 'assess', 'the', 'performance', 'of', 'the', 'proposed', 'compression', 'algorithm', 'in', 'addition', 'to', 'the', 'generic', 'assessment', 'criteria', 'we', 'consider', 'the', 'less', 'discussed', 'criteria', 'related', 'to', 'the', 'clinical', 'needs', 'for', 'the', 'heart', 'rate', 'variability', 'analysis', 'purpose', 'how', 'accurate', 'the', 'r', 'peak', 'information', 'is', 'preserved', 'is', 'evaluated', 'the', 'experiments', 'are', 'conducted', 'on', 'the', 'mitbih', 'arrhythmia', 'benchmark', 'database', 'the', 'results', 'show', 'that', 'the', 'proposed', 'algorithm', 'performs', 'better', 'than', 'other', 'stateoftheart', 'approaches', 'meanwhile', 'it', 'also', 'well', 'preserves', 'the', 'r', 'peak', 'information']]
|
[-0.10354738682848368, -0.026803133571622416, -0.1270229264373218, 0.07341399011762989, -0.08634926821954929, -0.1430418198132874, 0.034658060528093226, 0.39945058627258034, -0.2534429524025887, -0.2326799308486881, 0.16007016392010026, -0.23686640626023503, -0.18941779546677576, 0.2235484756291402, -0.09912899271822977, 0.08313346616108053, 0.09428772986798555, 0.08107474276687215, -0.08427369582847467, -0.2883260691840963, 0.21803885716163166, 0.11990351785640538, 0.41653887614825347, 0.029479869885240973, 0.09508969321554649, 0.002254944138337661, -0.07800359584996137, -0.029395432320226282, -0.1276233331268984, 0.11922816987604881, 0.25558178580916713, 0.20932049062238992, 0.2923770789923758, -0.33997751295185874, -0.16944523102665035, 0.07927027218006415, 0.13422865100735187, 0.05686876357254321, -0.041516399502169586, -0.26398955311891315, 0.12983301678420908, -0.14513924337917578, -0.026079757241056347, -0.11897271176813727, -0.032563089430468144, -0.016330352223845348, -0.32887327088974416, 0.10676052501866165, 0.061897562370621974, 0.06432545023977104, -0.06012002680192355, -0.13938723047379487, 0.04401427800733134, 0.0885449380743025, 0.03705817327263636, 0.08227550038000582, 0.16262731440433295, -0.06328680087730669, -0.13551358520401724, 0.3774321820233425, -0.07614294645331042, -0.18297480736828553, 0.1663462134081544, -0.09614132478982754, -0.11799719805122237, 0.14849760789843955, 0.14678329308041418, 0.1347637673445644, -0.12607616923722256, -0.0012221371858673047, 0.009255694708086713, 0.17927667746714648, 0.07917016547684809, -0.0017197496482055552, 0.0715877164926815, 0.20974638490482186, 0.0707486023460209, 0.1842150449583708, -0.1344526899285125, -0.07115762273570264, -0.24377897955531622, -0.13222001000878106, -0.18358855414243389, -0.06420005694368215, -0.1339565297199097, -0.12855394464241082, 0.43426564177430244, 0.19608637786055677, 0.13164210848401497, 0.05749861506853987, 0.3756202030043206, 0.08115860633891973, 0.07400867397794764, 0.08030828628960969, 0.2133585996331008, 0.10985323370699465, 0.10372493699928882, -0.2500673075186184, 0.09938854807953819, 0.12531462860171322]
|
1,803.06442
|
Replica Symmetry Breaking in Bipartite Spin Glasses and Neural Networks
|
Some interesting recent advances in the theoretical understanding of neural
networks have been informed by results from the physics of disordered many-body
systems. Motivated by these findings, this work uses the replica technique to
study the mathematically tractable bipartite Sherrington-Kirkpatrick (SK) spin
glass model, which is formally similar to a Restricted Boltzmann Machine (RBM)
neural network. The bipartite SK model has been previously studied assuming
replica symmetry; here this assumption is relaxed and a replica symmetry
breaking analysis is performed. The bipartite SK model is found to have many
features in common with Parisi's solution of the original, unipartite SK model,
including the existence of a multitude of pure states which are related in a
hierarchical, ultrametric fashion. As an application of this analysis, the
optimal cost for a graph partitioning problem is shown to be simply related to
the ground state energy of the bipartite SK model. As a second application,
empirical investigations reveal that the Gibbs sampled outputs of an RBM
trained on the MNIST data set are more ultrametrically distributed than the
input data itself.
|
cond-mat.dis-nn cs.LG
|
some interesting recent advances in the theoretical understanding of neural networks have been informed by results from the physics of disordered manybody systems motivated by these findings this work uses the replica technique to study the mathematically tractable bipartite sherringtonkirkpatrick sk spin glass model which is formally similar to a restricted boltzmann machine rbm neural network the bipartite sk model has been previously studied assuming replica symmetry here this assumption is relaxed and a replica symmetry breaking analysis is performed the bipartite sk model is found to have many features in common with parisis solution of the original unipartite sk model including the existence of a multitude of pure states which are related in a hierarchical ultrametric fashion as an application of this analysis the optimal cost for a graph partitioning problem is shown to be simply related to the ground state energy of the bipartite sk model as a second application empirical investigations reveal that the gibbs sampled outputs of an rbm trained on the mnist data set are more ultrametrically distributed than the input data itself
|
[['some', 'interesting', 'recent', 'advances', 'in', 'the', 'theoretical', 'understanding', 'of', 'neural', 'networks', 'have', 'been', 'informed', 'by', 'results', 'from', 'the', 'physics', 'of', 'disordered', 'manybody', 'systems', 'motivated', 'by', 'these', 'findings', 'this', 'work', 'uses', 'the', 'replica', 'technique', 'to', 'study', 'the', 'mathematically', 'tractable', 'bipartite', 'sherringtonkirkpatrick', 'sk', 'spin', 'glass', 'model', 'which', 'is', 'formally', 'similar', 'to', 'a', 'restricted', 'boltzmann', 'machine', 'rbm', 'neural', 'network', 'the', 'bipartite', 'sk', 'model', 'has', 'been', 'previously', 'studied', 'assuming', 'replica', 'symmetry', 'here', 'this', 'assumption', 'is', 'relaxed', 'and', 'a', 'replica', 'symmetry', 'breaking', 'analysis', 'is', 'performed', 'the', 'bipartite', 'sk', 'model', 'is', 'found', 'to', 'have', 'many', 'features', 'in', 'common', 'with', 'parisis', 'solution', 'of', 'the', 'original', 'unipartite', 'sk', 'model', 'including', 'the', 'existence', 'of', 'a', 'multitude', 'of', 'pure', 'states', 'which', 'are', 'related', 'in', 'a', 'hierarchical', 'ultrametric', 'fashion', 'as', 'an', 'application', 'of', 'this', 'analysis', 'the', 'optimal', 'cost', 'for', 'a', 'graph', 'partitioning', 'problem', 'is', 'shown', 'to', 'be', 'simply', 'related', 'to', 'the', 'ground', 'state', 'energy', 'of', 'the', 'bipartite', 'sk', 'model', 'as', 'a', 'second', 'application', 'empirical', 'investigations', 'reveal', 'that', 'the', 'gibbs', 'sampled', 'outputs', 'of', 'an', 'rbm', 'trained', 'on', 'the', 'mnist', 'data', 'set', 'are', 'more', 'ultrametrically', 'distributed', 'than', 'the', 'input', 'data', 'itself']]
|
[-0.08638060832853918, 0.09994977172401649, -0.11774518451058848, 0.09249995006011578, -0.07338374368267628, -0.16665086217519254, 0.039050702381837, 0.36529552169922885, -0.2693384990864302, -0.2923331405588631, 0.1156360388445368, -0.27897597740714747, -0.18295901261880404, 0.14541902940451973, -0.02044297436168049, 0.12185533184263497, 0.07560915328393884, 0.060984275023595005, -0.03768887938925007, -0.24669151231451691, 0.2769090339888708, 0.041456148991266546, 0.33730472578788123, 0.017700114424240455, 0.05203525322531534, 0.011376444339794291, 0.02703860156385407, 0.017872477421210814, -0.11411193914542607, 0.12650633868707511, 0.2674411285542331, 0.14065550676531205, 0.2535190551573316, -0.42089435886486437, -0.27233155874146076, 0.1381196862949574, 0.10340912854246333, 0.1405962707361701, -0.014547685271482204, -0.3056290376731484, 0.07189493502048239, -0.1785582179627197, -0.09295959492598128, -0.09950468815878917, -0.02855331149730979, -0.0182254525979502, -0.2556606546974357, 0.06361662443874583, 0.10023188588898735, 0.0637270438295426, -0.034817809344264074, -0.11603278297757319, -0.02820663389718255, 0.08230744447890606, 0.020561550830696093, 0.058343905107760115, 0.09477953702911188, -0.1177556991043085, -0.17154759121203722, 0.36662699131158283, -0.004761701382747272, -0.18267914500234828, 0.17158616381357977, -0.04465186917407196, -0.19472571332165498, 0.09940533918765306, 0.1469811506379964, 0.07685143859151983, -0.20410004924814412, 0.09813599151626261, -0.13176495810749672, 0.17412087476238777, 0.006238646568509482, -0.005354839374803238, 0.15298570163441444, 0.23969733268963067, 0.04476294231089358, 0.20480886217283012, -0.03594625252167468, -0.16128937185920858, -0.2226151475792364, -0.0981272759105442, -0.2974919265999043, 0.047105112409029724, -0.08573514982782722, -0.14611793414536353, 0.4171894453676407, 0.1343234775260375, 0.1876788119796011, 0.06918465946458996, 0.2632385665145676, 0.08329157504500719, 0.05772831913519198, 0.08307855958737285, 0.2022452599191078, 0.12736186254269702, 0.08283441884990382, -0.18104297257607965, 0.08621488690920869, 0.058028748348397385]
|
1,803.06443
|
Communication Compression for Decentralized Training
|
Optimizing distributed learning systems is an art of balancing between
computation and communication. There have been two lines of research that try
to deal with slower networks: {\em communication compression} for low bandwidth
networks, and {\em decentralization} for high latency networks. In this paper,
We explore a natural question: {\em can the combination of both techniques lead
to a system that is robust to both bandwidth and latency?}
Although the system implication of such combination is trivial, the
underlying theoretical principle and algorithm design is challenging: unlike
centralized algorithms, simply compressing exchanged information, even in an
unbiased stochastic way, within the decentralized network would accumulate the
error and fail to converge. In this paper, we develop a framework of
compressed, decentralized training and propose two different strategies, which
we call {\em extrapolation compression} and {\em difference compression}. We
analyze both algorithms and prove both converge at the rate of $O(1/\sqrt{nT})$
where $n$ is the number of workers and $T$ is the number of iterations,
matching the convergence rate for full precision, centralized training. We
validate our algorithms and find that our proposed algorithm outperforms the
best of merely decentralized and merely quantized algorithm significantly for
networks with {\em both} high latency and low bandwidth.
|
cs.LG cs.DC cs.SY stat.ML
|
optimizing distributed learning systems is an art of balancing between computation and communication there have been two lines of research that try to deal with slower networks em communication compression for low bandwidth networks and em decentralization for high latency networks in this paper we explore a natural question em can the combination of both techniques lead to a system that is robust to both bandwidth and latency although the system implication of such combination is trivial the underlying theoretical principle and algorithm design is challenging unlike centralized algorithms simply compressing exchanged information even in an unbiased stochastic way within the decentralized network would accumulate the error and fail to converge in this paper we develop a framework of compressed decentralized training and propose two different strategies which we call em extrapolation compression and em difference compression we analyze both algorithms and prove both converge at the rate of o1sqrtnt where n is the number of workers and t is the number of iterations matching the convergence rate for full precision centralized training we validate our algorithms and find that our proposed algorithm outperforms the best of merely decentralized and merely quantized algorithm significantly for networks with em both high latency and low bandwidth
|
[['optimizing', 'distributed', 'learning', 'systems', 'is', 'an', 'art', 'of', 'balancing', 'between', 'computation', 'and', 'communication', 'there', 'have', 'been', 'two', 'lines', 'of', 'research', 'that', 'try', 'to', 'deal', 'with', 'slower', 'networks', 'em', 'communication', 'compression', 'for', 'low', 'bandwidth', 'networks', 'and', 'em', 'decentralization', 'for', 'high', 'latency', 'networks', 'in', 'this', 'paper', 'we', 'explore', 'a', 'natural', 'question', 'em', 'can', 'the', 'combination', 'of', 'both', 'techniques', 'lead', 'to', 'a', 'system', 'that', 'is', 'robust', 'to', 'both', 'bandwidth', 'and', 'latency', 'although', 'the', 'system', 'implication', 'of', 'such', 'combination', 'is', 'trivial', 'the', 'underlying', 'theoretical', 'principle', 'and', 'algorithm', 'design', 'is', 'challenging', 'unlike', 'centralized', 'algorithms', 'simply', 'compressing', 'exchanged', 'information', 'even', 'in', 'an', 'unbiased', 'stochastic', 'way', 'within', 'the', 'decentralized', 'network', 'would', 'accumulate', 'the', 'error', 'and', 'fail', 'to', 'converge', 'in', 'this', 'paper', 'we', 'develop', 'a', 'framework', 'of', 'compressed', 'decentralized', 'training', 'and', 'propose', 'two', 'different', 'strategies', 'which', 'we', 'call', 'em', 'extrapolation', 'compression', 'and', 'em', 'difference', 'compression', 'we', 'analyze', 'both', 'algorithms', 'and', 'prove', 'both', 'converge', 'at', 'the', 'rate', 'of', 'o1sqrtnt', 'where', 'n', 'is', 'the', 'number', 'of', 'workers', 'and', 't', 'is', 'the', 'number', 'of', 'iterations', 'matching', 'the', 'convergence', 'rate', 'for', 'full', 'precision', 'centralized', 'training', 'we', 'validate', 'our', 'algorithms', 'and', 'find', 'that', 'our', 'proposed', 'algorithm', 'outperforms', 'the', 'best', 'of', 'merely', 'decentralized', 'and', 'merely', 'quantized', 'algorithm', 'significantly', 'for', 'networks', 'with', 'em', 'both', 'high', 'latency', 'and', 'low', 'bandwidth']]
|
[-0.16374842884085541, 0.03433713094997128, -0.030357589676811042, 0.04410772059534864, -0.07730194899652686, -0.18251045520206355, 0.10197588675563668, 0.434111938577861, -0.2933948229943297, -0.32518438638412744, 0.10996205344385573, -0.2218459986122738, -0.17011004885351239, 0.1731459375693385, -0.1293728574569936, 0.08944617667845611, 0.08746100190494742, 0.02616376315904185, -0.05132017822321413, -0.28642443145895974, 0.251977318804367, 0.08963400209460205, 0.34867916643858105, 0.01922861805066393, 0.11198932763069795, -0.011215218884200592, -0.016079880952665333, 0.032530246352377744, -0.07337748593465956, 0.151265292763343, 0.28404744278657906, 0.2118231742367552, 0.33631883701997733, -0.4297027954776666, -0.18519590308848458, 0.14436976200777102, 0.17020107451536728, 0.1150976336748096, -0.03372819666301125, -0.22258802198258967, 0.14266152475992666, -0.17677121653262837, -0.007344105381867275, -0.12390264497124796, -0.03993034278836303, 0.04048825688476633, -0.32188285287616436, 0.04358028228224939, 0.0496159339589732, 0.015891395621644013, -0.01936389886764947, -0.10194318084931689, 0.06178023169285118, 0.11979641343622922, 0.021391604287237884, 0.044942066240012006, 0.10970909021372718, -0.13779074317555454, -0.1518954372210107, 0.3557017512821358, -0.024191032882935823, -0.16412800466389454, 0.20536030970945074, -0.03565307616214887, -0.13735293788752825, 0.13250029601817354, 0.23002320913405255, 0.09602207711581233, -0.13013707640411085, 0.05173408944679314, -0.011251885040199815, 0.16779141892390004, 0.05851888297391789, 0.0676635602125531, 0.11986076916233072, 0.19659389724166865, 0.1462632534495587, 0.10983226161703623, -0.07699196980440337, -0.10140303091095586, -0.22751982639580415, -0.1360575097516693, -0.21121825791409082, -0.025219674040953367, -0.1002404691202433, -0.13510028987645809, 0.3483722612784781, 0.19850570259597428, 0.18529053966932255, 0.1522563810826146, 0.3681115441418854, 0.0942539307747605, 0.025918950569893927, 0.18866198561314879, 0.21873986303377346, 0.06568310725424677, 0.1202045502278752, -0.2154672128599128, 0.07883504522950595, 0.015056291802269016]
|
1,803.06444
|
Measurement of the branching fraction of $B \rightarrow D^{(*)}\pi
\ell\nu$ at Belle using hadronic tagging in fully reconstructed events
|
We report a measurement of the branching fraction of the decay $B \rightarrow
D^{(*)}\pi \ell\nu$. The analysis uses 772$\times 10^6$ $B\bar{B}$ pairs
produced in $e^+e^-\rightarrow \Upsilon(4S)$ data recorded by the Belle
experiment at the KEKB asymmetric-energy $e^+e^-$ collider. The tagging $B$
meson in the decay is fully reconstructed in a hadronic decay mode. On the
signal side, we reconstruct the decay $B \rightarrow D^{(*)}\pi \ell\nu$
$(\ell=e,\mu)$. The measured branching fractions are $\mathcal{B}(B^+
\rightarrow D^-\pi^+ \ell^+\nu)$ = [4.55 $\pm$ 0.27 (stat.) $\pm$ 0.39
(syst.)]$\times 10^{-3}$, $\mathcal{B}(B^0 \rightarrow \bar{D}^0\pi^-
\ell^+\nu)$ = [4.05 $\pm$ 0.36 (stat.) $\pm$ 0.41 (syst.)]$\times 10^{-3}$,
$\mathcal{B}(B^+ \rightarrow D^{*-}\pi^+ \ell^+\nu)$ = [6.03 $\pm$ 0.43 (stat.)
$\pm$ 0.38 (syst.)]$\times 10^{-3}$, and $\mathcal{B}(B^0 \rightarrow
\bar{D}^{*0}\pi^- \ell^+\nu)$ = [6.46 $\pm$ 0.53 (stat.) $\pm$ 0.52
(syst.)]$\times 10^{-3}$. These are in good agreement with the current world
average values.
|
hep-ex
|
we report a measurement of the branching fraction of the decay b rightarrow dpi ellnu the analysis uses 772times 106 bbarb pairs produced in eerightarrow upsilon4s data recorded by the belle experiment at the kekb asymmetricenergy ee collider the tagging b meson in the decay is fully reconstructed in a hadronic decay mode on the signal side we reconstruct the decay b rightarrow dpi ellnu ellemu the measured branching fractions are mathcalbb rightarrow dpi ellnu 455 pm 027 stat pm 039 systtimes 103 mathcalbb0 rightarrow bard0pi ellnu 405 pm 036 stat pm 041 systtimes 103 mathcalbb rightarrow dpi ellnu 603 pm 043 stat pm 038 systtimes 103 and mathcalbb0 rightarrow bard0pi ellnu 646 pm 053 stat pm 052 systtimes 103 these are in good agreement with the current world average values
|
[['we', 'report', 'a', 'measurement', 'of', 'the', 'branching', 'fraction', 'of', 'the', 'decay', 'b', 'rightarrow', 'dpi', 'ellnu', 'the', 'analysis', 'uses', '772times', '106', 'bbarb', 'pairs', 'produced', 'in', 'eerightarrow', 'upsilon4s', 'data', 'recorded', 'by', 'the', 'belle', 'experiment', 'at', 'the', 'kekb', 'asymmetricenergy', 'ee', 'collider', 'the', 'tagging', 'b', 'meson', 'in', 'the', 'decay', 'is', 'fully', 'reconstructed', 'in', 'a', 'hadronic', 'decay', 'mode', 'on', 'the', 'signal', 'side', 'we', 'reconstruct', 'the', 'decay', 'b', 'rightarrow', 'dpi', 'ellnu', 'ellemu', 'the', 'measured', 'branching', 'fractions', 'are', 'mathcalbb', 'rightarrow', 'dpi', 'ellnu', '455', 'pm', '027', 'stat', 'pm', '039', 'systtimes', '103', 'mathcalbb0', 'rightarrow', 'bard0pi', 'ellnu', '405', 'pm', '036', 'stat', 'pm', '041', 'systtimes', '103', 'mathcalbb', 'rightarrow', 'dpi', 'ellnu', '603', 'pm', '043', 'stat', 'pm', '038', 'systtimes', '103', 'and', 'mathcalbb0', 'rightarrow', 'bard0pi', 'ellnu', '646', 'pm', '053', 'stat', 'pm', '052', 'systtimes', '103', 'these', 'are', 'in', 'good', 'agreement', 'with', 'the', 'current', 'world', 'average', 'values']]
|
[-0.10274564476331824, 0.22703371693216662, 0.005843761327271243, 0.03496720179655938, 0.0692846997363763, -0.14676059815741166, 0.13649910359949102, 0.27301230246755687, -0.11507043294352658, -0.2777392958070486, -0.08322296234581776, -0.5539919261088353, 0.19013327017483364, 0.14354542539035545, 0.04144204507816498, 0.14405920653959883, 0.13583688045503528, -0.050688546495725406, -0.03422866132153013, -0.07942754411998823, -0.07582210140117934, 0.012700632680207491, 0.2557569939131273, 0.06906270042403054, -0.041892635846645605, -0.012847876897835323, -0.0011977445403512084, -0.25742722824500264, -0.35817107208826726, -0.06201553255060105, 0.24659743071464868, 0.09243325234163297, 0.03591490466545784, -0.1363844642538279, 0.24115374033829864, 0.27036414857960894, 0.21863530412358978, -0.1482947572971559, 0.10783571904198132, -0.5512172941772537, 0.2926639968685749, -0.23739311080212697, 0.09286934178933956, 0.07603247305875971, 0.14194843485837674, -0.2161039948207504, -0.47500185500688225, 0.28921350504925747, -0.19035772636367493, 0.08009005039183864, 0.02677133216927866, -0.41867462662670707, -0.08597213361334084, -0.11083080070733115, 0.005838178101756418, 0.32181488314487094, 0.24060592481169765, 0.015308030066969057, -0.1301428446268933, 0.38477901033772766, -0.18084737597060485, -0.058247111510229474, 0.021249356402354386, -0.2820854580797653, -0.1723256587341449, 0.30491944577168134, 0.2746325615395344, 0.03639671072863284, -0.2151244007093647, 0.11541908963730929, 0.015530225017484817, 0.29825416385046855, 0.1001361824415681, 0.04258110025804979, 0.146728066951463, 0.17087896085852572, -0.15846266244531018, -0.05609187955491757, -0.21354146865338713, 0.06320756899889644, -0.40295260798324695, -0.1075954488585241, 0.049293814809283756, 0.2694543350260449, -0.07876194007185959, 0.10223106845488189, 0.2260210703319038, -0.01584975350868554, 0.43256105682350526, 0.05392231533076358, 0.2173828329563937, 0.06695378110975113, -0.07541327695971006, 0.06900436877180158, 0.35717475813820615, 0.28404990928638585, 0.15738502030708748, -0.30367813036219, 0.028637791734956602, -0.05359078488198912]
|
1,803.06445
|
Datalog: Bag Semantics via Set Semantics
|
Duplicates in data management are common and problematic. In this work, we
present a translation of Datalog under bag semantics into a well-behaved
extension of Datalog, the so-called {\em warded Datalog}$^\pm$, under set
semantics. From a theoretical point of view, this allows us to reason on bag
semantics by making use of the well-established theoretical foundations of set
semantics. From a practical point of view, this allows us to handle the bag
semantics of Datalog by powerful, existing query engines for the required
extension of Datalog. This use of Datalog$^\pm$ is extended to give a set
semantics to duplicates in Datalog$^\pm$ itself. We investigate the properties
of the resulting Datalog$^\pm$ programs, the problem of deciding
multiplicities, and expressibility of some bag operations. Moreover, the
proposed translation has the potential for interesting applications such as to
Multiset Relational Algebra and the semantic web query language SPARQL with bag
semantics.
|
cs.DB cs.AI cs.LO
|
duplicates in data management are common and problematic in this work we present a translation of datalog under bag semantics into a wellbehaved extension of datalog the socalled em warded datalogpm under set semantics from a theoretical point of view this allows us to reason on bag semantics by making use of the wellestablished theoretical foundations of set semantics from a practical point of view this allows us to handle the bag semantics of datalog by powerful existing query engines for the required extension of datalog this use of datalogpm is extended to give a set semantics to duplicates in datalogpm itself we investigate the properties of the resulting datalogpm programs the problem of deciding multiplicities and expressibility of some bag operations moreover the proposed translation has the potential for interesting applications such as to multiset relational algebra and the semantic web query language sparql with bag semantics
|
[['duplicates', 'in', 'data', 'management', 'are', 'common', 'and', 'problematic', 'in', 'this', 'work', 'we', 'present', 'a', 'translation', 'of', 'datalog', 'under', 'bag', 'semantics', 'into', 'a', 'wellbehaved', 'extension', 'of', 'datalog', 'the', 'socalled', 'em', 'warded', 'datalogpm', 'under', 'set', 'semantics', 'from', 'a', 'theoretical', 'point', 'of', 'view', 'this', 'allows', 'us', 'to', 'reason', 'on', 'bag', 'semantics', 'by', 'making', 'use', 'of', 'the', 'wellestablished', 'theoretical', 'foundations', 'of', 'set', 'semantics', 'from', 'a', 'practical', 'point', 'of', 'view', 'this', 'allows', 'us', 'to', 'handle', 'the', 'bag', 'semantics', 'of', 'datalog', 'by', 'powerful', 'existing', 'query', 'engines', 'for', 'the', 'required', 'extension', 'of', 'datalog', 'this', 'use', 'of', 'datalogpm', 'is', 'extended', 'to', 'give', 'a', 'set', 'semantics', 'to', 'duplicates', 'in', 'datalogpm', 'itself', 'we', 'investigate', 'the', 'properties', 'of', 'the', 'resulting', 'datalogpm', 'programs', 'the', 'problem', 'of', 'deciding', 'multiplicities', 'and', 'expressibility', 'of', 'some', 'bag', 'operations', 'moreover', 'the', 'proposed', 'translation', 'has', 'the', 'potential', 'for', 'interesting', 'applications', 'such', 'as', 'to', 'multiset', 'relational', 'algebra', 'and', 'the', 'semantic', 'web', 'query', 'language', 'sparql', 'with', 'bag', 'semantics']]
|
[-0.06830824690719915, -0.026577545348806558, -0.10979361916464325, 0.11218068155387693, -0.22145598391826088, -0.1157024930832228, 0.14328832944974657, 0.35976912202061834, -0.3361814110634244, -0.2994405647890793, 0.04015645953178456, -0.2574385247994419, -0.059257670116887706, 0.15238866970065754, -0.14364145883686236, 0.1093208550135731, 0.06455926754121744, 0.09555552545557353, -0.047374224844011104, -0.21681549721019897, 0.3420863058512426, 0.016372977359522436, 0.24119076074252055, 0.056704763237330306, 0.06720432635739672, 0.03587487189931405, -0.02539797591334964, 0.04752586260941383, -0.09330061663058586, 0.15829224888521648, 0.35280764341115245, 0.29066650395445226, 0.27505815070518924, -0.3998806094247344, -0.14285022597067762, 0.06735232185550362, 0.07396690744428418, 0.09610968188546296, -0.020879591504470572, -0.3274201437503704, 0.09714038761464779, -0.204650095928259, -0.025614075447634065, -0.1349064165575279, 0.0492833807271578, -0.033685047594780054, -0.24946305397945154, -0.09385007892332568, 0.15143954604639942, 0.09533621017141519, -0.0480276076709128, -0.0970182738310541, 0.04543960858230806, 0.06543839627851707, 0.0017252881693452396, 0.03767832250623788, 0.10873151165936645, -0.10294515493867062, -0.17111407509514107, 0.43731934510523807, -0.025548509594266983, -0.18920999372101113, 0.18721983832546282, -0.04286583819398279, -0.19327418751876196, 0.07746233093564876, 0.12988736118957703, 0.09773548104724772, -0.18455349499551654, 0.1636636252660537, -0.10280515257319486, 0.1766193300384141, 0.10673945591898283, 0.049912653701294156, 0.24272132756477977, 0.24154459864587044, 0.0072203228231267754, 0.21375949388508358, 0.01714704980022853, -0.10266385953307051, -0.30040652958072117, -0.15298199743532725, -0.07891189518252488, -0.05199812568497617, -0.10994426442030582, -0.22785831435986265, 0.3866884218453354, 0.2715984340473959, 0.14295815927844896, 0.13880454884477061, 0.30522816147768517, 0.03709574594078633, 0.10374887806117201, 0.07019905910537755, 0.07014226712812702, 0.08122899376069875, 0.14768981968518347, -0.15086954863540628, 0.11245612859902149, 0.10957605164573603]
|
1,803.06446
|
On Polyhedral Estimation of Signals via Indirect Observations
|
We consider the problem of recovering linear image of unknown signal
belonging to a given convex compact signal set from noisy observation of
another linear image of the signal. We develop a simple generic efficiently
computable nonlinear in observations "polyhedral" estimate along with
computation-friendly techniques for its design and risk analysis. We
demonstrate that under favorable circumstances the resulting estimate is
provably near-optimal in the minimax sense, the "favorable circumstances" being
less restrictive than the weakest known so far assumptions ensuring
near-optimality of estimates which are linear in observations.
|
math.ST stat.TH
|
we consider the problem of recovering linear image of unknown signal belonging to a given convex compact signal set from noisy observation of another linear image of the signal we develop a simple generic efficiently computable nonlinear in observations polyhedral estimate along with computationfriendly techniques for its design and risk analysis we demonstrate that under favorable circumstances the resulting estimate is provably nearoptimal in the minimax sense the favorable circumstances being less restrictive than the weakest known so far assumptions ensuring nearoptimality of estimates which are linear in observations
|
[['we', 'consider', 'the', 'problem', 'of', 'recovering', 'linear', 'image', 'of', 'unknown', 'signal', 'belonging', 'to', 'a', 'given', 'convex', 'compact', 'signal', 'set', 'from', 'noisy', 'observation', 'of', 'another', 'linear', 'image', 'of', 'the', 'signal', 'we', 'develop', 'a', 'simple', 'generic', 'efficiently', 'computable', 'nonlinear', 'in', 'observations', 'polyhedral', 'estimate', 'along', 'with', 'computationfriendly', 'techniques', 'for', 'its', 'design', 'and', 'risk', 'analysis', 'we', 'demonstrate', 'that', 'under', 'favorable', 'circumstances', 'the', 'resulting', 'estimate', 'is', 'provably', 'nearoptimal', 'in', 'the', 'minimax', 'sense', 'the', 'favorable', 'circumstances', 'being', 'less', 'restrictive', 'than', 'the', 'weakest', 'known', 'so', 'far', 'assumptions', 'ensuring', 'nearoptimality', 'of', 'estimates', 'which', 'are', 'linear', 'in', 'observations']]
|
[-0.09126313772638527, 0.00917490478605032, -0.06801427180847425, 0.10437949757180648, -0.13309665541216897, -0.17847023505110587, 0.059707976427724525, 0.391436164016218, -0.3018114470322146, -0.25457331567500413, 0.17671621355536823, -0.21676225835729515, -0.17145537784495757, 0.2090312691452505, -0.12657526321709156, 0.09918894178137246, 0.08070587574012494, 0.06288117208005337, -0.1108078998382716, -0.24644410133288566, 0.27318245005987457, 0.03943574668190787, 0.24942874224343745, -0.05540929552955093, 0.1256255977106898, 7.85216898395774e-06, -0.0216187324088454, -0.0025387966869336166, -0.13706942564250935, 0.13784578644403706, 0.3106821687745579, 0.2041948649579701, 0.2999868573741255, -0.40617471296089086, -0.17961808035295362, 0.14457150384537834, 0.07540225423349256, 0.09849712764713495, -0.04854103903354177, -0.2732989775655226, 0.131390474332507, -0.059406171615622685, -0.10366528634547015, -0.07141674868762493, -0.030930523650741643, -0.010997969332789436, -0.3647958676466781, 0.07968818363367339, 0.09221963391879971, 0.03399506563927685, -0.07886178665297378, -0.10321677077477903, 0.025268801197597987, 0.06615369319078628, 0.05338293547464765, 0.013554551539251978, 0.1448645629616601, -0.11751324717959996, -0.05912919814065308, 0.371775064742967, -0.06543801957561525, -0.2239991719782185, 0.18939176201558766, -0.1409656691228908, -0.1680441507467937, 0.17062884229078387, 0.1914234592401412, 0.1517895417748375, -0.17323219240904691, 0.07405005797176109, -0.09168778151127227, 0.14173720455911595, 0.05905038578529957, 0.08032794771951446, 0.11961141933969567, 0.14620067703726, 0.17936918810742458, 0.17726537660405228, -0.08280265015769708, -0.06251804896871026, -0.2838840281193176, -0.0807615647496645, -0.19299915205854712, 0.01657372016820722, -0.12143310568582534, -0.15669576979629443, 0.3702452110147543, 0.1610620760468745, 0.18884199184857392, 0.12316032093190954, 0.3188161901564578, 0.11418896581434117, 0.016089204599390203, 0.10140382306482852, 0.26514984698301663, 0.10453848560665095, -0.02618982617251491, -0.1577589480439201, 0.1400685272221401, -0.0027439315395241374]
|
1,803.06447
|
Emergence of spin-orbit order in the spinel CuCr$_2$O$_4$
|
We determined the magnetic structure of CuCr$_2$O$_4$ using neutron
diffraction and irreducible representation analysis. The measurements
identified a new phase between 155 K and 125 K as nearly collinear magnetic
ordering in the Cr pyrochlore lattice. Below 125 K, a Cu-Cr ferrimagnetic
component develops the noncollinear order. Along with the simultaneously
obtained O positions and the quantum effect of spin-orbit coupling, the
magnetic structure is understood to involve spin-orbit ordering, accompanied by
an appreciably deformed orbital of presumably spin-only Cu and Cr.
|
cond-mat.str-el
|
we determined the magnetic structure of cucr_2o_4 using neutron diffraction and irreducible representation analysis the measurements identified a new phase between 155 k and 125 k as nearly collinear magnetic ordering in the cr pyrochlore lattice below 125 k a cucr ferrimagnetic component develops the noncollinear order along with the simultaneously obtained o positions and the quantum effect of spinorbit coupling the magnetic structure is understood to involve spinorbit ordering accompanied by an appreciably deformed orbital of presumably spinonly cu and cr
|
[['we', 'determined', 'the', 'magnetic', 'structure', 'of', 'cucr_2o_4', 'using', 'neutron', 'diffraction', 'and', 'irreducible', 'representation', 'analysis', 'the', 'measurements', 'identified', 'a', 'new', 'phase', 'between', '155', 'k', 'and', '125', 'k', 'as', 'nearly', 'collinear', 'magnetic', 'ordering', 'in', 'the', 'cr', 'pyrochlore', 'lattice', 'below', '125', 'k', 'a', 'cucr', 'ferrimagnetic', 'component', 'develops', 'the', 'noncollinear', 'order', 'along', 'with', 'the', 'simultaneously', 'obtained', 'o', 'positions', 'and', 'the', 'quantum', 'effect', 'of', 'spinorbit', 'coupling', 'the', 'magnetic', 'structure', 'is', 'understood', 'to', 'involve', 'spinorbit', 'ordering', 'accompanied', 'by', 'an', 'appreciably', 'deformed', 'orbital', 'of', 'presumably', 'spinonly', 'cu', 'and', 'cr']]
|
[-0.23072190061438738, 0.25312465623396635, 0.008020655592767203, 0.018045700003290775, -0.07161504952464162, -0.10569428901256221, 0.09058628818190588, 0.3980513354536237, -0.3039564067886847, -0.3474188085117309, -0.03400287384354714, -0.30998519902321986, -0.05053750047937217, 0.10616708871065185, 0.13701959197954616, -0.05249046647875774, -0.0385521848504318, 0.02538248639917228, -0.15877919306796862, -0.18125637056357113, 0.2655698906448556, 0.016710895103908736, 0.2242550551891327, 0.04081184827018439, 0.047264038946084885, 0.045799980309178555, 0.11511435800391, 0.010225445239395812, -0.13716183337610124, 0.06989971827147756, 0.21455341776003833, -0.06334728945228385, 0.10228429784680285, -0.37708808763361557, -0.1595717993133315, -0.01577142072932386, 0.13270573218057796, 0.07632246277317768, -0.039854433217154046, -0.29308380160151365, 0.08523843916155761, -0.1348796638819139, -0.14780051354886736, -0.10573884230334221, -0.0541843971828135, -0.057996684651276685, -0.2729893322855166, 0.08671837258606968, 0.1399099770422298, 0.1820132889239708, -0.13671680057148744, -0.19059815030635857, -0.11692584244670665, 0.006396036129444838, 0.058017296452506834, 0.12124896546110238, 0.10997353408985384, -0.0767093323222248, -0.12562077347666206, 0.38729708547499486, -0.06852973193049476, -0.03399502215218424, 0.11840351309809016, -0.2122742165981724, -0.09887276233242052, 0.23435794846041175, 0.08247364902579249, 0.11554566577996878, -0.111715609601006, 0.09732216210161312, 0.018157405693583737, 0.18638671532545875, 0.040307775037590324, 0.045516534180312256, 0.26429425103862475, 0.13495913127482664, 0.03351261568959893, 0.10187327730889637, -0.16953714034043071, -0.053693340543271385, -0.211308899619503, -0.10480920737041388, -0.21157222774970094, 0.06991465147669859, -0.10283840050077543, -0.15839185496428754, 0.3218037655588421, 0.07607993088867061, 0.22132761008390112, -0.12271515675252531, 0.22075573279999378, 0.052780604668574906, 0.06802795793812881, 0.04506156351786425, 0.2581972082418094, 0.2838815269912252, 0.1263885877787976, -0.3204679341543829, 0.0629965798026405, 0.037563376719268356]
|
1,803.06448
|
Frequency-Domain Decoupling for MIMO-GFDM Spatial Multiplexing
|
Generalized frequency division multiplexing (GFDM) is considered a
non-orthogonal waveform and known to encounter difficulties when using in the
spatial multiplexing mode of multiple-input-multiple-output (MIMO) scenario. In
this paper, a class of GFDM prototype filters, under which the GFDM system is
free from inter-subcarrier interference, is investigated, enabling
frequency-domain decoupling in the processing at the GFDM receiver. An
efficient MIMO-GFDM detection method based on depth-first sphere decoding is
then proposed with such class of filters. Numerical results confirm a
significant reduction in complexity, especially when the number of subcarriers
is large, compared with existing methods presented in recent years.
|
cs.IT math.IT
|
generalized frequency division multiplexing gfdm is considered a nonorthogonal waveform and known to encounter difficulties when using in the spatial multiplexing mode of multipleinputmultipleoutput mimo scenario in this paper a class of gfdm prototype filters under which the gfdm system is free from intersubcarrier interference is investigated enabling frequencydomain decoupling in the processing at the gfdm receiver an efficient mimogfdm detection method based on depthfirst sphere decoding is then proposed with such class of filters numerical results confirm a significant reduction in complexity especially when the number of subcarriers is large compared with existing methods presented in recent years
|
[['generalized', 'frequency', 'division', 'multiplexing', 'gfdm', 'is', 'considered', 'a', 'nonorthogonal', 'waveform', 'and', 'known', 'to', 'encounter', 'difficulties', 'when', 'using', 'in', 'the', 'spatial', 'multiplexing', 'mode', 'of', 'multipleinputmultipleoutput', 'mimo', 'scenario', 'in', 'this', 'paper', 'a', 'class', 'of', 'gfdm', 'prototype', 'filters', 'under', 'which', 'the', 'gfdm', 'system', 'is', 'free', 'from', 'intersubcarrier', 'interference', 'is', 'investigated', 'enabling', 'frequencydomain', 'decoupling', 'in', 'the', 'processing', 'at', 'the', 'gfdm', 'receiver', 'an', 'efficient', 'mimogfdm', 'detection', 'method', 'based', 'on', 'depthfirst', 'sphere', 'decoding', 'is', 'then', 'proposed', 'with', 'such', 'class', 'of', 'filters', 'numerical', 'results', 'confirm', 'a', 'significant', 'reduction', 'in', 'complexity', 'especially', 'when', 'the', 'number', 'of', 'subcarriers', 'is', 'large', 'compared', 'with', 'existing', 'methods', 'presented', 'in', 'recent', 'years']]
|
[-0.20904070488652404, 0.02096886033972141, -0.05003484424051582, -0.028581490573872412, -0.06287799120110897, -0.21333061352999386, 0.01857355745076867, 0.40177246080521417, -0.23276494103673923, -0.23629026459910127, 0.12083128839137261, -0.20035331548970878, -0.22833951570245684, 0.2142197479855041, -0.12827065473004262, 0.09457778193980779, 0.07323106396848297, 0.006355128220130442, -0.08069235162467372, -0.2385851865140151, 0.24493030864004123, 0.1285081992189552, 0.3733612422888376, -0.05428114150738705, 0.10499850596534088, 0.039209986084178854, -0.06631883657157268, -0.07292729688390177, -0.0418302075015571, 0.04054372142810298, 0.3582638864457721, 0.1758103986467919, 0.27638853404537905, -0.36181831901550904, -0.26982507306360165, 0.07870742947704215, 0.1984542634466435, 0.09306152338252346, -0.09458373961091156, -0.2717957148442463, 0.11211448795238167, -0.23735522994847627, -0.027240638825769194, 0.023373734071727235, -0.04035367607614215, 0.02344596232002487, -0.34251918467902104, 0.03941396541171232, 0.023863014242402752, 0.061074616377983164, -0.010763808562211236, -0.13671413377967986, 0.09438154461724703, 0.04929535731266975, 0.010958667528549475, -0.02573477713229629, 0.035537074210730435, -0.04557539365368382, -0.13910031591884184, 0.37730938968799854, -0.02646281137083638, -0.2637662865002925, 0.19626626480912449, -0.12787055566061137, -0.09622399526534184, 0.1887026690421816, 0.21932082576677203, 0.0839949106246385, -0.1646393240308888, 0.061074788021090044, 0.020749164583655645, 0.21145156035389828, 0.12108777758988495, 0.13309989238576014, 0.15568186289616576, 0.23744626709602165, 0.08619536805959722, 0.1591597053611993, -0.14844841294095149, -0.08616332012247674, -0.19299514298754916, -0.1129821812905067, -0.24483687279666347, -0.03341521427738575, -0.08468479166571788, -0.08655780268243837, 0.3924720823118577, 0.13163061265605597, 0.059771364058215856, 0.10042828060235182, 0.4050494413442758, 0.13392184873893193, 0.12092888450288043, 0.06975010780341999, 0.2057309846716876, 0.13853919320283647, 0.09836864652948415, -0.23098602591139472, -0.04321569560882065, 0.006356283167034996]
|
1,803.06449
|
Note: Variational Encoding of Protein Dynamics Benefits from Maximizing
Latent Autocorrelation
|
As deep Variational Auto-Encoder (VAE) frameworks become more widely used for
modeling biomolecular simulation data, we emphasize the capability of the VAE
architecture to concurrently maximize the timescale of the latent space while
inferring a reduced coordinate, which assists in finding slow processes as
according to the variational approach to conformational dynamics. We
additionally provide evidence that the VDE framework (Hern\'andez et al.,
2017), which uses this autocorrelation loss along with a time-lagged
reconstruction loss, obtains a variationally optimized latent coordinate in
comparison with related loss functions. We thus recommend leveraging the
autocorrelation of the latent space while training neural network models of
biomolecular simulation data to better represent slow processes.
|
physics.chem-ph cs.LG physics.bio-ph stat.ML
|
as deep variational autoencoder vae frameworks become more widely used for modeling biomolecular simulation data we emphasize the capability of the vae architecture to concurrently maximize the timescale of the latent space while inferring a reduced coordinate which assists in finding slow processes as according to the variational approach to conformational dynamics we additionally provide evidence that the vde framework hernandez et al 2017 which uses this autocorrelation loss along with a timelagged reconstruction loss obtains a variationally optimized latent coordinate in comparison with related loss functions we thus recommend leveraging the autocorrelation of the latent space while training neural network models of biomolecular simulation data to better represent slow processes
|
[['as', 'deep', 'variational', 'autoencoder', 'vae', 'frameworks', 'become', 'more', 'widely', 'used', 'for', 'modeling', 'biomolecular', 'simulation', 'data', 'we', 'emphasize', 'the', 'capability', 'of', 'the', 'vae', 'architecture', 'to', 'concurrently', 'maximize', 'the', 'timescale', 'of', 'the', 'latent', 'space', 'while', 'inferring', 'a', 'reduced', 'coordinate', 'which', 'assists', 'in', 'finding', 'slow', 'processes', 'as', 'according', 'to', 'the', 'variational', 'approach', 'to', 'conformational', 'dynamics', 'we', 'additionally', 'provide', 'evidence', 'that', 'the', 'vde', 'framework', 'hernandez', 'et', 'al', '2017', 'which', 'uses', 'this', 'autocorrelation', 'loss', 'along', 'with', 'a', 'timelagged', 'reconstruction', 'loss', 'obtains', 'a', 'variationally', 'optimized', 'latent', 'coordinate', 'in', 'comparison', 'with', 'related', 'loss', 'functions', 'we', 'thus', 'recommend', 'leveraging', 'the', 'autocorrelation', 'of', 'the', 'latent', 'space', 'while', 'training', 'neural', 'network', 'models', 'of', 'biomolecular', 'simulation', 'data', 'to', 'better', 'represent', 'slow', 'processes']]
|
[-0.0262726810372745, 0.03201930346554733, -0.09933689445978752, 0.10670679637654643, -0.11904347421987369, -0.14369508820829224, 0.044572664802340234, 0.4304743674961296, -0.30898190142905657, -0.32567918696650516, 0.005512342865889271, -0.23411537881370062, -0.2125383652704726, 0.16413969494536654, -0.06365928245154587, 0.12031066868672366, 0.1312742521063433, -0.025084776134463027, -0.08031176529648537, -0.2388693026753629, 0.2699317742424371, 0.1385983663948299, 0.3297266184545315, -0.04885135050695222, 0.14491654228763068, 0.020799623435753322, -0.0410909056831319, -0.04864048060489376, -0.09777388880104047, 0.19636971701507097, 0.28785687658311365, 0.20302223652414558, 0.33456724171468, -0.4359714483322055, -0.3239506878512534, 0.07684195365521822, 0.14716828717464195, 0.09917160811800477, 0.019937510775619286, -0.29951832849146415, 0.019753412092901632, -0.1723039791319385, -0.026790868693874596, -0.16840949181786125, -0.043884108744997964, 0.02014916175179318, -0.3113682475024918, 0.10529795170579156, 0.061838211659509854, 0.02427620226978786, -0.08275798369652114, -0.10369139311096824, -0.05595362182446496, 0.11099122428998083, 0.04378650404370247, 0.0997267014867215, 0.11531895937330953, -0.11290092782016743, -0.11980875218203207, 0.31794774041485946, -0.06314361387410679, -0.22472755233169878, 0.18119269815013483, -0.023699520890200342, -0.17533401801745901, 0.12547926313604588, 0.23408782691904553, 0.10199103050084936, -0.2000132990824814, -0.00583637933464939, 0.012410957013835778, 0.15837301676757298, 0.007228234535301322, 0.011822532266714014, 0.12843373177052886, 0.23507263680903223, 0.04493990062677243, 0.14835941176840547, -0.1399741017129608, -0.15421519341914253, -0.2231099937648118, -0.1489799010110096, -0.1896660250972386, -0.01908099577921602, -0.09472231172562183, -0.1542494716877873, 0.3780617555603385, 0.19389878611525033, 0.23802776096036304, 0.10938676412485808, 0.29687614592950085, 0.048638773314352776, 0.0817527369940066, 0.11952051623338447, 0.16068720879352563, 0.08970963436772476, 0.12141006671076825, -0.2111855704496774, 0.12699218647688762, 0.06326013754398839]
|
1,803.0645
|
Measuring fluorescence into a nanofiber by observing field quadrature
noise
|
We perform balanced homodyne detection of the electromagnetic field in a
single-mode tapered optical nanofiber surrounded by rubidium atoms in a
magneto-optical trap. Resonant fluorescence of atoms into the nanofiber mode
manifests itself as increased quantum noise of the field quadratures. The
autocorrelation function of the homodyne detector's output photocurrent
exhibits exponential fall-off with a decay time constant of $26.3\pm 0.6$ ns,
which is consistent with the theoretical expectation under our experimental
conditions. To our knowledge, this is the first experiment in which
fluorescence has been observed and measured by balanced optical homodyne
detection.
|
physics.atom-ph
|
we perform balanced homodyne detection of the electromagnetic field in a singlemode tapered optical nanofiber surrounded by rubidium atoms in a magnetooptical trap resonant fluorescence of atoms into the nanofiber mode manifests itself as increased quantum noise of the field quadratures the autocorrelation function of the homodyne detectors output photocurrent exhibits exponential falloff with a decay time constant of 263pm 06 ns which is consistent with the theoretical expectation under our experimental conditions to our knowledge this is the first experiment in which fluorescence has been observed and measured by balanced optical homodyne detection
|
[['we', 'perform', 'balanced', 'homodyne', 'detection', 'of', 'the', 'electromagnetic', 'field', 'in', 'a', 'singlemode', 'tapered', 'optical', 'nanofiber', 'surrounded', 'by', 'rubidium', 'atoms', 'in', 'a', 'magnetooptical', 'trap', 'resonant', 'fluorescence', 'of', 'atoms', 'into', 'the', 'nanofiber', 'mode', 'manifests', 'itself', 'as', 'increased', 'quantum', 'noise', 'of', 'the', 'field', 'quadratures', 'the', 'autocorrelation', 'function', 'of', 'the', 'homodyne', 'detectors', 'output', 'photocurrent', 'exhibits', 'exponential', 'falloff', 'with', 'a', 'decay', 'time', 'constant', 'of', '263pm', '06', 'ns', 'which', 'is', 'consistent', 'with', 'the', 'theoretical', 'expectation', 'under', 'our', 'experimental', 'conditions', 'to', 'our', 'knowledge', 'this', 'is', 'the', 'first', 'experiment', 'in', 'which', 'fluorescence', 'has', 'been', 'observed', 'and', 'measured', 'by', 'balanced', 'optical', 'homodyne', 'detection']]
|
[-0.11210148452570842, 0.20041515928522874, -0.07679451332597803, -0.04462970392678373, 0.006188833808165884, -0.20050841382133863, 0.03062613798876203, 0.45733296783060157, -0.17408937835810526, -0.25951226061630633, -0.0010765058812134529, -0.2867332906011612, -0.07897566820705129, 0.22211695194084158, -0.0036672676903426005, 0.13314753047801475, 0.0824392448049239, -0.005576996117710105, -0.011542402791179797, -0.188990140934625, 0.20913250728570407, 0.09703798918929753, 0.31586933446427184, 0.02100801482603895, 0.14304634867616559, -0.01860553907450809, 0.024741731694228546, -0.03644070191489112, -0.08386090029311437, 0.0666377850437677, 0.21558959330482189, 0.058093457417662746, 0.23723100350108198, -0.43169834011144215, -0.19671641096913367, 0.11253580443500992, 0.1672657878809078, 0.13151084646452418, -0.06493079822550538, -0.3596653851570301, -0.03336419437521247, -0.10578386761875253, -0.1030577843087495, -0.05649661366897885, -0.02029425799295867, 0.02803520451710429, -0.3016512358901642, 0.07638687559814063, 0.0367539610653635, 0.06975279082181132, -0.02489774716236899, -0.02460196744450318, 0.041916825976322895, -0.0068349494368478815, -0.03173875309757247, 0.030058178564368356, 0.25605646021644113, -0.13729810648377463, -0.11661192628565015, 0.2984306437917234, -0.19017402859785223, -0.08755849716403792, 0.08211856096061648, -0.21113235499429447, 0.010949304152119865, 0.22203865270781262, 0.09713110172500213, 0.09927861988469358, -0.10785177070647478, 0.006515682994773592, -0.04802772611059168, 0.24150634402789736, 0.14592142490499843, 0.12310062258213919, 0.22201279065101057, 0.20248762678269858, 0.03297635151814389, 0.22559589087232065, -0.16774771690227203, -0.034419880885761034, -0.280468118494697, -0.1425909396180863, -0.23163080139439904, 0.0789639677712193, -0.05698456457892423, -0.1624567706878948, 0.4259703136099282, 0.08210881749388352, 0.15509870412549184, -0.003305204603220186, 0.40480975732107155, 0.16934109378170462, 0.07907389479023354, -0.032055642416776456, 0.38544270842866873, 0.2077415858280234, 0.09858298810919927, -0.30878103537464974, 0.014702089556717559, -0.03414323883161189]
|
1,803.06451
|
Instability of the solitary waves for the generalized derivative
nonlinear Schr\"odinger equation in the degenerate case
|
In this paper, we develop the modulation analysis, the perturbation argument
and the Virial identity similar as those in \cite{MartelM:Instab:gKdV} to show
the orbital instability of the solitary waves $\Q\sts{x-ct}\e^{\i\omega t}$ of
the generalized derivative nonlinear Schr\"odinger equation (gDNLS) in the
degenerate case $c=2z_0\sqrt{\omega}$, where $z_0=z_0\sts{\sigma} $ is the
unique zero point of $F\sts{z;~\sigma}$ in $\sts{-1, ~ 1}$. The new ingredients
in the proof are the refined modulation decomposition of the solution near $\Q$
according to the spectrum property of the linearized operator $\Scal_{\omega,
c}"\sts{\Q}$ and the refined construction of the Virial identity in the
degenerate case. Our argument is qualitative, and we improve the result in
\cite{Fukaya2017}.
|
math.AP
|
in this paper we develop the modulation analysis the perturbation argument and the virial identity similar as those in citemartelminstabgkdv to show the orbital instability of the solitary waves qstsxcteiomega t of the generalized derivative nonlinear schrodinger equation gdnls in the degenerate case c2z_0sqrtomega where z_0z_0stssigma is the unique zero point of fstszsigma in sts1 1 the new ingredients in the proof are the refined modulation decomposition of the solution near q according to the spectrum property of the linearized operator scal_omega cstsq and the refined construction of the virial identity in the degenerate case our argument is qualitative and we improve the result in citefukaya2017
|
[['in', 'this', 'paper', 'we', 'develop', 'the', 'modulation', 'analysis', 'the', 'perturbation', 'argument', 'and', 'the', 'virial', 'identity', 'similar', 'as', 'those', 'in', 'citemartelminstabgkdv', 'to', 'show', 'the', 'orbital', 'instability', 'of', 'the', 'solitary', 'waves', 'qstsxcteiomega', 't', 'of', 'the', 'generalized', 'derivative', 'nonlinear', 'schrodinger', 'equation', 'gdnls', 'in', 'the', 'degenerate', 'case', 'c2z_0sqrtomega', 'where', 'z_0z_0stssigma', 'is', 'the', 'unique', 'zero', 'point', 'of', 'fstszsigma', 'in', 'sts1', '1', 'the', 'new', 'ingredients', 'in', 'the', 'proof', 'are', 'the', 'refined', 'modulation', 'decomposition', 'of', 'the', 'solution', 'near', 'q', 'according', 'to', 'the', 'spectrum', 'property', 'of', 'the', 'linearized', 'operator', 'scal_omega', 'cstsq', 'and', 'the', 'refined', 'construction', 'of', 'the', 'virial', 'identity', 'in', 'the', 'degenerate', 'case', 'our', 'argument', 'is', 'qualitative', 'and', 'we', 'improve', 'the', 'result', 'in', 'citefukaya2017']]
|
[-0.14818867922942972, 0.049420466752165985, -0.12789566436009578, 0.0731118613477201, -0.0726269352172991, -0.08104882721510745, 0.024910607145974394, 0.24423896811288043, -0.2943127057179041, -0.2353197343685885, 0.12036671493857734, -0.2951495037654165, -0.15589777756597578, 0.14969286754650554, -0.03563123448876683, 0.05416046301402228, 0.024551670115018628, 0.058073762295402814, -0.07753703063929972, -0.19887400862098353, 0.3781579589259993, 0.021722386748357147, 0.2464346409746513, 0.045688385700749366, 0.04549412883952567, 0.021714138356757534, -0.01930617148383069, -0.05727126891312211, -0.14781971347815903, 0.10253287794202873, 0.19869634312500736, 0.058680150201832204, 0.25261962657179876, -0.3681454750296381, -0.17584305355228128, 0.05539847085175594, 0.1493147728513427, 0.10828990508446988, -0.014095824720702836, -0.2589260431765051, 0.10349159480370197, -0.15709841068949282, -0.24139949999096774, -0.04375723948145343, -0.005337921979347455, 0.04850746066664759, -0.26676040387606803, 0.1307608739703356, 0.1459924860751813, 0.011893051354809827, -0.11933550074427705, -0.08343685333876266, -0.028155247371202122, 0.06790657958841508, 0.059776185870112984, 0.028766516788104147, 0.033352241395329385, -0.09648767698162533, -0.06763213904203665, 0.3751894224761534, -0.11340128192582082, -0.2033574277938334, 0.13991888351354403, -0.1859204924386955, -0.1399505545346777, 0.08964777356301319, 0.12535376853031135, 0.15591117405553453, -0.08740508959619041, 0.09617340704246145, -0.03967764002472623, 0.13393406866066704, 0.09714477779535749, 0.01675486936685197, 0.148461528957735, 0.10683245795356475, 0.09579540559657149, 0.11773180640926681, -0.034407472694004626, -0.1062673266986673, -0.3372581225829487, -0.17026015310866288, -0.1789742423624722, 0.03258357040425666, -0.11593288608983318, -0.16668498233805612, 0.4238802446916546, 0.15577962438662335, 0.17017179527848036, 0.018411221981202205, 0.27075319427555217, 0.21049893247539697, 0.023309701741625045, 0.049787957252473716, 0.27773531927659956, 0.1715552656330437, 0.12156968504747319, -0.23205632621364802, -0.020062648604825598, 0.15552348785159975]
|
1,803.06452
|
Spectral Estimation of Plasma Fluctuations II: Nonstationary Analysis of
ELM Spectra
|
Several analysis methods for nonstationary fluctuations are described and
applied to the edge localized mode (ELM) instabilities of limiter H-mode
plasmas. The microwave scattering diagnostic observes poloidal $k_{\theta}$
values of 3.3 cm$^{-1}$, averaged over a 20 cm region at the plasma edge.A
short autoregressive filter enhances the nonstationary component of the plasma
fluctuations by removing much of the background level of stationary
fluctuations. Between ELMs, the spectrum predominantly consists of broad-banded
300-700 kHz fluctuations propagating in the electron diamagnetic drift
direction, indicating the presence of a negative electric field near the plasma
edge. The time-frequency spectrogram is computed with the multiple taper
technique. By using the singular value decomposition of the spectrogram, it is
shown that the spectrum during the ELM is broader and more symmetric than that
of the stationary spectrum. The ELM period and the evolution of the spectrum
between ELMs varies from discharge to discharge. For the discharge under
consideration which has distinct ELMs with a 1 msec period, the spectrum has a
maximum in the electron drift direction which relaxes to a near constant value
%its characteristic shape in the first half millisecond after the end of the
ELM and then grows slowly. In contrast, the level of the fluctuations in the
ion drift direction increases exponentially by a factor of eight in the five
milliseconds~after the ELM. High frequency precursors are found which occur one
millisecond before the ELMs and propagate in the ion drift direction. These
precursors are very short ($\sim 10 \mu$secs), coherent bursts, and they
predict the occurrence of an ELM with a high success rate.
|
physics.plasm-ph eess.AS physics.data-an stat.AP
|
several analysis methods for nonstationary fluctuations are described and applied to the edge localized mode elm instabilities of limiter hmode plasmas the microwave scattering diagnostic observes poloidal k_theta values of 33 cm1 averaged over a 20 cm region at the plasma edgea short autoregressive filter enhances the nonstationary component of the plasma fluctuations by removing much of the background level of stationary fluctuations between elms the spectrum predominantly consists of broadbanded 300700 khz fluctuations propagating in the electron diamagnetic drift direction indicating the presence of a negative electric field near the plasma edge the timefrequency spectrogram is computed with the multiple taper technique by using the singular value decomposition of the spectrogram it is shown that the spectrum during the elm is broader and more symmetric than that of the stationary spectrum the elm period and the evolution of the spectrum between elms varies from discharge to discharge for the discharge under consideration which has distinct elms with a 1 msec period the spectrum has a maximum in the electron drift direction which relaxes to a near constant value its characteristic shape in the first half millisecond after the end of the elm and then grows slowly in contrast the level of the fluctuations in the ion drift direction increases exponentially by a factor of eight in the five millisecondsafter the elm high frequency precursors are found which occur one millisecond before the elms and propagate in the ion drift direction these precursors are very short sim 10 musecs coherent bursts and they predict the occurrence of an elm with a high success rate
|
[['several', 'analysis', 'methods', 'for', 'nonstationary', 'fluctuations', 'are', 'described', 'and', 'applied', 'to', 'the', 'edge', 'localized', 'mode', 'elm', 'instabilities', 'of', 'limiter', 'hmode', 'plasmas', 'the', 'microwave', 'scattering', 'diagnostic', 'observes', 'poloidal', 'k_theta', 'values', 'of', '33', 'cm1', 'averaged', 'over', 'a', '20', 'cm', 'region', 'at', 'the', 'plasma', 'edgea', 'short', 'autoregressive', 'filter', 'enhances', 'the', 'nonstationary', 'component', 'of', 'the', 'plasma', 'fluctuations', 'by', 'removing', 'much', 'of', 'the', 'background', 'level', 'of', 'stationary', 'fluctuations', 'between', 'elms', 'the', 'spectrum', 'predominantly', 'consists', 'of', 'broadbanded', '300700', 'khz', 'fluctuations', 'propagating', 'in', 'the', 'electron', 'diamagnetic', 'drift', 'direction', 'indicating', 'the', 'presence', 'of', 'a', 'negative', 'electric', 'field', 'near', 'the', 'plasma', 'edge', 'the', 'timefrequency', 'spectrogram', 'is', 'computed', 'with', 'the', 'multiple', 'taper', 'technique', 'by', 'using', 'the', 'singular', 'value', 'decomposition', 'of', 'the', 'spectrogram', 'it', 'is', 'shown', 'that', 'the', 'spectrum', 'during', 'the', 'elm', 'is', 'broader', 'and', 'more', 'symmetric', 'than', 'that', 'of', 'the', 'stationary', 'spectrum', 'the', 'elm', 'period', 'and', 'the', 'evolution', 'of', 'the', 'spectrum', 'between', 'elms', 'varies', 'from', 'discharge', 'to', 'discharge', 'for', 'the', 'discharge', 'under', 'consideration', 'which', 'has', 'distinct', 'elms', 'with', 'a', '1', 'msec', 'period', 'the', 'spectrum', 'has', 'a', 'maximum', 'in', 'the', 'electron', 'drift', 'direction', 'which', 'relaxes', 'to', 'a', 'near', 'constant', 'value', 'its', 'characteristic', 'shape', 'in', 'the', 'first', 'half', 'millisecond', 'after', 'the', 'end', 'of', 'the', 'elm', 'and', 'then', 'grows', 'slowly', 'in', 'contrast', 'the', 'level', 'of', 'the', 'fluctuations', 'in', 'the', 'ion', 'drift', 'direction', 'increases', 'exponentially', 'by', 'a', 'factor', 'of', 'eight', 'in', 'the', 'five', 'millisecondsafter', 'the', 'elm', 'high', 'frequency', 'precursors', 'are', 'found', 'which', 'occur', 'one', 'millisecond', 'before', 'the', 'elms', 'and', 'propagate', 'in', 'the', 'ion', 'drift', 'direction', 'these', 'precursors', 'are', 'very', 'short', 'sim', '10', 'musecs', 'coherent', 'bursts', 'and', 'they', 'predict', 'the', 'occurrence', 'of', 'an', 'elm', 'with', 'a', 'high', 'success', 'rate']]
|
[-0.1358510077096008, 0.22324683374268764, -0.05532723547662412, 0.042786423933613774, -0.0069988437364470225, -0.1079926868816802, -0.0002807169569249468, 0.3529985522426722, -0.24823423311778012, -0.2800044570139599, 0.11462294620638393, -0.278875307143301, -0.05111738157430057, 0.2015185055048187, -0.006795464287948227, 0.017780642113766554, 0.04769960718703995, 0.03675115851139457, -0.029309455437364476, -0.1792181681094948, 0.2565507882183696, 0.12500635436307853, 0.31774114868853426, -0.016425536027743742, 0.07917086820169869, -0.04767794764718448, -0.01770447956293757, -0.006620346707687981, -0.06622634212070741, 0.035526203046021165, 0.20889895818092757, 0.06206072487607884, 0.3124223314582502, -0.4020508423299748, -0.2378642158350868, 0.05380437149437879, 0.17290848086847233, 0.0794928348770408, -0.011994497198711856, -0.2294490581745874, 0.09365515248186287, -0.16286383185293027, -0.13183282815826294, 0.03423968049892941, 0.05480894026787188, 0.0557382268245935, -0.2759805878850014, 0.13082824543767904, 0.07793223874650582, 0.049559039485701485, -0.10458110349245683, -0.09674056406602106, -0.03556256227362972, 0.05671233839223382, 0.08756860810995701, 0.0553153049822101, 0.184124028600995, -0.13405263012496332, -0.05455324462288456, 0.30712346962503234, -0.11776826100476788, -0.10476892266843568, 0.16779703553855219, -0.21228570390003823, -0.04726900458855508, 0.24044876463240247, 0.14997325755898408, 0.08593412663366545, -0.08235226824930494, -0.0009360633575225024, 0.0407665065334489, 0.17027455493215124, 0.12986462377903848, 0.010231645913416399, 0.25752190178995277, 0.15755505681615964, 0.06540326191954514, 0.13040013548793625, -0.20728748525453597, -0.024163861735367085, -0.28542649825536237, -0.07521778408177482, -0.15662169376228957, 0.015017406991326119, -0.08263798929374912, -0.19623949179886144, 0.47900442944989463, 0.12274682803714641, 0.19375987999119806, -0.014596564469098959, 0.26565589615896745, 0.17243375735521546, 0.06845604388457652, 0.12076393064286317, 0.27657818537601536, 0.16424088854961796, 0.1512547931736478, -0.25129188517540324, 0.047642916494488034, 0.0024595117059061696]
|
1,803.06453
|
Constrained Deep Learning using Conditional Gradient and Applications in
Computer Vision
|
A number of results have recently demonstrated the benefits of incorporating
various constraints when training deep architectures in vision and machine
learning. The advantages range from guarantees for statistical generalization
to better accuracy to compression. But support for general constraints within
widely used libraries remains scarce and their broader deployment within many
applications that can benefit from them remains under-explored. Part of the
reason is that Stochastic gradient descent (SGD), the workhorse for training
deep neural networks, does not natively deal with constraints with global scope
very well. In this paper, we revisit a classical first order scheme from
numerical optimization, Conditional Gradients (CG), that has, thus far had
limited applicability in training deep models. We show via rigorous analysis
how various constraints can be naturally handled by modifications of this
algorithm. We provide convergence guarantees and show a suite of immediate
benefits that are possible -- from training ResNets with fewer layers but
better accuracy simply by substituting in our version of CG to faster training
of GANs with 50% fewer epochs in image inpainting applications to provably
better generalization guarantees using efficiently implementable forms of
recently proposed regularizers.
|
cs.LG cs.CV stat.ML
|
a number of results have recently demonstrated the benefits of incorporating various constraints when training deep architectures in vision and machine learning the advantages range from guarantees for statistical generalization to better accuracy to compression but support for general constraints within widely used libraries remains scarce and their broader deployment within many applications that can benefit from them remains underexplored part of the reason is that stochastic gradient descent sgd the workhorse for training deep neural networks does not natively deal with constraints with global scope very well in this paper we revisit a classical first order scheme from numerical optimization conditional gradients cg that has thus far had limited applicability in training deep models we show via rigorous analysis how various constraints can be naturally handled by modifications of this algorithm we provide convergence guarantees and show a suite of immediate benefits that are possible from training resnets with fewer layers but better accuracy simply by substituting in our version of cg to faster training of gans with 50 fewer epochs in image inpainting applications to provably better generalization guarantees using efficiently implementable forms of recently proposed regularizers
|
[['a', 'number', 'of', 'results', 'have', 'recently', 'demonstrated', 'the', 'benefits', 'of', 'incorporating', 'various', 'constraints', 'when', 'training', 'deep', 'architectures', 'in', 'vision', 'and', 'machine', 'learning', 'the', 'advantages', 'range', 'from', 'guarantees', 'for', 'statistical', 'generalization', 'to', 'better', 'accuracy', 'to', 'compression', 'but', 'support', 'for', 'general', 'constraints', 'within', 'widely', 'used', 'libraries', 'remains', 'scarce', 'and', 'their', 'broader', 'deployment', 'within', 'many', 'applications', 'that', 'can', 'benefit', 'from', 'them', 'remains', 'underexplored', 'part', 'of', 'the', 'reason', 'is', 'that', 'stochastic', 'gradient', 'descent', 'sgd', 'the', 'workhorse', 'for', 'training', 'deep', 'neural', 'networks', 'does', 'not', 'natively', 'deal', 'with', 'constraints', 'with', 'global', 'scope', 'very', 'well', 'in', 'this', 'paper', 'we', 'revisit', 'a', 'classical', 'first', 'order', 'scheme', 'from', 'numerical', 'optimization', 'conditional', 'gradients', 'cg', 'that', 'has', 'thus', 'far', 'had', 'limited', 'applicability', 'in', 'training', 'deep', 'models', 'we', 'show', 'via', 'rigorous', 'analysis', 'how', 'various', 'constraints', 'can', 'be', 'naturally', 'handled', 'by', 'modifications', 'of', 'this', 'algorithm', 'we', 'provide', 'convergence', 'guarantees', 'and', 'show', 'a', 'suite', 'of', 'immediate', 'benefits', 'that', 'are', 'possible', 'from', 'training', 'resnets', 'with', 'fewer', 'layers', 'but', 'better', 'accuracy', 'simply', 'by', 'substituting', 'in', 'our', 'version', 'of', 'cg', 'to', 'faster', 'training', 'of', 'gans', 'with', '50', 'fewer', 'epochs', 'in', 'image', 'inpainting', 'applications', 'to', 'provably', 'better', 'generalization', 'guarantees', 'using', 'efficiently', 'implementable', 'forms', 'of', 'recently', 'proposed', 'regularizers']]
|
[-0.005230613286907553, -0.020387337987789165, -0.07357191933545644, 0.08404641512167892, -0.12974594293960504, -0.1732961686066889, 0.04111027580663739, 0.44693571439126223, -0.2886163320973831, -0.3664811846489708, 0.09874954940899024, -0.20528578097936967, -0.1861759015875154, 0.2288566531118242, -0.15470474903969458, 0.11055557340867901, 0.14709734263775684, -0.016786761691383573, -0.10978888744942933, -0.33268214194547563, 0.23693416808317933, 0.06990646201918252, 0.31064773139312235, 0.030233965637211604, 0.09895121380095444, -0.0493926862131548, 0.02428808266779891, 0.0463323626401169, -0.04535380480552299, 0.1633432354647469, 0.2983442668814162, 0.2280356388750964, 0.37238452470955, -0.4626036271115361, -0.269291433786589, 0.11241937707616854, 0.19950747751078332, 0.12955173007434323, -0.08486727689190832, -0.2761909169053767, 0.12514030104413723, -0.1775153881966299, -0.025217316130659095, -0.19396461185225577, -0.05298933867000477, 0.03230464068012282, -0.2748719645940043, 0.04156748492457958, 0.08282787259729707, 0.0614684915766625, -0.021624748563029306, -0.15738467877994355, 0.02990729846035638, 0.08695049997663652, 0.05506126410524957, 0.03894733392421609, 0.11248986750456785, -0.17482744146473508, -0.12526130190897714, 0.3628353641944982, -0.05844194014130466, -0.19631535469224212, 0.21788301604932972, -0.04293517653569185, -0.1930882318078407, 0.11902616905521542, 0.21012763378657548, 0.11071304184823204, -0.16522553707412924, 0.07683157569651182, -5.8193322118352015e-05, 0.15061739790277978, 0.032056842166831884, 0.031710432533472874, 0.13114710397545307, 0.22764506170195994, 0.08389725608390229, 0.1316536677352685, -0.0642163281853461, -0.12382397746141241, -0.2236882704926073, -0.09583460106317289, -0.1882807157142827, -0.011593188159706726, -0.09684904537106083, -0.1056625937321408, 0.36520560000469604, 0.22537375559935485, 0.2003291935053846, 0.14656870606448993, 0.37524459746582484, 0.022298642052904206, 0.14521143944051965, 0.1251432533171422, 0.24700859284999155, 0.08270476095220715, 0.12467737454507086, -0.12245009824259098, 0.0916658802815373, 0.024973601479176925]
|
1,803.06454
|
Some Questions in $l-$adic Cohomology
|
The comparison theorem for a smooth projective variety $X$ over $\mathbb{C}$
tells us that the Betti numbers are independent of $l$. We aim to understand
the $l$ independence of Betti numbers for smooth projective varieties $X$ over
$k$, where $k$ is an algebraic extension of $\mathbb{F}_p$.
|
math.AG
|
the comparison theorem for a smooth projective variety x over mathbbc tells us that the betti numbers are independent of l we aim to understand the l independence of betti numbers for smooth projective varieties x over k where k is an algebraic extension of mathbbf_p
|
[['the', 'comparison', 'theorem', 'for', 'a', 'smooth', 'projective', 'variety', 'x', 'over', 'mathbbc', 'tells', 'us', 'that', 'the', 'betti', 'numbers', 'are', 'independent', 'of', 'l', 'we', 'aim', 'to', 'understand', 'the', 'l', 'independence', 'of', 'betti', 'numbers', 'for', 'smooth', 'projective', 'varieties', 'x', 'over', 'k', 'where', 'k', 'is', 'an', 'algebraic', 'extension', 'of', 'mathbbf_p']]
|
[-0.272306344208672, 0.03614375499645299, -0.11125536849114882, 0.05700963488830577, -0.12215978492673932, -0.14207720638090826, 0.026466208263350974, 0.2958417354232591, -0.3370997654679029, -0.19555642016474967, 0.0020492587076581044, -0.2214753206859788, -0.03311679232865572, 0.2708134782379088, -0.14540873688099015, -0.023023340344914923, -0.051811858869927084, 0.13374651006787366, -0.08473837091688714, -0.379347105955948, 0.3789990053552648, -0.12205918521984764, 0.1952652321399554, 0.019307736692059298, 0.1324417532786079, 0.03671923350244153, -0.016920578625539074, -0.004890335359327171, -0.2057807582549804, 0.11451596594871143, 0.410563532182056, 0.09697087985351453, 0.1959668533147677, -0.33401035227934306, -0.12725752623468314, 0.2917006828457765, 0.133778943852319, -0.07318326073658207, 0.11851084280921065, -0.17122018400012798, 0.1667191740353187, -0.11925171850168187, -0.19454693391352243, -0.10693325790698113, 0.13684042231382235, 0.041339896831904414, -0.28220208628993965, -0.07575997186232479, 0.08901444628186848, 0.2163723707401558, 0.030268734128659835, -0.13892168091842905, -0.06349136243047922, 0.019376052938320714, -0.04130736703518778, 0.10323413136496168, 0.05718352529220283, -0.04988179835693344, -0.07283203498176906, 0.3065058159358475, -0.049351072212195264, -0.19365330874595954, 0.09606257511262337, -0.21201947580456085, -0.1201087154103848, 0.23346373248521401, 0.10938748105874528, 0.21163311070236174, 0.08956610496439364, 0.25132922560948395, -0.21334250360403373, 0.10006695868366439, 0.11013701510534663, -0.025997668494591893, 0.14917894031690515, 0.05376880143708347, 0.06898173640239173, 0.07200533750912418, -0.02659006327714609, -0.03419240876910803, -0.41219553262319253, -0.25235797818332567, -0.14485315489709255, 0.2766645647301946, -0.14992038504746946, -0.12103012843948344, 0.35642507105417875, 0.08989938572251602, 0.2538023777913464, 0.14970776570313002, 0.2485349992411616, -0.05447678043223594, -0.024133546743541956, 0.020008816333163693, 0.005092571975420351, 0.34494607681003603, -0.02718122034718323, -0.10105545797547244, 0.016027329216265807, 0.175146388699827]
|
1,803.06455
|
A-infinity algebras, strand algebras, and contact categories
|
In previous work we showed that the contact category algebra of a
quadrangulated surface is isomorphic to the homology of a strand algebra from
bordered sutured Floer theory. Being isomorphic to the homology of a
differential graded algebra, this contact category algebra has an A-infinity
structure, allowing us to combine contact structures not just by gluing, but
also by higher-order operations.
In this paper we investigate such A-infinity structures and higher order
operations on contact structures. We give explicit constructions of such
A-infinity structures, and establish some of their properties, including
conditions for the vanishing and nonvanishing of A-infinity operations. Along
the way we develop several related notions, including a detailed consideration
of tensor products of strand diagrams.
|
math.GT math.AT math.SG
|
in previous work we showed that the contact category algebra of a quadrangulated surface is isomorphic to the homology of a strand algebra from bordered sutured floer theory being isomorphic to the homology of a differential graded algebra this contact category algebra has an ainfinity structure allowing us to combine contact structures not just by gluing but also by higherorder operations in this paper we investigate such ainfinity structures and higher order operations on contact structures we give explicit constructions of such ainfinity structures and establish some of their properties including conditions for the vanishing and nonvanishing of ainfinity operations along the way we develop several related notions including a detailed consideration of tensor products of strand diagrams
|
[['in', 'previous', 'work', 'we', 'showed', 'that', 'the', 'contact', 'category', 'algebra', 'of', 'a', 'quadrangulated', 'surface', 'is', 'isomorphic', 'to', 'the', 'homology', 'of', 'a', 'strand', 'algebra', 'from', 'bordered', 'sutured', 'floer', 'theory', 'being', 'isomorphic', 'to', 'the', 'homology', 'of', 'a', 'differential', 'graded', 'algebra', 'this', 'contact', 'category', 'algebra', 'has', 'an', 'ainfinity', 'structure', 'allowing', 'us', 'to', 'combine', 'contact', 'structures', 'not', 'just', 'by', 'gluing', 'but', 'also', 'by', 'higherorder', 'operations', 'in', 'this', 'paper', 'we', 'investigate', 'such', 'ainfinity', 'structures', 'and', 'higher', 'order', 'operations', 'on', 'contact', 'structures', 'we', 'give', 'explicit', 'constructions', 'of', 'such', 'ainfinity', 'structures', 'and', 'establish', 'some', 'of', 'their', 'properties', 'including', 'conditions', 'for', 'the', 'vanishing', 'and', 'nonvanishing', 'of', 'ainfinity', 'operations', 'along', 'the', 'way', 'we', 'develop', 'several', 'related', 'notions', 'including', 'a', 'detailed', 'consideration', 'of', 'tensor', 'products', 'of', 'strand', 'diagrams']]
|
[-0.20249037970038983, 0.04915531996701217, -0.10972110139427044, 0.06893562079383597, -0.12728501911377693, -0.13088515870494105, -0.019304031942244934, 0.3861546427548184, -0.397351018670094, -0.26702044002111935, 0.09295691379101284, -0.2054188523174686, -0.22626914108621934, 0.13757337880778617, -0.16899749170988798, -0.03815276393572153, 0.09513228294692176, 0.08578042117819601, -0.1321278442174859, -0.21564673965054929, 0.44007673260156, 0.030417842593170322, 0.2030586470234192, 0.07534196571115467, 0.08068478487873987, -0.006026848404810338, -0.0629273877933945, 0.01858524685741355, -0.24428866464296659, 0.1592511033473568, 0.28078427668897654, 0.015308560223429132, 0.1251268161725158, -0.4614646945748541, -0.1003935856436837, 0.08964690569219953, 0.1163350607039628, 0.08104484595389942, 0.012750917681595468, -0.25446527566508215, 0.07401875771633429, -0.25256533889194666, -0.07856825156674041, -0.112990426167972, 0.027932369655345457, 0.0021731852459074075, -0.16846806023484964, -0.03632074863066841, 0.10428589472736595, 0.13857752012909721, -0.0729468162625365, -0.07290428375699005, -0.09809150407090783, 0.13055522132159794, -0.04052092383765631, 0.0054992034092103525, 0.16410840009891633, -0.11024182894211894, -0.1666946825650284, 0.347293207437684, -0.025098659600312743, -0.21902478858828545, 0.1594405628314589, -0.13584662047293733, -0.22080812879080364, 0.13804407976962374, 0.012125683687943018, 0.11892412644732049, -0.059918401435795, 0.17660110070364218, -0.04990100179467413, 0.05072078125460579, 0.12856073884325006, 0.004408182943302949, 0.14765955129306826, 0.11098613942799679, 0.09449542073090955, 0.17972852735606543, 0.017799139825895555, -0.08052727509432046, -0.32307576223955314, -0.23553833506717267, -0.03430414787035877, 0.13624177927013695, -0.08539911863451796, -0.22103706010127977, 0.40453272443896127, 0.09334052894738014, 0.1888061996672196, 0.11834654715543581, 0.2703081539563708, -0.00012631246314968094, 0.15744210871023331, -0.0012754381237693635, 0.11649171362154509, 0.30003369504179395, 0.02915140877919808, -0.08209902373087292, 0.006238679963921718, 0.20696938190198802]
|
1,803.06456
|
Experiments with Neural Networks for Small and Large Scale Authorship
Verification
|
We propose two models for a special case of authorship verification problem.
The task is to investigate whether the two documents of a given pair are
written by the same author. We consider the authorship verification problem for
both small and large scale datasets. The underlying small-scale problem has two
main challenges: First, the authors of the documents are unknown to us because
no previous writing samples are available. Second, the two documents are short
(a few hundred to a few thousand words) and may differ considerably in the
genre and/or topic. To solve it we propose transformation encoder to transform
one document of the pair into the other. This document transformation generates
a loss which is used as a recognizable feature to verify if the authors of the
pair are identical. For the large scale problem where various authors are
engaged and more examples are available with larger length, a parallel
recurrent neural network is proposed. It compares the language models of the
two documents. We evaluate our methods on various types of datasets including
Authorship Identification datasets of PAN competition, Amazon reviews, and
machine learning articles. Experiments show that both methods achieve stable
and competitive performance compared to the baselines.
|
cs.CL
|
we propose two models for a special case of authorship verification problem the task is to investigate whether the two documents of a given pair are written by the same author we consider the authorship verification problem for both small and large scale datasets the underlying smallscale problem has two main challenges first the authors of the documents are unknown to us because no previous writing samples are available second the two documents are short a few hundred to a few thousand words and may differ considerably in the genre andor topic to solve it we propose transformation encoder to transform one document of the pair into the other this document transformation generates a loss which is used as a recognizable feature to verify if the authors of the pair are identical for the large scale problem where various authors are engaged and more examples are available with larger length a parallel recurrent neural network is proposed it compares the language models of the two documents we evaluate our methods on various types of datasets including authorship identification datasets of pan competition amazon reviews and machine learning articles experiments show that both methods achieve stable and competitive performance compared to the baselines
|
[['we', 'propose', 'two', 'models', 'for', 'a', 'special', 'case', 'of', 'authorship', 'verification', 'problem', 'the', 'task', 'is', 'to', 'investigate', 'whether', 'the', 'two', 'documents', 'of', 'a', 'given', 'pair', 'are', 'written', 'by', 'the', 'same', 'author', 'we', 'consider', 'the', 'authorship', 'verification', 'problem', 'for', 'both', 'small', 'and', 'large', 'scale', 'datasets', 'the', 'underlying', 'smallscale', 'problem', 'has', 'two', 'main', 'challenges', 'first', 'the', 'authors', 'of', 'the', 'documents', 'are', 'unknown', 'to', 'us', 'because', 'no', 'previous', 'writing', 'samples', 'are', 'available', 'second', 'the', 'two', 'documents', 'are', 'short', 'a', 'few', 'hundred', 'to', 'a', 'few', 'thousand', 'words', 'and', 'may', 'differ', 'considerably', 'in', 'the', 'genre', 'andor', 'topic', 'to', 'solve', 'it', 'we', 'propose', 'transformation', 'encoder', 'to', 'transform', 'one', 'document', 'of', 'the', 'pair', 'into', 'the', 'other', 'this', 'document', 'transformation', 'generates', 'a', 'loss', 'which', 'is', 'used', 'as', 'a', 'recognizable', 'feature', 'to', 'verify', 'if', 'the', 'authors', 'of', 'the', 'pair', 'are', 'identical', 'for', 'the', 'large', 'scale', 'problem', 'where', 'various', 'authors', 'are', 'engaged', 'and', 'more', 'examples', 'are', 'available', 'with', 'larger', 'length', 'a', 'parallel', 'recurrent', 'neural', 'network', 'is', 'proposed', 'it', 'compares', 'the', 'language', 'models', 'of', 'the', 'two', 'documents', 'we', 'evaluate', 'our', 'methods', 'on', 'various', 'types', 'of', 'datasets', 'including', 'authorship', 'identification', 'datasets', 'of', 'pan', 'competition', 'amazon', 'reviews', 'and', 'machine', 'learning', 'articles', 'experiments', 'show', 'that', 'both', 'methods', 'achieve', 'stable', 'and', 'competitive', 'performance', 'compared', 'to', 'the', 'baselines']]
|
[-0.10427307174944475, 0.04228852526054229, -0.026428598016131632, 0.10755273782403789, -0.13400666570950226, -0.15039203886754146, -0.003837664256628492, 0.411217248486816, -0.2805610501050654, -0.34610264520345274, 0.10381549044159509, -0.3402144257544014, -0.12039511791882243, 0.2165123460595934, -0.06808090259293371, 0.05481834943858114, 0.13325419848194658, 0.06089095149355212, -0.04744618693954487, -0.336732563481431, 0.33555871087569045, 0.005013417066443748, 0.3218566736501485, 0.034527865577360047, 0.09540916574279787, -0.06156288169204525, -0.08999191198640936, -0.012897005757100254, -0.06251756477275303, 0.14769780332231802, 0.3068721244199329, 0.19170556272297065, 0.3210734295852409, -0.3899002189489801, -0.17671502522183674, 0.07775104436666087, 0.11183636540450193, 0.1349707195297717, -0.016828525410103497, -0.2931409970947108, 0.10819103040658676, -0.18258238631752458, 0.019894725283478746, -0.08828188928932247, 0.028644492932696743, 0.007812804030715534, -0.23782821610341734, 0.034372875480306056, 0.0705552323338677, 0.04884014194277991, -0.023430971666193096, -0.13425073479440544, 0.05631266607174484, 0.182331970706121, 0.09350056629362839, 0.029229447250496504, 0.09571231749268377, -0.13682008300193138, -0.1579075902101058, 0.4103746722627542, -0.05853420430056677, -0.2085262701228851, 0.23426178083662866, -0.04402187730803495, -0.1646056266404725, 0.06823914825840217, 0.19068608832105274, 0.1358453520495297, -0.16782163012090442, 3.6564548407672066e-06, -0.07791975509412218, 0.19970221272531416, 0.09408135050654153, -0.01990650286310177, 0.1626504864993201, 0.21044273189462648, -0.005902972674034167, 0.16675788933661362, -0.08143420059966974, -0.07782094160758771, -0.22617249793400712, -0.1206093499676721, -0.18617308623904344, -0.041470756316280895, -0.047609153728903904, -0.1546864493952898, 0.428291457880399, 0.20436926964511357, 0.19965903821751696, 0.05883269045688673, 0.2958346969369651, 0.033143339544940406, 0.08322760332528488, 0.07236473715494128, 0.16954908086307402, 0.025073484612725638, 0.11268309161924564, -0.12918541102343364, 0.08007034234066338, 0.05615852426018308]
|
1,803.06457
|
Generalization of a Real-Analysis Result to a Class of Topological
Vector Spaces
|
In this paper, we generalize an elementary real-analysis result to a class of
topological vector spaces. We also give an example of a topological vector
space to which the result cannot be generalized.
|
math.FA math.PR
|
in this paper we generalize an elementary realanalysis result to a class of topological vector spaces we also give an example of a topological vector space to which the result cannot be generalized
|
[['in', 'this', 'paper', 'we', 'generalize', 'an', 'elementary', 'realanalysis', 'result', 'to', 'a', 'class', 'of', 'topological', 'vector', 'spaces', 'we', 'also', 'give', 'an', 'example', 'of', 'a', 'topological', 'vector', 'space', 'to', 'which', 'the', 'result', 'can', 'not', 'be', 'generalized']]
|
[-0.11228122804878336, 0.18013436565348512, -0.10602303430663818, 0.08279923093857977, -0.16508747930779602, -0.0524262979795987, 0.023327642688386593, 0.34941159177458647, -0.33194074937791535, -0.23596534144246217, 0.07599498100480008, -0.18264183819745528, -0.2519158614309025, 0.21799284389073198, -0.14750153960829432, -0.011894420410195986, -0.01808774567237406, 0.07548517654791023, -0.10931539908051491, -0.31393337136868277, 0.40113761467915593, -0.030339754091321745, 0.21064099567857655, 0.0901074287213498, 0.054056967326411694, 0.02522277029118303, 0.040127539160576736, 0.05830140616374344, -0.16617324327429137, 0.16528120687739414, 0.2793700198332469, 0.10154814673869898, 0.21820241147934488, -0.3498743526411779, -0.21061381450713132, 0.20245104370582284, 0.13886566210368817, 0.15866670933566196, -0.04050849829659318, -0.30566867339340126, 0.14884803099839977, -0.22470581988719376, -0.15795227467562212, -0.15671822626256582, -0.025143955636656647, -0.04380298072867321, -0.2750343086734188, -0.054629375827392905, 0.18406263925135136, 0.03392171193704461, -0.12179089156967221, -0.011253033143778643, 0.024893399892431316, 0.06742190501906654, 0.012991059797279762, 0.10027738800272346, 0.008584022394974123, -0.07054861940471738, -0.18669539864993456, 0.3576257515585784, -0.10141537039343154, -0.3140793622217395, 0.16613905628522238, -0.07591344551606612, -0.18031070573311864, 0.05942497083522154, 0.21392640550479744, 0.14721318165009672, -0.10420061422116829, 0.063246953498685, -0.15922729140429787, 0.11817597755880067, -0.005791817311987732, 0.08437172679061239, 0.1452361484989524, 0.10192741342171123, 0.1328660324215889, 0.20581692019406933, -0.018064253822420582, -0.034072632342224206, -0.38114318748315174, -0.2862043069167571, -0.19188912836552569, 0.0914466035711953, -0.03841513248555588, -0.22528275429750932, 0.42285729638498387, 0.11922010049844782, 0.2648571375193018, 0.05898671721771472, 0.21821340816942128, 0.1489517782165697, 0.00363688509572636, 0.03624154841809562, 0.1760849694608513, 0.1403071251556729, 0.06320741476321762, -0.05737975225642775, -0.03066660130791592, 0.15870217620536234]
|
1,803.06458
|
A local $\psi$-epistemic retrocausal hidden-variable model of Bell
correlations with wavefunctions in physical space
|
We construct a local $\psi$-epistemic hidden-variable model of Bell
correlations by a retrocausal adaptation of the originally superdeterministic
model given by Brans. In our model, for a pair of particles the joint quantum
state $|\psi_e(t)\rangle$ as determined by preparation is epistemic. The model
also assigns to the pair of particles a factorisable joint quantum state
$|\psi_o(t)\rangle$ which is different from the prepared quantum state
$|\psi_e(t)\rangle$ and has an ontic status. The ontic state of a single
particle consists of two parts. First, a single particle ontic quantum state
$\chi(\vec{x},t)|i\rangle$, where $\chi(\vec{x},t)$ is a 3-space wavepacket and
$|i\rangle$ is a spin eigenstate of the future measurement setting. Second, a
particle position in 3-space $\vec{x}(t)$, which evolves via a de Broglie-Bohm
type guidance equation with the 3-space wavepacket $\chi(\vec{x},t)$ acting as
a local pilot wave. The joint ontic quantum state $|\psi_o(t)\rangle$ fixes the
measurement outcomes deterministically whereas the prepared quantum state
$|\psi_e(t)\rangle$ determines the distribution of the $|\psi_o(t)\rangle$'s
over an ensemble. Both $|\psi_o(t)\rangle$ and $|\psi_e(t)\rangle$ evolve via
the Schrodinger equation. Our model exactly reproduces the Bell correlations
for any pair of measurement settings. We also consider `non-equilibrium'
extensions of the model with an arbitrary distribution of hidden variables. We
show that, in non-equilibrium, the model generally violates no-signalling
constraints while remaining local with respect to both ontology and interaction
between particles. We argue that our model shares some structural similarities
with the modal class of interpretations of quantum mechanics.
|
quant-ph
|
we construct a local psiepistemic hiddenvariable model of bell correlations by a retrocausal adaptation of the originally superdeterministic model given by brans in our model for a pair of particles the joint quantum state psi_etrangle as determined by preparation is epistemic the model also assigns to the pair of particles a factorisable joint quantum state psi_otrangle which is different from the prepared quantum state psi_etrangle and has an ontic status the ontic state of a single particle consists of two parts first a single particle ontic quantum state chivecxtirangle where chivecxt is a 3space wavepacket and irangle is a spin eigenstate of the future measurement setting second a particle position in 3space vecxt which evolves via a de brogliebohm type guidance equation with the 3space wavepacket chivecxt acting as a local pilot wave the joint ontic quantum state psi_otrangle fixes the measurement outcomes deterministically whereas the prepared quantum state psi_etrangle determines the distribution of the psi_otrangles over an ensemble both psi_otrangle and psi_etrangle evolve via the schrodinger equation our model exactly reproduces the bell correlations for any pair of measurement settings we also consider nonequilibrium extensions of the model with an arbitrary distribution of hidden variables we show that in nonequilibrium the model generally violates nosignalling constraints while remaining local with respect to both ontology and interaction between particles we argue that our model shares some structural similarities with the modal class of interpretations of quantum mechanics
|
[['we', 'construct', 'a', 'local', 'psiepistemic', 'hiddenvariable', 'model', 'of', 'bell', 'correlations', 'by', 'a', 'retrocausal', 'adaptation', 'of', 'the', 'originally', 'superdeterministic', 'model', 'given', 'by', 'brans', 'in', 'our', 'model', 'for', 'a', 'pair', 'of', 'particles', 'the', 'joint', 'quantum', 'state', 'psi_etrangle', 'as', 'determined', 'by', 'preparation', 'is', 'epistemic', 'the', 'model', 'also', 'assigns', 'to', 'the', 'pair', 'of', 'particles', 'a', 'factorisable', 'joint', 'quantum', 'state', 'psi_otrangle', 'which', 'is', 'different', 'from', 'the', 'prepared', 'quantum', 'state', 'psi_etrangle', 'and', 'has', 'an', 'ontic', 'status', 'the', 'ontic', 'state', 'of', 'a', 'single', 'particle', 'consists', 'of', 'two', 'parts', 'first', 'a', 'single', 'particle', 'ontic', 'quantum', 'state', 'chivecxtirangle', 'where', 'chivecxt', 'is', 'a', '3space', 'wavepacket', 'and', 'irangle', 'is', 'a', 'spin', 'eigenstate', 'of', 'the', 'future', 'measurement', 'setting', 'second', 'a', 'particle', 'position', 'in', '3space', 'vecxt', 'which', 'evolves', 'via', 'a', 'de', 'brogliebohm', 'type', 'guidance', 'equation', 'with', 'the', '3space', 'wavepacket', 'chivecxt', 'acting', 'as', 'a', 'local', 'pilot', 'wave', 'the', 'joint', 'ontic', 'quantum', 'state', 'psi_otrangle', 'fixes', 'the', 'measurement', 'outcomes', 'deterministically', 'whereas', 'the', 'prepared', 'quantum', 'state', 'psi_etrangle', 'determines', 'the', 'distribution', 'of', 'the', 'psi_otrangles', 'over', 'an', 'ensemble', 'both', 'psi_otrangle', 'and', 'psi_etrangle', 'evolve', 'via', 'the', 'schrodinger', 'equation', 'our', 'model', 'exactly', 'reproduces', 'the', 'bell', 'correlations', 'for', 'any', 'pair', 'of', 'measurement', 'settings', 'we', 'also', 'consider', 'nonequilibrium', 'extensions', 'of', 'the', 'model', 'with', 'an', 'arbitrary', 'distribution', 'of', 'hidden', 'variables', 'we', 'show', 'that', 'in', 'nonequilibrium', 'the', 'model', 'generally', 'violates', 'nosignalling', 'constraints', 'while', 'remaining', 'local', 'with', 'respect', 'to', 'both', 'ontology', 'and', 'interaction', 'between', 'particles', 'we', 'argue', 'that', 'our', 'model', 'shares', 'some', 'structural', 'similarities', 'with', 'the', 'modal', 'class', 'of', 'interpretations', 'of', 'quantum', 'mechanics']]
|
[-0.11086561945227051, 0.17953883011118646, -0.1394997500103015, 0.05404424882152162, -0.02540516228287165, -0.18520382221972034, 0.023270997579525277, 0.28612981493636774, -0.24611797456322548, -0.2779887787482597, -0.0013623173781290906, -0.2722481035031858, -0.08258072136066426, 0.11442444059356263, -0.023584924343485754, 0.07065340276215977, 0.061541122220488576, 0.06654921294911464, -0.060122356672127744, -0.20136492279839857, 0.34432071744106596, 0.02745209927540752, 0.2731845588003617, -0.02989822192429345, 0.15850229488581802, 0.08941296254466548, 0.04293196396142756, 0.004636387090031817, -0.09792053762066644, 0.06656301675800058, 0.20532740433245714, 0.16726322649166692, 0.2604937449001703, -0.41397989805500013, -0.22577294861885835, 0.12544258900062688, 0.10656956701675357, 0.15933101557798748, -0.0070641044015914214, -0.36249049537707234, -0.028641966355678748, -0.1867156415286398, -0.12996189537869823, -0.03687944483859345, -0.006863810703090428, -0.027735096952316348, -0.2414145825566652, 0.10392245403495957, 0.0809549323528957, 0.016161619641622247, -0.06718248551383678, -0.05078007320747531, -0.030655551564883712, 0.08222745213449768, -0.04882457287824221, 0.030822152639599316, 0.13467492823101293, -0.12722958879527344, -0.19179704395230748, 0.36936828444508013, -0.04318489443087079, -0.24043183068456547, 0.13093594920795507, -0.11581638829718652, -0.12578429027746307, 0.05550747467484725, 0.08909002714690477, 0.08928446558028331, -0.14043715077376417, 0.10370474959156065, -0.0741631477718844, 0.19406637969944435, 0.02837401031778302, 0.058457651152575285, 0.2263930412059322, 0.10438092100302102, 0.03130050880290856, 0.13921272840406826, -0.053250508990474524, -0.2021743248960267, -0.3731463224079476, -0.216370030903845, -0.22380243729532182, 0.07655209809152735, -0.05733033050578128, -0.15983882684424489, 0.40548306592648187, 0.10967151069256194, 0.177834357508726, 0.04087195765374972, 0.23589553874207844, 0.10114569734440229, -0.02468709982212137, 0.04343955132854471, 0.2177364475903443, 0.13426250478956256, 0.056629330457923656, -0.23191565899550615, 0.09691803081484728, 0.046880321745069245]
|
1,803.06459
|
Learning to Cluster for Proposal-Free Instance Segmentation
|
This work proposed a novel learning objective to train a deep neural network
to perform end-to-end image pixel clustering. We applied the approach to
instance segmentation, which is at the intersection of image semantic
segmentation and object detection. We utilize the most fundamental property of
instance labeling -- the pairwise relationship between pixels -- as the
supervision to formulate the learning objective, then apply it to train a fully
convolutional network (FCN) for learning to perform pixel-wise clustering. The
resulting clusters can be used as the instance labeling directly. To support
labeling of an unlimited number of instance, we further formulate ideas from
graph coloring theory into the proposed learning objective. The evaluation on
the Cityscapes dataset demonstrates strong performance and therefore proof of
the concept. Moreover, our approach won the second place in the lane detection
competition of 2017 CVPR Autonomous Driving Challenge, and was the top
performer without using external data.
|
cs.CV cs.AI cs.LG
|
this work proposed a novel learning objective to train a deep neural network to perform endtoend image pixel clustering we applied the approach to instance segmentation which is at the intersection of image semantic segmentation and object detection we utilize the most fundamental property of instance labeling the pairwise relationship between pixels as the supervision to formulate the learning objective then apply it to train a fully convolutional network fcn for learning to perform pixelwise clustering the resulting clusters can be used as the instance labeling directly to support labeling of an unlimited number of instance we further formulate ideas from graph coloring theory into the proposed learning objective the evaluation on the cityscapes dataset demonstrates strong performance and therefore proof of the concept moreover our approach won the second place in the lane detection competition of 2017 cvpr autonomous driving challenge and was the top performer without using external data
|
[['this', 'work', 'proposed', 'a', 'novel', 'learning', 'objective', 'to', 'train', 'a', 'deep', 'neural', 'network', 'to', 'perform', 'endtoend', 'image', 'pixel', 'clustering', 'we', 'applied', 'the', 'approach', 'to', 'instance', 'segmentation', 'which', 'is', 'at', 'the', 'intersection', 'of', 'image', 'semantic', 'segmentation', 'and', 'object', 'detection', 'we', 'utilize', 'the', 'most', 'fundamental', 'property', 'of', 'instance', 'labeling', 'the', 'pairwise', 'relationship', 'between', 'pixels', 'as', 'the', 'supervision', 'to', 'formulate', 'the', 'learning', 'objective', 'then', 'apply', 'it', 'to', 'train', 'a', 'fully', 'convolutional', 'network', 'fcn', 'for', 'learning', 'to', 'perform', 'pixelwise', 'clustering', 'the', 'resulting', 'clusters', 'can', 'be', 'used', 'as', 'the', 'instance', 'labeling', 'directly', 'to', 'support', 'labeling', 'of', 'an', 'unlimited', 'number', 'of', 'instance', 'we', 'further', 'formulate', 'ideas', 'from', 'graph', 'coloring', 'theory', 'into', 'the', 'proposed', 'learning', 'objective', 'the', 'evaluation', 'on', 'the', 'cityscapes', 'dataset', 'demonstrates', 'strong', 'performance', 'and', 'therefore', 'proof', 'of', 'the', 'concept', 'moreover', 'our', 'approach', 'won', 'the', 'second', 'place', 'in', 'the', 'lane', 'detection', 'competition', 'of', '2017', 'cvpr', 'autonomous', 'driving', 'challenge', 'and', 'was', 'the', 'top', 'performer', 'without', 'using', 'external', 'data']]
|
[-0.03004795327067178, -0.056925140152317595, -0.09649495463139865, 0.06255381207046598, -0.14166820586955065, -0.15160163782771355, 0.044301008864225735, 0.4519421456085629, -0.28170823974308207, -0.3796535456238549, 0.0486729589903061, -0.24235438458029404, -0.19939310210972827, 0.1325325755747837, -0.14814578604865944, 0.08960279629377661, 0.15503374793696284, 0.08056891800848064, 0.0030346838664880257, -0.28695326603410165, 0.2976919360742565, 0.022061600378947333, 0.3612415252364432, 0.06160860691090046, 0.15478483353285058, 0.00520767165588474, -0.02833093324096392, -0.006431286018156749, -0.04539539330386069, 0.18907329253274147, 0.33779827306596005, 0.21425597116486816, 0.3435805155679781, -0.4083638320374765, -0.2013124009989054, 0.11319055733277111, 0.11639031038514727, 0.0907344045988685, -0.023341317627955202, -0.3742139780314158, 0.09535710495859631, -0.17364001399004794, 0.04960923425433849, -0.1148865519419917, -0.023489432705455268, -0.048317420090524026, -0.2994087054116639, -0.002186978729256731, 0.1031987458808249, 0.028961651149014663, -0.07423259574913771, -0.045712971355186295, 0.0295730475382571, 0.20725914652132435, -0.011588592725244677, 0.12033530809787034, 0.13356950421453706, -0.2157767004755924, -0.1455496925967036, 0.35666704751452466, -0.055784188994262, -0.18327256839796408, 0.19767308720874766, 0.003767143552567785, -0.17299291787866428, 0.06939174609246436, 0.25258287014007963, 0.11904468017920161, -0.15176549834038888, -0.03036914881594812, -0.05881473001721778, 0.18952934455360895, 0.06075142367761459, -0.06247414797791187, 0.15918002842728124, 0.2909777505116673, 0.0785032384203969, 0.1811125284895017, -0.19794111185867513, -0.03322121201989716, -0.22938168644041612, -0.11134086005146451, -0.23896531470810736, -0.034000030604641365, -0.09133593064537411, -0.146960994816194, 0.4044359198752914, 0.2468044987913616, 0.2111882376299542, 0.12627694633440886, 0.3645255750920994, 0.019602870885498624, 0.119032123301869, 0.06492158808184183, 0.19707131815846046, 0.04774860591189751, 0.10487168788330148, -0.1775009211228732, 0.07168807164112119, 0.14669963621244525]
|
1,803.0646
|
Mean Reverting Portfolios via Penalized OU-Likelihood Estimation
|
We study an optimization-based approach to con- struct a mean-reverting
portfolio of assets. Our objectives are threefold: (1) design a portfolio that
is well-represented by an Ornstein-Uhlenbeck process with parameters estimated
by maximum likelihood, (2) select portfolios with desirable characteristics of
high mean reversion and low variance, and (3) select a parsimonious portfolio,
i.e. find a small subset of a larger universe of assets that can be used for
long and short positions. We present the full problem formulation, a
specialized algorithm that exploits partial minimization, and numerical
examples using both simulated and empirical price data.
|
q-fin.PM math.OC stat.ML
|
we study an optimizationbased approach to con struct a meanreverting portfolio of assets our objectives are threefold 1 design a portfolio that is wellrepresented by an ornsteinuhlenbeck process with parameters estimated by maximum likelihood 2 select portfolios with desirable characteristics of high mean reversion and low variance and 3 select a parsimonious portfolio ie find a small subset of a larger universe of assets that can be used for long and short positions we present the full problem formulation a specialized algorithm that exploits partial minimization and numerical examples using both simulated and empirical price data
|
[['we', 'study', 'an', 'optimizationbased', 'approach', 'to', 'con', 'struct', 'a', 'meanreverting', 'portfolio', 'of', 'assets', 'our', 'objectives', 'are', 'threefold', '1', 'design', 'a', 'portfolio', 'that', 'is', 'wellrepresented', 'by', 'an', 'ornsteinuhlenbeck', 'process', 'with', 'parameters', 'estimated', 'by', 'maximum', 'likelihood', '2', 'select', 'portfolios', 'with', 'desirable', 'characteristics', 'of', 'high', 'mean', 'reversion', 'and', 'low', 'variance', 'and', '3', 'select', 'a', 'parsimonious', 'portfolio', 'ie', 'find', 'a', 'small', 'subset', 'of', 'a', 'larger', 'universe', 'of', 'assets', 'that', 'can', 'be', 'used', 'for', 'long', 'and', 'short', 'positions', 'we', 'present', 'the', 'full', 'problem', 'formulation', 'a', 'specialized', 'algorithm', 'that', 'exploits', 'partial', 'minimization', 'and', 'numerical', 'examples', 'using', 'both', 'simulated', 'and', 'empirical', 'price', 'data']]
|
[-0.05405277159782903, 0.02475573151878052, -0.08341065963031724, 0.1330186103193872, -0.09674905234472438, -0.1488088278856594, 0.0797469705248659, 0.444644727356111, -0.27733285263335955, -0.30813229402216774, 0.16422821904416196, -0.27425223361933604, -0.14903804127243347, 0.1654459819449888, -0.13375099264158052, 0.05040468321628092, 0.061745612086573, -0.0789462929048265, -0.00139260891834662, -0.2843795549561037, 0.2431449006544426, 0.06399494237848558, 0.27251519562560134, -0.054210403687951235, 0.2005822796988165, 0.0188497753891473, -0.025017497789425153, 0.0501198791510736, -0.1369179721234559, 0.14429731299727186, 0.2703869877877878, 0.17491841420996934, 0.38404789306999493, -0.4030806699884124, -0.14710441441032648, 0.12377004500497908, 0.07399244749224938, 0.05428744417925676, -0.005380561502533965, -0.2161373651130513, 0.08399931713938713, -0.19443585279320055, -0.08323788692359813, -0.1048238132740759, 0.012491214908853484, 0.0643706272894633, -0.37645286521486315, 0.058075720685640896, -0.0031608205511777974, 0.030366852626078373, -0.04736097987915855, -0.181149895133179, -0.019872141698821604, 0.06649829072800155, 0.0921388073156777, -0.015586442248604726, 0.12172874476527795, -0.08126355259446427, -0.16804869315577284, 0.345606641843915, -0.09508116231882013, -0.18434632474478954, 0.09961691782033692, -0.08062130533896077, -0.09798527083815618, 0.16745968046840667, 0.21919645006225133, 0.11059532012829247, -0.20177392333668345, 0.02240958628408407, -0.041920666708999, 0.20156411842132607, -0.00228185205439028, -0.034533786281826906, 0.14954054443902956, 0.20852487835509237, 0.1429160269908607, 0.12455868385222857, -0.08292362013404879, -0.09046994128342097, -0.30503622847997275, -0.11289740343697001, -0.1918060386281771, 0.03747081532734834, -0.18887687368578554, -0.15940562070075734, 0.36826275720765506, 0.1446452202629492, 0.17100319990519589, 0.13908408993544677, 0.2779557295919706, 0.11979346262160107, -0.017159971665629808, 0.11321869615737039, 0.13777694350574166, 0.01655177719173177, 0.05512960670360675, -0.18251977786349016, 0.11090752557114077, -0.01299185911678554]
|
1,803.06461
|
Constraints on the cohomological correspondence associated to a self map
|
In this article we establish some constraints on the eigenvalues for the
action of a self map of a proper variety on its $\ell$-adic cohomology. The
essential ingredients are a trace formula due to Fujiwara, and the theory of
weights.
|
math.AG
|
in this article we establish some constraints on the eigenvalues for the action of a self map of a proper variety on its elladic cohomology the essential ingredients are a trace formula due to fujiwara and the theory of weights
|
[['in', 'this', 'article', 'we', 'establish', 'some', 'constraints', 'on', 'the', 'eigenvalues', 'for', 'the', 'action', 'of', 'a', 'self', 'map', 'of', 'a', 'proper', 'variety', 'on', 'its', 'elladic', 'cohomology', 'the', 'essential', 'ingredients', 'are', 'a', 'trace', 'formula', 'due', 'to', 'fujiwara', 'and', 'the', 'theory', 'of', 'weights']]
|
[-0.15664758979110047, 0.011625499511137605, -0.15286154205095953, 0.05229618524608668, -0.08902097274549306, -0.04647985728224739, 0.042713959325919856, 0.29716430087573825, -0.3006713383831084, -0.23081499766558408, 0.1381495130219264, -0.2260036342544481, -0.18978533153422178, 0.2063523308141157, -0.1358046783832833, 0.020783839815703687, 0.06521420548087917, 0.11100532966665924, -0.062187731394078585, -0.22925382802495733, 0.39554490448208524, 0.0050186750362627205, 0.2115163606358692, 0.13358616358600556, 0.13185176725892234, -0.009790135617367923, -0.07191453608684242, -0.059619529731571676, -0.14662081496790053, 0.2260098407510668, 0.23573293373920023, 0.062910254788585, 0.24168232819065452, -0.41448161443695425, -0.14544554878084454, 0.16750058725010603, 0.053593089745845646, 0.077329643513076, -0.00984282829449512, -0.2612472498556599, 0.11460618139244616, -0.17043894527014344, -0.13867084544617683, -0.08100784632842987, 0.050274092610925435, 0.03633624226786196, -0.26455655535683037, 0.0058892119443044065, 0.10010929517447949, 0.11064293624367565, -0.10923882938513998, -0.08504178035072982, 0.014027998759411275, 0.132327154581435, 0.02003790964372456, 0.025449930527247488, 0.09670480164932087, -0.1647656615532469, -0.08039818787947298, 0.3943205413874239, -0.062313705356791614, -0.2159466135315597, 0.15106345580425112, -0.12484931565413718, -0.19983279466396198, 0.06351002773735673, 0.10202766507863999, 0.15853594999061899, -0.09255945468321443, 0.1761554484939552, -0.06275808673817665, 0.04021350326947868, 0.039782114943955095, 0.044774333172244954, 0.16395628033205867, 0.056844293931499125, 0.08594893463887274, 0.11072165735531599, -0.0191503697889857, -0.07347170922439546, -0.37989616170525553, -0.2196167348884046, -0.16187270090449601, 0.09426362393423915, -0.10211669707168766, -0.1952440845547244, 0.4519954497925937, 0.11254544123075902, 0.24880095572734717, 0.1094555038260296, 0.267524170759134, 0.11691506863571703, 0.06685705356067047, -0.017864909837953746, 0.1534760924441798, 0.24316300940699875, 0.019558735404280013, -0.19413920616498218, 0.019630240101832896, 0.2029810838168487]
|
1,803.06462
|
500MHz resonant photodetector for high-quantum-effciency, low-noise
homodyne measurement
|
We design and demonstrate a resonant-type differential photodetector for
low-noise quantum homodyne measurement at 500MHz optical sideband with 17MHz of
bandwidth. By using a microwave monolithic amplifier and a discrete voltage
buffer circuit, a low-noise voltage amplifier is realized and applied to our
detector. 12dB of signal-to-noise ratio of the shot noise to the electric noise
is obtained with 5mW of continuous-wave local oscillator. We analyze the
frequency response and the noise characteristics of a resonant photodetector,
and the theoretical model agrees with the shot noise measurement.
|
physics.app-ph quant-ph
|
we design and demonstrate a resonanttype differential photodetector for lownoise quantum homodyne measurement at 500mhz optical sideband with 17mhz of bandwidth by using a microwave monolithic amplifier and a discrete voltage buffer circuit a lownoise voltage amplifier is realized and applied to our detector 12db of signaltonoise ratio of the shot noise to the electric noise is obtained with 5mw of continuouswave local oscillator we analyze the frequency response and the noise characteristics of a resonant photodetector and the theoretical model agrees with the shot noise measurement
|
[['we', 'design', 'and', 'demonstrate', 'a', 'resonanttype', 'differential', 'photodetector', 'for', 'lownoise', 'quantum', 'homodyne', 'measurement', 'at', '500mhz', 'optical', 'sideband', 'with', '17mhz', 'of', 'bandwidth', 'by', 'using', 'a', 'microwave', 'monolithic', 'amplifier', 'and', 'a', 'discrete', 'voltage', 'buffer', 'circuit', 'a', 'lownoise', 'voltage', 'amplifier', 'is', 'realized', 'and', 'applied', 'to', 'our', 'detector', '12db', 'of', 'signaltonoise', 'ratio', 'of', 'the', 'shot', 'noise', 'to', 'the', 'electric', 'noise', 'is', 'obtained', 'with', '5mw', 'of', 'continuouswave', 'local', 'oscillator', 'we', 'analyze', 'the', 'frequency', 'response', 'and', 'the', 'noise', 'characteristics', 'of', 'a', 'resonant', 'photodetector', 'and', 'the', 'theoretical', 'model', 'agrees', 'with', 'the', 'shot', 'noise', 'measurement']]
|
[-0.16513946414167105, 0.09380934477328907, -0.0111415327234237, -0.06808181232664474, 0.01812930126826084, -0.24628039938397706, 0.11419857517534564, 0.4369096107954203, -0.20236627052559755, -0.2915750406520051, 0.06055594119784791, -0.2843574376473593, -0.10446577555456654, 0.28593066636050596, -0.12416694376097862, 0.12520015238632642, 0.021375166011302797, -0.038816430919998604, 0.01861036497406488, -0.13377883249276512, 0.20880059184246633, 0.12436479378118027, 0.3612338739425637, -0.05760915177978499, 0.20923847155063413, -0.04661139604353974, 0.0006459446104113446, -0.026965897757733285, -0.04706451829609483, 0.014746933915587358, 0.25331837981451993, -0.0024191903730117997, 0.2011606695866862, -0.3785476391311995, -0.17820774279751403, 0.050180443909105865, 0.03163608853152931, 0.13820585221875198, -0.04737576366088158, -0.31376317632926065, 0.03488880735388849, -0.16723852377211632, -0.04165932138147222, -0.05857544016569506, -0.0862065605483516, 0.07632728335772489, -0.3365820561167459, 0.037330838223529415, 0.03237112618029811, 0.04191245870708033, 0.02521051625114714, -0.07509215225920428, 0.01938768676319701, 0.034153741963754605, -0.13862005294825838, -0.02982284748645196, 0.2482279525571611, -0.15329267487382017, -0.11783117532383564, 0.26657949585797874, -0.15944687716749517, -0.12165418875046334, 0.08149114242473314, -0.19915903843722718, 0.015039212064990816, 0.15888951220657938, 0.13082418040924726, 0.013951027917480745, -0.15930002030434606, 0.027482386721097755, 0.09167020567043056, 0.2747405300046815, 0.13452046402177753, 0.1348970180734732, 0.1774193879628424, 0.2600710376295759, 0.08284203731996376, 0.20255375941565565, -0.20261334453649862, 0.04217819974562803, -0.31133579939257267, -0.07370781901205868, -0.20010145115097552, 0.11426644815067045, -0.04695331742685846, -0.15054690448004146, 0.45313453457729763, 0.1533279931930782, 0.13885762591759654, 0.034990372036063914, 0.4549876337134561, 0.23393172225075623, 0.017914206986207257, -0.04689300946111596, 0.28794020789047314, 0.2212374020654838, 0.15647046378445487, -0.3028880527654533, -0.05212767617668697, -0.08862017395061463]
|
1,803.06463
|
Multiplication formulas and semisimplicity for q-Schur superalgebras
|
We investigate products of certain double cosets for the symmetric group and
use the findings to derive some multiplication formulas for q-Schur
superalgebras. This gives a combinatorialisation of the relative norm approach
developed by the first two authors. We then give several applications of the
multiplication formulas, including the matrix representation of the regular
representation and a semisimplicity criterion for q-Schur superalgebras. We
also construct infinitesimal and little q-Schur superalgebras directly from the
multiplication formulas and develop their semisimplicity criteria.
|
math.QA math.GR math.RA math.RT
|
we investigate products of certain double cosets for the symmetric group and use the findings to derive some multiplication formulas for qschur superalgebras this gives a combinatorialisation of the relative norm approach developed by the first two authors we then give several applications of the multiplication formulas including the matrix representation of the regular representation and a semisimplicity criterion for qschur superalgebras we also construct infinitesimal and little qschur superalgebras directly from the multiplication formulas and develop their semisimplicity criteria
|
[['we', 'investigate', 'products', 'of', 'certain', 'double', 'cosets', 'for', 'the', 'symmetric', 'group', 'and', 'use', 'the', 'findings', 'to', 'derive', 'some', 'multiplication', 'formulas', 'for', 'qschur', 'superalgebras', 'this', 'gives', 'a', 'combinatorialisation', 'of', 'the', 'relative', 'norm', 'approach', 'developed', 'by', 'the', 'first', 'two', 'authors', 'we', 'then', 'give', 'several', 'applications', 'of', 'the', 'multiplication', 'formulas', 'including', 'the', 'matrix', 'representation', 'of', 'the', 'regular', 'representation', 'and', 'a', 'semisimplicity', 'criterion', 'for', 'qschur', 'superalgebras', 'we', 'also', 'construct', 'infinitesimal', 'and', 'little', 'qschur', 'superalgebras', 'directly', 'from', 'the', 'multiplication', 'formulas', 'and', 'develop', 'their', 'semisimplicity', 'criteria']]
|
[-0.11325659874319748, 0.015680760363281906, -0.08923564765556669, 0.12318717908627012, -0.1477883215639976, -0.1527522474975337, 0.028804337426053383, 0.3687895328466651, -0.333094401399994, -0.21627135219971969, 0.15944986802796962, -0.1962212607925065, -0.22667825849184506, 0.20942144867186022, -0.12333669096450292, -0.01839407129637614, 0.01815380769062646, 0.12298803517146956, -0.1846473507724608, -0.2723403545936475, 0.39674792042638685, -0.007967936617758456, 0.24902633638887467, 0.033250108151991344, 0.11285852975662594, 0.05164421235411605, -0.052475467536456974, -0.12965175326135528, -0.20290855945477002, 0.18011240128581, 0.28184085487847843, 0.12713318493783096, 0.21131575581487977, -0.41514288964150825, -0.05793640822101431, 0.1599526610579106, 0.13396995775165815, 0.07498306410882292, -0.07176302955780603, -0.2561376501299158, 0.0900998448457899, -0.2754739911083274, -0.13421047231936944, -0.13334346235187464, 0.04656511877628067, 0.010325338384224975, -0.2737950635956058, -0.00836222646853745, 0.10817348643523254, 0.11264995906407697, -0.12466904832215249, -0.16997381391687483, 0.048595257622154456, 0.09905695397100306, -0.03828356159214355, -0.10472295520520664, 0.1142648746306666, -0.10399798525179017, -0.19834083371539304, 0.3339811968086641, 0.006146283731854792, -0.2386503556766842, 0.10732685952577033, -0.15011953263649647, -0.16350842912716768, 0.045487452044941576, 0.06593824689618394, 0.13372845228288405, -0.08550637973401742, 0.15400918253367366, -0.09469797649668364, 0.0027710372225463954, 0.11088510972883882, 0.03524888998864195, 0.09710129794865092, 0.019983555496776405, 0.019507306745818145, 0.18758066677594487, 0.024360235998572052, -0.013342409824976061, -0.3633414751413879, -0.22759562512399936, -0.058080754219259643, 0.0968528019523696, -0.1340836593697048, -0.1700662314756243, 0.4496773618120181, 0.1243662359782412, 0.17446987274326856, 0.17434155489494907, 0.2218071103709031, 0.12143522372492883, 0.13022025126503903, 0.022997594856998965, 0.10640770003171579, 0.3388106746251306, 0.019913729857889157, -0.1125043490982638, -0.04825210003653848, 0.23751978562036646]
|
1,803.06464
|
Toward Understanding the Impact of User Participation in Autonomous
Ridesharing Systems
|
Autonomous ridesharing systems (ARS) promise many societal and environmental
benefits, including decreased accident rates, reduced energy consumption and
pollutant emissions, and diminished land use for parking. To unleash ARS'
potential, stakeholders must understand how the degree of passenger
participation influences the ridesharing systems' efficiency. To date, however,
a careful study that quantifies the impact of user participation on ARS'
performance is missing. Here, we present the first simulation analysis to
investigate how and to what extent user participation affects the efficiency of
ARS. We demonstrate how specific configurations (e.g., fleet size, vehicle
capacity, and the maximum waiting time) of a system can be identified to
counter the performance loss due to users' uncoordinated behavior on
ridesharing participation. Our results indicate that stakeholders of ARS should
base decisions regarding system configurations on insights from data-driven
simulations and make tradeoffs between system efficiency and price of anarchy
for desired outcomes.
|
cs.CY cs.MA cs.SY
|
autonomous ridesharing systems ars promise many societal and environmental benefits including decreased accident rates reduced energy consumption and pollutant emissions and diminished land use for parking to unleash ars potential stakeholders must understand how the degree of passenger participation influences the ridesharing systems efficiency to date however a careful study that quantifies the impact of user participation on ars performance is missing here we present the first simulation analysis to investigate how and to what extent user participation affects the efficiency of ars we demonstrate how specific configurations eg fleet size vehicle capacity and the maximum waiting time of a system can be identified to counter the performance loss due to users uncoordinated behavior on ridesharing participation our results indicate that stakeholders of ars should base decisions regarding system configurations on insights from datadriven simulations and make tradeoffs between system efficiency and price of anarchy for desired outcomes
|
[['autonomous', 'ridesharing', 'systems', 'ars', 'promise', 'many', 'societal', 'and', 'environmental', 'benefits', 'including', 'decreased', 'accident', 'rates', 'reduced', 'energy', 'consumption', 'and', 'pollutant', 'emissions', 'and', 'diminished', 'land', 'use', 'for', 'parking', 'to', 'unleash', 'ars', 'potential', 'stakeholders', 'must', 'understand', 'how', 'the', 'degree', 'of', 'passenger', 'participation', 'influences', 'the', 'ridesharing', 'systems', 'efficiency', 'to', 'date', 'however', 'a', 'careful', 'study', 'that', 'quantifies', 'the', 'impact', 'of', 'user', 'participation', 'on', 'ars', 'performance', 'is', 'missing', 'here', 'we', 'present', 'the', 'first', 'simulation', 'analysis', 'to', 'investigate', 'how', 'and', 'to', 'what', 'extent', 'user', 'participation', 'affects', 'the', 'efficiency', 'of', 'ars', 'we', 'demonstrate', 'how', 'specific', 'configurations', 'eg', 'fleet', 'size', 'vehicle', 'capacity', 'and', 'the', 'maximum', 'waiting', 'time', 'of', 'a', 'system', 'can', 'be', 'identified', 'to', 'counter', 'the', 'performance', 'loss', 'due', 'to', 'users', 'uncoordinated', 'behavior', 'on', 'ridesharing', 'participation', 'our', 'results', 'indicate', 'that', 'stakeholders', 'of', 'ars', 'should', 'base', 'decisions', 'regarding', 'system', 'configurations', 'on', 'insights', 'from', 'datadriven', 'simulations', 'and', 'make', 'tradeoffs', 'between', 'system', 'efficiency', 'and', 'price', 'of', 'anarchy', 'for', 'desired', 'outcomes']]
|
[-0.13796369751405627, 0.08947113086154836, -0.03389094741952077, 0.10475478756848748, -0.09293731078002099, -0.11549746818412598, 0.16881124069756903, 0.40392574871814735, -0.23402291616877993, -0.3620458176938465, 0.07846018593959711, -0.30514308376665655, -0.16409471632465972, 0.2043011247729442, -0.1598572166592537, 0.04474002756555942, 0.09792425097721452, -0.01281270494753797, 0.023756066570058465, -0.28568093683586354, 0.2848865981103626, 0.1457003396149171, 0.3536748490390695, 0.12816706591764013, 0.047988885689551966, -0.030723131682296644, -0.013129153905587422, 0.008624415451383873, -0.095926217776208, 0.10640368929661408, 0.3033434885138696, 0.22872652437827373, 0.3482792546871949, -0.42791451201648323, -0.20773045001929072, 0.09582544386865118, 0.14406308803557516, -0.040113999412357305, -8.373984963180044e-05, -0.25186677610130376, 0.060561545102737493, -0.24377507811683197, -0.0990142858967915, -0.0845895804578086, 0.01657588916792962, 0.06443899707802622, -0.2890163731345957, -0.0009241398058932375, -0.034411880404789104, 0.1000415888784856, -0.06042018801924093, -0.10199276277735653, -0.05577810657229526, 0.2653631131562744, 0.1206962591638109, -0.09397430134767264, 0.2248164239509434, -0.15405965587470327, -0.16923766931506326, 0.3831600407830666, 0.05767996132694739, -0.16565978807724407, 0.189871803882557, -0.1334148763232185, -0.08925207989444528, 0.11270849048034162, 0.3035835059158303, 0.023767395154258388, -0.13951437989551876, -0.04187364632309402, 0.025907269779693435, 0.21259040241066768, 0.03275367128033493, 0.04386007050807412, 0.19121916104749953, 0.2147924242874708, 0.14096967318383158, 0.10063972816616926, -0.045775416914398806, -0.14293153304213382, -0.18173301366245928, -0.1647572731961043, -0.11994192206986702, 0.061082663554918475, -0.07642203575478806, -0.06970120586668821, 0.40160809832977484, 0.22749726896064523, 0.10869408808011448, 0.06092016801011522, 0.3156261277020078, 0.06087124581539978, 0.021735915476833848, 0.10040688824581692, 0.20600985894152718, -0.005476070281646743, 0.20948444222213347, -0.29284683851968824, 0.14907705735154073, -0.02205394407281199]
|
1,803.06465
|
Local Continuity and Asymptotic Behaviour of Degenerate Parabolic
Systems
|
We study the local H\"older continuity and the asymptotic behaviour of
solution, $\mathbf{u}=(u^1,\cdots, u^k)$, of the degenerate system
\begin{equation*} u^i_t=\nabla\cdot\left(m\,U^{m-1}\nabla u^i\right) \qquad
\text{for $m>1$ and $i=1,\cdots,k$ } \end{equation*} which describes the
populations density of $k$-species whose diffusion is determined by their total
population density $U=u^1+\cdots+u^k$. For the local H\"older continuity, we
adopt the intrinsic scaling and iteration arguments of DeGiorgi, Moser, and
Dibenedetto. Under some regularity conditions, we also prove that the
population density function of $i$-th species with the population $M_i$
converges in $C_s^{\infty}$ to $\frac{M_i}{M}\mathcal{B}_M(x,t)$ as $t\to
\infty$ where $\mathcal{B}_M$ is the Barenblatt profile of the standard porous
medium equation with $L^1$ mass $M=M_1+\cdots+M_k$. As a consequence of
asymptotic behaviour, it is shown that each density function becomes a concave
function after a finite time.
|
math.AP
|
we study the local holder continuity and the asymptotic behaviour of solution mathbfuu1cdots uk of the degenerate system beginequation ui_tnablacdotleftmum1nabla uiright qquad textfor m1 and i1cdotsk endequation which describes the populations density of kspecies whose diffusion is determined by their total population density uu1cdotsuk for the local holder continuity we adopt the intrinsic scaling and iteration arguments of degiorgi moser and dibenedetto under some regularity conditions we also prove that the population density function of ith species with the population m_i converges in c_sinfty to fracm_immathcalb_mxt as tto infty where mathcalb_m is the barenblatt profile of the standard porous medium equation with l1 mass mm_1cdotsm_k as a consequence of asymptotic behaviour it is shown that each density function becomes a concave function after a finite time
|
[['we', 'study', 'the', 'local', 'holder', 'continuity', 'and', 'the', 'asymptotic', 'behaviour', 'of', 'solution', 'mathbfuu1cdots', 'uk', 'of', 'the', 'degenerate', 'system', 'beginequation', 'ui_tnablacdotleftmum1nabla', 'uiright', 'qquad', 'textfor', 'm1', 'and', 'i1cdotsk', 'endequation', 'which', 'describes', 'the', 'populations', 'density', 'of', 'kspecies', 'whose', 'diffusion', 'is', 'determined', 'by', 'their', 'total', 'population', 'density', 'uu1cdotsuk', 'for', 'the', 'local', 'holder', 'continuity', 'we', 'adopt', 'the', 'intrinsic', 'scaling', 'and', 'iteration', 'arguments', 'of', 'degiorgi', 'moser', 'and', 'dibenedetto', 'under', 'some', 'regularity', 'conditions', 'we', 'also', 'prove', 'that', 'the', 'population', 'density', 'function', 'of', 'ith', 'species', 'with', 'the', 'population', 'm_i', 'converges', 'in', 'c_sinfty', 'to', 'fracm_immathcalb_mxt', 'as', 'tto', 'infty', 'where', 'mathcalb_m', 'is', 'the', 'barenblatt', 'profile', 'of', 'the', 'standard', 'porous', 'medium', 'equation', 'with', 'l1', 'mass', 'mm_1cdotsm_k', 'as', 'a', 'consequence', 'of', 'asymptotic', 'behaviour', 'it', 'is', 'shown', 'that', 'each', 'density', 'function', 'becomes', 'a', 'concave', 'function', 'after', 'a', 'finite', 'time']]
|
[-0.12948828338452031, 0.08748601990262583, -0.12195418804284122, 0.05813869505319586, -0.014490782174723759, -0.12594010539242398, 0.022702195581987942, 0.31099737970300523, -0.2966600447040746, -0.21526813273460177, 0.12296604500763844, -0.3193184693296582, -0.08701667049899697, 0.10775268948708476, -0.04951414935511805, 0.06566028424807019, -0.015231410057236583, 0.05275157370438831, -0.055575472925260855, -0.21008738154502019, 0.33788701709975505, -0.034368287528750596, 0.24073223413512806, 0.00648956975092622, 0.12093712563894815, -0.018664951762776442, 0.04200380138058405, -0.012866041605297666, -0.2338935343783706, 0.01962338039904075, 0.1665110327924949, 0.0989553478203114, 0.33589546882421156, -0.3649021819139184, -0.17461273395377447, 0.14678631117468763, 0.16855693076958217, -0.004462098368340946, -0.026066543246196165, -0.2521893271734401, 0.08885837227137665, -0.12087291402947474, -0.2547528661779617, -0.02255665279640737, 0.057468365712122896, 0.13858860550089186, -0.3353358007330148, 0.1647348897904059, 0.057330247572173317, 0.008711675189877465, -0.1044073799379383, -0.14311416775000013, -0.09610390993056156, 0.08926677657883235, 0.09137969874674297, 0.04813549533423226, 0.12483491707974019, -0.1286467702041175, 0.03507284434133415, 0.31893254642895724, -0.12737871842829795, -0.20660575970260514, 0.1464206341957926, -0.1994252689360341, -0.1188138640738266, 0.08336111152311787, 0.10557745855673556, 0.16820493603709263, -0.14336363511096875, 0.1490846335497227, -0.0677887489624574, 0.15030180374002558, 0.08600967001738184, 0.027803465115647345, 0.0743419215304114, 0.14580579931547832, 0.14355973273089503, 0.10204165554368648, -0.040993420198023066, -0.06861793949126692, -0.33476208380849687, -0.1655557776280379, -0.1915387459714913, 0.13843287795119114, -0.13007925983105975, -0.17821744354357905, 0.32729586924749854, 0.07528664654375337, 0.19672007360732405, 0.1384399343149784, 0.22075889229190426, 0.20940507192093627, -0.02616347078928503, 0.11278475913262563, 0.14617711227210595, 0.16941479329706438, 0.10889642311544237, -0.2567359862604447, 0.0904866365431729, 0.13516413070206232]
|
1,803.06466
|
Example-based super-resolution for point-cloud video
|
We propose a mixed-resolution point-cloud representation and an example-based
super-resolution framework, from which several processing tools can be derived,
such as compression, denoising and error concealment. By inferring the
high-frequency content of low-resolution frames based on the similarities
between adjacent full-resolution frames, the proposed framework achieves an
average 1.18 dB gain over low-pass versions of the point-cloud, for a
projection-based distortion metric[1-2].
|
eess.SP
|
we propose a mixedresolution pointcloud representation and an examplebased superresolution framework from which several processing tools can be derived such as compression denoising and error concealment by inferring the highfrequency content of lowresolution frames based on the similarities between adjacent fullresolution frames the proposed framework achieves an average 118 db gain over lowpass versions of the pointcloud for a projectionbased distortion metric12
|
[['we', 'propose', 'a', 'mixedresolution', 'pointcloud', 'representation', 'and', 'an', 'examplebased', 'superresolution', 'framework', 'from', 'which', 'several', 'processing', 'tools', 'can', 'be', 'derived', 'such', 'as', 'compression', 'denoising', 'and', 'error', 'concealment', 'by', 'inferring', 'the', 'highfrequency', 'content', 'of', 'lowresolution', 'frames', 'based', 'on', 'the', 'similarities', 'between', 'adjacent', 'fullresolution', 'frames', 'the', 'proposed', 'framework', 'achieves', 'an', 'average', '118', 'db', 'gain', 'over', 'lowpass', 'versions', 'of', 'the', 'pointcloud', 'for', 'a', 'projectionbased', 'distortion', 'metric12']]
|
[-0.03975863830705524, -0.052603473241314994, -0.08209233915769175, 0.02943762593910281, -0.031615879997366765, -0.1291593670173258, 0.03558758163794142, 0.46824078017570936, -0.3119747003570932, -0.31632173247635365, 0.0786666593067806, -0.254390236570454, -0.19221566215951424, 0.18807177880748374, -0.179146775130381, 0.07245438381052408, 0.0800624428752077, 0.02798047222074915, -0.13036433718029838, -0.20827468151806808, 0.20334973627487657, 0.08191355820134526, 0.37195897792450716, -0.060085223689980684, 0.16707017304391036, 0.029248939704943876, -0.043192569341999096, -0.010253401871075945, -0.06323765932780798, 0.1829899709183173, 0.2638832998813176, 0.2117785580349384, 0.2945664198305763, -0.38953181195882014, -0.264699053538383, 0.023605080046614664, 0.13716855707299727, 0.09598312483237842, -0.09076782730675195, -0.3706308148923467, 0.10084434487994333, -0.13932715054051797, 0.10918446182613031, -0.1013004831458274, -0.05156712850830594, 0.009573647332545674, -0.35492284431076443, 0.09050543477651893, 0.08237451595849678, 0.09063016826317447, -0.08346638697214791, -0.12764213252507273, 0.04673844330837248, 0.15717964775890844, -0.05396271797019194, 0.052821026412678544, 0.09964799428202181, -0.12019088392558157, -0.1320036105261963, 0.4043780878247296, -0.09639075948078124, -0.21151217355270732, 0.1415621201187128, 0.009546312415728071, -0.03982750421054051, 0.1430702820175984, 0.21141317531611525, 0.0897179039378391, -0.16966811521742187, -0.009357608749806026, -0.04123199495990745, 0.2354581710256514, 0.15513166569967252, 0.09445839141663469, 0.17772627982204078, 0.1750858417238857, 0.05861074755304172, 0.15760335452724858, -0.23188671715114814, -0.00884473665815885, -0.25263800772792494, -0.11097398371679983, -0.1997752990191955, -0.0381440220583902, -0.15433208942823645, -0.12407782725745538, 0.4045656555347511, 0.18603558501717252, 0.2137574286612331, 0.08631301237858038, 0.3827942335581193, 0.08290533186890735, 0.05011678687067794, 0.10112406867632612, 0.15664980823906963, 0.09434534070753782, 0.07253890290768573, -0.13509873894318083, -0.030791767731644822, 0.11183287189571095]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.