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.05567
|
Achieving Human Parity on Automatic Chinese to English News Translation
|
Machine translation has made rapid advances in recent years. Millions of
people are using it today in online translation systems and mobile applications
in order to communicate across language barriers. The question naturally arises
whether such systems can approach or achieve parity with human translations. In
this paper, we first address the problem of how to define and accurately
measure human parity in translation. We then describe Microsoft's machine
translation system and measure the quality of its translations on the widely
used WMT 2017 news translation task from Chinese to English. We find that our
latest neural machine translation system has reached a new state-of-the-art,
and that the translation quality is at human parity when compared to
professional human translations. We also find that it significantly exceeds the
quality of crowd-sourced non-professional translations.
|
cs.CL
|
machine translation has made rapid advances in recent years millions of people are using it today in online translation systems and mobile applications in order to communicate across language barriers the question naturally arises whether such systems can approach or achieve parity with human translations in this paper we first address the problem of how to define and accurately measure human parity in translation we then describe microsofts machine translation system and measure the quality of its translations on the widely used wmt 2017 news translation task from chinese to english we find that our latest neural machine translation system has reached a new stateoftheart and that the translation quality is at human parity when compared to professional human translations we also find that it significantly exceeds the quality of crowdsourced nonprofessional translations
|
[['machine', 'translation', 'has', 'made', 'rapid', 'advances', 'in', 'recent', 'years', 'millions', 'of', 'people', 'are', 'using', 'it', 'today', 'in', 'online', 'translation', 'systems', 'and', 'mobile', 'applications', 'in', 'order', 'to', 'communicate', 'across', 'language', 'barriers', 'the', 'question', 'naturally', 'arises', 'whether', 'such', 'systems', 'can', 'approach', 'or', 'achieve', 'parity', 'with', 'human', 'translations', 'in', 'this', 'paper', 'we', 'first', 'address', 'the', 'problem', 'of', 'how', 'to', 'define', 'and', 'accurately', 'measure', 'human', 'parity', 'in', 'translation', 'we', 'then', 'describe', 'microsofts', 'machine', 'translation', 'system', 'and', 'measure', 'the', 'quality', 'of', 'its', 'translations', 'on', 'the', 'widely', 'used', 'wmt', '2017', 'news', 'translation', 'task', 'from', 'chinese', 'to', 'english', 'we', 'find', 'that', 'our', 'latest', 'neural', 'machine', 'translation', 'system', 'has', 'reached', 'a', 'new', 'stateoftheart', 'and', 'that', 'the', 'translation', 'quality', 'is', 'at', 'human', 'parity', 'when', 'compared', 'to', 'professional', 'human', 'translations', 'we', 'also', 'find', 'that', 'it', 'significantly', 'exceeds', 'the', 'quality', 'of', 'crowdsourced', 'nonprofessional', 'translations']]
|
[-0.05352873209499775, 0.08185054126363668, -0.04076921566795642, 0.07052924672029633, -0.11215172397126828, -0.1326472479079787, 0.05848066557174254, 0.4458005627130571, -0.31918835131577533, -0.3562214409764436, 0.06160865343417412, -0.31576451776843323, -0.15662502979026421, 0.2310042049284128, -0.17145995780277676, 0.10768208523146122, 0.12677578044060925, 0.09126500434529289, -0.030632358371749296, -0.32555151998268483, 0.2775422956328839, 0.005512199536161988, 0.3839689534511137, 0.036993801140373476, 0.1098766745614322, -0.03750875294278551, -0.012734910182626848, -0.05884875275922897, -0.04788177568351463, 0.18347654096288538, 0.2969541299188356, 0.22894658057607317, 0.31298409896741686, -0.4100405174146469, -0.15183765866489088, 0.08532429511721869, 0.12153990985125415, 0.1217730076339348, -0.029172357800460413, -0.3516520723644504, 0.10676950696834776, -0.21395712209991494, -0.013169157490330307, -0.1568534735947343, 0.04835978488584882, -0.040977786323125646, -0.18220994122767528, 0.004501806451068995, 0.09501577086774703, 0.1520941886294605, -0.037402991813789574, -0.05105586887225229, 0.04671322525114773, 0.21634678285034142, 0.11082924253664407, 0.12210775514420374, 0.12954885288512796, -0.15532924367037876, -0.21004315426125003, 0.43725380252458546, -0.06439612052119792, -0.2225030664900752, 0.2312833650345753, -0.07693723825951408, -0.19961457177156344, 0.01144276873761774, 0.27064220063892525, 0.04914436147625285, -0.1480611347042145, 0.06228189037664604, -0.04677146416213503, 0.24945793558556334, 0.10240721209079755, -0.03688576572077503, 0.17702527818291036, 0.20812530486312295, 0.011238033732721456, 0.1026711089788635, -0.039590909109009725, -0.06570920773214639, -0.16047200371504278, -0.14739681197736496, -0.14365406705353662, 0.01780985455427851, 0.004117831623241221, -0.10941651571345956, 0.37745901583728936, 0.22560331599674838, 0.13081541270913935, 0.09249405938710954, 0.30863951175312576, 0.026955211231365968, 0.12129781647459288, 0.08782146700887233, 0.18034896653327614, -0.06072060964105273, 0.17940293864086201, -0.1762353124681692, 0.084287055408323, 0.035353533071080655]
|
1,803.05568
|
Reflection fusion categories
|
We introduce the notion of a $\textit{reflection fusion category}$, which is
a type of a $G$-crossed category generated by objects of Frobenius-Perron
dimension $1$ and $\sqrt{p}$, where $p$ is an odd prime. We show that such
categories correspond to orthogonal reflection groups over $\mathbb{F}_p$. This
allows us to use the known classification of irreducible reflection groups over
finite fields to classify irreducible reflection fusion categories.
|
math.QA
|
we introduce the notion of a textitreflection fusion category which is a type of a gcrossed category generated by objects of frobeniusperron dimension 1 and sqrtp where p is an odd prime we show that such categories correspond to orthogonal reflection groups over mathbbf_p this allows us to use the known classification of irreducible reflection groups over finite fields to classify irreducible reflection fusion categories
|
[['we', 'introduce', 'the', 'notion', 'of', 'a', 'textitreflection', 'fusion', 'category', 'which', 'is', 'a', 'type', 'of', 'a', 'gcrossed', 'category', 'generated', 'by', 'objects', 'of', 'frobeniusperron', 'dimension', '1', 'and', 'sqrtp', 'where', 'p', 'is', 'an', 'odd', 'prime', 'we', 'show', 'that', 'such', 'categories', 'correspond', 'to', 'orthogonal', 'reflection', 'groups', 'over', 'mathbbf_p', 'this', 'allows', 'us', 'to', 'use', 'the', 'known', 'classification', 'of', 'irreducible', 'reflection', 'groups', 'over', 'finite', 'fields', 'to', 'classify', 'irreducible', 'reflection', 'fusion', 'categories']]
|
[-0.16722583561204374, 0.08339707235631977, -0.10241683921412914, 0.037471892954272334, -0.11753505633714667, -0.149570051151386, -0.0251240786164999, 0.39544918641331606, -0.3669260593596846, -0.20610276047955267, 0.02860142082499806, -0.18679025765254664, -0.09961530520376982, 0.16739349803538062, -0.1656804147278308, -0.10178606276213031, 0.019116744544589892, 0.17710599401470972, -0.05141305691722664, -0.30790411804264295, 0.4592100912122987, -0.07027174187533092, 0.2621609572961461, -0.03462503201444633, 0.11853025705204345, 0.07936388105008518, -0.0399333767418284, -0.003304789905087091, -0.0832906192814562, 0.1719612354045239, 0.36872510064858943, 0.06278010459573125, 0.18887681007981882, -0.28652767941821367, -0.13690662854060065, 0.2240014363796945, 0.1521728358029577, 0.04400636872924224, 0.005726892108214088, -0.27456150422949577, 0.1564311724359868, -0.3040131746965926, -0.10211852784777875, -0.07450194773264229, 0.09746001342136879, -0.030978509515989572, -0.31189026587526314, -0.047528507515380625, 0.10464236135339888, 0.1252527902543079, -0.11522182672069903, -0.07811264230986126, -0.00502343003245187, 0.11432147198320308, -0.05065956919133896, -0.04177302612515632, 0.0877592161486973, -0.12138475632673362, -0.16184046450871392, 0.3829163498521666, 0.00509707850869745, -0.18472876408486627, 0.21516012583015254, -0.14499073834304, -0.12449943085084669, 0.2056187209673226, 0.12539746484253556, 0.12692199621233158, -0.007281781159690581, 0.15913232399088884, -0.16052715966361575, 0.09358061087550595, 0.1329120692826109, -0.03167501331336098, 0.1187141861737473, 0.08385323960101232, 0.03771286849223543, 0.13890000104584033, -0.0672266071633203, 0.06555873903562315, -0.36836409982061014, -0.1857250726025086, -0.05555146271944977, 0.14192136394558474, -0.03203020106570875, -0.1665042433378403, 0.3909647910768399, 0.13084875588538125, 0.19035608251579106, 0.11936891540426586, 0.2165571494242613, 0.04186950932489708, 0.11427328988793306, 0.05759984419364628, 0.05729767482262105, 0.2577141270194261, -0.09743835828339797, -0.09732566398452036, -0.06637168412271421, 0.18669767013489036]
|
1,803.05569
|
A Beale-Kato-Majda criterion with optimal frequency and temporal
localization
|
We obtain a Beale-Kato-Majda-type criterion with optimal frequency and
temporal localization for the 3D Navier-Stokes equations. Compared to previous
results our condition only requires the control of Fourier modes below a
critical frequency, whose value is explicit in terms of time scales. As
applications it yields a strongly frequency-localized condition for regularity
in the space $B^{-1}_{\infty,\infty}$ and also a lower bound on the decaying
rate of $L^p$ norms $2\leq p <3$ for possible blowup solutions. The proof
relies on new estimates for the cutoff dissipation and energy at small time
scales which might be of independent interest.
|
math.AP
|
we obtain a bealekatomajdatype criterion with optimal frequency and temporal localization for the 3d navierstokes equations compared to previous results our condition only requires the control of fourier modes below a critical frequency whose value is explicit in terms of time scales as applications it yields a strongly frequencylocalized condition for regularity in the space b1_inftyinfty and also a lower bound on the decaying rate of lp norms 2leq p 3 for possible blowup solutions the proof relies on new estimates for the cutoff dissipation and energy at small time scales which might be of independent interest
|
[['we', 'obtain', 'a', 'bealekatomajdatype', 'criterion', 'with', 'optimal', 'frequency', 'and', 'temporal', 'localization', 'for', 'the', '3d', 'navierstokes', 'equations', 'compared', 'to', 'previous', 'results', 'our', 'condition', 'only', 'requires', 'the', 'control', 'of', 'fourier', 'modes', 'below', 'a', 'critical', 'frequency', 'whose', 'value', 'is', 'explicit', 'in', 'terms', 'of', 'time', 'scales', 'as', 'applications', 'it', 'yields', 'a', 'strongly', 'frequencylocalized', 'condition', 'for', 'regularity', 'in', 'the', 'space', 'b1_inftyinfty', 'and', 'also', 'a', 'lower', 'bound', 'on', 'the', 'decaying', 'rate', 'of', 'lp', 'norms', '2leq', 'p', '3', 'for', 'possible', 'blowup', 'solutions', 'the', 'proof', 'relies', 'on', 'new', 'estimates', 'for', 'the', 'cutoff', 'dissipation', 'and', 'energy', 'at', 'small', 'time', 'scales', 'which', 'might', 'be', 'of', 'independent', 'interest']]
|
[-0.1447280166709485, 0.11968303500422432, -0.08953445473647055, 0.07400995581823129, -0.06817442670095868, -0.13841464286088012, 0.0412737547121651, 0.2891571484991194, -0.24192171049071476, -0.2835770803406679, 0.16680865093803732, -0.2256702880646723, -0.06248209784583499, 0.2739722936603357, -0.037251099585167445, 0.09347384957557854, 0.047533010388481976, 0.07230135103842865, -0.0717113635964779, -0.2164698900305666, 0.31716995002837695, 0.0524227621499449, 0.26322100876132026, 0.08340057059831452, 0.10005351815190504, -0.030465545891881145, 0.005645728175295517, -0.034041366103641245, -0.2040550429665018, 0.0842438167698371, 0.22410187433706596, 0.06937303471499945, 0.2917480866308324, -0.3823397272911582, -0.20949033821185972, 0.09839992702472955, 0.17239928190974751, 0.08628460081308731, -0.030375148919119965, -0.2533865254178333, 0.10795496268838178, -0.06434555970918154, -0.14900542987743393, -0.06856944442552049, 0.06070671589501823, 0.04275556608263287, -0.37278551631607115, 0.14654308988459283, 0.10042256470721138, 0.033419476210838184, -0.14058567148458678, -0.10534523097157944, -0.0004930023448347735, 0.07493990201813479, 0.058781877320143394, 0.03206288526416756, 0.06713002840600286, -0.11576841174489043, -0.07410472200717777, 0.3236292840738315, -0.07484137750968027, -0.23750125849619508, 0.20184247329113228, -0.1429034593165852, -0.09054240219605465, 0.1530358386808075, 0.1746044646279188, 0.1634710326664693, -0.0684863287776049, 0.11615259004914454, -0.027759635316518445, 0.2085270190339846, 0.10382803799196456, 0.11483231949872182, 0.09394129912834615, 0.16160820931448447, 0.17826651585346553, 0.08892679600224558, -0.061424968347031005, -0.05146080420490762, -0.3528376076283166, -0.12699406429904533, -0.21116095091565512, 0.05842434508667793, -0.1555867877076101, -0.1417758097522892, 0.3822291697288165, 0.11420839257455857, 0.19006876499042846, 0.13484712465166618, 0.26141108002047986, 0.1806372500868747, 0.04857697912181417, 0.09535012229268129, 0.21939292125898646, 0.09443912597877595, 0.12327771609610257, -0.1993501911201747, 0.035643708947342624, 0.13898514320802255]
|
1,803.0557
|
Study of the decays $D^+\rightarrow\eta^{(\prime)} e^+\nu_{e}$
|
The charm semileptonic decays $D^+\to\eta e^+\nu_{e}$ and
$D^+\to\eta'e^+\nu_{e}$ are studied with a sample of $e^+e^-$ collision data
corresponding to an integrated luminosity of 2.93 fb$^{-1}$ collected at
$\sqrt{s}$ = 3.773 GeV with the BESIII detector. We measure the branching
fractions for $D^+\to\eta e^+\nu_{e}$ to be
$(10.74\pm0.81\pm0.51)\times10^{-4}$, and for $D^+\to\eta'e^+\nu_{e}$ to be
$(1.91\pm0.51\pm0.13)\times10^{-4}$, where the uncertainties are statistical
and systematic, respectively. In addition, we perform a measurement of the form
factor in the decay $D^+\to\eta e^+\nu_{e}$. All the results are consistent
with those obtained by the CLEO-c experiment.
|
hep-ex
|
the charm semileptonic decays dtoeta enu_e and dtoetaenu_e are studied with a sample of ee collision data corresponding to an integrated luminosity of 293 fb1 collected at sqrts 3773 gev with the besiii detector we measure the branching fractions for dtoeta enu_e to be 1074pm081pm051times104 and for dtoetaenu_e to be 191pm051pm013times104 where the uncertainties are statistical and systematic respectively in addition we perform a measurement of the form factor in the decay dtoeta enu_e all the results are consistent with those obtained by the cleoc experiment
|
[['the', 'charm', 'semileptonic', 'decays', 'dtoeta', 'enu_e', 'and', 'dtoetaenu_e', 'are', 'studied', 'with', 'a', 'sample', 'of', 'ee', 'collision', 'data', 'corresponding', 'to', 'an', 'integrated', 'luminosity', 'of', '293', 'fb1', 'collected', 'at', 'sqrts', '3773', 'gev', 'with', 'the', 'besiii', 'detector', 'we', 'measure', 'the', 'branching', 'fractions', 'for', 'dtoeta', 'enu_e', 'to', 'be', '1074pm081pm051times104', 'and', 'for', 'dtoetaenu_e', 'to', 'be', '191pm051pm013times104', 'where', 'the', 'uncertainties', 'are', 'statistical', 'and', 'systematic', 'respectively', 'in', 'addition', 'we', 'perform', 'a', 'measurement', 'of', 'the', 'form', 'factor', 'in', 'the', 'decay', 'dtoeta', 'enu_e', 'all', 'the', 'results', 'are', 'consistent', 'with', 'those', 'obtained', 'by', 'the', 'cleoc', 'experiment']]
|
[-0.017515132758090635, 0.18232132078211602, -0.07079487687499239, 0.0900027675003313, -0.010184425048575533, -0.07011112732608325, 0.0384843619157015, 0.3530460106799515, -0.16575478260382648, -0.29324543078589005, 0.03211764120156082, -0.4698019626482231, 0.1349099866773297, 0.21151054398690508, 0.08669327768474454, 0.16776358030691016, 0.1576475229755998, 0.006314753713767703, -0.04391438573053697, -0.22042834201384698, 0.2355590051880515, 0.08405466972872978, 0.21060199552874376, 0.07180774423134763, -0.0011711043813947316, -0.0313221089905355, -0.07087065698578954, -0.05805118165047067, -0.17017852600164166, 0.07503390411715727, 0.27057738080847915, 0.13235915670023732, 0.1106469755219977, -0.31317484626365844, 0.02024366792927428, 0.17438861648211393, 0.1453894587722039, 0.0052762517432977515, -0.02057116463916694, -0.4130688857105447, 0.1856494030074739, -0.2104609113629544, -0.03949895348377162, -0.01586426832009016, 0.03816974244830085, -0.05730400490006659, -0.3824672524976294, 0.1088085606319421, -0.11758693671081125, 0.08647101189055276, -0.03711770840057331, -0.24932813199191559, 0.0019800842515329217, -0.012708788930733756, 0.055035432120614756, 0.09230065694300277, 0.1883919648939698, -0.0809227409715787, -0.1852970603717173, 0.3455888543777713, -0.03738266714598711, -0.1375394790637784, 0.1372365189216486, -0.23246788565728177, -0.10924083448196875, 0.18671165399889394, 0.2930690434352472, 0.004785912520274884, -0.27652226247620293, 0.073618163193559, -0.00421298302286986, 0.16419297867886176, 0.05457245801552767, 0.07122862202728666, 0.10208582133054733, 0.2204038071695988, -0.058578075966002736, 0.07759785296668004, -0.12484334918057047, -0.011734568530966232, -0.42442620505164264, -0.11899153219263364, -0.0574566845046697, 0.11403700884249879, -0.03661979319156494, -0.013337659365611106, 0.3183595649983234, 0.04515445999028843, 0.37406406279017285, 0.053679791381355466, 0.2497477980228368, 0.15340118981307235, 0.0357988370857883, 0.08734280883232359, 0.32339750766390707, 0.14043238251640394, 0.12511189027530392, -0.2819334545297684, 0.007823267150897442, -0.04098249225388849]
|
1,803.05571
|
Possible Chiral Topological Superconductivity in CrO$_{2}$ bilayers
|
We address the possible emergence of spin triplet superconductivity in
CrO$_{2}$ bilayers, which are half-metals with fully spin-polarized conducting
bands. Starting from a lattice model, we show that chiral $p+ip$ states compete
with non-chiral $p$-wave ones. At large doping, the $p+ip$ channel has a
sequence of topological phase transitions that can be tuned by gating effects
and interaction strength. Among several phases, we find chiral topological
phases having a single Majorana mode at the edge. We show that different
topological superconducting phases could spontaneously emerge in the vicinity
of the van-Hove singularities of the band.
|
cond-mat.str-el cond-mat.mes-hall
|
we address the possible emergence of spin triplet superconductivity in cro_2 bilayers which are halfmetals with fully spinpolarized conducting bands starting from a lattice model we show that chiral pip states compete with nonchiral pwave ones at large doping the pip channel has a sequence of topological phase transitions that can be tuned by gating effects and interaction strength among several phases we find chiral topological phases having a single majorana mode at the edge we show that different topological superconducting phases could spontaneously emerge in the vicinity of the vanhove singularities of the band
|
[['we', 'address', 'the', 'possible', 'emergence', 'of', 'spin', 'triplet', 'superconductivity', 'in', 'cro_2', 'bilayers', 'which', 'are', 'halfmetals', 'with', 'fully', 'spinpolarized', 'conducting', 'bands', 'starting', 'from', 'a', 'lattice', 'model', 'we', 'show', 'that', 'chiral', 'pip', 'states', 'compete', 'with', 'nonchiral', 'pwave', 'ones', 'at', 'large', 'doping', 'the', 'pip', 'channel', 'has', 'a', 'sequence', 'of', 'topological', 'phase', 'transitions', 'that', 'can', 'be', 'tuned', 'by', 'gating', 'effects', 'and', 'interaction', 'strength', 'among', 'several', 'phases', 'we', 'find', 'chiral', 'topological', 'phases', 'having', 'a', 'single', 'majorana', 'mode', 'at', 'the', 'edge', 'we', 'show', 'that', 'different', 'topological', 'superconducting', 'phases', 'could', 'spontaneously', 'emerge', 'in', 'the', 'vicinity', 'of', 'the', 'vanhove', 'singularities', 'of', 'the', 'band']]
|
[-0.24542132082738374, 0.29953031300836686, -0.048173097979375405, 0.019204109456194076, -0.016782883294907056, -0.21464028204055993, 0.1071694833532858, 0.39546303141273953, -0.2571817056324921, -0.2513228458891574, -0.020392712860025072, -0.3399255227493612, -0.15386026131087227, 0.05350645574446963, 0.07477057628872755, 0.0027807918634559763, -0.02716362840054851, -0.05538480649947336, -0.14477248697014722, -0.1879511113842263, 0.3560109910114031, -0.09989925511794066, 0.3345917005680109, 0.08572810105489273, -0.044559536188056595, -0.03819209468599997, 0.16794189285535954, 0.006372197982119887, -0.12373906041022181, -0.010887386150486572, 0.2988394165025583, -0.12745418265756023, 0.12297756805231697, -0.491583288264902, -0.22755109183245192, 0.0460051634152861, 0.15181296763843613, 0.19373996309127267, -0.0584498615543309, -0.3504379138350487, 0.09478045147108405, -0.18412152782303134, -0.11444322873201025, -0.11495490470337437, -0.051327966859466154, -0.07467195907313573, -0.23444113839221628, 0.0576629765625847, 0.03517563660678111, 0.05196064340783969, -0.06678738396026586, -0.11820956109777878, -0.1428216855213242, 0.08351440549779095, 0.04503579591278379, 0.04814161152922009, 0.10339178725782978, -0.17287323264968826, -0.18176584819233732, 0.3313850535024693, -0.04877868412356628, -0.08875538395031503, 0.18944887018970852, -0.15704307381452773, -0.09814256461778362, 0.16423944377977598, 0.07807480949712427, 0.059093433834220235, -0.07666717421165423, 0.060564365531440435, -0.022423421513093147, 0.14943208801927732, 0.011679245315884289, 0.11821812319226171, 0.34591525887188157, 0.2026502991977491, 0.06429816731987031, 0.14230867989826948, -0.135857389960438, -0.050326880646599945, -0.2638705994933844, -0.15414161238770344, -0.23384618430833432, 0.014653064744350942, -0.00976559816305158, -0.17301010593257257, 0.46679538598186093, 0.1270392256016892, 0.18862488032563737, -0.06650427226834979, 0.19287659380781022, 0.09559226069893492, 0.09672732534573267, 0.02326658938055564, 0.26474722332664224, 0.10145973710245208, 0.061500612229697015, -0.28332381345282653, 0.015932241239045797, 0.017284598873045884]
|
1,803.05572
|
Theoretical study of the Lambda(1405) resonance in Xi_b^0 -> D^0 pi
Sigma decay
|
We study the mechanism of the weak decay process of Xi_b^0 into D^0 with a
meson-baryon pair. It is shown that the dominant component of the prompt weak
decay produces the meson-baryon pair with the spectator strange quark being
transferred to the baryon, so that the Kbar N channel is absent. Subsequent
final state interaction then reflects the pi Sigma originated Lambda(1405)
formation amplitude, which has been difficult to access in previous
experimental studies. We predict the line shapes of the pi Sigma invariant mass
distribution using a realistic chiral meson-baryon amplitude for the final
state interaction. It is shown that the interference between the direct and the
rescattering contributions can strongly distort the peak structure of the
Lambda(1405) in the mass distribution. This indicates the necessity of a
detailed investigation of the reaction mechanism in order to extract the
Lambda(1405) property in the pi Sigma mass distribution.
|
nucl-th hep-ph
|
we study the mechanism of the weak decay process of xi_b0 into d0 with a mesonbaryon pair it is shown that the dominant component of the prompt weak decay produces the mesonbaryon pair with the spectator strange quark being transferred to the baryon so that the kbar n channel is absent subsequent final state interaction then reflects the pi sigma originated lambda1405 formation amplitude which has been difficult to access in previous experimental studies we predict the line shapes of the pi sigma invariant mass distribution using a realistic chiral mesonbaryon amplitude for the final state interaction it is shown that the interference between the direct and the rescattering contributions can strongly distort the peak structure of the lambda1405 in the mass distribution this indicates the necessity of a detailed investigation of the reaction mechanism in order to extract the lambda1405 property in the pi sigma mass distribution
|
[['we', 'study', 'the', 'mechanism', 'of', 'the', 'weak', 'decay', 'process', 'of', 'xi_b0', 'into', 'd0', 'with', 'a', 'mesonbaryon', 'pair', 'it', 'is', 'shown', 'that', 'the', 'dominant', 'component', 'of', 'the', 'prompt', 'weak', 'decay', 'produces', 'the', 'mesonbaryon', 'pair', 'with', 'the', 'spectator', 'strange', 'quark', 'being', 'transferred', 'to', 'the', 'baryon', 'so', 'that', 'the', 'kbar', 'n', 'channel', 'is', 'absent', 'subsequent', 'final', 'state', 'interaction', 'then', 'reflects', 'the', 'pi', 'sigma', 'originated', 'lambda1405', 'formation', 'amplitude', 'which', 'has', 'been', 'difficult', 'to', 'access', 'in', 'previous', 'experimental', 'studies', 'we', 'predict', 'the', 'line', 'shapes', 'of', 'the', 'pi', 'sigma', 'invariant', 'mass', 'distribution', 'using', 'a', 'realistic', 'chiral', 'mesonbaryon', 'amplitude', 'for', 'the', 'final', 'state', 'interaction', 'it', 'is', 'shown', 'that', 'the', 'interference', 'between', 'the', 'direct', 'and', 'the', 'rescattering', 'contributions', 'can', 'strongly', 'distort', 'the', 'peak', 'structure', 'of', 'the', 'lambda1405', 'in', 'the', 'mass', 'distribution', 'this', 'indicates', 'the', 'necessity', 'of', 'a', 'detailed', 'investigation', 'of', 'the', 'reaction', 'mechanism', 'in', 'order', 'to', 'extract', 'the', 'lambda1405', 'property', 'in', 'the', 'pi', 'sigma', 'mass', 'distribution']]
|
[-0.13717214727453333, 0.20275118853385574, -0.1410076553837752, 0.12012880453822446, -0.05800323209542831, -0.07064727583201602, 0.03683901620978439, 0.32001411151518494, -0.24126663961372263, -0.2195392650979999, -0.07365926586695619, -0.31272648249727647, -0.08066246085139495, 0.06119349687611936, 0.10516926380365181, 0.05623037032027905, 0.07952799642383046, 0.07825854839993061, -0.02193771005840972, -0.1736437612027559, 0.3644260478180808, 0.009669341801388844, 0.25894101503355477, 0.1243638929571151, 0.0036484904090143943, 0.015556848853373446, -0.026593385931699083, -0.10871364311881464, -0.10847843216484958, 0.03495098910030179, 0.18132367177993827, 0.08407764894592047, 0.14468256304374066, -0.3552335504115232, -0.16104321746998057, 0.12932105894779433, 0.18191540927462582, 0.12673489618464373, -0.01722394907847047, -0.3266510382496022, 0.1234444955558944, -0.17668989356103781, -0.1376643825001461, -0.03562441560112544, 0.0532707496565087, -0.06253924627467436, -0.3199661810338856, 0.08834726534582474, 0.024870515791573435, -0.017980583672839646, -0.029523382361386775, -0.1791719969533497, -0.08513114992780862, 0.09562615840695798, 0.10091267830697738, 0.10822250716945918, 0.1615238880134515, -0.14247858255308726, -0.07629511980544398, 0.37327363410008113, -0.06675769764115103, -0.16668088997185632, 0.13757133881468642, -0.17366879957105108, -0.1267955644666595, 0.2053245813963381, 0.1590150844335644, 0.037890870071596756, -0.16590186734597287, 0.07104364791656907, -0.03969351236859488, 0.21710739403371573, 0.05660186594704519, 0.04645072346288912, 0.18647393579217228, 0.19880520399798313, -0.0275741216751772, 0.10713138519723371, -0.10197037526381177, -0.11289306974818779, -0.3366059665379391, -0.08349349948174849, -0.1286603581825762, 0.07805852421301392, -0.01972614210368389, -0.10499533191692978, 0.3943617855024845, 0.056683686064757606, 0.2871255658290072, -0.03400598606959967, 0.3233931191970368, 0.1170910396589583, 0.07422741335137067, 0.03884184897902447, 0.29718181181296305, 0.23416230628720006, 0.09632001391523895, -0.3213368327344289, 0.08638919374238499, -0.009212294552550727]
|
1,803.05573
|
Improving GANs Using Optimal Transport
|
We present Optimal Transport GAN (OT-GAN), a variant of generative
adversarial nets minimizing a new metric measuring the distance between the
generator distribution and the data distribution. This metric, which we call
mini-batch energy distance, combines optimal transport in primal form with an
energy distance defined in an adversarially learned feature space, resulting in
a highly discriminative distance function with unbiased mini-batch gradients.
Experimentally we show OT-GAN to be highly stable when trained with large
mini-batches, and we present state-of-the-art results on several popular
benchmark problems for image generation.
|
cs.LG stat.ML
|
we present optimal transport gan otgan a variant of generative adversarial nets minimizing a new metric measuring the distance between the generator distribution and the data distribution this metric which we call minibatch energy distance combines optimal transport in primal form with an energy distance defined in an adversarially learned feature space resulting in a highly discriminative distance function with unbiased minibatch gradients experimentally we show otgan to be highly stable when trained with large minibatches and we present stateoftheart results on several popular benchmark problems for image generation
|
[['we', 'present', 'optimal', 'transport', 'gan', 'otgan', 'a', 'variant', 'of', 'generative', 'adversarial', 'nets', 'minimizing', 'a', 'new', 'metric', 'measuring', 'the', 'distance', 'between', 'the', 'generator', 'distribution', 'and', 'the', 'data', 'distribution', 'this', 'metric', 'which', 'we', 'call', 'minibatch', 'energy', 'distance', 'combines', 'optimal', 'transport', 'in', 'primal', 'form', 'with', 'an', 'energy', 'distance', 'defined', 'in', 'an', 'adversarially', 'learned', 'feature', 'space', 'resulting', 'in', 'a', 'highly', 'discriminative', 'distance', 'function', 'with', 'unbiased', 'minibatch', 'gradients', 'experimentally', 'we', 'show', 'otgan', 'to', 'be', 'highly', 'stable', 'when', 'trained', 'with', 'large', 'minibatches', 'and', 'we', 'present', 'stateoftheart', 'results', 'on', 'several', 'popular', 'benchmark', 'problems', 'for', 'image', 'generation']]
|
[-0.06077831858319455, 0.03365474332681986, -0.071743632171667, 0.10960816387916733, -0.07540012760109258, -0.1563823217012245, 0.019131736203642755, 0.4951269027573624, -0.35815311557260054, -0.30896027857202224, 0.02137390937490239, -0.28691404958351935, -0.153319313859931, 0.17450544902862147, -0.13663558599849543, 0.11197130387948676, 0.12794464104808867, -0.013543592891709387, -0.09308703197166324, -0.2651285271363697, 0.33565473668651935, 0.0801279491038415, 0.34552677277604055, -0.020947156591747684, 0.19346291112750982, -0.027355048880409235, 0.03973959280103017, 0.04363991869392741, -0.1075419956181284, 0.20232853102872425, 0.24707913537905818, 0.17540382282894063, 0.327245199597901, -0.3780808266273689, -0.1826172078526097, 0.13692245676299963, 0.09346643381420223, 0.10984576988467497, -0.11836404932111544, -0.27854486252984095, 0.07162461304052294, -0.1287791970153821, 0.0009088693133116454, -0.11603166992594113, -0.03938581102966577, 0.0295066240447006, -0.34020411749852114, 0.04586421692979404, 0.013977431964780533, 0.025676698948460065, -0.05045275533593249, -0.12387972427836497, -0.0003751737076318127, 0.08744995127834819, 0.02437491192423535, 0.1006215126735383, 0.1151964944545126, -0.13041498756903255, -0.11443157773464918, 0.29225586127789543, -0.1267168080546604, -0.24168769678070168, 0.13120392008802328, -0.0331726832443784, -0.0962765905684952, 0.05070120299197519, 0.27445267707553705, 0.21056003024501876, -0.18594394933419628, 0.012494845892538199, -0.037981108901487, 0.15684674791563516, 0.025230043482078218, 0.03384276500892365, 0.13266808542439007, 0.23249902187354177, 0.13358985065300574, 0.19763885926717528, -0.1617297484223656, -0.1072705094006726, -0.2628683875925068, -0.1051876795713672, -0.24831832602523782, 0.013158999675156912, -0.18125994066171208, -0.1932901161235768, 0.37678520724273706, 0.1864366604138337, 0.28322818459964344, 0.14992279723291982, 0.2920769901796319, 0.05775439866615095, 0.0870280522189435, 0.19492453900861673, 0.21240456010504016, 0.03162226201056492, 0.06604466450282898, -0.16908632634186196, 0.09083240417677951, 0.0925845359291496]
|
1,803.05574
|
Universal Dissipationless Dynamics in Gaussian Continuous-variable Open
Systems
|
We investigate the universal dissipationless dynamics of Gaussian
continuous-variable systems in the presence of a band-gapped bosonic
environment. Our results show that environmental band gaps can induce localized
modes, which give rise to the dissipationless dynamics where the system behaves
as free oscillators instead of experiencing a full decay in the long time
limit. We present a complete characterization of localized modes, and show the
existence of the critical system-environment coupling. Beyond the critical
values, localized modes can be produced and the system dynamics become
dissipationless. This novel dynamics can be utilized to overcome the
environmental noises and protect the quantum resources in the
continuous-variable quantum information.
|
quant-ph
|
we investigate the universal dissipationless dynamics of gaussian continuousvariable systems in the presence of a bandgapped bosonic environment our results show that environmental band gaps can induce localized modes which give rise to the dissipationless dynamics where the system behaves as free oscillators instead of experiencing a full decay in the long time limit we present a complete characterization of localized modes and show the existence of the critical systemenvironment coupling beyond the critical values localized modes can be produced and the system dynamics become dissipationless this novel dynamics can be utilized to overcome the environmental noises and protect the quantum resources in the continuousvariable quantum information
|
[['we', 'investigate', 'the', 'universal', 'dissipationless', 'dynamics', 'of', 'gaussian', 'continuousvariable', 'systems', 'in', 'the', 'presence', 'of', 'a', 'bandgapped', 'bosonic', 'environment', 'our', 'results', 'show', 'that', 'environmental', 'band', 'gaps', 'can', 'induce', 'localized', 'modes', 'which', 'give', 'rise', 'to', 'the', 'dissipationless', 'dynamics', 'where', 'the', 'system', 'behaves', 'as', 'free', 'oscillators', 'instead', 'of', 'experiencing', 'a', 'full', 'decay', 'in', 'the', 'long', 'time', 'limit', 'we', 'present', 'a', 'complete', 'characterization', 'of', 'localized', 'modes', 'and', 'show', 'the', 'existence', 'of', 'the', 'critical', 'systemenvironment', 'coupling', 'beyond', 'the', 'critical', 'values', 'localized', 'modes', 'can', 'be', 'produced', 'and', 'the', 'system', 'dynamics', 'become', 'dissipationless', 'this', 'novel', 'dynamics', 'can', 'be', 'utilized', 'to', 'overcome', 'the', 'environmental', 'noises', 'and', 'protect', 'the', 'quantum', 'resources', 'in', 'the', 'continuousvariable', 'quantum', 'information']]
|
[-0.2089771651487165, 0.20534215929021812, -0.11531839083511171, 0.05967079384805951, 0.011088872842385241, -0.13671210926588415, 0.02028409008349661, 0.294252311230971, -0.2993777916889708, -0.23873046992944097, 0.0792690803206807, -0.24507061509802094, -0.15070849110565657, 0.1893393241290776, -0.01703263542017425, 0.039773567829128435, 0.0527658598356933, -0.007016317756354528, -0.034478187106356445, -0.19145395755240657, 0.2949547671871084, 0.011341529430487668, 0.2989334653061375, 0.03504413220469119, 0.046750788774587354, -0.0007094175616314389, 0.047226697841290174, -0.017802201395959786, -0.13782607046438367, 0.031744314722259935, 0.24690771502671097, 0.025982439034741442, 0.28918446614494864, -0.4812910627081709, -0.23288659099050146, 0.12090887901601645, 0.17542233352795383, 0.20132526418277644, -0.02849310357782568, -0.33901203542350317, 0.03644819758428296, -0.1781964937910297, -0.16595695296056429, -0.11616169453932429, -0.02079983935954998, -0.006124372268974219, -0.26606281314106695, 0.11875732731456289, 0.09056515755177967, 0.015045212546609482, -0.0296231900508744, 0.0004817445889853363, -0.04014077270623156, 0.17861777534796242, -0.030013218816954044, -0.03854489614330408, 0.18019825706416565, -0.16156363558191103, -0.1396490115395589, 0.35850952867910546, -0.1059502808054259, -0.17780614883269905, 0.2263001509335876, -0.13184666935407188, -0.08359569835230568, 0.0945589284430135, 0.19957396712918538, 0.052874760693466326, -0.1334075458124851, 0.059473045361953136, 0.02318985805899467, 0.1834036827719999, 0.010358620536039179, 0.17939980593861415, 0.27187933359857436, 0.15175160241998592, 0.07286556801354548, 0.17890496860381286, -0.06221767600168878, -0.1245117901850773, -0.28915992564135146, -0.1552354574449501, -0.2174174019161893, 0.08617579375647935, -0.03913609193649499, -0.19077596640354902, 0.43092442379456086, 0.17884312423148174, 0.1639166492441634, 0.009805476757530827, 0.27153897988346387, 0.15740627013059016, 0.05520812452129387, 0.09983527427099927, 0.25251000827916387, 0.13642073711731806, 0.07606606214430253, -0.2735723333907855, 0.017029044170038036, -0.035542321154180004]
|
1,803.05575
|
Global Stabilization for Causally Consistent Partial Replication
|
Causally consistent distributed storage systems have received significant
attention recently due to the potential for providing high throughput and
causality guarantees. {\em Global stabilization} is a technique established for
achieving causal consistency in distributed multi-version key-value store
systems, adopted by the previous work such as GentleRain
\cite{Du2014GentleRainCA} and Cure \cite{akkoorath2016cure}. Intuitively, this
approach serializes all updates by their physical time and computes the
``Global Stable Time'' which is a time point $t$ such that versions with
timestamp $\leq t$ can be returned to the client without violating causality.
However, all previous designs with global stabilization assume {\em full
replication}, where each data center stores a full copy of data, and each
client is restricted to access servers within one data center. In this paper,
we propose a theoretical framework to support {\em general partial replication}
with causal consistency via global stabilization, where each server can store
an arbitrary subset of the data, and each client is allowed to communicate with
any subset of the servers and migrate among them without extra delays. We
propose an algorithm that implements causal consistency for distributed
multi-version key-value stores with general partially replication. We prove the
optimality of the Global Stable Time computation in our algorithm regarding the
remote update visibility latency, i.e. how fast update from a remote server is
visible to the client, under general partial replication. We also provide
trade-offs to further optimize the remote update visibility by introducing
extra delays during client's migration. Simulation results on the performance
of our algorithm compared to the previous work are also provided.
|
cs.DC
|
causally consistent distributed storage systems have received significant attention recently due to the potential for providing high throughput and causality guarantees em global stabilization is a technique established for achieving causal consistency in distributed multiversion keyvalue store systems adopted by the previous work such as gentlerain citedu2014gentlerainca and cure citeakkoorath2016cure intuitively this approach serializes all updates by their physical time and computes the global stable time which is a time point t such that versions with timestamp leq t can be returned to the client without violating causality however all previous designs with global stabilization assume em full replication where each data center stores a full copy of data and each client is restricted to access servers within one data center in this paper we propose a theoretical framework to support em general partial replication with causal consistency via global stabilization where each server can store an arbitrary subset of the data and each client is allowed to communicate with any subset of the servers and migrate among them without extra delays we propose an algorithm that implements causal consistency for distributed multiversion keyvalue stores with general partially replication we prove the optimality of the global stable time computation in our algorithm regarding the remote update visibility latency ie how fast update from a remote server is visible to the client under general partial replication we also provide tradeoffs to further optimize the remote update visibility by introducing extra delays during clients migration simulation results on the performance of our algorithm compared to the previous work are also provided
|
[['causally', 'consistent', 'distributed', 'storage', 'systems', 'have', 'received', 'significant', 'attention', 'recently', 'due', 'to', 'the', 'potential', 'for', 'providing', 'high', 'throughput', 'and', 'causality', 'guarantees', 'em', 'global', 'stabilization', 'is', 'a', 'technique', 'established', 'for', 'achieving', 'causal', 'consistency', 'in', 'distributed', 'multiversion', 'keyvalue', 'store', 'systems', 'adopted', 'by', 'the', 'previous', 'work', 'such', 'as', 'gentlerain', 'citedu2014gentlerainca', 'and', 'cure', 'citeakkoorath2016cure', 'intuitively', 'this', 'approach', 'serializes', 'all', 'updates', 'by', 'their', 'physical', 'time', 'and', 'computes', 'the', 'global', 'stable', 'time', 'which', 'is', 'a', 'time', 'point', 't', 'such', 'that', 'versions', 'with', 'timestamp', 'leq', 't', 'can', 'be', 'returned', 'to', 'the', 'client', 'without', 'violating', 'causality', 'however', 'all', 'previous', 'designs', 'with', 'global', 'stabilization', 'assume', 'em', 'full', 'replication', 'where', 'each', 'data', 'center', 'stores', 'a', 'full', 'copy', 'of', 'data', 'and', 'each', 'client', 'is', 'restricted', 'to', 'access', 'servers', 'within', 'one', 'data', 'center', 'in', 'this', 'paper', 'we', 'propose', 'a', 'theoretical', 'framework', 'to', 'support', 'em', 'general', 'partial', 'replication', 'with', 'causal', 'consistency', 'via', 'global', 'stabilization', 'where', 'each', 'server', 'can', 'store', 'an', 'arbitrary', 'subset', 'of', 'the', 'data', 'and', 'each', 'client', 'is', 'allowed', 'to', 'communicate', 'with', 'any', 'subset', 'of', 'the', 'servers', 'and', 'migrate', 'among', 'them', 'without', 'extra', 'delays', 'we', 'propose', 'an', 'algorithm', 'that', 'implements', 'causal', 'consistency', 'for', 'distributed', 'multiversion', 'keyvalue', 'stores', 'with', 'general', 'partially', 'replication', 'we', 'prove', 'the', 'optimality', 'of', 'the', 'global', 'stable', 'time', 'computation', 'in', 'our', 'algorithm', 'regarding', 'the', 'remote', 'update', 'visibility', 'latency', 'ie', 'how', 'fast', 'update', 'from', 'a', 'remote', 'server', 'is', 'visible', 'to', 'the', 'client', 'under', 'general', 'partial', 'replication', 'we', 'also', 'provide', 'tradeoffs', 'to', 'further', 'optimize', 'the', 'remote', 'update', 'visibility', 'by', 'introducing', 'extra', 'delays', 'during', 'clients', 'migration', 'simulation', 'results', 'on', 'the', 'performance', 'of', 'our', 'algorithm', 'compared', 'to', 'the', 'previous', 'work', 'are', 'also', 'provided']]
|
[-0.16523930584505467, 0.04315188257415518, -0.05138510889065695, 0.01934444258335601, -0.11398710405040924, -0.22795897479991678, 0.15532899742215828, 0.3857651863479081, -0.2972834762330765, -0.31587552077930553, 0.12463237466843226, -0.2393570252665199, -0.0768721362916528, 0.1210998382332376, -0.13517342638874386, 0.09500094035872284, 0.08110719954355797, 0.06964626690250067, -0.0019764007709681232, -0.29939820062992406, 0.25604919383097585, 0.08488526585313005, 0.2942159776593982, 0.010709525209875118, 0.0914480500503041, 0.061495027584585464, -0.049707665682973246, 0.001596461947108637, -0.08451773093498977, 0.10134601912367001, 0.26674570630627037, 0.23404649931100352, 0.29141070293842414, -0.47434131055730594, -0.18228057322567076, 0.11221616491784092, 0.13379885208886297, 0.10944632141613528, -0.05777326833179532, -0.2759399265080332, 0.12849148489527606, -0.180218954969212, -0.05826678084470477, -0.08751737991253236, -0.002659246869066346, 0.017351461604784752, -0.32913479659387457, 0.008676961999058593, 0.0009391471917527195, 0.015441846352519923, -0.054380368065371644, -0.030010634279947598, -0.011773345341492835, 0.1541886339000343, 0.016433546061406512, 0.04400145824534768, 0.10791623371391437, -0.03513890713863691, -0.16740841195820777, 0.3418527489513565, 0.004752593100476822, -0.18417557599276652, 0.17692544023553453, -0.058324016313565034, -0.18631937441593652, 0.1071827910724549, 0.1639275851166637, 0.07874024249178427, -0.18166443395359508, 0.0826977653042069, -0.039418602862362734, 0.183296583591646, 0.0779881339560078, 0.08898499527205948, 0.1488884005295602, 0.16573774842146768, 0.12076685050817693, 0.1177843373077686, -0.04256330512349443, -0.12176580006321928, -0.2847133951188257, -0.15447571654876527, -0.16718110059553773, -0.01213928528858443, -0.11846726985386906, -0.11364960380565331, 0.33895733732556205, 0.18617919377225237, 0.19340417320850933, 0.11526121093360671, 0.38906137843830113, 0.047993825029686875, 0.10260665235299878, 0.19064985715751517, 0.15695400471193896, 0.024617959687700097, 0.13985120359235642, -0.2024865281172024, 0.13888619672486663, 0.008616694899689015]
|
1,803.05576
|
Facelet-Bank for Fast Portrait Manipulation
|
Digital face manipulation has become a popular and fascinating way to touch
images with the prevalence of smartphones and social networks. With a wide
variety of user preferences, facial expressions, and accessories, a general and
flexible model is necessary to accommodate different types of facial editing.
In this paper, we propose a model to achieve this goal based on an end-to-end
convolutional neural network that supports fast inference, edit-effect control,
and quick partial-model update. In addition, this model learns from unpaired
image sets with different attributes. Experimental results show that our
framework can handle a wide range of expressions, accessories, and makeup
effects. It produces high-resolution and high-quality results in fast speed.
|
cs.CV
|
digital face manipulation has become a popular and fascinating way to touch images with the prevalence of smartphones and social networks with a wide variety of user preferences facial expressions and accessories a general and flexible model is necessary to accommodate different types of facial editing in this paper we propose a model to achieve this goal based on an endtoend convolutional neural network that supports fast inference editeffect control and quick partialmodel update in addition this model learns from unpaired image sets with different attributes experimental results show that our framework can handle a wide range of expressions accessories and makeup effects it produces highresolution and highquality results in fast speed
|
[['digital', 'face', 'manipulation', 'has', 'become', 'a', 'popular', 'and', 'fascinating', 'way', 'to', 'touch', 'images', 'with', 'the', 'prevalence', 'of', 'smartphones', 'and', 'social', 'networks', 'with', 'a', 'wide', 'variety', 'of', 'user', 'preferences', 'facial', 'expressions', 'and', 'accessories', 'a', 'general', 'and', 'flexible', 'model', 'is', 'necessary', 'to', 'accommodate', 'different', 'types', 'of', 'facial', 'editing', 'in', 'this', 'paper', 'we', 'propose', 'a', 'model', 'to', 'achieve', 'this', 'goal', 'based', 'on', 'an', 'endtoend', 'convolutional', 'neural', 'network', 'that', 'supports', 'fast', 'inference', 'editeffect', 'control', 'and', 'quick', 'partialmodel', 'update', 'in', 'addition', 'this', 'model', 'learns', 'from', 'unpaired', 'image', 'sets', 'with', 'different', 'attributes', 'experimental', 'results', 'show', 'that', 'our', 'framework', 'can', 'handle', 'a', 'wide', 'range', 'of', 'expressions', 'accessories', 'and', 'makeup', 'effects', 'it', 'produces', 'highresolution', 'and', 'highquality', 'results', 'in', 'fast', 'speed']]
|
[-0.05287667280063033, 0.003161212364978961, -0.06325570046901703, 0.030515272375619545, -0.15125237632204186, -0.21006386538713492, 0.02631741807880727, 0.4737337844954296, -0.2484041914343834, -0.3453353261194107, 0.04591724268605255, -0.2555123215160248, -0.23950935589488256, 0.2151086022548208, -0.1648226533635435, 0.052543696541000495, 0.11868195106614042, 0.017876671129752966, -0.04577805546260524, -0.23491046904924917, 0.2653083647093312, -0.0004589504308321259, 0.3472812840207057, 0.06155934821475636, 0.14293642698533154, 0.022309974501629106, -0.02273171361197125, 0.005699409424877641, -0.08193154454466739, 0.1932901718473824, 0.31720898469740694, 0.2149124622260305, 0.2876930736132305, -0.4499271427196535, -0.20688593391837043, 0.04705548066730526, 0.13237439628415318, 0.1539594018874182, -0.09109595170435072, -0.32284838562323287, 0.11502371887591752, -0.21907561536539685, -0.018721369006247685, -0.17439674068750305, 0.01561741047136655, -0.0015735662118955092, -0.3130182622762566, 0.0063872977583245795, 0.02575345235368745, 0.08132830681279302, -0.06256013165905394, -0.06128226905447346, 0.025200882958332924, 0.19635050904048099, 0.018222486942117526, 0.03000672212166881, 0.13291253193535588, -0.19711508729325777, -0.1127585634927858, 0.38158941816707903, -0.016976405705579303, -0.19090755771506918, 0.2333386625607752, -0.048155088606290516, -0.12899709947999904, 0.10176299200816588, 0.27396037506616927, 0.13487373274666342, -0.18600097585638817, -0.011511604500066658, -0.06730202865384688, 0.1970543091947382, 0.026361312031407246, 0.026612598753655965, 0.22578651396642355, 0.23913291360632602, 0.03243762543424964, 0.12586565811864353, -0.12362121900077909, -0.0462915134658529, -0.1840193528766659, -0.10601005513559689, -0.1326593202581121, -0.02634460626868531, -0.11785891318431822, -0.18484580528668382, 0.44770526879213074, 0.23217109534466132, 0.24006140260449188, 0.11929802196100354, 0.35030028900470245, 0.0022747746213677934, 0.10925818553025073, 0.061246096397834744, 0.11312526315873997, 0.002538583698597821, 0.15001250181601128, -0.1270905629795214, 0.10194236527789723, -0.005795192735438997]
|
1,803.05577
|
The Penetration Effect of Connected Automated Vehicles in Urban Traffic:
An Energy Impact Study
|
Earlier work has established a decentralized framework of optimally
controlling connected and automated vehicles (CAVs) crossing an urban
intersection without using explicit traffic signaling. The proposed solution is
capable of minimizing energy consumption subject to a throughput maximization
requirement. In this paper, we address the problem of optimally controlling
CAVs under mixed traffic conditions where both CAVs and human-driven vehicles
(non-CAVs) travel on the roads, so as to minimize energy consumption while
guaranteeing safety constraints. The impact of CAVs on overall energy
consumption is also investigated under different traffic scenarios. The benefit
from CAV penetration (i.e., the fraction of CAVs relative to all vehicles) is
validated through simulation in MATLAB and VISSIM. The results indicate that
the energy efficiency improvement becomes more significant as the CAV
penetration rate increases, while the significance diminishes as the traffic
becomes heavier
|
math.OC
|
earlier work has established a decentralized framework of optimally controlling connected and automated vehicles cavs crossing an urban intersection without using explicit traffic signaling the proposed solution is capable of minimizing energy consumption subject to a throughput maximization requirement in this paper we address the problem of optimally controlling cavs under mixed traffic conditions where both cavs and humandriven vehicles noncavs travel on the roads so as to minimize energy consumption while guaranteeing safety constraints the impact of cavs on overall energy consumption is also investigated under different traffic scenarios the benefit from cav penetration ie the fraction of cavs relative to all vehicles is validated through simulation in matlab and vissim the results indicate that the energy efficiency improvement becomes more significant as the cav penetration rate increases while the significance diminishes as the traffic becomes heavier
|
[['earlier', 'work', 'has', 'established', 'a', 'decentralized', 'framework', 'of', 'optimally', 'controlling', 'connected', 'and', 'automated', 'vehicles', 'cavs', 'crossing', 'an', 'urban', 'intersection', 'without', 'using', 'explicit', 'traffic', 'signaling', 'the', 'proposed', 'solution', 'is', 'capable', 'of', 'minimizing', 'energy', 'consumption', 'subject', 'to', 'a', 'throughput', 'maximization', 'requirement', 'in', 'this', 'paper', 'we', 'address', 'the', 'problem', 'of', 'optimally', 'controlling', 'cavs', 'under', 'mixed', 'traffic', 'conditions', 'where', 'both', 'cavs', 'and', 'humandriven', 'vehicles', 'noncavs', 'travel', 'on', 'the', 'roads', 'so', 'as', 'to', 'minimize', 'energy', 'consumption', 'while', 'guaranteeing', 'safety', 'constraints', 'the', 'impact', 'of', 'cavs', 'on', 'overall', 'energy', 'consumption', 'is', 'also', 'investigated', 'under', 'different', 'traffic', 'scenarios', 'the', 'benefit', 'from', 'cav', 'penetration', 'ie', 'the', 'fraction', 'of', 'cavs', 'relative', 'to', 'all', 'vehicles', 'is', 'validated', 'through', 'simulation', 'in', 'matlab', 'and', 'vissim', 'the', 'results', 'indicate', 'that', 'the', 'energy', 'efficiency', 'improvement', 'becomes', 'more', 'significant', 'as', 'the', 'cav', 'penetration', 'rate', 'increases', 'while', 'the', 'significance', 'diminishes', 'as', 'the', 'traffic', 'becomes', 'heavier']]
|
[-0.21136521099961234, 0.07299112338314842, -0.015524296896841486, 0.02719530776435387, -0.04673307623381108, -0.1273127735803162, 0.13129513063315085, 0.35277050502435137, -0.23213390262421887, -0.354758579474296, 0.0946997329813639, -0.2781363972122815, -0.08779892296849812, 0.21313453932721033, -0.163307916834427, 0.08959788536775286, 0.09266931068723219, 0.03550247209704053, 0.01837035803035935, -0.25857448309530795, 0.24846145498437167, 0.09787823411085418, 0.4072862412291069, 0.15636479729076128, 0.09710708773443408, 0.009968570158239046, 0.008512245272762094, 0.026994088630661044, -0.07480738148201353, 0.10909892098526096, 0.3126889162945024, 0.16633241877204527, 0.30746697851993743, -0.49847289564998915, -0.2663391130588894, 0.15101441871510804, 0.14964266062924897, -0.0027350077412369913, -0.014211294646260166, -0.27282810998387147, 0.11388789031936712, -0.20641778985949327, -0.09846255588719119, -0.014080083962142413, -0.03165033284275636, 0.05809574533359277, -0.2767435484259886, 0.02724929224426967, -0.035102226174626425, 0.062306443013694396, -0.10169610723404444, -0.0802319080035209, -0.06397087070462124, 0.17032989066087362, 0.10821554175047815, -0.011681230966491204, 0.1729897849328041, -0.16434416502381055, -0.06505104053908292, 0.396643251122866, 0.01784987837147566, -0.1808191445064697, 0.11799892792852093, 0.010062191909838494, -0.09435816089572541, 0.1472264532081402, 0.24785129984935922, 0.06638866448842913, -0.19054001287631964, 0.005434702271612592, 0.02528445362912178, 0.13494360663275487, 0.0813569770658552, 0.01726517877643452, 0.15104406573775694, 0.2628070239970175, 0.22892530660151783, 0.10779163167118537, -0.08461033573788829, -0.13322772778720207, -0.22435165866427667, -0.1619006396427642, -0.14562309905291826, -0.011203722045994806, -0.07728943659086546, -0.03551603953632777, 0.35331473599466745, 0.16365891594412554, 0.1299294650479879, 0.12820159027312142, 0.4248284666533888, 0.12420968851414475, 0.04446831154874968, 0.16176110355142695, 0.19838195354643748, 0.0009594903765994049, 0.17215350388471093, -0.2916091192585083, 0.1362401277020601, -0.02326239899385476]
|
1,803.05578
|
A2BCD: An Asynchronous Accelerated Block Coordinate Descent Algorithm
With Optimal Complexity
|
In this paper, we propose the Asynchronous Accelerated Nonuniform Randomized
Block Coordinate Descent algorithm (A2BCD), the first asynchronous
Nesterov-accelerated algorithm that achieves optimal complexity. This parallel
algorithm solves the unconstrained convex minimization problem, using p
computing nodes which compute updates to shared solution vectors, in an
asynchronous fashion with no central coordination. Nodes in asynchronous
algorithms do not wait for updates from other nodes before starting a new
iteration, but simply compute updates using the most recent solution
information available. This allows them to complete iterations much faster than
traditional ones, especially at scale, by eliminating the costly
synchronization penalty of traditional algorithms.
We first prove that A2BCD converges linearly to a solution with a fast
accelerated rate that matches the recently proposed NU_ACDM, so long as the
maximum delay is not too large. Somewhat surprisingly, A2BCD pays no complexity
penalty for using outdated information. We then prove lower complexity bounds
for randomized coordinate descent methods, which show that A2BCD (and hence
NU_ACDM) has optimal complexity to within a constant factor. We confirm with
numerical experiments that A2BCD outperforms NU_ACDM, which is the current
fastest coordinate descent algorithm, even at small scale. We also derive and
analyze a second-order ordinary differential equation, which is the
continuous-time limit of our algorithm, and prove it converges linearly to a
solution with a similar accelerated rate.
|
math.OC
|
in this paper we propose the asynchronous accelerated nonuniform randomized block coordinate descent algorithm a2bcd the first asynchronous nesterovaccelerated algorithm that achieves optimal complexity this parallel algorithm solves the unconstrained convex minimization problem using p computing nodes which compute updates to shared solution vectors in an asynchronous fashion with no central coordination nodes in asynchronous algorithms do not wait for updates from other nodes before starting a new iteration but simply compute updates using the most recent solution information available this allows them to complete iterations much faster than traditional ones especially at scale by eliminating the costly synchronization penalty of traditional algorithms we first prove that a2bcd converges linearly to a solution with a fast accelerated rate that matches the recently proposed nu_acdm so long as the maximum delay is not too large somewhat surprisingly a2bcd pays no complexity penalty for using outdated information we then prove lower complexity bounds for randomized coordinate descent methods which show that a2bcd and hence nu_acdm has optimal complexity to within a constant factor we confirm with numerical experiments that a2bcd outperforms nu_acdm which is the current fastest coordinate descent algorithm even at small scale we also derive and analyze a secondorder ordinary differential equation which is the continuoustime limit of our algorithm and prove it converges linearly to a solution with a similar accelerated rate
|
[['in', 'this', 'paper', 'we', 'propose', 'the', 'asynchronous', 'accelerated', 'nonuniform', 'randomized', 'block', 'coordinate', 'descent', 'algorithm', 'a2bcd', 'the', 'first', 'asynchronous', 'nesterovaccelerated', 'algorithm', 'that', 'achieves', 'optimal', 'complexity', 'this', 'parallel', 'algorithm', 'solves', 'the', 'unconstrained', 'convex', 'minimization', 'problem', 'using', 'p', 'computing', 'nodes', 'which', 'compute', 'updates', 'to', 'shared', 'solution', 'vectors', 'in', 'an', 'asynchronous', 'fashion', 'with', 'no', 'central', 'coordination', 'nodes', 'in', 'asynchronous', 'algorithms', 'do', 'not', 'wait', 'for', 'updates', 'from', 'other', 'nodes', 'before', 'starting', 'a', 'new', 'iteration', 'but', 'simply', 'compute', 'updates', 'using', 'the', 'most', 'recent', 'solution', 'information', 'available', 'this', 'allows', 'them', 'to', 'complete', 'iterations', 'much', 'faster', 'than', 'traditional', 'ones', 'especially', 'at', 'scale', 'by', 'eliminating', 'the', 'costly', 'synchronization', 'penalty', 'of', 'traditional', 'algorithms', 'we', 'first', 'prove', 'that', 'a2bcd', 'converges', 'linearly', 'to', 'a', 'solution', 'with', 'a', 'fast', 'accelerated', 'rate', 'that', 'matches', 'the', 'recently', 'proposed', 'nu_acdm', 'so', 'long', 'as', 'the', 'maximum', 'delay', 'is', 'not', 'too', 'large', 'somewhat', 'surprisingly', 'a2bcd', 'pays', 'no', 'complexity', 'penalty', 'for', 'using', 'outdated', 'information', 'we', 'then', 'prove', 'lower', 'complexity', 'bounds', 'for', 'randomized', 'coordinate', 'descent', 'methods', 'which', 'show', 'that', 'a2bcd', 'and', 'hence', 'nu_acdm', 'has', 'optimal', 'complexity', 'to', 'within', 'a', 'constant', 'factor', 'we', 'confirm', 'with', 'numerical', 'experiments', 'that', 'a2bcd', 'outperforms', 'nu_acdm', 'which', 'is', 'the', 'current', 'fastest', 'coordinate', 'descent', 'algorithm', 'even', 'at', 'small', 'scale', 'we', 'also', 'derive', 'and', 'analyze', 'a', 'secondorder', 'ordinary', 'differential', 'equation', 'which', 'is', 'the', 'continuoustime', 'limit', 'of', 'our', 'algorithm', 'and', 'prove', 'it', 'converges', 'linearly', 'to', 'a', 'solution', 'with', 'a', 'similar', 'accelerated', 'rate']]
|
[-0.13325575650522803, 0.03506799891538895, -0.08517887303815433, 0.0612062754472382, -0.10185599857983221, -0.2272541099293514, 0.09822542793044048, 0.4038681068231125, -0.3101541526706864, -0.2770859187485667, 0.11886879193296589, -0.22867475663263798, -0.15514623271490172, 0.16918571790321604, -0.10324810391610807, 0.05826826278290183, 0.10689310709786443, 0.05884168484994957, -0.1015172372572124, -0.3081869546214941, 0.1966471864505218, 0.08930989224379798, 0.27454993392231763, -0.03745525683221818, 0.15888926055154404, -0.01018672129391013, -0.010197548365098768, 0.042107074287864754, -0.07935486631056946, 0.08688194030289631, 0.2708378222966063, 0.18822393736168574, 0.3383030755999121, -0.4348560169020349, -0.1238219486282056, 0.14949298206599312, 0.21015937265631668, 0.16887151780181672, -0.06954235653707606, -0.21143116485663094, 0.1210694689374954, -0.1409410900469903, -0.06820153748327636, -0.09232628859237658, -0.01620052863638177, 0.03734555252542434, -0.3073654299127861, 0.05868113352767683, 0.03325081714019935, -0.008799903581405545, -0.02693438259827032, -0.11831927477373733, 0.0639476000681637, 0.041412512907078744, 0.060758216613337294, 0.0762853106695672, 0.11018042932558167, -0.053698820276982945, -0.13849178704156265, 0.3286682344251522, -0.0620269206414017, -0.18988969625888374, 0.15605562143258517, -0.06280313571705273, -0.15656479001401816, 0.1673360572989426, 0.17215334537645136, 0.18224253686069436, -0.13445586747666066, 0.08888836913067755, -0.054406851093779816, 0.19004421926896414, 0.06509892822941765, 0.0022970768696469095, 0.044026854565484566, 0.1488023217586758, 0.20240769011014653, 0.12289923077962059, -0.026014382543114667, -0.16036262309917057, -0.23439499209918133, -0.12560838804714516, -0.19132709999459688, -0.005465705929243275, -0.13148914929459696, -0.15168516089413986, 0.32400231565105486, 0.1645832066571021, 0.19351161669033604, 0.17582610648477803, 0.36941421529496304, 0.11066551557070836, 0.06448193918202394, 0.24758298363461084, 0.1965493785892823, 0.048527778878279436, 0.12169803783684541, -0.23431074110317035, 0.11709881422103609, 0.11922688050162014]
|
1,803.05579
|
Accurate projective two-band description of topological superfluidity in
spin-orbit-coupled Fermi gases
|
The interplay of spin-orbit coupling and Zeeman splitting in ultracold Fermi
gases gives rise to a topological superfluid phase in two spatial dimensions
that can host exotic Majorana excitations. Theoretical models have so far been
based on a four-band Bogoliubov-de Gennes formalism for the combined spin-1/2
and particle-hole degrees of freedom. Here we present a simpler, yet accurate,
two-band description based on a well-controlled projection technique that
provides a new platform for exploring analogies with chiral p-wave
superfluidity and detailed future studies of spatially non-uniform situations.
|
cond-mat.quant-gas
|
the interplay of spinorbit coupling and zeeman splitting in ultracold fermi gases gives rise to a topological superfluid phase in two spatial dimensions that can host exotic majorana excitations theoretical models have so far been based on a fourband bogoliubovde gennes formalism for the combined spin12 and particlehole degrees of freedom here we present a simpler yet accurate twoband description based on a wellcontrolled projection technique that provides a new platform for exploring analogies with chiral pwave superfluidity and detailed future studies of spatially nonuniform situations
|
[['the', 'interplay', 'of', 'spinorbit', 'coupling', 'and', 'zeeman', 'splitting', 'in', 'ultracold', 'fermi', 'gases', 'gives', 'rise', 'to', 'a', 'topological', 'superfluid', 'phase', 'in', 'two', 'spatial', 'dimensions', 'that', 'can', 'host', 'exotic', 'majorana', 'excitations', 'theoretical', 'models', 'have', 'so', 'far', 'been', 'based', 'on', 'a', 'fourband', 'bogoliubovde', 'gennes', 'formalism', 'for', 'the', 'combined', 'spin12', 'and', 'particlehole', 'degrees', 'of', 'freedom', 'here', 'we', 'present', 'a', 'simpler', 'yet', 'accurate', 'twoband', 'description', 'based', 'on', 'a', 'wellcontrolled', 'projection', 'technique', 'that', 'provides', 'a', 'new', 'platform', 'for', 'exploring', 'analogies', 'with', 'chiral', 'pwave', 'superfluidity', 'and', 'detailed', 'future', 'studies', 'of', 'spatially', 'nonuniform', 'situations']]
|
[-0.20445693779173632, 0.20735105102730178, -0.13358613462620522, 0.08634075615555048, -0.12946475704395494, -0.22202758160203176, 0.07085704125550597, 0.3742701995164849, -0.14735454416747185, -0.2621157667410105, -0.06323396295124968, -0.27080523164206466, -0.12067370402605035, 0.16814207454580207, 0.06788520102908965, 0.03967328582210791, -0.019498219524055373, -0.0829067838616496, -0.14594170711948104, -0.1877452114848745, 0.3119451230673423, -0.010187502376475307, 0.3222952751919281, 0.11050809233254472, 0.03595609606655185, 0.0026884337150773338, 0.08736812466279019, 0.01109840504034574, -0.17728947893615546, 0.09984105367343439, 0.25602618673313604, -0.09612150807989502, 0.17091388510929983, -0.48375085961116954, -0.26447685509053775, 0.003120835816357718, 0.20886372956772184, 0.24334261199286164, -0.09984653702189843, -0.3712036505146602, -0.06896785544678244, -0.22116391391623333, -0.17615140313932368, -0.2174568957280974, 0.007037932849164272, -0.06631787641645344, -0.2284924377806398, 0.07630167502996534, 0.03416498344889734, 0.14457123781835965, -0.05797990304309615, -0.125427273064202, -0.010047896548585837, 0.020349381989691148, -0.04256036772452251, 0.006155167966214723, 0.06396374149859861, -0.12443978012387835, -0.1141209322417718, 0.3952635785308937, -0.07300199396085254, -0.18632677593268454, 0.2200722534041635, -0.09366535208036386, -0.11688443215368965, 0.1382672239073314, 0.14133448549343253, 0.08683407185382622, -0.16563967880955355, 0.09332386082983142, -0.08965195617963408, 0.14847216287595327, -0.041393723317183724, 0.13399738979222642, 0.3271868183429158, 0.24614593672544458, 0.05002544661388234, 0.10431186493139627, -0.12201720457740647, -0.1371365740494586, -0.2572504511362938, -0.1291447306916251, -0.21883264974539363, 0.04163211921966353, 0.00942845366740204, -0.15374894322675847, 0.4407475075446243, 0.16239029349255657, 0.1669674611996946, -0.05526335470833231, 0.2758082188503427, 0.07282191170596106, 0.02572795781198629, -0.002808459839502046, 0.258280289792564, 0.1807615279198386, 0.044390405571564685, -0.30054025868018874, -0.05634924790518748, 0.08674145787737744]
|
1,803.0558
|
Feedback Control For Cassie With Deep Reinforcement Learning
|
Bipedal locomotion skills are challenging to develop. Control strategies
often use local linearization of the dynamics in conjunction with reduced-order
abstractions to yield tractable solutions. In these model-based control
strategies, the controller is often not fully aware of many details, including
torque limits, joint limits, and other non-linearities that are necessarily
excluded from the control computations for simplicity. Deep reinforcement
learning (DRL) offers a promising model-free approach for controlling bipedal
locomotion which can more fully exploit the dynamics. However, current results
in the machine learning literature are often based on ad-hoc simulation models
that are not based on corresponding hardware. Thus it remains unclear how well
DRL will succeed on realizable bipedal robots. In this paper, we demonstrate
the effectiveness of DRL using a realistic model of Cassie, a bipedal robot. By
formulating a feedback control problem as finding the optimal policy for a
Markov Decision Process, we are able to learn robust walking controllers that
imitate a reference motion with DRL. Controllers for different walking speeds
are learned by imitating simple time-scaled versions of the original reference
motion. Controller robustness is demonstrated through several challenging
tests, including sensory delay, walking blindly on irregular terrain and
unexpected pushes at the pelvis. We also show we can interpolate between
individual policies and that robustness can be improved with an interpolated
policy.
|
cs.RO
|
bipedal locomotion skills are challenging to develop control strategies often use local linearization of the dynamics in conjunction with reducedorder abstractions to yield tractable solutions in these modelbased control strategies the controller is often not fully aware of many details including torque limits joint limits and other nonlinearities that are necessarily excluded from the control computations for simplicity deep reinforcement learning drl offers a promising modelfree approach for controlling bipedal locomotion which can more fully exploit the dynamics however current results in the machine learning literature are often based on adhoc simulation models that are not based on corresponding hardware thus it remains unclear how well drl will succeed on realizable bipedal robots in this paper we demonstrate the effectiveness of drl using a realistic model of cassie a bipedal robot by formulating a feedback control problem as finding the optimal policy for a markov decision process we are able to learn robust walking controllers that imitate a reference motion with drl controllers for different walking speeds are learned by imitating simple timescaled versions of the original reference motion controller robustness is demonstrated through several challenging tests including sensory delay walking blindly on irregular terrain and unexpected pushes at the pelvis we also show we can interpolate between individual policies and that robustness can be improved with an interpolated policy
|
[['bipedal', 'locomotion', 'skills', 'are', 'challenging', 'to', 'develop', 'control', 'strategies', 'often', 'use', 'local', 'linearization', 'of', 'the', 'dynamics', 'in', 'conjunction', 'with', 'reducedorder', 'abstractions', 'to', 'yield', 'tractable', 'solutions', 'in', 'these', 'modelbased', 'control', 'strategies', 'the', 'controller', 'is', 'often', 'not', 'fully', 'aware', 'of', 'many', 'details', 'including', 'torque', 'limits', 'joint', 'limits', 'and', 'other', 'nonlinearities', 'that', 'are', 'necessarily', 'excluded', 'from', 'the', 'control', 'computations', 'for', 'simplicity', 'deep', 'reinforcement', 'learning', 'drl', 'offers', 'a', 'promising', 'modelfree', 'approach', 'for', 'controlling', 'bipedal', 'locomotion', 'which', 'can', 'more', 'fully', 'exploit', 'the', 'dynamics', 'however', 'current', 'results', 'in', 'the', 'machine', 'learning', 'literature', 'are', 'often', 'based', 'on', 'adhoc', 'simulation', 'models', 'that', 'are', 'not', 'based', 'on', 'corresponding', 'hardware', 'thus', 'it', 'remains', 'unclear', 'how', 'well', 'drl', 'will', 'succeed', 'on', 'realizable', 'bipedal', 'robots', 'in', 'this', 'paper', 'we', 'demonstrate', 'the', 'effectiveness', 'of', 'drl', 'using', 'a', 'realistic', 'model', 'of', 'cassie', 'a', 'bipedal', 'robot', 'by', 'formulating', 'a', 'feedback', 'control', 'problem', 'as', 'finding', 'the', 'optimal', 'policy', 'for', 'a', 'markov', 'decision', 'process', 'we', 'are', 'able', 'to', 'learn', 'robust', 'walking', 'controllers', 'that', 'imitate', 'a', 'reference', 'motion', 'with', 'drl', 'controllers', 'for', 'different', 'walking', 'speeds', 'are', 'learned', 'by', 'imitating', 'simple', 'timescaled', 'versions', 'of', 'the', 'original', 'reference', 'motion', 'controller', 'robustness', 'is', 'demonstrated', 'through', 'several', 'challenging', 'tests', 'including', 'sensory', 'delay', 'walking', 'blindly', 'on', 'irregular', 'terrain', 'and', 'unexpected', 'pushes', 'at', 'the', 'pelvis', 'we', 'also', 'show', 'we', 'can', 'interpolate', 'between', 'individual', 'policies', 'and', 'that', 'robustness', 'can', 'be', 'improved', 'with', 'an', 'interpolated', 'policy']]
|
[-0.07568992411410859, 0.07176075115891184, -0.09970552252118729, 0.04817607632090916, -0.1704263667216186, -0.2299897165045629, 0.03984880052581006, 0.4889346366070888, -0.27489610867236147, -0.3255503363600424, 0.11889128266405102, -0.1768207172588022, -0.22123323619704355, 0.2458972900777801, -0.18276131738940338, 0.134044069590428, 0.08846584723532115, -0.01257652175633914, -0.0006126012655758215, -0.21935557731194422, 0.25348254258067093, 0.008576590975148561, 0.29772878883470016, -0.038791786471847445, 0.15729121962900866, -0.017190768278669565, 0.04027058577419005, 0.013074225013207813, -0.07724231855099788, 0.12720486001848755, 0.3115933558625329, 0.1535181682980196, 0.33512793891131876, -0.4482490442269905, -0.21810622089727655, 0.09830827659884976, 0.1581854752759682, 0.12315422373305245, -0.04733054978179015, -0.33417389704845846, 0.08736180704806677, -0.1569076282850636, -0.07527592366413129, -0.1654617745958438, -0.042769643583927645, 0.024070223236929617, -0.27695923356170005, -0.005640432582665446, 0.03834633214811964, 0.054105192236602304, -0.08469577361617915, -0.07381951946087859, -0.0036263208823088047, 0.17309910573901355, 0.01344841750353887, -0.0024398871570486913, 0.21821899755053561, -0.1690179816034453, -0.20740655969764868, 0.36966123430227693, 0.017077227996990338, -0.2623730241246945, 0.24010647375305946, -0.030552439990622755, -0.125850758777762, 0.10689846797930923, 0.23316641948820854, 0.11941756377292967, -0.18938755657608536, 0.023065414308538576, -0.015679978378201752, 0.15659140745199032, 0.01135375277266245, -0.04533012169201604, 0.17533292234451933, 0.25209695184682707, 0.11543943824706895, 0.08420032738702668, -0.01962629320650277, -0.16609336376687597, -0.24273367980495095, -0.05535678810609335, -0.1298302075232972, -0.04338346844292987, -0.069457312446122, -0.10203658007409434, 0.3585588580822911, 0.2379178236069327, 0.16701830439692872, 0.1604939214157639, 0.3705532222732224, 0.06800069229793734, 0.042125981591842984, 0.12690857673720032, 0.2679073521941477, 0.0010444476904178208, 0.11850706413388253, -0.24244149786906993, 0.1422380328485319, 0.015149133984761481]
|
1,803.05581
|
RANS Equations with Explicit Data-Driven Reynolds Stress Closure Can Be
Ill-Conditioned
|
Reynolds-averaged Navier--Stokes (RANS) simulations with turbulence closure
models continue to play important roles in industrial flow simulations.
However, the commonly used linear eddy viscosity models are intrinsically
unable to handle flows with non-equilibrium turbulence. Reynolds stress models,
on the other hand, are plagued by their lack of robustness. Recent studies in
plane channel flows found that even substituting Reynolds stresses with errors
below 0.5% from direct numerical simulation (DNS) databases into RANS equations
leads to velocities with large errors (up to 35%). While such an observation
may have only marginal relevance to traditional Reynolds stress models, it is
disturbing for the recently emerging data-driven models that treat the Reynolds
stress as an explicit source term in the RANS equations, as it suggests that
the RANS equations with such models can be ill-conditioned. So far, a rigorous
analysis of the condition of such models is still lacking. As such, in this
work we propose a metric based on local condition number function for a priori
evaluation of the conditioning of the RANS equations. We further show that the
ill-conditioning cannot be explained by the global matrix condition number of
the discretized RANS equations. Comprehensive numerical tests are performed on
turbulent channel flows at various Reynolds numbers and additionally on two
complex flows, i.e., flow over periodic hills and flow in a square duct.
Results suggest that the proposed metric can adequately explain observations in
previous studies, i.e., deteriorated model conditioning with increasing
Reynolds number and better conditioning of the implicit treatment of Reynolds
stress compared to the explicit treatment. This metric can play critical roles
in the future development of data-driven turbulence models by enforcing the
conditioning as a requirement on these models.
|
physics.flu-dyn
|
reynoldsaveraged navierstokes rans simulations with turbulence closure models continue to play important roles in industrial flow simulations however the commonly used linear eddy viscosity models are intrinsically unable to handle flows with nonequilibrium turbulence reynolds stress models on the other hand are plagued by their lack of robustness recent studies in plane channel flows found that even substituting reynolds stresses with errors below 05 from direct numerical simulation dns databases into rans equations leads to velocities with large errors up to 35 while such an observation may have only marginal relevance to traditional reynolds stress models it is disturbing for the recently emerging datadriven models that treat the reynolds stress as an explicit source term in the rans equations as it suggests that the rans equations with such models can be illconditioned so far a rigorous analysis of the condition of such models is still lacking as such in this work we propose a metric based on local condition number function for a priori evaluation of the conditioning of the rans equations we further show that the illconditioning cannot be explained by the global matrix condition number of the discretized rans equations comprehensive numerical tests are performed on turbulent channel flows at various reynolds numbers and additionally on two complex flows ie flow over periodic hills and flow in a square duct results suggest that the proposed metric can adequately explain observations in previous studies ie deteriorated model conditioning with increasing reynolds number and better conditioning of the implicit treatment of reynolds stress compared to the explicit treatment this metric can play critical roles in the future development of datadriven turbulence models by enforcing the conditioning as a requirement on these models
|
[['reynoldsaveraged', 'navierstokes', 'rans', 'simulations', 'with', 'turbulence', 'closure', 'models', 'continue', 'to', 'play', 'important', 'roles', 'in', 'industrial', 'flow', 'simulations', 'however', 'the', 'commonly', 'used', 'linear', 'eddy', 'viscosity', 'models', 'are', 'intrinsically', 'unable', 'to', 'handle', 'flows', 'with', 'nonequilibrium', 'turbulence', 'reynolds', 'stress', 'models', 'on', 'the', 'other', 'hand', 'are', 'plagued', 'by', 'their', 'lack', 'of', 'robustness', 'recent', 'studies', 'in', 'plane', 'channel', 'flows', 'found', 'that', 'even', 'substituting', 'reynolds', 'stresses', 'with', 'errors', 'below', '05', 'from', 'direct', 'numerical', 'simulation', 'dns', 'databases', 'into', 'rans', 'equations', 'leads', 'to', 'velocities', 'with', 'large', 'errors', 'up', 'to', '35', 'while', 'such', 'an', 'observation', 'may', 'have', 'only', 'marginal', 'relevance', 'to', 'traditional', 'reynolds', 'stress', 'models', 'it', 'is', 'disturbing', 'for', 'the', 'recently', 'emerging', 'datadriven', 'models', 'that', 'treat', 'the', 'reynolds', 'stress', 'as', 'an', 'explicit', 'source', 'term', 'in', 'the', 'rans', 'equations', 'as', 'it', 'suggests', 'that', 'the', 'rans', 'equations', 'with', 'such', 'models', 'can', 'be', 'illconditioned', 'so', 'far', 'a', 'rigorous', 'analysis', 'of', 'the', 'condition', 'of', 'such', 'models', 'is', 'still', 'lacking', 'as', 'such', 'in', 'this', 'work', 'we', 'propose', 'a', 'metric', 'based', 'on', 'local', 'condition', 'number', 'function', 'for', 'a', 'priori', 'evaluation', 'of', 'the', 'conditioning', 'of', 'the', 'rans', 'equations', 'we', 'further', 'show', 'that', 'the', 'illconditioning', 'can', 'not', 'be', 'explained', 'by', 'the', 'global', 'matrix', 'condition', 'number', 'of', 'the', 'discretized', 'rans', 'equations', 'comprehensive', 'numerical', 'tests', 'are', 'performed', 'on', 'turbulent', 'channel', 'flows', 'at', 'various', 'reynolds', 'numbers', 'and', 'additionally', 'on', 'two', 'complex', 'flows', 'ie', 'flow', 'over', 'periodic', 'hills', 'and', 'flow', 'in', 'a', 'square', 'duct', 'results', 'suggest', 'that', 'the', 'proposed', 'metric', 'can', 'adequately', 'explain', 'observations', 'in', 'previous', 'studies', 'ie', 'deteriorated', 'model', 'conditioning', 'with', 'increasing', 'reynolds', 'number', 'and', 'better', 'conditioning', 'of', 'the', 'implicit', 'treatment', 'of', 'reynolds', 'stress', 'compared', 'to', 'the', 'explicit', 'treatment', 'this', 'metric', 'can', 'play', 'critical', 'roles', 'in', 'the', 'future', 'development', 'of', 'datadriven', 'turbulence', 'models', 'by', 'enforcing', 'the', 'conditioning', 'as', 'a', 'requirement', 'on', 'these', 'models']]
|
[-0.13888871374740774, 0.11706065183084594, -0.06128333682562932, 0.04408324080726705, -0.06773988281824221, -0.09959312685841017, -0.02969053795095533, 0.3162500629392403, -0.26965980473477985, -0.3301348680969288, 0.12123883171492444, -0.2419451329027806, -0.13369378641366222, 0.23319471081432494, -0.06943505118245608, 0.13540544928555037, 0.10086682233992346, -0.028112815238877657, -0.030949597431234883, -0.2013620528023914, 0.293274118804024, 0.07687827198545683, 0.30429140842674374, 0.044911844156478455, 0.08805837652024026, -0.10495587601902312, -0.04881842793154698, 0.09849542541455727, -0.14490117911918787, 0.04479967358513067, 0.2695872047869391, 0.061857558229474134, 0.30388270437638454, -0.5069203097801063, -0.306961511390106, 0.07262294808634666, 0.16411099819443437, 0.10152131813420345, 0.0007444725663141206, -0.2432076245498623, 0.09873374733479871, -0.19479591995740947, -0.092819753935554, -0.11224053563573151, -0.022502531317250257, 0.04942789399571052, -0.2936108199089302, 0.14350115373716674, 0.057144915630757916, 0.118063560752412, -0.06297142379802023, -0.12693794622405205, -0.05766971541655846, 0.10024945479784779, 0.12981097573165984, 0.0025867632563084417, 0.10733183892526048, -0.18710367729584604, -0.06863642062386334, 0.38333655401156036, -0.012707772848450137, -0.2975007805968355, 0.21459209312999114, -0.08857201684024449, -0.09665493935086623, 0.12613491893354342, 0.2163552104794937, 0.08185749431716627, -0.10707109412071443, 0.012827835231896016, -0.07451197403720038, 0.16511083147718897, 0.019906619323463617, -0.07234853937529405, 0.18818839556823877, 0.17266921596700333, 0.049352788275055084, 0.061093964410967164, -0.07887271465589671, -0.11540569888852378, -0.2950189998299344, -0.11012783097899223, -0.14827542936852262, 0.051896382764801664, -0.11100832200764436, -0.18136554666837618, 0.30700604110841934, 0.21512495568096177, 0.15961066832412782, 0.06689706300846021, 0.32216494390576444, 0.12382152345683096, 0.07788760792924743, 0.10279423821809645, 0.253428512006873, 0.15381821550349886, 0.12442022630189588, -0.20010694717517774, 0.10204800728390935, 0.07860684541445687]
|
1,803.05582
|
On the Underspread/Overspread Classification of Random Processes
|
We study the impact of the recently introduced underspread/overspread
classificationon the spectra of processes with square-integrable covariance
functions. We briefly review the most prominent definitions of a time-varying
power spectrum and point out their limited applicability for {\em general}
nonstationary processes. The time-frequency-parametrized approximation of the
nonstationary Wiener filter provides an excellent example for the main
conclusion: It is the class of underspread processeswhere a time--varying power
spectrum can be used in the same manner as the time--invariant power spectrum
of stationary processes.
|
stat.ME eess.AS eess.SP math.PR
|
we study the impact of the recently introduced underspreadoverspread classificationon the spectra of processes with squareintegrable covariance functions we briefly review the most prominent definitions of a timevarying power spectrum and point out their limited applicability for em general nonstationary processes the timefrequencyparametrized approximation of the nonstationary wiener filter provides an excellent example for the main conclusion it is the class of underspread processeswhere a timevarying power spectrum can be used in the same manner as the timeinvariant power spectrum of stationary processes
|
[['we', 'study', 'the', 'impact', 'of', 'the', 'recently', 'introduced', 'underspreadoverspread', 'classificationon', 'the', 'spectra', 'of', 'processes', 'with', 'squareintegrable', 'covariance', 'functions', 'we', 'briefly', 'review', 'the', 'most', 'prominent', 'definitions', 'of', 'a', 'timevarying', 'power', 'spectrum', 'and', 'point', 'out', 'their', 'limited', 'applicability', 'for', 'em', 'general', 'nonstationary', 'processes', 'the', 'timefrequencyparametrized', 'approximation', 'of', 'the', 'nonstationary', 'wiener', 'filter', 'provides', 'an', 'excellent', 'example', 'for', 'the', 'main', 'conclusion', 'it', 'is', 'the', 'class', 'of', 'underspread', 'processeswhere', 'a', 'timevarying', 'power', 'spectrum', 'can', 'be', 'used', 'in', 'the', 'same', 'manner', 'as', 'the', 'timeinvariant', 'power', 'spectrum', 'of', 'stationary', 'processes']]
|
[-0.10570642724264814, 0.05877847567696531, -0.09114904454142987, 0.08257657758850322, -0.05837299970061153, -0.09279292665091873, 0.003605852775935885, 0.36082768261055403, -0.27546810827518614, -0.225989607009518, 0.11051807148364384, -0.24604745343610457, -0.188087096862212, 0.20987243838372488, -0.04067560304192048, 0.10354943483437211, -0.004950536597708735, 0.011216244377384457, -0.015441187182912909, -0.18029463496294956, 0.324542443583354, 0.16370117175098084, 0.2955393762198053, -0.008874880415210618, 0.08167507264857428, 0.034765905411796104, -0.10837074504801238, 0.0027976763328608077, -0.08835733622972723, 0.07201619149197507, 0.2583997794250144, 0.13483522848898097, 0.2899869836961167, -0.3688248636413224, -0.25500825787835485, 0.14324449881604767, 0.10751704328186527, 0.04645507439051436, -0.05075676201642314, -0.2582026804101807, 0.06955266304172669, -0.19135953122867813, -0.14904598772667255, -0.06330047567858349, 0.02124066302800386, 0.06674938015580838, -0.3015797898951399, 0.07220444018374893, 0.10628919629969552, 0.019226176009949626, -0.0749228222876245, -0.10791953260969088, 0.005552327201430556, 0.13942874155797158, 0.019346817564572905, -0.07524002828234452, 0.11672841774040385, -0.09914709951822893, -0.11882627938131365, 0.3758490806964191, -0.08849301078958036, -0.20199315066013154, 0.17727962545195855, -0.14886027772592592, -0.1495272651361891, 0.11881120095937218, 0.1941987239642222, 0.13051735047439608, -0.1905048230097075, 0.12040298205691308, -0.017883448279462755, 0.11132948560517907, 0.01849562054665028, 0.09293816034472842, 0.17399096658417978, 0.1392308790295656, 0.06598356090297428, 0.17135278266247456, -0.07224534335840918, -0.12393820508459842, -0.3309121841588352, -0.09689167039350996, -0.18068640615313633, 0.048433369980488396, -0.09482660039038474, -0.17769390429499782, 0.46183149157315967, 0.13566648106855528, 0.18525331890611332, 0.04852210176236267, 0.2996787098648993, 0.22530883273457566, -0.016118155294274794, 0.08434015528381436, 0.2055427048921208, 0.17082948011310795, 0.12276638978856462, -0.16514759720008396, 0.0591224042250763, -0.015251387924521784]
|
1,803.05583
|
Weak limits for weighted means of orthogonal polynomials
|
This article is a first attempt to obtain weak limit formulas for weighted
means of orthogonal polynomials. For this, we introduce a new mean Nevai class
that guarantees the existence of an equilibrium measure for the limit of the
means. We show that for a family of measures in this mean Nevai class also the
means of the Christoffel-Darboux kernels and the asymptotic distribution of the
roots converge weakly to the same equilibrium measure. As a main example, we
study the mean Nevai classes in which the equilibrium measure is the
orthogonality measure of the ultraspherical polynomials. The respective weak
limit formula can be regarded as an asymptotic weak addition formula for the
corresponding class of measures.
|
math.SP
|
this article is a first attempt to obtain weak limit formulas for weighted means of orthogonal polynomials for this we introduce a new mean nevai class that guarantees the existence of an equilibrium measure for the limit of the means we show that for a family of measures in this mean nevai class also the means of the christoffeldarboux kernels and the asymptotic distribution of the roots converge weakly to the same equilibrium measure as a main example we study the mean nevai classes in which the equilibrium measure is the orthogonality measure of the ultraspherical polynomials the respective weak limit formula can be regarded as an asymptotic weak addition formula for the corresponding class of measures
|
[['this', 'article', 'is', 'a', 'first', 'attempt', 'to', 'obtain', 'weak', 'limit', 'formulas', 'for', 'weighted', 'means', 'of', 'orthogonal', 'polynomials', 'for', 'this', 'we', 'introduce', 'a', 'new', 'mean', 'nevai', 'class', 'that', 'guarantees', 'the', 'existence', 'of', 'an', 'equilibrium', 'measure', 'for', 'the', 'limit', 'of', 'the', 'means', 'we', 'show', 'that', 'for', 'a', 'family', 'of', 'measures', 'in', 'this', 'mean', 'nevai', 'class', 'also', 'the', 'means', 'of', 'the', 'christoffeldarboux', 'kernels', 'and', 'the', 'asymptotic', 'distribution', 'of', 'the', 'roots', 'converge', 'weakly', 'to', 'the', 'same', 'equilibrium', 'measure', 'as', 'a', 'main', 'example', 'we', 'study', 'the', 'mean', 'nevai', 'classes', 'in', 'which', 'the', 'equilibrium', 'measure', 'is', 'the', 'orthogonality', 'measure', 'of', 'the', 'ultraspherical', 'polynomials', 'the', 'respective', 'weak', 'limit', 'formula', 'can', 'be', 'regarded', 'as', 'an', 'asymptotic', 'weak', 'addition', 'formula', 'for', 'the', 'corresponding', 'class', 'of', 'measures']]
|
[-0.11655831250384983, 0.05875518787617429, -0.134192366592793, 0.1230444044031951, -0.028950233820380054, -0.06131062051679334, 0.05893660502301322, 0.3119748425789369, -0.2998082923074054, -0.21485665743836227, 0.1107943810434996, -0.2525368679123811, -0.14754819145135614, 0.17757135019916245, -0.05633716343274702, 0.06139020684262753, 0.031799063269590214, 0.07840403157254505, -0.10524440178663558, -0.19239779227238116, 0.35396288007370424, 0.02685218532848307, 0.2726656189536612, 0.04210167625445363, 0.11956002520254025, -0.012749790110521846, 0.011367305538131513, 0.035287058908237606, -0.18407496283466143, 0.13935075955003753, 0.2077245803939927, 0.11143491355877401, 0.293278554151965, -0.30523597694232935, -0.12798326041422084, 0.21977999889586344, 0.13726137690723705, 0.07014224839169914, 0.0008389016615354225, -0.2685663204393389, 0.10847182905611892, -0.16393673738353273, -0.22903218781615362, -0.09421426619793105, 0.009754043645583667, 0.109171255147403, -0.3209044184121821, 0.05407077949827449, 0.12797450269453037, 0.0723978998298701, -0.062205631345606006, -0.11259818990897928, 0.049954736951547556, 0.13572343336975473, 0.04274223332938094, -0.013824608218736755, 0.032210101508814044, -0.09617082346190946, -0.09401176461122102, 0.33994593263681355, -0.1417482898124836, -0.2474024399764772, 0.13671748873451325, -0.16813823288609075, -0.15715558459369355, 0.07469948334818403, 0.13987064441172486, 0.17710852292246926, -0.16805332571936724, 0.08118376084036218, -0.1250347738735314, 0.08519485270660211, 0.07463948531315112, 0.07287666849935284, 0.15035931907721564, 0.06631704690094051, 0.13006018806630984, 0.21466451376561138, -0.053807196657085776, -0.10462135735612649, -0.3570376946630641, -0.233281211513612, -0.19814337098286447, 0.08844691777649598, -0.13174519079633387, -0.22354100219523296, 0.3822146080370642, 0.12489891226968577, 0.18009934099152303, 0.17178379803294969, 0.2185038968594347, 0.22558656683326977, -0.005481797799818281, 0.052430856463646876, 0.20801099482923746, 0.18720005137416032, 0.03362269073119785, -0.17501136775200182, 0.07643523886322211, 0.1597083851129899]
|
1,803.05584
|
A Switched Systems Approach to Path Following with Intermittent State
Feedback
|
Autonomous agents are often tasked with operating in an area where feedback
is unavailable. Inspired by such applications, this paper develops a novel
switched systems-based control method for uncertain nonlinear systems with
temporary loss of state feedback. To compensate for intermittent feedback, an
observer is used while state feedback is available to reduce the estimation
error, and a predictor is utilized to propagate the estimates while state
feedback is unavailable. Based on the resulting subsystems, maximum and minimum
dwell time conditions are developed via a Lyapunov-based switched systems
analysis to relax the constraint of maintaining constant feedback. Using the
dwell time conditions, a switching trajectory is developed to enter and exit
the feedback denied region in a manner that ensures the overall switched system
remains stable. A scheme for designing a switching trajectory with a smooth
transition function is provided. Simulation and experimental results are
presented to demonstrate the performance of control design.
|
cs.SY
|
autonomous agents are often tasked with operating in an area where feedback is unavailable inspired by such applications this paper develops a novel switched systemsbased control method for uncertain nonlinear systems with temporary loss of state feedback to compensate for intermittent feedback an observer is used while state feedback is available to reduce the estimation error and a predictor is utilized to propagate the estimates while state feedback is unavailable based on the resulting subsystems maximum and minimum dwell time conditions are developed via a lyapunovbased switched systems analysis to relax the constraint of maintaining constant feedback using the dwell time conditions a switching trajectory is developed to enter and exit the feedback denied region in a manner that ensures the overall switched system remains stable a scheme for designing a switching trajectory with a smooth transition function is provided simulation and experimental results are presented to demonstrate the performance of control design
|
[['autonomous', 'agents', 'are', 'often', 'tasked', 'with', 'operating', 'in', 'an', 'area', 'where', 'feedback', 'is', 'unavailable', 'inspired', 'by', 'such', 'applications', 'this', 'paper', 'develops', 'a', 'novel', 'switched', 'systemsbased', 'control', 'method', 'for', 'uncertain', 'nonlinear', 'systems', 'with', 'temporary', 'loss', 'of', 'state', 'feedback', 'to', 'compensate', 'for', 'intermittent', 'feedback', 'an', 'observer', 'is', 'used', 'while', 'state', 'feedback', 'is', 'available', 'to', 'reduce', 'the', 'estimation', 'error', 'and', 'a', 'predictor', 'is', 'utilized', 'to', 'propagate', 'the', 'estimates', 'while', 'state', 'feedback', 'is', 'unavailable', 'based', 'on', 'the', 'resulting', 'subsystems', 'maximum', 'and', 'minimum', 'dwell', 'time', 'conditions', 'are', 'developed', 'via', 'a', 'lyapunovbased', 'switched', 'systems', 'analysis', 'to', 'relax', 'the', 'constraint', 'of', 'maintaining', 'constant', 'feedback', 'using', 'the', 'dwell', 'time', 'conditions', 'a', 'switching', 'trajectory', 'is', 'developed', 'to', 'enter', 'and', 'exit', 'the', 'feedback', 'denied', 'region', 'in', 'a', 'manner', 'that', 'ensures', 'the', 'overall', 'switched', 'system', 'remains', 'stable', 'a', 'scheme', 'for', 'designing', 'a', 'switching', 'trajectory', 'with', 'a', 'smooth', 'transition', 'function', 'is', 'provided', 'simulation', 'and', 'experimental', 'results', 'are', 'presented', 'to', 'demonstrate', 'the', 'performance', 'of', 'control', 'design']]
|
[-0.187690521818677, 0.09215229821982611, -0.07632572717623773, 0.012136224869583897, -0.09847799454833947, -0.21591370494342318, 0.07541333344153256, 0.39811330833898406, -0.2757738370606615, -0.29757243859904264, 0.1748933280906427, -0.21424102467283898, -0.1254467591521592, 0.22025267565562054, -0.10569731631408312, 0.08891885780601524, 0.06173100995867714, 0.033794563393005066, -0.036692173723922736, -0.2224821507553357, 0.28101131561047893, 0.0909996384319551, 0.2933256043900364, -0.017413777207919194, 0.17184221063089233, 0.008054439019521369, 0.018529805919920928, 0.02491418318138184, -0.08199345751528003, 0.08860033630742312, 0.25728426214453637, 0.13652076236477573, 0.3488801846256346, -0.43101394918497676, -0.23492087400061826, 0.07822327103824933, 0.1258609790067353, 0.11983056586643595, -0.11570561530290695, -0.277149636858429, 0.08424535195276238, -0.15534667398634494, -0.0898374616704102, -0.043699929627644664, -0.016681200033358108, 0.014930449560791268, -0.36873219406926167, 0.02506647242866213, 0.020838370076471976, 0.01795476322591889, -0.1019405256454632, -0.029380109446470206, -0.007808151342936494, 0.1872763800863907, -0.024688179454054025, 0.029338738579741296, 0.18640247157780954, -0.1160265636962102, -0.10880666063623685, 0.3349498691755572, -0.0074237692002450525, -0.22278655983897205, 0.16443963036446352, -0.05699180273241759, -0.056005411449625016, 0.1593194303340187, 0.22216282003358298, 0.10987613992929136, -0.18058516086365273, 0.007892599464028928, 0.05816509380169651, 0.21745476852326343, -0.014892669721792628, 0.01665408354179532, 0.14664311486819845, 0.23322948789546644, 0.15215655579840387, 0.14627565140531587, -0.03331594145400267, -0.15321623652053426, -0.2924649283241213, -0.07905090616078549, -0.1540325873111393, 0.0003780143257851402, -0.013700809294747469, -0.11826390675664727, 0.3422914079255742, 0.13705933157786776, 0.1889059735748162, 0.08819662035424627, 0.36263759690184705, 0.17274734246684542, 0.028434073140089906, 0.12270398648285301, 0.26537377174237586, 0.09035582154124878, 0.12301503804822762, -0.25756201252578664, 0.13414072891654677, 0.01347017094791179]
|
1,803.05585
|
Doping-induced magnetism in the semiconducting B20 compound RuGe
|
RuGe, a diamagnetic small-band gap semiconductor, and CoGe, a nonmagnetic
semimetal, are both isostructural to the Kondo insulator FeSi and the skyrmion
lattice host MnSi. Here, we have explored the magnetic and transport properties
of Co-doped RuGe: Ru$_{1-x}$Co$_x$Ge. For small values of $x$, a magnetic
ground state emerges with $T_{c}\approx$ 5 $-$ 9 K, which is accompanied by a
moderate decrease in electrical resistivity and a Seebeck coefficient that
indicates electron-like charge carriers. The magnetization, magnetoresistance,
and the specific heat capacity all resemble that of Fe$_{1-x}$Co$_x$Si for
similar Co substitution levels, suggesting that Ru$_{1-x}$Co$_x$Ge hosts
equally as interesting magnetic and charge carrier transport properties.
|
cond-mat.mtrl-sci
|
ruge a diamagnetic smallband gap semiconductor and coge a nonmagnetic semimetal are both isostructural to the kondo insulator fesi and the skyrmion lattice host mnsi here we have explored the magnetic and transport properties of codoped ruge ru_1xco_xge for small values of x a magnetic ground state emerges with t_capprox 5 9 k which is accompanied by a moderate decrease in electrical resistivity and a seebeck coefficient that indicates electronlike charge carriers the magnetization magnetoresistance and the specific heat capacity all resemble that of fe_1xco_xsi for similar co substitution levels suggesting that ru_1xco_xge hosts equally as interesting magnetic and charge carrier transport properties
|
[['ruge', 'a', 'diamagnetic', 'smallband', 'gap', 'semiconductor', 'and', 'coge', 'a', 'nonmagnetic', 'semimetal', 'are', 'both', 'isostructural', 'to', 'the', 'kondo', 'insulator', 'fesi', 'and', 'the', 'skyrmion', 'lattice', 'host', 'mnsi', 'here', 'we', 'have', 'explored', 'the', 'magnetic', 'and', 'transport', 'properties', 'of', 'codoped', 'ruge', 'ru_1xco_xge', 'for', 'small', 'values', 'of', 'x', 'a', 'magnetic', 'ground', 'state', 'emerges', 'with', 't_capprox', '5', '9', 'k', 'which', 'is', 'accompanied', 'by', 'a', 'moderate', 'decrease', 'in', 'electrical', 'resistivity', 'and', 'a', 'seebeck', 'coefficient', 'that', 'indicates', 'electronlike', 'charge', 'carriers', 'the', 'magnetization', 'magnetoresistance', 'and', 'the', 'specific', 'heat', 'capacity', 'all', 'resemble', 'that', 'of', 'fe_1xco_xsi', 'for', 'similar', 'co', 'substitution', 'levels', 'suggesting', 'that', 'ru_1xco_xge', 'hosts', 'equally', 'as', 'interesting', 'magnetic', 'and', 'charge', 'carrier', 'transport', 'properties']]
|
[-0.204416416734457, 0.2534289071999956, 0.025962900118902326, 0.004216474440181628, -0.05767647388856858, -0.19883996658027173, 0.15363316503353416, 0.3813595171761699, -0.2356607231264934, -0.3015033017471433, -0.02654274577391334, -0.384025226905942, -0.10972216888447292, 0.18160750071518122, 0.063719760235399, -0.022172536231664708, -0.06867966779507696, -0.04351540327072143, -0.13041336057009176, -0.21883822690695523, 0.24016326401848345, -0.012263138252310455, 0.3145914899511263, 0.09561318497573666, 0.02274638570728712, -0.0596996164531447, 0.21270004309946672, 0.09275345964590087, -0.1409329940482712, -0.004087198050692678, 0.26643202353268863, -0.20439405543031172, 0.12358368329238147, -0.38964897524565456, -0.22110284971073269, -0.03862178180832416, 0.10531324208379374, 0.09983790556085297, -0.12987740562297403, -0.24539527107030154, 0.09729895267635584, -0.15005716777872294, -0.06736199739854783, -0.12348710448481143, 0.007631889209151268, -0.009024438466876745, -0.26354230135213585, 0.16043627806007862, 0.09379557854263113, 0.13717404186725615, -0.16945667067542672, -0.21798003724776208, -0.1346648589707911, 0.031747448174282905, 0.0741340307565406, 0.07251469286624342, 0.19913989254273473, -0.10238903664983809, -0.09303457059431822, 0.31737482056021693, -0.037689037831733004, -0.019651831341907382, 0.1452039389871061, -0.24492375347297637, -0.058951212759129706, 0.20518045887816697, 0.046660121297463775, 0.0833858204074204, -0.13656224730424582, 0.05838630410493351, -0.056056397194042804, 0.19465803857892752, 0.004553519929759204, 0.13676699775736778, 0.2900924181379378, 0.193846141891554, 0.02631619314895943, 0.13223741196561606, -0.15551952316774986, 0.014038305210415275, -0.15779643844813107, -0.23670332584530115, -0.2346335860679392, 0.15357310488820075, -0.0872203522073687, -0.20604774518753402, 0.37223909656517207, 0.1515787769133749, 0.20292508602142334, -0.10002202201983891, 0.18930556014180183, 0.09158599752932788, 0.08817625330215378, 0.09146466826437973, 0.19910383241716773, 0.2107946527074091, 0.21304381238296627, -0.33722747914958745, 0.11804003382101655, -0.009627830676035955]
|
1,803.05586
|
Quantum features and signatures of quantum-thermal machines
|
The aim of this book chapter is to indicate how quantum phenomena are
affecting the operation of microscopic thermal machines, such as engines and
refrigerators. As converting heat to work is one of the fundamental concerns in
thermodynamics, the platform of quantum-thermal machines sheds light on
thermodynamics in the quantum regime. This chapter focuses on the basic
features of quantum mechanics, such as energy quantization, the uncertainty
principle, quantum coherence and correlations, and their manifestation in
microscopic thermal devices. In addition to indicating the peculiar behaviors
of thermal-machines due to their non-classical features, we present
quantum-thermodynamic signatures of these machines. Any violation of the
classical bounds on thermodynamic measurements of these machines is a
sufficient condition to conclude that quantum effects are present in the
operation of that thermal machine. Experimental setups demonstrating some of
the results are also presented.
|
quant-ph
|
the aim of this book chapter is to indicate how quantum phenomena are affecting the operation of microscopic thermal machines such as engines and refrigerators as converting heat to work is one of the fundamental concerns in thermodynamics the platform of quantumthermal machines sheds light on thermodynamics in the quantum regime this chapter focuses on the basic features of quantum mechanics such as energy quantization the uncertainty principle quantum coherence and correlations and their manifestation in microscopic thermal devices in addition to indicating the peculiar behaviors of thermalmachines due to their nonclassical features we present quantumthermodynamic signatures of these machines any violation of the classical bounds on thermodynamic measurements of these machines is a sufficient condition to conclude that quantum effects are present in the operation of that thermal machine experimental setups demonstrating some of the results are also presented
|
[['the', 'aim', 'of', 'this', 'book', 'chapter', 'is', 'to', 'indicate', 'how', 'quantum', 'phenomena', 'are', 'affecting', 'the', 'operation', 'of', 'microscopic', 'thermal', 'machines', 'such', 'as', 'engines', 'and', 'refrigerators', 'as', 'converting', 'heat', 'to', 'work', 'is', 'one', 'of', 'the', 'fundamental', 'concerns', 'in', 'thermodynamics', 'the', 'platform', 'of', 'quantumthermal', 'machines', 'sheds', 'light', 'on', 'thermodynamics', 'in', 'the', 'quantum', 'regime', 'this', 'chapter', 'focuses', 'on', 'the', 'basic', 'features', 'of', 'quantum', 'mechanics', 'such', 'as', 'energy', 'quantization', 'the', 'uncertainty', 'principle', 'quantum', 'coherence', 'and', 'correlations', 'and', 'their', 'manifestation', 'in', 'microscopic', 'thermal', 'devices', 'in', 'addition', 'to', 'indicating', 'the', 'peculiar', 'behaviors', 'of', 'thermalmachines', 'due', 'to', 'their', 'nonclassical', 'features', 'we', 'present', 'quantumthermodynamic', 'signatures', 'of', 'these', 'machines', 'any', 'violation', 'of', 'the', 'classical', 'bounds', 'on', 'thermodynamic', 'measurements', 'of', 'these', 'machines', 'is', 'a', 'sufficient', 'condition', 'to', 'conclude', 'that', 'quantum', 'effects', 'are', 'present', 'in', 'the', 'operation', 'of', 'that', 'thermal', 'machine', 'experimental', 'setups', 'demonstrating', 'some', 'of', 'the', 'results', 'are', 'also', 'presented']]
|
[-0.1277093665185217, 0.1816770444329319, -0.11064713715622537, 0.057609747771153616, -0.062165655289515315, -0.1375761618335202, 0.07469088581337077, 0.3131261995638446, -0.2821208921448736, -0.3046378908618588, 0.08822751736013795, -0.30097787367622203, -0.13822087201393685, 0.25556450580722456, -0.07127863787811436, 0.09134478578276986, 0.04178010885396021, 0.0411291868767614, -0.03454477586015044, -0.22003690055202987, 0.3241571027638136, 0.07404413988743407, 0.3095896978855883, 0.13267608305854764, 0.07277005508916014, -0.04115287504132113, -0.00043521126859533273, 0.0035641558598994995, -0.11943162725486696, 0.11979567076635661, 0.2534682168122783, 0.11225215620662776, 0.24078307296785947, -0.45342440435515463, -0.22501054220571579, 0.0793369438033551, 0.08315276399107395, 0.13572974292048012, -0.012596432706709655, -0.2445741705931455, 0.0381422067118018, -0.10649193468563956, -0.11739290470628842, -0.12298826481887347, -0.016978580194773326, 0.018789630299501068, -0.15122750590441467, 0.09136314115385699, 0.13328500433402846, 0.07360497642335274, -0.039276374924091265, -0.07697721093678646, 0.05839968655633626, 0.11348800290804759, 0.009529188940328339, -0.0707150979282455, 0.18329488267961272, -0.16810566144358877, -0.19710399755846253, 0.43005324282395324, -0.011355490162432622, -0.14437821858877437, 0.200912048118926, -0.11004787912967501, -0.1544546481295616, 0.015428537980271436, 0.17049223477717676, 0.07558654330791437, -0.16651054352133288, 0.040845153959243555, 0.017917520051701462, 0.12328257385420231, -0.006008076143162928, 0.164784439893024, 0.23724651027122418, 0.183185627925203, -0.025474791441836373, 0.1734058352391631, -0.058014185672036284, -0.15183712692140675, -0.3504762483606611, -0.21719165518209874, -0.19872352709363905, 0.09741764630211129, -0.03999004370280417, -0.13281677921533772, 0.3611725471937265, 0.199766507852578, 0.15608074375354558, 0.01116385098158134, 0.3094481722512048, 0.09687579066112383, 0.040937013361308214, 0.06255595921706274, 0.27393373805571436, 0.1677056481163922, 0.14718368764390513, -0.26036924947884016, 0.0656046743585105, 0.016102978942929197]
|
1,803.05587
|
Micky: A Cheaper Alternative for Selecting Cloud Instances
|
Most cloud computing optimizers explore and improve one workload at a time.
When optimizing many workloads, the single-optimizer approach can be
prohibitively expensive. Accordingly, we examine "collective optimizer" that
concurrently explore and improve a set of workloads significantly reducing the
measurement costs. Our large-scale empirical study shows that there is often a
single cloud configuration which is surprisingly near-optimal for most
workloads. Consequently, we create a collective-optimizer, MICKY, that
reformulates the task of finding the near-optimal cloud configuration as a
multi-armed bandit problem. MICKY efficiently balances exploration (of new
cloud configurations) and exploitation (of known good cloud configuration). Our
experiments show that MICKY can achieve on average 8.6 times reduction in
measurement cost as compared to the state-of-the-art method while finding
near-optimal solutions.
Hence we propose MICKY as the basis of a practical collective optimization
method for finding good cloud configurations (based on various constraints such
as budget and tolerance to near-optimal configurations).
|
cs.DC
|
most cloud computing optimizers explore and improve one workload at a time when optimizing many workloads the singleoptimizer approach can be prohibitively expensive accordingly we examine collective optimizer that concurrently explore and improve a set of workloads significantly reducing the measurement costs our largescale empirical study shows that there is often a single cloud configuration which is surprisingly nearoptimal for most workloads consequently we create a collectiveoptimizer micky that reformulates the task of finding the nearoptimal cloud configuration as a multiarmed bandit problem micky efficiently balances exploration of new cloud configurations and exploitation of known good cloud configuration our experiments show that micky can achieve on average 86 times reduction in measurement cost as compared to the stateoftheart method while finding nearoptimal solutions hence we propose micky as the basis of a practical collective optimization method for finding good cloud configurations based on various constraints such as budget and tolerance to nearoptimal configurations
|
[['most', 'cloud', 'computing', 'optimizers', 'explore', 'and', 'improve', 'one', 'workload', 'at', 'a', 'time', 'when', 'optimizing', 'many', 'workloads', 'the', 'singleoptimizer', 'approach', 'can', 'be', 'prohibitively', 'expensive', 'accordingly', 'we', 'examine', 'collective', 'optimizer', 'that', 'concurrently', 'explore', 'and', 'improve', 'a', 'set', 'of', 'workloads', 'significantly', 'reducing', 'the', 'measurement', 'costs', 'our', 'largescale', 'empirical', 'study', 'shows', 'that', 'there', 'is', 'often', 'a', 'single', 'cloud', 'configuration', 'which', 'is', 'surprisingly', 'nearoptimal', 'for', 'most', 'workloads', 'consequently', 'we', 'create', 'a', 'collectiveoptimizer', 'micky', 'that', 'reformulates', 'the', 'task', 'of', 'finding', 'the', 'nearoptimal', 'cloud', 'configuration', 'as', 'a', 'multiarmed', 'bandit', 'problem', 'micky', 'efficiently', 'balances', 'exploration', 'of', 'new', 'cloud', 'configurations', 'and', 'exploitation', 'of', 'known', 'good', 'cloud', 'configuration', 'our', 'experiments', 'show', 'that', 'micky', 'can', 'achieve', 'on', 'average', '86', 'times', 'reduction', 'in', 'measurement', 'cost', 'as', 'compared', 'to', 'the', 'stateoftheart', 'method', 'while', 'finding', 'nearoptimal', 'solutions', 'hence', 'we', 'propose', 'micky', 'as', 'the', 'basis', 'of', 'a', 'practical', 'collective', 'optimization', 'method', 'for', 'finding', 'good', 'cloud', 'configurations', 'based', 'on', 'various', 'constraints', 'such', 'as', 'budget', 'and', 'tolerance', 'to', 'nearoptimal', 'configurations']]
|
[-0.13955438991280777, -0.01395664081079207, -0.07050373424646376, 0.06161099005743417, -0.05991735813109241, -0.14223262432666606, 0.14482130578546384, 0.404980261890304, -0.255053531000736, -0.4006398038210853, 0.09764229143824774, -0.21025879560647506, -0.142400832985534, 0.2273294495723969, -0.07869753790772613, 0.1009700999592141, 0.1426558072018801, -0.038796994736455134, -0.04966988452341691, -0.2659631581685586, 0.24932333080572947, 0.10174508545769761, 0.33148273629512615, 0.017322904677037766, 0.09248487436779643, -0.03939927322944219, 0.019234084570472012, 0.03982396371391238, -0.06079678611605527, 0.11415925714424781, 0.2851357961024176, 0.23231694695619953, 0.31499689997525404, -0.4268100044585222, -0.18084432564626465, 0.12489852210158321, 0.17291405694775086, 0.08648190825533073, -0.0576685595276784, -0.22330559274206394, 0.10559331154179395, -0.1773129373554461, -0.06302536703917562, -0.15180571138741608, 0.00027787568516387845, 0.018132125842770474, -0.3192286407760042, -0.0032197925962187002, -0.026413839840058805, -0.012307792544266246, -0.054768687148041874, -0.1435760893513578, 0.04462502603588737, 0.11670325529265883, 0.026344529639880192, 0.08028179175985224, 0.17449079351561353, -0.16499252139979245, -0.16065222591729156, 0.4248141526238413, -0.014625084302727355, -0.1710955503254833, 0.19619050295869295, -0.03417378105839949, -0.16236419529216178, 0.10479959089691375, 0.23286960434726753, 0.15495223989586857, -0.14305747220485812, 0.034363544495184195, -0.06147227884695822, 0.1822295075788206, 0.04989060180243228, 0.04790050100800365, 0.14995117070591263, 0.22606768245216682, 0.17122513580942428, 0.18476335928753784, -0.044947177523266005, -0.14856279355825375, -0.20195186806114895, -0.13270891548615468, -0.18475837821899513, 0.005670425824401592, -0.14192875548665232, -0.14107323525510482, 0.33648030085347297, 0.20495960855893544, 0.2040996271226438, 0.09429674337244907, 0.3579756979343315, 0.06389151720589548, 0.0622405277947519, 0.14271645898589963, 0.18459241182253455, -0.041878729145850564, 0.08755566762368633, -0.24926120332682764, 0.09661898049618432, -0.012063766484278322]
|
1,803.05588
|
Deep Adaptive Attention for Joint Facial Action Unit Detection and Face
Alignment
|
Facial action unit (AU) detection and face alignment are two highly
correlated tasks since facial landmarks can provide precise AU locations to
facilitate the extraction of meaningful local features for AU detection. Most
existing AU detection works often treat face alignment as a preprocessing and
handle the two tasks independently. In this paper, we propose a novel
end-to-end deep learning framework for joint AU detection and face alignment,
which has not been explored before. In particular, multi-scale shared features
are learned firstly, and high-level features of face alignment are fed into AU
detection. Moreover, to extract precise local features, we propose an adaptive
attention learning module to refine the attention map of each AU adaptively.
Finally, the assembled local features are integrated with face alignment
features and global features for AU detection. Experiments on BP4D and DISFA
benchmarks demonstrate that our framework significantly outperforms the
state-of-the-art methods for AU detection.
|
cs.CV
|
facial action unit au detection and face alignment are two highly correlated tasks since facial landmarks can provide precise au locations to facilitate the extraction of meaningful local features for au detection most existing au detection works often treat face alignment as a preprocessing and handle the two tasks independently in this paper we propose a novel endtoend deep learning framework for joint au detection and face alignment which has not been explored before in particular multiscale shared features are learned firstly and highlevel features of face alignment are fed into au detection moreover to extract precise local features we propose an adaptive attention learning module to refine the attention map of each au adaptively finally the assembled local features are integrated with face alignment features and global features for au detection experiments on bp4d and disfa benchmarks demonstrate that our framework significantly outperforms the stateoftheart methods for au detection
|
[['facial', 'action', 'unit', 'au', 'detection', 'and', 'face', 'alignment', 'are', 'two', 'highly', 'correlated', 'tasks', 'since', 'facial', 'landmarks', 'can', 'provide', 'precise', 'au', 'locations', 'to', 'facilitate', 'the', 'extraction', 'of', 'meaningful', 'local', 'features', 'for', 'au', 'detection', 'most', 'existing', 'au', 'detection', 'works', 'often', 'treat', 'face', 'alignment', 'as', 'a', 'preprocessing', 'and', 'handle', 'the', 'two', 'tasks', 'independently', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'endtoend', 'deep', 'learning', 'framework', 'for', 'joint', 'au', 'detection', 'and', 'face', 'alignment', 'which', 'has', 'not', 'been', 'explored', 'before', 'in', 'particular', 'multiscale', 'shared', 'features', 'are', 'learned', 'firstly', 'and', 'highlevel', 'features', 'of', 'face', 'alignment', 'are', 'fed', 'into', 'au', 'detection', 'moreover', 'to', 'extract', 'precise', 'local', 'features', 'we', 'propose', 'an', 'adaptive', 'attention', 'learning', 'module', 'to', 'refine', 'the', 'attention', 'map', 'of', 'each', 'au', 'adaptively', 'finally', 'the', 'assembled', 'local', 'features', 'are', 'integrated', 'with', 'face', 'alignment', 'features', 'and', 'global', 'features', 'for', 'au', 'detection', 'experiments', 'on', 'bp4d', 'and', 'disfa', 'benchmarks', 'demonstrate', 'that', 'our', 'framework', 'significantly', 'outperforms', 'the', 'stateoftheart', 'methods', 'for', 'au', 'detection']]
|
[-0.03647410667811831, -0.06523341811795641, -0.05891596293076873, 0.004829326181206853, -0.09664742775882283, -0.21497935020675263, -0.0720891642011702, 0.484496502391994, -0.2755064875454021, -0.3306733933277428, 0.07474893770956745, -0.28398608720861374, -0.17766324756356577, 0.13162624100844064, -0.12488689597540846, 0.07360042353859171, 0.1665853006951511, 0.022878062874272777, -0.10493431363477915, -0.23219483277450007, 0.25811646790088466, 0.0764589969641141, 0.3055223101998369, 0.04900548858878513, 0.11974705666226025, -0.01748131160546715, -0.04909771818900481, -0.042759127961471674, -0.08778035716022714, 0.21078894956658284, 0.3478352072179162, 0.18554117020219565, 0.27397171875461934, -0.4218834220866362, -0.22309949865564704, 0.008328295908868313, 0.16848650984466076, 0.09288856500992551, -0.04928957728513827, -0.3901615664983789, 0.13595574377880743, -0.14070997454846898, 0.03770262987042467, -0.13012820958470306, 0.018933344454562757, -0.05231012022898843, -0.29760820865941545, 0.055488483964776, 0.10534999509962896, 0.10863622315227986, -0.06052158069486419, -0.11457123637665063, 0.011696815237713357, 0.17637394512693086, -0.01404296337471654, 0.045298299206576, 0.22993851438785592, -0.15256889823358505, -0.14154581478641678, 0.34706920935520125, -0.03609742376836948, -0.19408270104943465, 0.2631647730525583, -0.022535972051943343, -0.18243351463849347, 0.11869427454696657, 0.24693919429555536, 0.18999020664719865, -0.15765979529513666, -0.03735811636705572, -0.02438598729049166, 0.21274602931613723, 0.08599110459753623, 0.02785960650993123, 0.28320850783027707, 0.21794615193425368, 0.03654784142971039, 0.09948402309479813, -0.27745022157090715, -0.041498435095806294, -0.1608420585297669, -0.08137467794741193, -0.1780040211478869, -0.10099185497490301, -0.09518838727788534, -0.09716489837194482, 0.417348299001654, 0.25881458759618303, 0.2784274482804661, 0.08308299431810155, 0.35670277615077794, -0.0021891118912026287, 0.1519461748438577, 0.0568182175171872, 0.2366432896008094, -0.03873620745105048, 0.0630098574453344, -0.1431207853121062, 0.10897997845429927, 0.0724867287868013]
|
1,803.05589
|
Variational Message Passing with Structured Inference Networks
|
Recent efforts on combining deep models with probabilistic graphical models
are promising in providing flexible models that are also easy to interpret. We
propose a variational message-passing algorithm for variational inference in
such models. We make three contributions. First, we propose structured
inference networks that incorporate the structure of the graphical model in the
inference network of variational auto-encoders (VAE). Second, we establish
conditions under which such inference networks enable fast amortized inference
similar to VAE. Finally, we derive a variational message passing algorithm to
perform efficient natural-gradient inference while retaining the efficiency of
the amortized inference. By simultaneously enabling structured, amortized, and
natural-gradient inference for deep structured models, our method simplifies
and generalizes existing methods.
|
stat.ML
|
recent efforts on combining deep models with probabilistic graphical models are promising in providing flexible models that are also easy to interpret we propose a variational messagepassing algorithm for variational inference in such models we make three contributions first we propose structured inference networks that incorporate the structure of the graphical model in the inference network of variational autoencoders vae second we establish conditions under which such inference networks enable fast amortized inference similar to vae finally we derive a variational message passing algorithm to perform efficient naturalgradient inference while retaining the efficiency of the amortized inference by simultaneously enabling structured amortized and naturalgradient inference for deep structured models our method simplifies and generalizes existing methods
|
[['recent', 'efforts', 'on', 'combining', 'deep', 'models', 'with', 'probabilistic', 'graphical', 'models', 'are', 'promising', 'in', 'providing', 'flexible', 'models', 'that', 'are', 'also', 'easy', 'to', 'interpret', 'we', 'propose', 'a', 'variational', 'messagepassing', 'algorithm', 'for', 'variational', 'inference', 'in', 'such', 'models', 'we', 'make', 'three', 'contributions', 'first', 'we', 'propose', 'structured', 'inference', 'networks', 'that', 'incorporate', 'the', 'structure', 'of', 'the', 'graphical', 'model', 'in', 'the', 'inference', 'network', 'of', 'variational', 'autoencoders', 'vae', 'second', 'we', 'establish', 'conditions', 'under', 'which', 'such', 'inference', 'networks', 'enable', 'fast', 'amortized', 'inference', 'similar', 'to', 'vae', 'finally', 'we', 'derive', 'a', 'variational', 'message', 'passing', 'algorithm', 'to', 'perform', 'efficient', 'naturalgradient', 'inference', 'while', 'retaining', 'the', 'efficiency', 'of', 'the', 'amortized', 'inference', 'by', 'simultaneously', 'enabling', 'structured', 'amortized', 'and', 'naturalgradient', 'inference', 'for', 'deep', 'structured', 'models', 'our', 'method', 'simplifies', 'and', 'generalizes', 'existing', 'methods']]
|
[-0.03410298734951507, -0.05359289570960441, -0.07512951703292542, 0.11883062397376715, -0.16502411422472255, -0.22388556105855467, 0.08909734467783108, 0.49879878147200135, -0.29953655592719863, -0.3580983232963702, 0.04640298422349713, -0.16541794218636793, -0.21547678764909506, 0.14925051196317735, -0.08641383262021982, 0.13854815778804236, 0.12858881269067782, -0.018666485665719313, -0.10681414325191671, -0.257031618354537, 0.22012242369739146, 0.07288227110432766, 0.3187907941093476, -0.04112237928975133, 0.149216790864212, 0.01663253408583716, -0.009904499093456, -0.038491938914501526, -0.11531975641829094, 0.2521198821848194, 0.27181454685746603, 0.2593662919283941, 0.3395147583997359, -0.4940623794521751, -0.3039304833530031, 0.05567669353431797, 0.1714712533079176, 0.172480090490165, 0.010595889600467515, -0.31274904113198665, 0.04340899890641971, -0.1892946669269867, 0.03064092689852134, -0.24056417100805919, -0.11987560335948164, -0.013775378217266326, -0.3345656222347692, 0.07909148253660031, 0.0995699790314418, 0.0007398248015870822, -0.011278226289191636, -0.13087830133535416, 0.055727877347039635, 0.07641954689511452, 0.015547552891677759, 0.02016900130949015, 0.04501729285151794, -0.13253404675172, -0.17186858229628155, 0.2818438971399105, -0.062024052456073495, -0.22173667045567055, 0.1882604700673757, 0.0563675881532053, -0.27702480552172093, 0.08429772809051492, 0.2588629140358033, 0.19054504231462488, -0.16180458800628347, 0.07299203344054744, -0.006723303572628005, 0.11778800364519501, -0.034854205289116966, -0.02171915793662955, 0.13239203198363297, 0.2692285337924941, 0.07166563724328218, 0.16225829935464045, -0.1387157019825877, -0.14305340988433052, -0.22739841731200958, -0.1518552604187601, -0.13681579236711922, -0.04223445143775437, -0.15196264683292046, -0.1845927058622755, 0.3650946862602221, 0.27038513182397483, 0.20087157759076818, 0.21337807220346616, 0.3593482545673333, 0.05422079618237431, 0.0759518604609184, 0.18482896665051973, 0.1739442697530492, 0.13266831877488836, 0.0859691955626878, -0.09559658029470953, 0.14902615424442298, 0.04539768887354575]
|
1,803.0559
|
Diffuson contribution to anomalous Hall effect in disordered Co2FeSi
thin films
|
A wide variation in the disorder strength, as inferred from an order of
magnitude variation in the longitudinal resistivity of Co2FeSi (CFS) Huesler
alloy thin films of fixed (50 nm) thickness, has been achieved by growing these
films on Si(111) substrates at substrate temperatures ranging from room
temperature (RT) to 600 C. An in-depth study of the influence of disorder on
anomalous Hall resistivity,longitudinal resistivity(LR) and magnetoresistance,
enabled by this approach, reveals the following. The side-jump mechanism gives
a dominant contribution to anomalous Hall resistivity (AHR) in the CFS thin
films, regardless of the degree of disorder present. A new and novel
contribution to both LR and AHR characterized by the logarithmic temperature
dependence at temperatures below the minimum, exclusive to the amorphous CFS
films, originates from the scattering of conduction electrons from the
diffusive hydrodynamic modes associated with the longitudinal component of
magnetization, called diffusons. In these amorphous CFS films, the
electron-diffuson, e d, scattering and weak localization (WL) mechanisms
compete with that arising from the inelastic electron magnon, e m, scattering
to produce the minimum in longitudinal resistivity, whereas the minimum in AHR
is caused by the competing contributions from the e d and e m scattering, as WL
does not make any contribution to AHR. In sharp contrast, in crystalline films,
enhanced electron electron Coulomb interaction (EEI), which is basically
responsible for the resistivity minimum, makes no contribution to AHR with the
result that AHR does not exhibit a minimum.
|
cond-mat.mes-hall
|
a wide variation in the disorder strength as inferred from an order of magnitude variation in the longitudinal resistivity of co2fesi cfs huesler alloy thin films of fixed 50 nm thickness has been achieved by growing these films on si111 substrates at substrate temperatures ranging from room temperature rt to 600 c an indepth study of the influence of disorder on anomalous hall resistivitylongitudinal resistivitylr and magnetoresistance enabled by this approach reveals the following the sidejump mechanism gives a dominant contribution to anomalous hall resistivity ahr in the cfs thin films regardless of the degree of disorder present a new and novel contribution to both lr and ahr characterized by the logarithmic temperature dependence at temperatures below the minimum exclusive to the amorphous cfs films originates from the scattering of conduction electrons from the diffusive hydrodynamic modes associated with the longitudinal component of magnetization called diffusons in these amorphous cfs films the electrondiffuson e d scattering and weak localization wl mechanisms compete with that arising from the inelastic electron magnon e m scattering to produce the minimum in longitudinal resistivity whereas the minimum in ahr is caused by the competing contributions from the e d and e m scattering as wl does not make any contribution to ahr in sharp contrast in crystalline films enhanced electron electron coulomb interaction eei which is basically responsible for the resistivity minimum makes no contribution to ahr with the result that ahr does not exhibit a minimum
|
[['a', 'wide', 'variation', 'in', 'the', 'disorder', 'strength', 'as', 'inferred', 'from', 'an', 'order', 'of', 'magnitude', 'variation', 'in', 'the', 'longitudinal', 'resistivity', 'of', 'co2fesi', 'cfs', 'huesler', 'alloy', 'thin', 'films', 'of', 'fixed', '50', 'nm', 'thickness', 'has', 'been', 'achieved', 'by', 'growing', 'these', 'films', 'on', 'si111', 'substrates', 'at', 'substrate', 'temperatures', 'ranging', 'from', 'room', 'temperature', 'rt', 'to', '600', 'c', 'an', 'indepth', 'study', 'of', 'the', 'influence', 'of', 'disorder', 'on', 'anomalous', 'hall', 'resistivitylongitudinal', 'resistivitylr', 'and', 'magnetoresistance', 'enabled', 'by', 'this', 'approach', 'reveals', 'the', 'following', 'the', 'sidejump', 'mechanism', 'gives', 'a', 'dominant', 'contribution', 'to', 'anomalous', 'hall', 'resistivity', 'ahr', 'in', 'the', 'cfs', 'thin', 'films', 'regardless', 'of', 'the', 'degree', 'of', 'disorder', 'present', 'a', 'new', 'and', 'novel', 'contribution', 'to', 'both', 'lr', 'and', 'ahr', 'characterized', 'by', 'the', 'logarithmic', 'temperature', 'dependence', 'at', 'temperatures', 'below', 'the', 'minimum', 'exclusive', 'to', 'the', 'amorphous', 'cfs', 'films', 'originates', 'from', 'the', 'scattering', 'of', 'conduction', 'electrons', 'from', 'the', 'diffusive', 'hydrodynamic', 'modes', 'associated', 'with', 'the', 'longitudinal', 'component', 'of', 'magnetization', 'called', 'diffusons', 'in', 'these', 'amorphous', 'cfs', 'films', 'the', 'electrondiffuson', 'e', 'd', 'scattering', 'and', 'weak', 'localization', 'wl', 'mechanisms', 'compete', 'with', 'that', 'arising', 'from', 'the', 'inelastic', 'electron', 'magnon', 'e', 'm', 'scattering', 'to', 'produce', 'the', 'minimum', 'in', 'longitudinal', 'resistivity', 'whereas', 'the', 'minimum', 'in', 'ahr', 'is', 'caused', 'by', 'the', 'competing', 'contributions', 'from', 'the', 'e', 'd', 'and', 'e', 'm', 'scattering', 'as', 'wl', 'does', 'not', 'make', 'any', 'contribution', 'to', 'ahr', 'in', 'sharp', 'contrast', 'in', 'crystalline', 'films', 'enhanced', 'electron', 'electron', 'coulomb', 'interaction', 'eei', 'which', 'is', 'basically', 'responsible', 'for', 'the', 'resistivity', 'minimum', 'makes', 'no', 'contribution', 'to', 'ahr', 'with', 'the', 'result', 'that', 'ahr', 'does', 'not', 'exhibit', 'a', 'minimum']]
|
[-0.13446874226113625, 0.22389555469089828, -0.057975662919731503, -0.0005885286387638189, -0.028394169966729048, -0.15170477639185265, 0.05706100056086143, 0.34857547807999556, -0.2768110816017725, -0.29128641647985204, -0.01921903445230176, -0.3352938260650262, -0.10239958474458036, 0.19311392006929964, 0.02701045754753674, 0.004328413167968392, -0.057884658768307416, -0.07760234394081636, -0.05749482544876325, -0.18865044610962892, 0.28907804497284817, 0.05126162515565132, 0.32985110411342855, 0.1426528683436724, 0.04088733153572927, 0.025891564391592205, 0.05426428805415829, 0.05101523882476613, -0.15917538753407523, 0.014921414844381312, 0.2247975032196943, -0.1478611692058621, 0.1672980423504062, -0.4328046755554775, -0.19973609401204157, 0.012236744722819519, 0.12346861621675392, 0.0880637191075948, -0.03910841445613187, -0.20103123505444576, 0.08337755645819318, -0.11829116028147837, -0.09044796917150962, -0.028420014689133192, 0.040499975940717074, -0.06039882664529917, -0.27203198723194266, 0.1311984894836011, 0.1038597251715449, 0.0965892820172788, -0.09282780481153168, -0.17106381673462845, -0.09142400510415125, 0.034307643192490404, 0.09323442604218143, 0.0801953856862383, 0.1776916716810471, -0.13142250560049434, -0.10832503095346814, 0.31684303887498877, -0.09545217419072287, -0.04597473584775192, 0.19389547115036596, -0.21748310370991628, -0.01966944566423384, 0.23811300820671022, 0.1338334464089712, 0.0742618840305416, -0.1552068933703898, 0.10363231213292844, 0.02017203302869651, 0.1880989187862724, 0.062361693043688625, 0.06025744732275295, 0.19829289347107987, 0.17286443471481713, 0.015201899488844598, 0.12652492327809645, -0.16765201895250356, 0.03372337758579912, -0.22608599781136338, -0.13097085432091263, -0.2071766384722044, 0.1299426980395462, -0.07655605558508492, -0.2129290525394026, 0.35901337146509227, 0.14691449136513862, 0.20707058596599381, -0.027283777838844496, 0.24968055540230125, 0.09866938605361307, 0.11016679664656598, 0.04870161113794893, 0.2727797311876202, 0.18703216749612087, 0.13644096941776904, -0.30765786780975757, 0.14318946379547318, -0.002197649151397248]
|
1,803.05591
|
On the insufficiency of existing momentum schemes for Stochastic
Optimization
|
Momentum based stochastic gradient methods such as heavy ball (HB) and
Nesterov's accelerated gradient descent (NAG) method are widely used in
practice for training deep networks and other supervised learning models, as
they often provide significant improvements over stochastic gradient descent
(SGD). Rigorously speaking, "fast gradient" methods have provable improvements
over gradient descent only for the deterministic case, where the gradients are
exact. In the stochastic case, the popular explanations for their wide
applicability is that when these fast gradient methods are applied in the
stochastic case, they partially mimic their exact gradient counterparts,
resulting in some practical gain. This work provides a counterpoint to this
belief by proving that there exist simple problem instances where these methods
cannot outperform SGD despite the best setting of its parameters. These
negative problem instances are, in an informal sense, generic; they do not look
like carefully constructed pathological instances. These results suggest (along
with empirical evidence) that HB or NAG's practical performance gains are a
by-product of mini-batching.
Furthermore, this work provides a viable (and provable) alternative, which,
on the same set of problem instances, significantly improves over HB, NAG, and
SGD's performance. This algorithm, referred to as Accelerated Stochastic
Gradient Descent (ASGD), is a simple to implement stochastic algorithm, based
on a relatively less popular variant of Nesterov's Acceleration. Extensive
empirical results in this paper show that ASGD has performance gains over HB,
NAG, and SGD.
|
cs.LG math.OC stat.ML
|
momentum based stochastic gradient methods such as heavy ball hb and nesterovs accelerated gradient descent nag method are widely used in practice for training deep networks and other supervised learning models as they often provide significant improvements over stochastic gradient descent sgd rigorously speaking fast gradient methods have provable improvements over gradient descent only for the deterministic case where the gradients are exact in the stochastic case the popular explanations for their wide applicability is that when these fast gradient methods are applied in the stochastic case they partially mimic their exact gradient counterparts resulting in some practical gain this work provides a counterpoint to this belief by proving that there exist simple problem instances where these methods cannot outperform sgd despite the best setting of its parameters these negative problem instances are in an informal sense generic they do not look like carefully constructed pathological instances these results suggest along with empirical evidence that hb or nags practical performance gains are a byproduct of minibatching furthermore this work provides a viable and provable alternative which on the same set of problem instances significantly improves over hb nag and sgds performance this algorithm referred to as accelerated stochastic gradient descent asgd is a simple to implement stochastic algorithm based on a relatively less popular variant of nesterovs acceleration extensive empirical results in this paper show that asgd has performance gains over hb nag and sgd
|
[['momentum', 'based', 'stochastic', 'gradient', 'methods', 'such', 'as', 'heavy', 'ball', 'hb', 'and', 'nesterovs', 'accelerated', 'gradient', 'descent', 'nag', 'method', 'are', 'widely', 'used', 'in', 'practice', 'for', 'training', 'deep', 'networks', 'and', 'other', 'supervised', 'learning', 'models', 'as', 'they', 'often', 'provide', 'significant', 'improvements', 'over', 'stochastic', 'gradient', 'descent', 'sgd', 'rigorously', 'speaking', 'fast', 'gradient', 'methods', 'have', 'provable', 'improvements', 'over', 'gradient', 'descent', 'only', 'for', 'the', 'deterministic', 'case', 'where', 'the', 'gradients', 'are', 'exact', 'in', 'the', 'stochastic', 'case', 'the', 'popular', 'explanations', 'for', 'their', 'wide', 'applicability', 'is', 'that', 'when', 'these', 'fast', 'gradient', 'methods', 'are', 'applied', 'in', 'the', 'stochastic', 'case', 'they', 'partially', 'mimic', 'their', 'exact', 'gradient', 'counterparts', 'resulting', 'in', 'some', 'practical', 'gain', 'this', 'work', 'provides', 'a', 'counterpoint', 'to', 'this', 'belief', 'by', 'proving', 'that', 'there', 'exist', 'simple', 'problem', 'instances', 'where', 'these', 'methods', 'can', 'not', 'outperform', 'sgd', 'despite', 'the', 'best', 'setting', 'of', 'its', 'parameters', 'these', 'negative', 'problem', 'instances', 'are', 'in', 'an', 'informal', 'sense', 'generic', 'they', 'do', 'not', 'look', 'like', 'carefully', 'constructed', 'pathological', 'instances', 'these', 'results', 'suggest', 'along', 'with', 'empirical', 'evidence', 'that', 'hb', 'or', 'nags', 'practical', 'performance', 'gains', 'are', 'a', 'byproduct', 'of', 'minibatching', 'furthermore', 'this', 'work', 'provides', 'a', 'viable', 'and', 'provable', 'alternative', 'which', 'on', 'the', 'same', 'set', 'of', 'problem', 'instances', 'significantly', 'improves', 'over', 'hb', 'nag', 'and', 'sgds', 'performance', 'this', 'algorithm', 'referred', 'to', 'as', 'accelerated', 'stochastic', 'gradient', 'descent', 'asgd', 'is', 'a', 'simple', 'to', 'implement', 'stochastic', 'algorithm', 'based', 'on', 'a', 'relatively', 'less', 'popular', 'variant', 'of', 'nesterovs', 'acceleration', 'extensive', 'empirical', 'results', 'in', 'this', 'paper', 'show', 'that', 'asgd', 'has', 'performance', 'gains', 'over', 'hb', 'nag', 'and', 'sgd']]
|
[-0.03298665410281714, -0.0019558450300618015, -0.09821166726859643, 0.13345580221540196, -0.11772531101757541, -0.18030934999994142, 0.04072076833281824, 0.49111713192009543, -0.2983009007581054, -0.28601193530485036, 0.09774462945977265, -0.2063518857008758, -0.18379909950506657, 0.2633990916042054, -0.15193095146777466, 0.04905060545041008, 0.137351065650186, 0.0026431042360429194, -0.0819303530243447, -0.34110977247832935, 0.20962809620008982, 0.05527599572211484, 0.3013105636908415, -0.007131830709887312, 0.12490413144944196, -0.06499968165596154, 0.024943879608589997, 0.06714342888940046, -0.03717089658429688, 0.13057665580913344, 0.26641252980181424, 0.18392034492831916, 0.3791008830546065, -0.40860916502535977, -0.22090817136353158, 0.15725805302933255, 0.21981881573186948, 0.12190356346669587, -0.10258531567561341, -0.2364403960879575, 0.10276046994840726, -0.1486303939186829, -0.03852018444412487, -0.15667964756449168, -0.06446339506655932, 0.07699632209111401, -0.2666104045458772, 0.06518698174585687, 0.0945857084812002, 0.04908047862885956, -0.006437779839170423, -0.1897992837975951, 0.07301707609675508, 0.0395141343691416, 0.09099554105741071, 0.05184409901886148, 0.13539264968527046, -0.09177342839266589, -0.15297945937825405, 0.3339250020831427, -0.09599568424647317, -0.21860514688107402, 0.22040835394068284, 0.0029796558303481087, -0.15122894271613752, 0.09762205383344058, 0.20571282870790109, 0.19398853754961587, -0.14724427722623581, 0.07294520486141258, -0.03980129487277504, 0.10383854462131065, 0.03701576231681603, -0.008967038019104524, 0.09240213060513773, 0.14948438344166634, 0.14108897300555984, 0.09520841896202059, -0.05085211395821039, -0.1789841524166788, -0.2448123882465223, -0.11740482612290083, -0.13764129197522204, -0.015651024419670687, -0.14584855217693443, -0.1911545500179079, 0.3456841908296214, 0.19305759645265308, 0.19781934073234492, 0.13058456381872058, 0.35857580851842746, 0.08168646647066047, 0.05990085672646602, 0.1770224735378585, 0.24542757865460094, 0.09763721731451756, 0.14959029528966292, -0.18714729719498055, 0.12424151693728376, 0.07217383624705923]
|
1,803.05592
|
Wide-Sense-Stationarity of Everyday Wireless Channels for Body-to-Body
Networks
|
The existence of wide-sense-stationarity (WSS) in narrowband wireless
body-to-body networks is investigated for "everyday" scenarios using many hours
of contiguous experimental data. We employ different parametric and
non-parametric hypothesis tests for evaluating mean and variance stationarity,
along with distribution consistency, of several body-to-body channels found
from different on-body sensor locations. We also estimate the variation of
power spectrum to evaluate the time independence of the auto-covariance
function. Our results show that, with 95% confidence, the assumption of WSS is
met for at most 90% of the cases with window lengths of 5 seconds for the
channels between the hubs of different BANs. Additionally, in the best-case
scenario, the hub-to-hub channel remains reasonably stationary (with more than
80% probability of satisfying the null hypothesis) for longer window lengths of
more than 10 seconds. The short time power spectral variation for body-to-body
channels is also shown to be negligible. Moreover, we show that body-to-body
channels can be considered wide-sense-stationary over significantly longer
periods than on-body channels.
|
eess.SP
|
the existence of widesensestationarity wss in narrowband wireless bodytobody networks is investigated for everyday scenarios using many hours of contiguous experimental data we employ different parametric and nonparametric hypothesis tests for evaluating mean and variance stationarity along with distribution consistency of several bodytobody channels found from different onbody sensor locations we also estimate the variation of power spectrum to evaluate the time independence of the autocovariance function our results show that with 95 confidence the assumption of wss is met for at most 90 of the cases with window lengths of 5 seconds for the channels between the hubs of different bans additionally in the bestcase scenario the hubtohub channel remains reasonably stationary with more than 80 probability of satisfying the null hypothesis for longer window lengths of more than 10 seconds the short time power spectral variation for bodytobody channels is also shown to be negligible moreover we show that bodytobody channels can be considered widesensestationary over significantly longer periods than onbody channels
|
[['the', 'existence', 'of', 'widesensestationarity', 'wss', 'in', 'narrowband', 'wireless', 'bodytobody', 'networks', 'is', 'investigated', 'for', 'everyday', 'scenarios', 'using', 'many', 'hours', 'of', 'contiguous', 'experimental', 'data', 'we', 'employ', 'different', 'parametric', 'and', 'nonparametric', 'hypothesis', 'tests', 'for', 'evaluating', 'mean', 'and', 'variance', 'stationarity', 'along', 'with', 'distribution', 'consistency', 'of', 'several', 'bodytobody', 'channels', 'found', 'from', 'different', 'onbody', 'sensor', 'locations', 'we', 'also', 'estimate', 'the', 'variation', 'of', 'power', 'spectrum', 'to', 'evaluate', 'the', 'time', 'independence', 'of', 'the', 'autocovariance', 'function', 'our', 'results', 'show', 'that', 'with', '95', 'confidence', 'the', 'assumption', 'of', 'wss', 'is', 'met', 'for', 'at', 'most', '90', 'of', 'the', 'cases', 'with', 'window', 'lengths', 'of', '5', 'seconds', 'for', 'the', 'channels', 'between', 'the', 'hubs', 'of', 'different', 'bans', 'additionally', 'in', 'the', 'bestcase', 'scenario', 'the', 'hubtohub', 'channel', 'remains', 'reasonably', 'stationary', 'with', 'more', 'than', '80', 'probability', 'of', 'satisfying', 'the', 'null', 'hypothesis', 'for', 'longer', 'window', 'lengths', 'of', 'more', 'than', '10', 'seconds', 'the', 'short', 'time', 'power', 'spectral', 'variation', 'for', 'bodytobody', 'channels', 'is', 'also', 'shown', 'to', 'be', 'negligible', 'moreover', 'we', 'show', 'that', 'bodytobody', 'channels', 'can', 'be', 'considered', 'widesensestationary', 'over', 'significantly', 'longer', 'periods', 'than', 'onbody', 'channels']]
|
[-0.15383160109473623, 0.11176359723896984, -0.051160028474520385, 0.08514847221172035, 0.00591897040808194, -0.16414128263469463, 0.06910396415997515, 0.41698322057678006, -0.20504567168012008, -0.3037085892563617, 0.10485289997944355, -0.250088330002733, -0.08368180391132934, 0.2379351057526138, -0.03754064466022415, 0.05835450562306416, 0.09167055545782923, 0.041767072030285624, -0.03809113307943335, -0.24813685096501384, 0.25735504516503876, 0.08104888460725362, 0.31640551095529473, 0.03826749742240933, 0.057563279336462096, 0.0045380745453898, -0.03540624009177985, -0.02194740973408005, -0.10089901381470105, 0.05432389864272633, 0.23579582631628224, 0.14595702068052357, 0.25024042728954904, -0.41754320607718975, -0.25531795539283825, 0.13623953022258242, 0.1344714343294869, 0.034319504207276086, 0.02465961107471814, -0.26984121434298564, 0.17669273996553211, -0.15544351005932477, -0.07183973659634774, 0.019037731040706052, 0.04850660806613756, 0.021056052722772698, -0.3154831909988489, 0.13930368772384505, 0.003820390541129458, 0.06644209843692313, -0.06770654130629321, -0.13729442023516944, 0.015743651534401937, 0.11813099072947178, 0.09438242093102293, -0.0324144218157241, 0.11148165597833325, -0.09545957393771616, -0.09257787004987031, 0.3180104124034255, -0.08061820394127776, -0.17189798107152277, 0.17921643735255965, -0.15653333454723412, -0.10689980405336821, 0.1487150812510079, 0.1705481031116236, 0.10981347711963786, -0.17919546140093404, -0.016468378313512392, -0.010219048174029147, 0.19554893776234009, 0.12444458896708158, 0.09505760862009117, 0.15510582135139425, 0.16663557422680803, 0.08116245594336996, 0.1227723055312203, -0.18308738566199204, -0.10257850357124375, -0.28936035712652003, -0.10351508326399468, -0.1569433309810443, 0.00805094619827736, -0.1320674372116538, -0.09165627053808736, 0.4063050640390519, 0.17201952844963087, 0.1784935234269748, 0.1724288111127177, 0.28839333650345605, 0.08217340110970753, 0.07035571849764106, 0.10591681855729815, 0.2179003697503818, 0.08457380351696715, 0.06325264788091896, -0.11926515278245473, 0.09278614554025325, -0.08711231754011946]
|
1,803.05593
|
Information Security in Health Care Centre Using Cryptography and
Steganography
|
As the volume of medicinal information stored electronically increase, so do
the need to enhance how it is secured. The inaccessibility to patient record at
the ideal time can prompt death toll and also well degrade the level of health
care services rendered by the medicinal professionals. Criminal assaults in
social insurance have expanded by 125% since 2010 and are now the leading cause
of medical data breaches. This study therefore presents the combination of 3DES
and LSB to improve security measure applied on medical data. Java programming
language was used to develop a simulation program for the experiment. The
result shows medical data can be stored, shared, and managed in a reliable and
secure manner using the combined model.
|
cs.CR
|
as the volume of medicinal information stored electronically increase so do the need to enhance how it is secured the inaccessibility to patient record at the ideal time can prompt death toll and also well degrade the level of health care services rendered by the medicinal professionals criminal assaults in social insurance have expanded by 125 since 2010 and are now the leading cause of medical data breaches this study therefore presents the combination of 3des and lsb to improve security measure applied on medical data java programming language was used to develop a simulation program for the experiment the result shows medical data can be stored shared and managed in a reliable and secure manner using the combined model
|
[['as', 'the', 'volume', 'of', 'medicinal', 'information', 'stored', 'electronically', 'increase', 'so', 'do', 'the', 'need', 'to', 'enhance', 'how', 'it', 'is', 'secured', 'the', 'inaccessibility', 'to', 'patient', 'record', 'at', 'the', 'ideal', 'time', 'can', 'prompt', 'death', 'toll', 'and', 'also', 'well', 'degrade', 'the', 'level', 'of', 'health', 'care', 'services', 'rendered', 'by', 'the', 'medicinal', 'professionals', 'criminal', 'assaults', 'in', 'social', 'insurance', 'have', 'expanded', 'by', '125', 'since', '2010', 'and', 'are', 'now', 'the', 'leading', 'cause', 'of', 'medical', 'data', 'breaches', 'this', 'study', 'therefore', 'presents', 'the', 'combination', 'of', '3des', 'and', 'lsb', 'to', 'improve', 'security', 'measure', 'applied', 'on', 'medical', 'data', 'java', 'programming', 'language', 'was', 'used', 'to', 'develop', 'a', 'simulation', 'program', 'for', 'the', 'experiment', 'the', 'result', 'shows', 'medical', 'data', 'can', 'be', 'stored', 'shared', 'and', 'managed', 'in', 'a', 'reliable', 'and', 'secure', 'manner', 'using', 'the', 'combined', 'model']]
|
[-0.060403743747641174, 0.03735550623193073, -0.07857759013325752, 0.11344913807697594, -0.10566141358964766, -0.15159002972747354, 0.1015113797892506, 0.35597647631851337, -0.2684635260608047, -0.35873699450554947, 0.17728993195535925, -0.31052474652727446, -0.0881950853082041, 0.2046347845646475, -0.16463998567972643, 0.06662855851269948, 0.10036639646859839, 0.02476203676002721, 0.04776336890645325, -0.30474227260177333, 0.2454522611728559, 0.09560822324128822, 0.35979603018301226, 0.08899765405027817, 0.04299879557899355, 0.022080335847567766, -0.06783747851465402, -0.02068048279810076, -0.05663116903257712, 0.136067291496632, 0.3965590982445671, 0.2416030769973683, 0.31971401409246025, -0.46270065516388664, -0.1745526893006172, 0.07748829690972343, 0.12775633696389074, 0.07940038908272981, -0.04736009477055632, -0.3103777693477847, 0.07530106458580121, -0.22998574421120185, -0.10236720043661383, -0.12046595707846185, -0.0353398415648068, -0.008684903032068784, -0.2557050655547452, 0.05339732014860298, -0.0363957424716015, 0.13661853956679504, -0.022389060934074223, -0.05639331168495119, -0.06471374832520572, 0.21045105641242118, 0.03742110722717674, 0.05886328679068053, 0.177136407129971, -0.09214660674527599, -0.11450440738505373, 0.3905776347654561, -0.008048420806395977, -0.1253794006605555, 0.1640423769451445, -0.0747807506423366, -0.13019310857416713, 0.10018880707211793, 0.23651902351217965, 0.02945858239691006, -0.22682961116855344, 0.01070137134665856, 0.027984177243585387, 0.1906058239750564, 0.05654520856915042, 0.030478562131368864, 0.1908070087277641, 0.16551240678139342, 0.009444954133747767, 0.13208281726159232, -0.06556801744736732, -0.026118543317231038, -0.20482939641418246, -0.16977860581003673, -0.15503018778011513, 0.012922374164918437, -0.01826949702165924, -0.11974251050657282, 0.34901623576103397, 0.19564228400898476, 0.10714373157146231, -0.023202394736775506, 0.325444999585549, 0.04274619727220852, 0.14760347640549298, 0.08511428377629879, 0.18718402375234292, -0.006811045409025004, 0.22490024422683444, -0.1644153136565971, 0.18003608149204714, -0.05037936766942342]
|
1,803.05594
|
Periodic P-Partitions
|
In this paper, we introduce a class of $(P, \omega)$-partitions that we call
periodic $(P, \omega)$-partitions, then prove that such $(P,
\omega)$-partitions satisfy a homogeneous first-order matrix difference
equation. After defining an appropriate counting problem for the above $(P,
\omega)$-partitions, we show that as a consequence of this equation, periodic
$(P, \omega)$-partitions can be enumerated with constant coefficient linear
recurrence relations. By analysing the above matrix difference equation, we
also prove a result for the asymptotic growth rate for the number of periodic
$(P, \omega)$-partitions. The results of this paper generalizes and strengthens
the constant coefficient linear recurrence results proved by Sun and by
L\'opez, Mart\'inez, P\'erez, P\'erez, and Basova for enumerating standard
Young tableaux on shifted strips with constant width.
|
math.CO
|
in this paper we introduce a class of p omegapartitions that we call periodic p omegapartitions then prove that such p omegapartitions satisfy a homogeneous firstorder matrix difference equation after defining an appropriate counting problem for the above p omegapartitions we show that as a consequence of this equation periodic p omegapartitions can be enumerated with constant coefficient linear recurrence relations by analysing the above matrix difference equation we also prove a result for the asymptotic growth rate for the number of periodic p omegapartitions the results of this paper generalizes and strengthens the constant coefficient linear recurrence results proved by sun and by lopez martinez perez perez and basova for enumerating standard young tableaux on shifted strips with constant width
|
[['in', 'this', 'paper', 'we', 'introduce', 'a', 'class', 'of', 'p', 'omegapartitions', 'that', 'we', 'call', 'periodic', 'p', 'omegapartitions', 'then', 'prove', 'that', 'such', 'p', 'omegapartitions', 'satisfy', 'a', 'homogeneous', 'firstorder', 'matrix', 'difference', 'equation', 'after', 'defining', 'an', 'appropriate', 'counting', 'problem', 'for', 'the', 'above', 'p', 'omegapartitions', 'we', 'show', 'that', 'as', 'a', 'consequence', 'of', 'this', 'equation', 'periodic', 'p', 'omegapartitions', 'can', 'be', 'enumerated', 'with', 'constant', 'coefficient', 'linear', 'recurrence', 'relations', 'by', 'analysing', 'the', 'above', 'matrix', 'difference', 'equation', 'we', 'also', 'prove', 'a', 'result', 'for', 'the', 'asymptotic', 'growth', 'rate', 'for', 'the', 'number', 'of', 'periodic', 'p', 'omegapartitions', 'the', 'results', 'of', 'this', 'paper', 'generalizes', 'and', 'strengthens', 'the', 'constant', 'coefficient', 'linear', 'recurrence', 'results', 'proved', 'by', 'sun', 'and', 'by', 'lopez', 'martinez', 'perez', 'perez', 'and', 'basova', 'for', 'enumerating', 'standard', 'young', 'tableaux', 'on', 'shifted', 'strips', 'with', 'constant', 'width']]
|
[-0.15461088404990733, 0.14031633615680525, -0.0573482379080815, 0.05082956561333655, -0.08420150206269075, -0.13728786999514947, 0.05472385649724553, 0.29535585990718877, -0.3218238181861428, -0.2581539349242424, 0.0653913583654988, -0.2400698873369644, -0.17116280547343193, 0.2032012750705083, -0.08431806521645437, 0.06241404360237842, 0.06620453154901043, 0.02448974286283677, -0.08130399208554688, -0.26643347183514077, 0.3458860203313331, -0.02521058846420298, 0.18716923396568746, 0.026486845195177012, 0.07486191908052812, 0.05699429582649221, -0.017399575052938113, 0.03477531247772277, -0.23107272550787455, 0.04893828686617781, 0.22339282512742406, 0.09166756782215088, 0.23999882489442825, -0.33240221307302514, -0.16009411624787998, 0.1403869744273834, 0.14291076007454345, 0.04223264705506154, -0.042650219251906187, -0.2459242987446487, 0.15840156969594923, -0.14608090846062016, -0.20355352966774565, -0.02410993680435543, 0.10603050412610174, 0.05923129503547291, -0.31884737949294506, 0.0921254464480929, 0.15524002876287948, 0.06367200325864057, -0.05757362166186795, -0.1531269279968304, 0.03929394029546529, 0.01219641649707531, 0.01929307171764473, 0.02500608085344235, 0.0069898637865359586, -0.0544423697302894, -0.09413737644208595, 0.3119462741383662, -0.10584824470958362, -0.20857345514620343, 0.08367773492354899, -0.13673255913502846, -0.16764943901604662, 0.09142869201023132, 0.099301757880797, 0.11424340809850643, -0.09763909993538013, 0.1502476121982909, -0.14474868865994114, 0.12972119166515766, 0.19757386771962046, -0.06074413045231874, 0.08911424652518084, 0.0672669755993411, 0.08711770808634658, 0.1510511072692073, -0.001075632068871831, -0.03486160152048493, -0.3220019387779757, -0.183999303249099, -0.15417387443594635, 0.09791083421829777, -0.11092579696523899, -0.16541178095115658, 0.3204778873904919, 0.07177588786774626, 0.20036892793141306, 0.1484417388138051, 0.15813251361638928, 0.17990610013900246, -0.01707879326034648, 0.08384854650163713, 0.15360348304384389, 0.17604897276032716, 0.07014743064452583, -0.21543439361654843, 0.05026055201888084, 0.1764563238170619]
|
1,803.05595
|
Experimental and numerical analysis of grid generated turbulence with
and without mean strain
|
This paper presents experimental and numerical analysis of grid generated
turbulence with and without the effects of applied mean strain. We conduct a
series of experiments on decaying grid generated turbulence and grid turbulence
with mean strain. Experimental data of turbulence statistics including Reynolds
stress anisotropies is collected, analyzed and then compared to the predictions
of Reynolds Stress Models to assess their accuracy. The experimental data is
used to evaluate the variability in the coefficients of the rate of dissipation
model and the pressure strain correlation models used in Reynolds Stress
Modeling. For both models we recommend optimal values of coefficients that
should be used for experimental studies of grid generated turbulence.
|
physics.flu-dyn
|
this paper presents experimental and numerical analysis of grid generated turbulence with and without the effects of applied mean strain we conduct a series of experiments on decaying grid generated turbulence and grid turbulence with mean strain experimental data of turbulence statistics including reynolds stress anisotropies is collected analyzed and then compared to the predictions of reynolds stress models to assess their accuracy the experimental data is used to evaluate the variability in the coefficients of the rate of dissipation model and the pressure strain correlation models used in reynolds stress modeling for both models we recommend optimal values of coefficients that should be used for experimental studies of grid generated turbulence
|
[['this', 'paper', 'presents', 'experimental', 'and', 'numerical', 'analysis', 'of', 'grid', 'generated', 'turbulence', 'with', 'and', 'without', 'the', 'effects', 'of', 'applied', 'mean', 'strain', 'we', 'conduct', 'a', 'series', 'of', 'experiments', 'on', 'decaying', 'grid', 'generated', 'turbulence', 'and', 'grid', 'turbulence', 'with', 'mean', 'strain', 'experimental', 'data', 'of', 'turbulence', 'statistics', 'including', 'reynolds', 'stress', 'anisotropies', 'is', 'collected', 'analyzed', 'and', 'then', 'compared', 'to', 'the', 'predictions', 'of', 'reynolds', 'stress', 'models', 'to', 'assess', 'their', 'accuracy', 'the', 'experimental', 'data', 'is', 'used', 'to', 'evaluate', 'the', 'variability', 'in', 'the', 'coefficients', 'of', 'the', 'rate', 'of', 'dissipation', 'model', 'and', 'the', 'pressure', 'strain', 'correlation', 'models', 'used', 'in', 'reynolds', 'stress', 'modeling', 'for', 'both', 'models', 'we', 'recommend', 'optimal', 'values', 'of', 'coefficients', 'that', 'should', 'be', 'used', 'for', 'experimental', 'studies', 'of', 'grid', 'generated', 'turbulence']]
|
[-0.12281958632437247, 0.12256037686685366, -0.08702815380612654, 0.04915991169088686, -0.016838328214362264, -0.06005339414696209, -0.008950241632451903, 0.357087980099355, -0.2639626859911784, -0.31570342321979944, 0.0887883730735796, -0.26910412202622475, -0.07965756159891109, 0.25814333828332436, -0.002356256665994546, 0.14188842205281357, 0.09087202465993219, -0.03858617425430566, -0.0013163883434442272, -0.2383421090396171, 0.2755910883674265, 0.14742361309306165, 0.348230555587049, 0.043985368049886474, 0.0776000076501597, -0.1134198250989097, -0.09257170923852495, 0.08024186929625492, -0.19366368823758812, 0.09351070053110432, 0.22503430838719396, 0.05626614690741657, 0.24780276728727454, -0.4788220643198916, -0.24797952642464743, 0.07541817866565127, 0.11432459592054199, 0.08711601303990132, -0.018860421872107378, -0.23665035048699273, 0.09708568995951541, -0.1739440060337074, -0.05321983826745834, -0.11892276328373035, -0.0005257438543984401, 0.07047442593778085, -0.37869811626816435, 0.1654571159264638, -0.02145459591494208, 0.17904092956034998, -0.1275839315972657, -0.10732409372992281, -0.0688880794249209, 0.12432368371186645, 0.1273278521953866, -0.004164486919762567, 0.15737294180351974, -0.172406518166034, -0.09035833279267536, 0.39903085455963655, -0.05954311921959743, -0.2208085932101572, 0.16815548640027242, -0.14659223023668996, -0.05675518442876637, 0.09490466671663203, 0.27924304097957375, 0.050839338364312425, -0.0675115028487718, -0.00818664710563358, -0.0001421217873160328, 0.18549809942487627, 0.006794724079164942, -0.09608339847181924, 0.16100182913942263, 0.1943770787329413, -0.033303982678002546, 0.12534238999173145, -0.15189419481196506, -0.039645702509525496, -0.2873274800866576, -0.08813859084122148, -0.2089214172114485, 0.008441187496438423, -0.10097868222445479, -0.16035304655088112, 0.4062300125951879, 0.2779897183146594, 0.15742357016175187, 0.07745774383615103, 0.2950854705912726, 0.11845425830272559, 0.038053792940835204, 0.0758053166625489, 0.24216882459586486, 0.15325541319491873, 0.13635603136832028, -0.2232876176920919, 0.06539599500995662, 0.015792776996802007]
|
1,803.05596
|
A nonlinear transform based analog video transmission framework
|
Soft-cast, a cross-layer design for wireless video transmission, is proposed
to solve the drawbacks of digital video transmission: threshold transmission
framework achieving the same effect. Specifically, in encoder, we carry out
power allocation on the transformed coefficients and encode the coefficients
based on the new formulation of power distortion. In decoder, the process of
LLSE estimator is also improved. Accompanied with the inverse nonlinear
transform, DCT coefficients can be recovered depending on the scaling factors ,
LLSE estimator coefficients and metadata. Experiment results show that our
proposed framework outperforms the Soft-cast in PSNR 1.08 dB and the MSSIM gain
reaches to 2.35% when transmitting under the same bandwidth and total power.
|
cs.MM
|
softcast a crosslayer design for wireless video transmission is proposed to solve the drawbacks of digital video transmission threshold transmission framework achieving the same effect specifically in encoder we carry out power allocation on the transformed coefficients and encode the coefficients based on the new formulation of power distortion in decoder the process of llse estimator is also improved accompanied with the inverse nonlinear transform dct coefficients can be recovered depending on the scaling factors llse estimator coefficients and metadata experiment results show that our proposed framework outperforms the softcast in psnr 108 db and the mssim gain reaches to 235 when transmitting under the same bandwidth and total power
|
[['softcast', 'a', 'crosslayer', 'design', 'for', 'wireless', 'video', 'transmission', 'is', 'proposed', 'to', 'solve', 'the', 'drawbacks', 'of', 'digital', 'video', 'transmission', 'threshold', 'transmission', 'framework', 'achieving', 'the', 'same', 'effect', 'specifically', 'in', 'encoder', 'we', 'carry', 'out', 'power', 'allocation', 'on', 'the', 'transformed', 'coefficients', 'and', 'encode', 'the', 'coefficients', 'based', 'on', 'the', 'new', 'formulation', 'of', 'power', 'distortion', 'in', 'decoder', 'the', 'process', 'of', 'llse', 'estimator', 'is', 'also', 'improved', 'accompanied', 'with', 'the', 'inverse', 'nonlinear', 'transform', 'dct', 'coefficients', 'can', 'be', 'recovered', 'depending', 'on', 'the', 'scaling', 'factors', 'llse', 'estimator', 'coefficients', 'and', 'metadata', 'experiment', 'results', 'show', 'that', 'our', 'proposed', 'framework', 'outperforms', 'the', 'softcast', 'in', 'psnr', '108', 'db', 'and', 'the', 'mssim', 'gain', 'reaches', 'to', '235', 'when', 'transmitting', 'under', 'the', 'same', 'bandwidth', 'and', 'total', 'power']]
|
[-0.12155422801151872, -0.01969105267967537, -0.07392208984578555, -0.010681447644856235, -0.08360617438700262, -0.19573895963137303, 0.07090074124851457, 0.4052545950871031, -0.2912401289520961, -0.2735012835418841, 0.09382095102348172, -0.2781046099108556, -0.19009071952698506, 0.20725723573902868, -0.12341036878631644, 0.09622748833993133, 0.05028561319066387, 0.042954186627746756, -0.08294701816312056, -0.31629949652168127, 0.23335619532626192, 0.14021263070369386, 0.41221926959653227, 0.045290228626844564, 0.1639007893171302, 0.015556878379528533, -0.05916835782711201, -0.03417904184744606, -0.09438504580989587, 0.08078371001877559, 0.271205434337355, 0.14369587716646492, 0.2584860582994121, -0.36971521515559563, -0.2271182023928905, 0.046651297832898495, 0.13200368821612155, 0.02347085544101472, -0.02496990918528886, -0.2503429419220478, 0.15134990786834848, -0.16542195023547085, 0.01216931761470887, -0.054947271547719556, -0.07041633276725714, 0.010165206139098923, -0.38572670542635024, 0.09680609309025556, 0.013742908150098234, 0.01657195174890869, -0.07157383528472153, -0.15076268481020377, 0.037506601691931346, 0.1204347014550739, 0.017867280876037873, -0.02803780523761404, 0.14383303597382763, -0.11472247788717724, -0.09880787732611182, 0.3668685909887811, -0.06450998886347802, -0.21124030458565168, 0.06202983791623616, -0.08545348244139327, -0.06917756100027066, 0.17429984068137788, 0.22967665535309967, 0.04763840880895139, -0.1327474940605824, 0.026501508954613697, -0.014195174888162961, 0.2406204808151947, 0.13635713917879774, 0.09473471393158554, 0.12510951988416602, 0.15474376925662653, 0.07018876016878013, 0.15847011817342443, -0.11496266010788463, -0.0755755979532622, -0.23607448719547325, -0.09677743894829995, -0.2113281104248017, 0.000590484249976657, -0.13432862545871, -0.0707326911846703, 0.40133100630328905, 0.17284556866166587, 0.1540094660375408, 0.10597165859357086, 0.38057758762580257, 0.19056003468379132, 0.07827538047875453, 0.11819339857243423, 0.19885097146209962, 0.08779267154915153, 0.12233400163855755, -0.244723937166679, 0.036837461154099624, 0.0440121490095373]
|
1,803.05597
|
Tuning a random field mechanism in a frustrated magnet
|
We study the influence of spinless impurities on a frustrated magnet
featuring a spin-density wave (stripe) phase by means of Monte Carlo
simulations. We demonstrate that the interplay between the impurities and an
order parameter that breaks a real-space symmetry triggers the emergence of a
random-field mechanism which destroys the stripe-ordered phase. Importantly,
the strength of the emerging random fields can be tuned by the repulsion
between the impurity atoms; they vanish for perfect anticorrelations between
neighboring impurities. This provides a novel way of controlling the phase
diagram of a many-particle system. In addition, we also investigate the effects
of the impurities on the character of the phase transitions between the
stripe-ordered, ferromagnetic, and paramagnetic phases.
|
cond-mat.dis-nn cond-mat.stat-mech cond-mat.str-el
|
we study the influence of spinless impurities on a frustrated magnet featuring a spindensity wave stripe phase by means of monte carlo simulations we demonstrate that the interplay between the impurities and an order parameter that breaks a realspace symmetry triggers the emergence of a randomfield mechanism which destroys the stripeordered phase importantly the strength of the emerging random fields can be tuned by the repulsion between the impurity atoms they vanish for perfect anticorrelations between neighboring impurities this provides a novel way of controlling the phase diagram of a manyparticle system in addition we also investigate the effects of the impurities on the character of the phase transitions between the stripeordered ferromagnetic and paramagnetic phases
|
[['we', 'study', 'the', 'influence', 'of', 'spinless', 'impurities', 'on', 'a', 'frustrated', 'magnet', 'featuring', 'a', 'spindensity', 'wave', 'stripe', 'phase', 'by', 'means', 'of', 'monte', 'carlo', 'simulations', 'we', 'demonstrate', 'that', 'the', 'interplay', 'between', 'the', 'impurities', 'and', 'an', 'order', 'parameter', 'that', 'breaks', 'a', 'realspace', 'symmetry', 'triggers', 'the', 'emergence', 'of', 'a', 'randomfield', 'mechanism', 'which', 'destroys', 'the', 'stripeordered', 'phase', 'importantly', 'the', 'strength', 'of', 'the', 'emerging', 'random', 'fields', 'can', 'be', 'tuned', 'by', 'the', 'repulsion', 'between', 'the', 'impurity', 'atoms', 'they', 'vanish', 'for', 'perfect', 'anticorrelations', 'between', 'neighboring', 'impurities', 'this', 'provides', 'a', 'novel', 'way', 'of', 'controlling', 'the', 'phase', 'diagram', 'of', 'a', 'manyparticle', 'system', 'in', 'addition', 'we', 'also', 'investigate', 'the', 'effects', 'of', 'the', 'impurities', 'on', 'the', 'character', 'of', 'the', 'phase', 'transitions', 'between', 'the', 'stripeordered', 'ferromagnetic', 'and', 'paramagnetic', 'phases']]
|
[-0.22373128408522963, 0.2575788314602035, -0.06221375390606258, 0.07322029159143406, 0.006384951736906479, -0.10425640029254658, 0.12781842072004582, 0.3569770552025273, -0.24926540968088626, -0.2587837987169945, -0.019922777477467176, -0.328053358926213, -0.1607403879371022, 0.09610694281130644, 0.10632571569997175, -0.05068853939883411, -0.040881614818976356, -0.06450413600421222, -0.16445291547630592, -0.18372724200438323, 0.3091439633341185, -0.0009630069242999086, 0.3061222660612187, 0.07962875244817857, 0.05624799199145416, 0.05752423759509713, 0.12995035309697792, 0.025052641664936752, -0.1540252096868965, 0.020478574229918164, 0.19480666356032778, -0.0791257931931137, 0.20112833159510046, -0.46981108985070524, -0.200223538494701, 0.09320122421044728, 0.16015484207309783, 0.18282617277220886, -0.09214315700930832, -0.35902520999762005, -0.006159967426732504, -0.15742238283815696, -0.13773609407181883, -0.09333296291176872, -0.03708717987344777, 0.0320545048593415, -0.2713010098287386, 0.11861866327772391, 0.09202328581435221, 0.0861741727205989, -0.044777447751177285, -0.02410957025633001, -0.06331916885843886, 0.09958292137638762, 0.03006689771427773, 0.04009044263712612, 0.11352174182458588, -0.13669566806016392, -0.11936510728816663, 0.3697781114244898, -0.03364144153953209, -0.11498827181339007, 0.16736280584932658, -0.14391515581030098, -0.07150761604887144, 0.1555048451871322, 0.13364047692573813, 0.08109639914192517, -0.12275551434140652, 0.08690773844939721, 0.0030238812846775922, 0.2125666752409447, -0.030536955941050988, 0.05927932776253799, 0.2732000902198769, 0.18665103055536747, 0.04117495959207158, 0.21720096440323436, -0.157192659148834, -0.14810113204996392, -0.2566217390282465, -0.17162993420211495, -0.22620365573575013, -0.014580164927259642, -0.11026047925130616, -0.21113877617834328, 0.4197704729720436, 0.18891634909207292, 0.1778519209634898, -0.09228271189655562, 0.22193469243637962, 0.08708126360052747, 0.02587306084400364, -0.001552081347748252, 0.25750766815778253, 0.17412185815969836, 0.07443789556494047, -0.3288418817010724, 0.07721746858642918, 0.07383544272582593]
|
1,803.05598
|
Large Margin Deep Networks for Classification
|
We present a formulation of deep learning that aims at producing a large
margin classifier. The notion of margin, minimum distance to a decision
boundary, has served as the foundation of several theoretically profound and
empirically successful results for both classification and regression tasks.
However, most large margin algorithms are applicable only to shallow models
with a preset feature representation; and conventional margin methods for
neural networks only enforce margin at the output layer. Such methods are
therefore not well suited for deep networks.
In this work, we propose a novel loss function to impose a margin on any
chosen set of layers of a deep network (including input and hidden layers). Our
formulation allows choosing any norm on the metric measuring the margin. We
demonstrate that the decision boundary obtained by our loss has nice properties
compared to standard classification loss functions. Specifically, we show
improved empirical results on the MNIST, CIFAR-10 and ImageNet datasets on
multiple tasks: generalization from small training sets, corrupted labels, and
robustness against adversarial perturbations. The resulting loss is general and
complementary to existing data augmentation (such as random/adversarial input
transform) and regularization techniques (such as weight decay, dropout, and
batch norm).
|
stat.ML cs.LG
|
we present a formulation of deep learning that aims at producing a large margin classifier the notion of margin minimum distance to a decision boundary has served as the foundation of several theoretically profound and empirically successful results for both classification and regression tasks however most large margin algorithms are applicable only to shallow models with a preset feature representation and conventional margin methods for neural networks only enforce margin at the output layer such methods are therefore not well suited for deep networks in this work we propose a novel loss function to impose a margin on any chosen set of layers of a deep network including input and hidden layers our formulation allows choosing any norm on the metric measuring the margin we demonstrate that the decision boundary obtained by our loss has nice properties compared to standard classification loss functions specifically we show improved empirical results on the mnist cifar10 and imagenet datasets on multiple tasks generalization from small training sets corrupted labels and robustness against adversarial perturbations the resulting loss is general and complementary to existing data augmentation such as randomadversarial input transform and regularization techniques such as weight decay dropout and batch norm
|
[['we', 'present', 'a', 'formulation', 'of', 'deep', 'learning', 'that', 'aims', 'at', 'producing', 'a', 'large', 'margin', 'classifier', 'the', 'notion', 'of', 'margin', 'minimum', 'distance', 'to', 'a', 'decision', 'boundary', 'has', 'served', 'as', 'the', 'foundation', 'of', 'several', 'theoretically', 'profound', 'and', 'empirically', 'successful', 'results', 'for', 'both', 'classification', 'and', 'regression', 'tasks', 'however', 'most', 'large', 'margin', 'algorithms', 'are', 'applicable', 'only', 'to', 'shallow', 'models', 'with', 'a', 'preset', 'feature', 'representation', 'and', 'conventional', 'margin', 'methods', 'for', 'neural', 'networks', 'only', 'enforce', 'margin', 'at', 'the', 'output', 'layer', 'such', 'methods', 'are', 'therefore', 'not', 'well', 'suited', 'for', 'deep', 'networks', 'in', 'this', 'work', 'we', 'propose', 'a', 'novel', 'loss', 'function', 'to', 'impose', 'a', 'margin', 'on', 'any', 'chosen', 'set', 'of', 'layers', 'of', 'a', 'deep', 'network', 'including', 'input', 'and', 'hidden', 'layers', 'our', 'formulation', 'allows', 'choosing', 'any', 'norm', 'on', 'the', 'metric', 'measuring', 'the', 'margin', 'we', 'demonstrate', 'that', 'the', 'decision', 'boundary', 'obtained', 'by', 'our', 'loss', 'has', 'nice', 'properties', 'compared', 'to', 'standard', 'classification', 'loss', 'functions', 'specifically', 'we', 'show', 'improved', 'empirical', 'results', 'on', 'the', 'mnist', 'cifar10', 'and', 'imagenet', 'datasets', 'on', 'multiple', 'tasks', 'generalization', 'from', 'small', 'training', 'sets', 'corrupted', 'labels', 'and', 'robustness', 'against', 'adversarial', 'perturbations', 'the', 'resulting', 'loss', 'is', 'general', 'and', 'complementary', 'to', 'existing', 'data', 'augmentation', 'such', 'as', 'randomadversarial', 'input', 'transform', 'and', 'regularization', 'techniques', 'such', 'as', 'weight', 'decay', 'dropout', 'and', 'batch', 'norm']]
|
[-0.04164483241717979, -0.017807266593386, -0.05572267732172873, 0.09855048966872965, -0.10655432304149957, -0.19171628099866211, 0.08477628128579463, 0.45215018281150554, -0.2914468662743575, -0.31690247874792077, 0.09567674068405486, -0.26672376475899967, -0.18216379594795293, 0.20074103521394396, -0.1592302000703205, 0.16167550431245342, 0.1695962162017066, 0.03169821331225487, -0.09504849987747478, -0.3108985953105065, 0.3365165179803362, 0.03918236959326733, 0.3441133909163817, 0.04014257486285595, 0.1509433981074909, -0.016856310597200153, 0.014152818176242981, 0.024551629627166022, -0.057516224718156865, 0.1523034855543735, 0.25821223439337987, 0.1866413272614709, 0.3454107227002455, -0.3807320331369862, -0.25612828048563036, 0.11719168739412264, 0.09180085671720506, 0.0956446800628697, -0.019641530915130365, -0.30451691475919057, 0.09606960195537448, -0.15265890195561563, 0.020817917051871644, -0.18849935618980887, -0.04904591697882767, -0.004886080529233488, -0.361158774468367, 0.032207304224144986, 0.07771867264722838, 0.05593422202071054, -0.06257563501302163, -0.17685869743759144, 0.007933256156071265, 0.12753672810888325, 0.035817782152302295, 0.07210895823560617, 0.12563253105688973, -0.19929641620066907, -0.125473941523265, 0.315855600738775, -0.0861101476889255, -0.2261149893623545, 0.22121381008912464, -0.0003430517544014956, -0.12309247426698126, 0.04814017007864898, 0.2609851260026586, 0.12288693652303918, -0.11560097345751404, 0.0069289693847029155, -0.04938333206290029, 0.15881713845845086, 0.07591126008233443, 0.030527162482917102, 0.13209328184679606, 0.26616778657866197, 0.06328284498871432, 0.157943012634869, -0.1557683587477006, -0.052379952161572874, -0.2602796976807348, -0.06357894402214793, -0.22155469675255268, -0.016952745061173332, -0.13527849270673503, -0.16847019005793756, 0.3656334065959841, 0.17466372359180019, 0.24985212806451518, 0.16716244203619998, 0.33741322605100077, 0.0462859405080113, 0.1564917806299583, 0.11304907774467607, 0.2206430830348633, 0.04996991209770898, 0.07912695049520979, -0.1543697043638771, 0.10982889482390423, 0.056184050128298815]
|
1,803.05599
|
Calculation of interatomic forces and optimization of molecular geometry
with auxiliary-field quantum Monte Carlo
|
We propose an algorithm for accurate, systematic and scalable computation of
interatomic forces within the auxiliary-field Quantum Monte Carlo (AFQMC)
method. The algorithm relies on the Hellman-Fenyman theorem, and incorporates
Pulay corrections in the presence of atomic orbital basis sets. We benchmark
the method for small molecules by comparing the computed forces with the
derivatives of the AFQMC potential energy surface, and by direct comparison
with other quantum chemistry methods. We then perform geometry optimizations
using the steepest descent algorithm in larger molecules. With realistic basis
sets, we obtain equilibrium geometries in agreement, within statistical error
bars, with experimental values. The increase in computational cost for
computing forces in this approach is only a small prefactor over that of
calculating the total energy. This paves the way for a general and efficient
approach for geometry optimization and molecular dynamics within AFQMC.
|
physics.comp-ph
|
we propose an algorithm for accurate systematic and scalable computation of interatomic forces within the auxiliaryfield quantum monte carlo afqmc method the algorithm relies on the hellmanfenyman theorem and incorporates pulay corrections in the presence of atomic orbital basis sets we benchmark the method for small molecules by comparing the computed forces with the derivatives of the afqmc potential energy surface and by direct comparison with other quantum chemistry methods we then perform geometry optimizations using the steepest descent algorithm in larger molecules with realistic basis sets we obtain equilibrium geometries in agreement within statistical error bars with experimental values the increase in computational cost for computing forces in this approach is only a small prefactor over that of calculating the total energy this paves the way for a general and efficient approach for geometry optimization and molecular dynamics within afqmc
|
[['we', 'propose', 'an', 'algorithm', 'for', 'accurate', 'systematic', 'and', 'scalable', 'computation', 'of', 'interatomic', 'forces', 'within', 'the', 'auxiliaryfield', 'quantum', 'monte', 'carlo', 'afqmc', 'method', 'the', 'algorithm', 'relies', 'on', 'the', 'hellmanfenyman', 'theorem', 'and', 'incorporates', 'pulay', 'corrections', 'in', 'the', 'presence', 'of', 'atomic', 'orbital', 'basis', 'sets', 'we', 'benchmark', 'the', 'method', 'for', 'small', 'molecules', 'by', 'comparing', 'the', 'computed', 'forces', 'with', 'the', 'derivatives', 'of', 'the', 'afqmc', 'potential', 'energy', 'surface', 'and', 'by', 'direct', 'comparison', 'with', 'other', 'quantum', 'chemistry', 'methods', 'we', 'then', 'perform', 'geometry', 'optimizations', 'using', 'the', 'steepest', 'descent', 'algorithm', 'in', 'larger', 'molecules', 'with', 'realistic', 'basis', 'sets', 'we', 'obtain', 'equilibrium', 'geometries', 'in', 'agreement', 'within', 'statistical', 'error', 'bars', 'with', 'experimental', 'values', 'the', 'increase', 'in', 'computational', 'cost', 'for', 'computing', 'forces', 'in', 'this', 'approach', 'is', 'only', 'a', 'small', 'prefactor', 'over', 'that', 'of', 'calculating', 'the', 'total', 'energy', 'this', 'paves', 'the', 'way', 'for', 'a', 'general', 'and', 'efficient', 'approach', 'for', 'geometry', 'optimization', 'and', 'molecular', 'dynamics', 'within', 'afqmc']]
|
[-0.07349575580696442, 0.04422455544710309, -0.10685028591293043, 0.07435358684493362, 0.023859726870432495, -0.11604628960069802, 0.07390981822474195, 0.4036508874169418, -0.2384111416160262, -0.35615367548806326, 0.013585961243370548, -0.24191432190792903, -0.13283465560151464, 0.24676885544987662, 0.002281555002679982, 0.1027499269886383, 0.11254610157837826, -0.05486552095306771, -0.12286455091130587, -0.22109333748397017, 0.2410955527306734, 0.101436350556157, 0.24968468622703638, 0.06391482616974307, 0.09568915781398703, 0.034027780574563495, -0.008529233528367644, 0.03717460706331102, -0.15631540113354275, 0.19660662180976943, 0.21926685488184117, 0.05768779905712498, 0.28023874647915364, -0.4719442052833204, -0.18821243961075587, 0.07440932244228732, 0.11500328305243913, 0.20830351899244956, -0.06534985242178663, -0.25279376765912664, 0.03521371407051837, -0.1669880556258639, -0.10556364952852683, -0.16793305901810526, 0.005352952111778515, 0.03980949219050152, -0.26585769329353104, 0.12638283775928097, -0.05623643263243139, 0.08572259900559272, -0.062154687967683586, -0.14668494597426615, 0.04321971164484109, 0.0710733280650207, -0.017403802757949702, 0.0489468894582907, 0.17297784450596998, -0.08388046637077683, -0.1318216391772564, 0.4007608107557254, -0.060915014531929046, -0.2354252327902941, 0.14562417723438037, -0.0738093359296077, -0.13748948951251805, 0.15951263686375958, 0.1669890085368284, 0.1568418074731848, -0.13333342375366816, 0.12218489399736947, 0.028695224810923847, 0.14302738912436844, -0.0015569751899290297, 0.008706057139819937, 0.14531599267419162, 0.1758232766329976, 0.07896579605128085, 0.1365549594400883, -0.10930857608992872, -0.18470139103010297, -0.27835992196508286, -0.15783357450678262, -0.217855752612065, -0.008171164730031575, -0.12024327182121591, -0.1662317578323252, 0.3473491733827229, 0.1821082063351891, 0.13679454553473208, 0.08388597526188407, 0.36678227010582176, 0.09329429174374257, 0.07459871214149254, 0.10379854971709263, 0.22089788305706212, 0.13001515302873615, 0.028204809331301865, -0.27072613620631664, 0.050589632375964096, 0.11015111109341628]
|
1,803.056
|
Cross-Layer Designs for Body-to-Body Networks: Adaptive CSMA/CA with
Distributed Routing
|
In this paper, we propose a novel adaptive carrier sense multiple access
scheme with collision avoidance (CSMA/CA) to perform efficient and reliable
data transfer with increased throughput across multiple coexisting wireless
body area networks (BANs) in a tiered architecture. We investigate the proposed
scheme using two distributed cross-layer optimized dynamic routing techniques,
i.e., shortest path routing (SPR) and cooperative multi-path routing (CMR). The
channel state information from the physical layer is passed on to the network
layer using an adaptive cross-layer carrier sensing mechanism between the
physical and MAC layer, which adjusts the carrier sense threshold (e.g., RSSI)
periodically based on the slowly-varying channel condition. An open-access
experimental dataset of 'everyday' mixed-activities is used for analyzing the
cross-layer optimization. Our proposed optimization using adaptive carrier
sensing performs better than static carrier sensing with CSMA/CA as it reduces
the continuous back-off duration and latency as well as significantly increases
the throughput (in successful packets/s) by more than 50%. Adaptive CSMA/CA
also shows 20% and 6% improvement over a coordinated TDMA approach with higher
duty cycle for throughput and spectral efficiency, respectively, and provides
acceptable packet delivery ratio and outage probability with respect to SINR.
|
cs.NI
|
in this paper we propose a novel adaptive carrier sense multiple access scheme with collision avoidance csmaca to perform efficient and reliable data transfer with increased throughput across multiple coexisting wireless body area networks bans in a tiered architecture we investigate the proposed scheme using two distributed crosslayer optimized dynamic routing techniques ie shortest path routing spr and cooperative multipath routing cmr the channel state information from the physical layer is passed on to the network layer using an adaptive crosslayer carrier sensing mechanism between the physical and mac layer which adjusts the carrier sense threshold eg rssi periodically based on the slowlyvarying channel condition an openaccess experimental dataset of everyday mixedactivities is used for analyzing the crosslayer optimization our proposed optimization using adaptive carrier sensing performs better than static carrier sensing with csmaca as it reduces the continuous backoff duration and latency as well as significantly increases the throughput in successful packetss by more than 50 adaptive csmaca also shows 20 and 6 improvement over a coordinated tdma approach with higher duty cycle for throughput and spectral efficiency respectively and provides acceptable packet delivery ratio and outage probability with respect to sinr
|
[['in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'adaptive', 'carrier', 'sense', 'multiple', 'access', 'scheme', 'with', 'collision', 'avoidance', 'csmaca', 'to', 'perform', 'efficient', 'and', 'reliable', 'data', 'transfer', 'with', 'increased', 'throughput', 'across', 'multiple', 'coexisting', 'wireless', 'body', 'area', 'networks', 'bans', 'in', 'a', 'tiered', 'architecture', 'we', 'investigate', 'the', 'proposed', 'scheme', 'using', 'two', 'distributed', 'crosslayer', 'optimized', 'dynamic', 'routing', 'techniques', 'ie', 'shortest', 'path', 'routing', 'spr', 'and', 'cooperative', 'multipath', 'routing', 'cmr', 'the', 'channel', 'state', 'information', 'from', 'the', 'physical', 'layer', 'is', 'passed', 'on', 'to', 'the', 'network', 'layer', 'using', 'an', 'adaptive', 'crosslayer', 'carrier', 'sensing', 'mechanism', 'between', 'the', 'physical', 'and', 'mac', 'layer', 'which', 'adjusts', 'the', 'carrier', 'sense', 'threshold', 'eg', 'rssi', 'periodically', 'based', 'on', 'the', 'slowlyvarying', 'channel', 'condition', 'an', 'openaccess', 'experimental', 'dataset', 'of', 'everyday', 'mixedactivities', 'is', 'used', 'for', 'analyzing', 'the', 'crosslayer', 'optimization', 'our', 'proposed', 'optimization', 'using', 'adaptive', 'carrier', 'sensing', 'performs', 'better', 'than', 'static', 'carrier', 'sensing', 'with', 'csmaca', 'as', 'it', 'reduces', 'the', 'continuous', 'backoff', 'duration', 'and', 'latency', 'as', 'well', 'as', 'significantly', 'increases', 'the', 'throughput', 'in', 'successful', 'packetss', 'by', 'more', 'than', '50', 'adaptive', 'csmaca', 'also', 'shows', '20', 'and', '6', 'improvement', 'over', 'a', 'coordinated', 'tdma', 'approach', 'with', 'higher', 'duty', 'cycle', 'for', 'throughput', 'and', 'spectral', 'efficiency', 'respectively', 'and', 'provides', 'acceptable', 'packet', 'delivery', 'ratio', 'and', 'outage', 'probability', 'with', 'respect', 'to', 'sinr']]
|
[-0.22829924601016197, 0.021493758914857608, -0.02764183437587538, -0.010751933227462965, -0.04332440013968153, -0.2545965895612123, 0.1555364972573443, 0.4776139648359579, -0.2590205401744849, -0.31636998724722315, 0.045804606440772964, -0.21207533821022176, -0.19227239335305057, 0.14988270966083897, -0.15115801910906157, 0.12382139402325265, 0.06369195584132588, 0.012755209059226521, -0.014684150707277391, -0.22019035618480606, 0.23260231672187123, 0.17487026546829534, 0.40579520218792214, 0.03882594323992331, 0.10987256690411111, 0.0938198835865478, -0.019572561597063515, -0.043929915084542394, -0.08076258935883136, 0.09643079153102008, 0.30360663036238594, 0.15799024176764456, 0.2894227345022955, -0.42843554833477054, -0.30138714797309757, 0.01762080572855969, 0.20267655078616068, 0.028057462883301316, -0.053193545772122285, -0.25306474970663356, 0.14585769975322668, -0.2630290038165792, 0.0036341912406593715, -0.002678671524336096, -0.06506033936602762, 0.03625950360280209, -0.34798645159753505, 0.04613923262922981, -0.05441754402575801, 0.03522701644033077, -0.08708447571855989, -0.10547648002102505, 0.03328818244578239, 0.14249774603134333, -0.027706222721462836, 0.02778233728046568, 0.18633095290230509, -0.07089409162775458, -0.14529376353008652, 0.3539426564311725, -0.015114026201899833, -0.17272560691829617, 0.17205632495764198, 0.012602464657296272, -0.041207618296690875, 0.1937300501461626, 0.21955569651860665, 0.09663600209508634, -0.17850717299006646, -0.047902626292246474, 0.017467881178163225, 0.20139689752007447, 0.10997230226227354, 0.14856717255982707, 0.09456619552342242, 0.27569642980233766, 0.19161305265151896, 0.10252409313943645, -0.14367281475521546, -0.13983287243900122, -0.149489186268814, -0.09101632114955767, -0.1744639951581727, 0.00041221347358562827, -0.15265730649783413, -0.08644125983119011, 0.37409850275810186, 0.1788989315091385, 0.1549984476823738, 0.12979254166733276, 0.4184153303406977, 0.0775881271219987, 0.06524337097713821, 0.15877105619680756, 0.175798292336367, 0.0448542144986277, 0.20198523565704818, -0.22985977842048064, 0.09891871585326346, 0.001839208753760128]
|
1,803.05601
|
Planning and Navigation of Climbing Robots in Low-Gravity Environments
|
Advances in planetary robotics have led to wheeled robots that have beamed
back invaluable science data from the surface of the Moon and Mars. However,
these large wheeled robots are unable to access rugged environments such as
cliffs, canyons and crater walls that contain exposed rock-faces and are
geological time-capsules into the early Moon and Mars. We have proposed the
SphereX robot with a mass of 3 kg, 30 cm diameter that can hop, roll and fly
short distances. A single robot may slip and fall, however, a multirobot system
can work cooperatively by being interlinked using spring-tethers and work much
like a team of mountaineers to systematically climb a slope. We consider a team
of four or more robots that are interlinked with tethers in an 'x'
configuration. Each robot secures itself to a slope using spiny gripping
actuators, and one by one each robot moves upwards by crawling, rolling or
hopping up the slope. In this paper, we present a human devised autonomous
climbing algorithm and evaluate it using a high-fidelity dynamics simulator.
The climbing surfaces contain impassable obstacles and some loosely held rocks
that can dislodge. Under these conditions, the robots need to autonomously map,
plan and navigate up or down these steep environments. Autonomous mapping and
navigation capability is evaluated using simulated lasers, vision sensors. The
human devised planning algorithm uses a new algorithm called bounded-leg A*.
Our early simulation results show much promise in these techniques and our
future plans include demonstration on real robots in a controlled laboratory
environment and outdoors in the canyons of Arizona.
|
cs.RO
|
advances in planetary robotics have led to wheeled robots that have beamed back invaluable science data from the surface of the moon and mars however these large wheeled robots are unable to access rugged environments such as cliffs canyons and crater walls that contain exposed rockfaces and are geological timecapsules into the early moon and mars we have proposed the spherex robot with a mass of 3 kg 30 cm diameter that can hop roll and fly short distances a single robot may slip and fall however a multirobot system can work cooperatively by being interlinked using springtethers and work much like a team of mountaineers to systematically climb a slope we consider a team of four or more robots that are interlinked with tethers in an x configuration each robot secures itself to a slope using spiny gripping actuators and one by one each robot moves upwards by crawling rolling or hopping up the slope in this paper we present a human devised autonomous climbing algorithm and evaluate it using a highfidelity dynamics simulator the climbing surfaces contain impassable obstacles and some loosely held rocks that can dislodge under these conditions the robots need to autonomously map plan and navigate up or down these steep environments autonomous mapping and navigation capability is evaluated using simulated lasers vision sensors the human devised planning algorithm uses a new algorithm called boundedleg a our early simulation results show much promise in these techniques and our future plans include demonstration on real robots in a controlled laboratory environment and outdoors in the canyons of arizona
|
[['advances', 'in', 'planetary', 'robotics', 'have', 'led', 'to', 'wheeled', 'robots', 'that', 'have', 'beamed', 'back', 'invaluable', 'science', 'data', 'from', 'the', 'surface', 'of', 'the', 'moon', 'and', 'mars', 'however', 'these', 'large', 'wheeled', 'robots', 'are', 'unable', 'to', 'access', 'rugged', 'environments', 'such', 'as', 'cliffs', 'canyons', 'and', 'crater', 'walls', 'that', 'contain', 'exposed', 'rockfaces', 'and', 'are', 'geological', 'timecapsules', 'into', 'the', 'early', 'moon', 'and', 'mars', 'we', 'have', 'proposed', 'the', 'spherex', 'robot', 'with', 'a', 'mass', 'of', '3', 'kg', '30', 'cm', 'diameter', 'that', 'can', 'hop', 'roll', 'and', 'fly', 'short', 'distances', 'a', 'single', 'robot', 'may', 'slip', 'and', 'fall', 'however', 'a', 'multirobot', 'system', 'can', 'work', 'cooperatively', 'by', 'being', 'interlinked', 'using', 'springtethers', 'and', 'work', 'much', 'like', 'a', 'team', 'of', 'mountaineers', 'to', 'systematically', 'climb', 'a', 'slope', 'we', 'consider', 'a', 'team', 'of', 'four', 'or', 'more', 'robots', 'that', 'are', 'interlinked', 'with', 'tethers', 'in', 'an', 'x', 'configuration', 'each', 'robot', 'secures', 'itself', 'to', 'a', 'slope', 'using', 'spiny', 'gripping', 'actuators', 'and', 'one', 'by', 'one', 'each', 'robot', 'moves', 'upwards', 'by', 'crawling', 'rolling', 'or', 'hopping', 'up', 'the', 'slope', 'in', 'this', 'paper', 'we', 'present', 'a', 'human', 'devised', 'autonomous', 'climbing', 'algorithm', 'and', 'evaluate', 'it', 'using', 'a', 'highfidelity', 'dynamics', 'simulator', 'the', 'climbing', 'surfaces', 'contain', 'impassable', 'obstacles', 'and', 'some', 'loosely', 'held', 'rocks', 'that', 'can', 'dislodge', 'under', 'these', 'conditions', 'the', 'robots', 'need', 'to', 'autonomously', 'map', 'plan', 'and', 'navigate', 'up', 'or', 'down', 'these', 'steep', 'environments', 'autonomous', 'mapping', 'and', 'navigation', 'capability', 'is', 'evaluated', 'using', 'simulated', 'lasers', 'vision', 'sensors', 'the', 'human', 'devised', 'planning', 'algorithm', 'uses', 'a', 'new', 'algorithm', 'called', 'boundedleg', 'a', 'our', 'early', 'simulation', 'results', 'show', 'much', 'promise', 'in', 'these', 'techniques', 'and', 'our', 'future', 'plans', 'include', 'demonstration', 'on', 'real', 'robots', 'in', 'a', 'controlled', 'laboratory', 'environment', 'and', 'outdoors', 'in', 'the', 'canyons', 'of', 'arizona']]
|
[-0.10193182814187743, 0.15143783598218036, -0.10357073069176843, -0.006321705483237158, -0.1169659664839912, -0.16909446499169103, 0.023356546639693096, 0.4383179036146646, -0.2159714286182989, -0.3859886978934102, 0.10657021908530266, -0.24247365502155013, -0.19127361267054968, 0.2256017313547186, -0.13517819921366495, 0.06381857760589396, 0.11884125118671122, -0.013272436220626481, 0.045259796615675495, -0.2260045073269631, 0.2060560317671992, 0.040662667830474675, 0.2031502378633398, 0.008356409838852556, 0.14764272440215825, -0.015063671515674733, 0.027504518484752914, 0.00947694782827209, -0.11238187683555628, 0.11628266757875971, 0.275816132461268, 0.1343307604973389, 0.2811844114210558, -0.4983783902506188, -0.19457565780623964, 0.08628739073332617, 0.12965151663654, 0.046329900240054504, -0.05069628779864498, -0.35593502430049595, 0.055309173864618685, -0.18140598754525358, -0.12763700073092074, -0.0336600118275942, 0.02034479874305804, 0.03859298312556404, -0.21729485357519066, -0.053687867539996416, 0.007338166155341419, 0.0976423371405656, -0.0850533083849496, -0.06406495971505527, -0.014279234822810507, 0.20706420435329195, -0.006291058008261895, 0.058760771680992925, 0.2428872767212558, -0.12396268349600995, -0.11226797355465765, 0.4108521480852528, 0.02834371103896535, -0.14931484673657827, 0.249585515531849, -0.10035814195037873, -0.11115865615026206, 0.14091719496168073, 0.2350993065167117, 0.11632046316286498, -0.16223557409105627, 0.023901772034419736, 0.004680201523585774, 0.13871570702747293, 0.09848405244390586, -0.09246045165211243, 0.24120394597536657, 0.20167133170415572, 0.13063313639070476, 0.08885744867161467, -0.10356912721702213, -0.0836491243395563, -0.2092058830500439, -0.14004576359947976, -0.13500007029698893, 0.002367920240438054, -0.05108870067830734, -0.09662386668657573, 0.32088177756577707, 0.18009156371051888, 0.16026356710113787, 0.07241980651763162, 0.330557875920464, -0.01924333133932261, 0.12296934202965712, 0.10502153204333631, 0.21270893263217905, -0.009798413205072864, 0.15705163402692143, -0.17591976603979592, 0.07612617980192346, -0.00542381222464927]
|
1,803.05602
|
Filling the gap between quantum no-cloning and classical duplication
|
The correspondence principle suggests that a quantum description for the
microworld should be naturally transited to a classical description within the
classical limit. However, it seems that there is a large gap between quantum
no-cloning and classical duplication. In this paper, we prove that a classical
duplication process can be realized using a universal quantum cloning machine.
In the classical world, information is encoded in a large number of quantum
states instead of one quantum state. When tolerable errors occur in a small
number of the quantum states, the fidelity of duplicated copies of classical
information can approach unity. That is, classical information duplication is
equivalent to a redundant quantum cloning process with self-correcting.
|
quant-ph
|
the correspondence principle suggests that a quantum description for the microworld should be naturally transited to a classical description within the classical limit however it seems that there is a large gap between quantum nocloning and classical duplication in this paper we prove that a classical duplication process can be realized using a universal quantum cloning machine in the classical world information is encoded in a large number of quantum states instead of one quantum state when tolerable errors occur in a small number of the quantum states the fidelity of duplicated copies of classical information can approach unity that is classical information duplication is equivalent to a redundant quantum cloning process with selfcorrecting
|
[['the', 'correspondence', 'principle', 'suggests', 'that', 'a', 'quantum', 'description', 'for', 'the', 'microworld', 'should', 'be', 'naturally', 'transited', 'to', 'a', 'classical', 'description', 'within', 'the', 'classical', 'limit', 'however', 'it', 'seems', 'that', 'there', 'is', 'a', 'large', 'gap', 'between', 'quantum', 'nocloning', 'and', 'classical', 'duplication', 'in', 'this', 'paper', 'we', 'prove', 'that', 'a', 'classical', 'duplication', 'process', 'can', 'be', 'realized', 'using', 'a', 'universal', 'quantum', 'cloning', 'machine', 'in', 'the', 'classical', 'world', 'information', 'is', 'encoded', 'in', 'a', 'large', 'number', 'of', 'quantum', 'states', 'instead', 'of', 'one', 'quantum', 'state', 'when', 'tolerable', 'errors', 'occur', 'in', 'a', 'small', 'number', 'of', 'the', 'quantum', 'states', 'the', 'fidelity', 'of', 'duplicated', 'copies', 'of', 'classical', 'information', 'can', 'approach', 'unity', 'that', 'is', 'classical', 'information', 'duplication', 'is', 'equivalent', 'to', 'a', 'redundant', 'quantum', 'cloning', 'process', 'with', 'selfcorrecting']]
|
[-0.1358331427746044, 0.18456159202328867, -0.11526542549887508, 0.09545914216081049, -0.023933426836472853, -0.1943912231608441, 0.09486419001794338, 0.273627514781414, -0.33601337418025523, -0.25644918642693054, 0.06934035490083165, -0.24024405823857115, -0.15659844037553852, 0.21426004949107505, -0.16123154721623123, 0.08767367472970172, 0.12052902941216241, 0.09864584421085422, -0.044429765679268984, -0.23105440117222698, 0.2773373860604407, 0.026381059219905485, 0.2881644322095733, 0.003968131773402555, 0.07959522770946487, 0.03476498192257918, 0.053153695819466454, 0.028296866960692824, -0.08390839096988968, 0.11555846424654878, 0.3270654288884416, 0.16136121970658565, 0.2823770887038687, -0.40452710320160057, -0.2125993700975781, 0.14130983986940823, 0.13125800945297733, 0.22300442237521342, -0.018360231680338058, -0.2626071541586466, 0.08745191716221407, -0.1868301931923876, -0.09689590847936638, -0.055294270369861474, -0.008376819277672391, -0.07989545997023877, -0.21928997450148718, 0.09331608383115708, 0.12040955392978758, 0.04092368707796069, 0.0595252376066096, -0.0040320234267008405, 0.03548539373533506, 0.12620591665051362, -0.05641758086603021, 0.03845056482660176, 0.14673263761378302, -0.14569079547328057, -0.2163927828803201, 0.35732359475080383, -0.005424541614238957, -0.20335800712111227, 0.16778637255590997, -0.09732465758887038, -0.11455591743517864, 0.09569291841737076, 0.07006376451126446, 0.05607854926615561, -0.13147894059281834, 0.10768913506814115, -0.04863806782911221, 0.20864989213122612, 0.06808146822323467, 0.12638278466469624, 0.23656953317358306, 0.10250873606153682, 0.027902300886221622, 0.17054631599233272, -0.048088972026833515, -0.24957808868943207, -0.33116969100215976, -0.229098194646404, -0.25328402037389186, 0.15705914938773372, -0.07406399651875274, -0.16714104094640597, 0.3086283391253745, 0.13388839986005782, 0.18994773705816714, 0.03146085791747298, 0.2998266092975411, 0.1204579853893895, 0.09335779424822122, 0.08863674130356103, 0.20035776188760474, 0.12756212192930674, 0.03857721873608075, -0.19315782905017076, 0.06019216945002738, 0.03549784000374769]
|
1,803.05603
|
Giant thermal hysteresis in Verwey transition of single domain Fe3O4
nanoparticles
|
Most interesting phenomena of condensed matter physics originate from
interactions among different degrees of freedom, making it a very intriguing
yet challenging question how certain ground states emerge from only a limited
number of atoms in assembly. This is especially the case for strongly
correlated electron systems with overwhelming complexity. The Verwey transition
of Fe3O4 is a classic example of this category, of which the origin is still
elusive 80 years after the first report. Here we report, for the first time,
that the Verwey transition of Fe3O4 nanoparticles exhibits size-dependent
thermal hysteresis in magnetization, 57Fe NMR, and XRD measurements. The
hysteresis width passes a maximum of 11 K when the size is 120 nm while
dropping to only 1 K for the bulk sample. This behavior is very similar to that
of magnetic coercivity and the critical sizes of the hysteresis and the
magnetic single domain are identical. We interpret it as a manifestation of
charge ordering and spin ordering correlation in a single domain. This work
paves a new way of undertaking researches in the vibrant field of strongly
correlated electron physics combined with nanoscience.
|
cond-mat.str-el
|
most interesting phenomena of condensed matter physics originate from interactions among different degrees of freedom making it a very intriguing yet challenging question how certain ground states emerge from only a limited number of atoms in assembly this is especially the case for strongly correlated electron systems with overwhelming complexity the verwey transition of fe3o4 is a classic example of this category of which the origin is still elusive 80 years after the first report here we report for the first time that the verwey transition of fe3o4 nanoparticles exhibits sizedependent thermal hysteresis in magnetization 57fe nmr and xrd measurements the hysteresis width passes a maximum of 11 k when the size is 120 nm while dropping to only 1 k for the bulk sample this behavior is very similar to that of magnetic coercivity and the critical sizes of the hysteresis and the magnetic single domain are identical we interpret it as a manifestation of charge ordering and spin ordering correlation in a single domain this work paves a new way of undertaking researches in the vibrant field of strongly correlated electron physics combined with nanoscience
|
[['most', 'interesting', 'phenomena', 'of', 'condensed', 'matter', 'physics', 'originate', 'from', 'interactions', 'among', 'different', 'degrees', 'of', 'freedom', 'making', 'it', 'a', 'very', 'intriguing', 'yet', 'challenging', 'question', 'how', 'certain', 'ground', 'states', 'emerge', 'from', 'only', 'a', 'limited', 'number', 'of', 'atoms', 'in', 'assembly', 'this', 'is', 'especially', 'the', 'case', 'for', 'strongly', 'correlated', 'electron', 'systems', 'with', 'overwhelming', 'complexity', 'the', 'verwey', 'transition', 'of', 'fe3o4', 'is', 'a', 'classic', 'example', 'of', 'this', 'category', 'of', 'which', 'the', 'origin', 'is', 'still', 'elusive', '80', 'years', 'after', 'the', 'first', 'report', 'here', 'we', 'report', 'for', 'the', 'first', 'time', 'that', 'the', 'verwey', 'transition', 'of', 'fe3o4', 'nanoparticles', 'exhibits', 'sizedependent', 'thermal', 'hysteresis', 'in', 'magnetization', '57fe', 'nmr', 'and', 'xrd', 'measurements', 'the', 'hysteresis', 'width', 'passes', 'a', 'maximum', 'of', '11', 'k', 'when', 'the', 'size', 'is', '120', 'nm', 'while', 'dropping', 'to', 'only', '1', 'k', 'for', 'the', 'bulk', 'sample', 'this', 'behavior', 'is', 'very', 'similar', 'to', 'that', 'of', 'magnetic', 'coercivity', 'and', 'the', 'critical', 'sizes', 'of', 'the', 'hysteresis', 'and', 'the', 'magnetic', 'single', 'domain', 'are', 'identical', 'we', 'interpret', 'it', 'as', 'a', 'manifestation', 'of', 'charge', 'ordering', 'and', 'spin', 'ordering', 'correlation', 'in', 'a', 'single', 'domain', 'this', 'work', 'paves', 'a', 'new', 'way', 'of', 'undertaking', 'researches', 'in', 'the', 'vibrant', 'field', 'of', 'strongly', 'correlated', 'electron', 'physics', 'combined', 'with', 'nanoscience']]
|
[-0.14206295362848012, 0.22289185302660747, -0.05735663742102175, 0.025921685549550075, -0.06965724016878415, -0.13700500796275103, 0.08107419503867666, 0.3634070363592974, -0.26603155850898474, -0.351856228726154, 0.050475360163273336, -0.3006374917645505, -0.12440180966884574, 0.1831471503059813, 0.01822326194126418, 0.013140538894760617, 0.003221942341567719, 0.014244623260602435, -0.07424196808344939, -0.20817446879006643, 0.2726143609214435, 0.03272106781004888, 0.2880291723905201, 0.0850184600162793, 0.05962183731383978, -0.009738930174520608, 0.08061325486766842, 0.04959832994705614, -0.10675561955464159, 0.07897733587691969, 0.2620136545682177, 0.009365960877179542, 0.2403247283160298, -0.38912845217730363, -0.20779738437389347, 0.05108357881280509, 0.14096530139842195, 0.11982902849870011, -0.08895965295913505, -0.23014534963792896, 0.05279180494928982, -0.08493537093228835, -0.12278086767313419, -0.054678092086264354, 0.042113004135899246, -0.025322895994183314, -0.20782187812212097, 0.11384442949637691, 0.08225783437769361, 0.1210515144515165, -0.06742956603498741, -0.12061474282035535, 0.005427831978123775, 0.0959758315539488, 0.05613464484474358, 0.05248760517355413, 0.1669444580728009, -0.15279563642505378, -0.11233895989153583, 0.3851872125371573, -0.011565143851324278, -0.053873485480441415, 0.2039755876907157, -0.22433109985375627, -0.13497697647143017, 0.18939384243657742, 0.12139338257947917, 0.14225735456837132, -0.1526441327100875, 0.06906484768048606, -0.03693377789368923, 0.22212001400810472, 0.04709413981583109, 0.07275664555108086, 0.24462461130404695, 0.23386165499749448, 0.03399012827209849, 0.1598120826884188, -0.10783270932235979, -0.07605634159582822, -0.24666567979490056, -0.16621696747301576, -0.19725386520977167, 0.08469904199700783, -0.04391948175261714, -0.18615176726909563, 0.388508327529432, 0.16563556044932734, 0.19918701285247337, -0.02496881464827447, 0.24741627776467387, 0.04394540072040244, 0.05417758204730198, 0.026352554567178145, 0.25141717994680257, 0.18220403526267187, 0.1526989194796107, -0.2587324394421144, 0.09802590584491983, -0.05012831120019689]
|
1,803.05604
|
Stability Trend of Tilted Perovskites
|
Halide perovskites, with prototype cubic phase ABX3, undergo various phase
transitions accompanied by rigid rotations of corner-sharing BX6 octahedra.
Using first-principles density functional theory calculations, we have
performed a comprehensive investigation of all the possible octahedral tilting
in eighteen halide perovskites ABX3 (A = Cs, Rb, K; B= Pb, Sn; X= I, Br, Cl)
and found that the stabilization energies i.e. energy differences between cubic
and the most stable tilted phases, are linearly correlated with tolerance
factor t. Moreover, the tilt energies i.e. energy differences between cubic and
various tilted phases, are linearly correlated with the change of atomic
packing fractions ({\Delta}{\eta}), confirming the importance of atomic packing
fraction as part of stability descriptor (t+{\mu}){\eta}, proposed in our
previous work [JACS 139, 14905 (2017)]. We further demonstrate that
(t+{\mu}){\eta}remains the best stability descriptor for tilted perovskites
among descriptor candidates of {\eta}, {\mu}, t, and t+{\mu},extending
previously proposed stability trend from cubic phases to tilted phases in
general perovskites.
|
cond-mat.mtrl-sci
|
halide perovskites with prototype cubic phase abx3 undergo various phase transitions accompanied by rigid rotations of cornersharing bx6 octahedra using firstprinciples density functional theory calculations we have performed a comprehensive investigation of all the possible octahedral tilting in eighteen halide perovskites abx3 a cs rb k b pb sn x i br cl and found that the stabilization energies ie energy differences between cubic and the most stable tilted phases are linearly correlated with tolerance factor t moreover the tilt energies ie energy differences between cubic and various tilted phases are linearly correlated with the change of atomic packing fractions deltaeta confirming the importance of atomic packing fraction as part of stability descriptor tmueta proposed in our previous work jacs 139 14905 2017 we further demonstrate that tmuetaremains the best stability descriptor for tilted perovskites among descriptor candidates of eta mu t and tmuextending previously proposed stability trend from cubic phases to tilted phases in general perovskites
|
[['halide', 'perovskites', 'with', 'prototype', 'cubic', 'phase', 'abx3', 'undergo', 'various', 'phase', 'transitions', 'accompanied', 'by', 'rigid', 'rotations', 'of', 'cornersharing', 'bx6', 'octahedra', 'using', 'firstprinciples', 'density', 'functional', 'theory', 'calculations', 'we', 'have', 'performed', 'a', 'comprehensive', 'investigation', 'of', 'all', 'the', 'possible', 'octahedral', 'tilting', 'in', 'eighteen', 'halide', 'perovskites', 'abx3', 'a', 'cs', 'rb', 'k', 'b', 'pb', 'sn', 'x', 'i', 'br', 'cl', 'and', 'found', 'that', 'the', 'stabilization', 'energies', 'ie', 'energy', 'differences', 'between', 'cubic', 'and', 'the', 'most', 'stable', 'tilted', 'phases', 'are', 'linearly', 'correlated', 'with', 'tolerance', 'factor', 't', 'moreover', 'the', 'tilt', 'energies', 'ie', 'energy', 'differences', 'between', 'cubic', 'and', 'various', 'tilted', 'phases', 'are', 'linearly', 'correlated', 'with', 'the', 'change', 'of', 'atomic', 'packing', 'fractions', 'deltaeta', 'confirming', 'the', 'importance', 'of', 'atomic', 'packing', 'fraction', 'as', 'part', 'of', 'stability', 'descriptor', 'tmueta', 'proposed', 'in', 'our', 'previous', 'work', 'jacs', '139', '14905', '2017', 'we', 'further', 'demonstrate', 'that', 'tmuetaremains', 'the', 'best', 'stability', 'descriptor', 'for', 'tilted', 'perovskites', 'among', 'descriptor', 'candidates', 'of', 'eta', 'mu', 't', 'and', 'tmuextending', 'previously', 'proposed', 'stability', 'trend', 'from', 'cubic', 'phases', 'to', 'tilted', 'phases', 'in', 'general', 'perovskites']]
|
[-0.1560586818806386, 0.1945674251274843, -0.0003210700233466923, -0.05171087487925481, 0.017612347229212327, -0.16132067278713771, 0.11673024060177054, 0.4387025194071037, -0.2579461844679348, -0.28246950334869325, -0.01705488815557481, -0.30976410261600423, -0.16034710471285507, 0.08654370389137368, 0.016055231216964068, 0.027055444230331648, 0.0014953593674458955, -0.06752828912775792, -0.14479199036194537, -0.24667008337564766, 0.19812172977100617, 0.045977788876610394, 0.2894567868359828, 0.0035234364546149186, 9.012250857746327e-05, -0.0435081027282745, 0.07259602419799194, 0.06921514130418042, -0.20226154936598936, 0.090564311141957, 0.2569170113711152, -0.024977806352054405, 0.17002447015654884, -0.3796588646088678, -0.17416991640072266, 0.05436679148299031, 0.08907661636629582, 0.05209626844244715, -0.10837130788346067, -0.2560317927089177, 0.06204509404855535, -0.1550162361684335, -0.12320643213369246, -0.11494639377403808, 0.04994877342955748, 0.06685032766606462, -0.2380438278318922, 0.12551070643147746, 0.03805499316015477, 0.12118877524522088, -0.14455880788246808, -0.21160195845847116, -0.11985196322692852, 0.0007289390624990981, 0.04212746200592894, 0.06563555279832431, 0.13194606147436916, -0.04757676429825982, -0.10626700463533205, 0.4356431889127156, -0.018394673218656527, -0.07730084106074891, 0.1766051712758398, -0.1923158074775864, -0.1627039285836202, 0.20869841741851383, 0.11398875786261142, 0.122915245635484, -0.08230825646559854, 0.09241548537638185, 0.0006298227570751854, 0.20567477929197545, 0.09038306151725058, 0.08018133111794382, 0.20589445350618152, 0.15941552111364313, 0.027383874746431645, 0.1206953416449802, -0.12344445987592305, -0.10645468177551122, -0.21820448764437492, -0.13790157101864584, -0.12987192081575477, 2.508188213381034e-05, -0.1223469778652591, -0.1607210598426479, 0.3635994105946003, 0.04485917017537806, 0.17486965644638985, -0.04628139153417004, 0.20232817776942333, 0.014261471949315532, 0.062179861938363355, -0.0028285667557563436, 0.2760151388417733, 0.1747561825767135, 0.07508977073609314, -0.24537982416529158, 0.06465552885416209, 0.06843699829646778]
|
1,803.05605
|
Reconstructing Gaussian sources by spatial sampling
|
Consider a Gaussian memoryless multiple source with $m$ components with joint
probability distribution known only to lie in a given class of distributions. A
subset of $k \leq m$ components are sampled and compressed with the objective
of reconstructing all the $m$ components within a specified level of distortion
under a mean-squared error criterion. In Bayesian and nonBayesian settings, the
notion of universal sampling rate distortion function for Gaussian sources is
introduced to capture the optimal tradeoffs among sampling, compression rate
and distortion level. Single-letter characterizations are provided for the
universal sampling rate distortion function. Our achievability proofs highlight
the following structural property: it is optimal to compress and reconstruct
first the sampled components of the GMMS alone, and then form estimates for the
unsampled components based on the former.
|
cs.IT cs.LG math.IT
|
consider a gaussian memoryless multiple source with m components with joint probability distribution known only to lie in a given class of distributions a subset of k leq m components are sampled and compressed with the objective of reconstructing all the m components within a specified level of distortion under a meansquared error criterion in bayesian and nonbayesian settings the notion of universal sampling rate distortion function for gaussian sources is introduced to capture the optimal tradeoffs among sampling compression rate and distortion level singleletter characterizations are provided for the universal sampling rate distortion function our achievability proofs highlight the following structural property it is optimal to compress and reconstruct first the sampled components of the gmms alone and then form estimates for the unsampled components based on the former
|
[['consider', 'a', 'gaussian', 'memoryless', 'multiple', 'source', 'with', 'm', 'components', 'with', 'joint', 'probability', 'distribution', 'known', 'only', 'to', 'lie', 'in', 'a', 'given', 'class', 'of', 'distributions', 'a', 'subset', 'of', 'k', 'leq', 'm', 'components', 'are', 'sampled', 'and', 'compressed', 'with', 'the', 'objective', 'of', 'reconstructing', 'all', 'the', 'm', 'components', 'within', 'a', 'specified', 'level', 'of', 'distortion', 'under', 'a', 'meansquared', 'error', 'criterion', 'in', 'bayesian', 'and', 'nonbayesian', 'settings', 'the', 'notion', 'of', 'universal', 'sampling', 'rate', 'distortion', 'function', 'for', 'gaussian', 'sources', 'is', 'introduced', 'to', 'capture', 'the', 'optimal', 'tradeoffs', 'among', 'sampling', 'compression', 'rate', 'and', 'distortion', 'level', 'singleletter', 'characterizations', 'are', 'provided', 'for', 'the', 'universal', 'sampling', 'rate', 'distortion', 'function', 'our', 'achievability', 'proofs', 'highlight', 'the', 'following', 'structural', 'property', 'it', 'is', 'optimal', 'to', 'compress', 'and', 'reconstruct', 'first', 'the', 'sampled', 'components', 'of', 'the', 'gmms', 'alone', 'and', 'then', 'form', 'estimates', 'for', 'the', 'unsampled', 'components', 'based', 'on', 'the', 'former']]
|
[-0.12868137731924295, 0.06172826034375108, -0.07214904963397063, 0.08094063405699742, -0.05307501754723489, -0.15938420780361273, 0.10671038133307145, 0.3934629450265605, -0.3244169705045911, -0.2626401299324173, 0.09360875085784266, -0.2379457302391529, -0.10336661375342654, 0.17212967312975358, -0.08676671737697549, 0.06638991398951755, 0.009626479351964708, 0.054969307094310915, -0.07978744329884649, -0.26360424290805196, 0.2998059839081879, 0.06656687367850771, 0.29570653912109823, -0.04856757989305501, 0.14790427021658756, 0.03703122534789145, -0.04084338705198696, -0.031876979216646686, -0.17253878287111338, 0.12523153628437564, 0.2609776468625149, 0.19205334758242734, 0.272817270239242, -0.2973834997616135, -0.23735943351012584, 0.13902077115266226, 0.10246447996021463, 0.039176831817111145, -0.027276948041533335, -0.24823608222202612, 0.12335113695500276, -0.10931728846178605, -0.04415919428977829, -0.02289447942390465, -0.008771452289791062, 0.07553865086788741, -0.36856331980357376, 0.09175541119900747, 0.08073118446538081, 0.022366283242948926, -0.07729685697704554, -0.16641021519541166, 0.02353615669820171, 0.14045317721768066, 0.0052656341693364086, 0.05018626448850577, 0.11536119755787345, -0.09211289848272618, -0.07166778191727084, 0.3126741021871567, -0.032207778891405234, -0.24948609614601502, 0.13330783142815703, -0.14498258028179406, -0.13465749711657946, 0.15265722071680313, 0.1936805552462689, 0.09352280865781583, -0.1691969403782143, 0.06371738638934822, -0.02231849368948203, 0.17680597793884, 0.08814876022426268, 0.0884269840657138, 0.13764554678390806, 0.11404597585519347, 0.10569909382538753, 0.16225947766708068, -0.11519491105304601, -0.09238940151766516, -0.32843345114647843, -0.09807778532401873, -0.24222481813586244, 0.004021724573417137, -0.12822620317355568, -0.14772488146330803, 0.35151984645591045, 0.09079230915790854, 0.22450394549478705, 0.1575618045261273, 0.3112135385028803, 0.08353363547492056, 0.004868877998468144, 0.1301599811655111, 0.15562798870154299, 0.1741634038903822, -0.029263012783709342, -0.13960846476256847, 0.12128137507690834, 0.04619855203021031]
|
1,803.05606
|
Securely Solving the Distributed Graph Coloring Problem
|
Combinatorial optimization is a fundamental problem found in many fields. In
many real life situations, the constraints and the objective function forming
the optimization problem are naturally distributed amongst different sites in
some fashion. A typical approach for solving such problem is to collect all of
this information together and centrally solve the problem. However, this
requires all parties to completely share their information, which may lead to
serious privacy issues. Thus, it is desirable to propose a privacy preserving
technique that can securely solve specific combinatorial optimization problems.
A further complicating factor is that combinatorial optimization problems are
typically NP-hard, requiring approximation algorithms or heuristics to provide
a practical solution. In this paper, we focus on a very well-known hard problem
-- the distributed graph coloring problem, which has been utilized to model
many real world problems in scheduling and resource allocation. We propose
efficient protocols to securely solve such fundamental problem. We analyze the
security of our approach and experimentally demonstrate the effectiveness of
our approach.
|
cs.CR
|
combinatorial optimization is a fundamental problem found in many fields in many real life situations the constraints and the objective function forming the optimization problem are naturally distributed amongst different sites in some fashion a typical approach for solving such problem is to collect all of this information together and centrally solve the problem however this requires all parties to completely share their information which may lead to serious privacy issues thus it is desirable to propose a privacy preserving technique that can securely solve specific combinatorial optimization problems a further complicating factor is that combinatorial optimization problems are typically nphard requiring approximation algorithms or heuristics to provide a practical solution in this paper we focus on a very wellknown hard problem the distributed graph coloring problem which has been utilized to model many real world problems in scheduling and resource allocation we propose efficient protocols to securely solve such fundamental problem we analyze the security of our approach and experimentally demonstrate the effectiveness of our approach
|
[['combinatorial', 'optimization', 'is', 'a', 'fundamental', 'problem', 'found', 'in', 'many', 'fields', 'in', 'many', 'real', 'life', 'situations', 'the', 'constraints', 'and', 'the', 'objective', 'function', 'forming', 'the', 'optimization', 'problem', 'are', 'naturally', 'distributed', 'amongst', 'different', 'sites', 'in', 'some', 'fashion', 'a', 'typical', 'approach', 'for', 'solving', 'such', 'problem', 'is', 'to', 'collect', 'all', 'of', 'this', 'information', 'together', 'and', 'centrally', 'solve', 'the', 'problem', 'however', 'this', 'requires', 'all', 'parties', 'to', 'completely', 'share', 'their', 'information', 'which', 'may', 'lead', 'to', 'serious', 'privacy', 'issues', 'thus', 'it', 'is', 'desirable', 'to', 'propose', 'a', 'privacy', 'preserving', 'technique', 'that', 'can', 'securely', 'solve', 'specific', 'combinatorial', 'optimization', 'problems', 'a', 'further', 'complicating', 'factor', 'is', 'that', 'combinatorial', 'optimization', 'problems', 'are', 'typically', 'nphard', 'requiring', 'approximation', 'algorithms', 'or', 'heuristics', 'to', 'provide', 'a', 'practical', 'solution', 'in', 'this', 'paper', 'we', 'focus', 'on', 'a', 'very', 'wellknown', 'hard', 'problem', 'the', 'distributed', 'graph', 'coloring', 'problem', 'which', 'has', 'been', 'utilized', 'to', 'model', 'many', 'real', 'world', 'problems', 'in', 'scheduling', 'and', 'resource', 'allocation', 'we', 'propose', 'efficient', 'protocols', 'to', 'securely', 'solve', 'such', 'fundamental', 'problem', 'we', 'analyze', 'the', 'security', 'of', 'our', 'approach', 'and', 'experimentally', 'demonstrate', 'the', 'effectiveness', 'of', 'our', 'approach']]
|
[-0.12764070510326098, -0.035515084070806016, -0.08054878341290586, 0.1030858028436102, -0.1452652647990934, -0.19658126589747335, 0.06888375943596335, 0.41881349162075915, -0.3562678716195647, -0.3723395129799575, 0.1396760404253557, -0.23327493285035303, -0.18830792250496498, 0.18996925120838656, -0.15559701253743674, 0.1241250940024139, 0.07622435522784372, -0.0018783249307777956, -0.01261604762961844, -0.2988984977729231, 0.3101118098523378, -0.009431286900399063, 0.285452941081258, 0.09172389863203921, 0.08787723132869239, -0.0073298282620168015, 0.004439428970803267, 0.03778069296957713, -0.06609771329769099, 0.15336941414180527, 0.3576450643246759, 0.23666679157741635, 0.3759245971095062, -0.4212725145106544, -0.20152457856815756, 0.16894320355070208, 0.18803104831876155, 0.11421081950904768, -0.06460033059412959, -0.21252583000742034, 0.09322743619998504, -0.12476619818905915, -0.05286993965238868, -0.09212178924583836, -0.03247430562013816, -0.03268672574191594, -0.28964447646686237, 0.028894024103612245, -0.005414335773058771, -0.02453923998344801, -0.051270866220047374, -0.09624939104179646, 0.10366921751720909, 0.12534655751744117, 0.05171243753371353, 0.002758187193055442, 0.11228991083767333, -0.11634529024658133, -0.1862216235032517, 0.4453385797786543, 0.10012578858309397, -0.24207514432442936, 0.1805297559166249, -0.010392845867614367, -0.21921304714849252, 0.10715662898400988, 0.2182013583118598, 0.17708091100978995, -0.19232255338431856, 0.0678206268840185, -0.08210814667274495, 0.14985592904762773, 0.0275847567301132, 0.04206720025774961, 0.16161842937413937, 0.16590440267708131, 0.15215743888444183, 0.17372871390794833, 0.026996406301309516, -0.12681727817499575, -0.19214783942614108, -0.11674157179289771, -0.16800361227182795, 0.011651718127401825, -0.07654532891367757, -0.1542921870888328, 0.37619667637167487, 0.20159974809630404, 0.15901321006526134, 0.0453554604514983, 0.36790688604696425, 0.10065764209609702, 0.04803620979383666, 0.11784806023742223, 0.1755381884287923, 0.07790252198269981, 0.12511225805400375, -0.18118509305445868, 0.08387779636715656, 0.01082131328496212]
|
1,803.05607
|
Entangling cavity modes in a double-cavity optomechanical system
|
We study entanglement of the cavity modes in a double-cavity optomechanical
system in strong-coupling regime. The system consists of two optomechanical
systems coupled by a single photon hopping between them. With the radiation
pressure of the photon, entanglement of the cavity modes can be generated. The
concurrence between the cavity modes is at least twice larger than that between
the mechanical modes. Moreover, when we change the ratio between coupling
strength and resonant frequency of mechanical modes, the entanglement in cavity
and mechanical modes are influenced differently.
|
physics.optics cond-mat.mes-hall quant-ph
|
we study entanglement of the cavity modes in a doublecavity optomechanical system in strongcoupling regime the system consists of two optomechanical systems coupled by a single photon hopping between them with the radiation pressure of the photon entanglement of the cavity modes can be generated the concurrence between the cavity modes is at least twice larger than that between the mechanical modes moreover when we change the ratio between coupling strength and resonant frequency of mechanical modes the entanglement in cavity and mechanical modes are influenced differently
|
[['we', 'study', 'entanglement', 'of', 'the', 'cavity', 'modes', 'in', 'a', 'doublecavity', 'optomechanical', 'system', 'in', 'strongcoupling', 'regime', 'the', 'system', 'consists', 'of', 'two', 'optomechanical', 'systems', 'coupled', 'by', 'a', 'single', 'photon', 'hopping', 'between', 'them', 'with', 'the', 'radiation', 'pressure', 'of', 'the', 'photon', 'entanglement', 'of', 'the', 'cavity', 'modes', 'can', 'be', 'generated', 'the', 'concurrence', 'between', 'the', 'cavity', 'modes', 'is', 'at', 'least', 'twice', 'larger', 'than', 'that', 'between', 'the', 'mechanical', 'modes', 'moreover', 'when', 'we', 'change', 'the', 'ratio', 'between', 'coupling', 'strength', 'and', 'resonant', 'frequency', 'of', 'mechanical', 'modes', 'the', 'entanglement', 'in', 'cavity', 'and', 'mechanical', 'modes', 'are', 'influenced', 'differently']]
|
[-0.23114472479912743, 0.2915599728538387, -0.044849530060443725, -0.05912879376870248, 0.032042510379319905, -0.19939859709220714, 0.04047906237665093, 0.3597000288488022, -0.2363000552373371, -0.26593841508501903, -0.022275068613850438, -0.3379892897417491, -0.07656631734885874, 0.2311852494276118, 0.03870932604775004, 0.03879717688996816, 0.056438893047643116, 0.01451391518522782, 0.010157915809052601, -0.10575496107634243, 0.33235979430249024, 0.034229935716901874, 0.31367292661947765, 0.03271752846395147, 0.08774215387094808, -0.03542355780393399, 0.11575904890530925, -0.019731417705101527, -0.10136483705526649, 0.05145976182351681, 0.2187210597477896, -0.011829678632918445, 0.2920061041782985, -0.42324770492469443, -0.15339460142556277, 0.09347326654255733, 0.1683964477878749, 0.15029853536351317, 0.06325306146052377, -0.26879119663766915, -0.05358085832719145, -0.15009002678695765, -0.08934997854454593, -0.018167957882985645, -0.015709652254978817, -0.029111537068076003, -0.26727492167432415, 0.1292377485647455, 0.017559646286241626, 0.06226348519410895, -0.020069747285424978, 0.037256594878439415, -0.06329400716991775, 0.08413303171815725, 0.026760841695720267, -0.052283145832540144, 0.20949700313898595, -0.13878109810831046, -0.09290186817029855, 0.3401627638069485, -0.11945910082582047, -0.1651139717078072, 0.22100391933673072, -0.18849576696560816, 0.02107305040625834, 0.11889171220319367, 0.14410566065417624, 0.06874083443384232, -0.10102676816673377, -0.006579454711253016, 0.037762034438207914, 0.2458446630244625, 0.1255665109813984, 0.18217647449787835, 0.25146626086969825, 0.14297408951799676, -0.0017845385290425398, 0.26287470744780916, -0.046328259683173986, -0.060118333864742995, -0.2845372740800182, -0.14184721281227453, -0.22859929799471565, -0.0053670115570869596, -0.12237887681781678, -0.10554450686657052, 0.4338653738471283, 0.09357804301912072, 0.11189871482636737, -0.023197151851658333, 0.30576488905688, 0.1738595984790517, 0.1038809501105684, 0.051047769417964864, 0.4369002444905111, 0.1690259371193704, 0.0426995767087772, -0.39662327203931735, -0.060817113419159734, -0.011025237941836146]
|
1,803.05608
|
Microwave-assisted cross-polarization of nuclear spin ensembles from
optically-pumped nitrogen-vacancy centers in diamond
|
The ability to optically initialize the electronic spin of the
nitrogen-vacancy (NV) center in diamond has long been considered a valuable
resource to enhance the polarization of neighboring nuclei, but efficient
polarization transfer to spin species outside the diamond crystal has proven
challenging. Here we demonstrate variable-magnetic-field, microwave-enabled
cross-polarization from the NV electronic spin to protons in a model viscous
fluid in contact with the diamond surface. Slight changes in the
cross-relaxation rate as a function of the wait time between successive
repetitions of the transfer protocol suggest slower molecular diffusion near
the diamond surface compared to that in bulk, an observation consistent with
present models of the microscopic structure of a fluid close to a solid
interface.
|
cond-mat.mes-hall quant-ph
|
the ability to optically initialize the electronic spin of the nitrogenvacancy nv center in diamond has long been considered a valuable resource to enhance the polarization of neighboring nuclei but efficient polarization transfer to spin species outside the diamond crystal has proven challenging here we demonstrate variablemagneticfield microwaveenabled crosspolarization from the nv electronic spin to protons in a model viscous fluid in contact with the diamond surface slight changes in the crossrelaxation rate as a function of the wait time between successive repetitions of the transfer protocol suggest slower molecular diffusion near the diamond surface compared to that in bulk an observation consistent with present models of the microscopic structure of a fluid close to a solid interface
|
[['the', 'ability', 'to', 'optically', 'initialize', 'the', 'electronic', 'spin', 'of', 'the', 'nitrogenvacancy', 'nv', 'center', 'in', 'diamond', 'has', 'long', 'been', 'considered', 'a', 'valuable', 'resource', 'to', 'enhance', 'the', 'polarization', 'of', 'neighboring', 'nuclei', 'but', 'efficient', 'polarization', 'transfer', 'to', 'spin', 'species', 'outside', 'the', 'diamond', 'crystal', 'has', 'proven', 'challenging', 'here', 'we', 'demonstrate', 'variablemagneticfield', 'microwaveenabled', 'crosspolarization', 'from', 'the', 'nv', 'electronic', 'spin', 'to', 'protons', 'in', 'a', 'model', 'viscous', 'fluid', 'in', 'contact', 'with', 'the', 'diamond', 'surface', 'slight', 'changes', 'in', 'the', 'crossrelaxation', 'rate', 'as', 'a', 'function', 'of', 'the', 'wait', 'time', 'between', 'successive', 'repetitions', 'of', 'the', 'transfer', 'protocol', 'suggest', 'slower', 'molecular', 'diffusion', 'near', 'the', 'diamond', 'surface', 'compared', 'to', 'that', 'in', 'bulk', 'an', 'observation', 'consistent', 'with', 'present', 'models', 'of', 'the', 'microscopic', 'structure', 'of', 'a', 'fluid', 'close', 'to', 'a', 'solid', 'interface']]
|
[-0.08422463717790814, 0.13741545416287876, -0.04801443849618618, -0.002701499533210682, 0.0015854842992674592, -0.15591615831288388, 0.057842934153910376, 0.46166100507426977, -0.28609166684377396, -0.2833664359158685, 0.01946674024140956, -0.2766594847934878, -0.04480492617560821, 0.15517679050079206, -0.006793921703918494, 0.031306444213558465, 0.03639364747219106, 0.021659439441580802, -0.06517753434669958, -0.14771395351968578, 0.21927397749008626, 0.10053173950515114, 0.3239080329330113, 0.08057463109397735, 0.12991977502934188, 0.009048350983195834, 0.06914794142358005, -0.014905146362944545, -0.1136589911550559, 0.12266114292399904, 0.2600135104963618, -0.01759879130961644, 0.22161552929478642, -0.4954710789343231, -0.23862551784930894, 0.070239102993256, 0.1453549326596479, 0.22666093538332188, -0.09177553180891734, -0.2447363122438009, 0.0366083894449318, -0.16796619191956827, -0.13489707997944364, -0.03173204138974508, 0.010504069849530347, -0.005317212675467261, -0.19874420202323276, 0.08545438543610816, 0.04063518854797396, 0.030086271828995682, -0.08621682768138364, -0.08363507487253946, -0.08976753607678872, 0.09667647816439788, 0.014471872732576588, 0.07378331663855152, 0.2203258871116763, -0.11236214125926933, -0.14063104109552044, 0.35854049112934333, -0.06389602166043323, -0.12762192848464873, 0.20728507444947067, -0.1857743026394174, -0.05966942300860826, 0.16307259217684722, 0.16839139674477774, 0.13325250354937762, -0.1617170521023317, 0.013389106354333906, -0.006764452803967536, 0.19599271930692494, 0.04858170823456767, 0.05694684194018825, 0.2395022711278791, 0.22014735891428003, 0.07309499249244347, 0.15969800598059708, -0.15153784087163089, -0.079319174735783, -0.1889938266338924, -0.18816290948884243, -0.22242129585331577, 0.08702439143776129, -0.08991773574987155, -0.14499786178557536, 0.35950730895846444, 0.11454080091839115, 0.17803341849969748, -0.0758861494767997, 0.2721791498434658, 0.01592277904920694, 0.09348255113308501, 0.06393855521216607, 0.2799310601977074, 0.20682406248763585, 0.1018241681297843, -0.3367714844047068, 0.0758584253410371, -0.029786083401523084]
|
1,803.05609
|
The key parameters that govern translation efficiency
|
Translation of mRNA into protein is a fundamental yet complex biological
process with multiple factors that can potentially affect its efficiency. Here,
we study a stochastic model describing the traffic flow of ribosomes along the
mRNA (namely, the inhomogeneous $\ell$-TASEP), and identify the key parameters
that govern the overall rate of protein synthesis, sensitivity to initiation
rate changes, and efficiency of ribosome usage. By analyzing a continuum limit
of the model, we obtain closed-form expressions for stationary currents and
ribosomal densities, which agree well with Monte Carlo simulations.
Furthermore, we completely characterize the phase transitions in the system,
and by applying our theoretical results, we formulate design principles that
detail how to tune the key parameters we identified to optimize translation
efficiency. Using ribosome profiling data from S. cerevisiae, we shows that its
translation system is generally consistent with these principles. Our
theoretical results have implications for evolutionary biology, as well as
synthetic biology.
|
math-ph cond-mat.stat-mech math.MP math.PR q-bio.GN
|
translation of mrna into protein is a fundamental yet complex biological process with multiple factors that can potentially affect its efficiency here we study a stochastic model describing the traffic flow of ribosomes along the mrna namely the inhomogeneous elltasep and identify the key parameters that govern the overall rate of protein synthesis sensitivity to initiation rate changes and efficiency of ribosome usage by analyzing a continuum limit of the model we obtain closedform expressions for stationary currents and ribosomal densities which agree well with monte carlo simulations furthermore we completely characterize the phase transitions in the system and by applying our theoretical results we formulate design principles that detail how to tune the key parameters we identified to optimize translation efficiency using ribosome profiling data from s cerevisiae we shows that its translation system is generally consistent with these principles our theoretical results have implications for evolutionary biology as well as synthetic biology
|
[['translation', 'of', 'mrna', 'into', 'protein', 'is', 'a', 'fundamental', 'yet', 'complex', 'biological', 'process', 'with', 'multiple', 'factors', 'that', 'can', 'potentially', 'affect', 'its', 'efficiency', 'here', 'we', 'study', 'a', 'stochastic', 'model', 'describing', 'the', 'traffic', 'flow', 'of', 'ribosomes', 'along', 'the', 'mrna', 'namely', 'the', 'inhomogeneous', 'elltasep', 'and', 'identify', 'the', 'key', 'parameters', 'that', 'govern', 'the', 'overall', 'rate', 'of', 'protein', 'synthesis', 'sensitivity', 'to', 'initiation', 'rate', 'changes', 'and', 'efficiency', 'of', 'ribosome', 'usage', 'by', 'analyzing', 'a', 'continuum', 'limit', 'of', 'the', 'model', 'we', 'obtain', 'closedform', 'expressions', 'for', 'stationary', 'currents', 'and', 'ribosomal', 'densities', 'which', 'agree', 'well', 'with', 'monte', 'carlo', 'simulations', 'furthermore', 'we', 'completely', 'characterize', 'the', 'phase', 'transitions', 'in', 'the', 'system', 'and', 'by', 'applying', 'our', 'theoretical', 'results', 'we', 'formulate', 'design', 'principles', 'that', 'detail', 'how', 'to', 'tune', 'the', 'key', 'parameters', 'we', 'identified', 'to', 'optimize', 'translation', 'efficiency', 'using', 'ribosome', 'profiling', 'data', 'from', 's', 'cerevisiae', 'we', 'shows', 'that', 'its', 'translation', 'system', 'is', 'generally', 'consistent', 'with', 'these', 'principles', 'our', 'theoretical', 'results', 'have', 'implications', 'for', 'evolutionary', 'biology', 'as', 'well', 'as', 'synthetic', 'biology']]
|
[-0.058198563555206834, 0.10866781170145164, -0.039951644795246766, 0.07200610272788598, -0.024794017199086013, -0.11400059534212441, 0.09771920621564027, 0.406469363725312, -0.2953753201595319, -0.3048786353441625, 0.07069972251751917, -0.22141827547046192, -0.2064265060220279, 0.2245586579848154, -0.052103322352361835, 0.06348790108679726, 0.09284913904197953, -0.016225298970109887, -0.0032844182371703627, -0.17239915085895582, 0.2619876772700961, 0.09902038008242456, 0.3274163833508889, 0.05579133801850082, 0.11534490566198513, -0.03512938799537426, -0.018516721379687535, -0.011007607524934548, -0.19799282037583787, 0.14004293032979867, 0.2545890342033304, 0.18091361329349037, 0.20678126942206576, -0.4398689504493685, -0.2597451298406311, 0.0690002339539039, 0.16804091788024117, 0.14967036731404199, -0.06163183902542478, -0.22336098858538797, 0.08914524386180382, -0.14363971370838435, -0.11807786158645173, -0.13432444283263942, -0.00834821321045846, 0.09842167370587442, -0.23910833487372382, 0.08946093814021427, 0.03326096522676594, 0.07229751967455966, -0.08748249520145941, -0.11512225773642022, -0.06945175643145941, 0.21273579225750652, 0.08786402770003846, 0.014774037140050258, 0.19790707774204658, -0.11098894837093265, -0.16347686649038415, 0.3774581738729395, -0.06433472926332767, -0.2063682935797165, 0.19213204068783063, -0.09381585064788464, -0.1899328608266717, 0.12039419207600208, 0.18581422919930976, 0.07848269078162273, -0.18781916165627002, 0.028137315355326518, 0.0014594707857160008, 0.19476151426803637, 0.03459098279701388, -0.014543576385168469, 0.1701716365097882, 0.23210298875727223, -0.021054744804156273, 0.13660519901553497, -0.09120132391541905, -0.16512346625011537, -0.2438956719181756, -0.15725192707640673, -0.13007704768895956, 0.04291529203095516, -0.08797916489024799, -0.1055949934837378, 0.4145297589864022, 0.16400801531933978, 0.18670418382518822, 0.09467628548983971, 0.2922566078323262, 0.09432180362199646, 0.031090877268439024, 0.02793854176145948, 0.1754793790716897, 0.09938857153825023, 0.0841790341522569, -0.2871550227959756, 0.1332868617849753, 0.023091469486578812]
|
1,803.0561
|
Generalized Proximal Smoothing for Phase Retrieval
|
In this paper, we report the development of the generalized proximal
smoothing (GPS) algorithm for phase retrieval of noisy data. GPS is a
optimization-based algorithm, in which we relax both the Fourier magnitudes and
object constraints. We relax the object constraint by introducing the
generalized Moreau-Yosida regularization and heat kernel smoothing. We are able
to readily handle the associated proximal mapping in the dual variable by using
an infimal convolution. We also relax the magnitude constraint into a least
squares fidelity term, whose proximal mapping is available. GPS alternatively
iterates between the two proximal mappings in primal and dual spaces,
respectively. Using both numerical simulation and experimental data, we show
that GPS algorithm consistently outperforms the classical phase retrieval
algorithms such as hybrid input-output (HIO) and oversampling smoothness (OSS),
in terms of the convergence speed, consistency of the phase retrieval, and
robustness to noise.
|
math.OC
|
in this paper we report the development of the generalized proximal smoothing gps algorithm for phase retrieval of noisy data gps is a optimizationbased algorithm in which we relax both the fourier magnitudes and object constraints we relax the object constraint by introducing the generalized moreauyosida regularization and heat kernel smoothing we are able to readily handle the associated proximal mapping in the dual variable by using an infimal convolution we also relax the magnitude constraint into a least squares fidelity term whose proximal mapping is available gps alternatively iterates between the two proximal mappings in primal and dual spaces respectively using both numerical simulation and experimental data we show that gps algorithm consistently outperforms the classical phase retrieval algorithms such as hybrid inputoutput hio and oversampling smoothness oss in terms of the convergence speed consistency of the phase retrieval and robustness to noise
|
[['in', 'this', 'paper', 'we', 'report', 'the', 'development', 'of', 'the', 'generalized', 'proximal', 'smoothing', 'gps', 'algorithm', 'for', 'phase', 'retrieval', 'of', 'noisy', 'data', 'gps', 'is', 'a', 'optimizationbased', 'algorithm', 'in', 'which', 'we', 'relax', 'both', 'the', 'fourier', 'magnitudes', 'and', 'object', 'constraints', 'we', 'relax', 'the', 'object', 'constraint', 'by', 'introducing', 'the', 'generalized', 'moreauyosida', 'regularization', 'and', 'heat', 'kernel', 'smoothing', 'we', 'are', 'able', 'to', 'readily', 'handle', 'the', 'associated', 'proximal', 'mapping', 'in', 'the', 'dual', 'variable', 'by', 'using', 'an', 'infimal', 'convolution', 'we', 'also', 'relax', 'the', 'magnitude', 'constraint', 'into', 'a', 'least', 'squares', 'fidelity', 'term', 'whose', 'proximal', 'mapping', 'is', 'available', 'gps', 'alternatively', 'iterates', 'between', 'the', 'two', 'proximal', 'mappings', 'in', 'primal', 'and', 'dual', 'spaces', 'respectively', 'using', 'both', 'numerical', 'simulation', 'and', 'experimental', 'data', 'we', 'show', 'that', 'gps', 'algorithm', 'consistently', 'outperforms', 'the', 'classical', 'phase', 'retrieval', 'algorithms', 'such', 'as', 'hybrid', 'inputoutput', 'hio', 'and', 'oversampling', 'smoothness', 'oss', 'in', 'terms', 'of', 'the', 'convergence', 'speed', 'consistency', 'of', 'the', 'phase', 'retrieval', 'and', 'robustness', 'to', 'noise']]
|
[-0.0877755887761143, 0.005455539934599882, -0.08192471137347941, 0.08421584567521576, -0.09018396416649921, -0.16390655828096592, 0.05304660239037023, 0.4552764007821679, -0.34117797333359096, -0.252456413733954, 0.16892798810780127, -0.2581224725064304, -0.17368630868279272, 0.1821141773028406, -0.13254829191525155, 0.10788477696607718, 0.06220488233844258, -0.0027364994425119627, -0.1650700885915689, -0.24756269354838878, 0.2795783964425532, 0.018756923613384262, 0.2587684030230675, -0.01577931573976659, 0.14756155166833196, 0.0044904836783340825, -0.040574797399232115, 0.012535794848291617, -0.04930808515306732, 0.13967935660427125, 0.24695262936034446, 0.17797398500260897, 0.289370536539031, -0.3930766318856816, -0.17609267613281393, 0.1297315052878629, 0.14803441122057848, 0.040504428961463015, -0.05151717273494998, -0.30605214863963837, 0.05030159806483425, -0.12291168622970064, -0.017714075016556308, -0.1517084381905281, -0.09344256047107694, 0.0597945116330973, -0.3329705809398244, 0.08649250303096778, 0.07034990880573685, 0.022972527337616257, -0.08525453120172541, -0.10206335550497493, 0.02372028603632417, 0.06968309082175336, 0.027146341259746503, 0.06219244471867569, 0.11504477502118486, -0.08969470304792695, -0.12068287513910844, 0.311524256683899, -0.0861963774255451, -0.23990905152297476, 0.1623315671652866, -0.07409270799447161, -0.16096528888253184, 0.10810297885715651, 0.18940051260708263, 0.1369278207874029, -0.17798356155657935, 0.06725830274404467, 0.0008394530224096444, 0.15520187274604622, 0.0632520930990318, 0.040372875190769264, 0.0857692124587225, 0.16359326015743944, 0.14698599423475875, 0.1822592944954522, -0.14498473563394831, -0.09943392171205939, -0.2877257548065649, -0.1223483132974555, -0.21542141648953678, -0.04688612413398611, -0.1787764384379342, -0.13442088708203906, 0.3852048892036287, 0.20083271365203675, 0.17197729314729157, 0.10682792263186355, 0.3703714263004561, 0.11633559287212039, 0.055503033276990105, 0.1193567494855314, 0.207717709988679, 0.08944001340811762, 0.09353769653373295, -0.25960412139668027, 0.047798527199322254, 0.1465376406882165]
|
1,803.05611
|
Feasibility study for implementing an optical Thomson scattering system
for studying photoionized plasmas on Z
|
Many astrophysical environments such as X-ray binaries, active galactic
nuclei, and accretion disks of compact objects have photoionized plasmas. The
strong photoionizing environment found near these bright X-ray sources can be
produced in a scaled laboratory experiment, and direct measurements can form a
testbed for spectroscopic models and photoionization codes used in analysis of
these astrophysical objects. Such scaled experiments are currently being
conducted using Ne filled gas cells on the Z-facility as part of the Z
Astrophysical Plasma Properties (ZAPP) collaboration. The plasma is diagnosed
using a pressure sensor for density and X-ray absorption spectroscopy for
charge-state distribution. The electron temperature is presently inferred from
a Li-like ion level population ratio, but it is necessary to obtain an
independent temperature measurement, as photoionization alters the charge state
distribution and can therefore cause errors in temperatures obtained via line
ratio techniques. Optical Thomson scattering is a fitting diagnostic because it
directly probes the distribution of plasma particle velocities with respect to
a central probe frequency. It is a powerful diagnostic which can produce time
and space resolved measurements of electron temperature, as well as, electron
density, ion temperature, and average ionization. In this paper, we explore a
possible design for an optical Thomson scattering system to supplement X-ray
spectroscopic measurements. The proposed design will use equipment that is
available on Z, though not yet assembled. Both the feasibility and impact of
this new diagnostic are assessed by simulating expected spectra for a range of
plasma parameters, thereby demonstrating the sensitivity of this diagnostic.
|
physics.plasm-ph
|
many astrophysical environments such as xray binaries active galactic nuclei and accretion disks of compact objects have photoionized plasmas the strong photoionizing environment found near these bright xray sources can be produced in a scaled laboratory experiment and direct measurements can form a testbed for spectroscopic models and photoionization codes used in analysis of these astrophysical objects such scaled experiments are currently being conducted using ne filled gas cells on the zfacility as part of the z astrophysical plasma properties zapp collaboration the plasma is diagnosed using a pressure sensor for density and xray absorption spectroscopy for chargestate distribution the electron temperature is presently inferred from a lilike ion level population ratio but it is necessary to obtain an independent temperature measurement as photoionization alters the charge state distribution and can therefore cause errors in temperatures obtained via line ratio techniques optical thomson scattering is a fitting diagnostic because it directly probes the distribution of plasma particle velocities with respect to a central probe frequency it is a powerful diagnostic which can produce time and space resolved measurements of electron temperature as well as electron density ion temperature and average ionization in this paper we explore a possible design for an optical thomson scattering system to supplement xray spectroscopic measurements the proposed design will use equipment that is available on z though not yet assembled both the feasibility and impact of this new diagnostic are assessed by simulating expected spectra for a range of plasma parameters thereby demonstrating the sensitivity of this diagnostic
|
[['many', 'astrophysical', 'environments', 'such', 'as', 'xray', 'binaries', 'active', 'galactic', 'nuclei', 'and', 'accretion', 'disks', 'of', 'compact', 'objects', 'have', 'photoionized', 'plasmas', 'the', 'strong', 'photoionizing', 'environment', 'found', 'near', 'these', 'bright', 'xray', 'sources', 'can', 'be', 'produced', 'in', 'a', 'scaled', 'laboratory', 'experiment', 'and', 'direct', 'measurements', 'can', 'form', 'a', 'testbed', 'for', 'spectroscopic', 'models', 'and', 'photoionization', 'codes', 'used', 'in', 'analysis', 'of', 'these', 'astrophysical', 'objects', 'such', 'scaled', 'experiments', 'are', 'currently', 'being', 'conducted', 'using', 'ne', 'filled', 'gas', 'cells', 'on', 'the', 'zfacility', 'as', 'part', 'of', 'the', 'z', 'astrophysical', 'plasma', 'properties', 'zapp', 'collaboration', 'the', 'plasma', 'is', 'diagnosed', 'using', 'a', 'pressure', 'sensor', 'for', 'density', 'and', 'xray', 'absorption', 'spectroscopy', 'for', 'chargestate', 'distribution', 'the', 'electron', 'temperature', 'is', 'presently', 'inferred', 'from', 'a', 'lilike', 'ion', 'level', 'population', 'ratio', 'but', 'it', 'is', 'necessary', 'to', 'obtain', 'an', 'independent', 'temperature', 'measurement', 'as', 'photoionization', 'alters', 'the', 'charge', 'state', 'distribution', 'and', 'can', 'therefore', 'cause', 'errors', 'in', 'temperatures', 'obtained', 'via', 'line', 'ratio', 'techniques', 'optical', 'thomson', 'scattering', 'is', 'a', 'fitting', 'diagnostic', 'because', 'it', 'directly', 'probes', 'the', 'distribution', 'of', 'plasma', 'particle', 'velocities', 'with', 'respect', 'to', 'a', 'central', 'probe', 'frequency', 'it', 'is', 'a', 'powerful', 'diagnostic', 'which', 'can', 'produce', 'time', 'and', 'space', 'resolved', 'measurements', 'of', 'electron', 'temperature', 'as', 'well', 'as', 'electron', 'density', 'ion', 'temperature', 'and', 'average', 'ionization', 'in', 'this', 'paper', 'we', 'explore', 'a', 'possible', 'design', 'for', 'an', 'optical', 'thomson', 'scattering', 'system', 'to', 'supplement', 'xray', 'spectroscopic', 'measurements', 'the', 'proposed', 'design', 'will', 'use', 'equipment', 'that', 'is', 'available', 'on', 'z', 'though', 'not', 'yet', 'assembled', 'both', 'the', 'feasibility', 'and', 'impact', 'of', 'this', 'new', 'diagnostic', 'are', 'assessed', 'by', 'simulating', 'expected', 'spectra', 'for', 'a', 'range', 'of', 'plasma', 'parameters', 'thereby', 'demonstrating', 'the', 'sensitivity', 'of', 'this', 'diagnostic']]
|
[-0.035623881239787235, 0.1587181283613023, -0.059326696040784103, 0.08726355917213774, -0.02514222678375909, -0.1238255671993551, 0.036971198791448785, 0.4201052197333114, -0.20496770704677142, -0.34462058141876745, 0.076900259864357, -0.29835388305934657, -0.0029252964652614647, 0.25961603877478767, 0.018310143478749045, 0.048972877658962966, 0.046685187362201244, -0.06335393443311271, -0.01638752935928259, -0.17338525704701852, 0.27732510315959313, 0.16395789214903378, 0.23663655908655865, 0.06251498814802098, 0.06471700254786923, -0.03253089229620815, -0.05841923661950226, 0.04408934717036438, -0.10992608386393014, 0.0295920576918796, 0.29206382374036455, 0.1145554761139041, 0.19106863945188277, -0.38237748385093495, -0.25542839391220107, 0.05622322309213325, 0.18547131110862106, 0.06921575763318465, -0.10445345854627866, -0.23543822059112848, -0.005586310740619661, -0.17914784621387958, -0.16169851372738284, -0.051868672020718515, 0.010324380531224359, 0.05299323970550278, -0.2914533236386826, 0.06378995735973743, -0.039538890927838924, 0.06527346296169131, -0.09949881084489662, -0.09350940252448324, -0.017353076696492345, 0.08325702310502678, -0.015535197133547162, 0.04449471371098555, 0.2497165751164831, -0.12052474847523517, -0.047971581131130814, 0.3850279210424756, -0.056316990102919566, -0.08369340022387674, 0.22501231962559834, -0.18819168956710983, -0.12023405954974566, 0.1655505930029034, 0.1705556853552719, 0.11799994867250502, -0.1698066326562293, 0.012080143941881736, -0.02718401019669238, 0.20319042847027646, 0.05573594369726122, 0.07089978426303417, 0.2843046781061536, 0.15423460790063756, -0.012798048304236193, 0.09181505669823448, -0.18746958278765183, 0.0214573023226242, -0.24768564432666476, -0.12259373024840695, -0.16749271611122793, 0.07308225207077386, -0.04860477316352368, -0.14236747526978347, 0.32881202931104014, 0.13873264920411713, 0.17679607143172943, -0.04763762676110677, 0.35342730870062256, 0.1096504992124554, 0.04291727345351471, 0.05111696320934689, 0.2906239693497393, 0.16798795469891858, 0.10422832240717879, -0.23911290951824535, 0.0935759660602358, -0.00562411310537106]
|
1,803.05612
|
$\mathcal{N}=3$ Harmonic Super-Wilson Loop
|
We study supersymmetric Wilson loops in $d=3$, $\mathcal{N}=3$ harmonic
superspace, leading to a construction of a supersymmetrized generalization of
the $\frac{1}{3}$-BPS Wilson loop for $\mathcal{N}=3$ gauge theories. This also
includes a generalization of the $\frac{1}{6}$-BPS loop for ABJM theory. We
perform a 'one-loop' computation of the vacuum expectation value of this
operator directly in superspace and compare with the known $\mathcal{N}=2$
localization results at large $N$. This comparison also lets us identify
certain fermionic contributions that do not receive any subleading corrections.
|
hep-th
|
we study supersymmetric wilson loops in d3 mathcaln3 harmonic superspace leading to a construction of a supersymmetrized generalization of the frac13bps wilson loop for mathcaln3 gauge theories this also includes a generalization of the frac16bps loop for abjm theory we perform a oneloop computation of the vacuum expectation value of this operator directly in superspace and compare with the known mathcaln2 localization results at large n this comparison also lets us identify certain fermionic contributions that do not receive any subleading corrections
|
[['we', 'study', 'supersymmetric', 'wilson', 'loops', 'in', 'd3', 'mathcaln3', 'harmonic', 'superspace', 'leading', 'to', 'a', 'construction', 'of', 'a', 'supersymmetrized', 'generalization', 'of', 'the', 'frac13bps', 'wilson', 'loop', 'for', 'mathcaln3', 'gauge', 'theories', 'this', 'also', 'includes', 'a', 'generalization', 'of', 'the', 'frac16bps', 'loop', 'for', 'abjm', 'theory', 'we', 'perform', 'a', 'oneloop', 'computation', 'of', 'the', 'vacuum', 'expectation', 'value', 'of', 'this', 'operator', 'directly', 'in', 'superspace', 'and', 'compare', 'with', 'the', 'known', 'mathcaln2', 'localization', 'results', 'at', 'large', 'n', 'this', 'comparison', 'also', 'lets', 'us', 'identify', 'certain', 'fermionic', 'contributions', 'that', 'do', 'not', 'receive', 'any', 'subleading', 'corrections']]
|
[-0.1170722403214313, 0.16982785484869964, -0.05514699210762046, 0.12228160358645254, -0.07469163398491219, -0.17502308727707713, 0.015209374662663321, 0.2982909601181746, -0.09017889450915391, -0.23524724314920603, 0.05287792853778228, -0.28753239316865803, -0.19621405315410811, 0.10216768157115438, -0.08906385020200105, 0.046167706698179246, 0.026167069864459335, 0.06323857615934685, -0.14953080464620144, -0.26999207402113823, 0.30421897453197744, 0.014727883065643255, 0.2160676704846992, 0.09113617062394042, 0.06894500651396811, 0.011561461931705708, -0.03373895075637847, -0.00582479924778454, -0.0999074345138979, 0.15846926172671374, 0.20540516588953323, 0.04617088031955063, 0.1322634452721104, -0.38803450304549186, -0.178848314235438, 0.0954437541324296, 0.20403895123163238, 0.1592940385977272, 0.05268277965951711, -0.21910453793825582, 0.014869021526828874, -0.22425445896515156, -0.1829995883934316, -0.14605035264976324, -0.040577887481777, -0.17909723985794698, -0.3079980073496699, 0.009151187277166174, -0.027724597486667335, 0.02716685860832513, 0.004740325324382866, -0.0715392231621081, -0.028649355977540834, 0.13597921074833721, 0.07877300190739334, 0.06649769208379439, 0.09623843251320068, -0.19994896694843192, -0.20551930284127592, 0.36510380695108324, -0.08775434970157221, -0.2247898651752621, 0.10312114034313709, -0.19878313262015582, -0.2602776615531184, 0.10670379933199, 0.10834332532249391, 0.18056986990231963, -0.11490110182203353, 0.21906560870047542, -0.06580675847653765, 0.11866293382481671, 0.11332242045318708, 0.021786457317648455, 0.1997273197310278, 0.0177160213701427, 0.04327227460744325, 0.194041326167644, 0.006774850899819285, -0.13717775610275568, -0.4780101825715974, -0.15928255251237716, -0.07946840330259874, 0.10797113185417402, -0.13461984422738169, -0.23749679738248233, 0.3833191271289252, 0.20023263404727915, 0.1830804596971575, 0.14935862184502186, 0.2296518290997483, 0.11515155446249992, 0.1415989561006427, 0.028329564526211472, 0.22817718689329922, 0.16731200768554116, 0.11698714616359211, -0.2779742497747065, -0.17581761411274782, 0.2344776859128615]
|
1,803.05613
|
On identifying magnetized anomalies using geomagnetic monitoring
|
We propose and investigate the inverse problem of identifying magnetized
anomalies beneath the Earth using the geomagnetic monitoring. Suppose a
collection of magnetized anomalies presented in the shell of the Earth. The
presence of the anomalies interrupts the magnetic field of the Earth, monitored
above the Earth. Using the difference of the magnetic fields before and after
the presence of the magnetized anomalies, we show that one can uniquely recover
the locations as well as their material parameters of the anomalies. Our study
provides a rigorous mathematical theory to the geomagnetic detection technology
that has been used in practice.
|
math.AP
|
we propose and investigate the inverse problem of identifying magnetized anomalies beneath the earth using the geomagnetic monitoring suppose a collection of magnetized anomalies presented in the shell of the earth the presence of the anomalies interrupts the magnetic field of the earth monitored above the earth using the difference of the magnetic fields before and after the presence of the magnetized anomalies we show that one can uniquely recover the locations as well as their material parameters of the anomalies our study provides a rigorous mathematical theory to the geomagnetic detection technology that has been used in practice
|
[['we', 'propose', 'and', 'investigate', 'the', 'inverse', 'problem', 'of', 'identifying', 'magnetized', 'anomalies', 'beneath', 'the', 'earth', 'using', 'the', 'geomagnetic', 'monitoring', 'suppose', 'a', 'collection', 'of', 'magnetized', 'anomalies', 'presented', 'in', 'the', 'shell', 'of', 'the', 'earth', 'the', 'presence', 'of', 'the', 'anomalies', 'interrupts', 'the', 'magnetic', 'field', 'of', 'the', 'earth', 'monitored', 'above', 'the', 'earth', 'using', 'the', 'difference', 'of', 'the', 'magnetic', 'fields', 'before', 'and', 'after', 'the', 'presence', 'of', 'the', 'magnetized', 'anomalies', 'we', 'show', 'that', 'one', 'can', 'uniquely', 'recover', 'the', 'locations', 'as', 'well', 'as', 'their', 'material', 'parameters', 'of', 'the', 'anomalies', 'our', 'study', 'provides', 'a', 'rigorous', 'mathematical', 'theory', 'to', 'the', 'geomagnetic', 'detection', 'technology', 'that', 'has', 'been', 'used', 'in', 'practice']]
|
[-0.14241502480346221, 0.15831039243641148, -0.04018919791725248, 0.06573378163944892, -0.04839011474578368, -0.018975700816196022, 0.03981399899607317, 0.30964497716702294, -0.25694374643698936, -0.36182744635476005, 0.1341188444469049, -0.2797841124960946, -0.16310512546374642, 0.17318456360336507, -0.029836433784415323, 0.005874199604596755, 0.02139034898330768, 0.07290649528831544, -0.08499192501429463, -0.18415955440940882, 0.2530652683232958, 0.09707859721072394, 0.24877912480609887, 0.061067014720968225, 0.08890057594934007, -0.009350824249776625, -0.018519099331413855, 0.028935281907894995, -0.0526050780507362, 0.07436434732576024, 0.22828537144350133, 0.11258223528075362, 0.20080821293246265, -0.4794789225314603, -0.28147934865432256, 0.08716927456547215, 0.09984110545007173, 0.06503268241919953, -0.07892016241811405, -0.3060565663859098, 0.08568711356363362, -0.11015422931035058, -0.17573017197087257, -0.02431964272200459, 0.015459568372626572, 0.005279176122969901, -0.24704451187433807, 0.05614777993072163, 0.039606155543070704, 0.10852278765370937, -0.09203098315011823, -0.08417207093890568, -0.01190240876372866, 0.16136432008234539, 0.14379223732917448, 0.000469225597558449, 0.18941829968808274, -0.09366262261990947, -0.079330869522322, 0.4131708473432809, -0.08779737893303838, -0.10192093002901535, 0.1873099140051489, -0.17848842171481763, -0.12453025780768708, 0.10811386358068147, 0.1706032177922551, 0.13800435508554332, -0.16564496872814918, 0.07202258797226041, -0.0602752458718088, 0.09584769478651008, 0.03703768052292442, -0.016145895849066703, 0.29125462876011926, 0.17140130256537836, 0.01783078990763787, 0.13924499712602206, -0.1889902622899925, -0.006797784718336782, -0.2902636189822747, -0.14786859997783344, -0.14732007116004073, 0.0005744007049184856, -0.04767379758737257, -0.1826364209668504, 0.4229842537468431, 0.2218518646697354, 0.1623075018387589, -0.06345771005226657, 0.28042213501869656, 0.07582239694117258, 0.06504314193135184, 0.09118334679732645, 0.3247826711622753, 0.1649127101356333, 0.13751903321180078, -0.25395046664411297, 0.08958398181041985, 0.02773454271708474]
|
1,803.05614
|
The Demyanov-Ryabova conjecture is false
|
It was conjectured by Vladimir Demyanov and Julia Ryabova in 2011 that the
minimal cycle in the sequence obtained via repeated application of Demyanov
converter to a finite family of polytopes is at most two. We construct a
counterexample for which the minimal cycle has length 4.
|
math.OC
|
it was conjectured by vladimir demyanov and julia ryabova in 2011 that the minimal cycle in the sequence obtained via repeated application of demyanov converter to a finite family of polytopes is at most two we construct a counterexample for which the minimal cycle has length 4
|
[['it', 'was', 'conjectured', 'by', 'vladimir', 'demyanov', 'and', 'julia', 'ryabova', 'in', '2011', 'that', 'the', 'minimal', 'cycle', 'in', 'the', 'sequence', 'obtained', 'via', 'repeated', 'application', 'of', 'demyanov', 'converter', 'to', 'a', 'finite', 'family', 'of', 'polytopes', 'is', 'at', 'most', 'two', 'we', 'construct', 'a', 'counterexample', 'for', 'which', 'the', 'minimal', 'cycle', 'has', 'length', '4']]
|
[-0.1366323709804961, 0.1087416733882608, -0.05527763858318646, 0.04148795793794016, -0.02210515634493625, -0.12454639383135958, 0.037304046174927434, 0.31117089681248083, -0.2584981390180938, -0.27243609676395164, 0.16404967723870056, -0.28667320156509574, -0.16118533390158035, 0.22360544551183728, -0.13265803549438715, 0.027869688665885677, 0.059448495695486346, 0.03355069566478438, 0.02724808477796614, -0.2981795118923517, 0.2586898807277705, 0.022130588436142563, 0.20747982642979937, 0.050542432349175215, 0.15201471205751232, 0.002845231413920509, 0.019628033081584787, -0.0022929114428289392, -0.1651043616728473, 0.09534377907898198, 0.23154658487344043, 0.1702318685723746, 0.23310128916451273, -0.36552563987355285, -0.15583235128445827, 0.1491962771743853, 0.08411003411450285, 0.07624771480418821, -0.008623896384651357, -0.14800296743657995, 0.16917339333907722, -0.17146703225134455, -0.14488808088440527, -0.0038977517805835033, 0.11090491803244074, -0.038831424760691666, -0.2354398429631553, -0.04398906395394117, 0.12175351422914166, 0.13849711435985693, 0.03523517154811069, -0.08554833526029548, -0.05498214774428213, 0.06660736754457368, -0.01716633119739275, 0.08621518346580102, 0.004288545492640201, -0.015117104135532963, -0.1762702745444914, 0.2994632619727859, -0.08183648908867482, -0.14120705968680533, 0.16567651271582284, -0.12046097172176505, -0.16095631862891482, 0.15532510198573482, 0.062111716380620255, 0.09966433533229568, -0.13648800006968545, 0.133948745710052, -0.11620257032955898, 0.1127528894613398, 0.16967615782421955, -0.07760158562636439, 0.15048171116653433, 0.13313542155826347, 0.07335652093938057, 0.19647042239282994, -0.01400999981474052, -0.05088613485481511, -0.30162483443842925, -0.16241278630672668, -0.2081257980614108, 0.08227034564565947, -0.06916910262767255, -0.15425092693259743, 0.40158904863006256, 0.05422849356731836, 0.14488915869213165, 0.0752160950251756, 0.17612041881743898, 0.09194302562862, 0.06991060696879124, 0.09065875788516503, 0.18434059328617566, 0.13544535117491366, 0.033568611507244564, -0.1720633909918685, 0.02508598405550769, 0.20392244986872723]
|
1,803.05615
|
Voltage-Driven High-Speed Skyrmion Motion in a Skyrmion Shift Device
|
Magnetic skyrmions are promising information carriers for building future
high-density and high-speed spintronic devices. However, to achieve a
current-driven high-speed skyrmion motion, the required driving current density
is usually very large, which could be energy inefficient and even destroy the
device due to Joule heating. Here, we propose a voltage-driven skyrmion motion
approach in a skyrmion shift device made of magnetic nanowires. The high-speed
skyrmion motion is realized by utilizing the voltage shift, and the average
skyrmion velocity reaches up to 259 m/s under 0.45 V applied voltage. In
comparison with the widely studied vertical current-driven model, the energy
dissipation is three orders of magnitude lower in our voltage-driven model, for
the same speed motion of skyrmions. Our approach uncovers valuable
opportunities for building skyrmion racetrack memories and logic devices with
both ultra-low power consumption and ultra-high processing speed, which are
appealing features for future spintronic applications.
|
physics.app-ph
|
magnetic skyrmions are promising information carriers for building future highdensity and highspeed spintronic devices however to achieve a currentdriven highspeed skyrmion motion the required driving current density is usually very large which could be energy inefficient and even destroy the device due to joule heating here we propose a voltagedriven skyrmion motion approach in a skyrmion shift device made of magnetic nanowires the highspeed skyrmion motion is realized by utilizing the voltage shift and the average skyrmion velocity reaches up to 259 ms under 045 v applied voltage in comparison with the widely studied vertical currentdriven model the energy dissipation is three orders of magnitude lower in our voltagedriven model for the same speed motion of skyrmions our approach uncovers valuable opportunities for building skyrmion racetrack memories and logic devices with both ultralow power consumption and ultrahigh processing speed which are appealing features for future spintronic applications
|
[['magnetic', 'skyrmions', 'are', 'promising', 'information', 'carriers', 'for', 'building', 'future', 'highdensity', 'and', 'highspeed', 'spintronic', 'devices', 'however', 'to', 'achieve', 'a', 'currentdriven', 'highspeed', 'skyrmion', 'motion', 'the', 'required', 'driving', 'current', 'density', 'is', 'usually', 'very', 'large', 'which', 'could', 'be', 'energy', 'inefficient', 'and', 'even', 'destroy', 'the', 'device', 'due', 'to', 'joule', 'heating', 'here', 'we', 'propose', 'a', 'voltagedriven', 'skyrmion', 'motion', 'approach', 'in', 'a', 'skyrmion', 'shift', 'device', 'made', 'of', 'magnetic', 'nanowires', 'the', 'highspeed', 'skyrmion', 'motion', 'is', 'realized', 'by', 'utilizing', 'the', 'voltage', 'shift', 'and', 'the', 'average', 'skyrmion', 'velocity', 'reaches', 'up', 'to', '259', 'ms', 'under', '045', 'v', 'applied', 'voltage', 'in', 'comparison', 'with', 'the', 'widely', 'studied', 'vertical', 'currentdriven', 'model', 'the', 'energy', 'dissipation', 'is', 'three', 'orders', 'of', 'magnitude', 'lower', 'in', 'our', 'voltagedriven', 'model', 'for', 'the', 'same', 'speed', 'motion', 'of', 'skyrmions', 'our', 'approach', 'uncovers', 'valuable', 'opportunities', 'for', 'building', 'skyrmion', 'racetrack', 'memories', 'and', 'logic', 'devices', 'with', 'both', 'ultralow', 'power', 'consumption', 'and', 'ultrahigh', 'processing', 'speed', 'which', 'are', 'appealing', 'features', 'for', 'future', 'spintronic', 'applications']]
|
[-0.21168196276717244, 0.17601408047259462, -0.019739419839592005, -0.009125574112974336, -0.11789406035222164, -0.15669987440983557, 0.05861720453700697, 0.41924727224066954, -0.2846665183386328, -0.35253607758580624, 0.08076424248632183, -0.22420010003609722, -0.06839106689352974, 0.3013921590287517, -0.04148000460688253, 0.07982247047835872, 0.018804917984711778, -0.02017423787414014, 0.015595134537743062, -0.17922770189514167, 0.13172143355936927, 0.024650823473803648, 0.394588838711533, 0.07029822879735394, 0.10221808497179426, -0.07243206703102495, 0.09227075700515083, 0.017018005351669023, -0.1265571872354485, 0.1193557937841761, 0.22136319384967185, -0.08012265465887529, 0.23458201977975515, -0.5321825009194159, -0.23955637246344974, 0.030330286887125905, 0.16695554022911657, 0.16434684898355836, -0.12392158508870979, -0.28602629488169334, 0.13963137363276895, -0.19440598341123183, -0.1196099455612094, -0.1404261164728324, 0.07409692925660788, 0.04577109322100751, -0.24481122262243712, 0.09432904714865763, 0.05453257569346298, 0.02411535442933491, -0.08642258660707046, -0.09597605368958748, -0.026143624181045474, 0.07334741066585351, -0.003963528771181495, 0.09286971490744654, 0.2423982769155837, -0.1852853780510981, -0.15976927558524015, 0.3774020489507995, -0.014370386734237375, -0.126324370082113, 0.127818741027874, -0.13460913504359825, -0.025354124814728086, 0.11254124706104195, 0.15864013512397096, 0.08853949585828144, -0.1477557126128552, 0.011145681692018065, 0.1003636926322301, 0.1510657764033598, 0.07979010798822657, 0.1221939380261667, 0.31628394960013984, 0.28289545078438766, 0.07853818795054543, 0.12285793869721316, -0.15386095808717568, -0.04838820205063743, -0.20373616465779187, -0.16519399551788763, -0.19484025753755757, 0.06364328722108384, -0.10229700557571966, -0.10234879374624464, 0.377678506329757, 0.22578491344984594, 0.13543800906702674, -0.048565571045908494, 0.3704600989134336, 0.10916205349403629, 0.12308131536266127, 0.09849921134648984, 0.23078030493541235, 0.13148562213703738, 0.21216710673353703, -0.24546679002581304, 0.03862268625296095, -0.040525618189831775]
|
1,803.05616
|
Strong light illumination on gain-switched semiconductor lasers helps
the eavesdropper in practical quantum key distribution systems
|
The temperature of the semiconductor diode increases under strong light
illumination whether thermoelectric cooler is installed or not, which changes
the output wavelength of the laser (Lee M. S. et al., 2017). However, other
characteristics also vary as temperature increases. These variations may help
the eavesdropper in practical quantum key distribution systems. We study the
effects of temperature increase on gain-switched semiconductor lasers by
simulating temperature dependent rate equations. The results show that
temperature increase may cause large intensity fluctuation, decrease the output
intensity and lead the signal state and decoy state distinguishable. We also
propose a modified photon number splitting attack by exploiting the effects of
temperature increase. Countermeasures are also proposed.
|
quant-ph physics.optics
|
the temperature of the semiconductor diode increases under strong light illumination whether thermoelectric cooler is installed or not which changes the output wavelength of the laser lee m s et al 2017 however other characteristics also vary as temperature increases these variations may help the eavesdropper in practical quantum key distribution systems we study the effects of temperature increase on gainswitched semiconductor lasers by simulating temperature dependent rate equations the results show that temperature increase may cause large intensity fluctuation decrease the output intensity and lead the signal state and decoy state distinguishable we also propose a modified photon number splitting attack by exploiting the effects of temperature increase countermeasures are also proposed
|
[['the', 'temperature', 'of', 'the', 'semiconductor', 'diode', 'increases', 'under', 'strong', 'light', 'illumination', 'whether', 'thermoelectric', 'cooler', 'is', 'installed', 'or', 'not', 'which', 'changes', 'the', 'output', 'wavelength', 'of', 'the', 'laser', 'lee', 'm', 's', 'et', 'al', '2017', 'however', 'other', 'characteristics', 'also', 'vary', 'as', 'temperature', 'increases', 'these', 'variations', 'may', 'help', 'the', 'eavesdropper', 'in', 'practical', 'quantum', 'key', 'distribution', 'systems', 'we', 'study', 'the', 'effects', 'of', 'temperature', 'increase', 'on', 'gainswitched', 'semiconductor', 'lasers', 'by', 'simulating', 'temperature', 'dependent', 'rate', 'equations', 'the', 'results', 'show', 'that', 'temperature', 'increase', 'may', 'cause', 'large', 'intensity', 'fluctuation', 'decrease', 'the', 'output', 'intensity', 'and', 'lead', 'the', 'signal', 'state', 'and', 'decoy', 'state', 'distinguishable', 'we', 'also', 'propose', 'a', 'modified', 'photon', 'number', 'splitting', 'attack', 'by', 'exploiting', 'the', 'effects', 'of', 'temperature', 'increase', 'countermeasures', 'are', 'also', 'proposed']]
|
[-0.14372548693791032, 0.2272328149189398, -0.04924354881905349, 0.021233004679598443, -0.037088709965809784, -0.20929843524009384, 0.06688691636823546, 0.37679987742392496, -0.2406581731974683, -0.35203309701673224, 0.042968841944409086, -0.2969767899145331, -0.09700786353055948, 0.23555369110596655, -0.1085685425709966, 0.04548740357292437, -0.0018942961098411969, -0.06205185989033332, -0.04194722335942221, -0.2535314982812604, 0.2674813913263842, 0.14522912066771887, 0.36822439155714437, 0.09304515375555863, 0.055403917714689686, 0.0008956967457403652, 0.020816326337099997, 0.0053204210573988674, -0.0955440300268629, -0.02781705441723724, 0.24991356123205835, 0.04516721678798837, 0.233110707599373, -0.40134130370498233, -0.2680325581552049, 0.09354878718907063, 0.10658107824475233, 0.12063474130952748, -0.08590213796206281, -0.2517893425512449, 0.011063866102985577, -0.174572174519762, -0.13093687160418624, -0.02566900927639377, 0.0008027154325911429, 0.06171595469319088, -0.23682568682382393, 0.054939791924099694, 0.05090920365440239, 0.048515222142491723, -0.021415397673185947, -0.12195015690841637, -0.05304301765425939, 0.07894912005383603, 0.01369598575051775, 0.022745712009151424, 0.24751081503309574, -0.09352260113454762, -0.0834805200976707, 0.27663657606571124, -0.12538083978986317, -0.0997056783201684, 0.14451962258909887, -0.13459117920756075, -0.04739409394869251, 0.17070081812716956, 0.18943619653088065, 0.0845863536511243, -0.07860869325520224, 0.02180608358559718, 0.0166396338171202, 0.26185850701006375, 0.12268710396854224, 0.1369440797922424, 0.21683772312131075, 0.12702058064462865, 0.034388883822325585, 0.14413083540285995, -0.14139442679428998, -0.05288742325398494, -0.2408668128608734, -0.12072571622108859, -0.16813883641569882, 0.043808629091512785, -0.07938628266663372, -0.11127228249457821, 0.37700152185753777, 0.23017032880467914, 0.1479384135702147, -0.01979118198737403, 0.31747276045019385, 0.16885294359428726, 0.04205057053802024, 0.07283475111131515, 0.2572783057009224, 0.13809611325603457, 0.13251753685072856, -0.31480199003703396, 0.13211700373815488, -0.04514219151476019]
|
1,803.05617
|
A generalized projection-based scheme for solving convex constrained
optimization problems
|
In this paper we present a new algorithmic realization of a projection-based
scheme for general convex constrained optimization problem. The general idea is
to transform the original optimization problem to a sequence of feasibility
problems by iteratively constraining the objective function from above until
the feasibility problem is inconsistent. For each of the feasibility problems
one may apply any of the existing projection methods for solving it. In
particular, the scheme allows the use of subgradient projections and does not
require exact projections onto the constraints sets as in existing similar
methods.
We also apply the newly introduced concept of superiorization to optimization
formulation and compare its performance to our scheme. We provide some
numerical results for convex quadratic test problems as well as for real-life
optimization problems coming from medical treatment planning.
|
math.OC
|
in this paper we present a new algorithmic realization of a projectionbased scheme for general convex constrained optimization problem the general idea is to transform the original optimization problem to a sequence of feasibility problems by iteratively constraining the objective function from above until the feasibility problem is inconsistent for each of the feasibility problems one may apply any of the existing projection methods for solving it in particular the scheme allows the use of subgradient projections and does not require exact projections onto the constraints sets as in existing similar methods we also apply the newly introduced concept of superiorization to optimization formulation and compare its performance to our scheme we provide some numerical results for convex quadratic test problems as well as for reallife optimization problems coming from medical treatment planning
|
[['in', 'this', 'paper', 'we', 'present', 'a', 'new', 'algorithmic', 'realization', 'of', 'a', 'projectionbased', 'scheme', 'for', 'general', 'convex', 'constrained', 'optimization', 'problem', 'the', 'general', 'idea', 'is', 'to', 'transform', 'the', 'original', 'optimization', 'problem', 'to', 'a', 'sequence', 'of', 'feasibility', 'problems', 'by', 'iteratively', 'constraining', 'the', 'objective', 'function', 'from', 'above', 'until', 'the', 'feasibility', 'problem', 'is', 'inconsistent', 'for', 'each', 'of', 'the', 'feasibility', 'problems', 'one', 'may', 'apply', 'any', 'of', 'the', 'existing', 'projection', 'methods', 'for', 'solving', 'it', 'in', 'particular', 'the', 'scheme', 'allows', 'the', 'use', 'of', 'subgradient', 'projections', 'and', 'does', 'not', 'require', 'exact', 'projections', 'onto', 'the', 'constraints', 'sets', 'as', 'in', 'existing', 'similar', 'methods', 'we', 'also', 'apply', 'the', 'newly', 'introduced', 'concept', 'of', 'superiorization', 'to', 'optimization', 'formulation', 'and', 'compare', 'its', 'performance', 'to', 'our', 'scheme', 'we', 'provide', 'some', 'numerical', 'results', 'for', 'convex', 'quadratic', 'test', 'problems', 'as', 'well', 'as', 'for', 'reallife', 'optimization', 'problems', 'coming', 'from', 'medical', 'treatment', 'planning']]
|
[-0.030482287403140077, -0.05648802652520905, -0.08253617780773263, 0.07923355623046846, -0.12265771415952902, -0.13562283386245258, 0.05671526865921635, 0.3711716739628884, -0.3321251132546511, -0.296480803200765, 0.1708282883343798, -0.22457635135372797, -0.1699824491340695, 0.2562616813535753, -0.1349121940959441, 0.1447274211231318, 0.09952373572282101, -0.036894064475178255, -0.14102756628360516, -0.27999274083588244, 0.31307468975761105, 0.022071904509811474, 0.2532071930660929, 0.050485283586273626, 0.12634455820780136, 0.043919291662374384, -0.0016871584348268527, 0.056791086237846095, -0.09872926720348012, 0.15460004296094262, 0.2843554666216828, 0.2570339919144946, 0.35674345363071536, -0.4147994162136675, -0.2038227018578104, 0.11893665533568851, 0.132269859958188, 0.1232020963347496, -0.05991197243696989, -0.22997119230799434, 0.08133386572406284, -0.11162839460806374, -0.09803403769024557, -0.09146594446015902, -0.0713273118761249, 0.014525667169040307, -0.3217367808950743, 0.04692829030025855, 0.03182246462578528, -0.017519501570080007, -0.10253612500837744, -0.1443409140001198, 0.07875682822169554, 0.07875017178440957, 0.04673005392270765, 0.04499635793954918, 0.09571481427428123, -0.07854884518905633, -0.1855881993853158, 0.41581932962977125, 0.000735365344505561, -0.26242245706778605, 0.1815626953231325, -0.020571691484743714, -0.17949159124768094, 0.1122888866041724, 0.218958106781251, 0.2011583691981054, -0.15729742670690822, 0.09775160160178277, -0.06559760493394408, 0.09538806519730199, 0.0033843872606530226, -0.013357778863204097, 0.13222958139297938, 0.18270828121094929, 0.17115536153218464, 0.18943604418160603, -0.03661265567687333, -0.10118947206135083, -0.30225343911215324, -0.11373727219932034, -0.20105580026914077, -0.03923498261341374, -0.06345230646941748, -0.13670934015478856, 0.3889387747165023, 0.20372570738549994, 0.16115912726443066, 0.09881102977866742, 0.3739948363824138, 0.10916830002876433, 0.03420488734307692, 0.051123694513217174, 0.20726516194176803, 0.1150392858640648, 0.09797991035660182, -0.2265354163447549, 0.046998989932007976, 0.1177824236543611]
|
1,803.05618
|
Time-resolved vacuum Rabi oscillations in a quantum dot-nanocavity
system
|
We report time-domain observation of vacuum Rabi oscillations in a single
quantum dot strongly coupled to a nanocavity under incoherent optical carrier
injection. We realize a photonic crystal nanocavity with a very high quality
factor of >80,000 and employ it to clearly resolve the ultrafast vacuum Rabi
oscillations by simple photoluminescence-based experiments. We found that the
time-domain vacuum Rabi oscillations were largely modified when changing the
pump wavelength and intensity, even when marginal changes were detected in the
corresponding photoluminescence spectra. We analyze the measured time-domain
oscillations by fitting to simulation curves obtained with a cavity quantum
electrodynamics model. The observed modifications of the oscillation curves
were mainly induced by the change in the carrier capture and dephasing dynamics
in the quantum dot, as well as the change in bare-cavity emission. This result
suggests that vacuum Rabi oscillations can be utilized as a highly sensitive
probe for the quantum dot dynamics. Our work points out a powerful alternative
to conventional spectral-domain measurements for a deeper understanding of the
vacuum Rabi dynamics in quantum dot-based cavity quantum electrodynamics
systems.
|
quant-ph physics.app-ph
|
we report timedomain observation of vacuum rabi oscillations in a single quantum dot strongly coupled to a nanocavity under incoherent optical carrier injection we realize a photonic crystal nanocavity with a very high quality factor of 80000 and employ it to clearly resolve the ultrafast vacuum rabi oscillations by simple photoluminescencebased experiments we found that the timedomain vacuum rabi oscillations were largely modified when changing the pump wavelength and intensity even when marginal changes were detected in the corresponding photoluminescence spectra we analyze the measured timedomain oscillations by fitting to simulation curves obtained with a cavity quantum electrodynamics model the observed modifications of the oscillation curves were mainly induced by the change in the carrier capture and dephasing dynamics in the quantum dot as well as the change in barecavity emission this result suggests that vacuum rabi oscillations can be utilized as a highly sensitive probe for the quantum dot dynamics our work points out a powerful alternative to conventional spectraldomain measurements for a deeper understanding of the vacuum rabi dynamics in quantum dotbased cavity quantum electrodynamics systems
|
[['we', 'report', 'timedomain', 'observation', 'of', 'vacuum', 'rabi', 'oscillations', 'in', 'a', 'single', 'quantum', 'dot', 'strongly', 'coupled', 'to', 'a', 'nanocavity', 'under', 'incoherent', 'optical', 'carrier', 'injection', 'we', 'realize', 'a', 'photonic', 'crystal', 'nanocavity', 'with', 'a', 'very', 'high', 'quality', 'factor', 'of', '80000', 'and', 'employ', 'it', 'to', 'clearly', 'resolve', 'the', 'ultrafast', 'vacuum', 'rabi', 'oscillations', 'by', 'simple', 'photoluminescencebased', 'experiments', 'we', 'found', 'that', 'the', 'timedomain', 'vacuum', 'rabi', 'oscillations', 'were', 'largely', 'modified', 'when', 'changing', 'the', 'pump', 'wavelength', 'and', 'intensity', 'even', 'when', 'marginal', 'changes', 'were', 'detected', 'in', 'the', 'corresponding', 'photoluminescence', 'spectra', 'we', 'analyze', 'the', 'measured', 'timedomain', 'oscillations', 'by', 'fitting', 'to', 'simulation', 'curves', 'obtained', 'with', 'a', 'cavity', 'quantum', 'electrodynamics', 'model', 'the', 'observed', 'modifications', 'of', 'the', 'oscillation', 'curves', 'were', 'mainly', 'induced', 'by', 'the', 'change', 'in', 'the', 'carrier', 'capture', 'and', 'dephasing', 'dynamics', 'in', 'the', 'quantum', 'dot', 'as', 'well', 'as', 'the', 'change', 'in', 'barecavity', 'emission', 'this', 'result', 'suggests', 'that', 'vacuum', 'rabi', 'oscillations', 'can', 'be', 'utilized', 'as', 'a', 'highly', 'sensitive', 'probe', 'for', 'the', 'quantum', 'dot', 'dynamics', 'our', 'work', 'points', 'out', 'a', 'powerful', 'alternative', 'to', 'conventional', 'spectraldomain', 'measurements', 'for', 'a', 'deeper', 'understanding', 'of', 'the', 'vacuum', 'rabi', 'dynamics', 'in', 'quantum', 'dotbased', 'cavity', 'quantum', 'electrodynamics', 'systems']]
|
[-0.13577538965248756, 0.2095233206339551, -0.0658791444095021, 0.05852399140051354, -0.02158130152119239, -0.1858022987223442, 0.05254961419863817, 0.399258651426697, -0.232805915706029, -0.2994730251375586, 0.03054498399102489, -0.24605730977914805, -0.11866796316197989, 0.26275983918325935, -0.013686884057030758, 0.07305416059468618, 0.056258848853758536, -0.06307407015066763, -0.031996661727052095, -0.15083696690800769, 0.2464723585878594, 0.07853023132057305, 0.3260125553298911, 0.005977056230966065, 0.08524526916814713, -0.022255544500446624, 0.06583776527126743, -0.0068837345381987025, -0.10845066078582022, 0.04369500161659413, 0.2538377738488965, -0.01905489564457887, 0.21421314430931074, -0.442442158004269, -0.23581194716230544, 0.050136275225668214, 0.1527503026498545, 0.19271798515017674, -0.06247134777831062, -0.3267269417979564, -0.01344520616922554, -0.10905938985392409, -0.11267321806438056, -0.08679191492212174, -0.03969968548467891, -0.015747497355650095, -0.23184350069442933, 0.07780232929111332, -0.007159036324909804, 0.03861787744840099, -0.014343890323123725, 0.0038134195902702313, 0.04069461300836834, 0.05622871914403566, -0.029827629306634084, 0.020403408211264337, 0.21708799188490957, -0.10527259622705804, -0.15495881612613713, 0.37263795401403593, -0.1616226260137575, -0.11478066419757935, 0.12096850340789057, -0.2260193699224725, -0.030173596533131786, 0.15301211081863253, 0.10635569391921638, 0.09762190649582242, -0.12465659784373367, 0.03526928220559388, 0.016407865784871814, 0.23226199443822473, 0.09279123094231843, 0.12727297732437198, 0.2463765287115662, 0.15130384606031425, -0.013880062401188876, 0.14280338837786324, -0.11267865559123245, -0.08691509269357828, -0.24950288476115515, -0.11152145771649719, -0.18454763429657428, 0.13898375815055755, -0.02829756897740894, -0.1653406991972588, 0.4584951059924523, 0.1142408457023769, 0.16471550196134063, -0.044360659675228155, 0.29928692677375773, 0.1511041938958277, 0.06144433145792308, 0.007017863067713651, 0.3324056789278984, 0.16966080499696545, 0.12024732091231272, -0.3704115442444824, -0.02110014980346684, -0.059087771266190844]
|
1,803.05619
|
Fast End-to-End Trainable Guided Filter
|
Dense pixel-wise image prediction has been advanced by harnessing the
capabilities of Fully Convolutional Networks (FCNs). One central issue of FCNs
is the limited capacity to handle joint upsampling. To address the problem, we
present a novel building block for FCNs, namely guided filtering layer, which
is designed for efficiently generating a high-resolution output given the
corresponding low-resolution one and a high-resolution guidance map. Such a
layer contains learnable parameters, which can be integrated with FCNs and
jointly optimized through end-to-end training. To further take advantage of
end-to-end training, we plug in a trainable transformation function for
generating the task-specific guidance map. Based on the proposed layer, we
present a general framework for pixel-wise image prediction, named deep guided
filtering network (DGF). The proposed network is evaluated on five image
processing tasks. Experiments on MIT-Adobe FiveK Dataset demonstrate that DGF
runs 10-100 times faster and achieves the state-of-the-art performance. We also
show that DGF helps to improve the performance of multiple computer vision
tasks.
|
cs.CV
|
dense pixelwise image prediction has been advanced by harnessing the capabilities of fully convolutional networks fcns one central issue of fcns is the limited capacity to handle joint upsampling to address the problem we present a novel building block for fcns namely guided filtering layer which is designed for efficiently generating a highresolution output given the corresponding lowresolution one and a highresolution guidance map such a layer contains learnable parameters which can be integrated with fcns and jointly optimized through endtoend training to further take advantage of endtoend training we plug in a trainable transformation function for generating the taskspecific guidance map based on the proposed layer we present a general framework for pixelwise image prediction named deep guided filtering network dgf the proposed network is evaluated on five image processing tasks experiments on mitadobe fivek dataset demonstrate that dgf runs 10100 times faster and achieves the stateoftheart performance we also show that dgf helps to improve the performance of multiple computer vision tasks
|
[['dense', 'pixelwise', 'image', 'prediction', 'has', 'been', 'advanced', 'by', 'harnessing', 'the', 'capabilities', 'of', 'fully', 'convolutional', 'networks', 'fcns', 'one', 'central', 'issue', 'of', 'fcns', 'is', 'the', 'limited', 'capacity', 'to', 'handle', 'joint', 'upsampling', 'to', 'address', 'the', 'problem', 'we', 'present', 'a', 'novel', 'building', 'block', 'for', 'fcns', 'namely', 'guided', 'filtering', 'layer', 'which', 'is', 'designed', 'for', 'efficiently', 'generating', 'a', 'highresolution', 'output', 'given', 'the', 'corresponding', 'lowresolution', 'one', 'and', 'a', 'highresolution', 'guidance', 'map', 'such', 'a', 'layer', 'contains', 'learnable', 'parameters', 'which', 'can', 'be', 'integrated', 'with', 'fcns', 'and', 'jointly', 'optimized', 'through', 'endtoend', 'training', 'to', 'further', 'take', 'advantage', 'of', 'endtoend', 'training', 'we', 'plug', 'in', 'a', 'trainable', 'transformation', 'function', 'for', 'generating', 'the', 'taskspecific', 'guidance', 'map', 'based', 'on', 'the', 'proposed', 'layer', 'we', 'present', 'a', 'general', 'framework', 'for', 'pixelwise', 'image', 'prediction', 'named', 'deep', 'guided', 'filtering', 'network', 'dgf', 'the', 'proposed', 'network', 'is', 'evaluated', 'on', 'five', 'image', 'processing', 'tasks', 'experiments', 'on', 'mitadobe', 'fivek', 'dataset', 'demonstrate', 'that', 'dgf', 'runs', '10100', 'times', 'faster', 'and', 'achieves', 'the', 'stateoftheart', 'performance', 'we', 'also', 'show', 'that', 'dgf', 'helps', 'to', 'improve', 'the', 'performance', 'of', 'multiple', 'computer', 'vision', 'tasks']]
|
[-0.05225871666476539, -0.043019550075547246, -0.04098545807618194, 0.028648411222803122, -0.11219658636879858, -0.18584608131020172, 0.000727298857627164, 0.49894852877208373, -0.27410071678800374, -0.3204137295507258, 0.06807802832421347, -0.23208077580003614, -0.20763331105529398, 0.1845371383355885, -0.12674029949745844, 0.15657719088923797, 0.17738224585219742, 0.014318628661496361, -0.07896354998087102, -0.2760474075529179, 0.25878719749247153, 0.07863197177943132, 0.35976387935877985, 0.01411456404581791, 0.21316102673526763, -0.01768392591084859, -0.038005718558163544, -0.03150940922844201, -0.049440399835630824, 0.1876758580591541, 0.3050232792380351, 0.1992162958017505, 0.31833550644606895, -0.450904415023127, -0.2821962855750604, 0.05199909511181276, 0.1694597737244671, 0.07289050167806946, -0.06521335654684751, -0.3298323595521563, 0.12776426383771183, -0.16496254943833663, 0.07250264317376494, -0.13063219437381343, -0.060044455775002975, -0.04510453462078259, -0.35411401482003674, 0.0027853980809817496, 0.06019138996120224, 0.03017156600679566, -0.028391909302871037, -0.09209234737038681, 0.031249733766677175, 0.1916357197815825, -0.07891002735662524, 0.09445066819614845, 0.1601838092887547, -0.19776725933000464, -0.10523052191895592, 0.32512121235315755, -0.07336730391025634, -0.20651750528344476, 0.13998037040455086, 0.011205296771793922, -0.15457267493077712, 0.11470109298995627, 0.2462938211531032, 0.10595299771748393, -0.1705219198356201, -0.005299530606418735, -0.04009888541782502, 0.21817460910150235, 0.056519167777434806, -0.018384282970989107, 0.17456526321745136, 0.3082490304496321, 0.04112575640057202, 0.18608584980659254, -0.18989488457186893, -0.039111316545508666, -0.1737158307817858, -0.128282798229853, -0.20334207386533706, -0.05029825158076497, -0.10137888916639295, -0.11279503582045436, 0.4314035084268941, 0.23726153416309234, 0.22642499775194178, 0.14206480478055822, 0.3736542482780883, 0.04770509022424316, 0.17684783871717205, 0.0954587087404301, 0.1733590426922935, 0.01146393976310586, 0.10834836350255589, -0.1525625685661486, 0.046325538193852434, 0.09699254152762544]
|
1,803.0562
|
Large-scale intermittency and rare events boosted at dimensional
crossover in anisotropic turbulence
|
Understanding rare events in turbulence provides a basis for the science of
extreme weather, for which the atmosphere is modeled by Navier-Stokes equations
(NSEs). In solutions of NSEs for isotropic fluids, various quantities, such as
fluid velocities, roughly follow Gaussian distributions, where extreme events
are prominent only in small-scale quantities associated with the
dissipation-dominating length scale or anomalous scaling regime. Using
numerical simulations, this study reveals another universal promotion mechanism
at much larger scales if three-dimensional fluids accompany strong
two-dimensional anisotropies, as is the case in the atmosphere. The dimensional
crossover between two and three dimensions generates prominent fat-tailed
non-Gaussian distributions with intermittency accompanied by colossal
chain-like structures with densely populated self-organized vortices
(serpentinely organized vortices (SOV)). The promotion is caused by a sudden
increase of the available phase space at the crossover length scale. Since the
discovered intermittency can involve much larger energies than those in the
conventional intermittency in small spatial scales, it governs extreme events
and chaotic unpredictability in the synoptic weather system.
|
physics.flu-dyn
|
understanding rare events in turbulence provides a basis for the science of extreme weather for which the atmosphere is modeled by navierstokes equations nses in solutions of nses for isotropic fluids various quantities such as fluid velocities roughly follow gaussian distributions where extreme events are prominent only in smallscale quantities associated with the dissipationdominating length scale or anomalous scaling regime using numerical simulations this study reveals another universal promotion mechanism at much larger scales if threedimensional fluids accompany strong twodimensional anisotropies as is the case in the atmosphere the dimensional crossover between two and three dimensions generates prominent fattailed nongaussian distributions with intermittency accompanied by colossal chainlike structures with densely populated selforganized vortices serpentinely organized vortices sov the promotion is caused by a sudden increase of the available phase space at the crossover length scale since the discovered intermittency can involve much larger energies than those in the conventional intermittency in small spatial scales it governs extreme events and chaotic unpredictability in the synoptic weather system
|
[['understanding', 'rare', 'events', 'in', 'turbulence', 'provides', 'a', 'basis', 'for', 'the', 'science', 'of', 'extreme', 'weather', 'for', 'which', 'the', 'atmosphere', 'is', 'modeled', 'by', 'navierstokes', 'equations', 'nses', 'in', 'solutions', 'of', 'nses', 'for', 'isotropic', 'fluids', 'various', 'quantities', 'such', 'as', 'fluid', 'velocities', 'roughly', 'follow', 'gaussian', 'distributions', 'where', 'extreme', 'events', 'are', 'prominent', 'only', 'in', 'smallscale', 'quantities', 'associated', 'with', 'the', 'dissipationdominating', 'length', 'scale', 'or', 'anomalous', 'scaling', 'regime', 'using', 'numerical', 'simulations', 'this', 'study', 'reveals', 'another', 'universal', 'promotion', 'mechanism', 'at', 'much', 'larger', 'scales', 'if', 'threedimensional', 'fluids', 'accompany', 'strong', 'twodimensional', 'anisotropies', 'as', 'is', 'the', 'case', 'in', 'the', 'atmosphere', 'the', 'dimensional', 'crossover', 'between', 'two', 'and', 'three', 'dimensions', 'generates', 'prominent', 'fattailed', 'nongaussian', 'distributions', 'with', 'intermittency', 'accompanied', 'by', 'colossal', 'chainlike', 'structures', 'with', 'densely', 'populated', 'selforganized', 'vortices', 'serpentinely', 'organized', 'vortices', 'sov', 'the', 'promotion', 'is', 'caused', 'by', 'a', 'sudden', 'increase', 'of', 'the', 'available', 'phase', 'space', 'at', 'the', 'crossover', 'length', 'scale', 'since', 'the', 'discovered', 'intermittency', 'can', 'involve', 'much', 'larger', 'energies', 'than', 'those', 'in', 'the', 'conventional', 'intermittency', 'in', 'small', 'spatial', 'scales', 'it', 'governs', 'extreme', 'events', 'and', 'chaotic', 'unpredictability', 'in', 'the', 'synoptic', 'weather', 'system']]
|
[-0.16795330351536594, 0.27088937939644403, -0.04681680557068165, 0.15492147873808834, -0.014705071518220371, -0.11568956724197672, -0.05302528814957818, 0.2961188667885414, -0.25591413921778794, -0.30334288061301157, 0.05793342362058621, -0.28956436530811847, -0.14243985492616845, 0.21255764771656066, 0.005568556889335103, 0.035353808939562, 0.024274221144434883, -0.03272349668933624, -0.02345669912330511, -0.1635850242199944, 0.312400937798751, 0.10590894093237273, 0.30623890904187245, -0.04063648639087815, 0.07590640072495018, -0.0779492261652017, -0.045081643587852854, 0.04935818950474552, -0.12556195320851146, -0.0014959592457360973, 0.23439926071384945, 0.008590263687216155, 0.2512967648984092, -0.4361837297655279, -0.29003204951607964, 0.07379830956300039, 0.1725354530428332, 0.06871375579474971, -0.004652475541395067, -0.2800774718308253, 0.007049772184251285, -0.13856946773793002, -0.14827524208628415, -0.0631273738775834, 0.0682726338784006, 0.03532056977103532, -0.2600131269726085, 0.18394330636564096, 0.053803688125321415, 0.12561254965697938, -0.04258294084404663, -0.07596904182133674, -0.04360935658503256, 0.0746915531649947, 0.07670653458094089, -0.005044582935913307, 0.13566520758734152, -0.16164525679694014, -0.08760977269536475, 0.41441059532779745, -0.048371272909518176, -0.13629865743469718, 0.2272983503062278, -0.21962281490573887, -0.12013711377966968, 0.19473396231443052, 0.17770441073112236, 0.06812461466448973, -0.0914630034021684, 0.015485539656876383, -0.020959644294457465, 0.14969150367102063, 0.07198675712531506, 0.05655048017549079, 0.24486876538068783, 0.2039458179426175, 0.04457905677874095, 0.118584459766791, -0.11105560461980597, -0.16780772544273242, -0.256251103994323, -0.0933696850083723, -0.169381155138381, 0.06085834410978572, -0.12212697523003643, -0.17721818566958353, 0.3489797429192993, 0.15096728770962417, 0.20481225419590796, -0.026659371956711544, 0.2384955478071167, 0.1025924830677601, 0.08048271942065983, 0.11059797694906592, 0.21825593400735227, 0.07739172739022207, 0.18201614378258676, -0.17406723551770173, 0.09414640860916001, 0.07093271532482127]
|
1,803.05621
|
Proximal SCOPE for Distributed Sparse Learning: Better Data Partition
Implies Faster Convergence Rate
|
Distributed sparse learning with a cluster of multiple machines has attracted
much attention in machine learning, especially for large-scale applications
with high-dimensional data. One popular way to implement sparse learning is to
use $L_1$ regularization. In this paper, we propose a novel method, called
proximal \mbox{SCOPE}~(\mbox{pSCOPE}), for distributed sparse learning with
$L_1$ regularization. pSCOPE is based on a \underline{c}ooperative
\underline{a}utonomous \underline{l}ocal \underline{l}earning~(\mbox{CALL})
framework. In the \mbox{CALL} framework of \mbox{pSCOPE}, we find that the data
partition affects the convergence of the learning procedure, and subsequently
we define a metric to measure the goodness of a data partition. Based on the
defined metric, we theoretically prove that pSCOPE is convergent with a linear
convergence rate if the data partition is good enough. We also prove that
better data partition implies faster convergence rate. Furthermore, pSCOPE is
also communication efficient. Experimental results on real data sets show that
pSCOPE can outperform other state-of-the-art distributed methods for sparse
learning.
|
stat.ML cs.LG
|
distributed sparse learning with a cluster of multiple machines has attracted much attention in machine learning especially for largescale applications with highdimensional data one popular way to implement sparse learning is to use l_1 regularization in this paper we propose a novel method called proximal mboxscopemboxpscope for distributed sparse learning with l_1 regularization pscope is based on a underlinecooperative underlineautonomous underlinelocal underlinelearningmboxcall framework in the mboxcall framework of mboxpscope we find that the data partition affects the convergence of the learning procedure and subsequently we define a metric to measure the goodness of a data partition based on the defined metric we theoretically prove that pscope is convergent with a linear convergence rate if the data partition is good enough we also prove that better data partition implies faster convergence rate furthermore pscope is also communication efficient experimental results on real data sets show that pscope can outperform other stateoftheart distributed methods for sparse learning
|
[['distributed', 'sparse', 'learning', 'with', 'a', 'cluster', 'of', 'multiple', 'machines', 'has', 'attracted', 'much', 'attention', 'in', 'machine', 'learning', 'especially', 'for', 'largescale', 'applications', 'with', 'highdimensional', 'data', 'one', 'popular', 'way', 'to', 'implement', 'sparse', 'learning', 'is', 'to', 'use', 'l_1', 'regularization', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'method', 'called', 'proximal', 'mboxscopemboxpscope', 'for', 'distributed', 'sparse', 'learning', 'with', 'l_1', 'regularization', 'pscope', 'is', 'based', 'on', 'a', 'underlinecooperative', 'underlineautonomous', 'underlinelocal', 'underlinelearningmboxcall', 'framework', 'in', 'the', 'mboxcall', 'framework', 'of', 'mboxpscope', 'we', 'find', 'that', 'the', 'data', 'partition', 'affects', 'the', 'convergence', 'of', 'the', 'learning', 'procedure', 'and', 'subsequently', 'we', 'define', 'a', 'metric', 'to', 'measure', 'the', 'goodness', 'of', 'a', 'data', 'partition', 'based', 'on', 'the', 'defined', 'metric', 'we', 'theoretically', 'prove', 'that', 'pscope', 'is', 'convergent', 'with', 'a', 'linear', 'convergence', 'rate', 'if', 'the', 'data', 'partition', 'is', 'good', 'enough', 'we', 'also', 'prove', 'that', 'better', 'data', 'partition', 'implies', 'faster', 'convergence', 'rate', 'furthermore', 'pscope', 'is', 'also', 'communication', 'efficient', 'experimental', 'results', 'on', 'real', 'data', 'sets', 'show', 'that', 'pscope', 'can', 'outperform', 'other', 'stateoftheart', 'distributed', 'methods', 'for', 'sparse', 'learning']]
|
[-0.06751703130509201, 0.009185910317732172, -0.12206878993861578, 0.07865609003646248, -0.11594781843548943, -0.16897707137379897, 0.029581570640525693, 0.4549729205365922, -0.30027658957988024, -0.2318791547488119, 0.10119597241361122, -0.25711751532091165, -0.19669912895659689, 0.2208740492980625, -0.13080847057564235, 0.1114404264308915, 0.12590765814624122, 0.07514567360143505, -0.09367504966999027, -0.30013345081258463, 0.3058730078942923, 0.035006646532565355, 0.3554625268710928, 0.014163349764547436, 0.12271780921995791, -0.0005133569215399188, -0.0074443635247597425, 0.02378239147239239, -0.09825069154711044, 0.20275529621269656, 0.29413069414314685, 0.23420894971570452, 0.36899324356754487, -0.3765419133234064, -0.1868611656355898, 0.1526224534688014, 0.1680211525385243, 0.06819292012526579, -0.09399319057765014, -0.2372100732503207, 0.13177771094362126, -0.15304513833787595, -0.022089496849779656, -0.1821629499097833, -0.02879180176485632, 0.005028308745995919, -0.3692512808027803, 0.052182782985304633, 0.03326400354303218, 0.02655067971932727, -0.03385466593003052, -0.09625607498644574, 0.06222951155221971, 0.06665723784700842, 0.04374059456922869, 0.08054695468131653, 0.0997924767277279, -0.08301391072509924, -0.14085437276878873, 0.350107932600155, -0.07723464687807939, -0.22684508030982437, 0.1817137415652994, -0.03750324058755477, -0.202371551647367, 0.07382957564314475, 0.24726433277356666, 0.14474542729707585, -0.1358602755526836, 0.09326501718896907, -0.07322059255573156, 0.14800544076511082, -0.008322307226449452, 0.015378878838886079, 0.09054569564004605, 0.23347704998544744, 0.12120389690421321, 0.1595647594489541, -0.10410394785906868, -0.10156197547031617, -0.20056882994980993, -0.11262643803540315, -0.2373989199074237, -0.023058053732195216, -0.14801783095626397, -0.18300644510954217, 0.33370852407470747, 0.19891121345603638, 0.22204416095769988, 0.15209006576018558, 0.34233788372413887, 0.07200202685025697, 0.07656240619080318, 0.15665090237932935, 0.18912667920812964, 0.07985354392361399, 0.06636795200520774, -0.18144008093647268, 0.05613371080638702, 0.07566175405844587]
|
1,803.05622
|
Strong Coupling Nature of the Excitonic Insulator State in
Ta$_2$NiSe$_5$
|
We analyze the measured optical conductivity spectra using the
density-functional-theory-based electronic structure calculation and
density-matrix renormalization group calculation of an effective model. We show
that, in contrast to a conventional description, the Bose-Einstein condensation
of preformed excitons occurs in Ta$_2$NiSe$_5$, despite the fact that a
noninteracting band structure is a band-overlap semimetal rather than a small
band-gap semiconductor. The system above the transition temperature is
therefore not a semimetal, but rather a state of preformed excitons with a
finite band gap. A novel insulator state caused by the strong electron-hole
attraction is thus established in a real material.
|
cond-mat.str-el cond-mat.mtrl-sci
|
we analyze the measured optical conductivity spectra using the densityfunctionaltheorybased electronic structure calculation and densitymatrix renormalization group calculation of an effective model we show that in contrast to a conventional description the boseeinstein condensation of preformed excitons occurs in ta_2nise_5 despite the fact that a noninteracting band structure is a bandoverlap semimetal rather than a small bandgap semiconductor the system above the transition temperature is therefore not a semimetal but rather a state of preformed excitons with a finite band gap a novel insulator state caused by the strong electronhole attraction is thus established in a real material
|
[['we', 'analyze', 'the', 'measured', 'optical', 'conductivity', 'spectra', 'using', 'the', 'densityfunctionaltheorybased', 'electronic', 'structure', 'calculation', 'and', 'densitymatrix', 'renormalization', 'group', 'calculation', 'of', 'an', 'effective', 'model', 'we', 'show', 'that', 'in', 'contrast', 'to', 'a', 'conventional', 'description', 'the', 'boseeinstein', 'condensation', 'of', 'preformed', 'excitons', 'occurs', 'in', 'ta_2nise_5', 'despite', 'the', 'fact', 'that', 'a', 'noninteracting', 'band', 'structure', 'is', 'a', 'bandoverlap', 'semimetal', 'rather', 'than', 'a', 'small', 'bandgap', 'semiconductor', 'the', 'system', 'above', 'the', 'transition', 'temperature', 'is', 'therefore', 'not', 'a', 'semimetal', 'but', 'rather', 'a', 'state', 'of', 'preformed', 'excitons', 'with', 'a', 'finite', 'band', 'gap', 'a', 'novel', 'insulator', 'state', 'caused', 'by', 'the', 'strong', 'electronhole', 'attraction', 'is', 'thus', 'established', 'in', 'a', 'real', 'material']]
|
[-0.1915736765843075, 0.18631505109242055, -0.1006287212563175, 0.04853015152941819, -0.02348611184766478, -0.1488687435535676, 0.12446830548555116, 0.3994510246117656, -0.23871566909270323, -0.2402895631800805, -0.0302717452429292, -0.3098357784922938, -0.14057412633330238, 0.13991481709360545, 0.0554521700025213, -0.007510933084223344, 0.01828088959660001, -0.03809014626313001, -0.13227488218844696, -0.14447994787027413, 0.3046219709177254, 0.0160228521278014, 0.3328329799126606, 0.12025458199846349, 0.0168697720011031, -0.011164135111933003, 0.14242081652034302, 0.03621661096540451, -0.1205710684507907, 0.0641178124470218, 0.2485180042793366, -0.12433831230262105, 0.25752495866439934, -0.386598227545619, -0.2464692438572493, 0.044397572190880925, 0.15759206306407875, 0.18689350590432938, -0.12293665930248644, -0.31767129069384265, 0.04509541289215641, -0.21793348598531542, -0.10677055643671858, -0.08258515057553138, -0.016088074282267873, -0.07937923149794948, -0.2159504486278783, 0.10754367832554153, 0.023735898912751248, 0.07135619038397599, -0.11882855934423528, -0.06173088993017124, -0.0745235009556066, 0.013728593143501453, 0.0002694280012700783, 0.03049990961955366, 0.15725902124897254, -0.1615625183758497, -0.06859447998089754, 0.4323820905398805, -0.08998635920950768, -0.062056646264177194, 0.17196452640453164, -0.1662382433257465, -0.005146397344235863, 0.21501759698196332, 0.0634278287221345, 0.10031346132389593, -0.13181800084611478, 0.09086584363415438, -0.08645979537419518, 0.22698461646404194, -0.024041861328961595, 0.08593629410832512, 0.23069750983268023, 0.21664252632882028, 0.03135647346284621, 0.1341315689912465, -0.058693153595989, -0.06664539591589828, -0.23315002346810484, -0.1865608086661027, -0.3044562651633228, 0.08586814972154477, -0.009865747769309768, -0.2417559963698518, 0.42136777921731833, 0.11458232539838978, 0.21398543437220613, -0.01698360651047254, 0.2523014022427022, 0.15198357938313667, 0.0833422352217746, 0.03207278846078837, 0.26203521643290106, 0.14968711376541807, 0.08148302208176073, -0.2719585135631377, 0.03271155373421403, 0.05430406135297856]
|
1,803.05623
|
Long-Term Cyclicities in Phanerozoic Sea-Level Sedimentary Record and
their Potential Drivers (Does the Phanerozoic sea level encode the motion of
solar system in the Milky Way ?)
|
Cyclic sedimentation has varied at several timescales and this variability
has been geologically well documented at Milankovitch timescales, controlled in
part by climatically (insolation) driven sea-level changes. At the longer (tens
of Myr) timescales connection between astronomical parameters and sedimentation
via cyclic solar-system motions within the Milky Way has also been proposed,
but this hypothesis remains controversial because of the lack of long
geological records. The absence of a physical mechanism that could explain the
connection between climate and astronomy at these longer timescales led to the
explanation of plate motions as the main driver of climate on Earth.
Here we statistically show a prominent and persistent ~36 Myr sedimentary
cyclicity superimposed on two megacycles (~250 Myr) in a relatively
well-constrained sea-level (SL) record of the past 542 Myr (Phanerozoic eon).
Given the possible link between amplitudes of the ~36 and ~250 Myr
cyclicities in SL record and the potential that these periodicities fall into
the frequency band of solar system motions, we suggest an astronomical origin,
and model these periodicities as originating from the path of the solar system
in the Milky Way as vertical and radial periods that modulate the flux of
cosmic rays on Earth. Our finding of the ~36 Myr SL cyclicity lends credibility
to the existing hypothesis about the imprint of solar-system vertical period on
the geological record. The ~250 Myr megacycles are tentatively attributed to a
radial period. However, the tectonic drivers also remain potentially plausible.
The potential existence of a correlation between the modeled astronomical
signal and the geological record may offer an indirect proxy to understand the
structure and history of the Milky Way by providing a 542 Myr long record of
the path of the Sun in our Galaxy.
|
astro-ph.EP astro-ph.GA astro-ph.HE
|
cyclic sedimentation has varied at several timescales and this variability has been geologically well documented at milankovitch timescales controlled in part by climatically insolation driven sealevel changes at the longer tens of myr timescales connection between astronomical parameters and sedimentation via cyclic solarsystem motions within the milky way has also been proposed but this hypothesis remains controversial because of the lack of long geological records the absence of a physical mechanism that could explain the connection between climate and astronomy at these longer timescales led to the explanation of plate motions as the main driver of climate on earth here we statistically show a prominent and persistent 36 myr sedimentary cyclicity superimposed on two megacycles 250 myr in a relatively wellconstrained sealevel sl record of the past 542 myr phanerozoic eon given the possible link between amplitudes of the 36 and 250 myr cyclicities in sl record and the potential that these periodicities fall into the frequency band of solar system motions we suggest an astronomical origin and model these periodicities as originating from the path of the solar system in the milky way as vertical and radial periods that modulate the flux of cosmic rays on earth our finding of the 36 myr sl cyclicity lends credibility to the existing hypothesis about the imprint of solarsystem vertical period on the geological record the 250 myr megacycles are tentatively attributed to a radial period however the tectonic drivers also remain potentially plausible the potential existence of a correlation between the modeled astronomical signal and the geological record may offer an indirect proxy to understand the structure and history of the milky way by providing a 542 myr long record of the path of the sun in our galaxy
|
[['cyclic', 'sedimentation', 'has', 'varied', 'at', 'several', 'timescales', 'and', 'this', 'variability', 'has', 'been', 'geologically', 'well', 'documented', 'at', 'milankovitch', 'timescales', 'controlled', 'in', 'part', 'by', 'climatically', 'insolation', 'driven', 'sealevel', 'changes', 'at', 'the', 'longer', 'tens', 'of', 'myr', 'timescales', 'connection', 'between', 'astronomical', 'parameters', 'and', 'sedimentation', 'via', 'cyclic', 'solarsystem', 'motions', 'within', 'the', 'milky', 'way', 'has', 'also', 'been', 'proposed', 'but', 'this', 'hypothesis', 'remains', 'controversial', 'because', 'of', 'the', 'lack', 'of', 'long', 'geological', 'records', 'the', 'absence', 'of', 'a', 'physical', 'mechanism', 'that', 'could', 'explain', 'the', 'connection', 'between', 'climate', 'and', 'astronomy', 'at', 'these', 'longer', 'timescales', 'led', 'to', 'the', 'explanation', 'of', 'plate', 'motions', 'as', 'the', 'main', 'driver', 'of', 'climate', 'on', 'earth', 'here', 'we', 'statistically', 'show', 'a', 'prominent', 'and', 'persistent', '36', 'myr', 'sedimentary', 'cyclicity', 'superimposed', 'on', 'two', 'megacycles', '250', 'myr', 'in', 'a', 'relatively', 'wellconstrained', 'sealevel', 'sl', 'record', 'of', 'the', 'past', '542', 'myr', 'phanerozoic', 'eon', 'given', 'the', 'possible', 'link', 'between', 'amplitudes', 'of', 'the', '36', 'and', '250', 'myr', 'cyclicities', 'in', 'sl', 'record', 'and', 'the', 'potential', 'that', 'these', 'periodicities', 'fall', 'into', 'the', 'frequency', 'band', 'of', 'solar', 'system', 'motions', 'we', 'suggest', 'an', 'astronomical', 'origin', 'and', 'model', 'these', 'periodicities', 'as', 'originating', 'from', 'the', 'path', 'of', 'the', 'solar', 'system', 'in', 'the', 'milky', 'way', 'as', 'vertical', 'and', 'radial', 'periods', 'that', 'modulate', 'the', 'flux', 'of', 'cosmic', 'rays', 'on', 'earth', 'our', 'finding', 'of', 'the', '36', 'myr', 'sl', 'cyclicity', 'lends', 'credibility', 'to', 'the', 'existing', 'hypothesis', 'about', 'the', 'imprint', 'of', 'solarsystem', 'vertical', 'period', 'on', 'the', 'geological', 'record', 'the', '250', 'myr', 'megacycles', 'are', 'tentatively', 'attributed', 'to', 'a', 'radial', 'period', 'however', 'the', 'tectonic', 'drivers', 'also', 'remain', 'potentially', 'plausible', 'the', 'potential', 'existence', 'of', 'a', 'correlation', 'between', 'the', 'modeled', 'astronomical', 'signal', 'and', 'the', 'geological', 'record', 'may', 'offer', 'an', 'indirect', 'proxy', 'to', 'understand', 'the', 'structure', 'and', 'history', 'of', 'the', 'milky', 'way', 'by', 'providing', 'a', '542', 'myr', 'long', 'record', 'of', 'the', 'path', 'of', 'the', 'sun', 'in', 'our', 'galaxy']]
|
[-0.11850578859660098, 0.17258741061451074, -0.09109838324310168, 0.09395833353437093, -0.08258700959540748, -0.024618610598055736, 0.07224198307726415, 0.3965223007640065, -0.28457003700957223, -0.374579784173805, 0.10645059744747669, -0.22273004354985995, -0.08527073739715234, 0.2461146518850204, -0.05320150712163064, -0.02529444754240917, 0.08122164404981971, -0.008436724234216071, -0.012437969680437557, -0.2244213851912833, 0.2061850211145096, 0.10616704346135851, 0.1563311370701848, 0.03978824301727012, 0.0873336682203584, -0.08543338859209569, -0.07686329271153455, -0.08176917366527177, -0.13389209433500163, 0.06953445792431114, 0.21588511968689314, 0.11739354202372407, 0.2566672147575675, -0.4470682166568883, -0.2378701074146568, 0.06861863016359808, 0.13566508735477162, 0.022065717136728336, -0.030263764658369698, -0.2703797899225688, 0.03860140634620061, -0.17331898585613165, -0.14942985683861937, 0.06015404326054821, 0.12151239810949452, -0.008758066881894153, -0.17176325361254963, 0.14910246773156455, 0.030670854118506105, 0.1723225123446005, -0.14742516382998125, -0.09639684182764324, -0.03881043302940557, 0.1345965180430444, 0.11142545723143828, 0.04090739557213456, 0.1539207057070013, -0.045120462421099884, -0.09652921594854386, 0.4001334479210534, -0.09945787154577698, -0.011090657491419282, 0.25296140870834877, -0.19523143079913372, -0.12061741687648464, 0.13295878298007524, 0.14228425211748563, 0.05278669737183352, -0.19592567731710184, -0.006140888003075586, -0.014328996985466903, 0.18753889884956024, 0.11212786627848717, 0.04757211348975046, 0.3533439619474905, 0.18050732811704487, 0.05475803714659117, 0.03024386583625541, -0.21957650675822596, -0.09054879985057335, -0.23176569057875998, -0.10406393031638532, -0.09194431920581451, 0.08847308440469336, -0.09916501376121321, -0.14640912104404524, 0.40364843266983547, 0.18258218582811353, 0.18694971387202924, 0.025562977345035105, 0.24954452376057218, 0.01977327085788837, 0.11686006433607675, 0.07700324547243015, 0.2799921635785824, 0.1254278123476445, 0.10608688617854581, -0.21425531836229839, 0.15572485554526996, -0.025389341865438265]
|
1,803.05624
|
Covariants of binary sextics and modular forms of degree 2 with
character
|
We use covariants of binary sextics to describe the structure of modules of
scalar-valued or vector-valued Siegel modular forms of degree 2 with character,
over the ring of scalar-valued Siegel modular forms of even weight. For a
modular form defined by a covariant we express the order of vanishing along the
locus of products of elliptic curves in terms of the covariant.
|
math.AG math.NT
|
we use covariants of binary sextics to describe the structure of modules of scalarvalued or vectorvalued siegel modular forms of degree 2 with character over the ring of scalarvalued siegel modular forms of even weight for a modular form defined by a covariant we express the order of vanishing along the locus of products of elliptic curves in terms of the covariant
|
[['we', 'use', 'covariants', 'of', 'binary', 'sextics', 'to', 'describe', 'the', 'structure', 'of', 'modules', 'of', 'scalarvalued', 'or', 'vectorvalued', 'siegel', 'modular', 'forms', 'of', 'degree', '2', 'with', 'character', 'over', 'the', 'ring', 'of', 'scalarvalued', 'siegel', 'modular', 'forms', 'of', 'even', 'weight', 'for', 'a', 'modular', 'form', 'defined', 'by', 'a', 'covariant', 'we', 'express', 'the', 'order', 'of', 'vanishing', 'along', 'the', 'locus', 'of', 'products', 'of', 'elliptic', 'curves', 'in', 'terms', 'of', 'the', 'covariant']]
|
[-0.2647524372554354, 0.02950508708524848, -0.10390177777697963, 0.02385414680916696, -0.10973763710729056, -0.062424512805357095, -0.03709909611291463, 0.2768455415122932, -0.3212205536903874, -0.17402726670186366, 0.05868535638118403, -0.22038485078261263, -0.20247270736557943, 0.23386064942009868, -0.06610833109927274, 0.028856763081421377, -1.082090555780357e-05, 0.14185805370910995, -0.17667151616150212, -0.3519868546037845, 0.5178694685380305, -0.010454010518808518, 0.1305506621908036, -0.04996527194405996, 0.12378867934908598, 0.08873291350450487, -0.01651743622947364, -0.12337898713867029, -0.08780677475395703, 0.24449387793954944, 0.332717573240159, 0.03599698508098241, 0.16413558414581442, -0.40053523788529055, -0.11365888778480791, 0.15214689612208354, 0.07592161518010881, -0.060319827659235846, 0.054718780834528226, -0.2001568272713602, 0.03421423506111868, -0.21747479771640368, -0.22528083854535175, -0.149351037659442, 0.014724093466816891, 0.06126666339414735, -0.2622850329226499, 0.040351123338745486, 0.08060698362908536, 0.1731882224520368, -0.1360437200825301, -0.12454477467784478, -0.07856947378886323, 0.05111776143988414, -0.04756043988820766, 0.04350446662565152, 0.06747470800614645, -0.19471836405535858, -0.08564598861360742, 0.3332430641317079, -0.1079575992733871, -0.22009047937970008, 0.08537009196175684, -0.1899242392936421, -0.15281606971796963, 0.11982126536238338, 0.1737880319161641, 0.15152655470545492, -0.04511745953876074, 0.16938678580786912, -0.08032092877152947, 0.07733196170339661, 0.18095474634244438, -0.010112603337714268, 0.15289073079944618, 0.035923234682770505, 0.0024570798611215825, 0.18654914548988605, 0.006230124490215413, -0.06870731034113335, -0.3555524760947352, -0.2515533483707376, -0.09536536385290205, 0.10387674971453605, -0.10610127124574877, -0.2167893369952517, 0.4925758007786147, -0.008874148520971499, 0.22391146718854865, 0.13422614474210046, 0.17041959670642692, 0.11766200616294818, 0.1818736143139822, 0.01934162397059657, 0.11853224368044926, 0.22394787340289762, -0.041205990982557374, -0.11170049023724371, 0.015287719320058972, 0.14689813282400851]
|
1,803.05625
|
Thickness-dependent phase transition in graphite under high magnetic
field
|
Various electronic phases emerge when applying high magnetic fields in
graphite. However, the origin of a semimetal-insulator transition at $B \simeq
30\; \textrm{T}$ is still not clear, while an exotic density-wave state is
theoretically proposed. In order to identify the electronic state of the
insulator phase, we investigate the phase transition in thin-film graphite
samples that were fabricated on silicon substrate by a mechanical exfoliation
method. The critical magnetic fields of the semimetal-insulator transition in
thin-film graphite shift to higher magnetic fields, accompanied by a reduction
in temperature dependence. These results can be qualitatively reproduced by a
density-wave model by introducing a quantum size effect. Our findings establish
the electronic state of the insulator phase as a density-wave state standing
along the out-of-plane direction, and help determine the electronic states in
other high-magnetic-field phases.
|
cond-mat.mes-hall
|
various electronic phases emerge when applying high magnetic fields in graphite however the origin of a semimetalinsulator transition at b simeq 30 textrmt is still not clear while an exotic densitywave state is theoretically proposed in order to identify the electronic state of the insulator phase we investigate the phase transition in thinfilm graphite samples that were fabricated on silicon substrate by a mechanical exfoliation method the critical magnetic fields of the semimetalinsulator transition in thinfilm graphite shift to higher magnetic fields accompanied by a reduction in temperature dependence these results can be qualitatively reproduced by a densitywave model by introducing a quantum size effect our findings establish the electronic state of the insulator phase as a densitywave state standing along the outofplane direction and help determine the electronic states in other highmagneticfield phases
|
[['various', 'electronic', 'phases', 'emerge', 'when', 'applying', 'high', 'magnetic', 'fields', 'in', 'graphite', 'however', 'the', 'origin', 'of', 'a', 'semimetalinsulator', 'transition', 'at', 'b', 'simeq', '30', 'textrmt', 'is', 'still', 'not', 'clear', 'while', 'an', 'exotic', 'densitywave', 'state', 'is', 'theoretically', 'proposed', 'in', 'order', 'to', 'identify', 'the', 'electronic', 'state', 'of', 'the', 'insulator', 'phase', 'we', 'investigate', 'the', 'phase', 'transition', 'in', 'thinfilm', 'graphite', 'samples', 'that', 'were', 'fabricated', 'on', 'silicon', 'substrate', 'by', 'a', 'mechanical', 'exfoliation', 'method', 'the', 'critical', 'magnetic', 'fields', 'of', 'the', 'semimetalinsulator', 'transition', 'in', 'thinfilm', 'graphite', 'shift', 'to', 'higher', 'magnetic', 'fields', 'accompanied', 'by', 'a', 'reduction', 'in', 'temperature', 'dependence', 'these', 'results', 'can', 'be', 'qualitatively', 'reproduced', 'by', 'a', 'densitywave', 'model', 'by', 'introducing', 'a', 'quantum', 'size', 'effect', 'our', 'findings', 'establish', 'the', 'electronic', 'state', 'of', 'the', 'insulator', 'phase', 'as', 'a', 'densitywave', 'state', 'standing', 'along', 'the', 'outofplane', 'direction', 'and', 'help', 'determine', 'the', 'electronic', 'states', 'in', 'other', 'highmagneticfield', 'phases']]
|
[-0.17269390323824846, 0.25620486045965607, -0.07236436491401227, 0.009592536445046818, -0.029142186314965696, -0.13660087957005226, 0.11502922370981203, 0.4010410883755826, -0.24795814484871279, -0.31316625278220694, 0.03255469134987902, -0.2851620105081307, -0.12766001439556035, 0.15323307996080604, 0.044134224577348176, 0.018982674797941277, -0.0415838057602714, -0.055850370293622144, -0.10529533413815688, -0.16598556750912719, 0.2860237970486033, -0.003349280440936616, 0.35745293325953076, 0.06129938065171687, 0.014929657381500549, -0.07513010450082817, 0.15964674894044648, 0.02831394386255363, -0.14254101375735811, -0.016586513470496927, 0.26080209200284377, -0.11212927637858067, 0.1990611675654107, -0.48347398186269314, -0.23332259685510018, 0.0032873405056741477, 0.1129420264780438, 0.1687091943189335, -0.10457371776044341, -0.31217057729980896, 0.06593821240839229, -0.13389431052048928, -0.1287391510463681, -0.12377220545565265, -0.0337084302584877, -0.05775615347135784, -0.19897470656268076, 0.09968315552113884, 0.04759179818037369, 0.08826680771950911, -0.11526455841055001, -0.11259292166179685, -0.0907710018427, 0.05061381543337527, 0.022994693482482332, 0.09870411674561563, 0.18131369617489626, -0.15567658536845067, -0.14288001541228992, 0.3725638292007037, -0.056429111496058865, -0.0693061460685263, 0.14478594879967285, -0.1988936546417179, -0.05559078458029387, 0.18724611655412826, 0.0955810368325172, 0.06282184560741506, -0.10824484351221837, 0.02668174100760023, 0.025470860830661076, 0.1828130192554264, 0.026846681445239308, 0.0528837735173918, 0.25756641793231577, 0.19746482110783847, 0.006108329561886503, 0.16461438695168637, -0.09783582081983505, -0.04495728825941793, -0.20502009055205384, -0.19582317997666715, -0.23023755757708048, 0.047886705844521475, -0.07263401843624366, -0.19774415469102896, 0.4276337265106502, 0.16090021466961435, 0.1982937880180109, -0.11232018214302944, 0.2307966139077195, 0.0895912094118157, 0.03453396322812065, 0.01821936406942307, 0.3108482351387615, 0.18986422914156773, 0.12817854571691367, -0.2693239846475311, 0.11328220400097433, 0.024496303794822143]
|
1,803.05626
|
Quantum memory and gates using a Lambda-type quantum emitter coupled to
a chiral waveguide
|
By coupling a $\Lambda$-type quantum emitter to a chiral waveguide, in which
the polarization of a photon is locked to its propagation direction, we propose
a controllable photon-emitter interface for quantum networks. We show that this
chiral system enables the SWAP gate and a hybrid-entangling gate between the
emitter and a flying single photon. It also allows deterministic storage and
retrieval of single-photon states with high fidelities and efficiencies. In
short, this chirally coupled emitter-photon interface can be a critical
building block toward a large-scale quantum network.
|
quant-ph
|
by coupling a lambdatype quantum emitter to a chiral waveguide in which the polarization of a photon is locked to its propagation direction we propose a controllable photonemitter interface for quantum networks we show that this chiral system enables the swap gate and a hybridentangling gate between the emitter and a flying single photon it also allows deterministic storage and retrieval of singlephoton states with high fidelities and efficiencies in short this chirally coupled emitterphoton interface can be a critical building block toward a largescale quantum network
|
[['by', 'coupling', 'a', 'lambdatype', 'quantum', 'emitter', 'to', 'a', 'chiral', 'waveguide', 'in', 'which', 'the', 'polarization', 'of', 'a', 'photon', 'is', 'locked', 'to', 'its', 'propagation', 'direction', 'we', 'propose', 'a', 'controllable', 'photonemitter', 'interface', 'for', 'quantum', 'networks', 'we', 'show', 'that', 'this', 'chiral', 'system', 'enables', 'the', 'swap', 'gate', 'and', 'a', 'hybridentangling', 'gate', 'between', 'the', 'emitter', 'and', 'a', 'flying', 'single', 'photon', 'it', 'also', 'allows', 'deterministic', 'storage', 'and', 'retrieval', 'of', 'singlephoton', 'states', 'with', 'high', 'fidelities', 'and', 'efficiencies', 'in', 'short', 'this', 'chirally', 'coupled', 'emitterphoton', 'interface', 'can', 'be', 'a', 'critical', 'building', 'block', 'toward', 'a', 'largescale', 'quantum', 'network']]
|
[-0.20190638291156468, 0.21111625053865068, -0.04202047106535996, -0.019940425769206793, -0.00044270716470611444, -0.25753748341846994, 0.10550847843234591, 0.47350649365826564, -0.2373912758906098, -0.2713140231064137, 0.00675935809062246, -0.2471396934838541, -0.11843449957668781, 0.18571602801847106, -0.010084868003340328, 0.11060561194180456, 0.03608288959435681, -0.01683986870955457, -0.04213403193554019, -0.15050424929598674, 0.23367799928083138, 0.053921194017097794, 0.3271781684474691, 0.09025164342430585, 0.15486170074299854, -0.0037357240340069814, 0.13374654537285952, -0.056672699287917246, -0.03147478700411739, 0.1294059704626253, 0.26255541741847993, 0.034384290556259016, 0.23261710773496067, -0.43649547238122016, -0.17761775491868748, 0.03275285757639829, 0.14430621236781863, 0.23968162187512088, -0.07423121916020618, -0.3295403890092583, 0.030345626350711374, -0.1810043425682713, -0.07893612826215651, -0.04291233531582882, -0.02435717065270771, -0.03992159781867967, -0.27472925510476615, -0.00322923246969688, 0.02569327632732251, -0.007973998094744542, 0.06649576280649533, 0.053851722176734576, -0.006833481854375671, 0.09254793856731232, -0.12384898718720412, 0.04918298925656606, 0.18245455576106906, -0.14461250848355978, -0.186341285908266, 0.3658102929811267, -0.08486756598166026, -0.18005852582042708, 0.150069376672892, -0.11086494161795332, -0.04783225233173546, 0.10067632197785903, 0.17340786208343856, 0.10916975077022524, -0.1466386702952578, 0.039134996326859385, 0.003731112740933895, 0.23226208366617998, 0.058599932217860924, 0.09864778292420155, 0.2730321771958295, 0.1767690470442176, 0.11567707810249618, 0.21946267241146417, -0.11243027121047763, -0.09879438395009321, -0.288440070772434, -0.21676782815826728, -0.1991580502513577, 0.09454792256960097, -0.09788048043230768, -0.17019926468458246, 0.4385546486605616, 0.14818535335909794, 0.1590844222180107, 0.004030430707258775, 0.32767936701283734, 0.14698482473545216, 0.07104095263844903, 0.0790689599700272, 0.2492210393661962, 0.15906764345846194, 0.1166312309968121, -0.2710339734906002, 0.015394995739573942, -0.03365877646531718]
|
1,803.05627
|
Quantitative Susceptibility Mapping using Deep Neural Network: QSMnet
|
Deep neural networks have demonstrated promising potential for the field of
medical image reconstruction. In this work, an MRI reconstruction algorithm,
which is referred to as quantitative susceptibility mapping (QSM), has been
developed using a deep neural network in order to perform dipole deconvolution,
which restores magnetic susceptibility source from an MRI field map. Previous
approaches of QSM require multiple orientation data (e.g. Calculation of
Susceptibility through Multiple Orientation Sampling or COSMOS) or
regularization terms (e.g. Truncated K-space Division or TKD; Morphology
Enabled Dipole Inversion or MEDI) to solve the ill-conditioned deconvolution
problem. Unfortunately, they either require long multiple orientation scans or
suffer from artifacts. To overcome these shortcomings, a deep neural network,
QSMnet, is constructed to generate a high quality susceptibility map from
single orientation data. The network has a modified U-net structure and is
trained using gold-standard COSMOS QSM maps. 25 datasets from 5 subjects (5
orientation each) were applied for patch-wise training after doubling the data
using augmentation. Two additional datasets of 5 orientation data were used for
validation and test (one dataset each). The QSMnet maps of the test dataset
were compared with those from TKD and MEDI for image quality and consistency in
multiple head orientations. Quantitative and qualitative image quality
comparisons demonstrate that the QSMnet results have superior image quality to
those of TKD or MEDI and have comparable image quality to those of COSMOS.
Additionally, QSMnet maps reveal substantially better consistency across the
multiple orientations than those from TKD or MEDI. As a preliminary
application, the network was tested for two patients. The QSMnet maps showed
similar lesion contrasts with those from MEDI, demonstrating potential for
future applications.
|
eess.IV
|
deep neural networks have demonstrated promising potential for the field of medical image reconstruction in this work an mri reconstruction algorithm which is referred to as quantitative susceptibility mapping qsm has been developed using a deep neural network in order to perform dipole deconvolution which restores magnetic susceptibility source from an mri field map previous approaches of qsm require multiple orientation data eg calculation of susceptibility through multiple orientation sampling or cosmos or regularization terms eg truncated kspace division or tkd morphology enabled dipole inversion or medi to solve the illconditioned deconvolution problem unfortunately they either require long multiple orientation scans or suffer from artifacts to overcome these shortcomings a deep neural network qsmnet is constructed to generate a high quality susceptibility map from single orientation data the network has a modified unet structure and is trained using goldstandard cosmos qsm maps 25 datasets from 5 subjects 5 orientation each were applied for patchwise training after doubling the data using augmentation two additional datasets of 5 orientation data were used for validation and test one dataset each the qsmnet maps of the test dataset were compared with those from tkd and medi for image quality and consistency in multiple head orientations quantitative and qualitative image quality comparisons demonstrate that the qsmnet results have superior image quality to those of tkd or medi and have comparable image quality to those of cosmos additionally qsmnet maps reveal substantially better consistency across the multiple orientations than those from tkd or medi as a preliminary application the network was tested for two patients the qsmnet maps showed similar lesion contrasts with those from medi demonstrating potential for future applications
|
[['deep', 'neural', 'networks', 'have', 'demonstrated', 'promising', 'potential', 'for', 'the', 'field', 'of', 'medical', 'image', 'reconstruction', 'in', 'this', 'work', 'an', 'mri', 'reconstruction', 'algorithm', 'which', 'is', 'referred', 'to', 'as', 'quantitative', 'susceptibility', 'mapping', 'qsm', 'has', 'been', 'developed', 'using', 'a', 'deep', 'neural', 'network', 'in', 'order', 'to', 'perform', 'dipole', 'deconvolution', 'which', 'restores', 'magnetic', 'susceptibility', 'source', 'from', 'an', 'mri', 'field', 'map', 'previous', 'approaches', 'of', 'qsm', 'require', 'multiple', 'orientation', 'data', 'eg', 'calculation', 'of', 'susceptibility', 'through', 'multiple', 'orientation', 'sampling', 'or', 'cosmos', 'or', 'regularization', 'terms', 'eg', 'truncated', 'kspace', 'division', 'or', 'tkd', 'morphology', 'enabled', 'dipole', 'inversion', 'or', 'medi', 'to', 'solve', 'the', 'illconditioned', 'deconvolution', 'problem', 'unfortunately', 'they', 'either', 'require', 'long', 'multiple', 'orientation', 'scans', 'or', 'suffer', 'from', 'artifacts', 'to', 'overcome', 'these', 'shortcomings', 'a', 'deep', 'neural', 'network', 'qsmnet', 'is', 'constructed', 'to', 'generate', 'a', 'high', 'quality', 'susceptibility', 'map', 'from', 'single', 'orientation', 'data', 'the', 'network', 'has', 'a', 'modified', 'unet', 'structure', 'and', 'is', 'trained', 'using', 'goldstandard', 'cosmos', 'qsm', 'maps', '25', 'datasets', 'from', '5', 'subjects', '5', 'orientation', 'each', 'were', 'applied', 'for', 'patchwise', 'training', 'after', 'doubling', 'the', 'data', 'using', 'augmentation', 'two', 'additional', 'datasets', 'of', '5', 'orientation', 'data', 'were', 'used', 'for', 'validation', 'and', 'test', 'one', 'dataset', 'each', 'the', 'qsmnet', 'maps', 'of', 'the', 'test', 'dataset', 'were', 'compared', 'with', 'those', 'from', 'tkd', 'and', 'medi', 'for', 'image', 'quality', 'and', 'consistency', 'in', 'multiple', 'head', 'orientations', 'quantitative', 'and', 'qualitative', 'image', 'quality', 'comparisons', 'demonstrate', 'that', 'the', 'qsmnet', 'results', 'have', 'superior', 'image', 'quality', 'to', 'those', 'of', 'tkd', 'or', 'medi', 'and', 'have', 'comparable', 'image', 'quality', 'to', 'those', 'of', 'cosmos', 'additionally', 'qsmnet', 'maps', 'reveal', 'substantially', 'better', 'consistency', 'across', 'the', 'multiple', 'orientations', 'than', 'those', 'from', 'tkd', 'or', 'medi', 'as', 'a', 'preliminary', 'application', 'the', 'network', 'was', 'tested', 'for', 'two', 'patients', 'the', 'qsmnet', 'maps', 'showed', 'similar', 'lesion', 'contrasts', 'with', 'those', 'from', 'medi', 'demonstrating', 'potential', 'for', 'future', 'applications']]
|
[-0.02655550597870553, -0.028487241885264997, -0.05312104024670341, 0.0638202562181025, -0.08303242183205756, -0.1561870098130947, -0.015233944833955982, 0.46582496372813526, -0.23135609533129767, -0.37084873150801284, 0.11948634784711017, -0.2958286764371124, -0.1262844774237072, 0.2064938616490161, -0.08516292126002636, 0.09904798023995351, 0.12679916259748014, 0.014907247704369101, -0.06869459502229637, -0.25428891793875, 0.2627487564827739, 0.04371212254585275, 0.37402060861275954, -0.023673103428022427, 0.09420638390224088, -0.007036060535941612, -0.04136034934188832, 0.03657406623051925, -0.042928437006432264, 0.10473622540371831, 0.2532882850761102, 0.15170701072381979, 0.25971937092105774, -0.4367690305547281, -0.24170344825156712, 0.0610181186365133, 0.1419638559712224, 0.09277778558782301, -0.042810813074254175, -0.3262505363334309, 0.08703550684540956, -0.11239080052653497, -0.010615831219845197, -0.12923140828582375, -0.07754979847993872, 0.014881872523957018, -0.31665419827786867, 0.09697667067150839, 0.0015182238537818193, 0.1420082629886879, -0.09049975729293444, -0.14402515492825346, -0.017427291419695724, 0.17982558616945013, 0.02085845092904161, 0.14369409034875305, 0.13811932192946022, -0.1849041216479699, -0.13450432664122094, 0.32854726885699415, -0.03856513795554003, -0.17773061172105373, 0.1982770741561597, -0.09707688541574912, -0.12585772587325086, 0.16415292354030747, 0.1677339169323783, 0.08311710337494416, -0.14789381060601128, -0.011054217840375549, -0.008902832252735441, 0.19315198657441546, 0.10886940934102643, -0.03670305927919055, 0.1738431008155881, 0.16367699935608968, 0.008787521079013294, 0.14731795012781565, -0.20794089133597232, 0.0038974482815882024, -0.15395475031067193, -0.08926670483821494, -0.1819946453804997, 0.01275910428471186, -0.11822418209832077, -0.15575971679508008, 0.3901869740811261, 0.1943145561624657, 0.20934609348885716, 0.055220305287935346, 0.3313322631676089, -0.004599914708259431, 0.16048172171217712, 0.020722368336705998, 0.20250927616757425, 0.0718078815666112, 0.11317047619684176, -0.15071784197204663, 0.06076516937041147, 0.01733262762131]
|
1,803.05628
|
The total zero-divisor graph of commutative rings
|
In this paper we initiate the study of the total zero-divisor graphs over
commutative rings with unity. These graphs are constructed by both relations
that arise from the zero-divisor graph and from the total graph of a ring. We
characterize Artinian rings with the connected total zero-divisor graphs and
give their diameters. Moreover, we compute major characteristics of the total
zero-divisor graphs of the ring ${\mathbb Z}_m$ of integers modulo $m$ and
prove that the total zero-divisor graphs of ${\mathbb Z}_m$ and ${\mathbb Z}_n$
are isomorphic if and only if $m=n$.
|
math.RA
|
in this paper we initiate the study of the total zerodivisor graphs over commutative rings with unity these graphs are constructed by both relations that arise from the zerodivisor graph and from the total graph of a ring we characterize artinian rings with the connected total zerodivisor graphs and give their diameters moreover we compute major characteristics of the total zerodivisor graphs of the ring mathbb z_m of integers modulo m and prove that the total zerodivisor graphs of mathbb z_m and mathbb z_n are isomorphic if and only if mn
|
[['in', 'this', 'paper', 'we', 'initiate', 'the', 'study', 'of', 'the', 'total', 'zerodivisor', 'graphs', 'over', 'commutative', 'rings', 'with', 'unity', 'these', 'graphs', 'are', 'constructed', 'by', 'both', 'relations', 'that', 'arise', 'from', 'the', 'zerodivisor', 'graph', 'and', 'from', 'the', 'total', 'graph', 'of', 'a', 'ring', 'we', 'characterize', 'artinian', 'rings', 'with', 'the', 'connected', 'total', 'zerodivisor', 'graphs', 'and', 'give', 'their', 'diameters', 'moreover', 'we', 'compute', 'major', 'characteristics', 'of', 'the', 'total', 'zerodivisor', 'graphs', 'of', 'the', 'ring', 'mathbb', 'z_m', 'of', 'integers', 'modulo', 'm', 'and', 'prove', 'that', 'the', 'total', 'zerodivisor', 'graphs', 'of', 'mathbb', 'z_m', 'and', 'mathbb', 'z_n', 'are', 'isomorphic', 'if', 'and', 'only', 'if', 'mn']]
|
[-0.2325956183690373, 0.0825705286115408, 0.01174313658950748, 0.0010593125083647504, -0.04369096797737446, -0.10785916442010593, -0.05657320097984316, 0.4025920148897957, -0.3552424970113642, -0.2563013851356048, 0.10353234919826858, -0.31381953372568877, -0.13025931267907004, 0.10465517429031104, -0.12495488311153846, -0.05798827128095941, 0.059208435574444114, 0.12096607432301555, -0.05430938738940672, -0.3383141373019348, 0.37422613373824526, -0.05276156884648806, 0.1345844668346447, 0.07131757196243647, 0.0481777334493677, 0.02927183914561193, -0.06893971726134583, 0.07364559953438711, -0.270324590007786, 0.12087815973375525, 0.263853701957307, 0.11565864021419087, 0.1395813200308092, -0.433183637376015, -0.06665108794510201, 0.30024620505807165, 0.13350639103881115, -0.061735087350665865, 0.023406998732812948, -0.21431049864206994, 0.18568042695399498, -0.1893453941486039, -0.06752545708421986, -0.011876862176315306, 0.15896189124783972, 0.11015813203866255, -0.22185848471145708, -0.011565998851597965, 0.12094289512670302, 0.11682883820721654, 0.03841250966006255, -0.12948046129319693, -0.10179793078370475, 0.0894472981537027, -0.07286964919274816, -0.020458854082460096, 0.11409665511890345, -0.05174177786294412, -0.1725712195448168, 0.38390376152225086, -0.013269140436262875, -0.1185522391460836, 0.06242545069819623, -0.21267288931962716, -0.15260554565587542, 0.12275132563497339, 0.10419398988341237, 0.19604226872376115, -0.020211926681900416, 0.19766650406917516, -0.20226883129881962, 0.09340694276513634, 0.10429143852421216, 0.07356462254096846, 0.16509039051175772, 0.027198589120346766, 0.09821170150970139, 0.18320309464911838, 0.030847577234873406, 0.033032373315398836, -0.3146204757043621, -0.11441741354640696, -0.16613252336097942, 0.17379018066420251, -0.15755589022272354, -0.12970929500227282, 0.425436031339424, 0.1035872054705908, 0.18247374944429803, 0.16523842078602904, 0.18749758353518262, -0.0041714354346577935, 0.09260251209047715, 0.13954369250971538, 0.06917099335363933, 0.2785082173528621, -0.05365504556371329, -0.15630045167879192, -0.03387367045813865, 0.15543020540684627]
|
1,803.05629
|
Self-Modifying Morphology Experiments with DyRET: Dynamic Robot for
Embodied Testing
|
If robots are to become ubiquitous, they will need to be able to adapt to
complex and dynamic environments. Robots that can adapt their bodies while
deployed might be flexible and robust enough to meet this challenge. Previous
work on dynamic robot morphology has focused on simulation, combining simple
modules, or switching between locomotion modes. Here, we present an alternative
approach: a self-reconfigurable morphology that allows a single four-legged
robot to actively adapt the length of its legs to different environments. We
report the design of our robot, as well as the results of a study that verifies
the performance impact of self-reconfiguration. This study compares three
different control and morphology pairs under different levels of servo supply
voltage in the lab. We also performed preliminary tests in different
uncontrolled outdoor environments to see if changes to the external environment
supports our findings in the lab. Our results show better performance with an
adaptable body, lending evidence to the value of self-reconfiguration for
quadruped robots.
|
cs.RO
|
if robots are to become ubiquitous they will need to be able to adapt to complex and dynamic environments robots that can adapt their bodies while deployed might be flexible and robust enough to meet this challenge previous work on dynamic robot morphology has focused on simulation combining simple modules or switching between locomotion modes here we present an alternative approach a selfreconfigurable morphology that allows a single fourlegged robot to actively adapt the length of its legs to different environments we report the design of our robot as well as the results of a study that verifies the performance impact of selfreconfiguration this study compares three different control and morphology pairs under different levels of servo supply voltage in the lab we also performed preliminary tests in different uncontrolled outdoor environments to see if changes to the external environment supports our findings in the lab our results show better performance with an adaptable body lending evidence to the value of selfreconfiguration for quadruped robots
|
[['if', 'robots', 'are', 'to', 'become', 'ubiquitous', 'they', 'will', 'need', 'to', 'be', 'able', 'to', 'adapt', 'to', 'complex', 'and', 'dynamic', 'environments', 'robots', 'that', 'can', 'adapt', 'their', 'bodies', 'while', 'deployed', 'might', 'be', 'flexible', 'and', 'robust', 'enough', 'to', 'meet', 'this', 'challenge', 'previous', 'work', 'on', 'dynamic', 'robot', 'morphology', 'has', 'focused', 'on', 'simulation', 'combining', 'simple', 'modules', 'or', 'switching', 'between', 'locomotion', 'modes', 'here', 'we', 'present', 'an', 'alternative', 'approach', 'a', 'selfreconfigurable', 'morphology', 'that', 'allows', 'a', 'single', 'fourlegged', 'robot', 'to', 'actively', 'adapt', 'the', 'length', 'of', 'its', 'legs', 'to', 'different', 'environments', 'we', 'report', 'the', 'design', 'of', 'our', 'robot', 'as', 'well', 'as', 'the', 'results', 'of', 'a', 'study', 'that', 'verifies', 'the', 'performance', 'impact', 'of', 'selfreconfiguration', 'this', 'study', 'compares', 'three', 'different', 'control', 'and', 'morphology', 'pairs', 'under', 'different', 'levels', 'of', 'servo', 'supply', 'voltage', 'in', 'the', 'lab', 'we', 'also', 'performed', 'preliminary', 'tests', 'in', 'different', 'uncontrolled', 'outdoor', 'environments', 'to', 'see', 'if', 'changes', 'to', 'the', 'external', 'environment', 'supports', 'our', 'findings', 'in', 'the', 'lab', 'our', 'results', 'show', 'better', 'performance', 'with', 'an', 'adaptable', 'body', 'lending', 'evidence', 'to', 'the', 'value', 'of', 'selfreconfiguration', 'for', 'quadruped', 'robots']]
|
[-0.11492195286590492, 0.08757571307254362, -0.09732704881691571, -0.0035733563155218055, -0.1226839599510034, -0.13995183465833014, 0.03505867665464228, 0.4683934053575451, -0.20818529459506724, -0.34316442455306195, 0.07135208610967365, -0.199445470593337, -0.18449619491584598, 0.23510692412965, -0.14597421028002194, 0.044349015317504493, 0.07998516702403626, -0.020780427247342286, -0.0024201376942183934, -0.2277819575262115, 0.26277919202605543, 0.06521519207762498, 0.29062749145580735, 0.05884636193055264, 0.10238584335328954, -0.017414320563671714, 0.02203365158515446, 0.021358881164765493, -0.09400362055673736, 0.10907953386164136, 0.2928284660602609, 0.12838969933941508, 0.27141959821367917, -0.47407597332741275, -0.17488640004373862, 0.067799049258853, 0.13787444601202328, 0.06460479247440216, -0.04524017561255305, -0.31198820256148324, 0.12047944122812514, -0.18395955481453602, -0.14765466643342126, -0.08941173033901688, 0.0069196707300954695, 0.022710069028350214, -0.25911065139878314, -0.02753593297551781, 0.026534321286828456, 0.06888617181190938, -0.08816363199748042, -0.0739776857662946, 0.02377804914051949, 0.22024113798785644, 0.032142749489426164, 0.007210005498067899, 0.22264042767329198, -0.12348037877712738, -0.1455478967195659, 0.3816084964059745, 0.005094519086450225, -0.22628742338609742, 0.3075960396923068, -0.115191948326361, -0.1300401751036671, 0.0673169884379163, 0.24770474453654254, 0.10145471860993314, -0.1521969075512254, -0.009944427618404117, -0.009094828066670082, 0.18926527583124964, 0.022788684974622095, -0.035013785859513466, 0.18251806513942553, 0.20460759873755954, 0.08319290196240851, 0.15641240487580724, -0.04886919519243141, -0.07350165905628467, -0.22599000602283262, -0.13150663797207401, -0.12025004581576496, -0.008868057016904156, -0.036356867392896675, -0.1076199274929064, 0.3693613605489108, 0.23890759831604857, 0.2001533384914651, 0.09282515755798103, 0.35073238331260104, 0.008794636318149666, 0.07977256679653444, 0.06959829259325158, 0.23157905861735345, 0.007093614148625144, 0.1333771072201092, -0.2206081395065694, 0.09840435460315679, -0.07237795731899413]
|
1,803.0563
|
On the dynamics of two photons interacting with a two-qubit coherent
feedback network}
|
The purpose of this paper is to study the dynamics of a quantum coherent
feedback network composed of two two-level systems (qubits) driven by two
counter-propagating photons, one in each input channel. The coherent feedback
network enhances the nonlinear photon-photon interaction inside the feedback
loop. By means of quantum stochastic calculus and the input-output framework,
the analytic form of the steady-state output two-photon state is derived. Based
on the analytic form, the applications on the Hong-Ou-Mandel (HOM)
interferometer and marginally stable single-photon devices using this coherent
feedback structure have been demonstrated. The difference between
continuous-mode and single-mode few-photon states is demonstrated.
|
quant-ph
|
the purpose of this paper is to study the dynamics of a quantum coherent feedback network composed of two twolevel systems qubits driven by two counterpropagating photons one in each input channel the coherent feedback network enhances the nonlinear photonphoton interaction inside the feedback loop by means of quantum stochastic calculus and the inputoutput framework the analytic form of the steadystate output twophoton state is derived based on the analytic form the applications on the hongoumandel hom interferometer and marginally stable singlephoton devices using this coherent feedback structure have been demonstrated the difference between continuousmode and singlemode fewphoton states is demonstrated
|
[['the', 'purpose', 'of', 'this', 'paper', 'is', 'to', 'study', 'the', 'dynamics', 'of', 'a', 'quantum', 'coherent', 'feedback', 'network', 'composed', 'of', 'two', 'twolevel', 'systems', 'qubits', 'driven', 'by', 'two', 'counterpropagating', 'photons', 'one', 'in', 'each', 'input', 'channel', 'the', 'coherent', 'feedback', 'network', 'enhances', 'the', 'nonlinear', 'photonphoton', 'interaction', 'inside', 'the', 'feedback', 'loop', 'by', 'means', 'of', 'quantum', 'stochastic', 'calculus', 'and', 'the', 'inputoutput', 'framework', 'the', 'analytic', 'form', 'of', 'the', 'steadystate', 'output', 'twophoton', 'state', 'is', 'derived', 'based', 'on', 'the', 'analytic', 'form', 'the', 'applications', 'on', 'the', 'hongoumandel', 'hom', 'interferometer', 'and', 'marginally', 'stable', 'singlephoton', 'devices', 'using', 'this', 'coherent', 'feedback', 'structure', 'have', 'been', 'demonstrated', 'the', 'difference', 'between', 'continuousmode', 'and', 'singlemode', 'fewphoton', 'states', 'is', 'demonstrated']]
|
[-0.1905001452515976, 0.15421542769648355, -0.05713069122653491, 0.04413477872097219, -0.010528995558656383, -0.1865871292631151, 0.02477907703493233, 0.39838680849954633, -0.2608904773092801, -0.235543552597081, -0.00622581902287421, -0.243470129031356, -0.1628193590504182, 0.2432664507253114, 0.003339210151703936, 0.09135001036569033, 0.06850855483784166, 0.008033209212935797, 0.02744954980743846, -0.17744008658020435, 0.3936331632482533, 0.03120725801777058, 0.3147559075035376, -0.019804107781388972, 0.1738972137728245, 0.010579020222925608, -0.00711537346631141, -0.06238236681945474, -0.04380199123210836, 0.13748967388038533, 0.23130218151064663, 0.07550210330294131, 0.2862853010641503, -0.47573456116537055, -0.21533607308854266, 0.05904521013951242, 0.11941373937516611, 0.16862288087901503, -0.03969420790487882, -0.35234074010098776, 0.004292909276100005, -0.1938107369763265, -0.044220063464092504, -0.013256232599995218, -0.027481762660058712, 0.0012868371320136887, -0.25336567052273484, 0.002931329317962622, 0.050390110998921614, -0.00486631639357103, 0.016199295928138124, 0.016680480008668237, -0.010104410163597158, 0.10811049843409865, -0.14546919502502326, -0.02946330167786541, 0.17609134469513255, -0.14865961389346416, -0.18346975350494285, 0.3007759923889938, -0.06241283810116572, -0.18770261479560102, 0.1438210379490214, -0.12843723730460768, -0.02116181242676212, 0.136273715737285, 0.1584552470179699, 0.09700685529969633, -0.16034001244824508, 0.0496290244587402, -0.011223519520631225, 0.22400383411510155, 0.0983450757178229, 0.14399354862473387, 0.17575109556391097, 0.18409132369157702, 0.01010645684177554, 0.21846962922095958, -0.059916368985057596, -0.17603640119881728, -0.31366776525605433, -0.11752820647169494, -0.16729642146977014, 0.06186537690331588, -0.03537216159531796, -0.11858697254487341, 0.39898027593528135, 0.079884068866371, 0.14262578724929603, -0.032723521723845364, 0.4020481985984462, 0.185502660396223, 0.0037946368067405456, 0.03768601057829686, 0.3079008385723475, 0.23751687091120546, 0.07225998742782538, -0.3057967687975431, 0.04625469952877058, 0.033377659562421905]
|
1,803.05631
|
Multistate metadynamics for automatic exploration of conical
intersections
|
We introduce multistate metadynamics for automatic exploration of conical
intersection seams between adiabatic Born-Oppenheimer potential energy surfaces
in molecular systems. By choosing the energy gap between the electronic states
as a collective variable the metadynamics drives the system from an arbitrary
ground-state configuration toward the intersection seam. Upon reaching the
seam, the multistate electronic Hamiltonian is extended by introducing biasing
potentials into the off-diagonal elements, and the molecular dynamics is
continued on a modified potential energy surface obtained by diagonalization of
the latter. The off-diagonal bias serves to locally open the energy gap and
push the system to the next intersection point. In this way, the conical
intersection energy landscape can be explored, identifying minimum energy
crossing points and the barriers separating them. We illustrate the method on
the example of furan, a prototype organic molecule exhibiting rich
photophysics. The multistate metadynamics reveals plateaus on the conical
intersection energy landscape from which the minimum energy crossing points
with characteristic geometries can be extracted. The method can be combined
with the broad spectrum of electronic structure methods and represents a
generally applicable tool for the exploration of photophysics and
photochemistry in complex molecules and materials.
|
physics.chem-ph
|
we introduce multistate metadynamics for automatic exploration of conical intersection seams between adiabatic bornoppenheimer potential energy surfaces in molecular systems by choosing the energy gap between the electronic states as a collective variable the metadynamics drives the system from an arbitrary groundstate configuration toward the intersection seam upon reaching the seam the multistate electronic hamiltonian is extended by introducing biasing potentials into the offdiagonal elements and the molecular dynamics is continued on a modified potential energy surface obtained by diagonalization of the latter the offdiagonal bias serves to locally open the energy gap and push the system to the next intersection point in this way the conical intersection energy landscape can be explored identifying minimum energy crossing points and the barriers separating them we illustrate the method on the example of furan a prototype organic molecule exhibiting rich photophysics the multistate metadynamics reveals plateaus on the conical intersection energy landscape from which the minimum energy crossing points with characteristic geometries can be extracted the method can be combined with the broad spectrum of electronic structure methods and represents a generally applicable tool for the exploration of photophysics and photochemistry in complex molecules and materials
|
[['we', 'introduce', 'multistate', 'metadynamics', 'for', 'automatic', 'exploration', 'of', 'conical', 'intersection', 'seams', 'between', 'adiabatic', 'bornoppenheimer', 'potential', 'energy', 'surfaces', 'in', 'molecular', 'systems', 'by', 'choosing', 'the', 'energy', 'gap', 'between', 'the', 'electronic', 'states', 'as', 'a', 'collective', 'variable', 'the', 'metadynamics', 'drives', 'the', 'system', 'from', 'an', 'arbitrary', 'groundstate', 'configuration', 'toward', 'the', 'intersection', 'seam', 'upon', 'reaching', 'the', 'seam', 'the', 'multistate', 'electronic', 'hamiltonian', 'is', 'extended', 'by', 'introducing', 'biasing', 'potentials', 'into', 'the', 'offdiagonal', 'elements', 'and', 'the', 'molecular', 'dynamics', 'is', 'continued', 'on', 'a', 'modified', 'potential', 'energy', 'surface', 'obtained', 'by', 'diagonalization', 'of', 'the', 'latter', 'the', 'offdiagonal', 'bias', 'serves', 'to', 'locally', 'open', 'the', 'energy', 'gap', 'and', 'push', 'the', 'system', 'to', 'the', 'next', 'intersection', 'point', 'in', 'this', 'way', 'the', 'conical', 'intersection', 'energy', 'landscape', 'can', 'be', 'explored', 'identifying', 'minimum', 'energy', 'crossing', 'points', 'and', 'the', 'barriers', 'separating', 'them', 'we', 'illustrate', 'the', 'method', 'on', 'the', 'example', 'of', 'furan', 'a', 'prototype', 'organic', 'molecule', 'exhibiting', 'rich', 'photophysics', 'the', 'multistate', 'metadynamics', 'reveals', 'plateaus', 'on', 'the', 'conical', 'intersection', 'energy', 'landscape', 'from', 'which', 'the', 'minimum', 'energy', 'crossing', 'points', 'with', 'characteristic', 'geometries', 'can', 'be', 'extracted', 'the', 'method', 'can', 'be', 'combined', 'with', 'the', 'broad', 'spectrum', 'of', 'electronic', 'structure', 'methods', 'and', 'represents', 'a', 'generally', 'applicable', 'tool', 'for', 'the', 'exploration', 'of', 'photophysics', 'and', 'photochemistry', 'in', 'complex', 'molecules', 'and', 'materials']]
|
[-0.15793612308214544, 0.10482261558346866, -0.10031155254283786, 0.07385224458034217, 0.001953770675379591, -0.1267260271460586, 0.10334671754510016, 0.3764139873902169, -0.29016486721199736, -0.31138411315503656, 0.03056794755939711, -0.24885975544613345, -0.11971607990322884, 0.15558031897934288, 0.007374214644534225, 0.02439008145497094, 0.05791843236008774, -0.027737776844848676, -0.05288873958526198, -0.14620967442229793, 0.3163607600385073, 0.07014265903703791, 0.2609059764864403, 0.09193051748755436, 0.05491425769317165, 0.021349074441421124, 0.06039805500768125, 0.01224132041571681, -0.14984097771980254, 0.14846225302833246, 0.24789874472105683, 0.03333526873989895, 0.2324484004243037, -0.43325642411016196, -0.23109999341114915, 0.09545934944864862, 0.12756804719545697, 0.13977139386091592, -0.03694249980669821, -0.28742097203917416, 0.0034079238407544255, -0.13439751419685206, -0.1878539232390731, -0.10564841272203808, -0.028520511925345306, 0.06115246840546234, -0.19505049537695685, 0.05240457286558969, -0.010645093065062441, 0.05797723977893744, -0.08256556252788719, -0.11909628103093542, -0.08728732288990304, 0.09987317775280129, -0.016079216067362383, 0.028711972076484224, 0.17806602240427272, -0.11686605447903275, -0.09363511105706512, 0.37787972860153496, -0.03186248938946687, -0.15323649367951242, 0.17976607532557293, -0.0715140099817234, -0.07428498422611773, 0.18385611189356477, 0.1141463071803956, 0.10572247096750233, -0.13379118641023524, 0.12187867419681386, 0.04619260902814183, 0.12148859811548897, 0.04449109182952298, 0.007775512130297336, 0.25549004167395156, 0.180762985101949, 0.09343523925563954, 0.1624927728145249, -0.11149727485575305, -0.1553350258426568, -0.25502530425863784, -0.18897953953476354, -0.21926940571319925, 0.07149214756953501, -0.08746290185261331, -0.17585795243167482, 0.4631627524732468, 0.07111334211442658, 0.17795721358201375, -0.04297273072051652, 0.2702596231193291, 0.10372592349831956, 0.0639629384392354, 0.05474624833207309, 0.19242136346982772, 0.08934777862627596, 0.05962493802185564, -0.2700300370187009, 0.02311066733721221, 0.07155788649766485]
|
1,803.05632
|
Orientational ordering of closely packed Janus particles
|
We study orientational ordering of $2$-dimensional closely packed Janus
particles by extensive Monte Carlo simulations. For smaller patch sizes the
system remains in the plastic crystal phase where the rotational degrees of
freedom are disordered down to the lowest temperatures. There the liquid
consist of dimers and trimers of the attractive patches. For large enough patch
sizes, the system exhibits a thermodynamic transition into a phase with stripe
patterns of the patches breaking the three-fold rotational symmetry. Our
results strongly suggests that the latter is a 2nd order phase transition whose
universality is the same as that of the $3$-state Potts model in
$2$-dimensions. Furthermore we analyzed the relaxation dynamics of the system
performing quenching simulations into the stripe phase. We found growing
domains of the stripes. The relaxation of key dynamical quantities follow
universal scaling features in terms of the domain size.
|
cond-mat.soft cond-mat.stat-mech
|
we study orientational ordering of 2dimensional closely packed janus particles by extensive monte carlo simulations for smaller patch sizes the system remains in the plastic crystal phase where the rotational degrees of freedom are disordered down to the lowest temperatures there the liquid consist of dimers and trimers of the attractive patches for large enough patch sizes the system exhibits a thermodynamic transition into a phase with stripe patterns of the patches breaking the threefold rotational symmetry our results strongly suggests that the latter is a 2nd order phase transition whose universality is the same as that of the 3state potts model in 2dimensions furthermore we analyzed the relaxation dynamics of the system performing quenching simulations into the stripe phase we found growing domains of the stripes the relaxation of key dynamical quantities follow universal scaling features in terms of the domain size
|
[['we', 'study', 'orientational', 'ordering', 'of', '2dimensional', 'closely', 'packed', 'janus', 'particles', 'by', 'extensive', 'monte', 'carlo', 'simulations', 'for', 'smaller', 'patch', 'sizes', 'the', 'system', 'remains', 'in', 'the', 'plastic', 'crystal', 'phase', 'where', 'the', 'rotational', 'degrees', 'of', 'freedom', 'are', 'disordered', 'down', 'to', 'the', 'lowest', 'temperatures', 'there', 'the', 'liquid', 'consist', 'of', 'dimers', 'and', 'trimers', 'of', 'the', 'attractive', 'patches', 'for', 'large', 'enough', 'patch', 'sizes', 'the', 'system', 'exhibits', 'a', 'thermodynamic', 'transition', 'into', 'a', 'phase', 'with', 'stripe', 'patterns', 'of', 'the', 'patches', 'breaking', 'the', 'threefold', 'rotational', 'symmetry', 'our', 'results', 'strongly', 'suggests', 'that', 'the', 'latter', 'is', 'a', '2nd', 'order', 'phase', 'transition', 'whose', 'universality', 'is', 'the', 'same', 'as', 'that', 'of', 'the', '3state', 'potts', 'model', 'in', '2dimensions', 'furthermore', 'we', 'analyzed', 'the', 'relaxation', 'dynamics', 'of', 'the', 'system', 'performing', 'quenching', 'simulations', 'into', 'the', 'stripe', 'phase', 'we', 'found', 'growing', 'domains', 'of', 'the', 'stripes', 'the', 'relaxation', 'of', 'key', 'dynamical', 'quantities', 'follow', 'universal', 'scaling', 'features', 'in', 'terms', 'of', 'the', 'domain', 'size']]
|
[-0.17500651257855077, 0.22206793557298923, -0.07077080552403936, 0.02101508311282557, 0.013654402271564399, -0.08757279399160452, 0.028721389503192182, 0.34660995467154837, -0.24999913623413214, -0.26553554098134846, 0.08304444032678888, -0.2919706509324846, -0.124880509270303, 0.08528934168251609, 0.07246552549719394, 0.03416350697512393, -0.025995414108168205, -0.02346824513955068, -0.11855345528403466, -0.22116792814193906, 0.27419926964114516, 0.011363191276111385, 0.31504708076534155, 0.010498669122222004, 0.09090680137953976, -0.02613369884275525, 0.08524466236936046, 0.03706221267502833, -0.20176078965352162, 0.04259918812805644, 0.200171290451524, -0.016315777366003998, 0.1624490412772744, -0.4211382122606143, -0.2020093028301738, 0.07077082175146007, 0.17773890982128002, 0.16428843863516837, -0.03162067527947882, -0.2754054856340082, 0.04420003965757527, -0.11610873996005784, -0.16213120827094166, -0.0810769667842432, 0.011943740385968786, 0.04434326503867889, -0.225096497945227, 0.12960426934662608, 0.10002263756757895, 0.08490361176900096, -0.06324806063064745, -0.09615195909160079, -0.08353691349958779, 0.1207951554960174, 0.051846807342270144, 0.0280607381845349, 0.14680135922613913, -0.1412340410744081, -0.10397762851871004, 0.4204373138051454, -0.0048008636413532845, -0.1468025379442981, 0.2103169277421088, -0.20186405717818576, -0.125087551017116, 0.229107002934467, 0.14428853945419115, 0.10566719930124033, -0.10659289524818842, 0.033789185834381, -0.03587729392013141, 0.2517692306554401, 0.0005608801713695268, 0.003949198839287241, 0.25985333817796064, 0.2338037758811631, 0.028125030537285694, 0.2232818312151683, -0.10542176130156104, -0.19783411313408425, -0.26909382405554083, -0.13224625341607243, -0.2294330192156709, -0.018149996495486556, -0.1400169749430607, -0.18855119839805615, 0.3971207590278733, 0.12871411791351345, 0.19189328628663832, 0.038796850877416716, 0.21543240895937685, 0.04792916981203781, 0.09964372557620485, 0.03110855692098816, 0.21856800315680203, 0.1099423261577511, 0.08348335648587273, -0.2924427427156092, 0.03642480093595031, 0.07695058952867204]
|
1,803.05633
|
A model with flavor-dependent gauged $U(1)_{B-L_1}\times
U(1)_{B-L_2-L_3}$ symmetry
|
We propose a new model with flavor-dependent gauged $U(1)_{B-L_1}\times
U(1)_{B-L_{2}-L_{3}}$ symmetry in addition to the flavor-blind one in the
standard model. The model contains three right-handed neutrinos to cancel gauge
anomalies and several Higgses to construct the measured fermion masses. We show
the generic feature of the model and explore its phenomenology. In particular,
we discuss the current bounds on the extra gauge bosons from the K and B meson
mixings as well as the LEP and LHC data and focus on their contributions to the
lepton flavor violating processes of $\ell_{i+1}\to \ell_i\gamma$ (i=1,2).
|
hep-ph
|
we propose a new model with flavordependent gauged u1_bl_1times u1_bl_2l_3 symmetry in addition to the flavorblind one in the standard model the model contains three righthanded neutrinos to cancel gauge anomalies and several higgses to construct the measured fermion masses we show the generic feature of the model and explore its phenomenology in particular we discuss the current bounds on the extra gauge bosons from the k and b meson mixings as well as the lep and lhc data and focus on their contributions to the lepton flavor violating processes of ell_i1to ell_igamma i12
|
[['we', 'propose', 'a', 'new', 'model', 'with', 'flavordependent', 'gauged', 'u1_bl_1times', 'u1_bl_2l_3', 'symmetry', 'in', 'addition', 'to', 'the', 'flavorblind', 'one', 'in', 'the', 'standard', 'model', 'the', 'model', 'contains', 'three', 'righthanded', 'neutrinos', 'to', 'cancel', 'gauge', 'anomalies', 'and', 'several', 'higgses', 'to', 'construct', 'the', 'measured', 'fermion', 'masses', 'we', 'show', 'the', 'generic', 'feature', 'of', 'the', 'model', 'and', 'explore', 'its', 'phenomenology', 'in', 'particular', 'we', 'discuss', 'the', 'current', 'bounds', 'on', 'the', 'extra', 'gauge', 'bosons', 'from', 'the', 'k', 'and', 'b', 'meson', 'mixings', 'as', 'well', 'as', 'the', 'lep', 'and', 'lhc', 'data', 'and', 'focus', 'on', 'their', 'contributions', 'to', 'the', 'lepton', 'flavor', 'violating', 'processes', 'of', 'ell_i1to', 'ell_igamma', 'i12']]
|
[-0.09707635921012196, 0.25751915356959215, -0.009259876826157172, 0.16773473515382242, -0.08834294240093893, -0.1991416813702219, 0.06961962133646012, 0.306133125629276, -0.21622272984435162, -0.28401587915917237, 0.028507090997623486, -0.3196023391249279, -0.05122419978789468, 0.06822228830618163, 0.03477817990610169, 0.04697004566809887, 0.0037720446112669177, 0.02669971500419908, -0.07720339442085888, -0.24794536309523715, 0.3103617993907796, -0.022736673414086302, 0.19877774579088306, 0.10434120986869352, 0.08617201775648735, -0.0215346562417431, -0.059157565370615985, -0.12023563318782382, -0.09265068892079095, 0.07581058147673805, 0.12812696610473925, 0.09873423937113128, 0.049617144372314216, -0.4009771047884391, -0.16421925529009765, 0.1688628733365072, 0.13046436059909564, 0.12312687328085303, -0.05083012370030499, -0.3316468261389269, 0.0727319559858491, -0.21404269023074043, -0.10657268671267149, -0.11264933712987436, -0.08789056622319752, -0.11206793253206544, -0.3336342933277289, 0.05479280471077396, -0.019037063946274833, 0.008996232174750832, -0.01946994963541834, -0.2066154101656543, -0.06922155199831145, 0.027726656845253377, 0.21766711361188856, -0.013691113111821727, 0.11315782895544543, -0.21566946913921534, -0.19168762148150967, 0.4543898163984219, -0.13281606926789713, -0.2029361115872032, 0.18897236701514986, -0.1715610215957794, -0.18934710574750271, 0.01753932834188971, 0.23535763468179438, 0.05592963462210416, -0.1812371667371028, 0.19231396398908046, -0.08100280842433373, 0.09347909009989558, 0.004109178090261088, 0.06608881153709566, 0.24559533584138585, 0.16096561728692096, 0.03939402764145699, 0.07129928928981018, -0.08635414900361664, -0.04666999932378531, -0.43665769770741464, -0.11425296354831921, -0.06356368651096192, 0.026728618507170013, -0.06587889771310276, -0.08874466280944439, 0.4641758670771701, 0.1876795793340231, 0.2835354743318425, 0.02819590465579596, 0.2872585591058143, 0.0545544522219441, 0.12300676372898225, 0.023635572293359372, 0.280340514663193, 0.13710757491903172, 0.10761616038572457, -0.2690196567810037, -0.06756295073363516, 0.09729132341324455]
|
1,803.05634
|
Higher T-duality of super M-branes
|
We establish a higher generalization of super L-infinity-algebraic T-duality
of super WZW-terms for super p-branes. In particular, we demonstrate spherical
T-duality of super M5-branes propagating on exceptional-geometric 11d super
spacetime.
|
hep-th math-ph math.AT math.DG math.MP
|
we establish a higher generalization of super linfinityalgebraic tduality of super wzwterms for super pbranes in particular we demonstrate spherical tduality of super m5branes propagating on exceptionalgeometric 11d super spacetime
|
[['we', 'establish', 'a', 'higher', 'generalization', 'of', 'super', 'linfinityalgebraic', 'tduality', 'of', 'super', 'wzwterms', 'for', 'super', 'pbranes', 'in', 'particular', 'we', 'demonstrate', 'spherical', 'tduality', 'of', 'super', 'm5branes', 'propagating', 'on', 'exceptionalgeometric', '11d', 'super', 'spacetime']]
|
[-0.15898431247721115, 0.19461133462135438, -0.0351260961205871, 0.1457836082964032, -0.08411390237786152, -0.13825110944539862, -0.05823807156196347, 0.31334809006916153, -0.09618227194166845, -0.19227745087334402, 0.13245739904663492, -0.22912434847266586, -0.2873092017446955, 0.09351191821473616, -0.18787385952978017, -0.017413657917468635, -0.0092362597308777, 0.13126437030560165, -0.23165652114484045, -0.26427884572358046, 0.3590213649181856, 0.04543210140912345, 0.3442371569021984, -0.04650093552966913, 0.203724536717076, 0.04194698489650532, -0.029608709203010355, -0.0026206248612315568, -0.05317387140045563, 0.17026839149184525, 0.18825438887708718, 0.09830321086984542, -0.020938628180711356, -0.5854239877727296, -0.22018529861061661, 0.003936006756568396, 0.28631503390217267, 0.16386806626838665, -0.046106978375637146, -0.2769868244692959, 0.0046266329440253755, -0.18894416997554125, -0.2702917578043761, -0.06507683324593085, 0.037876445800065994, -0.1223160775585307, -0.18979145765856462, 0.06343096917219183, 0.055453070887812865, 0.040948753454830254, -0.02368471423095023, 0.0407510162503631, -0.08410116761094993, -0.034405044538693294, 0.04932812739301611, 0.047393748743666544, 0.09892158941538245, -0.1966696504365515, -0.2260826054132647, 0.3030793070793152, -0.0813766114965633, -0.2456380074015922, 0.23685867504941094, -0.2687707331583456, -0.24986881390213966, -0.0010602992993813973, 0.1644085550473796, 0.3106073121781702, -0.037483003404405385, 0.21425964931646982, -0.11170053233702977, -0.005340485937065548, 0.2829947398837518, 0.07166171003202046, 0.30375448981713915, 0.21893110725580267, 0.07697031781491306, 0.25591245762727877, -0.06582215086005076, -0.02419215151005321, -0.48587845362446924, -0.21227865756696296, 0.017186700952825724, 0.16289994910497357, -0.22827207560961446, -0.1547848317358229, 0.2348425166198501, -0.028711304723940515, 0.08244196465777888, 0.08809842500421736, 0.06743436108377797, 0.08477329066092218, 0.026752172658840816, 0.08324224953712137, 0.23105546569934599, 0.24081437455283272, 0.04774589048422597, -0.2772342307812155, -0.4141357006953546, 0.2697003779725896]
|
1,803.05635
|
Operator revision of a Ky Fan type inequality
|
Let $\mathscr{H}$ be a complex Hilbert space and $A,B\in
\mathbb{B}(\mathscr{H})$ such that $0<A,B\leq\frac{1}{2}I$. Setting $A':=I-A$
and $B':=I-B$, we prove $$ A'\nabla_\lambda B'-A'!_\lambda B' \leq
A\nabla_\lambda B-A!_\lambda B, $$ where $\nabla_\lambda$ and $!_\lambda$
denote the weighted arithmetic and harmonic operator means, respectively. This
inequality is the natural extension of a Ky Fan type inequality due to H.
Alzer. Some parallel and related results are also obtained.
|
math.FA
|
let mathscrh be a complex hilbert space and abin mathbbbmathscrh such that 0ableqfrac12i setting aia and bib we prove anabla_lambda ba_lambda b leq anabla_lambda ba_lambda b where nabla_lambda and _lambda denote the weighted arithmetic and harmonic operator means respectively this inequality is the natural extension of a ky fan type inequality due to h alzer some parallel and related results are also obtained
|
[['let', 'mathscrh', 'be', 'a', 'complex', 'hilbert', 'space', 'and', 'abin', 'mathbbbmathscrh', 'such', 'that', '0ableqfrac12i', 'setting', 'aia', 'and', 'bib', 'we', 'prove', 'anabla_lambda', 'ba_lambda', 'b', 'leq', 'anabla_lambda', 'ba_lambda', 'b', 'where', 'nabla_lambda', 'and', '_lambda', 'denote', 'the', 'weighted', 'arithmetic', 'and', 'harmonic', 'operator', 'means', 'respectively', 'this', 'inequality', 'is', 'the', 'natural', 'extension', 'of', 'a', 'ky', 'fan', 'type', 'inequality', 'due', 'to', 'h', 'alzer', 'some', 'parallel', 'and', 'related', 'results', 'are', 'also', 'obtained']]
|
[-0.11778045718388616, 0.15385661188415006, 0.009435655549168587, 0.07107032851005594, -0.10053079925771606, -0.18790624874006762, -0.004258212780481891, 0.3366064000547978, -0.36133441433571933, -0.19680599322575226, 0.11813787193642113, -0.30543912484784397, -0.17302261059286825, 0.23605812557874933, -0.11839755414168171, -0.021303598197144374, 0.055988737022536886, 0.03920305788255574, -0.04257495685382501, -0.23417571431287287, 0.30580243298359083, -0.08173169565806777, 0.13415270985365568, 0.06177666695102265, 0.07446542308714829, 0.022280699602050476, -0.019388119583916768, 0.023757995767498454, -0.20351132059027136, 0.11962157287716604, 0.23166907479038887, 0.1527212340866722, 0.26412606018742446, -0.3272816666091482, -0.10523574660417803, 0.24060594512705216, 0.13763162726536393, -0.16024413492465228, 0.04916182084809662, -0.31168202987234844, 0.11729367083886214, -0.08981267508250057, -0.08589978121515167, -0.0833768944476584, 0.055319723076791616, 0.01672684471531395, -0.41219014078051897, 0.04863533211755566, 0.11667764971130773, 0.1056808083105767, -0.05576516606685657, -0.15184902783744691, -0.04292483647402964, -0.011892714480493675, -0.07078154563593368, 0.14840679934346362, 0.041697899116562645, 0.020021186157113367, -0.10903887198257603, 0.34327384287066626, -0.06028437748318538, -0.2109736190422585, 0.08900827318920117, -0.183014717328836, -0.1307275523921769, -0.0053352312707718, 0.09227360557895481, 0.13538894567867382, -0.0381896894939832, 0.24723144265590236, -0.13929273102334455, 0.05854256215848421, 0.13751432989936388, 0.05007661905307159, 0.004314603071594448, -0.007725210958405545, 0.10515591460269909, 0.12979782899849834, -0.0321029200006211, -0.022656762735558708, -0.3612813101264468, -0.24364524748045624, -0.14000967086145752, 0.13776025034307518, -0.11893493596034475, -0.11471444209874199, 0.3018434051865418, 0.037719048167529856, 0.19346029961710437, 0.057527701660435186, 0.18449054062039705, 0.10829781048130571, -0.0043170009882663165, 0.11813558753285754, 0.07739228612933259, 0.2582388749313459, 0.061557306924410034, -0.15512010660185888, -0.021416982987144013, 0.17195335354067778]
|
1,803.05636
|
Event Correlation and Forecasting over Multivariate Streaming Sensor
Data
|
Event management in sensor networks is a multidisciplinary field involving
several steps across the processing chain. In this paper, we discuss the major
steps that should be performed in real- or near real-time event handling
including event detection, correlation, prediction and filtering. First, we
discuss existing univariate and multivariate change detection schemes for the
online event detection over sensor data. Next, we propose an online event
correlation scheme that intends to unveil the internal dynamics that govern the
operation of a system and are responsible for the generation of various types
of events. We show that representation of event dependencies can be
accommodated within a probabilistic temporal knowledge representation framework
that allows the formulation of rules. We also address the important issue of
identifying outdated dependencies among events by setting up a time-dependent
framework for filtering the extracted rules over time. The proposed theory is
applied on the maritime domain and is validated through extensive
experimentation with real sensor streams originating from large-scale sensor
networks deployed in ships.
|
cs.DC
|
event management in sensor networks is a multidisciplinary field involving several steps across the processing chain in this paper we discuss the major steps that should be performed in real or near realtime event handling including event detection correlation prediction and filtering first we discuss existing univariate and multivariate change detection schemes for the online event detection over sensor data next we propose an online event correlation scheme that intends to unveil the internal dynamics that govern the operation of a system and are responsible for the generation of various types of events we show that representation of event dependencies can be accommodated within a probabilistic temporal knowledge representation framework that allows the formulation of rules we also address the important issue of identifying outdated dependencies among events by setting up a timedependent framework for filtering the extracted rules over time the proposed theory is applied on the maritime domain and is validated through extensive experimentation with real sensor streams originating from largescale sensor networks deployed in ships
|
[['event', 'management', 'in', 'sensor', 'networks', 'is', 'a', 'multidisciplinary', 'field', 'involving', 'several', 'steps', 'across', 'the', 'processing', 'chain', 'in', 'this', 'paper', 'we', 'discuss', 'the', 'major', 'steps', 'that', 'should', 'be', 'performed', 'in', 'real', 'or', 'near', 'realtime', 'event', 'handling', 'including', 'event', 'detection', 'correlation', 'prediction', 'and', 'filtering', 'first', 'we', 'discuss', 'existing', 'univariate', 'and', 'multivariate', 'change', 'detection', 'schemes', 'for', 'the', 'online', 'event', 'detection', 'over', 'sensor', 'data', 'next', 'we', 'propose', 'an', 'online', 'event', 'correlation', 'scheme', 'that', 'intends', 'to', 'unveil', 'the', 'internal', 'dynamics', 'that', 'govern', 'the', 'operation', 'of', 'a', 'system', 'and', 'are', 'responsible', 'for', 'the', 'generation', 'of', 'various', 'types', 'of', 'events', 'we', 'show', 'that', 'representation', 'of', 'event', 'dependencies', 'can', 'be', 'accommodated', 'within', 'a', 'probabilistic', 'temporal', 'knowledge', 'representation', 'framework', 'that', 'allows', 'the', 'formulation', 'of', 'rules', 'we', 'also', 'address', 'the', 'important', 'issue', 'of', 'identifying', 'outdated', 'dependencies', 'among', 'events', 'by', 'setting', 'up', 'a', 'timedependent', 'framework', 'for', 'filtering', 'the', 'extracted', 'rules', 'over', 'time', 'the', 'proposed', 'theory', 'is', 'applied', 'on', 'the', 'maritime', 'domain', 'and', 'is', 'validated', 'through', 'extensive', 'experimentation', 'with', 'real', 'sensor', 'streams', 'originating', 'from', 'largescale', 'sensor', 'networks', 'deployed', 'in', 'ships']]
|
[-0.1407886115484871, 0.04057550575825666, -0.06777815751896317, 0.06825388712015756, -0.07808499389682852, -0.10419882502451185, 0.028517487802587095, 0.42644188619617907, -0.2669921707766618, -0.3293906878679991, 0.1321994705802007, -0.276452916701774, -0.19372798254924073, 0.20550770385584438, -0.050820646601052774, 0.06154708318769865, 0.12115945072478748, 0.04945501433671563, -0.034312327269054504, -0.21385047651087266, 0.29424831476977226, 0.06262908858757112, 0.3223540232117687, 0.04967975796483058, 0.1458693928801776, 0.06456018939484022, -0.11776406957817796, 0.014197522430636343, -0.04510812357403622, 0.1161683485136434, 0.3248941554699004, 0.20137337739634814, 0.2834179100665053, -0.45495132391252335, -0.24070681673696354, 0.09188735734330424, 0.14206012863238962, 0.08054504804403266, -0.05553538490424953, -0.3256170951672608, 0.0928264198869112, -0.20657717686013452, -0.03238573676762393, -0.08828979972930115, -0.004348547163923892, 0.006906641547435096, -0.28881169868344886, 0.05507476718862779, 0.02304923670523013, 0.05877862606957067, -0.056830842195701, -0.03518799399760263, 0.06324336413568485, 0.1579066998272624, 0.0357465678590372, -0.023002166410497876, 0.15036680393712318, -0.1258982940385717, -0.1958720544845121, 0.37004521029857207, -0.03357463074886861, -0.16457200004896594, 0.16098146080150313, -0.07586922140243198, -0.16922199101896868, 0.10217917865208749, 0.2541090555023402, 0.12392273070872761, -0.2038781227089376, 0.015288976698814492, 0.021749772625515192, 0.15552911761776722, 0.0426803487283732, -0.004151483157849205, 0.21389628119539425, 0.23642059951089323, 0.06022403581993699, 0.12618098036979236, -0.1611092824009358, -0.12432753736807388, -0.29993480131850536, -0.12043916789947876, -0.14722192611190535, -0.03225027852957802, -0.08670794615110415, -0.12292448268271983, 0.4053246304220227, 0.2369208546011372, 0.17096869205020734, 0.02126622532748678, 0.3244188008150862, 0.08494797010262985, 0.10009270460882579, 0.06036412385791274, 0.1627535636670516, 0.030778085343107314, 0.1526363417547795, -0.17736695003813588, 0.11801133710347737, 0.014241195827101668]
|
1,803.05637
|
Broadband polarization-independent low-crosstalk metasurface lens
array-based mid wave infrared focal plane arrays
|
The miniaturization of pixel is essential for achieving high-resolution,
planar, compact-size focal plane arrays (FPAs); however, the resulted increase
in the optical crosstalk between adjacent pixels leads to serious drawback and
trade-off. In the current work, we design and propose an efficient broadband
polarization-insensitive all-dielectric metasurface lens array-based focal
plane arrays (FPA) operating in the mid-wave infrared (MWIR). High focusing
efficiency over 0.85 with superior optical crosstalk performance is achieved.
We demonstrated that optical crosstalk can be reduced to low levels below 2.8%
with high efficiency. For the device performance, a similar figure-of-merit
(FoM) from the previous reports was used and our device achieved FoM of 91
which outperformed all other types MWIR FPAs designed so far. Proposed
metasurface lens arrays demonstrate great potential for increasing the signal
to noise ratio and sensitivity thus paving the way for compact-size,
high-resolution FPAs.
|
physics.optics
|
the miniaturization of pixel is essential for achieving highresolution planar compactsize focal plane arrays fpas however the resulted increase in the optical crosstalk between adjacent pixels leads to serious drawback and tradeoff in the current work we design and propose an efficient broadband polarizationinsensitive alldielectric metasurface lens arraybased focal plane arrays fpa operating in the midwave infrared mwir high focusing efficiency over 085 with superior optical crosstalk performance is achieved we demonstrated that optical crosstalk can be reduced to low levels below 28 with high efficiency for the device performance a similar figureofmerit fom from the previous reports was used and our device achieved fom of 91 which outperformed all other types mwir fpas designed so far proposed metasurface lens arrays demonstrate great potential for increasing the signal to noise ratio and sensitivity thus paving the way for compactsize highresolution fpas
|
[['the', 'miniaturization', 'of', 'pixel', 'is', 'essential', 'for', 'achieving', 'highresolution', 'planar', 'compactsize', 'focal', 'plane', 'arrays', 'fpas', 'however', 'the', 'resulted', 'increase', 'in', 'the', 'optical', 'crosstalk', 'between', 'adjacent', 'pixels', 'leads', 'to', 'serious', 'drawback', 'and', 'tradeoff', 'in', 'the', 'current', 'work', 'we', 'design', 'and', 'propose', 'an', 'efficient', 'broadband', 'polarizationinsensitive', 'alldielectric', 'metasurface', 'lens', 'arraybased', 'focal', 'plane', 'arrays', 'fpa', 'operating', 'in', 'the', 'midwave', 'infrared', 'mwir', 'high', 'focusing', 'efficiency', 'over', '085', 'with', 'superior', 'optical', 'crosstalk', 'performance', 'is', 'achieved', 'we', 'demonstrated', 'that', 'optical', 'crosstalk', 'can', 'be', 'reduced', 'to', 'low', 'levels', 'below', '28', 'with', 'high', 'efficiency', 'for', 'the', 'device', 'performance', 'a', 'similar', 'figureofmerit', 'fom', 'from', 'the', 'previous', 'reports', 'was', 'used', 'and', 'our', 'device', 'achieved', 'fom', 'of', '91', 'which', 'outperformed', 'all', 'other', 'types', 'mwir', 'fpas', 'designed', 'so', 'far', 'proposed', 'metasurface', 'lens', 'arrays', 'demonstrate', 'great', 'potential', 'for', 'increasing', 'the', 'signal', 'to', 'noise', 'ratio', 'and', 'sensitivity', 'thus', 'paving', 'the', 'way', 'for', 'compactsize', 'highresolution', 'fpas']]
|
[-0.13236983553902743, 0.033776009360477754, 0.025871883602218426, -0.05403043845080579, -0.0804750126446366, -0.1711515772935822, 0.03357743336868651, 0.48659081822459366, -0.18061686786063386, -0.3791392643903778, 0.06180570169239708, -0.2847864189257858, -0.16111473093165996, 0.2809792796120127, -0.12478589569713841, 0.11898884630030523, 0.06685779407514748, -0.11450969158004679, -0.041086530344270115, -0.22135824572744098, 0.1541499890426689, 0.14648429455948955, 0.41095160221324323, 0.03832393507506197, 0.15200345380832805, 0.011676662340628129, 0.010818433426056347, 0.002527991019136517, -0.06048895957689206, 0.11753911859890882, 0.3106705045842744, 0.05634290537076956, 0.20044960059697825, -0.37251987194036407, -0.21040588114757408, 0.08561483120169253, 0.17635618461005337, 0.038678266460584566, -0.08731293387080259, -0.2452029899656046, 0.10311045591448638, -0.12836057429717102, -0.11249165767671686, -0.01187970279220571, -0.048285646747190054, 0.030488543951362107, -0.2369824402787267, -0.00959562470621251, 0.02772090385885949, 0.07129012684978492, 0.009253003389297172, -0.15419315840018558, 0.018566726404737603, 0.09917472795986221, -0.10899775083414576, 0.04603695722481777, 0.14175000103605012, -0.1088383430565529, -0.08377530795797798, 0.3434150294790454, -0.06358541662520761, -0.1468066753991318, 0.15679557417463247, -0.1431766852830596, -0.02288231957234865, 0.2019684899339109, 0.17370907959680185, 0.032950820850459396, -0.12565129817668216, 0.004355021422367266, 0.08999919405220248, 0.25091023496451215, 0.14937695629187986, 0.11215885862186287, 0.2470691973997399, 0.24904345801588915, 0.08169639340464806, 0.15863855008790534, -0.18512293866485463, 0.04183154699643611, -0.161482284242677, -0.11886125909501409, -0.16755206830938288, 0.016964942921970226, -0.12892635142164807, -0.10441709852757607, 0.38037408236414194, 0.19316022458373971, 0.13369850509268305, 0.018783552711664413, 0.3759838135529917, 0.07802000394791153, 0.13863192069681085, -0.02459135031367236, 0.35904535941832455, 0.08410034035761835, 0.11478059358997204, -0.21250864348361098, -0.019010027091131143, -0.07198363339118924]
|
1,803.05638
|
$f(R)$ gravity modifications: from the action to the data
|
It is a very well established matter nowadays that many modified gravity
models can offer a sound alternative to General Relativity for the description
of the accelerated expansion of the universe. But it is also equally well known
that no clear and sharp discrimination between any alternative theory and the
classical one has been found so far. In this work, we attempt at formulating a
different approach starting from the general class of $f(R)$ theories as test
probes: we try to reformulate $f(R)$ Lagrangian terms as explicit functions of
the redshift, i.e., as $f(z)$. In this context, the $f(R)$ setting to the
consensus cosmological model, the $\Lambda$CDM model, can be written as a
polynomial including just a constant and a third-order term. Starting from this
result, we propose various different polynomial parameterizations $f(z)$,
including new terms which would allow for deviations from $\Lambda$CDM, and we
thoroughly compare them with observational data. While on the one hand we have
found no statistically preference for our proposals (even if some of them are
as good as $\Lambda$CDM by using Bayesian Evidence comparison), we think that
our novel approach could provide a different perspective for the development of
new and observationally reliable alternative models of gravity.
|
astro-ph.CO gr-qc
|
it is a very well established matter nowadays that many modified gravity models can offer a sound alternative to general relativity for the description of the accelerated expansion of the universe but it is also equally well known that no clear and sharp discrimination between any alternative theory and the classical one has been found so far in this work we attempt at formulating a different approach starting from the general class of fr theories as test probes we try to reformulate fr lagrangian terms as explicit functions of the redshift ie as fz in this context the fr setting to the consensus cosmological model the lambdacdm model can be written as a polynomial including just a constant and a thirdorder term starting from this result we propose various different polynomial parameterizations fz including new terms which would allow for deviations from lambdacdm and we thoroughly compare them with observational data while on the one hand we have found no statistically preference for our proposals even if some of them are as good as lambdacdm by using bayesian evidence comparison we think that our novel approach could provide a different perspective for the development of new and observationally reliable alternative models of gravity
|
[['it', 'is', 'a', 'very', 'well', 'established', 'matter', 'nowadays', 'that', 'many', 'modified', 'gravity', 'models', 'can', 'offer', 'a', 'sound', 'alternative', 'to', 'general', 'relativity', 'for', 'the', 'description', 'of', 'the', 'accelerated', 'expansion', 'of', 'the', 'universe', 'but', 'it', 'is', 'also', 'equally', 'well', 'known', 'that', 'no', 'clear', 'and', 'sharp', 'discrimination', 'between', 'any', 'alternative', 'theory', 'and', 'the', 'classical', 'one', 'has', 'been', 'found', 'so', 'far', 'in', 'this', 'work', 'we', 'attempt', 'at', 'formulating', 'a', 'different', 'approach', 'starting', 'from', 'the', 'general', 'class', 'of', 'fr', 'theories', 'as', 'test', 'probes', 'we', 'try', 'to', 'reformulate', 'fr', 'lagrangian', 'terms', 'as', 'explicit', 'functions', 'of', 'the', 'redshift', 'ie', 'as', 'fz', 'in', 'this', 'context', 'the', 'fr', 'setting', 'to', 'the', 'consensus', 'cosmological', 'model', 'the', 'lambdacdm', 'model', 'can', 'be', 'written', 'as', 'a', 'polynomial', 'including', 'just', 'a', 'constant', 'and', 'a', 'thirdorder', 'term', 'starting', 'from', 'this', 'result', 'we', 'propose', 'various', 'different', 'polynomial', 'parameterizations', 'fz', 'including', 'new', 'terms', 'which', 'would', 'allow', 'for', 'deviations', 'from', 'lambdacdm', 'and', 'we', 'thoroughly', 'compare', 'them', 'with', 'observational', 'data', 'while', 'on', 'the', 'one', 'hand', 'we', 'have', 'found', 'no', 'statistically', 'preference', 'for', 'our', 'proposals', 'even', 'if', 'some', 'of', 'them', 'are', 'as', 'good', 'as', 'lambdacdm', 'by', 'using', 'bayesian', 'evidence', 'comparison', 'we', 'think', 'that', 'our', 'novel', 'approach', 'could', 'provide', 'a', 'different', 'perspective', 'for', 'the', 'development', 'of', 'new', 'and', 'observationally', 'reliable', 'alternative', 'models', 'of', 'gravity']]
|
[-0.05291091806135998, 0.037318526354292635, -0.13046705640228512, 0.14701924773261152, -0.12427841652680206, -0.17716787328824327, 0.002235126644350001, 0.3495391206655266, -0.23147913114052482, -0.33129897669159575, 0.0764811006827702, -0.23693179991784427, -0.1572798674833259, 0.2106916219285079, -0.025803061254354644, 0.0407007610920835, 0.014918150540253175, 0.03484126259564202, -0.08151981625136784, -0.23966077777437791, 0.2965770751889336, 0.07603094550858945, 0.2328519486513085, 0.009665413631190514, 0.09365835048664324, -0.06675284902600737, -0.028878687396920812, 0.07493278973740457, -0.1605991531826032, 0.08664384802913504, 0.2600562906636024, 0.1696078733350678, 0.26845697728283885, -0.4159602802063297, -0.25211625286088934, 0.1186025564110347, 0.15982215708750186, 0.17157168645615886, -0.07506504665332327, -0.24212869419601604, 0.05698623953747283, -0.20990214040021188, -0.11197344508031246, -0.10017139190495969, -0.003440863544607691, -0.025426564510198302, -0.2568016913421269, 0.09010347671559645, 0.04004035152958275, 0.012077232806718555, -0.04356463785108931, -0.11984898868588079, 0.03599776561071481, 0.09960234645075106, 0.08879883368178432, 0.06648366483590185, 0.06612860797239202, -0.12754362253724538, -0.1098932476227947, 0.43537298561500504, -0.10887834528034433, -0.1961183072272241, 0.22483178428970643, -0.10434985306490158, -0.16816665249156393, 0.007923588848310372, 0.11338233954485064, 0.1158428706430596, -0.16824858715721025, 0.09245546423030669, -0.04510143198407819, 0.13409458729667872, 0.0753169381750743, 0.02838132743037815, 0.2618040328964664, 0.11839619529401434, 0.04006660581948327, 0.09717747554116483, -0.0330960086969489, -0.07941717368417553, -0.34672410317737923, -0.14490310400907924, -0.13667876775069115, 0.046479956332933656, -0.11599955583193966, -0.162717702897183, 0.3800486056730518, 0.16792997824380249, 0.17244389337278773, 0.10711383932726595, 0.29931253198937974, 0.09123279858527365, 0.05012825097122546, 0.043885506453277004, 0.287787743929683, 0.06855509263288982, 0.07387244183538032, -0.1245001866241339, 0.07175555712832458, 0.026093968850895394]
|
1,803.05639
|
Measure-valued branching processes associated with Neumann nonlinear
semiflows
|
We construct a measure-valued branching Markov process associated with a
nonlinear boundary value problem, where the boundary condition has a nonlinear
pseudo monotone branching mechanism term $-\beta$, which includes as a limit
case $\beta(u) = - u^{m}$, with $0 < m < 1$. The process is then used in the
probabilistic representation of the solution of the parabolic problem
associated with a nonlinear Neumann boundary value problem. In this way the
classical association of the superprocesses to the Dirichlet boundary value
problems also holds for the nonlinear Neumann boundary value problems. It turns
out that the obtained branching process behaves on the measures carried by the
given open set like the linear continuous semiflow, induced by the reflected
Brownian motion, while the branching occurs on the measures having non-zero
traces on the boundary of the open set, with the behavior of the
$(-\beta)$-superprocess, having as spatial motion the process on the boundary
associated to the reflected Brownian motion
|
math.PR math.AP
|
we construct a measurevalued branching markov process associated with a nonlinear boundary value problem where the boundary condition has a nonlinear pseudo monotone branching mechanism term beta which includes as a limit case betau um with 0 m 1 the process is then used in the probabilistic representation of the solution of the parabolic problem associated with a nonlinear neumann boundary value problem in this way the classical association of the superprocesses to the dirichlet boundary value problems also holds for the nonlinear neumann boundary value problems it turns out that the obtained branching process behaves on the measures carried by the given open set like the linear continuous semiflow induced by the reflected brownian motion while the branching occurs on the measures having nonzero traces on the boundary of the open set with the behavior of the betasuperprocess having as spatial motion the process on the boundary associated to the reflected brownian motion
|
[['we', 'construct', 'a', 'measurevalued', 'branching', 'markov', 'process', 'associated', 'with', 'a', 'nonlinear', 'boundary', 'value', 'problem', 'where', 'the', 'boundary', 'condition', 'has', 'a', 'nonlinear', 'pseudo', 'monotone', 'branching', 'mechanism', 'term', 'beta', 'which', 'includes', 'as', 'a', 'limit', 'case', 'betau', 'um', 'with', '0', 'm', '1', 'the', 'process', 'is', 'then', 'used', 'in', 'the', 'probabilistic', 'representation', 'of', 'the', 'solution', 'of', 'the', 'parabolic', 'problem', 'associated', 'with', 'a', 'nonlinear', 'neumann', 'boundary', 'value', 'problem', 'in', 'this', 'way', 'the', 'classical', 'association', 'of', 'the', 'superprocesses', 'to', 'the', 'dirichlet', 'boundary', 'value', 'problems', 'also', 'holds', 'for', 'the', 'nonlinear', 'neumann', 'boundary', 'value', 'problems', 'it', 'turns', 'out', 'that', 'the', 'obtained', 'branching', 'process', 'behaves', 'on', 'the', 'measures', 'carried', 'by', 'the', 'given', 'open', 'set', 'like', 'the', 'linear', 'continuous', 'semiflow', 'induced', 'by', 'the', 'reflected', 'brownian', 'motion', 'while', 'the', 'branching', 'occurs', 'on', 'the', 'measures', 'having', 'nonzero', 'traces', 'on', 'the', 'boundary', 'of', 'the', 'open', 'set', 'with', 'the', 'behavior', 'of', 'the', 'betasuperprocess', 'having', 'as', 'spatial', 'motion', 'the', 'process', 'on', 'the', 'boundary', 'associated', 'to', 'the', 'reflected', 'brownian', 'motion']]
|
[-0.11071109426743503, 0.1130463747685057, -0.05959729615026732, 0.013653668808057262, -0.09487977894205674, -0.1332495536600404, 0.041611291367706714, 0.32139840923870605, -0.34474287174788176, -0.189791472817412, 0.17115979479379295, -0.2738136233871474, -0.09798911535881119, 0.16721339223318996, -0.05012701209208447, 0.13601174937702679, 0.09250784337861476, 0.08019327687014358, -0.007429684968847854, -0.17076010421813265, 0.36438140925628687, -0.03200971240822981, 0.22682402416868927, 0.006054286026316726, 0.15510965503289614, -0.0048650662000808455, -0.01058412340524442, 0.033429031856845016, -0.16192000304232543, 0.08720887809256822, 0.17210129890408293, 0.046367245619002656, 0.2989550878117287, -0.35782857279421065, -0.19012578208230776, 0.15126565449073717, 0.08437544613273121, 0.014236441381987841, 0.005390526118134361, -0.3272971259384398, 0.06472418829189991, -0.07903036963060693, -0.17152722202411858, 0.04253243387743733, 0.03527985144637866, -0.015229791251781208, -0.32122422884419266, 0.11376606473174963, 0.08540643895884939, -0.0019883661107860163, -0.0966457403843212, -0.10676161873951749, -0.04962873590038785, 0.09136819186029968, 0.04750547673495401, 0.02438183624017375, 0.12949492397651174, -0.14398617271236538, -0.13232777958881914, 0.3735304651660175, -0.0926609887662374, -0.2981933317348069, 0.1830762496470699, -0.15770064839740205, -0.11314449032458167, 0.14189944513982125, 0.14093300875495463, 0.12899415349143442, -0.15763179048914097, 0.15766724531106602, -0.06546559821269506, 0.11328530287083993, 0.08399009849462244, -0.03345397177983221, 0.14538362377560607, 0.167448152593197, 0.1340565853736978, 0.19319361413287278, -0.03923055026763928, -0.15027757037090125, -0.3554805153006919, -0.1491565514855038, -0.13833581160729616, 0.10834554587703904, -0.11181406045843865, -0.23193571943594934, 0.32763337894811545, 0.12122727690829159, 0.23152432576114057, 0.08838008576775809, 0.204524613620129, 0.2296832288872965, 0.0027516698403880486, 0.045918105802235494, 0.15000888666790893, 0.1625821526646249, 0.14450324594280592, -0.2524427447142384, 0.07756964279965686, 0.1200447564798535]
|
1,803.0564
|
Optimal Weight Allocation of Dynamic Distribution Networks and Positive
Semi-definiteness of Signed Laplacians
|
In this paper, we consider the robustness of a basic model of a dynamical
distribution network. In the first problem, i.e., optimal weight allocation, we
minimize the H-inf- norm of the dynamical distribution network subject to
allocation of the weights on the edges. It is shown that this optimization
problem can be formulated as a semi-definite program. Next we consider the
semi-definiteness of the weighted graph Laplacian matrix with negative weights
on the edges. A necessary and sufficient condition, using the effective
resistance matrix, is established to guarantee the positive semi-definiteness
of the Laplacian matrix. Furthermore, the bounded real lemma is derived for
state-space symmetric systems.
|
math.OC
|
in this paper we consider the robustness of a basic model of a dynamical distribution network in the first problem ie optimal weight allocation we minimize the hinf norm of the dynamical distribution network subject to allocation of the weights on the edges it is shown that this optimization problem can be formulated as a semidefinite program next we consider the semidefiniteness of the weighted graph laplacian matrix with negative weights on the edges a necessary and sufficient condition using the effective resistance matrix is established to guarantee the positive semidefiniteness of the laplacian matrix furthermore the bounded real lemma is derived for statespace symmetric systems
|
[['in', 'this', 'paper', 'we', 'consider', 'the', 'robustness', 'of', 'a', 'basic', 'model', 'of', 'a', 'dynamical', 'distribution', 'network', 'in', 'the', 'first', 'problem', 'ie', 'optimal', 'weight', 'allocation', 'we', 'minimize', 'the', 'hinf', 'norm', 'of', 'the', 'dynamical', 'distribution', 'network', 'subject', 'to', 'allocation', 'of', 'the', 'weights', 'on', 'the', 'edges', 'it', 'is', 'shown', 'that', 'this', 'optimization', 'problem', 'can', 'be', 'formulated', 'as', 'a', 'semidefinite', 'program', 'next', 'we', 'consider', 'the', 'semidefiniteness', 'of', 'the', 'weighted', 'graph', 'laplacian', 'matrix', 'with', 'negative', 'weights', 'on', 'the', 'edges', 'a', 'necessary', 'and', 'sufficient', 'condition', 'using', 'the', 'effective', 'resistance', 'matrix', 'is', 'established', 'to', 'guarantee', 'the', 'positive', 'semidefiniteness', 'of', 'the', 'laplacian', 'matrix', 'furthermore', 'the', 'bounded', 'real', 'lemma', 'is', 'derived', 'for', 'statespace', 'symmetric', 'systems']]
|
[-0.1450237054366707, 0.029269947448656672, -0.05139453181625521, 0.0654037820674213, -0.08197075941023373, -0.1385335597364853, 0.034027589062627935, 0.35955127349921634, -0.34510526014935405, -0.25661309633758805, 0.1542325972158107, -0.23719631269175026, -0.22613573595881462, 0.07231219789412405, -0.10067398003413386, 0.13764025975196134, 0.08353914172566008, 0.08526512797744501, -0.06434118872552755, -0.26634703397534654, 0.3709298748611694, 0.04309943951666355, 0.24869666755909012, 0.08881140188535765, 0.111847599519838, 0.01422342298374999, 0.00581254965537006, 0.028139077066554732, -0.11615756128289614, 0.12575997916449394, 0.24178347735488342, 0.17502289909337249, 0.32788031464886097, -0.4204656552523375, -0.1880446399517712, 0.19854847961770636, 0.07900902532661955, 0.05690008228328744, -0.002849936904385686, -0.23507272400671528, 0.141827062162615, -0.12839035084471107, -0.08588398435552205, -0.025616607917029233, -0.010142795227113224, -0.00017881526922186214, -0.37794105883332946, 0.06919373716089121, 0.0622703265637115, -0.003918057884133998, -0.10139338757310595, -0.16179762413459164, -0.0044477308967283795, 0.10896582031356437, -0.016742054507180693, -0.015889055926042298, 0.07349016607317718, -0.07693347889663918, -0.11256402087885709, 0.3544670599468407, -0.03252985416689799, -0.2752927638945125, 0.0680805411855025, -0.07867878758392874, -0.11492423261294053, 0.055670595909690576, 0.21450225841697482, 0.14146762514220818, -0.1325222001366672, 0.09348451123029615, -0.10611398600574051, 0.1322276703070938, 0.04393635702629884, 0.008211629043909766, 0.12268104195993926, 0.1454207299631976, 0.19853314556004037, 0.1983179093327462, -0.014171384545486597, -0.08160300363476078, -0.2853557308692308, -0.1224518419797754, -0.2766746730277581, 0.059585121265124705, -0.13611382953808754, -0.1881832859841996, 0.44711829759180544, 0.10774042603249351, 0.2105549075064205, 0.14094890177560349, 0.2803698649541253, 0.18499907884536135, 0.04451536849318516, 0.09055871326820038, 0.16114685054691064, 0.20494118021091534, 0.09956768842724463, -0.2375608679749781, 0.09802016796505389, 0.10662768939995051]
|
1,803.05641
|
Resource Allocation in NOMA based Fog Radio Access Networks
|
In the wake of growth in intelligent mobile devices and wide usage of
bandwidth-hungry applications of mobile Internet, the demand of wireless data
traffic and ubiquitous mobile broadband is rapidly increasing. On account of
these developments, the research on fifth generation (5G) networks presents an
accelerative tendency on a global scale. Edge computing draw lots of attention
for reducing the time delay and improving the Quality of Service for the
networks. While, fog radio access networks (F-RANs) is an emergent
architecture, which takes full use of edge computing and distributed storing
capabilities in edge devices. In this article, we propose an architecture of
non-orthogonal multiple access (NOMA) based F-RANs, which has a strong
capability of edge computing and can meet the heterogeneous requirements in 5G
systems. NOMA with successive interference cancellation (SIC) is regarded as a
critical multi-user access technology. In NOMA, more than one user can access
the same time, code domain, and frequency resources. With assigning different
power levels to multi-user and implementing SIC, multiple users detection can
be achieved. In this article, we provide a description of the NOMA based F-RANs
architecture, and discuss the resource allocation in that. We will focus on the
power and subchannel allocation in consideration of using NOMA and the edge
caching. Simulation results show that the proposed NOMA baesd F-RANs
architecture and the resource management mechanisms can achieve the high net
utility for the RANs.
|
cs.IT math.IT
|
in the wake of growth in intelligent mobile devices and wide usage of bandwidthhungry applications of mobile internet the demand of wireless data traffic and ubiquitous mobile broadband is rapidly increasing on account of these developments the research on fifth generation 5g networks presents an accelerative tendency on a global scale edge computing draw lots of attention for reducing the time delay and improving the quality of service for the networks while fog radio access networks frans is an emergent architecture which takes full use of edge computing and distributed storing capabilities in edge devices in this article we propose an architecture of nonorthogonal multiple access noma based frans which has a strong capability of edge computing and can meet the heterogeneous requirements in 5g systems noma with successive interference cancellation sic is regarded as a critical multiuser access technology in noma more than one user can access the same time code domain and frequency resources with assigning different power levels to multiuser and implementing sic multiple users detection can be achieved in this article we provide a description of the noma based frans architecture and discuss the resource allocation in that we will focus on the power and subchannel allocation in consideration of using noma and the edge caching simulation results show that the proposed noma baesd frans architecture and the resource management mechanisms can achieve the high net utility for the rans
|
[['in', 'the', 'wake', 'of', 'growth', 'in', 'intelligent', 'mobile', 'devices', 'and', 'wide', 'usage', 'of', 'bandwidthhungry', 'applications', 'of', 'mobile', 'internet', 'the', 'demand', 'of', 'wireless', 'data', 'traffic', 'and', 'ubiquitous', 'mobile', 'broadband', 'is', 'rapidly', 'increasing', 'on', 'account', 'of', 'these', 'developments', 'the', 'research', 'on', 'fifth', 'generation', '5g', 'networks', 'presents', 'an', 'accelerative', 'tendency', 'on', 'a', 'global', 'scale', 'edge', 'computing', 'draw', 'lots', 'of', 'attention', 'for', 'reducing', 'the', 'time', 'delay', 'and', 'improving', 'the', 'quality', 'of', 'service', 'for', 'the', 'networks', 'while', 'fog', 'radio', 'access', 'networks', 'frans', 'is', 'an', 'emergent', 'architecture', 'which', 'takes', 'full', 'use', 'of', 'edge', 'computing', 'and', 'distributed', 'storing', 'capabilities', 'in', 'edge', 'devices', 'in', 'this', 'article', 'we', 'propose', 'an', 'architecture', 'of', 'nonorthogonal', 'multiple', 'access', 'noma', 'based', 'frans', 'which', 'has', 'a', 'strong', 'capability', 'of', 'edge', 'computing', 'and', 'can', 'meet', 'the', 'heterogeneous', 'requirements', 'in', '5g', 'systems', 'noma', 'with', 'successive', 'interference', 'cancellation', 'sic', 'is', 'regarded', 'as', 'a', 'critical', 'multiuser', 'access', 'technology', 'in', 'noma', 'more', 'than', 'one', 'user', 'can', 'access', 'the', 'same', 'time', 'code', 'domain', 'and', 'frequency', 'resources', 'with', 'assigning', 'different', 'power', 'levels', 'to', 'multiuser', 'and', 'implementing', 'sic', 'multiple', 'users', 'detection', 'can', 'be', 'achieved', 'in', 'this', 'article', 'we', 'provide', 'a', 'description', 'of', 'the', 'noma', 'based', 'frans', 'architecture', 'and', 'discuss', 'the', 'resource', 'allocation', 'in', 'that', 'we', 'will', 'focus', 'on', 'the', 'power', 'and', 'subchannel', 'allocation', 'in', 'consideration', 'of', 'using', 'noma', 'and', 'the', 'edge', 'caching', 'simulation', 'results', 'show', 'that', 'the', 'proposed', 'noma', 'baesd', 'frans', 'architecture', 'and', 'the', 'resource', 'management', 'mechanisms', 'can', 'achieve', 'the', 'high', 'net', 'utility', 'for', 'the', 'rans']]
|
[-0.27528964843782855, 0.013996987128637775, -0.01308684365008458, -0.027301093920677613, -0.08242796158119277, -0.20988362498057792, 0.09354298523339431, 0.4042422770394628, -0.24706019588662192, -0.278230566023789, 0.07230498480496632, -0.2296167148361852, -0.1731543753040323, 0.163661183597512, -0.10606956182051722, 0.06729067679866349, 0.05628831707222923, -0.004682554492538059, 0.007473139066345062, -0.256565277622573, 0.2832779317235878, 0.13470417439393986, 0.45406778480122145, 0.10905282332086257, 0.02196725449462865, 0.0002800850082756432, -0.04233627807540827, -0.051234613863207684, -0.04224850204774496, 0.16423743299124643, 0.34362575035870013, 0.2140736824077406, 0.33799030043408596, -0.49523538703602527, -0.26975550500540135, 0.050458057081804494, 0.20836672276286447, 0.036046927746849, -0.0852500422548052, -0.2749560731143367, 0.14155830430914149, -0.2831692391958551, -0.03203019337284443, -0.01515542569294444, -0.043401193734090536, 0.05699036441155801, -0.31659684702154456, -0.05091240310985515, -0.018907708621507934, 0.036636531351997556, -0.07003376047517165, -0.09662371476744441, 0.040154301224160506, 0.19172290898459793, -0.005500134456375126, -0.015750260867254385, 0.09457737340390994, -0.15417916773290818, -0.18447996496998348, 0.4189990074913389, 0.04502585217951999, -0.1698921156778348, 0.16558294241314617, -0.06348108698897735, -0.14729961247858891, 0.0983068949449008, 0.2668492305347328, 0.02012662558572551, -0.17319423848185528, 0.042022535802502696, 0.018879233867473613, 0.12809717038630353, 0.07027821609442614, 0.1649271673812679, 0.21003468210365256, 0.2596302099651837, 0.1571408330558803, 0.1114714201254962, -0.11058028499309029, -0.11214179453507961, -0.16617433893316438, -0.1581249976782488, -0.23561287649343582, 0.027957439027894528, -0.10063543690243874, -0.10401502486254396, 0.4031746577323602, 0.16785666444478756, 0.09985092640972223, 0.08515921658276712, 0.41358329344524847, 0.11140008135388961, 0.12629003469060804, 0.14689962529325498, 0.1372622256986637, 0.012681070657730774, 0.21611272797162487, -0.195525233278075, 0.053400652568043876, -0.02769357028872958]
|
1,803.05642
|
Mechanically Controlled Quantum Interference in Graphene Break Junctions
|
The ability to detect and distinguish quantum interference signatures is
important for both fundamental research and for the realization of devices
including electron resonators, interferometers and interference-based spin
filters. Consistent with the principles of subwavelength optics, the wave
nature of electrons can give rise to various types of interference effects,
such as Fabry-P\'erot resonances, Fano resonances and the Aharonov-Bohm effect.
Quantum-interference conductance oscillations have indeed been predicted for
multiwall carbon nanotube shuttles and telescopes, and arise from atomic-scale
displacements between the inner and outer tubes. Previous theoretical work on
graphene bilayers indicates that these systems may display similar interference
features as a function of the relative position of the two sheets. Experimental
verification is, however, still lacking. Graphene nanoconstrictions represent
an ideal model system to study quantum transport phenomena due to the
electronic coherence and the transverse confinement of the carriers. Here, we
demonstrate the fabrication of bowtie-shaped nanoconstrictions with
mechanically controlled break junctions (MCBJs) made from a single layer of
graphene. We find that their electrical conductance displays pronounced
oscillations at room temperature, with amplitudes that modulate over an order
of magnitude as a function of sub-nanometer displacements. Surprisingly, the
oscillations exhibit a period larger than the graphene lattice constant.
Charge-transport calculations show that the periodicity originates from a
combination of quantum-interference and lattice-commensuration effects of two
graphene layers that slide across each other. Our results provide direct
experimental observation of Fabry-P\'erot-like interference of electron waves
that are partially reflected/transmitted at the edges of the graphene bilayer
overlap region.
|
cond-mat.mes-hall
|
the ability to detect and distinguish quantum interference signatures is important for both fundamental research and for the realization of devices including electron resonators interferometers and interferencebased spin filters consistent with the principles of subwavelength optics the wave nature of electrons can give rise to various types of interference effects such as fabryperot resonances fano resonances and the aharonovbohm effect quantuminterference conductance oscillations have indeed been predicted for multiwall carbon nanotube shuttles and telescopes and arise from atomicscale displacements between the inner and outer tubes previous theoretical work on graphene bilayers indicates that these systems may display similar interference features as a function of the relative position of the two sheets experimental verification is however still lacking graphene nanoconstrictions represent an ideal model system to study quantum transport phenomena due to the electronic coherence and the transverse confinement of the carriers here we demonstrate the fabrication of bowtieshaped nanoconstrictions with mechanically controlled break junctions mcbjs made from a single layer of graphene we find that their electrical conductance displays pronounced oscillations at room temperature with amplitudes that modulate over an order of magnitude as a function of subnanometer displacements surprisingly the oscillations exhibit a period larger than the graphene lattice constant chargetransport calculations show that the periodicity originates from a combination of quantuminterference and latticecommensuration effects of two graphene layers that slide across each other our results provide direct experimental observation of fabryperotlike interference of electron waves that are partially reflectedtransmitted at the edges of the graphene bilayer overlap region
|
[['the', 'ability', 'to', 'detect', 'and', 'distinguish', 'quantum', 'interference', 'signatures', 'is', 'important', 'for', 'both', 'fundamental', 'research', 'and', 'for', 'the', 'realization', 'of', 'devices', 'including', 'electron', 'resonators', 'interferometers', 'and', 'interferencebased', 'spin', 'filters', 'consistent', 'with', 'the', 'principles', 'of', 'subwavelength', 'optics', 'the', 'wave', 'nature', 'of', 'electrons', 'can', 'give', 'rise', 'to', 'various', 'types', 'of', 'interference', 'effects', 'such', 'as', 'fabryperot', 'resonances', 'fano', 'resonances', 'and', 'the', 'aharonovbohm', 'effect', 'quantuminterference', 'conductance', 'oscillations', 'have', 'indeed', 'been', 'predicted', 'for', 'multiwall', 'carbon', 'nanotube', 'shuttles', 'and', 'telescopes', 'and', 'arise', 'from', 'atomicscale', 'displacements', 'between', 'the', 'inner', 'and', 'outer', 'tubes', 'previous', 'theoretical', 'work', 'on', 'graphene', 'bilayers', 'indicates', 'that', 'these', 'systems', 'may', 'display', 'similar', 'interference', 'features', 'as', 'a', 'function', 'of', 'the', 'relative', 'position', 'of', 'the', 'two', 'sheets', 'experimental', 'verification', 'is', 'however', 'still', 'lacking', 'graphene', 'nanoconstrictions', 'represent', 'an', 'ideal', 'model', 'system', 'to', 'study', 'quantum', 'transport', 'phenomena', 'due', 'to', 'the', 'electronic', 'coherence', 'and', 'the', 'transverse', 'confinement', 'of', 'the', 'carriers', 'here', 'we', 'demonstrate', 'the', 'fabrication', 'of', 'bowtieshaped', 'nanoconstrictions', 'with', 'mechanically', 'controlled', 'break', 'junctions', 'mcbjs', 'made', 'from', 'a', 'single', 'layer', 'of', 'graphene', 'we', 'find', 'that', 'their', 'electrical', 'conductance', 'displays', 'pronounced', 'oscillations', 'at', 'room', 'temperature', 'with', 'amplitudes', 'that', 'modulate', 'over', 'an', 'order', 'of', 'magnitude', 'as', 'a', 'function', 'of', 'subnanometer', 'displacements', 'surprisingly', 'the', 'oscillations', 'exhibit', 'a', 'period', 'larger', 'than', 'the', 'graphene', 'lattice', 'constant', 'chargetransport', 'calculations', 'show', 'that', 'the', 'periodicity', 'originates', 'from', 'a', 'combination', 'of', 'quantuminterference', 'and', 'latticecommensuration', 'effects', 'of', 'two', 'graphene', 'layers', 'that', 'slide', 'across', 'each', 'other', 'our', 'results', 'provide', 'direct', 'experimental', 'observation', 'of', 'fabryperotlike', 'interference', 'of', 'electron', 'waves', 'that', 'are', 'partially', 'reflectedtransmitted', 'at', 'the', 'edges', 'of', 'the', 'graphene', 'bilayer', 'overlap', 'region']]
|
[-0.18729977123192867, 0.1743073647987565, -0.054360683699468934, 0.003591123027651901, -0.022204248183932636, -0.16781518048036, 0.043143973529954714, 0.4108350122903263, -0.2506344441638747, -0.3159789596177307, -0.007213555905412162, -0.3151040995839022, -0.1811682646765539, 0.2246380406319194, 0.007024944978008036, 0.029366415989164625, 0.05411927888335119, -0.080437331094154, -0.04123102811976306, -0.14514720412356133, 0.26023309612439277, 0.03748713239544867, 0.32268016845656317, 0.10091517469657946, 0.05728808578644549, -0.014894968458036366, 0.06421188655768938, 0.027470354455515683, -0.1248742827509329, 0.07619420797662667, 0.22887385882636263, -0.09298373595670602, 0.1889735149799831, -0.5078013896296222, -0.21547024496530573, 0.004543469477568813, 0.16034310286716302, 0.15511072437173776, -0.04706292070172382, -0.27806898161032867, 0.035922552237377295, -0.1080644886167119, -0.10529962557102995, -0.046833078116892024, -0.005404832217121317, 0.0022466526119857126, -0.2138060565048363, 0.08347048834454449, 0.04629321508978577, 0.06800556708863188, -0.03802717879543413, -0.12112475725241952, -0.052142644256462284, 0.10255696703050841, 0.00797883722641986, -0.01322444012687136, 0.2041697403408527, -0.12229120578323942, -0.16001566622646585, 0.36563430010292286, -0.04016560224438088, -0.1025261397237867, 0.18927411329951288, -0.1924848238047543, -0.032283672313731644, 0.14942487200436694, 0.13240861007004917, 0.06082385072330644, -0.11840538351586269, 0.009974805760007697, -0.024239059116993186, 0.1714289041269841, 0.12197596644945143, 0.16532751527284423, 0.2888747736691467, 0.1769862403987997, 0.05143403454360763, 0.11547316081053013, -0.1465789002235866, -0.026882798626883735, -0.24149197148301849, -0.15361627114625956, -0.17913069140688034, 0.07473487681877046, -0.03500939472307378, -0.21620500620432018, 0.4148982005163787, 0.15255166657293412, 0.18753119869413035, -0.02701660203702857, 0.29230965025189726, 0.08894818647757112, 0.11648583721686126, -0.030905736920108357, 0.2751060153598026, 0.17352419505046018, 0.08569666944141875, -0.2751566359375213, 0.051075702269783155, -0.053824049691038746]
|
1,803.05643
|
Graph codes and local systems
|
It is shown that the good expander codes introduced by Sipser and Spielman,
can be realized as the first homology of a graph with respect to a certain
twisted coefficient system.
|
math.CO
|
it is shown that the good expander codes introduced by sipser and spielman can be realized as the first homology of a graph with respect to a certain twisted coefficient system
|
[['it', 'is', 'shown', 'that', 'the', 'good', 'expander', 'codes', 'introduced', 'by', 'sipser', 'and', 'spielman', 'can', 'be', 'realized', 'as', 'the', 'first', 'homology', 'of', 'a', 'graph', 'with', 'respect', 'to', 'a', 'certain', 'twisted', 'coefficient', 'system']]
|
[-0.16749984190814318, 0.11118846521863053, -0.10208661944395112, 0.06182027772264255, -0.03836325507971548, -0.2125911109690224, -0.03074082007421361, 0.37544086671644644, -0.3387526898614822, -0.3025060181840203, 0.14637814987931522, -0.20713963936413488, -0.23030570029251038, 0.2062397694155093, -0.17003921575603947, 0.1152984871859512, 0.10400800767444796, 0.059091581762092366, -0.045418488124625817, -0.3033382786755195, 0.30272794214467846, 0.15364126680839446, 0.20890478609550384, 0.08075242088506779, 0.09848943196477429, -0.044873424197336836, 0.014706556054372941, 0.10036319776648475, -0.11756989270596081, 0.1107245834183789, 0.24419262716847082, 0.037682614890077425, 0.17749053017506677, -0.3308122270109673, -0.19714497240079987, 0.08709325470150478, 0.1118843401932428, 0.05426697243726061, -0.013263757010140726, -0.2825651614055518, 0.17152231054440623, -0.23713374240023474, -0.06056623676070763, -0.07136567312503053, 0.013692819783764501, 0.036008367375020056, -0.2913584188828545, -0.050059855074411436, 0.0884014944876394, 0.010723011568188667, 0.051017870495636615, -0.10193005963904603, -0.0421221211192108, 0.092040452520333, -0.026432031517728202, 0.13798366841529647, 0.01907393110976104, -0.06847653868457963, -0.16397634028427063, 0.3964974237005076, -0.0960088646144516, -0.19659126844377287, 0.11381034185028364, -0.06660246937685917, -0.12633204063580883, 0.11518769843443748, 0.056029157142245004, 0.11871551638168673, -0.07251371938975588, 0.11132581012075647, -0.13424288478469656, 0.15082861086533916, 0.11794700242218471, -0.030606603535312797, 0.11018153000622988, 0.0805705520775049, 0.12479816081242696, 0.19079054616797234, 0.061065485520708944, -0.0463231856063489, -0.2173481590204662, -0.15333160646860639, -0.26262950692926684, 0.08515851130528797, -0.13734263303312247, -0.17891351569109717, 0.3948214977018295, 0.0627883423510338, 0.21466208594821154, 0.07040904122855395, 0.2024283328979847, 0.10878811342146007, 0.10832918976103106, 0.11977890258534782, 0.1649876568286169, 0.25169826858496713, 0.0343997304237658, -0.14881004649965512, 0.08067616481604355, 0.16999983655348902]
|
1,803.05644
|
Online Fault Identification of Digital Hydraulic Valves Using a Combined
Model-Based and Data-Driven Approach
|
Robustness and fault-tolerance are desirable properties for hydraulic working
machines and field robots. In applications where service personnel do not have
easy access to the machine, it is important that the machine can continue its
operation despite single machinery faults. Digital hydraulics enables a design
which is inherently fault-tolerant by having each hydraulic actuator controlled
by a number of parallel on/off valves. The exact state operation of a digital
hydraulic system enables model based diagnostics of the hydraulic components
and the possibility to compensate for identified faults. This paper presents an
approach for identifying faulty valves based on combination of pressure
measurements made during the normal operation of the machine and a mathematical
model describing the flow balance of the hydraulic system.
|
cs.SY
|
robustness and faulttolerance are desirable properties for hydraulic working machines and field robots in applications where service personnel do not have easy access to the machine it is important that the machine can continue its operation despite single machinery faults digital hydraulics enables a design which is inherently faulttolerant by having each hydraulic actuator controlled by a number of parallel onoff valves the exact state operation of a digital hydraulic system enables model based diagnostics of the hydraulic components and the possibility to compensate for identified faults this paper presents an approach for identifying faulty valves based on combination of pressure measurements made during the normal operation of the machine and a mathematical model describing the flow balance of the hydraulic system
|
[['robustness', 'and', 'faulttolerance', 'are', 'desirable', 'properties', 'for', 'hydraulic', 'working', 'machines', 'and', 'field', 'robots', 'in', 'applications', 'where', 'service', 'personnel', 'do', 'not', 'have', 'easy', 'access', 'to', 'the', 'machine', 'it', 'is', 'important', 'that', 'the', 'machine', 'can', 'continue', 'its', 'operation', 'despite', 'single', 'machinery', 'faults', 'digital', 'hydraulics', 'enables', 'a', 'design', 'which', 'is', 'inherently', 'faulttolerant', 'by', 'having', 'each', 'hydraulic', 'actuator', 'controlled', 'by', 'a', 'number', 'of', 'parallel', 'onoff', 'valves', 'the', 'exact', 'state', 'operation', 'of', 'a', 'digital', 'hydraulic', 'system', 'enables', 'model', 'based', 'diagnostics', 'of', 'the', 'hydraulic', 'components', 'and', 'the', 'possibility', 'to', 'compensate', 'for', 'identified', 'faults', 'this', 'paper', 'presents', 'an', 'approach', 'for', 'identifying', 'faulty', 'valves', 'based', 'on', 'combination', 'of', 'pressure', 'measurements', 'made', 'during', 'the', 'normal', 'operation', 'of', 'the', 'machine', 'and', 'a', 'mathematical', 'model', 'describing', 'the', 'flow', 'balance', 'of', 'the', 'hydraulic', 'system']]
|
[-0.1697138977646408, 0.08519999937025055, -0.05336605080357585, -0.05875087901091081, -0.09944692576594162, -0.22298684628054377, 0.09000936255038365, 0.36824724189631763, -0.26880124357880136, -0.31460160822378563, 0.15067588089350764, -0.20326045600766102, -0.1474093080757827, 0.25622537563131265, -0.13048763206747713, 0.14745324335135443, 0.055545218733566826, 0.0025278894520807463, 0.000597674080903535, -0.20339506969512364, 0.23230911000845494, 0.05431527500880546, 0.34253224084100337, 0.022489492707030816, 0.12541587617187228, 0.026458251828205635, 0.00805394308160624, 0.019037124258084376, -0.06490734748793509, 0.09732114240626392, 0.2896109479441323, 0.12582902160671647, 0.29630688287806317, -0.4850966946878394, -0.1940269905264627, 0.0810469613595652, 0.08889508295850065, 0.1016820060751462, -0.011212464873335461, -0.23538008015259307, 0.0994269663952749, -0.1922067626242022, -0.10591965590863199, -0.10697015430398961, -0.0036155203095881543, 0.04365005479270562, -0.24842045853891578, -0.0036522838684012655, 0.05934739037595554, 0.10600080707307989, -0.044970562726404276, -0.05725277585672123, -0.005484867176865456, 0.15278539655837, -0.010846064090118056, -0.010401608922411917, 0.2341643055282117, -0.1697236614885786, -0.14586927113123238, 0.37575019133414644, 0.0665269562360052, -0.18002442066218002, 0.19272991839307743, -0.026974798783232442, -0.10356320441914264, 0.09916996384100592, 0.21155189229633475, 0.04419878216032855, -0.22557880166826433, 0.02314048901879702, 0.0412073156826931, 0.1653812802015025, 0.017779773984821973, -0.026032613174318046, 0.21560083753353015, 0.22107042446274494, 0.0654425245769237, 0.1662457817187342, -0.08806942517250838, -0.05238276650197804, -0.26453342855159867, -0.18662654887169186, -0.15626914756845867, 0.020017069944902897, -0.05117520676939138, -0.20450964228433297, 0.3942998115576376, 0.18186557170415876, 0.10878309070850249, 0.03283084983404031, 0.3833706075703481, 0.05843165816002541, 0.10685085373373367, 0.10557815658127065, 0.2165900354243082, 0.14487812126467584, 0.16748572853546528, -0.2328449317185422, 0.16942211431374804, -0.0009234227033973228]
|
1,803.05645
|
The Conley-Zehnder indices of the Reeb flow action along $S^1$-fibers
over certain orbifolds
|
We prove a useful relation between the Conley-Zehnder indices of the Reeb
vector flow action along periodic orbits in prequantization bundles and the
orbifold Chern class of the base symplectic orbifolds motivated by the
well-known case of manifolds. We also apply this method to primary examples.
|
math.SG
|
we prove a useful relation between the conleyzehnder indices of the reeb vector flow action along periodic orbits in prequantization bundles and the orbifold chern class of the base symplectic orbifolds motivated by the wellknown case of manifolds we also apply this method to primary examples
|
[['we', 'prove', 'a', 'useful', 'relation', 'between', 'the', 'conleyzehnder', 'indices', 'of', 'the', 'reeb', 'vector', 'flow', 'action', 'along', 'periodic', 'orbits', 'in', 'prequantization', 'bundles', 'and', 'the', 'orbifold', 'chern', 'class', 'of', 'the', 'base', 'symplectic', 'orbifolds', 'motivated', 'by', 'the', 'wellknown', 'case', 'of', 'manifolds', 'we', 'also', 'apply', 'this', 'method', 'to', 'primary', 'examples']]
|
[-0.24539201461669544, 0.06735196374938823, -0.0743197537958622, 0.1248342230101116, -0.10716573723956295, -0.15346319425810614, 0.0088315472745782, 0.36723920391143666, -0.2797782132806985, -0.22052735394960188, 0.06517806116481432, -0.22612579877528807, -0.24993147960175638, 0.21157129339585284, -0.20072057233799412, 0.054662550111179764, 0.08087869533135192, 0.07785008565532854, -0.09791852946838607, -0.24616961437277496, 0.479438203184501, -0.04134568358447565, 0.2557626808791057, 0.069807251824228, 0.10056764035202238, -0.006998640090308111, -0.01596680764392342, 0.0029508177008803773, -0.14948519076342168, 0.17103983044786297, 0.23707189845204676, 0.0015603136828007257, 0.12102835948336059, -0.36813386108564294, -0.20026610515323345, 0.17716756770792214, 0.111520706999885, 0.009133529646889023, 0.007617539736320791, -0.306325583349225, 0.10624179455613636, -0.15478233185738488, -0.20333923038054744, -0.103175007171281, 0.051051986343024866, 0.04702985068054303, -0.18711222732520622, -0.018303351288879006, 0.11552583911005691, 0.14013563056031, -0.11637777867524521, -0.03232639240424918, -0.11145842868996703, 0.10769920205980864, 0.12178454094606897, 0.0117008488767011, 0.09997388839964634, -0.055396067621388836, -0.1479162897347756, 0.3735792852290299, -0.10102053199206358, -0.2940844230191863, 0.10968869738280773, -0.10235403395136414, -0.20502476074287426, 0.1155794064676308, 0.13068440445172397, 0.21837655750467724, 0.020610899542984756, 0.11252771778432046, -0.08841613572819726, 0.0342552298275025, 0.09238648525965602, -0.07556525324268834, 0.18250708763852067, 0.06391590729902458, 0.1399421271989527, 0.1696947002530341, -0.05149168776267249, -0.11646487414027037, -0.347594066135808, -0.2138999174652702, -0.0918408560404635, 0.14798214131682788, -0.13326743296720847, -0.12744785311287674, 0.45964460803762724, 0.05646321622897749, 0.2159889273689655, 0.12640199117848408, 0.2490962896718765, 0.03922985425299924, 0.030372848552044317, 0.08542799504230851, 0.17235295981188994, 0.2687202071285118, 0.028276163780980784, -0.1357898137876359, -0.13373490101050423, 0.2506536359331854]
|
1,803.05646
|
Existence of (Markovian) solutions to martingale problems associated
with L\'evy-type operators
|
Let $A$ be a pseudo-differential operator with symbol $q(x,\xi)$. In this
paper we derive sufficient conditions which ensure the existence of a solution
to the $(A,C_c^{\infty}(\mathbb{R}^d))$-martingale problem. If the symbol $q$
depends continuously on the space variable $x$, then the existence of solutions
is well understood, and therefore the focus lies on martingale problems for
pseudo-differential operators with discontinuous coefficients. We prove an
existence result which allows us, in particular, to obtain new insights on the
existence of weak solutions to a class of L\'evy-driven SDEs with Borel
measurable coefficients and on the the existence of stable-like processes with
discontinuous coefficients. Moreover, we establish a Markovian selection
theorem which shows that - under mild assumptions - the
$(A,C_c^{\infty}(\mathbb{R}^d))$-martingale problem gives rise to a strong
Markov process. The result applies, in particular, to L\'evy-driven SDEs. We
illustrate the Markovian selection theorem with applications in the theory of
non-local operators and equations; in particular, we establish under weak
regularity assumptions a Harnack inequality for non-local operators of variable
order.
|
math.PR
|
let a be a pseudodifferential operator with symbol qxxi in this paper we derive sufficient conditions which ensure the existence of a solution to the ac_cinftymathbbrdmartingale problem if the symbol q depends continuously on the space variable x then the existence of solutions is well understood and therefore the focus lies on martingale problems for pseudodifferential operators with discontinuous coefficients we prove an existence result which allows us in particular to obtain new insights on the existence of weak solutions to a class of levydriven sdes with borel measurable coefficients and on the the existence of stablelike processes with discontinuous coefficients moreover we establish a markovian selection theorem which shows that under mild assumptions the ac_cinftymathbbrdmartingale problem gives rise to a strong markov process the result applies in particular to levydriven sdes we illustrate the markovian selection theorem with applications in the theory of nonlocal operators and equations in particular we establish under weak regularity assumptions a harnack inequality for nonlocal operators of variable order
|
[['let', 'a', 'be', 'a', 'pseudodifferential', 'operator', 'with', 'symbol', 'qxxi', 'in', 'this', 'paper', 'we', 'derive', 'sufficient', 'conditions', 'which', 'ensure', 'the', 'existence', 'of', 'a', 'solution', 'to', 'the', 'ac_cinftymathbbrdmartingale', 'problem', 'if', 'the', 'symbol', 'q', 'depends', 'continuously', 'on', 'the', 'space', 'variable', 'x', 'then', 'the', 'existence', 'of', 'solutions', 'is', 'well', 'understood', 'and', 'therefore', 'the', 'focus', 'lies', 'on', 'martingale', 'problems', 'for', 'pseudodifferential', 'operators', 'with', 'discontinuous', 'coefficients', 'we', 'prove', 'an', 'existence', 'result', 'which', 'allows', 'us', 'in', 'particular', 'to', 'obtain', 'new', 'insights', 'on', 'the', 'existence', 'of', 'weak', 'solutions', 'to', 'a', 'class', 'of', 'levydriven', 'sdes', 'with', 'borel', 'measurable', 'coefficients', 'and', 'on', 'the', 'the', 'existence', 'of', 'stablelike', 'processes', 'with', 'discontinuous', 'coefficients', 'moreover', 'we', 'establish', 'a', 'markovian', 'selection', 'theorem', 'which', 'shows', 'that', 'under', 'mild', 'assumptions', 'the', 'ac_cinftymathbbrdmartingale', 'problem', 'gives', 'rise', 'to', 'a', 'strong', 'markov', 'process', 'the', 'result', 'applies', 'in', 'particular', 'to', 'levydriven', 'sdes', 'we', 'illustrate', 'the', 'markovian', 'selection', 'theorem', 'with', 'applications', 'in', 'the', 'theory', 'of', 'nonlocal', 'operators', 'and', 'equations', 'in', 'particular', 'we', 'establish', 'under', 'weak', 'regularity', 'assumptions', 'a', 'harnack', 'inequality', 'for', 'nonlocal', 'operators', 'of', 'variable', 'order']]
|
[-0.14213576686258117, 0.04144902003048848, -0.10184104053980925, 0.0777903898721971, -0.11333352144751134, -0.15508227819351084, 0.05340553408446298, 0.3125222957495487, -0.30892559757145743, -0.17085945686381876, 0.15688394541838066, -0.23051646972281478, -0.1375624212238825, 0.19760685347860227, -0.1257988917302679, 0.05505849038899848, 0.062242628010272076, 0.0395758860180098, -0.09116146862506866, -0.2106959678500778, 0.3952493066193931, -0.04754075809861674, 0.22582429232019366, 0.08372086017519574, 0.15248480291585578, 0.014249987098755258, -0.022152076276357877, -0.04023783050325812, -0.1957387274627267, 0.09686908705978457, 0.2535386690361933, 0.048439383601318255, 0.3195546408365551, -0.39950794635453457, -0.18659300249860142, 0.17746012960983948, 0.06113232401284305, 0.05883837855124677, -0.028530846235596322, -0.314718285120431, 0.10939039978565591, -0.09870534443867986, -0.20099612997675484, -0.09614159526924292, -0.0036703843171849394, 0.07572865468929663, -0.4006101845227408, 0.09573665726083246, 0.13720259805365156, 0.017866640643985715, -0.10948314244865975, -0.03463512527841059, 0.012123867839744146, 0.05549121408469298, 0.0762035605326563, -0.019389010556606634, 0.04574529965492812, -0.06711370602221878, -0.12290617946930456, 0.31053214785219596, -0.13455613882661882, -0.2853809814787272, 0.1838733506191409, -0.18218562405443553, -0.18411098041882118, 0.07918414286704678, 0.17257303315405312, 0.1765178654286446, -0.1673286465815071, 0.1707555288099684, -0.08159797408928474, 0.13657481941309843, 0.061640203693373634, 0.07650752583391626, 0.07029929417326594, 0.10876205890778114, 0.19008588450537486, 0.14254944951513387, 0.01097988292969989, -0.10869534606339805, -0.3755982778063326, -0.1495823052909338, -0.11245720621170194, 0.1231971349849394, -0.13053948609131938, -0.21717510660263625, 0.35889942740569963, 0.15743921554901383, 0.17379386688046383, 0.10012130458684017, 0.17140753516983806, 0.22807264303555713, -0.007255352299773332, 0.0602692994345544, 0.15317283259196715, 0.2089920045144743, 0.11917596891183745, -0.17740098669221907, 0.09762999427321395, 0.17009231521409343]
|
1,803.05647
|
Modelling and Analysing the Landing Gear System: a Solution with
Event-B/Rodin
|
This paper presents a solution to the landing gear system case study using
Event-B and Rodin. We study the whole system (both the digital part and the
controlled part). We use feature augmentation to build an abstract model of the
whole system and structural refinement to detail more specifically the digital
part. The required safety properties are formalised and proved. We propose a
specific approach to deal with a family of reachability properties. The
experimentations conducted during the study are supported by the Rodin tools.
We show that the presented solution is systematic and it can be applied to
similar case studies.
|
cs.SE
|
this paper presents a solution to the landing gear system case study using eventb and rodin we study the whole system both the digital part and the controlled part we use feature augmentation to build an abstract model of the whole system and structural refinement to detail more specifically the digital part the required safety properties are formalised and proved we propose a specific approach to deal with a family of reachability properties the experimentations conducted during the study are supported by the rodin tools we show that the presented solution is systematic and it can be applied to similar case studies
|
[['this', 'paper', 'presents', 'a', 'solution', 'to', 'the', 'landing', 'gear', 'system', 'case', 'study', 'using', 'eventb', 'and', 'rodin', 'we', 'study', 'the', 'whole', 'system', 'both', 'the', 'digital', 'part', 'and', 'the', 'controlled', 'part', 'we', 'use', 'feature', 'augmentation', 'to', 'build', 'an', 'abstract', 'model', 'of', 'the', 'whole', 'system', 'and', 'structural', 'refinement', 'to', 'detail', 'more', 'specifically', 'the', 'digital', 'part', 'the', 'required', 'safety', 'properties', 'are', 'formalised', 'and', 'proved', 'we', 'propose', 'a', 'specific', 'approach', 'to', 'deal', 'with', 'a', 'family', 'of', 'reachability', 'properties', 'the', 'experimentations', 'conducted', 'during', 'the', 'study', 'are', 'supported', 'by', 'the', 'rodin', 'tools', 'we', 'show', 'that', 'the', 'presented', 'solution', 'is', 'systematic', 'and', 'it', 'can', 'be', 'applied', 'to', 'similar', 'case', 'studies']]
|
[-0.10780131337849204, -0.019791439352368743, -0.09619735264876748, 0.05136429905142708, -0.09495943628580254, -0.08113185994272284, 0.03506886982016594, 0.3825196024833941, -0.27995978796160687, -0.28949727007534864, 0.15587409470554478, -0.25516653046304105, -0.1930136371440455, 0.20141312810272782, -0.09473499890380338, 0.08698432240178626, 0.08434958769894187, -0.01042220769130497, -0.0290307894613886, -0.23863483535344987, 0.3210526267979659, 0.041034981763611235, 0.2765579576759289, 0.01477662057561033, 0.06348075171220391, 0.012770180704583432, -0.04725979925955043, 0.045000647103377416, -0.1479359847821173, 0.14648540364578366, 0.2431762113906991, 0.1721455518558037, 0.28340773524570406, -0.41134021991827324, -0.17541302422828534, 0.08080877464118541, 0.1089736042252066, 0.10981125012496669, -0.0707526480918579, -0.306218002626088, 0.13964103211593978, -0.20386914147392793, -0.13891382802131713, -0.13080363105594492, -0.042800289834393004, 0.014775481629733215, -0.23909686211788772, -0.041306947595348545, 0.09002445292129528, 0.08787723572230806, -0.07246212501366459, -0.05307756545702361, 0.0015613562336155011, 0.15389549467534594, 0.003155404826233565, 0.018593592763257522, 0.11523110662386113, -0.07740063563402395, -0.09610364315962858, 0.38473669650642583, -0.03708037605061762, -0.2133880106620399, 0.20668229464368493, -0.08510549345930271, -0.152391311429514, 0.040241946758446744, 0.1943797924939324, 0.14002690466084317, -0.19303196745322032, 0.055548155385265856, -0.018975819552353786, 0.20930617744577865, -0.0053789648410005894, -0.04349495112147255, 0.1430379802123735, 0.23012765384662678, 0.031202193860914194, 0.23650715849704712, -0.041106160424247966, -0.08445132703648187, -0.2926825230174205, -0.18705287118278005, -0.13093480136355057, -0.011115673189873205, 0.012880234009678722, -0.13673270961689746, 0.41578354953112556, 0.18650003777621155, 0.15576455358178445, 0.06261165984723643, 0.31296512553829003, 0.11207975840707328, 0.049148315372055065, 0.05524115937798485, 0.18312694989007844, 0.07631864397576553, 0.15881005130416037, -0.18932888791531177, 0.05933378807122947, 0.08113494809424761]
|
1,803.05648
|
LEGO: Learning Edge with Geometry all at Once by Watching Videos
|
Learning to estimate 3D geometry in a single image by watching unlabeled
videos via deep convolutional network is attracting significant attention. In
this paper, we introduce a "3D as-smooth-as-possible (3D-ASAP)" prior inside
the pipeline, which enables joint estimation of edges and 3D scene, yielding
results with significant improvement in accuracy for fine detailed structures.
Specifically, we define the 3D-ASAP prior by requiring that any two points
recovered in 3D from an image should lie on an existing planar surface if no
other cues provided. We design an unsupervised framework that Learns Edges and
Geometry (depth, normal) all at Once (LEGO). The predicted edges are embedded
into depth and surface normal smoothness terms, where pixels without edges
in-between are constrained to satisfy the prior. In our framework, the
predicted depths, normals and edges are forced to be consistent all the time.
We conduct experiments on KITTI to evaluate our estimated geometry and
CityScapes to perform edge evaluation. We show that in all of the tasks,
i.e.depth, normal and edge, our algorithm vastly outperforms other
state-of-the-art (SOTA) algorithms, demonstrating the benefits of our approach.
|
cs.CV
|
learning to estimate 3d geometry in a single image by watching unlabeled videos via deep convolutional network is attracting significant attention in this paper we introduce a 3d assmoothaspossible 3dasap prior inside the pipeline which enables joint estimation of edges and 3d scene yielding results with significant improvement in accuracy for fine detailed structures specifically we define the 3dasap prior by requiring that any two points recovered in 3d from an image should lie on an existing planar surface if no other cues provided we design an unsupervised framework that learns edges and geometry depth normal all at once lego the predicted edges are embedded into depth and surface normal smoothness terms where pixels without edges inbetween are constrained to satisfy the prior in our framework the predicted depths normals and edges are forced to be consistent all the time we conduct experiments on kitti to evaluate our estimated geometry and cityscapes to perform edge evaluation we show that in all of the tasks iedepth normal and edge our algorithm vastly outperforms other stateoftheart sota algorithms demonstrating the benefits of our approach
|
[['learning', 'to', 'estimate', '3d', 'geometry', 'in', 'a', 'single', 'image', 'by', 'watching', 'unlabeled', 'videos', 'via', 'deep', 'convolutional', 'network', 'is', 'attracting', 'significant', 'attention', 'in', 'this', 'paper', 'we', 'introduce', 'a', '3d', 'assmoothaspossible', '3dasap', 'prior', 'inside', 'the', 'pipeline', 'which', 'enables', 'joint', 'estimation', 'of', 'edges', 'and', '3d', 'scene', 'yielding', 'results', 'with', 'significant', 'improvement', 'in', 'accuracy', 'for', 'fine', 'detailed', 'structures', 'specifically', 'we', 'define', 'the', '3dasap', 'prior', 'by', 'requiring', 'that', 'any', 'two', 'points', 'recovered', 'in', '3d', 'from', 'an', 'image', 'should', 'lie', 'on', 'an', 'existing', 'planar', 'surface', 'if', 'no', 'other', 'cues', 'provided', 'we', 'design', 'an', 'unsupervised', 'framework', 'that', 'learns', 'edges', 'and', 'geometry', 'depth', 'normal', 'all', 'at', 'once', 'lego', 'the', 'predicted', 'edges', 'are', 'embedded', 'into', 'depth', 'and', 'surface', 'normal', 'smoothness', 'terms', 'where', 'pixels', 'without', 'edges', 'inbetween', 'are', 'constrained', 'to', 'satisfy', 'the', 'prior', 'in', 'our', 'framework', 'the', 'predicted', 'depths', 'normals', 'and', 'edges', 'are', 'forced', 'to', 'be', 'consistent', 'all', 'the', 'time', 'we', 'conduct', 'experiments', 'on', 'kitti', 'to', 'evaluate', 'our', 'estimated', 'geometry', 'and', 'cityscapes', 'to', 'perform', 'edge', 'evaluation', 'we', 'show', 'that', 'in', 'all', 'of', 'the', 'tasks', 'iedepth', 'normal', 'and', 'edge', 'our', 'algorithm', 'vastly', 'outperforms', 'other', 'stateoftheart', 'sota', 'algorithms', 'demonstrating', 'the', 'benefits', 'of', 'our', 'approach']]
|
[-0.04138680402344714, 0.0096861371792329, -0.05495273894112971, 0.0009064643326888068, -0.10463424965532289, -0.14392725485894414, 0.024962020652876366, 0.489870713920229, -0.2388316728329907, -0.35432320530008937, 0.05321090692110981, -0.2870356193071024, -0.18890017060362474, 0.174346933242244, -0.14617890427147762, 0.06160699870282163, 0.14110216367472378, 0.04059395284081499, -0.0895450532501046, -0.27471732512219915, 0.290980375419733, 0.005382421260744902, 0.31627143120341417, 0.02415298136572043, 0.10698273735276113, 0.0027013262746752136, -0.0423319445476712, 0.041904724875025244, -0.11539398131875107, 0.1510230709772764, 0.26865820251405237, 0.1446098121503989, 0.2353701520517158, -0.47723973971895045, -0.23425772215964066, 0.07722525460283375, 0.131290656586902, 0.0929791975824628, -0.0270994730022115, -0.34766273686869276, 0.11681845712203844, -0.10127543655819156, -0.009800441523030815, -0.10089270581180851, -0.02624197649872965, -0.04751980058952338, -0.2842784333611942, 0.02959819517822729, 0.08724927758642782, 0.05265853753986044, -0.061580798379792315, -0.11423616128223431, -0.04653234707657248, 0.17965669756393052, -0.021463928209979916, 0.06123962164339092, 0.13879119148882132, -0.18143225085833464, -0.12970756388709156, 0.34848811945153607, -0.06149302307619817, -0.20809953903468947, 0.19435873701651063, -0.08763800492678354, -0.11476794120648669, 0.1427611879331784, 0.20857446996960788, 0.11910736349204348, -0.11321608417460488, 0.035268418825257365, -0.07521177029185411, 0.16107497771736234, 0.061969624061344396, -0.02675643934829471, 0.1800581591401068, 0.20870254659611318, 0.06960869812044418, 0.1198992963712145, -0.17595624573425286, -0.04568178255705991, -0.2409726141111201, -0.11770990485868728, -0.19123261124736424, -0.04706560779337047, -0.12928452548367203, -0.1468605310138729, 0.4014256967593812, 0.2293173684272915, 0.2541405357187614, 0.0991889128985349, 0.3760345182782556, 0.01716128658865475, 0.09322119047832934, 0.1344661334581259, 0.19231377026040314, -0.010381561815221277, 0.036423456355825896, -0.13819794339037295, 0.05395403853876309, 0.06100767377712246]
|
1,803.05649
|
Sylvester Normalizing Flows for Variational Inference
|
Variational inference relies on flexible approximate posterior distributions.
Normalizing flows provide a general recipe to construct flexible variational
posteriors. We introduce Sylvester normalizing flows, which can be seen as a
generalization of planar flows. Sylvester normalizing flows remove the
well-known single-unit bottleneck from planar flows, making a single
transformation much more flexible. We compare the performance of Sylvester
normalizing flows against planar flows and inverse autoregressive flows and
demonstrate that they compare favorably on several datasets.
|
stat.ML cs.AI cs.LG stat.ME
|
variational inference relies on flexible approximate posterior distributions normalizing flows provide a general recipe to construct flexible variational posteriors we introduce sylvester normalizing flows which can be seen as a generalization of planar flows sylvester normalizing flows remove the wellknown singleunit bottleneck from planar flows making a single transformation much more flexible we compare the performance of sylvester normalizing flows against planar flows and inverse autoregressive flows and demonstrate that they compare favorably on several datasets
|
[['variational', 'inference', 'relies', 'on', 'flexible', 'approximate', 'posterior', 'distributions', 'normalizing', 'flows', 'provide', 'a', 'general', 'recipe', 'to', 'construct', 'flexible', 'variational', 'posteriors', 'we', 'introduce', 'sylvester', 'normalizing', 'flows', 'which', 'can', 'be', 'seen', 'as', 'a', 'generalization', 'of', 'planar', 'flows', 'sylvester', 'normalizing', 'flows', 'remove', 'the', 'wellknown', 'singleunit', 'bottleneck', 'from', 'planar', 'flows', 'making', 'a', 'single', 'transformation', 'much', 'more', 'flexible', 'we', 'compare', 'the', 'performance', 'of', 'sylvester', 'normalizing', 'flows', 'against', 'planar', 'flows', 'and', 'inverse', 'autoregressive', 'flows', 'and', 'demonstrate', 'that', 'they', 'compare', 'favorably', 'on', 'several', 'datasets']]
|
[-0.07780159168760292, 0.046122780265776736, -0.08634768470533584, 0.1315611854048544, -0.13330020400769027, -0.1701358098745052, -0.026135994795415746, 0.42343774512961607, -0.32549270773061406, -0.24249336290124215, 0.12380569968617668, -0.24654029682278633, -0.16646078618329116, 0.23741825959204058, -0.10839414250375212, 0.14514924125059656, 0.12735160988583966, -0.07309634122334262, -0.10020293890173841, -0.190265409100041, 0.2778069506472859, 0.039013059589227565, 0.3553762758812426, -0.05122011523742817, 0.13828028972554757, -0.037674561486040294, -0.09167356606830206, 0.05263834355987216, -0.15287073896816814, 0.1824024188099429, 0.23246079103678072, 0.12604711974333777, 0.24820227386111296, -0.4297687912016715, -0.2667583478859773, 0.0682138540708509, 0.1685390455746337, 0.10781803172358195, -0.014035849753303123, -0.24511342498130703, 0.030742677522970264, -0.21571381780086085, -0.04993771721523157, -0.21762897946724766, -0.029359834342214623, 0.06475213583632324, -0.2900870272669157, 0.0915816195500539, 0.0633055559163423, 0.014724868669298686, 0.025282416321141154, -0.10165018343066454, -0.007433651422616094, 0.07866571740075749, 0.0262891981064489, -0.02470677658474367, 0.14654746553002806, -0.13084444129153303, -0.11101431263408526, 0.3611017466449228, -0.07913016784004867, -0.2919281206804475, 0.20826544460693472, 0.017725878603462326, -0.15872349131141641, 0.13066628004277223, 0.22584112339015855, 0.17518904136101665, -0.14936827397660205, 0.019375198237340602, -0.09580359819473845, 0.09563024278338018, 0.1206628787576368, -0.1574810927719993, 0.13875558395490148, 0.13733062266960347, 0.12634698921618492, 0.2135336800512098, -0.0746019256092902, -0.1308605834829474, -0.22057785981757516, -0.1281053076565609, -0.1394650702928438, 0.06430031718857783, -0.1464434950118486, -0.23367308513996632, 0.3184439156351513, 0.16906884395652205, 0.21026151419592728, 0.17673657610430382, 0.2999653036500891, 0.10170413839085468, 0.035926384747175404, 0.2177421735403569, 0.1648066704357533, 0.1728854990735846, 0.06065657429740225, -0.11580093465224643, 0.0919973123818636, 0.13465018786097827]
|
1,803.0565
|
Decaying warm dark matter and structure formation
|
We examine the cosmology of warm dark matter (WDM), both stable and decaying,
from the point of view of structure formation. We compare the matter power
spectrum associated to WDM masses of 1.5 keV and 0.158 keV, with that expected
for the stable cold dark matter $\Lambda$CDM$\equiv$SCDM paradigm, taken as our
reference model. We scrutinize the effects associated to the warm nature of
dark matter, as well as the fact that it decays. The decaying warm dark matter
(DWDM) scenario is well-motivated, emerging in a broad class of particle
physics theories where neutrino masses arise from the spontaneous breaking of a
continuous global lepton number symmetry. The majoron arises as a
Nambu-Goldstone boson, and picks up a mass from gravitational effects, that
explicitly violate global symmetries. The majoron necessarily decays to
neutrinos, with an amplitude proportional to their tiny mass, which typically
gives it cosmologically long lifetimes. Using N-body simulations we show that
our DWDM picture leads to a viable alternative to the $\Lambda$CDM scenario,
with predictions that can differ substantially on small scales.
|
astro-ph.CO hep-ph
|
we examine the cosmology of warm dark matter wdm both stable and decaying from the point of view of structure formation we compare the matter power spectrum associated to wdm masses of 15 kev and 0158 kev with that expected for the stable cold dark matter lambdacdmequivscdm paradigm taken as our reference model we scrutinize the effects associated to the warm nature of dark matter as well as the fact that it decays the decaying warm dark matter dwdm scenario is wellmotivated emerging in a broad class of particle physics theories where neutrino masses arise from the spontaneous breaking of a continuous global lepton number symmetry the majoron arises as a nambugoldstone boson and picks up a mass from gravitational effects that explicitly violate global symmetries the majoron necessarily decays to neutrinos with an amplitude proportional to their tiny mass which typically gives it cosmologically long lifetimes using nbody simulations we show that our dwdm picture leads to a viable alternative to the lambdacdm scenario with predictions that can differ substantially on small scales
|
[['we', 'examine', 'the', 'cosmology', 'of', 'warm', 'dark', 'matter', 'wdm', 'both', 'stable', 'and', 'decaying', 'from', 'the', 'point', 'of', 'view', 'of', 'structure', 'formation', 'we', 'compare', 'the', 'matter', 'power', 'spectrum', 'associated', 'to', 'wdm', 'masses', 'of', '15', 'kev', 'and', '0158', 'kev', 'with', 'that', 'expected', 'for', 'the', 'stable', 'cold', 'dark', 'matter', 'lambdacdmequivscdm', 'paradigm', 'taken', 'as', 'our', 'reference', 'model', 'we', 'scrutinize', 'the', 'effects', 'associated', 'to', 'the', 'warm', 'nature', 'of', 'dark', 'matter', 'as', 'well', 'as', 'the', 'fact', 'that', 'it', 'decays', 'the', 'decaying', 'warm', 'dark', 'matter', 'dwdm', 'scenario', 'is', 'wellmotivated', 'emerging', 'in', 'a', 'broad', 'class', 'of', 'particle', 'physics', 'theories', 'where', 'neutrino', 'masses', 'arise', 'from', 'the', 'spontaneous', 'breaking', 'of', 'a', 'continuous', 'global', 'lepton', 'number', 'symmetry', 'the', 'majoron', 'arises', 'as', 'a', 'nambugoldstone', 'boson', 'and', 'picks', 'up', 'a', 'mass', 'from', 'gravitational', 'effects', 'that', 'explicitly', 'violate', 'global', 'symmetries', 'the', 'majoron', 'necessarily', 'decays', 'to', 'neutrinos', 'with', 'an', 'amplitude', 'proportional', 'to', 'their', 'tiny', 'mass', 'which', 'typically', 'gives', 'it', 'cosmologically', 'long', 'lifetimes', 'using', 'nbody', 'simulations', 'we', 'show', 'that', 'our', 'dwdm', 'picture', 'leads', 'to', 'a', 'viable', 'alternative', 'to', 'the', 'lambdacdm', 'scenario', 'with', 'predictions', 'that', 'can', 'differ', 'substantially', 'on', 'small', 'scales']]
|
[-0.09514588666164633, 0.22662652895802354, -0.09164743625822698, 0.16067205879075527, -0.09585792762684943, -0.13714603167780906, -0.004126825604743911, 0.29567735662651545, -0.24327077790879445, -0.3476018015122999, 0.01338099646099407, -0.2602911834481221, -0.029742957574632987, 0.14143812278961235, 0.03860006037045733, 0.008958869767133039, -0.018667254708653498, -0.02364214330190265, -0.04399480955336092, -0.20949860694925865, 0.28920549092776643, 0.0820288144891834, 0.2051272902723854, 0.027058360237504405, 0.06432666562260747, -0.07336938858363304, -0.023735175934765554, -0.05923875172103007, -0.13298165495612563, 0.0042196081573079, 0.16328175594852537, 0.11203182552674666, 0.17846995548646616, -0.3875962969324837, -0.2324250496606305, 0.2144375341820579, 0.1704235823839806, 0.10799885536557484, -0.11272870317758249, -0.31849275822239803, 0.06991237996555219, -0.2459630711660909, -0.14293274834127612, -0.037521486811210654, -0.0287867670776484, -0.061588008069793955, -0.2795308369115625, 0.15734232837573836, -0.04586124714030588, -0.09282659219760943, -0.06432593922733701, -0.10022873193768493, -0.04746790861070285, -0.004427330126323754, 0.1513216114236914, -0.012938978626914968, 0.20664933461068746, -0.18743351908572922, -0.09143875992077677, 0.49001681602242364, -0.12265508329479638, -0.09482568278183658, 0.2124365643581989, -0.11768849996709926, -0.15217858746330215, 0.1592203790289646, 0.14837495594640732, 0.050980807256123126, -0.09347412341733254, 0.10247123418974749, -0.0806773866088038, 0.2183767721668287, 0.03946222838100498, 0.09712739309734757, 0.36713674371642185, 0.17376827091689226, 0.04405416779871492, 0.026250548364669946, -0.09112905358392315, -0.12605595784907828, -0.36665812704841355, -0.0909619778677326, -0.12351114598689655, 0.07173320227517946, -0.07263012505662991, -0.13479189076756984, 0.380636306651841, 0.14144154139282988, 0.22603155423838622, 0.05851977576725077, 0.30885476297348996, 0.05954817812176518, 0.06080134154695781, 0.041252032420301885, 0.30895302613734166, 0.14762716103517423, 0.0903880571935735, -0.2245859977145911, -0.07224068962403632, -0.028457313361496938]
|
1,803.05651
|
Word2Bits - Quantized Word Vectors
|
Word vectors require significant amounts of memory and storage, posing issues
to resource limited devices like mobile phones and GPUs. We show that high
quality quantized word vectors using 1-2 bits per parameter can be learned by
introducing a quantization function into Word2Vec. We furthermore show that
training with the quantization function acts as a regularizer. We train word
vectors on English Wikipedia (2017) and evaluate them on standard word
similarity and analogy tasks and on question answering (SQuAD). Our quantized
word vectors not only take 8-16x less space than full precision (32 bit) word
vectors but also outperform them on word similarity tasks and question
answering.
|
cs.CL
|
word vectors require significant amounts of memory and storage posing issues to resource limited devices like mobile phones and gpus we show that high quality quantized word vectors using 12 bits per parameter can be learned by introducing a quantization function into word2vec we furthermore show that training with the quantization function acts as a regularizer we train word vectors on english wikipedia 2017 and evaluate them on standard word similarity and analogy tasks and on question answering squad our quantized word vectors not only take 816x less space than full precision 32 bit word vectors but also outperform them on word similarity tasks and question answering
|
[['word', 'vectors', 'require', 'significant', 'amounts', 'of', 'memory', 'and', 'storage', 'posing', 'issues', 'to', 'resource', 'limited', 'devices', 'like', 'mobile', 'phones', 'and', 'gpus', 'we', 'show', 'that', 'high', 'quality', 'quantized', 'word', 'vectors', 'using', '12', 'bits', 'per', 'parameter', 'can', 'be', 'learned', 'by', 'introducing', 'a', 'quantization', 'function', 'into', 'word2vec', 'we', 'furthermore', 'show', 'that', 'training', 'with', 'the', 'quantization', 'function', 'acts', 'as', 'a', 'regularizer', 'we', 'train', 'word', 'vectors', 'on', 'english', 'wikipedia', '2017', 'and', 'evaluate', 'them', 'on', 'standard', 'word', 'similarity', 'and', 'analogy', 'tasks', 'and', 'on', 'question', 'answering', 'squad', 'our', 'quantized', 'word', 'vectors', 'not', 'only', 'take', '816x', 'less', 'space', 'than', 'full', 'precision', '32', 'bit', 'word', 'vectors', 'but', 'also', 'outperform', 'them', 'on', 'word', 'similarity', 'tasks', 'and', 'question', 'answering']]
|
[-0.07491654012448874, 0.1012110921624556, 0.031160185377131094, 0.1070989652428082, -0.17819021735340357, -0.2181942857310993, 0.1632651151070055, 0.48060204038607346, -0.33048895840480363, -0.3351367565469359, 0.025743334013792984, -0.3303212078512242, -0.14093593374457, 0.20116413602570318, -0.16871892290523732, 0.0709886949197477, 0.18989850429572025, 0.11996157257378383, -0.08790256614458554, -0.38488021688008645, 0.2862665141023309, 0.053178881593751455, 0.3508237581172923, -0.033377071614113615, 0.18874181518858335, -0.02827379784880663, -0.047058981751039064, -0.07429792355545049, -0.032721615115972456, 0.15299639326326972, 0.3116457922151312, 0.21770877462267033, 0.3260455525497783, -0.39997127255038273, -0.21040085171577785, 0.06638504178395038, 0.1703081937366218, 0.0914166407826585, -0.01502116466872394, -0.34368858583939244, 0.12942602132218625, -0.19512174413803052, 0.1457820710450694, -0.1760515882018602, 0.0430378170402826, -0.0305865116698562, -0.21758337436191175, 0.04098099956639278, 0.10836443443835345, 0.06033259097767888, -0.05974493662012359, -0.1496198706610023, 0.07510694075279149, 0.1470288581188487, 0.019674140696396242, 0.1244883840290812, 0.14229796170520614, -0.15333230767330705, -0.1972577178978168, 0.3853815852769844, -0.06601281802871216, -0.3074274707743722, 0.13141760258838744, -0.0736251110254945, -0.11237780165524697, -0.002547496481675584, 0.23249318184416723, 0.025272794171095878, -0.07050231575333285, 0.03827289206893974, -0.07783220768994037, 0.30934441320813383, 0.1659962324236678, 0.05455938317233099, 0.17284378149757548, 0.17418166840413832, 0.0028888984332915467, 0.0889334889021175, -0.06654807915175245, -0.02947112343291629, -0.16162328610091276, -0.15671554786803307, -0.25451734501271034, 0.027927299252110488, -0.14492427140286518, -0.11982852123888596, 0.3581106166908834, 0.20875493448034352, 0.23172782329877592, 0.11948078660786433, 0.2999213805141033, 0.06000516844368627, 0.15003232980797174, 0.15137867104121536, 0.05783146837691091, -0.02263754920129014, 0.11839438098886947, -0.11652275302583563, 0.03476718498639903, 0.10591349825438745]
|
1,803.05652
|
Relaxed Locally Correctable Codes in Computationally Bounded Channels
|
Error-correcting codes that admit local decoding and correcting algorithms
have been the focus of much recent research due to their numerous theoretical
and practical applications. An important goal is to obtain the best possible
tradeoffs between the number of queries the algorithm makes to its oracle (the
locality of the task), and the amount of redundancy in the encoding (the
information rate).
In Hamming's classical adversarial channel model, the current tradeoffs are
dramatic, allowing either small locality, but superpolynomial blocklength, or
small blocklength, but high locality. However, in the computationally bounded,
adversarial channel model, proposed by Lipton (STACS 1994), constructions of
locally decodable codes suddenly exhibit small locality and small blocklength,
but these constructions require strong trusted setup assumptions e.g.,
Ostrovsky, Pandey and Sahai (ICALP 2007) construct private locally decodable
codes in the setting where the sender and receiver already share a symmetric
key.
We study variants of locally decodable and locally correctable codes in
computationally bounded, adversarial channels, in a setting with no public-key
or private-key cryptographic setup. The only setup assumption we require is the
selection of the public parameters (seed) for a collision-resistant hash
function. Specifically, we provide constructions of relaxed locally correctable
and relaxed locally decodable codes over the binary alphabet, with constant
information rate, and poly-logarithmic locality.
Our constructions, which compare favorably with their classical analogues in
the computationally unbounded Hamming channel, crucially employ
collision-resistant hash functions and local expander graphs, extending ideas
from recent cryptographic constructions of memory-hard functions.
|
cs.DS
|
errorcorrecting codes that admit local decoding and correcting algorithms have been the focus of much recent research due to their numerous theoretical and practical applications an important goal is to obtain the best possible tradeoffs between the number of queries the algorithm makes to its oracle the locality of the task and the amount of redundancy in the encoding the information rate in hammings classical adversarial channel model the current tradeoffs are dramatic allowing either small locality but superpolynomial blocklength or small blocklength but high locality however in the computationally bounded adversarial channel model proposed by lipton stacs 1994 constructions of locally decodable codes suddenly exhibit small locality and small blocklength but these constructions require strong trusted setup assumptions eg ostrovsky pandey and sahai icalp 2007 construct private locally decodable codes in the setting where the sender and receiver already share a symmetric key we study variants of locally decodable and locally correctable codes in computationally bounded adversarial channels in a setting with no publickey or privatekey cryptographic setup the only setup assumption we require is the selection of the public parameters seed for a collisionresistant hash function specifically we provide constructions of relaxed locally correctable and relaxed locally decodable codes over the binary alphabet with constant information rate and polylogarithmic locality our constructions which compare favorably with their classical analogues in the computationally unbounded hamming channel crucially employ collisionresistant hash functions and local expander graphs extending ideas from recent cryptographic constructions of memoryhard functions
|
[['errorcorrecting', 'codes', 'that', 'admit', 'local', 'decoding', 'and', 'correcting', 'algorithms', 'have', 'been', 'the', 'focus', 'of', 'much', 'recent', 'research', 'due', 'to', 'their', 'numerous', 'theoretical', 'and', 'practical', 'applications', 'an', 'important', 'goal', 'is', 'to', 'obtain', 'the', 'best', 'possible', 'tradeoffs', 'between', 'the', 'number', 'of', 'queries', 'the', 'algorithm', 'makes', 'to', 'its', 'oracle', 'the', 'locality', 'of', 'the', 'task', 'and', 'the', 'amount', 'of', 'redundancy', 'in', 'the', 'encoding', 'the', 'information', 'rate', 'in', 'hammings', 'classical', 'adversarial', 'channel', 'model', 'the', 'current', 'tradeoffs', 'are', 'dramatic', 'allowing', 'either', 'small', 'locality', 'but', 'superpolynomial', 'blocklength', 'or', 'small', 'blocklength', 'but', 'high', 'locality', 'however', 'in', 'the', 'computationally', 'bounded', 'adversarial', 'channel', 'model', 'proposed', 'by', 'lipton', 'stacs', '1994', 'constructions', 'of', 'locally', 'decodable', 'codes', 'suddenly', 'exhibit', 'small', 'locality', 'and', 'small', 'blocklength', 'but', 'these', 'constructions', 'require', 'strong', 'trusted', 'setup', 'assumptions', 'eg', 'ostrovsky', 'pandey', 'and', 'sahai', 'icalp', '2007', 'construct', 'private', 'locally', 'decodable', 'codes', 'in', 'the', 'setting', 'where', 'the', 'sender', 'and', 'receiver', 'already', 'share', 'a', 'symmetric', 'key', 'we', 'study', 'variants', 'of', 'locally', 'decodable', 'and', 'locally', 'correctable', 'codes', 'in', 'computationally', 'bounded', 'adversarial', 'channels', 'in', 'a', 'setting', 'with', 'no', 'publickey', 'or', 'privatekey', 'cryptographic', 'setup', 'the', 'only', 'setup', 'assumption', 'we', 'require', 'is', 'the', 'selection', 'of', 'the', 'public', 'parameters', 'seed', 'for', 'a', 'collisionresistant', 'hash', 'function', 'specifically', 'we', 'provide', 'constructions', 'of', 'relaxed', 'locally', 'correctable', 'and', 'relaxed', 'locally', 'decodable', 'codes', 'over', 'the', 'binary', 'alphabet', 'with', 'constant', 'information', 'rate', 'and', 'polylogarithmic', 'locality', 'our', 'constructions', 'which', 'compare', 'favorably', 'with', 'their', 'classical', 'analogues', 'in', 'the', 'computationally', 'unbounded', 'hamming', 'channel', 'crucially', 'employ', 'collisionresistant', 'hash', 'functions', 'and', 'local', 'expander', 'graphs', 'extending', 'ideas', 'from', 'recent', 'cryptographic', 'constructions', 'of', 'memoryhard', 'functions']]
|
[-0.1854362540719, 0.06402100839698162, -0.04925102490805792, 0.11119880241467847, -0.06443283281701266, -0.3103615220924305, 0.10323061569132003, 0.3867135812131474, -0.3156971018532383, -0.2975514947062694, 0.13002191647170608, -0.2292250533679836, -0.1387409440587183, 0.1817244566503729, -0.18138666480939958, 0.14957130815977895, 0.057688696223089746, 0.009566589737989458, -0.08647743378862258, -0.3713583906999881, 0.2956791863524828, 0.15197637968254848, 0.2881479263735065, 0.011858232785016298, 0.06069756903805862, 0.020467311629098, -0.06718798082505094, -0.053912814456557275, -0.1578522726950261, 0.10305323022165809, 0.29861662976184217, 0.20587732974037534, 0.2647474437730662, -0.4100012508274407, -0.20517898270035864, 0.12506040207637076, 0.09750244657948688, 0.17390526779383406, -0.06070375302043118, -0.25690293924541396, 0.11895554961033593, -0.20840301138521114, 0.012490590736575302, -0.03887550528619255, -0.006963918359614298, 0.029965976942578697, -0.2763388939850704, 0.005835986666125627, 0.09763372171914479, 0.024381133380391804, 0.008796445820213402, -0.09681708765689467, 0.05735810026316522, 0.10081396727120412, -0.005289624968532198, 0.06443203521174852, 0.08515564815311112, -0.0813559987009732, -0.15023085864625307, 0.3247157035507147, 0.013218191622176254, -0.1967031482328493, 0.16422241556598446, -0.056580119567816375, -0.12081023512577989, 0.11310455665282416, 0.20893924637338848, 0.13970207418486874, -0.0947813943842403, 0.14777953585512404, -0.0805511641837122, 0.19899552614288787, 0.12265159012978805, 0.17984055038722857, 0.08294101175661275, 0.06857014203932686, 0.07244491803204091, 0.1690282601219999, 0.006787161043173343, -0.11601358366062384, -0.2508929669890423, -0.07041653372122159, -0.19801752498090938, 0.02668087169543275, -0.14779179894351535, -0.17156754194789367, 0.3194142597151126, 0.13008637753836277, 0.13806583743089654, 0.1589789012886897, 0.3221270873318197, -0.03721220574301637, 0.10948470890327341, 0.2465849890768219, 0.18071192763240046, 0.13188514145678978, 0.020765383458280263, -0.14418848512072086, 0.14317975051369, 0.0877135240879114]
|
1,803.05653
|
Laws of large numbers for Hayashi-Yoshida-type functionals
|
In high-frequency statistics and econometrics sums of functionals of
increments of stochastic processes are commonly used and statistical inference
is based on the asymptotic behaviour of these sums as the mesh of the
observation times tends to zero. Inspired by the famous Hayashi-Yoshida
estimator for the quadratic covariation process based on two asynchronously
observed stochastic processes we investigate similar sums based on increments
of two asynchronously observed stochastic processes for general functionals. We
find that our results differ from corresponding results in the setting of
equidistant and synchronous observations which has been well studied in the
literature. Further we observe that in the setting of asynchronous observations
the asymptotic behaviour is not only determined by the nature of the functional
but also depends crucially on the asymptotics of the observation scheme.
|
math.PR
|
in highfrequency statistics and econometrics sums of functionals of increments of stochastic processes are commonly used and statistical inference is based on the asymptotic behaviour of these sums as the mesh of the observation times tends to zero inspired by the famous hayashiyoshida estimator for the quadratic covariation process based on two asynchronously observed stochastic processes we investigate similar sums based on increments of two asynchronously observed stochastic processes for general functionals we find that our results differ from corresponding results in the setting of equidistant and synchronous observations which has been well studied in the literature further we observe that in the setting of asynchronous observations the asymptotic behaviour is not only determined by the nature of the functional but also depends crucially on the asymptotics of the observation scheme
|
[['in', 'highfrequency', 'statistics', 'and', 'econometrics', 'sums', 'of', 'functionals', 'of', 'increments', 'of', 'stochastic', 'processes', 'are', 'commonly', 'used', 'and', 'statistical', 'inference', 'is', 'based', 'on', 'the', 'asymptotic', 'behaviour', 'of', 'these', 'sums', 'as', 'the', 'mesh', 'of', 'the', 'observation', 'times', 'tends', 'to', 'zero', 'inspired', 'by', 'the', 'famous', 'hayashiyoshida', 'estimator', 'for', 'the', 'quadratic', 'covariation', 'process', 'based', 'on', 'two', 'asynchronously', 'observed', 'stochastic', 'processes', 'we', 'investigate', 'similar', 'sums', 'based', 'on', 'increments', 'of', 'two', 'asynchronously', 'observed', 'stochastic', 'processes', 'for', 'general', 'functionals', 'we', 'find', 'that', 'our', 'results', 'differ', 'from', 'corresponding', 'results', 'in', 'the', 'setting', 'of', 'equidistant', 'and', 'synchronous', 'observations', 'which', 'has', 'been', 'well', 'studied', 'in', 'the', 'literature', 'further', 'we', 'observe', 'that', 'in', 'the', 'setting', 'of', 'asynchronous', 'observations', 'the', 'asymptotic', 'behaviour', 'is', 'not', 'only', 'determined', 'by', 'the', 'nature', 'of', 'the', 'functional', 'but', 'also', 'depends', 'crucially', 'on', 'the', 'asymptotics', 'of', 'the', 'observation', 'scheme']]
|
[-0.1077523086529282, 0.07509575474328355, -0.1250017659013508, 0.08635352713014863, -0.0416854023258024, -0.08253020771871541, 0.05911029151370678, 0.35956640776161475, -0.261175190276317, -0.26698250993233147, 0.1393712554713498, -0.26067648378364344, -0.18082666252775273, 0.21777635400418108, -0.06463556090913684, 0.06537311587425816, 0.024931756185922232, 0.03867049085843654, -0.034362540539009286, -0.2555607136779728, 0.29583583395921037, 0.04056983517895218, 0.3056876783237885, -0.031170674423751144, 0.11795859914166383, 0.020421618858764645, -0.09062614581256195, -0.0057894999244897305, -0.12490519379029666, 0.0931329715780146, 0.21012819221399667, 0.08396724528341576, 0.2751560669022662, -0.4474949901852444, -0.18797631360206554, 0.11058380411056276, 0.1447252728125411, 0.055857692585675085, 0.013360336433584226, -0.2657845568850295, 0.06287652175635355, -0.10254239000536444, -0.07344234402056869, -0.062006814561727394, -0.009107180537819464, 0.12796350400752693, -0.28913874819320234, 0.11966365499609463, 0.10447027158073882, 0.05336914216488145, -0.052268177048722636, -0.15973407537623074, 0.01613812397753123, 0.08518569083983889, 0.11330617159380194, -0.06302149880336214, 0.11283714449715637, -0.07235902431332115, -0.17048011472420269, 0.3119604793725578, -0.11010980098028418, -0.19448660274692953, 0.19486982730672275, -0.1856917270551656, -0.18903981968191744, 0.09932424411007011, 0.1908221389558024, 0.15708858236130185, -0.16905459194294825, 0.10192604143863886, -0.03280218277581548, 0.11085009955239432, 0.04388056780417798, 0.03908933940715022, 0.13505982946362774, 0.13512389424420496, 0.04838828888245439, 0.125850954306319, -0.0889786992805036, -0.17973809776372696, -0.2965027399410899, -0.09425402620099911, -0.22327523210036163, 0.0343988230301979, -0.1105505345805365, -0.18586686036713024, 0.3653257373705245, 0.16632686981945546, 0.2070521764618963, 0.08994460216534986, 0.2424371628702142, 0.18027819939426906, 0.013269890231286524, 0.06574225896891235, 0.22502765226895913, 0.14900680751902343, 0.08379664140547277, -0.1861716197245534, 0.13519959995089426, 0.057146248416548584]
|
1,803.05654
|
Kolmogorov equations associated to the stochastic 2D Euler equations
|
The Kolmogorov equation associated to a stochastic 2D Euler equations with
transport type noise and random initial conditions is studied by a direct
approach, based on Fourier analysis, Galerkin approximation and Wiener chaos
methods. The method allows us to generalize previous results and to understand
the role of the regularity of the noise, in relation to a limiting value of
roughness.
|
math.PR
|
the kolmogorov equation associated to a stochastic 2d euler equations with transport type noise and random initial conditions is studied by a direct approach based on fourier analysis galerkin approximation and wiener chaos methods the method allows us to generalize previous results and to understand the role of the regularity of the noise in relation to a limiting value of roughness
|
[['the', 'kolmogorov', 'equation', 'associated', 'to', 'a', 'stochastic', '2d', 'euler', 'equations', 'with', 'transport', 'type', 'noise', 'and', 'random', 'initial', 'conditions', 'is', 'studied', 'by', 'a', 'direct', 'approach', 'based', 'on', 'fourier', 'analysis', 'galerkin', 'approximation', 'and', 'wiener', 'chaos', 'methods', 'the', 'method', 'allows', 'us', 'to', 'generalize', 'previous', 'results', 'and', 'to', 'understand', 'the', 'role', 'of', 'the', 'regularity', 'of', 'the', 'noise', 'in', 'relation', 'to', 'a', 'limiting', 'value', 'of', 'roughness']]
|
[-0.07405215684996276, 0.024965968051711557, -0.17539393433110148, 0.08289648004860968, -0.10432920919074753, -0.1024445461826857, 0.02782904124650799, 0.2981334283459382, -0.29843423964425186, -0.2558805297938038, 0.10529253462932577, -0.23378618821892008, -0.1693065199909396, 0.21808778418258565, -0.08248723124260784, 0.14018273252810612, 0.04975702045638053, -0.03087979626887646, -0.10208946689352637, -0.21034204306416823, 0.34755573525536254, 0.04452754034981376, 0.30239471691263625, -0.0273221217164556, 0.11748533288291732, -0.03930838290052336, -0.10423929644290542, 0.025025112661304045, -0.19494046712080476, 0.11349092721252045, 0.19273298823076193, 0.002222705502673739, 0.3205710597580574, -0.41357045648161506, -0.24590567284126263, 0.060530671666635845, 0.11178398968940066, 0.09089539177166145, 0.010978201425206831, -0.30216204797940666, 0.08615679887016534, -0.09523372838014095, -0.1773034038373315, -0.07233662651393746, -0.014720182602492268, 0.07658090596621642, -0.3337202985450381, 0.13353936132196276, 0.10907586180360714, 0.012716413964135725, -0.08016802871420399, -0.08555699614655288, 0.018199406911573204, 0.0799319710826776, 0.030523710845984885, -0.009869961655836125, 0.0839934965412392, -0.12467293050445494, -0.11705986748556377, 0.35419725219062603, -0.10315207906494864, -0.29689418651224647, 0.21111991805726754, -0.14922496025282583, -0.08400830357778268, 0.1583739609808707, 0.17336917102153673, 0.09330119509402601, -0.14306973502589543, 0.095445170030036, 0.008764759576345076, 0.13616220127088857, 0.07488587762794045, 0.01590139058525445, 0.04272215231703442, 0.16695042033908797, 0.10706445083144259, 0.10504244823680549, -0.1039414460528413, -0.13802022071646863, -0.26679010426656147, -0.16177053537341904, -0.19491079013000745, 0.09588723698608027, -0.12942097402157712, -0.2154351553925481, 0.3845883159302786, 0.22147872273001026, 0.14166329103354058, 0.059352113056134005, 0.2842414984326871, 0.19685400329285957, -0.0305956925998335, 0.04712405128282358, 0.16466242307033696, 0.271341622276537, 0.15945028944979192, -0.2414444171762491, 0.06498368961553348, 0.19892512608441662]
|
1,803.05655
|
HFL-RC System at SemEval-2018 Task 11: Hybrid Multi-Aspects Model for
Commonsense Reading Comprehension
|
This paper describes the system which got the state-of-the-art results at
SemEval-2018 Task 11: Machine Comprehension using Commonsense Knowledge. In
this paper, we present a neural network called Hybrid Multi-Aspects (HMA)
model, which mimic the human's intuitions on dealing with the multiple-choice
reading comprehension. In this model, we aim to produce the predictions in
multiple aspects by calculating attention among the text, question and choices,
and combine these results for final predictions. Experimental results show that
our HMA model could give substantial improvements over the baseline system and
got the first place on the final test set leaderboard with the accuracy of
84.13%.
|
cs.CL
|
this paper describes the system which got the stateoftheart results at semeval2018 task 11 machine comprehension using commonsense knowledge in this paper we present a neural network called hybrid multiaspects hma model which mimic the humans intuitions on dealing with the multiplechoice reading comprehension in this model we aim to produce the predictions in multiple aspects by calculating attention among the text question and choices and combine these results for final predictions experimental results show that our hma model could give substantial improvements over the baseline system and got the first place on the final test set leaderboard with the accuracy of 8413
|
[['this', 'paper', 'describes', 'the', 'system', 'which', 'got', 'the', 'stateoftheart', 'results', 'at', 'semeval2018', 'task', '11', 'machine', 'comprehension', 'using', 'commonsense', 'knowledge', 'in', 'this', 'paper', 'we', 'present', 'a', 'neural', 'network', 'called', 'hybrid', 'multiaspects', 'hma', 'model', 'which', 'mimic', 'the', 'humans', 'intuitions', 'on', 'dealing', 'with', 'the', 'multiplechoice', 'reading', 'comprehension', 'in', 'this', 'model', 'we', 'aim', 'to', 'produce', 'the', 'predictions', 'in', 'multiple', 'aspects', 'by', 'calculating', 'attention', 'among', 'the', 'text', 'question', 'and', 'choices', 'and', 'combine', 'these', 'results', 'for', 'final', 'predictions', 'experimental', 'results', 'show', 'that', 'our', 'hma', 'model', 'could', 'give', 'substantial', 'improvements', 'over', 'the', 'baseline', 'system', 'and', 'got', 'the', 'first', 'place', 'on', 'the', 'final', 'test', 'set', 'leaderboard', 'with', 'the', 'accuracy', 'of', '8413']]
|
[-0.04265061501035522, 0.00875625586930183, -0.059259032175903864, 0.045966939493785566, -0.0791801760286683, -0.12882511958129483, 0.05673332412100148, 0.3704944761967895, -0.20892357493354247, -0.3708885800425369, 0.04302182200360158, -0.2752537862720466, -0.18356489545278398, 0.20327108853385958, -0.12001561239767487, 0.0369710690424879, 0.2005047859649386, 0.05274066630990641, -0.03175231868557927, -0.3105953438622453, 0.3058582753251943, 0.0622032484890303, 0.32500405177142067, 0.05997094614339052, 0.10776683000737045, -0.026374590227560203, -0.06407621144178775, -0.0167597816106725, -0.11973963490271501, 0.16266743457959135, 0.2792008755853086, 0.17915801068832451, 0.3057515838294115, -0.41615028848115465, -0.19092799578839453, 0.03996215389561978, 0.10484609742519806, 0.13605310823099853, -0.025194038330383674, -0.32675054752369326, 0.10348245125992389, -0.19407275817034267, -0.020749441942771767, -0.12042662749380463, -0.043568581098340234, -0.026686972246901825, -0.24629722336436263, -0.026700047282778687, 0.1229465582435674, 0.06500613713397248, -0.08144178652057037, -0.15689769524407784, 0.07802267699493187, 0.1597238947028792, 0.038966581016769725, 0.07598493971612931, 0.0879289719718739, -0.17513288402846913, -0.17460337760489397, 0.38227626312487195, -0.07543075153382846, -0.20178934123071998, 0.20566166366570363, -0.0781030927849288, -0.17398459272514474, 0.04219029185426707, 0.23787007347155031, 0.05934984488458843, -0.15105262971344854, -0.005342407370479501, -0.06913995460173723, 0.19839241016785256, 0.04482757643160253, -0.030582670915392365, 0.20975242714665018, 0.2580743082522387, -0.07090107915176097, 0.12004091985993973, -0.057884413486180626, -0.10625334823559417, -0.25758198857604814, -0.11857555264441094, -0.10223069931795396, -0.004961804936335671, -0.04655465947900378, -0.10408826965359178, 0.42694674877652733, 0.2824257045020672, 0.21414105399594743, 0.13491591820631657, 0.3219776640802917, 0.0178208082205775, 0.034106962253699205, 0.045400193181824824, 0.21333187501324286, -0.00039774243775201907, 0.15468350261574298, -0.17973007126665203, 0.09770699611422376, 0.04838267725772492]
|
1,803.05656
|
Distribution of Stress Tensor around Static Quark--Anti-Quark from
Yang-Mills Gradient Flow
|
The spatial distribution of the stress tensor around the quark--anti-quark
($Q\bar{Q}$) pair in SU(3) lattice gauge theory is studied. The Yang-Mills
gradient flow plays a crucial role to make the stress tensor well-defined and
derivable from the numerical simulations on the lattice. The resultant stress
tensor with a decomposition into local principal axes shows, for the first
time, the detailed structure of the flux tube along the longitudinal and
transverse directions in a gauge invariant manner. The linear confining
behavior of the $Q\bar{Q}$ potential at long distances is derived directly from
the integral of the local stress tensor.
|
hep-lat hep-ph nucl-th
|
the spatial distribution of the stress tensor around the quarkantiquark qbarq pair in su3 lattice gauge theory is studied the yangmills gradient flow plays a crucial role to make the stress tensor welldefined and derivable from the numerical simulations on the lattice the resultant stress tensor with a decomposition into local principal axes shows for the first time the detailed structure of the flux tube along the longitudinal and transverse directions in a gauge invariant manner the linear confining behavior of the qbarq potential at long distances is derived directly from the integral of the local stress tensor
|
[['the', 'spatial', 'distribution', 'of', 'the', 'stress', 'tensor', 'around', 'the', 'quarkantiquark', 'qbarq', 'pair', 'in', 'su3', 'lattice', 'gauge', 'theory', 'is', 'studied', 'the', 'yangmills', 'gradient', 'flow', 'plays', 'a', 'crucial', 'role', 'to', 'make', 'the', 'stress', 'tensor', 'welldefined', 'and', 'derivable', 'from', 'the', 'numerical', 'simulations', 'on', 'the', 'lattice', 'the', 'resultant', 'stress', 'tensor', 'with', 'a', 'decomposition', 'into', 'local', 'principal', 'axes', 'shows', 'for', 'the', 'first', 'time', 'the', 'detailed', 'structure', 'of', 'the', 'flux', 'tube', 'along', 'the', 'longitudinal', 'and', 'transverse', 'directions', 'in', 'a', 'gauge', 'invariant', 'manner', 'the', 'linear', 'confining', 'behavior', 'of', 'the', 'qbarq', 'potential', 'at', 'long', 'distances', 'is', 'derived', 'directly', 'from', 'the', 'integral', 'of', 'the', 'local', 'stress', 'tensor']]
|
[-0.14433348474415894, 0.17493046899041048, -0.13400178853118297, 0.027852629480066195, -0.05478588223922998, -0.045405802041368216, -0.06714943204935146, 0.38235660439015046, -0.27761192242519894, -0.1801208408587441, 0.03033902835129399, -0.24443195279383537, -0.09914537925957417, 0.08447395740266965, 0.08348252247942954, 0.05251470170451841, 0.046120484979652175, 0.07869082089152415, -0.09562978606519042, -0.18214776699801868, 0.3169836576277276, 0.04211655571790678, 0.3595811043086709, 0.08466215683765026, 0.12006592641261463, 0.07052904819803578, -0.07040744498805665, 0.03161153935219104, -0.08188165791275702, 0.10440465568194204, 0.16370698970704511, -0.00558620985545104, 0.19095750824234695, -0.4418289278995018, -0.19085279122180288, 0.050004780159464905, 0.1151287333507623, 0.12213528773756888, 0.01675187840900973, -0.25754133321116773, 0.07919833093539488, -0.13145588634402625, -0.15258515567984432, -0.07183592697149332, 0.029417733695091947, -0.04726725277296096, -0.2746269011392486, 0.15418784045352962, 0.01172467987338195, 0.0812633144384136, -0.09202340323649043, -0.13362878034537545, -0.10656700385924504, 0.11325174379661414, 0.11734461349587204, 0.10593515181229735, 0.17403944912936767, -0.1796637320753225, -0.06105965231925401, 0.40956995761668197, -0.09024226984569841, -0.22722504842000044, 0.12402718386147171, -0.11631691427806354, -0.1064520427477261, 0.11931729586604907, 0.16393935505053675, 0.08939900354729319, -0.1371636437210587, 0.09796994986673056, -0.008323424545648907, 0.10005349016330224, 0.04686184336516854, -0.010444609186973194, 0.2514849826028304, 0.1102341682821208, 0.05666499167718753, 0.15052643347987715, -0.06960384105094614, -0.1354469752737454, -0.3973896842335864, -0.16162435776953185, -0.1789270590691428, 0.08435813638343646, -0.15888402596257428, -0.18978402258267588, 0.41414758800623974, 0.058068290434564504, 0.1845695635907314, 0.04006121195413229, 0.26702659329095363, 0.09617734613961407, 0.11247347238739687, 0.06730096131724743, 0.28329169544942523, 0.24179994588128614, 0.1385423374428813, -0.2928459238384527, -0.030709512341691524, 0.12697980991726246]
|
1,803.05657
|
Fast Subspace Clustering Based on the Kronecker Product
|
Subspace clustering is a useful technique for many computer vision
applications in which the intrinsic dimension of high-dimensional data is often
smaller than the ambient dimension. Spectral clustering, as one of the main
approaches to subspace clustering, often takes on a sparse representation or a
low-rank representation to learn a block diagonal self-representation matrix
for subspace generation. However, existing methods require solving a large
scale convex optimization problem with a large set of data, with computational
complexity reaches O(N^3) for N data points. Therefore, the efficiency and
scalability of traditional spectral clustering methods can not be guaranteed
for large scale datasets. In this paper, we propose a subspace clustering model
based on the Kronecker product. Due to the property that the Kronecker product
of a block diagonal matrix with any other matrix is still a block diagonal
matrix, we can efficiently learn the representation matrix which is formed by
the Kronecker product of k smaller matrices. By doing so, our model
significantly reduces the computational complexity to O(kN^{3/k}). Furthermore,
our model is general in nature, and can be adapted to different regularization
based subspace clustering methods. Experimental results on two public datasets
show that our model significantly improves the efficiency compared with several
state-of-the-art methods. Moreover, we have conducted experiments on synthetic
data to verify the scalability of our model for large scale datasets.
|
cs.LG cs.CV stat.ML
|
subspace clustering is a useful technique for many computer vision applications in which the intrinsic dimension of highdimensional data is often smaller than the ambient dimension spectral clustering as one of the main approaches to subspace clustering often takes on a sparse representation or a lowrank representation to learn a block diagonal selfrepresentation matrix for subspace generation however existing methods require solving a large scale convex optimization problem with a large set of data with computational complexity reaches on3 for n data points therefore the efficiency and scalability of traditional spectral clustering methods can not be guaranteed for large scale datasets in this paper we propose a subspace clustering model based on the kronecker product due to the property that the kronecker product of a block diagonal matrix with any other matrix is still a block diagonal matrix we can efficiently learn the representation matrix which is formed by the kronecker product of k smaller matrices by doing so our model significantly reduces the computational complexity to okn3k furthermore our model is general in nature and can be adapted to different regularization based subspace clustering methods experimental results on two public datasets show that our model significantly improves the efficiency compared with several stateoftheart methods moreover we have conducted experiments on synthetic data to verify the scalability of our model for large scale datasets
|
[['subspace', 'clustering', 'is', 'a', 'useful', 'technique', 'for', 'many', 'computer', 'vision', 'applications', 'in', 'which', 'the', 'intrinsic', 'dimension', 'of', 'highdimensional', 'data', 'is', 'often', 'smaller', 'than', 'the', 'ambient', 'dimension', 'spectral', 'clustering', 'as', 'one', 'of', 'the', 'main', 'approaches', 'to', 'subspace', 'clustering', 'often', 'takes', 'on', 'a', 'sparse', 'representation', 'or', 'a', 'lowrank', 'representation', 'to', 'learn', 'a', 'block', 'diagonal', 'selfrepresentation', 'matrix', 'for', 'subspace', 'generation', 'however', 'existing', 'methods', 'require', 'solving', 'a', 'large', 'scale', 'convex', 'optimization', 'problem', 'with', 'a', 'large', 'set', 'of', 'data', 'with', 'computational', 'complexity', 'reaches', 'on3', 'for', 'n', 'data', 'points', 'therefore', 'the', 'efficiency', 'and', 'scalability', 'of', 'traditional', 'spectral', 'clustering', 'methods', 'can', 'not', 'be', 'guaranteed', 'for', 'large', 'scale', 'datasets', 'in', 'this', 'paper', 'we', 'propose', 'a', 'subspace', 'clustering', 'model', 'based', 'on', 'the', 'kronecker', 'product', 'due', 'to', 'the', 'property', 'that', 'the', 'kronecker', 'product', 'of', 'a', 'block', 'diagonal', 'matrix', 'with', 'any', 'other', 'matrix', 'is', 'still', 'a', 'block', 'diagonal', 'matrix', 'we', 'can', 'efficiently', 'learn', 'the', 'representation', 'matrix', 'which', 'is', 'formed', 'by', 'the', 'kronecker', 'product', 'of', 'k', 'smaller', 'matrices', 'by', 'doing', 'so', 'our', 'model', 'significantly', 'reduces', 'the', 'computational', 'complexity', 'to', 'okn3k', 'furthermore', 'our', 'model', 'is', 'general', 'in', 'nature', 'and', 'can', 'be', 'adapted', 'to', 'different', 'regularization', 'based', 'subspace', 'clustering', 'methods', 'experimental', 'results', 'on', 'two', 'public', 'datasets', 'show', 'that', 'our', 'model', 'significantly', 'improves', 'the', 'efficiency', 'compared', 'with', 'several', 'stateoftheart', 'methods', 'moreover', 'we', 'have', 'conducted', 'experiments', 'on', 'synthetic', 'data', 'to', 'verify', 'the', 'scalability', 'of', 'our', 'model', 'for', 'large', 'scale', 'datasets']]
|
[-0.059783083534979096, 0.01905947545493197, -0.06540204992626414, 0.04944505094291617, -0.08893171400604394, -0.15779566216583243, 0.006609337169973539, 0.3857971061764477, -0.30491668895521773, -0.30635332699965334, 0.15916659352693271, -0.25657137622221504, -0.1591793180760748, 0.19046796082556583, -0.07870144385744238, 0.08958308158375557, 0.15140715287789502, 0.029740055842375206, -0.12110418629218644, -0.29460735079276923, 0.3238248660473462, 0.0671663295243754, 0.3332673626597668, 0.013106470638384934, 0.10500327679808899, -0.02255657793705523, -0.029551917082534043, 0.0419253175399546, -0.023395863601078086, 0.1768173821510083, 0.2924958612026455, 0.20697473647123027, 0.29588669033161463, -0.40181744223953364, -0.21423919030231311, 0.14827921061939456, 0.18225721907415615, 0.11132068879297577, -0.024903309690210585, -0.265233592270151, 0.10812327214161711, -0.1599400458782243, -0.030711636755348187, -0.1525186388471452, -0.030666614805385805, -0.04586608227052112, -0.3230469782686387, 0.06346998924301779, 0.04303154741980829, 0.0088359596470847, -0.010769148288303025, -0.18168969546296454, 0.0577347347347876, 0.08556435090351866, 0.025349639479338187, 0.023778519833318454, 0.12123598173211617, -0.10235567268238908, -0.12781227688094174, 0.3908604965357302, -0.05182405405986121, -0.25295797343712484, 0.20698347954275798, -0.07491397487642787, -0.16608814011858317, 0.12102319902610953, 0.21329120224792794, 0.10922988384101757, -0.09054260519688172, 0.11150912305229498, -0.08015892247882392, 0.20377864341999116, -0.008390523331456989, 0.006001430813425676, 0.09036536110594301, 0.211657029894001, 0.10130478806805175, 0.11271637788949734, -0.08005036057428261, -0.0652494194495571, -0.18217475942833006, -0.11387149028630401, -0.2775411202735163, 0.003642923677417934, -0.2015618443792642, -0.16074704672191648, 0.40565572141130946, 0.18812234032347866, 0.24723209327947132, 0.10470315623472992, 0.3527419098815776, 0.06288080798121923, 0.1255247503427179, 0.09732892641363323, 0.15304934542475795, 0.08970089066531425, 0.05219355390626142, -0.18517319296461618, 0.06187308562977966, 0.10148886172309718]
|
1,803.05658
|
Symmetry of eigenvalues of operators associated with representations of
compact quantum groups
|
We ask the question whether for a given unitary representation $U$ the
associated operator $\rho_{U}\in\operatorname{Mor}(U,U^{c\, c})$ has spectrum
invariant under inversion -- in this case we say that $\rho_{U}$ has symmetric
eigenvalues. This does not have to be the case. However, we give affirmative
answer whenever a certain condition on the growth of dimensions of irreducible
subrepresentations of tensor powers of $U$ is imposed. This condition is
satisfied whenever $\widehat{\mathbb{G}}$ is of subexponential growth.
|
math.QA math.OA
|
we ask the question whether for a given unitary representation u the associated operator rho_uinoperatornamemoruuc c has spectrum invariant under inversion in this case we say that rho_u has symmetric eigenvalues this does not have to be the case however we give affirmative answer whenever a certain condition on the growth of dimensions of irreducible subrepresentations of tensor powers of u is imposed this condition is satisfied whenever widehatmathbbg is of subexponential growth
|
[['we', 'ask', 'the', 'question', 'whether', 'for', 'a', 'given', 'unitary', 'representation', 'u', 'the', 'associated', 'operator', 'rho_uinoperatornamemoruuc', 'c', 'has', 'spectrum', 'invariant', 'under', 'inversion', 'in', 'this', 'case', 'we', 'say', 'that', 'rho_u', 'has', 'symmetric', 'eigenvalues', 'this', 'does', 'not', 'have', 'to', 'be', 'the', 'case', 'however', 'we', 'give', 'affirmative', 'answer', 'whenever', 'a', 'certain', 'condition', 'on', 'the', 'growth', 'of', 'dimensions', 'of', 'irreducible', 'subrepresentations', 'of', 'tensor', 'powers', 'of', 'u', 'is', 'imposed', 'this', 'condition', 'is', 'satisfied', 'whenever', 'widehatmathbbg', 'is', 'of', 'subexponential', 'growth']]
|
[-0.17983088520769444, 0.13797594965176863, -0.08283894824691945, 0.030247348431859993, -0.10605883952747616, -0.17859736169015783, -0.01599868519567988, 0.35434275993611664, -0.27663165491281283, -0.1645225354146128, 0.12411696867234746, -0.23778782546934155, -0.15478449251451012, 0.1263200982680751, -0.09511587815359235, 0.0025662488349351203, 0.06545525560957483, 0.1273740022443235, -0.08376416895448023, -0.29729522807368386, 0.3958699764269922, -0.020435392720780026, 0.22880889145178823, 0.12487929987886066, 0.10198014864646313, -0.019250102211824723, 0.03491234172704733, -0.0335027559970816, -0.17205459521422503, 0.05764188920147717, 0.24053211054868168, 0.15423464024206623, 0.26303166523575783, -0.36850926743095946, -0.13226735875812462, 0.24828796837634096, 0.13894859328219253, 0.034548575614785984, -0.0296726575745399, -0.20698250350930417, 0.1618618795247231, -0.13520972129319692, -0.16126415621127105, -0.04910663691245847, 0.09325876550024582, -0.07705563887591577, -0.34029526186511955, 0.07106264423216796, 0.1617832747708437, 0.0625784668372944, -0.056535105955036774, -0.0537535067091489, -0.011971931425958045, 0.08788314483697629, 0.04401692841251285, 0.02327675289577908, 0.02665086962386138, -0.10553973076619311, -0.048876150925126344, 0.3970862614870485, -0.02870182977575395, -0.28285426519707674, 0.1294628583822891, -0.20224653948874524, -0.16013666516583827, 0.07181594184496337, 0.10022485285945651, 0.11284246056392375, -0.06814398193576683, 0.2512733490439132, -0.16410518939503366, 0.13052487822682857, 0.14123605073998785, 0.007747210594566746, 0.10960081176340787, 0.04734821170051065, 0.14215137609992073, 0.1423364526498416, 0.05872458174498105, -0.0031524616966231, -0.34483594235239756, -0.15263270491009784, -0.19604512449586764, 0.18685421258709944, -0.038053551961234514, -0.18022336029551095, 0.39753913280502373, 0.10581404159569906, 0.20682836096724108, 0.06177531859268331, 0.19031086829555635, 0.21158526584299076, 0.030373123016842227, 0.09241073890977229, 0.13463692192130516, 0.15385645177836219, 0.029559774466583297, -0.17516480965746772, 0.09400159429060295, 0.14359781329727006]
|
1,803.05659
|
Does agricultural subsidies foster Italian southern farms? A Spatial
Quantile Regression Approach
|
During the last decades, public policies become a central pillar in
supporting and stabilising agricultural sector. In 1962, EU policy-makers
developed the so-called Common Agricultural Policy (CAP) to ensure
competitiveness and a common market organisation for agricultural products,
while 2003 reform decouple the CAP from the production to focus only on income
stabilization and the sustainability of agricultural sector. Notwithstanding
farmers are highly dependent to public support, literature on the role played
by the CAP in fostering agricultural performances is still scarce and
fragmented. Actual CAP policies increases performance differentials between
Northern Central EU countries and peripheral regions. This paper aims to
evaluate the effectiveness of CAP in stimulate performances by focusing on
Italian lagged Regions. Moreover, agricultural sector is deeply rooted in
place-based production processes. In this sense, economic analysis which omit
the presence of spatial dependence produce biased estimates of the
performances. Therefore, this paper, using data on subsidies and economic
results of farms from the RICA dataset which is part of the Farm Accountancy
Data Network (FADN), proposes a spatial Augmented Cobb-Douglas Production
Function to evaluate the effects of subsidies on farm's performances. The major
innovation in this paper is the implementation of a micro-founded quantile
version of a spatial lag model to examine how the impact of the subsidies may
vary across the conditional distribution of agricultural performances. Results
show an increasing shape which switch from negative to positive at the median
and becomes statistical significant for higher quantiles. Additionally, spatial
autocorrelation parameter is positive and significant across all the
conditional distribution, suggesting the presence of significant spatial
spillovers in agricultural performances.
|
econ.EM stat.AP
|
during the last decades public policies become a central pillar in supporting and stabilising agricultural sector in 1962 eu policymakers developed the socalled common agricultural policy cap to ensure competitiveness and a common market organisation for agricultural products while 2003 reform decouple the cap from the production to focus only on income stabilization and the sustainability of agricultural sector notwithstanding farmers are highly dependent to public support literature on the role played by the cap in fostering agricultural performances is still scarce and fragmented actual cap policies increases performance differentials between northern central eu countries and peripheral regions this paper aims to evaluate the effectiveness of cap in stimulate performances by focusing on italian lagged regions moreover agricultural sector is deeply rooted in placebased production processes in this sense economic analysis which omit the presence of spatial dependence produce biased estimates of the performances therefore this paper using data on subsidies and economic results of farms from the rica dataset which is part of the farm accountancy data network fadn proposes a spatial augmented cobbdouglas production function to evaluate the effects of subsidies on farms performances the major innovation in this paper is the implementation of a microfounded quantile version of a spatial lag model to examine how the impact of the subsidies may vary across the conditional distribution of agricultural performances results show an increasing shape which switch from negative to positive at the median and becomes statistical significant for higher quantiles additionally spatial autocorrelation parameter is positive and significant across all the conditional distribution suggesting the presence of significant spatial spillovers in agricultural performances
|
[['during', 'the', 'last', 'decades', 'public', 'policies', 'become', 'a', 'central', 'pillar', 'in', 'supporting', 'and', 'stabilising', 'agricultural', 'sector', 'in', '1962', 'eu', 'policymakers', 'developed', 'the', 'socalled', 'common', 'agricultural', 'policy', 'cap', 'to', 'ensure', 'competitiveness', 'and', 'a', 'common', 'market', 'organisation', 'for', 'agricultural', 'products', 'while', '2003', 'reform', 'decouple', 'the', 'cap', 'from', 'the', 'production', 'to', 'focus', 'only', 'on', 'income', 'stabilization', 'and', 'the', 'sustainability', 'of', 'agricultural', 'sector', 'notwithstanding', 'farmers', 'are', 'highly', 'dependent', 'to', 'public', 'support', 'literature', 'on', 'the', 'role', 'played', 'by', 'the', 'cap', 'in', 'fostering', 'agricultural', 'performances', 'is', 'still', 'scarce', 'and', 'fragmented', 'actual', 'cap', 'policies', 'increases', 'performance', 'differentials', 'between', 'northern', 'central', 'eu', 'countries', 'and', 'peripheral', 'regions', 'this', 'paper', 'aims', 'to', 'evaluate', 'the', 'effectiveness', 'of', 'cap', 'in', 'stimulate', 'performances', 'by', 'focusing', 'on', 'italian', 'lagged', 'regions', 'moreover', 'agricultural', 'sector', 'is', 'deeply', 'rooted', 'in', 'placebased', 'production', 'processes', 'in', 'this', 'sense', 'economic', 'analysis', 'which', 'omit', 'the', 'presence', 'of', 'spatial', 'dependence', 'produce', 'biased', 'estimates', 'of', 'the', 'performances', 'therefore', 'this', 'paper', 'using', 'data', 'on', 'subsidies', 'and', 'economic', 'results', 'of', 'farms', 'from', 'the', 'rica', 'dataset', 'which', 'is', 'part', 'of', 'the', 'farm', 'accountancy', 'data', 'network', 'fadn', 'proposes', 'a', 'spatial', 'augmented', 'cobbdouglas', 'production', 'function', 'to', 'evaluate', 'the', 'effects', 'of', 'subsidies', 'on', 'farms', 'performances', 'the', 'major', 'innovation', 'in', 'this', 'paper', 'is', 'the', 'implementation', 'of', 'a', 'microfounded', 'quantile', 'version', 'of', 'a', 'spatial', 'lag', 'model', 'to', 'examine', 'how', 'the', 'impact', 'of', 'the', 'subsidies', 'may', 'vary', 'across', 'the', 'conditional', 'distribution', 'of', 'agricultural', 'performances', 'results', 'show', 'an', 'increasing', 'shape', 'which', 'switch', 'from', 'negative', 'to', 'positive', 'at', 'the', 'median', 'and', 'becomes', 'statistical', 'significant', 'for', 'higher', 'quantiles', 'additionally', 'spatial', 'autocorrelation', 'parameter', 'is', 'positive', 'and', 'significant', 'across', 'all', 'the', 'conditional', 'distribution', 'suggesting', 'the', 'presence', 'of', 'significant', 'spatial', 'spillovers', 'in', 'agricultural', 'performances']]
|
[-0.0626626928288595, 0.09428951766848222, -0.04584868636096494, 0.09558151861134354, -0.07263376923313118, -0.06734023167453003, 0.06888818962648863, 0.36390508482988293, -0.22348637487651463, -0.28142300742625626, 0.14198378788939905, -0.29232336368130624, -0.12423526358983988, 0.18335618412315424, -0.1410061119616313, -0.03172357464611436, 0.057265387759280376, -0.020995363647575087, 0.03736049828102004, -0.28245330304170974, 0.2935117045839159, 0.10516465658800817, 0.3828139517561726, 0.10945120906316728, 0.08656277024749455, -0.014242266440096329, -0.07099355367508735, -0.01990407019159493, -0.07636267307603223, 0.16204266626550376, 0.2947914992538193, 0.16611180959822927, 0.3629608056121418, -0.4187568505101328, -0.16672722138640172, 0.1247109416169378, 0.11212397868995432, -0.012865985742383549, -0.03748585896540152, -0.25420389057330367, 0.027545064644237876, -0.22974461830651632, -0.11166548987209164, -0.03410140337809077, 0.02199217819208982, 0.012401439902978897, -0.2826676717748479, 0.07952441405768523, 0.001080858041444477, 0.12772089590248212, -0.059078704431336726, -0.145096032255338, -0.08350384630667011, 0.17941407948284288, 0.11831818745726333, 0.007999589201941524, 0.17634888046403538, -0.17878688036333462, -0.10799651067607316, 0.32181939853812164, -0.04647864410390128, -0.15069474163904506, 0.17250975091866974, -0.17716917276935967, -0.16661163239952897, 0.07173809955283156, 0.27129391537878206, 0.04759375435247455, -0.15666035368933148, 0.05650730251492757, -0.01229842366158681, 0.1606271058618627, 0.06985131317117023, 0.0016400887885675678, 0.19994406481619423, 0.19429599837101294, 0.08901279227070089, 0.13753753532040514, -0.08598751446917513, -0.1772927612450659, -0.22807607835791302, -0.12681275024331384, -0.09694418102054733, -0.022530489884545358, -0.0964092503815784, -0.14814721406437456, 0.40138202021601344, 0.16369840737195018, 0.12255200182245869, 0.024490155742881502, 0.31197748511748497, 0.02711039945957655, 0.07285880593820211, 0.10126910461024996, 0.21752515479676285, 0.036278664759131815, 0.17040270266193405, -0.18571064137405593, 0.18643704933237354, -0.019657661611179135]
|
1,803.0566
|
Dark matter direct detection of a fermionic singlet at one loop
|
The strong direct detection limits could be pointing to dark matter --
nucleus scattering at loop level. We study in detail the prototype example of
an electroweak singlet (Dirac or Majorana) dark matter fermion coupled to an
extended dark sector, which is composed of a new fermion and a new scalar.
Given the strong limits on colored particles from direct and indirect searches
we assume that the fields of the new dark sector are color singlets. We outline
the possible simplified models, including the well-motivated cases in which the
extra scalar or fermion is a Standard Model particle, as well as the possible
connection to neutrino masses. We compute the contributions to direct detection
from the photon, the $Z$ and the Higgs penguins for arbitrary quantum numbers
of the dark sector. Furthermore, we derive compact expressions in certain
limits, i.e., when all new particles are heavier than the dark matter mass and
when the fermion running in the loop is light, like a Standard Model lepton. We
study in detail the predicted direct detection rate and how current and future
direct detection limits constrain the model parameters. In case dark matter
couples directly to Standard Model leptons we find an interesting interplay
between lepton flavor violation, direct detection and the observed relic
abundance.
|
hep-ph
|
the strong direct detection limits could be pointing to dark matter nucleus scattering at loop level we study in detail the prototype example of an electroweak singlet dirac or majorana dark matter fermion coupled to an extended dark sector which is composed of a new fermion and a new scalar given the strong limits on colored particles from direct and indirect searches we assume that the fields of the new dark sector are color singlets we outline the possible simplified models including the wellmotivated cases in which the extra scalar or fermion is a standard model particle as well as the possible connection to neutrino masses we compute the contributions to direct detection from the photon the z and the higgs penguins for arbitrary quantum numbers of the dark sector furthermore we derive compact expressions in certain limits ie when all new particles are heavier than the dark matter mass and when the fermion running in the loop is light like a standard model lepton we study in detail the predicted direct detection rate and how current and future direct detection limits constrain the model parameters in case dark matter couples directly to standard model leptons we find an interesting interplay between lepton flavor violation direct detection and the observed relic abundance
|
[['the', 'strong', 'direct', 'detection', 'limits', 'could', 'be', 'pointing', 'to', 'dark', 'matter', 'nucleus', 'scattering', 'at', 'loop', 'level', 'we', 'study', 'in', 'detail', 'the', 'prototype', 'example', 'of', 'an', 'electroweak', 'singlet', 'dirac', 'or', 'majorana', 'dark', 'matter', 'fermion', 'coupled', 'to', 'an', 'extended', 'dark', 'sector', 'which', 'is', 'composed', 'of', 'a', 'new', 'fermion', 'and', 'a', 'new', 'scalar', 'given', 'the', 'strong', 'limits', 'on', 'colored', 'particles', 'from', 'direct', 'and', 'indirect', 'searches', 'we', 'assume', 'that', 'the', 'fields', 'of', 'the', 'new', 'dark', 'sector', 'are', 'color', 'singlets', 'we', 'outline', 'the', 'possible', 'simplified', 'models', 'including', 'the', 'wellmotivated', 'cases', 'in', 'which', 'the', 'extra', 'scalar', 'or', 'fermion', 'is', 'a', 'standard', 'model', 'particle', 'as', 'well', 'as', 'the', 'possible', 'connection', 'to', 'neutrino', 'masses', 'we', 'compute', 'the', 'contributions', 'to', 'direct', 'detection', 'from', 'the', 'photon', 'the', 'z', 'and', 'the', 'higgs', 'penguins', 'for', 'arbitrary', 'quantum', 'numbers', 'of', 'the', 'dark', 'sector', 'furthermore', 'we', 'derive', 'compact', 'expressions', 'in', 'certain', 'limits', 'ie', 'when', 'all', 'new', 'particles', 'are', 'heavier', 'than', 'the', 'dark', 'matter', 'mass', 'and', 'when', 'the', 'fermion', 'running', 'in', 'the', 'loop', 'is', 'light', 'like', 'a', 'standard', 'model', 'lepton', 'we', 'study', 'in', 'detail', 'the', 'predicted', 'direct', 'detection', 'rate', 'and', 'how', 'current', 'and', 'future', 'direct', 'detection', 'limits', 'constrain', 'the', 'model', 'parameters', 'in', 'case', 'dark', 'matter', 'couples', 'directly', 'to', 'standard', 'model', 'leptons', 'we', 'find', 'an', 'interesting', 'interplay', 'between', 'lepton', 'flavor', 'violation', 'direct', 'detection', 'and', 'the', 'observed', 'relic', 'abundance']]
|
[-0.10336721105553773, 0.23031656959231114, -0.03990663026398013, 0.17540641141701754, -0.118140269093378, -0.15603291659774082, 0.02926561505564506, 0.29965146873058435, -0.20791676216033939, -0.34956101195025696, 0.027428745163630974, -0.2750486470407473, -0.05431378422797008, 0.14565427853662152, 0.06518680397871407, 0.017500961822114955, 0.010488147969810152, 0.05010051688153015, -0.051437303577088485, -0.22140483213379927, 0.301028333635087, 0.03615954269398056, 0.20832638586168442, 0.1055940212555933, 0.0740522608503629, -0.003240441220355624, -0.049925939461110895, -0.08390403922722503, -0.12108005938136797, 0.059103320675620914, 0.14511087116915286, 0.07976526227990552, 0.08298640740257776, -0.4175144936625828, -0.18608822904522795, 0.2083623482744684, 0.16052354698482338, 0.11670202717409064, -0.12038890487582528, -0.3574349501879692, 0.057482304415728165, -0.2264981014052195, -0.12357733479727341, -0.04774111453751278, -0.05884724976450978, -0.08407450401507546, -0.2917892525218568, 0.09560735452533611, -0.04629452327894539, -0.06013963323082107, -0.014312518774839293, -0.14290773626724435, -0.030902663358917705, 0.033788572879615765, 0.13606028269233955, -0.049108934192671136, 0.1727406526245792, -0.2653071967470855, -0.14821325537950714, 0.4336061686876489, -0.15443731958019374, -0.17149600496994472, 0.20866381617500182, -0.12847325881451088, -0.15180308066466647, 0.08877414481863731, 0.17210683792407783, 0.09011933440685752, -0.1491514328447937, 0.1444872351792171, -0.09228195682308583, 0.17356896095575308, 0.02791469661905518, 0.06047604780178517, 0.3417055515796473, 0.18245113538007057, 0.06996598627631341, 0.0674127133750963, -0.11779608540258915, -0.09207418755977415, -0.38652438576825243, -0.19731795989725967, -0.10429963396196605, 0.009276457045244862, -0.0687383118386623, -0.10045034739404109, 0.4073471669854491, 0.1378449208480921, 0.18482840551559832, 0.006003759564164112, 0.33588111823653133, 0.10983130893612914, 0.06047201814252953, 0.010447251250229354, 0.31999174314594986, 0.14731340025516473, 0.06212534976547654, -0.21669754071626812, -0.05023778374262927, 0.024694675772960455]
|
1,803.05661
|
Mm-wave specific challenges in designing 5G transceiver architectures
and air-interfaces
|
The mm-wave spectrum will be of significant importance to 5G mobile systems.
There are multiple challenges in designing transceiver architectures and air
interfaces in this spectrum. This paper is an attempt to explain some of these
challenges and their interactions as means of enabling robust system design in
near future.
|
cs.IT eess.SP math.IT
|
the mmwave spectrum will be of significant importance to 5g mobile systems there are multiple challenges in designing transceiver architectures and air interfaces in this spectrum this paper is an attempt to explain some of these challenges and their interactions as means of enabling robust system design in near future
|
[['the', 'mmwave', 'spectrum', 'will', 'be', 'of', 'significant', 'importance', 'to', '5g', 'mobile', 'systems', 'there', 'are', 'multiple', 'challenges', 'in', 'designing', 'transceiver', 'architectures', 'and', 'air', 'interfaces', 'in', 'this', 'spectrum', 'this', 'paper', 'is', 'an', 'attempt', 'to', 'explain', 'some', 'of', 'these', 'challenges', 'and', 'their', 'interactions', 'as', 'means', 'of', 'enabling', 'robust', 'system', 'design', 'in', 'near', 'future']]
|
[-0.25370730807830116, 0.05521986100153299, 0.008725315605988725, 0.014560844253282993, -0.07118201911449433, -0.16253010923042893, -0.008189864510204642, 0.452465038895607, -0.29632934525609017, -0.30894233741797505, 0.12702762674773113, -0.27918037741445006, -0.24656660709530115, 0.22135688669979572, -0.10905964929610491, 0.10066656967625022, 0.07003578150644899, -0.08499279631767422, -0.022974729668349028, -0.18178074419498444, 0.29892355100251733, 0.1483130579441786, 0.31048833759501576, 0.11718824710696936, -0.033100544661283496, -0.06360618502832949, -0.007444334309548139, -0.05632103893905878, -0.05070806272269692, 0.18687889037653804, 0.41649277140386404, 0.14943377513438463, 0.32049097947776317, -0.47334263343364, -0.2371543625369668, 0.11824675478041172, 0.21359332864172756, 0.0688917933870107, -0.09125951556488872, -0.2687101884558797, 0.12667118797427976, -0.23173856366425752, -0.15192447420209645, -0.03418617989867925, -0.04474031515419483, 0.02587579907849431, -0.21794966600835322, -0.03526751480996609, 0.019349075183272363, 0.04533049061894417, -0.05648036381229758, -0.08964688219828532, 0.04287573530338704, 0.20910158020444214, 0.04265259427484125, -0.02574926631525159, 0.0673730919137597, -0.15987079936545343, -0.12292988164350391, 0.428592712059617, 0.04364668978843838, -0.19580851037055255, 0.21496743589639664, -0.07599841432645917, -0.1508348780684173, 0.0943517629057169, 0.27817995071411133, 0.012427307665348053, -0.22713748730719088, 0.016645208296831696, 0.07754811767488717, 0.13021721970289946, 0.0058699139440432195, 0.12992452308535576, 0.3124824956059456, 0.2561523745767772, 0.11098973808810114, 0.07920816419413314, -0.09150189263746142, -0.039988750535994766, -0.24423515095491893, -0.16020529374480247, -0.15060407721437513, -0.004012287389487028, -0.018841954988311045, -0.10483339343219995, 0.38538639396429064, 0.25154649924486877, 0.13905134111642836, 0.013158277105540038, 0.36141922664828596, 0.08078982645412908, 0.0704206859273836, 0.05612407802138478, 0.2443384003388928, 0.03774493758566678, 0.18789691492915153, -0.162546147396788, 0.026994603192433714, -0.09018904887139798]
|
1,803.05662
|
Structure Regularized Neural Network for Entity Relation Classification
for Chinese Literature Text
|
Relation classification is an important semantic processing task in the field
of natural language processing. In this paper, we propose the task of relation
classification for Chinese literature text. A new dataset of Chinese literature
text is constructed to facilitate the study in this task. We present a novel
model, named Structure Regularized Bidirectional Recurrent Convolutional Neural
Network (SR-BRCNN), to identify the relation between entities. The proposed
model learns relation representations along the shortest dependency path (SDP)
extracted from the structure regularized dependency tree, which has the
benefits of reducing the complexity of the whole model. Experimental results
show that the proposed method significantly improves the F1 score by 10.3, and
outperforms the state-of-the-art approaches on Chinese literature text.
|
cs.CL
|
relation classification is an important semantic processing task in the field of natural language processing in this paper we propose the task of relation classification for chinese literature text a new dataset of chinese literature text is constructed to facilitate the study in this task we present a novel model named structure regularized bidirectional recurrent convolutional neural network srbrcnn to identify the relation between entities the proposed model learns relation representations along the shortest dependency path sdp extracted from the structure regularized dependency tree which has the benefits of reducing the complexity of the whole model experimental results show that the proposed method significantly improves the f1 score by 103 and outperforms the stateoftheart approaches on chinese literature text
|
[['relation', 'classification', 'is', 'an', 'important', 'semantic', 'processing', 'task', 'in', 'the', 'field', 'of', 'natural', 'language', 'processing', 'in', 'this', 'paper', 'we', 'propose', 'the', 'task', 'of', 'relation', 'classification', 'for', 'chinese', 'literature', 'text', 'a', 'new', 'dataset', 'of', 'chinese', 'literature', 'text', 'is', 'constructed', 'to', 'facilitate', 'the', 'study', 'in', 'this', 'task', 'we', 'present', 'a', 'novel', 'model', 'named', 'structure', 'regularized', 'bidirectional', 'recurrent', 'convolutional', 'neural', 'network', 'srbrcnn', 'to', 'identify', 'the', 'relation', 'between', 'entities', 'the', 'proposed', 'model', 'learns', 'relation', 'representations', 'along', 'the', 'shortest', 'dependency', 'path', 'sdp', 'extracted', 'from', 'the', 'structure', 'regularized', 'dependency', 'tree', 'which', 'has', 'the', 'benefits', 'of', 'reducing', 'the', 'complexity', 'of', 'the', 'whole', 'model', 'experimental', 'results', 'show', 'that', 'the', 'proposed', 'method', 'significantly', 'improves', 'the', 'f1', 'score', 'by', '103', 'and', 'outperforms', 'the', 'stateoftheart', 'approaches', 'on', 'chinese', 'literature', 'text']]
|
[-0.07961269861513401, -0.031035529953596316, -0.05651228094149886, 0.09225803643654464, -0.1500781998906474, -0.11090815286704545, 0.048380179684885415, 0.4207173562845436, -0.3190856492067924, -0.3280238726223677, 0.007379928194341581, -0.2814857888398534, -0.236757848474939, 0.19732703646779123, -0.11953311265146328, 0.05564635751820248, 0.14974875906008786, 0.08217176742520246, -0.0863328508428945, -0.2609020765610355, 0.29918986372452355, 0.03578839309797701, 0.4190036650920697, 0.01433278589166101, 0.15021595884493347, -0.038528865846505354, -0.06846882807292139, -0.04375742533011362, -0.08851902700115392, 0.20603916991474422, 0.30322677781805396, 0.22385113846542218, 0.2836806180085829, -0.36271428430484515, -0.2210994795896113, 0.05783514180457441, 0.15166783385704888, 0.08644583664136007, 0.003063671483255733, -0.329924396965337, 0.09301083360727624, -0.19017190007114057, 0.08162336684842357, -0.08753382099172795, 0.009451969382175544, -0.04692613445340766, -0.22825315634530605, 0.08391672287183671, 0.12345194212808194, 0.05560822959918276, -0.0663320026301258, -0.12936753635215809, 0.049271340916027966, 0.18519741521706268, 0.03974927600642856, 0.11965023411114274, 0.07077396553309666, -0.1944175505245073, -0.18274272892276866, 0.36567520399151715, -0.0859625710616425, -0.20782655711143705, 0.1521722764502895, -0.012639378229061426, -0.19775240810319655, 0.04831244366764391, 0.21072328089089212, 0.08850405031373187, -0.19434801095374465, 0.03871059322175254, -0.10412923552853576, 0.21196022502568915, 0.05992605488242234, -0.02504640548900401, 0.15027207481632673, 0.3176437250606842, -0.004513590099384724, 0.18792379528512956, -0.14273520096370917, -0.06901803098853788, -0.1964335581603444, -0.12778886206353368, -0.17929769842293491, -0.0710591293133448, -0.12614585674292372, -0.13567838068830512, 0.42449996198953716, 0.25094604511129653, 0.18399192244445872, 0.1540878370761382, 0.3190291760217051, 0.04467712579910659, 0.10927942197896161, 0.10025929967661672, 0.1463576429878693, 0.021631111665155297, 0.13803371188420235, -0.19421663895196092, 0.08803575620315653, 0.14097257122649984]
|
1,803.05663
|
Are Bitcoin Bubbles Predictable? Combining a Generalized Metcalfe's Law
and the LPPLS Model
|
We develop a strong diagnostic for bubbles and crashes in bitcoin, by
analyzing the coincidence (and its absence) of fundamental and technical
indicators. Using a generalized Metcalfe's law based on network properties, a
fundamental value is quantified and shown to be heavily exceeded, on at least
four occasions, by bubbles that grow and burst. In these bubbles, we detect a
universal super-exponential unsustainable growth. We model this universal
pattern with the Log-Periodic Power Law Singularity (LPPLS) model, which
parsimoniously captures diverse positive feedback phenomena, such as herding
and imitation. The LPPLS model is shown to provide an ex-ante warning of market
instabilities, quantifying a high crash hazard and probabilistic bracket of the
crash time consistent with the actual corrections; although, as always, the
precise time and trigger (which straw breaks the camel's back) being exogenous
and unpredictable. Looking forward, our analysis identifies a substantial but
not unprecedented overvaluation in the price of bitcoin, suggesting many months
of volatile sideways bitcoin prices ahead (from the time of writing, March
2018).
|
econ.EM q-fin.GN
|
we develop a strong diagnostic for bubbles and crashes in bitcoin by analyzing the coincidence and its absence of fundamental and technical indicators using a generalized metcalfes law based on network properties a fundamental value is quantified and shown to be heavily exceeded on at least four occasions by bubbles that grow and burst in these bubbles we detect a universal superexponential unsustainable growth we model this universal pattern with the logperiodic power law singularity lppls model which parsimoniously captures diverse positive feedback phenomena such as herding and imitation the lppls model is shown to provide an exante warning of market instabilities quantifying a high crash hazard and probabilistic bracket of the crash time consistent with the actual corrections although as always the precise time and trigger which straw breaks the camels back being exogenous and unpredictable looking forward our analysis identifies a substantial but not unprecedented overvaluation in the price of bitcoin suggesting many months of volatile sideways bitcoin prices ahead from the time of writing march 2018
|
[['we', 'develop', 'a', 'strong', 'diagnostic', 'for', 'bubbles', 'and', 'crashes', 'in', 'bitcoin', 'by', 'analyzing', 'the', 'coincidence', 'and', 'its', 'absence', 'of', 'fundamental', 'and', 'technical', 'indicators', 'using', 'a', 'generalized', 'metcalfes', 'law', 'based', 'on', 'network', 'properties', 'a', 'fundamental', 'value', 'is', 'quantified', 'and', 'shown', 'to', 'be', 'heavily', 'exceeded', 'on', 'at', 'least', 'four', 'occasions', 'by', 'bubbles', 'that', 'grow', 'and', 'burst', 'in', 'these', 'bubbles', 'we', 'detect', 'a', 'universal', 'superexponential', 'unsustainable', 'growth', 'we', 'model', 'this', 'universal', 'pattern', 'with', 'the', 'logperiodic', 'power', 'law', 'singularity', 'lppls', 'model', 'which', 'parsimoniously', 'captures', 'diverse', 'positive', 'feedback', 'phenomena', 'such', 'as', 'herding', 'and', 'imitation', 'the', 'lppls', 'model', 'is', 'shown', 'to', 'provide', 'an', 'exante', 'warning', 'of', 'market', 'instabilities', 'quantifying', 'a', 'high', 'crash', 'hazard', 'and', 'probabilistic', 'bracket', 'of', 'the', 'crash', 'time', 'consistent', 'with', 'the', 'actual', 'corrections', 'although', 'as', 'always', 'the', 'precise', 'time', 'and', 'trigger', 'which', 'straw', 'breaks', 'the', 'camels', 'back', 'being', 'exogenous', 'and', 'unpredictable', 'looking', 'forward', 'our', 'analysis', 'identifies', 'a', 'substantial', 'but', 'not', 'unprecedented', 'overvaluation', 'in', 'the', 'price', 'of', 'bitcoin', 'suggesting', 'many', 'months', 'of', 'volatile', 'sideways', 'bitcoin', 'prices', 'ahead', 'from', 'the', 'time', 'of', 'writing', 'march', '2018']]
|
[-0.09430589371642577, 0.10066891049206073, -0.12253756119908225, 0.12426148175424483, -0.08361701161418794, -0.16863001634769098, 0.10451441252956817, 0.32657985397774353, -0.25883255650140563, -0.2948808601379571, 0.15293403422892557, -0.28626089857218884, -0.14773094982250468, 0.195322731943779, -0.09783556402975022, 0.025617504299180197, 0.012238767151665714, -0.012298905750641534, 0.03232619978526067, -0.2385230995921319, 0.23281638684640185, 0.12409664021691957, 0.28434032535307197, 0.06030598759634652, 0.13275080146378226, -0.06400627590930806, -0.06574509128240714, 0.011832419788387753, -0.09904912497508843, 0.06267326214962457, 0.22924393525925058, 0.14114164714233057, 0.31200641578823857, -0.4600611753403912, -0.1946832384409923, 0.10976447811978456, 0.09955992250973304, 0.04795403351604983, -0.016286121260446425, -0.28037277259450605, 0.03585671760230022, -0.23640214751430472, -0.14322739129213716, -0.05129877589753217, 0.0529631130237507, 0.03399005042094424, -0.23738293292568502, 0.09570807892279479, 0.06322330560055754, 0.06777950131042293, -0.02892371055948377, -0.02959350042441893, -0.028709485351256805, 0.1306247081698508, 0.10927101134352893, -0.013551607158327112, 0.14548003286971936, -0.12926714141169818, -0.14710312347153764, 0.35676940045038447, -0.05012241386830498, -0.06237576260965403, 0.1686091181841409, -0.1608905683253677, -0.14530383510592246, 0.14240378535975365, 0.18760004028204014, 0.029907309363844815, -0.12850575131424785, -0.015042601117778834, -0.00897075701091637, 0.19222577099520272, 0.08547028132539364, -0.012708639772884415, 0.2241108681560224, 0.17308344105988763, 0.04679258056666934, 0.09036706587004878, -0.06118296105249305, -0.12664889481701178, -0.2943859575591849, -0.1256110486891341, -0.1339750818979855, 0.07409583628475569, -0.12648413296898803, -0.18437364303538598, 0.39448047840703254, 0.13326499193972913, 0.18042789426626715, 0.058467022063397975, 0.28356469138222334, 0.12268444519564399, 0.06099344032042324, 0.1172842770283105, 0.21971257943722017, -0.002398214726598614, 0.15566930275399393, -0.1878401356847053, 0.19611770712037588, 0.028184354112389877]
|
1,803.05664
|
Conditional Model Selection in Mixed-Effects Models with cAIC4
|
Model selection in mixed models based on the conditional distribution is
appropriate for many practical applications and has been a focus of recent
statistical research. In this paper we introduce the R-package cAIC4 that
allows for the computation of the conditional Akaike Information Criterion
(cAIC). Computation of the conditional AIC needs to take into account the
uncertainty of the random effects variance and is therefore not
straightforward. We introduce a fast and stable implementation for the
calculation of the cAIC for linear mixed models estimated with lme4 and
additive mixed models estimated with gamm4 . Furthermore, cAIC4 offers a
stepwise function that allows for a fully automated stepwise selection scheme
for mixed models based on the conditional AIC. Examples of many possible
applications are presented to illustrate the practical impact and easy handling
of the package.
|
stat.CO stat.AP
|
model selection in mixed models based on the conditional distribution is appropriate for many practical applications and has been a focus of recent statistical research in this paper we introduce the rpackage caic4 that allows for the computation of the conditional akaike information criterion caic computation of the conditional aic needs to take into account the uncertainty of the random effects variance and is therefore not straightforward we introduce a fast and stable implementation for the calculation of the caic for linear mixed models estimated with lme4 and additive mixed models estimated with gamm4 furthermore caic4 offers a stepwise function that allows for a fully automated stepwise selection scheme for mixed models based on the conditional aic examples of many possible applications are presented to illustrate the practical impact and easy handling of the package
|
[['model', 'selection', 'in', 'mixed', 'models', 'based', 'on', 'the', 'conditional', 'distribution', 'is', 'appropriate', 'for', 'many', 'practical', 'applications', 'and', 'has', 'been', 'a', 'focus', 'of', 'recent', 'statistical', 'research', 'in', 'this', 'paper', 'we', 'introduce', 'the', 'rpackage', 'caic4', 'that', 'allows', 'for', 'the', 'computation', 'of', 'the', 'conditional', 'akaike', 'information', 'criterion', 'caic', 'computation', 'of', 'the', 'conditional', 'aic', 'needs', 'to', 'take', 'into', 'account', 'the', 'uncertainty', 'of', 'the', 'random', 'effects', 'variance', 'and', 'is', 'therefore', 'not', 'straightforward', 'we', 'introduce', 'a', 'fast', 'and', 'stable', 'implementation', 'for', 'the', 'calculation', 'of', 'the', 'caic', 'for', 'linear', 'mixed', 'models', 'estimated', 'with', 'lme4', 'and', 'additive', 'mixed', 'models', 'estimated', 'with', 'gamm4', 'furthermore', 'caic4', 'offers', 'a', 'stepwise', 'function', 'that', 'allows', 'for', 'a', 'fully', 'automated', 'stepwise', 'selection', 'scheme', 'for', 'mixed', 'models', 'based', 'on', 'the', 'conditional', 'aic', 'examples', 'of', 'many', 'possible', 'applications', 'are', 'presented', 'to', 'illustrate', 'the', 'practical', 'impact', 'and', 'easy', 'handling', 'of', 'the', 'package']]
|
[-0.04031773727161415, 0.03387077776609327, -0.1167666764266676, 0.11569057762795693, -0.11042732140049338, -0.17065330994117892, 0.05890356324203877, 0.38867338317813294, -0.2446888620880517, -0.27511496389651613, 0.13607455519994607, -0.1885535456189466, -0.14480624089694835, 0.2263222620452077, -0.08347275319013561, 0.10677331906150687, 0.059656509551022086, 0.010063820447998516, -0.07084239690933221, -0.2575497440252961, 0.28003996774328477, 0.07399810921880558, 0.31912251179473416, 0.03175457214555619, 0.14256754222983684, 0.07004251313099469, -0.07177131387553262, 0.018647569722044424, -0.13123355253838148, 0.1735266004565567, 0.23450901251161474, 0.1995201574613792, 0.3548867928541519, -0.39973568078130484, -0.24749588198028505, 0.11451975976568506, 0.10891967690479236, 0.13468181687251976, -0.047231391599669936, -0.2324094525026863, 0.08948744216820959, -0.21383054531223467, -0.04853753639723767, -0.14094069069533638, -0.004745453892445023, 0.0221838836600496, -0.351704026575934, 0.07542401672143376, 0.06135244079456298, 0.05004526608426011, -0.025991928235408992, -0.16895132952468525, 0.005240224345911745, 0.08720328989720931, 0.010481744675692453, -0.036533803664938067, 0.07891386588082903, -0.0999536069699168, -0.12270078441184579, 0.35943748113332374, -0.03651125000782706, -0.23033789744614763, 0.1578748386571974, -0.03005705130282987, -0.1718873817166737, 0.06239423354175718, 0.21674450399234158, 0.1049740546767487, -0.15498167061719648, 0.062273779197394935, 0.017770148432728918, 0.13695013949252438, -0.03805851917466939, 0.02034893727536793, 0.1868956656562108, 0.18508762260898948, 0.034760087736437774, 0.17702809893385027, -0.12396414508464548, -0.12691648370827985, -0.30912634486925195, -0.16952164340623174, -0.15055694778195836, -0.033186836773066636, -0.08447225913561962, -0.1973216371526095, 0.38347025363005244, 0.20563291236193795, 0.16189343786699642, 0.06866587514311752, 0.3495366910867619, 0.13230853755323385, 0.03568375574876413, 0.04641291953686794, 0.1788309911322413, 0.14758737304311415, 0.02691792302313402, -0.1710091561579964, 0.15173384510986085, 0.02179820022799752]
|
1,803.05665
|
Performance and Impairment Modelling for Hardware Components in
Millimetre-wave Transceivers
|
This invited paper details some of the hardware modelling and impairment
analysis carried out in the EU mmMAGIC project. The modelling work includes
handset and Access Point antenna arrays, where specific millimeter-wave
challenges are addressed. In power amplifier related analysis, statistical and
behavioural modelling approaches are discussed. Phase Noise, regarded as a main
impairment in millimeter-wave, is captured under two models and some analysis
into to the impact of phase noise is also provided.
|
cs.IT eess.SP math.IT
|
this invited paper details some of the hardware modelling and impairment analysis carried out in the eu mmmagic project the modelling work includes handset and access point antenna arrays where specific millimeterwave challenges are addressed in power amplifier related analysis statistical and behavioural modelling approaches are discussed phase noise regarded as a main impairment in millimeterwave is captured under two models and some analysis into to the impact of phase noise is also provided
|
[['this', 'invited', 'paper', 'details', 'some', 'of', 'the', 'hardware', 'modelling', 'and', 'impairment', 'analysis', 'carried', 'out', 'in', 'the', 'eu', 'mmmagic', 'project', 'the', 'modelling', 'work', 'includes', 'handset', 'and', 'access', 'point', 'antenna', 'arrays', 'where', 'specific', 'millimeterwave', 'challenges', 'are', 'addressed', 'in', 'power', 'amplifier', 'related', 'analysis', 'statistical', 'and', 'behavioural', 'modelling', 'approaches', 'are', 'discussed', 'phase', 'noise', 'regarded', 'as', 'a', 'main', 'impairment', 'in', 'millimeterwave', 'is', 'captured', 'under', 'two', 'models', 'and', 'some', 'analysis', 'into', 'to', 'the', 'impact', 'of', 'phase', 'noise', 'is', 'also', 'provided']]
|
[-0.16943328417334202, 0.022632859581200458, -0.047198155979827246, 0.05251774861087167, -0.04567506765267132, -0.2043412958257643, 0.04890095967503667, 0.3901852969885678, -0.20183315152629605, -0.26863147029212703, 0.1535802203800051, -0.27789784161172604, -0.22191033754073008, 0.20510933952204682, -0.10140797111986054, 0.040655926262450126, 0.042855632176773774, -0.056744050473679565, 0.004389707153235134, -0.18309717033863873, 0.2854447829461581, 0.1305320826610802, 0.3208850232972386, 0.021327135696648493, 0.03655734465684037, -0.054760378794870467, -0.14981142702084538, 0.0010747336656660646, -0.06926115290765222, 0.054429617427239146, 0.34583415433582954, 0.15982702841220825, 0.3012633936454517, -0.4248982983565814, -0.25055865126636784, 0.05644236892663144, 0.12687083463360732, 0.02585942648049142, -0.04152841269466523, -0.2950358731118408, 0.053778346451754507, -0.20239655459551392, -0.08893838704790215, -0.04391844288722889, -0.07963216099636378, 0.0425089423168887, -0.2274096874469841, -0.012090876223786885, 0.07829326279209675, 0.13421060540084098, -0.05777413795098058, -0.18346970883273594, 0.0098210971557057, 0.14312937784612784, 0.07028087868309592, -0.0037431273219251148, 0.1254481416371827, -0.09676031287243539, -0.07019778117034081, 0.3917251882218831, 0.020773216213628248, -0.20280294492840767, 0.1486852192666029, -0.12095340764200366, -0.20185012092209748, 0.06843529753481366, 0.21728158835203676, 0.009169169091241988, -0.23061082379993153, 0.04319554735667299, 0.09343152116933787, 0.21121237996684047, 0.0537008438511072, 0.060731155596472124, 0.21233271739470796, 0.24214233286880157, -0.028515206889022846, 0.15766678540338133, -0.10891402950762091, -0.1176977296787742, -0.2910374326228693, -0.08002942976718014, -0.12792293519738154, 0.019137686135788524, -0.008806767721654143, -0.09438521520476914, 0.39309858565999045, 0.1945403433325024, 0.10452183110110864, -0.026974105851951282, 0.37058170522386963, 0.07148778466098765, 0.013921359843398267, 0.02908483274419465, 0.18040682589776838, 0.12316831526019283, 0.15681411500239895, -0.1729647234912861, 0.05309807871329925, -0.04664461747302699]
|
1,803.05666
|
Motion optimization and parameter identification for a human and
lower-back exoskeleton model
|
Designing an exoskeleton to reduce the risk of low-back injury during lifting
is challenging. Computational models of the human-robot system coupled with
predictive movement simulations can help to simplify this design process. Here,
we present a study that models the interaction between a human model actuated
by muscles and a lower-back exoskeleton. We provide a computational framework
for identifying the spring parameters of the exoskeleton using an optimal
control approach and forward-dynamics simulations. This is applied to generate
dynamically consistent bending and lifting movements in the sagittal plane. Our
computations are able to predict motions and forces of the human and
exoskeleton that are within the torque limits of a subject. The identified
exoskeleton could also yield a considerable reduction of the peak lower-back
torques as well as the cumulative lower-back load during the movements. This
work is relevant to the research communities working on human-robot
interaction, and can be used as a basis for a better human-centered design
process.
|
cs.RO math.OC
|
designing an exoskeleton to reduce the risk of lowback injury during lifting is challenging computational models of the humanrobot system coupled with predictive movement simulations can help to simplify this design process here we present a study that models the interaction between a human model actuated by muscles and a lowerback exoskeleton we provide a computational framework for identifying the spring parameters of the exoskeleton using an optimal control approach and forwarddynamics simulations this is applied to generate dynamically consistent bending and lifting movements in the sagittal plane our computations are able to predict motions and forces of the human and exoskeleton that are within the torque limits of a subject the identified exoskeleton could also yield a considerable reduction of the peak lowerback torques as well as the cumulative lowerback load during the movements this work is relevant to the research communities working on humanrobot interaction and can be used as a basis for a better humancentered design process
|
[['designing', 'an', 'exoskeleton', 'to', 'reduce', 'the', 'risk', 'of', 'lowback', 'injury', 'during', 'lifting', 'is', 'challenging', 'computational', 'models', 'of', 'the', 'humanrobot', 'system', 'coupled', 'with', 'predictive', 'movement', 'simulations', 'can', 'help', 'to', 'simplify', 'this', 'design', 'process', 'here', 'we', 'present', 'a', 'study', 'that', 'models', 'the', 'interaction', 'between', 'a', 'human', 'model', 'actuated', 'by', 'muscles', 'and', 'a', 'lowerback', 'exoskeleton', 'we', 'provide', 'a', 'computational', 'framework', 'for', 'identifying', 'the', 'spring', 'parameters', 'of', 'the', 'exoskeleton', 'using', 'an', 'optimal', 'control', 'approach', 'and', 'forwarddynamics', 'simulations', 'this', 'is', 'applied', 'to', 'generate', 'dynamically', 'consistent', 'bending', 'and', 'lifting', 'movements', 'in', 'the', 'sagittal', 'plane', 'our', 'computations', 'are', 'able', 'to', 'predict', 'motions', 'and', 'forces', 'of', 'the', 'human', 'and', 'exoskeleton', 'that', 'are', 'within', 'the', 'torque', 'limits', 'of', 'a', 'subject', 'the', 'identified', 'exoskeleton', 'could', 'also', 'yield', 'a', 'considerable', 'reduction', 'of', 'the', 'peak', 'lowerback', 'torques', 'as', 'well', 'as', 'the', 'cumulative', 'lowerback', 'load', 'during', 'the', 'movements', 'this', 'work', 'is', 'relevant', 'to', 'the', 'research', 'communities', 'working', 'on', 'humanrobot', 'interaction', 'and', 'can', 'be', 'used', 'as', 'a', 'basis', 'for', 'a', 'better', 'humancentered', 'design', 'process']]
|
[-0.0915523389814115, 0.088391975705811, -0.09480544707820385, 0.024365965423696047, -0.11144239392390923, -0.1135092094680405, 0.046217070764248976, 0.3857278449496231, -0.2600893384947948, -0.3426729721972082, 0.0937306605294366, -0.2244079226194704, -0.2089569831290577, 0.22446502806306404, -0.10945448245045647, 0.05440753749630685, 0.07058634286410399, -0.0007219451471877319, 0.014251465160588297, -0.18434338315531518, 0.21457804432079855, 0.10035552463753597, 0.2626321543644689, 0.04274885590583133, 0.11140264344366291, -0.017719484648307714, 0.01697164384612837, 0.009136526798239992, -0.11322034712738278, 0.17149252845622787, 0.26201436408822865, 0.10682199361050336, 0.30602256963147395, -0.45658027266352613, -0.2058147177519424, 0.06632984967466114, 0.12773500411930389, 0.10219631364710535, -0.02481524352665071, -0.29295870926690915, 0.04117207281008552, -0.19150154769444203, -0.10403920640827075, -0.10550678303419933, 0.011744241754795555, 0.013209771609915232, -0.2980987356763475, 0.026947249768742455, 0.033977042148532595, 0.08637583886473617, -0.09550218615987444, -0.05684111973482974, -0.02286721545929543, 0.21147744504799712, 0.06661748879214659, 0.05421186558448391, 0.19443652481194348, -0.14688503003901732, -0.13634677097213135, 0.4083075754144052, -0.0002861842129945378, -0.2298788017566799, 0.2030251729773664, -0.04772397876743675, -0.09518732431291638, 0.0987608455699173, 0.2647638467223018, 0.0802409440953921, -0.1916690340466043, -0.006724292694596881, 0.0008789886384495074, 0.1553099557722011, 0.023170979974991818, -0.07528553933753998, 0.21378806614187323, 0.23077898074672382, 0.05266609297301974, 0.1517876058167047, -0.07820768246598117, -0.07492641330537492, -0.27334491408701184, -0.12395200958546204, -0.1196269069281053, -0.013042756780699084, -0.05117409174198644, -0.09887931421634895, 0.3897748750669858, 0.1926205860321186, 0.17240505079632695, 0.07444392122198235, 0.31171692278135943, 0.07349430447108336, 0.10460970358616567, 0.040996653322554845, 0.2580604957286976, 0.05704363591267574, 0.09754990120536258, -0.2605223406454006, 0.10038762847186343, 0.002418075794283348]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.