id float64 706 1.8k | title stringlengths 1 343 | abstract stringlengths 6 6.09k | categories stringlengths 5 125 | processed_abstract stringlengths 2 5.96k | tokenized_abstract stringlengths 8 8.74k | centroid stringlengths 2.1k 2.17k |
|---|---|---|---|---|---|---|
1,802.1026 | High-entropy ceramic thin films; A case study on transition metal
diborides | High-entropy materials often outperform their lower-entropy relatives in
various aspects, such as thermal stability and fracture toughness. While there
are extensive research activities in the field of high-entropy alloys,
comparably little is performed for high-entropy ceramics, and especially for
high-entropy diborides. Here we show, that not only the hardness of ZrB2 layers
can be improved from 43.2 to 45.8 to 47.2 GPa through the formation of solid
solution ternary diborides (Zr0.61Ti0.39B2) and high-entropy diborides
(Zr0.23Ti0.20Hf0.19V0.14Ta0.24B2), respectively, but especially their thermal
stability against structural rearrangements and decomposition towards the
constituting binary diborides.
| cond-mat.mtrl-sci | highentropy materials often outperform their lowerentropy relatives in various aspects such as thermal stability and fracture toughness while there are extensive research activities in the field of highentropy alloys comparably little is performed for highentropy ceramics and especially for highentropy diborides here we show that not only the hardness of zrb2 layers can be improved from 432 to 458 to 472 gpa through the formation of solid solution ternary diborides zr061ti039b2 and highentropy diborides zr023ti020hf019v014ta024b2 respectively but especially their thermal stability against structural rearrangements and decomposition towards the constituting binary diborides | [['highentropy', 'materials', 'often', 'outperform', 'their', 'lowerentropy', 'relatives', 'in', 'various', 'aspects', 'such', 'as', 'thermal', 'stability', 'and', 'fracture', 'toughness', 'while', 'there', 'are', 'extensive', 'research', 'activities', 'in', 'the', 'field', 'of', 'highentropy', 'alloys', 'comparably', 'little', 'is', 'performed', 'for', 'highentropy', 'ceramics', 'and', 'especially', 'for', 'highentropy', 'diborides', 'here', 'we', 'show', 'that', 'not', 'only', 'the', 'hardness', 'of', 'zrb2', 'layers', 'can', 'be', 'improved', 'from', '432', 'to', '458', 'to', '472', 'gpa', 'through', 'the', 'formation', 'of', 'solid', 'solution', 'ternary', 'diborides', 'zr061ti039b2', 'and', 'highentropy', 'diborides', 'zr023ti020hf019v014ta024b2', 'respectively', 'but', 'especially', 'their', 'thermal', 'stability', 'against', 'structural', 'rearrangements', 'and', 'decomposition', 'towards', 'the', 'constituting', 'binary', 'diborides']] | [-0.0635526049123512, 0.18310215836914068, -0.062250428707495836, 0.0001692489231675026, -0.030338065934189584, -0.12854531900224725, 0.1142487216824561, 0.45905295424581916, -0.25995013921448357, -0.30228270387297934, 0.1460000229711655, -0.3218569759739919, -0.13257245353182381, 0.17591104077782188, -0.017373552249573345, 0.06146653115309859, 0.03564844305628356, -0.04380315673940428, -0.11507211765536013, -0.25147901043973425, 0.2044422087871752, 0.08781939815060141, 0.30479965272642084, 0.025785164651199337, -0.006379461569941781, -0.0609236641556778, 0.08504418093250708, 0.05483611888681235, -0.1219079581255602, 0.05595559868543001, 0.30047004056696813, 0.04665421722247527, 0.21371931446653403, -0.4414764322298631, -0.23741996152263678, 0.03608366627287998, 0.10503748457700934, 0.06446859143998766, -0.12746041070858247, -0.23465903539320432, 0.16624014924301275, -0.15683883191557246, -0.04657708860350396, -0.1320308906214542, 0.0011219000613861038, 0.03925234423047769, -0.18559239091602772, 0.11716327893160534, 0.07944265058201351, 0.10950312549196016, -0.14516876871551104, -0.20895835538551713, -0.0960344322342321, 0.053480789646129595, 0.025857203208391417, -0.01798980274326639, 0.17724740311105766, -0.1623446420731096, -0.025752954959367098, 0.44174435833113246, 0.02458262290763721, -0.054319505778591286, 0.2642182452457674, -0.11799750814745412, -0.15706578311458064, 0.1575268902658914, 0.1411072970472611, 0.10691926505918918, -0.10909514713069696, 0.010022988268226552, 0.033101027350077465, 0.20879927566118037, 0.09206119485806381, 0.06915932774460049, 0.194416631083789, 0.20462670874143585, -0.07332911564225561, 0.15144617321738826, -0.04131978495946426, -0.06940159975064479, -0.1478988585700647, -0.19723725097065561, -0.14379735756665468, 0.044277988952549245, -0.116747943798912, -0.21715040214024903, 0.30312980389159716, 0.10626627713653751, 0.1345619795885816, -0.03797319626665852, 0.19354464176367298, -0.05454662584129386, 0.04113759332482986, 0.05864768480003048, 0.29044200687308197, 0.16000565913443066, 0.1287578745729426, -0.1920071301394498, 0.18790651679436646, -0.018515348227778346] |
1,802.10261 | A cut-free proof system for a predicate extension of the logic of
provability | In this paper, we introduce a proof system $\mathsf{NQGL}$ for a Kripke
complete predicate extension of the logic $\mathbf{GL}$, that is, the logic of
provability, which is defned by $\mathbf{K}$ and the L\"{o}b formula $\Box(\Box
p\supset p)\supset\Box p$. $\mathsf{NQGL}$ is a modal extension of Gentzen's
sequent calculus $\mathsf{LK}$. Although the propositional fragment of
$\mathsf{NQGL}$ axiomatizes $\mathbf{GL}$, it does not have the L\"{o}b formula
as its axiom. Instead, it has a non-compact rule, that is, a derivation rule
with countably many premises. We show that $\mathsf{NQGL}$ enjoys cut
admissibility and is complete with respect to the class of Kripke frames such
that for each world, the supremum of the length of the paths from the world is
finite.
| math.LO | in this paper we introduce a proof system mathsfnqgl for a kripke complete predicate extension of the logic mathbfgl that is the logic of provability which is defned by mathbfk and the lob formula boxbox psupset psupsetbox p mathsfnqgl is a modal extension of gentzens sequent calculus mathsflk although the propositional fragment of mathsfnqgl axiomatizes mathbfgl it does not have the lob formula as its axiom instead it has a noncompact rule that is a derivation rule with countably many premises we show that mathsfnqgl enjoys cut admissibility and is complete with respect to the class of kripke frames such that for each world the supremum of the length of the paths from the world is finite | [['in', 'this', 'paper', 'we', 'introduce', 'a', 'proof', 'system', 'mathsfnqgl', 'for', 'a', 'kripke', 'complete', 'predicate', 'extension', 'of', 'the', 'logic', 'mathbfgl', 'that', 'is', 'the', 'logic', 'of', 'provability', 'which', 'is', 'defned', 'by', 'mathbfk', 'and', 'the', 'lob', 'formula', 'boxbox', 'psupset', 'psupsetbox', 'p', 'mathsfnqgl', 'is', 'a', 'modal', 'extension', 'of', 'gentzens', 'sequent', 'calculus', 'mathsflk', 'although', 'the', 'propositional', 'fragment', 'of', 'mathsfnqgl', 'axiomatizes', 'mathbfgl', 'it', 'does', 'not', 'have', 'the', 'lob', 'formula', 'as', 'its', 'axiom', 'instead', 'it', 'has', 'a', 'noncompact', 'rule', 'that', 'is', 'a', 'derivation', 'rule', 'with', 'countably', 'many', 'premises', 'we', 'show', 'that', 'mathsfnqgl', 'enjoys', 'cut', 'admissibility', 'and', 'is', 'complete', 'with', 'respect', 'to', 'the', 'class', 'of', 'kripke', 'frames', 'such', 'that', 'for', 'each', 'world', 'the', 'supremum', 'of', 'the', 'length', 'of', 'the', 'paths', 'from', 'the', 'world', 'is', 'finite']] | [-0.1073926578490146, 0.05952183180282601, -0.147286776914797, 0.10019374721316802, -0.1779401540855127, -0.11687123285095512, 0.06518806495283426, 0.33030375757510155, -0.29304418721096176, -0.2007428044355392, 0.08545136269680595, -0.25390880462606397, -0.09174849026433637, 0.13932633375238002, -0.1658453041671124, -0.0018706197847315497, 0.04503269055940672, 0.11877581690009519, -0.016586402220964695, -0.1996371654805983, 0.31256843073427754, -0.04578674861551386, 0.22037920520014534, 0.04883569896023358, 0.14088716515364635, 0.060184156713776485, 0.0367142174256949, 0.06766933477195226, -0.10023080814033293, 0.11470855420570722, 0.2891709485577535, 0.22978866682181845, 0.3044632034194944, -0.3619362898335784, -0.10733841227746643, 0.12212021801356984, 0.06056658796702338, 0.06140397130655933, 0.08752970546648829, -0.2669513328825082, 0.1141570370759716, -0.2132665212307356, -0.09612479299694233, -0.08251056516444129, 0.11539245805233321, 0.009628028026781976, -0.23929220271107238, -0.013921979806526045, 0.2615534646881629, 0.11411291674043225, -0.02873344620387701, -0.06673962682530911, -0.023290679188428726, 0.0010412280299428817, -0.020320410728949096, 0.033163292856837535, 0.07933784682979494, -0.031694892297325805, -0.17552527599860873, 0.3727701529283571, -0.0412043616375515, -0.20573494050536403, 0.08413402685912046, -0.11887732365135664, -0.16646945461284665, 0.10321799779426208, 0.006977715859173146, 0.14059899449224822, -0.11355782819054691, 0.19999299060236003, -0.1584777226908528, 0.19304236839319358, 0.12464873356728164, 0.06902239416866043, 0.17078793251606744, 0.19062368922858638, 0.05083016001267062, 0.1498101711998471, 0.0219279373707497, -0.1391427370933898, -0.37640550312281185, -0.1915901079773903, -0.12009341097478055, 0.017243816774978254, -0.09780167936593649, -0.2348231789285103, 0.3324028661524036, 0.14915332651441604, 0.11518858673166385, 0.20863399025881085, 0.279306335572516, 0.14340814200242305, 0.1180931715443071, 0.023317459921261906, 0.14160530262861598, 0.15237669160783257, 0.08073961694386944, -0.13049774688145196, 0.1070911323824749, 0.13950653228315368] |
1,802.10262 | Effective versions of two theorems of Rado | Let $M$ be a representable matroid on $n$ elements. We give bounds, in terms
of $n$, on the least positive characteristic and smallest field over which $M$
is representable.
| math.CO | let m be a representable matroid on n elements we give bounds in terms of n on the least positive characteristic and smallest field over which m is representable | [['let', 'm', 'be', 'a', 'representable', 'matroid', 'on', 'n', 'elements', 'we', 'give', 'bounds', 'in', 'terms', 'of', 'n', 'on', 'the', 'least', 'positive', 'characteristic', 'and', 'smallest', 'field', 'over', 'which', 'm', 'is', 'representable']] | [-0.2403401179752987, 0.17528615657497068, -0.006940714693788825, -0.01704465896132049, -0.04859522277296617, -0.1664902514071557, -0.02995182124191317, 0.2948817303725358, -0.28288280193147985, -0.280870127941257, 0.06704714659155861, -0.25841137823038574, -0.12449042288714955, 0.19739871097985526, -0.06851399988578312, -0.1357806002528503, 0.003090557353249912, 0.16185780460464544, -0.09865868210407167, -0.38409934559002007, 0.3123110841060507, -0.05286889118624145, 0.06975549748488541, 0.060279742589798464, 0.1372663688299985, 0.004917013314392032, 0.024073229074991983, 0.12209895011519306, -0.17953245415641317, 0.0908544036752448, 0.33281373001378156, 0.1619536320132942, 0.24406252554136104, -0.3775684358873244, -0.09512375383477273, 0.255697433098123, 0.13720333314468636, -0.10771264160324916, 0.06463588458678589, -0.17907267866720414, 0.183251122944057, -0.07315975832271165, -0.050114232597166096, -0.01896254435695451, 0.14428899744284693, 0.010824730362871597, -0.3733321648604911, -0.1117754551614153, 0.08173657709668422, 0.14211495859741136, -0.0006697670042771718, -0.266077213310476, 0.012920374500340429, 0.0413444999701761, -0.06456649577213001, 0.08684550411597794, 0.014431047285425252, -6.223592007982319e-05, -0.0912990562682008, 0.34547887190148746, -0.1614893907359962, -0.22719851714269867, 0.08142634185737577, -0.21271398146476211, -0.05911946948617697, 0.1438167170974715, 0.18928085453808308, 0.22966762134355717, 0.04839397578275409, 0.24599407304776832, -0.23874622519160138, 0.16418106764041143, 0.11101951067946081, 0.0565865711662276, 0.19519970209562573, 0.08274330487795944, 0.16736137240739732, 0.09712277895144733, 0.07109197423440115, 0.04037929427456753, -0.38182402479237526, -0.14277543461528316, -0.2573117473291169, 0.22810000653282322, -0.15512252661574166, -0.184341878144488, 0.33066141528302223, 0.033238151110708714, 0.20504570675307307, 0.1837837182282438, 0.20507763454626346, 0.09463528026666107, 0.05901854459581704, 0.1320409749409762, 0.02533597489497785, 0.2733189521421646, -0.09433757229948994, -0.15345397272050895, 0.08000013002611954, 0.19425810965034981] |
1,802.10263 | Spectra of Eigenstates in Fermionic Tensor Quantum Mechanics | We study the $O(N_1)\times O(N_2)\times O(N_3)$ symmetric quantum mechanics
of 3-index Majorana fermions. When the ranks $N_i$ are all equal, this model
has a large $N$ limit which is dominated by the melonic Feynman diagrams. We
derive an integral formula which computes the number of $SO(N_1)\times
SO(N_2)\times SO(N_3)$ invariant states for any set of $N_i$. For equal ranks
the number of singlets is non-vanishing only when $N$ is even, and it exhibits
rapid growth: it jumps from $36$ in the $O(4)^3$ model to $595354780$ in the
$O(6)^3$ model. We derive bounds on the values of energy, which show that they
scale at most as $N^3$ in the large $N$ limit, in agreement with expectations.
We also show that the splitting between the lowest singlet and non-singlet
states is of order $1/N$. For $N_3=1$ the tensor model reduces to $O(N_1)\times
O(N_2)$ fermionic matrix quantum mechanics, and we find a simple expression for
the Hamiltonian in terms of the quadratic Casimir operators of the symmetry
group. A similar expression is derived for the complex matrix model with
$SU(N_1)\times SU(N_2)\times U(1)$ symmetry. Finally, we study the $N_3=2$ case
of the tensor model, which gives a more intricate complex matrix model whose
symmetry is only $O(N_1)\times O(N_2)\times U(1)$. All energies are again
integers in appropriate units, and we derive a concise formula for the
spectrum. The fermionic matrix models we studied possess standard 't Hooft
large $N$ limits where the ground state energies are of order $N^2$, while the
energy gaps are of order $1$.
| hep-th cond-mat.str-el | we study the on_1times on_2times on_3 symmetric quantum mechanics of 3index majorana fermions when the ranks n_i are all equal this model has a large n limit which is dominated by the melonic feynman diagrams we derive an integral formula which computes the number of son_1times son_2times son_3 invariant states for any set of n_i for equal ranks the number of singlets is nonvanishing only when n is even and it exhibits rapid growth it jumps from 36 in the o43 model to 595354780 in the o63 model we derive bounds on the values of energy which show that they scale at most as n3 in the large n limit in agreement with expectations we also show that the splitting between the lowest singlet and nonsinglet states is of order 1n for n_31 the tensor model reduces to on_1times on_2 fermionic matrix quantum mechanics and we find a simple expression for the hamiltonian in terms of the quadratic casimir operators of the symmetry group a similar expression is derived for the complex matrix model with sun_1times sun_2times u1 symmetry finally we study the n_32 case of the tensor model which gives a more intricate complex matrix model whose symmetry is only on_1times on_2times u1 all energies are again integers in appropriate units and we derive a concise formula for the spectrum the fermionic matrix models we studied possess standard t hooft large n limits where the ground state energies are of order n2 while the energy gaps are of order 1 | [['we', 'study', 'the', 'on_1times', 'on_2times', 'on_3', 'symmetric', 'quantum', 'mechanics', 'of', '3index', 'majorana', 'fermions', 'when', 'the', 'ranks', 'n_i', 'are', 'all', 'equal', 'this', 'model', 'has', 'a', 'large', 'n', 'limit', 'which', 'is', 'dominated', 'by', 'the', 'melonic', 'feynman', 'diagrams', 'we', 'derive', 'an', 'integral', 'formula', 'which', 'computes', 'the', 'number', 'of', 'son_1times', 'son_2times', 'son_3', 'invariant', 'states', 'for', 'any', 'set', 'of', 'n_i', 'for', 'equal', 'ranks', 'the', 'number', 'of', 'singlets', 'is', 'nonvanishing', 'only', 'when', 'n', 'is', 'even', 'and', 'it', 'exhibits', 'rapid', 'growth', 'it', 'jumps', 'from', '36', 'in', 'the', 'o43', 'model', 'to', '595354780', 'in', 'the', 'o63', 'model', 'we', 'derive', 'bounds', 'on', 'the', 'values', 'of', 'energy', 'which', 'show', 'that', 'they', 'scale', 'at', 'most', 'as', 'n3', 'in', 'the', 'large', 'n', 'limit', 'in', 'agreement', 'with', 'expectations', 'we', 'also', 'show', 'that', 'the', 'splitting', 'between', 'the', 'lowest', 'singlet', 'and', 'nonsinglet', 'states', 'is', 'of', 'order', '1n', 'for', 'n_31', 'the', 'tensor', 'model', 'reduces', 'to', 'on_1times', 'on_2', 'fermionic', 'matrix', 'quantum', 'mechanics', 'and', 'we', 'find', 'a', 'simple', 'expression', 'for', 'the', 'hamiltonian', 'in', 'terms', 'of', 'the', 'quadratic', 'casimir', 'operators', 'of', 'the', 'symmetry', 'group', 'a', 'similar', 'expression', 'is', 'derived', 'for', 'the', 'complex', 'matrix', 'model', 'with', 'sun_1times', 'sun_2times', 'u1', 'symmetry', 'finally', 'we', 'study', 'the', 'n_32', 'case', 'of', 'the', 'tensor', 'model', 'which', 'gives', 'a', 'more', 'intricate', 'complex', 'matrix', 'model', 'whose', 'symmetry', 'is', 'only', 'on_1times', 'on_2times', 'u1', 'all', 'energies', 'are', 'again', 'integers', 'in', 'appropriate', 'units', 'and', 'we', 'derive', 'a', 'concise', 'formula', 'for', 'the', 'spectrum', 'the', 'fermionic', 'matrix', 'models', 'we', 'studied', 'possess', 'standard', 't', 'hooft', 'large', 'n', 'limits', 'where', 'the', 'ground', 'state', 'energies', 'are', 'of', 'order', 'n2', 'while', 'the', 'energy', 'gaps', 'are', 'of', 'order', '1']] | [-0.15415255234838696, 0.20456152826330556, -0.035967318886347736, 0.08397318042552797, -0.015080757229588926, -0.1502830572630046, 0.005978833740906945, 0.3104275773104746, -0.19548033036941584, -0.29962701555292975, 0.05975742486771196, -0.3024304934311658, -0.14069360649252, 0.12641391792761472, 0.023233095571049488, 0.015567243129347237, 0.005632556393781366, 0.10443412424162185, -0.08735604038180705, -0.24217087547149277, 0.30219712312876557, -0.008688646263908594, 0.24663148083685277, 0.051516003681657214, 0.09375163151804979, 0.007241061112533013, 0.030973686712483565, -0.03133047228717866, -0.10940951663875846, 0.10646726171398768, 0.22047580992095087, 0.04206209442636464, 0.1701304527853305, -0.40853160263892885, -0.13890645544743166, 0.15438974550925194, 0.12024588233034592, 0.12689752137909333, 0.010679525453391155, -0.22725763965572696, 0.09814741499600738, -0.20111342181723255, -0.14003295949854266, -0.09741480456044277, 0.04033255170409878, -0.060158431133216554, -0.3025020406348631, 0.08594888759726019, 0.04377420598223883, 0.03830280748273556, -0.04745996516091206, -0.1597202801737391, -0.037090931682420586, 0.10164682379715183, 0.05822141519893194, -0.008730554852324228, 0.0520041925982999, -0.1645962922591328, -0.08023061976612857, 0.390755324796919, -0.07882999439098057, -0.20612825677962973, 0.13100792353992194, -0.1615274049268919, -0.1402677997442273, 0.11170994181884453, 0.09886443067710692, 0.1337126126512885, -0.10626495765718573, 0.1873469169222517, -0.08909794654512855, 0.1403213442628233, 0.03171372849901673, 0.03239407060630886, 0.16481267785323628, 0.08335788758122362, 0.0736959458765341, 0.13403847856097856, -0.035117017544689585, -0.1358905998892927, -0.3578048138995655, -0.16911764764420997, -0.20559964257408864, 0.08381467771008223, -0.12508827567774763, -0.15202688798259867, 0.38331970958970485, 0.11165359398194899, 0.22448860735639756, 0.10073817577019023, 0.23019571126205846, 0.1792287408015909, 0.08553022710354223, 0.07670724876758565, 0.1803345950106935, 0.15210062189241094, 0.02280871782277245, -0.21765580691765837, -0.004950702412558409, 0.12230971855460666] |
1,802.10264 | Deep Reinforcement Learning for Vision-Based Robotic Grasping: A
Simulated Comparative Evaluation of Off-Policy Methods | In this paper, we explore deep reinforcement learning algorithms for
vision-based robotic grasping. Model-free deep reinforcement learning (RL) has
been successfully applied to a range of challenging environments, but the
proliferation of algorithms makes it difficult to discern which particular
approach would be best suited for a rich, diverse task like grasping. To answer
this question, we propose a simulated benchmark for robotic grasping that
emphasizes off-policy learning and generalization to unseen objects. Off-policy
learning enables utilization of grasping data over a wide variety of objects,
and diversity is important to enable the method to generalize to new objects
that were not seen during training. We evaluate the benchmark tasks against a
variety of Q-function estimation methods, a method previously proposed for
robotic grasping with deep neural network models, and a novel approach based on
a combination of Monte Carlo return estimation and an off-policy correction.
Our results indicate that several simple methods provide a surprisingly strong
competitor to popular algorithms such as double Q-learning, and our analysis of
stability sheds light on the relative tradeoffs between the algorithms.
| cs.RO cs.LG stat.ML | in this paper we explore deep reinforcement learning algorithms for visionbased robotic grasping modelfree deep reinforcement learning rl has been successfully applied to a range of challenging environments but the proliferation of algorithms makes it difficult to discern which particular approach would be best suited for a rich diverse task like grasping to answer this question we propose a simulated benchmark for robotic grasping that emphasizes offpolicy learning and generalization to unseen objects offpolicy learning enables utilization of grasping data over a wide variety of objects and diversity is important to enable the method to generalize to new objects that were not seen during training we evaluate the benchmark tasks against a variety of qfunction estimation methods a method previously proposed for robotic grasping with deep neural network models and a novel approach based on a combination of monte carlo return estimation and an offpolicy correction our results indicate that several simple methods provide a surprisingly strong competitor to popular algorithms such as double qlearning and our analysis of stability sheds light on the relative tradeoffs between the algorithms | [['in', 'this', 'paper', 'we', 'explore', 'deep', 'reinforcement', 'learning', 'algorithms', 'for', 'visionbased', 'robotic', 'grasping', 'modelfree', 'deep', 'reinforcement', 'learning', 'rl', 'has', 'been', 'successfully', 'applied', 'to', 'a', 'range', 'of', 'challenging', 'environments', 'but', 'the', 'proliferation', 'of', 'algorithms', 'makes', 'it', 'difficult', 'to', 'discern', 'which', 'particular', 'approach', 'would', 'be', 'best', 'suited', 'for', 'a', 'rich', 'diverse', 'task', 'like', 'grasping', 'to', 'answer', 'this', 'question', 'we', 'propose', 'a', 'simulated', 'benchmark', 'for', 'robotic', 'grasping', 'that', 'emphasizes', 'offpolicy', 'learning', 'and', 'generalization', 'to', 'unseen', 'objects', 'offpolicy', 'learning', 'enables', 'utilization', 'of', 'grasping', 'data', 'over', 'a', 'wide', 'variety', 'of', 'objects', 'and', 'diversity', 'is', 'important', 'to', 'enable', 'the', 'method', 'to', 'generalize', 'to', 'new', 'objects', 'that', 'were', 'not', 'seen', 'during', 'training', 'we', 'evaluate', 'the', 'benchmark', 'tasks', 'against', 'a', 'variety', 'of', 'qfunction', 'estimation', 'methods', 'a', 'method', 'previously', 'proposed', 'for', 'robotic', 'grasping', 'with', 'deep', 'neural', 'network', 'models', 'and', 'a', 'novel', 'approach', 'based', 'on', 'a', 'combination', 'of', 'monte', 'carlo', 'return', 'estimation', 'and', 'an', 'offpolicy', 'correction', 'our', 'results', 'indicate', 'that', 'several', 'simple', 'methods', 'provide', 'a', 'surprisingly', 'strong', 'competitor', 'to', 'popular', 'algorithms', 'such', 'as', 'double', 'qlearning', 'and', 'our', 'analysis', 'of', 'stability', 'sheds', 'light', 'on', 'the', 'relative', 'tradeoffs', 'between', 'the', 'algorithms']] | [-0.005585578568448838, -0.04192290961273813, -0.12883286273845748, 0.08504492974275588, -0.16160421478223866, -0.20576024180090877, 0.05963036154498289, 0.49500995697505645, -0.2405552723647912, -0.38830838548071556, 0.05517318918871792, -0.18542362029492523, -0.24325452844856837, 0.2842029998151783, -0.18365388407824593, 0.11268171466439546, 0.12362699081611367, -0.0067954842928294925, -0.07039821969069457, -0.2890207815288394, 0.2702407019145204, 0.011432048183893161, 0.31673705526861734, 0.035748679309240514, 0.17650338682260197, -0.011122791749534493, 0.011730460876692607, -0.007277434936974343, -0.0665174923978558, 0.1715080441397162, 0.34646057085272375, 0.21191923051692713, 0.35643644069513963, -0.34052961518436503, -0.2265322420592602, 0.13646658955339613, 0.15533835544672342, 0.11231762673978969, -0.055456381802337876, -0.35034508971944867, 0.06220411688060755, -0.18629390719820169, -0.03141813994224012, -0.20826516157099406, -0.01342736215684459, -0.01410389389821937, -0.30203200439407424, -0.04414280915799337, 0.04475193348338121, 0.0557327689919211, -0.062056038650949406, -0.11094025253219394, 0.11541199235196158, 0.15973760824203076, 0.04447811401882592, 0.053939034443026064, 0.15544326632093722, -0.19793226404531628, -0.19545901360448095, 0.3524208446683664, -0.028713989607448684, -0.16507107412464353, 0.2774208964592668, -0.006576472190963157, -0.18013146718672618, 0.09181394898098524, 0.2824692246712245, 0.21037595934890127, -0.15560404596819058, 0.008542884264450894, -0.04597420057193402, 0.14468482011336023, -0.01898373890272732, -0.034936510455045415, 0.16208484390615252, 0.30609175962572865, 0.053486442700673584, 0.134828926865974, -0.12535243116933123, -0.13127148651918552, -0.17736501416435996, -0.11041019659218841, -0.15748130574343758, -0.015091649410701825, -0.10175921990074069, -0.16854218839714563, 0.342638526204193, 0.27431283997860867, 0.1981290459096973, 0.11915703093198612, 0.3702457838291146, -0.007228333614220291, 0.09859076036951978, 0.07797516807725174, 0.23303031991431022, 0.035838018297660035, 0.14383452808076005, -0.2117304030146356, 0.10964980011405268, 0.035659431440849376] |
1,802.10265 | A Study of Environmental Effects on Galaxy Spin Using MaNGA Data | We investigate environmental effects on galaxy spin using the recent public
data of MaNGA integral field spectroscopic survey containing ~2800 galaxies. We
measure the spin parameter of 1830 galaxies through the analysis of
two-dimensional stellar kinematic maps within the effective radii, and obtain
their large- (background mass density from 20 nearby galaxies) and small-scale
(distance to and morphology of the nearest neighbour galaxy) environmental
parameters for 1529 and 1767 galaxies, respectively. We first examine the mass
dependence of galaxy spin, and find that the spin parameter of early-type
galaxies decreases with stellar mass at log (M$_*/$M$_{\odot}$) $\gtrsim$ 10,
consistent with the results from previous studies. We then divide the galaxies
into three subsamples using their stellar masses to minimize the mass effects
on galaxy spin. The spin parameters of galaxies in each subsample do not change
with background mass density, but do change with distance to and morphology of
the nearest neighbour. In particular, the spin parameter of late-type galaxies
decreases as early-type neighbours approach within the virial radius. These
results suggest that the large-scale environments hardly affect the galaxy
spin, but the small-scale environments such as hydrodynamic galaxy-galaxy
interactions can play a substantial role in determining galaxy spin.
| astro-ph.GA | we investigate environmental effects on galaxy spin using the recent public data of manga integral field spectroscopic survey containing 2800 galaxies we measure the spin parameter of 1830 galaxies through the analysis of twodimensional stellar kinematic maps within the effective radii and obtain their large background mass density from 20 nearby galaxies and smallscale distance to and morphology of the nearest neighbour galaxy environmental parameters for 1529 and 1767 galaxies respectively we first examine the mass dependence of galaxy spin and find that the spin parameter of earlytype galaxies decreases with stellar mass at log m_m_odot gtrsim 10 consistent with the results from previous studies we then divide the galaxies into three subsamples using their stellar masses to minimize the mass effects on galaxy spin the spin parameters of galaxies in each subsample do not change with background mass density but do change with distance to and morphology of the nearest neighbour in particular the spin parameter of latetype galaxies decreases as earlytype neighbours approach within the virial radius these results suggest that the largescale environments hardly affect the galaxy spin but the smallscale environments such as hydrodynamic galaxygalaxy interactions can play a substantial role in determining galaxy spin | [['we', 'investigate', 'environmental', 'effects', 'on', 'galaxy', 'spin', 'using', 'the', 'recent', 'public', 'data', 'of', 'manga', 'integral', 'field', 'spectroscopic', 'survey', 'containing', '2800', 'galaxies', 'we', 'measure', 'the', 'spin', 'parameter', 'of', '1830', 'galaxies', 'through', 'the', 'analysis', 'of', 'twodimensional', 'stellar', 'kinematic', 'maps', 'within', 'the', 'effective', 'radii', 'and', 'obtain', 'their', 'large', 'background', 'mass', 'density', 'from', '20', 'nearby', 'galaxies', 'and', 'smallscale', 'distance', 'to', 'and', 'morphology', 'of', 'the', 'nearest', 'neighbour', 'galaxy', 'environmental', 'parameters', 'for', '1529', 'and', '1767', 'galaxies', 'respectively', 'we', 'first', 'examine', 'the', 'mass', 'dependence', 'of', 'galaxy', 'spin', 'and', 'find', 'that', 'the', 'spin', 'parameter', 'of', 'earlytype', 'galaxies', 'decreases', 'with', 'stellar', 'mass', 'at', 'log', 'm_m_odot', 'gtrsim', '10', 'consistent', 'with', 'the', 'results', 'from', 'previous', 'studies', 'we', 'then', 'divide', 'the', 'galaxies', 'into', 'three', 'subsamples', 'using', 'their', 'stellar', 'masses', 'to', 'minimize', 'the', 'mass', 'effects', 'on', 'galaxy', 'spin', 'the', 'spin', 'parameters', 'of', 'galaxies', 'in', 'each', 'subsample', 'do', 'not', 'change', 'with', 'background', 'mass', 'density', 'but', 'do', 'change', 'with', 'distance', 'to', 'and', 'morphology', 'of', 'the', 'nearest', 'neighbour', 'in', 'particular', 'the', 'spin', 'parameter', 'of', 'latetype', 'galaxies', 'decreases', 'as', 'earlytype', 'neighbours', 'approach', 'within', 'the', 'virial', 'radius', 'these', 'results', 'suggest', 'that', 'the', 'largescale', 'environments', 'hardly', 'affect', 'the', 'galaxy', 'spin', 'but', 'the', 'smallscale', 'environments', 'such', 'as', 'hydrodynamic', 'galaxygalaxy', 'interactions', 'can', 'play', 'a', 'substantial', 'role', 'in', 'determining', 'galaxy', 'spin']] | [-0.07523380166116223, 0.10750996074101059, -0.03404503678300432, 0.09896577762711288, -0.09613062829907104, -0.0034254259270751594, 0.017148544394116307, 0.4411729937325695, -0.11944247637383977, -0.37752729380531375, 0.0070041680793937805, -0.31531551070879893, -0.030278450233777565, 0.18483479998317834, 0.042576564854975026, -0.03585045625123397, 0.026667612985760907, -0.0730359394948031, -0.0870675523332484, -0.28715587893311384, 0.34153995604895465, 0.05416132908445507, 0.16272620656106376, -0.024903485167715417, 0.08799216117833895, -0.023027417042887015, -0.09643855445723437, -0.005106645156193557, -0.20220088205528713, -0.03397167193698673, 0.23430087557530507, 0.09935867206553868, 0.2277308490464286, -0.35424712613393466, -0.17141435670212435, 0.09136233754203323, 0.21946074166358565, 0.08609059080013529, -0.08694692339453303, -0.2877462182764956, 0.050928982930321096, -0.19913579088673183, -0.15072392005222995, 0.03731523572710628, 0.015586344083541788, 0.05283476161489649, -0.21114049390679104, 0.22325805035912918, 0.03115247928036667, 0.10099121973611153, -0.09924234255174895, -0.11726669336074785, -0.1119310597786165, 0.1253547447700821, 0.03621033632580247, 0.09234710208060753, 0.27657227056047146, -0.15569088123645167, -0.00423210830692127, 0.3954591211867542, -0.058796389323270803, -0.03844216169237192, 0.22333175826106388, -0.21734906717123997, -0.1795537365722147, 0.031376655345160195, 0.22211014789917585, 0.08224541481219269, -0.16246106490567702, 0.024698068648132135, -0.010775388653118669, 0.2323286989551674, -0.022598434990768006, 0.07809394309060279, 0.32619269111254556, 0.08465253120292933, 0.08067530870493782, 0.04353393743226501, -0.2320712598756742, -0.04329863556393951, -0.1763588014075149, -0.08716222479232778, -0.16141324766195525, 0.08773581827041546, -0.2087595023786071, -0.09390082332684692, 0.36950508860318954, 0.14877162782316525, 0.2609486953746153, 0.09897066137812512, 0.28662327860936, 0.0369140035022359, 0.15589190114713064, 0.09541761895510645, 0.3009713970255762, 0.18561623908167507, 0.0170048046646518, -0.29252420032885973, 0.027521250755455924, -0.01185258373327965] |
1,802.10266 | The Conformal Bootstrap at Finite Temperature | We initiate an approach to constraining conformal field theory (CFT) data at
finite temperature using methods inspired by the conformal bootstrap for vacuum
correlation functions. We focus on thermal one- and two-point functions of
local operators on the plane. The KMS condition for thermal two-point functions
is cast as a crossing equation. By studying the analyticity properties of
thermal two-point functions, we derive a "thermal inversion formula" whose
output is the set of thermal one-point functions for all operators appearing in
a given OPE. This involves identifying a kinematic regime which is the analog
of the Regge regime for four-point functions. We demonstrate the effectiveness
of the inversion formula by recovering the spectrum and thermal one-point
functions in mean field theory, and computing thermal one-point functions for
all higher-spin currents in the critical $O(N)$ model at leading order in
$1/N$. Furthermore, we develop a systematic perturbation theory for thermal
data in the large spin, low-twist spectrum of any CFT. We explain how the
inversion formula and KMS condition may be combined to algorithmically
constrain CFTs at finite temperature. Throughout, we draw analogies to the
bootstrap for vacuum four-point functions. Finally, we discuss future
directions for the thermal conformal bootstrap program, emphasizing
applications to various types of CFTs, including those with holographic duals.
| hep-th cond-mat.stat-mech cond-mat.str-el | we initiate an approach to constraining conformal field theory cft data at finite temperature using methods inspired by the conformal bootstrap for vacuum correlation functions we focus on thermal one and twopoint functions of local operators on the plane the kms condition for thermal twopoint functions is cast as a crossing equation by studying the analyticity properties of thermal twopoint functions we derive a thermal inversion formula whose output is the set of thermal onepoint functions for all operators appearing in a given ope this involves identifying a kinematic regime which is the analog of the regge regime for fourpoint functions we demonstrate the effectiveness of the inversion formula by recovering the spectrum and thermal onepoint functions in mean field theory and computing thermal onepoint functions for all higherspin currents in the critical on model at leading order in 1n furthermore we develop a systematic perturbation theory for thermal data in the large spin lowtwist spectrum of any cft we explain how the inversion formula and kms condition may be combined to algorithmically constrain cfts at finite temperature throughout we draw analogies to the bootstrap for vacuum fourpoint functions finally we discuss future directions for the thermal conformal bootstrap program emphasizing applications to various types of cfts including those with holographic duals | [['we', 'initiate', 'an', 'approach', 'to', 'constraining', 'conformal', 'field', 'theory', 'cft', 'data', 'at', 'finite', 'temperature', 'using', 'methods', 'inspired', 'by', 'the', 'conformal', 'bootstrap', 'for', 'vacuum', 'correlation', 'functions', 'we', 'focus', 'on', 'thermal', 'one', 'and', 'twopoint', 'functions', 'of', 'local', 'operators', 'on', 'the', 'plane', 'the', 'kms', 'condition', 'for', 'thermal', 'twopoint', 'functions', 'is', 'cast', 'as', 'a', 'crossing', 'equation', 'by', 'studying', 'the', 'analyticity', 'properties', 'of', 'thermal', 'twopoint', 'functions', 'we', 'derive', 'a', 'thermal', 'inversion', 'formula', 'whose', 'output', 'is', 'the', 'set', 'of', 'thermal', 'onepoint', 'functions', 'for', 'all', 'operators', 'appearing', 'in', 'a', 'given', 'ope', 'this', 'involves', 'identifying', 'a', 'kinematic', 'regime', 'which', 'is', 'the', 'analog', 'of', 'the', 'regge', 'regime', 'for', 'fourpoint', 'functions', 'we', 'demonstrate', 'the', 'effectiveness', 'of', 'the', 'inversion', 'formula', 'by', 'recovering', 'the', 'spectrum', 'and', 'thermal', 'onepoint', 'functions', 'in', 'mean', 'field', 'theory', 'and', 'computing', 'thermal', 'onepoint', 'functions', 'for', 'all', 'higherspin', 'currents', 'in', 'the', 'critical', 'on', 'model', 'at', 'leading', 'order', 'in', '1n', 'furthermore', 'we', 'develop', 'a', 'systematic', 'perturbation', 'theory', 'for', 'thermal', 'data', 'in', 'the', 'large', 'spin', 'lowtwist', 'spectrum', 'of', 'any', 'cft', 'we', 'explain', 'how', 'the', 'inversion', 'formula', 'and', 'kms', 'condition', 'may', 'be', 'combined', 'to', 'algorithmically', 'constrain', 'cfts', 'at', 'finite', 'temperature', 'throughout', 'we', 'draw', 'analogies', 'to', 'the', 'bootstrap', 'for', 'vacuum', 'fourpoint', 'functions', 'finally', 'we', 'discuss', 'future', 'directions', 'for', 'the', 'thermal', 'conformal', 'bootstrap', 'program', 'emphasizing', 'applications', 'to', 'various', 'types', 'of', 'cfts', 'including', 'those', 'with', 'holographic', 'duals']] | [-0.09824358550743399, 0.12656867814917058, -0.11266087915668908, 0.10143922437843095, -0.05802389855553965, -0.09608242959799289, 0.002059449739665923, 0.3328212107304413, -0.21461340238922827, -0.2112750074940941, 0.10343614210632864, -0.2865822276683145, -0.13711660125809258, 0.19191829816954678, 0.01635043614464525, 0.08970718416252937, -0.02871076027880383, -0.0006497924379404122, -0.1475282311704345, -0.20362394484547872, 0.3517736136511639, 0.03601853172537557, 0.2910122146997689, 0.10668942035160411, 0.08197891482116734, 0.047939744499904846, -0.03442180043933869, 0.009010101661915886, -0.16385177438358678, 0.082825760383565, 0.24275279621884968, 0.08754724317993881, 0.19274375114592138, -0.4383444539867165, -0.20685609349963294, 0.1036379470079431, 0.12186821557744737, 0.13181769943926308, 0.010175131749630998, -0.23043310516447676, 0.07996680159841761, -0.14254969385148014, -0.201092316961066, -0.11067892455659206, -0.018036957613911955, -0.06628094197767323, -0.28841953771519896, 0.11883376754149441, -0.010504017204434668, 0.07218075875563644, -0.06163202660705594, -0.10315221078115652, -0.032197804531740176, 0.1012626463520866, 0.054954664228303064, 0.030183597093765842, 0.15120878363948456, -0.190673293743362, -0.11116777093153032, 0.2971818922247552, -0.07240133520664858, -0.21009972227309165, 0.12255563266504715, -0.19124632235837138, -0.1617833466326456, 0.0622890996150849, 0.1366801183732553, 0.14073834393225318, -0.16045826176728753, 0.15689439562996804, -0.009073872269259245, 0.08459045185919374, 0.06940983141821001, 0.04693103589667051, 0.2508286375252274, 0.0541180736662255, 0.029976671146696776, 0.21819155564547132, -0.041372066877492134, -0.07861181581579094, -0.38445649160540074, -0.12146404051879571, -0.18985655692337583, 0.06260599847662293, -0.1708754220501833, -0.21443061060073534, 0.4196045322264258, 0.16364436946884878, 0.1803974077263869, 0.1217379226041428, 0.25939897110716603, 0.1878517644615183, 0.09291496223624425, 0.07763394759305846, 0.1963883139396095, 0.18648612174708662, 0.0783407112359515, -0.24660106332392223, -0.02911950829681627, 0.1625393501955186] |
1,802.10267 | Next Generation New Radio Small Cell Enhancement: Architectural Options,
Functionality and Performance Aspects | The 3rd generation partnership project (3GPP) has been engaged in further
advancing the evolved universal mobile telecommunications system (UMTS)
terrestrial radio access network (E-UTRAN) and UTRAN based radio access network
technologies. New radio (NR) is the 3rd generation partnership project (3GPP)
endeavor for outlining and standardization of the 5th generation (5G) advanced
radio access technology. 3GPP has released the first set of 5G NR standards,
i.e., the non-standalone 5G radio specifications. As long-term evolution (LTE)
technology is massively deployed and broadly accepted, the transition from LTE
to 5G is very critical, and it is of maximal importance that the backward
compatibility of 5G with LTE is considered. 3GPP has identified several
architecture options for 5G. This article gives an overview of the NR
architecture options, their deployment scenarios, and the key migration paths.
The LTE-NR dual connectivity (DC) is presented. This DC scenario is unique in
the sense that DC is being endowed for two different generations of 3GPP radio
access technologies. We, further, present the integration of multipath
transmission control protocol (MPTCP) with LTE-NR DC and DC-like aggregation,
i.e., 3GPP-non-3GPP interworking to bring in the advantages of MPTCP in terms
of link robustness, reliability and dynamic mapping between the traffic flows
and the available paths. Finally, we discuss the future research and
standardization directions of the next-generation networks.
| cs.IT math.IT | the 3rd generation partnership project 3gpp has been engaged in further advancing the evolved universal mobile telecommunications system umts terrestrial radio access network eutran and utran based radio access network technologies new radio nr is the 3rd generation partnership project 3gpp endeavor for outlining and standardization of the 5th generation 5g advanced radio access technology 3gpp has released the first set of 5g nr standards ie the nonstandalone 5g radio specifications as longterm evolution lte technology is massively deployed and broadly accepted the transition from lte to 5g is very critical and it is of maximal importance that the backward compatibility of 5g with lte is considered 3gpp has identified several architecture options for 5g this article gives an overview of the nr architecture options their deployment scenarios and the key migration paths the ltenr dual connectivity dc is presented this dc scenario is unique in the sense that dc is being endowed for two different generations of 3gpp radio access technologies we further present the integration of multipath transmission control protocol mptcp with ltenr dc and dclike aggregation ie 3gppnon3gpp interworking to bring in the advantages of mptcp in terms of link robustness reliability and dynamic mapping between the traffic flows and the available paths finally we discuss the future research and standardization directions of the nextgeneration networks | [['the', '3rd', 'generation', 'partnership', 'project', '3gpp', 'has', 'been', 'engaged', 'in', 'further', 'advancing', 'the', 'evolved', 'universal', 'mobile', 'telecommunications', 'system', 'umts', 'terrestrial', 'radio', 'access', 'network', 'eutran', 'and', 'utran', 'based', 'radio', 'access', 'network', 'technologies', 'new', 'radio', 'nr', 'is', 'the', '3rd', 'generation', 'partnership', 'project', '3gpp', 'endeavor', 'for', 'outlining', 'and', 'standardization', 'of', 'the', '5th', 'generation', '5g', 'advanced', 'radio', 'access', 'technology', '3gpp', 'has', 'released', 'the', 'first', 'set', 'of', '5g', 'nr', 'standards', 'ie', 'the', 'nonstandalone', '5g', 'radio', 'specifications', 'as', 'longterm', 'evolution', 'lte', 'technology', 'is', 'massively', 'deployed', 'and', 'broadly', 'accepted', 'the', 'transition', 'from', 'lte', 'to', '5g', 'is', 'very', 'critical', 'and', 'it', 'is', 'of', 'maximal', 'importance', 'that', 'the', 'backward', 'compatibility', 'of', '5g', 'with', 'lte', 'is', 'considered', '3gpp', 'has', 'identified', 'several', 'architecture', 'options', 'for', '5g', 'this', 'article', 'gives', 'an', 'overview', 'of', 'the', 'nr', 'architecture', 'options', 'their', 'deployment', 'scenarios', 'and', 'the', 'key', 'migration', 'paths', 'the', 'ltenr', 'dual', 'connectivity', 'dc', 'is', 'presented', 'this', 'dc', 'scenario', 'is', 'unique', 'in', 'the', 'sense', 'that', 'dc', 'is', 'being', 'endowed', 'for', 'two', 'different', 'generations', 'of', '3gpp', 'radio', 'access', 'technologies', 'we', 'further', 'present', 'the', 'integration', 'of', 'multipath', 'transmission', 'control', 'protocol', 'mptcp', 'with', 'ltenr', 'dc', 'and', 'dclike', 'aggregation', 'ie', '3gppnon3gpp', 'interworking', 'to', 'bring', 'in', 'the', 'advantages', 'of', 'mptcp', 'in', 'terms', 'of', 'link', 'robustness', 'reliability', 'and', 'dynamic', 'mapping', 'between', 'the', 'traffic', 'flows', 'and', 'the', 'available', 'paths', 'finally', 'we', 'discuss', 'the', 'future', 'research', 'and', 'standardization', 'directions', 'of', 'the', 'nextgeneration', 'networks']] | [-0.27071529918485826, 0.03380148898939408, 0.05149193024459544, 0.005389698834635072, -0.0848837411719781, -0.19023762741497774, 0.06164014900098839, 0.4028527177520481, -0.23845988028451032, -0.23515459061971922, 0.12324612656856358, -0.23305162874229707, -0.17541266926903137, 0.20102019821612838, -0.05669075211711193, 0.06914928619257402, 0.05246981190290179, -0.07603017554592184, -0.005925104878744452, -0.24236031893658247, 0.27779871232031805, 0.13703787097521017, 0.4261410472424867, 0.06833845887446838, 0.012148949330751325, -0.080514572225205, -0.10319729432263608, -0.09218346685861968, -0.0573789192007132, 0.13936187659976174, 0.3208069126373113, 0.24023283691174993, 0.30289345264856754, -0.43346069251654995, -0.2640170190273456, 0.04575924050243803, 0.15486534871160984, -0.0016956708170998264, -0.06146869275876334, -0.28302386337060464, 0.1358536327923998, -0.3403622627634328, -0.11916223941195948, 0.05391593336044623, 0.0036614711752747287, 0.10302572962806118, -0.2696785912236872, -0.07325777557444597, -0.03585529984455958, 0.066517252084786, -0.032759190956786484, -0.07202603814614053, -0.01180664708011482, 0.21734811909859694, 0.0015721338333238458, 0.051744503523835236, 0.08088391723615192, -0.1036426353958619, -0.17948574310183926, 0.45134208671433823, -0.0020589256222456028, -0.08597692790629229, 0.15514449634646096, -0.07029983863250097, -0.1519872683150685, 0.04181949950824601, 0.20095531857012827, -0.028246262039718143, -0.2447546934883849, 0.05109384852246176, 0.058716843558361695, 0.11730286837588261, 0.06534656035350941, 0.11609498172027755, 0.24692203348694902, 0.30894240520527244, 0.14459916981026757, 0.07346177157757917, -0.11305057403233619, -0.1280152552401507, -0.23606173579576709, -0.1397613632621707, -0.16229472408385973, 0.028251584861952235, -0.034690470020918004, -0.1037676193075858, 0.4152415298415182, 0.18359916137330268, -0.006169890342149096, 0.08249103362582397, 0.4183933681528578, 0.05986860118148588, 0.14363482782394218, 0.10622277811643484, 0.2059308458250803, 0.06857637254884161, 0.27890919587037094, -0.15033309753468269, 0.06675740278942484, 0.002840524121786647] |
1,802.10268 | Microscopic theory of a superconducting gap in the quasi-one-dimensional
organic conductor (TMTSF)$_2$ClO$_4$: Model derivation and two-particle
self-consistent analysis | We present a first-principles band calculation for the quasi-one-dimensional
(Q1D) organic superconductor (TMTSF)$_2$ClO$_4$. An effective tight-binding
model with the TMTSF molecule to be regarded as the site is derived from a
calculation based on maximally localized Wannier orbitals. We apply a
two-particle self-consistent (TPSC) analysis by using a four-site Hubbard
model, which is composed of the tight-binding model and an on-site
(intramolecular) repulsive interaction, which serves as a variable parameter.
We assume that the pairing mechanism is mediated by the spin fluctuation, and
the sign of the superconducting gap changes between the inner and outer Fermi
surfaces, which correspond to a d-wave gap function in a simplified Q1D model.
With the parameters we adopt, the critical temperature for superconductivity
estimated by the TPSC approach is approximately 1K which is consistent with
experiment.
| cond-mat.supr-con | we present a firstprinciples band calculation for the quasionedimensional q1d organic superconductor tmtsf_2clo_4 an effective tightbinding model with the tmtsf molecule to be regarded as the site is derived from a calculation based on maximally localized wannier orbitals we apply a twoparticle selfconsistent tpsc analysis by using a foursite hubbard model which is composed of the tightbinding model and an onsite intramolecular repulsive interaction which serves as a variable parameter we assume that the pairing mechanism is mediated by the spin fluctuation and the sign of the superconducting gap changes between the inner and outer fermi surfaces which correspond to a dwave gap function in a simplified q1d model with the parameters we adopt the critical temperature for superconductivity estimated by the tpsc approach is approximately 1k which is consistent with experiment | [['we', 'present', 'a', 'firstprinciples', 'band', 'calculation', 'for', 'the', 'quasionedimensional', 'q1d', 'organic', 'superconductor', 'tmtsf_2clo_4', 'an', 'effective', 'tightbinding', 'model', 'with', 'the', 'tmtsf', 'molecule', 'to', 'be', 'regarded', 'as', 'the', 'site', 'is', 'derived', 'from', 'a', 'calculation', 'based', 'on', 'maximally', 'localized', 'wannier', 'orbitals', 'we', 'apply', 'a', 'twoparticle', 'selfconsistent', 'tpsc', 'analysis', 'by', 'using', 'a', 'foursite', 'hubbard', 'model', 'which', 'is', 'composed', 'of', 'the', 'tightbinding', 'model', 'and', 'an', 'onsite', 'intramolecular', 'repulsive', 'interaction', 'which', 'serves', 'as', 'a', 'variable', 'parameter', 'we', 'assume', 'that', 'the', 'pairing', 'mechanism', 'is', 'mediated', 'by', 'the', 'spin', 'fluctuation', 'and', 'the', 'sign', 'of', 'the', 'superconducting', 'gap', 'changes', 'between', 'the', 'inner', 'and', 'outer', 'fermi', 'surfaces', 'which', 'correspond', 'to', 'a', 'dwave', 'gap', 'function', 'in', 'a', 'simplified', 'q1d', 'model', 'with', 'the', 'parameters', 'we', 'adopt', 'the', 'critical', 'temperature', 'for', 'superconductivity', 'estimated', 'by', 'the', 'tpsc', 'approach', 'is', 'approximately', '1k', 'which', 'is', 'consistent', 'with', 'experiment']] | [-0.1576333506950918, 0.15580717004173272, -0.05753764874217185, 0.07158601551164986, -0.03591732708313926, -0.18448111567660375, 0.09313348582663546, 0.3543404834697757, -0.2220058017128119, -0.2604396066268567, -0.032565949527920704, -0.31414028152005014, -0.14509206079652137, 0.1316168060681472, 0.0913459061729637, -0.0010506414885943134, -0.01125480416477799, -0.03434034043951242, -0.1182066609317465, -0.16145395349259628, 0.31455956623452064, 0.045984051606589645, 0.25682086755070044, 0.09021298960204038, 0.023183521698229015, 0.0612987948398134, 0.13923596766438673, -0.002692000774638445, -0.15961118325950255, 0.10631401840361253, 0.2456821331240159, -0.09360617361468912, 0.18526842581305766, -0.44179504777650547, -0.23867592267042986, 0.0005235090696563324, 0.13387377908590928, 0.15887960375667634, -0.023146659808513836, -0.28359303193053964, 0.00015764023357240313, -0.2353622075099724, -0.1327333947128588, -0.08373937799567074, -0.025634066053581508, -0.01661221073432402, -0.2994990447133949, 0.11944570344459146, 0.010394376822549737, 0.06866331587132829, -0.09929885900893362, -0.1298420583921005, -0.0675260259233641, 0.028304435714909978, 0.02396675718023978, 0.10022606142218027, 0.13749556673803565, -0.0781470172788073, -0.08623490482568741, 0.36852413306548965, -0.09131671492518349, -0.17134674849292036, 0.14307378847363658, -0.08034672895375865, -0.05441601211593176, 0.11949847493506792, 0.06854117050357728, 0.07989972425187289, -0.18192798800009768, 0.10701566852962556, -0.08556265826623669, 0.21961136426155767, -0.04864154533116204, 0.009738196692937478, 0.24256908154524298, 0.2346510401870491, 0.037922453255195054, 0.15722450241358302, -0.1412716186711226, -0.10833557420868822, -0.28162660128013656, -0.13608153878929885, -0.28031159175037773, 0.024892418139973994, -0.04795933813599704, -0.20270588628905403, 0.43272404436191375, 0.13886252629648274, 0.20784038771296653, -0.0278301852910469, 0.20972769295401644, 0.14400962369594103, 0.08581943234435818, 0.052571840291475935, 0.21767851849312359, 0.13510097935795784, 0.026145899192091416, -0.29074455833831575, 0.04746061867229979, 0.08958194001664224] |
1,802.10269 | Selective Experience Replay for Lifelong Learning | Deep reinforcement learning has emerged as a powerful tool for a variety of
learning tasks, however deep nets typically exhibit forgetting when learning
multiple tasks in sequence. To mitigate forgetting, we propose an experience
replay process that augments the standard FIFO buffer and selectively stores
experiences in a long-term memory. We explore four strategies for selecting
which experiences will be stored: favoring surprise, favoring reward, matching
the global training distribution, and maximizing coverage of the state space.
We show that distribution matching successfully prevents catastrophic
forgetting, and is consistently the best approach on all domains tested. While
distribution matching has better and more consistent performance, we identify
one case in which coverage maximization is beneficial - when tasks that receive
less trained are more important. Overall, our results show that selective
experience replay, when suitable selection algorithms are employed, can prevent
catastrophic forgetting.
| cs.AI | deep reinforcement learning has emerged as a powerful tool for a variety of learning tasks however deep nets typically exhibit forgetting when learning multiple tasks in sequence to mitigate forgetting we propose an experience replay process that augments the standard fifo buffer and selectively stores experiences in a longterm memory we explore four strategies for selecting which experiences will be stored favoring surprise favoring reward matching the global training distribution and maximizing coverage of the state space we show that distribution matching successfully prevents catastrophic forgetting and is consistently the best approach on all domains tested while distribution matching has better and more consistent performance we identify one case in which coverage maximization is beneficial when tasks that receive less trained are more important overall our results show that selective experience replay when suitable selection algorithms are employed can prevent catastrophic forgetting | [['deep', 'reinforcement', 'learning', 'has', 'emerged', 'as', 'a', 'powerful', 'tool', 'for', 'a', 'variety', 'of', 'learning', 'tasks', 'however', 'deep', 'nets', 'typically', 'exhibit', 'forgetting', 'when', 'learning', 'multiple', 'tasks', 'in', 'sequence', 'to', 'mitigate', 'forgetting', 'we', 'propose', 'an', 'experience', 'replay', 'process', 'that', 'augments', 'the', 'standard', 'fifo', 'buffer', 'and', 'selectively', 'stores', 'experiences', 'in', 'a', 'longterm', 'memory', 'we', 'explore', 'four', 'strategies', 'for', 'selecting', 'which', 'experiences', 'will', 'be', 'stored', 'favoring', 'surprise', 'favoring', 'reward', 'matching', 'the', 'global', 'training', 'distribution', 'and', 'maximizing', 'coverage', 'of', 'the', 'state', 'space', 'we', 'show', 'that', 'distribution', 'matching', 'successfully', 'prevents', 'catastrophic', 'forgetting', 'and', 'is', 'consistently', 'the', 'best', 'approach', 'on', 'all', 'domains', 'tested', 'while', 'distribution', 'matching', 'has', 'better', 'and', 'more', 'consistent', 'performance', 'we', 'identify', 'one', 'case', 'in', 'which', 'coverage', 'maximization', 'is', 'beneficial', 'when', 'tasks', 'that', 'receive', 'less', 'trained', 'are', 'more', 'important', 'overall', 'our', 'results', 'show', 'that', 'selective', 'experience', 'replay', 'when', 'suitable', 'selection', 'algorithms', 'are', 'employed', 'can', 'prevent', 'catastrophic', 'forgetting']] | [-0.06362495191303462, 0.05995491803978311, -0.08943949931655341, 0.11042806590810382, -0.14025714304330955, -0.21281979190231576, 0.07689127523179862, 0.48193715806578247, -0.26345444410304786, -0.32938556244570605, 0.0817912600903352, -0.2538900101445878, -0.16055343106625156, 0.17206932956510237, -0.1658764861222409, 0.0610900418545959, 0.1286783342034077, 0.03219896641113196, -0.031108875433474938, -0.31187924509212167, 0.3118243820893145, 0.05712318840448115, 0.36220512981854486, -0.011652373908822176, 0.101376721148894, 0.02200479147640962, 0.010870041056785365, -0.023713594270356877, -0.03268196363707932, 0.08204090592621917, 0.3047625567095066, 0.23905056233281716, 0.4049390056728005, -0.4166615934662101, -0.25959505332292804, 0.14112951771133173, 0.17916155426146488, 0.11004019846719965, -0.07776393066016911, -0.267877302235845, 0.11567165869170092, -0.2021215276025698, 0.02222301180697453, -0.1629886380068853, -0.03865947736620667, -0.006901862703978648, -0.3275231749448978, -0.01823821961617386, 0.1025344503528609, 0.020313440384687593, -0.048575856568764, -0.13021726231080477, 0.02318780055486033, 0.1745031844629024, 0.0506853555838666, 0.06170152438456901, 0.17308620942599126, -0.17956354569407626, -0.1620998075428668, 0.3402544309739286, -0.04835114368683541, -0.15233940319453274, 0.21201615251968026, -0.03544721720267979, -0.13101552265145305, 0.13242450259170088, 0.2172818035805519, 0.1195406280720318, -0.15835060081663985, -0.04980005930066371, 0.00197509015766038, 0.16580108951278766, 0.07167556643089228, 0.025873310536861052, 0.1732099714064249, 0.2526370989712952, 0.0960403487355199, 0.1483425581835958, -0.08522781628244688, -0.12894090815057033, -0.18195140970711807, -0.08824754601121473, -0.16111770904422934, -0.008026568483049706, -0.09649493762998658, -0.11526268822121316, 0.32791790075954313, 0.20568940987561266, 0.23113960738647993, 0.12011059445761879, 0.3428067509740801, 0.05437094408979403, 0.13184346133370844, 0.11533142630876579, 0.18943635527943065, -0.04199784395652233, 0.12299665256278773, -0.18620466484202886, 0.19160459288986217, -0.022096698703637844] |
1,802.1027 | Stationary probability vectors of higher-order two-dimensional
transition probability tensors | In this paper we investigate stationary probability vectors of higher-order
two-dimensional symmetric transition probability tensors. We show that there
are two special symmetric transition probability tensors of order $m$ dimension
2, which have and only have two stationary probability vectors; and any other
symmetric transition probability tensor of order $m$ dimension 2 has a unique
stationary probability vector. As a byproduct, we obtain that any symmetric
transition probability tensor of order $m$ dimension 2 has a unique positive
stationary probability vector; and that any symmetric irreducible transition
probability tensor of order $m$ dimension 2 has a unique stationary probability
vector.
| math.SP | in this paper we investigate stationary probability vectors of higherorder twodimensional symmetric transition probability tensors we show that there are two special symmetric transition probability tensors of order m dimension 2 which have and only have two stationary probability vectors and any other symmetric transition probability tensor of order m dimension 2 has a unique stationary probability vector as a byproduct we obtain that any symmetric transition probability tensor of order m dimension 2 has a unique positive stationary probability vector and that any symmetric irreducible transition probability tensor of order m dimension 2 has a unique stationary probability vector | [['in', 'this', 'paper', 'we', 'investigate', 'stationary', 'probability', 'vectors', 'of', 'higherorder', 'twodimensional', 'symmetric', 'transition', 'probability', 'tensors', 'we', 'show', 'that', 'there', 'are', 'two', 'special', 'symmetric', 'transition', 'probability', 'tensors', 'of', 'order', 'm', 'dimension', '2', 'which', 'have', 'and', 'only', 'have', 'two', 'stationary', 'probability', 'vectors', 'and', 'any', 'other', 'symmetric', 'transition', 'probability', 'tensor', 'of', 'order', 'm', 'dimension', '2', 'has', 'a', 'unique', 'stationary', 'probability', 'vector', 'as', 'a', 'byproduct', 'we', 'obtain', 'that', 'any', 'symmetric', 'transition', 'probability', 'tensor', 'of', 'order', 'm', 'dimension', '2', 'has', 'a', 'unique', 'positive', 'stationary', 'probability', 'vector', 'and', 'that', 'any', 'symmetric', 'irreducible', 'transition', 'probability', 'tensor', 'of', 'order', 'm', 'dimension', '2', 'has', 'a', 'unique', 'stationary', 'probability', 'vector']] | [-0.17818790359422565, 0.18582827262580395, -0.030847724080085754, 0.020202572651905937, -0.046231415513902904, -0.171841544957133, -0.0026059848803561183, 0.3757339369133115, -0.18933063374832274, -0.1413451481424272, 0.0778891335678054, -0.2799335126415826, -0.19916231794282793, -0.006727145621553064, 0.0403053736127913, 0.09909481710754335, -0.021953625464811923, 0.18869036147370935, -0.14032590739661827, -0.22041307689622044, 0.4223789612576365, -0.04827626220881939, 0.2896745324600488, -0.01623263814486563, 0.16660119463689627, -0.020545281479135157, 0.02090475151897408, 0.05231339740566909, -0.15248693412977446, 0.05164568095467985, 0.2779515262669884, 0.1519126515928656, 0.2504584603756666, -0.32779753535985945, -0.19453427069820464, 0.22873971204040572, 0.10098667107988149, 0.07574817504151725, -0.06312222100794315, -0.280037347022444, 0.16287121742963792, -0.21838288282975554, -0.17625545033253728, -0.1165546505106613, 0.11815916595980525, 0.0032191180624067785, -0.3377359673008323, 0.05930919202975929, 0.15228826267644763, -0.015793555276468398, -0.050163371255621314, -0.15356092090718448, -0.046049652807414534, 0.1319834701856598, 0.01836508312262595, 0.08728341333917342, 0.030613454662961885, -0.06665893141878769, -0.15920147116295993, 0.32043698312714697, -0.09858624949585647, -0.26408536462113263, 0.16323640229180456, -0.22572042409330606, -0.10371377366129308, 0.18890436912071892, 0.19920083184726536, 0.13931271001696588, -0.05284737947396934, 0.15858360998157878, -0.09782725353725255, 0.15562012206646614, 0.12830410067457707, 0.029362618201412262, 0.16673903580754995, 0.033283729944378136, 0.1356105706980452, 0.10707391941978131, -0.09253588696476073, -0.0952434297464788, -0.3129421102255583, -0.2269826679304242, -0.24307306779082866, 0.1753392642363906, -0.16394159626637703, -0.15856787826865912, 0.36119055297225716, 0.05210622267797589, 0.20571410780481528, 0.11145941941183991, 0.2267047174507752, 0.15850033393944613, -0.05813627992756665, 0.10980096132494509, 0.1304055867344141, 0.17459441917482763, -0.003268578201532364, -0.0795443558972329, 0.06392879686783999, 0.11324904619716109] |
1,802.10271 | Multimodal Sensor-Based Semantic 3D Mapping for a Large-Scale
Environment | Semantic 3D mapping is one of the most important fields in robotics, and has
been used in many applications, such as robot navigation, surveillance, and
virtual reality. In general, semantic 3D mapping is mainly composed of 3D
reconstruction and semantic segmentation. As these technologies evolve, there
has been great progress in semantic 3D mapping in recent years. Furthermore,
the number of robotic applications requiring semantic information in 3D mapping
to perform high-level tasks has increased, and many studies on semantic 3D
mapping have been published. Existing methods use a camera for both 3D
reconstruction and semantic segmentation. However, this is not suitable for
large-scale environments and has the disadvantage of high computational
complexity. To address this problem, we propose a multimodal sensor-based
semantic 3D mapping system using a 3D Lidar combined with a camera. In this
study, we build a 3D map by estimating odometry based on a global positioning
system (GPS) and an inertial measurement unit (IMU), and use the latest 2D
convolutional neural network (CNN) for semantic segmentation. To build a
semantic 3D map, we integrate the 3D map with semantic information by using
coordinate transformation and Bayes' update scheme. In order to improve the
semantic 3D map, we propose a 3D refinement process to correct wrongly
segmented voxels and remove traces of moving vehicles in the 3D map. Through
experiments on challenging sequences, we demonstrate that our method
outperforms state-of-the-art methods in terms of accuracy and intersection over
union (IoU). Thus, our method can be used for various applications that require
semantic information in 3D map.
| cs.RO | semantic 3d mapping is one of the most important fields in robotics and has been used in many applications such as robot navigation surveillance and virtual reality in general semantic 3d mapping is mainly composed of 3d reconstruction and semantic segmentation as these technologies evolve there has been great progress in semantic 3d mapping in recent years furthermore the number of robotic applications requiring semantic information in 3d mapping to perform highlevel tasks has increased and many studies on semantic 3d mapping have been published existing methods use a camera for both 3d reconstruction and semantic segmentation however this is not suitable for largescale environments and has the disadvantage of high computational complexity to address this problem we propose a multimodal sensorbased semantic 3d mapping system using a 3d lidar combined with a camera in this study we build a 3d map by estimating odometry based on a global positioning system gps and an inertial measurement unit imu and use the latest 2d convolutional neural network cnn for semantic segmentation to build a semantic 3d map we integrate the 3d map with semantic information by using coordinate transformation and bayes update scheme in order to improve the semantic 3d map we propose a 3d refinement process to correct wrongly segmented voxels and remove traces of moving vehicles in the 3d map through experiments on challenging sequences we demonstrate that our method outperforms stateoftheart methods in terms of accuracy and intersection over union iou thus our method can be used for various applications that require semantic information in 3d map | [['semantic', '3d', 'mapping', 'is', 'one', 'of', 'the', 'most', 'important', 'fields', 'in', 'robotics', 'and', 'has', 'been', 'used', 'in', 'many', 'applications', 'such', 'as', 'robot', 'navigation', 'surveillance', 'and', 'virtual', 'reality', 'in', 'general', 'semantic', '3d', 'mapping', 'is', 'mainly', 'composed', 'of', '3d', 'reconstruction', 'and', 'semantic', 'segmentation', 'as', 'these', 'technologies', 'evolve', 'there', 'has', 'been', 'great', 'progress', 'in', 'semantic', '3d', 'mapping', 'in', 'recent', 'years', 'furthermore', 'the', 'number', 'of', 'robotic', 'applications', 'requiring', 'semantic', 'information', 'in', '3d', 'mapping', 'to', 'perform', 'highlevel', 'tasks', 'has', 'increased', 'and', 'many', 'studies', 'on', 'semantic', '3d', 'mapping', 'have', 'been', 'published', 'existing', 'methods', 'use', 'a', 'camera', 'for', 'both', '3d', 'reconstruction', 'and', 'semantic', 'segmentation', 'however', 'this', 'is', 'not', 'suitable', 'for', 'largescale', 'environments', 'and', 'has', 'the', 'disadvantage', 'of', 'high', 'computational', 'complexity', 'to', 'address', 'this', 'problem', 'we', 'propose', 'a', 'multimodal', 'sensorbased', 'semantic', '3d', 'mapping', 'system', 'using', 'a', '3d', 'lidar', 'combined', 'with', 'a', 'camera', 'in', 'this', 'study', 'we', 'build', 'a', '3d', 'map', 'by', 'estimating', 'odometry', 'based', 'on', 'a', 'global', 'positioning', 'system', 'gps', 'and', 'an', 'inertial', 'measurement', 'unit', 'imu', 'and', 'use', 'the', 'latest', '2d', 'convolutional', 'neural', 'network', 'cnn', 'for', 'semantic', 'segmentation', 'to', 'build', 'a', 'semantic', '3d', 'map', 'we', 'integrate', 'the', '3d', 'map', 'with', 'semantic', 'information', 'by', 'using', 'coordinate', 'transformation', 'and', 'bayes', 'update', 'scheme', 'in', 'order', 'to', 'improve', 'the', 'semantic', '3d', 'map', 'we', 'propose', 'a', '3d', 'refinement', 'process', 'to', 'correct', 'wrongly', 'segmented', 'voxels', 'and', 'remove', 'traces', 'of', 'moving', 'vehicles', 'in', 'the', '3d', 'map', 'through', 'experiments', 'on', 'challenging', 'sequences', 'we', 'demonstrate', 'that', 'our', 'method', 'outperforms', 'stateoftheart', 'methods', 'in', 'terms', 'of', 'accuracy', 'and', 'intersection', 'over', 'union', 'iou', 'thus', 'our', 'method', 'can', 'be', 'used', 'for', 'various', 'applications', 'that', 'require', 'semantic', 'information', 'in', '3d', 'map']] | [-0.03309367507207117, -0.05031902802712329, -0.01802688733850782, 0.022990309657846385, -0.09541963985455888, -0.1364110176573763, -0.01662117027748164, 0.47798111104194263, -0.25792708321479885, -0.3593182386722574, 0.09184675663619744, -0.25908310871286333, -0.1934738110743722, 0.19606996678412825, -0.17439060971032086, 0.14999673741736583, 0.1554357282723872, 0.022211227993009806, -0.10855729867341032, -0.19897443297387435, 0.3021889182066538, 0.004858202282986585, 0.34563213898207, 0.013342530352897711, 0.1796002095092347, 0.006200899650490192, -0.07492441230167682, 0.030513051129575516, -0.06543335520769568, 0.20136714498755165, 0.33483004771194574, 0.22222792541942626, 0.278823717500885, -0.45679103187105574, -0.2779807187504455, 0.0725341097237794, 0.16942266451687513, 0.10021088729004832, -0.07349727784946891, -0.3921474524302602, 0.07923902557402289, -0.1622893423917182, 0.031240200373959012, -0.14455603942334377, 0.0018734214683584726, -0.017142446888305074, -0.2617502046432562, 0.00028466024803450337, 0.038944852190059845, 0.1276107320137696, -0.07311361672403471, -0.026488419433850722, 0.008746109921062674, 0.26326061349405283, -0.046371934799819964, 0.13633744391877003, 0.14334753310554174, -0.20831902417476544, -0.12931558288252665, 0.39971294722962103, -0.02970735978067252, -0.26305605283521233, 0.23503968489003946, -0.05122384835667477, -0.18697639790626105, 0.12479163124675513, 0.2237174604447652, 0.106281846008375, -0.155414939146043, 0.055698415265610965, -0.05847849016182096, 0.18075272403603498, 0.037318545365778, -0.024502782987360573, 0.19893758261439654, 0.267786774527224, 0.08001589339876432, 0.10613472498171247, -0.2015365574908493, -0.033787073235793406, -0.1635414213337666, -0.1818600391203171, -0.1975000415925066, -0.047119437659311675, -0.09356792965971525, -0.1475033887471414, 0.3813250675095796, 0.27745133419395296, 0.19834436452228388, 0.04275991322659675, 0.3977695037700725, 0.02290155175124011, 0.12145772848042756, 0.057103954929800915, 0.1677386960640377, 0.005728945461493776, 0.1548431391542792, -0.12152553872388705, 0.04704698840916718, 0.138131849161209] |
1,802.10272 | Large-time asymptotics of a fractional drift-diffusion-Poisson system
via the entropy method | The self-similar asymptotics for solutions to the drift-diffusion equation
with fractional dissipation, coupled to the Poisson equation, is analyzed in
the whole space. It is shown that in the subcritical and supercritical cases,
the solutions converge to the fractional heat kernel with algebraic rate. The
proof is based on the entropy method and leads to a decay rate in the
$L^1(\mathbb{R}^d)$ norm. The technique is applied to other semilinear
equations with fractional dissipation.
| math.AP | the selfsimilar asymptotics for solutions to the driftdiffusion equation with fractional dissipation coupled to the poisson equation is analyzed in the whole space it is shown that in the subcritical and supercritical cases the solutions converge to the fractional heat kernel with algebraic rate the proof is based on the entropy method and leads to a decay rate in the l1mathbbrd norm the technique is applied to other semilinear equations with fractional dissipation | [['the', 'selfsimilar', 'asymptotics', 'for', 'solutions', 'to', 'the', 'driftdiffusion', 'equation', 'with', 'fractional', 'dissipation', 'coupled', 'to', 'the', 'poisson', 'equation', 'is', 'analyzed', 'in', 'the', 'whole', 'space', 'it', 'is', 'shown', 'that', 'in', 'the', 'subcritical', 'and', 'supercritical', 'cases', 'the', 'solutions', 'converge', 'to', 'the', 'fractional', 'heat', 'kernel', 'with', 'algebraic', 'rate', 'the', 'proof', 'is', 'based', 'on', 'the', 'entropy', 'method', 'and', 'leads', 'to', 'a', 'decay', 'rate', 'in', 'the', 'l1mathbbrd', 'norm', 'the', 'technique', 'is', 'applied', 'to', 'other', 'semilinear', 'equations', 'with', 'fractional', 'dissipation']] | [-0.09908093115129853, 0.05376684126023152, -0.0941548119749625, 0.06646092791646106, -0.10296680063825764, -0.13118082422074184, -0.015730947512839856, 0.2553140955709227, -0.3204400303697035, -0.203179953517775, 0.14188852253503945, -0.3140138949790638, -0.09869112210565131, 0.2386959635792938, -0.03046308890342304, 0.12436296203339549, 0.03246649378617231, 0.06764616680727022, -0.04734358446965989, -0.2366901942567058, 0.3471639482942346, 0.00799548472851923, 0.29652729283456936, 0.02487550972488849, 0.11356958809423529, -0.11300012062954372, -0.005262723147920142, -0.029545665726812966, -0.21212217134269265, 0.06982269753025819, 0.21692189201712608, 0.0028033224827520653, 0.2720211378923834, -0.398089670104115, -0.2307299537399197, 0.11384155319314705, 0.13102585702420097, 0.08922688870958678, -0.010322668489183567, -0.2805137384478768, 0.08210330057174783, -0.10831347178055407, -0.17694949113113217, -0.05389791730255501, 0.05159589898300498, 0.10336436170523297, -0.3177825612054296, 0.1798547910118144, 0.0908243890615716, -0.0921961595495678, -0.14055998668661468, -0.05491683434229344, -0.025415166255648006, 0.025187096067334283, 0.08578826829931405, 0.034601436883262164, 0.06431868560101887, -0.12019544146470215, -0.0703687869803342, 0.3286413297516434, -0.1258655359254104, -0.3373117025380265, 0.16817603191705294, -0.1804673830685142, -0.08044220661514834, 0.16512199578653664, 0.13360349189694207, 0.14180179334513537, -0.14918768430154208, 0.12940455558996852, 0.007068017918667565, 0.13083094634013634, 0.05208777666908421, -0.01676082665304819, 0.05409365097596629, 0.17906142541602865, 0.13939124730268926, 0.17306383738807746, -0.05652121720159401, -0.1881711372391206, -0.30199316098061324, -0.16549796087042212, -0.17596902735276174, 0.11417673553710114, -0.11019690105753746, -0.18605615688633007, 0.3509786623332343, 0.12680212734267116, 0.1355960854801209, 0.05624112842783128, 0.23852725642133657, 0.2980332765536868, 0.03361589570804053, 0.12361158681905841, 0.18728351488084316, 0.21140564419329166, 0.18160947144975606, -0.2878336420614425, 0.03454440798967669, 0.1750804706961427] |
1,802.10273 | Nonexistence of global solutions of wave equations with weak
time-dependent damping and combined nonlinearity | In our previous two works, we studied the blow-up and lifespan estimates for
damped wave equations with a power nonlinearity of the solution or its
derivative, with scattering damping independently. In this work, we are devoted
to establishing a similar result for a combined nonlinearity. Comparing to the
result of wave equation without damping, one can say that the scattering
damping has no influence.
| math.AP | in our previous two works we studied the blowup and lifespan estimates for damped wave equations with a power nonlinearity of the solution or its derivative with scattering damping independently in this work we are devoted to establishing a similar result for a combined nonlinearity comparing to the result of wave equation without damping one can say that the scattering damping has no influence | [['in', 'our', 'previous', 'two', 'works', 'we', 'studied', 'the', 'blowup', 'and', 'lifespan', 'estimates', 'for', 'damped', 'wave', 'equations', 'with', 'a', 'power', 'nonlinearity', 'of', 'the', 'solution', 'or', 'its', 'derivative', 'with', 'scattering', 'damping', 'independently', 'in', 'this', 'work', 'we', 'are', 'devoted', 'to', 'establishing', 'a', 'similar', 'result', 'for', 'a', 'combined', 'nonlinearity', 'comparing', 'to', 'the', 'result', 'of', 'wave', 'equation', 'without', 'damping', 'one', 'can', 'say', 'that', 'the', 'scattering', 'damping', 'has', 'no', 'influence']] | [-0.1742798925988609, 0.05447131874097977, -0.0858479471407918, 0.040497830870663165, -0.12137996255478356, -0.1165183208649978, -0.0020828982414968777, 0.31002682400867343, -0.2335369963766425, -0.24225686148702152, 0.1113001187941336, -0.328420644349535, -0.13976397106671357, 0.23480626719174325, 0.0006683966639684513, 0.09372293377873575, 0.031371118369861506, 0.024282308033434674, -0.03395718981118989, -0.23553542554509477, 0.3625117832198157, 0.02214828797514201, 0.2139339097229822, 0.033776989606849384, 0.05744293843599735, 0.0030106545746093616, -0.01908158609876409, 0.012042193309753202, -0.17564558332799152, 0.05903379050869262, 0.19830426531552803, 0.019339220743859187, 0.3056294470152352, -0.43238676560577005, -0.27379921909596305, 0.08168734069477068, 0.16639480267622275, 0.18151272772229277, -0.06538648534478853, -0.2656298992515076, 0.027718596320482902, -0.13369206062634476, -0.19835021067410707, -0.006846792544820346, 0.0340679228247609, 0.043385853205109015, -0.290737019982771, 0.09650160415185383, 0.12238051871827338, -0.011999192007351667, -0.12710438422982406, -0.06856058823177591, -0.01279987534871907, 0.06367780430809944, 0.09821273317720625, 0.04109248602981097, 0.019405218577958294, -0.12792669997361372, -0.06326555355917662, 0.33482589648338035, -0.14311977510806173, -0.2601981825873736, 0.1954794796765782, -0.16479874985088827, -0.09844021208846243, 0.14475304053630111, 0.15784141562471632, 0.08867728218319826, -0.12546185207611416, 0.051113020842421975, -0.012345569120498112, 0.16500954452931182, 0.14905040413577808, 0.024663090805916, 0.07819392625242472, 0.18022472587472294, 0.06202633900102228, 0.1042717319314761, -0.02505986061260046, -0.03530140678049065, -0.27259184104332235, -0.11268492425551813, -0.18295604328159243, 0.09278969971774131, -0.04955467843296901, -0.12425927734875586, 0.39321859065967146, 0.16400368467293447, 0.1880819926445838, 0.09419127140427008, 0.28904133674222976, 0.24148315978709434, 0.02643046602315735, 0.06159383697377052, 0.30886755202300265, 0.14582217594943359, 0.12716201358125545, -0.26335072435904294, 0.07338108637486584, 0.05006438784766942] |
1,802.10274 | Exponential time decay of solutions to reaction-cross-diffusion systems
of Maxwell-Stefan type | The large-time asymptotics of weak solutions to Maxwell--Stefan diffusion
systems for chemically reacting fluids with different molar masses and
reversible reactions are investigated. The diffusion matrix of the system is
generally neither symmetric nor positive definite, but the equations admit a
formal gradient-flow structure which provides entropy (free energy) estimates.
The main result is the exponential decay to the unique equilibrium with a rate
that is constructive up to a finite-dimensional inequality. The key elements of
the proof are the existence of a unique detailed-balanced equilibrium and the
derivation of an inequality relating the entropy and the entropy production.
The main difficulty comes from the fact that the reactions are represented by
molar fractions while the conservation laws hold for the concentrations. The
idea is to enlarge the space of $n$ partial concentrations by adding the total
concentration, viewed as an independent variable, thus working with $n+1$
variables. Further results concern the existence of global bounded weak
solutions to the parabolic system and an extension of the results to
complex-balanced systems.
| math.AP | the largetime asymptotics of weak solutions to maxwellstefan diffusion systems for chemically reacting fluids with different molar masses and reversible reactions are investigated the diffusion matrix of the system is generally neither symmetric nor positive definite but the equations admit a formal gradientflow structure which provides entropy free energy estimates the main result is the exponential decay to the unique equilibrium with a rate that is constructive up to a finitedimensional inequality the key elements of the proof are the existence of a unique detailedbalanced equilibrium and the derivation of an inequality relating the entropy and the entropy production the main difficulty comes from the fact that the reactions are represented by molar fractions while the conservation laws hold for the concentrations the idea is to enlarge the space of n partial concentrations by adding the total concentration viewed as an independent variable thus working with n1 variables further results concern the existence of global bounded weak solutions to the parabolic system and an extension of the results to complexbalanced systems | [['the', 'largetime', 'asymptotics', 'of', 'weak', 'solutions', 'to', 'maxwellstefan', 'diffusion', 'systems', 'for', 'chemically', 'reacting', 'fluids', 'with', 'different', 'molar', 'masses', 'and', 'reversible', 'reactions', 'are', 'investigated', 'the', 'diffusion', 'matrix', 'of', 'the', 'system', 'is', 'generally', 'neither', 'symmetric', 'nor', 'positive', 'definite', 'but', 'the', 'equations', 'admit', 'a', 'formal', 'gradientflow', 'structure', 'which', 'provides', 'entropy', 'free', 'energy', 'estimates', 'the', 'main', 'result', 'is', 'the', 'exponential', 'decay', 'to', 'the', 'unique', 'equilibrium', 'with', 'a', 'rate', 'that', 'is', 'constructive', 'up', 'to', 'a', 'finitedimensional', 'inequality', 'the', 'key', 'elements', 'of', 'the', 'proof', 'are', 'the', 'existence', 'of', 'a', 'unique', 'detailedbalanced', 'equilibrium', 'and', 'the', 'derivation', 'of', 'an', 'inequality', 'relating', 'the', 'entropy', 'and', 'the', 'entropy', 'production', 'the', 'main', 'difficulty', 'comes', 'from', 'the', 'fact', 'that', 'the', 'reactions', 'are', 'represented', 'by', 'molar', 'fractions', 'while', 'the', 'conservation', 'laws', 'hold', 'for', 'the', 'concentrations', 'the', 'idea', 'is', 'to', 'enlarge', 'the', 'space', 'of', 'n', 'partial', 'concentrations', 'by', 'adding', 'the', 'total', 'concentration', 'viewed', 'as', 'an', 'independent', 'variable', 'thus', 'working', 'with', 'n1', 'variables', 'further', 'results', 'concern', 'the', 'existence', 'of', 'global', 'bounded', 'weak', 'solutions', 'to', 'the', 'parabolic', 'system', 'and', 'an', 'extension', 'of', 'the', 'results', 'to', 'complexbalanced', 'systems']] | [-0.1291606858432598, 0.12650435444535021, -0.06704594955741487, 0.042974702177885155, -0.022921806811327824, -0.13719247923129135, 0.028766560429851498, 0.24686178700094336, -0.2974641328644857, -0.2505226908415033, 0.10525107259619763, -0.30253057845062115, -0.07141461618359021, 0.16624456755163378, -0.03311461676592933, 0.06093483311818553, 0.02479955207621842, 0.03753272579146865, -0.06670572500191194, -0.2242152644988498, 0.3519982788711786, 0.027470382632366355, 0.2530372723942481, 0.07336117210661808, 0.11631275262487561, -0.03621056971510556, -0.002032756820056936, 0.014253705351072914, -0.1503108928191281, 0.12825119845046287, 0.22391234223638273, 0.10149904087961792, 0.23630202945174747, -0.3816750768193572, -0.1968676743440722, 0.12850126103982765, 0.11698917370924061, 0.09420672117947596, -0.06467138879458632, -0.2560789597449465, 0.07830129958803586, -0.13463014420748237, -0.19759366527466615, -0.07593155091831648, 0.03283089654770685, 0.07376227653088396, -0.29125925861959406, 0.12870799142006806, 0.12234923695248984, 0.026694949661866266, -0.12677516995204818, -0.11077363074659125, -0.06895052761789847, 0.1254871022773155, 0.07788436051746776, -0.014667810298290038, 0.1263523883273422, -0.09261634777577822, -0.07822055255514923, 0.35746445768098867, -0.06571685964219838, -0.23892593806424336, 0.20478195293393933, -0.13817573717267018, -0.10853347147961981, 0.17126818539640098, 0.11596994077356543, 0.13320118929014393, -0.17873029136650362, 0.10055981800423075, -0.052816735335478655, 0.1863042039542094, 0.04585750037477466, 0.027157116784817643, 0.1427624311083002, 0.11588257072733073, 0.10879729831133757, 0.11118265081534696, 0.022060412997638598, -0.15035145329066404, -0.3366236838570671, -0.20198549619264497, -0.15835029362532044, 0.11179177276475276, -0.11367743733738636, -0.17548272535014267, 0.31295303460918583, 0.0637875752828536, 0.1731329551701875, 0.08508784218969732, 0.2366782759611729, 0.1656851378366166, 0.03572865999276526, 0.050866767629252255, 0.21216405777271555, 0.21573948330240467, 0.12691041583206222, -0.2351025010619792, 0.10896119954641799, 0.11065967023746745] |
1,802.10275 | Solving for high dimensional committor functions using artificial neural
networks | In this note we propose a method based on artificial neural network to study
the transition between states governed by stochastic processes. In particular,
we aim for numerical schemes for the committor function, the central object of
transition path theory, which satisfies a high-dimensional Fokker-Planck
equation. By working with the variational formulation of such partial
differential equation and parameterizing the committor function in terms of a
neural network, approximations can be obtained via optimizing the neural
network weights using stochastic algorithms. The numerical examples show that
moderate accuracy can be achieved for high-dimensional problems.
| cs.LG cs.NA stat.ML | in this note we propose a method based on artificial neural network to study the transition between states governed by stochastic processes in particular we aim for numerical schemes for the committor function the central object of transition path theory which satisfies a highdimensional fokkerplanck equation by working with the variational formulation of such partial differential equation and parameterizing the committor function in terms of a neural network approximations can be obtained via optimizing the neural network weights using stochastic algorithms the numerical examples show that moderate accuracy can be achieved for highdimensional problems | [['in', 'this', 'note', 'we', 'propose', 'a', 'method', 'based', 'on', 'artificial', 'neural', 'network', 'to', 'study', 'the', 'transition', 'between', 'states', 'governed', 'by', 'stochastic', 'processes', 'in', 'particular', 'we', 'aim', 'for', 'numerical', 'schemes', 'for', 'the', 'committor', 'function', 'the', 'central', 'object', 'of', 'transition', 'path', 'theory', 'which', 'satisfies', 'a', 'highdimensional', 'fokkerplanck', 'equation', 'by', 'working', 'with', 'the', 'variational', 'formulation', 'of', 'such', 'partial', 'differential', 'equation', 'and', 'parameterizing', 'the', 'committor', 'function', 'in', 'terms', 'of', 'a', 'neural', 'network', 'approximations', 'can', 'be', 'obtained', 'via', 'optimizing', 'the', 'neural', 'network', 'weights', 'using', 'stochastic', 'algorithms', 'the', 'numerical', 'examples', 'show', 'that', 'moderate', 'accuracy', 'can', 'be', 'achieved', 'for', 'highdimensional', 'problems']] | [-0.09128692728823963, 0.02218419101406285, -0.07340681192247157, 0.06476861453971806, -0.04592776690867353, -0.13746579559618963, 0.040369437664420284, 0.3780167812278415, -0.32111714241352485, -0.2694877894258404, 0.06337999850585858, -0.21994204179908922, -0.2650829586794877, 0.20663730534625815, -0.061217846016974206, 0.1396704842014476, 0.1141945645312204, -0.0037580938573847427, -0.10239274218985613, -0.22433410531425096, 0.3657653774481584, 0.020792445118360696, 0.25912005714874004, 0.004549623244105184, 0.19799114193022993, -0.01194184065915327, 0.004756624178782581, 0.03331465719569911, -0.1214868650512994, 0.15403600297360484, 0.27473095034377926, 0.1290280674237441, 0.32979604094586473, -0.45814535505277043, -0.2544472836493019, 0.11049733885150265, 0.1385411035184045, 0.12394095842721575, -0.014099087740760297, -0.31151477378258047, 0.0931689196830972, -0.1654839113632098, -0.08209432322690462, -0.12104120530250626, -0.05220681823235243, 0.07079244793474457, -0.32808203981357054, 0.08188926704733217, 0.02267764751129707, 0.03382480109823828, -0.044588232566503454, -0.09248199519958902, 0.0031492557225530926, 0.06459584923342188, -0.009499348620785044, 0.036189141695665075, 0.08216118520779654, -0.1531371427080693, -0.14739130205038856, 0.32952172071375746, -0.0912281619632577, -0.2787011932839263, 0.12956505632671983, -0.061762770187070076, -0.14141020540425436, 0.10475663990376795, 0.23984327835546054, 0.16660206130844482, -0.17429667133639784, 0.07113850040874008, -0.02154313000612595, 0.12324261877368739, 0.015125043937896794, -0.02065612434686974, 0.11909718193496797, 0.2267908841604367, 0.05763507189546177, 0.1586800538464152, -0.059664716872267744, -0.1563690636465524, -0.2936417327975815, -0.11071899128047392, -0.20036765015584992, 0.03827687140871236, -0.14311869502296062, -0.1427076226496633, 0.367026294616269, 0.14898963344402294, 0.1973949904018577, 0.10465042144735096, 0.2766257013253709, 0.22705094043185262, 0.015978628937947624, 0.08740351846481258, 0.1896077447169599, 0.14461520269632022, 0.10085711255298055, -0.2179816939863079, 0.08965366229692355, 0.15319096739899288] |
1,802.10276 | Graph Optimization Approach to Range-based Localization | In this paper, we propose a general graph optimization based framework for
localization, which can accommodate different types of measurements with
varying measurement time intervals. Special emphasis will be on range-based
localization. Range and trajectory smoothness constraints are constructed in a
position graph, then the robot trajectory over a sliding window is estimated by
a graph based optimization algorithm. Moreover, convergence analysis of the
algorithm is provided, and the effects of the number of iterations and window
size in the optimization on the localization accuracy are analyzed. Extensive
experiments on quadcopter under a variety of scenarios verify the effectiveness
of the proposed algorithm and demonstrate a much higher localization accuracy
than the existing range-based localization methods, especially in the altitude
direction.
| cs.RO | in this paper we propose a general graph optimization based framework for localization which can accommodate different types of measurements with varying measurement time intervals special emphasis will be on rangebased localization range and trajectory smoothness constraints are constructed in a position graph then the robot trajectory over a sliding window is estimated by a graph based optimization algorithm moreover convergence analysis of the algorithm is provided and the effects of the number of iterations and window size in the optimization on the localization accuracy are analyzed extensive experiments on quadcopter under a variety of scenarios verify the effectiveness of the proposed algorithm and demonstrate a much higher localization accuracy than the existing rangebased localization methods especially in the altitude direction | [['in', 'this', 'paper', 'we', 'propose', 'a', 'general', 'graph', 'optimization', 'based', 'framework', 'for', 'localization', 'which', 'can', 'accommodate', 'different', 'types', 'of', 'measurements', 'with', 'varying', 'measurement', 'time', 'intervals', 'special', 'emphasis', 'will', 'be', 'on', 'rangebased', 'localization', 'range', 'and', 'trajectory', 'smoothness', 'constraints', 'are', 'constructed', 'in', 'a', 'position', 'graph', 'then', 'the', 'robot', 'trajectory', 'over', 'a', 'sliding', 'window', 'is', 'estimated', 'by', 'a', 'graph', 'based', 'optimization', 'algorithm', 'moreover', 'convergence', 'analysis', 'of', 'the', 'algorithm', 'is', 'provided', 'and', 'the', 'effects', 'of', 'the', 'number', 'of', 'iterations', 'and', 'window', 'size', 'in', 'the', 'optimization', 'on', 'the', 'localization', 'accuracy', 'are', 'analyzed', 'extensive', 'experiments', 'on', 'quadcopter', 'under', 'a', 'variety', 'of', 'scenarios', 'verify', 'the', 'effectiveness', 'of', 'the', 'proposed', 'algorithm', 'and', 'demonstrate', 'a', 'much', 'higher', 'localization', 'accuracy', 'than', 'the', 'existing', 'rangebased', 'localization', 'methods', 'especially', 'in', 'the', 'altitude', 'direction']] | [-0.12354945793963415, 0.03163317751816728, -0.0972895184916652, 0.03481732173110859, -0.05402490915538174, -0.14705971135057447, 0.038546807364529874, 0.43174739496028125, -0.23095428789696418, -0.34834565398521905, 0.1627891030208754, -0.20481612026202684, -0.16263085389548282, 0.2328824755593303, -0.10154790301953466, 0.10977768469293994, 0.14180306804728163, 0.05700942989504196, -0.09067114357488261, -0.2519290259582749, 0.255469486746583, 0.06015738237587627, 0.31405526115597526, 0.06709023868070516, 0.11659526437413224, 0.04682186427949504, -0.020184615369085685, 0.08307866024022753, -0.10648393582106253, 0.12351059441431618, 0.22620310329193297, 0.14835516918712288, 0.30166472065116257, -0.3721013309141575, -0.2324191265439322, 0.08999994200892932, 0.14834942457781844, 0.0797422303282271, -0.0345528033390749, -0.35342973171471626, 0.12164064711498573, -0.13543224419382485, -0.028855841264584726, -0.05701353667642583, -0.01800716590821312, 0.047773697121022654, -0.30133591549979016, 0.0030359941984965536, -0.005028573649912334, 0.06885799729219091, -0.052345224273244825, -0.08022336882042645, 0.05268229118525243, 0.10335536699449598, 0.048074077164431, 0.022810213714222278, 0.16092095363977527, -0.09758308259116039, -0.14260872657803342, 0.3780398441417035, -0.0218059806522869, -0.23810909732344968, 0.1833673098878858, -0.09103507846632342, -0.12259495577367008, 0.14139668094398347, 0.24749711737679395, 0.16641797307274528, -0.11602098905396732, 0.079482069568062, -0.021787210690888983, 0.16371953356645477, 0.04916658836863319, 0.01682616425495333, 0.1254142116666733, 0.24331332167820025, 0.13640853968903052, 0.12503684068017848, -0.14036090629106032, -0.08819420988024944, -0.2773397775320721, -0.11012660512654496, -0.19253675804342613, -0.06789514912611781, -0.13384596389585582, -0.11119353266294338, 0.4669910003392657, 0.2127451305123708, 0.20239002735946665, 0.11097034935412298, 0.33066253909794996, 0.0885803315024592, 0.023256619022158552, 0.06708697273111171, 0.19948222015576422, 0.04075239789056445, 0.06893875896988422, -0.21536130470094803, 0.08954429531215945, 0.08840153050755174] |
1,802.10277 | Degenerations over $(A_\infty)$-singularities and construction of
degenerations over commutative rings | We give a necessary condition of degeneration via matrix representations, and
consider degenerations of indecomposable Cohen-Macaulay modules over
hypersurface singularities of type ($A_\infty$). We also provide a method to
construct degenerations of finitely generated modules over commutative rings.
| math.AC math.RT | we give a necessary condition of degeneration via matrix representations and consider degenerations of indecomposable cohenmacaulay modules over hypersurface singularities of type a_infty we also provide a method to construct degenerations of finitely generated modules over commutative rings | [['we', 'give', 'a', 'necessary', 'condition', 'of', 'degeneration', 'via', 'matrix', 'representations', 'and', 'consider', 'degenerations', 'of', 'indecomposable', 'cohenmacaulay', 'modules', 'over', 'hypersurface', 'singularities', 'of', 'type', 'a_infty', 'we', 'also', 'provide', 'a', 'method', 'to', 'construct', 'degenerations', 'of', 'finitely', 'generated', 'modules', 'over', 'commutative', 'rings']] | [-0.20465678785388408, -0.04491139046455685, -0.10772347945327822, 0.07635507193443022, -0.08775277068152239, -0.23342751978749507, -0.11840290062154006, 0.373503092872469, -0.4218141951255108, -0.06368402891645306, 0.1183470856447361, -0.17766594925993368, -0.14702996840366578, 0.18479739921167493, -0.20139350487213387, -0.10169257360853647, 0.17697634837149004, 0.07843156329947401, -0.12404836738776219, -0.41312281400774065, 0.5107336707021061, -0.04897836434017671, 0.2116764162323977, 0.07476559315661066, 0.21524025455705428, 0.03964004663162326, -0.006000694720760772, -0.046456154141771164, -0.22794145908157684, 0.12224770522382307, 0.41901412135676336, 0.11545648561839603, 0.13846314496875398, -0.40995841409618916, -0.04208136446724989, 0.30259638024788155, 0.18261039157790182, 0.01804047952847261, -0.020648912036497342, -0.2123775314539671, 0.14682848774215304, -0.2877331001586036, -0.18755662612813084, -0.1557703541015814, 0.033364556582742615, 0.031473034698712196, -0.2801502712659146, 0.012615113316171215, 0.06593685430523596, 0.22487855094828105, -0.10901573881212819, -0.024892888546578194, -0.07802227796300461, -0.019848872931968225, -0.1237743020848077, -0.1100407900582803, 0.09289058163075854, -0.0823218080362207, -0.1624639941085326, 0.2766061020573895, -0.03575781401933024, -0.27928005002046885, 0.10488199670553992, -0.14780103829444238, -0.08495010854063653, 0.16292933714085897, 0.033179664163311064, 0.19606900146525158, 0.003532332490737501, 0.2023085346307581, -0.12703774364567116, -0.056551391151611154, 0.15273359435071288, 0.02698881639853904, 0.13950223036992707, 0.08902846758351907, 0.07100577392664395, 0.16392155236711628, 0.05774048563877219, 0.07595702035254553, -0.43325492700463847, -0.2112804428233128, -0.02431496018911467, 0.22207713813373917, -0.11259452664058986, -0.23055422092836939, 0.5095565586203807, 0.07328334097799502, 0.21798732955204814, 0.17115273782493254, 0.1545521214016174, -0.09099291559112699, 0.09751611065707709, -0.004059541480321633, 0.04094785868533348, 0.3164460407079835, -0.06210117760776101, -0.01979856356047094, -0.05234435658999964, 0.31317008345534925] |
1,802.10278 | Sign changes of Kloosterman sums and exceptional characters | We prove that the existence of exceptional real zeroes of Dirichlet
$L$-functions would lead to cancellations in the sum $\sum_{p\leq x} \Kl(1, p)$
of Kloosterman sums over primes, and also to sign changes of $\Kl(1, n)$, where
$n$ runs over integers with exactly two prime factors. Our arguments involve a
variant of Bombieri's sieve, bounds for twisted sums of Kloosterman sums, and
work of Fouvry and Michel on sums of $\left| \Kl(1, n)\right|$.
| math.NT | we prove that the existence of exceptional real zeroes of dirichlet lfunctions would lead to cancellations in the sum sum_pleq x kl1 p of kloosterman sums over primes and also to sign changes of kl1 n where n runs over integers with exactly two prime factors our arguments involve a variant of bombieris sieve bounds for twisted sums of kloosterman sums and work of fouvry and michel on sums of left kl1 nright | [['we', 'prove', 'that', 'the', 'existence', 'of', 'exceptional', 'real', 'zeroes', 'of', 'dirichlet', 'lfunctions', 'would', 'lead', 'to', 'cancellations', 'in', 'the', 'sum', 'sum_pleq', 'x', 'kl1', 'p', 'of', 'kloosterman', 'sums', 'over', 'primes', 'and', 'also', 'to', 'sign', 'changes', 'of', 'kl1', 'n', 'where', 'n', 'runs', 'over', 'integers', 'with', 'exactly', 'two', 'prime', 'factors', 'our', 'arguments', 'involve', 'a', 'variant', 'of', 'bombieris', 'sieve', 'bounds', 'for', 'twisted', 'sums', 'of', 'kloosterman', 'sums', 'and', 'work', 'of', 'fouvry', 'and', 'michel', 'on', 'sums', 'of', 'left', 'kl1', 'nright']] | [-0.2796623567693344, 0.09480940962325118, -0.10751081173218889, 0.05353586110350204, -0.047256712355229956, -0.12607039472292345, 0.0933495309452641, 0.24005210746641029, -0.2728492562939757, -0.24994082526903447, 0.05180056683865873, -0.3288451687318005, -0.09921427587468228, 0.22996184928980593, -0.07172958873059243, 0.04090836106748511, 0.010776068549603224, 0.06115771048664026, -0.07019713946796749, -0.42502845463993616, 0.2977162352571749, -0.07901251892725082, 0.1374527828972021, 0.08529278301723199, 0.029632994190674937, 0.06074734183972421, 0.010065665340995135, -0.14441239800661393, -0.13127123842333613, 0.13617421952580588, 0.288404308106393, 0.049494472514098026, 0.2544876349298921, -0.40828769726755276, -0.06251454585844217, 0.24177069542291638, 0.2158109245364146, -0.12343675144373963, 0.07666575930508696, -0.21683125041922785, 0.1254639606922865, -0.15639472659677267, -0.10209675426818175, -0.0918889874720002, 0.06300901330701292, 0.10525029672434146, -0.4062560751319748, 0.06711373301438209, 0.11235598717140008, 0.12380693581159392, 0.0035782526350860828, -0.3081737102124177, 0.10251334405580714, 0.038385448116196756, 0.13795582132337436, -0.020431041551677333, 0.009133732718198674, -0.07691442486766266, -0.14398041364341363, 0.28532736238143214, -0.05725828436369153, -0.16156089136198368, 0.03635924814064821, -0.22126941543633807, -0.20071799966366324, 0.13350442280412383, 0.0877298844518931, 0.16633050896431487, 0.07507642986227388, 0.2004074503528911, -0.19148719507231288, 0.07328047666520085, 0.25209325176906094, -0.009572151994128546, 0.14119799162120852, -0.0647693887378459, 0.0719534163682224, 0.08925854073429149, -0.0046195983982402575, -0.013432011097567538, -0.34655786304390185, -0.18848451791484266, -0.1862263392357232, 0.21061120450190485, -0.14911655897425316, -0.21112796153764762, 0.3332929198138977, 0.06579974255435271, 0.18714303692343504, 0.19285543602955055, 0.18217312986643552, 0.0923580114158789, 0.03410147159832389, 0.02972578504824475, 0.006858574229688065, 0.2121157491171401, -0.03766121452017241, -0.12065354719987675, 0.005688153979151625, 0.20395445293581035] |
1,802.10279 | Medical Exam Question Answering with Large-scale Reading Comprehension | Reading and understanding text is one important component in computer aided
diagnosis in clinical medicine, also being a major research problem in the
field of NLP. In this work, we introduce a question-answering task called MedQA
to study answering questions in clinical medicine using knowledge in a
large-scale document collection. The aim of MedQA is to answer real-world
questions with large-scale reading comprehension. We propose our solution
SeaReader--a modular end-to-end reading comprehension model based on LSTM
networks and dual-path attention architecture. The novel dual-path attention
models information flow from two perspectives and has the ability to
simultaneously read individual documents and integrate information across
multiple documents. In experiments our SeaReader achieved a large increase in
accuracy on MedQA over competing models. Additionally, we develop a series of
novel techniques to demonstrate the interpretation of the question answering
process in SeaReader.
| cs.CL | reading and understanding text is one important component in computer aided diagnosis in clinical medicine also being a major research problem in the field of nlp in this work we introduce a questionanswering task called medqa to study answering questions in clinical medicine using knowledge in a largescale document collection the aim of medqa is to answer realworld questions with largescale reading comprehension we propose our solution seareadera modular endtoend reading comprehension model based on lstm networks and dualpath attention architecture the novel dualpath attention models information flow from two perspectives and has the ability to simultaneously read individual documents and integrate information across multiple documents in experiments our seareader achieved a large increase in accuracy on medqa over competing models additionally we develop a series of novel techniques to demonstrate the interpretation of the question answering process in seareader | [['reading', 'and', 'understanding', 'text', 'is', 'one', 'important', 'component', 'in', 'computer', 'aided', 'diagnosis', 'in', 'clinical', 'medicine', 'also', 'being', 'a', 'major', 'research', 'problem', 'in', 'the', 'field', 'of', 'nlp', 'in', 'this', 'work', 'we', 'introduce', 'a', 'questionanswering', 'task', 'called', 'medqa', 'to', 'study', 'answering', 'questions', 'in', 'clinical', 'medicine', 'using', 'knowledge', 'in', 'a', 'largescale', 'document', 'collection', 'the', 'aim', 'of', 'medqa', 'is', 'to', 'answer', 'realworld', 'questions', 'with', 'largescale', 'reading', 'comprehension', 'we', 'propose', 'our', 'solution', 'seareadera', 'modular', 'endtoend', 'reading', 'comprehension', 'model', 'based', 'on', 'lstm', 'networks', 'and', 'dualpath', 'attention', 'architecture', 'the', 'novel', 'dualpath', 'attention', 'models', 'information', 'flow', 'from', 'two', 'perspectives', 'and', 'has', 'the', 'ability', 'to', 'simultaneously', 'read', 'individual', 'documents', 'and', 'integrate', 'information', 'across', 'multiple', 'documents', 'in', 'experiments', 'our', 'seareader', 'achieved', 'a', 'large', 'increase', 'in', 'accuracy', 'on', 'medqa', 'over', 'competing', 'models', 'additionally', 'we', 'develop', 'a', 'series', 'of', 'novel', 'techniques', 'to', 'demonstrate', 'the', 'interpretation', 'of', 'the', 'question', 'answering', 'process', 'in', 'seareader']] | [-0.06450947504626574, -0.010615275239735081, -0.023684228770434856, 0.0573661107308025, -0.14358192892323662, -0.1581202483681595, 0.04771695152200405, 0.40704367177928014, -0.28033497877568553, -0.3371504271389359, 0.06309943751816087, -0.2876607641283708, -0.19600817286851305, 0.2299744349200768, -0.14125747014054635, 0.05826036145835843, 0.1414935998346684, 0.05692727600027175, 0.002665172997236687, -0.30154329212892284, 0.29372254343037185, 0.05062431812517508, 0.3720923489245185, 0.08642471745358712, 0.11702369139903654, -0.005996419089662768, -0.09832637334866177, -0.04689845275881625, -0.09033675422980349, 0.208684822210505, 0.39423129336134555, 0.24963328561126968, 0.39490306454907803, -0.41059009340272223, -0.23572280877915613, 0.042269101517655665, 0.1581690150098943, 0.11359205655583664, -0.04629282907491047, -0.3019305384670296, 0.07860986330124964, -0.1649003590586303, 0.026764250474295367, -0.12727424024475098, -0.005588162186501181, -0.05860551641948086, -0.23370504199126124, 0.003988918803936469, 0.10689876537368953, 0.13331675226970094, -0.041346080581830515, -0.0676664404407905, 0.12597485782959275, 0.18595257259388692, 0.041976153121519075, 0.08916832518213204, 0.12030997943901287, -0.21608052526287952, -0.20101126181437587, 0.3687683400446481, -0.04572678843757858, -0.21215505162287965, 0.1762994113021333, -0.04830194966201365, -0.19385077715613439, 0.03948896236880852, 0.2669427774805766, 0.10820345718576743, -0.1762998174250561, 0.011217250536284307, -0.03431596838100983, 0.1999927658229101, 0.045899434883596144, -0.037346595259260956, 0.23945568121262711, 0.285226539158038, -0.04466719211276322, 0.14911555767528387, -0.061049860932721495, -0.09447599985181307, -0.1594650227560349, -0.15840587445133686, -0.12857003690144658, 0.03222266017513717, -0.030742128358824165, -0.14399754614943136, 0.41527681090753443, 0.2827860958038075, 0.19434064597462433, 0.0183811971667498, 0.3294353993324033, -0.016431229246821066, 0.0772167906423446, 0.03901543945412281, 0.09096115984338723, 0.04423334165884141, 0.17663937131959237, -0.14785930482640075, 0.06957972626521314, 0.03716255574534735] |
1,802.1028 | Escoin: Efficient Sparse Convolutional Neural Network Inference on GPUs | Deep neural networks have achieved remarkable accuracy in many artificial
intelligence applications, e.g. computer vision, at the cost of a large number
of parameters and high computational complexity. Weight pruning can compress
DNN models by removing redundant parameters in the networks, but it brings
sparsity in the weight matrix, and therefore makes the computation inefficient
on GPUs. Although pruning can remove more than 80% of the weights, it actually
hurts inference performance (speed) when running models on GPUs.
Two major problems cause this unsatisfactory performance on GPUs. First,
lowering convolution onto matrix multiplication reduces data reuse
opportunities and wastes memory bandwidth. Second, the sparsity brought by
pruning makes the computation irregular, which leads to inefficiency when
running on massively parallel GPUs. To overcome these two limitations, we
propose Escort, an efficient sparse convolutional neural networks on GPUs.
Instead of using the lowering method, we choose to compute the sparse
convolutions directly. We then orchestrate the parallelism and locality for the
direct sparse convolution kernel, and apply customized optimization techniques
to further improve performance. Evaluation on NVIDIA GPUs show that Escort can
improve sparse convolution speed by 2.63x and 3.07x, and inference speed by
1.43x and 1.69x, compared to CUBLAS and CUSPARSE respectively.
| cs.DC cs.CV cs.LG | deep neural networks have achieved remarkable accuracy in many artificial intelligence applications eg computer vision at the cost of a large number of parameters and high computational complexity weight pruning can compress dnn models by removing redundant parameters in the networks but it brings sparsity in the weight matrix and therefore makes the computation inefficient on gpus although pruning can remove more than 80 of the weights it actually hurts inference performance speed when running models on gpus two major problems cause this unsatisfactory performance on gpus first lowering convolution onto matrix multiplication reduces data reuse opportunities and wastes memory bandwidth second the sparsity brought by pruning makes the computation irregular which leads to inefficiency when running on massively parallel gpus to overcome these two limitations we propose escort an efficient sparse convolutional neural networks on gpus instead of using the lowering method we choose to compute the sparse convolutions directly we then orchestrate the parallelism and locality for the direct sparse convolution kernel and apply customized optimization techniques to further improve performance evaluation on nvidia gpus show that escort can improve sparse convolution speed by 263x and 307x and inference speed by 143x and 169x compared to cublas and cusparse respectively | [['deep', 'neural', 'networks', 'have', 'achieved', 'remarkable', 'accuracy', 'in', 'many', 'artificial', 'intelligence', 'applications', 'eg', 'computer', 'vision', 'at', 'the', 'cost', 'of', 'a', 'large', 'number', 'of', 'parameters', 'and', 'high', 'computational', 'complexity', 'weight', 'pruning', 'can', 'compress', 'dnn', 'models', 'by', 'removing', 'redundant', 'parameters', 'in', 'the', 'networks', 'but', 'it', 'brings', 'sparsity', 'in', 'the', 'weight', 'matrix', 'and', 'therefore', 'makes', 'the', 'computation', 'inefficient', 'on', 'gpus', 'although', 'pruning', 'can', 'remove', 'more', 'than', '80', 'of', 'the', 'weights', 'it', 'actually', 'hurts', 'inference', 'performance', 'speed', 'when', 'running', 'models', 'on', 'gpus', 'two', 'major', 'problems', 'cause', 'this', 'unsatisfactory', 'performance', 'on', 'gpus', 'first', 'lowering', 'convolution', 'onto', 'matrix', 'multiplication', 'reduces', 'data', 'reuse', 'opportunities', 'and', 'wastes', 'memory', 'bandwidth', 'second', 'the', 'sparsity', 'brought', 'by', 'pruning', 'makes', 'the', 'computation', 'irregular', 'which', 'leads', 'to', 'inefficiency', 'when', 'running', 'on', 'massively', 'parallel', 'gpus', 'to', 'overcome', 'these', 'two', 'limitations', 'we', 'propose', 'escort', 'an', 'efficient', 'sparse', 'convolutional', 'neural', 'networks', 'on', 'gpus', 'instead', 'of', 'using', 'the', 'lowering', 'method', 'we', 'choose', 'to', 'compute', 'the', 'sparse', 'convolutions', 'directly', 'we', 'then', 'orchestrate', 'the', 'parallelism', 'and', 'locality', 'for', 'the', 'direct', 'sparse', 'convolution', 'kernel', 'and', 'apply', 'customized', 'optimization', 'techniques', 'to', 'further', 'improve', 'performance', 'evaluation', 'on', 'nvidia', 'gpus', 'show', 'that', 'escort', 'can', 'improve', 'sparse', 'convolution', 'speed', 'by', '263x', 'and', '307x', 'and', 'inference', 'speed', 'by', '143x', 'and', '169x', 'compared', 'to', 'cublas', 'and', 'cusparse', 'respectively']] | [-0.079225802962319, 0.04014900203626894, -0.017749252286885165, 0.05175083042297047, -0.13439381262287498, -0.19304246260086075, 0.0779108011216158, 0.4597548679215834, -0.3333884396124631, -0.3622970980009995, 0.10540137506264728, -0.2160700566262676, -0.19221511072013528, 0.21171367824310436, -0.13863749435608042, 0.12716898729791865, 0.18225570399546995, 0.010341417394811288, -0.13307063092041063, -0.35082508362829684, 0.22961643811373506, 0.12452054610577762, 0.32212958244956097, 0.025893602869764436, 0.10378890110689099, -0.02739798669004813, -0.038170763292582705, -0.066384348210413, 0.004130203582863032, 0.18630255235591903, 0.2577759077311566, 0.18684272775659339, 0.3613369508460164, -0.49619318966986614, -0.19699349092785268, 0.09507018620497547, 0.1696011536442529, 0.032551636234275066, -0.006629637228688807, -0.24509165860537904, 0.11304358203429729, -0.18826870602322743, 0.00920280887046829, -0.2028673836926464, -0.04715195285854861, 0.007047290656191763, -0.2671299887960777, 0.019368482581339778, 0.03199477678630501, 0.011999137396924198, 0.033711453612195325, -0.18124600877054037, 0.06494082950172014, 0.0856915515140281, -0.0011710362881422042, 0.03481742091476917, 0.14804736289312131, -0.18751726247835904, -0.14147820819285697, 0.3313906131591648, -0.02253524681997078, -0.2359367558476515, 0.19807874028105288, 0.002370213412141311, -0.1815628938563168, 0.10863967506113113, 0.26129674843290557, 0.02331929202100582, -0.10822481837894884, 0.07328156073781429, 0.0581319094542414, 0.19823645721189678, 0.13423019041307271, 0.00576990979956463, 0.11745226828381419, 0.22482154877274296, 0.07526050403568661, 0.1461330014577834, -0.10286437599221245, -0.0880803461978212, -0.12891558445291593, -0.12736394900362938, -0.24489086283836514, -0.011184177690302022, -0.18693898461155187, -0.12402391652343794, 0.36435632076114416, 0.23120387252187358, 0.18281653382815422, 0.13943589200789575, 0.3882289248181041, 0.07174143154523335, 0.2043975232867524, 0.17694872708525508, 0.14383083577515207, 0.062246568808332084, 0.13782518386433368, -0.2039736174054269, 0.051979836382961365, 0.04229346292908304] |
1,802.10281 | Spin-one bilinear-biquadratic model on a star lattice | We study the ground-state phase diagram of the $S=1$ bilinear-biquadratic
model\,(BLBQ) on the star lattice with the state-of-art tensor network
algorithms. The system has five phases: the ferromagnetic, anti-ferromagnetic,
ferroquadrupolar, and spin-liquid phases. The phases and their phase boundaries
are determined by examining various local observables, correlation functions
and transfer matrices exhaustively. The spin liquid phase, which is the first
quantum disordered phase found in two-dimensional BLBQ model, is gapped and
devoid of any conventional long-range order. It is also characterized by
fixed-parity virtual bonds in the tensor network formalism, analogous to the
Haldane phase, while the parity varies depending on the location of the bond.
| cond-mat.str-el | we study the groundstate phase diagram of the s1 bilinearbiquadratic modelblbq on the star lattice with the stateofart tensor network algorithms the system has five phases the ferromagnetic antiferromagnetic ferroquadrupolar and spinliquid phases the phases and their phase boundaries are determined by examining various local observables correlation functions and transfer matrices exhaustively the spin liquid phase which is the first quantum disordered phase found in twodimensional blbq model is gapped and devoid of any conventional longrange order it is also characterized by fixedparity virtual bonds in the tensor network formalism analogous to the haldane phase while the parity varies depending on the location of the bond | [['we', 'study', 'the', 'groundstate', 'phase', 'diagram', 'of', 'the', 's1', 'bilinearbiquadratic', 'modelblbq', 'on', 'the', 'star', 'lattice', 'with', 'the', 'stateofart', 'tensor', 'network', 'algorithms', 'the', 'system', 'has', 'five', 'phases', 'the', 'ferromagnetic', 'antiferromagnetic', 'ferroquadrupolar', 'and', 'spinliquid', 'phases', 'the', 'phases', 'and', 'their', 'phase', 'boundaries', 'are', 'determined', 'by', 'examining', 'various', 'local', 'observables', 'correlation', 'functions', 'and', 'transfer', 'matrices', 'exhaustively', 'the', 'spin', 'liquid', 'phase', 'which', 'is', 'the', 'first', 'quantum', 'disordered', 'phase', 'found', 'in', 'twodimensional', 'blbq', 'model', 'is', 'gapped', 'and', 'devoid', 'of', 'any', 'conventional', 'longrange', 'order', 'it', 'is', 'also', 'characterized', 'by', 'fixedparity', 'virtual', 'bonds', 'in', 'the', 'tensor', 'network', 'formalism', 'analogous', 'to', 'the', 'haldane', 'phase', 'while', 'the', 'parity', 'varies', 'depending', 'on', 'the', 'location', 'of', 'the', 'bond']] | [-0.20261399021434884, 0.24341362928792548, -0.03967988112484678, 0.03940177455325074, 0.0017864128234438025, -0.13980571366846561, 0.056302651729380995, 0.39320143398184043, -0.2387240339213839, -0.2502195030817977, 0.07891094041853929, -0.3043984393768299, -0.1615153260421581, 0.07147766591291517, 0.09286775464156213, 0.043644054715584316, -0.04629562136967881, 0.006039711496739004, -0.1808918776178661, -0.2316797055133905, 0.32011476061485994, -0.025319979236183617, 0.3119674242513541, 0.0563702340296004, 0.03907580554256968, 0.007944514310041156, 0.06587807083269581, -0.008798614343574557, -0.1611313983404006, 0.018034965865528926, 0.21049930633475575, -0.032171740724991724, 0.09333542088951127, -0.42011002846993506, -0.19706106004126084, 0.10003753951661146, 0.11660776378434654, 0.13077200657370178, 0.04023075752551309, -0.35584800120872945, 0.015424378328204442, -0.21385991374756066, -0.09927688207972096, -0.11094932291262712, -0.017448690084095757, -0.01451871687710921, -0.198837854890511, 0.11174787961303642, 0.05411615858275372, 0.07496857129780647, -0.07376021753477219, -0.11160713399630577, -0.09410195900776532, 0.13477489337898219, 0.01030156725699691, 0.0834593240400024, 0.11240770940919621, -0.14165718399453908, -0.14955785687030024, 0.3969216511423628, -0.012093461954813952, -0.12600107435355312, 0.17216988284445295, -0.15472360443625524, -0.10882009379117964, 0.16168403720187668, 0.06105155112499443, 0.07618852450440709, -0.11391582959689774, 0.08769736255187756, 0.0009006768724737832, 0.1881289224794063, -0.029851034968697395, 0.0426923514281113, 0.24664175022357646, 0.16280444884278739, 0.05317779663556184, 0.19949632877251133, -0.10793956400630123, -0.1885873828208647, -0.21241090666108692, -0.1615671101919291, -0.26164713484020186, -0.03889300735541978, -0.1364028423016022, -0.18059761113881206, 0.44251054354334396, 0.11144652233409803, 0.1487233061779989, -0.03333181303829546, 0.2374769242372937, 0.0816481831895474, 0.04274655330272463, 0.03626263482818523, 0.2502202316693281, 0.17378466191719502, 0.09974187035438192, -0.26987165445014116, 0.08309301120999198, 0.10774442152782845] |
1,802.10282 | Weak Lensing Study in VOICE Survey I: Shear Measurement | The VST Optical Imaging of the CDFS and ES1 Fields (VOICE) Survey is a
Guaranteed Time program carried out with the ESO/VST telescope to provide deep
optical imaging over two 4 deg$^2$ patches of the sky centred on the CDFS and
ES1 pointings. We present the cosmic shear measurement over the 4 deg$^2$
covering the CDFS region in the $r$-band using LensFit. Each of the four tiles
of 1 deg$^2$ has more than one hundred exposures, of which more than 50
exposures passed a series of image quality selection criteria for weak lensing
study. The $5\sigma$ limiting magnitude in $r$- band is 26.1 for point sources,
which is $\sim$1 mag deeper than other weak lensing survey in the literature
(e.g. the Kilo Degree Survey, KiDS, at VST). The photometric redshifts are
estimated using the VOICE $u,g,r,i$ together with near-infrared VIDEO data
$Y,J,H,K_s$. The mean redshift of the shear catalogue is 0.87, considering the
shear weight. The effective galaxy number density is 16.35 gal/arcmin$^2$,
which is nearly twice the one of KiDS. The performance of LensFit on such a
deep dataset was calibrated using VOICE-like mock image simulations.
Furthermore, we have analyzed the reliability of the shear catalogue by
calculating the star-galaxy cross-correlations, the tomographic shear
correlations of two redshift bins and the contaminations of the blended
galaxies. As a further sanity check, we have constrained cosmological
parameters by exploring the parameter space with Population Monte Carlo
sampling. For a flat $\Lambda$CDM model we have obtained $\Sigma_8$ =
$\sigma_8(\Omega_m/0.3)^{0.5}$ = $0.68^{+0.11}_{-0.15}$.
| astro-ph.CO | the vst optical imaging of the cdfs and es1 fields voice survey is a guaranteed time program carried out with the esovst telescope to provide deep optical imaging over two 4 deg2 patches of the sky centred on the cdfs and es1 pointings we present the cosmic shear measurement over the 4 deg2 covering the cdfs region in the rband using lensfit each of the four tiles of 1 deg2 has more than one hundred exposures of which more than 50 exposures passed a series of image quality selection criteria for weak lensing study the 5sigma limiting magnitude in r band is 261 for point sources which is sim1 mag deeper than other weak lensing survey in the literature eg the kilo degree survey kids at vst the photometric redshifts are estimated using the voice ugri together with nearinfrared video data yjhk_s the mean redshift of the shear catalogue is 087 considering the shear weight the effective galaxy number density is 1635 galarcmin2 which is nearly twice the one of kids the performance of lensfit on such a deep dataset was calibrated using voicelike mock image simulations furthermore we have analyzed the reliability of the shear catalogue by calculating the stargalaxy crosscorrelations the tomographic shear correlations of two redshift bins and the contaminations of the blended galaxies as a further sanity check we have constrained cosmological parameters by exploring the parameter space with population monte carlo sampling for a flat lambdacdm model we have obtained sigma_8 sigma_8omega_m0305 068011_015 | [['the', 'vst', 'optical', 'imaging', 'of', 'the', 'cdfs', 'and', 'es1', 'fields', 'voice', 'survey', 'is', 'a', 'guaranteed', 'time', 'program', 'carried', 'out', 'with', 'the', 'esovst', 'telescope', 'to', 'provide', 'deep', 'optical', 'imaging', 'over', 'two', '4', 'deg2', 'patches', 'of', 'the', 'sky', 'centred', 'on', 'the', 'cdfs', 'and', 'es1', 'pointings', 'we', 'present', 'the', 'cosmic', 'shear', 'measurement', 'over', 'the', '4', 'deg2', 'covering', 'the', 'cdfs', 'region', 'in', 'the', 'rband', 'using', 'lensfit', 'each', 'of', 'the', 'four', 'tiles', 'of', '1', 'deg2', 'has', 'more', 'than', 'one', 'hundred', 'exposures', 'of', 'which', 'more', 'than', '50', 'exposures', 'passed', 'a', 'series', 'of', 'image', 'quality', 'selection', 'criteria', 'for', 'weak', 'lensing', 'study', 'the', '5sigma', 'limiting', 'magnitude', 'in', 'r', 'band', 'is', '261', 'for', 'point', 'sources', 'which', 'is', 'sim1', 'mag', 'deeper', 'than', 'other', 'weak', 'lensing', 'survey', 'in', 'the', 'literature', 'eg', 'the', 'kilo', 'degree', 'survey', 'kids', 'at', 'vst', 'the', 'photometric', 'redshifts', 'are', 'estimated', 'using', 'the', 'voice', 'ugri', 'together', 'with', 'nearinfrared', 'video', 'data', 'yjhk_s', 'the', 'mean', 'redshift', 'of', 'the', 'shear', 'catalogue', 'is', '087', 'considering', 'the', 'shear', 'weight', 'the', 'effective', 'galaxy', 'number', 'density', 'is', '1635', 'galarcmin2', 'which', 'is', 'nearly', 'twice', 'the', 'one', 'of', 'kids', 'the', 'performance', 'of', 'lensfit', 'on', 'such', 'a', 'deep', 'dataset', 'was', 'calibrated', 'using', 'voicelike', 'mock', 'image', 'simulations', 'furthermore', 'we', 'have', 'analyzed', 'the', 'reliability', 'of', 'the', 'shear', 'catalogue', 'by', 'calculating', 'the', 'stargalaxy', 'crosscorrelations', 'the', 'tomographic', 'shear', 'correlations', 'of', 'two', 'redshift', 'bins', 'and', 'the', 'contaminations', 'of', 'the', 'blended', 'galaxies', 'as', 'a', 'further', 'sanity', 'check', 'we', 'have', 'constrained', 'cosmological', 'parameters', 'by', 'exploring', 'the', 'parameter', 'space', 'with', 'population', 'monte', 'carlo', 'sampling', 'for', 'a', 'flat', 'lambdacdm', 'model', 'we', 'have', 'obtained', 'sigma_8', 'sigma_8omega_m0305', '068011_015']] | [-0.0895608512428114, 0.038588601461022484, -0.0858906425668725, 0.081222614253472, -0.08302412875642887, -0.059056768708919384, 0.03712601571590925, 0.4308430944094244, -0.1773217047944817, -0.3599785639310484, 0.10756779351718343, -0.34354348671907675, -0.006169536257428782, 0.2216317498609804, 0.018953884791045886, 0.010173395643847024, 0.06808923804438768, -0.08200621642825688, -0.050720061986037165, -0.374225590689754, 0.24525599352711316, 0.09176087895840672, 0.26099763025947825, -0.08436313386939998, 0.14502436500755425, -2.927823106245119e-05, -0.15063926695218804, 0.023367072911624206, -0.18577112375131372, 0.04202790098568919, 0.25947388308787983, 0.1281644986733338, 0.28267972860105184, -0.2859619489756926, -0.17934834782262238, 0.08904331895256681, 0.15485265711435278, 0.04312935578779374, -0.0014299581042367356, -0.3167693893273114, 0.07527497865221634, -0.15718488692447344, -0.0750195461035497, 0.017065894672152946, -0.03560798585661972, 0.04298322816493408, -0.22636024385728704, 0.14221938726413824, -0.06967225424631746, 0.17336092879425508, -0.0952191614488862, -0.13565227577120673, -0.044386553274923746, 0.0981652011776495, -0.020436453563161195, 0.13048851248542112, 0.13540722712570308, -0.1971323495255593, -0.006334164126167948, 0.35061445052602463, -0.06984478412285133, -0.04804788306830641, 0.12010445397404232, -0.17191528462025585, -0.15503108168629054, 0.1480611773887269, 0.1617165085750309, 0.07851534728738907, -0.18553614723591172, 0.03942633111490773, -0.017027186600928557, 0.24312104717412564, 0.06980420025065541, 0.03439744332602143, 0.2583316698147706, 0.13164196452125906, 0.09046969693296646, 0.1298836322256592, -0.32752970851083496, 0.02507667197674817, -0.26610454158591373, -0.07218924941196896, -0.16107304517407806, 0.06368405957592232, -0.1703792396360861, -0.11689840699593555, 0.4075138666372442, 0.15445689027938916, 0.15451901696993, 0.11558290452895952, 0.3267312122318818, 0.031024709887498496, 0.12208315432010805, 0.016068800812473104, 0.3287458787425136, 0.11249859977171434, 0.06379130332331573, -0.1076127925108434, -0.017539927272520465, 0.004733115470046368] |
1,802.10283 | Weak Lensing Study in VOICE Survey II: Shear Bias Calibrations | The VST Optical Imaging of the CDFS and ES1 Fields (VOICE) Survey is proposed
to obtain deep optical $ugri$ imaging of the CDFS and ES1 fields using the VLT
Survey Telescope (VST). At present, the observations for the CDFS field have
been completed, and comprise in total about 4.9 deg$^2$ down to
$r_\mathrm{AB}$$\sim$26 mag. In the companion paper by Fu et al. (2018), we
present the weak lensing shear measurements for $r$-band images with seeing
$\le$ 0.9 arcsec. In this paper, we perform image simulations to calibrate
possible biases of the measured shear signals. Statistically, the properties of
the simulated point spread function (PSF) and galaxies show good agreements
with those of observations. The multiplicative bias is calibrated to reach an
accuracy of $\sim$3.0%. We study the bias sensitivities to the undetected faint
galaxies and to the neighboring galaxies. We find that undetected galaxies
contribute to the multiplicative bias at the level of $\sim$0.3%. Further
analysis shows that galaxies with lower signal-to-noise ratio (SNR) are
impacted more significantly because the undetected galaxies skew the background
noise distribution. For the neighboring galaxies, we find that although most
have been rejected in the shape measurement procedure, about one third of them
still remain in the final shear sample. They show a larger ellipticity
dispersion and contribute to $\sim$0.2% of the multiplicative bias. Such a bias
can be removed by further eliminating these neighboring galaxies. But the
effective number density of the galaxies can be reduced considerably. Therefore
efficient methods should be developed for future weak lensing deep surveys.
| astro-ph.CO | the vst optical imaging of the cdfs and es1 fields voice survey is proposed to obtain deep optical ugri imaging of the cdfs and es1 fields using the vlt survey telescope vst at present the observations for the cdfs field have been completed and comprise in total about 49 deg2 down to r_mathrmabsim26 mag in the companion paper by fu et al 2018 we present the weak lensing shear measurements for rband images with seeing le 09 arcsec in this paper we perform image simulations to calibrate possible biases of the measured shear signals statistically the properties of the simulated point spread function psf and galaxies show good agreements with those of observations the multiplicative bias is calibrated to reach an accuracy of sim30 we study the bias sensitivities to the undetected faint galaxies and to the neighboring galaxies we find that undetected galaxies contribute to the multiplicative bias at the level of sim03 further analysis shows that galaxies with lower signaltonoise ratio snr are impacted more significantly because the undetected galaxies skew the background noise distribution for the neighboring galaxies we find that although most have been rejected in the shape measurement procedure about one third of them still remain in the final shear sample they show a larger ellipticity dispersion and contribute to sim02 of the multiplicative bias such a bias can be removed by further eliminating these neighboring galaxies but the effective number density of the galaxies can be reduced considerably therefore efficient methods should be developed for future weak lensing deep surveys | [['the', 'vst', 'optical', 'imaging', 'of', 'the', 'cdfs', 'and', 'es1', 'fields', 'voice', 'survey', 'is', 'proposed', 'to', 'obtain', 'deep', 'optical', 'ugri', 'imaging', 'of', 'the', 'cdfs', 'and', 'es1', 'fields', 'using', 'the', 'vlt', 'survey', 'telescope', 'vst', 'at', 'present', 'the', 'observations', 'for', 'the', 'cdfs', 'field', 'have', 'been', 'completed', 'and', 'comprise', 'in', 'total', 'about', '49', 'deg2', 'down', 'to', 'r_mathrmabsim26', 'mag', 'in', 'the', 'companion', 'paper', 'by', 'fu', 'et', 'al', '2018', 'we', 'present', 'the', 'weak', 'lensing', 'shear', 'measurements', 'for', 'rband', 'images', 'with', 'seeing', 'le', '09', 'arcsec', 'in', 'this', 'paper', 'we', 'perform', 'image', 'simulations', 'to', 'calibrate', 'possible', 'biases', 'of', 'the', 'measured', 'shear', 'signals', 'statistically', 'the', 'properties', 'of', 'the', 'simulated', 'point', 'spread', 'function', 'psf', 'and', 'galaxies', 'show', 'good', 'agreements', 'with', 'those', 'of', 'observations', 'the', 'multiplicative', 'bias', 'is', 'calibrated', 'to', 'reach', 'an', 'accuracy', 'of', 'sim30', 'we', 'study', 'the', 'bias', 'sensitivities', 'to', 'the', 'undetected', 'faint', 'galaxies', 'and', 'to', 'the', 'neighboring', 'galaxies', 'we', 'find', 'that', 'undetected', 'galaxies', 'contribute', 'to', 'the', 'multiplicative', 'bias', 'at', 'the', 'level', 'of', 'sim03', 'further', 'analysis', 'shows', 'that', 'galaxies', 'with', 'lower', 'signaltonoise', 'ratio', 'snr', 'are', 'impacted', 'more', 'significantly', 'because', 'the', 'undetected', 'galaxies', 'skew', 'the', 'background', 'noise', 'distribution', 'for', 'the', 'neighboring', 'galaxies', 'we', 'find', 'that', 'although', 'most', 'have', 'been', 'rejected', 'in', 'the', 'shape', 'measurement', 'procedure', 'about', 'one', 'third', 'of', 'them', 'still', 'remain', 'in', 'the', 'final', 'shear', 'sample', 'they', 'show', 'a', 'larger', 'ellipticity', 'dispersion', 'and', 'contribute', 'to', 'sim02', 'of', 'the', 'multiplicative', 'bias', 'such', 'a', 'bias', 'can', 'be', 'removed', 'by', 'further', 'eliminating', 'these', 'neighboring', 'galaxies', 'but', 'the', 'effective', 'number', 'density', 'of', 'the', 'galaxies', 'can', 'be', 'reduced', 'considerably', 'therefore', 'efficient', 'methods', 'should', 'be', 'developed', 'for', 'future', 'weak', 'lensing', 'deep', 'surveys']] | [-0.06818895512762681, 0.05253926130136082, -0.07534204375309249, 0.09800227730051048, -0.0954836582582371, -0.06395719473743264, 0.047813222908834906, 0.4467282196032066, -0.18745296401948686, -0.3804193966912434, 0.06401703685622516, -0.30751870480895627, -0.06858342049972099, 0.19191495561333116, -0.0537888393518241, -0.0017263578155132778, 0.07295198620196577, -0.09291217557574603, -0.05140995674186806, -0.35645765478302743, 0.2502693862453395, 0.11505518727273881, 0.23426978663340503, -0.043297986286308834, 0.09144346709557188, -0.04236160083080404, -0.1224829773144687, 0.028445912961729384, -0.143757982323187, 0.023308882629727103, 0.2725839424348783, 0.099334949245859, 0.2615154521338934, -0.3451779265137898, -0.16769641656382922, 0.1081620960660717, 0.1840920127289114, 0.06914617224395567, -0.04439441520913605, -0.3211539864467055, 0.10969550474341411, -0.13909544108216376, -0.1277296773504977, -0.006207490671316491, -0.01336552646631996, 0.037413375926039674, -0.23261584582574227, 0.16203176035287828, 0.010491925389642881, 0.11188089927731483, -0.06466803690966438, -0.13467542245874511, -0.035406186161380186, 0.12076434086433009, 0.00024239269231318258, 0.09936517054893021, 0.16499527234620615, -0.2039635102273714, 0.008063483931233777, 0.3320949750934161, -0.07075292990935565, -0.06092732690055581, 0.1552636627053075, -0.19543410542914097, -0.16549109487483898, 0.13417007072153045, 0.19037326191433285, 0.06371877575110571, -0.1794103658118961, 0.021864155143517635, 0.005896638304122961, 0.2368902796045101, 0.04623231350206861, 0.05235226923672884, 0.25956674111897454, 0.08204801864602475, 0.08502388261053163, 0.09789636663398614, -0.26532884748737035, 0.03817586415314901, -0.24007969331795204, -0.07739438144672735, -0.1317339799079277, 0.08174680864127974, -0.10408275446582896, -0.097489287684142, 0.34738465820749603, 0.20565031407693146, 0.1980516959972424, 0.10690708034397925, 0.333967049428554, 0.1015800552474627, 0.13070706877145258, 0.051104680560164005, 0.36868924143559795, 0.14064700094270793, 0.058105739822392075, -0.17580325247482487, 0.030905980987967374, -0.03651934327607902] |
1,802.10284 | When fast and slow interfaces grow together: connection to the
half-space problem of the Kardar-Parisi-Zhang class | We study height fluctuations of interfaces in the $(1+1)$-dimensional
Kardar-Parisi-Zhang (KPZ) class, growing at different speeds in the left half
and the right half of space. Carrying out simulations of the discrete
polynuclear growth model with two different growth rates, combined with the
standard setting for the droplet, flat, and stationary geometries, we find that
the fluctuation properties at and near the boundary are described by the KPZ
half-space problem developed in the theoretical literature. In particular, in
the droplet case, the distribution at the boundary is given by the
largest-eigenvalue distribution of random matrices in the Gaussian symplectic
ensemble, often called the GSE Tracy-Widom distribution. We also characterize
crossover from the full-space statistics to the half-space one, which arises
when the difference between the two growth speeds is small.
| cond-mat.stat-mech math-ph math.MP math.PR | we study height fluctuations of interfaces in the 11dimensional kardarparisizhang kpz class growing at different speeds in the left half and the right half of space carrying out simulations of the discrete polynuclear growth model with two different growth rates combined with the standard setting for the droplet flat and stationary geometries we find that the fluctuation properties at and near the boundary are described by the kpz halfspace problem developed in the theoretical literature in particular in the droplet case the distribution at the boundary is given by the largesteigenvalue distribution of random matrices in the gaussian symplectic ensemble often called the gse tracywidom distribution we also characterize crossover from the fullspace statistics to the halfspace one which arises when the difference between the two growth speeds is small | [['we', 'study', 'height', 'fluctuations', 'of', 'interfaces', 'in', 'the', '11dimensional', 'kardarparisizhang', 'kpz', 'class', 'growing', 'at', 'different', 'speeds', 'in', 'the', 'left', 'half', 'and', 'the', 'right', 'half', 'of', 'space', 'carrying', 'out', 'simulations', 'of', 'the', 'discrete', 'polynuclear', 'growth', 'model', 'with', 'two', 'different', 'growth', 'rates', 'combined', 'with', 'the', 'standard', 'setting', 'for', 'the', 'droplet', 'flat', 'and', 'stationary', 'geometries', 'we', 'find', 'that', 'the', 'fluctuation', 'properties', 'at', 'and', 'near', 'the', 'boundary', 'are', 'described', 'by', 'the', 'kpz', 'halfspace', 'problem', 'developed', 'in', 'the', 'theoretical', 'literature', 'in', 'particular', 'in', 'the', 'droplet', 'case', 'the', 'distribution', 'at', 'the', 'boundary', 'is', 'given', 'by', 'the', 'largesteigenvalue', 'distribution', 'of', 'random', 'matrices', 'in', 'the', 'gaussian', 'symplectic', 'ensemble', 'often', 'called', 'the', 'gse', 'tracywidom', 'distribution', 'we', 'also', 'characterize', 'crossover', 'from', 'the', 'fullspace', 'statistics', 'to', 'the', 'halfspace', 'one', 'which', 'arises', 'when', 'the', 'difference', 'between', 'the', 'two', 'growth', 'speeds', 'is', 'small']] | [-0.07693022261409796, 0.1662210629415489, -0.06682157295922092, 0.05556264356710017, -0.0023010276156918024, -0.11572928161381982, -0.018154947264047788, 0.3332158163487243, -0.29319460091520416, -0.2217483617240823, 0.10957904973305589, -0.30094647183725537, -0.10217626244840465, 0.17470062444845663, -0.01592397885469272, 0.08591112828734078, -0.013442282925915811, -0.0009138183162886967, -0.086612067052683, -0.22547866058961827, 0.36993054469484227, 0.01498036314336251, 0.3432301168452746, 0.0070031229009519715, 0.07913955370895565, -0.021967277710520944, -0.003633579801472063, -0.0028356267448402797, -0.19419538056462787, 0.07798565260239321, 0.18755607032975138, 0.010021346014772737, 0.2498563630867374, -0.4084507042267757, -0.21531343795792307, 0.094911208091116, 0.14701506993444563, 0.10484532727733573, -0.023538821158017385, -0.25864755227988545, 0.06325395134198226, -0.11677043326199055, -0.1977136370531002, 0.06885236448990975, 0.020280413982971, 0.0348138745468969, -0.2361811304306106, 0.1283734290941362, 0.05352703639840375, 0.040823248503801896, -0.03994953865546358, -0.09462536698705408, -0.04816687044637032, 0.12609401970128023, 0.06066841532407661, -0.017576468936997908, 0.10955736593816198, -0.14590091915808387, -0.0542451076682426, 0.34131195544185794, -0.06824007586850388, -0.24279512586288673, 0.19226048927385966, -0.23375459536260298, -0.09422106939808343, 0.14517306842906183, 0.14687459000436834, 0.08510015910318078, -0.12830287399180612, 0.10910704711235765, -0.05365744373010284, 0.10524033588292293, 0.09012144610516784, -0.04962888310930526, 0.19185200825968915, 0.13480541994614714, 0.05249077933993869, 0.17661938386384485, -0.09551892237640311, -0.20356876550372258, -0.32612585207057554, -0.13849388793572898, -0.21005925053167482, 0.031531173396650736, -0.1449386600849206, -0.20287978615207497, 0.38418254927306095, 0.12899209456446098, 0.21464136536341422, 0.10225594394331322, 0.18948893291630256, 0.14169759034763935, 0.008572187736745953, 0.10572495006833428, 0.19630724812908343, 0.12135000182893271, 0.1209984323977269, -0.21101992678929613, 0.051115372117117856, 0.0752510041027337] |
1,802.10285 | Plasmonic absorption characteristics based on dumbbell-shaped graphene
metamaterial arrays | In this paper, we proposed a theoretical model in the far-infrared and
terahertz (THz) bands, which is a dumbbell-shaped graphene metamaterial arrays
with a combination of graphene nanorod and two semisphere-suspended heads. We
report a detailed theoretical investigation on how to enhance localized
electric field and the absorption in the dumbbell-shaped graphene metamaterial
arrays. The simulation results show that by changing the geometrical parameters
of the structure and the Fermi level of graphene, we can change the absorption
characteristics. Furthermore, we have discovered that the resonant wavelength
is insensitive to TM polarization. In addition, we also find that the
double-layer graphene arrays have better absorption characteristics than
single-layer graphene arrays. This work allows us to achieve tunable terahertz
absorber, and may also provide potential applications in optical filter and
biochemical sensing.
| physics.optics | in this paper we proposed a theoretical model in the farinfrared and terahertz thz bands which is a dumbbellshaped graphene metamaterial arrays with a combination of graphene nanorod and two semispheresuspended heads we report a detailed theoretical investigation on how to enhance localized electric field and the absorption in the dumbbellshaped graphene metamaterial arrays the simulation results show that by changing the geometrical parameters of the structure and the fermi level of graphene we can change the absorption characteristics furthermore we have discovered that the resonant wavelength is insensitive to tm polarization in addition we also find that the doublelayer graphene arrays have better absorption characteristics than singlelayer graphene arrays this work allows us to achieve tunable terahertz absorber and may also provide potential applications in optical filter and biochemical sensing | [['in', 'this', 'paper', 'we', 'proposed', 'a', 'theoretical', 'model', 'in', 'the', 'farinfrared', 'and', 'terahertz', 'thz', 'bands', 'which', 'is', 'a', 'dumbbellshaped', 'graphene', 'metamaterial', 'arrays', 'with', 'a', 'combination', 'of', 'graphene', 'nanorod', 'and', 'two', 'semispheresuspended', 'heads', 'we', 'report', 'a', 'detailed', 'theoretical', 'investigation', 'on', 'how', 'to', 'enhance', 'localized', 'electric', 'field', 'and', 'the', 'absorption', 'in', 'the', 'dumbbellshaped', 'graphene', 'metamaterial', 'arrays', 'the', 'simulation', 'results', 'show', 'that', 'by', 'changing', 'the', 'geometrical', 'parameters', 'of', 'the', 'structure', 'and', 'the', 'fermi', 'level', 'of', 'graphene', 'we', 'can', 'change', 'the', 'absorption', 'characteristics', 'furthermore', 'we', 'have', 'discovered', 'that', 'the', 'resonant', 'wavelength', 'is', 'insensitive', 'to', 'tm', 'polarization', 'in', 'addition', 'we', 'also', 'find', 'that', 'the', 'doublelayer', 'graphene', 'arrays', 'have', 'better', 'absorption', 'characteristics', 'than', 'singlelayer', 'graphene', 'arrays', 'this', 'work', 'allows', 'us', 'to', 'achieve', 'tunable', 'terahertz', 'absorber', 'and', 'may', 'also', 'provide', 'potential', 'applications', 'in', 'optical', 'filter', 'and', 'biochemical', 'sensing']] | [-0.14620896111502169, 0.10024965258691317, -0.034529466790935166, -0.04090043280560237, -0.07393568215103677, -0.142063208282567, 0.07112976448843256, 0.5128812983345526, -0.2252088816370815, -0.2927912251092494, -0.0011427025642031087, -0.2841995803228481, -0.2393620156754668, 0.21117232234324687, -0.004092376829626468, 0.028468643524684013, 0.01581604227853509, -0.13454497054447598, -0.016541845285190412, -0.1568751191899467, 0.24985858260367352, 0.09989682765892492, 0.3375194038909215, 0.09366516532519689, 0.04432198779406742, -0.013710535797648705, 0.06542068764997216, 0.025940993736283138, -0.13443759590148918, 0.14523713086516812, 0.2477314161423307, -0.055353283860649055, 0.20942818159774806, -0.44941299663713347, -0.2235857736874515, 0.008837223078052585, 0.14870070278859482, 0.14439686957943754, -0.07800386372165612, -0.24861372803122953, 0.07467604480827084, -0.11233971194865612, -0.11275199734104367, -0.057150384283158925, -0.03406793533134847, 0.035078882203043366, -0.22935009828920905, -0.016050895311099548, 0.02904178538502982, 0.036256207848111024, -0.09421196536277421, -0.09775796679493326, -0.03705141754247821, 0.041582556828283344, -0.030297841487201646, -0.030091613782524992, 0.21323828394166552, -0.09541211364826617, -0.11340789451407125, 0.36761032903584867, -0.09382053304053932, -0.14284788648096414, 0.17920174618036702, -0.20261611025064039, -0.05907773981945446, 0.15155508457324826, 0.17739677228964865, 0.07206973634087123, -0.1525781002200137, 0.04880061538334793, -0.06386615357791575, 0.22911204914920605, 0.11564202575156322, 0.1395581782508928, 0.2560659864809937, 0.20414372452606375, 0.04553682378923091, 0.16528567363902066, -0.1579683880187356, 0.05966058382854009, -0.21105533829675271, -0.17231232326191206, -0.18792689015659003, 0.05172507534376704, -0.0661409889305315, -0.19817307516842939, 0.4737316234753682, 0.21077972807509537, 0.14086012725028224, -0.025365198689262167, 0.30879322856378094, 0.11534536307176145, 0.07509933130887265, -0.016444166126446082, 0.3241546832204152, 0.14259436237267575, 0.13001914253959862, -0.2296194872389046, -0.008649482701618512, -0.07768797072349116] |
1,802.10286 | Formulation of the normal forms of Turing-Hopf bifurcation in
reaction-diffusion systems with time delay | The normal forms up to the third order for a Hopf-steady state bifurcation of
a general system of partial functional differential equations (PFDEs) is
derived based on the center manifold and normal form theory of PFDEs. This is a
codimension-two degenerate bifurcation with the characteristic equation having
a pair of simple purely imaginary roots and a simple zero root, and the
corresponding eigenfunctions may be spatially inhomogeneous. The PFDEs are
reduced to a three-dimensional system of ordinary differential equations and
precise dynamics near bifurcation point can be revealed by two unfolding
parameters. The normal forms are explicitly written as functions of the
Fr\'echet derivatives up to the third orders and characteristic functions of
the original PFDEs, and they are presented in a concise matrix notation, which
greatly eases the applications to the original PFDEs and is convenient for
computer implementation. This provides a user-friendly approach of showing the
existence and stability of patterned stationary and time-periodic solutions
with spatial heterogeneity when the parameters are near a Turing-Hopf
bifurcation point, and it can also be applied to reaction-diffusion systems
without delay and the retarded functional differential equations without
diffusion.
| math.DS | the normal forms up to the third order for a hopfsteady state bifurcation of a general system of partial functional differential equations pfdes is derived based on the center manifold and normal form theory of pfdes this is a codimensiontwo degenerate bifurcation with the characteristic equation having a pair of simple purely imaginary roots and a simple zero root and the corresponding eigenfunctions may be spatially inhomogeneous the pfdes are reduced to a threedimensional system of ordinary differential equations and precise dynamics near bifurcation point can be revealed by two unfolding parameters the normal forms are explicitly written as functions of the frechet derivatives up to the third orders and characteristic functions of the original pfdes and they are presented in a concise matrix notation which greatly eases the applications to the original pfdes and is convenient for computer implementation this provides a userfriendly approach of showing the existence and stability of patterned stationary and timeperiodic solutions with spatial heterogeneity when the parameters are near a turinghopf bifurcation point and it can also be applied to reactiondiffusion systems without delay and the retarded functional differential equations without diffusion | [['the', 'normal', 'forms', 'up', 'to', 'the', 'third', 'order', 'for', 'a', 'hopfsteady', 'state', 'bifurcation', 'of', 'a', 'general', 'system', 'of', 'partial', 'functional', 'differential', 'equations', 'pfdes', 'is', 'derived', 'based', 'on', 'the', 'center', 'manifold', 'and', 'normal', 'form', 'theory', 'of', 'pfdes', 'this', 'is', 'a', 'codimensiontwo', 'degenerate', 'bifurcation', 'with', 'the', 'characteristic', 'equation', 'having', 'a', 'pair', 'of', 'simple', 'purely', 'imaginary', 'roots', 'and', 'a', 'simple', 'zero', 'root', 'and', 'the', 'corresponding', 'eigenfunctions', 'may', 'be', 'spatially', 'inhomogeneous', 'the', 'pfdes', 'are', 'reduced', 'to', 'a', 'threedimensional', 'system', 'of', 'ordinary', 'differential', 'equations', 'and', 'precise', 'dynamics', 'near', 'bifurcation', 'point', 'can', 'be', 'revealed', 'by', 'two', 'unfolding', 'parameters', 'the', 'normal', 'forms', 'are', 'explicitly', 'written', 'as', 'functions', 'of', 'the', 'frechet', 'derivatives', 'up', 'to', 'the', 'third', 'orders', 'and', 'characteristic', 'functions', 'of', 'the', 'original', 'pfdes', 'and', 'they', 'are', 'presented', 'in', 'a', 'concise', 'matrix', 'notation', 'which', 'greatly', 'eases', 'the', 'applications', 'to', 'the', 'original', 'pfdes', 'and', 'is', 'convenient', 'for', 'computer', 'implementation', 'this', 'provides', 'a', 'userfriendly', 'approach', 'of', 'showing', 'the', 'existence', 'and', 'stability', 'of', 'patterned', 'stationary', 'and', 'timeperiodic', 'solutions', 'with', 'spatial', 'heterogeneity', 'when', 'the', 'parameters', 'are', 'near', 'a', 'turinghopf', 'bifurcation', 'point', 'and', 'it', 'can', 'also', 'be', 'applied', 'to', 'reactiondiffusion', 'systems', 'without', 'delay', 'and', 'the', 'retarded', 'functional', 'differential', 'equations', 'without', 'diffusion']] | [-0.16227874439707732, 0.06657038189478238, -0.10491812799404808, 0.06285112043083173, -0.1057004116383446, -0.1335258359851485, 0.0107036246563293, 0.29053416800620485, -0.31053437582680327, -0.24384995616653704, 0.12534556425995827, -0.2705791475360884, -0.1893419653144889, 0.203448751475662, -0.014531126635567469, 0.06618438615559545, 0.040895695842922054, 0.06425292359884172, -0.11335460763900257, -0.21191218089969718, 0.35422053271132636, -0.023364347714512426, 0.22968049187531925, 0.0007321704378261923, 0.11606863306531494, -0.02333588025814052, 0.014486652208158477, 0.02310746936451265, -0.11890529059956877, 0.11015328927336629, 0.2469123918872842, 0.05949887320496401, 0.2361767262638731, -0.41664252114447364, -0.17670740771112356, 0.06694741651819232, 0.1421156078315574, 0.12985027413678302, -0.013792605129977, -0.30176183096516657, 0.08764785487219731, -0.13481647204508118, -0.20894903882859864, -0.10036869341243597, 0.013589631571847807, 0.058761570321266506, -0.27705760961547893, 0.08910343369931595, 0.04747678624231986, 0.07259261306938043, -0.07059227557165577, -0.07202611050884772, -0.07235779886676826, 0.095476089112173, -0.01158732613349423, -0.003171577439568738, 0.09587846929845549, -0.10263525933415733, -0.07446260359244082, 0.35401302214990804, -0.06773246442064902, -0.2652759205520073, 0.18358173489789753, -0.128865639517273, -0.06799210653575585, 0.17060525016112124, 0.14950744931730517, 0.12140727461873489, -0.17811671914297772, 0.09811803187713036, 0.016714447327356607, 0.1394562600146267, 0.08498195527908317, -0.03603935232329964, 0.16332598687722322, 0.1342023944016546, 0.07314852759102608, 0.11469964159435946, -0.009084919122680226, -0.14896055658218416, -0.3285591740181102, -0.1707937861817645, -0.11452297330833972, 0.07280695495907874, -0.11474204391238273, -0.20717157564439717, 0.41247759359380737, 0.06305874747978672, 0.1801526951777903, 0.03565610058413928, 0.26373817609065275, 0.22004814138125509, 0.042931215122297285, 0.05063626072366792, 0.18423145181215542, 0.16342063335686882, 0.10775910413769238, -0.19524291825834364, 0.05025717122032043, 0.09099655097878394] |
1,802.10287 | Particle Number Dependence of The $N$-Body Simulations of Moon Formation | The formation of the Moon from the circumterrestrial disk has been
investigated by using $N$-body simulations with the number $N$ of particles
limited from $10^4$ to $10^5$. We develop an $N$-body simulation code on
multiple Pezy-SC processors and deploy FDPS (Framework for Developing Particle
Simulators) to deal with large number of particles. We execute several high-
and extra-high-resolution $N$-body simulations of lunar accretion from a
circumterrestrial disk of debris generated by a giant impact on Earth. The
number of particles is up to $10^7$, in which 1 particle corresponds to a 10
km-size satellitesimal. We find that the spiral structures inside the Roche
limit radius differ between low-resolution simulations ($N \leq10^5$) and
high-resolution simulations ($N \geq10^6$). According to this difference,
angular momentum fluxes, which determine the accretion timescale of the Moon
also depend on the numerical resolution.
| astro-ph.EP astro-ph.IM | the formation of the moon from the circumterrestrial disk has been investigated by using nbody simulations with the number n of particles limited from 104 to 105 we develop an nbody simulation code on multiple pezysc processors and deploy fdps framework for developing particle simulators to deal with large number of particles we execute several high and extrahighresolution nbody simulations of lunar accretion from a circumterrestrial disk of debris generated by a giant impact on earth the number of particles is up to 107 in which 1 particle corresponds to a 10 kmsize satellitesimal we find that the spiral structures inside the roche limit radius differ between lowresolution simulations n leq105 and highresolution simulations n geq106 according to this difference angular momentum fluxes which determine the accretion timescale of the moon also depend on the numerical resolution | [['the', 'formation', 'of', 'the', 'moon', 'from', 'the', 'circumterrestrial', 'disk', 'has', 'been', 'investigated', 'by', 'using', 'nbody', 'simulations', 'with', 'the', 'number', 'n', 'of', 'particles', 'limited', 'from', '104', 'to', '105', 'we', 'develop', 'an', 'nbody', 'simulation', 'code', 'on', 'multiple', 'pezysc', 'processors', 'and', 'deploy', 'fdps', 'framework', 'for', 'developing', 'particle', 'simulators', 'to', 'deal', 'with', 'large', 'number', 'of', 'particles', 'we', 'execute', 'several', 'high', 'and', 'extrahighresolution', 'nbody', 'simulations', 'of', 'lunar', 'accretion', 'from', 'a', 'circumterrestrial', 'disk', 'of', 'debris', 'generated', 'by', 'a', 'giant', 'impact', 'on', 'earth', 'the', 'number', 'of', 'particles', 'is', 'up', 'to', '107', 'in', 'which', '1', 'particle', 'corresponds', 'to', 'a', '10', 'kmsize', 'satellitesimal', 'we', 'find', 'that', 'the', 'spiral', 'structures', 'inside', 'the', 'roche', 'limit', 'radius', 'differ', 'between', 'lowresolution', 'simulations', 'n', 'leq105', 'and', 'highresolution', 'simulations', 'n', 'geq106', 'according', 'to', 'this', 'difference', 'angular', 'momentum', 'fluxes', 'which', 'determine', 'the', 'accretion', 'timescale', 'of', 'the', 'moon', 'also', 'depend', 'on', 'the', 'numerical', 'resolution']] | [-0.09712585457428186, 0.14518868512122599, -0.06936284941448657, 0.03106958946834008, -0.03988887975337329, -0.037761957767522995, 0.005363016434151817, 0.3352771589325534, -0.19726400876210795, -0.4165816809775101, 0.06743773764637472, -0.27714756598903073, -0.037077602473329065, 0.20948474577076182, -0.014036085607518477, 0.04185878513208418, 0.10712159333957566, -0.05027849772186191, -0.043151487723527546, -0.2312435575571187, 0.2551913911666445, 0.11769825183544998, 0.11718187131056632, -0.019649529664052857, 0.1025606673590287, -0.07107558468425715, -0.042020419029587947, -0.02947027381316595, -0.21314562247161692, 0.04085875230806845, 0.17900235885926694, 0.10315507733676997, 0.2383398652214695, -0.4785925858826549, -0.1784528158950033, 0.050455486827909395, 0.1784383712336421, 0.06433152297201256, -0.06577269505381722, -0.22835807286685816, 0.11928060251046661, -0.23881111972430652, -0.13079119292486682, 0.010604685156916578, 0.05401303009302528, 0.0411339095276263, -0.2542674838185862, 0.04521052151448438, -0.009003108550139048, 0.07014922037444733, -0.041515562786824174, -0.08161341616262992, -0.02873473566853338, 0.09646620463786854, 0.037248697055986636, 0.01849530377873668, 0.19629742429005326, -0.08297010094996679, -0.0625909968106835, 0.40535762872960834, -0.049660003809603274, -0.15571662302956812, 0.24491160960385092, -0.20867582218100628, -0.09453517718033658, 0.19200559718603338, 0.2017732531069433, 0.12351611490464873, -0.08238189492926554, 0.0658783379549816, -0.06427192442998704, 0.20483868140037412, 0.09952273386772033, -0.01700217788349147, 0.3005908087447838, 0.1576837740165906, 0.015665080706175002, 0.08681123062140411, -0.18853829770728395, -0.11373893707231791, -0.19178186248598783, -0.10778496208691245, -0.22709429417823063, 0.08684905128622497, -0.11382148828049173, -0.11413458505024512, 0.30609894829319306, 0.17250040639191866, 0.22201673160479576, 0.061136157377795486, 0.31089183472924764, 0.036416547303950345, 0.0765516926224033, 0.12192317726720056, 0.23775838598160556, 0.12852820442230614, 0.07299787666372679, -0.2626511018912963, -0.017644283211686543, 0.021459571444601925] |
1,802.10288 | Beating the classical precision limit with spin-1 Dicke state of more
than 10000 atoms | Interferometry is a paradigm for most precision measurements. Using $N$
uncorrelated particles, the achievable precision for a two-mode (two-path)
interferometer is bounded by the standard quantum limit (SQL), $1/\sqrt{N}$,
due to the discrete (quanta) nature of individual measurements. Despite being a
challenging benchmark, the two-mode SQL has been approached in a number of
systems, including the LIGO and today's best atomic clocks. Employing
multi-mode interferometry, the SQL becomes $1/[(M-1)\sqrt{N}]$ using M modes.
Higher precision can also be achieved using entangled particles such that
quantum noises from individual particles cancel out. In this work, we
demonstrate an interferometric precision of $2.42^{+1.76}_{-1.29}\,$dB beyond
the three-mode SQL, using balanced spin-1 (three-mode) Dicke states containing
thousands of entangled atoms. The input quantum states are deterministically
generated by controlled quantum phase transition and exhibit close to ideal
quality. Our work shines light on the pursuit of quantum metrology beyond SQL.
| cond-mat.quant-gas quant-ph | interferometry is a paradigm for most precision measurements using n uncorrelated particles the achievable precision for a twomode twopath interferometer is bounded by the standard quantum limit sql 1sqrtn due to the discrete quanta nature of individual measurements despite being a challenging benchmark the twomode sql has been approached in a number of systems including the ligo and todays best atomic clocks employing multimode interferometry the sql becomes 1m1sqrtn using m modes higher precision can also be achieved using entangled particles such that quantum noises from individual particles cancel out in this work we demonstrate an interferometric precision of 242176_129db beyond the threemode sql using balanced spin1 threemode dicke states containing thousands of entangled atoms the input quantum states are deterministically generated by controlled quantum phase transition and exhibit close to ideal quality our work shines light on the pursuit of quantum metrology beyond sql | [['interferometry', 'is', 'a', 'paradigm', 'for', 'most', 'precision', 'measurements', 'using', 'n', 'uncorrelated', 'particles', 'the', 'achievable', 'precision', 'for', 'a', 'twomode', 'twopath', 'interferometer', 'is', 'bounded', 'by', 'the', 'standard', 'quantum', 'limit', 'sql', '1sqrtn', 'due', 'to', 'the', 'discrete', 'quanta', 'nature', 'of', 'individual', 'measurements', 'despite', 'being', 'a', 'challenging', 'benchmark', 'the', 'twomode', 'sql', 'has', 'been', 'approached', 'in', 'a', 'number', 'of', 'systems', 'including', 'the', 'ligo', 'and', 'todays', 'best', 'atomic', 'clocks', 'employing', 'multimode', 'interferometry', 'the', 'sql', 'becomes', '1m1sqrtn', 'using', 'm', 'modes', 'higher', 'precision', 'can', 'also', 'be', 'achieved', 'using', 'entangled', 'particles', 'such', 'that', 'quantum', 'noises', 'from', 'individual', 'particles', 'cancel', 'out', 'in', 'this', 'work', 'we', 'demonstrate', 'an', 'interferometric', 'precision', 'of', '242176_129db', 'beyond', 'the', 'threemode', 'sql', 'using', 'balanced', 'spin1', 'threemode', 'dicke', 'states', 'containing', 'thousands', 'of', 'entangled', 'atoms', 'the', 'input', 'quantum', 'states', 'are', 'deterministically', 'generated', 'by', 'controlled', 'quantum', 'phase', 'transition', 'and', 'exhibit', 'close', 'to', 'ideal', 'quality', 'our', 'work', 'shines', 'light', 'on', 'the', 'pursuit', 'of', 'quantum', 'metrology', 'beyond', 'sql']] | [-0.12820000040273255, 0.23932716776415383, -0.04858271198483979, 0.019319965273721495, 0.021612663100427993, -0.21836164588486398, 0.09305240420813483, 0.34577513150089273, -0.23495691256366436, -0.2961549108743772, 0.046887663070933075, -0.30389906695255864, -0.047277839303218556, 0.2599094427382847, -0.031012032988604967, 0.15987314638548197, 0.09782623655286495, 0.015238027322802928, -0.02244351639321165, -0.22549766221106496, 0.24175412606421884, 0.06198719818832131, 0.287235598724622, -0.045032357508837655, 0.0907580524494129, 0.01912877778685489, 0.034860738150537716, -0.012807978509267518, -0.04484097611011939, 0.067056764942151, 0.26778337035744965, 0.11893188298380301, 0.24923530753727977, -0.4191199272245794, -0.19359197906036113, 0.11453158271070969, 0.15260132639978238, 0.20587032745833267, -0.012301678011369716, -0.39144231825806464, 0.004756416991952207, -0.1876655247476004, -0.11462535464914737, -0.11184281125742863, -0.030262930514095548, -0.03033394144418148, -0.2442182924474713, 0.055839590941371815, 0.04450536727696865, 0.06389631719777843, 0.0692158714978845, -0.05640929398107362, 0.053435486742992186, 0.09972954833215766, -0.12098363815510477, 0.004147325378640757, 0.17924598994879767, -0.1527046092437463, -0.19081347029968784, 0.4059240440907237, -0.1235034608353789, -0.16677679344067364, 0.15527227200189983, -0.12402335584971245, -0.07851341999888134, 0.09689449919778463, 0.13107997114555195, 0.0905345557316046, -0.11791345012094175, 0.0859642016287841, -0.01447692810447066, 0.2561256339923329, 0.13459664803336968, 0.17365831183920893, 0.26068175586357295, 0.18087070334338015, 0.025973898607755563, 0.1771334350822246, -0.09971706392943624, -0.1307846436837128, -0.24453540182822234, -0.1223765805887117, -0.26992181772561546, 0.08232212685931058, -0.0675643107907153, -0.1099104725501754, 0.34155703724811337, 0.1811380829707674, 0.12507021315786596, -0.004741858412557236, 0.35922618445100174, 0.1067767862769469, 0.049239552938021146, 0.025992129987978434, 0.3197899329104832, 0.14997771896513087, 0.06000245647045777, -0.20433106807294998, 0.01190332270396704, -0.01952617909155633] |
1,802.10289 | Poincar\'{e} parameters and principal component analysis of Heart rate
variability of subjects with health disorder | Heart rate variability,important marker for modulation of autonomic nervous
system is studied for diabetic,hypertensive and control group of
subjects.Lagged Poincar\'{e} plot of heart rate(HR),method of principal
component analysis and auto-correlation of HR fluctuation are used to analyze
HR obtained from ECG signal recorded over short time duration.The parameters
$(SD1)$,$(SD2)$ and their ratio $(SD12)$,characterizing the Poincar\'{e} plot
reveal a significant reduction of their values for diabetic and hypertensive
subjects compared to the corresponding results of control one.The slope and the
curvature of the plot of these parameters with lagged number exhibit similar
trend.In particular,the curvature of $(SD12)$ for the control group differs
widely from that of other groups.The principal component analysis is used for
analysing multi-dimensional data set resulting from the Poincar\'{e} plot for
all subjects.The correlation matrix points out significant correlation between
slope and curvature.The analysis demonstrates that three groups are well
separated in the domain of two significant principal components.The
auto-correlation of HR fluctuation exhibits highly correlated pattern for
subjects with health disorder compared to that of control subject.
| physics.med-ph | heart rate variabilityimportant marker for modulation of autonomic nervous system is studied for diabetichypertensive and control group of subjectslagged poincare plot of heart ratehrmethod of principal component analysis and autocorrelation of hr fluctuation are used to analyze hr obtained from ecg signal recorded over short time durationthe parameters sd1sd2 and their ratio sd12characterizing the poincare plot reveal a significant reduction of their values for diabetic and hypertensive subjects compared to the corresponding results of control onethe slope and the curvature of the plot of these parameters with lagged number exhibit similar trendin particularthe curvature of sd12 for the control group differs widely from that of other groupsthe principal component analysis is used for analysing multidimensional data set resulting from the poincare plot for all subjectsthe correlation matrix points out significant correlation between slope and curvaturethe analysis demonstrates that three groups are well separated in the domain of two significant principal componentsthe autocorrelation of hr fluctuation exhibits highly correlated pattern for subjects with health disorder compared to that of control subject | [['heart', 'rate', 'variabilityimportant', 'marker', 'for', 'modulation', 'of', 'autonomic', 'nervous', 'system', 'is', 'studied', 'for', 'diabetichypertensive', 'and', 'control', 'group', 'of', 'subjectslagged', 'poincare', 'plot', 'of', 'heart', 'ratehrmethod', 'of', 'principal', 'component', 'analysis', 'and', 'autocorrelation', 'of', 'hr', 'fluctuation', 'are', 'used', 'to', 'analyze', 'hr', 'obtained', 'from', 'ecg', 'signal', 'recorded', 'over', 'short', 'time', 'durationthe', 'parameters', 'sd1sd2', 'and', 'their', 'ratio', 'sd12characterizing', 'the', 'poincare', 'plot', 'reveal', 'a', 'significant', 'reduction', 'of', 'their', 'values', 'for', 'diabetic', 'and', 'hypertensive', 'subjects', 'compared', 'to', 'the', 'corresponding', 'results', 'of', 'control', 'onethe', 'slope', 'and', 'the', 'curvature', 'of', 'the', 'plot', 'of', 'these', 'parameters', 'with', 'lagged', 'number', 'exhibit', 'similar', 'trendin', 'particularthe', 'curvature', 'of', 'sd12', 'for', 'the', 'control', 'group', 'differs', 'widely', 'from', 'that', 'of', 'other', 'groupsthe', 'principal', 'component', 'analysis', 'is', 'used', 'for', 'analysing', 'multidimensional', 'data', 'set', 'resulting', 'from', 'the', 'poincare', 'plot', 'for', 'all', 'subjectsthe', 'correlation', 'matrix', 'points', 'out', 'significant', 'correlation', 'between', 'slope', 'and', 'curvaturethe', 'analysis', 'demonstrates', 'that', 'three', 'groups', 'are', 'well', 'separated', 'in', 'the', 'domain', 'of', 'two', 'significant', 'principal', 'componentsthe', 'autocorrelation', 'of', 'hr', 'fluctuation', 'exhibits', 'highly', 'correlated', 'pattern', 'for', 'subjects', 'with', 'health', 'disorder', 'compared', 'to', 'that', 'of', 'control', 'subject']] | [-0.12133749765286475, 0.04949143728389359, -0.1251266148533488, 0.06349681119037862, -0.019714794685075313, -0.15583843181059223, 0.021176421987525198, 0.34678681358051155, -0.24881070854579224, -0.28783964629020586, 0.11541291090507451, -0.30707102321824176, -0.14741474571982743, 0.27531793044397124, -0.05345766624596752, 0.055247790375587, 0.02756508916363488, 0.05245183452814357, -0.055362320063854165, -0.17640634463254015, 0.2817034931209536, 0.01793067875019286, 0.3129704871594354, -0.029881791076565415, 0.06568672471136476, 0.04057594804800357, -0.1106975641026863, 0.0030937634126777633, -0.07114348507605393, 0.09867743717939133, 0.27000669992448373, 0.10000456869027313, 0.21594173629066826, -0.35557012841174446, -0.18438997650576502, 0.11890914923522944, 0.14843467563494211, 0.008957253228643058, -0.019660497350865447, -0.27999017724514375, 0.10105638419720632, -0.09811412360889975, -0.08990267685465055, -0.06542711517483249, 0.06719809721188438, 0.03147094535215953, -0.24561623290733056, 0.18632867194591435, -0.011652612429181183, 0.176622881140146, -0.09826021076519226, -0.14201029615669317, -0.062240294407892194, 0.18047694773643197, 0.10948530718541193, 0.035187844994742375, 0.16308563041650218, -0.0966835141345071, -0.09007457441026574, 0.3310090905446329, -0.05144385444603999, -0.11998639734358424, 0.16410690332895123, -0.1586235371320566, -0.11165550086980709, 0.13672661674956296, 0.1805025918846145, 0.043980906171333274, -0.12453946815573691, -0.004271340279776695, 0.020186232707612675, 0.22799793475043076, 0.05904694208386642, 0.010851336898926048, 0.15844901673564757, 0.13581570710866125, 0.016629908061413852, 0.11954434974913854, -0.14022536606838307, -0.09930477703254624, -0.26779102839897445, -0.1392392658536541, -0.1346169898852729, 0.008173647856219086, -0.1463572844817306, -0.16364614622966375, 0.44032059079840963, 0.1161286680482006, 0.18253216258376653, 0.079445696208787, 0.21996213560693978, 0.09620074052688807, 0.07669980976627105, 0.0257879363913319, 0.21904821714162137, 0.13994372135925073, 0.06727714415418307, -0.2542434187769821, 0.08491073036566377, 0.01565869380319333] |
1,802.1029 | A large sample of shear selected clusters from the Hyper Suprime-Cam
Subaru Strategic Program S16A wide field mass maps | We present the result of searching for clusters of galaxies based on weak
gravitational lensing analysis of the $\sim 160$~deg$^2$ area surveyed by Hyper
Suprime-Cam (HSC) as a Subaru Strategic Program. HSC is a new prime focus
optical imager with a 1.5 diameter field of view on the 8.2-meter Subaru
telescope. The superb median seeing on the HSC $i$-band images of $0.56$ arcsec
allows the reconstruction of high angular resolution mass maps via weak
lensing, which is crucial for the weak lensing cluster search. We identify 65
mass map peaks with signal-to-noise (SN) ratio larger than 4.7, and carefully
examine their properties by cross-matching the clusters with optical and X-ray
cluster catalogs. We find that all the 39 peaks with SN$>5.1$ have counterparts
in the optical cluster catalogs, and only 2 out of the 65 peaks are probably
false positives. The upper limits of X-ray luminosities from ROSAT All Sky
Survey (RASS) imply the existence of an X-ray under-luminous cluster
population. We show that the X-rays from the shear selected clusters can be
statistically detected by stacking the RASS images. The inferred average X-ray
luminosity is about half that of the X-ray selected clusters of the same mass.
The radial profile of the dark matter distribution derived from the stacking
analysis is well modeled by the Navarro-Frenk-White profile with a small
concentration parameter value of $c_{500}\sim 2.5$, which suggests that the
selection bias on the orientation or the internal structure for our shear
selected cluster sample is not strong.
| astro-ph.CO | we present the result of searching for clusters of galaxies based on weak gravitational lensing analysis of the sim 160deg2 area surveyed by hyper suprimecam hsc as a subaru strategic program hsc is a new prime focus optical imager with a 15 diameter field of view on the 82meter subaru telescope the superb median seeing on the hsc iband images of 056 arcsec allows the reconstruction of high angular resolution mass maps via weak lensing which is crucial for the weak lensing cluster search we identify 65 mass map peaks with signaltonoise sn ratio larger than 47 and carefully examine their properties by crossmatching the clusters with optical and xray cluster catalogs we find that all the 39 peaks with sn51 have counterparts in the optical cluster catalogs and only 2 out of the 65 peaks are probably false positives the upper limits of xray luminosities from rosat all sky survey rass imply the existence of an xray underluminous cluster population we show that the xrays from the shear selected clusters can be statistically detected by stacking the rass images the inferred average xray luminosity is about half that of the xray selected clusters of the same mass the radial profile of the dark matter distribution derived from the stacking analysis is well modeled by the navarrofrenkwhite profile with a small concentration parameter value of c_500sim 25 which suggests that the selection bias on the orientation or the internal structure for our shear selected cluster sample is not strong | [['we', 'present', 'the', 'result', 'of', 'searching', 'for', 'clusters', 'of', 'galaxies', 'based', 'on', 'weak', 'gravitational', 'lensing', 'analysis', 'of', 'the', 'sim', '160deg2', 'area', 'surveyed', 'by', 'hyper', 'suprimecam', 'hsc', 'as', 'a', 'subaru', 'strategic', 'program', 'hsc', 'is', 'a', 'new', 'prime', 'focus', 'optical', 'imager', 'with', 'a', '15', 'diameter', 'field', 'of', 'view', 'on', 'the', '82meter', 'subaru', 'telescope', 'the', 'superb', 'median', 'seeing', 'on', 'the', 'hsc', 'iband', 'images', 'of', '056', 'arcsec', 'allows', 'the', 'reconstruction', 'of', 'high', 'angular', 'resolution', 'mass', 'maps', 'via', 'weak', 'lensing', 'which', 'is', 'crucial', 'for', 'the', 'weak', 'lensing', 'cluster', 'search', 'we', 'identify', '65', 'mass', 'map', 'peaks', 'with', 'signaltonoise', 'sn', 'ratio', 'larger', 'than', '47', 'and', 'carefully', 'examine', 'their', 'properties', 'by', 'crossmatching', 'the', 'clusters', 'with', 'optical', 'and', 'xray', 'cluster', 'catalogs', 'we', 'find', 'that', 'all', 'the', '39', 'peaks', 'with', 'sn51', 'have', 'counterparts', 'in', 'the', 'optical', 'cluster', 'catalogs', 'and', 'only', '2', 'out', 'of', 'the', '65', 'peaks', 'are', 'probably', 'false', 'positives', 'the', 'upper', 'limits', 'of', 'xray', 'luminosities', 'from', 'rosat', 'all', 'sky', 'survey', 'rass', 'imply', 'the', 'existence', 'of', 'an', 'xray', 'underluminous', 'cluster', 'population', 'we', 'show', 'that', 'the', 'xrays', 'from', 'the', 'shear', 'selected', 'clusters', 'can', 'be', 'statistically', 'detected', 'by', 'stacking', 'the', 'rass', 'images', 'the', 'inferred', 'average', 'xray', 'luminosity', 'is', 'about', 'half', 'that', 'of', 'the', 'xray', 'selected', 'clusters', 'of', 'the', 'same', 'mass', 'the', 'radial', 'profile', 'of', 'the', 'dark', 'matter', 'distribution', 'derived', 'from', 'the', 'stacking', 'analysis', 'is', 'well', 'modeled', 'by', 'the', 'navarrofrenkwhite', 'profile', 'with', 'a', 'small', 'concentration', 'parameter', 'value', 'of', 'c_500sim', '25', 'which', 'suggests', 'that', 'the', 'selection', 'bias', 'on', 'the', 'orientation', 'or', 'the', 'internal', 'structure', 'for', 'our', 'shear', 'selected', 'cluster', 'sample', 'is', 'not', 'strong']] | [-0.07106645489054755, 0.05439621690293723, -0.07173485494203623, 0.10049221393267994, -0.09967372230182182, -0.04862850135177132, 0.07370560219590892, 0.4200918704280308, -0.1779537644290282, -0.4040497639254341, 0.09000446430238994, -0.33371148154815533, -0.02803884069359581, 0.2065035473258136, 0.019740701668206753, -0.01924896594307317, 0.08332593259742348, -0.060264604109125514, -0.03508604902534107, -0.31625033407027237, 0.30646603217166735, 0.10639028165989169, 0.24748268093520065, -0.06323603455855595, 0.08746447765913876, -0.002813526090874329, -0.1133607185665306, 0.04785513053686032, -0.14431712301166413, 0.05323457897629407, 0.1852845352709036, 0.13214841631157853, 0.23020227989409028, -0.27023931419674085, -0.153565098175673, 0.0798607091330076, 0.17249315470547938, 0.025272989324156794, -0.06328407396766834, -0.33627070576649126, 0.10246253167506217, -0.13645128147571056, -0.14709774114388396, 0.048987344914396116, -0.0021664844679161605, 0.10557761324410576, -0.19978610220946355, 0.15478271859171763, -0.01685922791588885, 0.11300083612008077, -0.14592998366300358, -0.1385159643515528, -0.06797547864668994, 0.06625399145778511, -0.027896527141309913, 0.06797878541160239, 0.18480306708753655, -0.18694273591594301, -0.022202190619370923, 0.3726793810255765, -0.050144749280262635, 0.007236598871602881, 0.1547753909911309, -0.20758961302387277, -0.1857930197024612, 0.1612391533870515, 0.14151594189953484, 0.09166332066288158, -0.1754095652370195, 0.03200455334693443, -0.03679361299429906, 0.28842720232631375, 0.053812038405169925, 0.06476877512773727, 0.32120793282311805, 0.0841129218948422, 0.08751801161731525, 0.1433032167804753, -0.3160101984404179, 0.04408686883876297, -0.24994042226893268, -0.05572428868712509, -0.15178354742143652, 0.08068510800098662, -0.15894162661484226, -0.14087519113057695, 0.32160219545495067, 0.10409923448753582, 0.203582598697167, 0.08104562306420772, 0.292518879673103, 0.0815341170840306, 0.13480429433766994, 0.03715396745933023, 0.35305744433790687, 0.14464687612059154, 0.06017482145812469, -0.19671958631919167, 0.012612601552855193, -0.000545430792295904] |
1,802.10291 | FFT Multichannel Interpolation and Application to Image Super-resolution | This paper presents an innovative set of tools to support a methodology for
the multichannel interpolation (MCI) of a discrete signal. It is shown that a
bandlimited signal $f$ can be exactly reconstructed from finite samples of
$g_k$ ($1\leq k\leq M$) which are the responses of $M$ linear systems with
input $f$. The proposed interpolation can also be applied to approximate
non-bandlimited signals. Quantitative error is analyzed to ensure its
effectiveness in approximating non-bandlimited signals and its Hilbert
transform. Based on the FFT technique, a fast algorithm which brings high
computational efficiency and reliability for MCI is presented. The standout
performance of MCI is illustrated by several simulations. Additionally, the
proposed interpolation is applied to the single image super-resolution (SISR).
Its superior performance in accuracy and speed of SISR is demonstrated by the
experimental studies. Our results are compared qualitatively and quantitatively
with the state-of-the-art methods in image upsampling and reconstruction by
using the standard measurement criteria.
| cs.IT math.IT math.NA | this paper presents an innovative set of tools to support a methodology for the multichannel interpolation mci of a discrete signal it is shown that a bandlimited signal f can be exactly reconstructed from finite samples of g_k 1leq kleq m which are the responses of m linear systems with input f the proposed interpolation can also be applied to approximate nonbandlimited signals quantitative error is analyzed to ensure its effectiveness in approximating nonbandlimited signals and its hilbert transform based on the fft technique a fast algorithm which brings high computational efficiency and reliability for mci is presented the standout performance of mci is illustrated by several simulations additionally the proposed interpolation is applied to the single image superresolution sisr its superior performance in accuracy and speed of sisr is demonstrated by the experimental studies our results are compared qualitatively and quantitatively with the stateoftheart methods in image upsampling and reconstruction by using the standard measurement criteria | [['this', 'paper', 'presents', 'an', 'innovative', 'set', 'of', 'tools', 'to', 'support', 'a', 'methodology', 'for', 'the', 'multichannel', 'interpolation', 'mci', 'of', 'a', 'discrete', 'signal', 'it', 'is', 'shown', 'that', 'a', 'bandlimited', 'signal', 'f', 'can', 'be', 'exactly', 'reconstructed', 'from', 'finite', 'samples', 'of', 'g_k', '1leq', 'kleq', 'm', 'which', 'are', 'the', 'responses', 'of', 'm', 'linear', 'systems', 'with', 'input', 'f', 'the', 'proposed', 'interpolation', 'can', 'also', 'be', 'applied', 'to', 'approximate', 'nonbandlimited', 'signals', 'quantitative', 'error', 'is', 'analyzed', 'to', 'ensure', 'its', 'effectiveness', 'in', 'approximating', 'nonbandlimited', 'signals', 'and', 'its', 'hilbert', 'transform', 'based', 'on', 'the', 'fft', 'technique', 'a', 'fast', 'algorithm', 'which', 'brings', 'high', 'computational', 'efficiency', 'and', 'reliability', 'for', 'mci', 'is', 'presented', 'the', 'standout', 'performance', 'of', 'mci', 'is', 'illustrated', 'by', 'several', 'simulations', 'additionally', 'the', 'proposed', 'interpolation', 'is', 'applied', 'to', 'the', 'single', 'image', 'superresolution', 'sisr', 'its', 'superior', 'performance', 'in', 'accuracy', 'and', 'speed', 'of', 'sisr', 'is', 'demonstrated', 'by', 'the', 'experimental', 'studies', 'our', 'results', 'are', 'compared', 'qualitatively', 'and', 'quantitatively', 'with', 'the', 'stateoftheart', 'methods', 'in', 'image', 'upsampling', 'and', 'reconstruction', 'by', 'using', 'the', 'standard', 'measurement', 'criteria']] | [-0.06705092474637304, -0.00789138343647511, -0.10495345447817521, 0.048655562334883794, -0.05572200823088835, -0.1420556287471039, 0.015362367888906627, 0.4246960131890455, -0.26408493565692076, -0.29772256012111725, 0.126737446729598, -0.25280125078501975, -0.17460590380890545, 0.2564803095249708, -0.11890790025128206, 0.15040147628606992, 0.11305130819440078, 0.03794736590438113, -0.07662438980161337, -0.2854599162082004, 0.21465610038150978, 0.07602390977939602, 0.3339222745278815, 0.013217774157525059, 0.11456610120322769, -0.03604321745906476, -0.043572030534410174, 0.007240199073140693, -0.05206473310097828, 0.1320919706664125, 0.30823474161914155, 0.18241807767990859, 0.2816547491724134, -0.3745045309981248, -0.23191372607686336, 0.08468980934014128, 0.1334265166264069, 0.032788971235833256, -0.09085557776263019, -0.31846979994231916, 0.14945187568545912, -0.10290656756063934, -0.033384091268252036, -0.11783184013833665, -0.0377044587568113, 0.03728265939339711, -0.3602111123407343, 0.0703182499186554, 0.04586539020024798, 0.05032787540820754, -0.03528422538330482, -0.12897128591634285, 0.026132731084492367, 0.10787017142569208, 0.0009657605758802906, 0.08210250197844521, 0.09802046057821553, -0.08440529428582615, -0.1348223973504582, 0.3618258781031154, -0.060807057862113684, -0.252628962232755, 0.18602976912282598, -0.09677739703292206, -0.07421085156150352, 0.17322490765501086, 0.16569073621634464, 0.10680579990721352, -0.14342683936160794, 0.08865493429627472, -0.00013026163563322108, 0.18208254839347046, 0.0408798164545683, -0.00520931119336539, 0.0890769559718004, 0.20625298340941312, 0.03756329497903775, 0.14113210931429224, -0.13532193498849085, -0.005575246263627604, -0.24040892054875543, -0.1226461626082113, -0.237317893034215, -0.025035141813005233, -0.09913339622414769, -0.10896552315595037, 0.4283694722185469, 0.19369329930324652, 0.17024393370790278, 0.0707055291896508, 0.372078871827537, 0.12741355965913875, 0.043962583905856153, 0.04723009333358544, 0.19713899336761206, 0.1299275735698664, 0.06600215528931493, -0.21442832926934835, 0.04214516183907154, 0.0746429671435528] |
1,802.10292 | Cahen-Gutt moment map, closed Fedosov star product and structure of the
automorphism group | We show that if a compact Kaehler manifold $M$ of non-negative Ricci
curvature admits closed Fedosov star product then the reduced Lie algebra of
holomorphic vector fields on $M$ is reductive. This comes in pair with the
obstruction previously found by La Fuente-Gravy. More generally we consider the
squared norm of Cahen-Gutt moment map as in the same spirit of Calabi
functional for the scalar curvature in cscK problem, and prove a Cahen-Gutt
version of Calabi's theorem on the structure of the Lie algebra of holomorphic
vector fields for extremal Kaehler manifolds. The proof uses a Hessian formula
for the squared norm of Cahen-Gutt moment map.
| math.DG | we show that if a compact kaehler manifold m of nonnegative ricci curvature admits closed fedosov star product then the reduced lie algebra of holomorphic vector fields on m is reductive this comes in pair with the obstruction previously found by la fuentegravy more generally we consider the squared norm of cahengutt moment map as in the same spirit of calabi functional for the scalar curvature in csck problem and prove a cahengutt version of calabis theorem on the structure of the lie algebra of holomorphic vector fields for extremal kaehler manifolds the proof uses a hessian formula for the squared norm of cahengutt moment map | [['we', 'show', 'that', 'if', 'a', 'compact', 'kaehler', 'manifold', 'm', 'of', 'nonnegative', 'ricci', 'curvature', 'admits', 'closed', 'fedosov', 'star', 'product', 'then', 'the', 'reduced', 'lie', 'algebra', 'of', 'holomorphic', 'vector', 'fields', 'on', 'm', 'is', 'reductive', 'this', 'comes', 'in', 'pair', 'with', 'the', 'obstruction', 'previously', 'found', 'by', 'la', 'fuentegravy', 'more', 'generally', 'we', 'consider', 'the', 'squared', 'norm', 'of', 'cahengutt', 'moment', 'map', 'as', 'in', 'the', 'same', 'spirit', 'of', 'calabi', 'functional', 'for', 'the', 'scalar', 'curvature', 'in', 'csck', 'problem', 'and', 'prove', 'a', 'cahengutt', 'version', 'of', 'calabis', 'theorem', 'on', 'the', 'structure', 'of', 'the', 'lie', 'algebra', 'of', 'holomorphic', 'vector', 'fields', 'for', 'extremal', 'kaehler', 'manifolds', 'the', 'proof', 'uses', 'a', 'hessian', 'formula', 'for', 'the', 'squared', 'norm', 'of', 'cahengutt', 'moment', 'map']] | [-0.21299294285764475, 0.044087029137604296, -0.08370636664829882, 0.12465015414747455, -0.1415189103201209, -0.116975628154441, -0.07876704331110454, 0.3163826036488726, -0.2859000610453742, -0.1945184751812901, 0.09680425452090623, -0.23931953871533984, -0.1800943974582922, 0.1560800510325602, -0.1262664720859556, -0.01731022113401975, 0.0726834138910774, 0.1753531524911523, -0.13345626813936093, -0.2545621891639062, 0.5044987380149819, -0.015826820724067235, 0.20746736587690456, 0.09385716151002617, 0.19485395610155093, 0.016070820049693187, 0.016197068173260915, -0.029845981350878164, -0.1488085609110255, 0.13122146023725648, 0.23859832405689216, 0.08601328929043597, 0.20529216547674012, -0.36288240567914076, -0.14312987644557973, 0.20784348804681074, 0.08744171159785419, -0.025357069791338983, -0.03529270365681787, -0.2853876921037833, 0.10255154147522436, -0.08747429292859688, -0.18305290678815384, -0.0996961340796025, 0.03821397629078655, -0.0408765229518481, -0.25054308512148316, 0.08849532422387883, 0.1168032970390327, 0.07654719542534578, -0.11262854647246145, -0.14831704024580264, -0.09264773765490168, -0.00213750477081963, 0.037525131146512215, 0.13978050351142884, 0.13266799411780777, -0.042673917768877884, -0.07789437979393239, 0.30948305796122266, -0.1647188020958787, -0.2859081660530397, 0.0016996331512928009, -0.16393714449146674, -0.1636104472779802, 0.10001832500233182, 0.11735767924359866, 0.21041355902949968, -0.052715461899060755, 0.24941760942816646, -0.08720938632530825, 0.04088424648646088, 0.12068189080095007, -0.04756990841013335, 0.11923526979184576, 0.06253315239612545, 0.18512974176112384, 0.11866271775215864, -0.002895933793236812, -0.07851076710392677, -0.36306747130694844, -0.23264913357173403, -0.17994606955021264, 0.20941846297965164, -0.17475335787347007, -0.19679191116509692, 0.36389754319652207, -0.032397334166758114, 0.18009310756987404, 0.1619675846593011, 0.22444882550764653, 0.0652366528609058, 0.07965710461583166, 0.11678591587447694, 0.20386461243476897, 0.3097212154795194, 0.042365696378761815, -0.1350787446656752, -0.09770850020327738, 0.24260101752976576] |
1,802.10293 | Higher derivative quartic vertex of $f(R)$ gravity in light-cone gauge | In the recent studies of four-dimensional Einstein-Hilbert action, quite a
few interesting results such as the Kawai-Lewellen-Tye (KLT) relations,
MHV-Lagrangian and quadratic forms have been reported. These results naturally
raise an important question: Whether these results are valid for the modified
theories of gravity in 4-dimensions? In this work, we consider $R+\alpha\,R^2$
gravity and derive the complete quartic interaction vertex in light-cone gauge.
We then discuss the implications of the results for KLT relations, and
computing MHV amplitudes.
| hep-th gr-qc | in the recent studies of fourdimensional einsteinhilbert action quite a few interesting results such as the kawailewellentye klt relations mhvlagrangian and quadratic forms have been reported these results naturally raise an important question whether these results are valid for the modified theories of gravity in 4dimensions in this work we consider ralphar2 gravity and derive the complete quartic interaction vertex in lightcone gauge we then discuss the implications of the results for klt relations and computing mhv amplitudes | [['in', 'the', 'recent', 'studies', 'of', 'fourdimensional', 'einsteinhilbert', 'action', 'quite', 'a', 'few', 'interesting', 'results', 'such', 'as', 'the', 'kawailewellentye', 'klt', 'relations', 'mhvlagrangian', 'and', 'quadratic', 'forms', 'have', 'been', 'reported', 'these', 'results', 'naturally', 'raise', 'an', 'important', 'question', 'whether', 'these', 'results', 'are', 'valid', 'for', 'the', 'modified', 'theories', 'of', 'gravity', 'in', '4dimensions', 'in', 'this', 'work', 'we', 'consider', 'ralphar2', 'gravity', 'and', 'derive', 'the', 'complete', 'quartic', 'interaction', 'vertex', 'in', 'lightcone', 'gauge', 'we', 'then', 'discuss', 'the', 'implications', 'of', 'the', 'results', 'for', 'klt', 'relations', 'and', 'computing', 'mhv', 'amplitudes']] | [-0.1562762120616083, 0.12460432054132597, -0.0883327630520063, 0.15563399258137092, -0.10024103899731447, -0.14447358243878147, -0.01954529341922975, 0.3075481636700907, -0.18029963540366703, -0.2665815270187235, 0.04073635410321386, -0.2847984027436101, -0.2651496959825684, 0.20211973684950194, -0.07190070893787044, 0.061399078750247624, 0.022315063207459292, 0.05374415952859348, -0.11842190427092933, -0.32884061589261127, 0.36676991230955247, -0.02098764212017781, 0.22401453448018352, 0.12879323154246727, 0.08443355642406172, 0.015441620118891526, -0.05790803985253565, 0.025373645868201396, -0.16798291687461497, 0.1062865037422039, 0.26910776287197796, 0.1271260833753714, 0.16419796822715158, -0.45948688612368543, -0.20166601667082623, 0.05800112608918234, 0.15395283025664916, 0.1512477535901493, -0.060658753592226854, -0.2521233390894179, 0.01826492291231836, -0.17165829182455414, -0.17810906459559, -0.0994956937532774, 0.037332061567882956, -0.06902888923344251, -0.2183019249013772, 0.04734026381782697, 0.06356964397587274, 0.0195766922674681, -0.036295443227955776, -0.11508709655486439, 0.010414100668736194, 0.09329233014049303, 0.10675829705800616, 0.05069878812585222, 0.0405416336327203, -0.20953132149359016, -0.1747919260462942, 0.37733728517962034, -0.07985281172870218, -0.20532827188358888, 0.16648823316944272, -0.16277152631971004, -0.2398070979949185, 0.005000726430137691, 0.13356166676078973, 0.1536836789822892, -0.16681265927802183, 0.1806445656027216, -0.06009084018143384, 0.03302553916766651, 0.13351303181537477, 0.07406696997043725, 0.24517218687718637, 0.07332047562752116, -0.04903240784034623, 0.11138937300022103, 0.02091966195056509, -0.0861569274903128, -0.3866263129503319, -0.13883314719178566, -0.062272989803827124, 0.05831058597418872, -0.16142458798870057, -0.11203154267155026, 0.3365456754767557, 0.1774195557166087, 0.18841767461210684, 0.10759142500740525, 0.22017098776996136, 0.13760820607575097, 0.09096812388222468, 0.029662714079390036, 0.2995589187270717, 0.16788752872104706, 0.02931972063465525, -0.21663951443042606, -0.06958726412267424, 0.13125346052019218] |
1,802.10294 | Nuclear dynamics and particle production near threshold energies in
heavy-ion collisions | Recent progress of the quantum molecular dynamics model for describing the
dynamics of heavy-ion collisions is viewed, in particular the nuclear
fragmentation, isospin physics, particle production and in-medium effect,
hadron-induced nuclear reactions, hypernucleus etc. The neck fragmentation in
Fermi-energy heavy-ion collisions is investigated for extracting the symmetry
energy at subsaturation densities. The isospin effects, in-medium properties
and the behavior of high-density symmetry energy in medium and high energy
heavy-ion collisions are thoroughly discussed. The hypernuclide dynamics formed
in heavy-ion collisions and in hadron induced reactions is analyzed and
addressed in the future experiments at the High-Intensity heavy-ion Accelerator
Facility (HIAF).
| nucl-th | recent progress of the quantum molecular dynamics model for describing the dynamics of heavyion collisions is viewed in particular the nuclear fragmentation isospin physics particle production and inmedium effect hadroninduced nuclear reactions hypernucleus etc the neck fragmentation in fermienergy heavyion collisions is investigated for extracting the symmetry energy at subsaturation densities the isospin effects inmedium properties and the behavior of highdensity symmetry energy in medium and high energy heavyion collisions are thoroughly discussed the hypernuclide dynamics formed in heavyion collisions and in hadron induced reactions is analyzed and addressed in the future experiments at the highintensity heavyion accelerator facility hiaf | [['recent', 'progress', 'of', 'the', 'quantum', 'molecular', 'dynamics', 'model', 'for', 'describing', 'the', 'dynamics', 'of', 'heavyion', 'collisions', 'is', 'viewed', 'in', 'particular', 'the', 'nuclear', 'fragmentation', 'isospin', 'physics', 'particle', 'production', 'and', 'inmedium', 'effect', 'hadroninduced', 'nuclear', 'reactions', 'hypernucleus', 'etc', 'the', 'neck', 'fragmentation', 'in', 'fermienergy', 'heavyion', 'collisions', 'is', 'investigated', 'for', 'extracting', 'the', 'symmetry', 'energy', 'at', 'subsaturation', 'densities', 'the', 'isospin', 'effects', 'inmedium', 'properties', 'and', 'the', 'behavior', 'of', 'highdensity', 'symmetry', 'energy', 'in', 'medium', 'and', 'high', 'energy', 'heavyion', 'collisions', 'are', 'thoroughly', 'discussed', 'the', 'hypernuclide', 'dynamics', 'formed', 'in', 'heavyion', 'collisions', 'and', 'in', 'hadron', 'induced', 'reactions', 'is', 'analyzed', 'and', 'addressed', 'in', 'the', 'future', 'experiments', 'at', 'the', 'highintensity', 'heavyion', 'accelerator', 'facility', 'hiaf']] | [-0.08490609048131967, 0.30856303731449924, -0.18342286886910747, 0.16053297219332308, 0.05792371071686949, -0.050007837203641735, -0.12812156043711562, 0.3380931999270964, -0.2144199762531001, -0.20328693940878065, -0.05652936859199815, -0.33422772073647894, 0.08106305790745248, 0.07589247175892157, 0.14527889303486757, 0.12964519664569937, 0.10792681941706123, 0.012973348929951287, -0.0043505489816795095, -0.13817281444495863, 0.31886379239666796, 0.19898788218805097, 0.25188007401866896, 0.29480187072785513, 0.05338245391083712, 0.05211117288222386, 0.030334762876707534, -0.023732604631787224, -0.15412713273991643, 0.017454357941239847, 0.3453701167753098, 0.04582923945660392, 0.14838480785479674, -0.48718939445009735, -0.22707817304145658, 0.1103845462696909, 0.12192546216432344, 0.15427427064871999, -0.1782428117120883, -0.2798871436353886, 0.03917317621285246, -0.25979829998216547, -0.1928200671270565, -0.05110640478828414, 0.024509287759134867, 0.05873165327721661, -0.2495740277862007, 0.09997644535773857, -0.06255798995720618, 0.10455666795329455, -0.03479873988720955, -0.19272293164535906, -0.04032472104793697, -0.0336304301574751, 0.05143660458505643, 0.05473623898425939, 0.29517136273595196, -0.24564751666133303, -0.09355635808385683, 0.49708684526308616, 0.07423238830424544, -0.08082570969315264, 0.15578180626787322, -0.21143424543881356, -0.193183207399955, 0.13287806273391, 0.261967816794611, 0.10465311869564983, -0.21036846065103557, 0.056016383153466374, 0.04377649385820736, 0.08087051085271695, 0.11310248979310872, 0.08572402959595425, 0.1744917772446919, 0.26748649715540007, -0.10734674534901525, 0.07323652992231978, -0.10062988617250489, -0.17794512135606974, -0.36932004734196444, -0.03350713327903338, -0.11860639026219194, 0.013600559158467057, 0.0033467322727018553, 0.019108251028816508, 0.3494771302894059, 0.054941979763709535, 0.2177944152446633, -0.15695806289787848, 0.2954337758510703, 0.06541040271633503, -0.0008577154902270948, 0.07186227003488728, 0.28072408469149257, 0.19480783145197414, 0.21331442933002806, -0.38999379446466614, 0.07496430524601366, 0.05524854491596496] |
1,802.10295 | Beliaev Damping in Spin-$\frac{1}{2}$ Interacting Bosons with Spin-Orbit
Coupling | Beliaev damping provides one of the most important mechanisms for dissipation
of quasiparticles through beyond-mean-field effects at zero temperature. Here
we present the first analytical result of Beliaev damping in low-energy
excitations of spin-$\frac{1}{2}$ interacting bosons with equal Rashba and
Dresslhaus spin-orbit couplings. We identify novel features of Beliaev decay
rate due to spin-orbit coupling, in particular, it shows explicit dependence on
the spin-density interaction and diverges at the interaction-modified phase
boundary between the zero-momentum and plane-wave phases. This represents a
manifestation of the effect of spin-orbit coupling in the beyond-mean-field
regime, which by breaking Galilean invariance couples excitations in the
density- and spin-channels. By describing the Beliaev damping in terms of the
observable dynamic structure factors, our results allow direct experimental
access within current facilities.
| cond-mat.quant-gas | beliaev damping provides one of the most important mechanisms for dissipation of quasiparticles through beyondmeanfield effects at zero temperature here we present the first analytical result of beliaev damping in lowenergy excitations of spinfrac12 interacting bosons with equal rashba and dresslhaus spinorbit couplings we identify novel features of beliaev decay rate due to spinorbit coupling in particular it shows explicit dependence on the spindensity interaction and diverges at the interactionmodified phase boundary between the zeromomentum and planewave phases this represents a manifestation of the effect of spinorbit coupling in the beyondmeanfield regime which by breaking galilean invariance couples excitations in the density and spinchannels by describing the beliaev damping in terms of the observable dynamic structure factors our results allow direct experimental access within current facilities | [['beliaev', 'damping', 'provides', 'one', 'of', 'the', 'most', 'important', 'mechanisms', 'for', 'dissipation', 'of', 'quasiparticles', 'through', 'beyondmeanfield', 'effects', 'at', 'zero', 'temperature', 'here', 'we', 'present', 'the', 'first', 'analytical', 'result', 'of', 'beliaev', 'damping', 'in', 'lowenergy', 'excitations', 'of', 'spinfrac12', 'interacting', 'bosons', 'with', 'equal', 'rashba', 'and', 'dresslhaus', 'spinorbit', 'couplings', 'we', 'identify', 'novel', 'features', 'of', 'beliaev', 'decay', 'rate', 'due', 'to', 'spinorbit', 'coupling', 'in', 'particular', 'it', 'shows', 'explicit', 'dependence', 'on', 'the', 'spindensity', 'interaction', 'and', 'diverges', 'at', 'the', 'interactionmodified', 'phase', 'boundary', 'between', 'the', 'zeromomentum', 'and', 'planewave', 'phases', 'this', 'represents', 'a', 'manifestation', 'of', 'the', 'effect', 'of', 'spinorbit', 'coupling', 'in', 'the', 'beyondmeanfield', 'regime', 'which', 'by', 'breaking', 'galilean', 'invariance', 'couples', 'excitations', 'in', 'the', 'density', 'and', 'spinchannels', 'by', 'describing', 'the', 'beliaev', 'damping', 'in', 'terms', 'of', 'the', 'observable', 'dynamic', 'structure', 'factors', 'our', 'results', 'allow', 'direct', 'experimental', 'access', 'within', 'current', 'facilities']] | [-0.22526655189557782, 0.23637873449948646, -0.06407114480351729, 0.0564383392423136, -0.06369040987168949, -0.1262667286322422, 0.047767708489235734, 0.2859888253883729, -0.22921065703473775, -0.2511776679255549, -0.04742214265382744, -0.28326654610329216, -0.12481578435718772, 0.13533229428914287, 0.10758003588923584, 0.018550864962537984, -0.03128559580598507, -0.016847192446866464, -0.06441035511670634, -0.17925759522251844, 0.3198779074685468, 0.04947299194792586, 0.2933033547709666, 0.13937005695075758, 0.054064212599769235, 0.032305354669299575, 0.06544413976746821, -0.06357638520609227, -0.1573564461732824, 0.016341581207422178, 0.2241962697481804, -0.08355416403707838, 0.20885244443930023, -0.4455237455906407, -0.17540908089628623, -0.02545911931402741, 0.18121082256660767, 0.19183451142969482, -0.03379346985245995, -0.3100422580741466, -0.05464799174167696, -0.20223081117916492, -0.15358309936991352, -0.12075982155698922, 0.01678053066585093, -0.035646532786138836, -0.29545698167179757, 0.16096566376959784, 0.04745581325128554, 0.06269779770269862, -0.08645588258889714, -0.10361544980532339, -0.029999312687469946, 0.06928258883248593, 0.11317873922704283, 0.007018794970316512, 0.09831552811703013, -0.16370114647490422, -0.11657697152000882, 0.38643202525112896, -0.130036837070234, -0.17851442034589127, 0.19357567386806854, -0.17500480771219196, -0.09354288066406885, 0.16439402685876214, 0.14676082363791554, 0.05365465258458449, -0.11659488336215051, 0.12286273370714738, 0.0258846441903452, 0.13179796466401086, 0.031503958434181946, 0.13942232153438514, 0.23613749599955494, 0.1862623925107689, 0.0001679727762577034, 0.12734790087720724, -0.08001208138152686, -0.09773093331304769, -0.34003967039227007, -0.11045733043518398, -0.20079630976279958, 0.04898896989142222, -0.062122751012559034, -0.12942633106778825, 0.4108495844918634, 0.18650428178971784, 0.16049674000110356, -0.0053780771568492656, 0.28302276987327085, 0.15188126800668186, 0.08335776766762137, 0.047613760125973535, 0.3149150136497713, 0.17983984336962983, 0.056462106154105, -0.3680038280304401, 0.03716040992238108, 0.0672241059083101] |
1,802.10296 | Images and Spectra of Time Dependent Two Component Advective Flow in
Presence of Outflows | Two Component Advective Flow (TCAF) successfully explains the spectral and
tem- poral properties of outbursting or persistent sources. Images of static
TCAF with Compton cloud or CENtrifugal pressure supported Boundary Layer
(CENBOL) due to gravitational bending of photons have been studied before. In
this paper, we study time dependent images of advective flows around a
Schwarzschild black hole which include cooling effects due to Comptonization of
soft photons from a Keplerian disks well as the self-consistently produced jets
and outflows. We show the overall image of the disk-jet system after convolving
with a typical beamwidth. A long exposure image with time dependent system need
not show the black hole horizon conspicuously, un- less one is looking at a
soft state with no jet or the system along the jet axis. Assuming these
disk-jet configurations are relevant to radio emitting systems also, our
results would be useful to look for event horizons in high accretion rate
Supermassive Black Holes in Seyfert galaxies, RL Quasars.
| astro-ph.HE | two component advective flow tcaf successfully explains the spectral and tem poral properties of outbursting or persistent sources images of static tcaf with compton cloud or centrifugal pressure supported boundary layer cenbol due to gravitational bending of photons have been studied before in this paper we study time dependent images of advective flows around a schwarzschild black hole which include cooling effects due to comptonization of soft photons from a keplerian disks well as the selfconsistently produced jets and outflows we show the overall image of the diskjet system after convolving with a typical beamwidth a long exposure image with time dependent system need not show the black hole horizon conspicuously un less one is looking at a soft state with no jet or the system along the jet axis assuming these diskjet configurations are relevant to radio emitting systems also our results would be useful to look for event horizons in high accretion rate supermassive black holes in seyfert galaxies rl quasars | [['two', 'component', 'advective', 'flow', 'tcaf', 'successfully', 'explains', 'the', 'spectral', 'and', 'tem', 'poral', 'properties', 'of', 'outbursting', 'or', 'persistent', 'sources', 'images', 'of', 'static', 'tcaf', 'with', 'compton', 'cloud', 'or', 'centrifugal', 'pressure', 'supported', 'boundary', 'layer', 'cenbol', 'due', 'to', 'gravitational', 'bending', 'of', 'photons', 'have', 'been', 'studied', 'before', 'in', 'this', 'paper', 'we', 'study', 'time', 'dependent', 'images', 'of', 'advective', 'flows', 'around', 'a', 'schwarzschild', 'black', 'hole', 'which', 'include', 'cooling', 'effects', 'due', 'to', 'comptonization', 'of', 'soft', 'photons', 'from', 'a', 'keplerian', 'disks', 'well', 'as', 'the', 'selfconsistently', 'produced', 'jets', 'and', 'outflows', 'we', 'show', 'the', 'overall', 'image', 'of', 'the', 'diskjet', 'system', 'after', 'convolving', 'with', 'a', 'typical', 'beamwidth', 'a', 'long', 'exposure', 'image', 'with', 'time', 'dependent', 'system', 'need', 'not', 'show', 'the', 'black', 'hole', 'horizon', 'conspicuously', 'un', 'less', 'one', 'is', 'looking', 'at', 'a', 'soft', 'state', 'with', 'no', 'jet', 'or', 'the', 'system', 'along', 'the', 'jet', 'axis', 'assuming', 'these', 'diskjet', 'configurations', 'are', 'relevant', 'to', 'radio', 'emitting', 'systems', 'also', 'our', 'results', 'would', 'be', 'useful', 'to', 'look', 'for', 'event', 'horizons', 'in', 'high', 'accretion', 'rate', 'supermassive', 'black', 'holes', 'in', 'seyfert', 'galaxies', 'rl', 'quasars']] | [-0.1166123744893681, 0.09960234839107013, -0.07927557821443051, 0.11782203958208823, -0.09906263030881499, -0.1471241822216177, -0.020513013113767232, 0.43467698036980484, -0.20014372606543296, -0.31493136872261485, 0.10334157774492202, -0.29610973926631873, -0.0015317695919585266, 0.20600833567463, -0.0488401004228235, 0.05809863816417127, 0.036380048783748974, -0.09053748169264261, -0.037402226506260995, -0.18163651556788404, 0.34857402372541896, 0.1044375694854139, 0.16760394812481086, -0.0098170594651436, 0.10862010845197308, -0.036475815942847274, -0.020330650596821934, 0.022303547595202186, -0.08406332256789836, 0.0024057409070708134, 0.2202291221352133, 0.07617977501128881, 0.2088920194945797, -0.43561329461496184, -0.2844643839088809, 0.04177327619083686, 0.19692673488271445, 0.06294341763193334, -0.06493766295988067, -0.2530349021271607, 0.06378938214002568, -0.2428024921014353, -0.1334421398135385, 0.023696725768393573, 0.03929662518921872, 0.00826155968343862, -0.20942827649371423, 0.1354897817642425, 0.06987346453882501, -0.0013594125386005567, -0.14814798934327691, -0.010663675395110737, -0.0719145503251549, 0.0863778236347975, 0.16809625025798372, 0.049926815340352926, 0.256940651682125, -0.14030630317988035, -0.10812290928636988, 0.39053560357632827, -0.03501717194650368, -0.08912254938924755, 0.20633838966382484, -0.2382479453212179, -0.11350902369429852, 0.20116193166698249, 0.17548988372041488, 0.16833011899143457, -0.12723441151068487, -0.011864774556468345, -0.006637389394368425, 0.24082085885176505, 0.07252292090130073, 0.04787900222014107, 0.37925396641187464, 0.11093138529125739, -0.00371752023541679, 0.1646221912944586, -0.1642708043541966, -0.039430425600091246, -0.24892184227118613, -0.09500839705377771, -0.1243679273692477, 0.09901885434284154, -0.14004117207020308, -0.14785430436331584, 0.3241681435639844, 0.08720817492720039, 0.22682955272403765, -0.011149433137486793, 0.3400824892197071, 0.07906697264277479, 0.06795523294828326, 0.18433369366728045, 0.3295874711971178, 0.09224741076360699, 0.17372015105663902, -0.22451937935504787, 0.035439157128380035, 0.03480348898418374] |
1,802.10297 | Semi-MapReduce Meets Congested Clique | Graph problems are troublesome when it comes to MapReduce. Typically, to be
able to design algorithms that make use of the advantages of MapReduce,
assumptions beyond what the model imposes, such as the density of the input
graph, are required.
In a recent shift, a simple and robust model of MapReduce for graph problems,
where the space per machine is set to be O(|V|), has attracted considerable
attention. We term this model semi-MapReduce, or in short, semiMPC, and focus
on its computational power.
We show through a set of simulation methods that semiMPC is, perhaps
surprisingly, equivalent to the congested clique model of distributed
computing. However, semiMPC, in addition to round complexity, incorporates
another practically important dimension to optimize: the number of machines.
Furthermore, we show that algorithms in other distributed computing models,
such as CONGEST, can be simulated to run in the same number of rounds of
semiMPC while also using an optimal number of machines. We later show the
implications of these simulation methods by obtaining improved algorithms for
these models using the recent algorithms that have been developed.
| cs.DC | graph problems are troublesome when it comes to mapreduce typically to be able to design algorithms that make use of the advantages of mapreduce assumptions beyond what the model imposes such as the density of the input graph are required in a recent shift a simple and robust model of mapreduce for graph problems where the space per machine is set to be ov has attracted considerable attention we term this model semimapreduce or in short semimpc and focus on its computational power we show through a set of simulation methods that semimpc is perhaps surprisingly equivalent to the congested clique model of distributed computing however semimpc in addition to round complexity incorporates another practically important dimension to optimize the number of machines furthermore we show that algorithms in other distributed computing models such as congest can be simulated to run in the same number of rounds of semimpc while also using an optimal number of machines we later show the implications of these simulation methods by obtaining improved algorithms for these models using the recent algorithms that have been developed | [['graph', 'problems', 'are', 'troublesome', 'when', 'it', 'comes', 'to', 'mapreduce', 'typically', 'to', 'be', 'able', 'to', 'design', 'algorithms', 'that', 'make', 'use', 'of', 'the', 'advantages', 'of', 'mapreduce', 'assumptions', 'beyond', 'what', 'the', 'model', 'imposes', 'such', 'as', 'the', 'density', 'of', 'the', 'input', 'graph', 'are', 'required', 'in', 'a', 'recent', 'shift', 'a', 'simple', 'and', 'robust', 'model', 'of', 'mapreduce', 'for', 'graph', 'problems', 'where', 'the', 'space', 'per', 'machine', 'is', 'set', 'to', 'be', 'ov', 'has', 'attracted', 'considerable', 'attention', 'we', 'term', 'this', 'model', 'semimapreduce', 'or', 'in', 'short', 'semimpc', 'and', 'focus', 'on', 'its', 'computational', 'power', 'we', 'show', 'through', 'a', 'set', 'of', 'simulation', 'methods', 'that', 'semimpc', 'is', 'perhaps', 'surprisingly', 'equivalent', 'to', 'the', 'congested', 'clique', 'model', 'of', 'distributed', 'computing', 'however', 'semimpc', 'in', 'addition', 'to', 'round', 'complexity', 'incorporates', 'another', 'practically', 'important', 'dimension', 'to', 'optimize', 'the', 'number', 'of', 'machines', 'furthermore', 'we', 'show', 'that', 'algorithms', 'in', 'other', 'distributed', 'computing', 'models', 'such', 'as', 'congest', 'can', 'be', 'simulated', 'to', 'run', 'in', 'the', 'same', 'number', 'of', 'rounds', 'of', 'semimpc', 'while', 'also', 'using', 'an', 'optimal', 'number', 'of', 'machines', 'we', 'later', 'show', 'the', 'implications', 'of', 'these', 'simulation', 'methods', 'by', 'obtaining', 'improved', 'algorithms', 'for', 'these', 'models', 'using', 'the', 'recent', 'algorithms', 'that', 'have', 'been', 'developed']] | [-0.08151953977843125, 0.04831873799436532, -0.0756545280209846, 0.04637786200683978, -0.09046855510419441, -0.1741261252719495, 0.056033392245363856, 0.4082892696890566, -0.2918031061326878, -0.35193798647313895, 0.11749581336949227, -0.23065053472140182, -0.15276857777757363, 0.23019342597755085, -0.10422128420581835, 0.10564459159213584, 0.08490335159456461, 0.0586950805503875, -0.03107528796341891, -0.3192894776298393, 0.25702212559602533, 0.05420662254715959, 0.2632608599301117, 0.035017150009257925, 0.0632822165123394, -0.024553176597692072, -0.006123684783880081, 0.0746614209167698, -0.08550851516791025, 0.12892404061147114, 0.25120159989766966, 0.20701787495313007, 0.3118778410445278, -0.47364536616951225, -0.21844321334113678, 0.16249329508152893, 0.169456869441395, 0.11780879655723564, -0.03169236535581553, -0.2052858705761739, 0.12759889189554896, -0.1627217127631108, -0.0476434899157741, -0.0888146362797771, 0.030897892840827505, 0.021587406716167202, -0.27202018971244496, 0.013923331829816258, 0.03751137665240094, 0.0012714891435785425, 0.02527583814678817, -0.14361932159711918, 0.02783110118471086, 0.11941038057379451, 0.041484038902692394, 0.03004693816571186, 0.10107663315720856, -0.141592621007779, -0.17128628382213518, 0.40676799687401705, -0.019038507303533455, -0.17577457721215775, 0.18137131503576207, -0.04287308760039094, -0.20034399831719282, 0.09108085411264458, 0.21981820235960187, 0.08782531908558061, -0.09884793171052782, 0.10429277084703144, -0.05005478811411498, 0.16597897524609126, 0.024074916240190054, 0.025878723177851903, 0.12941300777407985, 0.22283599997948234, 0.08338517548852703, 0.1526957520869069, -0.038311413392269365, -0.11484305855766352, -0.22692133967971637, -0.12631950636342582, -0.20383231597564494, -0.020677998517122535, -0.09288240996587167, -0.15643559452793043, 0.36303105786080575, 0.20885710293789292, 0.20110146193765105, 0.09570363539840199, 0.3522908811664416, 0.09237294003073152, 0.08922758962402845, 0.14747958760191168, 0.20095337232471341, 0.07520703219731027, 0.07898111353343766, -0.1717827477544132, 0.07424357483784358, 0.026484504754060053] |
1,802.10298 | A van der Waals DFT study of chain length dependence of alkanethiol
adsorption on Au(111): Physisorption vs.chemisorption | The energetics and structures of physisorbed and chemisorbed alkanethiols on
Au(111) have been systematically investigated up to 10 carbon atoms using van
der Waals (vdW) corrected density functional theory (DFT) calculations. The
role of chain length, tilting angle and coverage on the adsorption
characteristics have been examined to elucidate the energetics and plausible
transformation mechanisms between lying down and standing up phases. Coverage
and size dependent chain-chain electronic interactions counteract with the
alkyl chain-gold surface interactions and the surface relaxation of the metal
in the formation of standing up monolayer structures. For the striped phases of
long chain alkanethiols, however, our calculations on decanethiol indicates
alkyl chain-gold surface interactions to be strong enough to force the molecule
to be perfectly parallel to the surface by lifting a gold atom up, in agreement
with the proposed models for this film in the literature.
| physics.chem-ph cond-mat.str-el | the energetics and structures of physisorbed and chemisorbed alkanethiols on au111 have been systematically investigated up to 10 carbon atoms using van der waals vdw corrected density functional theory dft calculations the role of chain length tilting angle and coverage on the adsorption characteristics have been examined to elucidate the energetics and plausible transformation mechanisms between lying down and standing up phases coverage and size dependent chainchain electronic interactions counteract with the alkyl chaingold surface interactions and the surface relaxation of the metal in the formation of standing up monolayer structures for the striped phases of long chain alkanethiols however our calculations on decanethiol indicates alkyl chaingold surface interactions to be strong enough to force the molecule to be perfectly parallel to the surface by lifting a gold atom up in agreement with the proposed models for this film in the literature | [['the', 'energetics', 'and', 'structures', 'of', 'physisorbed', 'and', 'chemisorbed', 'alkanethiols', 'on', 'au111', 'have', 'been', 'systematically', 'investigated', 'up', 'to', '10', 'carbon', 'atoms', 'using', 'van', 'der', 'waals', 'vdw', 'corrected', 'density', 'functional', 'theory', 'dft', 'calculations', 'the', 'role', 'of', 'chain', 'length', 'tilting', 'angle', 'and', 'coverage', 'on', 'the', 'adsorption', 'characteristics', 'have', 'been', 'examined', 'to', 'elucidate', 'the', 'energetics', 'and', 'plausible', 'transformation', 'mechanisms', 'between', 'lying', 'down', 'and', 'standing', 'up', 'phases', 'coverage', 'and', 'size', 'dependent', 'chainchain', 'electronic', 'interactions', 'counteract', 'with', 'the', 'alkyl', 'chaingold', 'surface', 'interactions', 'and', 'the', 'surface', 'relaxation', 'of', 'the', 'metal', 'in', 'the', 'formation', 'of', 'standing', 'up', 'monolayer', 'structures', 'for', 'the', 'striped', 'phases', 'of', 'long', 'chain', 'alkanethiols', 'however', 'our', 'calculations', 'on', 'decanethiol', 'indicates', 'alkyl', 'chaingold', 'surface', 'interactions', 'to', 'be', 'strong', 'enough', 'to', 'force', 'the', 'molecule', 'to', 'be', 'perfectly', 'parallel', 'to', 'the', 'surface', 'by', 'lifting', 'a', 'gold', 'atom', 'up', 'in', 'agreement', 'with', 'the', 'proposed', 'models', 'for', 'this', 'film', 'in', 'the', 'literature']] | [-0.10081033365258264, 0.13418087229156103, -0.04111740309301187, 0.043932237538421966, 0.014657846571569391, -0.13642324434874728, 0.07237549179330763, 0.4337274052886118, -0.2728574261364105, -0.32654005258592017, -0.012782574740988905, -0.31617739123942185, -0.10890454558401014, 0.1383503494037168, 0.08105585053429115, 0.0201823299268274, 0.011882514369560124, -0.09185179114582942, -0.07961678986811153, -0.22710877691609985, 0.2523445091386185, 0.09828767535551418, 0.3030264142351292, 0.14926311473501175, 0.01726173119043275, -0.012212062619706924, 0.08837943822949482, 0.02849066809570189, -0.2283847142821647, 0.11873463943949063, 0.2363663107325985, -0.12186075483026693, 0.19640974950618212, -0.5438060161771534, -0.21943064649730062, -0.035508740438724595, 0.10115940935186131, 0.16802161795308265, -0.056456144367199784, -0.2674737120559774, 0.03608040824505708, -0.1474410097580403, -0.10517329423480647, -0.053701657597511575, 0.03914017210171806, 0.07256997705909604, -0.15936144023987953, 0.0835530134664106, 0.013329169662709502, 0.0704833094369605, -0.10312362611226791, -0.11348587919777031, -0.09559291407378832, 0.09726897156051956, 0.05979681449938941, 0.03998935485272099, 0.19747330695926715, -0.08919764267743009, -0.04501435998827219, 0.4027946522097579, -0.06768356208779963, -0.13329510939836825, 0.24420077623732442, -0.13399185877223835, -0.10086918751568459, 0.1780946651781849, 0.10672027869619054, 0.0866570202365732, -0.11900311644798775, 0.08024209910348767, 0.024332635726933803, 0.2073315191149658, 0.14642418197376264, 0.01426643323568458, 0.24158961126554035, 0.19557175709591282, 0.0238927414237937, 0.08553300420217645, -0.12214493967438612, -0.07991363036382622, -0.17286019166596503, -0.17422702730626619, -0.1638549688479883, 0.04670736854962951, -0.04495406980224694, -0.20507235556720294, 0.3579296967711487, 0.07543523834053087, 0.14563119788520146, -0.027982392274647307, 0.2140318439358832, 0.02707768086069297, 0.10782220876916386, -0.014985403387720208, 0.27309351019132483, 0.19876610239709747, 0.00613564357124671, -0.2808648253784334, 0.11678016570014813, 0.028823532169121955] |
1,802.10299 | Limit theory for an AR(1) model with intercept and a possible infinite
variance | In this paper, we derive the limit distribution of the least squares
estimator for an AR(1) model with a non-zero intercept and a possible infinite
variance. It turns out that the estimator has a quite different limit for the
cases of $|\rho| < 1$, $|\rho| > 1$, and $\rho = 1 + \frac{c}{n^\alpha}$ for
some constant $c \in R$ and $\alpha \in (0, 1]$, and whether or not the
variance of the model errors is infinite also has a great impact on both the
convergence rate and the limit distribution of the estimator.
| math.ST stat.TH | in this paper we derive the limit distribution of the least squares estimator for an ar1 model with a nonzero intercept and a possible infinite variance it turns out that the estimator has a quite different limit for the cases of rho 1 rho 1 and rho 1 fraccnalpha for some constant c in r and alpha in 0 1 and whether or not the variance of the model errors is infinite also has a great impact on both the convergence rate and the limit distribution of the estimator | [['in', 'this', 'paper', 'we', 'derive', 'the', 'limit', 'distribution', 'of', 'the', 'least', 'squares', 'estimator', 'for', 'an', 'ar1', 'model', 'with', 'a', 'nonzero', 'intercept', 'and', 'a', 'possible', 'infinite', 'variance', 'it', 'turns', 'out', 'that', 'the', 'estimator', 'has', 'a', 'quite', 'different', 'limit', 'for', 'the', 'cases', 'of', 'rho', '1', 'rho', '1', 'and', 'rho', '1', 'fraccnalpha', 'for', 'some', 'constant', 'c', 'in', 'r', 'and', 'alpha', 'in', '0', '1', 'and', 'whether', 'or', 'not', 'the', 'variance', 'of', 'the', 'model', 'errors', 'is', 'infinite', 'also', 'has', 'a', 'great', 'impact', 'on', 'both', 'the', 'convergence', 'rate', 'and', 'the', 'limit', 'distribution', 'of', 'the', 'estimator']] | [-0.10156264328609475, 0.08514416025867501, -0.12720937160140072, 0.07294934327629479, 0.03479438703718849, -0.18170352570119908, 0.07983323203436819, 0.3406215779567984, -0.2437808156801938, -0.25155155963941733, 0.16503314916256137, -0.317249385534193, -0.10714037163945084, 0.14804148554950106, -0.0320561589747244, 0.05461257154291326, 0.00020447335290637884, 0.08526531769894063, -0.05388572648900498, -0.27203305767298763, 0.2766147702085701, 0.04557742481119931, 0.22632563332180408, 0.04108282429462468, 0.13880385992392388, -0.0141769595423036, 0.013514879191378977, 0.022349597419365222, -0.1620137352548144, 0.05168563176200471, 0.16807146312732418, 0.10792722049783068, 0.32182271321388806, -0.28799510646653786, -0.18543084922500633, 0.16579462682023982, 0.18117157586807894, 0.03582560584287752, 0.014419463419471867, -0.17801914605396715, 0.11146498151356354, -0.19577281342142008, -0.13332248010291634, -0.02985927522902123, 0.0766497792422094, 0.016872800950130277, -0.3366354895723899, 0.09460620411945539, 0.10358189563901926, 0.029726216982288115, -0.019140109652653337, -0.19947044321716847, 0.02098469479559836, 0.11916412797026252, 0.09760534569134259, 0.03754267307654531, 0.057988167280034926, -0.1535182200896088, -0.03412729569456794, 0.33944619142196397, -0.10893859538588334, -0.2530354483963244, 0.12854979249955664, -0.2038806490705941, -0.14676820328564977, 0.10711660660506989, 0.13528255563737315, 0.1130305067953569, -0.10328768495343287, 0.1454366043875449, -0.04464859240265055, 0.1671147091229531, 0.03233288158662617, -0.011638027462388643, 0.14014521792573345, 0.12487281526872804, 0.10813535153945188, 0.10291685330131176, -0.15073771807312203, -0.0396565081431287, -0.3599264344560321, -0.1456450443312695, -0.18907725185536864, 0.056006987952390445, -0.16795323286863673, -0.16360555981836197, 0.34159075206314976, 0.15851925070058892, 0.2236607348419387, 0.10943229489070787, 0.2645555441796949, 0.14731632891661403, -0.018534699540892194, 0.10968189893173985, 0.19445645791876648, 0.14904671326406638, 0.026277636881621384, -0.18339824662226337, 0.09190593776822259, -0.00639367997857996] |
1,802.103 | Edge Partitions of Optimal $2$-plane and $3$-plane Graphs | A topological graph is a graph drawn in the plane. A topological graph is
$k$-plane, $k>0$, if each edge is crossed at most $k$ times. We study the
problem of partitioning the edges of a $k$-plane graph such that each partite
set forms a graph with a simpler structure. While this problem has been studied
for $k=1$, we focus on optimal $2$-plane and $3$-plane graphs, which are
$2$-plane and $3$-plane graphs with maximum density. We prove the following
results. (i) It is not possible to partition the edges of a simple optimal
$2$-plane graph into a $1$-plane graph and a forest, while (ii) an edge
partition formed by a $1$-plane graph and two plane forests always exists and
can be computed in linear time. (iii) We describe efficient algorithms to
partition the edges of a simple optimal $2$-plane graph into a $1$-plane graph
and a plane graph with maximum vertex degree $12$, or with maximum vertex
degree $8$ if the optimal $2$-plane graph is such that its crossing-free edges
form a graph with no separating triangles. (iv) We exhibit an infinite family
of simple optimal $2$-plane graphs such that in any edge partition composed of
a $1$-plane graph and a plane graph, the plane graph has maximum vertex degree
at least $6$ and the $1$-plane graph has maximum vertex degree at least $12$.
(v) We show that every optimal $3$-plane graph whose crossing-free edges form a
biconnected graph can be decomposed, in linear time, into a $2$-plane graph and
two plane forests.
| math.CO | a topological graph is a graph drawn in the plane a topological graph is kplane k0 if each edge is crossed at most k times we study the problem of partitioning the edges of a kplane graph such that each partite set forms a graph with a simpler structure while this problem has been studied for k1 we focus on optimal 2plane and 3plane graphs which are 2plane and 3plane graphs with maximum density we prove the following results i it is not possible to partition the edges of a simple optimal 2plane graph into a 1plane graph and a forest while ii an edge partition formed by a 1plane graph and two plane forests always exists and can be computed in linear time iii we describe efficient algorithms to partition the edges of a simple optimal 2plane graph into a 1plane graph and a plane graph with maximum vertex degree 12 or with maximum vertex degree 8 if the optimal 2plane graph is such that its crossingfree edges form a graph with no separating triangles iv we exhibit an infinite family of simple optimal 2plane graphs such that in any edge partition composed of a 1plane graph and a plane graph the plane graph has maximum vertex degree at least 6 and the 1plane graph has maximum vertex degree at least 12 v we show that every optimal 3plane graph whose crossingfree edges form a biconnected graph can be decomposed in linear time into a 2plane graph and two plane forests | [['a', 'topological', 'graph', 'is', 'a', 'graph', 'drawn', 'in', 'the', 'plane', 'a', 'topological', 'graph', 'is', 'kplane', 'k0', 'if', 'each', 'edge', 'is', 'crossed', 'at', 'most', 'k', 'times', 'we', 'study', 'the', 'problem', 'of', 'partitioning', 'the', 'edges', 'of', 'a', 'kplane', 'graph', 'such', 'that', 'each', 'partite', 'set', 'forms', 'a', 'graph', 'with', 'a', 'simpler', 'structure', 'while', 'this', 'problem', 'has', 'been', 'studied', 'for', 'k1', 'we', 'focus', 'on', 'optimal', '2plane', 'and', '3plane', 'graphs', 'which', 'are', '2plane', 'and', '3plane', 'graphs', 'with', 'maximum', 'density', 'we', 'prove', 'the', 'following', 'results', 'i', 'it', 'is', 'not', 'possible', 'to', 'partition', 'the', 'edges', 'of', 'a', 'simple', 'optimal', '2plane', 'graph', 'into', 'a', '1plane', 'graph', 'and', 'a', 'forest', 'while', 'ii', 'an', 'edge', 'partition', 'formed', 'by', 'a', '1plane', 'graph', 'and', 'two', 'plane', 'forests', 'always', 'exists', 'and', 'can', 'be', 'computed', 'in', 'linear', 'time', 'iii', 'we', 'describe', 'efficient', 'algorithms', 'to', 'partition', 'the', 'edges', 'of', 'a', 'simple', 'optimal', '2plane', 'graph', 'into', 'a', '1plane', 'graph', 'and', 'a', 'plane', 'graph', 'with', 'maximum', 'vertex', 'degree', '12', 'or', 'with', 'maximum', 'vertex', 'degree', '8', 'if', 'the', 'optimal', '2plane', 'graph', 'is', 'such', 'that', 'its', 'crossingfree', 'edges', 'form', 'a', 'graph', 'with', 'no', 'separating', 'triangles', 'iv', 'we', 'exhibit', 'an', 'infinite', 'family', 'of', 'simple', 'optimal', '2plane', 'graphs', 'such', 'that', 'in', 'any', 'edge', 'partition', 'composed', 'of', 'a', '1plane', 'graph', 'and', 'a', 'plane', 'graph', 'the', 'plane', 'graph', 'has', 'maximum', 'vertex', 'degree', 'at', 'least', '6', 'and', 'the', '1plane', 'graph', 'has', 'maximum', 'vertex', 'degree', 'at', 'least', '12', 'v', 'we', 'show', 'that', 'every', 'optimal', '3plane', 'graph', 'whose', 'crossingfree', 'edges', 'form', 'a', 'biconnected', 'graph', 'can', 'be', 'decomposed', 'in', 'linear', 'time', 'into', 'a', '2plane', 'graph', 'and', 'two', 'plane', 'forests']] | [-0.19358184797659753, 0.11164828308496258, -0.052092827684689494, -0.005789834673383406, -0.15670843796789766, -0.16689508495342342, 0.04864814056504872, 0.45401808351743966, -0.2853999390689072, -0.28962390675830346, 0.09664564679879399, -0.3351730970325806, -0.1755755938402939, 0.06943410650424156, -0.05389972183657515, 0.02114491383644423, 0.13528019834368948, 0.12138575501555192, 0.023108231411675832, -0.23180452995473474, 0.2805018713753227, -0.07853415172587755, 0.1895103374568169, 0.053521643751226956, 0.12557214113240617, 0.06448165696883013, 0.05134653650216817, 0.16874922301975034, -0.17462412923233056, 0.06597865708745158, 0.2845618787835101, 0.1826755917826963, 0.22824062251149574, -0.40276199417493197, -0.16266672078904415, 0.22540511182760672, 0.12628480069762435, 0.047505161927787525, 0.008507446161404784, -0.17752906284295022, 0.1581343313386213, -0.06158120041211424, -0.06348048616200686, 0.07000874988328193, 0.09946893835153571, -0.03484856887463673, -0.26777507821841734, -0.07628613324200231, 0.11278210031441487, 0.04816544518551035, 0.08996464994907867, -0.1623952935102381, -0.11053951180979817, 0.08744746160652814, -0.12496235400959406, 0.13727468317134364, 0.04860345385428185, -0.11482177627187902, -0.19022891049398966, 0.36512411067642025, -0.006759308991835467, -0.17836663007943165, 0.08933079103747057, -0.12663784231029687, -0.19586743086776032, 0.14003157134016325, 0.14412916186247168, 0.13618298789988909, -0.11062942814504144, 0.1343851264190605, -0.12178016182946204, 0.1157606678057669, 0.13252991243609272, -0.019103408763868852, 0.1642382624633019, 0.1293196264924186, 0.22140099543021136, 0.20704380703705644, -0.004922582162728917, 0.022364582195425302, -0.26062336373734213, -0.11863559441241835, -0.25915081866477274, 0.05393300292832594, -0.2441784809938875, -0.22678317845473805, 0.48244904230592683, 0.03127174552563312, 0.2503356259050114, 0.08022355497283455, 0.2328271429134821, 0.11667214761935553, 0.049074911109600515, 0.2351166012693226, 0.09838122582998098, 0.15088103073815415, -0.06502061523497105, -0.12039191407218043, 0.04534600904240968, 0.15528782893763116] |
1,802.10301 | Avoiding overfitting of multilayer perceptrons by training derivatives | Resistance to overfitting is observed for neural networks trained with
extended backpropagation algorithm. In addition to target values, its cost
function uses derivatives of those up to the $4^{\mathrm{th}}$ order. For
common applications of neural networks, high order derivatives are not readily
available, so simpler cases are considered: training network to approximate
analytical function inside 2D and 5D domains and solving Poisson equation
inside a 2D circle. For function approximation, the cost is a sum of squared
differences between output and target as well as their derivatives with respect
to the input. Differential equations are usually solved by putting a multilayer
perceptron in place of unknown function and training its weights, so that
equation holds within some margin of error. Commonly used cost is the
equation's residual squared. Added terms are squared derivatives of said
residual with respect to the independent variables. To investigate overfitting,
the cost is minimized for points of regular grids with various spacing, and its
root mean is compared with its value on much denser test set. Fully connected
perceptrons with six hidden layers and $2\cdot10^{4}$, $1\cdot10^{6}$ and
$5\cdot10^{6}$ weights in total are trained with Rprop until cost changes by
less than 10% for last 1000 epochs, or when the $10000^{\mathrm{th}}$ epoch is
reached. Training the network with $5\cdot10^{6}$ weights to represent simple
2D function using 10 points with 8 extra derivatives in each produces cost test
to train ratio of $1.5$, whereas for classical backpropagation in comparable
conditions this ratio is $2\cdot10^{4}$.
| cs.NE | resistance to overfitting is observed for neural networks trained with extended backpropagation algorithm in addition to target values its cost function uses derivatives of those up to the 4mathrmth order for common applications of neural networks high order derivatives are not readily available so simpler cases are considered training network to approximate analytical function inside 2d and 5d domains and solving poisson equation inside a 2d circle for function approximation the cost is a sum of squared differences between output and target as well as their derivatives with respect to the input differential equations are usually solved by putting a multilayer perceptron in place of unknown function and training its weights so that equation holds within some margin of error commonly used cost is the equations residual squared added terms are squared derivatives of said residual with respect to the independent variables to investigate overfitting the cost is minimized for points of regular grids with various spacing and its root mean is compared with its value on much denser test set fully connected perceptrons with six hidden layers and 2cdot104 1cdot106 and 5cdot106 weights in total are trained with rprop until cost changes by less than 10 for last 1000 epochs or when the 10000mathrmth epoch is reached training the network with 5cdot106 weights to represent simple 2d function using 10 points with 8 extra derivatives in each produces cost test to train ratio of 15 whereas for classical backpropagation in comparable conditions this ratio is 2cdot104 | [['resistance', 'to', 'overfitting', 'is', 'observed', 'for', 'neural', 'networks', 'trained', 'with', 'extended', 'backpropagation', 'algorithm', 'in', 'addition', 'to', 'target', 'values', 'its', 'cost', 'function', 'uses', 'derivatives', 'of', 'those', 'up', 'to', 'the', '4mathrmth', 'order', 'for', 'common', 'applications', 'of', 'neural', 'networks', 'high', 'order', 'derivatives', 'are', 'not', 'readily', 'available', 'so', 'simpler', 'cases', 'are', 'considered', 'training', 'network', 'to', 'approximate', 'analytical', 'function', 'inside', '2d', 'and', '5d', 'domains', 'and', 'solving', 'poisson', 'equation', 'inside', 'a', '2d', 'circle', 'for', 'function', 'approximation', 'the', 'cost', 'is', 'a', 'sum', 'of', 'squared', 'differences', 'between', 'output', 'and', 'target', 'as', 'well', 'as', 'their', 'derivatives', 'with', 'respect', 'to', 'the', 'input', 'differential', 'equations', 'are', 'usually', 'solved', 'by', 'putting', 'a', 'multilayer', 'perceptron', 'in', 'place', 'of', 'unknown', 'function', 'and', 'training', 'its', 'weights', 'so', 'that', 'equation', 'holds', 'within', 'some', 'margin', 'of', 'error', 'commonly', 'used', 'cost', 'is', 'the', 'equations', 'residual', 'squared', 'added', 'terms', 'are', 'squared', 'derivatives', 'of', 'said', 'residual', 'with', 'respect', 'to', 'the', 'independent', 'variables', 'to', 'investigate', 'overfitting', 'the', 'cost', 'is', 'minimized', 'for', 'points', 'of', 'regular', 'grids', 'with', 'various', 'spacing', 'and', 'its', 'root', 'mean', 'is', 'compared', 'with', 'its', 'value', 'on', 'much', 'denser', 'test', 'set', 'fully', 'connected', 'perceptrons', 'with', 'six', 'hidden', 'layers', 'and', '2cdot104', '1cdot106', 'and', '5cdot106', 'weights', 'in', 'total', 'are', 'trained', 'with', 'rprop', 'until', 'cost', 'changes', 'by', 'less', 'than', '10', 'for', 'last', '1000', 'epochs', 'or', 'when', 'the', '10000mathrmth', 'epoch', 'is', 'reached', 'training', 'the', 'network', 'with', '5cdot106', 'weights', 'to', 'represent', 'simple', '2d', 'function', 'using', '10', 'points', 'with', '8', 'extra', 'derivatives', 'in', 'each', 'produces', 'cost', 'test', 'to', 'train', 'ratio', 'of', '15', 'whereas', 'for', 'classical', 'backpropagation', 'in', 'comparable', 'conditions', 'this', 'ratio', 'is', '2cdot104']] | [-0.058156565078514945, 0.06211127886406246, -0.0014572270553220403, 0.07014086953660642, -0.08830665161491377, -0.16630216571502388, 0.03556206308845007, 0.42002146759970993, -0.2795454461593181, -0.33782755862007474, 0.10376401404919457, -0.29552647895526046, -0.14175373212095688, 0.15374018740551623, -0.07986820153199321, 0.10133935420872299, 0.08221363475063262, 0.06920805263279145, -0.10348063852678414, -0.3235434416839314, 0.274641818508375, 0.0405905997719277, 0.259907377622098, -0.02030244209094205, 0.14344218651071858, -0.052981615997850895, 0.01089970006661351, 0.004314968503452345, -0.059354504327341955, 0.10940775710780655, 0.23936165477560972, 0.08924608157241351, 0.30575595545574774, -0.43505006409750496, -0.19263142116621815, 0.1217629200170848, 0.11838067961137065, 0.058141374948996405, 0.04236990659187879, -0.23268820055614203, 0.11589311515625705, -0.13417812172575538, -0.09087696473868487, -0.06568853648510292, 0.004342973178391121, 0.046136114553910146, -0.3137536244774776, 0.08505513867332547, -0.017094955865720917, 0.04968595714164005, -0.049477970242030794, -0.1794408500817035, -0.058566455708620374, 0.10660126273895995, 0.03981830245788279, 0.08960011188221773, 0.10214005209397801, -0.14983207873099538, -0.07673615987185574, 0.36782986974566867, -0.07022406866473063, -0.2678661654772591, 0.1560731398765275, -0.0896949417790983, -0.05939498866238624, 0.1415026992009106, 0.19446969415207416, 0.1011890704043148, -0.15176198865828913, 0.02902788467236702, 0.03321194098030856, 0.1694299766470578, 0.10031982640878197, 0.007727788911347301, 0.13363178814896037, 0.18433023082219402, 0.07350962247924633, 0.15750482954923833, -0.08728036059878193, -0.12061748440591002, -0.27427449196669434, -0.10752299341732975, -0.21830010094221927, 0.021467356780057577, -0.13607660537420374, -0.16482021192796836, 0.3623609028502621, 0.12255339494647559, 0.22671400239952832, 0.1505781818125474, 0.3058239448303742, 0.15146668116454554, 0.14462850748057177, 0.10881221009426065, 0.20992240351242347, 0.11178143659783604, 0.08450052185967365, -0.13137909658695762, 0.1131387257636794, 0.06476557303666453] |
1,802.10302 | Bahadur representations for the bootstrap median absolute deviation and
the application to projection depth weighted mean | Median absolute deviation (hereafter MAD) is known as a robust alternative to
the ordinary variance. It has been widely utilized to induce robust statistical
inferential procedures. In this paper, we investigate the strong and weak
Bahadur representations of its bootstrap counterpart. As a useful application,
we utilize the results to derive the weak Bahadur representation of the
bootstrap sample projection depth weighted mean---a quite important location
estimator depending on MAD.
| math.ST stat.TH | median absolute deviation hereafter mad is known as a robust alternative to the ordinary variance it has been widely utilized to induce robust statistical inferential procedures in this paper we investigate the strong and weak bahadur representations of its bootstrap counterpart as a useful application we utilize the results to derive the weak bahadur representation of the bootstrap sample projection depth weighted meana quite important location estimator depending on mad | [['median', 'absolute', 'deviation', 'hereafter', 'mad', 'is', 'known', 'as', 'a', 'robust', 'alternative', 'to', 'the', 'ordinary', 'variance', 'it', 'has', 'been', 'widely', 'utilized', 'to', 'induce', 'robust', 'statistical', 'inferential', 'procedures', 'in', 'this', 'paper', 'we', 'investigate', 'the', 'strong', 'and', 'weak', 'bahadur', 'representations', 'of', 'its', 'bootstrap', 'counterpart', 'as', 'a', 'useful', 'application', 'we', 'utilize', 'the', 'results', 'to', 'derive', 'the', 'weak', 'bahadur', 'representation', 'of', 'the', 'bootstrap', 'sample', 'projection', 'depth', 'weighted', 'meana', 'quite', 'important', 'location', 'estimator', 'depending', 'on', 'mad']] | [0.0035714031251120396, -0.029044155551093645, -0.16390566333480502, 0.1917878342927366, -0.11792567107772482, -0.1289360427459621, 0.045644893574163965, 0.4161639455705881, -0.2669519713600639, -0.2859884777200827, 0.16703635959825275, -0.21430383077350215, -0.14157188947622976, 0.1971108374638024, -0.15372789323167957, 0.11139328020499965, 0.014361038102187973, 0.047307679598368166, -0.10521647016909244, -0.24302459254091524, 0.23877577571724745, 0.09757661300481878, 0.38329367951382004, -0.05019929451004103, 0.13459663583046716, 0.014998780253032843, -0.053843947134210146, 0.055601779962012515, -0.15260993955197974, 0.14368882397378702, 0.24595019323886305, 0.11073199244877459, 0.3104573531393502, -0.30885624133699585, -0.14509684994708802, 0.16369001961657373, 0.12783634191567916, 0.0899345233793492, -0.03881744716647149, -0.273200926411411, 0.10301205112963267, -0.18334746213656836, -0.14157013364298188, -0.12606318460008048, -0.013471235446901857, 0.013938903633127178, -0.3226540809551227, 0.12940387103193696, 0.09065956215330305, 0.07564409360613512, 0.014091998957893878, -0.15626539868991013, 0.04057898271181013, 0.10694529124252174, 0.07374325885599398, 0.01341655063510373, 0.09877560410540605, -0.12329471804728002, -0.08632865266037593, 0.3165055855406799, -0.09778815352668364, -0.16492935677693374, 0.2203518228902333, -0.10090795579109935, -0.1464748466387391, 0.052863023854603154, 0.19277150699517864, 0.11613971621230029, -0.1689869384382568, 0.07586629564479075, -0.0579993322464651, 0.1383100313630522, 0.02069821365285611, 0.06455660576297753, 0.16089329806804334, 0.15412891440201495, 0.11640249835192293, 0.15699422405695246, -0.18305819075001215, -0.04709625688880898, -0.29109541137797246, -0.13332429039629473, -0.1864363174257881, 0.03502302617150987, -0.12020813775619162, -0.22785453695425953, 0.359427897023388, 0.21696516517819703, 0.1481841538992265, 0.08371970516400061, 0.29313216452905233, 0.17650689472498346, 0.06810723333552048, 0.05953791263796713, 0.2766080134973416, 0.20290005998011085, 0.00865194698849666, -0.16630188436956023, 0.1316010679314048, 0.10608487294150004] |
1,802.10303 | RRR: Rank-Regret Representative | Selecting the best items in a dataset is a common task in data exploration.
However, the concept of "best" lies in the eyes of the beholder: different
users may consider different attributes more important, and hence arrive at
different rankings. Nevertheless, one can remove "dominated" items and create a
"representative" subset of the data set, comprising the "best items" in it. A
Pareto-optimal representative is guaranteed to contain the best item of each
possible ranking, but it can be almost as big as the full data. Representative
can be found if we relax the requirement to include the best item for every
possible user, and instead just limit the users' "regret". Existing work
defines regret as the loss in score by limiting consideration to the
representative instead of the full data set, for any chosen ranking function.
However, the score is often not a meaningful number and users may not
understand its absolute value. Sometimes small ranges in score can include
large fractions of the data set. In contrast, users do understand the notion of
rank ordering. Therefore, alternatively, we consider the position of the items
in the ranked list for defining the regret and propose the {\em rank-regret
representative} as the minimal subset of the data containing at least one of
the top-$k$ of any possible ranking function. This problem is NP-complete. We
use the geometric interpretation of items to bound their ranks on ranges of
functions and to utilize combinatorial geometry notions for developing
effective and efficient approximation algorithms for the problem. Experiments
on real datasets demonstrate that we can efficiently find small subsets with
small rank-regrets.
| cs.DB | selecting the best items in a dataset is a common task in data exploration however the concept of best lies in the eyes of the beholder different users may consider different attributes more important and hence arrive at different rankings nevertheless one can remove dominated items and create a representative subset of the data set comprising the best items in it a paretooptimal representative is guaranteed to contain the best item of each possible ranking but it can be almost as big as the full data representative can be found if we relax the requirement to include the best item for every possible user and instead just limit the users regret existing work defines regret as the loss in score by limiting consideration to the representative instead of the full data set for any chosen ranking function however the score is often not a meaningful number and users may not understand its absolute value sometimes small ranges in score can include large fractions of the data set in contrast users do understand the notion of rank ordering therefore alternatively we consider the position of the items in the ranked list for defining the regret and propose the em rankregret representative as the minimal subset of the data containing at least one of the topk of any possible ranking function this problem is npcomplete we use the geometric interpretation of items to bound their ranks on ranges of functions and to utilize combinatorial geometry notions for developing effective and efficient approximation algorithms for the problem experiments on real datasets demonstrate that we can efficiently find small subsets with small rankregrets | [['selecting', 'the', 'best', 'items', 'in', 'a', 'dataset', 'is', 'a', 'common', 'task', 'in', 'data', 'exploration', 'however', 'the', 'concept', 'of', 'best', 'lies', 'in', 'the', 'eyes', 'of', 'the', 'beholder', 'different', 'users', 'may', 'consider', 'different', 'attributes', 'more', 'important', 'and', 'hence', 'arrive', 'at', 'different', 'rankings', 'nevertheless', 'one', 'can', 'remove', 'dominated', 'items', 'and', 'create', 'a', 'representative', 'subset', 'of', 'the', 'data', 'set', 'comprising', 'the', 'best', 'items', 'in', 'it', 'a', 'paretooptimal', 'representative', 'is', 'guaranteed', 'to', 'contain', 'the', 'best', 'item', 'of', 'each', 'possible', 'ranking', 'but', 'it', 'can', 'be', 'almost', 'as', 'big', 'as', 'the', 'full', 'data', 'representative', 'can', 'be', 'found', 'if', 'we', 'relax', 'the', 'requirement', 'to', 'include', 'the', 'best', 'item', 'for', 'every', 'possible', 'user', 'and', 'instead', 'just', 'limit', 'the', 'users', 'regret', 'existing', 'work', 'defines', 'regret', 'as', 'the', 'loss', 'in', 'score', 'by', 'limiting', 'consideration', 'to', 'the', 'representative', 'instead', 'of', 'the', 'full', 'data', 'set', 'for', 'any', 'chosen', 'ranking', 'function', 'however', 'the', 'score', 'is', 'often', 'not', 'a', 'meaningful', 'number', 'and', 'users', 'may', 'not', 'understand', 'its', 'absolute', 'value', 'sometimes', 'small', 'ranges', 'in', 'score', 'can', 'include', 'large', 'fractions', 'of', 'the', 'data', 'set', 'in', 'contrast', 'users', 'do', 'understand', 'the', 'notion', 'of', 'rank', 'ordering', 'therefore', 'alternatively', 'we', 'consider', 'the', 'position', 'of', 'the', 'items', 'in', 'the', 'ranked', 'list', 'for', 'defining', 'the', 'regret', 'and', 'propose', 'the', 'em', 'rankregret', 'representative', 'as', 'the', 'minimal', 'subset', 'of', 'the', 'data', 'containing', 'at', 'least', 'one', 'of', 'the', 'topk', 'of', 'any', 'possible', 'ranking', 'function', 'this', 'problem', 'is', 'npcomplete', 'we', 'use', 'the', 'geometric', 'interpretation', 'of', 'items', 'to', 'bound', 'their', 'ranks', 'on', 'ranges', 'of', 'functions', 'and', 'to', 'utilize', 'combinatorial', 'geometry', 'notions', 'for', 'developing', 'effective', 'and', 'efficient', 'approximation', 'algorithms', 'for', 'the', 'problem', 'experiments', 'on', 'real', 'datasets', 'demonstrate', 'that', 'we', 'can', 'efficiently', 'find', 'small', 'subsets', 'with', 'small', 'rankregrets']] | [-0.08346847040610988, 0.03423024672833498, -0.03958897236106771, 0.10909463100663773, -0.1405451134839601, -0.13716461975301864, 0.12284259903610925, 0.3841248190340896, -0.27200562366169323, -0.35574666874601824, 0.0880761184968189, -0.30996269357644896, -0.09696033442818494, 0.14921020440214874, -0.10548983901313572, 0.027888352985969964, 0.06840301828733811, 0.09868362796412648, -0.03885765023302694, -0.3125498202552649, 0.326177509382981, 0.03982777825176493, 0.2649814388304879, 0.023652549559897516, 0.08489937852363517, 0.009230602967765615, -0.04510566940721236, 0.04273925270634086, -0.09938464269024247, 0.10283093263259095, 0.3309487348303813, 0.22522799031676424, 0.32275218852492193, -0.3650167358245427, -0.13598653855768456, 0.154597407243518, 0.11730366348540096, 0.07992811972230249, 0.012446530129878662, -0.2405376770278118, 0.10721339024551045, -0.1345823871892657, -0.05748625426842702, -0.08876006261485694, 0.013683476618295779, 0.00611981864031474, -0.31227794872624764, 0.014155831840565108, 0.018712972680827052, 0.016041101161098414, -0.049856566296879914, -0.14411161996577673, 0.0036631559993206674, 0.1671546643882404, 0.05036656705362631, 0.012606927308808552, 0.12217576019199956, -0.13648759854926068, -0.1222858043101508, 0.43079439575403705, -0.025742564961656035, -0.20937312937739275, 0.1776824243286492, -0.12868517340284732, -0.12103610949709398, 0.1070998453200282, 0.19386558395449408, 0.12960394416172283, -0.1575004325705242, 0.03345995276581238, -0.10953116051639929, 0.17428056063646738, 0.07154741042951115, 0.036456103897077985, 0.18604015569422352, 0.1802854762457953, 0.0970386524923662, 0.12366843671356555, -0.03938328757819332, -0.05040059544295177, -0.2759821274878513, -0.13291653746164364, -0.21505779138511597, 3.109941590831995e-05, -0.13687498059150133, -0.1698569302684331, 0.3890831374810932, 0.17767407522146147, 0.22707891172802683, 0.07061080474402992, 0.28877999506235014, 0.06478619627620326, 0.09100062116868933, 0.10427812409254963, 0.18531434710768893, -0.01803132558497862, 0.04716444994961278, -0.13989061824907636, 0.14592487665507176, 0.023735557261624195] |
1,802.10304 | Reality and Myths of AGN Feedback | Feedback from active galactic nuclei (AGN) remains controversial despite its
wide acceptance as necessary to regulate massive galaxy growth. A dedicated
workshop was held on 16-20 October 2017 at the Lorentz Center in Leiden to
distinguish between the reality and myths of AGN feedback from the
observational side. Here, we summarize briefly all the sessions and outcome of
the stimulating workshop. More details on the outcome of the discussions are
provided in a series of articles.
| astro-ph.GA | feedback from active galactic nuclei agn remains controversial despite its wide acceptance as necessary to regulate massive galaxy growth a dedicated workshop was held on 1620 october 2017 at the lorentz center in leiden to distinguish between the reality and myths of agn feedback from the observational side here we summarize briefly all the sessions and outcome of the stimulating workshop more details on the outcome of the discussions are provided in a series of articles | [['feedback', 'from', 'active', 'galactic', 'nuclei', 'agn', 'remains', 'controversial', 'despite', 'its', 'wide', 'acceptance', 'as', 'necessary', 'to', 'regulate', 'massive', 'galaxy', 'growth', 'a', 'dedicated', 'workshop', 'was', 'held', 'on', '1620', 'october', '2017', 'at', 'the', 'lorentz', 'center', 'in', 'leiden', 'to', 'distinguish', 'between', 'the', 'reality', 'and', 'myths', 'of', 'agn', 'feedback', 'from', 'the', 'observational', 'side', 'here', 'we', 'summarize', 'briefly', 'all', 'the', 'sessions', 'and', 'outcome', 'of', 'the', 'stimulating', 'workshop', 'more', 'details', 'on', 'the', 'outcome', 'of', 'the', 'discussions', 'are', 'provided', 'in', 'a', 'series', 'of', 'articles']] | [-0.05185714632572949, 0.113747985138999, -0.07868096460955903, 0.08580647650370865, -0.1481041693263442, -0.08909032566972248, 0.08299894096317555, 0.3777503115798984, -0.1412146424715358, -0.3549751411927374, 0.11009580857965998, -0.31145711299522144, -0.08609197697430652, 0.21157461938472757, -0.09829609404244509, -0.0547655061213606, 0.022463693859447773, 0.0045820949660418065, 0.0053489311157088534, -0.33477102452276375, 0.3182874313114505, 0.16466084191281544, 0.23871634813947726, 0.05724301654079586, 0.1045351511942212, -0.027858967531325395, -0.15376310236752033, -0.052781826629622004, -0.10909497491880565, 0.08538879577903763, 0.3114953280034426, 0.19514040304592958, 0.32282903422846604, -0.43467484125377315, -0.13978616776876152, 0.004873884746829342, 0.07555913382920583, 0.058329680787497444, -0.11258666645249162, -0.2793275837688462, -0.007031239128034366, -0.20666192625159105, -0.09973557945953584, 0.06142869382778084, 0.05780829673044776, 0.03567914312989878, -0.16025229702752672, 0.06360537529383835, 0.012918892206232014, 0.13411058124926822, -0.08421247100187956, -0.08069026527166563, -0.0199559432344119, 0.1717680419582106, 0.08559371307982426, 0.06255253495519834, 0.17890521254709088, -0.14297829896187117, -0.12213440670166165, 0.39471768558417497, 0.08220676409913913, 0.002806980677537228, 0.25732903208240476, -0.21395087410009614, -0.20536021151163272, 0.07157507611708225, 0.2586411660105162, 0.06683216914902196, -0.1356762426500944, 0.042258837491604744, -0.011875837471483177, 0.20614935450353905, 0.04510601954289565, -0.006585276627255983, 0.2898167915715787, 0.15299774801946783, -0.016529498796444386, 0.07469408220219377, -0.08548794938619003, -0.104642931659902, -0.3431055998172317, -0.07143544074757588, -0.09257137518235188, 0.05416918309607641, 0.011397360000333529, -0.05782310775018567, 0.3589868743315731, 0.11199523377121966, 0.18134009409205695, -0.047985669041640665, 0.2526021105433373, -0.02742545349112908, 0.040868964171462914, 0.09463268561337732, 0.32197931912531585, 0.14665214377821126, 0.16014469821177618, -0.20620375848987973, 0.08172417892829369, 0.037200228262104486] |
1,802.10305 | Observing positive and negative AGN feedback | Galaxy-scale outflows powered by actively accreting supermassive black holes
are routinely detected, and they have been associated both with suppression and
triggering of star formation. Recent observational evidence and simulations are
favouring a delayed mechanism that connects outflows and star formation
| astro-ph.GA | galaxyscale outflows powered by actively accreting supermassive black holes are routinely detected and they have been associated both with suppression and triggering of star formation recent observational evidence and simulations are favouring a delayed mechanism that connects outflows and star formation | [['galaxyscale', 'outflows', 'powered', 'by', 'actively', 'accreting', 'supermassive', 'black', 'holes', 'are', 'routinely', 'detected', 'and', 'they', 'have', 'been', 'associated', 'both', 'with', 'suppression', 'and', 'triggering', 'of', 'star', 'formation', 'recent', 'observational', 'evidence', 'and', 'simulations', 'are', 'favouring', 'a', 'delayed', 'mechanism', 'that', 'connects', 'outflows', 'and', 'star', 'formation']] | [-0.1240174316960137, 0.16816149361249877, 0.00430386856470893, 0.15660468316296253, -0.18861945209706701, -0.1148020964592877, -0.015989848798731478, 0.455148352378207, -0.10047431507079703, -0.372252626960711, 0.11354572974463426, -0.33614737690403695, -0.06987478300111323, 0.21644805844237164, 0.04427106553552354, -0.03368399046906611, 0.047666507374875745, -0.15130765622527134, 0.021315664816761344, -0.22037550988720683, 0.35322400850312013, 0.15202726578203643, 0.11651453254432077, -0.037281363134885705, 0.07967197853026957, -0.21951913974452308, -0.10189557445757999, -0.01634272360583631, -0.1694140862966334, -0.015525832141908566, 0.22805567869416823, 0.1751221813341012, 0.26040992949430536, -0.4888823721103552, -0.31025849450833914, 0.06267600002267011, 0.26234560716533806, 0.05579198158641414, -0.30314354989223363, -0.25648911410897246, 0.11372838577073885, -0.30098667478461455, -0.09006918088828282, 0.015055689381480945, 0.04443798874073276, 0.10471727340141447, -0.2519493707109288, 0.1861270888731247, 0.07110074402128415, -0.029779527972384198, -0.13037598809999665, 0.07937423034184952, -0.13040528959799103, 0.04481002862463001, 0.08042592727919905, 0.11915326763580485, 0.26740138246337086, -0.15902310596188393, -0.1727908592807447, 0.3296608562331374, 0.053353875898188206, 0.04386527154867242, 0.32396789661767644, -0.2607761666110558, -0.19406536511406758, 0.1692441954936196, 0.1369602201824508, 0.16543639478523556, -0.1279226753111111, -0.12583264509193237, 0.028174796627221128, 0.13188601355636265, 0.047401915048816946, 0.10351728458275519, 0.542113038370522, 0.1250453111602039, -0.0987040404764163, 0.05565377422494859, -0.14500819314867486, -0.12086622679333497, -0.15940908324427722, 0.0003844510832029145, -0.07668482924516244, 0.12208097725652339, -0.07813840806796556, 0.0022849371520484367, 0.1978645055814257, 0.022464308087009846, 0.1937842711170272, -0.054868875207697475, 0.24936927557916155, 0.06434654492157989, 0.11064016373782623, 0.1872859007065616, 0.3889030978628775, 0.20544053310323962, 0.08153373260255449, -0.28849757860255676, 0.17938029368850972, 0.01563763507164833] |
1,802.10306 | AGN outflows and feedback twenty years on | It is the twentieth anniversary of the publication of the seminal papers by
Magorrian et al. and Silk & Rees which, along with other related work, ignited
an explosion of publications connecting active galactic nuclei (AGN)-driven
outflows to galaxy evolution. With a surge in observations of AGN outflows,
studies are attempting to directly test AGN feedback models using the outflow
properties. With a focus on outflows traced by optical and CO emission lines,
we discuss significant challenges which greatly complicate this task from both
an observational and theoretical perspective. We highlight observational
uncertainties involved, and the assumptions required, when deriving kinetic
coupling efficiencies (i.e., outflow kinetic power as a fraction of AGN
luminosity) from typical observations. Based on recent models we demonstrate
that extreme caution should taken when comparing observationally-derived
kinetic coupling efficiencies to coupling efficiencies from fiducial feedback
models.
| astro-ph.GA astro-ph.HE | it is the twentieth anniversary of the publication of the seminal papers by magorrian et al and silk rees which along with other related work ignited an explosion of publications connecting active galactic nuclei agndriven outflows to galaxy evolution with a surge in observations of agn outflows studies are attempting to directly test agn feedback models using the outflow properties with a focus on outflows traced by optical and co emission lines we discuss significant challenges which greatly complicate this task from both an observational and theoretical perspective we highlight observational uncertainties involved and the assumptions required when deriving kinetic coupling efficiencies ie outflow kinetic power as a fraction of agn luminosity from typical observations based on recent models we demonstrate that extreme caution should taken when comparing observationallyderived kinetic coupling efficiencies to coupling efficiencies from fiducial feedback models | [['it', 'is', 'the', 'twentieth', 'anniversary', 'of', 'the', 'publication', 'of', 'the', 'seminal', 'papers', 'by', 'magorrian', 'et', 'al', 'and', 'silk', 'rees', 'which', 'along', 'with', 'other', 'related', 'work', 'ignited', 'an', 'explosion', 'of', 'publications', 'connecting', 'active', 'galactic', 'nuclei', 'agndriven', 'outflows', 'to', 'galaxy', 'evolution', 'with', 'a', 'surge', 'in', 'observations', 'of', 'agn', 'outflows', 'studies', 'are', 'attempting', 'to', 'directly', 'test', 'agn', 'feedback', 'models', 'using', 'the', 'outflow', 'properties', 'with', 'a', 'focus', 'on', 'outflows', 'traced', 'by', 'optical', 'and', 'co', 'emission', 'lines', 'we', 'discuss', 'significant', 'challenges', 'which', 'greatly', 'complicate', 'this', 'task', 'from', 'both', 'an', 'observational', 'and', 'theoretical', 'perspective', 'we', 'highlight', 'observational', 'uncertainties', 'involved', 'and', 'the', 'assumptions', 'required', 'when', 'deriving', 'kinetic', 'coupling', 'efficiencies', 'ie', 'outflow', 'kinetic', 'power', 'as', 'a', 'fraction', 'of', 'agn', 'luminosity', 'from', 'typical', 'observations', 'based', 'on', 'recent', 'models', 'we', 'demonstrate', 'that', 'extreme', 'caution', 'should', 'taken', 'when', 'comparing', 'observationallyderived', 'kinetic', 'coupling', 'efficiencies', 'to', 'coupling', 'efficiencies', 'from', 'fiducial', 'feedback', 'models']] | [-0.030976230089331595, 0.07671048983503569, 0.0027669915701631163, 0.07732357171183224, -0.1494648218717721, -0.09680600776655345, 0.058958114072908276, 0.42366980708023305, -0.16333888956553322, -0.3509139901817703, 0.04891939922286157, -0.29438741172147953, -0.04088798833327542, 0.22576512669953483, -0.06099012640067008, -0.008028579035793975, 0.07065921846991606, -0.15084098365573254, -0.02282170880009695, -0.25898144008899976, 0.322058659487424, 0.17969741035092004, 0.21825261773263513, 0.01933471448954007, 0.09660284467738309, -0.13513978933178478, -0.1145870073819064, -0.0023376640977619363, -0.16520412060250603, 0.07139258117837122, 0.24443947304922836, 0.15585127966009454, 0.2803651588305617, -0.42354264341147363, -0.2724761732807048, 0.04707831258570655, 0.17358602678215654, 0.0823127368313056, -0.07885970581463612, -0.25401546502579675, -0.04366576487680884, -0.218860054871054, -0.09846760071278048, 0.03713351473708054, 0.03405935658190547, 0.0674079363958011, -0.23313787081044354, 0.11332714902706069, 0.03216645820987605, 0.08420737497106516, -0.06057729664184957, -0.09595056501947505, -0.07079842050472716, 0.04913787035105696, 0.10386951281538354, 0.04271697466723996, 0.216294494708799, -0.1654471514307686, -0.11747573152110785, 0.39698493715188055, -0.018955953492910314, -0.027222482447777103, 0.2130295062243349, -0.16765689907139905, -0.18952203085713035, 0.12009422051914626, 0.15959184297541384, 0.07425062206955693, -0.12740553136533478, -0.006608872396348835, -0.006865087983687576, 0.17002383611339192, -0.009971490894065727, 0.029659678673864973, 0.295338033812402, 0.11212209117826637, -0.04680224583088923, 0.09570725730757677, -0.11317171247361107, -0.07934587833299067, -0.2663664510808617, -0.05891618260815606, -0.1142209081595643, 0.13706416387543108, -0.08872727100300207, -0.043995568456744655, 0.3234205671163986, 0.16759300104379252, 0.23050798760499241, 0.007873176608784057, 0.3140307801282335, 0.07731991135950783, 0.05262790774430731, 0.11099649971416355, 0.3477287270302931, 0.18004176182766185, 0.10538712119693673, -0.25773159115200045, 0.0912111369941531, 0.03644116718670447] |
1,802.10307 | Questions and challenges of what powers galactic outflows in active
galactic nuclei | Different mechanisms can drive outflows in active galactic nuclei (AGN), but
it is often unclear which mechanism dominates, if any. To quantify the impact
of AGN feedback on galaxy evolution, the driving mechanism of outflows must be
better understood.
| astro-ph.GA | different mechanisms can drive outflows in active galactic nuclei agn but it is often unclear which mechanism dominates if any to quantify the impact of agn feedback on galaxy evolution the driving mechanism of outflows must be better understood | [['different', 'mechanisms', 'can', 'drive', 'outflows', 'in', 'active', 'galactic', 'nuclei', 'agn', 'but', 'it', 'is', 'often', 'unclear', 'which', 'mechanism', 'dominates', 'if', 'any', 'to', 'quantify', 'the', 'impact', 'of', 'agn', 'feedback', 'on', 'galaxy', 'evolution', 'the', 'driving', 'mechanism', 'of', 'outflows', 'must', 'be', 'better', 'understood']] | [-0.08316150672423343, 0.17662121484485957, -0.06889327558187339, 0.24328077987182695, -0.18058088178244922, -0.141929389622349, 0.042546315011210166, 0.4942790415997689, -0.2536181256366082, -0.2945423923038806, 0.008671058828417117, -0.21438114029856828, -0.07385375704138707, 0.20485039686825937, -0.016961234311262768, -0.14121812104414672, -0.058294352144002914, -0.15102234332917783, 0.06859815808442923, -0.2686108640180184, 0.33971889957021445, 0.18013407457142305, 0.18277399600125277, 0.02654800617780823, 0.1463651820921745, -0.2026539469639269, -0.05701335720144785, -0.06019917483596752, -0.07657073162651311, -0.04994211115468389, 0.265635886348975, 0.15215273451012296, 0.31718767063023573, -0.4293932478683881, -0.3049283026693723, 0.1661393939732359, 0.30094975264122087, 0.08051451969927606, -0.08268455245520155, -0.1393712843553378, 0.04970136471092701, -0.22244957984926608, -0.12299566267010494, 0.0020541418104981766, 0.013828656731698757, 0.049836878959421224, -0.23077965809557682, 0.08508445470569989, 0.10691759281624587, 0.03846097209801277, -0.12962668266696617, 0.011171368404458731, -0.09735718310828535, 0.1437180683685419, 0.08219709129741368, 0.11758673358231019, 0.3498948035069192, -0.18671082710035336, -0.09917861133670577, 0.4561433719518857, 0.09869728820064129, -0.07584077635636696, 0.24591929331803933, -0.23361867831016964, -0.16054150619759008, 0.13342045557995638, 0.2287595982496173, 0.11131770158998477, -0.15223538874609707, -0.06586135339696342, 0.005601131357252598, 0.2328821446460027, -0.10859550250312075, 0.07736456613332475, 0.2828661982352153, 0.11923944281461911, 0.03755189492725409, 0.0688017269757648, -0.08346661153392723, -0.09762666978610632, -0.21778515584241503, 0.011963949204446414, -0.09581371731100938, 0.14336718750210145, -0.091581382884238, -0.07141635132929644, 0.30991202917618627, 0.11353940753719936, 0.1819671492975874, -0.10526658642069939, 0.3628048975116167, 0.04471407105955176, 0.12925174089674002, 0.15078219856159428, 0.41462011988728475, 0.08474322395303692, 0.013539247477474885, -0.31791261517896485, 0.23798352561126918, 0.0320362698000211] |
1,802.10308 | The largely unconstrained multiphase nature of outflows in AGN host
galaxies | Observations and simulations show that outflows in active galactic nuclei
(AGN) contain gas in different phases. To understand their true impact on
galaxy evolution, we advocate consistent and unbiased investigation of these
multiphase winds in large AGN samples.
| astro-ph.GA | observations and simulations show that outflows in active galactic nuclei agn contain gas in different phases to understand their true impact on galaxy evolution we advocate consistent and unbiased investigation of these multiphase winds in large agn samples | [['observations', 'and', 'simulations', 'show', 'that', 'outflows', 'in', 'active', 'galactic', 'nuclei', 'agn', 'contain', 'gas', 'in', 'different', 'phases', 'to', 'understand', 'their', 'true', 'impact', 'on', 'galaxy', 'evolution', 'we', 'advocate', 'consistent', 'and', 'unbiased', 'investigation', 'of', 'these', 'multiphase', 'winds', 'in', 'large', 'agn', 'samples']] | [-0.038094530582097115, 0.11154097816171615, -0.04696192391412823, 0.19868812033612476, -0.09725024060983407, -0.02701910427085271, 0.05212436689946212, 0.5181306343721716, -0.11641788470411771, -0.32838804019909157, 0.015639127847910123, -0.3142072983625296, -0.005205067511844008, 0.16023479713323086, 0.004332286881675061, -0.0572866468053115, 0.017882926340558027, -0.2454262251328481, -0.005962429431843032, -0.27743008468104036, 0.3154927213725291, 0.09797686585960419, 0.1684641449369098, -0.0807010843541081, 0.12164087932078953, -0.14184576302374663, -0.16235920375114993, 0.001254121797453416, -0.18962677794383795, -0.004165066222317125, 0.31192474951967597, 0.11745976637068548, 0.2357417082806167, -0.448223413703473, -0.2774484059038131, 0.08991758209212046, 0.25110935537438644, 0.06468185135408451, -0.152642867396169, -0.19738639739194982, 0.011996825813854995, -0.21049932385549733, -0.174875788268094, -0.041438023559749126, -0.015750956648078403, 0.08697148636718721, -0.20733135678854428, 0.1430178988528879, 0.027319056276035935, 0.12330393393303414, -0.13576471984484478, -0.07869242188079577, -0.060634164127374164, 0.06734479372205801, 0.07350002979173471, 0.02954953407721692, 0.27388821814307257, -0.1699159247555623, -0.03089102929899175, 0.4001948703080416, 0.049708927099249865, 0.009069696804018397, 0.28301079865348966, -0.2985459397685573, -0.2517591496702823, 0.14807088182945, 0.3017003403878526, 0.09610352042670313, -0.11358862723174848, -0.06288851800337925, -0.0750030237495115, 0.198700892591947, -0.14292591898150644, 0.05433749913055707, 0.32988721017088546, 0.08537821001128147, 0.0011843355421565082, 0.08742980061000899, -0.12797709459463427, -0.09483044817553539, -0.2070278596794723, -0.06977095351995606, -0.11776932667156584, 0.11436259055412129, -0.16122152906226753, -0.09044166192363359, 0.29001983608070175, 0.18159256019556014, 0.2175887889767948, -0.03802353878946681, 0.2854246048158721, -0.08167710450575932, 0.06116163627072973, 0.1604399644818745, 0.3721702022379951, 0.15387542908521076, 0.006912034568621924, -0.29363479629453076, 0.108991971460024, 0.0009340742468147686] |
1,802.10309 | Online Non-preemptive Scheduling on Unrelated Machines with Rejections | When a computer system schedules jobs there is typically a significant cost
associated with preempting a job during execution. This cost can be from the
expensive task of saving the memory's state and loading data into and out of
memory. It is desirable to schedule jobs non-preemptively to avoid the costs of
preemption. There is a need for non-preemptive system schedulers on desktops,
servers and data centers. Despite this need, there is a gap between theory and
practice. Indeed, few non-preemptive \emph{online} schedulers are known to have
strong foundational guarantees. This gap is likely due to strong lower bounds
on any online algorithm for popular objectives. Indeed, typical worst case
analysis approaches, and even resource augmented approaches such as speed
augmentation, result in all algorithms having poor performance guarantees. This
paper considers on-line non-preemptive scheduling problems in the worst-case
rejection model where the algorithm is allowed to reject a small fraction of
jobs. By rejecting only a few jobs, this paper shows that the strong lower
bounds can be circumvented. This approach can be used to discover algorithmic
scheduling policies with desirable worst-case guarantees. Specifically, the
paper presents algorithms for the following two objectives: minimizing the
total flow-time and minimizing the total weighted flow-time plus energy under
the speed-scaling mechanism. The algorithms have a small constant competitive
ratio while rejecting only a constant fraction of jobs. Beyond specific
results, the paper asserts that alternative models beyond speed augmentation
should be explored to aid in the discovery of good schedulers in the face of
the requirement of being online and non-preemptive.
| cs.DS | when a computer system schedules jobs there is typically a significant cost associated with preempting a job during execution this cost can be from the expensive task of saving the memorys state and loading data into and out of memory it is desirable to schedule jobs nonpreemptively to avoid the costs of preemption there is a need for nonpreemptive system schedulers on desktops servers and data centers despite this need there is a gap between theory and practice indeed few nonpreemptive emphonline schedulers are known to have strong foundational guarantees this gap is likely due to strong lower bounds on any online algorithm for popular objectives indeed typical worst case analysis approaches and even resource augmented approaches such as speed augmentation result in all algorithms having poor performance guarantees this paper considers online nonpreemptive scheduling problems in the worstcase rejection model where the algorithm is allowed to reject a small fraction of jobs by rejecting only a few jobs this paper shows that the strong lower bounds can be circumvented this approach can be used to discover algorithmic scheduling policies with desirable worstcase guarantees specifically the paper presents algorithms for the following two objectives minimizing the total flowtime and minimizing the total weighted flowtime plus energy under the speedscaling mechanism the algorithms have a small constant competitive ratio while rejecting only a constant fraction of jobs beyond specific results the paper asserts that alternative models beyond speed augmentation should be explored to aid in the discovery of good schedulers in the face of the requirement of being online and nonpreemptive | [['when', 'a', 'computer', 'system', 'schedules', 'jobs', 'there', 'is', 'typically', 'a', 'significant', 'cost', 'associated', 'with', 'preempting', 'a', 'job', 'during', 'execution', 'this', 'cost', 'can', 'be', 'from', 'the', 'expensive', 'task', 'of', 'saving', 'the', 'memorys', 'state', 'and', 'loading', 'data', 'into', 'and', 'out', 'of', 'memory', 'it', 'is', 'desirable', 'to', 'schedule', 'jobs', 'nonpreemptively', 'to', 'avoid', 'the', 'costs', 'of', 'preemption', 'there', 'is', 'a', 'need', 'for', 'nonpreemptive', 'system', 'schedulers', 'on', 'desktops', 'servers', 'and', 'data', 'centers', 'despite', 'this', 'need', 'there', 'is', 'a', 'gap', 'between', 'theory', 'and', 'practice', 'indeed', 'few', 'nonpreemptive', 'emphonline', 'schedulers', 'are', 'known', 'to', 'have', 'strong', 'foundational', 'guarantees', 'this', 'gap', 'is', 'likely', 'due', 'to', 'strong', 'lower', 'bounds', 'on', 'any', 'online', 'algorithm', 'for', 'popular', 'objectives', 'indeed', 'typical', 'worst', 'case', 'analysis', 'approaches', 'and', 'even', 'resource', 'augmented', 'approaches', 'such', 'as', 'speed', 'augmentation', 'result', 'in', 'all', 'algorithms', 'having', 'poor', 'performance', 'guarantees', 'this', 'paper', 'considers', 'online', 'nonpreemptive', 'scheduling', 'problems', 'in', 'the', 'worstcase', 'rejection', 'model', 'where', 'the', 'algorithm', 'is', 'allowed', 'to', 'reject', 'a', 'small', 'fraction', 'of', 'jobs', 'by', 'rejecting', 'only', 'a', 'few', 'jobs', 'this', 'paper', 'shows', 'that', 'the', 'strong', 'lower', 'bounds', 'can', 'be', 'circumvented', 'this', 'approach', 'can', 'be', 'used', 'to', 'discover', 'algorithmic', 'scheduling', 'policies', 'with', 'desirable', 'worstcase', 'guarantees', 'specifically', 'the', 'paper', 'presents', 'algorithms', 'for', 'the', 'following', 'two', 'objectives', 'minimizing', 'the', 'total', 'flowtime', 'and', 'minimizing', 'the', 'total', 'weighted', 'flowtime', 'plus', 'energy', 'under', 'the', 'speedscaling', 'mechanism', 'the', 'algorithms', 'have', 'a', 'small', 'constant', 'competitive', 'ratio', 'while', 'rejecting', 'only', 'a', 'constant', 'fraction', 'of', 'jobs', 'beyond', 'specific', 'results', 'the', 'paper', 'asserts', 'that', 'alternative', 'models', 'beyond', 'speed', 'augmentation', 'should', 'be', 'explored', 'to', 'aid', 'in', 'the', 'discovery', 'of', 'good', 'schedulers', 'in', 'the', 'face', 'of', 'the', 'requirement', 'of', 'being', 'online', 'and', 'nonpreemptive']] | [-0.15971297968017797, 0.061451739793679176, -0.05699556935757685, 0.08116391834874566, -0.09682702838013378, -0.2045610636741353, 0.15922208272252017, 0.4072226710545902, -0.25689668944463706, -0.37591482002574667, 0.1187541409700106, -0.24695840073713604, -0.08887489736035395, 0.18159175677887665, -0.164838283492897, 0.10628226560433036, 0.13675747672812297, 0.032225767117387685, -0.020262407376251828, -0.3269837202710243, 0.23893278455899025, 0.08810560323047237, 0.2955091942853939, 0.0681848337970083, 0.06085887231881945, -0.017302486399421467, 0.014520825574380489, 0.04002554354150421, -0.07881912837871753, 0.07870129686063872, 0.3071617993174256, 0.20594528700905637, 0.37300630739102, -0.4391808885651139, -0.14345793191952488, 0.1805354370722153, 0.1308797098767872, 0.05532501071888524, -0.02973621283622029, -0.2054089429582326, 0.11941995718158209, -0.16420642979657993, -0.016876126415669344, -0.04910614785218898, -0.022522476399675584, 0.006024949981320578, -0.2993560634338512, 0.026990700219399654, 0.03677477027119424, 0.004489583686853831, -0.05957746409873765, -0.1223302705347753, 0.06791802624312158, 0.1105312411687919, 0.11156421889139052, 0.0450347517312576, 0.11472641959643134, -0.13651999201549467, -0.1628493271880031, 0.42895822384251425, -0.01277453276472023, -0.17758333810667795, 0.1768680986988609, -0.01789434002398943, -0.1838114803406195, 0.13601419955151728, 0.21323052221873345, 0.10161486038436683, -0.16966985531913592, 0.067779627154232, -0.02211564933308042, 0.1818821844703052, 0.0673118539123187, 0.03335231493782395, 0.12768515772992173, 0.2004526208772754, 0.1661704880471986, 0.13840531090122218, 0.004789957284810953, -0.09956095502711833, -0.2398565205588686, -0.14039426603726146, -0.19637757083311533, 0.008292206720216199, -0.10098318707543792, -0.11409047130593815, 0.33894258202859556, 0.14886132890023873, 0.15119720594084357, 0.14754284740237592, 0.38027591065575295, 0.09853995991109583, 0.09339290415295042, 0.19234394575178157, 0.19270680607565177, -0.006695069181911934, 0.1203350056329957, -0.18823340048279183, 0.14140686320830495, -0.004035047596195139] |
1,802.1031 | Static and Radio-frequency magnetic response of high Tc Superconducting
Quantum Interference Filters made by ion irradiation | Superconducting Quantum Interference Filters (SQIF) are promising devices for
Radio- Frequency (RF) detection combining low noise, high sensitivity, large
dynamic range and wide-band capabilities. Impressive progress have been made
recently in the field, with SQIF based antennas and amplifiers showing
interesting properties in the GHz range using the well-established Nb/AlOx
technology. The possibility to extend these results to High Temperature
Superconductors (HTS) is still open, and different techniques to fabricate HTS
SQIFs are competing to make RF devices. We report on the DC and RF response of
a High Temperature SQIF fabricated by the ion irradiation technique. It is made
of 1000 Superconducting QUantum Interference Devices (SQUIDs) in series, with
loop areas randomly distributed between 6 micron2 and 60 micron2. The DC
transfer factor is around 450 V/T at optimal bias and temperature, and the
maximum voltage swing around 2:5 mV . We show that such a SQIF detects RF
signals up to 150 MHz. It presents linear characteristics for RF power spanning
more than five decades, and non-linearities develop beyond PRF = -35 dBm in our
set-up configuration. Second-harmonic generation has been shown to be minimum
at the functioning point in the whole range of frequencies. A model has been
developed which captures the essential features of the SQIF RF response.
| physics.app-ph cond-mat.supr-con | superconducting quantum interference filters sqif are promising devices for radio frequency rf detection combining low noise high sensitivity large dynamic range and wideband capabilities impressive progress have been made recently in the field with sqif based antennas and amplifiers showing interesting properties in the ghz range using the wellestablished nbalox technology the possibility to extend these results to high temperature superconductors hts is still open and different techniques to fabricate hts sqifs are competing to make rf devices we report on the dc and rf response of a high temperature sqif fabricated by the ion irradiation technique it is made of 1000 superconducting quantum interference devices squids in series with loop areas randomly distributed between 6 micron2 and 60 micron2 the dc transfer factor is around 450 vt at optimal bias and temperature and the maximum voltage swing around 25 mv we show that such a sqif detects rf signals up to 150 mhz it presents linear characteristics for rf power spanning more than five decades and nonlinearities develop beyond prf 35 dbm in our setup configuration secondharmonic generation has been shown to be minimum at the functioning point in the whole range of frequencies a model has been developed which captures the essential features of the sqif rf response | [['superconducting', 'quantum', 'interference', 'filters', 'sqif', 'are', 'promising', 'devices', 'for', 'radio', 'frequency', 'rf', 'detection', 'combining', 'low', 'noise', 'high', 'sensitivity', 'large', 'dynamic', 'range', 'and', 'wideband', 'capabilities', 'impressive', 'progress', 'have', 'been', 'made', 'recently', 'in', 'the', 'field', 'with', 'sqif', 'based', 'antennas', 'and', 'amplifiers', 'showing', 'interesting', 'properties', 'in', 'the', 'ghz', 'range', 'using', 'the', 'wellestablished', 'nbalox', 'technology', 'the', 'possibility', 'to', 'extend', 'these', 'results', 'to', 'high', 'temperature', 'superconductors', 'hts', 'is', 'still', 'open', 'and', 'different', 'techniques', 'to', 'fabricate', 'hts', 'sqifs', 'are', 'competing', 'to', 'make', 'rf', 'devices', 'we', 'report', 'on', 'the', 'dc', 'and', 'rf', 'response', 'of', 'a', 'high', 'temperature', 'sqif', 'fabricated', 'by', 'the', 'ion', 'irradiation', 'technique', 'it', 'is', 'made', 'of', '1000', 'superconducting', 'quantum', 'interference', 'devices', 'squids', 'in', 'series', 'with', 'loop', 'areas', 'randomly', 'distributed', 'between', '6', 'micron2', 'and', '60', 'micron2', 'the', 'dc', 'transfer', 'factor', 'is', 'around', '450', 'vt', 'at', 'optimal', 'bias', 'and', 'temperature', 'and', 'the', 'maximum', 'voltage', 'swing', 'around', '25', 'mv', 'we', 'show', 'that', 'such', 'a', 'sqif', 'detects', 'rf', 'signals', 'up', 'to', '150', 'mhz', 'it', 'presents', 'linear', 'characteristics', 'for', 'rf', 'power', 'spanning', 'more', 'than', 'five', 'decades', 'and', 'nonlinearities', 'develop', 'beyond', 'prf', '35', 'dbm', 'in', 'our', 'setup', 'configuration', 'secondharmonic', 'generation', 'has', 'been', 'shown', 'to', 'be', 'minimum', 'at', 'the', 'functioning', 'point', 'in', 'the', 'whole', 'range', 'of', 'frequencies', 'a', 'model', 'has', 'been', 'developed', 'which', 'captures', 'the', 'essential', 'features', 'of', 'the', 'sqif', 'rf', 'response']] | [-0.14740116836873005, 0.14244209226938276, 0.011399240006857584, -0.04305027994972266, -0.07125779366581345, -0.20709144045113093, 0.061901887961213244, 0.4469801120529103, -0.1986546792027554, -0.35762604285459343, 0.08771372320850125, -0.29955695049489656, -0.10322982645660425, 0.27657867695258387, -0.028648932067271874, 0.09521335647129521, -0.02080690648304254, -0.03489380396967175, -0.033514130299099894, -0.18417526336674217, 0.17806827949870235, 0.10775993753148858, 0.4024965341924801, 0.050577990081312765, 0.12800434652635712, -0.05309626688449933, 0.03919853887946287, 0.005491833922756238, -0.07930952420422131, 0.04807101816254218, 0.31934803917126187, 0.04027916983318065, 0.2641244289787201, -0.41663758863770717, -0.2573083744381006, 0.030132173146143484, 0.09334004930227228, 0.090207234450001, -0.045223654940951076, -0.22349961741179067, 0.14615354100108574, -0.1829017040333109, -0.08754967476229315, -0.03582680497639345, -0.0021191116541615157, 0.04779230214156317, -0.24567397875025085, 0.004649786668513237, 0.007989915688277074, 0.10229139639572664, 0.02106862843130508, -0.1518837725075238, 0.06812238265229968, 0.08162476302085012, -0.058916569858707, 0.024363311203686816, 0.17102537106730392, -0.09774893409523525, -0.11372423986124508, 0.2768079023228949, -0.05396780319898735, -0.07205410370921814, 0.1850978100658996, -0.1744952541954245, -0.08111636410467327, 0.1707204164565055, 0.15549751762167047, 0.04243425286317057, -0.18632889543515163, 0.03180787938161816, 0.08229391973100282, 0.20579701680105536, 0.12121339697996823, 0.08712245784499392, 0.23642979470487133, 0.2289713167710203, 0.054610318696999734, 0.15984033468758974, -0.17257394359010364, -0.006779009804940609, -0.18490454889739236, -0.08109762947897774, -0.16560910015398164, 0.04559271778403358, -0.04711997942747236, -0.1274311633463938, 0.4290341582131443, 0.19582566855760497, 0.13978998367418424, 0.008297598890126929, 0.34871281310470337, 0.10329743501792649, 0.1344740102234693, 0.06639156472962796, 0.26565570981045694, 0.18399606524458664, 0.16420251377925063, -0.20299853416300115, -0.007561288838626808, -0.08221881728704003] |
1,802.10311 | Fast Maximum Likelihood estimation via Equilibrium Expectation for Large
Network Data | A major line of contemporary research on complex networks is based on the
development of statistical models that specify the local motifs associated with
macro-structural properties observed in actual networks. This statistical
approach becomes increasingly problematic as network size increases. In the
context of current research on efficient estimation of models for large network
data sets, we propose a fast algorithm for maximum likelihood estimation (MLE)
that afords a signifcant increase in the size of networks amenable to direct
empirical analysis. The algorithm we propose in this paper relies on properties
of Markov chains at equilibrium, and for this reason it is called equilibrium
expectation (EE). We demonstrate the performance of the EE algorithm in the
context of exponential random graphmodels (ERGMs) a family of statistical
models commonly used in empirical research based on network data observed at a
single period in time. Thus far, the lack of efcient computational strategies
has limited the empirical scope of ERGMs to relatively small networks with a
few thousand nodes. The approach we propose allows a dramatic increase in the
size of networks that may be analyzed using ERGMs. This is illustrated in an
analysis of several biological networks and one social network with 104,103
nodes
| stat.ME stat.ML | a major line of contemporary research on complex networks is based on the development of statistical models that specify the local motifs associated with macrostructural properties observed in actual networks this statistical approach becomes increasingly problematic as network size increases in the context of current research on efficient estimation of models for large network data sets we propose a fast algorithm for maximum likelihood estimation mle that afords a signifcant increase in the size of networks amenable to direct empirical analysis the algorithm we propose in this paper relies on properties of markov chains at equilibrium and for this reason it is called equilibrium expectation ee we demonstrate the performance of the ee algorithm in the context of exponential random graphmodels ergms a family of statistical models commonly used in empirical research based on network data observed at a single period in time thus far the lack of efcient computational strategies has limited the empirical scope of ergms to relatively small networks with a few thousand nodes the approach we propose allows a dramatic increase in the size of networks that may be analyzed using ergms this is illustrated in an analysis of several biological networks and one social network with 104103 nodes | [['a', 'major', 'line', 'of', 'contemporary', 'research', 'on', 'complex', 'networks', 'is', 'based', 'on', 'the', 'development', 'of', 'statistical', 'models', 'that', 'specify', 'the', 'local', 'motifs', 'associated', 'with', 'macrostructural', 'properties', 'observed', 'in', 'actual', 'networks', 'this', 'statistical', 'approach', 'becomes', 'increasingly', 'problematic', 'as', 'network', 'size', 'increases', 'in', 'the', 'context', 'of', 'current', 'research', 'on', 'efficient', 'estimation', 'of', 'models', 'for', 'large', 'network', 'data', 'sets', 'we', 'propose', 'a', 'fast', 'algorithm', 'for', 'maximum', 'likelihood', 'estimation', 'mle', 'that', 'afords', 'a', 'signifcant', 'increase', 'in', 'the', 'size', 'of', 'networks', 'amenable', 'to', 'direct', 'empirical', 'analysis', 'the', 'algorithm', 'we', 'propose', 'in', 'this', 'paper', 'relies', 'on', 'properties', 'of', 'markov', 'chains', 'at', 'equilibrium', 'and', 'for', 'this', 'reason', 'it', 'is', 'called', 'equilibrium', 'expectation', 'ee', 'we', 'demonstrate', 'the', 'performance', 'of', 'the', 'ee', 'algorithm', 'in', 'the', 'context', 'of', 'exponential', 'random', 'graphmodels', 'ergms', 'a', 'family', 'of', 'statistical', 'models', 'commonly', 'used', 'in', 'empirical', 'research', 'based', 'on', 'network', 'data', 'observed', 'at', 'a', 'single', 'period', 'in', 'time', 'thus', 'far', 'the', 'lack', 'of', 'efcient', 'computational', 'strategies', 'has', 'limited', 'the', 'empirical', 'scope', 'of', 'ergms', 'to', 'relatively', 'small', 'networks', 'with', 'a', 'few', 'thousand', 'nodes', 'the', 'approach', 'we', 'propose', 'allows', 'a', 'dramatic', 'increase', 'in', 'the', 'size', 'of', 'networks', 'that', 'may', 'be', 'analyzed', 'using', 'ergms', 'this', 'is', 'illustrated', 'in', 'an', 'analysis', 'of', 'several', 'biological', 'networks', 'and', 'one', 'social', 'network', 'with', '104103', 'nodes']] | [-0.09851217019604519, 0.027944600393020665, -0.05713099688058719, 0.07617707193887327, -0.0513105908385478, -0.11656650813529268, 0.07594409029756206, 0.40949002619832753, -0.25035907413868697, -0.3135228638793342, 0.10688253351312596, -0.24732907418750982, -0.18654689327813684, 0.1993071058532223, -0.073934298066888, 0.09007382958196103, 0.10771792992483825, 0.04559070266317576, -0.03533166004228406, -0.23426334934309126, 0.28893903246033004, 0.09416320222895593, 0.34609628981444984, 0.034265394515823576, 0.081426321802428, -0.01425285137956962, -0.03266387275492889, 0.04730344801442698, -0.10537509867976041, 0.17948582943412475, 0.25762318909763054, 0.1953683092840947, 0.3561861957423389, -0.4284110589791089, -0.23931147093884647, 0.16004264131537638, 0.15720159655204044, 0.11088610959472135, -0.014040431629982777, -0.24513735185726546, 0.08906152630224824, -0.17510654359008185, -0.08101817186689005, -0.07728132562711836, 0.008713564202189446, 0.025010966025292874, -0.2599193742359057, 0.06523350073723122, 0.02853185664440389, 0.08709104069275782, 4.607401526300237e-05, -0.11926359281176702, 0.02493494572117925, 0.0896977623202838, 0.05220642262254842, -0.007506920537271072, 0.12887257629889062, -0.11780138968024403, -0.14224787986837328, 0.3429114062860026, -0.04945703080389649, -0.16482101504807362, 0.1876366483932361, -0.07971582038444466, -0.20610831652375056, 0.11220073379110546, 0.2514748640891048, 0.10737743533682079, -0.16504686274100094, 0.059314423280884515, -0.03640694986563176, 0.17107107213756534, -0.027856931649148466, 0.0177019151346758, 0.1826234775420744, 0.2738006771611981, 0.06770838096854277, 0.14465495079930407, -0.10087142662989208, -0.11725320010096767, -0.22919726593187079, -0.10991545279626734, -0.2123177575552836, 0.016221228459617123, -0.12586229752429062, -0.19224356146994978, 0.40343953399918975, 0.19265606043918523, 0.21694126755930485, 0.09495527221006342, 0.30952214223798363, 0.08118363602348837, 0.08475658524061146, 0.0900469146303294, 0.20701202196534724, 0.09287024734541774, 0.12218763338285499, -0.16922146038617938, 0.1424751585465856, 0.0035883376537822185] |
1,802.10312 | Conditions where RPA becomes exact in the high-density limit | It is shown that in $d$-dimensional systems, the vertex corrections beyond
the random phase approximation (RPA) or GW approximation scales with the power
$d-\beta-\alpha$ of the Fermi momentum if the relation between Fermi energy and
Fermi momentum is $\epsilon_{\rm f}\sim p_{\rm f}^\beta$ and the interacting
potential possesses a momentum-power-law of $\sim p^{-\alpha}$. The condition
$d-\beta-\alpha<0$ specifies systems where RPA is exact in the high-density
limit. The one-dimensional structure factor is found to be the interaction-free
one in the high-density limit for contact interaction. A cancellation of RPA
and vertex corrections render this result valid up to second-order in contact
interaction. For finite-range potentials of cylindrical wires a large-scale
cancellation appears and found to be independent of the width parameter of the
wire. The proposed high-density expansion agrees with the Quantum Monte Carlo
simulations.
| cond-mat.str-el cond-mat.mes-hall physics.atm-clus quant-ph | it is shown that in ddimensional systems the vertex corrections beyond the random phase approximation rpa or gw approximation scales with the power dbetaalpha of the fermi momentum if the relation between fermi energy and fermi momentum is epsilon_rm fsim p_rm fbeta and the interacting potential possesses a momentumpowerlaw of sim palpha the condition dbetaalpha0 specifies systems where rpa is exact in the highdensity limit the onedimensional structure factor is found to be the interactionfree one in the highdensity limit for contact interaction a cancellation of rpa and vertex corrections render this result valid up to secondorder in contact interaction for finiterange potentials of cylindrical wires a largescale cancellation appears and found to be independent of the width parameter of the wire the proposed highdensity expansion agrees with the quantum monte carlo simulations | [['it', 'is', 'shown', 'that', 'in', 'ddimensional', 'systems', 'the', 'vertex', 'corrections', 'beyond', 'the', 'random', 'phase', 'approximation', 'rpa', 'or', 'gw', 'approximation', 'scales', 'with', 'the', 'power', 'dbetaalpha', 'of', 'the', 'fermi', 'momentum', 'if', 'the', 'relation', 'between', 'fermi', 'energy', 'and', 'fermi', 'momentum', 'is', 'epsilon_rm', 'fsim', 'p_rm', 'fbeta', 'and', 'the', 'interacting', 'potential', 'possesses', 'a', 'momentumpowerlaw', 'of', 'sim', 'palpha', 'the', 'condition', 'dbetaalpha0', 'specifies', 'systems', 'where', 'rpa', 'is', 'exact', 'in', 'the', 'highdensity', 'limit', 'the', 'onedimensional', 'structure', 'factor', 'is', 'found', 'to', 'be', 'the', 'interactionfree', 'one', 'in', 'the', 'highdensity', 'limit', 'for', 'contact', 'interaction', 'a', 'cancellation', 'of', 'rpa', 'and', 'vertex', 'corrections', 'render', 'this', 'result', 'valid', 'up', 'to', 'secondorder', 'in', 'contact', 'interaction', 'for', 'finiterange', 'potentials', 'of', 'cylindrical', 'wires', 'a', 'largescale', 'cancellation', 'appears', 'and', 'found', 'to', 'be', 'independent', 'of', 'the', 'width', 'parameter', 'of', 'the', 'wire', 'the', 'proposed', 'highdensity', 'expansion', 'agrees', 'with', 'the', 'quantum', 'monte', 'carlo', 'simulations']] | [-0.1783519227675592, 0.16507517448626458, -0.08361950437538326, 0.08204928885769243, 0.0044910022236693365, -0.1473866701949961, 0.03812584224909257, 0.33118853797921194, -0.23945851169096735, -0.2579235503879877, -0.029791482545148868, -0.3258953085397549, -0.07572126283059613, 0.14336766371897494, 0.06385371884187827, 0.042116150310119754, 0.037873461416277746, 0.038337251278929986, -0.12948587901281336, -0.18532284387709716, 0.2869423819383463, 0.08640969970818753, 0.24034460217047196, 0.09564165206482778, 0.06650123634742788, 0.023264581833679517, 0.0499746781344024, 0.04171273068596537, -0.12878573807163496, -0.008435259476447335, 0.22299272941801554, -0.05110298191122218, 0.21112622411455959, -0.38821645946456834, -0.2033397596472731, 0.060474031303937616, 0.1437758303193662, 0.10191438040839365, 0.00276823160596765, -0.2737073231783982, 0.03130877260835125, -0.23018236540687773, -0.18898228193418337, -0.05283427372756146, 0.02290726477804128, 0.054417822130310996, -0.28955522951750584, 0.13521752833173825, 0.04405225100210653, -0.03714394240568464, -0.01355363498083674, -0.08526177362968715, -0.004584620380774141, 0.06330952580140617, 0.02038455960349753, 0.10094406961535032, 0.12195846805205712, -0.15919391801222585, -0.05005663559915355, 0.4241183671025703, -0.046267191814975094, -0.16679730450447935, 0.15137937781400979, -0.18529328228861022, -0.09841517088934779, 0.18634470080097135, 0.09915917892582142, 0.0558735436347958, -0.14414687330807702, 0.17166461534260843, 0.024857856863393233, 0.15848890971907306, 0.04477179045430743, 0.026214294905702654, 0.17556232016963455, 0.163197871709529, 0.06129356290643605, 0.10871978487210492, -0.13247716961643444, -0.15679796897949508, -0.3269068082436346, -0.11660422649136028, -0.233262248401745, 0.05247635308366556, -0.1282969748274459, -0.2048983824060997, 0.33524429408403544, 0.12937530722612373, 0.1772683021540825, 0.05003797605884476, 0.2905117814787305, 0.18092461816894895, 0.087543020508467, 0.10628846559601908, 0.2716187225455472, 0.1860863662324846, 0.050953589438107044, -0.251820600251309, 0.025412731445752658, 0.07424299525670135] |
1,802.10313 | Polarization effects due to dark matter interaction between massive
standard particles | We propose deeper tests of the existence of DM interactions between heavy
particles in $e^+e^-\to t\bar t, ZZ, W^+W^-$ by looking at the effects on final
state polarization. We show that indeed $t$, $W$ and $Z$ polarization are
particularly sensitive to the structure of these interactions, to their
relation with the origin of the masses and to the quantum numbers of the
possibly exchanged dark particles.
| hep-ph | we propose deeper tests of the existence of dm interactions between heavy particles in eeto tbar t zz ww by looking at the effects on final state polarization we show that indeed t w and z polarization are particularly sensitive to the structure of these interactions to their relation with the origin of the masses and to the quantum numbers of the possibly exchanged dark particles | [['we', 'propose', 'deeper', 'tests', 'of', 'the', 'existence', 'of', 'dm', 'interactions', 'between', 'heavy', 'particles', 'in', 'eeto', 'tbar', 't', 'zz', 'ww', 'by', 'looking', 'at', 'the', 'effects', 'on', 'final', 'state', 'polarization', 'we', 'show', 'that', 'indeed', 't', 'w', 'and', 'z', 'polarization', 'are', 'particularly', 'sensitive', 'to', 'the', 'structure', 'of', 'these', 'interactions', 'to', 'their', 'relation', 'with', 'the', 'origin', 'of', 'the', 'masses', 'and', 'to', 'the', 'quantum', 'numbers', 'of', 'the', 'possibly', 'exchanged', 'dark', 'particles']] | [-0.13591386839239436, 0.27008076944162673, -0.07893147840425654, 0.11122338044824022, -0.047014149759585656, -0.12357749890140964, 0.068871722457874, 0.3358793586887645, -0.27298610780218785, -0.3147467080447258, -0.036629488213679215, -0.321132408659623, -0.01926613398686503, 0.12957313580607827, 0.10407607652472728, 0.023265356028621845, 0.05457119471534635, 0.011410784166814252, -0.03243603942929908, -0.2692515730935459, 0.31633906598400435, 0.04593250215244056, 0.16451133358659167, 0.07970064314025821, 0.04747594121109807, 0.06389961599823878, -0.03456584406508641, -0.0664141836265723, -0.1274433060392436, 0.06732023257592862, 0.18591047569432043, 0.05076046705697522, 0.14110712673881967, -0.35215407463185716, -0.09867708836541031, 0.1638694665761608, 0.12201329466717487, 0.07286849109611164, -0.06540373355241944, -0.3284880598781235, 0.11545155928329084, -0.12923193991071347, -0.09317500276180606, -0.050452569400835215, 0.020819342610510914, -0.027260569770905105, -0.2724633339455591, 0.11718491080329951, 0.03596788408785043, -0.01761503317252253, 0.00433796872455401, -0.15225029351528396, -0.12474335521586578, 0.0740632147274234, 0.10180051122425181, 0.004171178259915023, 0.15887368269349364, -0.20270828310767133, -0.1523718699022676, 0.38545945903399226, -0.09896605461924055, -0.17997116087512535, 0.2545451923753276, -0.23798687868243593, -0.1384456445336003, 0.10217976657617273, 0.22871076872141918, 0.08710756934614795, -0.14884055094796966, 0.1184785907901118, 0.03606973044842369, 0.1318552800256646, 0.04946999615552186, 0.11039100665331, 0.2730555088739052, 0.13702795663001863, -0.007383853916756131, 0.07478783158303211, -0.13207063959050697, -0.034985873495426145, -0.3862336358676354, -0.1668173331012385, -0.09641668048800167, 0.07454308789138767, -0.06415953662971416, -0.08613057517813462, 0.3343316211195832, 0.1493583684363826, 0.2882447710514746, 0.006397941874721172, 0.2614719651808793, 0.06221735296827374, 0.04686109024227004, 0.0613680255853317, 0.29689560508863494, 0.1997121110890117, 0.10618150855809676, -0.25976594921314355, 0.06500436149001347, 0.006058693454233986] |
1,802.10314 | Almost diagonalization of $\tau$-pseudodifferential operators with
symbols in Wiener amalgam and modulation spaces | In this paper we focus on the almost-diagonalization properties of
$\tau$-pseudodifferential operators using techniques from time-frequency
analysis. Our function spaces are modulation spaces and the special class of
Wiener amalgam spaces arising by considering the action of the Fourier
transform of modulation spaces. A particular example is provided by the
Sj\"ostrand class, for which Gr\"ochenig exhibited the almost diagonalization
of Weyl operators. We shall show that such result can be extended to any
$\tau$-pseudodifferential operator, for $\tau \in [0,1]$, also with symbol in
weighted Wiener amalgam spaces. As a consequence, we infer boundedness, algebra
and Wiener properties for $\tau$-pseudodifferential operators on Wiener amalgam
and modulation spaces.
| math.FA | in this paper we focus on the almostdiagonalization properties of taupseudodifferential operators using techniques from timefrequency analysis our function spaces are modulation spaces and the special class of wiener amalgam spaces arising by considering the action of the fourier transform of modulation spaces a particular example is provided by the sjostrand class for which grochenig exhibited the almost diagonalization of weyl operators we shall show that such result can be extended to any taupseudodifferential operator for tau in 01 also with symbol in weighted wiener amalgam spaces as a consequence we infer boundedness algebra and wiener properties for taupseudodifferential operators on wiener amalgam and modulation spaces | [['in', 'this', 'paper', 'we', 'focus', 'on', 'the', 'almostdiagonalization', 'properties', 'of', 'taupseudodifferential', 'operators', 'using', 'techniques', 'from', 'timefrequency', 'analysis', 'our', 'function', 'spaces', 'are', 'modulation', 'spaces', 'and', 'the', 'special', 'class', 'of', 'wiener', 'amalgam', 'spaces', 'arising', 'by', 'considering', 'the', 'action', 'of', 'the', 'fourier', 'transform', 'of', 'modulation', 'spaces', 'a', 'particular', 'example', 'is', 'provided', 'by', 'the', 'sjostrand', 'class', 'for', 'which', 'grochenig', 'exhibited', 'the', 'almost', 'diagonalization', 'of', 'weyl', 'operators', 'we', 'shall', 'show', 'that', 'such', 'result', 'can', 'be', 'extended', 'to', 'any', 'taupseudodifferential', 'operator', 'for', 'tau', 'in', '01', 'also', 'with', 'symbol', 'in', 'weighted', 'wiener', 'amalgam', 'spaces', 'as', 'a', 'consequence', 'we', 'infer', 'boundedness', 'algebra', 'and', 'wiener', 'properties', 'for', 'taupseudodifferential', 'operators', 'on', 'wiener', 'amalgam', 'and', 'modulation', 'spaces']] | [-0.09237755096207062, 0.1250568919859472, -0.08162915683129714, 0.12741182774660134, -0.11089025519211732, -0.04295049738804144, 0.011002063495106995, 0.40212929898074695, -0.34431197283168635, -0.19052815821376584, 0.19785009990778885, -0.2439781947349686, -0.23711796211344854, 0.2448056782507116, -0.1343560622650243, 0.031059505142981097, 0.03443098067350331, 0.05080757886559392, -0.14432459452100807, -0.22439119836226815, 0.4415781723690175, -0.017606706775370098, 0.19255022736532348, -0.017594700590485617, 0.07351817551202007, 0.0661221617655385, -0.09816227439524872, -0.05001600735510389, -0.12946554836408247, 0.11923105393403342, 0.26950390768858296, 0.0554817147419921, 0.2375518257932743, -0.32270189294414153, -0.22211373401362272, 0.17097474263670545, 0.14380972784988227, -0.0564959107022289, -0.044959802493186936, -0.3570754372115646, 0.07726980982614415, -0.15143162870690935, -0.08995951730314465, -0.09266231249618744, 0.013193488626607826, 0.06277834871517761, -0.34294697635230564, 0.038465077709129436, 0.12310679875136842, 0.07035965608166797, -0.1408800490544222, -0.09748261135869793, -0.00931430195369536, 0.06806541518086479, -0.034789340479654214, 0.02075530733647091, 0.05820257104046288, -0.004788985327329664, -0.1652677310741551, 0.3370509883122785, -0.10936384156701111, -0.27111012699703374, 0.11327620193007447, -0.17980759399499566, -0.15747816172827567, 0.03808926188364802, 0.1320383272142083, 0.11776766265698133, -0.09065833905090888, 0.17210231729217673, -0.0458148373202199, 0.09839986523702031, 0.11403886121919467, 0.14480017667991066, 0.03018722419760057, 0.10527028766283322, 0.14986614891815753, 0.16794474780271273, -0.04136423027320277, -0.037439017127534106, -0.32423215157662827, -0.17517610032532718, -0.1843741353202079, 0.053364768891506605, -0.12237331463603325, -0.19639941462359967, 0.3752639855746002, 0.09181009508403284, 0.12915071949717544, 0.087269765778356, 0.1860594897087486, 0.16539415458572052, 0.03788901964379918, 0.02661360123948682, 0.13711628170927898, 0.19897763879659275, 0.10652705712155217, -0.11407322107614683, -0.02776535243416826, 0.23935707733922063] |
1,802.10315 | Configurations of flags in orbits of real forms | In this paper we start the study of configurations of flags in closed orbits
of real forms using mainly tools of GIT. As an application, using cross ratio
coordinates for generic configurations, we identify boundary unipotent
representations of the fundamental group of the figure eight knot complement
into real forms of $\mathrm{PGL}(4,\mathbb{C})$.
| math.AG math.RT | in this paper we start the study of configurations of flags in closed orbits of real forms using mainly tools of git as an application using cross ratio coordinates for generic configurations we identify boundary unipotent representations of the fundamental group of the figure eight knot complement into real forms of mathrmpgl4mathbbc | [['in', 'this', 'paper', 'we', 'start', 'the', 'study', 'of', 'configurations', 'of', 'flags', 'in', 'closed', 'orbits', 'of', 'real', 'forms', 'using', 'mainly', 'tools', 'of', 'git', 'as', 'an', 'application', 'using', 'cross', 'ratio', 'coordinates', 'for', 'generic', 'configurations', 'we', 'identify', 'boundary', 'unipotent', 'representations', 'of', 'the', 'fundamental', 'group', 'of', 'the', 'figure', 'eight', 'knot', 'complement', 'into', 'real', 'forms', 'of', 'mathrmpgl4mathbbc']] | [-0.225524468730916, 0.013835500663559536, -0.09784303352638495, -0.003620235626037945, -0.04472258738150783, -0.042632563514452354, 0.021525374972078876, 0.30397050537388115, -0.27710882373446344, -0.2427700447996019, 0.1125205741994375, -0.23781007648829153, -0.18921445100111703, 0.2462114647724757, -0.0835679736828395, -0.006332395422528041, 0.08069010444588083, 0.07167050797793575, -0.10662599569917017, -0.25901619326688496, 0.454792846870773, -0.030807922795122743, 0.2200275801633503, 0.0014951263974402466, 0.07051039940001917, 0.03550182061050745, -0.04546498310040025, -0.016272970530040124, -0.1460761751468275, 0.1645773896381405, 0.27361105750406195, 0.12709663814737224, 0.13792782973078097, -0.40619123062374546, -0.09972567787832197, 0.12347004301480803, 0.1879483114051468, 0.02163340490055727, -0.007666645042013889, -0.2779415677867684, 0.0655567613247709, -0.18149222400696838, -0.19000596735699504, -0.08166967781589311, 0.03952169789037868, 0.023986146178133057, -0.17593218568785518, -0.045627558823017514, 0.006185913549772664, 0.17787853372739812, -0.12172877269924856, -0.12915683585200824, -0.016828515767758966, 0.17435423958608331, 0.03603724363789547, -0.02757349381606807, 0.13022168552247332, -0.13103570416113178, -0.13755161647557043, 0.42678767493834685, -0.061826303473436366, -0.2553862968879734, 0.16960036692519984, -0.13061378790321304, -0.1866550380592326, 0.1395884764691194, 0.21500677388964914, 0.142312409319714, -0.09571926777853686, 0.1248965778150687, -0.08982491794307076, 0.09015115098251651, 0.12185025607765305, -0.05134680275531376, 0.1940942422222054, 0.12822490172716333, 0.04370857748732555, 0.1880621708856494, -0.05625127500160506, -0.049715789582799465, -0.3439882464487763, -0.2333040801333446, -0.08877406890421886, 0.07198451937851953, -0.09967715239298403, -0.18600318781739356, 0.44128914557251275, 0.08412968390164714, 0.22296082126159295, 0.021770295376578968, 0.27685874525238485, 0.050309839108319696, 0.04320068047473244, 0.03324531736400198, 0.15435219103214787, 0.15272380617976772, -0.054969599488757404, -0.13076683016968707, -0.05012260391102994, 0.1154854658479784] |
1,802.10316 | A Model for Medical Diagnosis Based on Plantar Pressure | The process of determining which disease or condition explains a person's
symptoms and signs can be very complicated and may be inaccurate in some cases.
The general belief is that diagnosing diseases relies on doctors' keen
intuition, rich experience and professional equipment. In this work, we employ
ideas from recent advances in plantar pressure research and from the powerful
capacity of the convolutional neural network for learning representations.
Here, we propose a model using convolutional neural network based on plantar
pressure for medical diagnosis. Our model learns a network that maps plantar
pressure data to its corresponding medical diagnostic label. We then apply our
model to make the medical diagnosis on datasets we collected from cooperative
hospital and achieve an accuracy of 98.36%. We demonstrate that the model base
on the convolutional neural network is competitive in medical diagnosis.
| cs.CV | the process of determining which disease or condition explains a persons symptoms and signs can be very complicated and may be inaccurate in some cases the general belief is that diagnosing diseases relies on doctors keen intuition rich experience and professional equipment in this work we employ ideas from recent advances in plantar pressure research and from the powerful capacity of the convolutional neural network for learning representations here we propose a model using convolutional neural network based on plantar pressure for medical diagnosis our model learns a network that maps plantar pressure data to its corresponding medical diagnostic label we then apply our model to make the medical diagnosis on datasets we collected from cooperative hospital and achieve an accuracy of 9836 we demonstrate that the model base on the convolutional neural network is competitive in medical diagnosis | [['the', 'process', 'of', 'determining', 'which', 'disease', 'or', 'condition', 'explains', 'a', 'persons', 'symptoms', 'and', 'signs', 'can', 'be', 'very', 'complicated', 'and', 'may', 'be', 'inaccurate', 'in', 'some', 'cases', 'the', 'general', 'belief', 'is', 'that', 'diagnosing', 'diseases', 'relies', 'on', 'doctors', 'keen', 'intuition', 'rich', 'experience', 'and', 'professional', 'equipment', 'in', 'this', 'work', 'we', 'employ', 'ideas', 'from', 'recent', 'advances', 'in', 'plantar', 'pressure', 'research', 'and', 'from', 'the', 'powerful', 'capacity', 'of', 'the', 'convolutional', 'neural', 'network', 'for', 'learning', 'representations', 'here', 'we', 'propose', 'a', 'model', 'using', 'convolutional', 'neural', 'network', 'based', 'on', 'plantar', 'pressure', 'for', 'medical', 'diagnosis', 'our', 'model', 'learns', 'a', 'network', 'that', 'maps', 'plantar', 'pressure', 'data', 'to', 'its', 'corresponding', 'medical', 'diagnostic', 'label', 'we', 'then', 'apply', 'our', 'model', 'to', 'make', 'the', 'medical', 'diagnosis', 'on', 'datasets', 'we', 'collected', 'from', 'cooperative', 'hospital', 'and', 'achieve', 'an', 'accuracy', 'of', '9836', 'we', 'demonstrate', 'that', 'the', 'model', 'base', 'on', 'the', 'convolutional', 'neural', 'network', 'is', 'competitive', 'in', 'medical', 'diagnosis']] | [-0.02063870157344618, 0.015474337686390609, -0.079670656892552, 0.05152455300893949, -0.1416259736052134, -0.19466162138901974, 0.059933812701669725, 0.436350603574428, -0.2354489841795378, -0.26904836897333356, 0.08249629976605807, -0.2813969622231156, -0.2678151365075989, 0.2149190524292678, -0.1869134256089835, 0.042501677613472566, 0.15458877434705925, 0.08786898619913752, -0.0024734428203057337, -0.2685041622489866, 0.31723856604725553, 0.06717116681292006, 0.37069801705302263, 0.08150086236064849, 0.10932402284157908, -0.030962288801463834, -0.014407507334565878, -0.02714576244267411, -0.06949714060860772, 0.17179004002389484, 0.3498106607273086, 0.24849990557919702, 0.35399161324249173, -0.4959577110900115, -0.2785944342950656, 0.07367411201846773, 0.1000374909085424, 0.12282820839944812, -0.013584562708907153, -0.34221160476622375, 0.06546460071146704, -0.18367776304375436, -0.017578398995691965, -0.122731348351184, -0.06013587187381758, -0.030749756906964423, -0.3230965867886603, 0.0682239130044869, 0.01631643751339204, 0.13243310355945773, -0.08779558818871695, -0.09993182690189881, 0.014215336732930788, 0.18626237974967808, 0.018734308406567216, 0.08192099883909458, 0.16966021579919735, -0.23168361631552756, -0.11289322743381279, 0.309818545395198, 0.007455578593510217, -0.16939689168720035, 0.2100661185020041, -0.024758446091057165, -0.16420989730935273, 0.053424777945611575, 0.2845962638899252, 0.0970119412758968, -0.18245114710694854, -0.04160646875127408, -0.021203233509499958, 0.16632868641012255, 0.041280553240474124, -0.061234720298882064, 0.1756214166132428, 0.26277608179446793, -0.02121826425360084, 0.11649054769878749, -0.14868171565383131, -0.02420467052919169, -0.19450239535839553, -0.11155859913434023, -0.14908332965147775, 0.022847852175312953, -0.09155737681842015, -0.1484053027006271, 0.40034995410267427, 0.26467053211213765, 0.15929582121147626, 0.06255184296278984, 0.3357230101701925, 0.0031197269032101917, 0.12012073418304352, 0.071937071112241, 0.16894486757013036, 0.04499809564014499, 0.15390901752761094, -0.15694051522565872, 0.1523002790180845, 0.036686620853446504] |
1,802.10317 | Simulation Studies on Generation, Handling and Transport of
laser-accelerated Carbon Ions | To this day the interaction of high-intensity lasers with matter is
considered to be a possible candidate for next generation particle
accelerators. Within the LIGHT collaboration crucial work for the merging of a
high-intensity laser driven ion source with conventional accelerator technology
has been done in the past years. The simulation studies we report about are an
important step in providing short and intense mid-Z heavy ion beams for future
applications.
| physics.acc-ph physics.plasm-ph | to this day the interaction of highintensity lasers with matter is considered to be a possible candidate for next generation particle accelerators within the light collaboration crucial work for the merging of a highintensity laser driven ion source with conventional accelerator technology has been done in the past years the simulation studies we report about are an important step in providing short and intense midz heavy ion beams for future applications | [['to', 'this', 'day', 'the', 'interaction', 'of', 'highintensity', 'lasers', 'with', 'matter', 'is', 'considered', 'to', 'be', 'a', 'possible', 'candidate', 'for', 'next', 'generation', 'particle', 'accelerators', 'within', 'the', 'light', 'collaboration', 'crucial', 'work', 'for', 'the', 'merging', 'of', 'a', 'highintensity', 'laser', 'driven', 'ion', 'source', 'with', 'conventional', 'accelerator', 'technology', 'has', 'been', 'done', 'in', 'the', 'past', 'years', 'the', 'simulation', 'studies', 'we', 'report', 'about', 'are', 'an', 'important', 'step', 'in', 'providing', 'short', 'and', 'intense', 'midz', 'heavy', 'ion', 'beams', 'for', 'future', 'applications']] | [-0.0975821211894738, 0.2126404809829874, -0.048111670053708304, 0.04510199353689144, -0.026294711754250695, -0.1597542910718582, -0.033934344145679245, 0.46454498171806335, -0.21877324192548617, -0.3163200672781488, 0.08019318328317727, -0.28978228409000684, 0.009388911980532214, 0.30117396782906597, 0.02548998799896471, 0.10738159290475535, 0.09524194295452514, -0.013497410027284018, 0.01037680426478045, -0.21537912368092318, 0.2382162774808075, 0.20963785020162312, 0.2652330953942638, 0.09723838555141234, 0.09995738852401855, 0.013182532324285155, -0.050901213162381886, -0.08566669103177921, -0.054284683467646484, 0.13215306405187913, 0.2856300644401107, 0.08744676669889039, 0.3209125635174798, -0.4912440803321734, -0.2766588550506973, 0.09272163719411047, 0.14760664397929335, 0.14540370355661905, -0.21758873256999003, -0.2640274057007382, 0.038731975607987176, -0.20055683113267303, -0.17723163944328021, 0.01468920398300225, 0.05425514828439959, 0.06462202426439649, -0.2659159844919947, -0.018825353936515223, -0.013299644964051918, 0.049263989283952495, -0.013076483573712093, -0.09015736452133304, 0.0891559250705259, 0.06844366521535206, 0.06771385602482503, 0.10626271325753818, 0.14239945440326857, -0.15326674089071826, -0.1405788051123521, 0.40320935543679015, -0.03644113538419487, -0.04971524910397933, 0.18113355079918286, -0.1584369768847672, -0.1445732276073434, 0.10821171653207759, 0.2124840265769564, 0.11528277793295787, -0.1739239368036809, 0.0019148341699791942, 0.01767841052316444, 0.15879566826364502, 0.09270470105046012, 0.07292790403983122, 0.3207399630263238, 0.32836256157869187, 0.016822465570827186, 0.08167884717113338, -0.11223332483885469, -0.056024986989041924, -0.28414180624285634, -0.13016800163969608, -0.11192615387279173, 0.019060398102020617, 0.06948392645273076, -0.04698599813978227, 0.4096806415055, 0.1639024733965823, 0.07680451377413013, -0.13165945471854698, 0.32587424975255846, 0.09938502051329738, 0.08847831353597657, 0.009195511875359315, 0.29540795966668026, 0.10103235910581031, 0.1565879055259513, -0.15488166477806656, 0.031460626250867485, -0.01889011830839158] |
1,802.10318 | Resonant magneto-acoustic switching: influence of Rayleigh wave
frequency and wavevector | We show on in-plane magnetized thin films that magnetization can be switched
efficiently by 180 degrees using large amplitude Rayleigh waves travelling
along the hard or easy magnetic axis. Large characteristic filament-like
domains are formed in the latter case. Micromagnetic simulations clearly
confirm that this multi-domain configuration is compatible with a resonant
precessional mechanism. The reversed domains are in both geometries several
hundreds of \mu m^2, much larger than has been shown using spin transfer
torque- or field-driven precessional switching. We show that surface acoustic
waves can travel at least 1mm before addressing a given area, and can interfere
to create magnetic stripes that can be positionned with a sub-micronic
precision.
| cond-mat.mtrl-sci | we show on inplane magnetized thin films that magnetization can be switched efficiently by 180 degrees using large amplitude rayleigh waves travelling along the hard or easy magnetic axis large characteristic filamentlike domains are formed in the latter case micromagnetic simulations clearly confirm that this multidomain configuration is compatible with a resonant precessional mechanism the reversed domains are in both geometries several hundreds of mu m2 much larger than has been shown using spin transfer torque or fielddriven precessional switching we show that surface acoustic waves can travel at least 1mm before addressing a given area and can interfere to create magnetic stripes that can be positionned with a submicronic precision | [['we', 'show', 'on', 'inplane', 'magnetized', 'thin', 'films', 'that', 'magnetization', 'can', 'be', 'switched', 'efficiently', 'by', '180', 'degrees', 'using', 'large', 'amplitude', 'rayleigh', 'waves', 'travelling', 'along', 'the', 'hard', 'or', 'easy', 'magnetic', 'axis', 'large', 'characteristic', 'filamentlike', 'domains', 'are', 'formed', 'in', 'the', 'latter', 'case', 'micromagnetic', 'simulations', 'clearly', 'confirm', 'that', 'this', 'multidomain', 'configuration', 'is', 'compatible', 'with', 'a', 'resonant', 'precessional', 'mechanism', 'the', 'reversed', 'domains', 'are', 'in', 'both', 'geometries', 'several', 'hundreds', 'of', 'mu', 'm2', 'much', 'larger', 'than', 'has', 'been', 'shown', 'using', 'spin', 'transfer', 'torque', 'or', 'fielddriven', 'precessional', 'switching', 'we', 'show', 'that', 'surface', 'acoustic', 'waves', 'can', 'travel', 'at', 'least', '1mm', 'before', 'addressing', 'a', 'given', 'area', 'and', 'can', 'interfere', 'to', 'create', 'magnetic', 'stripes', 'that', 'can', 'be', 'positionned', 'with', 'a', 'submicronic', 'precision']] | [-0.22552472278581592, 0.24195187979441304, -0.025337400096891956, 0.03150268934497779, -0.1271696779114956, -0.13316940762398935, -0.03307605361862277, 0.48562191067771476, -0.2794859652365135, -0.3012145652351054, 0.09565294039732014, -0.2458407631059262, -0.08423501911615446, 0.26673495399935004, 0.0342897486618974, -0.010470037534832954, 0.05433462003499947, -0.05580230748111552, -0.03472021506379613, -0.14992627197220412, 0.2252900727008554, -0.022311359538104047, 0.2910650033461438, 0.03438966295004568, 0.04757765570380302, -0.04056300529786809, 0.11298037991774353, 0.08846092391547493, -0.10961633508056613, 0.011651960696855729, 0.2332438909427517, -0.043632307218980385, 0.1850067233031785, -0.504488167981088, -0.235957638051001, 0.03908751740713011, 0.2181002036245032, 0.156449049139734, -0.02548712324880233, -0.2551625505237925, 0.12006026388315315, -0.10777599340812727, -0.14853346951051868, -0.08346595315008679, 0.011876908998767083, 0.04325564397096803, -0.24649683407306755, 0.0654690777755935, 0.0642087406923317, 0.0504312344342576, -0.05935301057655703, -0.09899221420161088, -0.08497482895089144, 0.03784246225523847, 0.07405742361760613, 0.1052361066410826, 0.16405241528356618, -0.06259833011056551, -0.13378135763447394, 0.3087656846598045, -0.06414518809033325, -0.18731735418339007, 0.18842475331727077, -0.22630885766861453, -0.023105003511194478, 0.20916835841807452, 0.16655738880349832, 0.1569780570285564, -0.10541512395085936, 0.012736069297269833, -0.004514599320563403, 0.2315252045677467, 0.1604775925717232, -0.025071812387217174, 0.30663694644516165, 0.17442716805327854, 0.04893612598323009, 0.15148497794289142, -0.1585827578091994, -0.06396260836627335, -0.1971380680037493, -0.09369539557109502, -0.1811296768994494, 0.07649138672277331, -0.0815545823889393, -0.11369016926222354, 0.3582000233232975, 0.12559024942615493, 0.1695966534528204, -0.018092133181000298, 0.30073998043821615, 0.0879071662945948, 0.10271049519916149, 0.10025729568336497, 0.27527493363330985, 0.12975578038233587, 0.11989924913835817, -0.2326227133225819, 0.06240042044188489, -0.078156887114429] |
1,802.10319 | General-relativistic pulsar magnetospheric emission | Most current pulsar emission models assume photon production and emission
within the magnetosphere. Low frequency radiation is preferentially produced in
the vicinity of the polar caps whereas the high-energy tail is shifted to
regions closer but still inside the light-cylinder. We conducted a systematic
study of the merit of several popular radiation sites like the polar cap, the
outer gap and the slot gap. We computed sky maps emanating from each emission
site according to a prescribed distribution function for the emitting particles
made of an electron/positron mixture. Calculations are performed using a three
dimensional integration of the plasma emissivity in the vacuum electromagnetic
field of a rotating centred general-relativistic dipole. We compare Newtonian
electromagnetic fields to their general-relativistic counterpart. In the latter
case, light bending is also taken into account. As a typical example,
light-curves and sky maps are plotted for several power-law indices of the
particle distribution function. The detailed pulse profiles strongly depend on
the underlying assumption about the fluid motion subject to strong
electromagnetic fields. This electromagnetic topology enforces the photon
propagation direction directly, or indirectly, from aberration effects. We also
discuss the implication of a net stellar electric charge on to the sky maps.
Taking into account the electric field strongly affects the light-curves
originating close to the light-cylinder where the electric field strength
becomes comparable to the magnetic field strength.
| astro-ph.HE | most current pulsar emission models assume photon production and emission within the magnetosphere low frequency radiation is preferentially produced in the vicinity of the polar caps whereas the highenergy tail is shifted to regions closer but still inside the lightcylinder we conducted a systematic study of the merit of several popular radiation sites like the polar cap the outer gap and the slot gap we computed sky maps emanating from each emission site according to a prescribed distribution function for the emitting particles made of an electronpositron mixture calculations are performed using a three dimensional integration of the plasma emissivity in the vacuum electromagnetic field of a rotating centred generalrelativistic dipole we compare newtonian electromagnetic fields to their generalrelativistic counterpart in the latter case light bending is also taken into account as a typical example lightcurves and sky maps are plotted for several powerlaw indices of the particle distribution function the detailed pulse profiles strongly depend on the underlying assumption about the fluid motion subject to strong electromagnetic fields this electromagnetic topology enforces the photon propagation direction directly or indirectly from aberration effects we also discuss the implication of a net stellar electric charge on to the sky maps taking into account the electric field strongly affects the lightcurves originating close to the lightcylinder where the electric field strength becomes comparable to the magnetic field strength | [['most', 'current', 'pulsar', 'emission', 'models', 'assume', 'photon', 'production', 'and', 'emission', 'within', 'the', 'magnetosphere', 'low', 'frequency', 'radiation', 'is', 'preferentially', 'produced', 'in', 'the', 'vicinity', 'of', 'the', 'polar', 'caps', 'whereas', 'the', 'highenergy', 'tail', 'is', 'shifted', 'to', 'regions', 'closer', 'but', 'still', 'inside', 'the', 'lightcylinder', 'we', 'conducted', 'a', 'systematic', 'study', 'of', 'the', 'merit', 'of', 'several', 'popular', 'radiation', 'sites', 'like', 'the', 'polar', 'cap', 'the', 'outer', 'gap', 'and', 'the', 'slot', 'gap', 'we', 'computed', 'sky', 'maps', 'emanating', 'from', 'each', 'emission', 'site', 'according', 'to', 'a', 'prescribed', 'distribution', 'function', 'for', 'the', 'emitting', 'particles', 'made', 'of', 'an', 'electronpositron', 'mixture', 'calculations', 'are', 'performed', 'using', 'a', 'three', 'dimensional', 'integration', 'of', 'the', 'plasma', 'emissivity', 'in', 'the', 'vacuum', 'electromagnetic', 'field', 'of', 'a', 'rotating', 'centred', 'generalrelativistic', 'dipole', 'we', 'compare', 'newtonian', 'electromagnetic', 'fields', 'to', 'their', 'generalrelativistic', 'counterpart', 'in', 'the', 'latter', 'case', 'light', 'bending', 'is', 'also', 'taken', 'into', 'account', 'as', 'a', 'typical', 'example', 'lightcurves', 'and', 'sky', 'maps', 'are', 'plotted', 'for', 'several', 'powerlaw', 'indices', 'of', 'the', 'particle', 'distribution', 'function', 'the', 'detailed', 'pulse', 'profiles', 'strongly', 'depend', 'on', 'the', 'underlying', 'assumption', 'about', 'the', 'fluid', 'motion', 'subject', 'to', 'strong', 'electromagnetic', 'fields', 'this', 'electromagnetic', 'topology', 'enforces', 'the', 'photon', 'propagation', 'direction', 'directly', 'or', 'indirectly', 'from', 'aberration', 'effects', 'we', 'also', 'discuss', 'the', 'implication', 'of', 'a', 'net', 'stellar', 'electric', 'charge', 'on', 'to', 'the', 'sky', 'maps', 'taking', 'into', 'account', 'the', 'electric', 'field', 'strongly', 'affects', 'the', 'lightcurves', 'originating', 'close', 'to', 'the', 'lightcylinder', 'where', 'the', 'electric', 'field', 'strength', 'becomes', 'comparable', 'to', 'the', 'magnetic', 'field', 'strength']] | [-0.11791500442278102, 0.1486312125030255, -0.05183605390675036, 0.09803729635494374, -0.09669123818496225, -0.061987877002838934, 0.015943056712157826, 0.41022942920701694, -0.23349012691884063, -0.29280800102031335, 0.03314035983222528, -0.29672283510805264, -0.023019729418045455, 0.20009714846764032, 0.027582340868626747, -0.026177409980178243, 0.006583890824092437, 0.003214984421877899, -0.03525151568052845, -0.14168952352698816, 0.2985223576156587, 0.10352260178878112, 0.2663576420174038, 0.04355592606074086, 0.07023173218502342, 0.010777928316306355, -0.027383327964987953, 0.029986934036559134, -0.09877445125885141, 0.049544603390445564, 0.14648657938047527, 0.061731016442624735, 0.188842875532707, -0.4551799269104624, -0.21930521721354135, 0.08736400926831812, 0.14442367107809348, 0.08299016687128924, -0.06722020849367126, -0.2744196679198958, 0.008537800413910794, -0.15941157653944288, -0.1526943102759202, 0.03325044322116053, 0.016000135616292203, 0.05946623109151255, -0.24988077428249592, 0.047885180378860207, 0.03665197586132815, 0.045597305044085476, -0.11697358382552599, -0.10739187748105455, -0.03874599005804455, 0.1002208257858452, 0.10676821614141715, 0.07460341013584748, 0.22911773060357807, -0.15941320048518035, -0.03969736010546021, 0.40419260775917665, -0.08132094253767364, -0.1509371788644817, 0.1457871821074359, -0.24729730033939518, -0.08380479887910847, 0.20885076920658482, 0.18606931832928078, 0.10884969705299564, -0.12854677081814828, 0.05379795936073807, 0.00823908139832021, 0.17245130561935032, 0.07118022281664169, 0.03781006731241282, 0.3211849918506578, 0.08590212692140882, -0.0005874195299935486, 0.1844023014212736, -0.1938135813153143, -0.0809179178173283, -0.3028990465743813, -0.09673687064529816, -0.15704082092888388, 0.04657222232029287, -0.0939202611299208, -0.18095587557325948, 0.4183757147500374, 0.13277770541026257, 0.1455188564960309, -0.004796550028125006, 0.3208043954491747, 0.11725440510472415, 0.05330604169851548, 0.11021111834592359, 0.3239011469233237, 0.1690511266851336, 0.1021461317900865, -0.22053598093623047, 0.019132386019403955, 0.0016791548773613387] |
1,802.1032 | A Hardware-Efficient Analog Network Structure for Hybrid Precoding in
Millimeter Wave Systems | Hybrid precoding has been recently proposed as a cost-effective transceiver
solution for millimeter wave (mm-wave) systems. While the number of radio
frequency (RF) chains has been effectively reduced in existing works, a large
number of high-precision phase shifters are still needed. Practical phase
shifters are with coarsely quantized phases, and their number should be reduced
to a minimum due to cost and power consideration. In this paper, we propose a
novel hardware-efficient implementation for hybrid precoding, called the fixed
phase shifter (FPS) implementation. It only requires a small number of phase
shifters with quantized and fixed phases. To enhance the spectral efficiency, a
switch network is put forward to provide dynamic connections from phase
shifters to antennas, which is adaptive to the channel states. An effective
alternating minimization (AltMin) algorithm is developed with closed-form
solutions in each iteration to determine the hybrid precoder and the states of
switches. Moreover, to further reduce the hardware complexity, a
group-connected mapping strategy is proposed to reduce the number of switches.
Simulation results show that the FPS fully-connected hybrid precoder achieves
higher hardware efficiency with much fewer phase shifters than existing
proposals. Furthermore, the group-connected mapping achieves a good balance
between spectral efficiency and hardware complexity.
| cs.IT math.IT | hybrid precoding has been recently proposed as a costeffective transceiver solution for millimeter wave mmwave systems while the number of radio frequency rf chains has been effectively reduced in existing works a large number of highprecision phase shifters are still needed practical phase shifters are with coarsely quantized phases and their number should be reduced to a minimum due to cost and power consideration in this paper we propose a novel hardwareefficient implementation for hybrid precoding called the fixed phase shifter fps implementation it only requires a small number of phase shifters with quantized and fixed phases to enhance the spectral efficiency a switch network is put forward to provide dynamic connections from phase shifters to antennas which is adaptive to the channel states an effective alternating minimization altmin algorithm is developed with closedform solutions in each iteration to determine the hybrid precoder and the states of switches moreover to further reduce the hardware complexity a groupconnected mapping strategy is proposed to reduce the number of switches simulation results show that the fps fullyconnected hybrid precoder achieves higher hardware efficiency with much fewer phase shifters than existing proposals furthermore the groupconnected mapping achieves a good balance between spectral efficiency and hardware complexity | [['hybrid', 'precoding', 'has', 'been', 'recently', 'proposed', 'as', 'a', 'costeffective', 'transceiver', 'solution', 'for', 'millimeter', 'wave', 'mmwave', 'systems', 'while', 'the', 'number', 'of', 'radio', 'frequency', 'rf', 'chains', 'has', 'been', 'effectively', 'reduced', 'in', 'existing', 'works', 'a', 'large', 'number', 'of', 'highprecision', 'phase', 'shifters', 'are', 'still', 'needed', 'practical', 'phase', 'shifters', 'are', 'with', 'coarsely', 'quantized', 'phases', 'and', 'their', 'number', 'should', 'be', 'reduced', 'to', 'a', 'minimum', 'due', 'to', 'cost', 'and', 'power', 'consideration', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'hardwareefficient', 'implementation', 'for', 'hybrid', 'precoding', 'called', 'the', 'fixed', 'phase', 'shifter', 'fps', 'implementation', 'it', 'only', 'requires', 'a', 'small', 'number', 'of', 'phase', 'shifters', 'with', 'quantized', 'and', 'fixed', 'phases', 'to', 'enhance', 'the', 'spectral', 'efficiency', 'a', 'switch', 'network', 'is', 'put', 'forward', 'to', 'provide', 'dynamic', 'connections', 'from', 'phase', 'shifters', 'to', 'antennas', 'which', 'is', 'adaptive', 'to', 'the', 'channel', 'states', 'an', 'effective', 'alternating', 'minimization', 'altmin', 'algorithm', 'is', 'developed', 'with', 'closedform', 'solutions', 'in', 'each', 'iteration', 'to', 'determine', 'the', 'hybrid', 'precoder', 'and', 'the', 'states', 'of', 'switches', 'moreover', 'to', 'further', 'reduce', 'the', 'hardware', 'complexity', 'a', 'groupconnected', 'mapping', 'strategy', 'is', 'proposed', 'to', 'reduce', 'the', 'number', 'of', 'switches', 'simulation', 'results', 'show', 'that', 'the', 'fps', 'fullyconnected', 'hybrid', 'precoder', 'achieves', 'higher', 'hardware', 'efficiency', 'with', 'much', 'fewer', 'phase', 'shifters', 'than', 'existing', 'proposals', 'furthermore', 'the', 'groupconnected', 'mapping', 'achieves', 'a', 'good', 'balance', 'between', 'spectral', 'efficiency', 'and', 'hardware', 'complexity']] | [-0.22196494693402202, 0.08963547735773318, -0.05049525798414834, -0.027371245871763678, -0.11251892168540507, -0.24652720160782338, 0.11227746299293358, 0.42168594580492935, -0.22237736913375555, -0.3255187810980715, 0.1035818720102543, -0.22539670901707723, -0.18163573799072766, 0.1619120997795835, -0.11114259608089924, 0.10222211985848845, 0.05057166621554643, -0.027654920193454016, -0.11582940198102733, -0.22462106336373835, 0.1962236681772629, 0.11506724879145622, 0.36445136019960045, -0.02888194350995036, 0.1199575999006629, -0.051079826666973534, 0.030188739388249813, -0.013068735614069737, -0.04510387489939603, 0.07146952422539471, 0.32737658844096584, 0.14202714161714539, 0.28654011079343034, -0.44863599732518195, -0.23123376546893268, 0.11157010146416724, 0.15794065294321627, 0.09281023540243041, -0.07116732060676441, -0.23229678567382506, 0.14252013431861996, -0.21445694484282285, -0.03798609099787427, -0.08056524615851231, -0.058307748166844246, 0.03903200254571857, -0.29542666966328396, -0.04003545500934706, -0.019852651174296625, -0.009826551240403205, 0.01587427687831223, -0.14469576708972454, 0.007499527807813138, 0.09915467022918165, -0.0390153669018764, 0.040839242932852356, 0.07748918387806043, -0.08984488806338049, -0.1055008641933091, 0.336051886389032, 0.015930455972775235, -0.2140380261465907, 0.1678819948041928, -0.06889744920437807, -0.09829670195584185, 0.22336814358714036, 0.20509647103739553, 0.0652562710721395, -0.11180420883058105, 0.024274116664601025, 0.035757699273599425, 0.24094963192939758, 0.04696920884307474, 0.11360473688924685, 0.14490647485246883, 0.2340061702998355, 0.14164428762625902, 0.18552114856254776, -0.10432703171507456, -0.09617858870420605, -0.20062819330887577, -0.156531651946716, -0.21719442839501427, -0.05103718475300411, -0.09189153008708673, -0.11327833107439801, 0.4014208586700261, 0.15602864108863287, 0.1301614374248311, 0.11788374061055946, 0.4226111556775868, 0.14425305258482696, 0.10433488223119639, 0.0994203044171445, 0.23345743118785323, 0.10859320628631394, 0.13345902108761948, -0.24543406126787887, 0.005345515863737092, 0.05223736540414393] |
1,802.10321 | High-resolution long-working-distance reference-free holographic
microscopy exploiting speckle-correlation scattering matrix | Using conventional refraction-based optical lens, it is challenging to
achieve both high-resolution imaging and long-working-distance condition. To
increase the numerical aperture of a lens, the working distance should be
compensated, and vice versa. Here we propose and demonstrate a new concept in
optical microscopy that can achieve both high-resolution imaging and
long-working-distance conditions by utilising a scattering layer instead of
refractive optics. When light passes through a scattering layer, it creates a
unique interference pattern. To retrieve the complex amplitude image from the
interference pattern without introducing a reference beam, we utilised a
speckle-correlation scattering matrix method. This property enables holographic
microscopy without any lens or external reference beam. Importantly, the
proposed method allows high-resolution imaging with a long working distance
beyond what a conventional objective lens can achieve. As an experimental
verification, we imaged various microscopic samples and compared their
performance with off-axis digital holographic microscopy.
| physics.optics | using conventional refractionbased optical lens it is challenging to achieve both highresolution imaging and longworkingdistance condition to increase the numerical aperture of a lens the working distance should be compensated and vice versa here we propose and demonstrate a new concept in optical microscopy that can achieve both highresolution imaging and longworkingdistance conditions by utilising a scattering layer instead of refractive optics when light passes through a scattering layer it creates a unique interference pattern to retrieve the complex amplitude image from the interference pattern without introducing a reference beam we utilised a specklecorrelation scattering matrix method this property enables holographic microscopy without any lens or external reference beam importantly the proposed method allows highresolution imaging with a long working distance beyond what a conventional objective lens can achieve as an experimental verification we imaged various microscopic samples and compared their performance with offaxis digital holographic microscopy | [['using', 'conventional', 'refractionbased', 'optical', 'lens', 'it', 'is', 'challenging', 'to', 'achieve', 'both', 'highresolution', 'imaging', 'and', 'longworkingdistance', 'condition', 'to', 'increase', 'the', 'numerical', 'aperture', 'of', 'a', 'lens', 'the', 'working', 'distance', 'should', 'be', 'compensated', 'and', 'vice', 'versa', 'here', 'we', 'propose', 'and', 'demonstrate', 'a', 'new', 'concept', 'in', 'optical', 'microscopy', 'that', 'can', 'achieve', 'both', 'highresolution', 'imaging', 'and', 'longworkingdistance', 'conditions', 'by', 'utilising', 'a', 'scattering', 'layer', 'instead', 'of', 'refractive', 'optics', 'when', 'light', 'passes', 'through', 'a', 'scattering', 'layer', 'it', 'creates', 'a', 'unique', 'interference', 'pattern', 'to', 'retrieve', 'the', 'complex', 'amplitude', 'image', 'from', 'the', 'interference', 'pattern', 'without', 'introducing', 'a', 'reference', 'beam', 'we', 'utilised', 'a', 'specklecorrelation', 'scattering', 'matrix', 'method', 'this', 'property', 'enables', 'holographic', 'microscopy', 'without', 'any', 'lens', 'or', 'external', 'reference', 'beam', 'importantly', 'the', 'proposed', 'method', 'allows', 'highresolution', 'imaging', 'with', 'a', 'long', 'working', 'distance', 'beyond', 'what', 'a', 'conventional', 'objective', 'lens', 'can', 'achieve', 'as', 'an', 'experimental', 'verification', 'we', 'imaged', 'various', 'microscopic', 'samples', 'and', 'compared', 'their', 'performance', 'with', 'offaxis', 'digital', 'holographic', 'microscopy']] | [-0.0927506582177922, 0.07530945338093799, -0.13326062891492937, 0.027569596326219387, -0.13310113858247846, -0.18023733099998565, 0.04573199749000839, 0.46196679568209614, -0.27974405547375886, -0.32939553931102056, 0.0859703935154549, -0.26967892454801284, -0.17830253595353238, 0.20712938781694643, -0.061193832321421934, 0.0932632396567841, 0.06109443157087682, -0.05986332016534546, -0.08229176204597742, -0.1650680170020684, 0.2583167419395074, 0.08270677280149796, 0.3359393966384232, 0.0302040284835309, 0.13705400786391098, 0.08972956563605844, -0.020236622851395814, 0.0512744198287172, -0.08374464891869361, 0.08859230162414285, 0.23547780025927795, 0.11204906424656384, 0.20640837141078244, -0.4349138303501468, -0.2505714550810758, 0.04079125560645876, 0.17682563434006507, 0.12237318571606258, -0.12408816223397065, -0.2864730735214389, 0.04968059856542006, -0.11272478874671418, -0.1397761231554406, -0.07010178135721437, -0.09500378391509053, -0.013168939731406922, -0.31048739497188704, 0.029713477161928747, -0.024235644774827442, 0.08679289309954157, -0.03800503883018241, -0.01132035235791993, 0.02844885743593759, 0.11743842731297276, -0.06764363424518291, 0.06368789012816285, 0.13611048792938696, -0.13870539968408846, -0.07659008452228466, 0.37385191090823133, -0.051015012982115505, -0.17728174317526776, 0.17992167698447498, -0.1275768048877568, 0.009874354300348937, 0.15383438582272352, 0.14726123424424303, 0.11707476582884992, -0.14723613361408697, 0.011527770504174868, -0.021143441422696727, 0.2581225116657993, 0.1427345307176413, 0.06851027374073458, 0.20765943704394713, 0.19662571837492035, 0.048010071802909685, 0.14884769431945746, -0.21712382682630804, 0.014866651377963776, -0.20981794039142274, -0.15019724538334372, -0.18853523225054702, 0.052385134131451246, -0.08378895899852291, -0.10846955302570548, 0.32335297178895195, 0.17102827847662833, 0.1626648830161208, 0.014383983580937267, 0.4210792564514543, 0.05011453890624982, 0.1171092673436086, -0.04260723387860522, 0.271871002682415, 0.10700418273474843, 0.14776632465742098, -0.2165866637488409, 0.006834770747631484, 0.0034382563546857463] |
1,802.10322 | Thermal drag in electronic conductors | We study the electronic thermal drag in two different Coulomb-coupled
systems, the first one composed of two Coulomb blockaded metallic islands and
the second one consisting of two parallel quantum wires. The two conductors of
each system are electrically isolated and placed in the two circuits (the drive
and the drag) of a four-electrode setup. The systems are biased, either by a
temperature $\Delta T$ or a voltage $V$ difference, on the drive circuit, while
no biases are present on the drag circuit. In the case of a pair of metallic
islands we use a master equation approach to determine the general properties
of the dragged heat current $I^{\rm (h)}_{\rm drag}$, accounting also for
co-tunneling contributions and the presence of large biases. Analytic results
are obtained in the sequential tunneling regime for small biases, finding, in
particular, that $I^{\rm (h)}_{\rm drag}$ is quadratic in $\Delta T$ or $V$ and
non-monotonous as a function of the inter-island coupling. Finally, by
replacing one of the electrodes in the drag circuit with a superconductor, we
find that heat can be extracted from the other normal electrode. In the case of
the two interacting quantum wires, using the Luttinger liquid theory and the
bosonization technique, we derive an analytic expression for the thermal
trans-resistivity $\rho^{\rm (h)}_{12}$, in the weak-coupling limit and at low
temperatures. $\rho^{\rm (h)}_{12}$ turns out to be proportional to the
electric trans-resistivity $\rho^{\rm (c)}_{12}$, in such a way that their
ratio (a kind of Wiedemann-Franz law) is proportional to $T^3$. We find that
the thermal trans-resistivity is proportional to $T$ for low temperatures and
decreases like $1/T$ for intermediate temperatures or like $1/T^3$ for high
temperatures. We complete our analyses by performing numerical simulations that
confirm the above results and allow to access the strong coupling regime.
| cond-mat.mes-hall | we study the electronic thermal drag in two different coulombcoupled systems the first one composed of two coulomb blockaded metallic islands and the second one consisting of two parallel quantum wires the two conductors of each system are electrically isolated and placed in the two circuits the drive and the drag of a fourelectrode setup the systems are biased either by a temperature delta t or a voltage v difference on the drive circuit while no biases are present on the drag circuit in the case of a pair of metallic islands we use a master equation approach to determine the general properties of the dragged heat current irm h_rm drag accounting also for cotunneling contributions and the presence of large biases analytic results are obtained in the sequential tunneling regime for small biases finding in particular that irm h_rm drag is quadratic in delta t or v and nonmonotonous as a function of the interisland coupling finally by replacing one of the electrodes in the drag circuit with a superconductor we find that heat can be extracted from the other normal electrode in the case of the two interacting quantum wires using the luttinger liquid theory and the bosonization technique we derive an analytic expression for the thermal transresistivity rhorm h_12 in the weakcoupling limit and at low temperatures rhorm h_12 turns out to be proportional to the electric transresistivity rhorm c_12 in such a way that their ratio a kind of wiedemannfranz law is proportional to t3 we find that the thermal transresistivity is proportional to t for low temperatures and decreases like 1t for intermediate temperatures or like 1t3 for high temperatures we complete our analyses by performing numerical simulations that confirm the above results and allow to access the strong coupling regime | [['we', 'study', 'the', 'electronic', 'thermal', 'drag', 'in', 'two', 'different', 'coulombcoupled', 'systems', 'the', 'first', 'one', 'composed', 'of', 'two', 'coulomb', 'blockaded', 'metallic', 'islands', 'and', 'the', 'second', 'one', 'consisting', 'of', 'two', 'parallel', 'quantum', 'wires', 'the', 'two', 'conductors', 'of', 'each', 'system', 'are', 'electrically', 'isolated', 'and', 'placed', 'in', 'the', 'two', 'circuits', 'the', 'drive', 'and', 'the', 'drag', 'of', 'a', 'fourelectrode', 'setup', 'the', 'systems', 'are', 'biased', 'either', 'by', 'a', 'temperature', 'delta', 't', 'or', 'a', 'voltage', 'v', 'difference', 'on', 'the', 'drive', 'circuit', 'while', 'no', 'biases', 'are', 'present', 'on', 'the', 'drag', 'circuit', 'in', 'the', 'case', 'of', 'a', 'pair', 'of', 'metallic', 'islands', 'we', 'use', 'a', 'master', 'equation', 'approach', 'to', 'determine', 'the', 'general', 'properties', 'of', 'the', 'dragged', 'heat', 'current', 'irm', 'h_rm', 'drag', 'accounting', 'also', 'for', 'cotunneling', 'contributions', 'and', 'the', 'presence', 'of', 'large', 'biases', 'analytic', 'results', 'are', 'obtained', 'in', 'the', 'sequential', 'tunneling', 'regime', 'for', 'small', 'biases', 'finding', 'in', 'particular', 'that', 'irm', 'h_rm', 'drag', 'is', 'quadratic', 'in', 'delta', 't', 'or', 'v', 'and', 'nonmonotonous', 'as', 'a', 'function', 'of', 'the', 'interisland', 'coupling', 'finally', 'by', 'replacing', 'one', 'of', 'the', 'electrodes', 'in', 'the', 'drag', 'circuit', 'with', 'a', 'superconductor', 'we', 'find', 'that', 'heat', 'can', 'be', 'extracted', 'from', 'the', 'other', 'normal', 'electrode', 'in', 'the', 'case', 'of', 'the', 'two', 'interacting', 'quantum', 'wires', 'using', 'the', 'luttinger', 'liquid', 'theory', 'and', 'the', 'bosonization', 'technique', 'we', 'derive', 'an', 'analytic', 'expression', 'for', 'the', 'thermal', 'transresistivity', 'rhorm', 'h_12', 'in', 'the', 'weakcoupling', 'limit', 'and', 'at', 'low', 'temperatures', 'rhorm', 'h_12', 'turns', 'out', 'to', 'be', 'proportional', 'to', 'the', 'electric', 'transresistivity', 'rhorm', 'c_12', 'in', 'such', 'a', 'way', 'that', 'their', 'ratio', 'a', 'kind', 'of', 'wiedemannfranz', 'law', 'is', 'proportional', 'to', 't3', 'we', 'find', 'that', 'the', 'thermal', 'transresistivity', 'is', 'proportional', 'to', 't', 'for', 'low', 'temperatures', 'and', 'decreases', 'like', '1t', 'for', 'intermediate', 'temperatures', 'or', 'like', '1t3', 'for', 'high', 'temperatures', 'we', 'complete', 'our', 'analyses', 'by', 'performing', 'numerical', 'simulations', 'that', 'confirm', 'the', 'above', 'results', 'and', 'allow', 'to', 'access', 'the', 'strong', 'coupling', 'regime']] | [-0.17583762627170496, 0.17221620369029453, -0.04531006076895456, 0.023768959553972062, -0.004157025587266764, -0.1823799118739427, 0.07240687945355799, 0.32883840903859646, -0.2496193175521094, -0.279025237333986, 0.040009001593225055, -0.3381840796209872, -0.09561784504173398, 0.23428273261084245, 0.02916807065500777, -0.006728346440443577, -0.009449136588955298, 0.00040488077934856554, -0.06572812599070194, -0.2026878638575294, 0.28392532104752155, -0.0036703761654427727, 0.27137891724516916, 0.08124196538670189, 0.06130203397697187, -0.01714463491776228, 0.05942266885461789, 0.07256134551819225, -0.1349611902714723, 0.01955268705569324, 0.2134181694623171, -0.05085365042543492, 0.21170084360307334, -0.4431514062862088, -0.15976010289080944, 0.06297852315411374, 0.11901538374572615, 0.1162819597560195, -0.02654319118654884, -0.20810427946963575, 0.04444847362410164, -0.1669048182729229, -0.1165197869602314, -0.06261558181329353, 0.019628021890467435, 0.024070005324795824, -0.2788961084553267, 0.10702224789654154, 0.059776969387737175, 0.025808959305789823, -0.03640016854891705, -0.11901735974714865, -0.02344812307116651, 0.09977604679865967, 0.016217454847080533, 0.023182982556062524, 0.1762157456804424, -0.1512347901376858, -0.05893769915014304, 0.33707252591596665, -0.11343642169821258, -0.15394190115841558, 0.19275885518574207, -0.17059104546424841, -0.07863494711283066, 0.12313863469367985, 0.10887239876398314, 0.10195568617497908, -0.15823222876025358, 0.08221029127624305, 0.0058862097337967845, 0.1238841460616567, 0.050778947540911265, 0.007055072361450781, 0.2207344879547285, 0.15476334158479035, 0.03536358410240831, 0.15837252825735346, -0.10740426030463061, -0.05631475358323597, -0.3050959050605023, -0.16694122522981283, -0.1830091277775323, 0.06966949795566285, -0.08253047434880352, -0.1607053964099897, 0.34654159180482147, 0.15684616328783435, 0.20373060135170817, 0.028995989749484974, 0.3041670344552856, 0.16422179162445655, 0.06675600303679931, 0.06988269131869783, 0.24460793045432797, 0.14625872974441312, 0.09824020780600935, -0.3067459084430428, 0.029711521026124624, 0.028881830689528754] |
1,802.10323 | A FFT-based finite-difference solver for massively-parallel direct
numerical simulations of turbulent flows | We present an efficient solver for massively-parallel direct numerical
simulations of incompressible turbulent flows. The method uses a second-order,
finite-volume pressure-correction scheme, where the pressure Poisson equation
is solved with the method of eigenfunction expansions. This approach allows for
very efficient FFT-based solvers in problems with different combinations of
homogeneous pressure boundary conditions. Our algorithm explores all
combinations of pressure boundary conditions valid for such a solver, in a
single, general framework. The method is implemented in a 2D pencil-like domain
decomposition, which enables efficient massively-parallel simulations. The
implementation was validated against different canonical flows, and its
computational performance was examined. Excellent strong scaling performance up
to $10^4$ cores is demonstrated for a domain with $10^9$ spatial degrees of
freedom, corresponding to a very small wall-clock time/time step. The resulting
tool, CaNS, has been made freely available and open-source.
| physics.flu-dyn | we present an efficient solver for massivelyparallel direct numerical simulations of incompressible turbulent flows the method uses a secondorder finitevolume pressurecorrection scheme where the pressure poisson equation is solved with the method of eigenfunction expansions this approach allows for very efficient fftbased solvers in problems with different combinations of homogeneous pressure boundary conditions our algorithm explores all combinations of pressure boundary conditions valid for such a solver in a single general framework the method is implemented in a 2d pencillike domain decomposition which enables efficient massivelyparallel simulations the implementation was validated against different canonical flows and its computational performance was examined excellent strong scaling performance up to 104 cores is demonstrated for a domain with 109 spatial degrees of freedom corresponding to a very small wallclock timetime step the resulting tool cans has been made freely available and opensource | [['we', 'present', 'an', 'efficient', 'solver', 'for', 'massivelyparallel', 'direct', 'numerical', 'simulations', 'of', 'incompressible', 'turbulent', 'flows', 'the', 'method', 'uses', 'a', 'secondorder', 'finitevolume', 'pressurecorrection', 'scheme', 'where', 'the', 'pressure', 'poisson', 'equation', 'is', 'solved', 'with', 'the', 'method', 'of', 'eigenfunction', 'expansions', 'this', 'approach', 'allows', 'for', 'very', 'efficient', 'fftbased', 'solvers', 'in', 'problems', 'with', 'different', 'combinations', 'of', 'homogeneous', 'pressure', 'boundary', 'conditions', 'our', 'algorithm', 'explores', 'all', 'combinations', 'of', 'pressure', 'boundary', 'conditions', 'valid', 'for', 'such', 'a', 'solver', 'in', 'a', 'single', 'general', 'framework', 'the', 'method', 'is', 'implemented', 'in', 'a', '2d', 'pencillike', 'domain', 'decomposition', 'which', 'enables', 'efficient', 'massivelyparallel', 'simulations', 'the', 'implementation', 'was', 'validated', 'against', 'different', 'canonical', 'flows', 'and', 'its', 'computational', 'performance', 'was', 'examined', 'excellent', 'strong', 'scaling', 'performance', 'up', 'to', '104', 'cores', 'is', 'demonstrated', 'for', 'a', 'domain', 'with', '109', 'spatial', 'degrees', 'of', 'freedom', 'corresponding', 'to', 'a', 'very', 'small', 'wallclock', 'timetime', 'step', 'the', 'resulting', 'tool', 'cans', 'has', 'been', 'made', 'freely', 'available', 'and', 'opensource']] | [-0.13934592796797804, 0.03141405146659885, -0.11839258858872069, 0.008509233605666019, -0.07531995379211877, -0.14776464822038793, -0.007254111664302701, 0.39109869502323996, -0.24039599395913186, -0.30523094304388376, 0.09890014336280284, -0.20108380750428445, -0.09961090087321112, 0.24481697056254895, 0.012073152123200004, 0.14781329211135724, 0.12313959898641534, -0.04248912616384973, -0.09530717870090727, -0.22521986141499373, 0.2240602952300859, 0.07193081542722238, 0.31560544096261745, 0.05146020527873791, 0.15531977663727867, -0.0860461499340993, -0.03562982326788868, 0.039286341675617495, -0.12355135078206926, 0.08394409777268284, 0.2484094300868472, 0.07832025380875486, 0.30452215148256623, -0.4347645781679655, -0.21204768845530078, 0.010987636236232712, 0.1377193002221208, 0.12697164956798523, -0.06112176904340925, -0.2521551330942366, 0.11356510317927518, -0.1799407565410135, -0.1550460751838446, -0.1278112741763429, -0.013673357879943985, -0.01590227002023364, -0.3347139448671193, 0.09105923080736462, -0.0037480274855206126, 0.053468994880028126, -0.05033169603167879, -0.12588897830113205, 0.03474279601803626, 0.07468444237438626, -0.013437237990886081, 0.027298302004422, 0.09736964304047041, -0.07646972046689325, -0.06774708815254003, 0.4098741538963354, -0.06118367298124291, -0.256509853078039, 0.23332119460063552, -0.050110839273807384, -0.10509880125294808, 0.17203813707522994, 0.18142692938031588, 0.17630134826767252, -0.14473698550178635, 0.10127085974530431, -0.021086337451032437, 0.18301556134100655, 0.047000139231438476, -0.06432933514902582, 0.12989251015091435, 0.2120565527718407, 0.0582837207551054, 0.16889793080070037, -0.06815404815786927, -0.1177190673477251, -0.25861122984800944, -0.15936284647792204, -0.17470820068646384, -0.022667768059579804, -0.12989393938475174, -0.18252587737850576, 0.3516684382268604, 0.1600047949468717, 0.0997065668925643, 0.04668989058470072, 0.3720814026758182, 0.10572578262608069, 0.06591723011069589, 0.14810033329166203, 0.16184070335178496, 0.14387836671106036, 0.12189883809107885, -0.23343726473512033, 0.015161269253937246, 0.10298807900264967] |
1,802.10324 | High-order splitting integrators for nonlinear Schr\"odinger equations
over long times | The long-time behaviour of splitting integrators applied to nonlinear
Schr\"odinger equations in a weakly nonlinear setting is studied. It is proven
that the energy is nearly conserved on long time intervals. The analysis
includes all consistent splitting integrators with real-valued coefficients, in
particular splitting integrators of high order. The proof is based on a
completely resonant modulated Fourier expansion in time of the numerical
solution.
| math.NA | the longtime behaviour of splitting integrators applied to nonlinear schrodinger equations in a weakly nonlinear setting is studied it is proven that the energy is nearly conserved on long time intervals the analysis includes all consistent splitting integrators with realvalued coefficients in particular splitting integrators of high order the proof is based on a completely resonant modulated fourier expansion in time of the numerical solution | [['the', 'longtime', 'behaviour', 'of', 'splitting', 'integrators', 'applied', 'to', 'nonlinear', 'schrodinger', 'equations', 'in', 'a', 'weakly', 'nonlinear', 'setting', 'is', 'studied', 'it', 'is', 'proven', 'that', 'the', 'energy', 'is', 'nearly', 'conserved', 'on', 'long', 'time', 'intervals', 'the', 'analysis', 'includes', 'all', 'consistent', 'splitting', 'integrators', 'with', 'realvalued', 'coefficients', 'in', 'particular', 'splitting', 'integrators', 'of', 'high', 'order', 'the', 'proof', 'is', 'based', 'on', 'a', 'completely', 'resonant', 'modulated', 'fourier', 'expansion', 'in', 'time', 'of', 'the', 'numerical', 'solution']] | [-0.2094645667104767, 0.09081871658563614, -0.11291534054594544, 0.07382835924911957, -0.06547912967462953, -0.125025456212461, -0.06630685464120828, 0.3741532530922156, -0.26627493747151815, -0.2149276834840958, 0.1169877989235549, -0.2378758896428805, -0.11307185469911649, 0.23935721525206016, 0.0028504942185603654, 0.10582856769458605, 0.08721380771066134, 0.010381677187979221, -0.07476480353910189, -0.24051739052475357, 0.2852960541289156, 0.029837947209867148, 0.26406768800404207, -0.005693631210865883, 0.16219143974236572, -0.017279097620541087, -0.01917005943564268, -0.016292788690099348, -0.11365433007606324, 0.056115476937534714, 0.2372286652859587, -0.02219859533585035, 0.2969603557426196, -0.37701534514243784, -0.18529559945544372, 0.052616192042254484, 0.16228441561643894, 0.12233051561678832, -0.02747418551455037, -0.2684717875547134, 0.05461522134092565, -0.11825107626903515, -0.14342971338818852, -0.1412241851624388, 0.01095217027916358, 0.06547158628415603, -0.26766587586070484, 0.13853693935267913, 0.08219311399242053, 0.01800115227412719, -0.10272488644919717, -0.04556115821290475, 0.007350743476014871, 0.031917304337884374, 0.06704632937549972, -0.041900711886298195, 0.024022055331331033, -0.044745061790140775, -0.10027977338490578, 0.3816141014864955, -0.14714780843351036, -0.2779976831605801, 0.17677578214341058, -0.1589515818712803, -0.1455980700798906, 0.17887041402550843, 0.1625944224239972, 0.21320641211305674, -0.14149324832340845, 0.1385661110496865, 0.018254393324829064, 0.20463924637207617, 0.08831699532098496, -0.007501256405017697, 0.07911882711431155, 0.16666169878310308, 0.14012896600537575, 0.0827148622331711, 0.005646121910271736, -0.19668238980409045, -0.30416549345335137, -0.10730949349414844, -0.2141219067476833, 0.06580524850959102, -0.05934466986128917, -0.18620470421245464, 0.44784955542821153, 0.06766121519299653, 0.14852511713711114, 0.07414168163847465, 0.2755531370926362, 0.2541677396171368, 0.05613194118397167, 0.059302895602125386, 0.2093476318825896, 0.1842559923310406, 0.12648206293726197, -0.2460496263542714, 0.039006734438813646, 0.12953764834942727] |
1,802.10325 | Shifting Maximum Eigenvalue Detection in Low SNR Environment | Maximum eigenvalue detection (MED) is an important application of random
matrix theory in spectrum sensing and signal detection. However, in small
signal-to-noise ratio environment, the maximum eigenvalue of the representative
signal is at the edge of Marchenko-Pastur (M-P) law bulk and meets the
Tracy-Widom distribution. Since the distribution of Tracy-Widom has no
closed-form expression, it brings great difficulty in processing. In this
paper, we propose a shifting maximum eigenvalue (SMED) algorithm, which shifts
the maximum eigenvalue out of the M-P law bulk by combining an auxiliary signal
associated with the signal to be detected. According to the random matrix
theory, the shifted maximum eigenvalue is consistent with Gaussian
distribution. The proposed SMED not only simplifies the detection algorithm,
but also greatly improve the detection performance. In this paper, the
performance of SMED, MED and trace (FMD) algorithm is analyzed and the
theoretical performance comparisons are obtained. The algorithm and theoretical
results are verified by the simulations in different signal environments.
| eess.SP | maximum eigenvalue detection med is an important application of random matrix theory in spectrum sensing and signal detection however in small signaltonoise ratio environment the maximum eigenvalue of the representative signal is at the edge of marchenkopastur mp law bulk and meets the tracywidom distribution since the distribution of tracywidom has no closedform expression it brings great difficulty in processing in this paper we propose a shifting maximum eigenvalue smed algorithm which shifts the maximum eigenvalue out of the mp law bulk by combining an auxiliary signal associated with the signal to be detected according to the random matrix theory the shifted maximum eigenvalue is consistent with gaussian distribution the proposed smed not only simplifies the detection algorithm but also greatly improve the detection performance in this paper the performance of smed med and trace fmd algorithm is analyzed and the theoretical performance comparisons are obtained the algorithm and theoretical results are verified by the simulations in different signal environments | [['maximum', 'eigenvalue', 'detection', 'med', 'is', 'an', 'important', 'application', 'of', 'random', 'matrix', 'theory', 'in', 'spectrum', 'sensing', 'and', 'signal', 'detection', 'however', 'in', 'small', 'signaltonoise', 'ratio', 'environment', 'the', 'maximum', 'eigenvalue', 'of', 'the', 'representative', 'signal', 'is', 'at', 'the', 'edge', 'of', 'marchenkopastur', 'mp', 'law', 'bulk', 'and', 'meets', 'the', 'tracywidom', 'distribution', 'since', 'the', 'distribution', 'of', 'tracywidom', 'has', 'no', 'closedform', 'expression', 'it', 'brings', 'great', 'difficulty', 'in', 'processing', 'in', 'this', 'paper', 'we', 'propose', 'a', 'shifting', 'maximum', 'eigenvalue', 'smed', 'algorithm', 'which', 'shifts', 'the', 'maximum', 'eigenvalue', 'out', 'of', 'the', 'mp', 'law', 'bulk', 'by', 'combining', 'an', 'auxiliary', 'signal', 'associated', 'with', 'the', 'signal', 'to', 'be', 'detected', 'according', 'to', 'the', 'random', 'matrix', 'theory', 'the', 'shifted', 'maximum', 'eigenvalue', 'is', 'consistent', 'with', 'gaussian', 'distribution', 'the', 'proposed', 'smed', 'not', 'only', 'simplifies', 'the', 'detection', 'algorithm', 'but', 'also', 'greatly', 'improve', 'the', 'detection', 'performance', 'in', 'this', 'paper', 'the', 'performance', 'of', 'smed', 'med', 'and', 'trace', 'fmd', 'algorithm', 'is', 'analyzed', 'and', 'the', 'theoretical', 'performance', 'comparisons', 'are', 'obtained', 'the', 'algorithm', 'and', 'theoretical', 'results', 'are', 'verified', 'by', 'the', 'simulations', 'in', 'different', 'signal', 'environments']] | [-0.09788448830222478, 0.050246264551424245, -0.10061853313527536, 0.012500298114173348, -0.048921974969562146, -0.14151170722325332, 0.04426864726410713, 0.36783244723337705, -0.2359511567017762, -0.3332510052947327, 0.10283038034758647, -0.29346789785195143, -0.17720644190558232, 0.13838121153094107, -0.07818818754894892, 0.12440303540788591, 0.08446351603488438, 0.06625393631693441, -0.05710990490333643, -0.19138611394155305, 0.2272734350452083, 0.13174971108237515, 0.34971229707589374, 0.0458200794440927, 0.05826575392275117, -0.0012069288059137762, -0.04935734317987226, -0.01359836099622953, -0.07653133872663602, 0.10446601567782636, 0.25117213728663046, 0.17344573831360321, 0.24588651121011934, -0.3380948904203251, -0.1884928072046023, 0.13325872634886765, 0.169367601734848, 0.05575908649407211, -0.050730627197481226, -0.27470150517765435, 0.11690084635047242, -0.15446111208293586, -0.1001778737816494, 0.003197904783883132, 0.0011384903020370985, 0.003333297877543373, -0.2876249020249816, 0.12568867319332638, 0.05439671791100409, 0.013283257350485656, -0.017234533252485564, -0.17530813380144536, 0.045539642797666605, 0.09251902225150843, 0.03239262658753432, -0.020943328602879775, 0.11754794265143573, -0.11854457483859733, -0.08003281422861619, 0.3525750237429747, -0.05895205128326779, -0.18159901717262983, 0.11131031665281625, -0.12997664205759066, -0.1360839324450353, 0.1738188746717242, 0.15273036822618452, 0.10223898279555214, -0.1426827646617312, 0.08676090493499941, -0.01011745709402021, 0.1560147823416628, 0.07495988888840657, -0.005081158175744349, 0.16643055384920444, 0.12590471291623545, 0.09428208340323181, 0.14439801333428476, -0.12518371754595137, -0.10708030142122879, -0.24934402671642603, -0.13560382197429136, -0.29799068514766985, 0.003310585420786083, -0.15062080611487544, -0.13051140348543414, 0.4004320356063545, 0.18026944017910865, 0.19023707800515693, 0.09927118944833638, 0.32660629202000563, 0.20612783817923627, 0.017054646641190628, 0.09197820461795345, 0.2508516118774423, 0.187020459480118, 0.07880626555997879, -0.23224554879416245, 0.0864584476017626, 0.03025906389229931] |
1,802.10326 | An Analysis on Caching Placement for Millimeter/Micro Wave Hybrid
Networks | In this paper, we consider a hybrid millimeter wave (mmWave) and micro wave
($\mu$Wave) network from the perspective of \emph{wireless caching} and study
the optimal probabilistic content/file caching placement at desirable base
stations (BSs) using a stochastic geometric framework. Considering the average
success probability (ASP) of file delivery as the performance metric, we derive
expressions for the association probability of the typical user to the mmWave
and $\mu$Wave networks. Accordingly, we provide an upper bound for the ASP of
file delivery and formulate the content caching placement scheme as an
optimization problem with respect to caching probabilities, that jointly
optimizes the ASP of file delivery considering both content placement and
delivery phases. In particular, we consider the caching placement strategy
under both noise-limited and interference-limited environments. We numerically
evaluate the performance of the proposed caching schemes under essential
factors, such as blockages in the mmWave network, cluster radius, BS density,
and path loss and compare it with uniform caching placement, caching $M$ most
popular contents, and random caching placement. Numerical results demonstrate
the superiority of the proposed caching scheme over others, albeit certain
trade-offs.
| eess.SP | in this paper we consider a hybrid millimeter wave mmwave and micro wave muwave network from the perspective of emphwireless caching and study the optimal probabilistic contentfile caching placement at desirable base stations bss using a stochastic geometric framework considering the average success probability asp of file delivery as the performance metric we derive expressions for the association probability of the typical user to the mmwave and muwave networks accordingly we provide an upper bound for the asp of file delivery and formulate the content caching placement scheme as an optimization problem with respect to caching probabilities that jointly optimizes the asp of file delivery considering both content placement and delivery phases in particular we consider the caching placement strategy under both noiselimited and interferencelimited environments we numerically evaluate the performance of the proposed caching schemes under essential factors such as blockages in the mmwave network cluster radius bs density and path loss and compare it with uniform caching placement caching m most popular contents and random caching placement numerical results demonstrate the superiority of the proposed caching scheme over others albeit certain tradeoffs | [['in', 'this', 'paper', 'we', 'consider', 'a', 'hybrid', 'millimeter', 'wave', 'mmwave', 'and', 'micro', 'wave', 'muwave', 'network', 'from', 'the', 'perspective', 'of', 'emphwireless', 'caching', 'and', 'study', 'the', 'optimal', 'probabilistic', 'contentfile', 'caching', 'placement', 'at', 'desirable', 'base', 'stations', 'bss', 'using', 'a', 'stochastic', 'geometric', 'framework', 'considering', 'the', 'average', 'success', 'probability', 'asp', 'of', 'file', 'delivery', 'as', 'the', 'performance', 'metric', 'we', 'derive', 'expressions', 'for', 'the', 'association', 'probability', 'of', 'the', 'typical', 'user', 'to', 'the', 'mmwave', 'and', 'muwave', 'networks', 'accordingly', 'we', 'provide', 'an', 'upper', 'bound', 'for', 'the', 'asp', 'of', 'file', 'delivery', 'and', 'formulate', 'the', 'content', 'caching', 'placement', 'scheme', 'as', 'an', 'optimization', 'problem', 'with', 'respect', 'to', 'caching', 'probabilities', 'that', 'jointly', 'optimizes', 'the', 'asp', 'of', 'file', 'delivery', 'considering', 'both', 'content', 'placement', 'and', 'delivery', 'phases', 'in', 'particular', 'we', 'consider', 'the', 'caching', 'placement', 'strategy', 'under', 'both', 'noiselimited', 'and', 'interferencelimited', 'environments', 'we', 'numerically', 'evaluate', 'the', 'performance', 'of', 'the', 'proposed', 'caching', 'schemes', 'under', 'essential', 'factors', 'such', 'as', 'blockages', 'in', 'the', 'mmwave', 'network', 'cluster', 'radius', 'bs', 'density', 'and', 'path', 'loss', 'and', 'compare', 'it', 'with', 'uniform', 'caching', 'placement', 'caching', 'm', 'most', 'popular', 'contents', 'and', 'random', 'caching', 'placement', 'numerical', 'results', 'demonstrate', 'the', 'superiority', 'of', 'the', 'proposed', 'caching', 'scheme', 'over', 'others', 'albeit', 'certain', 'tradeoffs']] | [-0.2382867374511149, -0.037126813787336274, -0.01811859915851728, 0.00991841958682846, -0.04557855918000524, -0.19781827256799892, 0.1847993085719901, 0.43090316046356825, -0.2461772929988341, -0.28101970973855733, 0.059373212834323785, -0.24333298189954444, -0.19515236946088926, 0.0648787537906933, -0.1166022465804817, 0.10273904505167873, 0.03390699963898981, -0.00481241974313769, -0.03281461086589843, -0.28640220183904724, 0.2980023102353808, 0.12469498150480482, 0.421466265620848, 0.047718821246954764, 0.060475079132919454, 0.050360742332106766, -0.034962825324248194, -0.010359923789600054, -0.12657344731737144, 0.10152553550190302, 0.35898838214867923, 0.26149433033520375, 0.24550447354072724, -0.42459915987737884, -0.23140140739589377, 0.027367750995096515, 0.16355555254187573, 0.03431380871724296, -0.07865672600506754, -0.27313032397324893, 0.14112973745124271, -0.2683167148555455, -0.03154026738695473, 0.010659439862797876, -0.0468593841126946, 0.0968525494476985, -0.33098850307658645, -0.05467199800525802, -0.04930296297978922, -0.031720899575253036, -0.08212519020410153, -0.16795320607271497, 0.027489582897972438, 0.15420938563881095, 0.023395636471232738, -0.022574512670481845, 0.12074637434005246, -0.12200716514728681, -0.11867670843807551, 0.4365476998705212, -0.01630393017062938, -0.24676363433936385, 0.12184456617131338, -0.03298320300989992, -0.1115885191714739, 0.13706437977296965, 0.2822746073028871, 0.10784888552542735, -0.18794474539418632, 0.02046003305976238, -0.049967836111925984, 0.15020802289830867, 0.13506969014837683, 0.15015808341750916, 0.1571270505625292, 0.2649951669743162, 0.17881047376687384, 0.13698189210589298, -0.13402864672141251, -0.154193757984603, -0.17901271403572716, -0.14022585424590744, -0.19349762198136566, -0.006858594968414783, -0.17539082609485146, -0.08060902497311542, 0.32666956347676096, 0.17641458039077326, 0.11200502035105703, 0.16715889771764453, 0.4144340112465076, 0.1108735156901805, 0.009959249869807736, 0.1670187739821683, 0.09829272674791614, 0.04862243262539198, 0.17382068814041993, -0.2303121863982057, 0.10470504100066047, 0.014061859857475201] |
1,802.10327 | Short intervals containing a prescribed number of primes | We prove that for every nonnegative integer $m$ there exists an
$\varepsilon>0$ such that if $\lambda\in (0,\varepsilon]$ and $x$ is
sufficiently large in terms of $m$, then the number of positive integers $n\leq
x$ for which the interval $[n,n+\lambda\log n]$ contains exactly $m$ primes is
at least a constant times $x/\log x.$ This improves a result of T. Freiberg,
when $\lambda$ is small.
| math.NT | we prove that for every nonnegative integer m there exists an varepsilon0 such that if lambdain 0varepsilon and x is sufficiently large in terms of m then the number of positive integers nleq x for which the interval nnlambdalog n contains exactly m primes is at least a constant times xlog x this improves a result of t freiberg when lambda is small | [['we', 'prove', 'that', 'for', 'every', 'nonnegative', 'integer', 'm', 'there', 'exists', 'an', 'varepsilon0', 'such', 'that', 'if', 'lambdain', '0varepsilon', 'and', 'x', 'is', 'sufficiently', 'large', 'in', 'terms', 'of', 'm', 'then', 'the', 'number', 'of', 'positive', 'integers', 'nleq', 'x', 'for', 'which', 'the', 'interval', 'nnlambdalog', 'n', 'contains', 'exactly', 'm', 'primes', 'is', 'at', 'least', 'a', 'constant', 'times', 'xlog', 'x', 'this', 'improves', 'a', 'result', 'of', 't', 'freiberg', 'when', 'lambda', 'is', 'small']] | [-0.27686281973916677, 0.18829804376230552, -0.012421579505767553, -0.005571717768156481, 0.023144940665412332, -0.2406342705381253, 0.019670360263497118, 0.3268153872941771, -0.25858204559453074, -0.22116153039819292, 0.06124680239759806, -0.3439062056281874, -0.09456769691314548, 0.16101237844991229, -0.050547403095650575, -0.03972052906699959, 0.054963273236588124, 0.14894838806902688, -0.04456587792975047, -0.3359412778950026, 0.28748566735415687, -0.131435003537204, 0.06687061369959865, 0.0787252290625005, 0.2013446351723565, -0.006734923069034854, 0.1057090736520026, 0.028751607984304428, -0.21341958483648224, -0.008008450310068926, 0.32134309485404483, 0.12402212200310803, 0.3359309835359454, -0.2784417941617111, -0.11105803590673473, 0.2613547741690831, 0.13054030155387497, -0.058852823745955025, 0.006377703566554814, -0.15328937908634543, 0.27492414565847045, -0.07976259228082434, -0.13630977372128156, -0.02464522468301678, 0.25981495856878256, 0.009674899373954583, -0.41153530557189255, 0.02109878445645013, 0.12764281925234583, 0.02843617057360168, 0.02879346887611093, -0.23934043160519533, -0.03568109571783533, 0.07117069712248555, 0.04090650737540977, 0.14868286668863748, -0.018808749527858208, -0.028091507805642794, -0.00978831585586792, 0.3077743656542753, -0.12812832344113098, -0.2010977541156594, 0.06965391240232895, -0.21686717056699337, -0.1805182125404357, 0.1657521506891616, 0.032918852378403946, 0.20495215047060722, 0.01758438463190443, 0.29251311645719164, -0.18070291760264925, 0.24287010516009985, 0.14781191201520064, -0.0030798502228853684, 0.10349714748501297, 0.10310699299143086, 0.17360101508036738, 0.0520462496506591, -0.02423255611962128, 0.10143625305124349, -0.40071100104720364, -0.1699243243633499, -0.26804814706256075, 0.2248389542613539, -0.1721077610721207, -0.14727757599264865, 0.21307008665415547, 0.05193273733264857, 0.24806951533161825, 0.13636054976039655, 0.19784395454353804, 0.09764805945357488, -0.011418194341052684, 0.1688759323479908, 0.013269757679212959, 0.08323137948830281, -0.008048490245616245, -0.13315407844680932, 0.015698024094285022, 0.12363941142816216] |
1,802.10328 | Neural Inverse Rendering for General Reflectance Photometric Stereo | We present a novel convolutional neural network architecture for photometric
stereo (Woodham, 1980), a problem of recovering 3D object surface normals from
multiple images observed under varying illuminations. Despite its long history
in computer vision, the problem still shows fundamental challenges for surfaces
with unknown general reflectance properties (BRDFs). Leveraging deep neural
networks to learn complicated reflectance models is promising, but studies in
this direction are very limited due to difficulties in acquiring accurate
ground truth for training and also in designing networks invariant to
permutation of input images. In order to address these challenges, we propose a
physics based unsupervised learning framework where surface normals and BRDFs
are predicted by the network and fed into the rendering equation to synthesize
observed images. The network weights are optimized during testing by minimizing
reconstruction loss between observed and synthesized images. Thus, our learning
process does not require ground truth normals or even pre-training on external
images. Our method is shown to achieve the state-of-the-art performance on a
challenging real-world scene benchmark.
| cs.CV cs.NE | we present a novel convolutional neural network architecture for photometric stereo woodham 1980 a problem of recovering 3d object surface normals from multiple images observed under varying illuminations despite its long history in computer vision the problem still shows fundamental challenges for surfaces with unknown general reflectance properties brdfs leveraging deep neural networks to learn complicated reflectance models is promising but studies in this direction are very limited due to difficulties in acquiring accurate ground truth for training and also in designing networks invariant to permutation of input images in order to address these challenges we propose a physics based unsupervised learning framework where surface normals and brdfs are predicted by the network and fed into the rendering equation to synthesize observed images the network weights are optimized during testing by minimizing reconstruction loss between observed and synthesized images thus our learning process does not require ground truth normals or even pretraining on external images our method is shown to achieve the stateoftheart performance on a challenging realworld scene benchmark | [['we', 'present', 'a', 'novel', 'convolutional', 'neural', 'network', 'architecture', 'for', 'photometric', 'stereo', 'woodham', '1980', 'a', 'problem', 'of', 'recovering', '3d', 'object', 'surface', 'normals', 'from', 'multiple', 'images', 'observed', 'under', 'varying', 'illuminations', 'despite', 'its', 'long', 'history', 'in', 'computer', 'vision', 'the', 'problem', 'still', 'shows', 'fundamental', 'challenges', 'for', 'surfaces', 'with', 'unknown', 'general', 'reflectance', 'properties', 'brdfs', 'leveraging', 'deep', 'neural', 'networks', 'to', 'learn', 'complicated', 'reflectance', 'models', 'is', 'promising', 'but', 'studies', 'in', 'this', 'direction', 'are', 'very', 'limited', 'due', 'to', 'difficulties', 'in', 'acquiring', 'accurate', 'ground', 'truth', 'for', 'training', 'and', 'also', 'in', 'designing', 'networks', 'invariant', 'to', 'permutation', 'of', 'input', 'images', 'in', 'order', 'to', 'address', 'these', 'challenges', 'we', 'propose', 'a', 'physics', 'based', 'unsupervised', 'learning', 'framework', 'where', 'surface', 'normals', 'and', 'brdfs', 'are', 'predicted', 'by', 'the', 'network', 'and', 'fed', 'into', 'the', 'rendering', 'equation', 'to', 'synthesize', 'observed', 'images', 'the', 'network', 'weights', 'are', 'optimized', 'during', 'testing', 'by', 'minimizing', 'reconstruction', 'loss', 'between', 'observed', 'and', 'synthesized', 'images', 'thus', 'our', 'learning', 'process', 'does', 'not', 'require', 'ground', 'truth', 'normals', 'or', 'even', 'pretraining', 'on', 'external', 'images', 'our', 'method', 'is', 'shown', 'to', 'achieve', 'the', 'stateoftheart', 'performance', 'on', 'a', 'challenging', 'realworld', 'scene', 'benchmark']] | [-0.03753272850774559, 0.013076421058014829, -0.0411313909874711, 0.0727139086533358, -0.11845295203397789, -0.19235309565814554, -0.0007361230845480452, 0.4972807068829618, -0.3002163649883849, -0.3836046841171895, 0.06943058558070161, -0.2291614029600599, -0.2120876517105495, 0.19133211167104894, -0.18924766886957298, 0.14435324075007702, 0.17429789751161925, -0.004594076276045932, -0.09770936903422534, -0.2733065505434908, 0.28735701651615503, 0.018886131632448996, 0.35147421416473856, 9.996141272613547e-05, 0.14930383286823948, -0.04449167068132899, -0.000474622752793001, -0.026572554355029834, -0.027862782478497845, 0.18145723524400081, 0.3220970004960971, 0.16000473435924073, 0.2802898639554059, -0.458048301401752, -0.27176034820442413, 0.08707467868328976, 0.12307300080253175, 0.10813142796261953, -0.06231237380192257, -0.3668052071496051, 0.08139655490257067, -0.07049210235537112, -0.006770565604361204, -0.13004776840125756, -0.029324535330751987, -0.05971626666809857, -0.29523110583964624, 0.048622829017619267, 0.037687718538986247, 0.09116310135670799, -0.09903298208652582, -0.11410882888353545, 0.010220269729058153, 0.17516201159630257, 0.02435118964230559, 0.07694997690540888, 0.1178832309728367, -0.23814755840056173, -0.0874297170012572, 0.37795245762605817, -0.019119111814166933, -0.1993982338748828, 0.19399230519844185, -0.04820475247054851, -0.1327926841751843, 0.13667960239287752, 0.23470107308615099, 0.1259305531340899, -0.1635868449877264, 0.006606224020557291, -0.034420265777576606, 0.16885467340133686, 0.06145530027067344, -0.014758624940678014, 0.23182839282806247, 0.25144375472731845, 0.0169997208217192, 0.1486696397641828, -0.18248402407618802, -0.03762968339318046, -0.16982712607435363, -0.06433303596356472, -0.23514131722164466, -0.000989779938041982, -0.05551204517912175, -0.15521026852004405, 0.38992172571384076, 0.23671886872654482, 0.22959501099960117, 0.11248557088406172, 0.3770750242935703, 0.0005812577909470354, 0.11007211483827621, 0.08888775434692187, 0.1971964363074867, 0.04085569109315791, 0.1153279302824983, -0.144617094953831, 0.12438831859669158, 0.039001372044895] |
1,802.10329 | Reconsidering Linear Transmit Signal Processing in 1-Bit Quantized
Multi-User MISO Systems | In this contribution, we investigate a coarsely quantized Multi-User
(MU)-Multiple Input Single Output (MISO) downlink communication system, where
we assume 1-Bit Digital-to-Analog Converters (DACs) at the Base Station (BS)
antennas. First, we analyze the achievable sum rate lower-bound using the
Bussgang decomposition. In the presence of the non-linear quanization, our
analysis indicates the potential merit of reconsidering traditional signal
processing techniques in coarsely quantized systems, i.e., reconsidering
transmit covariance matrices whose rank is equal to the rank of the channel.
Furthermore, in the second part of this paper, we propose a linear precoder
design which achieves the predicted increase in performance compared with a
state of the art linear precoder design. Moreover, our linear signal processing
algorithm allows for higher-order modulation schemes to be employed.
| cs.IT math.IT | in this contribution we investigate a coarsely quantized multiuser mumultiple input single output miso downlink communication system where we assume 1bit digitaltoanalog converters dacs at the base station bs antennas first we analyze the achievable sum rate lowerbound using the bussgang decomposition in the presence of the nonlinear quanization our analysis indicates the potential merit of reconsidering traditional signal processing techniques in coarsely quantized systems ie reconsidering transmit covariance matrices whose rank is equal to the rank of the channel furthermore in the second part of this paper we propose a linear precoder design which achieves the predicted increase in performance compared with a state of the art linear precoder design moreover our linear signal processing algorithm allows for higherorder modulation schemes to be employed | [['in', 'this', 'contribution', 'we', 'investigate', 'a', 'coarsely', 'quantized', 'multiuser', 'mumultiple', 'input', 'single', 'output', 'miso', 'downlink', 'communication', 'system', 'where', 'we', 'assume', '1bit', 'digitaltoanalog', 'converters', 'dacs', 'at', 'the', 'base', 'station', 'bs', 'antennas', 'first', 'we', 'analyze', 'the', 'achievable', 'sum', 'rate', 'lowerbound', 'using', 'the', 'bussgang', 'decomposition', 'in', 'the', 'presence', 'of', 'the', 'nonlinear', 'quanization', 'our', 'analysis', 'indicates', 'the', 'potential', 'merit', 'of', 'reconsidering', 'traditional', 'signal', 'processing', 'techniques', 'in', 'coarsely', 'quantized', 'systems', 'ie', 'reconsidering', 'transmit', 'covariance', 'matrices', 'whose', 'rank', 'is', 'equal', 'to', 'the', 'rank', 'of', 'the', 'channel', 'furthermore', 'in', 'the', 'second', 'part', 'of', 'this', 'paper', 'we', 'propose', 'a', 'linear', 'precoder', 'design', 'which', 'achieves', 'the', 'predicted', 'increase', 'in', 'performance', 'compared', 'with', 'a', 'state', 'of', 'the', 'art', 'linear', 'precoder', 'design', 'moreover', 'our', 'linear', 'signal', 'processing', 'algorithm', 'allows', 'for', 'higherorder', 'modulation', 'schemes', 'to', 'be', 'employed']] | [-0.2319581166470075, 0.0025681373568600028, -0.021199010782004372, -0.033723164133053665, -0.08159292628420745, -0.21860870115489253, 0.08901918746106993, 0.346120075617985, -0.28693714054922265, -0.23336081938984676, 0.0885483762012734, -0.2323195801204784, -0.2219207321437515, 0.12236526170442623, -0.12395211021374244, 0.07150137432040722, 0.04426374102420196, 0.06753281054533715, -0.094616611613097, -0.2688116133743064, 0.2772211099755231, 0.1155389634044311, 0.3766878982513719, -0.07340134677242457, 0.12119276698194141, 0.020496995440055805, -0.022740904945971037, -0.06341889036471039, -0.0626111982155561, 0.0922318850000336, 0.3505536538616913, 0.18506345928957066, 0.2582537060588356, -0.3898247657040876, -0.21134142430756636, 0.1084814007863463, 0.16241320964645564, 0.06774314119181467, -0.04436573506677448, -0.22483700667261866, 0.13583909976864006, -0.22829916129812478, 0.010593270739101298, 0.006806478385124507, -0.12970073676736252, 0.012835915828865717, -0.3729252422538896, 0.03808562831226282, 0.030565361178109075, 0.027496194599453752, -0.05657732875391129, -0.17580700097359506, 0.06050871302017836, 0.10590386975602042, -0.02525257251444992, -0.02960691175128265, 0.09145118110639051, -0.0612681315477362, -0.11529422471498466, 0.35447087338784844, -0.06279615771472151, -0.26534890589432986, 0.10244185903073644, -0.14162693800389525, -0.08818201620815079, 0.16398880049222853, 0.27349815538864797, 0.07660625956818173, -0.10976562833004608, 0.05039480393960678, 0.009171144904311352, 0.25883624316155307, 0.0733583471964954, 0.12553582659248658, 0.13619874145388905, 0.19662166590522218, 0.1107032905196453, 0.17868959868035272, -0.12941798216230765, -0.06119371121048897, -0.2429930256543363, -0.13298295835426788, -0.23282106689412177, 0.017670155615485236, -0.08873336152287155, -0.06336493796964245, 0.3876964565881384, 0.14228348498331095, 0.12881253457938632, 0.12470342077947093, 0.44965114147303914, 0.1554037402227816, 0.041780763295312544, 0.12422491254936147, 0.23572319755280993, 0.16972738573312518, 0.1289652804924531, -0.25633725904546323, -0.01221658279589279, 0.03802895352241538] |
1,802.1033 | Extreme-value copulas associated with the expected scaled maximum of
independent random variables | It is well-known that the expected scaled maximum of non-negative random
variables with unit mean defines a stable tail dependence function associated
with some extreme-value copula. In the special case when these random variables
are independent and identically distributed, min-stable multivariate
exponential random vectors with the associated survival extreme-value copulas
are shown to arise as finite-dimensional margins of an infinite exchangeable
sequence in the sense of De Finetti's Theorem. The associated latent factor is
a stochastic process which is strongly infinitely divisible with respect to
time, which induces a bijection from the set of distribution functions F of
non-negative random variables with finite mean to the set of L\'evy measures on
the positive half-axis. Since the Gumbel and the Galambos copula are the most
popular examples of this construction, the investigation of this bijection
contributes to a further understanding of their well-known analytical
similarities. Furthermore, a simulation algorithm based on the latent factor
representation is developed, if the support of F is bounded. Especially in
large dimensions, this algorithm is efficient because it makes use of the De
Finetti structure.
| stat.ME | it is wellknown that the expected scaled maximum of nonnegative random variables with unit mean defines a stable tail dependence function associated with some extremevalue copula in the special case when these random variables are independent and identically distributed minstable multivariate exponential random vectors with the associated survival extremevalue copulas are shown to arise as finitedimensional margins of an infinite exchangeable sequence in the sense of de finettis theorem the associated latent factor is a stochastic process which is strongly infinitely divisible with respect to time which induces a bijection from the set of distribution functions f of nonnegative random variables with finite mean to the set of levy measures on the positive halfaxis since the gumbel and the galambos copula are the most popular examples of this construction the investigation of this bijection contributes to a further understanding of their wellknown analytical similarities furthermore a simulation algorithm based on the latent factor representation is developed if the support of f is bounded especially in large dimensions this algorithm is efficient because it makes use of the de finetti structure | [['it', 'is', 'wellknown', 'that', 'the', 'expected', 'scaled', 'maximum', 'of', 'nonnegative', 'random', 'variables', 'with', 'unit', 'mean', 'defines', 'a', 'stable', 'tail', 'dependence', 'function', 'associated', 'with', 'some', 'extremevalue', 'copula', 'in', 'the', 'special', 'case', 'when', 'these', 'random', 'variables', 'are', 'independent', 'and', 'identically', 'distributed', 'minstable', 'multivariate', 'exponential', 'random', 'vectors', 'with', 'the', 'associated', 'survival', 'extremevalue', 'copulas', 'are', 'shown', 'to', 'arise', 'as', 'finitedimensional', 'margins', 'of', 'an', 'infinite', 'exchangeable', 'sequence', 'in', 'the', 'sense', 'of', 'de', 'finettis', 'theorem', 'the', 'associated', 'latent', 'factor', 'is', 'a', 'stochastic', 'process', 'which', 'is', 'strongly', 'infinitely', 'divisible', 'with', 'respect', 'to', 'time', 'which', 'induces', 'a', 'bijection', 'from', 'the', 'set', 'of', 'distribution', 'functions', 'f', 'of', 'nonnegative', 'random', 'variables', 'with', 'finite', 'mean', 'to', 'the', 'set', 'of', 'levy', 'measures', 'on', 'the', 'positive', 'halfaxis', 'since', 'the', 'gumbel', 'and', 'the', 'galambos', 'copula', 'are', 'the', 'most', 'popular', 'examples', 'of', 'this', 'construction', 'the', 'investigation', 'of', 'this', 'bijection', 'contributes', 'to', 'a', 'further', 'understanding', 'of', 'their', 'wellknown', 'analytical', 'similarities', 'furthermore', 'a', 'simulation', 'algorithm', 'based', 'on', 'the', 'latent', 'factor', 'representation', 'is', 'developed', 'if', 'the', 'support', 'of', 'f', 'is', 'bounded', 'especially', 'in', 'large', 'dimensions', 'this', 'algorithm', 'is', 'efficient', 'because', 'it', 'makes', 'use', 'of', 'the', 'de', 'finetti', 'structure']] | [-0.09860185428077678, 0.13482360985572645, -0.11917126898695429, 0.0819879428678513, -0.08794587483894933, -0.1351249806804702, 0.02063581351953033, 0.36451803745087963, -0.3044614822339714, -0.21670279257401417, 0.09510681306873058, -0.26823152397634387, -0.16724944817729545, 0.1577547549233673, -0.10266156891079921, 0.07094471706675792, 0.023106757460380566, 0.06652913565939948, -0.02752471348601159, -0.27374657698615595, 0.33218523974767133, 0.04424329226909403, 0.29214333314916857, -0.03355926588338971, 0.1406466222352572, 0.03133688859686102, -0.08751680745220322, -0.007813217617862717, -0.09383685777748983, 0.12751419185374618, 0.255216401549025, 0.12750412912042805, 0.32674006652737336, -0.3321423640620359, -0.1647552146728205, 0.1904668589148608, 0.11417884273664615, 0.00891756305767629, -0.0055436147858165, -0.26475834163743484, 0.070801255646989, -0.15018293648300038, -0.14503394786542276, -0.06420949916875604, 0.04532380686167565, 0.08650089162349826, -0.33886984401602327, 0.0917490877590907, 0.125535061885993, 0.023665395804665274, -0.023153731819273455, -0.1619148619821576, -0.014685800178080547, 0.0489645943004318, 0.08752615979528601, 0.04359285083700846, 0.10099988533756253, -0.07363045804186948, -0.10489994132508883, 0.3019828218030197, -0.0489034681820295, -0.2541037680745104, 0.17532020633098508, -0.16497077844391822, -0.16054402175489502, 0.11926574613339679, 0.15106107610962016, 0.11453091629583118, -0.13190929199006035, 0.1492060697644002, -0.08884683411110546, 0.11698610375130643, 0.0660120622130038, -0.0058998175488275025, 0.161292310619425, 0.11383199099029867, 0.1022533818444643, 0.16301704718674112, -0.03084971626417961, -0.16213807473531483, -0.3079922026343248, -0.13179051125953467, -0.2375237570429096, 0.06681998083029754, -0.18398185597986955, -0.2716943462430981, 0.3620886929416457, 0.11991314034565617, 0.20881033996796475, 0.1317673172637841, 0.20887198773285573, 0.1585950162582029, 0.011768495956664729, 0.07531489879776582, 0.0741879722858225, 0.1926357338319444, 0.021276187526280653, -0.1341477639091269, 0.12988267190931313, 0.06652354338756235] |
1,802.10331 | Capturing Logarithmic Space and Polynomial Time on Chordal Claw-Free
Graphs | We show that the class of chordal claw-free graphs admits LREC$_=$-definable
canonization. LREC$_=$ is a logic that extends first-order logic with counting
by an operator that allows it to formalize a limited form of recursion. This
operator can be evaluated in logarithmic space. It follows that there exists a
logarithmic-space canonization algorithm, and therefore a logarithmic-space
isomorphism test, for the class of chordal claw-free graphs. As a further
consequence, LREC$_=$ captures logarithmic space on this graph class. Since
LREC$_=$ is contained in fixed-point logic with counting, we also obtain that
fixed-point logic with counting captures polynomial time on the class of
chordal claw-free graphs.
| cs.LO cs.DM | we show that the class of chordal clawfree graphs admits lrec_definable canonization lrec_ is a logic that extends firstorder logic with counting by an operator that allows it to formalize a limited form of recursion this operator can be evaluated in logarithmic space it follows that there exists a logarithmicspace canonization algorithm and therefore a logarithmicspace isomorphism test for the class of chordal clawfree graphs as a further consequence lrec_ captures logarithmic space on this graph class since lrec_ is contained in fixedpoint logic with counting we also obtain that fixedpoint logic with counting captures polynomial time on the class of chordal clawfree graphs | [['we', 'show', 'that', 'the', 'class', 'of', 'chordal', 'clawfree', 'graphs', 'admits', 'lrec_definable', 'canonization', 'lrec_', 'is', 'a', 'logic', 'that', 'extends', 'firstorder', 'logic', 'with', 'counting', 'by', 'an', 'operator', 'that', 'allows', 'it', 'to', 'formalize', 'a', 'limited', 'form', 'of', 'recursion', 'this', 'operator', 'can', 'be', 'evaluated', 'in', 'logarithmic', 'space', 'it', 'follows', 'that', 'there', 'exists', 'a', 'logarithmicspace', 'canonization', 'algorithm', 'and', 'therefore', 'a', 'logarithmicspace', 'isomorphism', 'test', 'for', 'the', 'class', 'of', 'chordal', 'clawfree', 'graphs', 'as', 'a', 'further', 'consequence', 'lrec_', 'captures', 'logarithmic', 'space', 'on', 'this', 'graph', 'class', 'since', 'lrec_', 'is', 'contained', 'in', 'fixedpoint', 'logic', 'with', 'counting', 'we', 'also', 'obtain', 'that', 'fixedpoint', 'logic', 'with', 'counting', 'captures', 'polynomial', 'time', 'on', 'the', 'class', 'of', 'chordal', 'clawfree', 'graphs']] | [-0.13993244263732318, 0.044082575344431975, -0.06987492474320445, 0.11206698101194738, -0.18388672097070705, -0.1743752368255654, 0.03859583037799152, 0.38165590022374124, -0.317208055370641, -0.2766449947714878, 0.08193085771913017, -0.24068165228951346, -0.18249666538921375, 0.19273469929393489, -0.1419890435701869, 0.05087260014458912, 0.09278452370849266, 0.08061463645324835, -0.023474205274008286, -0.23557526868393924, 0.31447678763934783, -0.052630161613370606, 0.16765287655939176, 0.0818945302275344, 0.12590808794806593, 0.04487919760867953, 0.04794748089032121, 0.11180641861390593, -0.126436477761619, 0.07698929039490165, 0.32940776687730283, 0.22320382328685914, 0.2497042324800876, -0.3461865725863761, -0.1421956661455695, 0.20997288027434674, 0.10686604934518487, 0.04512561102244027, 0.006943509102464445, -0.2216837493503846, 0.10772409564951091, -0.14076209476995236, -0.07180462232384, -0.11245103544799738, 0.07812497081253135, -0.014886023060789386, -0.2589795517744225, -0.030212892701191537, 0.2083633060847382, 0.005830169900645981, 0.07452761256802845, -0.02758213095095696, 0.00807781873307037, 0.01651756016501379, -0.11263153149104378, 0.0736899607909789, 0.030782261176161396, -0.0733076227349636, -0.23625316400334095, 0.3462738579193365, -0.0528133503360294, -0.17696531158103382, 0.08185951637773259, -0.12060360520517507, -0.2677398749618131, 0.10354543935724543, 0.060534658682989226, 0.19533246029530046, -0.0977167217241763, 0.20948807638335196, -0.14978155337310242, 0.20004199850779858, 0.13572129609009015, 0.025057117594858107, 0.07485326636781536, 0.18949486785432668, 0.15491359566962257, 0.2232089076356203, 0.06540339193261653, -0.0839858515712532, -0.3288865797583339, -0.13037237082834094, -0.18888610192728275, 0.05704422867450031, -0.16150455866718227, -0.24854632973381616, 0.40066451526662894, 0.12593724737644593, 0.12354867719113827, 0.2459780661371148, 0.20828326570335776, 0.13239643627718922, 0.09516953839694411, 0.1479034915439857, 0.12707363819540704, 0.1762925178395783, 0.024856910227065526, -0.1528238386313603, 0.10392410384753303, 0.18209782843613653] |
1,802.10332 | Theoretical basis of the diagonal scan method for determining the laser
ablation threshold for femtosecond vortex pulses | In femtosecond laser micromachining, the ablation threshold is a key
processing parameter that characterises the energy density required to cause
ablation. Current techniques for measuring the ablation threshold such as the
diameter regression and diagonal scan methods are based on the assumption of a
Gaussian spatial profile, however no techniques currently exist for measuring
the ablation threshold using a non-Gaussian beam shape. Here we present a
formalism of the diagonal scan method for determining the ablation threshold
and pulse superposition for femtosecond vortex pulses. To the authors'
knowledge this is the first ablation threshold technique developed for pulses
with non-Gaussian spatial profiles. Using this method, the ablation threshold
can be calculated using measurement of a single feature (the maximum damage
radius $\rho_{max}$), which allows investigations of ablation threshold and
incubation effects to be carried out quickly and easily. Extending this method
to non-Gaussian beams will allow exploration of new avenues of research,
enabling characterisation of the ablation threshold and incubation behaviour
for a material when ablated with femtosecond vortex pulses.
| physics.optics cond-mat.mtrl-sci | in femtosecond laser micromachining the ablation threshold is a key processing parameter that characterises the energy density required to cause ablation current techniques for measuring the ablation threshold such as the diameter regression and diagonal scan methods are based on the assumption of a gaussian spatial profile however no techniques currently exist for measuring the ablation threshold using a nongaussian beam shape here we present a formalism of the diagonal scan method for determining the ablation threshold and pulse superposition for femtosecond vortex pulses to the authors knowledge this is the first ablation threshold technique developed for pulses with nongaussian spatial profiles using this method the ablation threshold can be calculated using measurement of a single feature the maximum damage radius rho_max which allows investigations of ablation threshold and incubation effects to be carried out quickly and easily extending this method to nongaussian beams will allow exploration of new avenues of research enabling characterisation of the ablation threshold and incubation behaviour for a material when ablated with femtosecond vortex pulses | [['in', 'femtosecond', 'laser', 'micromachining', 'the', 'ablation', 'threshold', 'is', 'a', 'key', 'processing', 'parameter', 'that', 'characterises', 'the', 'energy', 'density', 'required', 'to', 'cause', 'ablation', 'current', 'techniques', 'for', 'measuring', 'the', 'ablation', 'threshold', 'such', 'as', 'the', 'diameter', 'regression', 'and', 'diagonal', 'scan', 'methods', 'are', 'based', 'on', 'the', 'assumption', 'of', 'a', 'gaussian', 'spatial', 'profile', 'however', 'no', 'techniques', 'currently', 'exist', 'for', 'measuring', 'the', 'ablation', 'threshold', 'using', 'a', 'nongaussian', 'beam', 'shape', 'here', 'we', 'present', 'a', 'formalism', 'of', 'the', 'diagonal', 'scan', 'method', 'for', 'determining', 'the', 'ablation', 'threshold', 'and', 'pulse', 'superposition', 'for', 'femtosecond', 'vortex', 'pulses', 'to', 'the', 'authors', 'knowledge', 'this', 'is', 'the', 'first', 'ablation', 'threshold', 'technique', 'developed', 'for', 'pulses', 'with', 'nongaussian', 'spatial', 'profiles', 'using', 'this', 'method', 'the', 'ablation', 'threshold', 'can', 'be', 'calculated', 'using', 'measurement', 'of', 'a', 'single', 'feature', 'the', 'maximum', 'damage', 'radius', 'rho_max', 'which', 'allows', 'investigations', 'of', 'ablation', 'threshold', 'and', 'incubation', 'effects', 'to', 'be', 'carried', 'out', 'quickly', 'and', 'easily', 'extending', 'this', 'method', 'to', 'nongaussian', 'beams', 'will', 'allow', 'exploration', 'of', 'new', 'avenues', 'of', 'research', 'enabling', 'characterisation', 'of', 'the', 'ablation', 'threshold', 'and', 'incubation', 'behaviour', 'for', 'a', 'material', 'when', 'ablated', 'with', 'femtosecond', 'vortex', 'pulses']] | [-0.04386244657285073, 0.1595763895770206, -0.1369870884480941, 0.02759750913417734, -0.04079765037578695, -0.13599108373746277, 0.05932438204694977, 0.4559891628211035, -0.2314188640235978, -0.3043623468455146, 0.0846282321452985, -0.23101972174729726, -0.08169532854876974, 0.23746939724420799, 0.0036589185460744536, 0.15187142182976993, 0.04153013176176447, -0.03403583600267987, -0.0443789665142129, -0.16915283061920064, 0.2899955115746707, 0.11440615304882693, 0.3163744718904662, 0.09305916605791187, 0.0877917199395597, -0.008319085528252317, 0.0023156503324999527, -0.033490286383996995, -0.16884554929039203, 0.08447683077215248, 0.22353743088349481, 0.11336919026695849, 0.3093893188490149, -0.4192428005749688, -0.2948866061592365, 0.07618355281541453, 0.14156839082716033, 0.14248395972433225, -0.08255115595495548, -0.2643625891856466, 0.05712524556335719, -0.15485255794371958, -0.14487651892773368, -0.051457031597109404, 0.005812736165791969, 0.08391046144328464, -0.32016415333594467, 0.040238312111400505, 0.055759441679658586, 0.06847237788811873, -0.01850271334303269, -0.061675550372285004, 0.018178982454735565, 0.05894277237359133, 0.004138490664498771, 0.0333173159893383, 0.23082456371253904, -0.13365158626316664, -0.05769677662345416, 0.3237661796786329, -0.059998879806302925, -0.11858142713523086, 0.12278500316657728, -0.14298619019853717, -0.062430705209536586, 0.20462473761838149, 0.14980376466752632, 0.16706558110137634, -0.13742682287265778, -0.06215365536216482, 0.03614528757684371, 0.23465213070431834, 0.17277132691267658, -0.0036963443826500547, 0.18721443913767444, 0.2461265756159692, 0.052229332830756904, 0.17747484092354118, -0.16991378068239155, -0.026418415311833515, -0.29120055936715183, -0.0869316017952181, -0.15692368109765298, 0.023466646509683307, -0.028233569216322127, -0.14511539199499085, 0.4325657535399146, 0.1701721078250557, 0.12826754448846367, -0.0004983816083575435, 0.33113954059012674, 0.11216239869416526, 0.06020662741571227, 0.0046268285375417155, 0.23330504833035828, 0.13602794599171508, 0.0716103378957247, -0.22677543171619832, 0.0983891706667183, 0.007649491621893557] |
1,802.10333 | Dispersion Properties of Explicit Finite Element Methods for Wave
Propagation Modelling on Tetrahedral Meshes | We analyse the dispersion properties of two types of explicit finite element
methods for modelling acoustic and elastic wave propagation on tetrahedral
meshes, namely mass-lumped finite element methods and symmetric interior
penalty discontinuous Galerkin methods, both combined with a suitable
Lax--Wendroff time integration scheme. The dispersion properties are obtained
semi-analytically using standard Fourier analysis. Based on the dispersion
analysis, we give an indication of which method is the most efficient for a
given accuracy, how many elements per wavelength are required for a given
accuracy, and how sensitive the accuracy of the method is to poorly shaped
elements.
| math.NA | we analyse the dispersion properties of two types of explicit finite element methods for modelling acoustic and elastic wave propagation on tetrahedral meshes namely masslumped finite element methods and symmetric interior penalty discontinuous galerkin methods both combined with a suitable laxwendroff time integration scheme the dispersion properties are obtained semianalytically using standard fourier analysis based on the dispersion analysis we give an indication of which method is the most efficient for a given accuracy how many elements per wavelength are required for a given accuracy and how sensitive the accuracy of the method is to poorly shaped elements | [['we', 'analyse', 'the', 'dispersion', 'properties', 'of', 'two', 'types', 'of', 'explicit', 'finite', 'element', 'methods', 'for', 'modelling', 'acoustic', 'and', 'elastic', 'wave', 'propagation', 'on', 'tetrahedral', 'meshes', 'namely', 'masslumped', 'finite', 'element', 'methods', 'and', 'symmetric', 'interior', 'penalty', 'discontinuous', 'galerkin', 'methods', 'both', 'combined', 'with', 'a', 'suitable', 'laxwendroff', 'time', 'integration', 'scheme', 'the', 'dispersion', 'properties', 'are', 'obtained', 'semianalytically', 'using', 'standard', 'fourier', 'analysis', 'based', 'on', 'the', 'dispersion', 'analysis', 'we', 'give', 'an', 'indication', 'of', 'which', 'method', 'is', 'the', 'most', 'efficient', 'for', 'a', 'given', 'accuracy', 'how', 'many', 'elements', 'per', 'wavelength', 'are', 'required', 'for', 'a', 'given', 'accuracy', 'and', 'how', 'sensitive', 'the', 'accuracy', 'of', 'the', 'method', 'is', 'to', 'poorly', 'shaped', 'elements']] | [-0.09124838228204421, 0.03371754231312127, -0.10646872764111173, 0.05221786096511523, -0.10044264373350509, -0.10270356915758125, 0.020292710805102726, 0.4465608356558547, -0.2592130579893021, -0.2565682063601455, 0.12470866260190057, -0.2528958857601166, -0.11417959311178752, 0.22852568518446417, -0.01738803458343051, 0.09449493437316459, 0.07929789552738895, -0.009266197282288755, -0.13237867251333155, -0.20288164280735108, 0.28926655822148434, 0.01660169042380793, 0.3000520466190136, 0.017829048437807634, 0.12855835909461033, -0.02345666544017743, -0.06754203107474106, 0.05399585141900128, -0.11075305395607589, 0.16056875789262431, 0.2323076620351105, 0.0612327163660072, 0.2585276536054301, -0.419980718887278, -0.23353075765890582, 0.06055300845289413, 0.13929438881328976, 0.11588639358643024, -0.09206854470539838, -0.23626750279978223, 0.09403804198325592, -0.14758019852547014, -0.16008269589166252, -0.10546760328532177, -0.008149790282988427, 0.07399877885829334, -0.2875583492865672, 0.10220866085372257, 0.005066855292653247, 0.08596879069940472, -0.04812209817523859, -0.14489550717479113, -0.002546914674968896, 0.10396945345386559, -0.025517904470503634, -0.051044478361513844, 0.05227900958472711, -0.037852119043830554, -0.05684992766520959, 0.42961925266747725, -0.08040715606731115, -0.2710758212725727, 0.18705748268925793, -0.08143504331813774, -0.07733941777628295, 0.15749548827963217, 0.20654703793115914, 0.17059455075472288, -0.09818712265672619, 0.06837122007189984, 0.03934467617527473, 0.2133269234695852, 0.06587909130683663, 0.02510211950320066, 0.11462333188297189, 0.1983944127165085, 0.04691210050760692, 0.04959476904525441, -0.10660295452143313, -0.049397817988670906, -0.3183146476631566, -0.13528419043678713, -0.1687721762407039, -0.05969441313090454, -0.1606021542525292, -0.23170498663521544, 0.38650397289013794, 0.13746864761092834, 0.12033330406803562, 0.03282356337164244, 0.33540837535140466, 0.1388663398957222, 0.03621604132622822, 0.0820021162246715, 0.19316949737638386, 0.15629021894680906, 0.0535210992817824, -0.25986927509193825, 0.052490796627742906, 0.18126345379278064] |
1,802.10334 | Screened Coulomb Hybrid Density Functional Investigation of Oxygen Point
Defects on ZnO Nanowires | In this study, oxygen vacancies and adatoms have been considered on the
surface of both hexagonal and triangular ZnO nanowires. Their effect on the
electronic structure and optical spectra of the nanowires have been
investigated using the exact exchange hybrid density functional theory
calculations. A surface oxygen vacancy gives rise to appearance of a band gap
state at almost 0.7 eV above the valence band of the both types of the
nanowires while an oxygen adatom show bulk-like electronic properties. A shape
dependence is also indicated by the calculated physical quantities of oxygen
related point defects on ZnO nanowires.
| cond-mat.str-el cond-mat.mes-hall | in this study oxygen vacancies and adatoms have been considered on the surface of both hexagonal and triangular zno nanowires their effect on the electronic structure and optical spectra of the nanowires have been investigated using the exact exchange hybrid density functional theory calculations a surface oxygen vacancy gives rise to appearance of a band gap state at almost 07 ev above the valence band of the both types of the nanowires while an oxygen adatom show bulklike electronic properties a shape dependence is also indicated by the calculated physical quantities of oxygen related point defects on zno nanowires | [['in', 'this', 'study', 'oxygen', 'vacancies', 'and', 'adatoms', 'have', 'been', 'considered', 'on', 'the', 'surface', 'of', 'both', 'hexagonal', 'and', 'triangular', 'zno', 'nanowires', 'their', 'effect', 'on', 'the', 'electronic', 'structure', 'and', 'optical', 'spectra', 'of', 'the', 'nanowires', 'have', 'been', 'investigated', 'using', 'the', 'exact', 'exchange', 'hybrid', 'density', 'functional', 'theory', 'calculations', 'a', 'surface', 'oxygen', 'vacancy', 'gives', 'rise', 'to', 'appearance', 'of', 'a', 'band', 'gap', 'state', 'at', 'almost', '07', 'ev', 'above', 'the', 'valence', 'band', 'of', 'the', 'both', 'types', 'of', 'the', 'nanowires', 'while', 'an', 'oxygen', 'adatom', 'show', 'bulklike', 'electronic', 'properties', 'a', 'shape', 'dependence', 'is', 'also', 'indicated', 'by', 'the', 'calculated', 'physical', 'quantities', 'of', 'oxygen', 'related', 'point', 'defects', 'on', 'zno', 'nanowires']] | [-0.09868177159623516, 0.13680202655292545, -0.019275841134761624, 0.03778660539543548, 0.06394804048944604, -0.08239553870887241, 0.12081931450408931, 0.48758607393488135, -0.23324822330602793, -0.3312959385414918, -0.009799765245377491, -0.35525965514696306, -0.10981900513294444, 0.11591135400272153, 0.062117649900792826, 0.012537778383403114, 0.011230460410429672, -0.06957350439401437, -0.1375504205135083, -0.2108689908366274, 0.277744028293951, 0.07541711312351805, 0.36077882221551855, 0.17954300021790345, -0.011153875285703125, -0.021319960662624753, 0.10342849318333196, 0.02493676431288924, -0.19571416228162972, 0.11505924035428149, 0.22006724760491364, -0.16995477115349125, 0.17931403329059709, -0.513236752584238, -0.22589096425082347, -0.044784035152671015, 0.12378032302314584, 0.1570106775034219, -0.10729281452714907, -0.26553642783652653, 0.08329131891198381, -0.09723511362692924, -0.10902280041905628, -0.034368192682964635, -0.01937027509804025, 0.005380917022432756, -0.17377314121389498, 0.07851117113905, 0.031714741368731016, 0.11600219625019824, -0.16254479885853904, -0.18639110438901968, -0.1996468769649815, 0.046167100887896134, 0.030050716092433743, -0.019490526643384135, 0.23664371842386747, -0.04894844686019827, -0.10140978965927104, 0.3826491754934794, -0.025918126755365818, -0.08021837724090526, 0.14350045832212677, -0.14495484109949133, -0.07656593172048981, 0.1900191864920686, 0.10477820892037466, 0.11022060694680973, -0.15586186944732838, 0.13692428393000172, 0.006249857910043287, 0.19346029983952198, 0.09085806227768913, 0.12511138319781032, 0.2515050254743358, 0.19116662123776745, 0.06545587898598927, 0.08155509426888793, -0.1388831799861627, -0.010102125477384438, -0.14937733371525702, -0.19065329636978645, -0.22947166035083508, 0.05452911742031574, -0.09203778001238154, -0.2626781870065389, 0.4303162448446859, 0.03676032220399139, 0.17561381177111257, -0.09971170710644336, 0.15469768507914108, 0.10065933775551843, 0.06263038429262285, -0.007221800326887105, 0.2403979782447821, 0.2127788416556826, 0.09163556532285204, -0.3018072008301099, 0.1103216888608806, 0.010773781783446068] |
1,802.10335 | Bright electroluminescence from single graphene nanoribbon junctions | Thanks to their highly tunable band gaps, graphene nanoribbons (GNRs) with
atomically precise edges are emerging as mechanically and chemically robust
candidates for nanoscale light emitting devices of modulable emission color.
While their optical properties have been addressed theoretically in depth, only
few experimental studies exist, limited to ensemble measurements and without
any attempt to integrate them in an electronic-like circuit. Here we report on
the electroluminescence of individual GNRs suspended between the tip of a
scanning tunneling microscope (STM) and a Au(111) substrate, constituting thus
a realistic opto-electronic circuit. Emission spectra of such GNR junctions
reveal a bright and narrow band emission of red light, whose energy can be
tuned with the bias voltage applied to the junction, but always lying below the
gap of infinite GNRs. Comparison with {\it ab initio} calculations indicate
that the emission involves electronic states localized at the GNR termini. Our
results shed light on unpredicted optical transitions in GNRs and provide a
promising route for the realization of bright, robust and controllable
graphene-based light emitting devices.
| cond-mat.mes-hall cond-mat.mtrl-sci | thanks to their highly tunable band gaps graphene nanoribbons gnrs with atomically precise edges are emerging as mechanically and chemically robust candidates for nanoscale light emitting devices of modulable emission color while their optical properties have been addressed theoretically in depth only few experimental studies exist limited to ensemble measurements and without any attempt to integrate them in an electroniclike circuit here we report on the electroluminescence of individual gnrs suspended between the tip of a scanning tunneling microscope stm and a au111 substrate constituting thus a realistic optoelectronic circuit emission spectra of such gnr junctions reveal a bright and narrow band emission of red light whose energy can be tuned with the bias voltage applied to the junction but always lying below the gap of infinite gnrs comparison with it ab initio calculations indicate that the emission involves electronic states localized at the gnr termini our results shed light on unpredicted optical transitions in gnrs and provide a promising route for the realization of bright robust and controllable graphenebased light emitting devices | [['thanks', 'to', 'their', 'highly', 'tunable', 'band', 'gaps', 'graphene', 'nanoribbons', 'gnrs', 'with', 'atomically', 'precise', 'edges', 'are', 'emerging', 'as', 'mechanically', 'and', 'chemically', 'robust', 'candidates', 'for', 'nanoscale', 'light', 'emitting', 'devices', 'of', 'modulable', 'emission', 'color', 'while', 'their', 'optical', 'properties', 'have', 'been', 'addressed', 'theoretically', 'in', 'depth', 'only', 'few', 'experimental', 'studies', 'exist', 'limited', 'to', 'ensemble', 'measurements', 'and', 'without', 'any', 'attempt', 'to', 'integrate', 'them', 'in', 'an', 'electroniclike', 'circuit', 'here', 'we', 'report', 'on', 'the', 'electroluminescence', 'of', 'individual', 'gnrs', 'suspended', 'between', 'the', 'tip', 'of', 'a', 'scanning', 'tunneling', 'microscope', 'stm', 'and', 'a', 'au111', 'substrate', 'constituting', 'thus', 'a', 'realistic', 'optoelectronic', 'circuit', 'emission', 'spectra', 'of', 'such', 'gnr', 'junctions', 'reveal', 'a', 'bright', 'and', 'narrow', 'band', 'emission', 'of', 'red', 'light', 'whose', 'energy', 'can', 'be', 'tuned', 'with', 'the', 'bias', 'voltage', 'applied', 'to', 'the', 'junction', 'but', 'always', 'lying', 'below', 'the', 'gap', 'of', 'infinite', 'gnrs', 'comparison', 'with', 'it', 'ab', 'initio', 'calculations', 'indicate', 'that', 'the', 'emission', 'involves', 'electronic', 'states', 'localized', 'at', 'the', 'gnr', 'termini', 'our', 'results', 'shed', 'light', 'on', 'unpredicted', 'optical', 'transitions', 'in', 'gnrs', 'and', 'provide', 'a', 'promising', 'route', 'for', 'the', 'realization', 'of', 'bright', 'robust', 'and', 'controllable', 'graphenebased', 'light', 'emitting', 'devices']] | [-0.14007821869305442, 0.1320842126396053, -0.062108255297400404, -0.00902598983300904, -0.04677830271552815, -0.2577366401620079, 0.12267381023834893, 0.5498302821936303, -0.23183060289349752, -0.3389243518738726, -0.0072722168995316555, -0.3198641511384224, -0.11548433370000227, 0.22668865287194548, 0.01453077781750539, 0.06615053095582732, 0.06534534000499218, -0.15096642021993364, -0.007105035381120911, -0.1538104609564555, 0.214466018638801, 0.025999270225563736, 0.3052779462128921, 0.12620537131645737, 0.02421643878712297, -0.04424439881201346, 0.08555774744004445, 0.0012176824567113938, -0.13415901030591984, 0.1287089572758495, 0.26881327305573205, -0.11274317388969668, 0.19468203640196385, -0.5125894545534149, -0.21991132324301574, 0.009576271940944892, 0.17881731512187438, 0.1451512048153618, -0.09430979173644012, -0.30641954144744504, 0.07607433026410142, -0.05059471060819707, -0.11781937870190906, -0.05323255525327959, 0.003033476383533589, 0.022968291276240137, -0.1596386579628817, 0.024483718327585023, -0.021347699101424103, 0.06150207743362549, -0.05806101068294591, -0.10164561389565067, -0.08334981827579742, 0.05853398811890403, -0.04609030628574167, -0.010651157064320044, 0.25710074688161744, -0.12302374496728716, -0.10972020000241003, 0.3572245418787176, -0.030985053102106808, -0.038597515462708204, 0.15679506699522133, -0.15046077384613454, -0.0554486705764565, 0.1664259014542886, 0.07844498609212974, 0.12148359450403341, -0.15310941526475416, 0.02211053385521112, 0.0016600744484728852, 0.18375006509500794, 0.0788739289070458, 0.1876548470815557, 0.32102362066778073, 0.2229602088458663, 0.04969779892180245, 0.11221720894045997, -0.15359473324717202, 0.02872112016112349, -0.21200588144643537, -0.15640638368529117, -0.21581182005100472, 0.10571004364769472, -0.029977297667057937, -0.22525954039951482, 0.44812953997901533, 0.14261500230248542, 0.18513549435179855, -0.01919884998946949, 0.3082648776579908, 0.08181159955474446, 0.09926283938084664, -0.004103104245502415, 0.27854583476843353, 0.17100956319116575, 0.07929621474562906, -0.24970856376315825, 0.051916541698859835, -0.1123339446683869] |
1,802.10336 | The Prasad conjectures for $\mathrm{GSp_4}$ and $\mathrm{PGSp_4}$ | In this paper, we use the theta correspondence between $\mathrm{GSp_4}$ and
$\mathrm{GO(V)}$ to discuss the $\mathrm{GSp_4}$-distinction problems over a
quadratic field extension $E/F.$ With a similar strategy, we study the period
for the pair $(\mathrm{GSp_4(E)},\mathrm{GSp_{1,1}(F)}),$ where
$\mathrm{GSp_{1,1}}$ is the unique inner form of $\mathrm{GSp_4}.$ Then we
verify the Prasad conjecture for $\mathrm{PGSp_4(E)}$.
| math.RT | in this paper we use the theta correspondence between mathrmgsp_4 and mathrmgov to discuss the mathrmgsp_4distinction problems over a quadratic field extension ef with a similar strategy we study the period for the pair mathrmgsp_4emathrmgsp_11f where mathrmgsp_11 is the unique inner form of mathrmgsp_4 then we verify the prasad conjecture for mathrmpgsp_4e | [['in', 'this', 'paper', 'we', 'use', 'the', 'theta', 'correspondence', 'between', 'mathrmgsp_4', 'and', 'mathrmgov', 'to', 'discuss', 'the', 'mathrmgsp_4distinction', 'problems', 'over', 'a', 'quadratic', 'field', 'extension', 'ef', 'with', 'a', 'similar', 'strategy', 'we', 'study', 'the', 'period', 'for', 'the', 'pair', 'mathrmgsp_4emathrmgsp_11f', 'where', 'mathrmgsp_11', 'is', 'the', 'unique', 'inner', 'form', 'of', 'mathrmgsp_4', 'then', 'we', 'verify', 'the', 'prasad', 'conjecture', 'for', 'mathrmpgsp_4e']] | [-0.1512949191866086, 0.017124293679173324, -0.11508330437255666, 0.062089125962650524, -0.08236199089801534, -0.0930823651439649, 0.02780312936049589, 0.3476911414652429, -0.3117245110742589, -0.25082631621192747, 0.08059536697011084, -0.22697947480953595, -0.2098750184349557, 0.21369052622863588, -0.06605263850453527, -0.01651876656576357, 0.014507365824179129, 0.07664491559200465, -0.0996801139232009, -0.24826113689453044, 0.3727181398488106, -0.015464413118489246, 0.1795550274682489, 0.07264877927113086, 0.08168693010675464, 0.06874196100583736, 0.021926592031686985, -0.006238993713037765, -0.17659293019034444, 0.1483287618872016, 0.23950725362358732, 0.09222761583217282, 0.27172683797618175, -0.3546548935366755, -0.11111565049678246, 0.16337401744850139, 0.08550972261644424, 0.04920682266968837, -0.03690910083737145, -0.2278510481119156, 0.14688572982336057, -0.1862985058984858, -0.1555722352473977, -0.019921666427337108, 0.033399239214672215, -0.018929639865862245, -0.30577492485060653, 0.029998124418582055, 0.06567558812651228, 0.0936475586978362, -0.09932710485968818, -0.05434844024637912, 0.03643441295370142, 0.07711468172969267, 0.07457782743756283, 0.06382236619321431, -0.007736673033697174, -0.12083624859657535, -0.10787028630085765, 0.321895125857059, -0.10340623797333622, -0.1675744558426928, 0.156321382496823, -0.15375994607568422, -0.14063164569992334, 0.03204807819441912, 0.162978909156741, 0.14151060478167332, -0.08163530631189017, 0.1497495297250893, -0.15246145589713087, 0.1182199636117575, 0.10744679336772954, -0.029377009105333623, 0.19955428142813927, 0.09321807661747679, 0.07383904762149966, 0.18705976183744186, -0.08467887246862371, -0.0857886921916593, -0.34136258691866345, -0.25899408725982015, -0.10463018348797205, 0.026631938360453127, -0.026744317411670483, -0.11942782655279054, 0.422897662348213, 0.12730234110866614, 0.2221483411069246, 0.10879099489922853, 0.22652893695742526, 0.1279349156439879, 0.015247211939261414, 0.08919421021648227, 0.18996061214761056, 0.1721994044814021, 0.02231241765362706, -0.21545766333633282, -0.021240925683857912, 0.08434798174161226] |
1,802.10337 | Noetherianity up to conjugation of locally diagonal inverse limits | We prove that the inverse limit of the sequence dual to a sequence of Lie
algebras is Noetherian up to the action of the direct limit of the
corresponding sequence of classical algebraic groups when the sequence of
groups consists of diagonal embeddings. We also classify all conjugation-stable
closed subsets of the space of $\mathbb{N}\times\mathbb{N}$ matrices.
| math.AG math.RT | we prove that the inverse limit of the sequence dual to a sequence of lie algebras is noetherian up to the action of the direct limit of the corresponding sequence of classical algebraic groups when the sequence of groups consists of diagonal embeddings we also classify all conjugationstable closed subsets of the space of mathbbntimesmathbbn matrices | [['we', 'prove', 'that', 'the', 'inverse', 'limit', 'of', 'the', 'sequence', 'dual', 'to', 'a', 'sequence', 'of', 'lie', 'algebras', 'is', 'noetherian', 'up', 'to', 'the', 'action', 'of', 'the', 'direct', 'limit', 'of', 'the', 'corresponding', 'sequence', 'of', 'classical', 'algebraic', 'groups', 'when', 'the', 'sequence', 'of', 'groups', 'consists', 'of', 'diagonal', 'embeddings', 'we', 'also', 'classify', 'all', 'conjugationstable', 'closed', 'subsets', 'of', 'the', 'space', 'of', 'mathbbntimesmathbbn', 'matrices']] | [-0.17237068313089285, 0.07058214750775899, -0.05947323671796105, 0.06379316350318152, -0.06423901835964485, -0.027556246442889624, 0.04410781011154706, 0.3519040277058428, -0.38387485403906213, -0.19806939039210028, 0.1395227539882233, -0.2480486855080182, -0.09293040874498812, 0.19474358267404818, -0.0966051173819737, -0.04541439694267782, 0.05151837096464905, 0.1520971241491762, -0.1253873655191538, -0.2938722873466428, 0.4422243561934341, -0.07345778225413101, 0.2337063237347386, -0.0584236778318882, 0.14924662524664944, 0.01152820179069584, -0.025824748673899608, -0.0173181001779581, -0.0786256857942631, 0.15626750180328433, 0.2694070830094543, 0.08924626513722946, 0.22903445635668257, -0.3479361604899168, -0.11395605230195956, 0.2220217173072425, 0.18140630715272643, 0.04526180990717628, 0.018863672233948654, -0.2756814262829721, 0.1781381915408102, -0.14178328520872377, -0.1017660222778266, -0.03408402404324575, 0.06862792010334405, 0.05179000540890477, -0.2547522163865241, 0.012020441139942373, 0.13776544449342923, 0.06265688083049926, -0.09102358122102239, -0.09532659194135869, -0.01537472118030895, 0.1995612405224661, 0.006852925437587229, 0.009942814910953696, 0.10122656405649402, -0.06999098473143849, -0.11964283326471394, 0.34837368147617037, -0.05799702559174462, -0.1892499206926335, 0.15424104967916555, -0.1946736879138784, -0.16259799457409166, 0.12679613229225983, 0.07401841220191933, 0.15904142246158284, -0.07818218296610709, 0.1766541015695442, -0.13824811686169017, 0.07635194281624122, 0.050198331864720044, 0.030144054992971094, 0.1595952594652772, 0.13376743872649968, 0.09198676965792071, 0.1735613477839665, -0.002401991527188908, -0.03207269777459177, -0.3497394381768324, -0.18907408510250123, -0.14129489032255316, 0.11605832888744771, -0.15554702213954774, -0.2069163844074038, 0.416802212824537, 0.09786419166061519, 0.1925227947956459, 0.1568518083373254, 0.19667911026626825, 0.08283475146374919, 0.06789751609110019, 0.03692392841489477, 0.10859085754914717, 0.23704120503230527, -0.06683631817048247, -0.18339903616261752, -0.08012188379229469, 0.2151893588629636] |
1,802.10338 | Fair Adaptive Data Rate Allocation and Power Control in LoRaWAN | In this paper, we present results of a study of the data rate fairness among
nodes within a LoRaWAN cell. Since LoRa/LoRaWAN supports various data rates, we
firstly derive the fairest ratios of deploying each data rate within a cell for
a fair collision probability. LoRa/LoRaWAN, like other frequency modulation
based radio interfaces, exhibits the \textit{capture effect} in which only the
stronger signal of colliding signals will be extracted. This leads to
unfairness, where far nodes or nodes experiencing higher attenuation are less
likely to see their packets received correctly. Therefore, we secondly develop
a transmission power control algorithm to balance the received signal powers
from all nodes regardless of their distances from the gateway for a fair data
extraction. Simulations show that our approach achieves higher fairness in data
rate than the state-of-art in almost all network configurations.
| cs.NI | in this paper we present results of a study of the data rate fairness among nodes within a lorawan cell since loralorawan supports various data rates we firstly derive the fairest ratios of deploying each data rate within a cell for a fair collision probability loralorawan like other frequency modulation based radio interfaces exhibits the textitcapture effect in which only the stronger signal of colliding signals will be extracted this leads to unfairness where far nodes or nodes experiencing higher attenuation are less likely to see their packets received correctly therefore we secondly develop a transmission power control algorithm to balance the received signal powers from all nodes regardless of their distances from the gateway for a fair data extraction simulations show that our approach achieves higher fairness in data rate than the stateofart in almost all network configurations | [['in', 'this', 'paper', 'we', 'present', 'results', 'of', 'a', 'study', 'of', 'the', 'data', 'rate', 'fairness', 'among', 'nodes', 'within', 'a', 'lorawan', 'cell', 'since', 'loralorawan', 'supports', 'various', 'data', 'rates', 'we', 'firstly', 'derive', 'the', 'fairest', 'ratios', 'of', 'deploying', 'each', 'data', 'rate', 'within', 'a', 'cell', 'for', 'a', 'fair', 'collision', 'probability', 'loralorawan', 'like', 'other', 'frequency', 'modulation', 'based', 'radio', 'interfaces', 'exhibits', 'the', 'textitcapture', 'effect', 'in', 'which', 'only', 'the', 'stronger', 'signal', 'of', 'colliding', 'signals', 'will', 'be', 'extracted', 'this', 'leads', 'to', 'unfairness', 'where', 'far', 'nodes', 'or', 'nodes', 'experiencing', 'higher', 'attenuation', 'are', 'less', 'likely', 'to', 'see', 'their', 'packets', 'received', 'correctly', 'therefore', 'we', 'secondly', 'develop', 'a', 'transmission', 'power', 'control', 'algorithm', 'to', 'balance', 'the', 'received', 'signal', 'powers', 'from', 'all', 'nodes', 'regardless', 'of', 'their', 'distances', 'from', 'the', 'gateway', 'for', 'a', 'fair', 'data', 'extraction', 'simulations', 'show', 'that', 'our', 'approach', 'achieves', 'higher', 'fairness', 'in', 'data', 'rate', 'than', 'the', 'stateofart', 'in', 'almost', 'all', 'network', 'configurations']] | [-0.200414194415013, 0.05518156329196864, -0.060716103716834405, 0.0392622771365838, -0.06264677468646804, -0.16647701892002986, 0.1426803490140246, 0.38111067190766335, -0.24677477609783754, -0.27851542127926066, 0.06633848452306204, -0.2919133491611675, -0.11414175276961717, 0.1801544743015309, -0.06734714169473643, 0.002605294900696617, 0.07630495798598597, 0.08221651329591438, -0.02700200354160768, -0.23808139868661005, 0.28389346057319664, 0.13715755933409798, 0.3547789596318119, 0.029963142113706123, 0.07385883071169635, -0.01308757932924166, -0.036470069570223924, -0.0036242017530890153, -0.09092402966564185, 0.10137418970175466, 0.3074427981307541, 0.17408367121369456, 0.28365074309344956, -0.4349010177935217, -0.21875481341925004, 0.12384383328447955, 0.1433406961825339, 0.10848070138414134, -0.06488289106029856, -0.21273148030319344, 0.12904377972734146, -0.2105912270658798, -0.06048840096058405, 0.009405205957591534, -0.007173904211030922, 0.07768311392704862, -0.3010566708213393, 0.0873170081505795, -0.0027681848749626374, 0.03088652608457251, -0.045461388652388385, -0.1040755840882227, -0.01724924808756138, 0.14653538161655888, 0.040658878689588375, -0.002934792726908041, 0.129263169972388, -0.10636596144784403, -0.11939705125110196, 0.39463475789955776, -0.010831317343547487, -0.16554035474816203, 0.17390320794083233, -0.14864707578891428, -0.11519532613591224, 0.14898683242305802, 0.22933386486239624, 0.06929991427518806, -0.1789179399071356, -0.05184677489898235, -0.006564438828955526, 0.17947176667402728, 0.08914207703724125, 0.09514979229889055, 0.15627166198944484, 0.16454439237545096, 0.08922161774007954, 0.11137134202990505, -0.12179750708890134, -0.07722886553898022, -0.21638233353766828, -0.09271376630615281, -0.16858598427759294, 0.011954864853169715, -0.10048530266647214, -0.07730797044527919, 0.3809636252378856, 0.1762598282320128, 0.2212362177043637, 0.11496562983223196, 0.34934999145891354, 0.08670123030542923, 0.09528534487227275, 0.13509834666425982, 0.23698079937299632, 0.043604267923080406, 0.12747267322940414, -0.17436853542813627, 0.08987963555610158, -0.015021056456464356] |
1,802.10339 | On Exact Polya and Putinar's Representations | We consider the problem of finding exact sums of squares (SOS) decompositions
for certain classes of non-negative multivariate polynomials, relying on
semidefinite programming (SDP) solvers.
We start by providing a hybrid numeric-symbolic algorithm computing exact
rational SOS decompositions for polynomials lying in the interior of the SOS
cone. It computes an approximate SOS decomposition for a perturbation of the
input polynomial with an arbitrary-precision SDP solver. An exact SOS
decomposition is obtained thanks to the perturbation terms. We prove that bit
complexity estimates on output size and runtime are both polynomial in the
degree of the input polynomial and simply exponential in the number of
variables. Next, we apply this algorithm to compute exact Polya and Putinar's
representations respectively for positive definite forms and positive
polynomials over basic compact semi-algebraic sets. We also compare the
implementation of our algorithms with existing methods in computer algebra
including cylindrical algebraic decomposition and critical point method.
| cs.SC | we consider the problem of finding exact sums of squares sos decompositions for certain classes of nonnegative multivariate polynomials relying on semidefinite programming sdp solvers we start by providing a hybrid numericsymbolic algorithm computing exact rational sos decompositions for polynomials lying in the interior of the sos cone it computes an approximate sos decomposition for a perturbation of the input polynomial with an arbitraryprecision sdp solver an exact sos decomposition is obtained thanks to the perturbation terms we prove that bit complexity estimates on output size and runtime are both polynomial in the degree of the input polynomial and simply exponential in the number of variables next we apply this algorithm to compute exact polya and putinars representations respectively for positive definite forms and positive polynomials over basic compact semialgebraic sets we also compare the implementation of our algorithms with existing methods in computer algebra including cylindrical algebraic decomposition and critical point method | [['we', 'consider', 'the', 'problem', 'of', 'finding', 'exact', 'sums', 'of', 'squares', 'sos', 'decompositions', 'for', 'certain', 'classes', 'of', 'nonnegative', 'multivariate', 'polynomials', 'relying', 'on', 'semidefinite', 'programming', 'sdp', 'solvers', 'we', 'start', 'by', 'providing', 'a', 'hybrid', 'numericsymbolic', 'algorithm', 'computing', 'exact', 'rational', 'sos', 'decompositions', 'for', 'polynomials', 'lying', 'in', 'the', 'interior', 'of', 'the', 'sos', 'cone', 'it', 'computes', 'an', 'approximate', 'sos', 'decomposition', 'for', 'a', 'perturbation', 'of', 'the', 'input', 'polynomial', 'with', 'an', 'arbitraryprecision', 'sdp', 'solver', 'an', 'exact', 'sos', 'decomposition', 'is', 'obtained', 'thanks', 'to', 'the', 'perturbation', 'terms', 'we', 'prove', 'that', 'bit', 'complexity', 'estimates', 'on', 'output', 'size', 'and', 'runtime', 'are', 'both', 'polynomial', 'in', 'the', 'degree', 'of', 'the', 'input', 'polynomial', 'and', 'simply', 'exponential', 'in', 'the', 'number', 'of', 'variables', 'next', 'we', 'apply', 'this', 'algorithm', 'to', 'compute', 'exact', 'polya', 'and', 'putinars', 'representations', 'respectively', 'for', 'positive', 'definite', 'forms', 'and', 'positive', 'polynomials', 'over', 'basic', 'compact', 'semialgebraic', 'sets', 'we', 'also', 'compare', 'the', 'implementation', 'of', 'our', 'algorithms', 'with', 'existing', 'methods', 'in', 'computer', 'algebra', 'including', 'cylindrical', 'algebraic', 'decomposition', 'and', 'critical', 'point', 'method']] | [-0.14567471012522124, -0.02109240249190311, -0.10371493052470644, 0.07297934249206599, -0.10036362871821773, -0.14253754726929688, 0.032918661578533875, 0.3200445321547848, -0.3364217323741238, -0.26803992317045894, 0.17126263532248376, -0.22058020526616784, -0.1686074485708224, 0.18997473217620464, -0.049339310321221616, 0.1091346484547677, 0.043583659173332547, 0.021969988360069692, -0.1403567370618571, -0.3281881726480175, 0.3063962821661813, -0.028277748625872557, 0.18340409810556785, 0.036512478882765494, 0.13758992425688407, 0.024819911341182888, -0.04404783031082173, -0.002084092160466274, -0.11047401629706369, 0.1610658217648865, 0.3058109850696239, 0.23502816498971937, 0.259200482312161, -0.42290450038241323, -0.04927254330342341, 0.1411734138198785, 0.15102693826683158, 0.07617119105596334, -0.01025720769968374, -0.2202051544736605, 0.10112815573015005, -0.11449044419532584, -0.13298452045694975, -0.12609910107168712, 0.003915158253604252, 0.026308152028114387, -0.3260004307621306, 0.01700771996566848, 0.06222594676747624, 0.07885968627861555, -0.05910228084049825, -0.23421056993461925, 0.06494363248623956, 0.03513257574185876, -0.045533035945386234, 0.02238497108153656, 0.043854075933555385, -0.07535601334989463, -0.17363513050459964, 0.2987932699554796, -0.03412793712509723, -0.26702867794205976, 0.1351694153732081, -0.09757404693549401, -0.18090134551503548, 0.12737926837105892, 0.18627870703839058, 0.15422683357888003, -0.047583881394913125, 0.16885550626006748, -0.11769719730517336, 0.1333443096513005, 0.12987261015836052, -0.00941899920948536, 0.13803998855138688, 0.09503756692528871, 0.11849649827682267, 0.18560836718135856, 0.04211168612317507, -0.10664430328592732, -0.257031541012877, -0.14235921760432815, -0.23979139963232324, 0.01748135997178523, -0.2046553948368551, -0.238838262574159, 0.4288653724782451, 0.10019086852614571, 0.11126550679144107, 0.21244264460217796, 0.32740660220090495, 0.1596182319848786, 0.024760440396341055, 0.1258606127898211, 0.10519650832314878, 0.191977808265763, 0.0431147267709572, -0.20149001790713028, 0.05351516456453522, 0.19193015776354036] |
1,802.1034 | On a singular limit for stratified compressible fluids | We consider a singular limit problem for the complete compressible Euler
system in the low Mach and strong stratification regime. We identify the limit
problem - the anelastic Euler system - in the case of well prepared initial
data. The result holds in the large class of the dissipative measure-valued
solutions of the primitive system. Applications are discussed to the driven
shallow water equations.
| math.AP | we consider a singular limit problem for the complete compressible euler system in the low mach and strong stratification regime we identify the limit problem the anelastic euler system in the case of well prepared initial data the result holds in the large class of the dissipative measurevalued solutions of the primitive system applications are discussed to the driven shallow water equations | [['we', 'consider', 'a', 'singular', 'limit', 'problem', 'for', 'the', 'complete', 'compressible', 'euler', 'system', 'in', 'the', 'low', 'mach', 'and', 'strong', 'stratification', 'regime', 'we', 'identify', 'the', 'limit', 'problem', 'the', 'anelastic', 'euler', 'system', 'in', 'the', 'case', 'of', 'well', 'prepared', 'initial', 'data', 'the', 'result', 'holds', 'in', 'the', 'large', 'class', 'of', 'the', 'dissipative', 'measurevalued', 'solutions', 'of', 'the', 'primitive', 'system', 'applications', 'are', 'discussed', 'to', 'the', 'driven', 'shallow', 'water', 'equations']] | [-0.20834275847300887, 0.07982103526592255, -0.019915661654405056, 0.09554377844136569, -0.004567165051647011, -0.10007488451928141, -0.012975581410911775, 0.20408716557487364, -0.31214919187609225, -0.24291415599685523, 0.1333240506956504, -0.26166498433468083, -0.08831352953829112, 0.20691857404345948, -0.054726404408293385, 0.13938249102342995, 0.11427305439006417, -0.04400368292831005, -0.03247422383978001, -0.22283188189049402, 0.38942787692611736, -0.0270801174544519, 0.2791966202879144, 0.012554978080574543, 0.15814268736416595, -0.048832215943313655, 0.039740573231791775, 0.04677811712627449, -0.1635111476099419, 0.017188006712521818, 0.25591674933750785, 0.03622175930368324, 0.2671307458696256, -0.44643318617055494, -0.2188992104342868, 0.09233330443291174, 0.1102525821901978, 0.1588366663068413, 0.002018040799040107, -0.2545597442959045, 0.08367645623718178, -0.16444026762920042, -0.23947707542608823, -0.015638722313357698, 0.02189400635900036, 0.08233903790073048, -0.2620088081927069, 0.10495346086099744, 0.11812432978730349, 0.05093963846804634, -0.15083710352830107, -0.08087584688966613, -0.013091151110617625, 0.10438125616600437, 0.039581335902649666, -0.0471159985303999, 0.0766507089588671, -0.1924281593772673, 0.020699981600046158, 0.4338412348729288, -0.1284551984337609, -0.2459927696975008, 0.22565851256912273, -0.16279218073243334, -0.14625612789795042, 0.15444536660347255, 0.20452965882366464, 0.17435134623590257, -0.08193910966116574, 0.09857761357007773, -0.09964894838330726, 0.09836873837235954, 0.043760122738838676, -0.015531304502679456, 0.14887886838949915, 0.2005778960733404, 0.06893727090209723, 0.18157527949510804, -0.0639757861142918, -0.11493791053221832, -0.297642114752483, -0.1856033006390076, -0.161213613746147, 0.0672202876528665, -0.084728755266922, -0.2099070512960034, 0.3182748137117033, 0.14413767208104894, 0.11578267250931071, 0.06803549222287632, 0.23755744604333753, 0.2044609392121915, -0.05068166758264265, 0.09411056087382379, 0.2608386760337218, 0.16290804710719856, 0.197408803753675, -0.22844278609620466, 0.021635491889150392, 0.1312327115578697] |
1,802.10341 | Discovery of pulsations from NGC 300 ULX1 and its fast period evolution | The supernova impostor SN 2010da located in the nearby galaxy NGC 300, later
identified as a likely supergiant B[e] high-mass X-ray binary, was
simultaneously observed by NuSTAR and XMM-Newton between 2016 December 16 and
20, over a total time span of 310 ks. We report the discovery of a strong
periodic modulation in the X-ray flux with a pulse period of 31.6 s and a very
rapid spin-up, and confirm therefore that the compact object is a neutron star.
We find that the spin period is changing from 31.71 s to 31.54 s over that
period, with a spin-up rate of -5.56 x 10-7 s s-1, likely the largest ever
observed from an accreting neutron star. The spectrum is described by a
power-law and a disk black-body model, leading to a 0.3-30 keV unabsorbed
luminosity of 4.7 x 10^39 erg s-1. Applying our best-fit model successfully to
the spectra of an XMM-Newton observation from 2010, suggests that the lower
fluxes of NGC 300 ULX1 reported from observations around that time are caused
by a large amount of absorption, while the intrinsic luminosity was similar as
seen in 2016. A more constant luminosity level is also consistent with the
long-term pulse period evolution approaching an equilibrium value
asymptotically. We conclude that the source is another candidate for the new
class of ultraluminous X-ray pulsars.
| astro-ph.HE | the supernova impostor sn 2010da located in the nearby galaxy ngc 300 later identified as a likely supergiant be highmass xray binary was simultaneously observed by nustar and xmmnewton between 2016 december 16 and 20 over a total time span of 310 ks we report the discovery of a strong periodic modulation in the xray flux with a pulse period of 316 s and a very rapid spinup and confirm therefore that the compact object is a neutron star we find that the spin period is changing from 3171 s to 3154 s over that period with a spinup rate of 556 x 107 s s1 likely the largest ever observed from an accreting neutron star the spectrum is described by a powerlaw and a disk blackbody model leading to a 0330 kev unabsorbed luminosity of 47 x 1039 erg s1 applying our bestfit model successfully to the spectra of an xmmnewton observation from 2010 suggests that the lower fluxes of ngc 300 ulx1 reported from observations around that time are caused by a large amount of absorption while the intrinsic luminosity was similar as seen in 2016 a more constant luminosity level is also consistent with the longterm pulse period evolution approaching an equilibrium value asymptotically we conclude that the source is another candidate for the new class of ultraluminous xray pulsars | [['the', 'supernova', 'impostor', 'sn', '2010da', 'located', 'in', 'the', 'nearby', 'galaxy', 'ngc', '300', 'later', 'identified', 'as', 'a', 'likely', 'supergiant', 'be', 'highmass', 'xray', 'binary', 'was', 'simultaneously', 'observed', 'by', 'nustar', 'and', 'xmmnewton', 'between', '2016', 'december', '16', 'and', '20', 'over', 'a', 'total', 'time', 'span', 'of', '310', 'ks', 'we', 'report', 'the', 'discovery', 'of', 'a', 'strong', 'periodic', 'modulation', 'in', 'the', 'xray', 'flux', 'with', 'a', 'pulse', 'period', 'of', '316', 's', 'and', 'a', 'very', 'rapid', 'spinup', 'and', 'confirm', 'therefore', 'that', 'the', 'compact', 'object', 'is', 'a', 'neutron', 'star', 'we', 'find', 'that', 'the', 'spin', 'period', 'is', 'changing', 'from', '3171', 's', 'to', '3154', 's', 'over', 'that', 'period', 'with', 'a', 'spinup', 'rate', 'of', '556', 'x', '107', 's', 's1', 'likely', 'the', 'largest', 'ever', 'observed', 'from', 'an', 'accreting', 'neutron', 'star', 'the', 'spectrum', 'is', 'described', 'by', 'a', 'powerlaw', 'and', 'a', 'disk', 'blackbody', 'model', 'leading', 'to', 'a', '0330', 'kev', 'unabsorbed', 'luminosity', 'of', '47', 'x', '1039', 'erg', 's1', 'applying', 'our', 'bestfit', 'model', 'successfully', 'to', 'the', 'spectra', 'of', 'an', 'xmmnewton', 'observation', 'from', '2010', 'suggests', 'that', 'the', 'lower', 'fluxes', 'of', 'ngc', '300', 'ulx1', 'reported', 'from', 'observations', 'around', 'that', 'time', 'are', 'caused', 'by', 'a', 'large', 'amount', 'of', 'absorption', 'while', 'the', 'intrinsic', 'luminosity', 'was', 'similar', 'as', 'seen', 'in', '2016', 'a', 'more', 'constant', 'luminosity', 'level', 'is', 'also', 'consistent', 'with', 'the', 'longterm', 'pulse', 'period', 'evolution', 'approaching', 'an', 'equilibrium', 'value', 'asymptotically', 'we', 'conclude', 'that', 'the', 'source', 'is', 'another', 'candidate', 'for', 'the', 'new', 'class', 'of', 'ultraluminous', 'xray', 'pulsars']] | [-0.08121418215479544, 0.13371823955557754, -0.07276561408671195, 0.08069422804842381, -0.08888722410542481, -0.09718316958929024, 0.09386597051819778, 0.4271256147963183, -0.14581996604649877, -0.38218591356391063, 0.08731049467703002, -0.32575442946415223, 0.004389901488803791, 0.24829061233517902, -0.03534514781070932, -0.04469604866866037, 0.08156068970563074, -0.03308919057403503, -0.0751099441578453, -0.2556809501622223, 0.22181321693022607, 0.09332311507565023, 0.16476793861488556, -0.03689462907044342, 0.08848286589196228, -0.06860587977273849, -0.02457272588649155, -0.07280794572870293, -0.10497821952761077, 0.02056883025972899, 0.22949205712612872, 0.09420092150828939, 0.196771398203389, -0.3192976940936939, -0.20572835221498237, 0.06050603595382697, 0.13601815636215456, -0.03598673595533176, -0.01568159176489065, -0.26471239479202274, 0.06192477838232312, -0.2591415963902017, -0.18094128583069272, 0.10698452427661706, 0.13813720965515738, 0.004613471873921046, -0.21364781417520592, 0.14866700253098047, 0.02370515390144736, 0.046268453569915734, -0.1644741585384219, -0.06558710311992604, -0.05341205307576939, -0.0001198705431959287, 0.06242094240923968, 0.14248773851797336, 0.10796529509653358, -0.08163476529251366, -0.07947165861823952, 0.3342639684777356, -0.0953289375628967, 0.09482619981594684, 0.17722764801058602, -0.192700538727885, -0.15918397854161637, 0.2305788729515244, 0.10363485116820632, 0.12138891369997076, -0.17665765033993086, -0.0043263316998295295, -0.05500144848909079, 0.2939850289140715, 0.05900207815891249, 0.03273462318768176, 0.3184267114659963, 0.1329456395433063, 0.01744310523700721, 0.12412285797283337, -0.2645278191079089, 0.013524814761523575, -0.24316496515725927, -0.05686520885664661, -0.1514965537329927, 0.18068015806595147, -0.11192632070605511, -0.08751250487948546, 0.3591148873807804, 0.055476409128361756, 0.25053323343847234, 0.0037421360778968965, 0.22791135902495663, 0.1211496784812207, 0.05352224865035601, 0.15212902637415737, 0.3050307286767531, 0.14894429359881567, 0.11589584389342321, -0.24261468468597283, 0.060344249982649936, -0.01776876133963708] |
1,802.10342 | A study of periodic potentials based on quadratic splines | We discuss a method based on a segmentary approximation of solutions of the
Schr\"odinger by quadratic splines, for which the coefficients are determined
by a variational method that does not require the resolution of complicated
algebraic equations. The idea is the application of the method to one
dimensional periodic potentials. We include the determination of the
eigenvalues up to a given level, and therefore an approximation to the lowest
energy bands. We apply the method to concrete examples with interest in physics
and discussed the numerical errors.
| quant-ph | we discuss a method based on a segmentary approximation of solutions of the schrodinger by quadratic splines for which the coefficients are determined by a variational method that does not require the resolution of complicated algebraic equations the idea is the application of the method to one dimensional periodic potentials we include the determination of the eigenvalues up to a given level and therefore an approximation to the lowest energy bands we apply the method to concrete examples with interest in physics and discussed the numerical errors | [['we', 'discuss', 'a', 'method', 'based', 'on', 'a', 'segmentary', 'approximation', 'of', 'solutions', 'of', 'the', 'schrodinger', 'by', 'quadratic', 'splines', 'for', 'which', 'the', 'coefficients', 'are', 'determined', 'by', 'a', 'variational', 'method', 'that', 'does', 'not', 'require', 'the', 'resolution', 'of', 'complicated', 'algebraic', 'equations', 'the', 'idea', 'is', 'the', 'application', 'of', 'the', 'method', 'to', 'one', 'dimensional', 'periodic', 'potentials', 'we', 'include', 'the', 'determination', 'of', 'the', 'eigenvalues', 'up', 'to', 'a', 'given', 'level', 'and', 'therefore', 'an', 'approximation', 'to', 'the', 'lowest', 'energy', 'bands', 'we', 'apply', 'the', 'method', 'to', 'concrete', 'examples', 'with', 'interest', 'in', 'physics', 'and', 'discussed', 'the', 'numerical', 'errors']] | [-0.07354417487165366, 0.033560302421810566, -0.08111676719339414, 0.06452429669925236, -0.07988258547567088, -0.09896991735902326, 0.05367095192262753, 0.34094158971104127, -0.2566884146981883, -0.2827869493396546, 0.11759782158475283, -0.24810604043519016, -0.16759312478290206, 0.22857081609638943, -0.042897508415425646, 0.07710884581052366, 0.06061454892329786, 0.03882479016808258, -0.11804350096486166, -0.25218828416151134, 0.33917568135878134, 0.036970749497413635, 0.22175440589105175, 0.07470756503164597, 0.13269743759013797, -0.020223371922734313, -0.020795130267225462, 0.013986913883394894, -0.15815872316097843, 0.16817033670885467, 0.22175081289405452, 0.06073821579566461, 0.288522229026789, -0.4102958669650486, -0.19957021627328947, 0.07354251668927655, 0.11419876743557639, 0.1455123071042264, -0.03628933746180358, -0.2618429406877907, 0.07686847320559767, -0.13898830905813594, -0.2009547167168609, -0.12944453604246392, -0.0287471997027082, 0.05270902208726982, -0.2916807146668006, 0.08027872908860445, 0.057153617149625704, 0.019962765554758323, -0.09296143905463061, -0.11335340095014879, 0.01948293550716092, 0.06508760796003472, 0.03299013523641845, -0.0280113351921385, 0.043781426146455193, -0.1016406647647074, -0.11194715735063641, 0.39847534385392036, -0.05939136628575366, -0.280699099013622, 0.17789649620020612, -0.11594815388450334, -0.12211113879671213, 0.13516072752275343, 0.1661224964331707, 0.14654771383081017, -0.114536103460638, 0.12344684625103342, 0.007831176004276193, 0.15785553595372315, 0.04025832425010787, -0.022691618956240087, 0.1245717413739526, 0.12048389808670885, 0.0792069617102201, 0.1079719409228827, -0.06861224174820657, -0.09769929246174107, -0.33444006496976164, -0.12895151428428703, -0.21489174612637224, 0.019555524603267007, -0.06452216270035828, -0.20728554922402248, 0.4445489817138376, 0.15064205732611383, 0.19129026733638568, 0.02481063334512171, 0.2951473086462196, 0.18664406854445223, 0.061672126365846944, 0.05719217876421994, 0.21596369639456528, 0.1534887977351231, 0.05385302632897236, -0.2081188086136619, -0.012094410092769934, 0.13416089238224274] |
1,802.10343 | Detection of ultracold molecules using an optical cavity | We theoretically study non-destructive detection of ultracold molecules,
using a Fabry-Perot cavity. Specifically, we consider vacuum Rabi splitting
where we demonstrate the use of collective strong coupling for detection of
molecules with many participating energy levels. We also consider
electromagnetically induced transparency and transient response of light for
the molecules interacting with a Fabry-Perot cavity mode, as a mean for
non-destructive detection. We identify the parameters that are required for the
detection of molecules in the cavity electromagnetically induced transparency
configuration. The theoretical analysis for these processes is parametrized
with realistic values of both, the molecule and the cavity. For each process,
we quantify the state occupancy of the molecules interacting with the cavity
and determine to what extent the population does not change during a detection
cycle.
| quant-ph physics.atom-ph | we theoretically study nondestructive detection of ultracold molecules using a fabryperot cavity specifically we consider vacuum rabi splitting where we demonstrate the use of collective strong coupling for detection of molecules with many participating energy levels we also consider electromagnetically induced transparency and transient response of light for the molecules interacting with a fabryperot cavity mode as a mean for nondestructive detection we identify the parameters that are required for the detection of molecules in the cavity electromagnetically induced transparency configuration the theoretical analysis for these processes is parametrized with realistic values of both the molecule and the cavity for each process we quantify the state occupancy of the molecules interacting with the cavity and determine to what extent the population does not change during a detection cycle | [['we', 'theoretically', 'study', 'nondestructive', 'detection', 'of', 'ultracold', 'molecules', 'using', 'a', 'fabryperot', 'cavity', 'specifically', 'we', 'consider', 'vacuum', 'rabi', 'splitting', 'where', 'we', 'demonstrate', 'the', 'use', 'of', 'collective', 'strong', 'coupling', 'for', 'detection', 'of', 'molecules', 'with', 'many', 'participating', 'energy', 'levels', 'we', 'also', 'consider', 'electromagnetically', 'induced', 'transparency', 'and', 'transient', 'response', 'of', 'light', 'for', 'the', 'molecules', 'interacting', 'with', 'a', 'fabryperot', 'cavity', 'mode', 'as', 'a', 'mean', 'for', 'nondestructive', 'detection', 'we', 'identify', 'the', 'parameters', 'that', 'are', 'required', 'for', 'the', 'detection', 'of', 'molecules', 'in', 'the', 'cavity', 'electromagnetically', 'induced', 'transparency', 'configuration', 'the', 'theoretical', 'analysis', 'for', 'these', 'processes', 'is', 'parametrized', 'with', 'realistic', 'values', 'of', 'both', 'the', 'molecule', 'and', 'the', 'cavity', 'for', 'each', 'process', 'we', 'quantify', 'the', 'state', 'occupancy', 'of', 'the', 'molecules', 'interacting', 'with', 'the', 'cavity', 'and', 'determine', 'to', 'what', 'extent', 'the', 'population', 'does', 'not', 'change', 'during', 'a', 'detection', 'cycle']] | [-0.1561861577174568, 0.1763140368348104, -0.011447501474322053, 0.008445535618719191, -0.0020589266750903334, -0.13400616717262892, 0.07267994381231802, 0.41894665578729473, -0.21891118631174322, -0.3018323423475522, 0.030880079588314402, -0.25434974147356115, -0.08950459263360244, 0.17275074288772885, 0.012651500390347792, 0.03000327961046878, 0.0739894583603018, 0.027605225735896965, 0.02906444377003936, -0.12449443924197112, 0.30326682459781296, 0.06990413567109499, 0.2832689748174744, 0.07360491649797041, 0.1031182255501335, 0.010699588072384358, 0.06274139168090187, -0.04207048956232029, -0.12860195315289502, 0.1072433676890796, 0.21612090288726904, 0.06831982142466586, 0.23705237488320563, -0.449191571897245, -0.21608138162991963, 0.12977902325656032, 0.15533228519416298, 0.180580872705832, -0.08515680548941873, -0.3124971755387378, -0.02128178500697686, -0.14290696741227293, -0.13573769934737356, -0.07643705316877458, -0.002277235354995355, 0.04719260106321599, -0.2846866885556665, 0.03846406126626789, -0.005517699804840959, 0.07903302490740316, -0.06761472265225166, -0.033786082567530684, 0.040861302437406266, 0.1015354470728198, -0.04342005811963645, -0.05713818502226786, 0.21124491338559892, -0.18215081135349465, -0.11296281532577268, 0.3975677621201612, -0.150967707788368, -0.13978537910588784, 0.19108264062015223, -0.16157434126034786, -0.08566448599958676, 0.1354109861640609, 0.17705398322141264, 0.1300849714098149, -0.12404394680561381, -0.012807550201159756, -0.03303652603062801, 0.19360563069039927, 0.09406164958272711, 0.10407593355193967, 0.2128918938615243, 0.1880537555916817, 0.028128275821927673, 0.194520402004855, -0.15861278875308926, -0.07882374738437647, -0.27479689112806227, -0.1675972038483451, -0.13990992035246563, 0.030204619116489084, -0.020190806837149466, -0.15387361125613097, 0.4284015563680441, 0.14897081111121224, 0.16208627345440618, -0.029729427114943974, 0.3153392233652994, 0.12694072121939826, 0.05495657326991932, -0.003039709928998491, 0.32527143937841174, 0.12469568314554635, 0.009283426665660954, -0.34671462822370813, 0.03797172100530588, -0.03632279891826329] |
1,802.10344 | Almost Markovian processes from closed dynamics | It is common, when dealing with quantum processes involving a subsystem of a
much larger composite closed system, to treat them as effectively memory-less
(Markovian). While open systems theory tells us that non-Markovian processes
should be the norm, the ubiquity of Markovian processes is undeniable. Here,
without resorting to the Born-Markov assumption of weak coupling or making any
approximations, we formally prove that processes are close to Markovian ones,
when the subsystem is sufficiently small compared to the remainder of the
composite, with a probability that tends to unity exponentially in the size of
the latter. We also show that, for a fixed global system size, it may not be
possible to neglect non-Markovian effects when the process is allowed to
continue for long enough. However, detecting non-Markovianity for such
processes would usually require non-trivial entangling resources. Our results
have foundational importance, as they give birth to almost Markovian processes
from composite closed dynamics, and to obtain them we introduce a new notion of
equilibration that is far stronger than the conventional one and show that this
stronger equilibration is attained.
| quant-ph | it is common when dealing with quantum processes involving a subsystem of a much larger composite closed system to treat them as effectively memoryless markovian while open systems theory tells us that nonmarkovian processes should be the norm the ubiquity of markovian processes is undeniable here without resorting to the bornmarkov assumption of weak coupling or making any approximations we formally prove that processes are close to markovian ones when the subsystem is sufficiently small compared to the remainder of the composite with a probability that tends to unity exponentially in the size of the latter we also show that for a fixed global system size it may not be possible to neglect nonmarkovian effects when the process is allowed to continue for long enough however detecting nonmarkovianity for such processes would usually require nontrivial entangling resources our results have foundational importance as they give birth to almost markovian processes from composite closed dynamics and to obtain them we introduce a new notion of equilibration that is far stronger than the conventional one and show that this stronger equilibration is attained | [['it', 'is', 'common', 'when', 'dealing', 'with', 'quantum', 'processes', 'involving', 'a', 'subsystem', 'of', 'a', 'much', 'larger', 'composite', 'closed', 'system', 'to', 'treat', 'them', 'as', 'effectively', 'memoryless', 'markovian', 'while', 'open', 'systems', 'theory', 'tells', 'us', 'that', 'nonmarkovian', 'processes', 'should', 'be', 'the', 'norm', 'the', 'ubiquity', 'of', 'markovian', 'processes', 'is', 'undeniable', 'here', 'without', 'resorting', 'to', 'the', 'bornmarkov', 'assumption', 'of', 'weak', 'coupling', 'or', 'making', 'any', 'approximations', 'we', 'formally', 'prove', 'that', 'processes', 'are', 'close', 'to', 'markovian', 'ones', 'when', 'the', 'subsystem', 'is', 'sufficiently', 'small', 'compared', 'to', 'the', 'remainder', 'of', 'the', 'composite', 'with', 'a', 'probability', 'that', 'tends', 'to', 'unity', 'exponentially', 'in', 'the', 'size', 'of', 'the', 'latter', 'we', 'also', 'show', 'that', 'for', 'a', 'fixed', 'global', 'system', 'size', 'it', 'may', 'not', 'be', 'possible', 'to', 'neglect', 'nonmarkovian', 'effects', 'when', 'the', 'process', 'is', 'allowed', 'to', 'continue', 'for', 'long', 'enough', 'however', 'detecting', 'nonmarkovianity', 'for', 'such', 'processes', 'would', 'usually', 'require', 'nontrivial', 'entangling', 'resources', 'our', 'results', 'have', 'foundational', 'importance', 'as', 'they', 'give', 'birth', 'to', 'almost', 'markovian', 'processes', 'from', 'composite', 'closed', 'dynamics', 'and', 'to', 'obtain', 'them', 'we', 'introduce', 'a', 'new', 'notion', 'of', 'equilibration', 'that', 'is', 'far', 'stronger', 'than', 'the', 'conventional', 'one', 'and', 'show', 'that', 'this', 'stronger', 'equilibration', 'is', 'attained']] | [-0.10720272027007535, 0.16623623057870576, -0.09803680119182508, 0.13164990838044538, -0.06708821631808513, -0.19186340000490704, 0.06300028019587288, 0.34931997929118286, -0.2959115634317309, -0.23924536758117912, 0.09501088735871326, -0.24837619311160805, -0.10371254443690099, 0.20308971672462947, -0.06422810570866858, 0.037768915642917324, 0.08169996655270849, 0.05388144760402897, -0.027891976030116377, -0.24578638296080393, 0.32388755139310776, 0.05733213294554728, 0.23195749225650622, 0.053674246584584945, 0.06164745801998024, -0.00595200852135927, 0.031372606567781194, 0.0182108373177953, -0.08306287808556982, 0.05738810548888139, 0.2509907158001619, 0.10981897759066062, 0.3155314295105019, -0.45379036749090523, -0.23322406014201144, 0.15182878344881898, 0.1530369201029306, 0.15456138785866744, 0.016863631379137135, -0.2591274890094193, 0.08423517465601721, -0.15477428142526778, -0.15448568152387251, -0.09816727357612953, 0.04622060281432939, -0.012145324060577611, -0.2927305390170739, 0.058382796971815594, 0.12458169514709538, -0.0066306383422323764, 0.000428058008936064, -0.06426826307938553, 0.014850750210494297, 0.14669671598857253, 0.04177855711558304, 0.004210999581540899, 0.13674405436108703, -0.11730648512252251, -0.0881392987938958, 0.3650177531253073, -0.06213452433049743, -0.22756763141298697, 0.2720394809029286, -0.17027110666633474, -0.1267424495942191, 0.139364135657432, 0.13038338776240485, 0.10165205156271094, -0.18417908404868558, 0.08541162704562676, -0.014351585951957914, 0.17123030663470518, 0.013608969863792316, 0.10148348101512503, 0.15721729512259527, 0.13059561876277825, 0.10038917752636277, 0.15622180759731824, -0.0049937702773282956, -0.17050061745663014, -0.29070981665262285, -0.15781725068237035, -0.16444338010450393, 0.1339950465330454, -0.06367418406648917, -0.17543510473603435, 0.2939676995394309, 0.19255182574418225, 0.17076739838355842, 0.09180255684595123, 0.2817192392691311, 0.15604914298463737, 0.09366357124034953, 0.08494447480413796, 0.22783633757341468, 0.11371300096278855, 0.049273666016273816, -0.19457996753430334, 0.12146305593852345, 1.1598007002258827e-05] |
1,802.10345 | Extreme energy density confined inside a transparent crystal: Solid -
plasma - solid transformations, status and perspectives | It was demonstrated during the past decade that ultrashort intense laser
pulse tightly focused deep inside a transparent dielectric generates the energy
density in excess of several MJ/cm3. Such energy concentration with extremely
high heating and quenching rates leads to unusual solid-plasma-solid
transformation paths overcoming kinetic barriers to formation of previously
unknown high-pressure material phases, which are preserved in the surrounding
pristine crystal. These results were obtained with the pulse of Gaussian shape
in space and in time. Recently it was shown that the Bessel-shaped pulse could
transform much larger amount of a material and allegedly create even higher
energy density than that was achieved with the Gaussian (GB) pulses. Here we
present a succinct review of previous results and discuss the possible routes
for achieving higher energy density employing the Bessel beams (BB) and take
advantage of its unique properties.
| physics.optics cond-mat.other physics.plasm-ph | it was demonstrated during the past decade that ultrashort intense laser pulse tightly focused deep inside a transparent dielectric generates the energy density in excess of several mjcm3 such energy concentration with extremely high heating and quenching rates leads to unusual solidplasmasolid transformation paths overcoming kinetic barriers to formation of previously unknown highpressure material phases which are preserved in the surrounding pristine crystal these results were obtained with the pulse of gaussian shape in space and in time recently it was shown that the besselshaped pulse could transform much larger amount of a material and allegedly create even higher energy density than that was achieved with the gaussian gb pulses here we present a succinct review of previous results and discuss the possible routes for achieving higher energy density employing the bessel beams bb and take advantage of its unique properties | [['it', 'was', 'demonstrated', 'during', 'the', 'past', 'decade', 'that', 'ultrashort', 'intense', 'laser', 'pulse', 'tightly', 'focused', 'deep', 'inside', 'a', 'transparent', 'dielectric', 'generates', 'the', 'energy', 'density', 'in', 'excess', 'of', 'several', 'mjcm3', 'such', 'energy', 'concentration', 'with', 'extremely', 'high', 'heating', 'and', 'quenching', 'rates', 'leads', 'to', 'unusual', 'solidplasmasolid', 'transformation', 'paths', 'overcoming', 'kinetic', 'barriers', 'to', 'formation', 'of', 'previously', 'unknown', 'highpressure', 'material', 'phases', 'which', 'are', 'preserved', 'in', 'the', 'surrounding', 'pristine', 'crystal', 'these', 'results', 'were', 'obtained', 'with', 'the', 'pulse', 'of', 'gaussian', 'shape', 'in', 'space', 'and', 'in', 'time', 'recently', 'it', 'was', 'shown', 'that', 'the', 'besselshaped', 'pulse', 'could', 'transform', 'much', 'larger', 'amount', 'of', 'a', 'material', 'and', 'allegedly', 'create', 'even', 'higher', 'energy', 'density', 'than', 'that', 'was', 'achieved', 'with', 'the', 'gaussian', 'gb', 'pulses', 'here', 'we', 'present', 'a', 'succinct', 'review', 'of', 'previous', 'results', 'and', 'discuss', 'the', 'possible', 'routes', 'for', 'achieving', 'higher', 'energy', 'density', 'employing', 'the', 'bessel', 'beams', 'bb', 'and', 'take', 'advantage', 'of', 'its', 'unique', 'properties']] | [-0.09444171598137262, 0.18281223435305816, -0.09301655822048854, 0.04020134719304633, -0.0525567140430212, -0.10278190723687843, 0.028713994007388912, 0.4799983099480902, -0.23171923854185836, -0.3379007163660034, 0.05498031401235705, -0.24143694631039989, -0.08342001037638419, 0.21497559641906316, -0.01396498104820595, 0.058348895421342764, 0.038973339756974354, -0.011320869559827059, -0.0751841314161446, -0.23132055634430246, 0.24383088240347864, 0.12623299677679956, 0.3060550289076712, 0.04511415379364853, 0.09384377071114285, -0.020268861042416614, -0.0074022070376499405, -0.032277144083586194, -0.13790910218312344, 0.10551964194999765, 0.21386963304172715, 0.046978359947493976, 0.2592169702714444, -0.48575961929990613, -0.29495390132575744, 0.0638723806486519, 0.12043403102881342, 0.11738453334639443, -0.1310662678780331, -0.24931227941693657, 0.04326012924961422, -0.14290027348729578, -0.1448644143630467, -0.05516113682677024, 0.04359520896864326, 0.05941415485669521, -0.2275866148436604, 0.07683808343540148, 0.04370502287359989, -0.009509670975418978, -0.07689168887715651, -0.1207040177769554, -0.03958061495053487, 0.028013879210566698, 0.04761932061755679, 0.05090783539724172, 0.1552246095173135, -0.13410160289334971, -0.04356535987091669, 0.3489121878317193, -0.041048450590017674, -0.06815398348819303, 0.18687524193850602, -0.18697987143062073, -0.07682637288572564, 0.23624497706043548, 0.11040661180100025, 0.09436670604053939, -0.14610313666660502, 0.006903582108730072, 0.0171853450061146, 0.18187576551260293, 0.1477318429303747, 0.09655535805875948, 0.20664827925139578, 0.19981855453680392, 0.025549374866650265, 0.16667323197285389, -0.10398211714852115, -0.0699993090883768, -0.206638738155311, -0.1500856876845701, -0.1752723060494316, 0.04588740289825406, -0.038201964820842295, -0.11382811400508744, 0.4056685616538954, 0.11751529242273123, 0.1682162921929705, -0.009319282189160045, 0.2761219144542364, 0.1277444173473919, 0.08037273409317477, 0.044568250122804035, 0.270156603185055, 0.1324147679488701, 0.11389374754229642, -0.19998703478072918, 0.07508874903905435, -0.029254103401689317] |
1,802.10346 | A flexible and computationally tractable discrete distribution derived
from a stationary renewal process | A class of discrete distributions can be derived from stationary renewal
processes. They have the useful property that the mean is a simple function of
the model parameters. Thus regressions of the distribution mean on covariates
can be carried out and marginal effects of covariates calculated. Probabilities
can be easily computed in closed form for only two such distributions, when the
event interarrival times in the renewal process follow either a gamma or an
inverse Gaussian distribution. The gamma-based distribution has more attractive
properties and is described and fitted to data. The inverse-Gaussian based
distribution is also briefly discussed.
| stat.ME | a class of discrete distributions can be derived from stationary renewal processes they have the useful property that the mean is a simple function of the model parameters thus regressions of the distribution mean on covariates can be carried out and marginal effects of covariates calculated probabilities can be easily computed in closed form for only two such distributions when the event interarrival times in the renewal process follow either a gamma or an inverse gaussian distribution the gammabased distribution has more attractive properties and is described and fitted to data the inversegaussian based distribution is also briefly discussed | [['a', 'class', 'of', 'discrete', 'distributions', 'can', 'be', 'derived', 'from', 'stationary', 'renewal', 'processes', 'they', 'have', 'the', 'useful', 'property', 'that', 'the', 'mean', 'is', 'a', 'simple', 'function', 'of', 'the', 'model', 'parameters', 'thus', 'regressions', 'of', 'the', 'distribution', 'mean', 'on', 'covariates', 'can', 'be', 'carried', 'out', 'and', 'marginal', 'effects', 'of', 'covariates', 'calculated', 'probabilities', 'can', 'be', 'easily', 'computed', 'in', 'closed', 'form', 'for', 'only', 'two', 'such', 'distributions', 'when', 'the', 'event', 'interarrival', 'times', 'in', 'the', 'renewal', 'process', 'follow', 'either', 'a', 'gamma', 'or', 'an', 'inverse', 'gaussian', 'distribution', 'the', 'gammabased', 'distribution', 'has', 'more', 'attractive', 'properties', 'and', 'is', 'described', 'and', 'fitted', 'to', 'data', 'the', 'inversegaussian', 'based', 'distribution', 'is', 'also', 'briefly', 'discussed']] | [-0.04192251544231929, 0.14422856989374255, -0.17954945132820582, 0.16202376363511278, -0.044653659771975815, -0.1412324588793349, 0.037135559343257726, 0.42475331255367826, -0.29493095477738857, -0.23546740560963444, 0.12209278577701094, -0.26369830121153165, -0.08710285670323563, 0.19258385468559452, -0.035589796096580674, 0.06649650515019133, 0.02795884175563459, 0.045864502224615036, -0.05340491836220596, -0.2194321296006745, 0.2866955647454122, 0.06223462102459554, 0.2816002308961232, -0.013705061328103195, 0.0866510596100184, 0.03791568150781855, -0.04887737175901136, 0.03533936359881595, -0.09318571885828254, 0.03917384154771512, 0.21044642836026542, 0.13201838353059578, 0.2414733612510775, -0.40708751871953813, -0.2577266722480405, 0.15339591726660728, 0.15721195777260452, 0.024250556646824854, -0.01107955039244226, -0.28105351459995215, 0.0540437457313267, -0.17648816383586322, -0.14341307883816107, -0.0509998198427564, 0.036593976078973134, 0.10090231689700514, -0.3422818136382468, 0.10299865393964716, 0.046494252694062696, 0.023041580452070554, -0.03240152368469316, -0.17076324280921598, -0.02678324698413513, 0.12061558056258055, 0.07251480508836851, -0.02505992136287446, 0.15078392908528296, -0.10509636113895293, -0.09020820742458752, 0.34689505852530805, -0.0791942074761859, -0.28174170733866644, 0.11686110559955468, -0.15389842788061622, -0.12812991607554106, 0.1374110563857747, 0.18645275232135033, 0.11852621983223575, -0.2387598277556969, 0.05317834317893543, -0.036481187840429495, 0.11864562505590064, 0.00959348895145124, -0.018161412314226737, 0.20226485074535772, 0.12014409341155646, 0.013116218503659629, 0.11742106188986716, -0.11610998246909063, -0.13141280575892983, -0.31170255535909414, -0.11169203686794, -0.23754991415165821, 0.06320074742080226, -0.1232252593755981, -0.1636285882785308, 0.36573720212351074, 0.10505202147463451, 0.23515395292708155, 0.0895650914836941, 0.21629302577134601, 0.22182298462115685, 0.03737661609312101, 0.07159191339124678, 0.15271707378061755, 0.11330656962212632, -0.002293138997629285, -0.1282307160471813, 0.192617347711051, -0.01419117590364981] |
1,802.10347 | Decompressing Lempel-Ziv Compressed Text | We consider the problem of decompressing the Lempel--Ziv 77 representation of
a string $S$ of length $n$ using a working space as close as possible to the
size $z$ of the input. The folklore solution for the problem runs in $O(n)$
time but requires random access to the whole decompressed text. Another
folklore solution is to convert LZ77 into a grammar of size $O(z\log(n/z))$ and
then stream $S$ in linear time. In this paper, we show that $O(n)$ time and
$O(z)$ working space can be achieved for constant-size alphabets. On general
alphabets of size $\sigma$, we describe (i) a trade-off achieving
$O(n\log^\delta \sigma)$ time and $O(z\log^{1-\delta}\sigma)$ space for any
$0\leq \delta\leq 1$, and (ii) a solution achieving $O(n)$ time and
$O(z\log\log (n/z))$ space. The latter solution, in particular, dominates both
folklore algorithms for the problem. Our solutions can, more generally, extract
any specified subsequence of $S$ with little overheads on top of the linear
running time and working space. As an immediate corollary, we show that our
techniques yield improved results for pattern matching problems on
LZ77-compressed text.
| cs.DS | we consider the problem of decompressing the lempelziv 77 representation of a string s of length n using a working space as close as possible to the size z of the input the folklore solution for the problem runs in on time but requires random access to the whole decompressed text another folklore solution is to convert lz77 into a grammar of size ozlognz and then stream s in linear time in this paper we show that on time and oz working space can be achieved for constantsize alphabets on general alphabets of size sigma we describe i a tradeoff achieving onlogdelta sigma time and ozlog1deltasigma space for any 0leq deltaleq 1 and ii a solution achieving on time and ozloglog nz space the latter solution in particular dominates both folklore algorithms for the problem our solutions can more generally extract any specified subsequence of s with little overheads on top of the linear running time and working space as an immediate corollary we show that our techniques yield improved results for pattern matching problems on lz77compressed text | [['we', 'consider', 'the', 'problem', 'of', 'decompressing', 'the', 'lempelziv', '77', 'representation', 'of', 'a', 'string', 's', 'of', 'length', 'n', 'using', 'a', 'working', 'space', 'as', 'close', 'as', 'possible', 'to', 'the', 'size', 'z', 'of', 'the', 'input', 'the', 'folklore', 'solution', 'for', 'the', 'problem', 'runs', 'in', 'on', 'time', 'but', 'requires', 'random', 'access', 'to', 'the', 'whole', 'decompressed', 'text', 'another', 'folklore', 'solution', 'is', 'to', 'convert', 'lz77', 'into', 'a', 'grammar', 'of', 'size', 'ozlognz', 'and', 'then', 'stream', 's', 'in', 'linear', 'time', 'in', 'this', 'paper', 'we', 'show', 'that', 'on', 'time', 'and', 'oz', 'working', 'space', 'can', 'be', 'achieved', 'for', 'constantsize', 'alphabets', 'on', 'general', 'alphabets', 'of', 'size', 'sigma', 'we', 'describe', 'i', 'a', 'tradeoff', 'achieving', 'onlogdelta', 'sigma', 'time', 'and', 'ozlog1deltasigma', 'space', 'for', 'any', '0leq', 'deltaleq', '1', 'and', 'ii', 'a', 'solution', 'achieving', 'on', 'time', 'and', 'ozloglog', 'nz', 'space', 'the', 'latter', 'solution', 'in', 'particular', 'dominates', 'both', 'folklore', 'algorithms', 'for', 'the', 'problem', 'our', 'solutions', 'can', 'more', 'generally', 'extract', 'any', 'specified', 'subsequence', 'of', 's', 'with', 'little', 'overheads', 'on', 'top', 'of', 'the', 'linear', 'running', 'time', 'and', 'working', 'space', 'as', 'an', 'immediate', 'corollary', 'we', 'show', 'that', 'our', 'techniques', 'yield', 'improved', 'results', 'for', 'pattern', 'matching', 'problems', 'on', 'lz77compressed', 'text']] | [-0.12051493091699855, 0.07841063277451711, -0.06460831129272075, 0.05782182413998539, -0.06397443961330576, -0.13585789657380928, 0.10576696867847309, 0.36666546608025286, -0.29420370068078094, -0.2910533068658558, 0.11005091499752565, -0.24954839304999335, -0.07403817012330054, 0.2136824468899023, -0.0656027641804146, 0.06291055668285386, 0.06940317286899841, 0.08376906752973967, -0.07127474594929907, -0.29256911693286214, 0.28946127220207685, 0.011469435412436724, 0.23599957497225202, 0.017328395093710435, 0.1345032266303466, 0.021942956978724355, -0.025475148270391143, 0.02334253205376074, -0.11961849239182785, 0.06599952110339688, 0.2670458466059534, 0.20336594899330354, 0.24389331810434775, -0.4020711194967442, -0.18128029872108833, 0.10922961005122761, 0.17064823713045935, 0.11364731843976271, -0.021293287557523532, -0.24709605040820046, 0.1290618762026697, -0.10040368541881356, -0.061562460400379465, -0.03153681289413042, 0.09149153749700743, -0.030743583878017747, -0.2862177163825473, -0.00044461417232634706, 0.09517474491091148, 0.005067599598167604, -0.044758580252259025, -0.12965729452247027, 0.04882412133913358, 0.12415928457664445, 0.026350447340771514, 0.11131014274110253, 0.04542627759113628, -0.1131891656345338, -0.12079465777661673, 0.40481192446340714, -0.08796732898430112, -0.21634690747246405, 0.14977303595481323, -0.09408747483949269, -0.14488758061705642, 0.10654173802175274, 0.2037089235806095, 0.1373822719102316, -0.055704972405266555, 0.1597404351001713, -0.08271961523666763, 0.26637159915091846, 0.12034424685474722, 0.036002891212553755, 0.09819222126974364, 0.20242112498821938, 0.08554637622669597, 0.1352003665036667, -0.06029243132562479, -0.05963946435219646, -0.31025396742874145, -0.1783557616583357, -0.1875281622054626, 0.03044590945059509, -0.145088828106396, -0.15715905081351542, 0.35645366442050636, 0.12329125315532347, 0.21549889437768155, 0.14949281098347325, 0.256375150523563, 0.09313627680954711, 0.040573870133328645, 0.11791057878502273, 0.11712410663203417, 0.04089379104223059, 0.09576465514612335, -0.1817558693737895, 0.063265155410028, 0.09272198031274224] |
1,802.10348 | An Approach to Sparse Continuous-time System Identification from
Unevenly Sampled Data | In this work, we address the problem of identifying sparse continuous-time
dynamical systems when the spacing between successive samples (the sampling
period) is not constant over time. The proposed approach combines the
leave-one-sample-out cross-validation error trick from machine learning with an
iterative subset growth method to select the subset of basis functions that
governs the dynamics of the system. The least-squares solution using only the
selected subset of basis functions is then used. The approach is illustrated on
two examples: a 6-node feedback ring and the Van der Pol oscillator.
| cs.SY math.DS | in this work we address the problem of identifying sparse continuoustime dynamical systems when the spacing between successive samples the sampling period is not constant over time the proposed approach combines the leaveonesampleout crossvalidation error trick from machine learning with an iterative subset growth method to select the subset of basis functions that governs the dynamics of the system the leastsquares solution using only the selected subset of basis functions is then used the approach is illustrated on two examples a 6node feedback ring and the van der pol oscillator | [['in', 'this', 'work', 'we', 'address', 'the', 'problem', 'of', 'identifying', 'sparse', 'continuoustime', 'dynamical', 'systems', 'when', 'the', 'spacing', 'between', 'successive', 'samples', 'the', 'sampling', 'period', 'is', 'not', 'constant', 'over', 'time', 'the', 'proposed', 'approach', 'combines', 'the', 'leaveonesampleout', 'crossvalidation', 'error', 'trick', 'from', 'machine', 'learning', 'with', 'an', 'iterative', 'subset', 'growth', 'method', 'to', 'select', 'the', 'subset', 'of', 'basis', 'functions', 'that', 'governs', 'the', 'dynamics', 'of', 'the', 'system', 'the', 'leastsquares', 'solution', 'using', 'only', 'the', 'selected', 'subset', 'of', 'basis', 'functions', 'is', 'then', 'used', 'the', 'approach', 'is', 'illustrated', 'on', 'two', 'examples', 'a', '6node', 'feedback', 'ring', 'and', 'the', 'van', 'der', 'pol', 'oscillator']] | [-0.11277258686128665, -0.003275208422399539, -0.09078354631889272, 0.023685811259466307, -0.043230487213639375, -0.1507775474628116, 0.08162448456278071, 0.37228699133794924, -0.3264995019152676, -0.2465831849152561, 0.09478883036618671, -0.2585680156268857, -0.20585962268523872, 0.23737100656779314, -0.06069058856122534, 0.07503110349749807, 0.07950750228271565, 0.007679502326275476, -0.042292235178386116, -0.2986490247474814, 0.3279570147966627, 0.047780641820281744, 0.273496441680684, -0.06858170689189468, 0.13456874153449794, 0.04255280782606199, -0.015622342287480767, -0.014562721055964093, -0.12242328243461419, 0.10701994618416806, 0.22169419203419238, 0.14636981691530143, 0.3996898685581982, -0.3576387546385046, -0.16615530892952599, 0.12115136968945577, 0.12384093321055513, 0.13270921687680212, -0.0006214009177214889, -0.26873895987360313, 0.048806818786860356, -0.16714183782989328, -0.07216496292544021, -0.08159851528630084, -0.030876285031395542, 0.06240243957648255, -0.30820515063400805, 0.05955370533576405, 0.019941792319018117, 0.05131472183910029, -0.07604627228680659, -0.10952135416102299, 0.012755572721785442, 0.10203584752856511, 0.011638045218371024, 0.0430497018215564, 0.13006708269875328, -0.054668941415994515, -0.10732593880278397, 0.34132287092506886, -0.03771655416692903, -0.22973177520642904, 0.16678295015166936, -0.07450559723656625, -0.09926911428655413, 0.1307625029400118, 0.1829825692839222, 0.12326751885914498, -0.1657208305215053, 0.09283377424303167, -0.03035153314174915, 0.2026416145804846, 0.03925348454206621, -0.027494556265248157, 0.13066780150719834, 0.2080528050930959, 0.0517904636670375, 0.12733377147444777, -0.07827962435542511, -0.10947867497717115, -0.2879933667877181, -0.0934978099592792, -0.27325630602850154, -0.005260705098407925, -0.105670595488515, -0.19082461958433586, 0.404516408092935, 0.13521194412500004, 0.17309056253130126, 0.06117775842325169, 0.28051522168309684, 0.11817640382584861, 0.04235113307582982, 0.08312347674721175, 0.19524014085023242, 0.12040495029809377, 0.03617548713307108, -0.25751611033973115, 0.038823445412245666, 0.1586002199963497] |
1,802.10349 | Learning to Adapt Structured Output Space for Semantic Segmentation | Convolutional neural network-based approaches for semantic segmentation rely
on supervision with pixel-level ground truth, but may not generalize well to
unseen image domains. As the labeling process is tedious and labor intensive,
developing algorithms that can adapt source ground truth labels to the target
domain is of great interest. In this paper, we propose an adversarial learning
method for domain adaptation in the context of semantic segmentation.
Considering semantic segmentations as structured outputs that contain spatial
similarities between the source and target domains, we adopt adversarial
learning in the output space. To further enhance the adapted model, we
construct a multi-level adversarial network to effectively perform output space
domain adaptation at different feature levels. Extensive experiments and
ablation study are conducted under various domain adaptation settings,
including synthetic-to-real and cross-city scenarios. We show that the proposed
method performs favorably against the state-of-the-art methods in terms of
accuracy and visual quality.
| cs.CV | convolutional neural networkbased approaches for semantic segmentation rely on supervision with pixellevel ground truth but may not generalize well to unseen image domains as the labeling process is tedious and labor intensive developing algorithms that can adapt source ground truth labels to the target domain is of great interest in this paper we propose an adversarial learning method for domain adaptation in the context of semantic segmentation considering semantic segmentations as structured outputs that contain spatial similarities between the source and target domains we adopt adversarial learning in the output space to further enhance the adapted model we construct a multilevel adversarial network to effectively perform output space domain adaptation at different feature levels extensive experiments and ablation study are conducted under various domain adaptation settings including synthetictoreal and crosscity scenarios we show that the proposed method performs favorably against the stateoftheart methods in terms of accuracy and visual quality | [['convolutional', 'neural', 'networkbased', 'approaches', 'for', 'semantic', 'segmentation', 'rely', 'on', 'supervision', 'with', 'pixellevel', 'ground', 'truth', 'but', 'may', 'not', 'generalize', 'well', 'to', 'unseen', 'image', 'domains', 'as', 'the', 'labeling', 'process', 'is', 'tedious', 'and', 'labor', 'intensive', 'developing', 'algorithms', 'that', 'can', 'adapt', 'source', 'ground', 'truth', 'labels', 'to', 'the', 'target', 'domain', 'is', 'of', 'great', 'interest', 'in', 'this', 'paper', 'we', 'propose', 'an', 'adversarial', 'learning', 'method', 'for', 'domain', 'adaptation', 'in', 'the', 'context', 'of', 'semantic', 'segmentation', 'considering', 'semantic', 'segmentations', 'as', 'structured', 'outputs', 'that', 'contain', 'spatial', 'similarities', 'between', 'the', 'source', 'and', 'target', 'domains', 'we', 'adopt', 'adversarial', 'learning', 'in', 'the', 'output', 'space', 'to', 'further', 'enhance', 'the', 'adapted', 'model', 'we', 'construct', 'a', 'multilevel', 'adversarial', 'network', 'to', 'effectively', 'perform', 'output', 'space', 'domain', 'adaptation', 'at', 'different', 'feature', 'levels', 'extensive', 'experiments', 'and', 'ablation', 'study', 'are', 'conducted', 'under', 'various', 'domain', 'adaptation', 'settings', 'including', 'synthetictoreal', 'and', 'crosscity', 'scenarios', 'we', 'show', 'that', 'the', 'proposed', 'method', 'performs', 'favorably', 'against', 'the', 'stateoftheart', 'methods', 'in', 'terms', 'of', 'accuracy', 'and', 'visual', 'quality']] | [-0.0021400875489537914, -0.027092957489561136, -0.02812223743026455, 0.09494298139709523, -0.13591480824475488, -0.16101688611942033, 0.03928140215032423, 0.5296756246189276, -0.24213542635242144, -0.3479553615177671, 0.06313245123019443, -0.22150075755237292, -0.18735049126048883, 0.16437192568400255, -0.1935156281478703, 0.10149821839178913, 0.1648027596871058, 0.03859314967955773, -0.05779984529828653, -0.2652622647125584, 0.34064049893214055, 0.016887627622733513, 0.3827805377791325, 0.021969637907653425, 0.1328311986887517, -0.04844005845487118, -0.030869449973106384, -0.01906199708697386, -0.0603869384394784, 0.17440093394058445, 0.36538789892258744, 0.23831139668434237, 0.34335596225845316, -0.42652968840673566, -0.26501517752185466, 0.09755078297108412, 0.14534535379498265, 0.1222744859630863, -0.02855532561962415, -0.4103059752906362, 0.08423033347819, -0.16620129240055878, 0.0648464396595955, -0.20659240047757824, -0.05871015546222528, -0.015812647809895376, -0.32095112474324805, 0.03185329981613904, 0.09089407837910889, 0.07849548386409878, -0.10089309565878163, -0.0969251646551614, 0.03444154360098764, 0.21847925625741482, 0.04618920574255753, 0.10121896482538432, 0.1417773750051856, -0.20452466591106108, -0.16641252171248197, 0.32196009883036214, -0.06266203628232082, -0.27631031718725957, 0.25645020918299755, -0.016064673978835344, -0.1316850999991099, 0.0880630805529654, 0.23366335220634937, 0.14560281248763204, -0.11744783220657458, 0.02389973490149714, -0.013293760605156421, 0.19742437810016175, 0.07439889511559158, 0.0009376352253214767, 0.1385232455159227, 0.2635196312020222, 0.04530692189543818, 0.20344876737644274, -0.1713012028093605, -0.06443605179432779, -0.21525975887818882, -0.062357286408854025, -0.2158127999305725, -0.08187559814725925, -0.08007828195530843, -0.15641149131736407, 0.3749747609657546, 0.25967246053817994, 0.19843454538223645, 0.08986430273080866, 0.360605110352238, -0.03557342075898002, 0.0840292712347582, 0.0696908877743408, 0.1406888649147004, -0.03258657918816122, 0.13954208065755666, -0.164190832991153, 0.12344743937098732, 0.07467426819261164] |
1,802.1035 | Spin-dependent magneto-thermopower of narrow-gap lead chalcogenide
quantum wells | A semi-classical analysis of magneto-thermopower behaviour, namely, the
\textit{Seebeck} and \textit{Nernst} effect (NE) in quantum wells of IV-VI lead
salts with significant extrinsic Rashba spin-orbit coupling (RSOC) is performed
in this report. In addition to the spin-dependent Seebeck effect that has been
observed before, we also theoretically predict a similar spin-delineated
behaviour for its thermal analog, the spin-dependent NE. The choice of lead
salts follows from a two-fold advantage they offer, in part, to their superior
thermoelectric properties, especially PbTe, while their low band gaps and high
spin-orbit coupling make them ideal candidates to study \textit{RSOC} in
nanostructures. The calculations show a larger longitudinal magneto-thermopower
for the spin-up electrons while the transverse components are nearly identical.
In contrast, for a magnetic field free case, the related power factor
calculations reveal a significantly higher contribution from the spin-down
ensemble and suffer a reduction with an increase in the electron density. We
also discuss qualitatively the limitations of the semi-classical approach for
the extreme case of a high magnetic field and allude to the observed
thermopower behaviour when the quantum Hall regime is operational. Finally,
techniques to modulate the thermopower are briefly outlined.
| cond-mat.mes-hall cond-mat.mtrl-sci | a semiclassical analysis of magnetothermopower behaviour namely the textitseebeck and textitnernst effect ne in quantum wells of ivvi lead salts with significant extrinsic rashba spinorbit coupling rsoc is performed in this report in addition to the spindependent seebeck effect that has been observed before we also theoretically predict a similar spindelineated behaviour for its thermal analog the spindependent ne the choice of lead salts follows from a twofold advantage they offer in part to their superior thermoelectric properties especially pbte while their low band gaps and high spinorbit coupling make them ideal candidates to study textitrsoc in nanostructures the calculations show a larger longitudinal magnetothermopower for the spinup electrons while the transverse components are nearly identical in contrast for a magnetic field free case the related power factor calculations reveal a significantly higher contribution from the spindown ensemble and suffer a reduction with an increase in the electron density we also discuss qualitatively the limitations of the semiclassical approach for the extreme case of a high magnetic field and allude to the observed thermopower behaviour when the quantum hall regime is operational finally techniques to modulate the thermopower are briefly outlined | [['a', 'semiclassical', 'analysis', 'of', 'magnetothermopower', 'behaviour', 'namely', 'the', 'textitseebeck', 'and', 'textitnernst', 'effect', 'ne', 'in', 'quantum', 'wells', 'of', 'ivvi', 'lead', 'salts', 'with', 'significant', 'extrinsic', 'rashba', 'spinorbit', 'coupling', 'rsoc', 'is', 'performed', 'in', 'this', 'report', 'in', 'addition', 'to', 'the', 'spindependent', 'seebeck', 'effect', 'that', 'has', 'been', 'observed', 'before', 'we', 'also', 'theoretically', 'predict', 'a', 'similar', 'spindelineated', 'behaviour', 'for', 'its', 'thermal', 'analog', 'the', 'spindependent', 'ne', 'the', 'choice', 'of', 'lead', 'salts', 'follows', 'from', 'a', 'twofold', 'advantage', 'they', 'offer', 'in', 'part', 'to', 'their', 'superior', 'thermoelectric', 'properties', 'especially', 'pbte', 'while', 'their', 'low', 'band', 'gaps', 'and', 'high', 'spinorbit', 'coupling', 'make', 'them', 'ideal', 'candidates', 'to', 'study', 'textitrsoc', 'in', 'nanostructures', 'the', 'calculations', 'show', 'a', 'larger', 'longitudinal', 'magnetothermopower', 'for', 'the', 'spinup', 'electrons', 'while', 'the', 'transverse', 'components', 'are', 'nearly', 'identical', 'in', 'contrast', 'for', 'a', 'magnetic', 'field', 'free', 'case', 'the', 'related', 'power', 'factor', 'calculations', 'reveal', 'a', 'significantly', 'higher', 'contribution', 'from', 'the', 'spindown', 'ensemble', 'and', 'suffer', 'a', 'reduction', 'with', 'an', 'increase', 'in', 'the', 'electron', 'density', 'we', 'also', 'discuss', 'qualitatively', 'the', 'limitations', 'of', 'the', 'semiclassical', 'approach', 'for', 'the', 'extreme', 'case', 'of', 'a', 'high', 'magnetic', 'field', 'and', 'allude', 'to', 'the', 'observed', 'thermopower', 'behaviour', 'when', 'the', 'quantum', 'hall', 'regime', 'is', 'operational', 'finally', 'techniques', 'to', 'modulate', 'the', 'thermopower', 'are', 'briefly', 'outlined']] | [-0.13966651817903242, 0.1412662250883311, -0.05992501441459047, 0.06482324216148772, -0.035358641099901916, -0.14998595233767587, 0.039190296447253165, 0.38771862107239424, -0.24438622358309872, -0.30379210911438437, -0.0013239171553931055, -0.31390165498251105, -0.14018953001415507, 0.22390410097385632, -0.011032303691876525, -0.007586894004374125, 0.02082425932509496, -0.029616230253359292, -0.10043590122592302, -0.2188828003395988, 0.2558052090387592, 0.06330460426895655, 0.3250906249585457, 0.11157213620602448, 0.04528079741699173, -0.019322068395621, 0.07009851943233354, 0.045433210723854124, -0.11990066734411073, 0.052379934925257284, 0.24540095194989944, -0.09680219482814764, 0.2100212377680336, -0.4374505346591141, -0.19186023672554584, 0.023911255776613235, 0.12847545968597746, 0.14440070086950685, -0.06787957416854819, -0.22058937934919554, 0.04718873744212928, -0.19810790885588464, -0.13607712000135935, -0.09286698352864241, 0.009835266240469036, -0.006698320763569106, -0.2411043853299782, 0.0913884798534847, 0.06158043799752539, 0.05634477858755048, -0.07658779073411967, -0.17639749817099462, -0.011733665439813214, 0.0722917520914558, 0.08615149073128434, -0.003845239792736297, 0.15733356309686114, -0.15392514499885473, -0.12244042488721443, 0.3799043401458206, -0.09760563084662688, -0.1314531429620948, 0.16107291011089947, -0.20837773084839717, -0.09065667618524263, 0.14777013864480257, 0.130954158085244, 0.0749066262854572, -0.10816099123077101, 0.08733488445280414, 0.021836139186706273, 0.12233147911483393, 0.01311758806167001, 0.11391592802938054, 0.2504248967976932, 0.15367567987818728, 0.01789896795864654, 0.1376168206838373, -0.12781978792116858, -0.049249081832560944, -0.2030170175600498, -0.1722206211509432, -0.18811634379902228, 0.09764842397251969, -0.0727218874368473, -0.16578586452844787, 0.39924384599780655, 0.18332066201097688, 0.17861264507799224, -0.018196989834448073, 0.2710788834461554, 0.1527788122542536, 0.0564249133190668, 0.03693419924742956, 0.3110526294284376, 0.16731992109683666, 0.1298948443210858, -0.3255115007654201, 0.06477014201240026, -0.04143243636512621] |
1,802.10351 | Efficient Black-Box Reductions for Separable Cost Sharing | In cost sharing games with delays, a set of agents jointly allocates a finite
subset of resources. Each resource has a fixed cost that has to be shared by
the players, and each agent has a nonshareable player-specific delay for each
resource. A prominent example is uncapacitated facility location (UFL), where
facilities need to be opened (at a shareable cost) and clients want to connect
to opened facilities. Each client pays a cost share and his non-shareable
physical connection cost. Given any profile of subsets allocated by the agents,
a separable cost sharing protocol determines cost shares that satisfy budget
balance on every resource and separability over the resources. Moreover, a
separable protocol guarantees existence of pure Nash equilibria in the induced
strategic game for the agents. In this paper, we study separable cost sharing
protocols in several general combinatorial domains. We provide black-box
reductions to reduce the design of a separable cost-sharing protocol to the
design of an approximation algorithm for the underlying cost minimization
problem. In this way, we obtain new separable cost-sharing protocols in games
based on arbitrary player-specific matroids, single-source connection games
without delays, and connection games on $n$-series-parallel graphs with delays.
All these reductions are efficiently computable - given an initial allocation
profile, we obtain a cheaper profile and separable cost shares turning the
profile into a pure Nash equilibrium. Hence, in these domains any approximation
algorithm can be used to obtain a separable cost sharing protocol with a price
of stability bounded by the approximation factor.
| cs.GT cs.DM cs.DS math.OC | in cost sharing games with delays a set of agents jointly allocates a finite subset of resources each resource has a fixed cost that has to be shared by the players and each agent has a nonshareable playerspecific delay for each resource a prominent example is uncapacitated facility location ufl where facilities need to be opened at a shareable cost and clients want to connect to opened facilities each client pays a cost share and his nonshareable physical connection cost given any profile of subsets allocated by the agents a separable cost sharing protocol determines cost shares that satisfy budget balance on every resource and separability over the resources moreover a separable protocol guarantees existence of pure nash equilibria in the induced strategic game for the agents in this paper we study separable cost sharing protocols in several general combinatorial domains we provide blackbox reductions to reduce the design of a separable costsharing protocol to the design of an approximation algorithm for the underlying cost minimization problem in this way we obtain new separable costsharing protocols in games based on arbitrary playerspecific matroids singlesource connection games without delays and connection games on nseriesparallel graphs with delays all these reductions are efficiently computable given an initial allocation profile we obtain a cheaper profile and separable cost shares turning the profile into a pure nash equilibrium hence in these domains any approximation algorithm can be used to obtain a separable cost sharing protocol with a price of stability bounded by the approximation factor | [['in', 'cost', 'sharing', 'games', 'with', 'delays', 'a', 'set', 'of', 'agents', 'jointly', 'allocates', 'a', 'finite', 'subset', 'of', 'resources', 'each', 'resource', 'has', 'a', 'fixed', 'cost', 'that', 'has', 'to', 'be', 'shared', 'by', 'the', 'players', 'and', 'each', 'agent', 'has', 'a', 'nonshareable', 'playerspecific', 'delay', 'for', 'each', 'resource', 'a', 'prominent', 'example', 'is', 'uncapacitated', 'facility', 'location', 'ufl', 'where', 'facilities', 'need', 'to', 'be', 'opened', 'at', 'a', 'shareable', 'cost', 'and', 'clients', 'want', 'to', 'connect', 'to', 'opened', 'facilities', 'each', 'client', 'pays', 'a', 'cost', 'share', 'and', 'his', 'nonshareable', 'physical', 'connection', 'cost', 'given', 'any', 'profile', 'of', 'subsets', 'allocated', 'by', 'the', 'agents', 'a', 'separable', 'cost', 'sharing', 'protocol', 'determines', 'cost', 'shares', 'that', 'satisfy', 'budget', 'balance', 'on', 'every', 'resource', 'and', 'separability', 'over', 'the', 'resources', 'moreover', 'a', 'separable', 'protocol', 'guarantees', 'existence', 'of', 'pure', 'nash', 'equilibria', 'in', 'the', 'induced', 'strategic', 'game', 'for', 'the', 'agents', 'in', 'this', 'paper', 'we', 'study', 'separable', 'cost', 'sharing', 'protocols', 'in', 'several', 'general', 'combinatorial', 'domains', 'we', 'provide', 'blackbox', 'reductions', 'to', 'reduce', 'the', 'design', 'of', 'a', 'separable', 'costsharing', 'protocol', 'to', 'the', 'design', 'of', 'an', 'approximation', 'algorithm', 'for', 'the', 'underlying', 'cost', 'minimization', 'problem', 'in', 'this', 'way', 'we', 'obtain', 'new', 'separable', 'costsharing', 'protocols', 'in', 'games', 'based', 'on', 'arbitrary', 'playerspecific', 'matroids', 'singlesource', 'connection', 'games', 'without', 'delays', 'and', 'connection', 'games', 'on', 'nseriesparallel', 'graphs', 'with', 'delays', 'all', 'these', 'reductions', 'are', 'efficiently', 'computable', 'given', 'an', 'initial', 'allocation', 'profile', 'we', 'obtain', 'a', 'cheaper', 'profile', 'and', 'separable', 'cost', 'shares', 'turning', 'the', 'profile', 'into', 'a', 'pure', 'nash', 'equilibrium', 'hence', 'in', 'these', 'domains', 'any', 'approximation', 'algorithm', 'can', 'be', 'used', 'to', 'obtain', 'a', 'separable', 'cost', 'sharing', 'protocol', 'with', 'a', 'price', 'of', 'stability', 'bounded', 'by', 'the', 'approximation', 'factor']] | [-0.17564004357348406, 0.02440321839317368, -0.11829503810957014, 0.0662138065372053, -0.09508126746626541, -0.26901316859256175, 0.1637702672089818, 0.425793616769595, -0.31588815222494304, -0.29036001903155156, 0.0731995961748086, -0.24179937309705682, -0.08340839459419987, 0.11938383263130221, -0.14821174769707385, 0.06110302867713354, 0.08091203425635374, 0.027235118397290915, -0.0027831455717234584, -0.31118869842048885, 0.3173983138117511, 0.0412777389564942, 0.2454773103217444, 0.04630446371682469, 0.11890778866326136, 0.028673276559622478, 0.01887833665598244, 0.055775780293662404, -0.10835077412664232, 0.11373493281961043, 0.3338900148247053, 0.24157981060993589, 0.4039343380061309, -0.42754834476657, -0.16869018156120869, 0.1916998277893365, 0.06348017095062401, 0.06803879950753218, -0.02545564296991459, -0.23650289874058217, 0.04056321179462342, -0.21211142906723846, -0.08255975707734545, -0.04771538096341124, -0.007044268593627719, 0.03508422387136717, -0.3159456471386816, -0.05518180816697197, -0.029480443379255913, 0.015405091042104628, -0.07607439135327079, -0.08097415107570874, 0.008709978621130088, 0.16074311278381145, -0.04955747528959276, 0.020960269954934295, 0.11412502802141394, -0.11559246888294095, -0.20417717815707287, 0.4042153061713062, -0.0011627268104348332, -0.21412797003323514, 0.13663592260573135, -0.03848532838521585, -0.14389420779761783, 0.11457021514915171, 0.19466700571619214, 0.09263555652315487, -0.1416661810569255, 0.09168107806744369, -0.09152133372657362, 0.18051083190667053, 0.0951403435882962, 0.09481958441005366, 0.1016684248517718, 0.14119648022179102, 0.23591473055327492, 0.1654629970345864, 0.06406560714352846, -0.144799659962319, -0.2636402532488348, -0.14312509057157102, -0.1894011822986349, 0.046471304430123116, -0.11220282239728183, -0.11012762932918005, 0.37831764917955885, 0.06732936585103744, 0.12163852587447412, 0.1474877603430932, 0.3361822360705945, 0.08865973812622073, 0.03665093112654323, 0.2028941209014926, 0.13154812685153897, 0.0339102404625831, 0.10237190194170727, -0.20953169745541433, 0.14424715349413153, 0.047500279700773626] |
1,802.10352 | Regression Monte Carlo for Microgrid Management | We study an islanded microgrid system designed to supply a small village with
the power produced by photovoltaic panels, wind turbines and a diesel
generator. A battery storage system device is used to shift power from times of
high renewable production to times of high demand. We introduce a methodology
to solve microgrid management problem using different variants of Regression
Monte Carlo algorithms and use numerical simulations to infer results about the
optimal design of the grid.
| math.OC | we study an islanded microgrid system designed to supply a small village with the power produced by photovoltaic panels wind turbines and a diesel generator a battery storage system device is used to shift power from times of high renewable production to times of high demand we introduce a methodology to solve microgrid management problem using different variants of regression monte carlo algorithms and use numerical simulations to infer results about the optimal design of the grid | [['we', 'study', 'an', 'islanded', 'microgrid', 'system', 'designed', 'to', 'supply', 'a', 'small', 'village', 'with', 'the', 'power', 'produced', 'by', 'photovoltaic', 'panels', 'wind', 'turbines', 'and', 'a', 'diesel', 'generator', 'a', 'battery', 'storage', 'system', 'device', 'is', 'used', 'to', 'shift', 'power', 'from', 'times', 'of', 'high', 'renewable', 'production', 'to', 'times', 'of', 'high', 'demand', 'we', 'introduce', 'a', 'methodology', 'to', 'solve', 'microgrid', 'management', 'problem', 'using', 'different', 'variants', 'of', 'regression', 'monte', 'carlo', 'algorithms', 'and', 'use', 'numerical', 'simulations', 'to', 'infer', 'results', 'about', 'the', 'optimal', 'design', 'of', 'the', 'grid']] | [-0.1451791517871928, 0.03644032770478282, -0.0009380823799542018, 0.014154061502716565, -0.047471918818819056, -0.17341708907760778, 0.06892356390810826, 0.38252417298106406, -0.29478853432969615, -0.3552850055713932, 0.1280517454452619, -0.30418052652536276, -0.036465571467559056, 0.2630655447591108, -0.14143037800858546, 0.09844388608373218, 0.09594841090835292, -0.07970763728409619, 0.008757415675110632, -0.19310447666491684, 0.19158744110496012, 0.18616946408065496, 0.3396735279155629, -0.00205985229317244, 0.17752751835029235, -0.07601576535539194, 0.018869558044606455, 0.006572952826640436, -0.10397904669539398, 0.16595505783183187, 0.27981515422572273, 0.15479493263032432, 0.31032005465262896, -0.49817916404988083, -0.19622983793159585, 0.11498724738462501, 0.06831116083247418, 0.016329409503196547, -0.06077364153325461, -0.15355876101144625, 0.13613921441984447, -0.3369289317906096, -0.08423977214903511, -0.05267279581832034, -0.05942797842254112, 0.1074946431485428, -0.3486648707154703, -0.03019431470469995, -0.06078559979297487, 0.07176602942953733, -0.0538095110851981, -0.08508248346277161, -0.04220585535316692, 0.10511792548206429, 0.042389475252152746, -0.06712330385812788, 0.20658071555632662, -0.08316937229269511, -0.15374529973132076, 0.4022720019732203, 0.022095971547260687, -0.15221081732155442, 0.11144253840161995, -0.08663270909448045, -0.1020686036495903, 0.11898756525539733, 0.3173637740047915, 0.09820151643513085, -0.2117381761116641, -0.01762590268415145, 0.04441697369390107, 0.20445508241060784, -0.014472493339426719, -0.06269892971575647, 0.1880219927323716, 0.26915269589366075, 0.12509204386869544, 0.17775138250140884, -0.07986735373541906, -0.09851088638526279, -0.21840133689730973, -0.11641341162385879, -0.15773345247612564, 0.058708272600703715, -0.09144212248661047, -0.1678766238974867, 0.3977720854054024, 0.22377014036635057, 0.08671460278912799, 0.039703916419636116, 0.38791501555930485, 0.15303790947881998, 0.05756793396211798, 0.1383496053916003, 0.11016095388837933, 0.07458079865432114, 0.2103725972452334, -0.2642775469719638, 0.04414061662535389, 0.018936532912413023] |
1,802.10353 | Relational Neural Expectation Maximization: Unsupervised Discovery of
Objects and their Interactions | Common-sense physical reasoning is an essential ingredient for any
intelligent agent operating in the real-world. For example, it can be used to
simulate the environment, or to infer the state of parts of the world that are
currently unobserved. In order to match real-world conditions this causal
knowledge must be learned without access to supervised data. To address this
problem we present a novel method that learns to discover objects and model
their physical interactions from raw visual images in a purely
\emph{unsupervised} fashion. It incorporates prior knowledge about the
compositional nature of human perception to factor interactions between
object-pairs and learn efficiently. On videos of bouncing balls we show the
superior modelling capabilities of our method compared to other unsupervised
neural approaches that do not incorporate such prior knowledge. We demonstrate
its ability to handle occlusion and show that it can extrapolate learned
knowledge to scenes with different numbers of objects.
| cs.LG cs.AI cs.NE | commonsense physical reasoning is an essential ingredient for any intelligent agent operating in the realworld for example it can be used to simulate the environment or to infer the state of parts of the world that are currently unobserved in order to match realworld conditions this causal knowledge must be learned without access to supervised data to address this problem we present a novel method that learns to discover objects and model their physical interactions from raw visual images in a purely emphunsupervised fashion it incorporates prior knowledge about the compositional nature of human perception to factor interactions between objectpairs and learn efficiently on videos of bouncing balls we show the superior modelling capabilities of our method compared to other unsupervised neural approaches that do not incorporate such prior knowledge we demonstrate its ability to handle occlusion and show that it can extrapolate learned knowledge to scenes with different numbers of objects | [['commonsense', 'physical', 'reasoning', 'is', 'an', 'essential', 'ingredient', 'for', 'any', 'intelligent', 'agent', 'operating', 'in', 'the', 'realworld', 'for', 'example', 'it', 'can', 'be', 'used', 'to', 'simulate', 'the', 'environment', 'or', 'to', 'infer', 'the', 'state', 'of', 'parts', 'of', 'the', 'world', 'that', 'are', 'currently', 'unobserved', 'in', 'order', 'to', 'match', 'realworld', 'conditions', 'this', 'causal', 'knowledge', 'must', 'be', 'learned', 'without', 'access', 'to', 'supervised', 'data', 'to', 'address', 'this', 'problem', 'we', 'present', 'a', 'novel', 'method', 'that', 'learns', 'to', 'discover', 'objects', 'and', 'model', 'their', 'physical', 'interactions', 'from', 'raw', 'visual', 'images', 'in', 'a', 'purely', 'emphunsupervised', 'fashion', 'it', 'incorporates', 'prior', 'knowledge', 'about', 'the', 'compositional', 'nature', 'of', 'human', 'perception', 'to', 'factor', 'interactions', 'between', 'objectpairs', 'and', 'learn', 'efficiently', 'on', 'videos', 'of', 'bouncing', 'balls', 'we', 'show', 'the', 'superior', 'modelling', 'capabilities', 'of', 'our', 'method', 'compared', 'to', 'other', 'unsupervised', 'neural', 'approaches', 'that', 'do', 'not', 'incorporate', 'such', 'prior', 'knowledge', 'we', 'demonstrate', 'its', 'ability', 'to', 'handle', 'occlusion', 'and', 'show', 'that', 'it', 'can', 'extrapolate', 'learned', 'knowledge', 'to', 'scenes', 'with', 'different', 'numbers', 'of', 'objects']] | [-0.02685409730041264, 0.02058068493202665, -0.11308130616127877, 0.09243083245194955, -0.1928067493687279, -0.14247839976817567, 0.025274114737237823, 0.4633478404867728, -0.2848146889568461, -0.3953956233307454, 0.03967536728758217, -0.25381568782278247, -0.18610470485410943, 0.15626901735178508, -0.1547838582422905, 0.04389868648946347, 0.1004180481305827, 0.07643937626668554, -0.02007438243052225, -0.2423350788199571, 0.31639518738964834, 0.0075080083152711, 0.27087058960587335, 0.02166623154821627, 0.13708456444464598, -0.030443412080616846, -0.03904505197301088, -0.027096709643570794, -0.05558530781792002, 0.1585154866048795, 0.3497854473180329, 0.21573023931955956, 0.26938066715436265, -0.454055700710179, -0.27062041990363367, 0.11369671403208365, 0.11665592948360282, 0.1101533892126569, 0.016426081822364783, -0.3585769159114913, 0.09961130627005405, -0.14912020762000752, -0.07242394693269832, -0.1840482081736851, -0.03789598935835729, -0.055836144520204196, -0.30337207861220006, 0.0034698424552450117, 0.10909847342655901, 0.032835292777922374, -0.07467650213442274, -0.07111763096100725, 0.01879070445876692, 0.22663417004745776, 0.028969168631415444, 0.01206536487127278, 0.16545320975143982, -0.1727429563117935, -0.1443873648778443, 0.38369818602916816, -0.013027505021286351, -0.2203929510263615, 0.24976924948381962, -0.07802811423270341, -0.11724839661739125, 0.1074734548590954, 0.25016397254122114, 0.10603347898997514, -0.19566001014981343, -0.001345596825534367, -0.036895646288102824, 0.22037787222001232, 0.0312896459240047, 0.0013854458745197386, 0.20403740685687566, 0.20977434562827577, 0.009662422679969116, 0.10168200428944563, -0.07432012383776736, -0.10358303887245325, -0.22473637937315252, -0.0974128514602287, -0.2026480449469982, 0.0088609612381297, -0.10218238770710814, -0.13310432138774522, 0.34273722173880466, 0.31775235248396533, 0.22451078559392262, 0.0667740038321631, 0.351719758528846, -0.020480842479899376, 0.11435436851974108, 0.08042138305165811, 0.1859174385074748, -0.0025527756414468715, 0.12954795198046312, -0.1678658819877672, 0.13047120074081597, -0.0055161589395797605] |
1,802.10354 | Multiscale relevance and informative encoding in neuronal spike trains | Neuronal responses to complex stimuli and tasks can encompass a wide range of
time scales. Understanding these responses requires measures that characterize
how the information on these response patterns are represented across multiple
temporal resolutions. In this paper we propose a metric -- which we call
multiscale relevance (MSR) -- to capture the dynamical variability of the
activity of single neurons across different time scales. The MSR is a
non-parametric, fully featureless indicator in that it uses only the time
stamps of the firing activity without resorting to any a priori covariate or
invoking any specific structure in the tuning curve for neural activity. When
applied to neural data from the mEC and from the ADn and PoS regions of
freely-behaving rodents, we found that neurons having low MSR tend to have low
mutual information and low firing sparsity across the correlates that are
believed to be encoded by the region of the brain where the recordings were
made. In addition, neurons with high MSR contain significant information on
spatial navigation and allow to decode spatial position or head direction as
efficiently as those neurons whose firing activity has high mutual information
with the covariate to be decoded and significantly better than the set of
neurons with high local variations in their interspike intervals. Given these
results, we propose that the MSR can be used as a measure to rank and select
neurons for their information content without the need to appeal to any a
priori covariate.
| q-bio.NC q-bio.QM | neuronal responses to complex stimuli and tasks can encompass a wide range of time scales understanding these responses requires measures that characterize how the information on these response patterns are represented across multiple temporal resolutions in this paper we propose a metric which we call multiscale relevance msr to capture the dynamical variability of the activity of single neurons across different time scales the msr is a nonparametric fully featureless indicator in that it uses only the time stamps of the firing activity without resorting to any a priori covariate or invoking any specific structure in the tuning curve for neural activity when applied to neural data from the mec and from the adn and pos regions of freelybehaving rodents we found that neurons having low msr tend to have low mutual information and low firing sparsity across the correlates that are believed to be encoded by the region of the brain where the recordings were made in addition neurons with high msr contain significant information on spatial navigation and allow to decode spatial position or head direction as efficiently as those neurons whose firing activity has high mutual information with the covariate to be decoded and significantly better than the set of neurons with high local variations in their interspike intervals given these results we propose that the msr can be used as a measure to rank and select neurons for their information content without the need to appeal to any a priori covariate | [['neuronal', 'responses', 'to', 'complex', 'stimuli', 'and', 'tasks', 'can', 'encompass', 'a', 'wide', 'range', 'of', 'time', 'scales', 'understanding', 'these', 'responses', 'requires', 'measures', 'that', 'characterize', 'how', 'the', 'information', 'on', 'these', 'response', 'patterns', 'are', 'represented', 'across', 'multiple', 'temporal', 'resolutions', 'in', 'this', 'paper', 'we', 'propose', 'a', 'metric', 'which', 'we', 'call', 'multiscale', 'relevance', 'msr', 'to', 'capture', 'the', 'dynamical', 'variability', 'of', 'the', 'activity', 'of', 'single', 'neurons', 'across', 'different', 'time', 'scales', 'the', 'msr', 'is', 'a', 'nonparametric', 'fully', 'featureless', 'indicator', 'in', 'that', 'it', 'uses', 'only', 'the', 'time', 'stamps', 'of', 'the', 'firing', 'activity', 'without', 'resorting', 'to', 'any', 'a', 'priori', 'covariate', 'or', 'invoking', 'any', 'specific', 'structure', 'in', 'the', 'tuning', 'curve', 'for', 'neural', 'activity', 'when', 'applied', 'to', 'neural', 'data', 'from', 'the', 'mec', 'and', 'from', 'the', 'adn', 'and', 'pos', 'regions', 'of', 'freelybehaving', 'rodents', 'we', 'found', 'that', 'neurons', 'having', 'low', 'msr', 'tend', 'to', 'have', 'low', 'mutual', 'information', 'and', 'low', 'firing', 'sparsity', 'across', 'the', 'correlates', 'that', 'are', 'believed', 'to', 'be', 'encoded', 'by', 'the', 'region', 'of', 'the', 'brain', 'where', 'the', 'recordings', 'were', 'made', 'in', 'addition', 'neurons', 'with', 'high', 'msr', 'contain', 'significant', 'information', 'on', 'spatial', 'navigation', 'and', 'allow', 'to', 'decode', 'spatial', 'position', 'or', 'head', 'direction', 'as', 'efficiently', 'as', 'those', 'neurons', 'whose', 'firing', 'activity', 'has', 'high', 'mutual', 'information', 'with', 'the', 'covariate', 'to', 'be', 'decoded', 'and', 'significantly', 'better', 'than', 'the', 'set', 'of', 'neurons', 'with', 'high', 'local', 'variations', 'in', 'their', 'interspike', 'intervals', 'given', 'these', 'results', 'we', 'propose', 'that', 'the', 'msr', 'can', 'be', 'used', 'as', 'a', 'measure', 'to', 'rank', 'and', 'select', 'neurons', 'for', 'their', 'information', 'content', 'without', 'the', 'need', 'to', 'appeal', 'to', 'any', 'a', 'priori', 'covariate']] | [-0.07116224490989911, 0.11542049383421485, -0.0685879470818505, 0.0883097609885189, -0.08402306190311756, -0.15366362166657513, 0.06036785775605513, 0.4344244447289681, -0.2783207032031247, -0.33947329220114925, 0.08636492518090395, -0.25908921186869244, -0.18898484650191527, 0.1399695192074061, -0.1315699036890042, 0.04251492812098669, 0.03006750650475828, 0.10078013512039823, -0.03934078476277693, -0.2181925656986708, 0.27944210605239683, 0.058778913360925354, 0.293484362602538, -0.0009162653142548337, 0.1252072052830564, -0.02182136723695665, -0.03138090650793355, 0.0050708558220340285, -0.05824498753327691, 0.13760863092480874, 0.32273454743684554, 0.16627414665869153, 0.28529656291559186, -0.46248078452689306, -0.2780140978436233, 0.12253605247931365, 0.14179925371569638, 0.1020688822307643, 0.009343920212847238, -0.2724435375395174, 0.12101562526391829, -0.12655433413705655, -0.010339932850495512, -0.10674599203262097, -0.00363196671930883, 0.057946357238866694, -0.2918602399558912, 0.0932623752183756, 0.028902174318945796, 0.09752952049709666, -0.06157736377980636, -0.048340781979566934, -0.031903528058141166, 0.22714155903240496, 0.014532004146627626, 0.055060725755115246, 0.16148538279480168, -0.1392619599379143, -0.09693552943858869, 0.31343860401943024, -0.036619710138516635, -0.22387091279390972, 0.22579586092449191, -0.16304969799251068, -0.10465969386301478, 0.12043069585948726, 0.22486923719347662, 0.06933858633333607, -0.16653820890131435, -0.03571495771329679, 0.00022834088577299702, 0.25183308170158036, 0.08663018579233665, 0.07580458960419863, 0.20737423933662322, 0.15383518848625222, 0.03724179855471819, 0.09923954493109594, -0.13261017564978755, -0.048799330020817565, -0.23243538881675815, -0.05588245644158094, -0.16724419106482244, 0.005834494088538827, -0.13234720054250068, -0.1521065689623356, 0.43492127670621383, 0.16216904626385908, 0.23950217018968292, 0.09419800456986306, 0.2607223116906778, 0.07098116213176638, 0.1568135668680414, 0.09211994749969062, 0.16722143036123288, 0.06915366863831877, 0.11639076301409881, -0.2031275079623625, 0.14728911395507807, -0.0057179413859409335] |
1,802.10355 | Improved Upper Bounds on all Maximal $\alpha$-gapped Repeats and
Palindromes | We show that the number of all maximal $\alpha$-gapped repeats and
palindromes of a word of length $n$ is at most $3(\pi^2/6 + 5/2) \alpha n$ and
$7 (\pi^2 / 6 + 1/2) \alpha n - 5 n - 1$, respectively.
| cs.FL | we show that the number of all maximal alphagapped repeats and palindromes of a word of length n is at most 3pi26 52 alpha n and 7 pi2 6 12 alpha n 5 n 1 respectively | [['we', 'show', 'that', 'the', 'number', 'of', 'all', 'maximal', 'alphagapped', 'repeats', 'and', 'palindromes', 'of', 'a', 'word', 'of', 'length', 'n', 'is', 'at', 'most', '3pi26', '52', 'alpha', 'n', 'and', '7', 'pi2', '6', '12', 'alpha', 'n', '5', 'n', '1', 'respectively']] | [-0.24973674055405093, 0.2896364714684231, 0.1061749728529581, 0.018624471987797212, 0.08175379451630371, -0.21181789906695486, 0.05584807135164738, 0.32659025745732445, -0.2447963990437399, -0.3731229060595589, 0.053938489926180666, -0.42966990407024114, -0.08541180495438831, 0.16290250372673784, 0.044457063424800124, 0.006553417540687535, -0.03311756089595812, 0.15566497868193047, -0.01819154342769512, -0.33623811953834126, 0.1872347226898585, -0.08813976219722203, 0.13172803594331656, -0.03381800156618867, 0.04420134747134788, -0.013181866904986756, -0.029035883503300802, -0.049466757369892936, -0.15403239206248795, 0.06024481864379985, 0.23046510081206048, 0.17512333967855997, 0.2625337228178978, -0.2923556577414274, -0.03993479771805661, 0.12841742842325143, 0.2350987406713622, 0.02502183855644294, 0.048022115496652466, -0.08871396259803857, 0.23576444525803839, -0.14426977054349013, -0.12915103265217373, 0.09406920714037759, 0.2640702929879938, -0.010432478013847555, -0.26362062501055855, 0.03374931769711631, 0.13059708827308247, 0.07375834485782044, 0.030080668927569474, -0.27416671618287053, 0.022527503528233087, 0.11219584501315175, -0.007387426156284554, 0.08799921586843473, 0.02173854143225721, -0.07581536560984595, -0.12820930734077202, 0.28449044791715483, -0.04714342286544187, -0.14366527960768768, 0.0743930410593748, -0.26486538645944424, -0.17204113344528846, 0.2186426482695554, 0.018307588143008095, 0.1341320240737072, 0.019293996186128686, 0.1372268060854237, -0.0876957685819694, 0.3330836041697434, 0.22262554381574903, 0.019461384881287812, 0.036497328323977334, 0.13023598917893, 0.0763888848280268, 0.05639792752585241, -0.1635171883872577, 0.09181612829810806, -0.3493970994438444, -0.16195844422493663, -0.16109541572430836, 0.13192227921847785, -0.23617655086647055, -0.07427067181893758, 0.3016734924699579, 0.06961784376097577, 0.27732378244400024, 0.17365167931254422, 0.10523278604128532, -0.007082604989409447, -0.006945605190204722, 0.14982909212953277, 0.0606586115700858, 0.06136002779073481, -0.042338547642741885, -0.21642069929678526, -0.06065170715696045, 0.08632835570190633] |
1,802.10356 | Distinctive Picosecond Spin Polarization Dynamics in Bulk Half-Metals | Femtosecond laser excitations in half-metal (HM) compounds are theoretically
predicted to induce an exotic picosecond spin dynamics. In particular,
conversely to what is observed in conventional metals and semiconductors, the
thermalization process in HMs leads to a long living partially thermalized
configuration characterized by three Fermi--Dirac distributions for the
minority, majority conduction and majority valence electrons respectively.
Remarkably, these distributions have the same temperature but different
chemical potentials. This unusual thermodynamics state causes a persistent
non-equilibrium spin polarization only well above the Fermi energy. Femtosecond
spin dynamics experiments performed on Fe$_3$O$_4$ by time-, spin-, and
angle-resolved photoelectron spectroscopy confirm our model. Furthermore, the
spin polarization response proves to be very robust and it can be adopted to
selectively test the bulk HM character in a wide range of compounds.
| cond-mat.mtrl-sci | femtosecond laser excitations in halfmetal hm compounds are theoretically predicted to induce an exotic picosecond spin dynamics in particular conversely to what is observed in conventional metals and semiconductors the thermalization process in hms leads to a long living partially thermalized configuration characterized by three fermidirac distributions for the minority majority conduction and majority valence electrons respectively remarkably these distributions have the same temperature but different chemical potentials this unusual thermodynamics state causes a persistent nonequilibrium spin polarization only well above the fermi energy femtosecond spin dynamics experiments performed on fe_3o_4 by time spin and angleresolved photoelectron spectroscopy confirm our model furthermore the spin polarization response proves to be very robust and it can be adopted to selectively test the bulk hm character in a wide range of compounds | [['femtosecond', 'laser', 'excitations', 'in', 'halfmetal', 'hm', 'compounds', 'are', 'theoretically', 'predicted', 'to', 'induce', 'an', 'exotic', 'picosecond', 'spin', 'dynamics', 'in', 'particular', 'conversely', 'to', 'what', 'is', 'observed', 'in', 'conventional', 'metals', 'and', 'semiconductors', 'the', 'thermalization', 'process', 'in', 'hms', 'leads', 'to', 'a', 'long', 'living', 'partially', 'thermalized', 'configuration', 'characterized', 'by', 'three', 'fermidirac', 'distributions', 'for', 'the', 'minority', 'majority', 'conduction', 'and', 'majority', 'valence', 'electrons', 'respectively', 'remarkably', 'these', 'distributions', 'have', 'the', 'same', 'temperature', 'but', 'different', 'chemical', 'potentials', 'this', 'unusual', 'thermodynamics', 'state', 'causes', 'a', 'persistent', 'nonequilibrium', 'spin', 'polarization', 'only', 'well', 'above', 'the', 'fermi', 'energy', 'femtosecond', 'spin', 'dynamics', 'experiments', 'performed', 'on', 'fe_3o_4', 'by', 'time', 'spin', 'and', 'angleresolved', 'photoelectron', 'spectroscopy', 'confirm', 'our', 'model', 'furthermore', 'the', 'spin', 'polarization', 'response', 'proves', 'to', 'be', 'very', 'robust', 'and', 'it', 'can', 'be', 'adopted', 'to', 'selectively', 'test', 'the', 'bulk', 'hm', 'character', 'in', 'a', 'wide', 'range', 'of', 'compounds']] | [-0.1024131543434391, 0.2870851415652798, -0.07206132378277563, 0.09311580944988462, -0.007711647814789484, -0.16432534118883255, 0.0703931794016326, 0.4517287080024564, -0.284048505824117, -0.30609352478049984, -0.02943184814513336, -0.2973012182854347, -0.06504010541415088, 0.17680305030825005, 0.04015939269041599, 0.020632072357287586, -0.006719612992953422, -0.08425787535979766, -0.08480725045380898, -0.20106894987573948, 0.2307438895913101, 0.05288562564135984, 0.3350558872370757, 0.08542168658775415, 0.054883669742361404, 0.005505630670678477, 0.11881196495983028, 0.0004875753616351028, -0.08000386075593635, 0.012831327032528875, 0.2868930873526044, -0.0846477692275373, 0.1607357849287548, -0.4484627507338228, -0.2656619687701843, 0.019304900523997092, 0.10744569779783415, 0.1380032856927015, -0.07239128848855463, -0.2741086028927807, 0.017827778358857127, -0.1730343533261109, -0.13968666643445748, -0.15006970841159625, -0.007654329473080561, 0.006238298028591991, -0.20289834052353173, 0.1028405928942772, 0.0637483918351706, 0.042891717761350694, -0.1096591343002235, -0.1003957686425988, -0.09274630871233205, 0.036057811670813913, 0.05166864797699467, 0.02596424269587408, 0.1624022592075689, -0.11745296231138902, -0.1355325176034036, 0.35551981225089974, -0.08841765532631052, -0.1149551547529508, 0.20432411560557726, -0.2460104464932323, -0.08115380011542245, 0.1689188075775295, 0.100097944578941, 0.16589360587053406, -0.1702325544283949, 0.033293595921984595, -0.004874142327223175, 0.20962746690799908, 0.04908752720983511, 0.09306632312260164, 0.2956522083155407, 0.19785590154162153, -0.006434344605347792, 0.10098101011777022, -0.11960208685454991, -0.0888106048417588, -0.17284901081692688, -0.1399669461746433, -0.24292622988704274, 0.1103317957521956, -0.006168759528587233, -0.13780800152801034, 0.4282634055689555, 0.1319992198525791, 0.15902501594477383, -0.057922430655940674, 0.22835998913605315, 0.09209463083051694, 0.050150629571574026, 0.0196763726940393, 0.257965703816117, 0.14517247251256607, 0.1103519522729366, -0.29534357810725076, 0.10405851065816517, -0.034988283583995444] |
1,802.10357 | Axion-electron coupling from the RGB tip of Globular Clusters | We present a preliminary study of the Globular Cluster RGB devoted to improve
the available constraint for the axion-electron coupling. By means of
multi-band IR photometry of the cluster M3 we obtain g_{ae}/10^{-13} < 2.57
(95\% C.L.).
| astro-ph.SR | we present a preliminary study of the globular cluster rgb devoted to improve the available constraint for the axionelectron coupling by means of multiband ir photometry of the cluster m3 we obtain g_ae1013 257 95 cl | [['we', 'present', 'a', 'preliminary', 'study', 'of', 'the', 'globular', 'cluster', 'rgb', 'devoted', 'to', 'improve', 'the', 'available', 'constraint', 'for', 'the', 'axionelectron', 'coupling', 'by', 'means', 'of', 'multiband', 'ir', 'photometry', 'of', 'the', 'cluster', 'm3', 'we', 'obtain', 'g_ae1013', '257', '95', 'cl']] | [-0.09498388788280343, 0.033799706931625095, -0.05698795744350978, 0.07347709430780794, -0.10593425934868199, -0.03717542592702167, 0.1991034556379808, 0.36267918795347215, -0.1088253600788968, -0.3865487851202488, 0.064329855649599, -0.26351887360215187, -0.02760396120803697, 0.1951656749072884, -0.019940465515745538, -0.011199315637350082, 0.1365544635270323, 0.008672776552183287, -0.02920309481809714, -0.33143876402505806, 0.2575714394982372, 0.04469120079385383, 0.21341036890766452, -0.0020914799400738307, 0.06101208864045995, 0.011325488239526749, -0.08011104134576662, -0.05267384030989238, -0.24619490512247597, 0.16281308239059789, 0.191415434290788, 0.12285153924354485, 0.18217667484922068, -0.3421968426023211, -0.15097791983612946, 0.036411667482129165, 0.2001331123390368, 0.04388525608394827, -0.05077503511815199, -0.32685678516115463, 0.083967985718378, -0.1918918422556349, -0.15536054328882268, 0.013378099471862828, -0.01609892818544592, -0.00818888548362468, -0.25732360311916896, 0.13330564530832426, -0.021684937421897692, 0.11889869469617094, -0.15148326440581253, -0.2033338853291103, -0.009469910138951881, 0.12478599892929196, -0.039088178159935136, 0.09436587825683611, 0.06828122498201472, -0.08497141038200685, 0.0011943196611745018, 0.37751367959593024, -0.14633219745010137, -0.018593525939754076, 0.15542220140674284, -0.13754986476685319, -0.24471356049180032, 0.06150754200560706, 0.1356444881430694, 0.11737985292981779, -0.28932185811655864, 0.14866956558876804, 0.020531466363796165, 0.23221411034464837, 0.015856069991631166, 0.07040060392713972, 0.20674959250858851, 0.22770925536751746, 0.06193329995231969, 0.17605727570397514, -0.2444236653590841, 0.03457295507458704, -0.2754471263715199, -0.09862673604262194, -0.1201543201293264, 0.05046500638127327, -0.14742016179952772, -0.10516811085066625, 0.3186623398746763, 0.15824948229960034, 0.18393807938721563, 0.04124134281384093, 0.23315335051821812, 0.11129092925361224, 0.04433621105604938, 0.010742394972060408, 0.3690302059586559, 0.17753983534473394, 0.05553410537540913, -0.2641816117135542, -0.048641381771968945, 0.039930781083447595] |
1,802.10358 | Charge Transfer in Classical Molecular Dynamics Simulations of
Met-enkephalin: Improving Traditional Force Field with Data Driven Models | The charge transfer and polarization effects are important components in the
molecular mechanism description of bio-molecules. Classical force field with
fixed point charge cannot take into the account of the non-negligible
correlation between atomic charge and structure changes. In this work, high
throughput ab initio calculations for the pentapeptide Met-enkephalin (MetEnk)
reveal that geometric dependent charge transfer among residues is significant
among tens of thousands of conformations. And we suggest a data driven model
with machine learning algorithms to solve the geometric dependent charge
fluctuations problem. This data driven model can directly provide ab initio
level atomic charges of any structure for MetEnk, and avoids self-consistent
iteration in polarizable force field. Molecular dynamics simulations
demonstrated that the data driven model provides a possible choice to describe
the explicit charge flux with minor modification of available classical force
fields. This work provides us an alternative molecular mechanism model for
future dynamics simulation of oligopeptides.
| physics.chem-ph physics.bio-ph | the charge transfer and polarization effects are important components in the molecular mechanism description of biomolecules classical force field with fixed point charge cannot take into the account of the nonnegligible correlation between atomic charge and structure changes in this work high throughput ab initio calculations for the pentapeptide metenkephalin metenk reveal that geometric dependent charge transfer among residues is significant among tens of thousands of conformations and we suggest a data driven model with machine learning algorithms to solve the geometric dependent charge fluctuations problem this data driven model can directly provide ab initio level atomic charges of any structure for metenk and avoids selfconsistent iteration in polarizable force field molecular dynamics simulations demonstrated that the data driven model provides a possible choice to describe the explicit charge flux with minor modification of available classical force fields this work provides us an alternative molecular mechanism model for future dynamics simulation of oligopeptides | [['the', 'charge', 'transfer', 'and', 'polarization', 'effects', 'are', 'important', 'components', 'in', 'the', 'molecular', 'mechanism', 'description', 'of', 'biomolecules', 'classical', 'force', 'field', 'with', 'fixed', 'point', 'charge', 'can', 'not', 'take', 'into', 'the', 'account', 'of', 'the', 'nonnegligible', 'correlation', 'between', 'atomic', 'charge', 'and', 'structure', 'changes', 'in', 'this', 'work', 'high', 'throughput', 'ab', 'initio', 'calculations', 'for', 'the', 'pentapeptide', 'metenkephalin', 'metenk', 'reveal', 'that', 'geometric', 'dependent', 'charge', 'transfer', 'among', 'residues', 'is', 'significant', 'among', 'tens', 'of', 'thousands', 'of', 'conformations', 'and', 'we', 'suggest', 'a', 'data', 'driven', 'model', 'with', 'machine', 'learning', 'algorithms', 'to', 'solve', 'the', 'geometric', 'dependent', 'charge', 'fluctuations', 'problem', 'this', 'data', 'driven', 'model', 'can', 'directly', 'provide', 'ab', 'initio', 'level', 'atomic', 'charges', 'of', 'any', 'structure', 'for', 'metenk', 'and', 'avoids', 'selfconsistent', 'iteration', 'in', 'polarizable', 'force', 'field', 'molecular', 'dynamics', 'simulations', 'demonstrated', 'that', 'the', 'data', 'driven', 'model', 'provides', 'a', 'possible', 'choice', 'to', 'describe', 'the', 'explicit', 'charge', 'flux', 'with', 'minor', 'modification', 'of', 'available', 'classical', 'force', 'fields', 'this', 'work', 'provides', 'us', 'an', 'alternative', 'molecular', 'mechanism', 'model', 'for', 'future', 'dynamics', 'simulation', 'of', 'oligopeptides']] | [-0.1403764525771533, 0.11221340049364938, -0.10080329663622634, 0.05929091074473323, -0.04938343141724257, -0.13058995342764415, 0.05245271864757677, 0.387985620353567, -0.2938424405047523, -0.3255260675980121, -0.038599951570320534, -0.2612513105437086, -0.13579949443106, 0.15940676145347474, 0.03318613268263442, 0.01218044708672862, 0.06675032751732751, -0.03711913229792691, -0.04394908905248342, -0.15196452292361515, 0.2742146384016929, 0.11382033321148667, 0.2692092178867346, 0.10220972959895765, 0.10885079544095788, 0.018292161482876462, -0.03159906344004221, 0.018303811877941417, -0.1312342922797382, 0.1318365253058992, 0.23194602316882657, 0.04342360825179831, 0.24372637618982576, -0.5290940952070645, -0.23656756491982378, 0.07361882899299656, 0.12180114945237476, 0.17238992650527507, -0.09337977926540923, -0.2027617111238406, 0.03318977918225803, -0.15042495866931094, -0.1339584525037361, -0.15185969015031955, 0.026273569957610515, 0.05181730582338978, -0.28027564916824066, 0.10572009365147862, 0.017846531202514216, 0.08289136255490648, -0.1120315862208372, -0.11652876725297813, -0.020548126975834174, 0.12020915925600811, 0.023882460245850348, 0.07555094044628756, 0.23247567445842401, -0.11115599312133302, -0.12611844336673753, 0.3793255115804066, -0.038069608310347815, -0.2033200172131489, 0.15918688390918664, -0.11695417845131535, -0.1409470407096179, 0.16955458998104164, 0.12958300926459887, 0.0995237789527317, -0.1699323890015397, 0.06631641809087198, 0.010025332803228306, 0.19523738188715806, 0.006709193458511053, 0.023399475701520907, 0.24296381353327123, 0.1725808910376049, 0.006072510021160844, 0.09262133872222253, -0.10051638023517291, -0.17152347715952937, -0.2533300439582059, -0.12210513230437707, -0.16886489820133552, 0.06080875694485593, -0.08530015932391459, -0.1529438587558137, 0.35868842903475623, 0.19295467141828818, 0.16009476932154748, -0.027974185141685762, 0.31690395840958346, 0.07629641695989688, 0.07877519667817978, 0.03288734762157362, 0.2211660479982751, 0.1291167388645638, 0.06253793878836165, -0.2771182496400893, 0.051102969527403876, 0.013658631139581925] |
1,802.10359 | Sivers effect in Inelastic $J/\psi$ Photoproduction in $ep^\uparrow$
Collision in Color Octet Model | The prediction of single-spin asymmetry in inelastic photoproduction of
$J/\psi$ in $ep^\uparrow$ collision is presented. At next-to-leading order, the
dominating process is photon-gluon fusion, $\gamma+g\rightarrow J/\psi+g$ for
the production of $J/\psi$ in $e+p^\uparrow\rightarrow J/\psi+X$, which
directly probes the gluon Sivers function. Using the non-relativistic QCD based
color octet model, the color octet states $\leftidx{^{3}}{S}{_1}^{(8)}$,
$\leftidx{^{1}}{S}{_0}^{(8)}$ and $\leftidx{^{3}}{P}{_{J(0,1,2)}}^{(8)}$
contribution to $J/\psi$ production is calculated. Sizable asymmetry is
estimated as a function of transverse momentum $P_T$ and energy fraction $z$ of
$J/\psi$ in the range $0<P_T\leq 1$ GeV and $0.3<z\leq 0.9$. The unpolarized
differential cross section of inelastic $J/\psi$ photoproduction is found to be
in good agreement with H1 and ZEUS data.
| hep-ph hep-ex | the prediction of singlespin asymmetry in inelastic photoproduction of jpsi in epuparrow collision is presented at nexttoleading order the dominating process is photongluon fusion gammagrightarrow jpsig for the production of jpsi in epuparrowrightarrow jpsix which directly probes the gluon sivers function using the nonrelativistic qcd based color octet model the color octet states leftidx3s_18 leftidx1s_08 and leftidx3p_j0128 contribution to jpsi production is calculated sizable asymmetry is estimated as a function of transverse momentum p_t and energy fraction z of jpsi in the range 0p_tleq 1 gev and 03zleq 09 the unpolarized differential cross section of inelastic jpsi photoproduction is found to be in good agreement with h1 and zeus data | [['the', 'prediction', 'of', 'singlespin', 'asymmetry', 'in', 'inelastic', 'photoproduction', 'of', 'jpsi', 'in', 'epuparrow', 'collision', 'is', 'presented', 'at', 'nexttoleading', 'order', 'the', 'dominating', 'process', 'is', 'photongluon', 'fusion', 'gammagrightarrow', 'jpsig', 'for', 'the', 'production', 'of', 'jpsi', 'in', 'epuparrowrightarrow', 'jpsix', 'which', 'directly', 'probes', 'the', 'gluon', 'sivers', 'function', 'using', 'the', 'nonrelativistic', 'qcd', 'based', 'color', 'octet', 'model', 'the', 'color', 'octet', 'states', 'leftidx3s_18', 'leftidx1s_08', 'and', 'leftidx3p_j0128', 'contribution', 'to', 'jpsi', 'production', 'is', 'calculated', 'sizable', 'asymmetry', 'is', 'estimated', 'as', 'a', 'function', 'of', 'transverse', 'momentum', 'p_t', 'and', 'energy', 'fraction', 'z', 'of', 'jpsi', 'in', 'the', 'range', '0p_tleq', '1', 'gev', 'and', '03zleq', '09', 'the', 'unpolarized', 'differential', 'cross', 'section', 'of', 'inelastic', 'jpsi', 'photoproduction', 'is', 'found', 'to', 'be', 'in', 'good', 'agreement', 'with', 'h1', 'and', 'zeus', 'data']] | [-0.024230810890462504, 0.2350615818523666, -0.15344283421686625, 0.1688450581063857, -0.028389104415924803, -0.03398789191003708, -0.02801261600830312, 0.36280814717406207, -0.18016365995106187, -0.19875737663032939, -0.1589473330074451, -0.4093861822038889, 0.12594880430859703, 0.09495819098704937, 0.12648807600755424, 0.1603667898628029, 0.09280204896810035, 0.008957612888833273, 0.017146974725160493, -0.21986232895982785, 0.31396025241108483, 0.017689306420066112, 0.23541814861005372, 0.24114579880311723, 0.051541127717728244, 0.13551003106042417, -0.0487226485715528, -0.09459704512422815, -0.13748537990020462, 0.017358669488424055, 0.31779354100694285, 0.012023752923711266, 0.051945207301454924, -0.28541239595167267, -0.039656947457312956, 0.1297080330957559, 0.1554677738057612, 0.066586013891264, -0.06680781699861717, -0.26786106375941227, 0.13351460814349425, -0.2621693656219224, -0.05917067493275893, -0.06720878440633561, 0.04242811041422984, -0.0520994299966209, -0.39997127916193703, 0.14443625685153078, -0.10471380568896103, 0.004946909216458647, -0.03141042783187287, -0.2528630967514173, -0.13046572250268848, -0.04703429666827026, 0.09120367446239558, 0.22166334575910157, 0.19541964752744267, -0.2087037207341744, -0.21001576338397357, 0.378738585081928, -0.028153551648624098, -0.13540080932954562, 0.0387524785281801, -0.2707183145945078, -0.10551982665280767, 0.19568431949315285, 0.2626374347096714, 0.08046550002374045, -0.2284139378077703, 0.08308093393791141, -0.01452907147699768, 0.19289952903778013, 0.09835483786679389, 0.08833724343678767, 0.1082119480525912, 0.25317847084941214, -0.08785646710798, 0.02923651234341731, -0.14884921297141648, -0.0877733296732807, -0.44089108108750824, -0.09415090956625718, -0.08031986625040022, 0.09985123099804431, -0.0693179877984645, -0.02944566380657545, 0.3196513484666142, 0.04024117714408966, 0.3561462685171949, -0.025877489166976252, 0.377758653888714, 0.15611079460161387, 0.05616361241407909, 0.08048440867727533, 0.30474120402907573, 0.2543120035241602, 0.1874171335745187, -0.27298229587834005, 0.054085325422579225, 0.016569723203344253] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.