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,801.10469 | Topological Defects in the Georgi-Machacek Model | We study topological defects in the Georgi-Machacek model in a hierarchical
symmetry breaking in which extra triplets acquire vacuum expectation values
before the doublet. We find a possibility of topologically stable non-Abelian
domain walls and non-Abelian flux tubes (vortices) in this model. In the limit
of the vanishing $U(1)_{\rm Y}$ gauge coupling in which the custodial symmetry
becomes exact, the presence of a vortex spontaneously breaks the custodial
symmetry, giving rise to $S^2$ Nambu-Goldstone (NG) modes localized around the
vortex corresponding to non-Abelian fluxes. Vortices are continuously
degenerated by these degrees of freedom, thereby called non-Abelian. By taking
into account the $U(1)_{\rm Y}$ gauge coupling, the custodial symmetry is
explicitly broken, the NG modes are lifted, and all non-Abelian vortices fall
into a topologically stable $Z$-string. This is in contrast to the SM in which
$Z$-strings are non-topological and are unstable in the realistic parameter
region.Non-Abelian domain walls also break the custodial symmetry and are
accompanied by localized $S^2$ NG modes. Finally, we discuss the existence of
domain wall solutions bounded by flux tubes, where their $S^2$ NG modes match.
The domain walls may quantum mechanically decay by creating a hole bounded by a
flux tube loop, and would be cosmologically safe. Gravitational waves produced
from unstable domain walls could be detected by future experiments
| hep-ph hep-th | we study topological defects in the georgimachacek model in a hierarchical symmetry breaking in which extra triplets acquire vacuum expectation values before the doublet we find a possibility of topologically stable nonabelian domain walls and nonabelian flux tubes vortices in this model in the limit of the vanishing u1_rm y gauge coupling in which the custodial symmetry becomes exact the presence of a vortex spontaneously breaks the custodial symmetry giving rise to s2 nambugoldstone ng modes localized around the vortex corresponding to nonabelian fluxes vortices are continuously degenerated by these degrees of freedom thereby called nonabelian by taking into account the u1_rm y gauge coupling the custodial symmetry is explicitly broken the ng modes are lifted and all nonabelian vortices fall into a topologically stable zstring this is in contrast to the sm in which zstrings are nontopological and are unstable in the realistic parameter regionnonabelian domain walls also break the custodial symmetry and are accompanied by localized s2 ng modes finally we discuss the existence of domain wall solutions bounded by flux tubes where their s2 ng modes match the domain walls may quantum mechanically decay by creating a hole bounded by a flux tube loop and would be cosmologically safe gravitational waves produced from unstable domain walls could be detected by future experiments | [['we', 'study', 'topological', 'defects', 'in', 'the', 'georgimachacek', 'model', 'in', 'a', 'hierarchical', 'symmetry', 'breaking', 'in', 'which', 'extra', 'triplets', 'acquire', 'vacuum', 'expectation', 'values', 'before', 'the', 'doublet', 'we', 'find', 'a', 'possibility', 'of', 'topologically', 'stable', 'nonabelian', 'domain', 'walls', 'and', 'nonabelian', 'flux', 'tubes', 'vortices', 'in', 'this', 'model', 'in', 'the', 'limit', 'of', 'the', 'vanishing', 'u1_rm', 'y', 'gauge', 'coupling', 'in', 'which', 'the', 'custodial', 'symmetry', 'becomes', 'exact', 'the', 'presence', 'of', 'a', 'vortex', 'spontaneously', 'breaks', 'the', 'custodial', 'symmetry', 'giving', 'rise', 'to', 's2', 'nambugoldstone', 'ng', 'modes', 'localized', 'around', 'the', 'vortex', 'corresponding', 'to', 'nonabelian', 'fluxes', 'vortices', 'are', 'continuously', 'degenerated', 'by', 'these', 'degrees', 'of', 'freedom', 'thereby', 'called', 'nonabelian', 'by', 'taking', 'into', 'account', 'the', 'u1_rm', 'y', 'gauge', 'coupling', 'the', 'custodial', 'symmetry', 'is', 'explicitly', 'broken', 'the', 'ng', 'modes', 'are', 'lifted', 'and', 'all', 'nonabelian', 'vortices', 'fall', 'into', 'a', 'topologically', 'stable', 'zstring', 'this', 'is', 'in', 'contrast', 'to', 'the', 'sm', 'in', 'which', 'zstrings', 'are', 'nontopological', 'and', 'are', 'unstable', 'in', 'the', 'realistic', 'parameter', 'regionnonabelian', 'domain', 'walls', 'also', 'break', 'the', 'custodial', 'symmetry', 'and', 'are', 'accompanied', 'by', 'localized', 's2', 'ng', 'modes', 'finally', 'we', 'discuss', 'the', 'existence', 'of', 'domain', 'wall', 'solutions', 'bounded', 'by', 'flux', 'tubes', 'where', 'their', 's2', 'ng', 'modes', 'match', 'the', 'domain', 'walls', 'may', 'quantum', 'mechanically', 'decay', 'by', 'creating', 'a', 'hole', 'bounded', 'by', 'a', 'flux', 'tube', 'loop', 'and', 'would', 'be', 'cosmologically', 'safe', 'gravitational', 'waves', 'produced', 'from', 'unstable', 'domain', 'walls', 'could', 'be', 'detected', 'by', 'future', 'experiments']] | [-0.21699147110044117, 0.31250865599129596, -0.024993706470521543, 0.1070095555782493, -0.10934477359135177, -0.16373626317855128, 0.022413054464444762, 0.3445361335390191, -0.20902722808827554, -0.2610453954250705, 0.10291705067223594, -0.23503054498078327, -0.04446195716152029, 0.04254814877913731, -0.001806854982007767, -0.007808082810198088, -0.03551197374958825, -0.009579236116347738, -0.03210990980459911, -0.19788749246451426, 0.27123880798342537, -0.03972012707318656, 0.31227877142318816, 0.031948403924257615, 0.03665751551863838, -0.07194041383087618, 0.05463522211801558, -0.017502014678268923, -0.12346981089994499, 0.04900796991497488, 0.17752471404639839, -0.02201313269652531, 0.13068979398561686, -0.47468770120922527, -0.20578849832898993, 0.11863482940806505, 0.21705115561377905, 0.15113979484394036, -0.04321209836216696, -0.4081401101186732, 0.09458884070906132, -0.14205927164550705, -0.15467913752583515, -0.09958203420252867, 0.00032311192595622907, -0.09868148662600264, -0.2554172320649937, 0.1147909408669969, 0.07703173326403821, 0.021602359919550833, -0.0465170349575964, -0.027956019770140877, -0.17876685516331609, 0.018183257953294427, 0.16762422519832185, 0.03243091961717618, 0.14141519647911455, -0.1904613898592638, -0.12373603488227895, 0.3845312664582626, -0.06519858002309586, -0.22012738577515695, 0.13026239904422016, -0.11216916700282917, -0.1071164071260806, 0.1956951650615803, 0.10342025737160108, 0.09167439708302558, -0.07661510042642886, 0.1767379745757404, -0.02228858752696482, 0.12540630761702312, 0.08964576802277684, 0.045059322539122315, 0.34199936596563024, 0.09880905210624226, 0.0719840240975221, 0.15188315497086047, -0.055243897869387215, -0.1071888002973627, -0.39122974924183507, -0.1248463352310292, -0.13531540373303083, 0.04762525821898238, -0.06047502841149782, -0.14298985436112738, 0.4213501512129822, 0.08905311018134797, 0.19613552689984082, -0.01112499157187612, 0.20985968095936897, 0.07860415001310181, 0.10532598745322704, 0.05734794574982089, 0.2752201966416668, 0.13705538850968502, 0.038066650299189236, -0.258954534638332, -0.1181803231975807, 0.09452446060680933] |
1,801.1047 | Hyperfine interaction with the $^{229}$Th nucleus and its low lying
isomeric state | The thorium nucleus with mass number $A=229$ has attracted much interest
because its extremely low lying first excited isomeric state at about $8$eV
opens the possibility for the development of a nuclear clock. However, neither
the exact energy of this nuclear isomer nor properties, such as nuclear
magnetic dipole and electric quadrupole moment are known to a high precision so
far. The latter can be determined by investigating the hyperfine structure of
thorium atoms or ions. Due to its electronic structure and the long lifetime of
the nuclear isomeric state, Th$^{2+}$ is especially suitable for such kind of
studies. In this letter we present a combined experimental and theoretical
investigation of the hyperfine structure of the $^{229}$Th$^{2+}$ ion in the
nuclear ground and isomeric state. A very good agreement between theory and
experiment is found for the nuclear ground state. Moreover, we use our
calculations to confirm the recently presented experimental value for the
nuclear magnetic dipole moment of the thorium nuclear isomer, which was in
contradiction to previous theoretical studies.
| physics.atom-ph nucl-th physics.comp-ph | the thorium nucleus with mass number a229 has attracted much interest because its extremely low lying first excited isomeric state at about 8ev opens the possibility for the development of a nuclear clock however neither the exact energy of this nuclear isomer nor properties such as nuclear magnetic dipole and electric quadrupole moment are known to a high precision so far the latter can be determined by investigating the hyperfine structure of thorium atoms or ions due to its electronic structure and the long lifetime of the nuclear isomeric state th2 is especially suitable for such kind of studies in this letter we present a combined experimental and theoretical investigation of the hyperfine structure of the 229th2 ion in the nuclear ground and isomeric state a very good agreement between theory and experiment is found for the nuclear ground state moreover we use our calculations to confirm the recently presented experimental value for the nuclear magnetic dipole moment of the thorium nuclear isomer which was in contradiction to previous theoretical studies | [['the', 'thorium', 'nucleus', 'with', 'mass', 'number', 'a229', 'has', 'attracted', 'much', 'interest', 'because', 'its', 'extremely', 'low', 'lying', 'first', 'excited', 'isomeric', 'state', 'at', 'about', '8ev', 'opens', 'the', 'possibility', 'for', 'the', 'development', 'of', 'a', 'nuclear', 'clock', 'however', 'neither', 'the', 'exact', 'energy', 'of', 'this', 'nuclear', 'isomer', 'nor', 'properties', 'such', 'as', 'nuclear', 'magnetic', 'dipole', 'and', 'electric', 'quadrupole', 'moment', 'are', 'known', 'to', 'a', 'high', 'precision', 'so', 'far', 'the', 'latter', 'can', 'be', 'determined', 'by', 'investigating', 'the', 'hyperfine', 'structure', 'of', 'thorium', 'atoms', 'or', 'ions', 'due', 'to', 'its', 'electronic', 'structure', 'and', 'the', 'long', 'lifetime', 'of', 'the', 'nuclear', 'isomeric', 'state', 'th2', 'is', 'especially', 'suitable', 'for', 'such', 'kind', 'of', 'studies', 'in', 'this', 'letter', 'we', 'present', 'a', 'combined', 'experimental', 'and', 'theoretical', 'investigation', 'of', 'the', 'hyperfine', 'structure', 'of', 'the', '229th2', 'ion', 'in', 'the', 'nuclear', 'ground', 'and', 'isomeric', 'state', 'a', 'very', 'good', 'agreement', 'between', 'theory', 'and', 'experiment', 'is', 'found', 'for', 'the', 'nuclear', 'ground', 'state', 'moreover', 'we', 'use', 'our', 'calculations', 'to', 'confirm', 'the', 'recently', 'presented', 'experimental', 'value', 'for', 'the', 'nuclear', 'magnetic', 'dipole', 'moment', 'of', 'the', 'thorium', 'nuclear', 'isomer', 'which', 'was', 'in', 'contradiction', 'to', 'previous', 'theoretical', 'studies']] | [-0.0643407353695989, 0.1730198188334946, -0.023159871555688466, 0.0802100125711257, -0.018743543855338936, -0.06280121072223024, 0.07234323669098229, 0.3992123642286076, -0.1959695211617199, -0.33130721663009133, 0.05292891377111974, -0.2634155499423749, -0.0012762906813729533, 0.1596894954694931, 0.05729693224510321, 0.053960174602489454, 0.05511898611198295, 0.09272425764477288, -0.08345066414410303, -0.12039967076219177, 0.2660740052195563, 0.1242921377791191, 0.25770329677957227, 0.119339179328256, 0.04968501449997961, -0.04574649144355318, 0.06786002278790848, -0.024933162768035245, -0.10868268907786562, 0.16006566588518886, 0.2741635895620745, 0.044635557131456026, 0.22526459578154664, -0.45185038698671837, -0.16980020246418887, 0.09910798586626708, 0.10682306039979207, 0.20151709479806096, -0.1278825117596811, -0.312961972566575, 0.04953418742416195, -0.1942171011541656, -0.1561674869045155, -0.14561565487353495, 0.046605314803516394, 0.027806647822464756, -0.24971284476190134, 0.0651913788407275, 0.0100257971390156, 0.06477674470001869, -0.1398857657001326, -0.22006840004238504, 0.011832282802685213, 0.09063431998499884, 0.07997994518634924, 0.06737492293720106, 0.15684574650746588, -0.11048930348861499, -0.07834974893495529, 0.3837273908205904, -0.019080396355873733, -0.0643329434653058, 0.15292587547257167, -0.21083687451225844, -0.16617372932639965, 0.15273200224302488, 0.08089446552309963, 0.11507734159812243, -0.10679740754621567, 0.06254568987249771, -0.014212137777027647, 0.2164808258259665, 0.028971972023880868, 0.08841557673983015, 0.1978796504316686, 0.17248325218438287, 0.024426927834132015, 0.09274594601839244, -0.13518470641192512, -0.10116719222798415, -0.22839782672476838, -0.13798470209013758, -0.19596902409447192, 0.0774531841822094, 0.02276962674844572, -0.10963815131042837, 0.3993093384617179, 0.05828187100798685, 0.1719708089446704, -0.10280669328120134, 0.284902938481795, 0.06135762078389966, 0.030557822025540842, 0.018791205457758885, 0.3474141200618631, 0.23509127301296232, 0.0813671656272556, -0.3233544996184622, 0.11742095283050774, -0.0065119495620012844] |
1,801.10471 | Optimization of the beam crossing angle at the ILC for e+e- and
gamma-gamma collisions | At this time, the design of the International Linear Collider (ILC) is
optimized for e+e- collisions; the photon collider (gamma-gamma and
gamma-electron) is considered as an option. Unexpected discoveries, such as the
diphoton excess F(750 GeV) seen at the LHC, could strongly motivate the
construction of a photon collider. In order to enable the gamma-gamma collision
option, the ILC design should be compatible with it from the very beginning. In
this paper, we discuss the problem of the beam crossing angle. In the ILC
technical design, this angle is 14 mrad, which is just enough to provide enough
space for the final quadrupoles and outgoing beams. For gamma-gamma collisions,
the crossing angle must be larger because the low-energy electrons that result
from multiple Compton scattering get large disruption angles in collisions with
the opposing electron beam and some deflection in the solenoidal detector
field. For a 2E=500 GeV collider, the required crossing angle is about 25 mrad.
In this paper, we consider the factors that determine the crossing angle as
well as its minimum permissible value that does not yet cause a considerable
reduction of the gamma-gamma luminosity. It is shown that the best solution is
to increase the laser wavelength from the current 1 \mum (which is optimal for
2E=500 GeV) to 2 \mum as this makes possible achieving high gamma-gamma
luminosities at a crossing angle of 20 mrad, which is also quite comfortable
for e+e- collisions, does not cause any degradation of the e+e- luminosity and
opens the possibility for a more energetic future collider in the same tunnel
(e.g., CLIC). Moreover, the 2 \mum wavelength is optimal for a 2E = 1 TeV
collider, e.g., a possible ILC energy upgrade. Please consider this paper an
appeal to increase the ILC crossing angle from 14 to 20 mrad.
| physics.acc-ph hep-ex physics.ins-det | at this time the design of the international linear collider ilc is optimized for ee collisions the photon collider gammagamma and gammaelectron is considered as an option unexpected discoveries such as the diphoton excess f750 gev seen at the lhc could strongly motivate the construction of a photon collider in order to enable the gammagamma collision option the ilc design should be compatible with it from the very beginning in this paper we discuss the problem of the beam crossing angle in the ilc technical design this angle is 14 mrad which is just enough to provide enough space for the final quadrupoles and outgoing beams for gammagamma collisions the crossing angle must be larger because the lowenergy electrons that result from multiple compton scattering get large disruption angles in collisions with the opposing electron beam and some deflection in the solenoidal detector field for a 2e500 gev collider the required crossing angle is about 25 mrad in this paper we consider the factors that determine the crossing angle as well as its minimum permissible value that does not yet cause a considerable reduction of the gammagamma luminosity it is shown that the best solution is to increase the laser wavelength from the current 1 mum which is optimal for 2e500 gev to 2 mum as this makes possible achieving high gammagamma luminosities at a crossing angle of 20 mrad which is also quite comfortable for ee collisions does not cause any degradation of the ee luminosity and opens the possibility for a more energetic future collider in the same tunnel eg clic moreover the 2 mum wavelength is optimal for a 2e 1 tev collider eg a possible ilc energy upgrade please consider this paper an appeal to increase the ilc crossing angle from 14 to 20 mrad | [['at', 'this', 'time', 'the', 'design', 'of', 'the', 'international', 'linear', 'collider', 'ilc', 'is', 'optimized', 'for', 'ee', 'collisions', 'the', 'photon', 'collider', 'gammagamma', 'and', 'gammaelectron', 'is', 'considered', 'as', 'an', 'option', 'unexpected', 'discoveries', 'such', 'as', 'the', 'diphoton', 'excess', 'f750', 'gev', 'seen', 'at', 'the', 'lhc', 'could', 'strongly', 'motivate', 'the', 'construction', 'of', 'a', 'photon', 'collider', 'in', 'order', 'to', 'enable', 'the', 'gammagamma', 'collision', 'option', 'the', 'ilc', 'design', 'should', 'be', 'compatible', 'with', 'it', 'from', 'the', 'very', 'beginning', 'in', 'this', 'paper', 'we', 'discuss', 'the', 'problem', 'of', 'the', 'beam', 'crossing', 'angle', 'in', 'the', 'ilc', 'technical', 'design', 'this', 'angle', 'is', '14', 'mrad', 'which', 'is', 'just', 'enough', 'to', 'provide', 'enough', 'space', 'for', 'the', 'final', 'quadrupoles', 'and', 'outgoing', 'beams', 'for', 'gammagamma', 'collisions', 'the', 'crossing', 'angle', 'must', 'be', 'larger', 'because', 'the', 'lowenergy', 'electrons', 'that', 'result', 'from', 'multiple', 'compton', 'scattering', 'get', 'large', 'disruption', 'angles', 'in', 'collisions', 'with', 'the', 'opposing', 'electron', 'beam', 'and', 'some', 'deflection', 'in', 'the', 'solenoidal', 'detector', 'field', 'for', 'a', '2e500', 'gev', 'collider', 'the', 'required', 'crossing', 'angle', 'is', 'about', '25', 'mrad', 'in', 'this', 'paper', 'we', 'consider', 'the', 'factors', 'that', 'determine', 'the', 'crossing', 'angle', 'as', 'well', 'as', 'its', 'minimum', 'permissible', 'value', 'that', 'does', 'not', 'yet', 'cause', 'a', 'considerable', 'reduction', 'of', 'the', 'gammagamma', 'luminosity', 'it', 'is', 'shown', 'that', 'the', 'best', 'solution', 'is', 'to', 'increase', 'the', 'laser', 'wavelength', 'from', 'the', 'current', '1', 'mum', 'which', 'is', 'optimal', 'for', '2e500', 'gev', 'to', '2', 'mum', 'as', 'this', 'makes', 'possible', 'achieving', 'high', 'gammagamma', 'luminosities', 'at', 'a', 'crossing', 'angle', 'of', '20', 'mrad', 'which', 'is', 'also', 'quite', 'comfortable', 'for', 'ee', 'collisions', 'does', 'not', 'cause', 'any', 'degradation', 'of', 'the', 'ee', 'luminosity', 'and', 'opens', 'the', 'possibility', 'for', 'a', 'more', 'energetic', 'future', 'collider', 'in', 'the', 'same', 'tunnel', 'eg', 'clic', 'moreover', 'the', '2', 'mum', 'wavelength', 'is', 'optimal', 'for', 'a', '2e', '1', 'tev', 'collider', 'eg', 'a', 'possible', 'ilc', 'energy', 'upgrade', 'please', 'consider', 'this', 'paper', 'an', 'appeal', 'to', 'increase', 'the', 'ilc', 'crossing', 'angle', 'from', '14', 'to', '20', 'mrad']] | [-0.09265601135138109, 0.1858712504830514, -0.06303962164555335, 0.10897845063540419, -0.08229459680911617, -0.1697443983853114, 0.007949071975114444, 0.3870779819283258, -0.24915123016256777, -0.31670045357366855, 0.05259951023754949, -0.30431665424947385, 0.004940729500076762, 0.2013672390703413, 0.006077171877177075, 0.07467502976045709, 0.09053321808861939, -0.023042709503055515, -0.04825376759844547, -0.2010974799602697, 0.2307378376719639, 0.1995098976150268, 0.21090915853154504, 0.12863622447130857, 0.09934581081172834, 0.04946093107981338, 0.03527526744337194, -0.04490536031000056, -0.1116081890483506, 0.05973284537880446, 0.3062257439812162, 0.08407803539889128, 0.19866466477061762, -0.3357655279377949, -0.10520543943064033, 0.13683789123871962, 0.13600669972869406, 0.07584928401184554, -0.03327343362386092, -0.22468524443233379, 0.08389974538584143, -0.2191282487019696, -0.16833636998622256, 0.04342995875166974, 0.023826537295150562, -0.03980403181529206, -0.297536892029347, 0.012030143050774022, 0.0015382696549103968, 0.03733340482621827, 0.006606406208852099, -0.1370171729697899, -0.022411096115950935, -0.009825656166212376, 0.08618218176653264, 0.09003249324171456, 0.16075677762606874, -0.14419471212468338, -0.14106366214630905, 0.39764705656240584, -0.002351244159114566, -0.1279038754660285, 0.17394430368749883, -0.2166940805687246, -0.07501853639559793, 0.2057190048547543, 0.22401688305186013, 0.04322580169703692, -0.15370914717565481, 0.08011762023337424, 0.009718257156185028, 0.1966364672015537, 0.14223699740867948, 0.05295306519191298, 0.23275976244874474, 0.19189503893055498, 0.12037322683234758, 0.09728479471374366, -0.1697208524543654, 0.016740724646254295, -0.4224310914622479, -0.13027788997913542, -0.09989911487235088, 0.08262799008953642, -0.04447852292232159, -0.04968964540889966, 0.3613949703406982, 0.15475583670391177, 0.24606563669224882, 0.006783745918338272, 0.3159361687498261, 0.11367315775283647, 0.08341884373601759, 0.06764734115285771, 0.35891981953992164, 0.06099226754860363, 0.16669123338203037, -0.19930217934377265, 0.05060665412282302, -0.02373388286653329] |
1,801.10472 | Soft Computing Techniques for Dependable Cyber-Physical Systems | Cyber-Physical Systems (CPS) allow us to manipulate objects in the physical
world by providing a communication bridge between computation and actuation
elements. In the current scheme of things, this sought-after control is marred
by limitations inherent in the underlying communication network(s) as well as
by the uncertainty found in the physical world. These limitations hamper
fine-grained control of elements that may be separated by large-scale
distances. In this regard, soft computing is an emerging paradigm that can help
to overcome the vulnerabilities, and unreliability of CPS by using techniques
including fuzzy systems, neural network, evolutionary computation,
probabilistic reasoning and rough sets. In this paper, we present a
comprehensive contemporary review of soft computing techniques for CPS
dependability modeling, analysis, and improvement. This paper provides an
overview of CPS applications, explores the foundations of dependability
engineering, and highlights the potential role of soft computing techniques for
CPS dependability with various case studies, while identifying common pitfalls
and future directions. In addition, this paper provides a comprehensive survey
on the use of various soft computing techniques for making CPS dependable.
| cs.SE cs.NE | cyberphysical systems cps allow us to manipulate objects in the physical world by providing a communication bridge between computation and actuation elements in the current scheme of things this soughtafter control is marred by limitations inherent in the underlying communication networks as well as by the uncertainty found in the physical world these limitations hamper finegrained control of elements that may be separated by largescale distances in this regard soft computing is an emerging paradigm that can help to overcome the vulnerabilities and unreliability of cps by using techniques including fuzzy systems neural network evolutionary computation probabilistic reasoning and rough sets in this paper we present a comprehensive contemporary review of soft computing techniques for cps dependability modeling analysis and improvement this paper provides an overview of cps applications explores the foundations of dependability engineering and highlights the potential role of soft computing techniques for cps dependability with various case studies while identifying common pitfalls and future directions in addition this paper provides a comprehensive survey on the use of various soft computing techniques for making cps dependable | [['cyberphysical', 'systems', 'cps', 'allow', 'us', 'to', 'manipulate', 'objects', 'in', 'the', 'physical', 'world', 'by', 'providing', 'a', 'communication', 'bridge', 'between', 'computation', 'and', 'actuation', 'elements', 'in', 'the', 'current', 'scheme', 'of', 'things', 'this', 'soughtafter', 'control', 'is', 'marred', 'by', 'limitations', 'inherent', 'in', 'the', 'underlying', 'communication', 'networks', 'as', 'well', 'as', 'by', 'the', 'uncertainty', 'found', 'in', 'the', 'physical', 'world', 'these', 'limitations', 'hamper', 'finegrained', 'control', 'of', 'elements', 'that', 'may', 'be', 'separated', 'by', 'largescale', 'distances', 'in', 'this', 'regard', 'soft', 'computing', 'is', 'an', 'emerging', 'paradigm', 'that', 'can', 'help', 'to', 'overcome', 'the', 'vulnerabilities', 'and', 'unreliability', 'of', 'cps', 'by', 'using', 'techniques', 'including', 'fuzzy', 'systems', 'neural', 'network', 'evolutionary', 'computation', 'probabilistic', 'reasoning', 'and', 'rough', 'sets', 'in', 'this', 'paper', 'we', 'present', 'a', 'comprehensive', 'contemporary', 'review', 'of', 'soft', 'computing', 'techniques', 'for', 'cps', 'dependability', 'modeling', 'analysis', 'and', 'improvement', 'this', 'paper', 'provides', 'an', 'overview', 'of', 'cps', 'applications', 'explores', 'the', 'foundations', 'of', 'dependability', 'engineering', 'and', 'highlights', 'the', 'potential', 'role', 'of', 'soft', 'computing', 'techniques', 'for', 'cps', 'dependability', 'with', 'various', 'case', 'studies', 'while', 'identifying', 'common', 'pitfalls', 'and', 'future', 'directions', 'in', 'addition', 'this', 'paper', 'provides', 'a', 'comprehensive', 'survey', 'on', 'the', 'use', 'of', 'various', 'soft', 'computing', 'techniques', 'for', 'making', 'cps', 'dependable']] | [-0.15507124562151312, 0.01639954937936534, -0.04988932716817166, 0.05000409617918031, -0.08831850515699453, -0.12079760419947796, 0.07535895752247025, 0.35679199408446804, -0.28161348356980453, -0.3530946365777361, 0.11114989376556275, -0.23278454278976385, -0.20142856320586014, 0.2213735748422489, -0.14246172623759856, 0.11349911589091749, 0.049708122042206565, -0.07681483852943886, -0.04699703713020917, -0.1891963325102102, 0.3164156691035193, 0.04537941038796908, 0.3013577328398405, 0.08337104469642379, 0.043161259985037066, 0.038054616049225075, -0.09001154864708542, 0.004633152045785669, -0.0892348382938385, 0.24691010034104202, 0.35198234688631896, 0.19897563109603408, 0.3426533018688807, -0.45683743785857484, -0.2303445735642833, 0.08757158433966171, 0.15629592351811636, 0.07817497502965329, -0.047155866386981035, -0.27211686872401053, 0.09305098178839635, -0.21612894331795698, -0.12567259876183076, -0.13209349844144302, 0.032451129799350324, 0.04064453089200327, -0.19576740165350937, -0.010080595003713048, 0.045926318051335346, 0.10057340792950578, -0.016480632591992617, -0.08862115223002567, 0.06759117522507152, 0.17148978200615542, 0.017467620162544457, -0.00966228709786377, 0.16551091746175975, -0.15745375035304493, -0.19580819245867348, 0.3960909793425477, 0.02861457645469293, -0.15902869464316813, 0.22562292293028047, 0.011931201605272761, -0.17989252529661642, 0.05474996795482787, 0.2176405049211691, 0.04519420118022741, -0.22648837440908792, 0.08418141692691075, 0.07793327375953452, 0.15981177334003988, 0.019782679636826676, 0.09362000125994006, 0.25505540714588726, 0.26050385760681005, 0.06528823847327841, 0.12256733557729971, -0.03907130057845014, -0.1270330340360825, -0.2562192401984769, -0.16355910720408298, -0.1329821076981849, -0.0009475528528087176, -0.05614585659333918, -0.14305207402487233, 0.3744431255075888, 0.23849757779533504, 0.15081472571264282, 0.029157311227198775, 0.40263491785127586, 0.057818838137494964, 0.06631490331812856, 0.04392429036768467, 0.22414321453065947, 0.08256733017513172, 0.170214657581495, -0.16293990980961956, 0.09772284931157914, -0.01657544151524061] |
1,801.10473 | Suppression of globular cluster formation in metal-poor gas clouds by
Lyman-alpha radiation feedback | We study the impact of Ly$\alpha$ radiation feedback on globular cluster (GC)
formation. In this Letter, we analytically derive the relation between star
formation efficiency (SFE) and metallicity in spherical clouds with the
Ly$\alpha$ radiation feedback. Our models show that the SFE becomes small as
the metallicity decreases. In metal-poor gas clouds, Ly$\alpha$ photons are
trapped for a long time and exert strong radiation force to the gas, resulting
in the suppression of star formation. We find that bound star-clusters (SFE
$\gtrsim$ 0.5) form only for the metallicity higher than $\sim
10^{-2.5}~Z_{\odot}$ in the case with the initial cloud mass $10^5~{\rm
M}_\odot$ and the radius 5 pc. Our models successfully reproduce the lower
bound of observed metallicity of GCs. Thus, we suggest that the Ly$\alpha$
radiation feedback can be essential in understanding the formation of GCs.
| astro-ph.GA | we study the impact of lyalpha radiation feedback on globular cluster gc formation in this letter we analytically derive the relation between star formation efficiency sfe and metallicity in spherical clouds with the lyalpha radiation feedback our models show that the sfe becomes small as the metallicity decreases in metalpoor gas clouds lyalpha photons are trapped for a long time and exert strong radiation force to the gas resulting in the suppression of star formation we find that bound starclusters sfe gtrsim 05 form only for the metallicity higher than sim 1025z_odot in the case with the initial cloud mass 105rm m_odot and the radius 5 pc our models successfully reproduce the lower bound of observed metallicity of gcs thus we suggest that the lyalpha radiation feedback can be essential in understanding the formation of gcs | [['we', 'study', 'the', 'impact', 'of', 'lyalpha', 'radiation', 'feedback', 'on', 'globular', 'cluster', 'gc', 'formation', 'in', 'this', 'letter', 'we', 'analytically', 'derive', 'the', 'relation', 'between', 'star', 'formation', 'efficiency', 'sfe', 'and', 'metallicity', 'in', 'spherical', 'clouds', 'with', 'the', 'lyalpha', 'radiation', 'feedback', 'our', 'models', 'show', 'that', 'the', 'sfe', 'becomes', 'small', 'as', 'the', 'metallicity', 'decreases', 'in', 'metalpoor', 'gas', 'clouds', 'lyalpha', 'photons', 'are', 'trapped', 'for', 'a', 'long', 'time', 'and', 'exert', 'strong', 'radiation', 'force', 'to', 'the', 'gas', 'resulting', 'in', 'the', 'suppression', 'of', 'star', 'formation', 'we', 'find', 'that', 'bound', 'starclusters', 'sfe', 'gtrsim', '05', 'form', 'only', 'for', 'the', 'metallicity', 'higher', 'than', 'sim', '1025z_odot', 'in', 'the', 'case', 'with', 'the', 'initial', 'cloud', 'mass', '105rm', 'm_odot', 'and', 'the', 'radius', '5', 'pc', 'our', 'models', 'successfully', 'reproduce', 'the', 'lower', 'bound', 'of', 'observed', 'metallicity', 'of', 'gcs', 'thus', 'we', 'suggest', 'that', 'the', 'lyalpha', 'radiation', 'feedback', 'can', 'be', 'essential', 'in', 'understanding', 'the', 'formation', 'of', 'gcs']] | [-0.07171733438434011, 0.12834815988662066, -0.021293160195151966, 0.12682408402001277, -0.03621480390429497, -0.03427349604597246, 0.058674533965273036, 0.4262412261286819, -0.12875334097037988, -0.36942559364079325, -0.040036567747247995, -0.26397994422715987, -0.02787611436220619, 0.19405945287413756, -0.0005617056986213559, -0.07280390168781634, 0.054333063082217616, -0.06792445725036991, -0.029185391922860786, -0.30031431147276805, 0.3249454664169914, 0.10296281943166698, 0.17178248611313326, 0.06901297952151961, 0.03429418470779503, -0.154725479044848, -0.0027878493208576133, -0.03791066917711524, -0.20941689334355976, -0.001846439867383904, 0.1868766626988266, 0.14412384872083311, 0.23996860371833598, -0.3842060582022424, -0.22771000329629276, 0.07161876456812025, 0.25791784872438894, 0.0805286628573581, -0.13977709187418913, -0.21401334493076085, 0.05625226838229638, -0.21346940938210873, -0.17016441093550788, 0.10769639049691182, 0.0448200143183823, 0.03411860022341123, -0.2476627274657841, 0.208272440578892, 0.030568361434119718, 0.03843840967725824, -0.11749275084304692, -0.05653824773789556, -0.09564834871087913, 0.04606732329077743, -0.02927822604060229, 0.07726690974603924, 0.24350955038572902, -0.16248498745090156, 0.0435023165295004, 0.4006068190904679, -0.08565090987022915, -0.013043303021954165, 0.22442503617386575, -0.25489532676163235, -0.1642416061454073, 0.10006898927191893, 0.17784583629281434, 0.10991963794178984, -0.11223017207726284, -0.009414057276228925, -0.022076107445172966, 0.2418797308234153, 0.06774623757918123, 0.08405706737949341, 0.318551023763225, 0.11964834311856302, 0.05501219016258364, 0.07565184802558549, -0.17821539602311398, -0.0820707600960439, -0.20037049993320746, -0.13097235459437662, -0.09507809865667864, 0.10581870949137266, -0.18449149957170313, -0.11229848338773957, 0.24445265371662875, 0.1613567658268881, 0.23323278519135243, 0.10109381832837783, 0.34756850812722134, 0.15381565224465535, 0.11875560827622259, 0.1526937510818243, 0.3212607353856718, 0.19603422122697037, 0.04716133606033745, -0.3299912529764697, 0.10038842656477182, -0.013521226842163338] |
1,801.10474 | Wormholes in f(R) gravity with a noncommutative-geometry background | This paper discusses the possible existence of traversable wormholes in f(R)
modified gravity while assuming a noncommutative-geometry background, as well
as zero tidal forces. The first part of the paper aims for an overview via
several shape functions by determining the corresponding wormhole solutions and
their properties. The solutions are made complete by deriving the
modified-gravity functions F(r) and f(R), where F=df/dR. It is subsequently
shown that the violation of the null energy condition can be attributed to the
combined effects of f(R) gravity and noncommutative geometry. The second part
of the paper reverses the strategy by starting with a special form of f(R) and
determining the wormhole solution and the concomitant F(r). The approach in
this paper differs in significant ways from that of Jamil et al.
| gr-qc | this paper discusses the possible existence of traversable wormholes in fr modified gravity while assuming a noncommutativegeometry background as well as zero tidal forces the first part of the paper aims for an overview via several shape functions by determining the corresponding wormhole solutions and their properties the solutions are made complete by deriving the modifiedgravity functions fr and fr where fdfdr it is subsequently shown that the violation of the null energy condition can be attributed to the combined effects of fr gravity and noncommutative geometry the second part of the paper reverses the strategy by starting with a special form of fr and determining the wormhole solution and the concomitant fr the approach in this paper differs in significant ways from that of jamil et al | [['this', 'paper', 'discusses', 'the', 'possible', 'existence', 'of', 'traversable', 'wormholes', 'in', 'fr', 'modified', 'gravity', 'while', 'assuming', 'a', 'noncommutativegeometry', 'background', 'as', 'well', 'as', 'zero', 'tidal', 'forces', 'the', 'first', 'part', 'of', 'the', 'paper', 'aims', 'for', 'an', 'overview', 'via', 'several', 'shape', 'functions', 'by', 'determining', 'the', 'corresponding', 'wormhole', 'solutions', 'and', 'their', 'properties', 'the', 'solutions', 'are', 'made', 'complete', 'by', 'deriving', 'the', 'modifiedgravity', 'functions', 'fr', 'and', 'fr', 'where', 'fdfdr', 'it', 'is', 'subsequently', 'shown', 'that', 'the', 'violation', 'of', 'the', 'null', 'energy', 'condition', 'can', 'be', 'attributed', 'to', 'the', 'combined', 'effects', 'of', 'fr', 'gravity', 'and', 'noncommutative', 'geometry', 'the', 'second', 'part', 'of', 'the', 'paper', 'reverses', 'the', 'strategy', 'by', 'starting', 'with', 'a', 'special', 'form', 'of', 'fr', 'and', 'determining', 'the', 'wormhole', 'solution', 'and', 'the', 'concomitant', 'fr', 'the', 'approach', 'in', 'this', 'paper', 'differs', 'in', 'significant', 'ways', 'from', 'that', 'of', 'jamil', 'et', 'al']] | [-0.12029457250369772, 0.03071619898816737, -0.08668048361626764, 0.0810706772950537, -0.10870328938056316, -0.11278141362385617, -0.03256815705182297, 0.2581787172276231, -0.21811728678377612, -0.3286287231104715, 0.07504036720003193, -0.225892745263298, -0.18340885096288745, 0.14168539381630363, -0.07679981748676962, 0.029048381388069144, -0.0295132677111103, 0.0020223219032650666, -0.0862129391508273, -0.19794277447674954, 0.4116839618183717, 0.12760436015262727, 0.24493922763651918, 0.025244154930410403, 0.07117608715484422, -0.036482543619867, -0.03942612608125995, 0.09280789885965604, -0.1820810273228932, 0.06578110097833569, 0.1947328290931644, 0.14688233190792657, 0.251474272626053, -0.44457251925967517, -0.21088367098912833, 0.09649171764844112, 0.14246668367247498, 0.13892862525406396, -0.08298788138384385, -0.29622046070705566, 0.07757938903061644, -0.19260630530438252, -0.14840944878949178, -0.01365698088840064, 0.04928026447397849, 0.02408068535234114, -0.23538793973802102, 0.06907696257315812, 0.08564801728962698, -0.026433552489689892, -0.09588038478608406, -0.07655599066943285, -0.004905896987544284, 0.07749979120368759, 0.1490216145258663, 0.05025623416128967, 0.09978663334382758, -0.15029109130606114, -0.08181684830462531, 0.4092432905398753, -0.09597475862219221, -0.211458491545821, 0.14069182402454317, -0.12432819704288646, -0.10754774438424243, 0.056397398428377946, 0.1163519048538532, 0.15856786313954563, -0.18512777867726982, 0.14947602559862258, 0.007732414240886029, 0.10920348379849679, 0.11962743123091521, 0.03206451192113852, 0.2698119907669487, 0.08320296331057472, 0.03715245871405516, 0.16102166269769122, -0.045387723399991434, -0.05238243242234199, -0.3851144322090679, -0.16139168692161404, -0.15277660127344822, 0.017164929263618966, -0.10067876851098845, -0.1384605378481201, 0.4185925479590272, 0.10053359407290358, 0.14951461346982609, 0.04703513612335045, 0.25452536443204044, 0.09697260457601044, 0.01683792179369087, 0.09154749203044625, 0.31694060411038144, 0.1155307682319766, 0.09931718231186211, -0.229700437895002, 0.03027886048048025, 0.06568121500019934] |
1,801.10475 | Exploring the Chemical Composition and Double Horizontal Branch of the
Bulge Globular Cluster NGC 6569 | Photometric and spectroscopic analyses have shown that the Galactic bulge
cluster Terzan 5 hosts several populations with different metallicities and
ages that manifest as a double red horizontal branch (HB). A recent
investigation of the massive bulge cluster NGC 6569 revealed a similar, though
less extended, HB luminosity split, but little is known about the cluster's
detailed chemical composition. Therefore, we have used high-resolution spectra
from the Magellan-M2FS and VLT-FLAMES spectrographs to investigate the chemical
compositions and radial velocity distributions of red giant branch and HB stars
in NGC 6569. We found the cluster to have a mean heliocentric radial velocity
of -48.8 km/s (sigma = 5.3 km/s; 148 stars) and a mean [Fe/H] =-0.87 dex (19
stars), but the cluster's 0.05 dex [Fe/H] dispersion precludes a significant
metallicity spread. NGC 6569 exhibits light- and heavy-element distributions
that are common among old bulge/inner Galaxy globular clusters, including clear
(anti)correlations between [O/Fe], [Na/Fe], and [Al/Fe]. The light-element data
suggest that NGC 6569 may be composed of at least two distinct populations, and
the cluster's low mean [La/Eu] = -0.11 dex indicates significant pollution with
r-process material. We confirm that both HBs contain cluster members, but
metallicity and light-element variations are largely ruled out as sources for
the luminosity difference. However, He mass fraction differences as small as
delta Y ~ 0.02 cannot be ruled out and may be sufficient to reproduce the
double HB.
| astro-ph.SR astro-ph.GA | photometric and spectroscopic analyses have shown that the galactic bulge cluster terzan 5 hosts several populations with different metallicities and ages that manifest as a double red horizontal branch hb a recent investigation of the massive bulge cluster ngc 6569 revealed a similar though less extended hb luminosity split but little is known about the clusters detailed chemical composition therefore we have used highresolution spectra from the magellanm2fs and vltflames spectrographs to investigate the chemical compositions and radial velocity distributions of red giant branch and hb stars in ngc 6569 we found the cluster to have a mean heliocentric radial velocity of 488 kms sigma 53 kms 148 stars and a mean feh 087 dex 19 stars but the clusters 005 dex feh dispersion precludes a significant metallicity spread ngc 6569 exhibits light and heavyelement distributions that are common among old bulgeinner galaxy globular clusters including clear anticorrelations between ofe nafe and alfe the lightelement data suggest that ngc 6569 may be composed of at least two distinct populations and the clusters low mean laeu 011 dex indicates significant pollution with rprocess material we confirm that both hbs contain cluster members but metallicity and lightelement variations are largely ruled out as sources for the luminosity difference however he mass fraction differences as small as delta y 002 cannot be ruled out and may be sufficient to reproduce the double hb | [['photometric', 'and', 'spectroscopic', 'analyses', 'have', 'shown', 'that', 'the', 'galactic', 'bulge', 'cluster', 'terzan', '5', 'hosts', 'several', 'populations', 'with', 'different', 'metallicities', 'and', 'ages', 'that', 'manifest', 'as', 'a', 'double', 'red', 'horizontal', 'branch', 'hb', 'a', 'recent', 'investigation', 'of', 'the', 'massive', 'bulge', 'cluster', 'ngc', '6569', 'revealed', 'a', 'similar', 'though', 'less', 'extended', 'hb', 'luminosity', 'split', 'but', 'little', 'is', 'known', 'about', 'the', 'clusters', 'detailed', 'chemical', 'composition', 'therefore', 'we', 'have', 'used', 'highresolution', 'spectra', 'from', 'the', 'magellanm2fs', 'and', 'vltflames', 'spectrographs', 'to', 'investigate', 'the', 'chemical', 'compositions', 'and', 'radial', 'velocity', 'distributions', 'of', 'red', 'giant', 'branch', 'and', 'hb', 'stars', 'in', 'ngc', '6569', 'we', 'found', 'the', 'cluster', 'to', 'have', 'a', 'mean', 'heliocentric', 'radial', 'velocity', 'of', '488', 'kms', 'sigma', '53', 'kms', '148', 'stars', 'and', 'a', 'mean', 'feh', '087', 'dex', '19', 'stars', 'but', 'the', 'clusters', '005', 'dex', 'feh', 'dispersion', 'precludes', 'a', 'significant', 'metallicity', 'spread', 'ngc', '6569', 'exhibits', 'light', 'and', 'heavyelement', 'distributions', 'that', 'are', 'common', 'among', 'old', 'bulgeinner', 'galaxy', 'globular', 'clusters', 'including', 'clear', 'anticorrelations', 'between', 'ofe', 'nafe', 'and', 'alfe', 'the', 'lightelement', 'data', 'suggest', 'that', 'ngc', '6569', 'may', 'be', 'composed', 'of', 'at', 'least', 'two', 'distinct', 'populations', 'and', 'the', 'clusters', 'low', 'mean', 'laeu', '011', 'dex', 'indicates', 'significant', 'pollution', 'with', 'rprocess', 'material', 'we', 'confirm', 'that', 'both', 'hbs', 'contain', 'cluster', 'members', 'but', 'metallicity', 'and', 'lightelement', 'variations', 'are', 'largely', 'ruled', 'out', 'as', 'sources', 'for', 'the', 'luminosity', 'difference', 'however', 'he', 'mass', 'fraction', 'differences', 'as', 'small', 'as', 'delta', 'y', '002', 'can', 'not', 'be', 'ruled', 'out', 'and', 'may', 'be', 'sufficient', 'to', 'reproduce', 'the', 'double', 'hb']] | [-0.041825817514400426, 0.1268529423826991, -0.12025678836328817, 0.13358551608973074, -0.08170053449225535, -0.09749325751669673, 0.10397711268412474, 0.48570471379535024, -0.12167336608550826, -0.396911536218413, -0.02769645355748682, -0.31625249754945906, 0.004751823071557454, 0.1878792372435428, -0.08750776430285531, -0.09919464003367277, 0.13632384234499106, -0.0965942767089902, -0.038339872718526624, -0.2881507014390081, 0.24243423120154964, -0.012156616146494817, 0.14360239204559555, -0.06277036693025767, 0.001196739157496496, -0.17864326632128588, -0.053712450365991496, -0.004262020049447363, -0.14642260927539769, -0.006255649605733685, 0.23334496540473007, 0.10726153379350546, 0.2095931741767825, -0.255729295277073, -0.19963009314797012, 0.08844933543380479, 0.3172456630519732, 0.000601245289934533, -0.11034895808665783, -0.23869189319656395, 0.07226321132056358, -0.17156374630330784, -0.22792270671156964, 0.09423966033311633, 0.05708464142842243, 0.038476664570938325, -0.17170058311622396, 0.23285840022492574, -0.02161099463781882, 0.20222609942361663, -0.10841035346416918, -0.27572294153289234, -0.14498936916294294, 0.08658026222006551, -0.005834473136739878, 0.05548444552572839, 0.14635177237058292, -0.048421372768360296, 0.056724257041494565, 0.39735845369952066, -0.09112802962067001, 0.05727797012588221, 0.23208337256813913, -0.21534995323458275, -0.20696551826665605, 0.06566043327929395, 0.12248034175944986, 0.09260424655797646, -0.21908745490562864, -0.007675595933927255, 0.00015461159989971554, 0.2801016830003647, 0.09757126339316143, 0.05732001097641282, 0.32596681884276274, 0.051628890465965166, 0.027840141137432935, -0.017415746951221743, -0.25693752021968236, -0.05630165177853012, -0.15362125372280291, -0.08941793311296588, -0.01157858915368974, 0.07561253372574017, -0.20546456839561963, -0.17017362366374522, 0.27476984518882513, 0.05249839903105421, 0.23447045025282673, 0.023981293681273195, 0.24527202296026407, 0.06823822829113402, 0.16160975247460269, 0.12977817500397176, 0.3129739648545588, 0.27366802548591274, 0.06528016873806698, -0.2680112054091233, 0.1135757589068675, -0.07290662247465834] |
1,801.10476 | Parameterized Power Vertex Cover | We study a recently introduced generalization of the Vertex Cover (VC)
problem, called Power Vertex Cover (PVC). In this problem, each edge of the
input graph is supplied with a positive integer demand. A solution is an
assignment of (power) values to the vertices, so that for each edge one of its
endpoints has value as high as the demand, and the total sum of power values
assigned is minimized. We investigate how this generalization affects the
parameterized complexity of Vertex Cover. On the positive side, when
parameterized by the value of the optimal P, we give an O*(1.274^P)-time
branching algorithm (O* is used to hide factors polynomial in the input size),
and also an O*(1.325^P)-time algorithm for the more general asymmetric case of
the problem, where the demand of each edge may differ for its two endpoints.
When the parameter is the number of vertices k that receive positive value, we
give O*(1.619^k) and O*(k^k)-time algorithms for the symmetric and asymmetric
cases respectively, as well as a simple quadratic kernel for the asymmetric
case. We also show that PVC becomes significantly harder than classical VC when
parameterized by the graph's treewidth t. More specifically, we prove that
unless the ETH is false, there is no n^o(t)-time algorithm for PVC. We give a
method to overcome this hardness by designing an FPT approximation scheme which
gives a (1+epsilon)-approximation to the optimal solution in time FPT in
parameters t and 1/epsilon.
| cs.DS | we study a recently introduced generalization of the vertex cover vc problem called power vertex cover pvc in this problem each edge of the input graph is supplied with a positive integer demand a solution is an assignment of power values to the vertices so that for each edge one of its endpoints has value as high as the demand and the total sum of power values assigned is minimized we investigate how this generalization affects the parameterized complexity of vertex cover on the positive side when parameterized by the value of the optimal p we give an o1274ptime branching algorithm o is used to hide factors polynomial in the input size and also an o1325ptime algorithm for the more general asymmetric case of the problem where the demand of each edge may differ for its two endpoints when the parameter is the number of vertices k that receive positive value we give o1619k and okktime algorithms for the symmetric and asymmetric cases respectively as well as a simple quadratic kernel for the asymmetric case we also show that pvc becomes significantly harder than classical vc when parameterized by the graphs treewidth t more specifically we prove that unless the eth is false there is no nottime algorithm for pvc we give a method to overcome this hardness by designing an fpt approximation scheme which gives a 1epsilonapproximation to the optimal solution in time fpt in parameters t and 1epsilon | [['we', 'study', 'a', 'recently', 'introduced', 'generalization', 'of', 'the', 'vertex', 'cover', 'vc', 'problem', 'called', 'power', 'vertex', 'cover', 'pvc', 'in', 'this', 'problem', 'each', 'edge', 'of', 'the', 'input', 'graph', 'is', 'supplied', 'with', 'a', 'positive', 'integer', 'demand', 'a', 'solution', 'is', 'an', 'assignment', 'of', 'power', 'values', 'to', 'the', 'vertices', 'so', 'that', 'for', 'each', 'edge', 'one', 'of', 'its', 'endpoints', 'has', 'value', 'as', 'high', 'as', 'the', 'demand', 'and', 'the', 'total', 'sum', 'of', 'power', 'values', 'assigned', 'is', 'minimized', 'we', 'investigate', 'how', 'this', 'generalization', 'affects', 'the', 'parameterized', 'complexity', 'of', 'vertex', 'cover', 'on', 'the', 'positive', 'side', 'when', 'parameterized', 'by', 'the', 'value', 'of', 'the', 'optimal', 'p', 'we', 'give', 'an', 'o1274ptime', 'branching', 'algorithm', 'o', 'is', 'used', 'to', 'hide', 'factors', 'polynomial', 'in', 'the', 'input', 'size', 'and', 'also', 'an', 'o1325ptime', 'algorithm', 'for', 'the', 'more', 'general', 'asymmetric', 'case', 'of', 'the', 'problem', 'where', 'the', 'demand', 'of', 'each', 'edge', 'may', 'differ', 'for', 'its', 'two', 'endpoints', 'when', 'the', 'parameter', 'is', 'the', 'number', 'of', 'vertices', 'k', 'that', 'receive', 'positive', 'value', 'we', 'give', 'o1619k', 'and', 'okktime', 'algorithms', 'for', 'the', 'symmetric', 'and', 'asymmetric', 'cases', 'respectively', 'as', 'well', 'as', 'a', 'simple', 'quadratic', 'kernel', 'for', 'the', 'asymmetric', 'case', 'we', 'also', 'show', 'that', 'pvc', 'becomes', 'significantly', 'harder', 'than', 'classical', 'vc', 'when', 'parameterized', 'by', 'the', 'graphs', 'treewidth', 't', 'more', 'specifically', 'we', 'prove', 'that', 'unless', 'the', 'eth', 'is', 'false', 'there', 'is', 'no', 'nottime', 'algorithm', 'for', 'pvc', 'we', 'give', 'a', 'method', 'to', 'overcome', 'this', 'hardness', 'by', 'designing', 'an', 'fpt', 'approximation', 'scheme', 'which', 'gives', 'a', '1epsilonapproximation', 'to', 'the', 'optimal', 'solution', 'in', 'time', 'fpt', 'in', 'parameters', 't', 'and', '1epsilon']] | [-0.11955650721681602, 0.09102886232988354, -0.040350068194117954, 0.045467359310095296, -0.10067653416338912, -0.19722971407736237, 0.08302212226640512, 0.36117080278853153, -0.2906602353828543, -0.30303040064990205, 0.08351543410235342, -0.2756727772031693, -0.13479922234695008, 0.1612451255440395, -0.08059648668413308, 0.04874735955171228, 0.04339985967504772, 0.08892674601854796, -0.011245434057522328, -0.2819820666553185, 0.2920760348488755, 0.028083845995059434, 0.20763625796844667, 0.0919933947912873, 0.0864733547566736, 0.02382678575417463, 0.01323090994215392, 0.08655509895977453, -0.1505776390588119, 0.06920500029859311, 0.2558823584583885, 0.15528942787960331, 0.29007155025140086, -0.3777073527151283, -0.14292360073985888, 0.18047289181738457, 0.11315236563715053, 0.0772871209878197, -0.02173190746825446, -0.16848394955865087, 0.13178768928033954, -0.13869207031886152, -0.09615840691221046, -0.002135225577636602, 0.09239084022317795, -0.01159457277724559, -0.3201511825613202, 0.01071031187695669, 0.07833118561823714, -0.022576599712161586, -0.027396209886238136, -0.17192783944972573, 0.01935928740063088, 0.10370187644755091, 0.004112540621389734, 0.051032118018756206, 0.06090820919167488, -0.1604730117124842, -0.13824002067310776, 0.37356761362641416, -0.030552003783622182, -0.2062584736206113, 0.10087747359945577, -0.09783653647817196, -0.13034415919571482, 0.1269124637694752, 0.16733454999295955, 0.1456316556320823, -0.08281645685269626, 0.11879823869763022, -0.08680646292706753, 0.14777943165526983, 0.0827166903179456, 0.010111371289809889, 0.11141824857232735, 0.12928542591373812, 0.1732569580040674, 0.20117746055165822, -0.03176028826472131, -0.05509650347397683, -0.2915043906922987, -0.13106420030619237, -0.20883352780278694, 0.029768750711066768, -0.14181283040119563, -0.17695764915106144, 0.40688528759518644, 0.12431665559601475, 0.2437306750486506, 0.11363523672483465, 0.30843523981426146, 0.18286307545458066, 0.041553998925782584, 0.1529006086725821, 0.17430254769650227, 0.08028944031969505, 0.047741832197742896, -0.2304233791494861, 0.10668436799773034, 0.08801195387966297] |
1,801.10477 | Mean-field theory of differential rotation in density stratified
turbulent convection | A mean-field theory of differential rotation in a density stratified
turbulent convection has been developed. This theory is based on a combined
effect of the turbulent heat flux and anisotropy of turbulent convection on the
Reynolds stress. A coupled system of dynamical budget equations consisting in
the equations for the Reynolds stress, the entropy fluctuations and the
turbulent heat flux has been solved. To close the system of these equations,
the spectral tau approach which is valid for large Reynolds and Peclet numbers,
has been applied. The adopted model of the background turbulent convection
takes into account an increase of the turbulence anisotropy and a decrease of
the turbulent correlation time with the rotation rate. This theory yields the
radial profile of the differential rotation which is in agreement with that for
the solar differential rotation.
| physics.flu-dyn astro-ph.SR physics.plasm-ph physics.space-ph | a meanfield theory of differential rotation in a density stratified turbulent convection has been developed this theory is based on a combined effect of the turbulent heat flux and anisotropy of turbulent convection on the reynolds stress a coupled system of dynamical budget equations consisting in the equations for the reynolds stress the entropy fluctuations and the turbulent heat flux has been solved to close the system of these equations the spectral tau approach which is valid for large reynolds and peclet numbers has been applied the adopted model of the background turbulent convection takes into account an increase of the turbulence anisotropy and a decrease of the turbulent correlation time with the rotation rate this theory yields the radial profile of the differential rotation which is in agreement with that for the solar differential rotation | [['a', 'meanfield', 'theory', 'of', 'differential', 'rotation', 'in', 'a', 'density', 'stratified', 'turbulent', 'convection', 'has', 'been', 'developed', 'this', 'theory', 'is', 'based', 'on', 'a', 'combined', 'effect', 'of', 'the', 'turbulent', 'heat', 'flux', 'and', 'anisotropy', 'of', 'turbulent', 'convection', 'on', 'the', 'reynolds', 'stress', 'a', 'coupled', 'system', 'of', 'dynamical', 'budget', 'equations', 'consisting', 'in', 'the', 'equations', 'for', 'the', 'reynolds', 'stress', 'the', 'entropy', 'fluctuations', 'and', 'the', 'turbulent', 'heat', 'flux', 'has', 'been', 'solved', 'to', 'close', 'the', 'system', 'of', 'these', 'equations', 'the', 'spectral', 'tau', 'approach', 'which', 'is', 'valid', 'for', 'large', 'reynolds', 'and', 'peclet', 'numbers', 'has', 'been', 'applied', 'the', 'adopted', 'model', 'of', 'the', 'background', 'turbulent', 'convection', 'takes', 'into', 'account', 'an', 'increase', 'of', 'the', 'turbulence', 'anisotropy', 'and', 'a', 'decrease', 'of', 'the', 'turbulent', 'correlation', 'time', 'with', 'the', 'rotation', 'rate', 'this', 'theory', 'yields', 'the', 'radial', 'profile', 'of', 'the', 'differential', 'rotation', 'which', 'is', 'in', 'agreement', 'with', 'that', 'for', 'the', 'solar', 'differential', 'rotation']] | [-0.18032364007119803, 0.1853615177620026, -0.10963267775471597, 0.04730026208305978, -0.030830704737180734, -0.02781870865403428, -0.04132076436979011, 0.2323131739942576, -0.2628461109364734, -0.3220669198507333, 0.050973702668082245, -0.23279102064449997, -0.05950888620196458, 0.21859013045254602, -0.02170967561987174, 0.0989019494942006, 0.03129801127087215, 0.01707865696003222, -0.020239925659124684, -0.18447493496761821, 0.311169593475129, 0.07532786073587726, 0.2943695480661357, 0.013928571578991763, 0.14197443668757947, -0.13314761723021923, -0.026188415425541976, 0.10282921319937005, -0.18348528395659636, 0.058544030755429584, 0.18371556768782765, 0.0073598574843558974, 0.25709296332891374, -0.4624042863108437, -0.2871352040811497, 0.01206947404288632, 0.15299401374752908, 0.10376743776278625, -0.032159507870400214, -0.20832773600704968, 0.038374184911577576, -0.17274299007840455, -0.09792899204116753, -0.043959306051393095, 0.0725615412435111, 0.04216678389895927, -0.3188873313175624, 0.16819911399130327, 0.056799357620655105, 0.13067291850936325, -0.10513539222644314, -0.06831084212514243, -0.1032785417217597, 0.09077232382397223, 0.10498335240802537, 0.023593332197325415, 0.14095614844614723, -0.1470377466723542, -0.005607234553334659, 0.3851007966269903, -0.09661122040244449, -0.22624055018155453, 0.13999909780378564, -0.17446362103253385, -0.08327490109128549, 0.2083578281727729, 0.22214899437419852, 0.1158494313576204, -0.10111935776384438, 0.06226064724786043, -0.07971068601524595, 0.1781066288240254, 0.020987401079550824, -0.0905429305999753, 0.21113784055855564, 0.20828692004878951, 0.055443374296266806, 0.0861221196143614, -0.17010345407898592, -0.12956372943795835, -0.27338783936027217, -0.1537951623527881, -0.1391716326436247, 0.07684015606612186, -0.10213508314807447, -0.19010952832725117, 0.35718525854377625, 0.13928460306830376, 0.15126692801576985, 0.034958456920268124, 0.3157779469894355, 0.22668010662035906, 0.07134648045415387, 0.11660183400860713, 0.2882074976737118, 0.2871262538863127, 0.1975634246927631, -0.31094077841365053, 0.06728357320774675, 0.07718508403152502] |
1,801.10478 | Change Point Analysis of Correlation in Non-stationary Time Series | A restrictive assumption in change point analysis is "stationarity under the
null hypothesis of no change-point", which is crucial for asymptotic theory but
not very realistic from a practical point of view. For example, if change point
analysis for correlations is performed, it is not necessarily clear that the
mean, marginal variance or higher order moments are constant, even if there is
no change in the correlation. This paper develops change point analysis for the
correlation structures under less restrictive assumptions. In contrast to
previous work, our approach does not require that the mean, variance and fourth
order joint cumulants are constant under the null hypothesis. Moreover, we also
address the problem of detecting relevant change points.
| stat.ME | a restrictive assumption in change point analysis is stationarity under the null hypothesis of no changepoint which is crucial for asymptotic theory but not very realistic from a practical point of view for example if change point analysis for correlations is performed it is not necessarily clear that the mean marginal variance or higher order moments are constant even if there is no change in the correlation this paper develops change point analysis for the correlation structures under less restrictive assumptions in contrast to previous work our approach does not require that the mean variance and fourth order joint cumulants are constant under the null hypothesis moreover we also address the problem of detecting relevant change points | [['a', 'restrictive', 'assumption', 'in', 'change', 'point', 'analysis', 'is', 'stationarity', 'under', 'the', 'null', 'hypothesis', 'of', 'no', 'changepoint', 'which', 'is', 'crucial', 'for', 'asymptotic', 'theory', 'but', 'not', 'very', 'realistic', 'from', 'a', 'practical', 'point', 'of', 'view', 'for', 'example', 'if', 'change', 'point', 'analysis', 'for', 'correlations', 'is', 'performed', 'it', 'is', 'not', 'necessarily', 'clear', 'that', 'the', 'mean', 'marginal', 'variance', 'or', 'higher', 'order', 'moments', 'are', 'constant', 'even', 'if', 'there', 'is', 'no', 'change', 'in', 'the', 'correlation', 'this', 'paper', 'develops', 'change', 'point', 'analysis', 'for', 'the', 'correlation', 'structures', 'under', 'less', 'restrictive', 'assumptions', 'in', 'contrast', 'to', 'previous', 'work', 'our', 'approach', 'does', 'not', 'require', 'that', 'the', 'mean', 'variance', 'and', 'fourth', 'order', 'joint', 'cumulants', 'are', 'constant', 'under', 'the', 'null', 'hypothesis', 'moreover', 'we', 'also', 'address', 'the', 'problem', 'of', 'detecting', 'relevant', 'change', 'points']] | [-0.1304785444970346, 0.07048354728513548, -0.12867137187948594, 0.13041961757450277, -0.07649282967815033, -0.14539716868764824, 0.07559189705265702, 0.3790759517150557, -0.2139191102596203, -0.2769779189067901, 0.1317052206165818, -0.26025203730051333, -0.16204482822631222, 0.1507483821692598, -0.06533717607649472, 0.0391661774717335, 0.07140266690323623, 0.08344483886582729, -0.11753067839293717, -0.23234315488774043, 0.3332023338681389, 0.07703498569287312, 0.33100786719980657, 0.04683622716315106, 0.05765387846921117, 0.026625023326940007, -0.021239821990139972, 0.048811748613897935, -0.09196489685054363, 0.04273588599091889, 0.21859569736939466, 0.10689740655068149, 0.28851372001963294, -0.39087833542153877, -0.23191096691780874, 0.21419408314853397, 0.11812351227133001, 0.08831211516104288, -0.029182875420476317, -0.19474747476096338, 0.13393298071275792, -0.09672372792966855, -0.14537312436657837, -0.09104681608036287, 0.01370571773005729, -0.03209822550893594, -0.3156467177711117, 0.15062823408242498, 0.13645323086330968, 0.11829153586051658, -0.024612309421118125, -0.0967448644586799, 0.04108514352781205, 0.09915837700255851, 0.128120020746341, 0.029005766635298982, 0.12942036369051307, -0.09622419376819769, -0.046350205133064114, 0.36169377689719456, -0.04308650375375699, -0.25288721171016687, 0.16603448460451686, -0.1940053525723071, -0.2128726884157548, 0.14869334648212051, 0.11125501722662559, 0.12148381611252697, -0.157566407827748, 0.08667826923117854, -0.04055081887775634, 0.19965121114296186, 0.07594348621877053, -0.007740638523290937, 0.2016567752823934, 0.11272416860820392, 0.14753397837535948, 0.05964969370800715, -0.09382576962662303, -0.12207523266124165, -0.3749954466524924, -0.13138333103086194, -0.20219093203369495, 0.044562121673510015, -0.08132278710256956, -0.182713461211986, 0.3354673833769356, 0.20830937980526948, 0.15407320921922213, 0.07323412145149663, 0.28028046066721535, 0.14833026150993717, 0.02478473195129544, 0.0926698140350258, 0.2559343996640836, 0.06339178703980058, 0.06497225540483163, -0.13962642532677796, 0.17036748589533898, -0.01307127434704612] |
1,801.10479 | Identities about level 2 Eisenstein series | In this paper we consider certain classes of generalized double Eisenstein
series by simple differential calculations of trigonometric functions. In
particular, we give four new transformation formula for some double Eisenstein
series. We can find that these double Eisenstein series are reducible to
infinite series involving hyperbolic functions. Moreover, some interesting new
examples are given.
| math.NT | in this paper we consider certain classes of generalized double eisenstein series by simple differential calculations of trigonometric functions in particular we give four new transformation formula for some double eisenstein series we can find that these double eisenstein series are reducible to infinite series involving hyperbolic functions moreover some interesting new examples are given | [['in', 'this', 'paper', 'we', 'consider', 'certain', 'classes', 'of', 'generalized', 'double', 'eisenstein', 'series', 'by', 'simple', 'differential', 'calculations', 'of', 'trigonometric', 'functions', 'in', 'particular', 'we', 'give', 'four', 'new', 'transformation', 'formula', 'for', 'some', 'double', 'eisenstein', 'series', 'we', 'can', 'find', 'that', 'these', 'double', 'eisenstein', 'series', 'are', 'reducible', 'to', 'infinite', 'series', 'involving', 'hyperbolic', 'functions', 'moreover', 'some', 'interesting', 'new', 'examples', 'are', 'given']] | [-0.195246076668528, 0.06474141676656224, -0.08090844669125297, 0.12071956875945695, -0.14205792937427758, -0.15598090465434572, -0.004613172260790386, 0.348788641249253, -0.3377246008677916, -0.2194364138624885, 0.07893952817486768, -0.2708420438014648, -0.2820421293716539, 0.3254160427700051, -0.08329593889753927, 0.07739252400669185, 0.03410461715591902, 0.023053433813832024, -0.16801478496583347, -0.3451502561272884, 0.4032314792783423, -0.06272045009219172, 0.13960578649897468, -0.020509898230772126, 0.06264849520203743, 0.00796581202779304, -0.08088013951412656, -0.08402773771773685, -0.190123859120517, 0.13767647602680055, 0.2909148992377926, 0.03526418752629649, 0.23369923070157794, -0.4144498071209951, -0.10615907286886464, 0.1218033573590219, 0.17452329509806905, 0.045469054207205775, -0.05309371535073627, -0.17928056259724226, 0.025011451258747416, -0.23454195691103286, -0.15521279196678237, -0.23294474882158367, -0.00902985901656476, 0.13329834242097355, -0.2473714005710049, 0.061247201259869724, 0.04405319897288626, 0.08613300857184433, -0.02914060118862174, -0.1495007764632729, 0.09480810382996094, 0.05431747800585898, 0.014376369565301998, -0.09008276213637807, 0.004562108616598628, -0.040733546776358376, -0.14581844847310674, 0.30404496887190774, -0.10234160375866024, -0.2283878193660216, 0.09788427862592719, -0.24895853375677357, -0.3046336439692161, 0.11927688836374066, 0.13379769472574646, 0.1437807067890059, -0.13268922398036176, 0.10836451016366482, -0.14164408795874228, 0.009194808859716762, 0.17339489805427463, -0.019947364172813568, 0.14935306153175507, -0.005442255367101593, -0.019407599156891758, 0.2121018244122917, 0.012524550314992666, -0.06917733272368258, -0.4248036064884879, -0.1748617436228828, -0.07608812613920732, 0.08016914033161646, -0.10290046848187392, -0.2529482968828895, 0.43065662932666865, 0.004408322943543846, 0.1802912876856598, 0.1124743687496944, 0.16197543642060322, 0.2181054934065535, 0.026042840943079102, -0.026044074683026833, 0.09567507290895182, 0.12673591518012636, -0.016976878995245154, -0.10063499345190145, -0.048268983055922116, 0.17852960538796403] |
1,801.1048 | N* Experiments and their Impact on Strong QCD Physics | I give a brief overview of experimental studies of the spectrum and the
structure of the excited states of the nucleon and what we learn about their
internal structure. The focus is on the effort to obtain a more complete
picture of the light-quark baryon excitation spectrum employing electromagnetic
beams, and on the study of the transition form factors and helicity amplitudes
and their dependence on the magnitude of the photon virtuality $Q^2$,
especially for some of the most prominent resonances. The results were obtained
in pion and eta electroproduction experiments off proton targets. They
strengthen the connection of experiment and new results from modeling sQCD in
DSE and Light Cone SR approaches. They also point to the nature of these states
as 3-quark excitations at the core.
| nucl-ex hep-ph nucl-th | i give a brief overview of experimental studies of the spectrum and the structure of the excited states of the nucleon and what we learn about their internal structure the focus is on the effort to obtain a more complete picture of the lightquark baryon excitation spectrum employing electromagnetic beams and on the study of the transition form factors and helicity amplitudes and their dependence on the magnitude of the photon virtuality q2 especially for some of the most prominent resonances the results were obtained in pion and eta electroproduction experiments off proton targets they strengthen the connection of experiment and new results from modeling sqcd in dse and light cone sr approaches they also point to the nature of these states as 3quark excitations at the core | [['i', 'give', 'a', 'brief', 'overview', 'of', 'experimental', 'studies', 'of', 'the', 'spectrum', 'and', 'the', 'structure', 'of', 'the', 'excited', 'states', 'of', 'the', 'nucleon', 'and', 'what', 'we', 'learn', 'about', 'their', 'internal', 'structure', 'the', 'focus', 'is', 'on', 'the', 'effort', 'to', 'obtain', 'a', 'more', 'complete', 'picture', 'of', 'the', 'lightquark', 'baryon', 'excitation', 'spectrum', 'employing', 'electromagnetic', 'beams', 'and', 'on', 'the', 'study', 'of', 'the', 'transition', 'form', 'factors', 'and', 'helicity', 'amplitudes', 'and', 'their', 'dependence', 'on', 'the', 'magnitude', 'of', 'the', 'photon', 'virtuality', 'q2', 'especially', 'for', 'some', 'of', 'the', 'most', 'prominent', 'resonances', 'the', 'results', 'were', 'obtained', 'in', 'pion', 'and', 'eta', 'electroproduction', 'experiments', 'off', 'proton', 'targets', 'they', 'strengthen', 'the', 'connection', 'of', 'experiment', 'and', 'new', 'results', 'from', 'modeling', 'sqcd', 'in', 'dse', 'and', 'light', 'cone', 'sr', 'approaches', 'they', 'also', 'point', 'to', 'the', 'nature', 'of', 'these', 'states', 'as', '3quark', 'excitations', 'at', 'the', 'core']] | [-0.08893573164368718, 0.17628092297672993, -0.1170957271460793, 0.11725507982646377, -0.05997790012588666, -0.06060841416319818, 0.09321858425391838, 0.37494048761436716, -0.16470438497799478, -0.2756342768934701, 0.02892456486915762, -0.327977925324376, -0.08062435734359497, 0.16219010615168372, 0.05625863263048814, 0.03966277132076357, 0.05819110755692236, 0.038086661446868675, -0.05465193701456883, -0.17189562424391625, 0.3772928838370717, 0.06569233564368915, 0.2579857308737701, 0.1300316507813477, 0.04916143153786834, 0.022041652630832687, -0.053414382211485645, -0.0589181467112212, -0.11775918825151166, 0.13555985333096032, 0.22630989421304548, 0.1174638249885902, 0.15748150684521534, -0.42581022142258007, -0.16022615883048275, 0.0380099611775222, 0.1332405465609554, 0.11086689025796659, -0.029661921043611983, -0.2945647799788276, 0.04036269030711992, -0.14067612625512993, -0.15787349773677306, -0.10742507599206874, 0.005370268650040089, 0.00500467278288852, -0.23113196300710115, 0.034303250871516866, 0.033914302450284595, 0.05346292381727835, -0.07224049466276483, -0.20282584920460067, -0.027583823506574845, 0.11396204772245255, 0.09430419400177925, 0.04414443991663575, 0.12935844489038573, -0.2207459440396633, -0.12572198460111395, 0.39055714719688694, -0.008357686765521066, -0.13872471689683152, 0.14478166251228686, -0.21103935846622335, -0.1061341407485088, 0.13370338166350848, 0.20289669786006925, 0.1155908513273971, -0.09633914988171455, 0.04383510699335602, -0.03250975350601948, 0.15894309819964292, 0.08366917368221038, 0.10930495162756415, 0.18570404970523668, 0.16657268822746119, -0.02877111240377417, 0.07443640520614281, -0.08135609804412525, -0.08688646768496255, -0.33764688097289763, -0.10511053713344154, -0.11300211358502565, 0.062210072650486836, -0.04285754774889483, -0.09335265263655401, 0.43561446801140846, 0.08782496920844096, 0.24624977222993039, -0.011163198680151254, 0.2924627243737632, 0.10575508470992645, 0.04799872077637701, 0.04836056715066661, 0.28035738426592616, 0.1927722557757079, 0.1384494719095528, -0.25934609055730107, -0.007819053158527822, 0.013028453919105232] |
1,801.10481 | Separation of the two-dimensional unsteady Prandtl boundary layers under
an adverse pressure gradient | In this paper, we study the back flow of the two-dimensional unsteady Prandtl
boundary layer under an adverse pressure gradient. The occurrence of back flow
is an important physical event in the evolution of boundary layer, which
eventually leads to separation. For the two-dimensional unsteady Prandtl
boundary layer equations, when the initial tangential velocity is strictly
monotonic with respect to the normal variable, and the pressure gradient of the
outer flow is adverse, we obtain that the first critical point of the
tangential velocity profile with respect to the normal variable, if exists when
the boundary layer evolves in time, must appear on the boundary. Moreover, we
give a condition on the growth rate of the initial tangential velocity such
that there is a back flow point of the Prandtl boundary layer under the adverse
pressure gradient. In the appendix, we introduce two examples showing that back
flow occurs either when the flow distance is long in the streamwise direction
for a given initial monotonic tangential velocity field, or when the initial
tangential velocity grows slowly in a large neighborhood of the boundary for a
fixed flow distance in the streamwise direction.
| math.AP | in this paper we study the back flow of the twodimensional unsteady prandtl boundary layer under an adverse pressure gradient the occurrence of back flow is an important physical event in the evolution of boundary layer which eventually leads to separation for the twodimensional unsteady prandtl boundary layer equations when the initial tangential velocity is strictly monotonic with respect to the normal variable and the pressure gradient of the outer flow is adverse we obtain that the first critical point of the tangential velocity profile with respect to the normal variable if exists when the boundary layer evolves in time must appear on the boundary moreover we give a condition on the growth rate of the initial tangential velocity such that there is a back flow point of the prandtl boundary layer under the adverse pressure gradient in the appendix we introduce two examples showing that back flow occurs either when the flow distance is long in the streamwise direction for a given initial monotonic tangential velocity field or when the initial tangential velocity grows slowly in a large neighborhood of the boundary for a fixed flow distance in the streamwise direction | [['in', 'this', 'paper', 'we', 'study', 'the', 'back', 'flow', 'of', 'the', 'twodimensional', 'unsteady', 'prandtl', 'boundary', 'layer', 'under', 'an', 'adverse', 'pressure', 'gradient', 'the', 'occurrence', 'of', 'back', 'flow', 'is', 'an', 'important', 'physical', 'event', 'in', 'the', 'evolution', 'of', 'boundary', 'layer', 'which', 'eventually', 'leads', 'to', 'separation', 'for', 'the', 'twodimensional', 'unsteady', 'prandtl', 'boundary', 'layer', 'equations', 'when', 'the', 'initial', 'tangential', 'velocity', 'is', 'strictly', 'monotonic', 'with', 'respect', 'to', 'the', 'normal', 'variable', 'and', 'the', 'pressure', 'gradient', 'of', 'the', 'outer', 'flow', 'is', 'adverse', 'we', 'obtain', 'that', 'the', 'first', 'critical', 'point', 'of', 'the', 'tangential', 'velocity', 'profile', 'with', 'respect', 'to', 'the', 'normal', 'variable', 'if', 'exists', 'when', 'the', 'boundary', 'layer', 'evolves', 'in', 'time', 'must', 'appear', 'on', 'the', 'boundary', 'moreover', 'we', 'give', 'a', 'condition', 'on', 'the', 'growth', 'rate', 'of', 'the', 'initial', 'tangential', 'velocity', 'such', 'that', 'there', 'is', 'a', 'back', 'flow', 'point', 'of', 'the', 'prandtl', 'boundary', 'layer', 'under', 'the', 'adverse', 'pressure', 'gradient', 'in', 'the', 'appendix', 'we', 'introduce', 'two', 'examples', 'showing', 'that', 'back', 'flow', 'occurs', 'either', 'when', 'the', 'flow', 'distance', 'is', 'long', 'in', 'the', 'streamwise', 'direction', 'for', 'a', 'given', 'initial', 'monotonic', 'tangential', 'velocity', 'field', 'or', 'when', 'the', 'initial', 'tangential', 'velocity', 'grows', 'slowly', 'in', 'a', 'large', 'neighborhood', 'of', 'the', 'boundary', 'for', 'a', 'fixed', 'flow', 'distance', 'in', 'the', 'streamwise', 'direction']] | [-0.2008545172478383, 0.16591709075767844, -0.11518853642822553, -0.024037890618880436, -0.07606233075421187, -0.10276558371212256, -0.0044492355482361745, 0.3458812419339665, -0.342617908216198, -0.20705582859591232, 0.12765249472734772, -0.2230425759917125, -0.07566202778374038, 0.1643431025913742, -0.07755105727846967, 0.06601595137908589, 0.06763770133450937, 0.0827187713245318, -0.0799720729925563, -0.2153584910859839, 0.3826135316291281, -0.006880454461982784, 0.2873229182199187, 0.03910326394725416, 0.11882229779075715, -0.057705656913943436, 0.029546547018981073, 0.08443105579090115, -0.17281857568919654, 0.02115130127882973, 0.15492375309258932, 0.002265930777260413, 0.31618764649222914, -0.44431490988790756, -0.24364678571146214, 0.03762967217577776, 0.12288003050828895, 0.0973145911410332, -0.04256266077512313, -0.2241790478777451, 0.10428604552483496, -0.0936324196930703, -0.1866390625788578, 0.04010341300848571, 0.04750346514689833, 0.04106136475002131, -0.28345014987765654, 0.1523302154182602, 0.0806547535903519, 0.08441162387922911, -0.12660717128831797, -0.06409186287783086, -0.10935476206456467, 0.11301465708856995, 0.13202752600530707, 0.08743428251788525, 0.1395537266783625, -0.1714744159047162, 0.05853147116431501, 0.3548176654342872, -0.08022327398430207, -0.23191695245138058, 0.2103901306448582, -0.1527359471025799, -0.03000393973343307, 0.1319986090141659, 0.20773130493519906, 0.09830956635414623, -0.08821482002925525, 0.03328116778993717, -0.05799132649372041, 0.14292720593857666, 0.11941897782526212, -0.10442434490202383, 0.17717853035507383, 0.11046073568286374, 0.19974705238079574, 0.16043578074216688, -0.16609961848371313, -0.09708479000740529, -0.35304509251970256, -0.19866804515428763, -0.12159126961948157, 0.042327338879355615, -0.13493992019076964, -0.2116361860583614, 0.3590035120772275, 0.133008609413082, 0.24162434717679085, 0.011329726738646665, 0.3100515880960302, 0.16039089738963716, 0.0348005817795638, 0.15688393599460446, 0.2333225656863457, 0.15815267862247614, 0.16390515836974373, -0.25263492885157274, 0.11796064169872504, 0.098308163471908] |
1,801.10482 | Anatomy of magnetic anisotropy induced by Rashba spin-orbit interactions | Magnetic anisotropy controls the orientational stability and switching
properties of magnetic states, and therefore plays a central role in
spintronics. First-principles density-functional-theory calculations are able,
in most cases, to provide a satisfactory description of bulk and interface
contributions to the magnetic anisotropy of particular film/substrate
combinations. In this paper we focus on achieving a simplified understanding of
some trends in interfacial magnetic anisotropy based on a simple tight-binding
model for quasiparticle states in a heavy-metal/ferromagnetic-metal bilayer
film. We explain how to calculate the magnetic anisotropy energy of this model
from the quasiparticle spin-susceptibility, compare with more conventional
approaches using either a perturbative treatment of spin-orbit interactions or
a direct calculation of the dependence of the energy on the orientation of the
magnetization, and show that the magnetic anisotropy can be interpreted as a
competition between a Fermi-sea term favoring perpendicular anisotropy and a
Fermi-surface term favoring in-plane anisotropy. Based on this finding, we
conclude that perpendicular magnetic anisotropy should be expected in an
itinerant electron thin film when the spin magnetization density is larger than
the product of the band exchange splitting and the Fermi level
density-of-states of the magnetic state.
| cond-mat.mes-hall | magnetic anisotropy controls the orientational stability and switching properties of magnetic states and therefore plays a central role in spintronics firstprinciples densityfunctionaltheory calculations are able in most cases to provide a satisfactory description of bulk and interface contributions to the magnetic anisotropy of particular filmsubstrate combinations in this paper we focus on achieving a simplified understanding of some trends in interfacial magnetic anisotropy based on a simple tightbinding model for quasiparticle states in a heavymetalferromagneticmetal bilayer film we explain how to calculate the magnetic anisotropy energy of this model from the quasiparticle spinsusceptibility compare with more conventional approaches using either a perturbative treatment of spinorbit interactions or a direct calculation of the dependence of the energy on the orientation of the magnetization and show that the magnetic anisotropy can be interpreted as a competition between a fermisea term favoring perpendicular anisotropy and a fermisurface term favoring inplane anisotropy based on this finding we conclude that perpendicular magnetic anisotropy should be expected in an itinerant electron thin film when the spin magnetization density is larger than the product of the band exchange splitting and the fermi level densityofstates of the magnetic state | [['magnetic', 'anisotropy', 'controls', 'the', 'orientational', 'stability', 'and', 'switching', 'properties', 'of', 'magnetic', 'states', 'and', 'therefore', 'plays', 'a', 'central', 'role', 'in', 'spintronics', 'firstprinciples', 'densityfunctionaltheory', 'calculations', 'are', 'able', 'in', 'most', 'cases', 'to', 'provide', 'a', 'satisfactory', 'description', 'of', 'bulk', 'and', 'interface', 'contributions', 'to', 'the', 'magnetic', 'anisotropy', 'of', 'particular', 'filmsubstrate', 'combinations', 'in', 'this', 'paper', 'we', 'focus', 'on', 'achieving', 'a', 'simplified', 'understanding', 'of', 'some', 'trends', 'in', 'interfacial', 'magnetic', 'anisotropy', 'based', 'on', 'a', 'simple', 'tightbinding', 'model', 'for', 'quasiparticle', 'states', 'in', 'a', 'heavymetalferromagneticmetal', 'bilayer', 'film', 'we', 'explain', 'how', 'to', 'calculate', 'the', 'magnetic', 'anisotropy', 'energy', 'of', 'this', 'model', 'from', 'the', 'quasiparticle', 'spinsusceptibility', 'compare', 'with', 'more', 'conventional', 'approaches', 'using', 'either', 'a', 'perturbative', 'treatment', 'of', 'spinorbit', 'interactions', 'or', 'a', 'direct', 'calculation', 'of', 'the', 'dependence', 'of', 'the', 'energy', 'on', 'the', 'orientation', 'of', 'the', 'magnetization', 'and', 'show', 'that', 'the', 'magnetic', 'anisotropy', 'can', 'be', 'interpreted', 'as', 'a', 'competition', 'between', 'a', 'fermisea', 'term', 'favoring', 'perpendicular', 'anisotropy', 'and', 'a', 'fermisurface', 'term', 'favoring', 'inplane', 'anisotropy', 'based', 'on', 'this', 'finding', 'we', 'conclude', 'that', 'perpendicular', 'magnetic', 'anisotropy', 'should', 'be', 'expected', 'in', 'an', 'itinerant', 'electron', 'thin', 'film', 'when', 'the', 'spin', 'magnetization', 'density', 'is', 'larger', 'than', 'the', 'product', 'of', 'the', 'band', 'exchange', 'splitting', 'and', 'the', 'fermi', 'level', 'densityofstates', 'of', 'the', 'magnetic', 'state']] | [-0.19400784654089398, 0.1660527290231824, -0.06287444764403564, 0.06829820494412592, -0.07414371031459029, -0.07913564911210223, 0.04636308563150172, 0.3805054983834883, -0.2639822061008186, -0.3205070882790575, -0.03785542904178759, -0.280245627656481, -0.09793874991469477, 0.19476186495372338, 0.07823564448687984, -0.05062275555438215, -0.004593761133544735, -0.031549502851435374, -0.1077025634653278, -0.16770227977969243, 0.2976881852373481, 0.05412468885708796, 0.32780477677373904, 0.14274008267951246, 0.020197808654292635, 0.02903882072821848, 0.11240346037880762, 0.06653108258346228, -0.15789348652630764, 0.09505187977828379, 0.2104234392828259, -0.1255862766190579, 0.2027898423961903, -0.4852607897191774, -0.18946560973571122, 0.003875052718151557, 0.13695105617424766, 0.16085418682839525, -0.06027216285529951, -0.2285391587616974, 0.03704742823090208, -0.15866286466878496, -0.11781966700524973, -0.12074780345306192, -0.031104868461721037, -0.002273619944523824, -0.2736628266348577, 0.1322522954378081, 0.07455439044677309, 0.10339547583896906, -0.13946513378085862, -0.11722615212202073, -0.1034325211933863, 0.043251976131394164, 0.10795740028108029, 0.09637575259778379, 0.16771198268091356, -0.14173724187023348, -0.11501915139317709, 0.3695734135218357, -0.0632396276615174, -0.1664505523249605, 0.12808925424898535, -0.16710296923931883, -0.10168019819171413, 0.11496981809552954, 0.14840568549882033, 0.07785289903235695, -0.12229418907426359, 0.08373489822322307, 0.011395083067442389, 0.18173387709171757, 0.005112654992722367, 0.048647442038514115, 0.26340399004371934, 0.19123129613979375, 0.057514436976175365, 0.12406926402503526, -0.14562248020481908, -0.049122888088765505, -0.2345494060532043, -0.15851527006414376, -0.22029203636277664, 0.07090435726813188, -0.0948601592344379, -0.2110069806246381, 0.43254206713387056, 0.17496152616436839, 0.18226552044384572, -0.0563995995142154, 0.2825080147699306, 0.09169783259827742, 0.04442242342292478, 0.04587185798016818, 0.28414228431662963, 0.18187452974533172, 0.0978709584580716, -0.30329129691235723, 0.11415500327160484, 0.005615139371519418] |
1,801.10483 | New Size Hierarchies for Two Way Automata | We introduce a new type of nonuniform two--way automaton that can use a
different transition function for each tape square. We also enhance this model
by allowing to shuffle the given input at the beginning of the computation.
Then we present some hierarchy and incomparability results on the number of
states for the types of deterministic, nondeterministic, and bounded-error
probabilistic models. For this purpose, we provide some lower bounds for all
three models based on the numbers of subfunctions and we define two witness
functions.
| cs.FL cs.CC | we introduce a new type of nonuniform twoway automaton that can use a different transition function for each tape square we also enhance this model by allowing to shuffle the given input at the beginning of the computation then we present some hierarchy and incomparability results on the number of states for the types of deterministic nondeterministic and boundederror probabilistic models for this purpose we provide some lower bounds for all three models based on the numbers of subfunctions and we define two witness functions | [['we', 'introduce', 'a', 'new', 'type', 'of', 'nonuniform', 'twoway', 'automaton', 'that', 'can', 'use', 'a', 'different', 'transition', 'function', 'for', 'each', 'tape', 'square', 'we', 'also', 'enhance', 'this', 'model', 'by', 'allowing', 'to', 'shuffle', 'the', 'given', 'input', 'at', 'the', 'beginning', 'of', 'the', 'computation', 'then', 'we', 'present', 'some', 'hierarchy', 'and', 'incomparability', 'results', 'on', 'the', 'number', 'of', 'states', 'for', 'the', 'types', 'of', 'deterministic', 'nondeterministic', 'and', 'boundederror', 'probabilistic', 'models', 'for', 'this', 'purpose', 'we', 'provide', 'some', 'lower', 'bounds', 'for', 'all', 'three', 'models', 'based', 'on', 'the', 'numbers', 'of', 'subfunctions', 'and', 'we', 'define', 'two', 'witness', 'functions']] | [-0.10886417404125336, 0.14439797751495945, -0.049510698195766, 0.10476391485015697, -0.06693897601764869, -0.1674040803247515, 0.12247931366950712, 0.35454999493325456, -0.2907790549537715, -0.29095253998632814, 0.10075338436290622, -0.21293211700394749, -0.15645002329393345, 0.22143369150786277, -0.04527333234676489, 0.07336824479896356, 0.032643123305238345, 0.02742615596644635, -0.08425284958006267, -0.2553105754421695, 0.3560493954731261, -0.010859976629452671, 0.24899146791328403, 0.0324029323836679, 0.10185774455175681, 0.010430569727631176, -0.009714285947163316, 0.0217938365359955, -0.17280844136951012, 0.12920957861180582, 0.19852436592858902, 0.20725702383719824, 0.2662575576673536, -0.44911361853866016, -0.1405149751178482, 0.1595658887479016, 0.10951445943073315, 0.1325835679356447, -0.03188420950763804, -0.2289707151844221, 0.11076485221102998, -0.186642035502283, -0.04740143774542958, -0.05901164056678467, 0.009388465143959312, 0.05691114589571953, -0.2657300848404274, -0.005344717191217248, 0.08089681267738343, 0.03974244202870657, -0.04969491817276268, -0.1387688036350643, 0.05098060504259432, 0.14414800197324332, -0.07836752216304269, -0.035465925099218594, 0.0285497998325702, -0.11041544226053006, -0.17485474667457096, 0.3204267416258945, -0.07288802125874688, -0.2572641491670819, 0.20593820959603523, -0.10960190612001015, -0.19109234161955743, 0.04515364886645008, 0.1903471411260612, 0.09728823198991664, -0.09753391707644743, 0.03857273111352697, -0.08316802028566599, 0.16335658981081316, 0.05920554735862157, 0.056513643960523254, 0.14687963858287892, 0.14411608521990915, 0.06953348508104681, 0.2243319477803786, -0.06421483907958164, -0.07303476938430001, -0.34454191539655715, -0.1834459135637564, -0.1451779073665795, -0.009427070661502727, -0.0996974043926457, -0.17645168729427763, 0.4400867807952797, 0.1909440867109772, 0.1930680187199922, 0.17811019388301408, 0.27610197693164296, 0.1380072221488637, 0.03110364915474373, 0.06829795909716803, 0.14022013370413333, 0.09995795168420847, 0.05890138382639955, -0.15783817361054175, 0.07385102003429304, 0.1446202655980254] |
1,801.10484 | Cache-Aided Non-Orthogonal Multiple Access: The Two-User Case | In this paper, we propose a cache-aided non-orthogonal multiple access (NOMA)
scheme for spectrally efficient downlink transmission. The proposed scheme not
only reaps the benefits associated with NOMA and caching, but also exploits the
data cached at the users for interference cancellation. As a consequence,
caching can help to reduce the residual interference power, making multiple
decoding orders at the users feasible. The resulting flexibility in decoding
can be exploited for improved NOMA detection. We characterize the achievable
rate region of cache-aided NOMA and derive the Pareto optimal rate tuples
forming the boundary of the rate region. Moreover, we optimize cache-aided NOMA
for minimization of the time required for completing file delivery. The optimal
decoding order and the optimal transmit power and rate allocation are derived
as functions of the cache status, the file sizes, and the channel conditions.
Simulation results confirm that, compared to several baseline schemes, the
proposed cache-aided NOMA scheme significantly expands the achievable rate
region and increases the sum rate for downlink transmission, which translates
into substantially reduced file delivery times.
| cs.IT math.IT | in this paper we propose a cacheaided nonorthogonal multiple access noma scheme for spectrally efficient downlink transmission the proposed scheme not only reaps the benefits associated with noma and caching but also exploits the data cached at the users for interference cancellation as a consequence caching can help to reduce the residual interference power making multiple decoding orders at the users feasible the resulting flexibility in decoding can be exploited for improved noma detection we characterize the achievable rate region of cacheaided noma and derive the pareto optimal rate tuples forming the boundary of the rate region moreover we optimize cacheaided noma for minimization of the time required for completing file delivery the optimal decoding order and the optimal transmit power and rate allocation are derived as functions of the cache status the file sizes and the channel conditions simulation results confirm that compared to several baseline schemes the proposed cacheaided noma scheme significantly expands the achievable rate region and increases the sum rate for downlink transmission which translates into substantially reduced file delivery times | [['in', 'this', 'paper', 'we', 'propose', 'a', 'cacheaided', 'nonorthogonal', 'multiple', 'access', 'noma', 'scheme', 'for', 'spectrally', 'efficient', 'downlink', 'transmission', 'the', 'proposed', 'scheme', 'not', 'only', 'reaps', 'the', 'benefits', 'associated', 'with', 'noma', 'and', 'caching', 'but', 'also', 'exploits', 'the', 'data', 'cached', 'at', 'the', 'users', 'for', 'interference', 'cancellation', 'as', 'a', 'consequence', 'caching', 'can', 'help', 'to', 'reduce', 'the', 'residual', 'interference', 'power', 'making', 'multiple', 'decoding', 'orders', 'at', 'the', 'users', 'feasible', 'the', 'resulting', 'flexibility', 'in', 'decoding', 'can', 'be', 'exploited', 'for', 'improved', 'noma', 'detection', 'we', 'characterize', 'the', 'achievable', 'rate', 'region', 'of', 'cacheaided', 'noma', 'and', 'derive', 'the', 'pareto', 'optimal', 'rate', 'tuples', 'forming', 'the', 'boundary', 'of', 'the', 'rate', 'region', 'moreover', 'we', 'optimize', 'cacheaided', 'noma', 'for', 'minimization', 'of', 'the', 'time', 'required', 'for', 'completing', 'file', 'delivery', 'the', 'optimal', 'decoding', 'order', 'and', 'the', 'optimal', 'transmit', 'power', 'and', 'rate', 'allocation', 'are', 'derived', 'as', 'functions', 'of', 'the', 'cache', 'status', 'the', 'file', 'sizes', 'and', 'the', 'channel', 'conditions', 'simulation', 'results', 'confirm', 'that', 'compared', 'to', 'several', 'baseline', 'schemes', 'the', 'proposed', 'cacheaided', 'noma', 'scheme', 'significantly', 'expands', 'the', 'achievable', 'rate', 'region', 'and', 'increases', 'the', 'sum', 'rate', 'for', 'downlink', 'transmission', 'which', 'translates', 'into', 'substantially', 'reduced', 'file', 'delivery', 'times']] | [-0.26918557427158313, -0.021404265432086376, -0.0016628738625773362, 0.028287564267936563, -0.04418763226829469, -0.24479634302003042, 0.1957492503636916, 0.38856824821659497, -0.29452892059327235, -0.23813518259142127, 0.08521553545990693, -0.20692137261054347, -0.1254419405412461, 0.13379539485621667, -0.10492216824337706, 0.0701203692438347, 0.04475777986810759, 0.02218074027981077, -0.06106502089915531, -0.34152780359344825, 0.25963216486786095, 0.19237534457019398, 0.43221807854516164, 0.06252130812832288, 0.06424168916153056, 0.021144646927215426, -0.04660239296832255, -0.07127852445202214, -0.12211637612852168, 0.07583720768535776, 0.3770293574939881, 0.24844971377934727, 0.24986794554761477, -0.3981304863281548, -0.25678515037787814, 0.055068619959056375, 0.2603973618854902, 0.04951325411442667, -0.057862859152789624, -0.23675756751958812, 0.1457814843952656, -0.27690301606298556, -0.011167362726160458, 0.009785432336585862, -0.12664728813538595, 0.0667552090675703, -0.41814888427566205, 0.02149493118731438, -0.04133270758353839, -0.045721851720341614, -0.08239981133756893, -0.13538862028026155, 0.05867394436416881, 0.16920306849426456, 0.028840057263649733, -0.01731763331086508, 0.09090731579278197, -0.0724185172867562, -0.11435314177925257, 0.3689944214001298, 0.03146243944431522, -0.22498919675126672, 0.11378200475093243, -0.09807044626014041, -0.05085208318545483, 0.23271424843796662, 0.2504102515352757, 0.08760827533900738, -0.16191747354875718, -0.01920072250400803, -0.0171470460182588, 0.17106369893997908, 0.14906469399109482, 0.18413787613223706, 0.11144238074975354, 0.1798915446243648, 0.1649513346914734, 0.1349462793042351, -0.12980592595180496, -0.1308154049861644, -0.19961531751988723, -0.12983243529817887, -0.18082175590363997, -0.012002269979483182, -0.1458961120881473, 0.006535263375512191, 0.3771734670744419, 0.12125004185496696, 0.09549231807967382, 0.17135378219785968, 0.41379540785082747, 0.1341996475774795, 0.08294458833390049, 0.16835292461195162, 0.1532292031403631, 0.04993574297853878, 0.1345389059369336, -0.2876202618091234, 0.07578449063668294, 0.017523992444787705] |
1,801.10485 | On entropy of $\mathbb{P}$-twists | We show that the $\mathbb{P}$-twist associated to any $\mathbb{P}$-object of
a smooth project variety is not conjugate to a standard autoequivalence. This
result is obtained by computing the categorical entropy functions of
$\mathbb{P}$-twists. We also determine the categorical polynomial entropy of
spherical twists and $\mathbb{P}$-twists, under an additional assumption.
| math.AG math.DS | we show that the mathbbptwist associated to any mathbbpobject of a smooth project variety is not conjugate to a standard autoequivalence this result is obtained by computing the categorical entropy functions of mathbbptwists we also determine the categorical polynomial entropy of spherical twists and mathbbptwists under an additional assumption | [['we', 'show', 'that', 'the', 'mathbbptwist', 'associated', 'to', 'any', 'mathbbpobject', 'of', 'a', 'smooth', 'project', 'variety', 'is', 'not', 'conjugate', 'to', 'a', 'standard', 'autoequivalence', 'this', 'result', 'is', 'obtained', 'by', 'computing', 'the', 'categorical', 'entropy', 'functions', 'of', 'mathbbptwists', 'we', 'also', 'determine', 'the', 'categorical', 'polynomial', 'entropy', 'of', 'spherical', 'twists', 'and', 'mathbbptwists', 'under', 'an', 'additional', 'assumption']] | [-0.1151836570766237, 0.06114388279286989, -0.15198223640521366, 0.08351674144311498, -0.09020081096225314, -0.09956213755326139, -0.0022985504215790164, 0.3415923530028926, -0.3423233273335629, -0.22178938793432382, 0.08951110332790348, -0.19996714416774922, -0.15228140101793947, 0.22135619206560983, -0.1594973222158539, 0.04466585877041022, 0.05317181936568684, 0.08412108671230574, -0.1354204169733243, -0.2705590830908881, 0.3911931643055545, 4.770139025317298e-05, 0.24505047448393372, 0.0614656901336275, 0.1423016703584128, -0.006913849814898438, -0.02894394469136993, 0.04310674036128653, -0.14925734521384584, 0.14383521837492783, 0.22911272740198507, 0.15120807070699002, 0.21602083175546594, -0.36408852545751463, -0.1771148405710442, 0.21374893318861724, 0.05271016301380264, 0.07613340766790012, -0.024799978008700742, -0.22780427469147577, 0.15100875248511633, -0.21206904927061665, -0.15174924904066656, -0.10741882595337099, -0.0009352979457212819, -0.006443624322613081, -0.3051752349258297, 0.0014355157961189332, 0.12195637201269467, 0.11095683529145188, -0.06108185023897224, -0.05798864519844452, -0.04551754102317823, 0.04655576414532132, 0.03851922509363956, 0.06415323678197132, 0.13098888660056723, -0.12056842167447838, -0.09207541280322605, 0.33740459562589725, -0.08122606770031982, -0.2553326065341632, 0.17949393482671844, -0.13192463716905978, -0.1846008751127455, 0.1130603511300352, 0.09118964434083965, 0.10498519736445612, -0.11629100971751744, 0.14127294468667564, -0.10977733014151454, 0.1447290665573544, 0.06537714855124553, -0.02706471440485782, 0.1343121032954918, 0.02712642609452208, 0.08149062835921844, 0.20500575229525567, -0.020615188054378248, -0.05945744012585945, -0.3899062004354265, -0.22562057967815136, -0.1935119761981898, 0.09798999872194449, -0.10430616499409856, -0.18432165247698626, 0.3668127505315675, 0.08408770122461849, 0.20068232210146056, 0.09668348328106934, 0.2782081584963534, 0.13169094262023767, 0.06979834900961981, 0.06279800474229787, 0.13833822928782966, 0.13663089892620014, -0.02350064396030373, -0.17867428538803426, 0.0558521793430878, 0.10367076608041922] |
1,801.10486 | Computation of Optimal Control Problems with Terminal Constraint via
Modified Evolution Partial Differential Equation | The Variation Evolving Method (VEM), which seeks the optimal solutions with
the variation evolution principle, is further developed to be more flexible in
solving the Optimal Control Problems (OCPs) with terminal constraint. With the
first-order stable dynamics to eliminate the infeasibilities, the Modified
Evolution Partial Differential Equation (MEPDE) that is valid in the infeasible
solution domain is proposed, and a Lyapunov functional is constructed to
theoretically ensure its validity. In particular, it is proved that even with
the infinite-time convergence dynamics, the violated terminal inequality
constraints, which are inactive for the optimal solution, will enter the
feasible domain in finite time. Through transforming the MEPDE to the
finite-dimensional Initial-value Problem (IVP) with the semi-discrete method,
the OCPs may be solved with common Ordinary Differential Equation (ODE)
numerical integration methods. Illustrative examples are presented to show the
effectiveness of the proposed method.
| cs.SY | the variation evolving method vem which seeks the optimal solutions with the variation evolution principle is further developed to be more flexible in solving the optimal control problems ocps with terminal constraint with the firstorder stable dynamics to eliminate the infeasibilities the modified evolution partial differential equation mepde that is valid in the infeasible solution domain is proposed and a lyapunov functional is constructed to theoretically ensure its validity in particular it is proved that even with the infinitetime convergence dynamics the violated terminal inequality constraints which are inactive for the optimal solution will enter the feasible domain in finite time through transforming the mepde to the finitedimensional initialvalue problem ivp with the semidiscrete method the ocps may be solved with common ordinary differential equation ode numerical integration methods illustrative examples are presented to show the effectiveness of the proposed method | [['the', 'variation', 'evolving', 'method', 'vem', 'which', 'seeks', 'the', 'optimal', 'solutions', 'with', 'the', 'variation', 'evolution', 'principle', 'is', 'further', 'developed', 'to', 'be', 'more', 'flexible', 'in', 'solving', 'the', 'optimal', 'control', 'problems', 'ocps', 'with', 'terminal', 'constraint', 'with', 'the', 'firstorder', 'stable', 'dynamics', 'to', 'eliminate', 'the', 'infeasibilities', 'the', 'modified', 'evolution', 'partial', 'differential', 'equation', 'mepde', 'that', 'is', 'valid', 'in', 'the', 'infeasible', 'solution', 'domain', 'is', 'proposed', 'and', 'a', 'lyapunov', 'functional', 'is', 'constructed', 'to', 'theoretically', 'ensure', 'its', 'validity', 'in', 'particular', 'it', 'is', 'proved', 'that', 'even', 'with', 'the', 'infinitetime', 'convergence', 'dynamics', 'the', 'violated', 'terminal', 'inequality', 'constraints', 'which', 'are', 'inactive', 'for', 'the', 'optimal', 'solution', 'will', 'enter', 'the', 'feasible', 'domain', 'in', 'finite', 'time', 'through', 'transforming', 'the', 'mepde', 'to', 'the', 'finitedimensional', 'initialvalue', 'problem', 'ivp', 'with', 'the', 'semidiscrete', 'method', 'the', 'ocps', 'may', 'be', 'solved', 'with', 'common', 'ordinary', 'differential', 'equation', 'ode', 'numerical', 'integration', 'methods', 'illustrative', 'examples', 'are', 'presented', 'to', 'show', 'the', 'effectiveness', 'of', 'the', 'proposed', 'method']] | [-0.11243013401093671, 0.012391235622436665, -0.11173548269346892, 0.0804602243483616, -0.12466303590122316, -0.16949139538777175, -0.00673075855488507, 0.325632145253124, -0.35326819344283006, -0.26919727549861394, 0.17385483659442058, -0.24441512620826955, -0.1362246684361544, 0.19145631323159812, -0.06039230542244028, 0.14436126972017677, 0.08596825567844639, 0.00855280320903809, -0.07146412379731484, -0.291673216151355, 0.3009429508853677, -0.010078385405296044, 0.2733127417113203, 0.007711352073594177, 0.15832204750919943, -0.03307710384628434, 0.022043011123616008, 0.05635937138480677, -0.13599493593807088, 0.10314508960934074, 0.30254583758898346, 0.1264388910461244, 0.3243331405595481, -0.4180411151978824, -0.1962042744304958, 0.10715967532006099, 0.1444725794583666, 0.10985132257065487, -0.0490273604034019, -0.2875636818034829, 0.10797734551212128, -0.10895381426679895, -0.18139683404977588, -0.08867443954277275, -0.007447840056295018, 0.041284664808739005, -0.32547234782694484, 0.09435166701969268, 0.018251026318937862, -0.04982132357277191, -0.11335925131503546, -0.05194726151501318, -0.039753460519605405, 0.06859862274765004, 0.0404511087711418, -0.016243041566700388, 0.07224432712005412, -0.04100607267895834, -0.08839187093025488, 0.362489367640919, -0.05816213042213977, -0.30934173712949103, 0.14404273553660957, -0.08774218701409082, -0.09994418525116906, 0.16389480461667982, 0.14069572195960142, 0.19093714665814987, -0.18164425171080897, 0.11207484684695268, -0.016933811654289848, 0.15169701747606315, 0.039654113563353854, -0.03312722074283327, 0.07289025121998283, 0.19474107858376483, 0.15393693652004004, 0.12938210715727358, 0.008928565303635911, -0.20016540602693778, -0.31852464987594875, -0.12209533449771592, -0.14428143233074237, 0.002994718324902246, -0.09759043066240194, -0.14396660197392214, 0.32805320766600343, 0.15999880521273468, 0.09491477234342652, 0.08529329417514608, 0.2904559670270776, 0.2411167902818365, 0.009789233665457732, 0.09767051984509117, 0.23650166288808847, 0.13360820269453333, 0.11597702864946115, -0.29384920563550476, 0.09102695771298713, 0.12421169950084078] |
1,801.10487 | Identifying systemically important companies in the entire liability
network of a small open economy | To a large extent, the systemic importance of financial institutions is
related to the topology of financial liability networks. In this work we
reconstruct and analyze the - to our knowledge - largest financial network that
has been studied up to now. This financial liability network consists of 51,980
firms and 796 banks. It represents 80.2% of total liabilities towards banks by
firms and all interbank liabilities from the entire Austrian banking system. We
find that firms contribute to systemic risk in similar ways as banks do. In
particular, we identify several medium-sized banks and firms with total assets
below 1 bln. EUR that are systemically important in the entire financial
network. We show that the notion of systemically important financial
institutions (SIFIs) or global and domestic systemically important banks
(G-SIBs or D-SIBs) can be straightforwardly extended to firms. We find that
firms introduce slightly more systemic risk than banks. In Austria in 2008, the
total systemic risk of the interbank network amounts to only 29% of the total
systemic risk of the entire financial network, consisting of firms and banks.
| q-fin.RM physics.app-ph | to a large extent the systemic importance of financial institutions is related to the topology of financial liability networks in this work we reconstruct and analyze the to our knowledge largest financial network that has been studied up to now this financial liability network consists of 51980 firms and 796 banks it represents 802 of total liabilities towards banks by firms and all interbank liabilities from the entire austrian banking system we find that firms contribute to systemic risk in similar ways as banks do in particular we identify several mediumsized banks and firms with total assets below 1 bln eur that are systemically important in the entire financial network we show that the notion of systemically important financial institutions sifis or global and domestic systemically important banks gsibs or dsibs can be straightforwardly extended to firms we find that firms introduce slightly more systemic risk than banks in austria in 2008 the total systemic risk of the interbank network amounts to only 29 of the total systemic risk of the entire financial network consisting of firms and banks | [['to', 'a', 'large', 'extent', 'the', 'systemic', 'importance', 'of', 'financial', 'institutions', 'is', 'related', 'to', 'the', 'topology', 'of', 'financial', 'liability', 'networks', 'in', 'this', 'work', 'we', 'reconstruct', 'and', 'analyze', 'the', 'to', 'our', 'knowledge', 'largest', 'financial', 'network', 'that', 'has', 'been', 'studied', 'up', 'to', 'now', 'this', 'financial', 'liability', 'network', 'consists', 'of', '51980', 'firms', 'and', '796', 'banks', 'it', 'represents', '802', 'of', 'total', 'liabilities', 'towards', 'banks', 'by', 'firms', 'and', 'all', 'interbank', 'liabilities', 'from', 'the', 'entire', 'austrian', 'banking', 'system', 'we', 'find', 'that', 'firms', 'contribute', 'to', 'systemic', 'risk', 'in', 'similar', 'ways', 'as', 'banks', 'do', 'in', 'particular', 'we', 'identify', 'several', 'mediumsized', 'banks', 'and', 'firms', 'with', 'total', 'assets', 'below', '1', 'bln', 'eur', 'that', 'are', 'systemically', 'important', 'in', 'the', 'entire', 'financial', 'network', 'we', 'show', 'that', 'the', 'notion', 'of', 'systemically', 'important', 'financial', 'institutions', 'sifis', 'or', 'global', 'and', 'domestic', 'systemically', 'important', 'banks', 'gsibs', 'or', 'dsibs', 'can', 'be', 'straightforwardly', 'extended', 'to', 'firms', 'we', 'find', 'that', 'firms', 'introduce', 'slightly', 'more', 'systemic', 'risk', 'than', 'banks', 'in', 'austria', 'in', '2008', 'the', 'total', 'systemic', 'risk', 'of', 'the', 'interbank', 'network', 'amounts', 'to', 'only', '29', 'of', 'the', 'total', 'systemic', 'risk', 'of', 'the', 'entire', 'financial', 'network', 'consisting', 'of', 'firms', 'and', 'banks']] | [-0.0829572724112662, 0.007290682229239725, -0.03973614622701991, 0.13244112200264183, -0.06824988138067437, -0.058449054050054086, 0.12278029598863953, 0.3836626402065579, -0.22826426415467413, -0.2725640931245634, 0.15155159387511258, -0.3506285059397335, -0.16138869169889028, 0.13759918750124314, -0.17694925722540666, -0.020987091829594472, 0.032587093085387334, -0.03974981969722289, 0.10333154798159112, -0.3187434721263231, 0.311342425839081, 0.08573812851156135, 0.3030000743640345, 0.03265962677042258, 0.08100291155969282, -0.035466928231019504, -0.07657539593792484, 0.025662475349092172, -0.1187934006066841, 0.2080067623364555, 0.374087923911458, 0.1473245467190857, 0.4616376523317843, -0.4221821655913935, -0.14482868247597064, 0.1826721990775675, 0.026792508998549, 0.009178130309976175, 0.15237839816302248, -0.3097655516286186, 0.011118518740417551, -0.37716865134925326, -0.13022316790627853, -0.05305357471024249, 0.07270879740432157, 0.0248845017694021, -0.24732804246836126, 0.08076366794816518, -0.011453893132991878, 0.04948182034669286, -0.038012201639976206, -0.1230638426732493, -0.14317186561934017, 0.1971963886592516, 0.13474173915288332, -0.07363067855953244, 0.20342606727012807, -0.11954581409713812, -0.14177506461760586, 0.3461740308278109, -0.03219593922243556, -0.08350539609453099, 0.1208537585420355, -0.14181144900309542, -0.17009582163734457, 0.09606848906273138, 0.26888889607599814, -0.07617417613759973, -0.22924921247518837, -0.022819067236420167, -0.05726524718674058, 0.18691660430365226, 0.0954607507019267, -0.023080883200390864, 0.14856663147233543, 0.18376486609416282, 0.13818000941695172, 0.12585132972055804, -0.06714627602154725, -0.1485733997818651, -0.1866001303091982, -0.12076792206107455, -0.09430338503953364, 0.06711067267467326, -0.13506426727402518, -0.14820002536532748, 0.40384039612181777, 0.1969073667321854, 0.11055932364473908, 0.03791307754509446, 0.22759245328426278, 0.03363910555776398, 0.10126245382773337, 0.1251261534121961, 0.22447866893841723, -0.04166729055413461, 0.17595857407701712, -0.09721838625537305, 0.20733298086903273, -0.04910677338892457] |
1,801.10488 | Three Neutrino Oscillations in Matter | Following similar approaches in the past, the Schrodinger equation for three
neutrino propagation in matter of constant density is solved analytically by
two successive diagonalizations of 2x2 matrices. The final result for the
oscillation probabilities is obtained directly in the conventional parametric
form as in the vacuum but with explicit simple modification of two mixing
angles ($\theta_{12}$ and $\theta_{13}$) and mass eigenvalues.
| hep-ph | following similar approaches in the past the schrodinger equation for three neutrino propagation in matter of constant density is solved analytically by two successive diagonalizations of 2x2 matrices the final result for the oscillation probabilities is obtained directly in the conventional parametric form as in the vacuum but with explicit simple modification of two mixing angles theta_12 and theta_13 and mass eigenvalues | [['following', 'similar', 'approaches', 'in', 'the', 'past', 'the', 'schrodinger', 'equation', 'for', 'three', 'neutrino', 'propagation', 'in', 'matter', 'of', 'constant', 'density', 'is', 'solved', 'analytically', 'by', 'two', 'successive', 'diagonalizations', 'of', '2x2', 'matrices', 'the', 'final', 'result', 'for', 'the', 'oscillation', 'probabilities', 'is', 'obtained', 'directly', 'in', 'the', 'conventional', 'parametric', 'form', 'as', 'in', 'the', 'vacuum', 'but', 'with', 'explicit', 'simple', 'modification', 'of', 'two', 'mixing', 'angles', 'theta_12', 'and', 'theta_13', 'and', 'mass', 'eigenvalues']] | [-0.1326928484035776, 0.1991805528110314, -0.01925860265750558, 0.09114086460096822, -0.019049269087131945, -0.14103431224582658, 0.029425924929279472, 0.34229442504264657, -0.23899274418551114, -0.2931668624627374, 0.07091295676335933, -0.24877031118751713, -0.11420500401647822, 0.18422928149060858, 0.04790092343764921, 0.10853897663013588, 0.06691541242969012, 0.028377101426163027, -0.17131509015246504, -0.19785526557825506, 0.34522545237409613, -0.003220827258642643, 0.2244495406574119, 0.01052222270593648, 0.08759108984902982, -0.020549553806983655, -0.0008113190471645325, -0.04261302167639857, -0.11766272140366416, 0.022223079066363075, 0.2077619380189947, 0.09965578146699455, 0.17874381948082196, -0.4291926139905568, -0.17835242610665097, 0.10526121534677522, 0.15836218283361486, 0.1245148814313354, -0.04793197825370777, -0.3107567231861814, -0.004373361326513752, -0.18107470357039523, -0.17052362884409847, -0.01906241880609624, -0.025090209989538117, -0.019769736578793176, -0.31965985960297044, 0.1630573844266755, -0.014736204167767879, -0.02884721328249021, -0.026532391142550734, -0.2155752891689659, 0.015776299075373718, 0.08961518946284007, 0.11470237973862235, -0.05347504739409253, 0.03320681906470488, -0.11904061749397267, -0.07960564958592577, 0.3606966523774674, -0.07577115556059946, -0.24005909098853026, 0.07110950634664585, -0.19048954560862658, -0.0878182242459227, 0.14346894982361025, 0.11057782624923293, 0.08393421404874854, -0.17770722033756395, 0.09513559488527056, -0.08149459094537663, 0.1219833546558455, 0.13515572469200818, -0.034293978343597584, 0.17729546219080447, 0.12909247474594704, 0.08000054821792629, 0.005376350284824448, -0.04877751542916221, -0.12755569159203478, -0.2982320755385914, -0.09355407362923987, -0.19335133848231165, 0.06520588193914943, -0.14053181967380712, -0.13502055515099556, 0.43944370609542893, 0.0793816685646532, 0.21288158720539463, 0.05808400876835109, 0.33025747217658546, 0.14020006106077362, 0.01218272382468586, 0.03309338517306793, 0.3189676404600182, 0.1817892110012772, 0.08650647788759201, -0.26270522416058567, 0.043579274266507595, 0.13554285178636952] |
1,801.10489 | Hodge level for weighted complete intersections | We give lower bounds for Hodge numbers of smooth well formed Fano weighted
complete intersections. In particular, we compute their Hodge level, that is,
the maximal distance between non-trivial Hodge numbers in the same row of the
Hodge diamond. This allows us to classify varieties whose Hodge numbers are
like that of a projective space, of a curve, or of a Calabi--Yau variety of low
dimension.
| math.AG | we give lower bounds for hodge numbers of smooth well formed fano weighted complete intersections in particular we compute their hodge level that is the maximal distance between nontrivial hodge numbers in the same row of the hodge diamond this allows us to classify varieties whose hodge numbers are like that of a projective space of a curve or of a calabiyau variety of low dimension | [['we', 'give', 'lower', 'bounds', 'for', 'hodge', 'numbers', 'of', 'smooth', 'well', 'formed', 'fano', 'weighted', 'complete', 'intersections', 'in', 'particular', 'we', 'compute', 'their', 'hodge', 'level', 'that', 'is', 'the', 'maximal', 'distance', 'between', 'nontrivial', 'hodge', 'numbers', 'in', 'the', 'same', 'row', 'of', 'the', 'hodge', 'diamond', 'this', 'allows', 'us', 'to', 'classify', 'varieties', 'whose', 'hodge', 'numbers', 'are', 'like', 'that', 'of', 'a', 'projective', 'space', 'of', 'a', 'curve', 'or', 'of', 'a', 'calabiyau', 'variety', 'of', 'low', 'dimension']] | [-0.2085216537992837, 0.08006658278067004, -0.12438588682562113, 0.14128202925238645, -0.11198243188008553, -0.13118421116307605, 0.0319909269473459, 0.3146536960972078, -0.30716655349754024, -0.2645018124727137, 0.09878808858620962, -0.18009247190947822, -0.1487104498364991, 0.21349011296335835, -0.20247566986433935, -0.022472866909634886, 0.008792973246961606, 0.10347401549700987, -0.09540133926819896, -0.327744633185141, 0.4538530395225142, -0.06839861157068024, 0.24610775501721285, 0.08419051991465192, 0.0869133676345827, -0.012922060189091346, 0.009773126722200575, -0.023788852102535948, -0.1308274077982236, 0.23886732574354744, 0.3266139831958395, 0.07856515813689453, 0.12747589819076838, -0.42932909696052474, -0.10200773148839785, 0.2754156429913234, 0.0720553552082768, 0.07379882359369234, 0.038237226103912246, -0.18086196369293964, 0.10562988101137859, -0.10168054160859549, -0.22525464867552122, -0.11027251139184403, 0.04267278485790347, 0.05098574837161736, -0.19647933394916242, 0.004559399454261769, 0.02203499787014373, 0.13042289962653408, -0.037199637747658984, -0.13133685203325568, -0.14354570039590311, 0.05654214259949654, -0.06560961535609694, -0.01684180933366544, 0.05222629146142439, -0.12151765033503938, -0.14010578121594858, 0.3590895338477849, -0.07116783616330588, -0.16581933493867065, 0.11649668788198721, -0.22724615160206502, -0.15439397369680757, 0.16431196392725475, 0.1440642588969433, 0.2117574101659667, 0.04669703081758185, 0.1140994306721647, -0.1278578038609615, 0.06385292910095869, 0.17438713728563127, 0.057046814017336474, 0.15133934039058108, 0.10278661073199614, 0.1107629721236387, 0.13745239554819735, -0.1018720135713617, -0.06519323037090627, -0.36525751609411655, -0.21609043335598527, -0.16255085397455277, 0.16525736804628235, -0.164848602045271, -0.22987307624884346, 0.40925163274038245, -0.017217968223672924, 0.2691991472489793, 0.1311468409205025, 0.2376760239148456, 0.03480214236134833, 0.06136952958309628, 0.02000690719366751, 0.12059659282959094, 0.26180033037213213, -0.029038203513306198, -0.1353637131573068, -0.04498321884735064, 0.16595783052175786] |
1,801.1049 | Recognising and Generating Terms using Derivatives of Parsing Expression
Grammars | Grammar-based sentence generation has been thoroughly explored for
Context-Free Grammars (CFGs), but remains unsolved for recognition-based
approaches such as Parsing Expression Grammars (PEGs). Lacking tool support,
language designers using PEGs have difficulty predicting the behaviour of their
parsers. In this paper, we extend the idea of derivatives, originally
formulated for regular expressions, to PEGs. We then present a novel technique
for sentence generation based on derivatives, applicable to any grammatical
formalism for which the derivative can be defined--now including PEGs. Finally,
we propose applying derivatives more generally to other problems facing
language designers and implementers.
| cs.PL | grammarbased sentence generation has been thoroughly explored for contextfree grammars cfgs but remains unsolved for recognitionbased approaches such as parsing expression grammars pegs lacking tool support language designers using pegs have difficulty predicting the behaviour of their parsers in this paper we extend the idea of derivatives originally formulated for regular expressions to pegs we then present a novel technique for sentence generation based on derivatives applicable to any grammatical formalism for which the derivative can be definednow including pegs finally we propose applying derivatives more generally to other problems facing language designers and implementers | [['grammarbased', 'sentence', 'generation', 'has', 'been', 'thoroughly', 'explored', 'for', 'contextfree', 'grammars', 'cfgs', 'but', 'remains', 'unsolved', 'for', 'recognitionbased', 'approaches', 'such', 'as', 'parsing', 'expression', 'grammars', 'pegs', 'lacking', 'tool', 'support', 'language', 'designers', 'using', 'pegs', 'have', 'difficulty', 'predicting', 'the', 'behaviour', 'of', 'their', 'parsers', 'in', 'this', 'paper', 'we', 'extend', 'the', 'idea', 'of', 'derivatives', 'originally', 'formulated', 'for', 'regular', 'expressions', 'to', 'pegs', 'we', 'then', 'present', 'a', 'novel', 'technique', 'for', 'sentence', 'generation', 'based', 'on', 'derivatives', 'applicable', 'to', 'any', 'grammatical', 'formalism', 'for', 'which', 'the', 'derivative', 'can', 'be', 'definednow', 'including', 'pegs', 'finally', 'we', 'propose', 'applying', 'derivatives', 'more', 'generally', 'to', 'other', 'problems', 'facing', 'language', 'designers', 'and', 'implementers']] | [-0.024997596273525678, 0.009313000841660703, -0.0453693059624787, 0.16868425063922646, -0.23471096807971914, -0.1909933137519166, 0.06741868681645893, 0.4414220353628093, -0.27354472378229205, -0.31141615297367914, 0.05619375576993371, -0.24243229826258378, -0.16723789892932203, 0.190963774567787, -0.16430673762620923, 0.08666830912153138, 0.06495427362066, 0.05459795643307982, -0.011846473750143133, -0.2312137845301743, 0.3057942556048882, -0.0078929779961943, 0.24925368362443245, 0.06286018215952084, 0.13185540015036437, -0.033796787868808714, -0.029907855549529988, 0.0063023436814546585, -0.1101803287685393, 0.17861027742161395, 0.39477435589341964, 0.24176116908424872, 0.2850922787205336, -0.46111196097224316, -0.1978159121019726, 0.02381951379728444, 0.15117379467181385, 0.1471254491740144, -0.06534023939225045, -0.26823346665565, 0.11041454789525967, -0.20985435870317545, -0.02794644890471976, -0.13960146072736762, 0.07137502943155692, -0.050320071906830986, -0.2317841089345475, -0.026857743277511698, 0.16227713291176615, 0.07785210375020161, -0.022508606326424496, -0.12446721002925187, 0.05064322454842461, 0.164722861427358, 0.012355477182551268, 0.061558653336721766, 0.04205800905982231, -0.13526932466923794, -0.21017567723731886, 0.40670416133597176, -0.059148070866247, -0.275557828878865, 0.17280803193050892, -0.04089882956976269, -0.23295258262016355, 0.011658989067403494, 0.17187341640485412, 0.18791812341759337, -0.21741553697675625, 0.09462886520579675, 0.02877454075744336, 0.18498927653034, 0.1743863264812117, -0.002270713537693658, 0.21432179355240882, 0.19817167912867475, -0.043521783864521914, 0.17600127265409646, 0.006281155917020713, -0.04959626425493588, -0.20975800357422136, -0.13183466308572028, -0.09482498634408446, -0.07286369409213991, -0.02139381567951901, -0.21544186057562523, 0.3723378379214951, 0.23711481538323803, 0.05322244844617362, 0.2014056460082313, 0.33147359873227616, 0.1598487420619386, 0.10271397086127879, 0.07835374743320998, 0.1201981088503244, 0.05870327941003315, 0.11525414370376855, -0.10456736521309916, 0.15572393498076323, 0.1444586988716842] |
1,801.10491 | Interactive Nearest Lattice Point Search in a Distributed Setting: Two
Dimensions | The nearest lattice point problem in $\mathbb{R}^n$ is formulated in a
distributed network with $n$ nodes. The objective is to minimize the
probability that an incorrect lattice point is found, subject to a constraint
on inter-node communication. Algorithms with a single as well as an unbounded
number of rounds of communication are considered for the case $n=2$. For the
algorithm with a single round, expressions are derived for the error
probability as a function of the total number of communicated bits. We observe
that the error exponent depends on the lattice structure and that zero error
requires an infinite number of communicated bits. In contrast, with an infinite
number of allowed communication rounds, the nearest lattice point can be
determined without error with a finite average number of communicated bits and
a finite average number of rounds of communication. In two dimensions, the
hexagonal lattice, which is most efficient for communication and compression,
is found to be the most expensive in terms of communication cost.
| cs.IT math.IT | the nearest lattice point problem in mathbbrn is formulated in a distributed network with n nodes the objective is to minimize the probability that an incorrect lattice point is found subject to a constraint on internode communication algorithms with a single as well as an unbounded number of rounds of communication are considered for the case n2 for the algorithm with a single round expressions are derived for the error probability as a function of the total number of communicated bits we observe that the error exponent depends on the lattice structure and that zero error requires an infinite number of communicated bits in contrast with an infinite number of allowed communication rounds the nearest lattice point can be determined without error with a finite average number of communicated bits and a finite average number of rounds of communication in two dimensions the hexagonal lattice which is most efficient for communication and compression is found to be the most expensive in terms of communication cost | [['the', 'nearest', 'lattice', 'point', 'problem', 'in', 'mathbbrn', 'is', 'formulated', 'in', 'a', 'distributed', 'network', 'with', 'n', 'nodes', 'the', 'objective', 'is', 'to', 'minimize', 'the', 'probability', 'that', 'an', 'incorrect', 'lattice', 'point', 'is', 'found', 'subject', 'to', 'a', 'constraint', 'on', 'internode', 'communication', 'algorithms', 'with', 'a', 'single', 'as', 'well', 'as', 'an', 'unbounded', 'number', 'of', 'rounds', 'of', 'communication', 'are', 'considered', 'for', 'the', 'case', 'n2', 'for', 'the', 'algorithm', 'with', 'a', 'single', 'round', 'expressions', 'are', 'derived', 'for', 'the', 'error', 'probability', 'as', 'a', 'function', 'of', 'the', 'total', 'number', 'of', 'communicated', 'bits', 'we', 'observe', 'that', 'the', 'error', 'exponent', 'depends', 'on', 'the', 'lattice', 'structure', 'and', 'that', 'zero', 'error', 'requires', 'an', 'infinite', 'number', 'of', 'communicated', 'bits', 'in', 'contrast', 'with', 'an', 'infinite', 'number', 'of', 'allowed', 'communication', 'rounds', 'the', 'nearest', 'lattice', 'point', 'can', 'be', 'determined', 'without', 'error', 'with', 'a', 'finite', 'average', 'number', 'of', 'communicated', 'bits', 'and', 'a', 'finite', 'average', 'number', 'of', 'rounds', 'of', 'communication', 'in', 'two', 'dimensions', 'the', 'hexagonal', 'lattice', 'which', 'is', 'most', 'efficient', 'for', 'communication', 'and', 'compression', 'is', 'found', 'to', 'be', 'the', 'most', 'expensive', 'in', 'terms', 'of', 'communication', 'cost']] | [-0.22362567744584697, 0.11949216361954865, 0.01133420756368926, 0.012107657836256266, -0.015265794805688501, -0.17991057823158124, 0.13897006094145278, 0.3477785888325536, -0.268851250648555, -0.327712312171405, 0.10233497525579437, -0.2767240188394984, -0.11545470512443871, 0.16252254468360633, -0.0909128993862506, 0.0867608714792313, 0.03233028017125572, 0.13787412881625422, -0.01959215862373116, -0.34017177582012886, 0.2413481165725512, 0.04838877419066249, 0.25062294533532675, 0.02010042659486785, 0.06701435929545287, 0.0372592354150997, 0.005936345717672146, 0.01158264195758172, -0.09290682992145638, 0.09771959311399384, 0.2531635581543951, 0.1090711035088382, 0.3019907568341516, -0.44071470050874983, -0.19739712805233217, 0.13547160089241736, 0.17119873907191283, 0.10716515852519395, -0.017156870342847526, -0.2056570356528303, 0.10419990142073596, -0.1383047228114623, -0.07036628455600956, 0.02028067439060771, 0.016508514767117573, 0.02880135831902876, -0.3405048023955191, 0.030853671404166203, -0.013616235209205612, 0.06088935144414956, 0.013963051827511553, -0.10970601399965359, -0.009751645268195054, 0.15925649361628474, 0.021734319814960615, 0.09180533724244345, 0.07791417545116873, -0.11457618747089961, -0.14803917894817212, 0.40062713912039094, -0.02809867931134773, -0.24201736560595843, 0.12560816053159987, -0.07715865208231139, -0.09123668147420341, 0.15187583361949886, 0.18663499761993688, 0.0913912734298995, -0.10664838019786685, 0.09097487221958793, -0.05120859888918472, 0.228371488113683, 0.06155547423457557, 0.0966698228946012, 0.1255174971891172, 0.1545421923369621, 0.14559487263587387, 0.15460955106483942, -0.07251739413336371, -0.13346756366504864, -0.3075894110638535, -0.15932167933576485, -0.30440601101991804, 0.04390704450056408, -0.1349181298841193, -0.1456675616290533, 0.3020534629623095, 0.0922917923650168, 0.2285192406002545, 0.12604479699494373, 0.29765689652977567, 0.11608611166152652, 0.059491771039073216, 0.13916594497859477, 0.16566255071877756, 0.08927577731876889, 0.023012081660668957, -0.2121824616665077, 0.07119300947806827, 0.08475882696185374] |
1,801.10492 | Deep Predictive Models in Interactive Music | Musical performance requires prediction to operate instruments, to perform in
groups and to improvise. In this paper, we investigate how a number of digital
musical instruments (DMIs), including two of our own, have applied predictive
machine learning models that assist users by predicting unknown states of
musical processes. We characterise these predictions as focussed within a
musical instrument, at the level of individual performers, and between members
of an ensemble. These models can connect to existing frameworks for DMI design
and have parallels in the cognitive predictions of human musicians.
We discuss how recent advances in deep learning highlight the role of
prediction in DMIs, by allowing data-driven predictive models with a long
memory of past states. The systems we review are used to motivate musical
use-cases where prediction is a necessary component, and to highlight a number
of challenges for DMI designers seeking to apply deep predictive models in
interactive music systems of the future.
| cs.SD cs.AI cs.HC cs.NE eess.AS | musical performance requires prediction to operate instruments to perform in groups and to improvise in this paper we investigate how a number of digital musical instruments dmis including two of our own have applied predictive machine learning models that assist users by predicting unknown states of musical processes we characterise these predictions as focussed within a musical instrument at the level of individual performers and between members of an ensemble these models can connect to existing frameworks for dmi design and have parallels in the cognitive predictions of human musicians we discuss how recent advances in deep learning highlight the role of prediction in dmis by allowing datadriven predictive models with a long memory of past states the systems we review are used to motivate musical usecases where prediction is a necessary component and to highlight a number of challenges for dmi designers seeking to apply deep predictive models in interactive music systems of the future | [['musical', 'performance', 'requires', 'prediction', 'to', 'operate', 'instruments', 'to', 'perform', 'in', 'groups', 'and', 'to', 'improvise', 'in', 'this', 'paper', 'we', 'investigate', 'how', 'a', 'number', 'of', 'digital', 'musical', 'instruments', 'dmis', 'including', 'two', 'of', 'our', 'own', 'have', 'applied', 'predictive', 'machine', 'learning', 'models', 'that', 'assist', 'users', 'by', 'predicting', 'unknown', 'states', 'of', 'musical', 'processes', 'we', 'characterise', 'these', 'predictions', 'as', 'focussed', 'within', 'a', 'musical', 'instrument', 'at', 'the', 'level', 'of', 'individual', 'performers', 'and', 'between', 'members', 'of', 'an', 'ensemble', 'these', 'models', 'can', 'connect', 'to', 'existing', 'frameworks', 'for', 'dmi', 'design', 'and', 'have', 'parallels', 'in', 'the', 'cognitive', 'predictions', 'of', 'human', 'musicians', 'we', 'discuss', 'how', 'recent', 'advances', 'in', 'deep', 'learning', 'highlight', 'the', 'role', 'of', 'prediction', 'in', 'dmis', 'by', 'allowing', 'datadriven', 'predictive', 'models', 'with', 'a', 'long', 'memory', 'of', 'past', 'states', 'the', 'systems', 'we', 'review', 'are', 'used', 'to', 'motivate', 'musical', 'usecases', 'where', 'prediction', 'is', 'a', 'necessary', 'component', 'and', 'to', 'highlight', 'a', 'number', 'of', 'challenges', 'for', 'dmi', 'designers', 'seeking', 'to', 'apply', 'deep', 'predictive', 'models', 'in', 'interactive', 'music', 'systems', 'of', 'the', 'future']] | [-0.05805228214758711, 0.06571026131720058, -0.08888114446278614, 0.08023117936383455, -0.12044162455743226, -0.14915300762722603, 0.02267375199097352, 0.44003396397695327, -0.23808937253526005, -0.3716739950259813, 0.0608755995739417, -0.27099398203576225, -0.18920023270542374, 0.22180518202292612, -0.12292150817124937, 0.07450867020741452, 0.07224721520040663, 0.029143152973399714, -0.02779368398179754, -0.25527142040888207, 0.2887730109117304, 0.07533904060815425, 0.2899928421546251, 0.005911567349894307, 0.07861162885465325, -0.032376467501028225, -0.06290935747659741, -0.03312641274682485, -0.10554514142061705, 0.19912941934382664, 0.37977702286848514, 0.18810510213892812, 0.345834990312608, -0.46285392044303125, -0.23327889462831455, 0.07630586515491207, 0.13357703211920288, 0.0818596796449035, -0.024756701394485738, -0.29120835691738206, 0.06351138641483163, -0.1825429391897976, -0.06614114415760224, -0.13707515864203182, -0.017318716018986054, 0.034342682392049864, -0.24229695184010033, -0.009623876767597185, 0.036999470654289976, 0.09603570113913754, -0.031603426579982996, -0.1369838787120385, 0.0462075834422229, 0.24646242779607958, 0.07023434744377692, 0.0007506985113230677, 0.12082248258714874, -0.21431661340354297, -0.20194480310265833, 0.35294161720249134, -0.06488057254897192, -0.17400493351324725, 0.21865143422455263, -0.05810584731471653, -0.16533405486888325, 0.01902716360293711, 0.2688342859156621, 0.057673179237052605, -0.14483215890000933, 0.018342071879977502, 0.017287704878701612, 0.18233360517590952, 0.005612242205713231, 0.026907028454260375, 0.27479089197004214, 0.2539080580821834, -0.019243235929678075, 0.10867463597633804, -0.06139366403938486, -0.0840266787309725, -0.208463672369432, -0.1295790131836652, -0.10962682193479477, -0.028527930941587936, -0.04373572752415501, -0.12305960464530075, 0.4231548589648297, 0.2671265737601341, 0.16060469447611234, 0.08129353824262626, 0.2974515099030657, -0.004617855612499018, 0.07663868104394239, 0.036302169758038454, 0.23838819389661345, 0.06189044353922304, 0.13690068902901542, -0.1816530024411921, 0.09408989639502043, -0.012530056064208157] |
1,801.10493 | Hardy-Sobolev inequality with higher dimensional singularity | For $N\geq 4$, we let $\Omega$ to be a smooth bounded domain of
$\mathbb{R}^N$, $\Gamma$ a smooth closed submanifold of $\Omega$ of dimension
$k$ with $1\leq k \leq N-2$ and $h$ a continuous function defined on $\Omega$.
We denote by $\rho_\Gamma\left(\cdot\right):=\dist_g\left(\cdot, \Gamma\right)$
the distance function to $\Gamma$. For $\sigma\in (0,2)$, we study existence of
positive solutions $u \in H^1_0\left(\Omega\right)$ to the nonlinear equation
$$ -\Delta u+h u=\rho_\Gamma^{-\sigma} u^{2^*(\sigma)-1} \qquad \textrm{in }
\Omega, $$ where $2^*(\sigma):=\frac{2(N-\sigma)}{N-2}$ is the critical
Hardy-Sobolev exponent. In particular, we provide existence of solution under
the influence of the local geometry of $\G$ and the potential $h$.
| math.AP | for ngeq 4 we let omega to be a smooth bounded domain of mathbbrn gamma a smooth closed submanifold of omega of dimension k with 1leq k leq n2 and h a continuous function defined on omega we denote by rho_gammaleftcdotrightdist_gleftcdot gammaright the distance function to gamma for sigmain 02 we study existence of positive solutions u in h1_0leftomegaright to the nonlinear equation delta uh urho_gammasigma u2sigma1 qquad textrmin omega where 2sigmafrac2nsigman2 is the critical hardysobolev exponent in particular we provide existence of solution under the influence of the local geometry of g and the potential h | [['for', 'ngeq', '4', 'we', 'let', 'omega', 'to', 'be', 'a', 'smooth', 'bounded', 'domain', 'of', 'mathbbrn', 'gamma', 'a', 'smooth', 'closed', 'submanifold', 'of', 'omega', 'of', 'dimension', 'k', 'with', '1leq', 'k', 'leq', 'n2', 'and', 'h', 'a', 'continuous', 'function', 'defined', 'on', 'omega', 'we', 'denote', 'by', 'rho_gammaleftcdotrightdist_gleftcdot', 'gammaright', 'the', 'distance', 'function', 'to', 'gamma', 'for', 'sigmain', '02', 'we', 'study', 'existence', 'of', 'positive', 'solutions', 'u', 'in', 'h1_0leftomegaright', 'to', 'the', 'nonlinear', 'equation', 'delta', 'uh', 'urho_gammasigma', 'u2sigma1', 'qquad', 'textrmin', 'omega', 'where', '2sigmafrac2nsigman2', 'is', 'the', 'critical', 'hardysobolev', 'exponent', 'in', 'particular', 'we', 'provide', 'existence', 'of', 'solution', 'under', 'the', 'influence', 'of', 'the', 'local', 'geometry', 'of', 'g', 'and', 'the', 'potential', 'h']] | [-0.23323617166961017, 0.10701417296355509, -0.01468285321480716, -0.039228125679073855, -0.07062260582397753, -0.1616318921568682, 0.025020004371586052, 0.337693208909553, -0.30249229200062866, -0.1760324754387788, 0.07343640096192046, -0.34099849922906444, -0.08233714118756799, 0.15656242860511513, -0.03019813495769125, 0.021924593121461246, -0.036852250209726066, 0.11234341784786564, -0.07703356940360011, -0.19083357938443837, 0.373540639269935, -0.1661022907305185, 0.11466336201587894, 0.0904545546933229, 0.07408335014327389, -0.021855513484257717, 0.08397279390255394, 0.004806492411855446, -0.33737869156807987, 0.06678703065921107, 0.22824930628943865, 0.11138773696628683, 0.3029640039186115, -0.32325144165256264, -0.18821658664787916, 0.24389232756853427, 0.15672983773781554, -0.1413529671870334, 0.015264382221452568, -0.3154002371163148, 0.1696957742754856, -0.030204673864595268, -0.21875337888385452, 0.0006525638935905274, 0.1622784593668969, 0.03908509137260768, -0.381414006565414, 0.10946479761142931, 0.09358419159695547, 0.05561519060891284, -0.10546072545896648, -0.16727176320779583, -0.056204944383352995, 0.06015818211649868, -0.03170273766053193, 0.19128983023541007, 0.02759837445742248, -0.09259666192709752, -0.00933853848128701, 0.33798792058824684, -0.14394649285215722, -0.2744071861632857, 0.07977972073865164, -0.24978389527203274, -0.10003739923906876, 0.09228308004853518, 0.1728231300468273, 0.22103885671063123, -0.046400856115328876, 0.28794771264707064, -0.055873897566925734, 0.14311996284548356, 0.11498984740445968, -0.012537428451216092, 0.035887258572746876, 0.11425853797497795, 0.16493609140667578, 0.11803502956805144, -0.042440130069102765, 0.035211801341653845, -0.42148676328361034, -0.13888626489990755, -0.1520905743110115, 0.20455061201937497, -0.14137317045843584, -0.1352526980108055, 0.28730599318520905, 0.020689575689966263, 0.20399253795166378, 0.0719454386929536, 0.13947594526183346, 0.13988157585465713, -0.054007323615698384, 0.10396489860874641, 0.06993298952305771, 0.1697633100076295, 0.028013608099528305, -0.22821706770311878, -0.04703324534626597, 0.1231826480695378] |
1,801.10494 | A New Interweave Cognitive Radio Scheme for Out-band Energy Harvesting
Systems | In this paper, a new interweave cognitive radio (CR) transmission scheme is
analytically presented for energy harvesting (EH)-enabled transmitting nodes.
EH is performed via a dedicated power beacon (PB) base station through wireless
power transfer, which harvests energy to both primary and secondary systems.
The out-band mode-of-operation between PB and the two heterogeneous systems is
considered (i.e., data communication and EH are realized at different frequency
bands). The performance of the new interweave CR system is studied under
independent and not necessarily identically distributed $\kappa-\mu$ shadowed
faded channels. Representative numerical and simulation results corroborate the
effectiveness of the proposed scheme and presented analysis, while some useful
engineering insights are provided.
| cs.IT math.IT | in this paper a new interweave cognitive radio cr transmission scheme is analytically presented for energy harvesting ehenabled transmitting nodes eh is performed via a dedicated power beacon pb base station through wireless power transfer which harvests energy to both primary and secondary systems the outband modeofoperation between pb and the two heterogeneous systems is considered ie data communication and eh are realized at different frequency bands the performance of the new interweave cr system is studied under independent and not necessarily identically distributed kappamu shadowed faded channels representative numerical and simulation results corroborate the effectiveness of the proposed scheme and presented analysis while some useful engineering insights are provided | [['in', 'this', 'paper', 'a', 'new', 'interweave', 'cognitive', 'radio', 'cr', 'transmission', 'scheme', 'is', 'analytically', 'presented', 'for', 'energy', 'harvesting', 'ehenabled', 'transmitting', 'nodes', 'eh', 'is', 'performed', 'via', 'a', 'dedicated', 'power', 'beacon', 'pb', 'base', 'station', 'through', 'wireless', 'power', 'transfer', 'which', 'harvests', 'energy', 'to', 'both', 'primary', 'and', 'secondary', 'systems', 'the', 'outband', 'modeofoperation', 'between', 'pb', 'and', 'the', 'two', 'heterogeneous', 'systems', 'is', 'considered', 'ie', 'data', 'communication', 'and', 'eh', 'are', 'realized', 'at', 'different', 'frequency', 'bands', 'the', 'performance', 'of', 'the', 'new', 'interweave', 'cr', 'system', 'is', 'studied', 'under', 'independent', 'and', 'not', 'necessarily', 'identically', 'distributed', 'kappamu', 'shadowed', 'faded', 'channels', 'representative', 'numerical', 'and', 'simulation', 'results', 'corroborate', 'the', 'effectiveness', 'of', 'the', 'proposed', 'scheme', 'and', 'presented', 'analysis', 'while', 'some', 'useful', 'engineering', 'insights', 'are', 'provided']] | [-0.2540967421747163, 0.04832051049409554, -0.00033834606938815993, -0.0020125163473411027, -0.049686985953343574, -0.278256961076153, 0.0854265479629415, 0.38386092994601356, -0.2634578298503926, -0.2599706762649734, 0.05340776224129346, -0.2619427279045874, -0.15420142734859035, 0.21100727432843194, -0.04742872159513688, 0.03254913642934156, 0.06121352930561802, 0.006823141977977042, 0.015435944841063897, -0.2210168439976085, 0.2828896091898493, 0.16098303902347427, 0.3914121849923779, 0.05155796655656667, 0.05615894695201359, 0.026504116724544297, -0.05287636631518739, -0.05104775080850365, -0.07290643087904387, 0.08841903221263729, 0.3274031324534241, 0.14893957261478585, 0.22398267492412702, -0.4138272046837785, -0.30864540713095884, 0.06939715612252507, 0.16249176896382295, -0.023309523785495362, -0.08367512898771691, -0.2701602354645729, 0.155902871165698, -0.24156022062866922, -0.023653751798828535, 0.03651278012607315, -0.07589796009054835, 0.09914405289086846, -0.3343810561420652, 0.011851862598415634, -0.0073055500691167055, 0.05565978565740339, -0.09858828322500537, -0.13673663771937714, -0.030882354052481027, 0.14793625165101723, 0.014400685954845132, -0.06885697475715685, 0.10650637957540879, -5.6943405470853555e-05, -0.08346395217172733, 0.3775395758518385, 0.033522782374014265, -0.18489370032837357, 0.21361964728273108, -0.04791792785885547, -0.10755059496849911, 0.16722842857856815, 0.23427128591019353, 0.05820798877746277, -0.21984899100749283, 0.04807233387164327, 0.04800653276717239, 0.14273051176126192, 0.03793011829598781, 0.0973133886438034, 0.17775879550614146, 0.1671999394915007, 0.07202668083882934, 0.091980487263095, -0.10933719646963162, -0.10009004489236742, -0.2552313065720261, -0.1111632476928174, -0.25337406487306663, 0.01567384226735224, -0.042935732678657634, -0.01214495287575853, 0.3731667222692113, 0.07183298200834543, 0.11257579924812147, 0.03902191498397995, 0.39787267227101764, 0.12474694325046085, -0.02279972029772989, 0.15663528852933728, 0.21533129070463608, 0.12319787744978185, 0.1843068857117633, -0.20464000561906862, 0.01223996896488985, -0.06447177975857203] |
1,801.10495 | Lifted Filtering via Exchangeable Decomposition | We present a model for exact recursive Bayesian filtering based on lifted
multiset states. Combining multisets with lifting makes it possible to
simultaneously exploit multiple strategies for reducing inference complexity
when compared to list-based grounded state representations. The core idea is to
borrow the concept of Maximally Parallel Multiset Rewriting Systems and to
enhance it by concepts from Rao-Blackwellization and Lifted Inference, giving a
representation of state distributions that enables efficient inference. In
worlds where the random variables that define the system state are exchangeable
-- where the identity of entities does not matter -- it automatically uses a
representation that abstracts from ordering (achieving an exponential reduction
in complexity) -- and it automatically adapts when observations or system
dynamics destroy exchangeability by breaking symmetry.
| cs.AI | we present a model for exact recursive bayesian filtering based on lifted multiset states combining multisets with lifting makes it possible to simultaneously exploit multiple strategies for reducing inference complexity when compared to listbased grounded state representations the core idea is to borrow the concept of maximally parallel multiset rewriting systems and to enhance it by concepts from raoblackwellization and lifted inference giving a representation of state distributions that enables efficient inference in worlds where the random variables that define the system state are exchangeable where the identity of entities does not matter it automatically uses a representation that abstracts from ordering achieving an exponential reduction in complexity and it automatically adapts when observations or system dynamics destroy exchangeability by breaking symmetry | [['we', 'present', 'a', 'model', 'for', 'exact', 'recursive', 'bayesian', 'filtering', 'based', 'on', 'lifted', 'multiset', 'states', 'combining', 'multisets', 'with', 'lifting', 'makes', 'it', 'possible', 'to', 'simultaneously', 'exploit', 'multiple', 'strategies', 'for', 'reducing', 'inference', 'complexity', 'when', 'compared', 'to', 'listbased', 'grounded', 'state', 'representations', 'the', 'core', 'idea', 'is', 'to', 'borrow', 'the', 'concept', 'of', 'maximally', 'parallel', 'multiset', 'rewriting', 'systems', 'and', 'to', 'enhance', 'it', 'by', 'concepts', 'from', 'raoblackwellization', 'and', 'lifted', 'inference', 'giving', 'a', 'representation', 'of', 'state', 'distributions', 'that', 'enables', 'efficient', 'inference', 'in', 'worlds', 'where', 'the', 'random', 'variables', 'that', 'define', 'the', 'system', 'state', 'are', 'exchangeable', 'where', 'the', 'identity', 'of', 'entities', 'does', 'not', 'matter', 'it', 'automatically', 'uses', 'a', 'representation', 'that', 'abstracts', 'from', 'ordering', 'achieving', 'an', 'exponential', 'reduction', 'in', 'complexity', 'and', 'it', 'automatically', 'adapts', 'when', 'observations', 'or', 'system', 'dynamics', 'destroy', 'exchangeability', 'by', 'breaking', 'symmetry']] | [-0.07785103321991495, 0.1061270365313308, -0.10638721317022307, 0.08964314538180126, -0.15777826632113487, -0.17030974317219902, 0.10208468313675305, 0.3469569981479865, -0.3411379521712661, -0.32579381258578083, 0.08132513061539866, -0.24480016821552616, -0.14307443861139663, 0.09861709849649399, -0.0845148101731463, 0.042652030353296976, 0.0648822976222842, 0.022373598061318768, -0.05662396939740455, -0.22695929124630743, 0.3132445363014875, 0.04644034807493941, 0.3291243955065481, -0.061810168769729674, 0.14977645251106042, 0.07463463566830901, -0.011678511979149991, -0.009100720110792116, -0.04341239677154083, 0.14059917071259764, 0.2947515723387115, 0.23594171926379204, 0.2509589160994825, -0.43209529490273096, -0.17565423034162062, 0.09210216539308856, 0.14759763584044747, 0.13344978215172887, 0.0022319590903772803, -0.31141706389665114, 0.08244307737675358, -0.1782285691592957, -0.03681461292807563, -0.15898647124317977, -0.003430869289078429, -0.030331147452969043, -0.30631403433784965, 0.020856713933381635, 0.11949681559172994, 0.02783642256571377, -0.02630137705976968, -0.11362625330449921, -0.009232983474054785, 0.09475781171645618, -0.0037061781880109892, 0.014763664421539556, 0.10527079081454803, -0.10661524004058638, -0.1635535058191382, 0.3332696609374624, -0.00768161333379809, -0.24636278850919582, 0.19797026944827656, -0.034321702215209846, -0.1709112064916732, 0.13824753387693745, 0.13560664912181922, 0.09556318358823535, -0.13816383336102933, 0.08489850364467053, -0.013713400726985247, 0.20389625376193463, 0.0451795392646836, 0.024748891122547575, 0.19895700932495664, 0.16101633477574367, 0.11055060531982205, 0.16421350567853538, -0.03101140261650635, -0.15299762445778708, -0.2468215466336706, -0.13360810328225345, -0.19399250564203582, -0.003033269981001542, -0.07971048331783691, -0.1875180320234084, 0.353148131585512, 0.2311269843466122, 0.18106586202505792, 0.11680912182735065, 0.2822189268238125, 0.07931890658515155, 0.09017598183756909, 0.10773859440355484, 0.1294832989385258, 0.1261176544692001, 0.04996836093086444, -0.17893476956562124, 0.10638526476705905, 0.07734784601088308] |
1,801.10496 | Parallel Tracking and Verifying | Being intensively studied, visual object tracking has witnessed great
advances in either speed (e.g., with correlation filters) or accuracy (e.g.,
with deep features). Real-time and high accuracy tracking algorithms, however,
remain scarce. In this paper we study the problem from a new perspective and
present a novel parallel tracking and verifying (PTAV) framework, by taking
advantage of the ubiquity of multi-thread techniques and borrowing ideas from
the success of parallel tracking and mapping in visual SLAM. The proposed PTAV
framework is typically composed of two components, a (base) tracker T and a
verifier V, working in parallel on two separate threads. The tracker T aims to
provide a super real-time tracking inference and is expected to perform well
most of the time; by contrast, the verifier V validates the tracking results
and corrects T when needed. The key innovation is that, V does not work on
every frame but only upon the requests from T; on the other end, T may adjust
the tracking according to the feedback from V. With such collaboration, PTAV
enjoys both the high efficiency provided by T and the strong discriminative
power by V. Meanwhile, to adapt V to object appearance changes over time, we
maintain a dynamic target template pool for adaptive verification, resulting in
further performance improvements. In our extensive experiments on popular
benchmarks including OTB2015, TC128, UAV20L and VOT2016, PTAV achieves the best
tracking accuracy among all real-time trackers, and in fact even outperforms
many deep learning based algorithms. Moreover, as a general framework, PTAV is
very flexible with great potentials for future improvement and generalization.
| cs.CV | being intensively studied visual object tracking has witnessed great advances in either speed eg with correlation filters or accuracy eg with deep features realtime and high accuracy tracking algorithms however remain scarce in this paper we study the problem from a new perspective and present a novel parallel tracking and verifying ptav framework by taking advantage of the ubiquity of multithread techniques and borrowing ideas from the success of parallel tracking and mapping in visual slam the proposed ptav framework is typically composed of two components a base tracker t and a verifier v working in parallel on two separate threads the tracker t aims to provide a super realtime tracking inference and is expected to perform well most of the time by contrast the verifier v validates the tracking results and corrects t when needed the key innovation is that v does not work on every frame but only upon the requests from t on the other end t may adjust the tracking according to the feedback from v with such collaboration ptav enjoys both the high efficiency provided by t and the strong discriminative power by v meanwhile to adapt v to object appearance changes over time we maintain a dynamic target template pool for adaptive verification resulting in further performance improvements in our extensive experiments on popular benchmarks including otb2015 tc128 uav20l and vot2016 ptav achieves the best tracking accuracy among all realtime trackers and in fact even outperforms many deep learning based algorithms moreover as a general framework ptav is very flexible with great potentials for future improvement and generalization | [['being', 'intensively', 'studied', 'visual', 'object', 'tracking', 'has', 'witnessed', 'great', 'advances', 'in', 'either', 'speed', 'eg', 'with', 'correlation', 'filters', 'or', 'accuracy', 'eg', 'with', 'deep', 'features', 'realtime', 'and', 'high', 'accuracy', 'tracking', 'algorithms', 'however', 'remain', 'scarce', 'in', 'this', 'paper', 'we', 'study', 'the', 'problem', 'from', 'a', 'new', 'perspective', 'and', 'present', 'a', 'novel', 'parallel', 'tracking', 'and', 'verifying', 'ptav', 'framework', 'by', 'taking', 'advantage', 'of', 'the', 'ubiquity', 'of', 'multithread', 'techniques', 'and', 'borrowing', 'ideas', 'from', 'the', 'success', 'of', 'parallel', 'tracking', 'and', 'mapping', 'in', 'visual', 'slam', 'the', 'proposed', 'ptav', 'framework', 'is', 'typically', 'composed', 'of', 'two', 'components', 'a', 'base', 'tracker', 't', 'and', 'a', 'verifier', 'v', 'working', 'in', 'parallel', 'on', 'two', 'separate', 'threads', 'the', 'tracker', 't', 'aims', 'to', 'provide', 'a', 'super', 'realtime', 'tracking', 'inference', 'and', 'is', 'expected', 'to', 'perform', 'well', 'most', 'of', 'the', 'time', 'by', 'contrast', 'the', 'verifier', 'v', 'validates', 'the', 'tracking', 'results', 'and', 'corrects', 't', 'when', 'needed', 'the', 'key', 'innovation', 'is', 'that', 'v', 'does', 'not', 'work', 'on', 'every', 'frame', 'but', 'only', 'upon', 'the', 'requests', 'from', 't', 'on', 'the', 'other', 'end', 't', 'may', 'adjust', 'the', 'tracking', 'according', 'to', 'the', 'feedback', 'from', 'v', 'with', 'such', 'collaboration', 'ptav', 'enjoys', 'both', 'the', 'high', 'efficiency', 'provided', 'by', 't', 'and', 'the', 'strong', 'discriminative', 'power', 'by', 'v', 'meanwhile', 'to', 'adapt', 'v', 'to', 'object', 'appearance', 'changes', 'over', 'time', 'we', 'maintain', 'a', 'dynamic', 'target', 'template', 'pool', 'for', 'adaptive', 'verification', 'resulting', 'in', 'further', 'performance', 'improvements', 'in', 'our', 'extensive', 'experiments', 'on', 'popular', 'benchmarks', 'including', 'otb2015', 'tc128', 'uav20l', 'and', 'vot2016', 'ptav', 'achieves', 'the', 'best', 'tracking', 'accuracy', 'among', 'all', 'realtime', 'trackers', 'and', 'in', 'fact', 'even', 'outperforms', 'many', 'deep', 'learning', 'based', 'algorithms', 'moreover', 'as', 'a', 'general', 'framework', 'ptav', 'is', 'very', 'flexible', 'with', 'great', 'potentials', 'for', 'future', 'improvement', 'and', 'generalization']] | [-0.07926116840804531, 0.005825083302404506, -0.05452857355627981, -0.013387119813353021, -0.07471727503456571, -0.1959833345203096, 0.03861847346530395, 0.426151176561799, -0.2276803065915098, -0.3560802585491205, 0.09513333440047449, -0.2689741854017925, -0.13504032303392183, 0.21229816515970565, -0.1363477737988543, 0.08843059450487778, 0.12940479588878312, 0.05124823969956858, -0.07072310710932608, -0.2573718106207459, 0.22621122235476365, 0.07127429296462762, 0.31252249332751625, 0.03812321435455515, 0.15411401857890075, 0.03525113036757278, -0.06990625681933263, 0.04112993883981372, -0.04320195331426172, 0.13412294676287606, 0.27325227139270725, 0.1800910886020464, 0.3211558273795879, -0.38180029245257063, -0.20369831794276694, 0.06839269638867611, 0.13661466262276395, 0.04820474914529107, -0.07676880656402897, -0.31918579350255616, 0.10752047734686956, -0.16503340235530314, -0.025110998972333178, -0.11465832233592334, 0.01613919140778087, 0.03226360861440574, -0.27000476064462087, 0.00898113276431986, 0.07694445076063086, 0.05082902281614996, -0.033610449698189215, -0.1081687191525072, 0.036385836728820294, 0.16206767629167493, 0.02252899987841815, 0.08394194232779696, 0.12233815657545523, -0.18669646839032683, -0.14939740396992862, 0.36771048615672486, -0.09059189496276138, -0.16087462475600964, 0.25592625006406294, -0.07927353901322931, -0.1418806566569291, 0.10487575444329361, 0.18922506320946428, 0.13338174416055676, -0.1404306276551572, 0.08600836614002191, -0.006414761971400091, 0.16452363527522804, 0.04800298329880179, 0.018357464988322605, 0.1779139222308555, 0.23631472507435264, 0.07060607577270937, 0.0969681775166078, -0.10938227120222467, -0.07562578800151999, -0.23975385952552175, -0.12027619262031901, -0.1528699029008611, -0.057654304563887614, -0.07056214388616024, -0.09306978310765275, 0.3925945422538048, 0.19676931100415954, 0.2122439906886553, 0.08344731612934, 0.3635431280285543, 0.024838041812252028, 0.09607663847132106, 0.13646846080364688, 0.20748277480500596, 0.035882011732389925, 0.15113260640712475, -0.2016585808658309, 0.09045995115549445, 0.04596972415156691] |
1,801.10497 | Remanufacturing cost analysis under uncertain core quality and return
conditions: extreme and non-extreme scenarios | Uncertainties in core quality condition, return quantity and timing can
propagate and accumulate in process cost and complicate cost assessments.
However, regardless of cost assessment complexities, accurate cost models are
required for successful remanufacturing operation management. In this paper,
joint effects of core quality condition, return quantity, and timing on
remanufacturing cost under normal and extreme return conditions is analyzed. To
conduct this analysis, a novel multivariate stochastic model called Stochastic
Cost of Remanufacturing Model (SCoRM) is developed. In building SCoRM, a Hybrid
Pareto Distribution (HPD), Bernoulli process, and a polynomial cost function
are employed. It is discussed that core return process can be characterized as
a Discrete Time Markov Chain (DTMC). In a case study, SCoRM is applied to
assess remanufacturing costs of steam traps of a chemical complex. Its accuracy
analyzed and variations of SCoRM in predictive tasks assessed by bootstrapping
technique. Through this variation analysis the best and worst cost scenarios
determined. Finally, to generate comparative insights regarding predictive
performance of SCoRM, the model is compared to artificial neural network,
support vector machine, generalized additive model, and random forest
algorithms. Results indicate that SCoRM can be efficiently utilized to analyze
remanufacturing cost. Keywords: Remanufacturing, extreme value theory, hybrid
Pareto distribution, stochastic model.
| stat.AP | uncertainties in core quality condition return quantity and timing can propagate and accumulate in process cost and complicate cost assessments however regardless of cost assessment complexities accurate cost models are required for successful remanufacturing operation management in this paper joint effects of core quality condition return quantity and timing on remanufacturing cost under normal and extreme return conditions is analyzed to conduct this analysis a novel multivariate stochastic model called stochastic cost of remanufacturing model scorm is developed in building scorm a hybrid pareto distribution hpd bernoulli process and a polynomial cost function are employed it is discussed that core return process can be characterized as a discrete time markov chain dtmc in a case study scorm is applied to assess remanufacturing costs of steam traps of a chemical complex its accuracy analyzed and variations of scorm in predictive tasks assessed by bootstrapping technique through this variation analysis the best and worst cost scenarios determined finally to generate comparative insights regarding predictive performance of scorm the model is compared to artificial neural network support vector machine generalized additive model and random forest algorithms results indicate that scorm can be efficiently utilized to analyze remanufacturing cost keywords remanufacturing extreme value theory hybrid pareto distribution stochastic model | [['uncertainties', 'in', 'core', 'quality', 'condition', 'return', 'quantity', 'and', 'timing', 'can', 'propagate', 'and', 'accumulate', 'in', 'process', 'cost', 'and', 'complicate', 'cost', 'assessments', 'however', 'regardless', 'of', 'cost', 'assessment', 'complexities', 'accurate', 'cost', 'models', 'are', 'required', 'for', 'successful', 'remanufacturing', 'operation', 'management', 'in', 'this', 'paper', 'joint', 'effects', 'of', 'core', 'quality', 'condition', 'return', 'quantity', 'and', 'timing', 'on', 'remanufacturing', 'cost', 'under', 'normal', 'and', 'extreme', 'return', 'conditions', 'is', 'analyzed', 'to', 'conduct', 'this', 'analysis', 'a', 'novel', 'multivariate', 'stochastic', 'model', 'called', 'stochastic', 'cost', 'of', 'remanufacturing', 'model', 'scorm', 'is', 'developed', 'in', 'building', 'scorm', 'a', 'hybrid', 'pareto', 'distribution', 'hpd', 'bernoulli', 'process', 'and', 'a', 'polynomial', 'cost', 'function', 'are', 'employed', 'it', 'is', 'discussed', 'that', 'core', 'return', 'process', 'can', 'be', 'characterized', 'as', 'a', 'discrete', 'time', 'markov', 'chain', 'dtmc', 'in', 'a', 'case', 'study', 'scorm', 'is', 'applied', 'to', 'assess', 'remanufacturing', 'costs', 'of', 'steam', 'traps', 'of', 'a', 'chemical', 'complex', 'its', 'accuracy', 'analyzed', 'and', 'variations', 'of', 'scorm', 'in', 'predictive', 'tasks', 'assessed', 'by', 'bootstrapping', 'technique', 'through', 'this', 'variation', 'analysis', 'the', 'best', 'and', 'worst', 'cost', 'scenarios', 'determined', 'finally', 'to', 'generate', 'comparative', 'insights', 'regarding', 'predictive', 'performance', 'of', 'scorm', 'the', 'model', 'is', 'compared', 'to', 'artificial', 'neural', 'network', 'support', 'vector', 'machine', 'generalized', 'additive', 'model', 'and', 'random', 'forest', 'algorithms', 'results', 'indicate', 'that', 'scorm', 'can', 'be', 'efficiently', 'utilized', 'to', 'analyze', 'remanufacturing', 'cost', 'keywords', 'remanufacturing', 'extreme', 'value', 'theory', 'hybrid', 'pareto', 'distribution', 'stochastic', 'model']] | [-0.060933600863578116, 0.04862132902859097, -0.0870190649770382, 0.11570310463102942, -0.06821466984636174, -0.15827879544756399, 0.10706865497206043, 0.40884884885716727, -0.2707361146966677, -0.30749782403567577, 0.13377085323118967, -0.2241424765755854, -0.16403981492195915, 0.17860961042162848, -0.13906827061664223, 0.1328482159160691, 0.10217742937639719, -0.007322542615825447, -0.007721281049648163, -0.26326153224742993, 0.2209888909631068, 0.13225963011599803, 0.3486050205407437, 0.022731878918243527, 0.09085198556322877, -0.01945916900365818, -0.04151975080121036, 0.013799008728777309, -0.07664963138018586, 0.10110351247031514, 0.2765986095701675, 0.20282705883472796, 0.33906107677555664, -0.42852225269122823, -0.23252655628319013, 0.1430814506128294, 0.09206822668046054, 0.011864394013111184, -0.012614465316064747, -0.23130667081398026, 0.06988588925564616, -0.20017781051716244, -0.11432460721173301, -0.10497093306422779, -0.040780262860310515, 0.05021271542021323, -0.3373233990244022, 0.06534489393234252, 0.0070301129743911145, 0.05103246680710737, -0.03695839981991434, -0.1314879059337261, -0.018527328236619147, 0.10874712795655175, 0.02560149259516038, 0.0164387641184986, 0.18433858857237415, -0.11187448742112327, -0.14288133461846084, 0.3610694703941302, -0.058312342900828255, -0.22781524801464956, 0.14376032510772346, -0.059710025180858085, -0.15912275180538615, 0.12783780635402697, 0.26258291530809025, 0.06758605113207566, -0.19972275968686473, 0.04971559474304341, 0.0529893424089362, 0.17560198892975545, 0.04081298536280306, -0.003612252215786678, 0.1536627155762711, 0.2453247375740874, 0.05818541378418847, 0.16135290382975123, -0.05491092681498608, -0.1436731486240538, -0.21910024188095475, -0.14283308517237522, -0.17295274209321998, -0.005692825713422059, -0.10412209518189917, -0.16145233401301795, 0.3642846366390586, 0.17809417420223503, 0.13118908879398256, 0.08672136817945213, 0.3239416338503361, 0.13721191980932818, -0.0035830554802243303, 0.08018398102054872, 0.1507515701925291, 0.05628511698734833, 0.09801265875377306, -0.1993823113294727, 0.16949131810163126, 0.038026592622670094] |
1,801.10498 | Ambiguity in defaultable term structure models | We introduce the concept of no-arbitrage in a credit risk market under
ambiguity considering an intensity-based framework. We assume the default
intensity is not exactly known but lies between an upper and lower bound. By
means of the Girsanov theorem, we start from the reference measure where the
intensity is equal to $1$ and construct the set of equivalent martingale
measures. From this viewpoint, the credit risky case turns out to be similar to
the case of drift uncertainty in the $G$-expectation framework. Finally, we
derive the interval of no-arbitrage prices for general bond prices in a
Markovian setting.
| q-fin.MF | we introduce the concept of noarbitrage in a credit risk market under ambiguity considering an intensitybased framework we assume the default intensity is not exactly known but lies between an upper and lower bound by means of the girsanov theorem we start from the reference measure where the intensity is equal to 1 and construct the set of equivalent martingale measures from this viewpoint the credit risky case turns out to be similar to the case of drift uncertainty in the gexpectation framework finally we derive the interval of noarbitrage prices for general bond prices in a markovian setting | [['we', 'introduce', 'the', 'concept', 'of', 'noarbitrage', 'in', 'a', 'credit', 'risk', 'market', 'under', 'ambiguity', 'considering', 'an', 'intensitybased', 'framework', 'we', 'assume', 'the', 'default', 'intensity', 'is', 'not', 'exactly', 'known', 'but', 'lies', 'between', 'an', 'upper', 'and', 'lower', 'bound', 'by', 'means', 'of', 'the', 'girsanov', 'theorem', 'we', 'start', 'from', 'the', 'reference', 'measure', 'where', 'the', 'intensity', 'is', 'equal', 'to', '1', 'and', 'construct', 'the', 'set', 'of', 'equivalent', 'martingale', 'measures', 'from', 'this', 'viewpoint', 'the', 'credit', 'risky', 'case', 'turns', 'out', 'to', 'be', 'similar', 'to', 'the', 'case', 'of', 'drift', 'uncertainty', 'in', 'the', 'gexpectation', 'framework', 'finally', 'we', 'derive', 'the', 'interval', 'of', 'noarbitrage', 'prices', 'for', 'general', 'bond', 'prices', 'in', 'a', 'markovian', 'setting']] | [-0.05957160694577562, 0.04789471101619049, -0.10103059760906329, 0.16054167854011697, -0.05084444843514851, -0.1263414945552182, 0.13979391170421032, 0.40754125426250576, -0.2965639843534904, -0.2122527532552303, 0.12339828182787944, -0.265664237955905, -0.11089719241165151, 0.17139754254098116, -0.18067763256840408, 0.01884478467958744, -0.0026606160399475784, 0.04169250125385294, -0.004513683615986145, -0.2186921661545645, 0.3227401911281049, 0.05242710101484048, 0.2839782554091829, 0.05597755978662389, 0.12636297921452558, 0.022888578926071976, -0.03613415999676694, 0.002643197840738176, -0.18614103236809523, 0.13948079998219254, 0.24656245750704348, 0.12654245635400516, 0.3499272857049499, -0.3996281445101656, -0.13235784727477967, 0.16381174327001313, 0.006313949832786815, 0.07168904245793443, 0.07292554315856913, -0.29454387690886064, 0.0008451754246095215, -0.21096592166959638, -0.11875778948653, -0.0284260612162244, 0.010384105865589598, -0.012343913152098956, -0.3324451602553253, 0.08086815677851325, 0.08324365670595205, 0.046602548998451294, -0.07154438346201046, -0.09189116420116125, -0.01060087554335519, 0.10304910209349762, 0.11456234208919634, -0.023747292874061098, 0.125916759003744, -0.06475604009212493, -0.13847353175338922, 0.3739604398589393, -0.10650467752500183, -0.22694136418703229, 0.08501826355356083, -0.16828712650264302, -0.13055696769034245, 0.10100887111632736, 0.12252627384632525, 0.08033682131255517, -0.20812348934887637, 0.08970691254621165, -0.09102096994680287, 0.14525224542071233, 0.10068517308117765, -0.002090552665947024, 0.14718858145102107, 0.12771115081403592, 0.18215075413216697, 0.18684038341943776, -0.059784216716923196, -0.17295910487647612, -0.3377831524444951, -0.14290962111489433, -0.13845057793036855, 0.07764902471278376, -0.12729458095866839, -0.1505918782815864, 0.3359802105614558, 0.19001140444059716, 0.12625289239892454, 0.13265479081357368, 0.23931994870060472, 0.21093423120725097, -0.03454796263755233, 0.08813979302890448, 0.18431011664521213, 0.048674520474359995, 0.06169336126421136, -0.13075460099869154, 0.1519088833592832, 0.07006561639483529] |
1,801.10499 | Holomorphic operator valued functions generated by passive selfadjoint
systems | In this paper we study a class $\mathcal R\mathcal S(\mathfrak M)$ of
operator functions that are holomorphic in the domain $\mathbb
C\setminus\{(-\infty,-1]\cup [1,+\infty)\}$ and whose values are contractive
operators in a Hilbert space $(\mathfrak M)$. The functions in $\mathcal
R\mathcal S(\mathfrak M)$ are Schur functions in the open unit disk $\mathbb D$
and, in addition, Nevanlinna functions in $\mathbb C_+\cup\mathbb C_-$. Such
functions can be realized as transfer functions of minimal passive selfadjoint
discrete-time systems. We give various characterizations for the class
$\mathcal R\mathcal S(\mathfrak M)$ and obtain an explicit form for the inner
functions from the class $\mathcal R\mathcal S(\mathfrak M)$ as well as an
inner dilation for any function from $\mathcal R\mathcal S(\mathfrak M)$. We
also consider various transformations of the class $\mathcal R\mathcal
S(\mathfrak M)$, construct realizations of their images, and find corresponding
fixed points.
| math.FA | in this paper we study a class mathcal rmathcal smathfrak m of operator functions that are holomorphic in the domain mathbb csetminusinfty1cup 1infty and whose values are contractive operators in a hilbert space mathfrak m the functions in mathcal rmathcal smathfrak m are schur functions in the open unit disk mathbb d and in addition nevanlinna functions in mathbb c_cupmathbb c_ such functions can be realized as transfer functions of minimal passive selfadjoint discretetime systems we give various characterizations for the class mathcal rmathcal smathfrak m and obtain an explicit form for the inner functions from the class mathcal rmathcal smathfrak m as well as an inner dilation for any function from mathcal rmathcal smathfrak m we also consider various transformations of the class mathcal rmathcal smathfrak m construct realizations of their images and find corresponding fixed points | [['in', 'this', 'paper', 'we', 'study', 'a', 'class', 'mathcal', 'rmathcal', 'smathfrak', 'm', 'of', 'operator', 'functions', 'that', 'are', 'holomorphic', 'in', 'the', 'domain', 'mathbb', 'csetminusinfty1cup', '1infty', 'and', 'whose', 'values', 'are', 'contractive', 'operators', 'in', 'a', 'hilbert', 'space', 'mathfrak', 'm', 'the', 'functions', 'in', 'mathcal', 'rmathcal', 'smathfrak', 'm', 'are', 'schur', 'functions', 'in', 'the', 'open', 'unit', 'disk', 'mathbb', 'd', 'and', 'in', 'addition', 'nevanlinna', 'functions', 'in', 'mathbb', 'c_cupmathbb', 'c_', 'such', 'functions', 'can', 'be', 'realized', 'as', 'transfer', 'functions', 'of', 'minimal', 'passive', 'selfadjoint', 'discretetime', 'systems', 'we', 'give', 'various', 'characterizations', 'for', 'the', 'class', 'mathcal', 'rmathcal', 'smathfrak', 'm', 'and', 'obtain', 'an', 'explicit', 'form', 'for', 'the', 'inner', 'functions', 'from', 'the', 'class', 'mathcal', 'rmathcal', 'smathfrak', 'm', 'as', 'well', 'as', 'an', 'inner', 'dilation', 'for', 'any', 'function', 'from', 'mathcal', 'rmathcal', 'smathfrak', 'm', 'we', 'also', 'consider', 'various', 'transformations', 'of', 'the', 'class', 'mathcal', 'rmathcal', 'smathfrak', 'm', 'construct', 'realizations', 'of', 'their', 'images', 'and', 'find', 'corresponding', 'fixed', 'points']] | [-0.1744488839604481, 0.09154452494219774, 0.024426654734484413, 0.036055387418240145, -0.04621031093719306, -0.12469402792425278, -0.07227214717525332, 0.37975085106582435, -0.32992815249599516, -0.1384994029204416, 0.11128979580398128, -0.281570067653186, -0.14430497215567706, 0.19405976404703004, -0.1235418830114855, 0.05377250491662434, -0.018439427067813298, 0.058416038005174524, -0.166563159743365, -0.20363312416114188, 0.39546149938969927, -0.09103367550243788, 0.12592650703428424, -0.023505089498083928, 0.07680997204528574, 0.003134424154482344, 0.016543372130185804, -0.09127671442440581, -0.22965339130426882, 0.05844974999233861, 0.3151946049046648, 0.11229808986707426, 0.23415938305997236, -0.35506018607274575, -0.12153958836364943, 0.26899025345782696, 0.15682708931853995, -0.13230683006729713, 0.01838618231961257, -0.27821295386563766, 0.08892983320915579, -0.18874031883280942, -0.12164805712938473, -0.0791323367259739, 0.1459764399273006, 0.023254698638886434, -0.37792079095893044, -0.019589744472528658, 0.08817673780054867, 0.07950357183718178, -0.08209822659709436, -0.16518777994411615, -0.10620718414087177, 0.06964964287437718, -0.1036230512211606, 0.15393861334065578, 0.10975595056558685, -0.01963608880246551, -0.0815075360587798, 0.3458312775131644, -0.08895917111444493, -0.2775500344989054, 0.10265154935940005, -0.22218940108466675, -0.15113478346029297, 0.03592589119216427, 0.11622724566362141, 0.23673778534045115, -0.060769404736621416, 0.30886909069650914, -0.178503130131182, 0.030904173574526794, 0.06798347281223602, 0.10198613820316763, 0.10173683728584472, 0.021930091315880418, 0.07740999820902396, 0.14186683998404453, 0.06895297833184219, 0.021978917490581378, -0.4069243680466624, -0.1914998205679962, -0.12795270304195583, 0.1657818833448212, -0.11964630974098862, -0.18366303786923013, 0.3288650005826425, 0.015616072091849191, 0.2632244062021046, 0.15364028517369127, 0.13784955720663727, 0.10649915159806636, 0.08619938949499663, 0.11247280965257875, 0.05837127878262168, 0.17504177376223892, -0.010615147485890809, -0.15561747760854333, -0.06365504846497275, 0.2058547510738101] |
1,801.105 | Analysis of Coded Selective-Repeat ARQ via Matrix Signal-Flow Graphs | We propose two schemes for selective-repeat ARQ protocols over packet erasure
channels with unreliable feedback: (i) a hybrid ARQ protocol with soft
combining at the receiver, and (ii) a coded ARQ protocol, by building on the
uncoded baseline scheme for ARQ, developed by Ausavapattanakun and Nosratinia.
Our method leverages discrete-time queuing and coding theory to analyze the
performance of the proposed data transmission methods. We incorporate forward
error-correction to reduce in-order delivery delay, and exploit a matrix
signal-flow graph approach to analyze the throughput and delay of the
protocols. We demonstrate and contrast the performance of the coded protocols
with that of the uncoded scheme, illustrating the benefits of coded
transmissions.
| cs.IT cs.NI math.IT | we propose two schemes for selectiverepeat arq protocols over packet erasure channels with unreliable feedback i a hybrid arq protocol with soft combining at the receiver and ii a coded arq protocol by building on the uncoded baseline scheme for arq developed by ausavapattanakun and nosratinia our method leverages discretetime queuing and coding theory to analyze the performance of the proposed data transmission methods we incorporate forward errorcorrection to reduce inorder delivery delay and exploit a matrix signalflow graph approach to analyze the throughput and delay of the protocols we demonstrate and contrast the performance of the coded protocols with that of the uncoded scheme illustrating the benefits of coded transmissions | [['we', 'propose', 'two', 'schemes', 'for', 'selectiverepeat', 'arq', 'protocols', 'over', 'packet', 'erasure', 'channels', 'with', 'unreliable', 'feedback', 'i', 'a', 'hybrid', 'arq', 'protocol', 'with', 'soft', 'combining', 'at', 'the', 'receiver', 'and', 'ii', 'a', 'coded', 'arq', 'protocol', 'by', 'building', 'on', 'the', 'uncoded', 'baseline', 'scheme', 'for', 'arq', 'developed', 'by', 'ausavapattanakun', 'and', 'nosratinia', 'our', 'method', 'leverages', 'discretetime', 'queuing', 'and', 'coding', 'theory', 'to', 'analyze', 'the', 'performance', 'of', 'the', 'proposed', 'data', 'transmission', 'methods', 'we', 'incorporate', 'forward', 'errorcorrection', 'to', 'reduce', 'inorder', 'delivery', 'delay', 'and', 'exploit', 'a', 'matrix', 'signalflow', 'graph', 'approach', 'to', 'analyze', 'the', 'throughput', 'and', 'delay', 'of', 'the', 'protocols', 'we', 'demonstrate', 'and', 'contrast', 'the', 'performance', 'of', 'the', 'coded', 'protocols', 'with', 'that', 'of', 'the', 'uncoded', 'scheme', 'illustrating', 'the', 'benefits', 'of', 'coded', 'transmissions']] | [-0.25726476420479066, -0.036308865824883636, -0.07338528562845155, 0.001080387872504864, 0.0201619873394851, -0.34111686986871065, 0.21470781964652072, 0.45934111254120413, -0.25217229282822123, -0.2385465098361072, 0.08184723361733962, -0.23712638611905276, -0.18550960637565533, 0.14836423185399988, -0.2032181752252985, 0.13517100746658714, 0.07299675273878331, -0.0038140961328860033, -0.07632630105257374, -0.31856801921464717, 0.2736841484438628, 0.12038792051925239, 0.3835951219566844, 0.028347856669940732, 0.12218890170333907, 0.06395453658293594, -0.07914273784580556, -0.059131262090522795, -0.10317409022701957, 0.08340758308556608, 0.31218081218275157, 0.23579850034280256, 0.2559329480610111, -0.42268199202689255, -0.28649505469948056, 0.004488366228443655, 0.1394612341018563, 0.14036959143387237, -0.05718173671365631, -0.2872753553261811, 0.13976102452725173, -0.31228923726488245, 0.057969725580716676, -0.00012907030441882935, -0.1199340908407149, 0.09239859268969171, -0.3490555084627968, -0.02480540986871347, -0.027742042237977414, -0.028382440556941384, -0.012752300310371951, -0.053048023458739574, 0.09000129419463603, 0.13178386663256045, -0.022767752425914462, -0.05334052527535029, 0.08063729737080973, -0.00771355348829688, -0.2183819206770171, 0.3489403280747038, -0.03419198814694523, -0.17704814163629304, 0.09563138253394175, 0.03039479812353172, -0.08191158447668634, 0.1515057068233463, 0.25006046732887627, 0.05088042599487711, -0.14611207502470774, -0.017254097216804935, 0.055983075419102205, 0.22857856440611862, 0.1035848735239018, 0.18242914849807593, 0.0373631706842306, 0.2232155813412233, 0.09480756606948985, 0.12759959314611147, -0.12676610153126108, -0.1405736276483036, -0.2189299061809751, -0.12604463949630207, -0.1522338507442989, -0.03347585790113292, -0.1260347244406479, -0.06182559014255689, 0.35341006528225, 0.1805581540546634, 0.08292928273704919, 0.199760846613737, 0.4780409557914192, 0.06282690504925664, 0.06371600958730349, 0.18757403582673182, 0.15119715084279464, 0.10819230417043647, 0.14706139168172905, -0.2710973083464937, 0.08193019557193938, 0.05923342406749725] |
1,801.10501 | $\eta_c$ production in photon - induced interactions at the LHC | In this paper we investigate the $\eta_c$ production by photon - photon and
photon - hadron interactions in $pp$ and $pA$ collisions at the LHC energies.
The inclusive and diffractive contributions for the $\eta_c$ photoproduction
are estimated using the nonrelativistic quantum chromodynamics (NRQCD)
formalism. We estimate the rapidity and transverse momentum distributions for
the $\eta_c$ photoproduction in hadronic collisions at the LHC and present our
estimate for the total cross sections at the Run 2 energies. A comparison with
the predictions for the exclusive $\eta_c$ photoproduction, which is a direct
probe of the Odderon, also is presented.
| hep-ph hep-ex | in this paper we investigate the eta_c production by photon photon and photon hadron interactions in pp and pa collisions at the lhc energies the inclusive and diffractive contributions for the eta_c photoproduction are estimated using the nonrelativistic quantum chromodynamics nrqcd formalism we estimate the rapidity and transverse momentum distributions for the eta_c photoproduction in hadronic collisions at the lhc and present our estimate for the total cross sections at the run 2 energies a comparison with the predictions for the exclusive eta_c photoproduction which is a direct probe of the odderon also is presented | [['in', 'this', 'paper', 'we', 'investigate', 'the', 'eta_c', 'production', 'by', 'photon', 'photon', 'and', 'photon', 'hadron', 'interactions', 'in', 'pp', 'and', 'pa', 'collisions', 'at', 'the', 'lhc', 'energies', 'the', 'inclusive', 'and', 'diffractive', 'contributions', 'for', 'the', 'eta_c', 'photoproduction', 'are', 'estimated', 'using', 'the', 'nonrelativistic', 'quantum', 'chromodynamics', 'nrqcd', 'formalism', 'we', 'estimate', 'the', 'rapidity', 'and', 'transverse', 'momentum', 'distributions', 'for', 'the', 'eta_c', 'photoproduction', 'in', 'hadronic', 'collisions', 'at', 'the', 'lhc', 'and', 'present', 'our', 'estimate', 'for', 'the', 'total', 'cross', 'sections', 'at', 'the', 'run', '2', 'energies', 'a', 'comparison', 'with', 'the', 'predictions', 'for', 'the', 'exclusive', 'eta_c', 'photoproduction', 'which', 'is', 'a', 'direct', 'probe', 'of', 'the', 'odderon', 'also', 'is', 'presented']] | [0.003414025059656093, 0.2598443101748432, -0.16457245645272595, 0.1767857134011329, 0.029169170176120182, -0.0614058065571283, -0.002144253463484347, 0.33579758355443023, -0.1450701279467658, -0.19500903220553148, -0.12928001662887828, -0.4172475744430956, 0.10533331372946697, 0.11260225332685207, 0.1598799633156312, 0.17008039898876298, 0.14034681001580077, -0.0012260848460228819, 0.0007677703213534857, -0.1753827473932975, 0.3352768792917854, 0.06202429623563627, 0.20062522038229202, 0.25616568193623895, 0.057035085071172366, 0.13948265868300375, -0.05521820437248894, -0.08849293294019606, -0.16032728945934457, 0.09406178138329108, 0.3273745728583124, -0.0029162418489393437, 0.09448420375487522, -0.31068879158089036, -0.04828324949270801, 0.11989061550090188, 0.13922756587302215, 0.12028170821477512, -0.03356952146676026, -0.2887482871595574, 0.11806011265266295, -0.2789513236205829, -0.09407569004810955, -0.05500753509174836, 0.02351126014745157, -0.05410662364018591, -0.3447680904873108, 0.06883155465352742, -0.11493139568912356, 0.029916968355935655, 0.007008988893051681, -0.19670661158467595, -0.020963857354792326, -0.01597156697933219, 0.07108185988311705, 0.11540920382463618, 0.1908814496850889, -0.20660475594003833, -0.26122030979512556, 0.39185457017860914, 0.023296978873641867, -0.15202517276139635, 0.12301829845497483, -0.23790217877708766, -0.15463805068039188, 0.16430416255209007, 0.27876291079936844, 0.07381065987375271, -0.20268351268023252, 0.09332826470061646, 0.024466876391517487, 0.16266908088551932, 0.1100622998893653, 0.09204346897987355, 0.1204749039227241, 0.21913773680203838, -0.09249371447061237, 0.04324294914442458, -0.1624353876043307, -0.0659867671808522, -0.5128351227772471, -0.1466246226309618, -0.08814861273491069, 0.07241023067311433, -0.055571047729034415, -0.014403242333547065, 0.33665766675809494, 0.07988404024539417, 0.3242630654161698, 0.04801336852466001, 0.38265288610403475, 0.14841639780022792, -0.007076636584181535, 0.12576877754671792, 0.37812060500053984, 0.21377482792901759, 0.21701983618304918, -0.26467101723936043, 0.028631513913799273, 0.03477933209781584] |
1,801.10502 | Learning from Informants: Relations between Learning Success Criteria | Learning from positive and negative information, so-called \emph{informants},
being one of the models for human and machine learning introduced by
E.~M.~Gold, is investigated. Particularly, naturally arising questions about
this learning setting, originating in results on learning from solely positive
information, are answered. By a carefully arranged argument learners can be
assumed to only change their hypothesis in case it is inconsistent with the
data (such a learning behavior is called \emph{conservative}). The deduced main
theorem states the relations between the most important delayable learning
success criteria, being the ones not ruined by a delayed in time hypothesis
output. Additionally, our investigations concerning the non-delayable
requirement of consistent learning underpin the claim for \emph{delayability}
being the right structural property to gain a deeper understanding concerning
the nature of learning success criteria. Moreover, we obtain an anomalous
\emph{hierarchy} when allowing for an increasing finite number of
\emph{anomalies} of the hypothesized language by the learner compared with the
language to be learned. In contrast to the vacillatory hierarchy for learning
from solely positive information, we observe a \emph{duality} depending on
whether infinitely many \emph{vacillations} between different (almost) correct
hypotheses are still considered a successful learning behavior.
| cs.FL cs.LG | learning from positive and negative information socalled emphinformants being one of the models for human and machine learning introduced by emgold is investigated particularly naturally arising questions about this learning setting originating in results on learning from solely positive information are answered by a carefully arranged argument learners can be assumed to only change their hypothesis in case it is inconsistent with the data such a learning behavior is called emphconservative the deduced main theorem states the relations between the most important delayable learning success criteria being the ones not ruined by a delayed in time hypothesis output additionally our investigations concerning the nondelayable requirement of consistent learning underpin the claim for emphdelayability being the right structural property to gain a deeper understanding concerning the nature of learning success criteria moreover we obtain an anomalous emphhierarchy when allowing for an increasing finite number of emphanomalies of the hypothesized language by the learner compared with the language to be learned in contrast to the vacillatory hierarchy for learning from solely positive information we observe a emphduality depending on whether infinitely many emphvacillations between different almost correct hypotheses are still considered a successful learning behavior | [['learning', 'from', 'positive', 'and', 'negative', 'information', 'socalled', 'emphinformants', 'being', 'one', 'of', 'the', 'models', 'for', 'human', 'and', 'machine', 'learning', 'introduced', 'by', 'emgold', 'is', 'investigated', 'particularly', 'naturally', 'arising', 'questions', 'about', 'this', 'learning', 'setting', 'originating', 'in', 'results', 'on', 'learning', 'from', 'solely', 'positive', 'information', 'are', 'answered', 'by', 'a', 'carefully', 'arranged', 'argument', 'learners', 'can', 'be', 'assumed', 'to', 'only', 'change', 'their', 'hypothesis', 'in', 'case', 'it', 'is', 'inconsistent', 'with', 'the', 'data', 'such', 'a', 'learning', 'behavior', 'is', 'called', 'emphconservative', 'the', 'deduced', 'main', 'theorem', 'states', 'the', 'relations', 'between', 'the', 'most', 'important', 'delayable', 'learning', 'success', 'criteria', 'being', 'the', 'ones', 'not', 'ruined', 'by', 'a', 'delayed', 'in', 'time', 'hypothesis', 'output', 'additionally', 'our', 'investigations', 'concerning', 'the', 'nondelayable', 'requirement', 'of', 'consistent', 'learning', 'underpin', 'the', 'claim', 'for', 'emphdelayability', 'being', 'the', 'right', 'structural', 'property', 'to', 'gain', 'a', 'deeper', 'understanding', 'concerning', 'the', 'nature', 'of', 'learning', 'success', 'criteria', 'moreover', 'we', 'obtain', 'an', 'anomalous', 'emphhierarchy', 'when', 'allowing', 'for', 'an', 'increasing', 'finite', 'number', 'of', 'emphanomalies', 'of', 'the', 'hypothesized', 'language', 'by', 'the', 'learner', 'compared', 'with', 'the', 'language', 'to', 'be', 'learned', 'in', 'contrast', 'to', 'the', 'vacillatory', 'hierarchy', 'for', 'learning', 'from', 'solely', 'positive', 'information', 'we', 'observe', 'a', 'emphduality', 'depending', 'on', 'whether', 'infinitely', 'many', 'emphvacillations', 'between', 'different', 'almost', 'correct', 'hypotheses', 'are', 'still', 'considered', 'a', 'successful', 'learning', 'behavior']] | [-0.04407622121557917, 0.10172990849573778, -0.08934534537484465, 0.1172439636493041, -0.11369366092106287, -0.18624352583276998, 0.05319074596374539, 0.3631723390489756, -0.2840163907796681, -0.32576798194128537, 0.10295833329133608, -0.2696159024515351, -0.15387881284139282, 0.21292447826430283, -0.1110514604977494, 0.02982658012479078, 0.05505307110370663, 0.09489002515835201, -0.04847903121463273, -0.2637505560870404, 0.3517098984321701, 0.030771838116419058, 0.30033962663171976, 0.03567590432256744, 0.09804643149824266, -0.004191848750570384, -0.040263238070980624, 0.0037109070108272135, -0.0922476198208207, 0.14814682718657501, 0.305175608687952, 0.18482008917540635, 0.3524174354909163, -0.38570295244647673, -0.20438445653543685, 0.12961250515502837, 0.12257022988215675, 0.09193417476996293, -0.045869912502973384, -0.3166295884761696, 0.09774708786711056, -0.11663798231925086, -0.06264535985056958, -0.07888573388639919, -0.00950449895184568, -0.02478766569148992, -0.2664613820037946, 0.012477344249972426, 0.13802782726302015, 0.07786711531757053, -0.057222439520283726, -0.09764422348740956, 0.018110263089234333, 0.15240099656591116, 0.10637266341022357, 0.019467194788613477, 0.11124585914607767, -0.17015703912740876, -0.14096248244585813, 0.3400532612880773, -0.036109693601484534, -0.1993149575402798, 0.20448849162684105, -0.08903978270308985, -0.14269379920670358, 0.10127936594780414, 0.15507793242779924, 0.08714167383226121, -0.1539895097847994, 0.038848649719907175, -0.04687887898383095, 0.17006353517100922, 0.05782567273949415, 0.01636921462435883, 0.2061240922219282, 0.17232341865841908, 0.018996521005212107, 0.08961164814156844, -0.0010184742288560221, -0.1048467839585931, -0.25643540371675044, -0.1057180340120913, -0.20022170501761138, 0.04514462139306251, -0.07816953290017883, -0.12898188635754987, 0.3353510304738808, 0.1519453689258586, 0.22244041606419437, 0.07722403499824197, 0.26057159368761146, 0.09132834339423267, 0.07847082454665487, 0.07101443330706704, 0.2304231345086642, 0.1109709356982342, 0.10473362622661112, -0.1789232457750072, 0.16297942282171393, 0.021004599388739418] |
1,801.10503 | Electromagnetic transitions of $(b{\bar c})$ bound system | We study electromagnetic transitions: $B_c^*(ns)\to B_c(ns) e^+ e^-$,
$B_c^*(ns)\to B_c(n^{\prime}s) e^+ e^-$ and $B_c(ns)\to B^*_c(n^{\prime}s) e^+
e^-$ in the relativistic independent quark (RIQ) model based on a
flavor-independent potential in the scalar-vector harmonic form. The transition
form factors for energetically possible transitions involving $B_c$ - and
$B_c^*$- mesons in ground as well as orbitally excited states are predicted in
their respective kinematic range. Our predictions on decay width for the
allowed and hindered transitions are found compatible with those of the model
calculations based on Bethe-Salpeter approach. Predictions in this sector would
not only provide more information about members of the $B_c$-family including
mass splitting between vector mesons and corresponding pseudoscalar
counterparts but give hints for experimental determination of unknown masses of
other excited $B_c$ - and ground state of $B_c^*$-meson, which is expected at
LHCb and $Z^0$ factory in near future.
| hep-ph | we study electromagnetic transitions b_cnsto b_cns e e b_cnsto b_cnprimes e e and b_cnsto b_cnprimes e e in the relativistic independent quark riq model based on a flavorindependent potential in the scalarvector harmonic form the transition form factors for energetically possible transitions involving b_c and b_c mesons in ground as well as orbitally excited states are predicted in their respective kinematic range our predictions on decay width for the allowed and hindered transitions are found compatible with those of the model calculations based on bethesalpeter approach predictions in this sector would not only provide more information about members of the b_cfamily including mass splitting between vector mesons and corresponding pseudoscalar counterparts but give hints for experimental determination of unknown masses of other excited b_c and ground state of b_cmeson which is expected at lhcb and z0 factory in near future | [['we', 'study', 'electromagnetic', 'transitions', 'b_cnsto', 'b_cns', 'e', 'e', 'b_cnsto', 'b_cnprimes', 'e', 'e', 'and', 'b_cnsto', 'b_cnprimes', 'e', 'e', 'in', 'the', 'relativistic', 'independent', 'quark', 'riq', 'model', 'based', 'on', 'a', 'flavorindependent', 'potential', 'in', 'the', 'scalarvector', 'harmonic', 'form', 'the', 'transition', 'form', 'factors', 'for', 'energetically', 'possible', 'transitions', 'involving', 'b_c', 'and', 'b_c', 'mesons', 'in', 'ground', 'as', 'well', 'as', 'orbitally', 'excited', 'states', 'are', 'predicted', 'in', 'their', 'respective', 'kinematic', 'range', 'our', 'predictions', 'on', 'decay', 'width', 'for', 'the', 'allowed', 'and', 'hindered', 'transitions', 'are', 'found', 'compatible', 'with', 'those', 'of', 'the', 'model', 'calculations', 'based', 'on', 'bethesalpeter', 'approach', 'predictions', 'in', 'this', 'sector', 'would', 'not', 'only', 'provide', 'more', 'information', 'about', 'members', 'of', 'the', 'b_cfamily', 'including', 'mass', 'splitting', 'between', 'vector', 'mesons', 'and', 'corresponding', 'pseudoscalar', 'counterparts', 'but', 'give', 'hints', 'for', 'experimental', 'determination', 'of', 'unknown', 'masses', 'of', 'other', 'excited', 'b_c', 'and', 'ground', 'state', 'of', 'b_cmeson', 'which', 'is', 'expected', 'at', 'lhcb', 'and', 'z0', 'factory', 'in', 'near', 'future']] | [-0.10143262992000125, 0.2252246814476915, -0.036584349525476095, 0.11465385153218556, -0.05005822720362202, -0.14543475801988012, 0.09962333723310354, 0.35540573775549145, -0.15322056357998756, -0.2732427074909484, -0.01215554280754398, -0.33135215090998615, -0.016450038378346053, 0.1607053893025937, 0.12321203603299663, 0.07725762748433386, 0.07490270383192076, 0.06321074264932951, -0.052811359737140316, -0.14245047964162522, 0.284607825711753, 0.0002433029140400536, 0.19820097375058515, 0.09211941167150679, -0.02533979952396989, -0.00372953261659645, -0.008304537773844512, -0.06866458153030287, -0.15318078059435186, 0.06867578744619524, 0.22777087295296095, 0.08463104795838958, 0.1469283992465695, -0.36549287854680135, -0.11072994551539202, 0.12600370365544222, 0.15915558643310385, 0.08007628977322705, -0.01101623509930505, -0.37111640170983534, 0.06863143205640988, -0.16775124383104198, -0.11836175017250593, -0.13666690341607832, 0.07421025500619127, -0.04367917252410039, -0.30839581275701194, 0.09563907799105544, -0.04449509248661343, 0.027025214565422655, -0.10465271842686515, -0.24702708058483788, -0.06702603326822795, 0.03266321447924437, 0.07061951731071424, 0.08772662206063293, 0.14081778347163515, -0.15703837217263164, -0.15511931290315903, 0.42506256694083705, -0.07159695013337221, -0.14739843033599112, 0.16475114805678673, -0.19049333306782715, -0.10965406981652931, 0.13449541902553072, 0.20235034609418912, 0.08241564424722181, -0.13697819598019123, 0.07330259691105526, 0.0031556835760163855, 0.11198126237757285, 0.054738655669258576, 0.10364705647396691, 0.22544550136252142, 0.14150590159902898, -0.0221344671171049, 0.038537987539123554, -0.046370961859151176, -0.08499497502591968, -0.35226455028511255, -0.11498255826026092, -0.11337908787733314, 0.08458774407432322, 0.004758323717289707, -0.09651885071070865, 0.37483446619487093, 0.06912759518662129, 0.2466925450717099, 0.0017864983126534807, 0.24050003349753646, 0.08821356600845534, 0.024363798971000293, 0.08773533002343303, 0.33710665070890067, 0.1977303162087029, 0.08182958756943289, -0.24588000337141291, 0.04339680326280787, 0.014990962867159396] |
1,801.10504 | On Optimal Scheduling for Joint Spatial Division and Multiplexing
Approach in FDD Massive MIMO | Massive MIMO is widely considered as a key enabler of the next generation 5G
networks. With a large number of antennas at the Base Station, both spectral
and energy efficiencies can be enhanced. Unfortunately, the downlink channel
estimation overhead scales linearly with the number of antennas. This burden is
easily mitigated in TDD systems by the use of the channel reciprocity property.
However, this is unfeasible for FDD systems and the method of two-stage
beamforming was therefore developed to reduce the amount of channel state
information feedback. The performance of this scheme being highly dependent on
the users grouping and scheduling mechanims, we introduce in this paper a new
similarity measure coupled with a novel clustering procedure to achieve the
appropriate users grouping. We also proceed to formulate the optimal users
scheduling policy in JSDM and prove that it is NP-hard. This result is of
paramount importance since it suggests that, unless P=NP, there are no
polynomial time algorithms that solve the general scheduling problem to global
optimality and the use of sub-optimal scheduling strategies is more realistic
in practice. We therefore use graph theory to develop a sub-optimal users
scheduling scheme that runs in polynomial time and outperforms the scheduling
schemes previously introduced in the literature for JSDM in both sum-rate and
throughput fairness.
| cs.IT math.IT | massive mimo is widely considered as a key enabler of the next generation 5g networks with a large number of antennas at the base station both spectral and energy efficiencies can be enhanced unfortunately the downlink channel estimation overhead scales linearly with the number of antennas this burden is easily mitigated in tdd systems by the use of the channel reciprocity property however this is unfeasible for fdd systems and the method of twostage beamforming was therefore developed to reduce the amount of channel state information feedback the performance of this scheme being highly dependent on the users grouping and scheduling mechanims we introduce in this paper a new similarity measure coupled with a novel clustering procedure to achieve the appropriate users grouping we also proceed to formulate the optimal users scheduling policy in jsdm and prove that it is nphard this result is of paramount importance since it suggests that unless pnp there are no polynomial time algorithms that solve the general scheduling problem to global optimality and the use of suboptimal scheduling strategies is more realistic in practice we therefore use graph theory to develop a suboptimal users scheduling scheme that runs in polynomial time and outperforms the scheduling schemes previously introduced in the literature for jsdm in both sumrate and throughput fairness | [['massive', 'mimo', 'is', 'widely', 'considered', 'as', 'a', 'key', 'enabler', 'of', 'the', 'next', 'generation', '5g', 'networks', 'with', 'a', 'large', 'number', 'of', 'antennas', 'at', 'the', 'base', 'station', 'both', 'spectral', 'and', 'energy', 'efficiencies', 'can', 'be', 'enhanced', 'unfortunately', 'the', 'downlink', 'channel', 'estimation', 'overhead', 'scales', 'linearly', 'with', 'the', 'number', 'of', 'antennas', 'this', 'burden', 'is', 'easily', 'mitigated', 'in', 'tdd', 'systems', 'by', 'the', 'use', 'of', 'the', 'channel', 'reciprocity', 'property', 'however', 'this', 'is', 'unfeasible', 'for', 'fdd', 'systems', 'and', 'the', 'method', 'of', 'twostage', 'beamforming', 'was', 'therefore', 'developed', 'to', 'reduce', 'the', 'amount', 'of', 'channel', 'state', 'information', 'feedback', 'the', 'performance', 'of', 'this', 'scheme', 'being', 'highly', 'dependent', 'on', 'the', 'users', 'grouping', 'and', 'scheduling', 'mechanims', 'we', 'introduce', 'in', 'this', 'paper', 'a', 'new', 'similarity', 'measure', 'coupled', 'with', 'a', 'novel', 'clustering', 'procedure', 'to', 'achieve', 'the', 'appropriate', 'users', 'grouping', 'we', 'also', 'proceed', 'to', 'formulate', 'the', 'optimal', 'users', 'scheduling', 'policy', 'in', 'jsdm', 'and', 'prove', 'that', 'it', 'is', 'nphard', 'this', 'result', 'is', 'of', 'paramount', 'importance', 'since', 'it', 'suggests', 'that', 'unless', 'pnp', 'there', 'are', 'no', 'polynomial', 'time', 'algorithms', 'that', 'solve', 'the', 'general', 'scheduling', 'problem', 'to', 'global', 'optimality', 'and', 'the', 'use', 'of', 'suboptimal', 'scheduling', 'strategies', 'is', 'more', 'realistic', 'in', 'practice', 'we', 'therefore', 'use', 'graph', 'theory', 'to', 'develop', 'a', 'suboptimal', 'users', 'scheduling', 'scheme', 'that', 'runs', 'in', 'polynomial', 'time', 'and', 'outperforms', 'the', 'scheduling', 'schemes', 'previously', 'introduced', 'in', 'the', 'literature', 'for', 'jsdm', 'in', 'both', 'sumrate', 'and', 'throughput', 'fairness']] | [-0.21327405965529642, 0.02573462767028358, -0.04924008193923984, 0.05725477723794621, -0.11484910335478395, -0.21576880786654562, 0.10882643694924407, 0.39925254142821526, -0.2702577009363923, -0.2943565664519177, 0.10237974633711802, -0.1846390539520355, -0.18777931396048084, 0.15363876733842285, -0.13943584975028453, 0.06760191318990533, 0.07703962857553433, 0.011119155303120267, -0.013414826701790485, -0.309886509939882, 0.29621525191442044, 0.12528443437524486, 0.3624629218434525, 0.02505984896425764, 0.08185094958171249, 0.008022295255863735, -0.03151896429156105, 0.0005904763682507152, -0.07396948488150333, 0.08429245427305009, 0.3646453239630128, 0.206317898240157, 0.33216943323265674, -0.39552244264632463, -0.21736011124435314, 0.10951952200144703, 0.17913163346563316, 0.07389362608948939, -0.046762014726017126, -0.21602729361959147, 0.14429129241142682, -0.21669817517706474, -0.042796304656279295, -0.02159084042664184, -0.045572590831190696, 0.01383205129543142, -0.35109302185822366, 0.035375840890324174, -0.005385706495753554, -0.006110525146522018, -0.020737326634657938, -0.09606222467616114, 0.05858405461578175, 0.13024476756271364, 0.04351072137116801, -0.005999058810181829, 0.07716149070792896, -0.09663155007089466, -0.13824959055163227, 0.3926991438276546, 0.018135659536346792, -0.2510388708911663, 0.16247806543968943, -0.05418819416487633, -0.154561124484293, 0.15338301536908677, 0.23555806497501772, 0.11787528182748098, -0.17629421072643855, 0.026908138823468066, -0.035820355528402466, 0.1896874359944229, 0.0751693911612207, 0.1006896753576151, 0.10647213264195206, 0.22588650451886447, 0.17910513094474756, 0.12003148402802126, -0.06884749525383678, -0.09564051350448714, -0.19846164687092654, -0.14620556385191374, -0.20777174546708202, -0.015043621351076073, -0.09205667420871133, -0.07820282710586177, 0.34291951958381783, 0.17856291653371828, 0.10107926996857967, 0.1290136598527085, 0.39270006533127366, 0.13034896868833362, 0.08370895751042638, 0.14937135779060598, 0.19795983306911968, 0.08279896660621257, 0.16521253471999148, -0.25080054369971677, 0.06427406526257305, 0.010882529004498624] |
1,801.10505 | Compositional Construction of Infinite Abstractions for Networks of
Stochastic Control Systems | This paper is concerned with a compositional approach for constructing
infinite abstractions of interconnected discrete-time stochastic control
systems. The proposed approach uses the interconnection matrix and joint
dissipativity-type properties of subsystems and their abstractions described by
a new notion of so-called stochastic storage functions. The interconnected
abstraction framework is based on new notions of so-called stochastic
simulation functions, using which one can quantify the distance between
original interconnected stochastic control systems and interconnected
abstractions in the probabilistic setting. In the first part of the paper, we
derive dissipativity-type compositional reasoning for the quantification of the
distance in probability between the interconnection of stochastic control
subsystems and that of their abstractions. Moreover, we focus on a class of
discrete-time nonlinear stochastic control systems with independent noises in
the abstract and concrete subsystems, and propose a computational scheme to
construct abstractions together with their corresponding stochastic storage
functions. In the second part of the paper, we consider specifications
expressed as syntactically co-safe linear temporal logic formulae and show how
a synthesized policy for the abstract system can be refined to a policy for the
original system while providing guarantee on the probability of satisfaction.
We demonstrate the effectiveness of the proposed results by constructing an
abstraction (totally 3 dimensions) of the interconnection of three
discrete-time nonlinear stochastic control subsystems (together 222 dimensions)
in a compositional fashion. We also employ the abstraction as a substitute to
synthesize a controller enforcing a syntactically co-safe linear temporal logic
specification.
| cs.SY | this paper is concerned with a compositional approach for constructing infinite abstractions of interconnected discretetime stochastic control systems the proposed approach uses the interconnection matrix and joint dissipativitytype properties of subsystems and their abstractions described by a new notion of socalled stochastic storage functions the interconnected abstraction framework is based on new notions of socalled stochastic simulation functions using which one can quantify the distance between original interconnected stochastic control systems and interconnected abstractions in the probabilistic setting in the first part of the paper we derive dissipativitytype compositional reasoning for the quantification of the distance in probability between the interconnection of stochastic control subsystems and that of their abstractions moreover we focus on a class of discretetime nonlinear stochastic control systems with independent noises in the abstract and concrete subsystems and propose a computational scheme to construct abstractions together with their corresponding stochastic storage functions in the second part of the paper we consider specifications expressed as syntactically cosafe linear temporal logic formulae and show how a synthesized policy for the abstract system can be refined to a policy for the original system while providing guarantee on the probability of satisfaction we demonstrate the effectiveness of the proposed results by constructing an abstraction totally 3 dimensions of the interconnection of three discretetime nonlinear stochastic control subsystems together 222 dimensions in a compositional fashion we also employ the abstraction as a substitute to synthesize a controller enforcing a syntactically cosafe linear temporal logic specification | [['this', 'paper', 'is', 'concerned', 'with', 'a', 'compositional', 'approach', 'for', 'constructing', 'infinite', 'abstractions', 'of', 'interconnected', 'discretetime', 'stochastic', 'control', 'systems', 'the', 'proposed', 'approach', 'uses', 'the', 'interconnection', 'matrix', 'and', 'joint', 'dissipativitytype', 'properties', 'of', 'subsystems', 'and', 'their', 'abstractions', 'described', 'by', 'a', 'new', 'notion', 'of', 'socalled', 'stochastic', 'storage', 'functions', 'the', 'interconnected', 'abstraction', 'framework', 'is', 'based', 'on', 'new', 'notions', 'of', 'socalled', 'stochastic', 'simulation', 'functions', 'using', 'which', 'one', 'can', 'quantify', 'the', 'distance', 'between', 'original', 'interconnected', 'stochastic', 'control', 'systems', 'and', 'interconnected', 'abstractions', 'in', 'the', 'probabilistic', 'setting', 'in', 'the', 'first', 'part', 'of', 'the', 'paper', 'we', 'derive', 'dissipativitytype', 'compositional', 'reasoning', 'for', 'the', 'quantification', 'of', 'the', 'distance', 'in', 'probability', 'between', 'the', 'interconnection', 'of', 'stochastic', 'control', 'subsystems', 'and', 'that', 'of', 'their', 'abstractions', 'moreover', 'we', 'focus', 'on', 'a', 'class', 'of', 'discretetime', 'nonlinear', 'stochastic', 'control', 'systems', 'with', 'independent', 'noises', 'in', 'the', 'abstract', 'and', 'concrete', 'subsystems', 'and', 'propose', 'a', 'computational', 'scheme', 'to', 'construct', 'abstractions', 'together', 'with', 'their', 'corresponding', 'stochastic', 'storage', 'functions', 'in', 'the', 'second', 'part', 'of', 'the', 'paper', 'we', 'consider', 'specifications', 'expressed', 'as', 'syntactically', 'cosafe', 'linear', 'temporal', 'logic', 'formulae', 'and', 'show', 'how', 'a', 'synthesized', 'policy', 'for', 'the', 'abstract', 'system', 'can', 'be', 'refined', 'to', 'a', 'policy', 'for', 'the', 'original', 'system', 'while', 'providing', 'guarantee', 'on', 'the', 'probability', 'of', 'satisfaction', 'we', 'demonstrate', 'the', 'effectiveness', 'of', 'the', 'proposed', 'results', 'by', 'constructing', 'an', 'abstraction', 'totally', '3', 'dimensions', 'of', 'the', 'interconnection', 'of', 'three', 'discretetime', 'nonlinear', 'stochastic', 'control', 'subsystems', 'together', '222', 'dimensions', 'in', 'a', 'compositional', 'fashion', 'we', 'also', 'employ', 'the', 'abstraction', 'as', 'a', 'substitute', 'to', 'synthesize', 'a', 'controller', 'enforcing', 'a', 'syntactically', 'cosafe', 'linear', 'temporal', 'logic', 'specification']] | [-0.1488090418431847, 0.03175241115464725, -0.0537721346911104, 0.056510870742684224, -0.06436312901424855, -0.14095260851375271, 0.051657533451883654, 0.3417681514277871, -0.3326999459665681, -0.29295137494451323, 0.11102780267466471, -0.200076481474365, -0.17566299798218993, 0.16722581180606466, -0.11610772084162312, 0.11037115619105638, 0.01506342028065386, 0.012018793440026949, -0.0683365666324685, -0.1957168945084616, 0.33668046284535685, 0.014235302655133189, 0.2409606829855055, -0.029684377967792212, 0.1815766653839926, 0.027383437158814708, -0.021579349115796266, 0.05220797619010421, -0.07827174275284886, 0.20316268481146238, 0.3088074041879736, 0.19066560904413235, 0.3393846623194938, -0.45339450910382095, -0.16955827029906673, 0.05825033408425535, 0.08681853892964876, 0.08949934813188251, -0.0014962936063549009, -0.31927205459596436, 0.07288499351411477, -0.21011843654082812, -0.08419636727432858, -0.10172124810184764, -0.028195991652223786, 0.05568356653956933, -0.28699692174578545, -0.002035069974644117, 0.11728146182731955, 0.08374729224473054, -0.07203790627001999, -0.06657016136469777, -0.031894465449426444, 0.10283059584259314, -0.06632751374806994, -0.07555389106769847, 0.11970984688711918, -0.05076972212734037, -0.19636343436584747, 0.3199206644127176, -0.02560834934697372, -0.25339671091909416, 0.1927767521019483, -0.03332785393691576, -0.1721773983864877, 0.07432530854149248, 0.23574455563679383, 0.10324175987911761, -0.22304029019595292, 0.09119857299611184, -0.03325596531723305, 0.20923986694428184, 0.03862605182469257, 0.07284539078598934, 0.1518884201383325, 0.23256075656238073, 0.11381700499074869, 0.20137893221520944, 0.02316640129457915, -0.1629134317722599, -0.2951843469960951, -0.1397535606062223, -0.11650482613639143, -0.027587987164791185, -0.1108959030344358, -0.17311502828980324, 0.3988585573059504, 0.16928126476800498, 0.15910666297785328, 0.17484707629344365, 0.31541215735258626, 0.15908097601438428, 0.02399546922171168, 0.07232803499639096, 0.14963395113710382, 0.14412274749827433, 0.14317641873884762, -0.19994850724195531, 0.13101378962546434, 0.10506435308307714] |
1,801.10506 | Invariant Operators, Orthogonal Bases and Correlators in General Tensor
Models | We study invariant operators in general tensor models. We show that
representation theory provides an efficient framework to count and classify
invariants in tensor models. In continuation and completion of our earlier
work, we present two natural ways of counting invariants, one for arbitrary
rank of the group and another valid for large rank. We construct basis of
invariant operators based on the counting, and compute correlators of their
elements. The basis associated with finite rank diagonalizes two-point
function. It is analogous to the restricted Schur basis used in matrix models.
We show that the constructions get almost identical as we swap the
Littlewood-Richardson numbers in multi-matrix models with Kronecker
coefficients in general tensor models. We explore this parallelism between
matrix model and tensor model in depth from the perspective of representation
theory and comment on several ideas for future investigation.
| hep-th | we study invariant operators in general tensor models we show that representation theory provides an efficient framework to count and classify invariants in tensor models in continuation and completion of our earlier work we present two natural ways of counting invariants one for arbitrary rank of the group and another valid for large rank we construct basis of invariant operators based on the counting and compute correlators of their elements the basis associated with finite rank diagonalizes twopoint function it is analogous to the restricted schur basis used in matrix models we show that the constructions get almost identical as we swap the littlewoodrichardson numbers in multimatrix models with kronecker coefficients in general tensor models we explore this parallelism between matrix model and tensor model in depth from the perspective of representation theory and comment on several ideas for future investigation | [['we', 'study', 'invariant', 'operators', 'in', 'general', 'tensor', 'models', 'we', 'show', 'that', 'representation', 'theory', 'provides', 'an', 'efficient', 'framework', 'to', 'count', 'and', 'classify', 'invariants', 'in', 'tensor', 'models', 'in', 'continuation', 'and', 'completion', 'of', 'our', 'earlier', 'work', 'we', 'present', 'two', 'natural', 'ways', 'of', 'counting', 'invariants', 'one', 'for', 'arbitrary', 'rank', 'of', 'the', 'group', 'and', 'another', 'valid', 'for', 'large', 'rank', 'we', 'construct', 'basis', 'of', 'invariant', 'operators', 'based', 'on', 'the', 'counting', 'and', 'compute', 'correlators', 'of', 'their', 'elements', 'the', 'basis', 'associated', 'with', 'finite', 'rank', 'diagonalizes', 'twopoint', 'function', 'it', 'is', 'analogous', 'to', 'the', 'restricted', 'schur', 'basis', 'used', 'in', 'matrix', 'models', 'we', 'show', 'that', 'the', 'constructions', 'get', 'almost', 'identical', 'as', 'we', 'swap', 'the', 'littlewoodrichardson', 'numbers', 'in', 'multimatrix', 'models', 'with', 'kronecker', 'coefficients', 'in', 'general', 'tensor', 'models', 'we', 'explore', 'this', 'parallelism', 'between', 'matrix', 'model', 'and', 'tensor', 'model', 'in', 'depth', 'from', 'the', 'perspective', 'of', 'representation', 'theory', 'and', 'comment', 'on', 'several', 'ideas', 'for', 'future', 'investigation']] | [-0.09453014277602077, 0.0885757678825159, -0.09858302419661735, 0.0915098635938864, -0.055967027922524205, -0.13102062877452542, -0.00861150536897546, 0.36383721102953803, -0.2751565773191974, -0.242976801387358, 0.08913558735660812, -0.24168851770830493, -0.23588138375206724, 0.15481390528948913, -0.03891894093166429, 0.047837860763390014, 0.039920864078539904, 0.05709576878881623, -0.14414517832292467, -0.24780915056005226, 0.36576106915157947, 0.019923000002002464, 0.2840022364103298, 0.03753096258419678, 0.10034484842937466, 0.046673924219629445, -0.1043253570253439, -0.007660299658458283, -0.12124217076073086, 0.1887674277172761, 0.2608696428179035, 0.15331617231209968, 0.1724661702276967, -0.43176909234599337, -0.15091330360568372, 0.14539722001827354, 0.10642506822230334, 0.11299444250234053, 0.008987315813185159, -0.21712702849932702, 0.0802614709097357, -0.22416553630473765, -0.1348688311888077, -0.16494700396169268, 0.013194373368734745, -0.04202923372533199, -0.28219264658524634, 0.04815771021873604, 0.02946658658378936, 0.05966944398411305, -0.08609239435061178, -0.15426178672350943, 0.04477488265557756, 0.10362291535204078, 0.02201664079548725, -0.010804739187914112, 0.056696638137974, -0.13050948030724857, -0.1539214714232119, 0.352627258908816, -0.09920710548329173, -0.26372080502357886, 0.15593059442389148, -0.1358137737880362, -0.1935978175127707, 0.007169284157666331, 0.17860243877673404, 0.15479056252862644, -0.0753615040279238, 0.13893116263636382, -0.09766138166664763, 0.10443555714615377, 0.05121943572575741, 0.021325237684097168, 0.15778437036408297, 0.07288506911763697, 0.0421788640690188, 0.16143730775938628, 0.03471003783865112, -0.08709962345686154, -0.3232774707812367, -0.16958979585254236, -0.15784780364417544, 0.05799418338904725, -0.1242728282506363, -0.18978106571982303, 0.4401295268842092, 0.17168159238293978, 0.21252044865775668, 0.12935146465501252, 0.26789173819388906, 0.12274548704636858, 0.09281846672025713, 0.05821622215568068, 0.15338139253972322, 0.19491784349050875, 0.007852399147095833, -0.1358490034829803, -0.016739810417333606, 0.19970642050714993] |
1,801.10507 | Non-standard Analysis in Dynamic Geometry | We will present the benefits of using methods of non-standard analysis in
dynamic projective geometry. One major application will be the
desingulariazation of geometric constructions.
| math.AG | we will present the benefits of using methods of nonstandard analysis in dynamic projective geometry one major application will be the desingulariazation of geometric constructions | [['we', 'will', 'present', 'the', 'benefits', 'of', 'using', 'methods', 'of', 'nonstandard', 'analysis', 'in', 'dynamic', 'projective', 'geometry', 'one', 'major', 'application', 'will', 'be', 'the', 'desingulariazation', 'of', 'geometric', 'constructions']] | [-0.12723049086829027, 0.008819658503246805, -0.13419827525891984, 0.05313561577349901, -0.1041903830288599, -0.09302253109247734, -0.02231383688437442, 0.3640073733404279, -0.3010965618304908, -0.257945164727668, 0.17703613521977482, -0.21549134907157472, -0.20712865547587475, 0.2631903941122194, -0.16883477223260948, 0.006672625274707873, 0.08594232839338171, -0.014302323708155503, -0.17660361171389619, -0.27558652808268863, 0.3607472473134597, 0.04985654070818176, 0.22757702905801125, 0.0691695760130339, 0.06524996665151168, 0.0488510518722857, -0.08876168464000027, 0.05970018062119683, -0.16488783591194078, 0.21081062429584563, 0.3095657834298133, 0.21079738003512224, 0.24567665609841546, -0.44038086477667093, -0.17662705279265842, 0.12494416286547978, 0.1491745844250545, 0.14865122040888915, -0.03637826427196463, -0.24720405135303736, 0.06334737467113882, -0.1528030801564455, -0.16472247801721096, -0.12903103387604156, -0.0829001993406564, 0.049712949975704156, -0.15860632884626588, 0.002869461430236697, 0.06386242279162009, 0.09632310488571723, 0.008554464361319939, -0.12974924695057174, 0.04540976524973909, 0.1450881538524603, 0.0035949225227038064, -0.0760131014782625, 0.12859924877799736, -0.058229543423901, -0.20649483155769607, 0.35615717503242195, -0.0690758191825201, -0.19998980849049985, 0.1761460956186056, -0.09234374016523361, -0.20517978235147893, 0.0983171296150734, 0.21839262436454496, 0.10988673179720838, -0.10406047354141872, 0.13506871196053302, -0.016953194688539952, 0.11301623626301686, 0.02145663311239332, 0.021396612903724115, 0.18988626823799373, 0.21637327472368875, 0.0708601587296774, 0.16136513956492612, -0.09936902625486255, -0.09118135956426461, -0.3663462021698554, -0.15895782224833965, -0.09908301724741857, 0.081445415004661, -0.1387766214708487, -0.12073706470740338, 0.4113301318138838, 0.17916939966380596, 0.11543547847152998, -0.049597181214873366, 0.37555319909006357, 0.03195347229484469, 0.05763189261779189, -0.021488487293633323, 0.24607484779941538, 0.12137824126208822, 0.09508980244087677, -0.11625930573791265, 0.016438574763014913, 0.10302306327503175] |
1,801.10508 | Mobile-Network Connected Drones: Field Trials, Simulations, and Design
Insights | Drones are becoming increasingly used in a wide variety of industries and
services and are delivering profound socioeconomic benefits. Technology needs
to be in place to ensure safe operation and management of the growing fleet of
drones. Mobile networks have connected tens of billions of devices on the
ground in the past decades and are now ready to connect the drones flying in
the sky. In this article, we share some of our findings in cellular
connectivity for low altitude drones. We first present and analyze field
measurement data collected during drone flights in a commercial Long-Term
Evolution (LTE) network. We then present simulation results to shed light on
the performance of a network when it is serving many drones simultaneously over
a wide area. The results, analysis, and design insights presented in this
article help enhance the understanding of the applicability and performance of
providing mobile connectivity to low altitude drones.
| cs.NI | drones are becoming increasingly used in a wide variety of industries and services and are delivering profound socioeconomic benefits technology needs to be in place to ensure safe operation and management of the growing fleet of drones mobile networks have connected tens of billions of devices on the ground in the past decades and are now ready to connect the drones flying in the sky in this article we share some of our findings in cellular connectivity for low altitude drones we first present and analyze field measurement data collected during drone flights in a commercial longterm evolution lte network we then present simulation results to shed light on the performance of a network when it is serving many drones simultaneously over a wide area the results analysis and design insights presented in this article help enhance the understanding of the applicability and performance of providing mobile connectivity to low altitude drones | [['drones', 'are', 'becoming', 'increasingly', 'used', 'in', 'a', 'wide', 'variety', 'of', 'industries', 'and', 'services', 'and', 'are', 'delivering', 'profound', 'socioeconomic', 'benefits', 'technology', 'needs', 'to', 'be', 'in', 'place', 'to', 'ensure', 'safe', 'operation', 'and', 'management', 'of', 'the', 'growing', 'fleet', 'of', 'drones', 'mobile', 'networks', 'have', 'connected', 'tens', 'of', 'billions', 'of', 'devices', 'on', 'the', 'ground', 'in', 'the', 'past', 'decades', 'and', 'are', 'now', 'ready', 'to', 'connect', 'the', 'drones', 'flying', 'in', 'the', 'sky', 'in', 'this', 'article', 'we', 'share', 'some', 'of', 'our', 'findings', 'in', 'cellular', 'connectivity', 'for', 'low', 'altitude', 'drones', 'we', 'first', 'present', 'and', 'analyze', 'field', 'measurement', 'data', 'collected', 'during', 'drone', 'flights', 'in', 'a', 'commercial', 'longterm', 'evolution', 'lte', 'network', 'we', 'then', 'present', 'simulation', 'results', 'to', 'shed', 'light', 'on', 'the', 'performance', 'of', 'a', 'network', 'when', 'it', 'is', 'serving', 'many', 'drones', 'simultaneously', 'over', 'a', 'wide', 'area', 'the', 'results', 'analysis', 'and', 'design', 'insights', 'presented', 'in', 'this', 'article', 'help', 'enhance', 'the', 'understanding', 'of', 'the', 'applicability', 'and', 'performance', 'of', 'providing', 'mobile', 'connectivity', 'to', 'low', 'altitude', 'drones']] | [-0.18442408792907372, 0.07697925533284433, -0.025701045233290642, 0.023303006214279633, -0.07753141864362222, -0.128904141583725, 0.05601473837764628, 0.42374818109869683, -0.22981006944993218, -0.3632043970834562, 0.15433111679924064, -0.28813121434435934, -0.16761897130575226, 0.25966750022857205, -0.13705411358540387, 0.06212571878170006, 0.09285325765009284, 0.01337728710955401, 0.032106768235711285, -0.257689820994672, 0.2370906857234475, 0.08172383241349292, 0.3215830350833896, 0.11694193982188344, 0.061149186121551076, -0.015413838947240851, -0.041056628921069205, -0.023297114663843165, -0.08662934541261118, 0.15277085597565593, 0.35100418645398396, 0.19764147222189135, 0.31526099705431415, -0.49452660607762244, -0.2357200111299263, 0.0968924234291894, 0.14836974312110165, 0.023929271362967006, -0.05977699490368219, -0.3100504199958921, 0.11178652639807153, -0.25630773740550994, -0.14627137120135703, -0.06591929327451478, 0.004789286447033335, 0.08539843111104442, -0.214632187688135, -0.0941814798310301, -0.06945246454224137, 0.11907018788195656, -0.06535316793767713, -0.06952538696963242, 0.007480661669672516, 0.24810208194513075, 0.05129169981381366, -0.03279562526241582, 0.15556499557753437, -0.14927896827545115, -0.08038177784520055, 0.39477558138375907, 0.010184601338359675, -0.11817024830165074, 0.2076000088050741, -0.11382031496032141, -0.13095405431292756, 0.10108391419443681, 0.294290462925442, 0.06492299967947857, -0.20051751596331183, 0.010962788791450868, 0.017491682791028564, 0.11491053190547973, 0.047534514048541164, 0.08033786127711401, 0.2295251249804431, 0.2835604369067464, 0.13254908240962418, 0.07065238733852502, -0.11204782494582775, -0.1253461413649156, -0.1864156326475112, -0.16048626185664416, -0.16786214856945567, 0.020167004774281707, -0.06166475541258957, -0.09849977126731047, 0.39919248936808127, 0.2272395871650109, 0.1323443536989783, 0.045559281005377046, 0.3672106880327, 0.02292735393558886, 0.10791268724776608, 0.09599789520526476, 0.2080735770602922, 0.03329945178886287, 0.24025826141051335, -0.1327171324948339, 0.04631630232095057, -0.05112468358741975] |
1,801.10509 | The Heisenberg spin-1/2 XXZ chain in the presence of electric and
magnetic fields | We study the interplay of electric and magnetic order in the one dimensional
Heisenberg spin-1/2 XXZ chain with large Ising anisotropy in the presence of
the Dzyaloshinskii-Moriya (D-M) interaction and with longitudinal and
transverse magnetic fields, interpreting the D-M interaction as a coupling
between the local electric polarization and an external electric field. We
obtain the ground state phase diagram using the density matrix renormalization
group method and compute various ground state quantities like the
magnetization, staggered magnetization, electric polarization and spin
correlation functions, etc. In the presence of both longitudinal and transverse
magnetic fields, there are three different phases corresponding to a gapped
N\'{e}el phase with antiferromagnetic (AF) order, gapped saturated phase and a
critical incommensurate gapless phase. The external electric field modifies the
phase boundaries but does not lead to any new phases. Both external magnetic
fields and electric fields can be used to tune between the phases. We also show
that the transverse magnetic field induces a vector chiral order in the
N\'{e}el phase (even in the absence of an electric field) which can be
interpreted as an electric polarization in a direction parallel to the AF
order.
| cond-mat.str-el | we study the interplay of electric and magnetic order in the one dimensional heisenberg spin12 xxz chain with large ising anisotropy in the presence of the dzyaloshinskiimoriya dm interaction and with longitudinal and transverse magnetic fields interpreting the dm interaction as a coupling between the local electric polarization and an external electric field we obtain the ground state phase diagram using the density matrix renormalization group method and compute various ground state quantities like the magnetization staggered magnetization electric polarization and spin correlation functions etc in the presence of both longitudinal and transverse magnetic fields there are three different phases corresponding to a gapped neel phase with antiferromagnetic af order gapped saturated phase and a critical incommensurate gapless phase the external electric field modifies the phase boundaries but does not lead to any new phases both external magnetic fields and electric fields can be used to tune between the phases we also show that the transverse magnetic field induces a vector chiral order in the neel phase even in the absence of an electric field which can be interpreted as an electric polarization in a direction parallel to the af order | [['we', 'study', 'the', 'interplay', 'of', 'electric', 'and', 'magnetic', 'order', 'in', 'the', 'one', 'dimensional', 'heisenberg', 'spin12', 'xxz', 'chain', 'with', 'large', 'ising', 'anisotropy', 'in', 'the', 'presence', 'of', 'the', 'dzyaloshinskiimoriya', 'dm', 'interaction', 'and', 'with', 'longitudinal', 'and', 'transverse', 'magnetic', 'fields', 'interpreting', 'the', 'dm', 'interaction', 'as', 'a', 'coupling', 'between', 'the', 'local', 'electric', 'polarization', 'and', 'an', 'external', 'electric', 'field', 'we', 'obtain', 'the', 'ground', 'state', 'phase', 'diagram', 'using', 'the', 'density', 'matrix', 'renormalization', 'group', 'method', 'and', 'compute', 'various', 'ground', 'state', 'quantities', 'like', 'the', 'magnetization', 'staggered', 'magnetization', 'electric', 'polarization', 'and', 'spin', 'correlation', 'functions', 'etc', 'in', 'the', 'presence', 'of', 'both', 'longitudinal', 'and', 'transverse', 'magnetic', 'fields', 'there', 'are', 'three', 'different', 'phases', 'corresponding', 'to', 'a', 'gapped', 'neel', 'phase', 'with', 'antiferromagnetic', 'af', 'order', 'gapped', 'saturated', 'phase', 'and', 'a', 'critical', 'incommensurate', 'gapless', 'phase', 'the', 'external', 'electric', 'field', 'modifies', 'the', 'phase', 'boundaries', 'but', 'does', 'not', 'lead', 'to', 'any', 'new', 'phases', 'both', 'external', 'magnetic', 'fields', 'and', 'electric', 'fields', 'can', 'be', 'used', 'to', 'tune', 'between', 'the', 'phases', 'we', 'also', 'show', 'that', 'the', 'transverse', 'magnetic', 'field', 'induces', 'a', 'vector', 'chiral', 'order', 'in', 'the', 'neel', 'phase', 'even', 'in', 'the', 'absence', 'of', 'an', 'electric', 'field', 'which', 'can', 'be', 'interpreted', 'as', 'an', 'electric', 'polarization', 'in', 'a', 'direction', 'parallel', 'to', 'the', 'af', 'order']] | [-0.2624981980124752, 0.2883574722583268, -0.024244298695230673, 0.03555502108400639, -0.08727643289603293, -0.08865746856467184, 0.0016615829791347082, 0.42160239298852326, -0.26130299688272995, -0.31032983786475243, 0.02843563437598382, -0.25281056005956304, -0.08258677933380953, 0.1257926330692013, 0.12351950471586894, -0.03256771092532271, -0.07921091179456075, 0.058009749239417895, -0.1068935523697063, -0.17874011370543566, 0.28751715794400706, -0.06257701395518336, 0.334239085165891, 0.07660309978180531, 0.051149043452033666, 0.06791954591177911, 0.13684256123476393, 0.0819285277530785, -0.07791338218468229, 0.00376199499742952, 0.20934017508653974, -0.10768152241404924, 0.11916133266976055, -0.45732764786606683, -0.17045357535685857, 0.11909994840407402, 0.1394599242494271, 0.1755636819651721, -0.04822195880236933, -0.32695186207880367, 0.009095238780124961, -0.174831248673547, -0.14646632184855962, -0.17089533881547603, -0.046222721883559026, 0.017515329082130535, -0.3179372377298694, 0.10810292696599186, 0.06792195302712199, 0.11722329241243137, -0.12649446916863985, -0.09732107857134954, -0.09557653391667939, 0.11105831411633035, 0.10661228316536182, 0.15961866551420179, 0.13707120734613135, -0.18403007008833352, -0.14425811015772852, 0.31605086674065336, -0.08708831562516792, -0.16095091161288866, 0.14618101648020884, -0.19749805582978297, -0.0576094924984256, 0.13626648747747402, 0.14934052532192574, 0.0558164628693122, -0.10010586288167622, 0.0995493436421765, 0.058940140103204516, 0.17787807990116658, -0.013704186661354222, 0.024382013242438202, 0.2902690377208302, 0.08800049044230845, 0.0742777209845981, 0.1827458651768073, -0.13540720386206323, -0.1036624318227679, -0.26442071835447045, -0.17114162930233784, -0.19244267052790415, 0.039474780601891205, -0.12894129613345837, -0.2083491307978289, 0.43882674917198367, 0.19388483280457572, 0.14670186072431934, -0.10783926519158135, 0.28623618766743475, 0.11113805860568676, 0.037005222880364404, 0.077125152366977, 0.2674936021322199, 0.2425922164157111, 0.15060714293875932, -0.29459689592172184, 0.02053194784642202, 0.02685989420699487] |
1,801.1051 | Probabilistic representation for solutions to nonlinear Fokker-Planck
equations | One obtains a probabilistic representation for the entropic generalized
solutions to a nonlinear Fokker-Planck equation in $\mathbb R^d$ with
multivalued nonlinear diffusion term as density probabilities of solutions to a
nonlinear stochastic differential equation. The case of a nonlinear
Fokker-Planck equation with linear space dependent drift is also studied.
| math.PR | one obtains a probabilistic representation for the entropic generalized solutions to a nonlinear fokkerplanck equation in mathbb rd with multivalued nonlinear diffusion term as density probabilities of solutions to a nonlinear stochastic differential equation the case of a nonlinear fokkerplanck equation with linear space dependent drift is also studied | [['one', 'obtains', 'a', 'probabilistic', 'representation', 'for', 'the', 'entropic', 'generalized', 'solutions', 'to', 'a', 'nonlinear', 'fokkerplanck', 'equation', 'in', 'mathbb', 'rd', 'with', 'multivalued', 'nonlinear', 'diffusion', 'term', 'as', 'density', 'probabilities', 'of', 'solutions', 'to', 'a', 'nonlinear', 'stochastic', 'differential', 'equation', 'the', 'case', 'of', 'a', 'nonlinear', 'fokkerplanck', 'equation', 'with', 'linear', 'space', 'dependent', 'drift', 'is', 'also', 'studied']] | [-0.10778641458410694, 0.03733175118662873, -0.08035450117016325, 0.07498306325608295, -0.18246581321772265, -0.18440856020517496, -0.07931871210434, 0.2336117554532022, -0.3607036478589384, -0.14610854809989735, 0.06733360403568997, -0.32576493789650957, -0.17980440694610683, 0.184645554468948, -0.01472474638448686, 0.16930414949144637, 0.018294695517694463, 0.04367370698220876, -0.09349301712093305, -0.1882462763246529, 0.3293224730224786, -0.03343357880628307, 0.19027062294510555, -0.07238198257982731, 0.26584483762936933, -0.019105249695118745, -0.00030280532771531415, 0.03741632893203986, -0.17644598703755407, 0.08309914053854894, 0.2606019505432674, 0.010867723282806727, 0.34696782897321543, -0.4149563713949554, -0.30343283515195457, 0.09927307863776781, 0.1351452621112207, 0.12418432366483066, -0.04056040117783206, -0.3096157508873742, -0.02607110837398439, -0.14315626203861773, -0.1947734737863802, -0.046251573561861804, 0.08844236113435151, 0.12027152087919567, -0.37470210925200764, 0.18410955536195875, 0.07388047026280238, -0.05880076993180781, -0.1380692926919734, -0.0756716075144252, -0.04542788106720058, -0.059333685178509246, 0.00041423427720307086, 0.030049162959603935, 0.04941504343165731, -0.1451232123891918, -0.1073551386290667, 0.3397639106616986, -0.17635336666301424, -0.41109249356906025, 0.10514081558402703, -0.14153689206862935, -0.10652978721606944, 0.14547019437364095, 0.20266019986296185, 0.14850269744590838, -0.22493505911255368, 0.1632763412495961, -0.019866003096578832, 0.14224177395582807, 0.04042981437654519, -0.00012803133767174215, 0.039592886191545704, 0.18043233604379455, 0.128888134122351, 0.10760803055018187, 0.023506684095731804, -0.22002914379711966, -0.34506678459595663, -0.1416958694403269, -0.1034534174986944, 0.12594994562392942, -0.13903399846725623, -0.2335341045328853, 0.34178881515862836, 0.07097991031347489, 0.13662310195516567, 0.09798910820438546, 0.23445364833828441, 0.34987528072622587, -0.0582164653234792, 0.02924545261799833, 0.1386248976982921, 0.21816291812123084, 0.16692106912330706, -0.26650775491012907, 0.04635290017978726, 0.17500828800019713] |
1,801.10511 | On the physics of electron ejection from laser-irradiated overdense
plasmas | Using 1D and 2D PIC simulations, we describe and model the backward ejection
of electron bunches when a laser pulse reflects off an overdense plasma with a
sharp density gradient on its front side. The dependence on the laser intensity
and gradient scale length is studied. It is found that during each laser period
the incident laser pulse generates a large charge-separation field, or plasma
capacitor, which accelerates an attosecond bunch of electrons towards vacuum.
This process is maximized for short gradient scale lengths and collapses when
the gradient scale length is comparable to the laser wavelength. We develop a
model that reproduces the electron dynamics and the dependence on laser
intensity and gradient scale length. This process is shown to be strongly
linked with high-harmonics generation via the Relativistic Oscillating Mirror
mechanism.
| physics.plasm-ph | using 1d and 2d pic simulations we describe and model the backward ejection of electron bunches when a laser pulse reflects off an overdense plasma with a sharp density gradient on its front side the dependence on the laser intensity and gradient scale length is studied it is found that during each laser period the incident laser pulse generates a large chargeseparation field or plasma capacitor which accelerates an attosecond bunch of electrons towards vacuum this process is maximized for short gradient scale lengths and collapses when the gradient scale length is comparable to the laser wavelength we develop a model that reproduces the electron dynamics and the dependence on laser intensity and gradient scale length this process is shown to be strongly linked with highharmonics generation via the relativistic oscillating mirror mechanism | [['using', '1d', 'and', '2d', 'pic', 'simulations', 'we', 'describe', 'and', 'model', 'the', 'backward', 'ejection', 'of', 'electron', 'bunches', 'when', 'a', 'laser', 'pulse', 'reflects', 'off', 'an', 'overdense', 'plasma', 'with', 'a', 'sharp', 'density', 'gradient', 'on', 'its', 'front', 'side', 'the', 'dependence', 'on', 'the', 'laser', 'intensity', 'and', 'gradient', 'scale', 'length', 'is', 'studied', 'it', 'is', 'found', 'that', 'during', 'each', 'laser', 'period', 'the', 'incident', 'laser', 'pulse', 'generates', 'a', 'large', 'chargeseparation', 'field', 'or', 'plasma', 'capacitor', 'which', 'accelerates', 'an', 'attosecond', 'bunch', 'of', 'electrons', 'towards', 'vacuum', 'this', 'process', 'is', 'maximized', 'for', 'short', 'gradient', 'scale', 'lengths', 'and', 'collapses', 'when', 'the', 'gradient', 'scale', 'length', 'is', 'comparable', 'to', 'the', 'laser', 'wavelength', 'we', 'develop', 'a', 'model', 'that', 'reproduces', 'the', 'electron', 'dynamics', 'and', 'the', 'dependence', 'on', 'laser', 'intensity', 'and', 'gradient', 'scale', 'length', 'this', 'process', 'is', 'shown', 'to', 'be', 'strongly', 'linked', 'with', 'highharmonics', 'generation', 'via', 'the', 'relativistic', 'oscillating', 'mirror', 'mechanism']] | [-0.10990235763094283, 0.25418543567223634, -0.09750124035557185, 0.06797935227926184, -0.012859633202923644, -0.14585163756938918, -0.04676264912394205, 0.4812835064765654, -0.29084211124432857, -0.260774184224945, 0.02393517008706003, -0.2465261946667749, -0.03547000801505843, 0.240333335062741, 0.014065818324169433, 0.012755676995021031, 0.042497077918282354, -0.02356058943586046, 0.0035101586193042366, -0.14100064007789456, 0.2563890869155022, 0.16217324794515184, 0.3081056382034422, 0.060450913776692594, 0.16048504992325166, 0.011165333540647998, 0.04498501124339269, -0.030964507532299013, -0.10433119345450673, 0.03889924811402378, 0.1315055650963511, 0.025007668091334347, 0.2720136425100771, -0.48145090792804285, -0.23914354476601557, -0.000913088791128388, 0.14781528364698915, 0.14786869440406308, -0.09469544216972965, -0.22043872229698905, 0.029823849226271074, -0.10225387942045927, -0.14311715631913813, 0.04018439406956217, 0.03897437173260474, 0.09625701022796557, -0.29342137067228613, 0.03803090662590431, 0.019149095593790588, 0.013271657025259464, -0.024277720226612138, -0.007985741535509775, -0.011551764394555773, 0.01041291845407463, 0.0871603051301169, 0.1413633092507874, 0.23581811230011718, -0.12381356014498979, -0.0389022196965166, 0.3530198794306445, -0.12273549182424531, -0.1167505137566337, 0.13702147097950032, -0.19471895650617385, 0.003113179670688801, 0.2061691445515568, 0.14076560101195246, 0.14086651172544948, -0.07598592499791841, 0.0285795011489365, -0.004177890634829444, 0.269466139894343, 0.15145263453084218, 0.004147223573304096, 0.22413998147598782, 0.20475612652025893, 0.0844950327541175, 0.1477473501975585, -0.15696375355075456, -0.073699364883307, -0.28052217643567945, -0.0814064415591888, -0.1530202747501181, 0.03572332536577618, -0.06643351893351217, -0.16276000513186628, 0.42489510600252034, 0.1463868630545816, 0.16359638552272454, -0.001992502213889887, 0.32223412451243266, 0.19155798753359377, 0.056861039184237815, 0.0775827265211514, 0.2045625747230492, 0.1365927152214852, 0.12063302422866673, -0.29927890407817814, 0.04768083794777723, 0.063210317789738] |
1,801.10512 | Eigenvectors of a matrix under random perturbation | In this text, based on elementary computations, we provide a perturbative
expansion of the coordinates of the eigenvectors of a Hermitian matrix of large
size perturbed by a random matrix with small operator norm whose entries in the
eigenvector basis of the first one are independent, centered, with a variance
profile. This is done through a perturbative expansion of spectral measures
associated to the state defined by a given vector.
| math.PR | in this text based on elementary computations we provide a perturbative expansion of the coordinates of the eigenvectors of a hermitian matrix of large size perturbed by a random matrix with small operator norm whose entries in the eigenvector basis of the first one are independent centered with a variance profile this is done through a perturbative expansion of spectral measures associated to the state defined by a given vector | [['in', 'this', 'text', 'based', 'on', 'elementary', 'computations', 'we', 'provide', 'a', 'perturbative', 'expansion', 'of', 'the', 'coordinates', 'of', 'the', 'eigenvectors', 'of', 'a', 'hermitian', 'matrix', 'of', 'large', 'size', 'perturbed', 'by', 'a', 'random', 'matrix', 'with', 'small', 'operator', 'norm', 'whose', 'entries', 'in', 'the', 'eigenvector', 'basis', 'of', 'the', 'first', 'one', 'are', 'independent', 'centered', 'with', 'a', 'variance', 'profile', 'this', 'is', 'done', 'through', 'a', 'perturbative', 'expansion', 'of', 'spectral', 'measures', 'associated', 'to', 'the', 'state', 'defined', 'by', 'a', 'given', 'vector']] | [-0.1410350063815713, 0.12223816070971745, -0.08490516296296846, 0.0031942882891079147, -0.03794799976583038, -0.06783453695742148, 0.03358873563286449, 0.3308917015790939, -0.2679350873721497, -0.1876444839306974, 0.1441439979210762, -0.2809912899509072, -0.11277117343436527, 0.08942739744005458, -0.008947444361235414, 0.0825697947426566, 0.06689335638324596, 0.11841136805555184, -0.13589690493120413, -0.21252469588071107, 0.36824906032998117, 0.07095208133437804, 0.2036164373691593, -0.008003375516273082, 0.1245824903781925, 0.016863549474094595, -0.07723070119640657, 0.008195741048880986, -0.054208115262112444, 0.18827834531797893, 0.22433135541422025, 0.12442173738704046, 0.29761738484459266, -0.3860248842675771, -0.13392665862504924, 0.10934755705696131, 0.14264332147514713, 0.0640453331538343, -0.022123538198814328, -0.2916210350547252, 0.09074702664677586, -0.1567471093099032, -0.16223578677911843, -0.0628361450707806, 0.02623163319325873, 0.03999236768909863, -0.3147268624710185, 0.10080730957644327, 0.0371640394608091, 0.06644637750993881, -0.00510958578836705, -0.1486097496734666, 0.03665315974503756, 0.0796734568064234, 0.03277761477833597, 0.027681920850383384, 0.09478774867020548, -0.07136201420133667, -0.09597740923719747, 0.36002638579479285, -0.11294828629387277, -0.28218223812457705, 0.053729363733769527, -0.16753299717924425, -0.1012929018520351, 0.1280892614275217, 0.1597419799837683, 0.14151564853132836, -0.1252998690253922, 0.13952713681917106, -0.06181488497448819, 0.16240481963447695, 0.029373381852305362, 0.005744484519319875, 0.1418327989721937, 0.10159814325826509, 0.049952015400465045, 0.1348589046459113, -0.0067138380213041925, -0.10327895587044103, -0.343655069624739, -0.11964469256345182, -0.3078684845407094, 0.09481727760285139, -0.19343411467437233, -0.2772504698485136, 0.46554926655122214, 0.08732493912934193, 0.30539533852466516, 0.03663967163967235, 0.26757695459361586, 0.16507883437776139, 0.07454370656715972, 0.08116303926466831, 0.16853213251036192, 0.19114289146049745, 0.05475658589441861, -0.16792685779343758, 0.03503232427340533, 0.15096305133774876] |
1,801.10513 | The Elfe System - Verifying mathematical proofs of undergraduate
students | Elfe is an interactive system for teaching basic proof methods in discrete
mathematics. The user inputs a mathematical text written in fair English which
is converted to a special data-structure of first-order formulas. Certain proof
obligations implied by this intermediate representation are checked by
automated theorem provers which try to either prove the obligations or find
countermodels if an obligation is wrong. The result of the verification process
is then returned to the user. Elfe is implemented in Haskell and can be
accessed via a reactive web interface or from the command line. Background
libraries for sets, relations and functions have been developed. It has been
tested by students in the beginning of their mathematical studies.
| cs.LO | elfe is an interactive system for teaching basic proof methods in discrete mathematics the user inputs a mathematical text written in fair english which is converted to a special datastructure of firstorder formulas certain proof obligations implied by this intermediate representation are checked by automated theorem provers which try to either prove the obligations or find countermodels if an obligation is wrong the result of the verification process is then returned to the user elfe is implemented in haskell and can be accessed via a reactive web interface or from the command line background libraries for sets relations and functions have been developed it has been tested by students in the beginning of their mathematical studies | [['elfe', 'is', 'an', 'interactive', 'system', 'for', 'teaching', 'basic', 'proof', 'methods', 'in', 'discrete', 'mathematics', 'the', 'user', 'inputs', 'a', 'mathematical', 'text', 'written', 'in', 'fair', 'english', 'which', 'is', 'converted', 'to', 'a', 'special', 'datastructure', 'of', 'firstorder', 'formulas', 'certain', 'proof', 'obligations', 'implied', 'by', 'this', 'intermediate', 'representation', 'are', 'checked', 'by', 'automated', 'theorem', 'provers', 'which', 'try', 'to', 'either', 'prove', 'the', 'obligations', 'or', 'find', 'countermodels', 'if', 'an', 'obligation', 'is', 'wrong', 'the', 'result', 'of', 'the', 'verification', 'process', 'is', 'then', 'returned', 'to', 'the', 'user', 'elfe', 'is', 'implemented', 'in', 'haskell', 'and', 'can', 'be', 'accessed', 'via', 'a', 'reactive', 'web', 'interface', 'or', 'from', 'the', 'command', 'line', 'background', 'libraries', 'for', 'sets', 'relations', 'and', 'functions', 'have', 'been', 'developed', 'it', 'has', 'been', 'tested', 'by', 'students', 'in', 'the', 'beginning', 'of', 'their', 'mathematical', 'studies']] | [-0.059762983334025944, 0.035090343071527155, -0.1491492778255508, 0.12862812094889986, -0.14645174944147082, -0.20598151834665573, 0.07736018864871484, 0.3611064293614492, -0.2812531026610141, -0.30780025596072064, 0.11767223993103534, -0.2486730780681306, -0.06529682671956333, 0.20974877738024525, -0.11219659563621148, 0.04349388979808909, 0.06466869973268456, 0.03646519237623454, -0.003079256937279093, -0.28382742114300874, 0.2772610564515444, 0.010488804842241043, 0.266918848882628, 0.07125088560459172, 0.08888538337537441, 0.009825860505425853, -0.05848027198125833, -0.015025647003845921, -0.07580761405727665, 0.09639257934458297, 0.3678608563937375, 0.24477808237886697, 0.31088546110349224, -0.43240881809194026, -0.10845245372760913, 0.0407135659790646, 0.12452732259206924, 0.11162395678848984, -0.029207691383660483, -0.3360855748138294, 0.10474144769350774, -0.2083268884151917, -0.07359303603880107, -0.0723063915401922, 0.023145009004832084, 0.034436158972374835, -0.2441045320111102, -0.051353527750852036, 0.1085520095878345, 0.14522414615955845, 0.0062600193336477565, -0.10157390044307625, -0.03415204970374832, 0.15681121330547693, 0.04493247671629872, 0.02324320456557024, 0.13562676860902714, -0.0875595968421388, -0.14919518409618016, 0.36899833444602276, -0.01611862630896463, -0.20616555925265984, 0.1827752519928818, -0.03680196891193567, -0.1569407029832103, 0.09252245132992012, 0.14624169671602932, 0.1016139900191398, -0.21425124668066614, 0.11175743800062075, -0.049671046429811495, 0.2210661434159004, 0.10772795744786232, -0.07105043586062525, 0.20164391926915287, 0.1119731030033516, -0.005668128798474911, 0.13591922783786592, 0.07175192160929296, -0.06009932400775142, -0.27054482088163334, -0.17564147412134656, -0.16817383046948414, -0.00871373022753938, -0.02934452549304516, -0.15193965495564044, 0.3220675035444056, 0.12694626547203497, 0.08800705582112202, 0.06737848689000861, 0.31790273887876036, 0.16320787866776487, 0.07325299169490884, 0.06695037210311998, 0.17440990021388078, 0.06704830350795889, 0.16853461951691787, -0.09298818238513094, 0.1600170826262409, 0.12080023090901046] |
1,801.10514 | Non-Fermi surface nesting driven commensurate magnetic ordering in
Fe-doped Sr$_2$RuO$_4$ | Sr$_2$RuO$_4$, an unconventional superconductor, is known to possess an
incommensurate spin density wave instability driven by Fermi surface nesting.
Here we report a static spin density wave ordering with a commensurate
propagation vector $q_c$ = (0.25 0.25 0) in Fe-doped Sr$_2$RuO$_4$, despite the
magnetic fluctuations persisting at the incommensurate wave vectors $q_{ic}$ =
(0.3 0.3 L) as in the parent compound. The latter feature is corroborated by
the first principles calculations, which show that Fe substitution barely
changes the nesting vector of the Fermi surface. These results suggest that in
addition to the known incommensurate magnetic instability, Sr$_2$RuO$_4$ is
also in proximity to a commensurate magnetic tendency that can be stabilized
via Fe doping.
| cond-mat.str-el | sr_2ruo_4 an unconventional superconductor is known to possess an incommensurate spin density wave instability driven by fermi surface nesting here we report a static spin density wave ordering with a commensurate propagation vector q_c 025 025 0 in fedoped sr_2ruo_4 despite the magnetic fluctuations persisting at the incommensurate wave vectors q_ic 03 03 l as in the parent compound the latter feature is corroborated by the first principles calculations which show that fe substitution barely changes the nesting vector of the fermi surface these results suggest that in addition to the known incommensurate magnetic instability sr_2ruo_4 is also in proximity to a commensurate magnetic tendency that can be stabilized via fe doping | [['sr_2ruo_4', 'an', 'unconventional', 'superconductor', 'is', 'known', 'to', 'possess', 'an', 'incommensurate', 'spin', 'density', 'wave', 'instability', 'driven', 'by', 'fermi', 'surface', 'nesting', 'here', 'we', 'report', 'a', 'static', 'spin', 'density', 'wave', 'ordering', 'with', 'a', 'commensurate', 'propagation', 'vector', 'q_c', '025', '025', '0', 'in', 'fedoped', 'sr_2ruo_4', 'despite', 'the', 'magnetic', 'fluctuations', 'persisting', 'at', 'the', 'incommensurate', 'wave', 'vectors', 'q_ic', '03', '03', 'l', 'as', 'in', 'the', 'parent', 'compound', 'the', 'latter', 'feature', 'is', 'corroborated', 'by', 'the', 'first', 'principles', 'calculations', 'which', 'show', 'that', 'fe', 'substitution', 'barely', 'changes', 'the', 'nesting', 'vector', 'of', 'the', 'fermi', 'surface', 'these', 'results', 'suggest', 'that', 'in', 'addition', 'to', 'the', 'known', 'incommensurate', 'magnetic', 'instability', 'sr_2ruo_4', 'is', 'also', 'in', 'proximity', 'to', 'a', 'commensurate', 'magnetic', 'tendency', 'that', 'can', 'be', 'stabilized', 'via', 'fe', 'doping']] | [-0.2483579922668837, 0.28460391460491036, -0.006538352069050611, 0.07800781015864666, -0.08159621952621786, -0.10740553009636314, 0.08867885403309923, 0.3904121194101937, -0.28523883166479636, -0.2510127422341087, -0.025169246897168526, -0.3548805800409199, -0.14213447978820754, 0.09954083061709933, 0.10258052627732223, -0.00225074487729921, -0.08426951524184866, -0.009134358499903936, -0.19272573664469794, -0.1985450503290505, 0.31873467991648763, 0.022198031815859647, 0.3271639451430691, 0.04287404491490609, -0.00043397956435476336, -0.011795697221951978, 0.19054018710278445, 0.04038341621541091, -0.15873702131058373, -0.00828852098027972, 0.2817273932500734, -0.12229671472524134, 0.19256058579881316, -0.42213981407316953, -0.24557145161088556, -0.06968653798396993, 0.17002172547870795, 0.13726867445396376, -0.0810754982553221, -0.31129892921360497, 0.09446761357495226, -0.13737073330930225, -0.17987902784250207, -0.1090675570400587, -0.010272058406593027, -0.005123733412810006, -0.225129649009522, 0.1358946191861718, 0.11351190914865583, 0.10942831450200437, -0.1687393859196622, -0.14514627146140277, -0.13206849975075136, -0.07402118389402423, 0.1107365608840409, 0.19814618084546146, 0.1314983819107953, -0.07782221109782522, -0.11443720647628915, 0.33392534660057976, -0.05907267421014137, -0.08027313999529626, 0.12452014160619394, -0.22626659316970413, -0.07069562440150762, 0.24717068435364142, 0.059179931430162876, 0.008783735214262732, -0.07338688148370197, 0.028936127922287933, -0.029981648175676168, 0.22403436439816612, 0.042405568319163076, 0.06600482176427168, 0.2997841536830943, 0.19336769603054366, 0.044205194361705065, 0.07549700691041679, -0.20234789652330382, -0.0022771594341139535, -0.21656938610380297, -0.13826708446061742, -0.23462114029203182, 0.04751765746049067, -0.06549163074872398, -0.2071173697676476, 0.34268937494840707, 0.18628296570281858, 0.19146496253843243, -0.09829754922182408, 0.19459182155729682, 0.09911972656321653, 0.04604320723966167, 0.07021516363916767, 0.26155714673904684, 0.19494851257626875, 0.09459258920538265, -0.27289099389318006, 0.12134918145550129, 0.007559467943202755] |
1,801.10515 | Systemic-risk-efficient asset allocation: Minimization of systemic risk
as a network optimization problem | Systemic risk arises as a multi-layer network phenomenon. Layers represent
direct financial exposures of various types, including interbank liabilities,
derivative- or foreign exchange exposures. Another network layer of systemic
risk emerges through common asset holdings of financial institutions. Strongly
overlapping portfolios lead to similar exposures that are caused by price
movements of the underlying financial assets. Based on the knowledge of
portfolio holdings of financial agents we quantify systemic risk of overlapping
portfolios. We present an optimization procedure, where we minimize the
systemic risk in a given financial market by optimally rearranging overlapping
portfolio networks, under the constraints that the expected returns and risks
of the individual portfolios are unchanged. We explicitly demonstrate the power
of the method on the overlapping portfolio network of sovereign exposure
between major European banks by using data from the European Banking Authority
stress test of 2016. We show that systemic-risk-efficient allocations are
accessible by the optimization. In the case of sovereign exposure, systemic
risk can be reduced by more than a factor of two, with- out any detrimental
effects for the individual banks. These results are confirmed by a simple
simulation of fire sales in the government bond market. In particular we show
that the contagion probability is reduced dramatically in the optimized
network.
| q-fin.RM | systemic risk arises as a multilayer network phenomenon layers represent direct financial exposures of various types including interbank liabilities derivative or foreign exchange exposures another network layer of systemic risk emerges through common asset holdings of financial institutions strongly overlapping portfolios lead to similar exposures that are caused by price movements of the underlying financial assets based on the knowledge of portfolio holdings of financial agents we quantify systemic risk of overlapping portfolios we present an optimization procedure where we minimize the systemic risk in a given financial market by optimally rearranging overlapping portfolio networks under the constraints that the expected returns and risks of the individual portfolios are unchanged we explicitly demonstrate the power of the method on the overlapping portfolio network of sovereign exposure between major european banks by using data from the european banking authority stress test of 2016 we show that systemicriskefficient allocations are accessible by the optimization in the case of sovereign exposure systemic risk can be reduced by more than a factor of two with out any detrimental effects for the individual banks these results are confirmed by a simple simulation of fire sales in the government bond market in particular we show that the contagion probability is reduced dramatically in the optimized network | [['systemic', 'risk', 'arises', 'as', 'a', 'multilayer', 'network', 'phenomenon', 'layers', 'represent', 'direct', 'financial', 'exposures', 'of', 'various', 'types', 'including', 'interbank', 'liabilities', 'derivative', 'or', 'foreign', 'exchange', 'exposures', 'another', 'network', 'layer', 'of', 'systemic', 'risk', 'emerges', 'through', 'common', 'asset', 'holdings', 'of', 'financial', 'institutions', 'strongly', 'overlapping', 'portfolios', 'lead', 'to', 'similar', 'exposures', 'that', 'are', 'caused', 'by', 'price', 'movements', 'of', 'the', 'underlying', 'financial', 'assets', 'based', 'on', 'the', 'knowledge', 'of', 'portfolio', 'holdings', 'of', 'financial', 'agents', 'we', 'quantify', 'systemic', 'risk', 'of', 'overlapping', 'portfolios', 'we', 'present', 'an', 'optimization', 'procedure', 'where', 'we', 'minimize', 'the', 'systemic', 'risk', 'in', 'a', 'given', 'financial', 'market', 'by', 'optimally', 'rearranging', 'overlapping', 'portfolio', 'networks', 'under', 'the', 'constraints', 'that', 'the', 'expected', 'returns', 'and', 'risks', 'of', 'the', 'individual', 'portfolios', 'are', 'unchanged', 'we', 'explicitly', 'demonstrate', 'the', 'power', 'of', 'the', 'method', 'on', 'the', 'overlapping', 'portfolio', 'network', 'of', 'sovereign', 'exposure', 'between', 'major', 'european', 'banks', 'by', 'using', 'data', 'from', 'the', 'european', 'banking', 'authority', 'stress', 'test', 'of', '2016', 'we', 'show', 'that', 'systemicriskefficient', 'allocations', 'are', 'accessible', 'by', 'the', 'optimization', 'in', 'the', 'case', 'of', 'sovereign', 'exposure', 'systemic', 'risk', 'can', 'be', 'reduced', 'by', 'more', 'than', 'a', 'factor', 'of', 'two', 'with', 'out', 'any', 'detrimental', 'effects', 'for', 'the', 'individual', 'banks', 'these', 'results', 'are', 'confirmed', 'by', 'a', 'simple', 'simulation', 'of', 'fire', 'sales', 'in', 'the', 'government', 'bond', 'market', 'in', 'particular', 'we', 'show', 'that', 'the', 'contagion', 'probability', 'is', 'reduced', 'dramatically', 'in', 'the', 'optimized', 'network']] | [-0.10329044132847695, 0.0298505880203322, -0.07198880852866277, 0.12484339771081547, -0.06438795259471929, -0.09585453137425644, 0.140508955105043, 0.44052316407053665, -0.2836662650589595, -0.2619096071542348, 0.15522678542055598, -0.3214663186608524, -0.15909721880246613, 0.14512764348684137, -0.15668235685337673, -0.00134556665882896, 0.06550559788969074, -0.04795076927107772, 0.08851259745407904, -0.3169714157724682, 0.30298951850161315, 0.0894733872605793, 0.3212350521628794, 0.01625550919603423, 0.09793901083930774, 0.012508598961432924, -0.07365589348920153, 0.04190095373023854, -0.08311024627399867, 0.1892797730804051, 0.33798309530880144, 0.14044281974452677, 0.45098297559972583, -0.4781433208154862, -0.1626091364026961, 0.12348167776936692, -0.008302366462398018, 0.02424143030002945, 0.07830002132554496, -0.3173471225334251, -0.030357558271317392, -0.3072959800277565, -0.08905419242778864, -0.054649073991514564, -0.01696043318966359, 0.04886861802101064, -0.293873716404207, 0.09846819829837415, -0.03031284544464038, 0.06115508356586134, -0.052796848679772405, -0.13181708036569886, -0.10614424880180992, 0.15953370494629884, 0.15690931762483987, -0.1068363448484627, 0.2130079969881285, -0.12305729999541166, -0.1707332572104904, 0.3538949117822011, -0.057930809302318455, -0.11908269284590221, 0.08914485734856228, -0.10912957553193084, -0.12110937530125834, 0.1310015156174409, 0.23695045849531177, -0.013836877686795935, -0.2214039097067735, -0.009353610654929697, -0.03802614990603981, 0.17318526872781298, 0.09808055610444985, -0.023514311377440342, 0.17466469437305027, 0.18666593415014285, 0.16532571560092735, 0.1391196288697591, -0.09607525298518962, -0.1512700409035791, -0.2297767480059959, -0.09169040183212528, -0.12782344862297357, 0.04035057964329229, -0.1866815579004734, -0.1506305550978158, 0.3903761829414436, 0.15556040533671253, 0.10129806279253803, 0.06557356465705916, 0.24402937281021234, 0.0902698533581659, 0.05738229821681192, 0.0683423569604184, 0.20779183332732562, -0.05667551275583332, 0.07850501947238614, -0.16778668982999478, 0.23684164658121978, -0.04293226900746663] |
1,801.10516 | Are `Water Smart Landscapes' Contagious? An epidemic approach on
networks to study peer effects | We test the existence of a neighborhood based peer effect around
participation in an incentive based conservation program called `Water Smart
Landscapes' (WSL) in the city of Las Vegas, Nevada. We use 15 years of
geo-coded daily records of WSL program applications and approvals compiled by
the Southern Nevada Water Authority and Clark County Tax Assessors rolls for
home characteristics. We use this data to test whether a spatially mediated
peer effect can be observed in WSL participation likelihood at the household
level. We show that epidemic spreading models provide more flexibility in
modeling assumptions, and also provide one mechanism for addressing problems
associated with correlated unobservables than hazards models which can also be
applied to address the same questions. We build networks of neighborhood based
peers for 16 randomly selected neighborhoods in Las Vegas and test for the
existence of a peer based influence on WSL participation by using a
Susceptible-Exposed-Infected-Recovered epidemic spreading model (SEIR), in
which a home can become infected via autoinfection or through contagion from
its infected neighbors. We show that this type of epidemic model can be
directly recast to an additive-multiplicative hazard model, but not to purely
multiplicative one. Using both inference and prediction approaches we find
evidence of peer effects in several Las Vegas neighborhoods.
| econ.EM physics.data-an physics.soc-ph stat.AP | we test the existence of a neighborhood based peer effect around participation in an incentive based conservation program called water smart landscapes wsl in the city of las vegas nevada we use 15 years of geocoded daily records of wsl program applications and approvals compiled by the southern nevada water authority and clark county tax assessors rolls for home characteristics we use this data to test whether a spatially mediated peer effect can be observed in wsl participation likelihood at the household level we show that epidemic spreading models provide more flexibility in modeling assumptions and also provide one mechanism for addressing problems associated with correlated unobservables than hazards models which can also be applied to address the same questions we build networks of neighborhood based peers for 16 randomly selected neighborhoods in las vegas and test for the existence of a peer based influence on wsl participation by using a susceptibleexposedinfectedrecovered epidemic spreading model seir in which a home can become infected via autoinfection or through contagion from its infected neighbors we show that this type of epidemic model can be directly recast to an additivemultiplicative hazard model but not to purely multiplicative one using both inference and prediction approaches we find evidence of peer effects in several las vegas neighborhoods | [['we', 'test', 'the', 'existence', 'of', 'a', 'neighborhood', 'based', 'peer', 'effect', 'around', 'participation', 'in', 'an', 'incentive', 'based', 'conservation', 'program', 'called', 'water', 'smart', 'landscapes', 'wsl', 'in', 'the', 'city', 'of', 'las', 'vegas', 'nevada', 'we', 'use', '15', 'years', 'of', 'geocoded', 'daily', 'records', 'of', 'wsl', 'program', 'applications', 'and', 'approvals', 'compiled', 'by', 'the', 'southern', 'nevada', 'water', 'authority', 'and', 'clark', 'county', 'tax', 'assessors', 'rolls', 'for', 'home', 'characteristics', 'we', 'use', 'this', 'data', 'to', 'test', 'whether', 'a', 'spatially', 'mediated', 'peer', 'effect', 'can', 'be', 'observed', 'in', 'wsl', 'participation', 'likelihood', 'at', 'the', 'household', 'level', 'we', 'show', 'that', 'epidemic', 'spreading', 'models', 'provide', 'more', 'flexibility', 'in', 'modeling', 'assumptions', 'and', 'also', 'provide', 'one', 'mechanism', 'for', 'addressing', 'problems', 'associated', 'with', 'correlated', 'unobservables', 'than', 'hazards', 'models', 'which', 'can', 'also', 'be', 'applied', 'to', 'address', 'the', 'same', 'questions', 'we', 'build', 'networks', 'of', 'neighborhood', 'based', 'peers', 'for', '16', 'randomly', 'selected', 'neighborhoods', 'in', 'las', 'vegas', 'and', 'test', 'for', 'the', 'existence', 'of', 'a', 'peer', 'based', 'influence', 'on', 'wsl', 'participation', 'by', 'using', 'a', 'susceptibleexposedinfectedrecovered', 'epidemic', 'spreading', 'model', 'seir', 'in', 'which', 'a', 'home', 'can', 'become', 'infected', 'via', 'autoinfection', 'or', 'through', 'contagion', 'from', 'its', 'infected', 'neighbors', 'we', 'show', 'that', 'this', 'type', 'of', 'epidemic', 'model', 'can', 'be', 'directly', 'recast', 'to', 'an', 'additivemultiplicative', 'hazard', 'model', 'but', 'not', 'to', 'purely', 'multiplicative', 'one', 'using', 'both', 'inference', 'and', 'prediction', 'approaches', 'we', 'find', 'evidence', 'of', 'peer', 'effects', 'in', 'several', 'las', 'vegas', 'neighborhoods']] | [-0.06575505170028798, 0.048151171582081174, -0.09740278604925914, 0.12390426079680816, -0.10852446163876503, -0.17244926392061027, 0.132515779560679, 0.371115068565189, -0.2339331233406095, -0.311793145957575, 0.12045195518073656, -0.31859616403053054, -0.17970588260718678, 0.15193064184638702, -0.09139654439128053, -0.029845359296288555, 0.07200207857754946, -0.002166342654241187, 0.04237020709353247, -0.32336233322336494, 0.27519626453766044, 0.08632297014874976, 0.2980071081795346, 0.036454622018022985, 0.09039904224086041, 0.024783925027796177, -0.03451706152751389, 0.04979006554798987, -0.11113025755843564, 0.09599763138762618, 0.2894131711725064, 0.20031997323327508, 0.35372918091661415, -0.44293218697487463, -0.17194239314870635, 0.1181383105469382, 0.13702116791441402, 0.09454861966235413, -0.029081451351066358, -0.32224881656079496, 0.03996845325333689, -0.22753852665186, -0.10270710949790421, -0.01980871762925874, -0.01180396881726928, 0.04145554297104902, -0.2765454950000897, 0.03953152133777552, -0.012528719026286385, 0.14019861965223934, -0.04782964659124277, -0.11359378352311056, -0.0503382818487592, 0.15096082965185717, 0.0240731077210512, -0.03951759466013686, 0.1589198521872479, -0.12722578867651982, -0.16072472834394652, 0.3399123112710802, -0.07005133828893359, -0.16101459067279553, 0.155564425203627, -0.08469400907672447, -0.16215256396548655, 0.08565704489040732, 0.2667200761335191, 0.07447841644977601, -0.20079793415133845, 0.0042492994910075165, -0.045567613639052235, 0.164213538068894, 0.03896475929802204, -0.047724252606419874, 0.17048988433916704, 0.20568472936184484, 0.0926421804671392, 0.07221186043908687, -0.09359675958687527, -0.107073638027631, -0.2090918043180329, -0.12862639238625342, -0.12234254011672467, 0.03604673645774982, -0.0784010540368339, -0.16775138060986042, 0.3907677157830571, 0.20519859076729177, 0.15483753987195156, 0.09749926951983105, 0.23657731971398915, 0.027416827211347385, 0.04838616260375951, 0.13688508083523027, 0.17471461850152267, -0.01671166011127886, 0.12205724581930967, -0.16582651546123434, 0.1705007100912579, 0.04155122942012024] |
1,801.10517 | Densely Dilated Spatial Pooling Convolutional Network using benign loss
functions for imbalanced volumetric prostate segmentation | The high incidence rate of prostate disease poses a requirement in early
detection for diagnosis. As one of the main imaging methods used for prostate
cancer detection, Magnetic Resonance Imaging (MRI) has wide range of appearance
and imbalance problems, making automated prostate segmentation fundamental but
challenging. Here we propose a novel Densely Dilated Spatial Pooling
Convolutional Network (DDSP ConNet) in encoder-decoder structure. It employs
dense structure to combine dilated convolution and global pooling, thus
supplies coarse segmentation results from encoder and decoder subnet and
preserves more contextual information. To obtain richer hierarchical feature
maps, residual long connection is furtherly adopted to fuse contexture
features. Meanwhile, we adopt DSC loss and Jaccard loss functions to train our
DDSP ConNet. We surprisingly found and proved that, in contrast to re-weighted
cross entropy, DSC loss and Jaccard loss have a lot of benign properties in
theory, including symmetry, continuity and differentiability about the
parameters of network. Extensive experiments on the MICCAI PROMISE12 challenge
dataset have been done to corroborate the effectiveness of our DDSP ConNet with
DSC loss and Jaccard loss. Totally, our method achieves a score of 85.78 in the
test dataset, outperforming most of other competitors.
| cs.CV | the high incidence rate of prostate disease poses a requirement in early detection for diagnosis as one of the main imaging methods used for prostate cancer detection magnetic resonance imaging mri has wide range of appearance and imbalance problems making automated prostate segmentation fundamental but challenging here we propose a novel densely dilated spatial pooling convolutional network ddsp connet in encoderdecoder structure it employs dense structure to combine dilated convolution and global pooling thus supplies coarse segmentation results from encoder and decoder subnet and preserves more contextual information to obtain richer hierarchical feature maps residual long connection is furtherly adopted to fuse contexture features meanwhile we adopt dsc loss and jaccard loss functions to train our ddsp connet we surprisingly found and proved that in contrast to reweighted cross entropy dsc loss and jaccard loss have a lot of benign properties in theory including symmetry continuity and differentiability about the parameters of network extensive experiments on the miccai promise12 challenge dataset have been done to corroborate the effectiveness of our ddsp connet with dsc loss and jaccard loss totally our method achieves a score of 8578 in the test dataset outperforming most of other competitors | [['the', 'high', 'incidence', 'rate', 'of', 'prostate', 'disease', 'poses', 'a', 'requirement', 'in', 'early', 'detection', 'for', 'diagnosis', 'as', 'one', 'of', 'the', 'main', 'imaging', 'methods', 'used', 'for', 'prostate', 'cancer', 'detection', 'magnetic', 'resonance', 'imaging', 'mri', 'has', 'wide', 'range', 'of', 'appearance', 'and', 'imbalance', 'problems', 'making', 'automated', 'prostate', 'segmentation', 'fundamental', 'but', 'challenging', 'here', 'we', 'propose', 'a', 'novel', 'densely', 'dilated', 'spatial', 'pooling', 'convolutional', 'network', 'ddsp', 'connet', 'in', 'encoderdecoder', 'structure', 'it', 'employs', 'dense', 'structure', 'to', 'combine', 'dilated', 'convolution', 'and', 'global', 'pooling', 'thus', 'supplies', 'coarse', 'segmentation', 'results', 'from', 'encoder', 'and', 'decoder', 'subnet', 'and', 'preserves', 'more', 'contextual', 'information', 'to', 'obtain', 'richer', 'hierarchical', 'feature', 'maps', 'residual', 'long', 'connection', 'is', 'furtherly', 'adopted', 'to', 'fuse', 'contexture', 'features', 'meanwhile', 'we', 'adopt', 'dsc', 'loss', 'and', 'jaccard', 'loss', 'functions', 'to', 'train', 'our', 'ddsp', 'connet', 'we', 'surprisingly', 'found', 'and', 'proved', 'that', 'in', 'contrast', 'to', 'reweighted', 'cross', 'entropy', 'dsc', 'loss', 'and', 'jaccard', 'loss', 'have', 'a', 'lot', 'of', 'benign', 'properties', 'in', 'theory', 'including', 'symmetry', 'continuity', 'and', 'differentiability', 'about', 'the', 'parameters', 'of', 'network', 'extensive', 'experiments', 'on', 'the', 'miccai', 'promise12', 'challenge', 'dataset', 'have', 'been', 'done', 'to', 'corroborate', 'the', 'effectiveness', 'of', 'our', 'ddsp', 'connet', 'with', 'dsc', 'loss', 'and', 'jaccard', 'loss', 'totally', 'our', 'method', 'achieves', 'a', 'score', 'of', '8578', 'in', 'the', 'test', 'dataset', 'outperforming', 'most', 'of', 'other', 'competitors']] | [-0.020451104231445544, -0.029966467131695634, -0.07931493938836572, 0.07279869506661878, -0.0889316910324851, -0.17532385701391226, 0.011981022379889813, 0.4610044683380086, -0.24387803042494247, -0.30407150025227264, 0.0786934298879108, -0.3034878230804073, -0.19786604972735708, 0.1554407142296744, -0.15481810915177144, 0.12487099284013918, 0.13385983818079694, 0.030870415923345718, -0.08170367803662278, -0.2807632280758601, 0.2822159818970249, 0.05391963608731961, 0.3585171963956479, 0.07235545420553535, 0.16363387119054096, -0.0059324230630105985, -0.04393852942848753, -0.03807065229557338, -0.057095215709409786, 0.18154351638562125, 0.29034519108487683, 0.18379652465720633, 0.31923047761423123, -0.37508035991413635, -0.269810620389156, 0.0607880035204289, 0.1280686688332935, 0.038645440736824334, -0.04310780706722047, -0.30900383203212795, 0.10774325351667358, -0.17355603271062137, 0.02837847699750758, -0.14942483519795738, -0.03182626731783481, -0.04633545541097798, -0.32587349498559587, 0.1467200363822485, 0.03786793651427919, 0.07553147394143404, -0.08577819917263696, -0.10925032117681137, -0.023250490202675184, 0.16264532346152313, 0.007717459665097219, 0.08976095138859819, 0.1330367100630004, -0.19396611884925127, -0.11629114237924416, 0.3082468587211527, -0.04259762573625873, -0.1816320579588743, 0.19857604268569654, -0.08654960318684364, -0.11847758105310884, 0.11533997272878575, 0.2167243549718781, 0.1230784432142779, -0.15119802357306375, -0.04720769996887005, -0.028029956686320173, 0.19157822500225544, 0.10931693644639988, 0.019873743709467817, 0.12440949361674332, 0.2776962859473618, 0.05195655348203824, 0.15811260969985597, -0.19293634423623493, -0.04174664566259404, -0.17891998668589318, -0.11472641011035496, -0.16987163370746808, -0.02069736560709619, -0.11078726762199646, -0.16594210526576111, 0.37851474019832193, 0.20868449537132014, 0.2076801851823499, 0.07947730961556469, 0.31650858362748596, -0.007716816492271998, 0.15293728606654136, 0.06205281223446946, 0.20092583401249917, 0.08986847741183131, 0.0933452516331575, -0.1808755973385511, 0.08590005775113241, 0.08455884520784214] |
1,801.10518 | How Can We Induce More Women to Competitions? | Why women avoid participating in a competition and how can we encourage them
to participate in it? In this paper, we investigate how social image concerns
affect women's decision to compete. We first construct a theoretical model and
show that participating in a competition, even under affirmative action
policies favoring women, is costly for women under public observability since
it deviates from traditional female gender norms, resulting in women's low
appearance in competitive environments. We propose and theoretically show that
introducing prosocial incentives in the competitive environment is effective
and robust to public observability since (i) it induces women who are
intrinsically motivated by prosocial incentives to the competitive environment
and (ii) it makes participating in a competition not costly for women from
social image point of view. We conduct a laboratory experiment where we
randomly manipulate the public observability of decisions to compete and test
our theoretical predictions. The results of the experiment are fairly
consistent with our theoretical predictions. We suggest that when designing
policies to promote gender equality in competitive environments, using
prosocial incentives through company philanthropy or other social
responsibility policies, either as substitutes or as complements to traditional
affirmative action policies, could be promising.
| econ.EM | why women avoid participating in a competition and how can we encourage them to participate in it in this paper we investigate how social image concerns affect womens decision to compete we first construct a theoretical model and show that participating in a competition even under affirmative action policies favoring women is costly for women under public observability since it deviates from traditional female gender norms resulting in womens low appearance in competitive environments we propose and theoretically show that introducing prosocial incentives in the competitive environment is effective and robust to public observability since i it induces women who are intrinsically motivated by prosocial incentives to the competitive environment and ii it makes participating in a competition not costly for women from social image point of view we conduct a laboratory experiment where we randomly manipulate the public observability of decisions to compete and test our theoretical predictions the results of the experiment are fairly consistent with our theoretical predictions we suggest that when designing policies to promote gender equality in competitive environments using prosocial incentives through company philanthropy or other social responsibility policies either as substitutes or as complements to traditional affirmative action policies could be promising | [['why', 'women', 'avoid', 'participating', 'in', 'a', 'competition', 'and', 'how', 'can', 'we', 'encourage', 'them', 'to', 'participate', 'in', 'it', 'in', 'this', 'paper', 'we', 'investigate', 'how', 'social', 'image', 'concerns', 'affect', 'womens', 'decision', 'to', 'compete', 'we', 'first', 'construct', 'a', 'theoretical', 'model', 'and', 'show', 'that', 'participating', 'in', 'a', 'competition', 'even', 'under', 'affirmative', 'action', 'policies', 'favoring', 'women', 'is', 'costly', 'for', 'women', 'under', 'public', 'observability', 'since', 'it', 'deviates', 'from', 'traditional', 'female', 'gender', 'norms', 'resulting', 'in', 'womens', 'low', 'appearance', 'in', 'competitive', 'environments', 'we', 'propose', 'and', 'theoretically', 'show', 'that', 'introducing', 'prosocial', 'incentives', 'in', 'the', 'competitive', 'environment', 'is', 'effective', 'and', 'robust', 'to', 'public', 'observability', 'since', 'i', 'it', 'induces', 'women', 'who', 'are', 'intrinsically', 'motivated', 'by', 'prosocial', 'incentives', 'to', 'the', 'competitive', 'environment', 'and', 'ii', 'it', 'makes', 'participating', 'in', 'a', 'competition', 'not', 'costly', 'for', 'women', 'from', 'social', 'image', 'point', 'of', 'view', 'we', 'conduct', 'a', 'laboratory', 'experiment', 'where', 'we', 'randomly', 'manipulate', 'the', 'public', 'observability', 'of', 'decisions', 'to', 'compete', 'and', 'test', 'our', 'theoretical', 'predictions', 'the', 'results', 'of', 'the', 'experiment', 'are', 'fairly', 'consistent', 'with', 'our', 'theoretical', 'predictions', 'we', 'suggest', 'that', 'when', 'designing', 'policies', 'to', 'promote', 'gender', 'equality', 'in', 'competitive', 'environments', 'using', 'prosocial', 'incentives', 'through', 'company', 'philanthropy', 'or', 'other', 'social', 'responsibility', 'policies', 'either', 'as', 'substitutes', 'or', 'as', 'complements', 'to', 'traditional', 'affirmative', 'action', 'policies', 'could', 'be', 'promising']] | [-0.0757277614808632, 0.09378907795598015, -0.06408891961791367, 0.13089387668467203, -0.14815248129771777, -0.1952549695164304, 0.12558542592689098, 0.45491953944843827, -0.23455110665250833, -0.31668280638904883, 0.0817278303327086, -0.3096842706353978, -0.19808894867898258, 0.12735220361524496, -0.1629849074154415, -0.05221172814925361, 0.09798016480224282, 0.010464142817495898, 0.05551049124327197, -0.32774061317475645, 0.3109056774251671, 0.07928306353513641, 0.33787801590832794, 0.056475018453901876, 0.03539766936628806, 1.4661753672466735e-05, -0.03183217762397353, 0.04201720005155287, -0.08709445480439393, 0.10827887443663327, 0.3764254906758045, 0.1920770762690062, 0.3625772775884605, -0.4556019185299073, -0.11172063839132368, 0.12282855221719453, 0.11030315753128944, 0.10189594553237913, -0.06567367186918008, -0.3243100134928645, 0.07137506956327472, -0.20860880369207624, -0.06671072635564464, -0.10775639954013656, -0.02408618761480532, -0.011049367162878767, -0.3155806456381488, 0.07001739637288289, 0.02314544003927196, 0.08372302596560782, -0.0830533770218755, -0.12164241592446813, -0.003276761026225156, 0.2070699830869074, 0.10956832100907717, 0.00024350267138821308, 0.14616810253555557, -0.21044620477260476, -0.16827459766463648, 0.4050421946884293, -0.02551745599596714, -0.16261199919502203, 0.2313402051298945, -0.09641960698692599, -0.12586722777441445, 0.014540677078802026, 0.22427554090502624, 0.09129864674101518, -0.13816859940164827, -0.021844447774294003, -0.059359522086022555, 0.16372758048692967, 0.04170012517921589, -0.017947180709340656, 0.1783542703423235, 0.1769017153278445, 0.10649359354636434, 0.09056533460188987, 0.0469637747765507, -0.12582757102438447, -0.1922541378075351, -0.11385705713370833, -0.10057703798608572, 0.050792966775359195, -0.03057299027495166, -0.061143419218503615, 0.33329182744233143, 0.23330655656496269, 0.11760657635809045, 0.06701577267835312, 0.2845226641805523, -0.01393382145430554, 0.05309261063659432, 0.06617444800448162, 0.23719217663517955, -0.040812719094736334, 0.13081337947567756, -0.20277975259038308, 0.18361202052869655, -0.03261573895379299] |
1,801.10519 | Call-by-Need, Neededness and All That | We show that call-by-need is observationally equivalent to weak-head needed
reduction. The proof of this result uses a semantical argument based on a
(non-idempotent) intersection type system called $\mathcal{V}$. Interestingly,
system $\mathcal{V}$ also allows to syntactically identify all the weak-head
needed redexes of a term.
| cs.LO cs.PL | we show that callbyneed is observationally equivalent to weakhead needed reduction the proof of this result uses a semantical argument based on a nonidempotent intersection type system called mathcalv interestingly system mathcalv also allows to syntactically identify all the weakhead needed redexes of a term | [['we', 'show', 'that', 'callbyneed', 'is', 'observationally', 'equivalent', 'to', 'weakhead', 'needed', 'reduction', 'the', 'proof', 'of', 'this', 'result', 'uses', 'a', 'semantical', 'argument', 'based', 'on', 'a', 'nonidempotent', 'intersection', 'type', 'system', 'called', 'mathcalv', 'interestingly', 'system', 'mathcalv', 'also', 'allows', 'to', 'syntactically', 'identify', 'all', 'the', 'weakhead', 'needed', 'redexes', 'of', 'a', 'term']] | [-0.15613467432558537, 0.009887108682758279, -0.1320333808660507, 0.12822452202025386, -0.17159487386751507, -0.19356476259935235, 0.09819960327198109, 0.2850157589548164, -0.25988348254726995, -0.2371271160017285, 0.05584715463014112, -0.19665181480070007, -0.14818860785776955, 0.17540634025095236, -0.1700004410619537, -0.005404832669430309, 0.06761920361055268, 0.05932658593066865, -0.01028727603972786, -0.24397490148742992, 0.36156364646222855, -0.046246036928560996, 0.24267828727347984, 0.046805899973130886, 0.16235444172699418, 0.009955541802466744, -0.02096484524404837, 0.03802891986237632, -0.1453179270916735, 0.15081719872541727, 0.2605443660997682, 0.21545993353550633, 0.2524739267045839, -0.3764532420784235, -0.08846157731281387, 0.11939259774775969, 0.1294181239273813, 0.10297509354228775, 0.053540523207953404, -0.22852771058678628, 0.11450204554324349, -0.21322370937301052, -0.10469969108493792, -0.0982448011636734, 0.053857835175262554, -0.015191552477578323, -0.2883287644220723, -0.024835715065839595, 0.16075679937170612, 0.048167372101710904, -0.04185975583192582, -0.03504933224887484, -0.019073428213596345, 0.026425869350269852, -0.025785822862397053, 0.045921453036781815, 0.07946224297500319, -0.022310856393434934, -0.10009710946016842, 0.35502312986387147, -0.06788858346020182, -0.19876576910416285, 0.1790145011101332, -0.05126557873768939, -0.17454920129643547, 0.11697548973477549, 0.03909658131500085, 0.14343829316397508, -0.128870004379294, 0.08816599239491754, -0.08526741326269176, 0.2345969225383467, 0.07575896943194999, 0.03896920091162125, 0.14365464943564601, 0.15461561484262348, 0.0946646621864703, 0.17812071152859263, 0.0002427167414377133, -0.04411249224924379, -0.3787033902274238, -0.14736862273162438, -0.10379027498937729, 0.06487559789998663, -0.056657436024397614, -0.1964644723157916, 0.3501078060621189, 0.19024056767423947, 0.1478083757424934, 0.1522447070106864, 0.27183941139115225, 0.08260773367558917, 0.10611707902409964, 0.037901216714332504, 0.1448423692025244, 0.13446090974741512, 0.058215401187125176, -0.14957455824025803, 0.08492934856977728, 0.1986024960047669] |
1,801.1052 | Hyper-rational choice theory | The rational choice theory is based on this idea that people rationally
pursue goals for increasing their personal interests. In most conditions, the
behavior of an actor is not independent of the person and others' behavior.
Here, we present a new concept of rational choice as a hyper-rational choice
which in this concept, the actor thinks about profit or loss of other actors in
addition to his personal profit or loss and then will choose an action which is
desirable to him. We implement the hyper-rational choice to generalize and
expand the game theory. Results of this study will help to model the behavior
of people considering environmental conditions, the kind of behavior
interactive, valuation system of itself and others and system of beliefs and
internal values of societies. Hyper-rationality helps us understand how human
decision makers behave in interactive decisions.
| econ.EM | the rational choice theory is based on this idea that people rationally pursue goals for increasing their personal interests in most conditions the behavior of an actor is not independent of the person and others behavior here we present a new concept of rational choice as a hyperrational choice which in this concept the actor thinks about profit or loss of other actors in addition to his personal profit or loss and then will choose an action which is desirable to him we implement the hyperrational choice to generalize and expand the game theory results of this study will help to model the behavior of people considering environmental conditions the kind of behavior interactive valuation system of itself and others and system of beliefs and internal values of societies hyperrationality helps us understand how human decision makers behave in interactive decisions | [['the', 'rational', 'choice', 'theory', 'is', 'based', 'on', 'this', 'idea', 'that', 'people', 'rationally', 'pursue', 'goals', 'for', 'increasing', 'their', 'personal', 'interests', 'in', 'most', 'conditions', 'the', 'behavior', 'of', 'an', 'actor', 'is', 'not', 'independent', 'of', 'the', 'person', 'and', 'others', 'behavior', 'here', 'we', 'present', 'a', 'new', 'concept', 'of', 'rational', 'choice', 'as', 'a', 'hyperrational', 'choice', 'which', 'in', 'this', 'concept', 'the', 'actor', 'thinks', 'about', 'profit', 'or', 'loss', 'of', 'other', 'actors', 'in', 'addition', 'to', 'his', 'personal', 'profit', 'or', 'loss', 'and', 'then', 'will', 'choose', 'an', 'action', 'which', 'is', 'desirable', 'to', 'him', 'we', 'implement', 'the', 'hyperrational', 'choice', 'to', 'generalize', 'and', 'expand', 'the', 'game', 'theory', 'results', 'of', 'this', 'study', 'will', 'help', 'to', 'model', 'the', 'behavior', 'of', 'people', 'considering', 'environmental', 'conditions', 'the', 'kind', 'of', 'behavior', 'interactive', 'valuation', 'system', 'of', 'itself', 'and', 'others', 'and', 'system', 'of', 'beliefs', 'and', 'internal', 'values', 'of', 'societies', 'hyperrationality', 'helps', 'us', 'understand', 'how', 'human', 'decision', 'makers', 'behave', 'in', 'interactive', 'decisions']] | [-0.0903497382965205, 0.08205409650794795, -0.15220198930640305, 0.06704158862204557, -0.20715238901320845, -0.1703015211836568, 0.09798270626509163, 0.3957724517211318, -0.2644715213258418, -0.3002355580401075, 0.07016668430463012, -0.28082546315022877, -0.2041007743782497, 0.12417716168648829, -0.19965815612979765, -0.017823607803750616, 0.0381189884613767, 0.09446784787079586, 0.01784880413740341, -0.31913796994569044, 0.3396647843964664, 0.06726027197271053, 0.26431131408150704, 0.05942828873978994, 0.08551722530807768, 0.06014296814516586, -0.014796294978753264, -0.005878684862649867, -0.12171654477242555, 0.16829161836898754, 0.3041075895174539, 0.2124708857607142, 0.39422564631261464, -0.41575163807719945, -0.13973620619757898, 0.09536830201478941, 0.0890127475051226, 0.04938618952375171, 0.02101609163302263, -0.2797517336106726, 0.03981187283976136, -0.2246515086918537, -0.18684885569715073, -0.0720190611185639, -0.0027818173935104692, 0.01624030853417935, -0.2655355042611648, -0.05903747877704778, 0.06454894283254231, 0.08189218181204135, -0.04816786190993818, -0.06556399148456486, 0.012159264526729073, 0.22301608551559704, 0.08933729741672453, -0.02110726902361161, 0.1884643890229719, -0.1830983576314923, -0.1559817742190457, 0.381601016040908, 0.003730747220106423, -0.21594498643950957, 0.19558675904991105, -0.09326332072128675, -0.12358715776437228, 0.038270953676796386, 0.19248774060314255, 0.10323636869766882, -0.15671308497216418, 0.006233130868557575, -0.04080666228297299, 0.17165389700593162, 0.054472763986060664, 0.04157324601796323, 0.19755557127563017, 0.14666720038346415, 0.09073092851322144, 0.07200614038603297, 0.04773222913333614, -0.14140446011775307, -0.25743209312204274, -0.17838376345046397, -0.12899364354754134, 0.05896080058643877, -0.0544677570809394, -0.14284428197092244, 0.37209090427828156, 0.22480948543442147, 0.14218868841417134, 0.05578935413837566, 0.26391344711716686, 0.04531597987931621, 0.027279210564613875, 0.0171723520715854, 0.17526692393169338, 0.02037167562437909, 0.15704436554972614, -0.18549186948886406, 0.14737371949345937, 0.025465064940466877] |
1,801.10521 | Conformal geometric method study open strings and closed strings
relationships on Dirichlet branes | The compactness of the closed string in the classical Type II string theory
reveals the duality, whereas the compactness of the open string reveals that
the end of the string is on the hypersurface which satisfies the Dirichlet
boundary condition.
| hep-th | the compactness of the closed string in the classical type ii string theory reveals the duality whereas the compactness of the open string reveals that the end of the string is on the hypersurface which satisfies the dirichlet boundary condition | [['the', 'compactness', 'of', 'the', 'closed', 'string', 'in', 'the', 'classical', 'type', 'ii', 'string', 'theory', 'reveals', 'the', 'duality', 'whereas', 'the', 'compactness', 'of', 'the', 'open', 'string', 'reveals', 'that', 'the', 'end', 'of', 'the', 'string', 'is', 'on', 'the', 'hypersurface', 'which', 'satisfies', 'the', 'dirichlet', 'boundary', 'condition']] | [-0.19726914752973243, 0.10238807895220817, -0.1334473391994834, 0.1502505174052203, -0.1016017410904169, -0.13544133910909295, 0.05053728263301309, 0.20138386214966886, -0.2799014767166227, -0.2071736673824489, 0.12868150470894762, -0.231222669640556, -0.08616230468032882, 0.12133297824766487, -0.09881500322371721, -0.0016939546447247266, 0.051038070989307016, 0.17943372447043657, -0.09534544613561594, -0.23026341159129515, 0.46541667712153867, -0.015247558429837226, 0.3353298387490213, 0.11242149434983731, 0.08791824951767921, 0.005924916989170015, -0.024263943126425148, 0.010205292224418372, -0.16585066321513295, 0.1731102717050817, 0.17252463223412634, 0.13705635238438846, 0.1718788376543671, -0.46439498183317485, -0.20796561148017645, 0.031805134285241364, 0.13202038174204062, 0.05977792971243616, -0.005765838889055885, -0.2571100257802755, 0.13680843359325082, -0.019253938924521208, -0.18515051365830004, 0.0719143841182813, 0.018590315990149976, 0.015766516493749806, -0.2195704746991396, 0.0860262077767402, 0.12090618410147727, 0.019952527107670905, -0.13307966878637673, -0.0022380126640200613, -0.04489904660731554, 0.043886845279484984, 0.08837618259130978, 0.10758205907186494, 0.05756788338767364, -0.16971150585450231, -0.06127302229870111, 0.3279507174156606, -0.04996395098278299, -0.18085833536460996, 0.13928030885290354, -0.12607336908113212, -0.15536986939841882, 0.05735815727384761, -0.007237869896925986, 0.12461252243956551, -0.10738350478932261, 0.28638113364577295, -0.05174226378730964, 0.12728348505625037, 0.13392752895597368, 0.03963029208825901, 0.2072961224010214, 0.13655183766968548, 0.07530548609793186, 0.20557183384662495, -0.09291599487187341, -0.17264933194965124, -0.4500925814732909, -0.1525187141261995, -0.11695532402954996, 0.10956724465359002, -0.17400616784580053, -0.2875125885475427, 0.321125725004822, 0.030818064631603193, 0.1725639839656651, 0.06084219103504438, 0.17074601678177714, 0.12315695588476956, 0.03433909513987601, 0.08193264900473878, 0.20236277510412037, 0.1929904609627556, 0.10252355765551328, -0.2883854820858687, -0.025286414369475096, 0.2005872192559764] |
1,801.10522 | On the chiral expansion of vector meson masses | We study the chiral expansion of meson masses and decay constants using a
chiral Lagrangian that was constructed previously based on the hadrogenesis
conjecture. The one-loop self energies of the Goldstone bosons and vector
mesons are evaluated. It is illustrated that a renormalizeable effective field
theory arises once specific conditions on the low-energy constants are imposed.
For the case where the hadrogenesis mass gap scale Lambda_{HG} is substantially
larger than the chiral symmetry breaking scale Lambda_chi a partial summation
scheme is required. All terms proportional to (M/\Lambda_\chi)^n can be summed
by a suitable renormalization, where M is the chiral and large-N_c limit of the
vector meson masses in QCD. The size of loop effects from vector meson degrees
of freedom is illustrated for physical quarks masses. Naturally sized effects
are observed that have significant impact on the chiral structure of low-energy
QCD with three light flavours.
| hep-ph nucl-th | we study the chiral expansion of meson masses and decay constants using a chiral lagrangian that was constructed previously based on the hadrogenesis conjecture the oneloop self energies of the goldstone bosons and vector mesons are evaluated it is illustrated that a renormalizeable effective field theory arises once specific conditions on the lowenergy constants are imposed for the case where the hadrogenesis mass gap scale lambda_hg is substantially larger than the chiral symmetry breaking scale lambda_chi a partial summation scheme is required all terms proportional to mlambda_chin can be summed by a suitable renormalization where m is the chiral and largen_c limit of the vector meson masses in qcd the size of loop effects from vector meson degrees of freedom is illustrated for physical quarks masses naturally sized effects are observed that have significant impact on the chiral structure of lowenergy qcd with three light flavours | [['we', 'study', 'the', 'chiral', 'expansion', 'of', 'meson', 'masses', 'and', 'decay', 'constants', 'using', 'a', 'chiral', 'lagrangian', 'that', 'was', 'constructed', 'previously', 'based', 'on', 'the', 'hadrogenesis', 'conjecture', 'the', 'oneloop', 'self', 'energies', 'of', 'the', 'goldstone', 'bosons', 'and', 'vector', 'mesons', 'are', 'evaluated', 'it', 'is', 'illustrated', 'that', 'a', 'renormalizeable', 'effective', 'field', 'theory', 'arises', 'once', 'specific', 'conditions', 'on', 'the', 'lowenergy', 'constants', 'are', 'imposed', 'for', 'the', 'case', 'where', 'the', 'hadrogenesis', 'mass', 'gap', 'scale', 'lambda_hg', 'is', 'substantially', 'larger', 'than', 'the', 'chiral', 'symmetry', 'breaking', 'scale', 'lambda_chi', 'a', 'partial', 'summation', 'scheme', 'is', 'required', 'all', 'terms', 'proportional', 'to', 'mlambda_chin', 'can', 'be', 'summed', 'by', 'a', 'suitable', 'renormalization', 'where', 'm', 'is', 'the', 'chiral', 'and', 'largen_c', 'limit', 'of', 'the', 'vector', 'meson', 'masses', 'in', 'qcd', 'the', 'size', 'of', 'loop', 'effects', 'from', 'vector', 'meson', 'degrees', 'of', 'freedom', 'is', 'illustrated', 'for', 'physical', 'quarks', 'masses', 'naturally', 'sized', 'effects', 'are', 'observed', 'that', 'have', 'significant', 'impact', 'on', 'the', 'chiral', 'structure', 'of', 'lowenergy', 'qcd', 'with', 'three', 'light', 'flavours']] | [-0.150508656205299, 0.30225926263261094, -0.06993186796575578, 0.10177886085148202, -0.07902129478275634, -0.09133792496221657, 0.019465202505266968, 0.31796871602515847, -0.1706238838992754, -0.23435683203085014, 0.04688680482084035, -0.2770792830156602, -0.08036224042815673, 0.09889163076069155, 0.07157889995788638, 0.0774725024885912, 0.007328204251179058, 0.06674897249265793, -0.07253825133537045, -0.23534041608056416, 0.35490602209109867, -0.014554802037309855, 0.23902110640321755, 0.16091326525525396, 0.05780932139411258, 0.004317578154667798, 0.0064045243860972635, -0.01727851536512996, -0.08929287734963509, 0.0605349022985643, 0.16950193235081518, 0.006934742087550048, 0.13663283574310803, -0.3724985132834667, -0.19232947188720573, 0.06454262613745716, 0.1603355899537241, 0.12447692625897212, -0.01963049992708774, -0.28892318718782106, 0.1128511660717777, -0.1664688761294302, -0.17157229824806564, -0.12398490423866962, -0.016194476153436374, -0.06792987999021231, -0.32920321033331373, 0.10150797113015465, -0.06234335684631434, 0.06737019791034982, -0.029196852759923786, -0.19783768776687793, -0.061976338851511374, 0.05787726467113114, 0.14031591433740687, 0.06518280423349804, 0.1517499860209581, -0.16244205150158247, -0.11746827861578721, 0.4621906979785611, -0.0737863627070207, -0.19434734880148122, 0.10698086887552766, -0.12744574099714454, -0.1250005733292912, 0.13964593879710366, 0.15980292890647738, 0.10551231992333972, -0.171056056104539, 0.15774150636934792, -0.07020711737115765, 0.17834802355678725, 0.08234705136015287, 0.06994853629213241, 0.20704084082454857, 0.14624669909244403, -0.019374873028330814, 0.050514851320864786, -0.026823040570889134, -0.13853070903375433, -0.3663251024683834, -0.07338257484257661, -0.1578722139343477, 0.059203196072808675, -0.12805994444746224, -0.09929477635079012, 0.3831976002281863, 0.10370848356423165, 0.2249502568997236, 0.03350528731081997, 0.29485756983113887, 0.15219953737040567, 0.14761866914987978, 0.06287297858378021, 0.29586374235158375, 0.1975803841050947, 0.04872325682663359, -0.28380504677099655, -0.06753368282483684, 0.1417902944150329] |
1,801.10523 | Determine Arbitrary Feynman Integrals by Vacuum Integrals | By introducing an auxiliary parameter, we find a new representation for
Feynman integrals, which defines a Feynman integral by analytical continuation
of a series containing only vacuum integrals. The new representation therefore
conceptually translates the problem of computing Feynman integrals to the
problem of performing analytical continuations. As an application of the new
representation, we use it to construct a novel reduction method for multi-loop
Feynman integrals, which is expected to be more efficient than known
integration-by-parts reduction method. Using the new method, we successfully
reduced all complicated two-loop integrals in $gg\to HH$ process and $gg\to
ggg$ process.
| hep-ph hep-th nucl-th | by introducing an auxiliary parameter we find a new representation for feynman integrals which defines a feynman integral by analytical continuation of a series containing only vacuum integrals the new representation therefore conceptually translates the problem of computing feynman integrals to the problem of performing analytical continuations as an application of the new representation we use it to construct a novel reduction method for multiloop feynman integrals which is expected to be more efficient than known integrationbyparts reduction method using the new method we successfully reduced all complicated twoloop integrals in ggto hh process and ggto ggg process | [['by', 'introducing', 'an', 'auxiliary', 'parameter', 'we', 'find', 'a', 'new', 'representation', 'for', 'feynman', 'integrals', 'which', 'defines', 'a', 'feynman', 'integral', 'by', 'analytical', 'continuation', 'of', 'a', 'series', 'containing', 'only', 'vacuum', 'integrals', 'the', 'new', 'representation', 'therefore', 'conceptually', 'translates', 'the', 'problem', 'of', 'computing', 'feynman', 'integrals', 'to', 'the', 'problem', 'of', 'performing', 'analytical', 'continuations', 'as', 'an', 'application', 'of', 'the', 'new', 'representation', 'we', 'use', 'it', 'to', 'construct', 'a', 'novel', 'reduction', 'method', 'for', 'multiloop', 'feynman', 'integrals', 'which', 'is', 'expected', 'to', 'be', 'more', 'efficient', 'than', 'known', 'integrationbyparts', 'reduction', 'method', 'using', 'the', 'new', 'method', 'we', 'successfully', 'reduced', 'all', 'complicated', 'twoloop', 'integrals', 'in', 'ggto', 'hh', 'process', 'and', 'ggto', 'ggg', 'process']] | [-0.09974461994775362, 0.06848541191899056, -0.13111138646015708, 0.10279274513554904, -0.17252298375848224, -0.08018122575416857, 0.08024698828004909, 0.33741137157289347, -0.2686342455028575, -0.2638303286643053, 0.05802926482342906, -0.22017950781297926, -0.20685412988009655, 0.26112490362126606, -0.029167240086410726, 0.060706425515212575, 0.1171423968079747, -0.010388046108680417, -0.08532952998137595, -0.2492211145938051, 0.2972839137881386, -0.012312820523369069, 0.19641251343169383, 0.020456740447339052, 0.15159182557456044, 0.09311992173767364, -0.07699414244282762, -0.06648410685664537, -0.10218236954616648, 0.1723313654644643, 0.24761798127307272, 0.08522078358896115, 0.2064373184147538, -0.36979437874135923, -0.15584879886473016, 0.0693955437852811, 0.22486130899882742, 0.12439604436418003, 0.015696343335492906, -0.268691247984843, 0.032818116691932846, -0.23185047035685227, -0.15396338066428292, -0.20543067797790376, 0.013677977324862565, -0.12913941180485547, -0.32975819459356065, 0.03421011032555633, -0.029404403879402245, 0.03511901575197675, -0.004882779537833163, -0.12884388443994887, 0.04588635586325687, 0.07533283382464125, -0.002105929217020962, 0.07745121742541693, 0.07887567010023916, -0.17664905966316558, -0.1893409643635838, 0.3321027409057228, -0.06330462323685239, -0.262969553223526, 0.10598423563381087, -0.09224386618125766, -0.16915995006126408, 0.22297511090125358, 0.09952492822835944, 0.2028764707929626, -0.2517527834208188, 0.12004259787915673, 0.027791650804253866, 0.05824373737547775, 0.09742734655357745, -0.030046022107482563, 0.10011932473601204, 0.1297557243165009, 0.03125421584070641, 0.19675754543693205, -0.0075755305920860595, -0.10916801562000598, -0.37131395285987123, -0.21484832091218964, -0.13022196225997784, 0.06168823570431191, -0.14000765453743136, -0.24510442367659843, 0.37195797709330003, 0.1601363192882617, 0.17067465359791734, 0.0541719547971817, 0.3219312973550939, 0.2639406674472634, 0.14530625598201033, 0.05248004490300557, 0.13476097189621733, 0.1200989084912236, 0.06164673598939363, -0.18201812855633243, -0.017104498374427915, 0.18998853368114452] |
1,801.10524 | Tropical optimization techniques in multi-criteria decision making with
Analytical Hierarchy Process | We apply methods and techniques of tropical optimization to develop a new
theoretical and computational framework for the implementation of the Analytic
Hierarchy Process in multi-criteria problems of rating alternatives from
pairwise comparison data. The framework involves the Chebyshev approximation of
pairwise comparison matrices by consistent matrices in the logarithmic scale.
We reduce the log-Chebyshev approximation to multidimensional tropical
optimization problems, and offer complete direct solutions to the problems in
the framework of tropical mathematics. The results obtained provide a
closed-form solution to the rating problem of interest as either a unique score
vector (up to a positive factor) or as a set of different score vectors. To
handle the problem when the solution is not unique, we develop tropical
optimization techniques to find those vectors from the solution set that are
the most and least differentiating between the alternatives with the highest
and lowest scores, and thus can be well representative of the entire solution.
| math.OC cs.SY | we apply methods and techniques of tropical optimization to develop a new theoretical and computational framework for the implementation of the analytic hierarchy process in multicriteria problems of rating alternatives from pairwise comparison data the framework involves the chebyshev approximation of pairwise comparison matrices by consistent matrices in the logarithmic scale we reduce the logchebyshev approximation to multidimensional tropical optimization problems and offer complete direct solutions to the problems in the framework of tropical mathematics the results obtained provide a closedform solution to the rating problem of interest as either a unique score vector up to a positive factor or as a set of different score vectors to handle the problem when the solution is not unique we develop tropical optimization techniques to find those vectors from the solution set that are the most and least differentiating between the alternatives with the highest and lowest scores and thus can be well representative of the entire solution | [['we', 'apply', 'methods', 'and', 'techniques', 'of', 'tropical', 'optimization', 'to', 'develop', 'a', 'new', 'theoretical', 'and', 'computational', 'framework', 'for', 'the', 'implementation', 'of', 'the', 'analytic', 'hierarchy', 'process', 'in', 'multicriteria', 'problems', 'of', 'rating', 'alternatives', 'from', 'pairwise', 'comparison', 'data', 'the', 'framework', 'involves', 'the', 'chebyshev', 'approximation', 'of', 'pairwise', 'comparison', 'matrices', 'by', 'consistent', 'matrices', 'in', 'the', 'logarithmic', 'scale', 'we', 'reduce', 'the', 'logchebyshev', 'approximation', 'to', 'multidimensional', 'tropical', 'optimization', 'problems', 'and', 'offer', 'complete', 'direct', 'solutions', 'to', 'the', 'problems', 'in', 'the', 'framework', 'of', 'tropical', 'mathematics', 'the', 'results', 'obtained', 'provide', 'a', 'closedform', 'solution', 'to', 'the', 'rating', 'problem', 'of', 'interest', 'as', 'either', 'a', 'unique', 'score', 'vector', 'up', 'to', 'a', 'positive', 'factor', 'or', 'as', 'a', 'set', 'of', 'different', 'score', 'vectors', 'to', 'handle', 'the', 'problem', 'when', 'the', 'solution', 'is', 'not', 'unique', 'we', 'develop', 'tropical', 'optimization', 'techniques', 'to', 'find', 'those', 'vectors', 'from', 'the', 'solution', 'set', 'that', 'are', 'the', 'most', 'and', 'least', 'differentiating', 'between', 'the', 'alternatives', 'with', 'the', 'highest', 'and', 'lowest', 'scores', 'and', 'thus', 'can', 'be', 'well', 'representative', 'of', 'the', 'entire', 'solution']] | [-0.049938169260246634, -0.03735516326597486, -0.07481316577207345, 0.09674635177255671, -0.08445474734673133, -0.12552288379624654, 0.07917650103757833, 0.348101096935212, -0.31591463784869306, -0.30402137068971896, 0.13207896882727838, -0.2888641922603337, -0.16920818261897716, 0.18703386304416478, -0.05166662086804326, 0.08747106034290762, 0.07991928753490822, 0.019567966006154444, -0.12029682106833953, -0.2561168323139636, 0.31008001336923396, 0.038222442667644754, 0.27482105498440945, 0.040749604581670165, 0.12880082883594485, -0.025075155154366095, -0.026170953979882866, 0.050832468311851606, -0.09962567900038266, 0.1726490962990703, 0.32234090872598475, 0.23598836357287395, 0.3186478101982711, -0.4045122875832021, -0.1542018001111081, 0.1222671953549322, 0.10824958929636826, 0.0976597924152604, -0.007386943495545823, -0.23740884359591666, 0.08987018769720378, -0.148544740897472, -0.10576199158990326, -0.11226767893188083, -0.0375962617347399, 0.020524386018037032, -0.3263685950704922, 0.06618909687415744, 0.011338381319850063, 0.019692754584889956, -0.07979952108610469, -0.16222972130605903, 0.046201476610850736, 0.1086672750603518, 0.06252108875924023, 0.02107917661823404, 0.05933887315376733, -0.11885277309920639, -0.1579028828224788, 0.3987198383666766, -0.044186021998309746, -0.23766847308546019, 0.18541709044112417, -0.08735061638678114, -0.09927404173709548, 0.13609389355406165, 0.20808406605218083, 0.13977058933307537, -0.14517615974228903, 0.05663217880945199, -0.06192500536771826, 0.11733683916584899, 0.04523321623519923, -0.0322764208108427, 0.1725560195209721, 0.15245823187675947, 0.12133150223570947, 0.12144371183090605, -0.02161383437207685, -0.10967650946128206, -0.26840964615201723, -0.14354417544717973, -0.16306592491813576, -0.007253803408205455, -0.14993111638334364, -0.19957330155496797, 0.4057238020767004, 0.1383188442679313, 0.1996703390032053, 0.08598472160669282, 0.29627171539677644, 0.1284984823598792, 0.039946837696987085, 0.07089125367705353, 0.19073676246140772, 0.12336022077420822, 0.060368163499217004, -0.159952576137118, 0.05433978358856761, 0.10201244611734858] |
1,801.10525 | Skyrmion nucleation via localized spin current injection in confined
nanowire geometry in low chirality magnetic materials | Magnetic skyrmions have been the focus of intense research with promising
applications in memory, logic and interconnect technology. Several schemes have
been recently proposed and demonstrated to nucleate skyrmions. However, they
either result in an uncontrolled skyrmion bubble production or are mostly
targeted towards integration with racetrack memory device. In this work, we
propose a novel scheme for a controlled single skyrmion nucleation in a
confined nanowire geometry with sub-100 nm width using a generalized approach
of "localized spin current injection" technique in material systems exhibiting
low Dzyaloshinskii-Moriya interaction (DMI). Our proposed nucleation mechanism
follows a pathway involving the creation of a reversed magnetic domain
containing one or more pairs of vertical Bloch lines (VBLs) that form an
edge-to-edge domain wall as the VBLs get annihilated at the edge of the
nanowire. However, pinning of the edge domain walls within a narrow gap using
notches or anti-notches results in the creation of a magnetic bubble with
defect-free domain wall that eventually relaxes into a circular skyrmion
structure. Our simulations predict that the proposed mechanism allows skyrmion
nucleation on sub-nanosecond timescale, shows robustness to variations like
local pinning sites and is applicable for any skyrmion-based logic, memory and
interconnect application.
| cond-mat.mes-hall | magnetic skyrmions have been the focus of intense research with promising applications in memory logic and interconnect technology several schemes have been recently proposed and demonstrated to nucleate skyrmions however they either result in an uncontrolled skyrmion bubble production or are mostly targeted towards integration with racetrack memory device in this work we propose a novel scheme for a controlled single skyrmion nucleation in a confined nanowire geometry with sub100 nm width using a generalized approach of localized spin current injection technique in material systems exhibiting low dzyaloshinskiimoriya interaction dmi our proposed nucleation mechanism follows a pathway involving the creation of a reversed magnetic domain containing one or more pairs of vertical bloch lines vbls that form an edgetoedge domain wall as the vbls get annihilated at the edge of the nanowire however pinning of the edge domain walls within a narrow gap using notches or antinotches results in the creation of a magnetic bubble with defectfree domain wall that eventually relaxes into a circular skyrmion structure our simulations predict that the proposed mechanism allows skyrmion nucleation on subnanosecond timescale shows robustness to variations like local pinning sites and is applicable for any skyrmionbased logic memory and interconnect application | [['magnetic', 'skyrmions', 'have', 'been', 'the', 'focus', 'of', 'intense', 'research', 'with', 'promising', 'applications', 'in', 'memory', 'logic', 'and', 'interconnect', 'technology', 'several', 'schemes', 'have', 'been', 'recently', 'proposed', 'and', 'demonstrated', 'to', 'nucleate', 'skyrmions', 'however', 'they', 'either', 'result', 'in', 'an', 'uncontrolled', 'skyrmion', 'bubble', 'production', 'or', 'are', 'mostly', 'targeted', 'towards', 'integration', 'with', 'racetrack', 'memory', 'device', 'in', 'this', 'work', 'we', 'propose', 'a', 'novel', 'scheme', 'for', 'a', 'controlled', 'single', 'skyrmion', 'nucleation', 'in', 'a', 'confined', 'nanowire', 'geometry', 'with', 'sub100', 'nm', 'width', 'using', 'a', 'generalized', 'approach', 'of', 'localized', 'spin', 'current', 'injection', 'technique', 'in', 'material', 'systems', 'exhibiting', 'low', 'dzyaloshinskiimoriya', 'interaction', 'dmi', 'our', 'proposed', 'nucleation', 'mechanism', 'follows', 'a', 'pathway', 'involving', 'the', 'creation', 'of', 'a', 'reversed', 'magnetic', 'domain', 'containing', 'one', 'or', 'more', 'pairs', 'of', 'vertical', 'bloch', 'lines', 'vbls', 'that', 'form', 'an', 'edgetoedge', 'domain', 'wall', 'as', 'the', 'vbls', 'get', 'annihilated', 'at', 'the', 'edge', 'of', 'the', 'nanowire', 'however', 'pinning', 'of', 'the', 'edge', 'domain', 'walls', 'within', 'a', 'narrow', 'gap', 'using', 'notches', 'or', 'antinotches', 'results', 'in', 'the', 'creation', 'of', 'a', 'magnetic', 'bubble', 'with', 'defectfree', 'domain', 'wall', 'that', 'eventually', 'relaxes', 'into', 'a', 'circular', 'skyrmion', 'structure', 'our', 'simulations', 'predict', 'that', 'the', 'proposed', 'mechanism', 'allows', 'skyrmion', 'nucleation', 'on', 'subnanosecond', 'timescale', 'shows', 'robustness', 'to', 'variations', 'like', 'local', 'pinning', 'sites', 'and', 'is', 'applicable', 'for', 'any', 'skyrmionbased', 'logic', 'memory', 'and', 'interconnect', 'application']] | [-0.16432035439729634, 0.14918799280266784, -0.04809758726778866, -0.01490165334313069, -0.10868868000814738, -0.16365025982251344, 0.06071316717361011, 0.44285554256074916, -0.2561725140362042, -0.29286542181077707, 0.07233173696291469, -0.21622671027459853, -0.08232085759068217, 0.20062214624834007, 0.007222863760436859, 0.020850833451571925, 0.008068724117714482, -0.03402895705034984, 0.016663693231483687, -0.19028718510862608, 0.24359917311213125, -0.018914920662239605, 0.3778846121332304, 0.10132837365264419, 0.05248728127513624, -0.03810613394607252, 0.08282302976053574, 0.027448221273607944, -0.13481346924432253, 0.09840445234678655, 0.19219376809863448, -0.03671617582721177, 0.25167341757069656, -0.545036725484621, -0.2232949718243288, 0.023877807482187846, 0.20646418452066317, 0.1741682104462168, -0.11959614601004084, -0.3073544192347844, 0.09891994604513274, -0.17081247094489785, -0.12897372101722784, -0.06749557900761989, 0.04276992482760331, 0.02028816431437867, -0.23936269626673076, 0.05058929693520107, 0.0928381364277784, 0.04033792455711088, -0.07466433345528563, -0.05396554500962041, -0.0433019085894877, 0.03841238183346132, 0.0006138948506053219, 0.07621650902282952, 0.217111632361278, -0.14093819368997115, -0.20285216989416874, 0.32866048736114, -0.014882931704416487, -0.16784732315300885, 0.15301379950567331, -0.12495646413050629, -0.05610558454499547, 0.16461341888012, 0.14216410341536878, 0.12446957086353333, -0.10307322118557691, 0.039589581910629605, 0.028951103787345053, 0.17220689867150468, 0.11279107365247105, 0.0612070073815877, 0.2811750752825627, 0.2696233509768306, 0.07256165887907746, 0.18280611987765083, -0.13567536531002192, -0.09802409902977846, -0.2285395607530097, -0.15896076902901596, -0.21306475691015284, 0.027613071059040612, -0.06329920180533877, -0.20585108042727387, 0.3713109020978508, 0.12510118200607487, 0.15866698668193277, -0.035696426098791874, 0.27379566985159065, 0.039672645309064815, 0.16057288545375717, 0.0495251795819881, 0.20145199433128214, 0.10910674073644469, 0.17176056668939227, -0.22970343731114426, 0.05869678974891054, -0.007751834543712025] |
1,801.10526 | Affine Connections on 3-Sasakian Homogeneous Manifolds | The space of invariant affine connections on every $3$-Sasakian homogeneous
manifold of dimension at least $7$ is described. In particular, the remarkable
subspaces of invariant affine metric connections, and the subclass with
skew-torsion, are also determined. To this aim, an explicit construction of all
$3$-Sasakian homogeneous manifolds is exhibited. The unique $3$-Sasakian
homogeneous manifolds which admit nontrivial Einstein with skew-torsion
invariant affine connections are those of dimension $7$, that is,
$\mathbb{S}^7=\mathrm{Sp} (2)/ \mathrm{Sp(1)}$, $\mathbb{R} P^7=\mathrm{Sp}(2)/
\mathrm{Sp(1)}\times \mathbb{Z}_{2}$ and the Aloff-Wallach space
$\mathfrak{W}^{7}_{1,1}= \mathrm{SU}(3)/ \mathrm{U}(1)$. For $\mathbb{S}^7$ and
$\mathbb{R} P^7$, the set of such connections is in one to one correspondence
with two copies of the conformal linear transformation group of the Euclidean
space, while it is strictly bigger for $\mathfrak{W}^{7}_{1,1}$. In addition,
the set of invariant connections with totally skew-symmetric torsion whose
Ricci tensor is multiple of the metric, with different factors, on the
canonical vertical and horizontal distributions, is fully described on every
$3$-Sasakian homogeneous manifold. An affine connection satisfying these
conditions is distinguished, characterized by parallelizing all the
characteristic vector fields associated to the $3$-Sasakian structure. This
connection is Einstein with skew-torsion for the $7$-dimensional examples.
Several results have also been adapted to the nonnecessarily homogeneous
setting. In this case, the above mentioned sets of affine connections are, in
general, only proper subsets satisfying the properties.
| math.DG | the space of invariant affine connections on every 3sasakian homogeneous manifold of dimension at least 7 is described in particular the remarkable subspaces of invariant affine metric connections and the subclass with skewtorsion are also determined to this aim an explicit construction of all 3sasakian homogeneous manifolds is exhibited the unique 3sasakian homogeneous manifolds which admit nontrivial einstein with skewtorsion invariant affine connections are those of dimension 7 that is mathbbs7mathrmsp 2 mathrmsp1 mathbbr p7mathrmsp2 mathrmsp1times mathbbz_2 and the aloffwallach space mathfrakw7_11 mathrmsu3 mathrmu1 for mathbbs7 and mathbbr p7 the set of such connections is in one to one correspondence with two copies of the conformal linear transformation group of the euclidean space while it is strictly bigger for mathfrakw7_11 in addition the set of invariant connections with totally skewsymmetric torsion whose ricci tensor is multiple of the metric with different factors on the canonical vertical and horizontal distributions is fully described on every 3sasakian homogeneous manifold an affine connection satisfying these conditions is distinguished characterized by parallelizing all the characteristic vector fields associated to the 3sasakian structure this connection is einstein with skewtorsion for the 7dimensional examples several results have also been adapted to the nonnecessarily homogeneous setting in this case the above mentioned sets of affine connections are in general only proper subsets satisfying the properties | [['the', 'space', 'of', 'invariant', 'affine', 'connections', 'on', 'every', '3sasakian', 'homogeneous', 'manifold', 'of', 'dimension', 'at', 'least', '7', 'is', 'described', 'in', 'particular', 'the', 'remarkable', 'subspaces', 'of', 'invariant', 'affine', 'metric', 'connections', 'and', 'the', 'subclass', 'with', 'skewtorsion', 'are', 'also', 'determined', 'to', 'this', 'aim', 'an', 'explicit', 'construction', 'of', 'all', '3sasakian', 'homogeneous', 'manifolds', 'is', 'exhibited', 'the', 'unique', '3sasakian', 'homogeneous', 'manifolds', 'which', 'admit', 'nontrivial', 'einstein', 'with', 'skewtorsion', 'invariant', 'affine', 'connections', 'are', 'those', 'of', 'dimension', '7', 'that', 'is', 'mathbbs7mathrmsp', '2', 'mathrmsp1', 'mathbbr', 'p7mathrmsp2', 'mathrmsp1times', 'mathbbz_2', 'and', 'the', 'aloffwallach', 'space', 'mathfrakw7_11', 'mathrmsu3', 'mathrmu1', 'for', 'mathbbs7', 'and', 'mathbbr', 'p7', 'the', 'set', 'of', 'such', 'connections', 'is', 'in', 'one', 'to', 'one', 'correspondence', 'with', 'two', 'copies', 'of', 'the', 'conformal', 'linear', 'transformation', 'group', 'of', 'the', 'euclidean', 'space', 'while', 'it', 'is', 'strictly', 'bigger', 'for', 'mathfrakw7_11', 'in', 'addition', 'the', 'set', 'of', 'invariant', 'connections', 'with', 'totally', 'skewsymmetric', 'torsion', 'whose', 'ricci', 'tensor', 'is', 'multiple', 'of', 'the', 'metric', 'with', 'different', 'factors', 'on', 'the', 'canonical', 'vertical', 'and', 'horizontal', 'distributions', 'is', 'fully', 'described', 'on', 'every', '3sasakian', 'homogeneous', 'manifold', 'an', 'affine', 'connection', 'satisfying', 'these', 'conditions', 'is', 'distinguished', 'characterized', 'by', 'parallelizing', 'all', 'the', 'characteristic', 'vector', 'fields', 'associated', 'to', 'the', '3sasakian', 'structure', 'this', 'connection', 'is', 'einstein', 'with', 'skewtorsion', 'for', 'the', '7dimensional', 'examples', 'several', 'results', 'have', 'also', 'been', 'adapted', 'to', 'the', 'nonnecessarily', 'homogeneous', 'setting', 'in', 'this', 'case', 'the', 'above', 'mentioned', 'sets', 'of', 'affine', 'connections', 'are', 'in', 'general', 'only', 'proper', 'subsets', 'satisfying', 'the', 'properties']] | [-0.1973674519144943, 0.12553105895648528, -0.027607453088472848, 0.06056647240883833, -0.11597204169568916, -0.17048041058590574, -0.08663968459272346, 0.3860999084309513, -0.26636808700509756, -0.20695364325276702, 0.12145067680492656, -0.27155412120324834, -0.17203248979987254, 0.1647102500600609, -0.08180929671649433, 0.005210619035041388, 0.015750251450256703, 0.12442996814965047, -0.1446022566904187, -0.3213690197775184, 0.4743785909049108, -0.022374993811051052, 0.2514578826909124, -0.00999228867499689, 0.164607084771627, -0.03558375983949348, -0.03814891023296828, 0.04715441044448971, -0.14825278071227113, 0.10818283771658797, 0.25217875905942716, 0.07714745417748853, 0.16539517077923416, -0.34398642403020047, -0.18598287202997332, 0.1974455843452242, 0.09199185572682657, -0.004563276790970053, 0.020801989593927882, -0.30011623073697197, 0.09815252480798613, -0.0950117408879486, -0.1641793326792272, -0.07842901105142062, 0.041300594640519696, -0.027360856454620497, -0.19636158065836518, 0.013012666659461233, 0.09695516131488177, 0.08947981489350049, -0.10525949398534451, -0.07835767641740068, -0.06588096611809528, 0.07770530556267381, 0.0057481172649810714, 0.086779968332097, 0.06532697234589152, -0.05026691785724965, -0.12002471565955401, 0.3556171998320401, -0.0430659156756152, -0.3178618505334497, 0.17356502244843633, -0.12916319801345327, -0.17203223668235604, 0.13075924652984952, 0.08719657089106493, 0.10986792674384346, -0.09478940478837043, 0.18828584591235295, -0.10209955646057434, 0.04112582169735516, 0.10984212522801588, 0.016540295896153162, 0.13272170362908814, 0.09329567947905913, 0.12759781661011638, 0.11780366831144291, 0.021753659315282663, -0.12195041738319355, -0.36978461434917104, -0.19047535695433462, -0.12416191366413705, 0.14309593928188627, -0.15573680835656883, -0.18274365246575763, 0.3740084753284327, -0.028782530963552586, 0.1944512519212068, 0.10149315666372367, 0.19926774371502826, 0.030121970549143826, 0.06658838374295355, 0.11425370982511432, 0.17893423124089697, 0.21099171974967307, -0.0034839442385657922, -0.11720485112328134, -0.03706503046256766, 0.11425307412094003] |
1,801.10527 | Analysing Collective Behaviour in Temporal Networks Using Event Graphs
and Temporal Motifs | Historically studies of behaviour on networks have focused on the behaviour
of individuals (node-based) or on the aggregate behaviour of the entire
network. We propose a new method to decompose a temporal network into
macroscale components and to analyse the behaviour of these components, or
collectives of nodes, across time. This method utilises all available
information in the temporal network (i.e. no temporal aggregation), combining
both topological and temporal structure using temporal motifs and inter-event
times. This allows us create an embedding of a temporal network in order to
describe behaviour over time and at different timescales. We illustrate this
method using an example of digital communication data collected from an online
social network.
| cs.SI nlin.AO physics.soc-ph | historically studies of behaviour on networks have focused on the behaviour of individuals nodebased or on the aggregate behaviour of the entire network we propose a new method to decompose a temporal network into macroscale components and to analyse the behaviour of these components or collectives of nodes across time this method utilises all available information in the temporal network ie no temporal aggregation combining both topological and temporal structure using temporal motifs and interevent times this allows us create an embedding of a temporal network in order to describe behaviour over time and at different timescales we illustrate this method using an example of digital communication data collected from an online social network | [['historically', 'studies', 'of', 'behaviour', 'on', 'networks', 'have', 'focused', 'on', 'the', 'behaviour', 'of', 'individuals', 'nodebased', 'or', 'on', 'the', 'aggregate', 'behaviour', 'of', 'the', 'entire', 'network', 'we', 'propose', 'a', 'new', 'method', 'to', 'decompose', 'a', 'temporal', 'network', 'into', 'macroscale', 'components', 'and', 'to', 'analyse', 'the', 'behaviour', 'of', 'these', 'components', 'or', 'collectives', 'of', 'nodes', 'across', 'time', 'this', 'method', 'utilises', 'all', 'available', 'information', 'in', 'the', 'temporal', 'network', 'ie', 'no', 'temporal', 'aggregation', 'combining', 'both', 'topological', 'and', 'temporal', 'structure', 'using', 'temporal', 'motifs', 'and', 'interevent', 'times', 'this', 'allows', 'us', 'create', 'an', 'embedding', 'of', 'a', 'temporal', 'network', 'in', 'order', 'to', 'describe', 'behaviour', 'over', 'time', 'and', 'at', 'different', 'timescales', 'we', 'illustrate', 'this', 'method', 'using', 'an', 'example', 'of', 'digital', 'communication', 'data', 'collected', 'from', 'an', 'online', 'social', 'network']] | [-0.12365741429752425, 0.025684054055952737, -0.1258019719726259, 0.046482453662942964, -0.07280618140653691, -0.09160000617256421, 0.04008665770749774, 0.45335153797478006, -0.28161519731541995, -0.3006537323409136, 0.07800010666700505, -0.25693184988822876, -0.1838572937709263, 0.14593383457037834, -0.03595931967209796, 0.025429041124880314, 0.0418173127333846, 0.05832335370053586, -0.0024064521043839163, -0.2311977312610109, 0.31785754363967533, 0.018222912288221874, 0.3436762770278412, 0.008757242071033832, 0.1473455062654817, 0.02797006495019192, -0.08984497380688002, 0.038385824319751315, -0.087609590803224, 0.16820753855516382, 0.24938366604200973, 0.18703181930948376, 0.311562265655467, -0.5000579089187739, -0.24824240940149156, 0.10901863958784624, 0.14996510100747018, 0.09408559586869128, 0.05225912227577187, -0.31868812779226063, 0.07944743701240473, -0.16395361134945824, -0.04558632575106202, -0.10567495144756608, -0.015529451066660777, 0.03606875592908054, -0.23329395166722844, 0.04387810067763846, 0.023423121784601295, 0.09919373304664827, -0.034055591281605554, -0.02882972608826924, -0.002830395566936778, 0.22147884503366394, 0.024159949624159356, -0.06769528307057426, 0.087602670794647, -0.11465939005894031, -0.15676353391455977, 0.32156946061162706, -0.03348379910886778, -0.14122221646258576, 0.2184761851033392, -0.0776163369474377, -0.1486031859091957, 0.11560905621011268, 0.29867807038847294, 0.10955914813747401, -0.19879050150139896, -0.012579974134272913, -0.006272754729970505, 0.2574437336604062, 0.05080497330830743, 0.052992275261459054, 0.16458432687948898, 0.26175347530168663, 0.047716603533588475, 0.1390839899122192, -0.1114066090299993, -0.10256665002293232, -0.210513896995077, -0.111536805575158, -0.15924442976022857, 0.01984680247934241, -0.14253072364188388, -0.15703859563361397, 0.48291095718741417, 0.17112206933170296, 0.24138771466861822, 0.11217900847770036, 0.2909016517856926, 0.02675159980150822, 0.09458418445163325, 0.08365978011371274, 0.11749770678579807, 0.025904769772304256, 0.18212981146184334, -0.19504688081143653, 0.11482981008502018, 0.04074779939184194] |
1,801.10528 | Next-to-leading order QCD corrections to the decay of Higgs to vector
meson and Z boson | The exclusive decay of the Higgs boson to a vector meson ($ J/\psi $ or $
\Upsilon(1S) $) and $ Z $ boson is studied in this work. The decay amplitudes
are separated into two parts in a gauge invariant manner. The first part comes
from the direct coupling of the Higgs boson to the charm (bottom) quark and the
other from the $ HZZ^{*} $ or the loop-induced $ HZ\gamma^{*} $ vertexes in the
standard model. While the branching ratios from the direct channel are much
smaller than those of the indirect channel, their interference terms give
nontrivial contributions. We further calculate the QCD radiative corrections to
both channels, which reduce the total branching ratios by around 20% for both $
J/\psi $ and $ \Upsilon(1S) $ production. These results may help to check the
SM predictions of the $ H c\bar{c}(H b\bar{b}) $ coupling and to seek for hints
of new physics at the High Luminosity LHC or future hadron colliders.
| hep-ph | the exclusive decay of the higgs boson to a vector meson jpsi or upsilon1s and z boson is studied in this work the decay amplitudes are separated into two parts in a gauge invariant manner the first part comes from the direct coupling of the higgs boson to the charm bottom quark and the other from the hzz or the loopinduced hzgamma vertexes in the standard model while the branching ratios from the direct channel are much smaller than those of the indirect channel their interference terms give nontrivial contributions we further calculate the qcd radiative corrections to both channels which reduce the total branching ratios by around 20 for both jpsi and upsilon1s production these results may help to check the sm predictions of the h cbarch bbarb coupling and to seek for hints of new physics at the high luminosity lhc or future hadron colliders | [['the', 'exclusive', 'decay', 'of', 'the', 'higgs', 'boson', 'to', 'a', 'vector', 'meson', 'jpsi', 'or', 'upsilon1s', 'and', 'z', 'boson', 'is', 'studied', 'in', 'this', 'work', 'the', 'decay', 'amplitudes', 'are', 'separated', 'into', 'two', 'parts', 'in', 'a', 'gauge', 'invariant', 'manner', 'the', 'first', 'part', 'comes', 'from', 'the', 'direct', 'coupling', 'of', 'the', 'higgs', 'boson', 'to', 'the', 'charm', 'bottom', 'quark', 'and', 'the', 'other', 'from', 'the', 'hzz', 'or', 'the', 'loopinduced', 'hzgamma', 'vertexes', 'in', 'the', 'standard', 'model', 'while', 'the', 'branching', 'ratios', 'from', 'the', 'direct', 'channel', 'are', 'much', 'smaller', 'than', 'those', 'of', 'the', 'indirect', 'channel', 'their', 'interference', 'terms', 'give', 'nontrivial', 'contributions', 'we', 'further', 'calculate', 'the', 'qcd', 'radiative', 'corrections', 'to', 'both', 'channels', 'which', 'reduce', 'the', 'total', 'branching', 'ratios', 'by', 'around', '20', 'for', 'both', 'jpsi', 'and', 'upsilon1s', 'production', 'these', 'results', 'may', 'help', 'to', 'check', 'the', 'sm', 'predictions', 'of', 'the', 'h', 'cbarch', 'bbarb', 'coupling', 'and', 'to', 'seek', 'for', 'hints', 'of', 'new', 'physics', 'at', 'the', 'high', 'luminosity', 'lhc', 'or', 'future', 'hadron', 'colliders']] | [-0.06388017281886726, 0.24443882473183107, -0.06355407160757849, 0.163164714631969, -0.08352228627884634, -0.14468230474229954, 0.08006007103121852, 0.3073369505088011, -0.2206351187635111, -0.2338844004106287, -0.009039682877562584, -0.33941296133378596, 0.03800745442356557, 0.12359083087298356, 0.11466215709096765, 0.1095377573255475, 0.09494903184192842, 0.01130376863516612, -0.043565062107518315, -0.23985666462717808, 0.28762481653782196, 0.016242332793198117, 0.18749706356224846, 0.13770551674310372, -0.012591316125495997, 0.02115607478381581, -0.08762572315415489, -0.10030811664661111, -0.12559728927520417, 0.0817287166488089, 0.20281951421710714, 0.05392531481769242, 0.1283165844259401, -0.3367714655190094, -0.07251436764785815, 0.15719867675973434, 0.17723783912545402, 0.11634264440093929, -0.02939980890129833, -0.3449687907880504, 0.1375976926659087, -0.2126622667906117, -0.03547325775693872, -0.037574104535750635, -0.03109385812183051, -0.11649865599720713, -0.33585071760350965, 0.07130377591198489, -0.047448060029562665, -0.0015264653699625641, 0.019925625352125154, -0.23589010205604646, -0.08291296344984017, 0.05188256489234173, 0.14563341704851068, 0.06648901242173551, 0.1884095482017896, -0.21893740469455872, -0.21032810998101376, 0.41611153462563627, -0.09309113228724303, -0.1740204875440375, 0.19306017977124948, -0.21256043850316678, -0.11857358990976673, 0.1781653018910693, 0.2635978299850113, 0.033314296409303536, -0.18005763579874415, 0.12197421805467457, 0.020001065422946662, 0.13168462065219153, 0.05173103892155094, 0.11558243548433768, 0.21927989795421288, 0.1460892376681305, -0.018370598197391588, 0.07779239101793094, -0.08017645900182375, -0.08177537321789216, -0.4201368950690105, -0.1638400562024637, -0.03773861575221056, 0.07192886335382953, -0.06977952685213508, -0.06583531311081646, 0.37628474921523913, 0.08627681024388525, 0.30744977024613485, 0.04317992433908791, 0.3397290821455113, 0.11482055723820239, 0.0849594065348605, 0.04451589180437261, 0.3605879499060293, 0.19930512312168178, 0.13859697813582797, -0.25703523283001445, 0.02625206130722614, 0.05422768222282909] |
1,801.10529 | The Reconstruction of $f(\phi)R$ and Mimetic Gravity from Viable
Slow-roll Inflation | In this work, we extend the bottom-up reconstruction framework of $F(R)$
gravity to other modified gravities, and in particular for $f(\phi)R$ and
mimetic $F(R)$ gravities. We investigate which are the important conditions in
order for the method to work, and we study several viable cosmological
evolutions, focusing on the inflationary era. Particularly, for the $f(\phi)R$
theory case, we specify the functional form of the Hubble rate and of the
scalar-to-tensor ratio as a function of the $e$-foldings number and
accordingly, the rest of the physical quantities and also the slow-roll and the
corresponding observational indices can be calculated. The same method is
applied in the mimetic $F(R)$ gravity case, and in both cases we thoroughly
analyze the resulting free parameter space, in order to show that the viability
of the models presented is guaranteed and secondly that there is a wide range
of values of the free parameters for which the viability of the models occurs.
In addition, the reconstruction method is also studied in the context of
mimetic $F(R)=R$ gravity. As we demonstrate, the resulting theory is viable,
and also in this case, only the scalar-to-tensor ratio needs to be specified,
since the rest follow from this condition. Finally, we discuss in brief how the
reconstruction method could function for other modified gravities.
| gr-qc astro-ph.CO hep-th | in this work we extend the bottomup reconstruction framework of fr gravity to other modified gravities and in particular for fphir and mimetic fr gravities we investigate which are the important conditions in order for the method to work and we study several viable cosmological evolutions focusing on the inflationary era particularly for the fphir theory case we specify the functional form of the hubble rate and of the scalartotensor ratio as a function of the efoldings number and accordingly the rest of the physical quantities and also the slowroll and the corresponding observational indices can be calculated the same method is applied in the mimetic fr gravity case and in both cases we thoroughly analyze the resulting free parameter space in order to show that the viability of the models presented is guaranteed and secondly that there is a wide range of values of the free parameters for which the viability of the models occurs in addition the reconstruction method is also studied in the context of mimetic frr gravity as we demonstrate the resulting theory is viable and also in this case only the scalartotensor ratio needs to be specified since the rest follow from this condition finally we discuss in brief how the reconstruction method could function for other modified gravities | [['in', 'this', 'work', 'we', 'extend', 'the', 'bottomup', 'reconstruction', 'framework', 'of', 'fr', 'gravity', 'to', 'other', 'modified', 'gravities', 'and', 'in', 'particular', 'for', 'fphir', 'and', 'mimetic', 'fr', 'gravities', 'we', 'investigate', 'which', 'are', 'the', 'important', 'conditions', 'in', 'order', 'for', 'the', 'method', 'to', 'work', 'and', 'we', 'study', 'several', 'viable', 'cosmological', 'evolutions', 'focusing', 'on', 'the', 'inflationary', 'era', 'particularly', 'for', 'the', 'fphir', 'theory', 'case', 'we', 'specify', 'the', 'functional', 'form', 'of', 'the', 'hubble', 'rate', 'and', 'of', 'the', 'scalartotensor', 'ratio', 'as', 'a', 'function', 'of', 'the', 'efoldings', 'number', 'and', 'accordingly', 'the', 'rest', 'of', 'the', 'physical', 'quantities', 'and', 'also', 'the', 'slowroll', 'and', 'the', 'corresponding', 'observational', 'indices', 'can', 'be', 'calculated', 'the', 'same', 'method', 'is', 'applied', 'in', 'the', 'mimetic', 'fr', 'gravity', 'case', 'and', 'in', 'both', 'cases', 'we', 'thoroughly', 'analyze', 'the', 'resulting', 'free', 'parameter', 'space', 'in', 'order', 'to', 'show', 'that', 'the', 'viability', 'of', 'the', 'models', 'presented', 'is', 'guaranteed', 'and', 'secondly', 'that', 'there', 'is', 'a', 'wide', 'range', 'of', 'values', 'of', 'the', 'free', 'parameters', 'for', 'which', 'the', 'viability', 'of', 'the', 'models', 'occurs', 'in', 'addition', 'the', 'reconstruction', 'method', 'is', 'also', 'studied', 'in', 'the', 'context', 'of', 'mimetic', 'frr', 'gravity', 'as', 'we', 'demonstrate', 'the', 'resulting', 'theory', 'is', 'viable', 'and', 'also', 'in', 'this', 'case', 'only', 'the', 'scalartotensor', 'ratio', 'needs', 'to', 'be', 'specified', 'since', 'the', 'rest', 'follow', 'from', 'this', 'condition', 'finally', 'we', 'discuss', 'in', 'brief', 'how', 'the', 'reconstruction', 'method', 'could', 'function', 'for', 'other', 'modified', 'gravities']] | [-0.08433619061175943, 0.08996267857358609, -0.08996567630565891, 0.09830898642387659, -0.05760493938632692, -0.1105773788789792, -0.017259881480283616, 0.32891404304096356, -0.2241435446036614, -0.3232745869187464, 0.09285160781876575, -0.20239169571209245, -0.1628317668888213, 0.18491974904579458, -0.07531499270475948, 0.025582910989257225, -0.006689736939461849, 0.054148746306233314, -0.09319277410613042, -0.2641069475435173, 0.32901065897144305, 0.08405714122160712, 0.24395592699820723, 0.0436969401758756, 0.06096435976040628, -0.05347307920499452, -0.016671164681543116, 0.06282688954904876, -0.2046868613397917, 0.07411795917019318, 0.20171732969504425, 0.1532588057610572, 0.23786878362994326, -0.38891267025338433, -0.26016449244370876, 0.11949120558881, 0.12761756968162258, 0.13205366034526378, -0.061605339036997685, -0.22650528633009606, 0.09011409984396718, -0.17973641646921495, -0.103216198803944, -0.06832888382965717, 0.0014989444481156697, -0.017646289887516018, -0.2753987553699168, 0.09051852188142186, -0.012035113041263038, -0.02820064607032827, -0.10357113869286308, -0.0863367730858257, -0.014287168411407446, 0.09669204177030266, 0.1072525892604717, 0.005261641280251233, 0.07840308858838942, -0.14828916411154913, -0.033574386726124825, 0.4231999810854687, -0.1329433782981974, -0.2157177786412431, 0.16835492667600635, -0.14738518659517205, -0.15630857561166597, 0.006588292683237537, 0.15069834645957225, 0.17442185285492479, -0.1369111453918479, 0.14351404468021922, 0.03251541359350085, 0.13338486253986762, 0.07245317371083405, 0.03835899871556419, 0.20791189735929402, 0.13372738059353362, 0.01854178599662922, 0.133880534382778, -0.09148787421056843, -0.08476299707882246, -0.37419862700539214, -0.1768766859139394, -0.14012055900535397, -0.030135730081281373, -0.1304435490114586, -0.13975499343196643, 0.4310438291520037, 0.20054189270693007, 0.1587388849377667, 0.06770606077097739, 0.2747655882996237, 0.1265954479594741, 0.04833546849555188, 0.03612156409474316, 0.30550147075354006, 0.11033208544635884, 0.09093563350800982, -0.23410703714884748, 0.003136418291985571, 0.05865640808157971] |
1,801.1053 | Can an unbroken flavour symmetry provide an approximate description of
lepton masses and mixing? | We provide a complete answer to the following question: what are the flavour
groups and representations providing, in the symmetric limit, an approximate
description of lepton masses and mixings? We assume that neutrinos masses are
described by the Weinberg operator. We show that the pattern of lepton masses
and mixings only depends on the dimension, type (real, pseudoreal, complex),
and equivalence of the irreducible components of the flavour representation,
and we find only six viable cases. In all cases the neutrinos are either
anarchical or have an inverted hierarchical spectrum. In the context of SU(5)
unification, only the anarchical option is allowed. Therefore, if the hint of a
normal hierarchical spectrum were confirmed, we would conclude (under the above
assumption) that symmetry breaking effects must play a primary role in the
understanding of neutrino flavour observables. In order to obtain the above
results, we develop a simple algorithm to determine the form of the lepton
masses and mixings directly from the structure of the decomposition of the
flavour representation in irreducible components, without the need to specify
the form of the lepton mass matrices.
| hep-ph | we provide a complete answer to the following question what are the flavour groups and representations providing in the symmetric limit an approximate description of lepton masses and mixings we assume that neutrinos masses are described by the weinberg operator we show that the pattern of lepton masses and mixings only depends on the dimension type real pseudoreal complex and equivalence of the irreducible components of the flavour representation and we find only six viable cases in all cases the neutrinos are either anarchical or have an inverted hierarchical spectrum in the context of su5 unification only the anarchical option is allowed therefore if the hint of a normal hierarchical spectrum were confirmed we would conclude under the above assumption that symmetry breaking effects must play a primary role in the understanding of neutrino flavour observables in order to obtain the above results we develop a simple algorithm to determine the form of the lepton masses and mixings directly from the structure of the decomposition of the flavour representation in irreducible components without the need to specify the form of the lepton mass matrices | [['we', 'provide', 'a', 'complete', 'answer', 'to', 'the', 'following', 'question', 'what', 'are', 'the', 'flavour', 'groups', 'and', 'representations', 'providing', 'in', 'the', 'symmetric', 'limit', 'an', 'approximate', 'description', 'of', 'lepton', 'masses', 'and', 'mixings', 'we', 'assume', 'that', 'neutrinos', 'masses', 'are', 'described', 'by', 'the', 'weinberg', 'operator', 'we', 'show', 'that', 'the', 'pattern', 'of', 'lepton', 'masses', 'and', 'mixings', 'only', 'depends', 'on', 'the', 'dimension', 'type', 'real', 'pseudoreal', 'complex', 'and', 'equivalence', 'of', 'the', 'irreducible', 'components', 'of', 'the', 'flavour', 'representation', 'and', 'we', 'find', 'only', 'six', 'viable', 'cases', 'in', 'all', 'cases', 'the', 'neutrinos', 'are', 'either', 'anarchical', 'or', 'have', 'an', 'inverted', 'hierarchical', 'spectrum', 'in', 'the', 'context', 'of', 'su5', 'unification', 'only', 'the', 'anarchical', 'option', 'is', 'allowed', 'therefore', 'if', 'the', 'hint', 'of', 'a', 'normal', 'hierarchical', 'spectrum', 'were', 'confirmed', 'we', 'would', 'conclude', 'under', 'the', 'above', 'assumption', 'that', 'symmetry', 'breaking', 'effects', 'must', 'play', 'a', 'primary', 'role', 'in', 'the', 'understanding', 'of', 'neutrino', 'flavour', 'observables', 'in', 'order', 'to', 'obtain', 'the', 'above', 'results', 'we', 'develop', 'a', 'simple', 'algorithm', 'to', 'determine', 'the', 'form', 'of', 'the', 'lepton', 'masses', 'and', 'mixings', 'directly', 'from', 'the', 'structure', 'of', 'the', 'decomposition', 'of', 'the', 'flavour', 'representation', 'in', 'irreducible', 'components', 'without', 'the', 'need', 'to', 'specify', 'the', 'form', 'of', 'the', 'lepton', 'mass', 'matrices']] | [-0.11246871520542419, 0.19341003822315225, -0.03800568167808587, 0.15573222476434792, -0.10319697796164648, -0.1185186815691059, 0.04655369902130864, 0.3467270927098782, -0.21969612640500796, -0.29255581854680635, 0.07249777392312155, -0.24486900703303274, -0.08497047120529358, 0.11537933374790516, 0.009016476493106102, -0.007521344860003371, 0.033627649280748774, 0.03342107008859824, -0.09976986492351304, -0.22947778534549085, 0.3544765906243929, -0.0009414158311024632, 0.22735445644787472, 0.06015014435821365, 0.08397353173527138, -0.03312645526223249, -0.05369030970462557, -0.09048491574268432, -0.06833964594795322, 0.08189926004042322, 0.2041261379920837, 0.12784566405942946, 0.11525049119043852, -0.39460919516505266, -0.1467107826611027, 0.18765846025148084, 0.1525525286586186, 0.09089604188035161, -0.06382249627305377, -0.27368231840512675, 0.11100389069748495, -0.19055012738807936, -0.1578828284501746, -0.09661837063891732, -0.036982862263634474, -0.07603247398219537, -0.33228246127312205, 0.06894468218493073, 0.04832391789355113, 0.007999671926802916, -0.043868879843300776, -0.15414887041096453, -0.040419161203317344, 0.12265917039843297, 0.11636719923313629, -0.06072660382968657, 0.09021008951553401, -0.16178658746344887, -0.13152399121621705, 0.43672344831334753, -0.028778345333589445, -0.21469394158592206, 0.14152745783149326, -0.19031001664141356, -0.18498284168511062, 0.0762922151884793, 0.16893255112960975, 0.06673028307167166, -0.147479748401763, 0.15494687586100475, -0.1254549693549052, 0.15666958597822764, 0.061552161657069206, 0.010838219108890094, 0.25804215642805817, 0.149641562567052, 0.06288940730970037, 0.006007306807947791, -0.02559753823595162, -0.036576787801965584, -0.3675661196972689, -0.12227231805445626, -0.10136590435982014, 0.08478888054394149, -0.08553340163732924, -0.12057160195874293, 0.4499924133719026, 0.12508361009784733, 0.23776855660885896, 0.03802238580892268, 0.2542648874147309, 0.08758142338837901, 0.08165046246216187, 0.055901201330530254, 0.26151950289647136, 0.15285163978367802, 0.05146485046007792, -0.22127295786934986, 0.0279064034491413, 0.10883616097397981] |
1,801.10531 | A statistical mechanical approach to restricted integer partition
functions | The main aim of this paper is twofold: (1) Suggesting a statistical
mechanical approach to the calculation of the generating function of restricted
integer partition functions which count the number of partitions --- a way of
writing an integer as a sum of other integers under certain restrictions. In
this approach, the generating function of restricted integer partition
functions is constructed from the canonical partition functions of various
quantum gases. (2) Introducing a new type of restricted integer partition
functions corresponding to general statistics which is a generalization of
Gentile statistics in statistical mechanics; many kinds of restricted integer
partition functions are special cases of this restricted integer partition
function. Moreover, with statistical mechanics as a bridge, we reveals a
mathematical fact: the generating function of restricted integer partition
function is just the symmetric function which is a class of functions being
invariant under the action of permutation groups. Using the approach, we
provide some expressions of restricted integer partition functions as examples.
| cond-mat.stat-mech | the main aim of this paper is twofold 1 suggesting a statistical mechanical approach to the calculation of the generating function of restricted integer partition functions which count the number of partitions a way of writing an integer as a sum of other integers under certain restrictions in this approach the generating function of restricted integer partition functions is constructed from the canonical partition functions of various quantum gases 2 introducing a new type of restricted integer partition functions corresponding to general statistics which is a generalization of gentile statistics in statistical mechanics many kinds of restricted integer partition functions are special cases of this restricted integer partition function moreover with statistical mechanics as a bridge we reveals a mathematical fact the generating function of restricted integer partition function is just the symmetric function which is a class of functions being invariant under the action of permutation groups using the approach we provide some expressions of restricted integer partition functions as examples | [['the', 'main', 'aim', 'of', 'this', 'paper', 'is', 'twofold', '1', 'suggesting', 'a', 'statistical', 'mechanical', 'approach', 'to', 'the', 'calculation', 'of', 'the', 'generating', 'function', 'of', 'restricted', 'integer', 'partition', 'functions', 'which', 'count', 'the', 'number', 'of', 'partitions', 'a', 'way', 'of', 'writing', 'an', 'integer', 'as', 'a', 'sum', 'of', 'other', 'integers', 'under', 'certain', 'restrictions', 'in', 'this', 'approach', 'the', 'generating', 'function', 'of', 'restricted', 'integer', 'partition', 'functions', 'is', 'constructed', 'from', 'the', 'canonical', 'partition', 'functions', 'of', 'various', 'quantum', 'gases', '2', 'introducing', 'a', 'new', 'type', 'of', 'restricted', 'integer', 'partition', 'functions', 'corresponding', 'to', 'general', 'statistics', 'which', 'is', 'a', 'generalization', 'of', 'gentile', 'statistics', 'in', 'statistical', 'mechanics', 'many', 'kinds', 'of', 'restricted', 'integer', 'partition', 'functions', 'are', 'special', 'cases', 'of', 'this', 'restricted', 'integer', 'partition', 'function', 'moreover', 'with', 'statistical', 'mechanics', 'as', 'a', 'bridge', 'we', 'reveals', 'a', 'mathematical', 'fact', 'the', 'generating', 'function', 'of', 'restricted', 'integer', 'partition', 'function', 'is', 'just', 'the', 'symmetric', 'function', 'which', 'is', 'a', 'class', 'of', 'functions', 'being', 'invariant', 'under', 'the', 'action', 'of', 'permutation', 'groups', 'using', 'the', 'approach', 'we', 'provide', 'some', 'expressions', 'of', 'restricted', 'integer', 'partition', 'functions', 'as', 'examples']] | [-0.1298167206013552, 0.10451949692489709, -0.1070216756808445, 0.09465196122340629, -0.06964985551140099, -0.1403214742636515, 0.037994096833884855, 0.2837796136909337, -0.30713755513518404, -0.2763224183064368, 0.045116678785739675, -0.24421860729372935, -0.21386428108513586, 0.1628809548155577, -0.03243021050721039, 0.1089765156481277, -0.0014221907922434677, 0.057211706827482334, -0.12460709199953227, -0.24727979630668773, 0.33526995215984634, -0.029273752928682728, 0.23966191054816233, 0.027626630544725715, 0.10510149110901963, 0.055792788397175844, -0.0006249118887353688, 0.032619781007516946, -0.12164588103553763, 0.11754291795372365, 0.2557311086372162, 0.1567521573814713, 0.31394904720838424, -0.36757625502039804, -0.14476246687434155, 0.16385258112482173, 0.11225331186627348, 0.04980105588882357, -0.011737095105841203, -0.1802925810786999, 0.09365472618199779, -0.17194086039599812, -0.13038596560902618, -0.05029945935835533, 0.03457753639955671, 0.05398238981487574, -0.30510146067949173, 0.033504974847245544, 0.05950530142419868, 0.08467342846433669, -0.047016608475615486, -0.19569557629177853, 0.044374836714403634, 0.1046903644901137, -0.0004260433208266342, 0.07165965407707349, 0.08042762749598442, -0.15057573166825336, -0.13258108010021163, 0.3809724223432074, 0.027696852171276178, -0.31996863479093635, 0.13204521921543796, -0.14107284652368154, -0.20482561603349483, 0.09108017376454455, 0.11864579172178322, 0.16260111426796625, -0.11465612290726032, 0.12780149097922316, -0.1359996493405628, 0.12378454076221075, 0.0815655392807345, 0.040593807003820134, 0.21847064562686605, 0.07153913601485576, 0.046720455632398454, 0.26744607181243746, 0.015595126511920014, -0.10296895802250983, -0.3613525662617183, -0.15933128567067562, -0.26685168682080174, 0.11466758647203491, -0.09485936612120749, -0.2381604337665241, 0.4225535823641644, 0.07428982159421768, 0.16417178150875794, 0.15822348377974935, 0.24986810202675838, 0.1971388242680315, 0.07051062300502334, -0.014163377520881225, 0.06933179169115007, 0.13167569478456345, -0.03613067421786211, -0.14225940289871228, 0.023970622675677324, 0.1470127529838341] |
1,801.10532 | On the algebraic construction of sparse multilevel approximations of
elliptic tensor product problems | We consider the solution of elliptic problems on the tensor product of two
physical domains as e.g. present in the approximation of the solution
covariance of elliptic partial differential equations with random input.
Previous sparse approximation approaches used a geometrically constructed
multilevel hierarchy. Instead, we construct this hierarchy for a given
discretized problem by means of the algebraic multigrid method (AMG). Thereby,
we are able to apply the sparse grid combination technique to problems given on
complex geometries and for discretizations arising from unstructured grids,
which was not feasible before. Numerical results show that our algebraic
construction exhibits the same convergence behaviour as the geometric
construction, while being applicable even in black-box type PDE solvers.
| math.NA | we consider the solution of elliptic problems on the tensor product of two physical domains as eg present in the approximation of the solution covariance of elliptic partial differential equations with random input previous sparse approximation approaches used a geometrically constructed multilevel hierarchy instead we construct this hierarchy for a given discretized problem by means of the algebraic multigrid method amg thereby we are able to apply the sparse grid combination technique to problems given on complex geometries and for discretizations arising from unstructured grids which was not feasible before numerical results show that our algebraic construction exhibits the same convergence behaviour as the geometric construction while being applicable even in blackbox type pde solvers | [['we', 'consider', 'the', 'solution', 'of', 'elliptic', 'problems', 'on', 'the', 'tensor', 'product', 'of', 'two', 'physical', 'domains', 'as', 'eg', 'present', 'in', 'the', 'approximation', 'of', 'the', 'solution', 'covariance', 'of', 'elliptic', 'partial', 'differential', 'equations', 'with', 'random', 'input', 'previous', 'sparse', 'approximation', 'approaches', 'used', 'a', 'geometrically', 'constructed', 'multilevel', 'hierarchy', 'instead', 'we', 'construct', 'this', 'hierarchy', 'for', 'a', 'given', 'discretized', 'problem', 'by', 'means', 'of', 'the', 'algebraic', 'multigrid', 'method', 'amg', 'thereby', 'we', 'are', 'able', 'to', 'apply', 'the', 'sparse', 'grid', 'combination', 'technique', 'to', 'problems', 'given', 'on', 'complex', 'geometries', 'and', 'for', 'discretizations', 'arising', 'from', 'unstructured', 'grids', 'which', 'was', 'not', 'feasible', 'before', 'numerical', 'results', 'show', 'that', 'our', 'algebraic', 'construction', 'exhibits', 'the', 'same', 'convergence', 'behaviour', 'as', 'the', 'geometric', 'construction', 'while', 'being', 'applicable', 'even', 'in', 'blackbox', 'type', 'pde', 'solvers']] | [-0.07894052525794984, -0.006036322090126898, -0.07525935200569422, 0.07446029401971432, -0.09808801734900993, -0.15121047112928784, -0.012307691146903063, 0.34280357228025143, -0.33486559436373087, -0.293546380803151, 0.17319060898304958, -0.23159456540546988, -0.1638875830999535, 0.21779192511812256, -0.07842986982963655, 0.12151614383834859, 0.09030821254456659, -0.018796832600365514, -0.1386497043883023, -0.2565097944831233, 0.36655917713499586, -0.031901189300191146, 0.25259328726679087, -0.02188375728589523, 0.148850367116013, -0.018770530332466992, -0.04809265958357845, 0.04992851408846352, -0.08955095770759963, 0.13764975401471652, 0.3092783916093733, 0.1108182314682104, 0.2458532394905215, -0.448752329490431, -0.20703997671472557, 0.07288382423069814, 0.16316177409139726, 0.12751329459513172, -0.04963272957576682, -0.24374556028000685, 0.08043426296916668, -0.1340874939468568, -0.15323724403329517, -0.13579098917948812, -0.07000696299719097, 0.03687475245071413, -0.3094846748342009, 0.05230363793671131, 0.0694158304563683, 0.036940538854864625, -0.042966493895358365, -0.13055745751556494, 0.04317624559423522, 0.0598989888863719, -0.012491447266960597, -0.03412024754544963, 0.0443003226476519, -0.06871929707046112, -0.12290619994999598, 0.4057438556752775, -0.042040832485477235, -0.3140031304048455, 0.15809067837570023, -0.05795263004003336, -0.137065696351878, 0.14192772788886468, 0.20367241115511758, 0.18191051325841767, -0.09201569948750346, 0.12700627911582832, -0.06430440187130286, 0.14269233438813977, 0.0541184531322316, -0.038765044158081643, 0.07916881208024595, 0.1564626990210103, 0.12862944865761244, 0.13013910397117875, 0.003019208623015362, -0.15655798054522957, -0.28419321107313683, -0.06955437765952767, -0.17930545559881822, 0.05560226615773939, -0.1488063629292731, -0.24669286984464397, 0.37848188877105715, 0.13521937090579583, 0.15592318683427395, 0.08995948102415044, 0.30470612838297434, 0.14287609926769104, 0.03023180911398452, 0.07132925150673027, 0.14503965614282566, 0.16375751187822418, 0.12679068395341545, -0.20278610529671626, 0.05425210860355393, 0.18740322930009468] |
1,801.10533 | The Barycenter Method for Direct Optimization | A randomized version of the recently developed barycenter method for
derivative-free optimization has desirable properties of a gradient search. We
develop a complex version to avoid evaluations at high-gradient points. The
method, applicable to non-smooth functions, is parallelizable in a natural way
and shown to be robust under noisy measurements.
| math.OC | a randomized version of the recently developed barycenter method for derivativefree optimization has desirable properties of a gradient search we develop a complex version to avoid evaluations at highgradient points the method applicable to nonsmooth functions is parallelizable in a natural way and shown to be robust under noisy measurements | [['a', 'randomized', 'version', 'of', 'the', 'recently', 'developed', 'barycenter', 'method', 'for', 'derivativefree', 'optimization', 'has', 'desirable', 'properties', 'of', 'a', 'gradient', 'search', 'we', 'develop', 'a', 'complex', 'version', 'to', 'avoid', 'evaluations', 'at', 'highgradient', 'points', 'the', 'method', 'applicable', 'to', 'nonsmooth', 'functions', 'is', 'parallelizable', 'in', 'a', 'natural', 'way', 'and', 'shown', 'to', 'be', 'robust', 'under', 'noisy', 'measurements']] | [-0.05769084356492385, -0.022159628439694642, -0.15859835312701762, 0.1023144015786238, -0.1097267235442996, -0.18259824097156524, 0.03763650245964527, 0.42588319808244707, -0.2920149710029364, -0.2664357105642557, 0.10931020041694865, -0.18804419573396444, -0.2022332637757063, 0.2556600847048685, -0.14807896053418518, 0.13447176616638898, 0.10001857690513134, -0.03079431764781475, -0.11908019991591573, -0.2458300280570984, 0.22319535885177175, 0.05831314947456121, 0.26328989915549755, -0.0006003859138581902, 0.14966662161052227, 0.001066442052833736, 0.011664719646796584, 0.08003210146533092, -0.07951039109379053, 0.14474977510049938, 0.27017090484499934, 0.15058409936726094, 0.3617494174838066, -0.36401820901781323, -0.17999158319085837, 0.13407710257917643, 0.09654299879446626, 0.12019171208143234, -0.10834565693512559, -0.2702368722856045, 0.13135933320969342, -0.08670431302860379, -0.15149287923239171, -0.20165446527302266, -0.03482550394255668, -0.012558839898556471, -0.3703149110265076, 0.022737429048866033, 0.0013787294318899513, 0.02002104287967086, -0.008938758252188563, -0.08617016058415175, 0.08454826889559626, -0.0060435329005122185, 0.001785707357339561, 0.08615413947962225, 0.13513114158995448, -0.050783796305768195, -0.1383292467240244, 0.392772009242326, -0.06598305568099022, -0.26577736432664095, 0.2025857699936023, -0.03445661765523255, -0.19041955195367335, 0.15770698728971183, 0.24549624575302004, 0.22583725679665803, -0.1849720859900117, 0.08805550568620674, -0.03644996112212539, 0.12276248873909935, 0.017357519157230855, -0.012104085609316827, 0.10597192358691246, 0.16344278359785677, 0.21199326872825622, 0.17175278855254875, -0.05715951651334763, -0.11852733213454485, -0.2283454742655158, -0.1503857085853815, -0.18125513985753058, -0.01201292431447655, -0.03254540353984339, -0.18515477538283448, 0.4187978390604258, 0.14998204194009304, 0.1847473370283842, 0.06644515115767717, 0.3395412520319223, 0.12111864799400791, 0.10107016768306494, 0.11594391162507237, 0.16980525434017182, 0.15371544552966954, 0.11212008204311133, -0.16397083987947553, 0.08392290523275733, 0.11117592470720411] |
1,801.10534 | Fast magnetic reconnection: The "ideal" tearing instability in classic,
Hall, and relativistic plasmas | Magnetic reconnection is believed to be the driver of many explosive
phenomena in Astrophysics, from solar to gamma-ray flares in magnetars and in
the Crab nebula. However, reconnection rates from classic MHD models are far
too slow to explain such observations. Recently, it was realized that when a
current sheet gets sufficiently thin, the reconnection rate of the tearing
instability becomes "ideal", in the sense that the current sheet destabilizes
on the "macroscopic" Alfv\'enic timescales, regardless of the Lundquist number
of the plasma. Here we present 2D compressible MHD simulations in the
classical, Hall, and relativistic regimes. In particular, the onset of
secondary tearing instabilities is investigated within Hall-MHD for the first
time. In the frame of relativistic MHD, we summarize the main results from Del
Zanna et al. [1]: the relativistic tearing instability is found to be extremely
fast, with reconnection rates of the order of the inverse of the light crossing
time, as required to explain the high-energy explosive phenomena.
| physics.plasm-ph astro-ph.HE astro-ph.SR physics.space-ph | magnetic reconnection is believed to be the driver of many explosive phenomena in astrophysics from solar to gammaray flares in magnetars and in the crab nebula however reconnection rates from classic mhd models are far too slow to explain such observations recently it was realized that when a current sheet gets sufficiently thin the reconnection rate of the tearing instability becomes ideal in the sense that the current sheet destabilizes on the macroscopic alfvenic timescales regardless of the lundquist number of the plasma here we present 2d compressible mhd simulations in the classical hall and relativistic regimes in particular the onset of secondary tearing instabilities is investigated within hallmhd for the first time in the frame of relativistic mhd we summarize the main results from del zanna et al 1 the relativistic tearing instability is found to be extremely fast with reconnection rates of the order of the inverse of the light crossing time as required to explain the highenergy explosive phenomena | [['magnetic', 'reconnection', 'is', 'believed', 'to', 'be', 'the', 'driver', 'of', 'many', 'explosive', 'phenomena', 'in', 'astrophysics', 'from', 'solar', 'to', 'gammaray', 'flares', 'in', 'magnetars', 'and', 'in', 'the', 'crab', 'nebula', 'however', 'reconnection', 'rates', 'from', 'classic', 'mhd', 'models', 'are', 'far', 'too', 'slow', 'to', 'explain', 'such', 'observations', 'recently', 'it', 'was', 'realized', 'that', 'when', 'a', 'current', 'sheet', 'gets', 'sufficiently', 'thin', 'the', 'reconnection', 'rate', 'of', 'the', 'tearing', 'instability', 'becomes', 'ideal', 'in', 'the', 'sense', 'that', 'the', 'current', 'sheet', 'destabilizes', 'on', 'the', 'macroscopic', 'alfvenic', 'timescales', 'regardless', 'of', 'the', 'lundquist', 'number', 'of', 'the', 'plasma', 'here', 'we', 'present', '2d', 'compressible', 'mhd', 'simulations', 'in', 'the', 'classical', 'hall', 'and', 'relativistic', 'regimes', 'in', 'particular', 'the', 'onset', 'of', 'secondary', 'tearing', 'instabilities', 'is', 'investigated', 'within', 'hallmhd', 'for', 'the', 'first', 'time', 'in', 'the', 'frame', 'of', 'relativistic', 'mhd', 'we', 'summarize', 'the', 'main', 'results', 'from', 'del', 'zanna', 'et', 'al', '1', 'the', 'relativistic', 'tearing', 'instability', 'is', 'found', 'to', 'be', 'extremely', 'fast', 'with', 'reconnection', 'rates', 'of', 'the', 'order', 'of', 'the', 'inverse', 'of', 'the', 'light', 'crossing', 'time', 'as', 'required', 'to', 'explain', 'the', 'highenergy', 'explosive', 'phenomena']] | [-0.14378374215520137, 0.21573335215460832, -0.019546371828232902, 0.13149172255272093, -0.06307305855228117, -0.07887641062822055, -0.03646228452397073, 0.30108305955029746, -0.26228156926708274, -0.29838243687962307, 0.0739383280002742, -0.21146047270546356, -0.08482612033639057, 0.2636024057980121, -0.020867255805232736, 0.039918162319579245, 0.07107856136137321, -0.04999871441036647, 0.002421609009616077, -0.19265447176395006, 0.26419831811806854, 0.15350842745945914, 0.24549993783247048, -0.01740185808631833, 0.034846882074985104, -0.12910907741716524, 0.02645156742648486, 0.025989572161141738, -0.16615745617740754, -0.022363005533676455, 0.22203953833316822, 0.05995116411438097, 0.24361253781589093, -0.5318093183680357, -0.24842038401546257, -0.011669810770803856, 0.18637406040431448, 0.11050155728963422, -0.019302872240429824, -0.20764539455477563, 0.07703841477091317, -0.17104685061645727, -0.13790865099333502, 0.03617118546210321, 0.057078667634661184, 0.06575314285460698, -0.28979002450841457, 0.10861831497010073, 0.0910219244176039, 0.03759005467010731, -0.10054969452723952, -0.008968390553131884, -0.048525904655962446, 0.035084240239316215, 0.15576083421919862, 0.06012640067341703, 0.1421118406291453, -0.18165733042334056, -0.12395206617728957, 0.41443883080357385, -0.001865566340936233, -0.0742513249616748, 0.24263360585879395, -0.2719701067257075, -0.1163445760116533, 0.19876472254134256, 0.14633483080952256, 0.10394755307653988, -0.07081406155249383, 0.04717466427677276, -0.04356579575687647, 0.09093695438903883, 0.04809910004216902, -0.02403306007963019, 0.2556708215686987, 0.20951432580369767, -0.015573878376241659, 0.09025641600637306, -0.1807403436338782, -0.06000178682015645, -0.2963939021502472, -0.13155426888189128, -0.14597881523846293, 0.0920742293431734, -0.03747444366155922, -0.1815402458485124, 0.384826352480615, 0.2017600673152404, 0.15768019189586702, -0.0628284026529456, 0.2923082717465105, 0.13514936754385148, 0.021546633046028423, 0.1738833890348259, 0.34312526171992497, 0.1752580020714689, 0.1888556820298236, -0.2547703368149491, 0.07952650038548457, 0.10357158939227645] |
1,801.10535 | Comparison of coherence area measurement techniques for bright entangled
twin beams | Quantum states of light with multiple spatial modes are fundamental for
quantum imaging and parallel quantum information processing. Thus, their
characterization, which can be achieved through measurements of the coherence
area, is an important area of research. We present a comparative study between
two different measurement techniques for the coherence area of bright entangled
twin beams of light generated with a four-wave mixing process in a hot rubidium
vapor cell. The first one provides a direct characterization of the size of the
coherence area and is based on correlation measurements between spatial
intensity fluctuations of the twin beams with an electron-multiplying
charge-coupled-device camera. The second one provides an indirect measure and
is based on a noise analysis of different spatial regions of the twin beams in
the time domain with a single photodiode. We show that the indirect technique,
which can be implemented with a significantly less complicated measurement
scheme, gives an estimate of the size of the coherence area consistent with the
direct measurement technique performed in the spatial domain.
| physics.optics quant-ph | quantum states of light with multiple spatial modes are fundamental for quantum imaging and parallel quantum information processing thus their characterization which can be achieved through measurements of the coherence area is an important area of research we present a comparative study between two different measurement techniques for the coherence area of bright entangled twin beams of light generated with a fourwave mixing process in a hot rubidium vapor cell the first one provides a direct characterization of the size of the coherence area and is based on correlation measurements between spatial intensity fluctuations of the twin beams with an electronmultiplying chargecoupleddevice camera the second one provides an indirect measure and is based on a noise analysis of different spatial regions of the twin beams in the time domain with a single photodiode we show that the indirect technique which can be implemented with a significantly less complicated measurement scheme gives an estimate of the size of the coherence area consistent with the direct measurement technique performed in the spatial domain | [['quantum', 'states', 'of', 'light', 'with', 'multiple', 'spatial', 'modes', 'are', 'fundamental', 'for', 'quantum', 'imaging', 'and', 'parallel', 'quantum', 'information', 'processing', 'thus', 'their', 'characterization', 'which', 'can', 'be', 'achieved', 'through', 'measurements', 'of', 'the', 'coherence', 'area', 'is', 'an', 'important', 'area', 'of', 'research', 'we', 'present', 'a', 'comparative', 'study', 'between', 'two', 'different', 'measurement', 'techniques', 'for', 'the', 'coherence', 'area', 'of', 'bright', 'entangled', 'twin', 'beams', 'of', 'light', 'generated', 'with', 'a', 'fourwave', 'mixing', 'process', 'in', 'a', 'hot', 'rubidium', 'vapor', 'cell', 'the', 'first', 'one', 'provides', 'a', 'direct', 'characterization', 'of', 'the', 'size', 'of', 'the', 'coherence', 'area', 'and', 'is', 'based', 'on', 'correlation', 'measurements', 'between', 'spatial', 'intensity', 'fluctuations', 'of', 'the', 'twin', 'beams', 'with', 'an', 'electronmultiplying', 'chargecoupleddevice', 'camera', 'the', 'second', 'one', 'provides', 'an', 'indirect', 'measure', 'and', 'is', 'based', 'on', 'a', 'noise', 'analysis', 'of', 'different', 'spatial', 'regions', 'of', 'the', 'twin', 'beams', 'in', 'the', 'time', 'domain', 'with', 'a', 'single', 'photodiode', 'we', 'show', 'that', 'the', 'indirect', 'technique', 'which', 'can', 'be', 'implemented', 'with', 'a', 'significantly', 'less', 'complicated', 'measurement', 'scheme', 'gives', 'an', 'estimate', 'of', 'the', 'size', 'of', 'the', 'coherence', 'area', 'consistent', 'with', 'the', 'direct', 'measurement', 'technique', 'performed', 'in', 'the', 'spatial', 'domain']] | [-0.1255382666342527, 0.16111486928016003, -0.10828169343764321, 0.007150718967527051, -0.011935102848651988, -0.12965424780663082, 0.0424482243473244, 0.4023534474044777, -0.25469198398705983, -0.31076830734460675, 0.09512831010700513, -0.2618932073979437, -0.06597638978351898, 0.25299164450220896, -0.03797144700408156, 0.05081105605993224, 0.06344653842752876, 0.013437627918190427, -0.049691537760194034, -0.173749049504598, 0.28622129700713034, 0.06609291235347176, 0.3363573577320367, 0.05746885684280716, 0.12582823194628745, 0.022226551563985515, -0.06588826731544489, -0.01042467790889984, -0.09480047565824468, 0.16225998307549672, 0.20071037917544968, 0.10993636318084876, 0.2550248185401423, -0.41713903440238786, -0.22797900938009572, 0.08510961815475197, 0.1187615603867548, 0.10656259459312678, -0.07786055779144473, -0.3027732660095289, 0.027845848798316124, -0.0803072917212498, -0.08913027698838571, -0.026910234079287762, -0.024538136833505322, -0.008660583529479758, -0.2824826654079452, 0.07269950848268836, 0.02663604837531845, 0.08524227645574954, 0.008222512116557673, -0.05511189219187836, 0.0268340063572736, 0.12525112197968608, -0.022080271009373483, 0.012759599372423226, 0.12027150649599165, -0.11166576449132977, -0.13734836916661172, 0.33628056254455746, -0.08413881244245448, -0.1712530001627597, 0.16843695020608124, -0.17000971511360366, -0.0652540209812074, 0.13972927189339496, 0.16664032454803934, 0.11805537691045749, -0.14870207457754173, -0.00827457008397272, -0.034060108399138464, 0.24217328800253396, 0.07670377649105432, 0.13414691505430823, 0.2312249709410887, 0.22875052620792946, 0.0899615482759406, 0.15826345521450175, -0.1992753796437374, -0.07086893366731442, -0.2796688125995042, -0.19771069164758232, -0.20473372472766024, 0.015009943607579155, -0.08421374338739265, -0.124821708946113, 0.40909170650690097, 0.1096183616635308, 0.18268024935850014, -0.021980822817504145, 0.35036401464794464, 0.08918137462368529, 0.08336922349149568, -0.007769039528422624, 0.2456519063378341, 0.15179505136016516, 0.0897226095313958, -0.23896375156163607, 0.028488815519740883, -0.014449473927941239] |
1,801.10536 | Large Shafarevich-Tate groups over quadratic number fields | Let $E$ be an elliptic curve over the rational field $\mathbf{Q}$. Let $K$ be
a quadratic extension over $\mathbf{Q}$. Let $\mathrm{ST}(E/K)$ dente the
Shafarevich-Tate group of $E$ over $K$. We show that (under mild conditions on
$E$) for every $r>0$, there are infinitely many quadratic twists
$E^d/\mathbf{Q}$ of $E/\mathbf{Q}$ such that
$\mathrm{dim}_{\mathbf{F}_2}(\mathrm{ST}(E^d/K)[2]) > r$
| math.NT | let e be an elliptic curve over the rational field mathbfq let k be a quadratic extension over mathbfq let mathrmstek dente the shafarevichtate group of e over k we show that under mild conditions on e for every r0 there are infinitely many quadratic twists edmathbfq of emathbfq such that mathrmdim_mathbff_2mathrmstedk2 r | [['let', 'e', 'be', 'an', 'elliptic', 'curve', 'over', 'the', 'rational', 'field', 'mathbfq', 'let', 'k', 'be', 'a', 'quadratic', 'extension', 'over', 'mathbfq', 'let', 'mathrmstek', 'dente', 'the', 'shafarevichtate', 'group', 'of', 'e', 'over', 'k', 'we', 'show', 'that', 'under', 'mild', 'conditions', 'on', 'e', 'for', 'every', 'r0', 'there', 'are', 'infinitely', 'many', 'quadratic', 'twists', 'edmathbfq', 'of', 'emathbfq', 'such', 'that', 'mathrmdim_mathbff_2mathrmstedk2', 'r']] | [-0.3041110858891387, 0.11069833009523976, -0.16430352172073054, -0.08060582761405682, -0.051630911355534076, -0.20255790186133615, -0.05439988755602009, 0.3496830664118942, -0.3623646691593589, -0.18296641457293714, 0.023956666291900436, -0.2867877924320649, -0.09134693880926589, 0.3305230091268919, -0.07753834273305019, -0.0968889965276633, 0.015247029271356913, 0.1857197898896221, -0.06235165653598248, -0.34138985609217565, 0.29748376648949115, -0.11534780951939066, 0.08624965365862056, 0.03121038819829534, 0.09308902229353481, 0.11398730311086591, 0.11450428075670284, 0.021543152939186107, -0.18827993037061508, 0.04741542554479473, 0.3756034987769565, 0.049350321625492403, 0.2874520154935973, -0.3374108523575884, -0.20819515776725447, 0.35227093900724943, 0.12942753172460564, -0.16758795316350095, 0.01922892888162133, -0.18817463800387116, 0.23249333295305924, -0.13813208754421497, -0.14681977383336242, -0.08476865684556566, 0.15181520740187973, 0.010053632742896373, -0.34621370241654165, -0.054113915779304744, 0.09768008408421765, 0.23058981385690216, -0.06797653580160469, -0.1829272313233541, -0.07402134435821553, -0.055082303481366564, 0.04823344072555097, 0.12817958751883435, 0.03836686181127835, -0.04994050884733395, -0.08938350752756304, 0.35515981235978555, -0.15316681603768043, -0.18022638350269016, 0.06280484096128114, -0.20168162032733766, -0.045081472965147425, 0.16538011906098346, 0.1535814306413641, 0.1628028138597705, 0.0073153643621778, 0.330650147696843, -0.19394479816772367, 0.09927561217253762, 0.10290612275617159, -0.12501023399966713, 0.19482715975265114, -0.05408835952759397, 0.16623525183567092, 0.03697840602859399, 0.003978964079133406, 0.051035036694030374, -0.4158139512969219, -0.12064778181363126, -0.0860602121268, 0.23773785902434313, -0.12494294673242436, -0.11850660172652225, 0.37048528822404997, 0.051944834360738795, 0.2191191104677867, 0.09965525090466348, 0.1305947953036853, 0.11361195354209262, 0.047975282013720394, 0.14306829981886002, -0.010443307715943274, 0.17769209896119273, -0.11467000700257794, -0.16916396309222495, 0.020622737981303006, 0.05938116567475455] |
1,801.10537 | Weyl transformation and regular solutions in a deformed
Jackiw-Teitelboim model | We revisit a deformed Jackiw-Teitelboim model with a hyperbolic dilaton
potential, constructed in the preceding work [arXiv:1701.06340]. Several
solutions are discussed in a series of the subsequent papers, but all of them
are pathological because of a naked singularity intrinsic to the deformation.
In this paper, by employing a Weyl transformation to the original deformed
model, we consider a Liouville-type potential with a cosmological constant
term. Then regular solutions can be constructed with coupling to a conformal
matter by using $SL(2)$ transformations. For a black hole solution, the
Bekenstein-Hawking entropy is computed from the area law. It can also be
reproduced by evaluating the boundary stress tensor with an appropriate local
counter-term (which is essentially provided by a Liouville-type potential).
| hep-th gr-qc math-ph math.MP | we revisit a deformed jackiwteitelboim model with a hyperbolic dilaton potential constructed in the preceding work arxiv170106340 several solutions are discussed in a series of the subsequent papers but all of them are pathological because of a naked singularity intrinsic to the deformation in this paper by employing a weyl transformation to the original deformed model we consider a liouvilletype potential with a cosmological constant term then regular solutions can be constructed with coupling to a conformal matter by using sl2 transformations for a black hole solution the bekensteinhawking entropy is computed from the area law it can also be reproduced by evaluating the boundary stress tensor with an appropriate local counterterm which is essentially provided by a liouvilletype potential | [['we', 'revisit', 'a', 'deformed', 'jackiwteitelboim', 'model', 'with', 'a', 'hyperbolic', 'dilaton', 'potential', 'constructed', 'in', 'the', 'preceding', 'work', 'arxiv170106340', 'several', 'solutions', 'are', 'discussed', 'in', 'a', 'series', 'of', 'the', 'subsequent', 'papers', 'but', 'all', 'of', 'them', 'are', 'pathological', 'because', 'of', 'a', 'naked', 'singularity', 'intrinsic', 'to', 'the', 'deformation', 'in', 'this', 'paper', 'by', 'employing', 'a', 'weyl', 'transformation', 'to', 'the', 'original', 'deformed', 'model', 'we', 'consider', 'a', 'liouvilletype', 'potential', 'with', 'a', 'cosmological', 'constant', 'term', 'then', 'regular', 'solutions', 'can', 'be', 'constructed', 'with', 'coupling', 'to', 'a', 'conformal', 'matter', 'by', 'using', 'sl2', 'transformations', 'for', 'a', 'black', 'hole', 'solution', 'the', 'bekensteinhawking', 'entropy', 'is', 'computed', 'from', 'the', 'area', 'law', 'it', 'can', 'also', 'be', 'reproduced', 'by', 'evaluating', 'the', 'boundary', 'stress', 'tensor', 'with', 'an', 'appropriate', 'local', 'counterterm', 'which', 'is', 'essentially', 'provided', 'by', 'a', 'liouvilletype', 'potential']] | [-0.12760105371125974, 0.08346537617145267, -0.10801686561752517, 0.06471746337126565, -0.08604434138641325, -0.18715113315324322, -0.017041494607134965, 0.3025117084626578, -0.2603219356113935, -0.24722368948302476, 0.1212666120718648, -0.2994286882448472, -0.17339818289174752, 0.1480876959531623, -0.08428169245354268, 0.07110584396164582, 0.01965733036054533, 0.05619400039221309, -0.11125943623189696, -0.2511622009959322, 0.37681388429819973, 0.05430537877807848, 0.21327638496183046, 0.020908762908251097, 0.08595986115675763, -0.034821326003073395, -0.0011803231695119072, 0.09367768614388564, -0.1447430216548808, 0.10088933758171541, 0.21960406445021577, 0.05780889335706705, 0.2242304314487465, -0.3998209479100564, -0.2616524833152775, 0.07561039424524839, 0.13831776765198642, 0.15471164518165081, -0.09635895480472251, -0.29533378039525837, 0.06408975803402855, -0.2029882713432322, -0.18351888574832, -0.10260838743674905, 0.02508886837783982, -0.025300676719199458, -0.24971006984407662, 0.10950395620624048, 0.045537281155335806, -0.024408611472883895, -0.12983324279922584, -0.01791556229611405, -0.03812406099393588, 0.06665184425127481, 0.12187835684206587, 0.06066540164575607, 0.11411037221707467, -0.12644640722374642, -0.0769302891586915, 0.3564758528055263, -0.09892911834157064, -0.2612474462303075, 0.10044661929298725, -0.12958707735177225, -0.11265974463660176, 0.08465816936369579, 0.08101726832560913, 0.13797050951364961, -0.20223856761175044, 0.1667811010158112, -0.001469172238951408, 0.1285320162957049, 0.11098790819905385, -0.03827084694840327, 0.26435256113118233, 0.09263344459038056, 0.005639143882929778, 0.16995532603097, 0.005222809473355888, -0.08500300766900182, -0.3756566604740229, -0.15679687136361578, -0.1773824613245924, 0.10883231012604568, -0.12742398474991573, -0.184182791865016, 0.38911344367666406, 0.05919177499695137, 0.207994831656008, 0.05224430428508732, 0.22914945008624502, 0.1330433575629194, 0.09468995698897888, 0.05758533514096957, 0.2800858546940594, 0.11059460700333056, 0.0905799938868653, -0.1996939143923135, -0.05310534147796135, 0.16194193163972756] |
1,801.10538 | Smoluchowski-Kramers approximation for the damped stochastic wave
equation with multiplicative noise in any spatial dimension | We show that the solutions to the damped stochastic wave equation converge
pathwise to the solution of a stochastic heat equation. This is called the
Smoluchowski-Kramers approximation. Cerrai and Freidlin have previously
demonstrated that this result holds in the cases where the system is exposed to
additive noise in any spatial dimension or when the system is exposed to
multiplicative noise and the spatial dimension is one. The current paper proves
that the Smoluchowski-Kramers approximation is valid in any spatial dimension
when the system is exposed to multiplicative noise.
| math.PR | we show that the solutions to the damped stochastic wave equation converge pathwise to the solution of a stochastic heat equation this is called the smoluchowskikramers approximation cerrai and freidlin have previously demonstrated that this result holds in the cases where the system is exposed to additive noise in any spatial dimension or when the system is exposed to multiplicative noise and the spatial dimension is one the current paper proves that the smoluchowskikramers approximation is valid in any spatial dimension when the system is exposed to multiplicative noise | [['we', 'show', 'that', 'the', 'solutions', 'to', 'the', 'damped', 'stochastic', 'wave', 'equation', 'converge', 'pathwise', 'to', 'the', 'solution', 'of', 'a', 'stochastic', 'heat', 'equation', 'this', 'is', 'called', 'the', 'smoluchowskikramers', 'approximation', 'cerrai', 'and', 'freidlin', 'have', 'previously', 'demonstrated', 'that', 'this', 'result', 'holds', 'in', 'the', 'cases', 'where', 'the', 'system', 'is', 'exposed', 'to', 'additive', 'noise', 'in', 'any', 'spatial', 'dimension', 'or', 'when', 'the', 'system', 'is', 'exposed', 'to', 'multiplicative', 'noise', 'and', 'the', 'spatial', 'dimension', 'is', 'one', 'the', 'current', 'paper', 'proves', 'that', 'the', 'smoluchowskikramers', 'approximation', 'is', 'valid', 'in', 'any', 'spatial', 'dimension', 'when', 'the', 'system', 'is', 'exposed', 'to', 'multiplicative', 'noise']] | [-0.1294966589934616, 0.06643941915651587, -0.06788476438007572, 0.07239678500495343, -0.02635095964863219, -0.15725322101074693, -0.010269038642449728, 0.3100001393309371, -0.2970523611716503, -0.2070875473913144, 0.1094781458232319, -0.28451283678243106, -0.18262125393481587, 0.15951617775135674, -0.11019225925503467, 0.05600399062479317, 0.020432647804475644, 0.06525801063187166, -0.0036020428286230362, -0.2868296792519025, 0.35057711287994275, 0.02059357292124663, 0.24929766914680263, 0.009066349345217035, 0.1755260449029844, -0.04865116275455379, 0.02167894237738272, 0.03327732659038867, -0.09124921971198835, 0.03949956125275507, 0.2237365722910247, 0.0445188749197934, 0.3063435652293265, -0.3826429746960374, -0.24909554764797742, 0.13367543628291143, 0.12572386340087344, 0.142787423111837, 0.006389907598283819, -0.26640270282091066, 0.11253481513862922, -0.10283563971858133, -0.19213175283617934, -0.07677522673144598, 0.027911368969150564, 0.04395798690066757, -0.3348093753765253, 0.09498850998087702, 0.16416958833790637, -0.034081784754314205, -0.05794779001735151, -0.07259065143642313, 0.032947792248292404, 0.07742734501252099, 0.058657634394793684, 0.05275935697004157, 0.08298288380981168, -0.10803031846775081, -0.05557373074010353, 0.3403007478971796, -0.10340716685856353, -0.303324928867038, 0.19542465516133234, -0.18417887546291406, -0.09812111521817067, 0.15814446907659824, 0.12739315505711024, 0.08566930810709229, -0.1913929105678769, 0.15568419992368118, -0.029273006578064684, 0.2099681785118512, 0.09039288473484869, 0.009480511415114795, 0.039143745046616954, 0.15982053904074497, 0.1401907654799288, 0.14032176311593503, -0.07775983884295617, -0.10853739635786042, -0.27100898182040756, -0.13873713398987259, -0.1886143704389476, 0.11059145242110059, -0.09312244644355484, -0.18988709269218484, 0.3413214126644148, 0.20136606559654782, 0.1151529922023077, 0.07574309025552463, 0.32302507053298707, 0.2425872515040365, -0.005576277003538879, 0.11630324125078252, 0.2058039695363153, 0.15354204027310267, 0.11294814624654298, -0.1983012184077366, 0.0796209664920091, 0.07686658452307298] |
1,801.10539 | Heat content in non-compact Riemannian manifolds | Let $\Omega$ be an open set in a complete, smooth, non-compact,
$m$-dimensional Riemannian manifold $M$ without boundary, where $M$ satisfies a
two-sided Li-Yau gaussian heat kernel bound. It is shown that if $\Omega$ has
infinite measure, and if $\Omega$ has finite heat content $H_{\Omega}(T)$ for
some $T>0$, then $H_{\Omega}(t)<\infty$ for all $t>0$. Comparable two-sided
bounds for $H_{\Omega}(t)$ are obtained for such $\Omega$.
| math.AP | let omega be an open set in a complete smooth noncompact mdimensional riemannian manifold m without boundary where m satisfies a twosided liyau gaussian heat kernel bound it is shown that if omega has infinite measure and if omega has finite heat content h_omegat for some t0 then h_omegatinfty for all t0 comparable twosided bounds for h_omegat are obtained for such omega | [['let', 'omega', 'be', 'an', 'open', 'set', 'in', 'a', 'complete', 'smooth', 'noncompact', 'mdimensional', 'riemannian', 'manifold', 'm', 'without', 'boundary', 'where', 'm', 'satisfies', 'a', 'twosided', 'liyau', 'gaussian', 'heat', 'kernel', 'bound', 'it', 'is', 'shown', 'that', 'if', 'omega', 'has', 'infinite', 'measure', 'and', 'if', 'omega', 'has', 'finite', 'heat', 'content', 'h_omegat', 'for', 'some', 't0', 'then', 'h_omegatinfty', 'for', 'all', 't0', 'comparable', 'twosided', 'bounds', 'for', 'h_omegat', 'are', 'obtained', 'for', 'such', 'omega']] | [-0.152015620730107, 0.14530604960366303, -0.08060366679298675, 0.04395060340076748, -0.16025226252248226, -0.25603742395543444, 0.004985045763995435, 0.3763184405792252, -0.25395901952633415, -0.13701083452709145, 0.16487433874813873, -0.34897333334626285, -0.024517746081859883, 0.24436306567483787, -0.07844808033935852, 0.040669388082509826, 0.07606478469541013, 0.2076805900087801, -0.054181676243542365, -0.20906314499660442, 0.3857336201057848, -0.12989650761424484, 0.19101098517618947, 0.12238387382289363, 0.1290764040550438, -0.06788739943245457, 0.05822535365093815, 0.024444974820776764, -0.2503807669298544, 0.006815494164445643, 0.26829064574282047, 0.08328294299416623, 0.279146466704117, -0.3695749388849836, -0.24264091160148382, 0.26446311985600296, 0.15431086376893444, -0.09409626611208512, -0.03913608210761163, -0.2889070501077478, 0.179097576422017, -0.049004525388196364, -0.16790233068641716, -0.08835654260622243, 0.14299905798950438, -0.019563234616386687, -0.34162700420908504, 0.04887228307582564, 0.13826272153627064, 0.01485300914905334, -0.11664771372294527, -0.1588413330047565, -0.04970516659609452, 0.08147654425889506, -0.09529602900542067, 0.16398154629070816, 0.03238443776144315, -0.018821494882705354, -0.015224941871997159, 0.3007786156514944, -0.16631157544709868, -0.35291778081554476, 0.07320836292958613, -0.22059657685142958, -0.09751519558446134, 0.08642070667849759, 0.08071838887566227, 0.13781653167837757, -0.14821979056222964, 0.27354448536406983, -0.11390795565597019, 0.07594769508617347, 0.11280325392134867, 0.008151632488973565, 0.07358028824930474, 0.11739376261514628, 0.2350990688586134, 0.13133424662361395, -0.0012612942314185833, -0.01202774935765034, -0.3806068693934861, -0.15597177107159396, -0.22427003480438776, 0.2131424350979722, -0.15993833684700864, -0.18350195857820542, 0.19425083073329621, -0.01941050125791107, 0.20645868973964351, 0.11056337900207204, 0.23496256977067156, 0.13733363741741444, -0.02784450463279766, 0.2330753696308929, 0.037429444044453516, 0.19307728271173724, 0.013010398184849043, -0.17829311130789377, 0.0006770361372727459, 0.11129720074961245] |
1,801.1054 | Generalizations of certain representations of real numbers | In the present article, real number representations, that are generalizations
of classical positive and alternating representations of numbers, are
introduced and investigated. The main metric relation, properties of cylinder
sets are proved. The theorem on the representation of real numbers from a
certain interval is formulated.
| math.NT | in the present article real number representations that are generalizations of classical positive and alternating representations of numbers are introduced and investigated the main metric relation properties of cylinder sets are proved the theorem on the representation of real numbers from a certain interval is formulated | [['in', 'the', 'present', 'article', 'real', 'number', 'representations', 'that', 'are', 'generalizations', 'of', 'classical', 'positive', 'and', 'alternating', 'representations', 'of', 'numbers', 'are', 'introduced', 'and', 'investigated', 'the', 'main', 'metric', 'relation', 'properties', 'of', 'cylinder', 'sets', 'are', 'proved', 'the', 'theorem', 'on', 'the', 'representation', 'of', 'real', 'numbers', 'from', 'a', 'certain', 'interval', 'is', 'formulated']] | [-0.18792664652447338, 0.12775077085192924, -0.0620862229210932, 0.09213603615163542, -0.06221267099127821, -0.0634951132207947, -0.018793041043428948, 0.3320129171580724, -0.28793889008786366, -0.2767049511793353, 0.12881509590205614, -0.2702005724625095, -0.20996888151959234, 0.26034789819918247, -0.0812958988118107, 0.03764729398181257, 0.05371039563223072, 0.10290147319598042, -0.05250115995801499, -0.28234841725181625, 0.38022803480777406, -0.08913371896209277, 0.27419296767481643, 0.046519763686734696, 0.12038364131813464, 0.00971688783687094, -0.06340755816832509, 0.045151259183235794, -0.09278078392004396, 0.1649728334184898, 0.2289922893371271, 0.13442149420228341, 0.2443242168519646, -0.36030303043029877, -0.16266001100935365, 0.1383808285868524, 0.09837910863975792, 0.0038061466994290445, -0.032723624150410455, -0.28954561518343247, 0.1522014754642125, -0.1244701586522, -0.1092462075530025, -0.08789935946950446, 0.02695553960359615, 0.08544570932407743, -0.2174740342888981, 0.039908379647860544, 0.07489028933417538, 0.11127474320971448, -0.0945608054753393, -0.15903266581058825, 0.007836180496151033, 0.10918297666205984, 0.054720284432456225, -0.01778383246552118, 0.03717388741358224, -0.07422268931227534, -0.12913416968861027, 0.36163222676386003, 0.024318454604919836, -0.2649474099440419, 0.18799065021069153, -0.1408954526135779, -0.12205177177067685, 0.044356551841306296, 0.15360332089071366, 0.14009398452775634, -0.06532039003365714, 0.13557182726926048, -0.1409131498278483, 0.08361694242542042, 0.14026738384374135, 0.010099935006228801, 0.16034750518915447, 0.06594124638839909, 0.02660910163641624, 0.1940018903342602, -0.0052278241820876365, -0.12044041376034527, -0.3349419742741663, -0.16148303870273673, -0.2204253478937418, 0.04588167120338134, -0.08191769140830729, -0.18040174882575546, 0.37923714955863747, 0.0847335365011215, 0.21065454935128597, 0.1462454087627323, 0.24069015157874674, 0.14268239302074778, 0.004716949719611717, 0.029697774170452485, 0.12465412748734588, 0.2446393615809148, 0.03800115877074068, -0.09798054223495495, 0.01606848740282104, 0.18465100105284996] |
1,801.10541 | An improved quantification of HD 147379 b | We reanalyze the CARMENES and HIRES/KECK radial velocity data for HD 147379,
and also analyze the SOPHIE data using the Agatha software in combination with
MCMC posterior sampling. The analysis confirms the existence of HD 147379 b and
improves the parameter estimation through modeling of red noise. The multiple
radial velocity data sets for HD147379 provide a benchmark case for RV data
analyses. Based on our analysis of the HD 147379 data, CARMENES radial velocity
data is dominated by red noise and thus need to incorporate a red noise model.
| astro-ph.EP | we reanalyze the carmenes and hireskeck radial velocity data for hd 147379 and also analyze the sophie data using the agatha software in combination with mcmc posterior sampling the analysis confirms the existence of hd 147379 b and improves the parameter estimation through modeling of red noise the multiple radial velocity data sets for hd147379 provide a benchmark case for rv data analyses based on our analysis of the hd 147379 data carmenes radial velocity data is dominated by red noise and thus need to incorporate a red noise model | [['we', 'reanalyze', 'the', 'carmenes', 'and', 'hireskeck', 'radial', 'velocity', 'data', 'for', 'hd', '147379', 'and', 'also', 'analyze', 'the', 'sophie', 'data', 'using', 'the', 'agatha', 'software', 'in', 'combination', 'with', 'mcmc', 'posterior', 'sampling', 'the', 'analysis', 'confirms', 'the', 'existence', 'of', 'hd', '147379', 'b', 'and', 'improves', 'the', 'parameter', 'estimation', 'through', 'modeling', 'of', 'red', 'noise', 'the', 'multiple', 'radial', 'velocity', 'data', 'sets', 'for', 'hd147379', 'provide', 'a', 'benchmark', 'case', 'for', 'rv', 'data', 'analyses', 'based', 'on', 'our', 'analysis', 'of', 'the', 'hd', '147379', 'data', 'carmenes', 'radial', 'velocity', 'data', 'is', 'dominated', 'by', 'red', 'noise', 'and', 'thus', 'need', 'to', 'incorporate', 'a', 'red', 'noise', 'model']] | [-0.07395788424274245, 0.007539613868287775, -0.13151369836401153, 0.016898655243678375, -0.11407502452853356, -0.11987739856867644, 0.08899366601338882, 0.36559953697528064, -0.16378213986335846, -0.3225197167910133, 0.1182599074999917, -0.2931859386153519, -0.050042270525787656, 0.24330117689246794, -0.09459484025333705, 0.060545460770973995, 0.217679558405548, -0.057937764638205574, 0.023499000043179213, -0.21090195773776327, 0.29253600685323555, 0.05470139462647311, 0.21614206294147192, -0.09699507748310486, 0.04038371904125291, 0.0026042548353584966, -0.17391100307937, -0.05129746108033349, -0.1946453416453193, 0.06408140824040336, 0.1930258700472376, 0.18888987358554862, 0.24876595161897078, -0.2850976569442016, -0.2205570486225083, 0.076537513257831, 0.18011652249215024, 0.05968478597240167, -0.036751469901993114, -0.33933917790640855, 0.0756596489757132, -0.11437762526303447, -0.1331871043514, -0.10119092762679531, 0.014750470266039118, 0.04485111233119047, -0.3395800046999468, 0.13216256902499512, -0.010142645756766367, 0.1921434108942245, -0.13075630043978603, -0.1612588403160485, -0.09760607756266182, 0.09485311079456397, 0.021465752069744166, 0.01643093828676959, 0.06980046289292781, -0.04476920026616099, -0.03494214377460185, 0.35160885259425373, -0.17553427030614924, -0.13464001490828698, 0.15887139401309652, -0.1460856436019282, -0.17969710597496355, 0.0984202835583285, 0.17562933174077044, 0.08261394444225209, -0.18444734880847208, 0.02705842121818176, -0.008971859210463807, 0.19661685678155652, 0.03939488985355985, 0.010111790275975559, 0.1914258822798729, 0.16251824961535716, 0.02665557712316513, 0.0558276662754753, -0.32231081371049114, -0.01782327013749504, -0.20855659069532653, -0.11001921992414118, -0.16956470871679066, -0.047103334937684156, -0.14597489336816846, -0.12228724632537767, 0.339017875325144, 0.18327782461236578, 0.21002739593595937, 0.06352166694411066, 0.4120123217489277, 0.07877103903388416, 0.057514134766350845, 0.12346688507836354, 0.2083882891960191, 0.1526198556065936, 0.14413831733543886, -0.2725810524275045, 0.06026930543018526, -0.046180488832106584] |
1,801.10542 | Meanings, Metaphors, and Morphisms: Theory of Indeterminate Natural
Transformation (TINT) | In the present paper, we propose a new theory named "Theory of indeterminate
natural transformation (TINT)" to investigate the dynamical creation of
meanings as association relationships between images, focusing on the metaphor
comprehension as an example. TINT models the meaning creation as a kind of
stochastic processes based on the mathematical structure defined by association
relationships as morphisms in category theory, so as to represent the
indeterminate nature of structure-structure interactions between the systems of
the meanings of images. Such interactions are formulated in terms of so-called
coslice categories and functors as structure-preserving correspondence between
them. The relationship between such functors is "indeterminate natural
transformation", the central notion in TINT, which models the creation of
meanings in a precise manner. For instance, the process of metaphor
comprehension is modeled by the construction of indeterminate natural
transformation from a canonically defined functor which we call the
base-of-metaphor functor.
| math.CT q-bio.NC | in the present paper we propose a new theory named theory of indeterminate natural transformation tint to investigate the dynamical creation of meanings as association relationships between images focusing on the metaphor comprehension as an example tint models the meaning creation as a kind of stochastic processes based on the mathematical structure defined by association relationships as morphisms in category theory so as to represent the indeterminate nature of structurestructure interactions between the systems of the meanings of images such interactions are formulated in terms of socalled coslice categories and functors as structurepreserving correspondence between them the relationship between such functors is indeterminate natural transformation the central notion in tint which models the creation of meanings in a precise manner for instance the process of metaphor comprehension is modeled by the construction of indeterminate natural transformation from a canonically defined functor which we call the baseofmetaphor functor | [['in', 'the', 'present', 'paper', 'we', 'propose', 'a', 'new', 'theory', 'named', 'theory', 'of', 'indeterminate', 'natural', 'transformation', 'tint', 'to', 'investigate', 'the', 'dynamical', 'creation', 'of', 'meanings', 'as', 'association', 'relationships', 'between', 'images', 'focusing', 'on', 'the', 'metaphor', 'comprehension', 'as', 'an', 'example', 'tint', 'models', 'the', 'meaning', 'creation', 'as', 'a', 'kind', 'of', 'stochastic', 'processes', 'based', 'on', 'the', 'mathematical', 'structure', 'defined', 'by', 'association', 'relationships', 'as', 'morphisms', 'in', 'category', 'theory', 'so', 'as', 'to', 'represent', 'the', 'indeterminate', 'nature', 'of', 'structurestructure', 'interactions', 'between', 'the', 'systems', 'of', 'the', 'meanings', 'of', 'images', 'such', 'interactions', 'are', 'formulated', 'in', 'terms', 'of', 'socalled', 'coslice', 'categories', 'and', 'functors', 'as', 'structurepreserving', 'correspondence', 'between', 'them', 'the', 'relationship', 'between', 'such', 'functors', 'is', 'indeterminate', 'natural', 'transformation', 'the', 'central', 'notion', 'in', 'tint', 'which', 'models', 'the', 'creation', 'of', 'meanings', 'in', 'a', 'precise', 'manner', 'for', 'instance', 'the', 'process', 'of', 'metaphor', 'comprehension', 'is', 'modeled', 'by', 'the', 'construction', 'of', 'indeterminate', 'natural', 'transformation', 'from', 'a', 'canonically', 'defined', 'functor', 'which', 'we', 'call', 'the', 'baseofmetaphor', 'functor']] | [-0.10856409789196994, 0.06959266973308954, -0.09630197190762536, 0.11329493617161972, -0.11394089846935583, -0.10262333269132148, 0.020574611681832434, 0.33459487554221734, -0.39031792509573676, -0.3005232221880698, 0.041454130596296275, -0.22012773362284985, -0.22080691820584647, 0.12622916655079142, -0.11627736192017998, -0.03515741429674401, 0.012727932245406795, 0.0688223358313872, -0.0654982522908241, -0.14855071431829606, 0.3905812948607291, 0.027276184926549457, 0.27300240626966915, 0.0049168179429627396, 0.14921308679774098, 0.007968311111940301, -0.052351260408862774, -0.021490455661702594, -0.07046275052213276, 0.13953850396242223, 0.2971243311668294, 0.17323884104812287, 0.24377051970765173, -0.404500217649014, -0.14609281814235345, 0.09944226892588481, 0.12238365553111342, 0.04448179338184785, -0.04601589692054852, -0.308334562723359, 0.012277133809881003, -0.19144970048474122, -0.03616989217698574, -0.06201668279500653, 0.08247538917053696, 0.01197909868343443, -0.23381282860446684, 0.03179421555751728, 0.09520357237608101, 0.12279668031898264, -0.0843616223045663, -0.030751691021229308, -0.028051968968524407, 0.13754624022451573, 0.013226110659410527, 0.020465490679345923, 0.10336529277025862, -0.15590122629480105, -0.16449652972618398, 0.43203386773470126, -0.047897836022008825, -0.23649558619506758, 0.2150995927378025, -0.042842579224108626, -0.13849716097728848, 0.03727208504976373, 0.13281955777935378, 0.14271670535257827, -0.16864687983905066, 0.09738736718610784, -0.06818483810957955, 0.10821159356847813, 0.10770441368158447, 0.06657035000564862, 0.23303808079400953, 0.16120150060813926, -0.04740708663243137, 0.15923922017140135, 0.01203574115639291, -0.13542238368703793, -0.3327838325082031, -0.18074426139016758, -0.10849469112972282, 0.050914611026313006, -0.06955842465177826, -0.20564301970274482, 0.3394143428519521, 0.17058456615123846, 0.2262993503157815, 0.06533912501986815, 0.23510482510207348, 0.08265445615030978, 0.08130188108093347, -0.06083865954830911, 0.14951259145921428, 0.17618270321391932, 0.06617234338215258, -0.11196655838922534, 0.07798289400461601, 0.1816431877924104] |
1,801.10543 | Strong coordination of signals and actions over noisy channels with
two-sided state information | We consider a network of two nodes separated by a noisy channel with
two-sided state information, in which the input and output signals have to be
coordinated with the source and its reconstruction. In the case of non-causal
encoding and decoding, we propose a joint source-channel coding scheme and
develop inner and outer bounds for the strong coordination region. While the
inner and outer bounds do not match in general, we provide a complete
characterization of the strong coordination region in three particular cases:
i) when the channel is perfect; ii) when the decoder is lossless; and iii) when
the random variables of the channel are independent from the random variables
of the source. Through the study of these special cases, we prove that the
separation principle does not hold for joint source-channel strong
coordination. Finally, in the absence of state information, we show that polar
codes achieve the best known inner bound for the strong coordination region,
which therefore offers a constructive alternative to random binning and coding
proofs.
| cs.IT math.IT | we consider a network of two nodes separated by a noisy channel with twosided state information in which the input and output signals have to be coordinated with the source and its reconstruction in the case of noncausal encoding and decoding we propose a joint sourcechannel coding scheme and develop inner and outer bounds for the strong coordination region while the inner and outer bounds do not match in general we provide a complete characterization of the strong coordination region in three particular cases i when the channel is perfect ii when the decoder is lossless and iii when the random variables of the channel are independent from the random variables of the source through the study of these special cases we prove that the separation principle does not hold for joint sourcechannel strong coordination finally in the absence of state information we show that polar codes achieve the best known inner bound for the strong coordination region which therefore offers a constructive alternative to random binning and coding proofs | [['we', 'consider', 'a', 'network', 'of', 'two', 'nodes', 'separated', 'by', 'a', 'noisy', 'channel', 'with', 'twosided', 'state', 'information', 'in', 'which', 'the', 'input', 'and', 'output', 'signals', 'have', 'to', 'be', 'coordinated', 'with', 'the', 'source', 'and', 'its', 'reconstruction', 'in', 'the', 'case', 'of', 'noncausal', 'encoding', 'and', 'decoding', 'we', 'propose', 'a', 'joint', 'sourcechannel', 'coding', 'scheme', 'and', 'develop', 'inner', 'and', 'outer', 'bounds', 'for', 'the', 'strong', 'coordination', 'region', 'while', 'the', 'inner', 'and', 'outer', 'bounds', 'do', 'not', 'match', 'in', 'general', 'we', 'provide', 'a', 'complete', 'characterization', 'of', 'the', 'strong', 'coordination', 'region', 'in', 'three', 'particular', 'cases', 'i', 'when', 'the', 'channel', 'is', 'perfect', 'ii', 'when', 'the', 'decoder', 'is', 'lossless', 'and', 'iii', 'when', 'the', 'random', 'variables', 'of', 'the', 'channel', 'are', 'independent', 'from', 'the', 'random', 'variables', 'of', 'the', 'source', 'through', 'the', 'study', 'of', 'these', 'special', 'cases', 'we', 'prove', 'that', 'the', 'separation', 'principle', 'does', 'not', 'hold', 'for', 'joint', 'sourcechannel', 'strong', 'coordination', 'finally', 'in', 'the', 'absence', 'of', 'state', 'information', 'we', 'show', 'that', 'polar', 'codes', 'achieve', 'the', 'best', 'known', 'inner', 'bound', 'for', 'the', 'strong', 'coordination', 'region', 'which', 'therefore', 'offers', 'a', 'constructive', 'alternative', 'to', 'random', 'binning', 'and', 'coding', 'proofs']] | [-0.15517807682695361, 0.05395787140244947, -0.05062463472542517, 0.05619750058634535, -0.05063310619443655, -0.20953806670492187, 0.10590338977601599, 0.3894782235736356, -0.283412080406047, -0.26741433627355626, 0.1266385918120196, -0.21217198523227127, -0.1325331406106296, 0.13352107677731992, -0.09103455899115515, 0.01604618412367178, 0.04998230707338628, 0.06054568946899107, -0.08874934411278981, -0.23453673484926935, 0.3116107841282535, 0.07249595644500326, 0.29083903261652105, 0.034914950829218416, 0.07822820777141982, 0.05135836328434593, -0.03257660355747623, -0.011258559029481736, -0.12220225283809294, 0.11574920939610285, 0.2793229549027541, 0.15830347542133122, 0.2311598168412114, -0.41095193756525134, -0.2415495899889399, 0.08607210954445797, 0.14791239255436642, 0.1350305908743073, -0.044561123712371815, -0.2626387685961912, 0.11127660783035133, -0.14893800140741995, -0.018857104492866816, 0.003047869209309711, -0.040004348900059564, 0.042786704621154484, -0.35416566341403216, 0.06796407568104126, 0.1481279309722595, 0.013222753941355383, -0.04749538123073495, -0.09694891940915328, 0.04036814796820502, 0.17512917621454963, -0.0028854474966304704, 0.007415031134972678, 0.05339685396072181, -0.11224074609824182, -0.09775494207244585, 0.32434315834851823, -0.023870034638093784, -0.20779748025815933, 0.17634061551105012, -0.14330242073492092, -0.12243850771063829, 0.1239985801587703, 0.19378991326700676, 0.10497003572390359, -0.13363979241035207, 0.06036844894919983, -0.07748362076304414, 0.19084461054846863, 0.06114666894872618, 0.12501006796305505, 0.1672351960585836, 0.08508239394766004, 0.12227961244746385, 0.19861793811569978, -0.1355930711812107, -0.12507156125913538, -0.32737831650473015, -0.13841555032310734, -0.18205681870527127, -0.02547067797944799, -0.12454668955863728, -0.14203048118746237, 0.3371330109254332, 0.07962121145032784, 0.17103021259942633, 0.08753910423667334, 0.31920203957158855, 0.05893580307636191, 0.02270296435145771, 0.16719374258399886, 0.26402976948987034, 0.13630197189666113, 0.04296485618551207, -0.18506423067986308, 0.10277625634334982, 0.027088371397215216] |
1,801.10544 | Assessing student's achievement gap between ethnic groups in Brazil | Achievement gaps refer to the difference in the performance on examinations
of students belonging to different social groups. Achievement gaps between
ethnic groups have been observed in several countries with heterogeneous
populations. In this paper, we analyze achievement gaps between ethnic
populations in Brazil by studying the performance of a large cohort of senior
high-school students in a standardized national exam. We separate ethnic groups
into the Brazilian states to remove potential biases associated to
infrastructure and financial resources, cultural background and ethnic
clustering. We focus on the disciplines of mathematics and writing that involve
different cognitive functions. We estimate the gaps and their statistical
significance through the Welch's t-test and study key socio-economic variables
that may explain the existence or absence of gaps. We identify that gaps
between ethnic groups are either statistically insignificant (p<.01) or small
(2%-6%) if statistically significant, for students living in households with
low income. Increasing gaps however may be observed for higher income. On the
other hand, while higher parental education is associated to higher
performance, it may either increase, decrease or maintain the gaps between
White and Black, and between White and Pardo students. Our results support that
socio-economic variables have major impact on student's performance in both
mathematics and writing examinations irrespectively of ethnic backgrounds,
giving evidence that genetic factors have little or no effect on ethnic group
performance when students are exposed to similar cultural and financial
contexts.
| stat.AP | achievement gaps refer to the difference in the performance on examinations of students belonging to different social groups achievement gaps between ethnic groups have been observed in several countries with heterogeneous populations in this paper we analyze achievement gaps between ethnic populations in brazil by studying the performance of a large cohort of senior highschool students in a standardized national exam we separate ethnic groups into the brazilian states to remove potential biases associated to infrastructure and financial resources cultural background and ethnic clustering we focus on the disciplines of mathematics and writing that involve different cognitive functions we estimate the gaps and their statistical significance through the welchs ttest and study key socioeconomic variables that may explain the existence or absence of gaps we identify that gaps between ethnic groups are either statistically insignificant p01 or small 26 if statistically significant for students living in households with low income increasing gaps however may be observed for higher income on the other hand while higher parental education is associated to higher performance it may either increase decrease or maintain the gaps between white and black and between white and pardo students our results support that socioeconomic variables have major impact on students performance in both mathematics and writing examinations irrespectively of ethnic backgrounds giving evidence that genetic factors have little or no effect on ethnic group performance when students are exposed to similar cultural and financial contexts | [['achievement', 'gaps', 'refer', 'to', 'the', 'difference', 'in', 'the', 'performance', 'on', 'examinations', 'of', 'students', 'belonging', 'to', 'different', 'social', 'groups', 'achievement', 'gaps', 'between', 'ethnic', 'groups', 'have', 'been', 'observed', 'in', 'several', 'countries', 'with', 'heterogeneous', 'populations', 'in', 'this', 'paper', 'we', 'analyze', 'achievement', 'gaps', 'between', 'ethnic', 'populations', 'in', 'brazil', 'by', 'studying', 'the', 'performance', 'of', 'a', 'large', 'cohort', 'of', 'senior', 'highschool', 'students', 'in', 'a', 'standardized', 'national', 'exam', 'we', 'separate', 'ethnic', 'groups', 'into', 'the', 'brazilian', 'states', 'to', 'remove', 'potential', 'biases', 'associated', 'to', 'infrastructure', 'and', 'financial', 'resources', 'cultural', 'background', 'and', 'ethnic', 'clustering', 'we', 'focus', 'on', 'the', 'disciplines', 'of', 'mathematics', 'and', 'writing', 'that', 'involve', 'different', 'cognitive', 'functions', 'we', 'estimate', 'the', 'gaps', 'and', 'their', 'statistical', 'significance', 'through', 'the', 'welchs', 'ttest', 'and', 'study', 'key', 'socioeconomic', 'variables', 'that', 'may', 'explain', 'the', 'existence', 'or', 'absence', 'of', 'gaps', 'we', 'identify', 'that', 'gaps', 'between', 'ethnic', 'groups', 'are', 'either', 'statistically', 'insignificant', 'p01', 'or', 'small', '26', 'if', 'statistically', 'significant', 'for', 'students', 'living', 'in', 'households', 'with', 'low', 'income', 'increasing', 'gaps', 'however', 'may', 'be', 'observed', 'for', 'higher', 'income', 'on', 'the', 'other', 'hand', 'while', 'higher', 'parental', 'education', 'is', 'associated', 'to', 'higher', 'performance', 'it', 'may', 'either', 'increase', 'decrease', 'or', 'maintain', 'the', 'gaps', 'between', 'white', 'and', 'black', 'and', 'between', 'white', 'and', 'pardo', 'students', 'our', 'results', 'support', 'that', 'socioeconomic', 'variables', 'have', 'major', 'impact', 'on', 'students', 'performance', 'in', 'both', 'mathematics', 'and', 'writing', 'examinations', 'irrespectively', 'of', 'ethnic', 'backgrounds', 'giving', 'evidence', 'that', 'genetic', 'factors', 'have', 'little', 'or', 'no', 'effect', 'on', 'ethnic', 'group', 'performance', 'when', 'students', 'are', 'exposed', 'to', 'similar', 'cultural', 'and', 'financial', 'contexts']] | [-0.05646525776133586, 0.11524597997961365, -0.08923687832558946, 0.14465385805501088, -0.10312961767239001, -0.1169515532689004, 0.10021212383542791, 0.4193245909335917, -0.18768470760686362, -0.3944756593417675, 0.0622591763191546, -0.32987454816510403, -0.13332147311290554, 0.17262622307718806, -0.1529372504377887, -0.07471167737861725, 0.06828044346073948, -0.01979546568637423, -0.01940793762836244, -0.31819391964231364, 0.32672620410068187, 0.051734637281413386, 0.3245452146364164, 0.030943146150339128, 0.035640756821752044, -0.06434423956658518, -0.0807973243353126, 0.012328337958546253, -0.0703126004490157, 0.11675336677851234, 0.3889416301630846, 0.14216277140334155, 0.4058043293906415, -0.42188445409909203, -0.15331850543948292, 0.13465247321289986, 0.08546039707003798, 0.027778064322221695, -0.052293398771690446, -0.3073259228801174, 0.0531185290457893, -0.20452675540250714, -0.07462066911821123, -0.042341420619516686, 0.019997796267742597, 0.026093581116399464, -0.16474675233790234, 0.10991465384219204, 0.009476565388483212, 0.19043605937720728, -0.07170688517427048, -0.21215636222249973, -0.02818298189044156, 0.262989181495308, 0.13457265335433813, -0.06223877210843962, 0.13232799820142174, -0.15735024369306044, -0.1637047578989359, 0.3449733593832222, -0.0023820644798629646, -0.15694733116213813, 0.2630971044042631, -0.2144584869474707, -0.14188281312596665, 0.04563017905088542, 0.25136730947064134, -0.013981421132285132, -0.13174442232829345, 0.008762655082823834, 0.014297987206717206, 0.17748254125855298, 0.1264650831038313, -0.001782095149642776, 0.21337757221416212, 0.10438042557562548, 0.057737194114651544, 0.051360976349077096, -0.038118328242405526, -0.08921542494923254, -0.20333992593768466, -0.163788512356988, -0.09882746417299385, 0.026608398518198906, -0.06762291101052599, -0.1501544519103592, 0.37706381521474586, 0.13111851901161772, 0.08677195931661025, 0.019284807666271674, 0.22040519045807327, 0.031156625925319637, 0.08703303007008154, 0.07907928121158311, 0.1816759380700562, 0.06157815557676623, 0.11245917649212675, -0.19079786155914163, 0.15274941296226302, -0.07808945789753424] |
1,801.10545 | A family of OWA operators based on Faulhaber's formulas | In this paper we develop a new family of Ordered Weighted Averaging (OWA)
operators. Weight vector is obtained from a desired orness of the operator.
Using Faulhaber's formulas we obtain direct and simple expressions for the
weight vector without any iteration loop. With the exception of one weight, the
remaining follow a straight line relation. As a result, a fast and robust
algorithm is developed. The resulting weight vector is suboptimal according
with the Maximum Entropy criterion, but it is very close to the optimal.
Comparisons are done with other procedures.
| cs.AI | in this paper we develop a new family of ordered weighted averaging owa operators weight vector is obtained from a desired orness of the operator using faulhabers formulas we obtain direct and simple expressions for the weight vector without any iteration loop with the exception of one weight the remaining follow a straight line relation as a result a fast and robust algorithm is developed the resulting weight vector is suboptimal according with the maximum entropy criterion but it is very close to the optimal comparisons are done with other procedures | [['in', 'this', 'paper', 'we', 'develop', 'a', 'new', 'family', 'of', 'ordered', 'weighted', 'averaging', 'owa', 'operators', 'weight', 'vector', 'is', 'obtained', 'from', 'a', 'desired', 'orness', 'of', 'the', 'operator', 'using', 'faulhabers', 'formulas', 'we', 'obtain', 'direct', 'and', 'simple', 'expressions', 'for', 'the', 'weight', 'vector', 'without', 'any', 'iteration', 'loop', 'with', 'the', 'exception', 'of', 'one', 'weight', 'the', 'remaining', 'follow', 'a', 'straight', 'line', 'relation', 'as', 'a', 'result', 'a', 'fast', 'and', 'robust', 'algorithm', 'is', 'developed', 'the', 'resulting', 'weight', 'vector', 'is', 'suboptimal', 'according', 'with', 'the', 'maximum', 'entropy', 'criterion', 'but', 'it', 'is', 'very', 'close', 'to', 'the', 'optimal', 'comparisons', 'are', 'done', 'with', 'other', 'procedures']] | [-0.11023053216178798, 0.09935792974299855, -0.08417719219707781, 0.05693386289575655, -0.1234709847640867, -0.1961303662870907, 0.10966832262800179, 0.41182260654038855, -0.2695148574602273, -0.2459790718767585, 0.10806953298419507, -0.24526061803723376, -0.1425406805653539, 0.1900370083645814, -0.053262930724789236, 0.08905973661070068, 0.09604765903204679, 0.11323245600150485, -0.1091794111352, -0.22002292840689835, 0.33179942978442545, 0.06764600385601321, 0.2635708156766163, -0.018518511159345507, 0.11698635666519598, 0.0345920103231846, -0.05343358338707023, 0.025852004414628028, -0.11594553196078373, 0.16805152587217487, 0.2421633265602092, 0.13930204763180679, 0.2681266876972384, -0.34914648143781557, -0.15471579474914404, 0.12696054917760194, 0.106603201042809, 0.11615417808190816, -0.013113218111296494, -0.19386812129782305, 0.1278075279874934, -0.1616318702076872, -0.1442348161815769, -0.08439462049605531, -0.026083175400142662, 0.018704845696791178, -0.3221070606778893, 0.06530186908914604, 0.07549374264457988, 0.041787323138366146, -0.07442509871648831, -0.14442835672137638, 0.010527432389143441, 0.09468731583199567, 0.0074054013213349715, 0.0694555552986761, 0.06166142039000988, -0.07976305218051291, -0.11737400497723785, 0.33761058622751283, -0.05776886111642751, -0.22952136191435987, 0.12751587817652357, -0.07038231916570416, -0.09783601141534745, 0.12007660244077366, 0.11238363676012442, 0.15668165040098958, -0.1353140684362087, 0.053703540497614694, -0.06289224982158177, 0.1125509184681707, 0.060414652635032935, -0.005108524962431854, 0.14162913283540143, 0.08626783690156622, 0.1230136136420899, 0.1738831976331615, -0.05266094725165102, -0.10171674342515567, -0.31484222734967865, -0.16702971434634592, -0.17052387805759078, 0.005487806349992752, -0.10877089980640449, -0.19483566361789903, 0.38177224011677835, 0.08545315716700215, 0.2738666898570955, 0.12684813788574603, 0.28633037962847285, 0.20356275694729348, 0.07665203319241604, 0.09650449219884144, 0.18247631263608735, 0.1504811828542087, 0.058216839231964614, -0.16118548846958827, 0.06279276942756648, 0.14539483555385635] |
1,801.10546 | Multi-Layer Competitive-Cooperative Framework for Performance
Enhancement of Differential Evolution | Differential Evolution (DE) is recognized as one of the most powerful
optimizers in the evolutionary algorithm (EA) family. Many DE variants were
proposed in recent years, but significant differences in performances between
them are hardly observed. Therefore, this paper suggests a multi-layer
competitive-cooperative (MLCC) framework to facilitate the competition and
cooperation of multiple DEs, which in turns, achieve a significant performance
improvement. Unlike other multi-method strategies which adopt a
multi-population based structure, with individuals only evolving in their
corresponding subpopulations, MLCC implements a parallel structure with the
entire population simultaneously monitored by multiple DEs assigned to their
corresponding layers. An individual can store, utilize and update its evolution
information in different layers based on an individual preference based layer
selecting (IPLS) mechanism and a computational resource allocation bias (RAB)
mechanism. In IPLS, individuals connect to only one favorite layer. While in
RAB, high-quality solutions are evolved by considering all the layers. Thus DEs
associated in the layers work in a competitive and cooperative manner. The
proposed MLCC framework has been implemented on several highly competitive DEs.
Experimental studies show that the MLCC variants significantly outperform the
baseline DEs as well as several state-of-the-art and up-to-date DEs on CEC
benchmark functions.
| cs.NE | differential evolution de is recognized as one of the most powerful optimizers in the evolutionary algorithm ea family many de variants were proposed in recent years but significant differences in performances between them are hardly observed therefore this paper suggests a multilayer competitivecooperative mlcc framework to facilitate the competition and cooperation of multiple des which in turns achieve a significant performance improvement unlike other multimethod strategies which adopt a multipopulation based structure with individuals only evolving in their corresponding subpopulations mlcc implements a parallel structure with the entire population simultaneously monitored by multiple des assigned to their corresponding layers an individual can store utilize and update its evolution information in different layers based on an individual preference based layer selecting ipls mechanism and a computational resource allocation bias rab mechanism in ipls individuals connect to only one favorite layer while in rab highquality solutions are evolved by considering all the layers thus des associated in the layers work in a competitive and cooperative manner the proposed mlcc framework has been implemented on several highly competitive des experimental studies show that the mlcc variants significantly outperform the baseline des as well as several stateoftheart and uptodate des on cec benchmark functions | [['differential', 'evolution', 'de', 'is', 'recognized', 'as', 'one', 'of', 'the', 'most', 'powerful', 'optimizers', 'in', 'the', 'evolutionary', 'algorithm', 'ea', 'family', 'many', 'de', 'variants', 'were', 'proposed', 'in', 'recent', 'years', 'but', 'significant', 'differences', 'in', 'performances', 'between', 'them', 'are', 'hardly', 'observed', 'therefore', 'this', 'paper', 'suggests', 'a', 'multilayer', 'competitivecooperative', 'mlcc', 'framework', 'to', 'facilitate', 'the', 'competition', 'and', 'cooperation', 'of', 'multiple', 'des', 'which', 'in', 'turns', 'achieve', 'a', 'significant', 'performance', 'improvement', 'unlike', 'other', 'multimethod', 'strategies', 'which', 'adopt', 'a', 'multipopulation', 'based', 'structure', 'with', 'individuals', 'only', 'evolving', 'in', 'their', 'corresponding', 'subpopulations', 'mlcc', 'implements', 'a', 'parallel', 'structure', 'with', 'the', 'entire', 'population', 'simultaneously', 'monitored', 'by', 'multiple', 'des', 'assigned', 'to', 'their', 'corresponding', 'layers', 'an', 'individual', 'can', 'store', 'utilize', 'and', 'update', 'its', 'evolution', 'information', 'in', 'different', 'layers', 'based', 'on', 'an', 'individual', 'preference', 'based', 'layer', 'selecting', 'ipls', 'mechanism', 'and', 'a', 'computational', 'resource', 'allocation', 'bias', 'rab', 'mechanism', 'in', 'ipls', 'individuals', 'connect', 'to', 'only', 'one', 'favorite', 'layer', 'while', 'in', 'rab', 'highquality', 'solutions', 'are', 'evolved', 'by', 'considering', 'all', 'the', 'layers', 'thus', 'des', 'associated', 'in', 'the', 'layers', 'work', 'in', 'a', 'competitive', 'and', 'cooperative', 'manner', 'the', 'proposed', 'mlcc', 'framework', 'has', 'been', 'implemented', 'on', 'several', 'highly', 'competitive', 'des', 'experimental', 'studies', 'show', 'that', 'the', 'mlcc', 'variants', 'significantly', 'outperform', 'the', 'baseline', 'des', 'as', 'well', 'as', 'several', 'stateoftheart', 'and', 'uptodate', 'des', 'on', 'cec', 'benchmark', 'functions']] | [-0.09018715404899012, 0.004409999041963601, -0.10032140714349225, 0.07042941782390699, -0.08878413640682993, -0.15810863043414428, 0.03120658927189652, 0.3957674636133015, -0.26346655884350184, -0.3662922973558307, 0.07492217800696381, -0.2689211176615208, -0.14973165550502018, 0.1813482394674793, -0.06533540689386427, 0.02758067761809798, 0.09098628697916865, -0.017107132095843552, -0.003522534688963788, -0.31271775760920717, 0.274222187664127, 0.095768668577075, 0.35642427984275854, -0.05115158134838566, 0.08963392967998515, -0.009226812712149694, -0.0526137642651156, 0.022163464960176498, -0.07926220250799815, 0.12635405283188447, 0.2940038004610688, 0.1432231313327793, 0.3100397176039405, -0.42529792631976304, -0.2115394027484581, 0.077124021606287, 0.19088040717877447, 0.0838709474017378, -0.061536253213926105, -0.2573074437631294, 0.09549313186493237, -0.2077362751675537, -0.008113047034712509, -0.059222050076932646, -0.04225869899848476, 0.04770193410076899, -0.24081328246567865, 0.05585587002104148, 0.023799521718756295, 0.03885618083644658, -0.06736286164203192, -0.18873356566997246, -0.047442678165389225, 0.14394701668061316, 0.002818068673368543, 0.01981558219471481, 0.11017167157493532, -0.10645452328870306, -0.1607806134666316, 0.34183663634670663, -0.07923955252277665, -0.16066384235862644, 0.2348033408576157, -0.03538649691268802, -0.16184234705520795, 0.07639821771648712, 0.17062022135360166, 0.1289948356617242, -0.1564903872582363, 0.03222610723547405, 0.006899710176512599, 0.17559501508483663, 0.055008385749533775, 0.0493927357555367, 0.18947072721959557, 0.19764381114160642, 0.06332007842807798, 0.052495282864256296, -0.054835983319644586, -0.15377311397664017, -0.15564898904936852, -0.13696758263511583, -0.11198837024101521, -0.034532248785253614, -0.05914800347141863, -0.14671976630110295, 0.38368247844278813, 0.15204103359021245, 0.2061068954365328, 0.045634446255862715, 0.2862887206673622, 0.004086624028277583, 0.103266960978508, 0.08072900716913864, 0.2287370758620091, 0.02153255601064302, 0.11685313871479593, -0.19786215608241037, 0.12426329050969798, 0.005793711120495573] |
1,801.10547 | On the construction of unbiased estimators for the group testing problem | Debiased estimation has long been an area of research in the group testing
literature. This has led to the development of several estimators with the goal
of bias minimization and, recently, an unbiased estimator based on sequential
binomial sampling. Previous research, however, has focused heavily on the
simple case where no misclassification is assumed and only one trait is to be
tested. In this paper, we consider the problem of unbiased estimation in these
broader areas, giving constructions of such estimators for several cases. We
show that, outside of the standard case addressed previously in the literature,
it is impossible to find any proper unbiased estimator, that is, an estimator
giving only values in the parameter space. This is shown to hold generally
under any binomial or multinomial sampling plans
| stat.ME | debiased estimation has long been an area of research in the group testing literature this has led to the development of several estimators with the goal of bias minimization and recently an unbiased estimator based on sequential binomial sampling previous research however has focused heavily on the simple case where no misclassification is assumed and only one trait is to be tested in this paper we consider the problem of unbiased estimation in these broader areas giving constructions of such estimators for several cases we show that outside of the standard case addressed previously in the literature it is impossible to find any proper unbiased estimator that is an estimator giving only values in the parameter space this is shown to hold generally under any binomial or multinomial sampling plans | [['debiased', 'estimation', 'has', 'long', 'been', 'an', 'area', 'of', 'research', 'in', 'the', 'group', 'testing', 'literature', 'this', 'has', 'led', 'to', 'the', 'development', 'of', 'several', 'estimators', 'with', 'the', 'goal', 'of', 'bias', 'minimization', 'and', 'recently', 'an', 'unbiased', 'estimator', 'based', 'on', 'sequential', 'binomial', 'sampling', 'previous', 'research', 'however', 'has', 'focused', 'heavily', 'on', 'the', 'simple', 'case', 'where', 'no', 'misclassification', 'is', 'assumed', 'and', 'only', 'one', 'trait', 'is', 'to', 'be', 'tested', 'in', 'this', 'paper', 'we', 'consider', 'the', 'problem', 'of', 'unbiased', 'estimation', 'in', 'these', 'broader', 'areas', 'giving', 'constructions', 'of', 'such', 'estimators', 'for', 'several', 'cases', 'we', 'show', 'that', 'outside', 'of', 'the', 'standard', 'case', 'addressed', 'previously', 'in', 'the', 'literature', 'it', 'is', 'impossible', 'to', 'find', 'any', 'proper', 'unbiased', 'estimator', 'that', 'is', 'an', 'estimator', 'giving', 'only', 'values', 'in', 'the', 'parameter', 'space', 'this', 'is', 'shown', 'to', 'hold', 'generally', 'under', 'any', 'binomial', 'or', 'multinomial', 'sampling', 'plans']] | [-0.0499689283915079, 0.025065304245240092, -0.10014308298436495, 0.06726923888692489, -0.08425834646376852, -0.14578982463034873, 0.030471550647276812, 0.43495450171713645, -0.22145669660530984, -0.2825779154395255, 0.16303408359302782, -0.23688777702448602, -0.135134126792232, 0.23781588194139588, -0.17322146874995759, 0.07668731524978424, 0.04192538800864266, 0.047309687554549715, -0.04499329214270872, -0.3451825712538826, 0.27863336716635295, 0.08524221917793441, 0.3124646242063206, -0.01876934909557279, 0.09097967221974754, 0.016176890700052564, -0.0626839013161281, 0.028917600045105456, -0.15665982129788833, 0.10994063385744364, 0.2663570341367561, 0.1421394845023035, 0.36782235181532225, -0.32786768718371884, -0.22576117407745466, 0.192513808926854, 0.14408196569241297, 0.12112072335126309, -0.04930147283459799, -0.2293787098238961, 0.06076779958003989, -0.1736164878973236, -0.06502776738399496, -0.04971563846517641, 0.0035012136356761822, -0.02060165109847171, -0.32093683888849156, 0.05911668437945012, 0.06887489348076857, 0.07172455891536979, -0.016313568764151288, -0.18894689515806162, 0.05630362364821709, 0.0960002239417428, 0.10864522696490614, 0.02200445206119464, 0.08466550367167935, -0.09536794911389454, -0.13329952235261983, 0.3227672555555518, 0.0013105491104607398, -0.24052986695359532, 0.1757986673409155, -0.162923416427265, -0.18826016508078633, 0.09749746280028306, 0.13041555780845765, 0.11867095110937953, -0.18955731093525313, 0.10582121908575153, -0.08887669034660435, 0.13305866277391593, 0.020725633805760972, -0.012859195575583727, 0.15718346786900209, 0.17469145664228844, 0.150014911164852, 0.12645729429070623, -0.08954230242480453, -0.08857782583128518, -0.2574499823502265, -0.1310573150547078, -0.2151974427155577, 0.0006013723663412608, -0.069330537508806, -0.21097581050394532, 0.35338803053690265, 0.18702108291909098, 0.17539830018694585, 0.050654283559952794, 0.299270980232037, 0.12482702840441981, 0.06903765974566341, 0.08516349444667307, 0.2570547574987778, 0.11097202002106664, -0.00655053320985574, -0.12373585908387143, 0.15259709598209995, -0.0008492824370757891] |
1,801.10548 | Can the cosmological dark sector be modeled by a single scalar field? | In a previous paper it was shown that a minimally coupled scalar field of
mass $M \sim H_0$ can describe both components of the dark sector in a unified
way. In the solution found, the dark energy component decays linearly with the
Hubble parameter, with a homogeneous creation of dark matter. In the present
note we show that a $\Lambda$CDM dark sector can also be modeled by such a
single field. More generally, we show that the system of Klein-Gordon and
Einstein equations admits a uniparametric family of solutions that is
equivalent to a non-adiabatic (with zero sound speed) generalised Chaplygin
gas.
| gr-qc astro-ph.CO hep-th | in a previous paper it was shown that a minimally coupled scalar field of mass m sim h_0 can describe both components of the dark sector in a unified way in the solution found the dark energy component decays linearly with the hubble parameter with a homogeneous creation of dark matter in the present note we show that a lambdacdm dark sector can also be modeled by such a single field more generally we show that the system of kleingordon and einstein equations admits a uniparametric family of solutions that is equivalent to a nonadiabatic with zero sound speed generalised chaplygin gas | [['in', 'a', 'previous', 'paper', 'it', 'was', 'shown', 'that', 'a', 'minimally', 'coupled', 'scalar', 'field', 'of', 'mass', 'm', 'sim', 'h_0', 'can', 'describe', 'both', 'components', 'of', 'the', 'dark', 'sector', 'in', 'a', 'unified', 'way', 'in', 'the', 'solution', 'found', 'the', 'dark', 'energy', 'component', 'decays', 'linearly', 'with', 'the', 'hubble', 'parameter', 'with', 'a', 'homogeneous', 'creation', 'of', 'dark', 'matter', 'in', 'the', 'present', 'note', 'we', 'show', 'that', 'a', 'lambdacdm', 'dark', 'sector', 'can', 'also', 'be', 'modeled', 'by', 'such', 'a', 'single', 'field', 'more', 'generally', 'we', 'show', 'that', 'the', 'system', 'of', 'kleingordon', 'and', 'einstein', 'equations', 'admits', 'a', 'uniparametric', 'family', 'of', 'solutions', 'that', 'is', 'equivalent', 'to', 'a', 'nonadiabatic', 'with', 'zero', 'sound', 'speed', 'generalised', 'chaplygin', 'gas']] | [-0.1661451263518721, 0.16920341698078475, -0.1297561107614242, 0.056934837504134826, -0.10051588857929934, -0.1447623627461201, -0.06990505595618457, 0.2997950117067233, -0.21921525260104852, -0.2954975561713617, 0.02586744285380358, -0.2504435270184688, -0.09708856478077817, 0.1699575962037688, 0.0027540382408701323, 0.0020185526067792786, 0.039588480539546875, 0.06654532548889298, -0.03692332203682585, -0.2701158402213717, 0.35153392357432156, 0.009525281221916279, 0.21493538043133037, -0.006935203479895112, 0.11869347743763059, -0.07161215425231586, 0.005998177202783671, 0.0579892151769908, -0.16036809912075828, 0.049471243260674834, 0.19180687425621584, 0.1055913934228467, 0.22996330652020724, -0.3745867603038456, -0.249251803410623, 0.17006446015747154, 0.19156700400087764, 0.11009034678321697, -0.080310282428257, -0.291028658074199, 0.03220316913782382, -0.22454514229834519, -0.16459526253553727, -0.052739791010561234, -0.009631470080885086, -0.013810481588520548, -0.25693153272675096, 0.12615495282607656, -0.006737570744007826, -0.0716752545798526, -0.10140310886188172, -0.048576051340776256, -0.027922014504963278, -0.05532981759375509, 0.07121326177673158, 0.06179022851089636, 0.12362958704504896, -0.1817482359565831, -0.045461057928418196, 0.42167329162019124, -0.21240455735538738, -0.2277294620711758, 0.15169525934456318, -0.12514019454829395, -0.1016638339497149, 0.10262824493624709, 0.1066952618021591, 0.09672120696518059, -0.17561381585056, 0.16173264157316902, -0.07685651395848825, 0.23035246292220465, 0.04714748873968846, -0.010662025160284019, 0.2821136238601278, 0.13491061602989624, 0.09171083676975446, 0.10402992001949243, -0.039202534420160105, -0.072555454530041, -0.34759284844439403, -0.20535653661799563, -0.11595695188460763, 0.06985533733934383, -0.07948658033944643, -0.1622477354828209, 0.37639808188210805, 0.09393614578955606, 0.180010138599969, 0.062431732010023264, 0.2849556764350364, 0.11218687511213563, 0.03156473800339097, 0.1076290775775252, 0.2860610525068991, 0.14797883695356695, 0.09517428708974929, -0.2079999639707453, -0.06996603253041851, 0.006615824399369897] |
1,801.10549 | Lattice dynamics of ASb2O6 (A=Cu,Co) with trirutile structure | Raman spectroscopy experiments on single crystals of CuSb2O6 and CoSb2O6
quasi-one-dimensional antiferromagnets with trirutile crystal structure were
performed, with a focus on the first material. The observed Raman-active phonon
modes and previously reported infrared-active modes were identified with the
aid of ab-initio lattice dynamics calculations. The structural transition
between monoclinic beta-CuSb2O6 and tetragonal alpha-CuSb2O6 phases at Ts=400 K
is manifested in our spectra by a "repulsion" of two accidentally
quasi-degenerate symmetric modes below Ts, caused by a phonon mixing effect
that is only operative in the monoclinic beta-CuSb2O6 phase due to symmetry
restrictions. Also, two specific phonons, associated with CuO6 octahedra
rotation and with a Jahn-Teller elongation mode, soften and broaden appreciably
as T -> Ts. A crossover from a displacive to an order-disorder transition at Ts
is inferred.
| cond-mat.str-el | raman spectroscopy experiments on single crystals of cusb2o6 and cosb2o6 quasionedimensional antiferromagnets with trirutile crystal structure were performed with a focus on the first material the observed ramanactive phonon modes and previously reported infraredactive modes were identified with the aid of abinitio lattice dynamics calculations the structural transition between monoclinic betacusb2o6 and tetragonal alphacusb2o6 phases at ts400 k is manifested in our spectra by a repulsion of two accidentally quasidegenerate symmetric modes below ts caused by a phonon mixing effect that is only operative in the monoclinic betacusb2o6 phase due to symmetry restrictions also two specific phonons associated with cuo6 octahedra rotation and with a jahnteller elongation mode soften and broaden appreciably as t ts a crossover from a displacive to an orderdisorder transition at ts is inferred | [['raman', 'spectroscopy', 'experiments', 'on', 'single', 'crystals', 'of', 'cusb2o6', 'and', 'cosb2o6', 'quasionedimensional', 'antiferromagnets', 'with', 'trirutile', 'crystal', 'structure', 'were', 'performed', 'with', 'a', 'focus', 'on', 'the', 'first', 'material', 'the', 'observed', 'ramanactive', 'phonon', 'modes', 'and', 'previously', 'reported', 'infraredactive', 'modes', 'were', 'identified', 'with', 'the', 'aid', 'of', 'abinitio', 'lattice', 'dynamics', 'calculations', 'the', 'structural', 'transition', 'between', 'monoclinic', 'betacusb2o6', 'and', 'tetragonal', 'alphacusb2o6', 'phases', 'at', 'ts400', 'k', 'is', 'manifested', 'in', 'our', 'spectra', 'by', 'a', 'repulsion', 'of', 'two', 'accidentally', 'quasidegenerate', 'symmetric', 'modes', 'below', 'ts', 'caused', 'by', 'a', 'phonon', 'mixing', 'effect', 'that', 'is', 'only', 'operative', 'in', 'the', 'monoclinic', 'betacusb2o6', 'phase', 'due', 'to', 'symmetry', 'restrictions', 'also', 'two', 'specific', 'phonons', 'associated', 'with', 'cuo6', 'octahedra', 'rotation', 'and', 'with', 'a', 'jahnteller', 'elongation', 'mode', 'soften', 'and', 'broaden', 'appreciably', 'as', 't', 'ts', 'a', 'crossover', 'from', 'a', 'displacive', 'to', 'an', 'orderdisorder', 'transition', 'at', 'ts', 'is', 'inferred']] | [-0.14744802652552846, 0.3059540227234228, -0.03598476220762021, -0.04681428545631743, -0.08779031397072506, -0.16112535928574498, 0.1359446096180587, 0.4339106614228155, -0.26608056087260606, -0.22904909957108682, 0.015075559435855047, -0.35273081752553687, -0.13469634582212225, 0.12567014830973244, 0.11529876489085375, -0.004883296604527802, -0.020885502430992048, -0.010940262209051518, -0.11716238041522867, -0.12497394277759996, 0.2515950900651362, 0.03877601729415846, 0.33334409164600687, 0.025858875822092665, 0.02487779411174296, -0.03984839263272884, 0.1340437871633006, -0.013780136516348261, -0.17612908961716323, 0.0009890367948740232, 0.2717068310117074, -0.12553884238997076, 0.1525336970349957, -0.4050754894670404, -0.23481161230946052, -0.007545840700198018, 0.13670919051433944, 0.1351868262987767, -0.05452259126325428, -0.3010156413876131, 0.026577616614274314, -0.0950951377847962, -0.0807794967029801, -0.09062583981173448, -0.05650256681790362, -0.040725090819578924, -0.23580101193320083, 0.14231594700388206, 0.04943344530221991, 0.16947230327244395, -0.12644316248794193, -0.11953742606145498, -0.13308858124302608, 0.010256479173654416, 0.09577921022027426, 0.057718697664343184, 0.1312727554344389, -0.01954863981160595, -0.13813280532533517, 0.4673711330492477, -0.026449976710327824, -0.02363906763913873, 0.1699114509965064, -0.187668518001165, -0.11128051706864575, 0.22875894942763644, 0.09306431702122504, 0.06927495056068617, -0.06924083248423947, 0.036915715031428875, 0.050281386811011394, 0.2097204822520191, 0.08988668254889609, 0.053014646650704204, 0.20589653554097673, 0.14250515863207763, -0.017726920445861875, 0.1638406758410398, -0.10246471866829794, -0.032047341822944275, -0.20624309746151576, -0.09580786695100794, -0.20229791365749944, -0.006146636497626295, -0.04936503126516415, -0.14198939012149808, 0.3806494842836878, 0.04016658655412163, 0.2102781259073097, -0.06235847770824234, 0.2060080581625206, 0.06824351848316852, 0.1104415946613356, -0.0023019584668723895, 0.28266526724318747, 0.1965662783897314, 0.08444891942829108, -0.36448597542933936, 0.05294057222648112, 0.009538350176432581] |
1,801.1055 | Message Transmission over Classical Quantum Channels with a Jammer with
Side Information: Message Transmission Capacity and Resources | In this paper we propose a new model for arbitrarily varying
classical-quantum channels. In this model a jammer has side information. We
consider two scenarios. In the first scenario the jammer knows the channel
input, while in the second scenario the jammer knows both the channel input and
the message. The transmitter and receiver share a secret random key with a
vanishing key rate. We determine the capacity for both average and maximum
error criteria for both scenarios. We also establish the strong converse. We
show that all these corresponding capacities are equal, which means that
additionally revealing the message to the jammer does not change the capacity.
| cs.IT math.IT quant-ph | in this paper we propose a new model for arbitrarily varying classicalquantum channels in this model a jammer has side information we consider two scenarios in the first scenario the jammer knows the channel input while in the second scenario the jammer knows both the channel input and the message the transmitter and receiver share a secret random key with a vanishing key rate we determine the capacity for both average and maximum error criteria for both scenarios we also establish the strong converse we show that all these corresponding capacities are equal which means that additionally revealing the message to the jammer does not change the capacity | [['in', 'this', 'paper', 'we', 'propose', 'a', 'new', 'model', 'for', 'arbitrarily', 'varying', 'classicalquantum', 'channels', 'in', 'this', 'model', 'a', 'jammer', 'has', 'side', 'information', 'we', 'consider', 'two', 'scenarios', 'in', 'the', 'first', 'scenario', 'the', 'jammer', 'knows', 'the', 'channel', 'input', 'while', 'in', 'the', 'second', 'scenario', 'the', 'jammer', 'knows', 'both', 'the', 'channel', 'input', 'and', 'the', 'message', 'the', 'transmitter', 'and', 'receiver', 'share', 'a', 'secret', 'random', 'key', 'with', 'a', 'vanishing', 'key', 'rate', 'we', 'determine', 'the', 'capacity', 'for', 'both', 'average', 'and', 'maximum', 'error', 'criteria', 'for', 'both', 'scenarios', 'we', 'also', 'establish', 'the', 'strong', 'converse', 'we', 'show', 'that', 'all', 'these', 'corresponding', 'capacities', 'are', 'equal', 'which', 'means', 'that', 'additionally', 'revealing', 'the', 'message', 'to', 'the', 'jammer', 'does', 'not', 'change', 'the', 'capacity']] | [-0.2156496548034031, 0.03503123377083318, -0.04868331364424968, 0.06552398361101816, -0.05165359984083032, -0.30922243204312744, 0.14681495089812582, 0.3703980603755486, -0.29321564237276715, -0.24768700637785648, 0.11176450122837667, -0.25501446788095766, -0.14791834835152798, 0.1075567649030644, -0.1323983823601372, 0.033401994750386584, 0.007804486674204882, 0.12728461552480305, -0.01909900966738523, -0.2724000143525363, 0.3351573534999733, 0.07169209983786223, 0.3032378199924197, 0.07381030437709005, 0.10691384339480903, 0.035906836537092375, 0.0201637035028802, -0.07626106745684175, -0.15423631238283836, 0.035055567872607045, 0.25592228778448234, 0.15683094370265113, 0.26779361795289097, -0.3931008940131438, -0.2621699749336888, 0.14328902118399534, 0.1326051656053298, 0.14675610526615787, -0.052045052172616124, -0.2569691236130893, 0.14115118083362985, -0.2054355840836824, 0.0071703590478541124, 0.0511866465849043, -0.08537414590655654, 0.027043978079476533, -0.3440935586501534, 0.016432135833451024, 0.07214455277210584, -0.005501538627194586, -0.059429679014202624, -0.09405558691273823, 0.030428873974381498, 0.23189085427913125, 0.03480519535865083, -0.02513597760871225, 0.07116924339250007, -0.14053444631496892, -0.10877684607274002, 0.3179773590247216, -0.05681885100030168, -0.2234341590234113, 0.13239168951770774, -0.15594321435006955, -0.09274175139230297, 0.0925456704183792, 0.23006814243961815, 0.08243664951684575, -0.15804916753916554, 0.026169961213276513, -0.07043173786735644, 0.20488789661235554, 0.04543039049625535, 0.11602210461300004, 0.1659262114532154, 0.09234071021502907, 0.10697421911862437, 0.19010877759299344, -0.13588542112632207, -0.1339271899735279, -0.33428082889359856, -0.1721003393564994, -0.22055442477856693, -0.006038492659610239, -0.10008484982581986, -0.035242862068116665, 0.35511676885653287, 0.1849768482433218, 0.16696642043017265, 0.10984183175390137, 0.37295833851762666, 0.08217051853123983, 0.00016225272806709486, 0.19633086909608985, 0.2314029779906074, 0.106978909690278, 0.08731275790207157, -0.18002558683494702, 0.14301132630660301, -0.018114527376989525] |
1,801.10551 | Decrease in hysteresis of planetary climate for planets with long solar
days | The ice-albedo feedback on rapidly-rotating terrestrial planets in the
habitable zone can lead to abrupt transitions (bifurcations) between a warm and
a snowball (ice-covered) state, bistability between these states, and
hysteresis in planetary climate. This is important for planetary habitability
because snowball events may trigger rises in the complexity of life, but could
also endanger complex life that already exists. Recent work has shown that
planets tidally locked in synchronous rotation states will transition smoothly
into the snowball state rather than experiencing bifurcations. Here we
investigate the structure of snowball bifurcations on planets that are tidally
influenced, but not synchronously rotating, so that they experience long solar
days. We use PlaSIM, an intermediate-complexity global climate model, with a
thermodynamic mixed layer ocean and the Sun's spectrum. We find that the amount
of hysteresis (range in stellar flux for which there is bistability in climate)
is significantly reduced for solar days with lengths of tens of Earth days, and
disappears for solar days of hundreds of Earth days. These results suggest that
tidally influenced planets orbiting M and K-stars that are not synchronously
rotating could have much less hysteresis associated with the snowball
bifurcations than they would if they were rapidly rotating. This implies that
the amount of time it takes them to escape a snowball state via CO$_2$
outgassing would be greatly reduced, as would the period of cycling between the
warm and snowball state if they have a low CO$_2$ outgassing rate.
| astro-ph.EP | the icealbedo feedback on rapidlyrotating terrestrial planets in the habitable zone can lead to abrupt transitions bifurcations between a warm and a snowball icecovered state bistability between these states and hysteresis in planetary climate this is important for planetary habitability because snowball events may trigger rises in the complexity of life but could also endanger complex life that already exists recent work has shown that planets tidally locked in synchronous rotation states will transition smoothly into the snowball state rather than experiencing bifurcations here we investigate the structure of snowball bifurcations on planets that are tidally influenced but not synchronously rotating so that they experience long solar days we use plasim an intermediatecomplexity global climate model with a thermodynamic mixed layer ocean and the suns spectrum we find that the amount of hysteresis range in stellar flux for which there is bistability in climate is significantly reduced for solar days with lengths of tens of earth days and disappears for solar days of hundreds of earth days these results suggest that tidally influenced planets orbiting m and kstars that are not synchronously rotating could have much less hysteresis associated with the snowball bifurcations than they would if they were rapidly rotating this implies that the amount of time it takes them to escape a snowball state via co_2 outgassing would be greatly reduced as would the period of cycling between the warm and snowball state if they have a low co_2 outgassing rate | [['the', 'icealbedo', 'feedback', 'on', 'rapidlyrotating', 'terrestrial', 'planets', 'in', 'the', 'habitable', 'zone', 'can', 'lead', 'to', 'abrupt', 'transitions', 'bifurcations', 'between', 'a', 'warm', 'and', 'a', 'snowball', 'icecovered', 'state', 'bistability', 'between', 'these', 'states', 'and', 'hysteresis', 'in', 'planetary', 'climate', 'this', 'is', 'important', 'for', 'planetary', 'habitability', 'because', 'snowball', 'events', 'may', 'trigger', 'rises', 'in', 'the', 'complexity', 'of', 'life', 'but', 'could', 'also', 'endanger', 'complex', 'life', 'that', 'already', 'exists', 'recent', 'work', 'has', 'shown', 'that', 'planets', 'tidally', 'locked', 'in', 'synchronous', 'rotation', 'states', 'will', 'transition', 'smoothly', 'into', 'the', 'snowball', 'state', 'rather', 'than', 'experiencing', 'bifurcations', 'here', 'we', 'investigate', 'the', 'structure', 'of', 'snowball', 'bifurcations', 'on', 'planets', 'that', 'are', 'tidally', 'influenced', 'but', 'not', 'synchronously', 'rotating', 'so', 'that', 'they', 'experience', 'long', 'solar', 'days', 'we', 'use', 'plasim', 'an', 'intermediatecomplexity', 'global', 'climate', 'model', 'with', 'a', 'thermodynamic', 'mixed', 'layer', 'ocean', 'and', 'the', 'suns', 'spectrum', 'we', 'find', 'that', 'the', 'amount', 'of', 'hysteresis', 'range', 'in', 'stellar', 'flux', 'for', 'which', 'there', 'is', 'bistability', 'in', 'climate', 'is', 'significantly', 'reduced', 'for', 'solar', 'days', 'with', 'lengths', 'of', 'tens', 'of', 'earth', 'days', 'and', 'disappears', 'for', 'solar', 'days', 'of', 'hundreds', 'of', 'earth', 'days', 'these', 'results', 'suggest', 'that', 'tidally', 'influenced', 'planets', 'orbiting', 'm', 'and', 'kstars', 'that', 'are', 'not', 'synchronously', 'rotating', 'could', 'have', 'much', 'less', 'hysteresis', 'associated', 'with', 'the', 'snowball', 'bifurcations', 'than', 'they', 'would', 'if', 'they', 'were', 'rapidly', 'rotating', 'this', 'implies', 'that', 'the', 'amount', 'of', 'time', 'it', 'takes', 'them', 'to', 'escape', 'a', 'snowball', 'state', 'via', 'co_2', 'outgassing', 'would', 'be', 'greatly', 'reduced', 'as', 'would', 'the', 'period', 'of', 'cycling', 'between', 'the', 'warm', 'and', 'snowball', 'state', 'if', 'they', 'have', 'a', 'low', 'co_2', 'outgassing', 'rate']] | [-0.15185455108826038, 0.30487831741042765, -0.04585992554854219, 0.06654380426556256, -0.06567893088785663, -0.08675622749487283, 0.10965800058640877, 0.3527591353217178, -0.21232784423045814, -0.31645512191287467, 0.12079189027805234, -0.2639866694750517, -0.1629631513003413, 0.21747911787772006, -0.11966706300537588, -0.020428189522981522, 0.1523095205064035, -0.008302190336264639, -0.030413954308181772, -0.23600148821897315, 0.2272240760987203, 0.06487249341551904, 0.09763843580359907, -0.006338584782707087, 0.01107300317620115, -0.13744037121020777, 0.07173053793996714, -0.057481249249655246, -0.152416754841427, -0.010187087195864093, 0.257868993435239, 0.16050282277203612, 0.25157190838717536, -0.4996634090986149, -0.2775732558297277, 0.1440778327790815, 0.1679059244968273, 0.07368120527107637, -0.03872504093829895, -0.24951241198359939, 0.050125341000823005, -0.19640022993409706, -0.1348151916086122, -0.0433447682471187, 0.10557817493722517, -0.02757472787526528, -0.22529597325971995, 0.08668258725586463, 0.0902685531330728, 0.12269924468276525, -0.1346401693898257, -0.09054291157680468, -0.1523313116945265, 0.10530005868451493, 0.06724046772765571, 0.0026926460698411757, 0.22238104357556612, -0.055830126864463855, -0.01744604155942491, 0.38203055730928887, -0.10188816514485631, -0.05723462835586162, 0.26935697807700454, -0.22650191296417066, -0.09556557670036339, 0.19962420290405, 0.17849992776391146, 0.09590241314513694, -0.09295978809830469, -0.05285984277449751, -0.00887037633818578, 0.1988714808548337, 0.11809762166750735, 0.02480610092879568, 0.3619850144449453, 0.17196272855908168, 0.11536626420328738, 0.07384207086166206, -0.1384783456761461, -0.14750291094751147, -0.1422525290121926, -0.11753138240068431, -0.09040893843769261, 0.059626030358279875, -0.046490725231047435, -0.15794923025460764, 0.36733725877409734, 0.14934659888249258, 0.15834108945902114, -0.014495940081805849, 0.28144370597727797, 0.07924026984543206, 0.09007182326379813, 0.12877034674180143, 0.34853091098966055, 0.07759443431069361, 0.1349215655139199, -0.24253593920673164, 0.17394493852402831, -0.017711214309198007] |
1,801.10552 | Pilot-Assisted Short-Packet Transmission over Multiantenna Fading
Channels: A 5G Case Study | Leveraging recent results in finite-blocklength information theory, we
investigate the problem of designing a control channel in a 5G system. The
setup involves the transmission, under stringent latency and reliability
constraints, of a short data packet containing a small information payload,
over a propagation channel that offers limited frequency diversity and no time
diversity. We present an achievability bound, built upon the random-coding
union bound with parameter $s$ (Martinez & Guill\'en i F\`abregas, 2011), which
relies on quadrature phase-shift keying modulation, pilot-assisted transmission
to estimate the fading channel, and scaled nearest-neighbor decoding at the
receiver. Using our achievability bound, we determine how many pilot symbols
should be transmitted to optimally trade between channel-estimation errors and
rate loss due to pilot overhead. Our analysis also reveals the importance of
using multiple antennas at the transmitter and/or the receiver to provide the
spatial diversity needed to meet the stringent reliability constraint.
| cs.IT math.IT | leveraging recent results in finiteblocklength information theory we investigate the problem of designing a control channel in a 5g system the setup involves the transmission under stringent latency and reliability constraints of a short data packet containing a small information payload over a propagation channel that offers limited frequency diversity and no time diversity we present an achievability bound built upon the randomcoding union bound with parameter s martinez guillen i fabregas 2011 which relies on quadrature phaseshift keying modulation pilotassisted transmission to estimate the fading channel and scaled nearestneighbor decoding at the receiver using our achievability bound we determine how many pilot symbols should be transmitted to optimally trade between channelestimation errors and rate loss due to pilot overhead our analysis also reveals the importance of using multiple antennas at the transmitter andor the receiver to provide the spatial diversity needed to meet the stringent reliability constraint | [['leveraging', 'recent', 'results', 'in', 'finiteblocklength', 'information', 'theory', 'we', 'investigate', 'the', 'problem', 'of', 'designing', 'a', 'control', 'channel', 'in', 'a', '5g', 'system', 'the', 'setup', 'involves', 'the', 'transmission', 'under', 'stringent', 'latency', 'and', 'reliability', 'constraints', 'of', 'a', 'short', 'data', 'packet', 'containing', 'a', 'small', 'information', 'payload', 'over', 'a', 'propagation', 'channel', 'that', 'offers', 'limited', 'frequency', 'diversity', 'and', 'no', 'time', 'diversity', 'we', 'present', 'an', 'achievability', 'bound', 'built', 'upon', 'the', 'randomcoding', 'union', 'bound', 'with', 'parameter', 's', 'martinez', 'guillen', 'i', 'fabregas', '2011', 'which', 'relies', 'on', 'quadrature', 'phaseshift', 'keying', 'modulation', 'pilotassisted', 'transmission', 'to', 'estimate', 'the', 'fading', 'channel', 'and', 'scaled', 'nearestneighbor', 'decoding', 'at', 'the', 'receiver', 'using', 'our', 'achievability', 'bound', 'we', 'determine', 'how', 'many', 'pilot', 'symbols', 'should', 'be', 'transmitted', 'to', 'optimally', 'trade', 'between', 'channelestimation', 'errors', 'and', 'rate', 'loss', 'due', 'to', 'pilot', 'overhead', 'our', 'analysis', 'also', 'reveals', 'the', 'importance', 'of', 'using', 'multiple', 'antennas', 'at', 'the', 'transmitter', 'andor', 'the', 'receiver', 'to', 'provide', 'the', 'spatial', 'diversity', 'needed', 'to', 'meet', 'the', 'stringent', 'reliability', 'constraint']] | [-0.26960383542832367, 0.04095569787933855, -0.06731131825228634, 0.033440320388268246, -0.09244875244473164, -0.236929031776353, 0.18870051841957963, 0.34836702938286623, -0.25570425009798436, -0.2988866332056774, 0.11284861067582404, -0.24107319383951678, -0.13611886688851796, 0.18240493322250617, -0.12162658189847862, 0.07385820252179377, 0.047890057654253075, 0.017863426085277998, -0.04192383417885016, -0.3003064260539301, 0.25795133262207465, 0.15719550805717555, 0.34915427370693813, 0.05340934600356371, 0.08297380048711943, 0.0676049006782903, -0.049074274101326254, -0.11991327258815267, -0.14712507159752672, 0.09703491164646967, 0.2901904267309626, 0.21299598911431852, 0.23669925482221404, -0.4084354501952525, -0.25602917064006636, 0.06867664786321777, 0.14308166937652317, 0.10174345665177344, -0.028239584142234507, -0.2768757098677511, 0.07846362644895202, -0.19633917786263336, -0.028372898292379316, 0.03075966490179199, -0.05781766088033209, 0.046644468208914304, -0.3394643320150825, 0.029080724425029427, 0.003935204559088159, 0.038910417475414516, -0.010885881139662396, -0.12049761763219499, 0.02808719301646968, 0.14105124045543524, 0.004876413428522393, 0.004907367448480863, 0.06100801341544495, -0.021224086569641167, -0.0740014355515643, 0.31200782737859406, -0.03852310974378975, -0.21297735906503842, 0.1269129126496632, -0.10751927244856314, -0.09189188244457984, 0.18514341306373744, 0.25212631014858367, 0.029228138352497195, -0.1640637659049612, 0.019690440962927377, 0.019809860660105337, 0.25681198392139404, 0.12067208888300625, 0.17213242497139922, 0.1369674379880331, 0.17732201767039998, 0.10992365697245145, 0.13923809271017534, -0.15274145038082537, -0.09259470479030694, -0.26280838331931466, -0.06759938327914347, -0.22256222876663112, 0.003147809906406518, -0.1071149385546106, -0.04832177381759801, 0.3253931245152034, 0.14736477555833807, 0.13007386770023374, 0.1223619122851678, 0.3925045919002724, 0.0948185439904214, 0.04018754275439649, 0.11614758143404207, 0.20012758576570927, 0.13807385144311757, 0.09085741229782983, -0.23282037672608913, 0.08580225783789873, -0.01734925711964618] |
1,801.10553 | Some particular norm in the Sobolev space $H^{1}[a,b].$ | This paper is a continuation of the recent paper of the author, where a
certain reproducing kernel Hilbert space $X_{\mathcal{S}}$ was constructed. The
norm in $X_{\mathcal{S}}$ is related to a certain generalized isoperimetric
inequality in ${\mathbb R^2}$. In the present paper we give an alternative
description of the space $X_{\mathcal{S}}$, which appears to be a Sobolev space
$H^{1}[a,b]$ with some special norm.
| math.FA | this paper is a continuation of the recent paper of the author where a certain reproducing kernel hilbert space x_mathcals was constructed the norm in x_mathcals is related to a certain generalized isoperimetric inequality in mathbb r2 in the present paper we give an alternative description of the space x_mathcals which appears to be a sobolev space h1ab with some special norm | [['this', 'paper', 'is', 'a', 'continuation', 'of', 'the', 'recent', 'paper', 'of', 'the', 'author', 'where', 'a', 'certain', 'reproducing', 'kernel', 'hilbert', 'space', 'x_mathcals', 'was', 'constructed', 'the', 'norm', 'in', 'x_mathcals', 'is', 'related', 'to', 'a', 'certain', 'generalized', 'isoperimetric', 'inequality', 'in', 'mathbb', 'r2', 'in', 'the', 'present', 'paper', 'we', 'give', 'an', 'alternative', 'description', 'of', 'the', 'space', 'x_mathcals', 'which', 'appears', 'to', 'be', 'a', 'sobolev', 'space', 'h1ab', 'with', 'some', 'special', 'norm']] | [-0.12913251532271744, 0.04393734340767203, -0.10547612967333876, 0.07168456780791824, -0.10261497916203112, -0.0867842242512251, -0.0632342518356088, 0.30753602003378255, -0.29108452539320195, -0.18367100029342598, 0.13974288617628777, -0.22664791174728663, -0.17586211454603942, 0.16375958213522548, -0.1735309348291447, 0.04775628576528341, 0.009900577982226688, 0.07258520629857818, -0.12570596204304527, -0.2829420842951344, 0.39975309148505933, 0.03887239880221445, 0.18678733503686323, 0.05816388163234918, 0.06573747129239622, -0.03556985921046186, -0.00030458056097549776, -0.014575064987330999, -0.2170541591701969, 0.2089085154190299, 0.2651017578018288, 0.10358429115806375, 0.3146964427113773, -0.3438742572982465, -0.2021630603384467, 0.2205340590312957, 0.13236956907466293, 0.014458712045809315, -0.029974302502288934, -0.299197941089064, 0.003581303765156096, -0.13877515720143432, -0.15322326932613167, -0.08939411473059614, 0.016908133785510735, -0.0018346467686276282, -0.30967878813915434, 0.04894507037956388, 0.08471111051227537, 0.03883446703079126, -0.12064203312019667, -0.05961372167803347, 0.06540141404876786, 0.016357545282751802, 0.02502933531368692, 0.17692214392516162, 0.009423469727945274, -0.034254518649240416, -0.06586491199390541, 0.35808186936042, -0.04732274794256345, -0.23520831595505437, 0.09195527295401741, -0.1733225566905833, -0.16346697222381348, 0.047485414901823404, 0.12169996592696876, 0.14441160670286346, -0.11244232865471032, 0.1917873367652177, -0.14968374029042258, 0.07951676355855118, 0.0863037238107814, 0.04593701074801145, 0.026853425608527277, 0.1284732534399917, 0.1077657726090101, 0.18449175079736196, -0.030305166586091923, -0.09050168989286307, -0.39913386935668604, -0.2382295238710339, -0.2001293414993392, 0.07779829320873344, -0.0913399776083327, -0.1949674100164444, 0.37104749082467486, 0.049702326639465264, 0.2524207588210101, 0.06958977405109533, 0.20784228568476054, 0.13113875270280387, 0.019429409455868504, 0.05729597667232156, 0.1724354779040779, 0.13873924020557635, 0.08151681147395604, -0.11532427912912212, 0.026120110168947927, 0.2029433638127821] |
1,801.10554 | Structure Relations of Classical Orthogonal Polynomials in the Quadratic
and $q$-Quadratic Variable | We prove an equivalence between the existence of the first structure relation
satisfied by a sequence of monic orthogonal polynomials
$\{P_n\}_{n=0}^{\infty}$, the orthogonality of the second derivatives
$\{\mathbb{D}_{x}^2P_n\}_{n= 2}^{\infty}$ and a generalized Sturm-Liouville
type equation. Our treatment of the generalized Bochner theorem leads to
explicit solutions of the difference equation [Vinet L., Zhedanov A., J.
Comput. Appl. Math. 211 (2008), 45-56], which proves that the only monic
orthogonal polynomials that satisfy the first structure relation are Wilson
polynomials, continuous dual Hahn polynomials, Askey-Wilson polynomials and
their special or limiting cases as one or more parameters tend to $\infty$.
This work extends our previous result [arXiv:1711.03349] concerning a
conjecture due to Ismail. We also derive a second structure relation for
polynomials satisfying the first structure relation.
| math.CA | we prove an equivalence between the existence of the first structure relation satisfied by a sequence of monic orthogonal polynomials p_n_n0infty the orthogonality of the second derivatives mathbbd_x2p_n_n 2infty and a generalized sturmliouville type equation our treatment of the generalized bochner theorem leads to explicit solutions of the difference equation vinet l zhedanov a j comput appl math 211 2008 4556 which proves that the only monic orthogonal polynomials that satisfy the first structure relation are wilson polynomials continuous dual hahn polynomials askeywilson polynomials and their special or limiting cases as one or more parameters tend to infty this work extends our previous result arxiv171103349 concerning a conjecture due to ismail we also derive a second structure relation for polynomials satisfying the first structure relation | [['we', 'prove', 'an', 'equivalence', 'between', 'the', 'existence', 'of', 'the', 'first', 'structure', 'relation', 'satisfied', 'by', 'a', 'sequence', 'of', 'monic', 'orthogonal', 'polynomials', 'p_n_n0infty', 'the', 'orthogonality', 'of', 'the', 'second', 'derivatives', 'mathbbd_x2p_n_n', '2infty', 'and', 'a', 'generalized', 'sturmliouville', 'type', 'equation', 'our', 'treatment', 'of', 'the', 'generalized', 'bochner', 'theorem', 'leads', 'to', 'explicit', 'solutions', 'of', 'the', 'difference', 'equation', 'vinet', 'l', 'zhedanov', 'a', 'j', 'comput', 'appl', 'math', '211', '2008', '4556', 'which', 'proves', 'that', 'the', 'only', 'monic', 'orthogonal', 'polynomials', 'that', 'satisfy', 'the', 'first', 'structure', 'relation', 'are', 'wilson', 'polynomials', 'continuous', 'dual', 'hahn', 'polynomials', 'askeywilson', 'polynomials', 'and', 'their', 'special', 'or', 'limiting', 'cases', 'as', 'one', 'or', 'more', 'parameters', 'tend', 'to', 'infty', 'this', 'work', 'extends', 'our', 'previous', 'result', 'arxiv171103349', 'concerning', 'a', 'conjecture', 'due', 'to', 'ismail', 'we', 'also', 'derive', 'a', 'second', 'structure', 'relation', 'for', 'polynomials', 'satisfying', 'the', 'first', 'structure', 'relation']] | [-0.1719473880191326, 0.03460473338687675, -0.09731295291803838, 0.05214320584219252, -0.14959156707050356, -0.13607936876076387, 0.031000025757792884, 0.2877783886633995, -0.30545826222013106, -0.2068169619282329, 0.07793613341428733, -0.2404332875607278, -0.17873103900365833, 0.1542044203099984, -0.09301231917546593, 0.04018510465521547, 0.030047579335306232, -0.013321388232695863, -0.14799287859577595, -0.2787359857863588, 0.3373463770367084, -0.002278621613267597, 0.22796177232521586, -0.002228985858581415, 0.10418331461610288, 0.004648041361526442, -0.035044045634264866, -0.1133108812778895, -0.16080879851311117, 0.11103449997537565, 0.25017914774153777, 0.07952064918202718, 0.24627474801069715, -0.3209157246732857, -0.10841590094160501, 0.17264902609498883, 0.12738348242667755, -0.002407344842776353, 0.04049616242222757, -0.26296791215465076, 0.036882630368123, -0.1591575389786631, -0.22519912606302073, -0.07202726244222282, 0.0484907309244561, 0.08150132068307935, -0.3200972766626808, 0.11837621231358006, 0.17995981514696183, 0.07814753254708963, -0.04412118964487823, -0.16267218978742395, -0.027535647606265132, 0.03187501577781589, -0.01452857096172203, 0.04098091689809188, -0.055813925973010985, -0.04861875389308888, -0.13134427395141948, 0.3522109050848862, -0.009905947016446086, -0.23583871568363857, 0.11824709409847856, -0.14953355329504947, -0.2140754971263279, 0.05721705041586079, 0.08634563555516969, 0.155120564461875, -0.10432254305919557, 0.14641381608515341, -0.14533094166800742, 0.10568044854449184, 0.22147457862303147, -0.0076796964976966866, 0.09413411302446592, -0.05085170844558445, 0.0396297934334498, 0.15024338331361248, 0.05964389285148402, -0.10265363787293313, -0.3321882326769211, -0.1837688434369317, -0.1617592193462651, 0.11098171991288541, -0.13568355562141718, -0.15363093222514157, 0.36117393373534445, 0.09895717349032138, 0.14126085743262637, 0.14900132916144632, 0.17277813958746147, 0.18466116333421986, -0.001704802594670072, 0.07844039800054417, 0.15103196401179322, 0.3049372337565462, 0.11062498299056679, -0.18378089976400455, -0.0011984540217715065, 0.24399568874585797] |
1,801.10555 | Generation of ideal thermal light in warm atomic vapor | We present the experimental generation of light with directly observable
close-to ideal thermal statistical properties. The thermal light state is
prepared using a spontaneous Raman emission in a warm atomic vapor. The photon
number statistics is evaluated by both the measurement of second-order
correlation function and by the detailed analysis of the corresponding photon
number distribution, which certifies the quality of the Bose-Einstein
statistics generated by natural physical mechanism. We further demonstrate the
extension of the spectral bandwidth of the generated light to hundreds of MHz
domain while keeping the ideal thermal statistics, which suggests a direct
applicability of the presented source in a broad range of applications
including optical metrology, tests of robustness of quantum communication
protocols, or quantum thermodynamics.
| quant-ph | we present the experimental generation of light with directly observable closeto ideal thermal statistical properties the thermal light state is prepared using a spontaneous raman emission in a warm atomic vapor the photon number statistics is evaluated by both the measurement of secondorder correlation function and by the detailed analysis of the corresponding photon number distribution which certifies the quality of the boseeinstein statistics generated by natural physical mechanism we further demonstrate the extension of the spectral bandwidth of the generated light to hundreds of mhz domain while keeping the ideal thermal statistics which suggests a direct applicability of the presented source in a broad range of applications including optical metrology tests of robustness of quantum communication protocols or quantum thermodynamics | [['we', 'present', 'the', 'experimental', 'generation', 'of', 'light', 'with', 'directly', 'observable', 'closeto', 'ideal', 'thermal', 'statistical', 'properties', 'the', 'thermal', 'light', 'state', 'is', 'prepared', 'using', 'a', 'spontaneous', 'raman', 'emission', 'in', 'a', 'warm', 'atomic', 'vapor', 'the', 'photon', 'number', 'statistics', 'is', 'evaluated', 'by', 'both', 'the', 'measurement', 'of', 'secondorder', 'correlation', 'function', 'and', 'by', 'the', 'detailed', 'analysis', 'of', 'the', 'corresponding', 'photon', 'number', 'distribution', 'which', 'certifies', 'the', 'quality', 'of', 'the', 'boseeinstein', 'statistics', 'generated', 'by', 'natural', 'physical', 'mechanism', 'we', 'further', 'demonstrate', 'the', 'extension', 'of', 'the', 'spectral', 'bandwidth', 'of', 'the', 'generated', 'light', 'to', 'hundreds', 'of', 'mhz', 'domain', 'while', 'keeping', 'the', 'ideal', 'thermal', 'statistics', 'which', 'suggests', 'a', 'direct', 'applicability', 'of', 'the', 'presented', 'source', 'in', 'a', 'broad', 'range', 'of', 'applications', 'including', 'optical', 'metrology', 'tests', 'of', 'robustness', 'of', 'quantum', 'communication', 'protocols', 'or', 'quantum', 'thermodynamics']] | [-0.10351196173116688, 0.16319735588078688, -0.07094447068439043, 0.009374255493421815, -0.01604685385534463, -0.09434117882489419, 0.07657154996048136, 0.35267619456141447, -0.27090515273292204, -0.3139675809455312, 0.06964033855363912, -0.2633174884186919, -0.044682900581031665, 0.24081120856514215, 0.011433219285066094, 0.131275798251837, 0.03494072568887645, -0.012794833884320476, -0.024997562527933642, -0.18102454073238378, 0.27985729395665904, 0.08057446367961686, 0.34599467705211734, 0.08441736606673207, 0.09992312140039299, 0.018640878356315872, -0.04191962588763188, -0.019190318702550776, -0.0818428005869231, 0.11800761615630424, 0.20793342920335794, 0.113655442595174, 0.24617832473840964, -0.38048437664146756, -0.2584779563105919, 0.10879260108692905, 0.08836114058301837, 0.10024294102071854, -0.08197753084150013, -0.28851164845087807, 0.040453041018533316, -0.15936246178351526, -0.1261221404064231, -0.06580407323300345, -0.04080254036148102, 0.035882908664739976, -0.25297897747017384, 0.09473674396468588, 0.030907793225497315, 0.10548639309030673, -0.0028652227983987037, -0.05336417466371266, -0.002036024516155897, 0.07241888042377724, -0.03850734761862223, -0.04308544716043475, 0.19815458056337992, -0.16770377003949535, -0.12055468160133763, 0.41481454307136456, -0.09582564927885802, -0.12374859332484155, 0.17113898747623707, -0.15883738821957352, -0.07632489936534038, 0.14347713302882495, 0.12474305399747426, 0.09847129152872222, -0.1363158444142785, 0.02646517245558837, -0.014682428103155834, 0.22341355913287905, 0.05242326177949132, 0.14763135397575858, 0.24367079139621697, 0.15549856095290013, -0.025645266748841638, 0.2121033316308802, -0.12313428096288492, -0.09538429081132097, -0.3022632742462264, -0.16085174654356457, -0.24685638373686877, 0.06374713117622362, -0.08422607426930408, -0.14100301628239637, 0.4416891531556968, 0.16677490137671389, 0.15477481472098137, 0.0036308653671910203, 0.3451739227445411, 0.11545249464159663, 0.011730577388762936, 0.017488528960884726, 0.27215315430802256, 0.1573867788095766, 0.10251707640815187, -0.2587879956622939, 0.036273126082479464, -0.01545873542955099] |
1,801.10556 | D2.3 Power models, energy models and libraries for energy-efficient
concurrent data structures and algorithms | This deliverable reports the results of the power models, energy models and
libraries for energy-efficient concurrent data structures and algorithms as
available by project month 30 of Work Package 2 (WP2). It reports i) the latest
results of Task 2.2-2.4 on providing programming abstractions and libraries for
developing energy-efficient data structures and algorithms and ii) the improved
results of Task 2.1 on investigating and modeling the trade-off between energy
and performance of concurrent data structures and algorithms. The work has been
conducted on two main EXCESS platforms: Intel platforms with recent Intel
multicore CPUs and Movidius Myriad platforms.
| cs.DC | this deliverable reports the results of the power models energy models and libraries for energyefficient concurrent data structures and algorithms as available by project month 30 of work package 2 wp2 it reports i the latest results of task 2224 on providing programming abstractions and libraries for developing energyefficient data structures and algorithms and ii the improved results of task 21 on investigating and modeling the tradeoff between energy and performance of concurrent data structures and algorithms the work has been conducted on two main excess platforms intel platforms with recent intel multicore cpus and movidius myriad platforms | [['this', 'deliverable', 'reports', 'the', 'results', 'of', 'the', 'power', 'models', 'energy', 'models', 'and', 'libraries', 'for', 'energyefficient', 'concurrent', 'data', 'structures', 'and', 'algorithms', 'as', 'available', 'by', 'project', 'month', '30', 'of', 'work', 'package', '2', 'wp2', 'it', 'reports', 'i', 'the', 'latest', 'results', 'of', 'task', '2224', 'on', 'providing', 'programming', 'abstractions', 'and', 'libraries', 'for', 'developing', 'energyefficient', 'data', 'structures', 'and', 'algorithms', 'and', 'ii', 'the', 'improved', 'results', 'of', 'task', '21', 'on', 'investigating', 'and', 'modeling', 'the', 'tradeoff', 'between', 'energy', 'and', 'performance', 'of', 'concurrent', 'data', 'structures', 'and', 'algorithms', 'the', 'work', 'has', 'been', 'conducted', 'on', 'two', 'main', 'excess', 'platforms', 'intel', 'platforms', 'with', 'recent', 'intel', 'multicore', 'cpus', 'and', 'movidius', 'myriad', 'platforms']] | [-0.13566322701184877, -0.03199314852530251, -0.05408134543793086, 0.0035427471620448846, -0.08669036832799641, -0.1837466214498391, 0.055121516846880624, 0.45341669389864014, -0.1985683132495199, -0.44167305213608304, 0.1394169438554316, -0.3024885575382077, -0.10526870793665341, 0.2876606993709824, -0.02661874109572655, 0.13246624262015128, 0.1507875538307565, -0.0689120152965188, -0.035264804008968025, -0.2742004776943703, 0.24987773880438538, 0.12957535450327762, 0.33996547891625334, 0.09823656327338243, 0.040585625578164676, -0.060733859579325936, -0.08281331634795179, -0.048776550550484195, -0.12341451846842406, 0.20047596029994286, 0.3014590388805545, 0.23976816382610752, 0.2995382879138449, -0.46542941998424275, -0.13784503150726574, 0.008139025738310754, 0.09635224599125129, 0.028710051658278217, -0.06942030144926654, -0.2827390666328827, 0.06613851013137217, -0.19364300632507217, -0.030294370371848345, -0.06002397362465913, 0.03675897430381453, 0.03900471956668688, -0.21477344758067357, -0.0067703656149001755, 0.02669522072644714, 0.13290195824692444, -0.06097194729657958, -0.1792026308878344, 0.02730539667762208, 0.10338429751216757, 0.02152834750108459, 0.020060021499152845, 0.13836880275333413, -0.10752003180689881, -0.2650799435677425, 0.36416252428779794, -0.0284698851007436, -0.08724388930048528, 0.20398365603569818, -0.008311730638450506, -0.20257245608111274, 0.03759576858268404, 0.2609527685052278, 0.0660202086057362, -0.15247454304647232, 0.09374474817162323, 0.044970906425115406, 0.2011429009696573, 0.013068442394462775, 0.03311843595144396, 0.15981947129107632, 0.2638720574940802, -0.030843429001314298, 0.11050370163806923, -0.05381277754988369, -0.07961979058894272, -0.17054741983705826, -0.14415301144484202, -0.13182946316878863, -0.05411911840379542, -0.066240295400571, -0.09104654130083983, 0.38401306131664587, 0.15778038494421967, 0.09681694206724666, 0.07493391328928423, 0.4208870880229741, -0.01624751585293371, 0.14549647972025737, 0.18032882288359675, 0.13056381593448851, 0.023738368027083272, 0.21713288964665667, -0.15798510357319395, 0.01875864356703942, -0.06678628741896578] |
1,801.10557 | Searching for Axion-Like Particles with X-ray Polarimeters | X-ray telescopes are an exceptional tool for searching for new fundamental
physics. In particular, X-ray observations have already placed world-leading
bounds on the interaction between photons and axion-like particles (ALPs). ALPs
are hypothetical new ultra-light particles motivated by string theory models.
They can also act as dark matter and dark energy, and provide a solution to the
strong CP problem. In a background magnetic field, ALPs and photons may
interconvert. This leads to energy dependent modulations in both the flux and
polarisation of the spectra of point sources shining through large magnetic
fields. The next generation of polarising X-ray telescopes will offer new
detection possibilities for ALPs. Here we present techniques and projected
bounds for searching for ALPs with X-ray polarimetry. We demonstrate that
upcoming X-ray polarimetry missions have the potential to place world-leading
bounds on ALPs.
| hep-ph astro-ph.HE | xray telescopes are an exceptional tool for searching for new fundamental physics in particular xray observations have already placed worldleading bounds on the interaction between photons and axionlike particles alps alps are hypothetical new ultralight particles motivated by string theory models they can also act as dark matter and dark energy and provide a solution to the strong cp problem in a background magnetic field alps and photons may interconvert this leads to energy dependent modulations in both the flux and polarisation of the spectra of point sources shining through large magnetic fields the next generation of polarising xray telescopes will offer new detection possibilities for alps here we present techniques and projected bounds for searching for alps with xray polarimetry we demonstrate that upcoming xray polarimetry missions have the potential to place worldleading bounds on alps | [['xray', 'telescopes', 'are', 'an', 'exceptional', 'tool', 'for', 'searching', 'for', 'new', 'fundamental', 'physics', 'in', 'particular', 'xray', 'observations', 'have', 'already', 'placed', 'worldleading', 'bounds', 'on', 'the', 'interaction', 'between', 'photons', 'and', 'axionlike', 'particles', 'alps', 'alps', 'are', 'hypothetical', 'new', 'ultralight', 'particles', 'motivated', 'by', 'string', 'theory', 'models', 'they', 'can', 'also', 'act', 'as', 'dark', 'matter', 'and', 'dark', 'energy', 'and', 'provide', 'a', 'solution', 'to', 'the', 'strong', 'cp', 'problem', 'in', 'a', 'background', 'magnetic', 'field', 'alps', 'and', 'photons', 'may', 'interconvert', 'this', 'leads', 'to', 'energy', 'dependent', 'modulations', 'in', 'both', 'the', 'flux', 'and', 'polarisation', 'of', 'the', 'spectra', 'of', 'point', 'sources', 'shining', 'through', 'large', 'magnetic', 'fields', 'the', 'next', 'generation', 'of', 'polarising', 'xray', 'telescopes', 'will', 'offer', 'new', 'detection', 'possibilities', 'for', 'alps', 'here', 'we', 'present', 'techniques', 'and', 'projected', 'bounds', 'for', 'searching', 'for', 'alps', 'with', 'xray', 'polarimetry', 'we', 'demonstrate', 'that', 'upcoming', 'xray', 'polarimetry', 'missions', 'have', 'the', 'potential', 'to', 'place', 'worldleading', 'bounds', 'on', 'alps']] | [-0.10733075725105014, 0.2666321664473533, -0.07468736308361709, 0.16902176316157935, -0.14413494316956205, -0.12199560678598002, 0.048236212032051744, 0.3918633046118121, -0.2071473293081198, -0.41837611956263543, 0.08124128984453932, -0.3139903490112102, -0.0339980161626463, 0.29069568169214866, 0.06833414375156599, 0.014605415672281363, 0.05022859828628219, -0.0695615323873519, 0.01931653425767066, -0.21007997042798593, 0.22436647418288203, 0.1089303926326824, 0.21623490290906633, 0.0890209544619994, 0.08491009142399378, -0.0062973800754296955, -0.031072236203255443, -0.03933353406796912, -0.09785259048052745, 0.10494716415040697, 0.2236196254838114, 0.14817084471522415, 0.13855081552938714, -0.4607320427622673, -0.2042700149472395, 0.17627795664661558, 0.16397697779683085, 0.05209753293217751, -0.1507369923816627, -0.35113947599256123, -0.017290229389076903, -0.11782718246571557, -0.1261667038040426, -0.06281947255658027, -0.025836294461687496, 0.051135052661717376, -0.25226164675474055, -0.003849789072176523, -0.048810193886603126, -0.028555336166988975, -0.11336075521862801, -0.10010210769318968, 0.07174200831783296, 0.025664519807102878, 0.06451677909311261, 0.006133356838602654, 0.12972592484897655, -0.20704486629123509, -0.16401585941644806, 0.372734637455131, -0.10518326537588435, -0.07278541931678562, 0.1841659029456277, -0.16042133787201623, -0.19428719421100876, 0.11179351436150987, 0.23400833361517012, 0.11564168852012958, -0.13085448582840226, 0.11177121451630997, -0.028982428759064552, 0.19140010692768078, 0.07178685197905793, 0.1069875407749855, 0.38740964308653, 0.17945168638707268, 0.0975320229857453, 0.11173076255002269, -0.20383262422350473, 0.03279043508720768, -0.30195981942892186, -0.13007094317122642, -0.11574133895133643, 0.03644452236225679, -0.0845900840343938, -0.1269342288528705, 0.31146528777142946, 0.15229761903429145, 0.09429355074624347, -0.04569742112270944, 0.2994121592049997, 0.06295846901531502, 0.043735069773384254, 0.017803969476915843, 0.39508043657597425, 0.12755752464987502, 0.15388874028958924, -0.15219795474711206, -0.0548455468141032, 0.01746408479206645] |
1,801.10558 | Quantum process tomography of linear and quadratically nonlinear optical
systems | A central task in quantum information processing is to characterize quantum
processes. In the realm of optical quantum information processing, this amounts
to characterizing the transformations of the mode creation and annihilation
operators. This transformation is unitary for linear optical systems, whereas
these yield the well-known Bogoliubov transformations for systems with
Hamiltonians that are quadratic in the mode operators. In this paper, we show
that a modified Mach-Zehnder interferometer can characterize both these kinds
of evolutions for multimode systems. While it suffices to use coherent states
for the characterization of linear optical systems, we additionally require
single photons to characterize quadratically nonlinear optical systems.
| quant-ph | a central task in quantum information processing is to characterize quantum processes in the realm of optical quantum information processing this amounts to characterizing the transformations of the mode creation and annihilation operators this transformation is unitary for linear optical systems whereas these yield the wellknown bogoliubov transformations for systems with hamiltonians that are quadratic in the mode operators in this paper we show that a modified machzehnder interferometer can characterize both these kinds of evolutions for multimode systems while it suffices to use coherent states for the characterization of linear optical systems we additionally require single photons to characterize quadratically nonlinear optical systems | [['a', 'central', 'task', 'in', 'quantum', 'information', 'processing', 'is', 'to', 'characterize', 'quantum', 'processes', 'in', 'the', 'realm', 'of', 'optical', 'quantum', 'information', 'processing', 'this', 'amounts', 'to', 'characterizing', 'the', 'transformations', 'of', 'the', 'mode', 'creation', 'and', 'annihilation', 'operators', 'this', 'transformation', 'is', 'unitary', 'for', 'linear', 'optical', 'systems', 'whereas', 'these', 'yield', 'the', 'wellknown', 'bogoliubov', 'transformations', 'for', 'systems', 'with', 'hamiltonians', 'that', 'are', 'quadratic', 'in', 'the', 'mode', 'operators', 'in', 'this', 'paper', 'we', 'show', 'that', 'a', 'modified', 'machzehnder', 'interferometer', 'can', 'characterize', 'both', 'these', 'kinds', 'of', 'evolutions', 'for', 'multimode', 'systems', 'while', 'it', 'suffices', 'to', 'use', 'coherent', 'states', 'for', 'the', 'characterization', 'of', 'linear', 'optical', 'systems', 'we', 'additionally', 'require', 'single', 'photons', 'to', 'characterize', 'quadratically', 'nonlinear', 'optical', 'systems']] | [-0.1632288761119036, 0.15344455359109604, -0.08310063433152838, 0.04188844334678903, -0.028724786534439772, -0.1587655420612114, 0.006292674161019162, 0.38513090867379035, -0.30967185426001936, -0.24206667058528042, 0.08141090072995912, -0.2829138318506571, -0.1687264209210228, 0.2543702813026567, -0.04480245844192373, 0.12007311440874428, 0.06202405813271001, 0.0018080100506687393, -0.09061338889520042, -0.21295438086291632, 0.32619558162584256, 0.015327529051529173, 0.2899384658712034, -0.03531455202475907, 0.09748457261146261, 0.0706466966165373, -0.00344184074156846, -0.053831750007632836, -0.06361734010170039, 0.13700677636874248, 0.30501640917590034, 0.08550392555144544, 0.22651349391358402, -0.4223940081249636, -0.23451501683582768, 0.141112963109313, 0.14241730884336554, 0.19127995749854912, -0.012466021007500015, -0.26782694989994454, 0.01820503299397667, -0.12302243956051265, -0.08637257932255474, -0.13825304135501099, 0.017169471386855897, -0.00030405407540876273, -0.25092981681406784, 0.04928363629295955, 0.08688180509041278, 0.02173055170211368, -0.027248831208383378, 0.012785778685401265, 0.02567426339373924, 0.0912502505726969, -0.1156565046000581, -0.058543130018873714, 0.13708885377631164, -0.14682115458149034, -0.15583570613615358, 0.4022589077134259, -0.05704348526733856, -0.1796987485453988, 0.20566913610001883, -0.13650009355086906, -0.13422048466992026, 0.07458439806046394, 0.20881594363779116, 0.08686819858625174, -0.18866277688469452, 0.06772003314276495, 0.0090502114706816, 0.19500709599210844, 0.06252499103384952, 0.18368070691716498, 0.21245754429345162, 0.08743080651709953, 0.07213351227647553, 0.18204566009808332, -0.023268372142830722, -0.12425597580687071, -0.2900009129785198, -0.1911775434832984, -0.1554424579075063, 0.04157779837595836, -0.024922522908617302, -0.14268650733776247, 0.36836210953053805, 0.13284831353051302, 0.14669413433875889, 0.029400778027663294, 0.2925105560212754, 0.17635427108885218, 0.1051098741680527, 0.037974224738718476, 0.2609378327078258, 0.16029760331730358, 0.10473768603137265, -0.2679183360708591, -0.034829881539245926, 0.027369843258594092] |
1,801.10559 | A Distribution-Free Test of Independence and Its Application to Variable
Selection | Motivated by the importance of measuring the association between the response
and predictors in high dimensional data, In this article, we propose a new mean
variance test of independence between a categorical random variable and a
continuous one based on mean variance index. The mean variance index is zero if
and only if two variables are independent. Under the independence, we derive an
explicit form of its asymptotic null distribution, which provides us with an
efficient and fast way to compute the empirical p-value in practice. The number
of classes of the categorical variable is allowed to diverge slowly to the
infinity. It is essentially a rank test and thus distribution-free. No
assumption on the distributions of two random variables is required and the
test statistic is invariant under one-to-one transformations. It is resistent
to heavy-tailed distributions and extreme values. We assess its performance by
Monte Carlo simulations and demonstrate that the proposed test achieves a
higher power in comparison with the existing tests. We apply the proposed MV
test to a high dimensional colon cancer gene expression data to detect the
significant genes associated with the tissue syndrome.
| stat.ME | motivated by the importance of measuring the association between the response and predictors in high dimensional data in this article we propose a new mean variance test of independence between a categorical random variable and a continuous one based on mean variance index the mean variance index is zero if and only if two variables are independent under the independence we derive an explicit form of its asymptotic null distribution which provides us with an efficient and fast way to compute the empirical pvalue in practice the number of classes of the categorical variable is allowed to diverge slowly to the infinity it is essentially a rank test and thus distributionfree no assumption on the distributions of two random variables is required and the test statistic is invariant under onetoone transformations it is resistent to heavytailed distributions and extreme values we assess its performance by monte carlo simulations and demonstrate that the proposed test achieves a higher power in comparison with the existing tests we apply the proposed mv test to a high dimensional colon cancer gene expression data to detect the significant genes associated with the tissue syndrome | [['motivated', 'by', 'the', 'importance', 'of', 'measuring', 'the', 'association', 'between', 'the', 'response', 'and', 'predictors', 'in', 'high', 'dimensional', 'data', 'in', 'this', 'article', 'we', 'propose', 'a', 'new', 'mean', 'variance', 'test', 'of', 'independence', 'between', 'a', 'categorical', 'random', 'variable', 'and', 'a', 'continuous', 'one', 'based', 'on', 'mean', 'variance', 'index', 'the', 'mean', 'variance', 'index', 'is', 'zero', 'if', 'and', 'only', 'if', 'two', 'variables', 'are', 'independent', 'under', 'the', 'independence', 'we', 'derive', 'an', 'explicit', 'form', 'of', 'its', 'asymptotic', 'null', 'distribution', 'which', 'provides', 'us', 'with', 'an', 'efficient', 'and', 'fast', 'way', 'to', 'compute', 'the', 'empirical', 'pvalue', 'in', 'practice', 'the', 'number', 'of', 'classes', 'of', 'the', 'categorical', 'variable', 'is', 'allowed', 'to', 'diverge', 'slowly', 'to', 'the', 'infinity', 'it', 'is', 'essentially', 'a', 'rank', 'test', 'and', 'thus', 'distributionfree', 'no', 'assumption', 'on', 'the', 'distributions', 'of', 'two', 'random', 'variables', 'is', 'required', 'and', 'the', 'test', 'statistic', 'is', 'invariant', 'under', 'onetoone', 'transformations', 'it', 'is', 'resistent', 'to', 'heavytailed', 'distributions', 'and', 'extreme', 'values', 'we', 'assess', 'its', 'performance', 'by', 'monte', 'carlo', 'simulations', 'and', 'demonstrate', 'that', 'the', 'proposed', 'test', 'achieves', 'a', 'higher', 'power', 'in', 'comparison', 'with', 'the', 'existing', 'tests', 'we', 'apply', 'the', 'proposed', 'mv', 'test', 'to', 'a', 'high', 'dimensional', 'colon', 'cancer', 'gene', 'expression', 'data', 'to', 'detect', 'the', 'significant', 'genes', 'associated', 'with', 'the', 'tissue', 'syndrome']] | [-0.07476221857652211, 0.08137321134270957, -0.10923581162502093, 0.10861310581417961, -0.0627408788623239, -0.1409791529464422, 0.0783498483628685, 0.3799546482411051, -0.21894951388313774, -0.28823919168786793, 0.09211497716346963, -0.2616835559794381, -0.13304999906313483, 0.17918046174703964, -0.11239911563369254, 0.06958925267861646, 0.04250671620796085, 0.05769215869623675, -0.05714420889622517, -0.2720171875423855, 0.27619153869008184, 0.08989074712535415, 0.34209246408667354, -0.03553008941056394, 0.1484085250915048, 0.009250576055064186, -0.06871281087733608, 0.03421957215920051, -0.10309300608533371, 0.12298201186897814, 0.2225799814246043, 0.1635690026724617, 0.30548039765131696, -0.36623788842064126, -0.16204370405505258, 0.16889114907287336, 0.07857571728773928, 0.05025347744462095, -0.0190808847632811, -0.22858266508768474, 0.0961848816165464, -0.1486718221087127, -0.10805332994922533, -0.10255866317896459, 0.018549668908774578, 0.025753048145108752, -0.34830266555091216, 0.11807974469730946, 0.02243274346821838, 0.08225957422502457, -0.011892594459279386, -0.10585718163629136, 0.007172405436418202, 0.11512493663504424, 0.11471141759668374, 0.018498425559194946, 0.09642512741050234, -0.09857709408054317, -0.10157233378332522, 0.31732296562758544, -0.056657269960774415, -0.25513357181279434, 0.2170575925718165, -0.1640378248670863, -0.1420181364525681, 0.10612006340589789, 0.17061194342132363, 0.1066864376862117, -0.16164979296514675, 0.05968504357607493, -0.026939665125042356, 0.1701898505201652, 0.05326823444997586, -0.026196760836885206, 0.15199822550959807, 0.13749869924196334, 0.058335223792012406, 0.16641265044737824, -0.1407744669476795, -0.07247548796379416, -0.3118624023984743, -0.17791133728118555, -0.19145584470350985, 0.03647328018230539, -0.1609329747660677, -0.1890786182007225, 0.39482885020016323, 0.1854427669652511, 0.1958729738262408, 0.11548353079768026, 0.280482620043956, 0.12184127794440698, 0.033127741092352794, 0.07063166475879452, 0.17598833371860484, 0.15724965059025972, -0.002837308853428574, -0.1944035163306922, 0.11381503066944855, 0.01869056290434427] |
1,801.1056 | Benchmark Database of Transition Metal Surface and Adsorption Energies
from Many-Body Perturbation Theory | We present an extensive set of surface and chemisorption energies calculated
using state of the art many-body perturbation theory. In the first part of the
paper we consider ten surface reactions in the low coverage regime where
experimental data is available. Here the random phase approximation (RPA) is
found to yield high accuracy for both adsorption and surface energies. In
contrast all the considered density functionals fail to describe both
quantities accurately. This establishes the RPA as a universally accurate
method for surface science. In the second part, we use the RPA to construct a
database of 200 high quality adsorption energies for reactions involving OH,
CH, NO, CO, N$_2$, N, O and H over a wide range of 3d, 4d and 5d transition
metals. Due to the significant computational demand, these results are obtained
in the high coverage regime where adsorbate-adsorbate interactions can be
significant. RPA is compared to the more advanced renormalised adiabatic LDA
(rALDA) method for a subset of the reactions and they are found to describe the
adsorbate-metal bond as well as adsorbate-adsorbate interactions similarly. The
RPA results are compared to a range of standard density functional theory
methods typically employed for surface reactions representing the various rungs
on Jacob's ladder. The deviations are found to be highly functional, surface
and reaction dependent. Our work establishes the RPA and rALDA methods as
universally accurate full ab-initio methods for surface science where accurate
experimental data is scarce. The database is freely available via the
Computational Materials Repository (CMR).
| cond-mat.mtrl-sci | we present an extensive set of surface and chemisorption energies calculated using state of the art manybody perturbation theory in the first part of the paper we consider ten surface reactions in the low coverage regime where experimental data is available here the random phase approximation rpa is found to yield high accuracy for both adsorption and surface energies in contrast all the considered density functionals fail to describe both quantities accurately this establishes the rpa as a universally accurate method for surface science in the second part we use the rpa to construct a database of 200 high quality adsorption energies for reactions involving oh ch no co n_2 n o and h over a wide range of 3d 4d and 5d transition metals due to the significant computational demand these results are obtained in the high coverage regime where adsorbateadsorbate interactions can be significant rpa is compared to the more advanced renormalised adiabatic lda ralda method for a subset of the reactions and they are found to describe the adsorbatemetal bond as well as adsorbateadsorbate interactions similarly the rpa results are compared to a range of standard density functional theory methods typically employed for surface reactions representing the various rungs on jacobs ladder the deviations are found to be highly functional surface and reaction dependent our work establishes the rpa and ralda methods as universally accurate full abinitio methods for surface science where accurate experimental data is scarce the database is freely available via the computational materials repository cmr | [['we', 'present', 'an', 'extensive', 'set', 'of', 'surface', 'and', 'chemisorption', 'energies', 'calculated', 'using', 'state', 'of', 'the', 'art', 'manybody', 'perturbation', 'theory', 'in', 'the', 'first', 'part', 'of', 'the', 'paper', 'we', 'consider', 'ten', 'surface', 'reactions', 'in', 'the', 'low', 'coverage', 'regime', 'where', 'experimental', 'data', 'is', 'available', 'here', 'the', 'random', 'phase', 'approximation', 'rpa', 'is', 'found', 'to', 'yield', 'high', 'accuracy', 'for', 'both', 'adsorption', 'and', 'surface', 'energies', 'in', 'contrast', 'all', 'the', 'considered', 'density', 'functionals', 'fail', 'to', 'describe', 'both', 'quantities', 'accurately', 'this', 'establishes', 'the', 'rpa', 'as', 'a', 'universally', 'accurate', 'method', 'for', 'surface', 'science', 'in', 'the', 'second', 'part', 'we', 'use', 'the', 'rpa', 'to', 'construct', 'a', 'database', 'of', '200', 'high', 'quality', 'adsorption', 'energies', 'for', 'reactions', 'involving', 'oh', 'ch', 'no', 'co', 'n_2', 'n', 'o', 'and', 'h', 'over', 'a', 'wide', 'range', 'of', '3d', '4d', 'and', '5d', 'transition', 'metals', 'due', 'to', 'the', 'significant', 'computational', 'demand', 'these', 'results', 'are', 'obtained', 'in', 'the', 'high', 'coverage', 'regime', 'where', 'adsorbateadsorbate', 'interactions', 'can', 'be', 'significant', 'rpa', 'is', 'compared', 'to', 'the', 'more', 'advanced', 'renormalised', 'adiabatic', 'lda', 'ralda', 'method', 'for', 'a', 'subset', 'of', 'the', 'reactions', 'and', 'they', 'are', 'found', 'to', 'describe', 'the', 'adsorbatemetal', 'bond', 'as', 'well', 'as', 'adsorbateadsorbate', 'interactions', 'similarly', 'the', 'rpa', 'results', 'are', 'compared', 'to', 'a', 'range', 'of', 'standard', 'density', 'functional', 'theory', 'methods', 'typically', 'employed', 'for', 'surface', 'reactions', 'representing', 'the', 'various', 'rungs', 'on', 'jacobs', 'ladder', 'the', 'deviations', 'are', 'found', 'to', 'be', 'highly', 'functional', 'surface', 'and', 'reaction', 'dependent', 'our', 'work', 'establishes', 'the', 'rpa', 'and', 'ralda', 'methods', 'as', 'universally', 'accurate', 'full', 'abinitio', 'methods', 'for', 'surface', 'science', 'where', 'accurate', 'experimental', 'data', 'is', 'scarce', 'the', 'database', 'is', 'freely', 'available', 'via', 'the', 'computational', 'materials', 'repository', 'cmr']] | [-0.05568280612444505, 0.10336558324244106, -0.042710793407284654, 0.09815463389642537, 0.0057207702457089905, -0.10363686499837786, 0.05687419211352244, 0.3978287527635694, -0.22651392633840442, -0.3271145049929619, 0.024323553112801165, -0.318921160466969, -0.10596389227546751, 0.17817868526367237, 0.018664307640865446, 0.05796813527883205, 0.06557750775339082, -0.0036871997923590243, -0.09132095600711182, -0.21909107176028192, 0.24711701688775792, 0.07338979151565582, 0.2882168723326176, 0.09805666143167764, 0.007256282955408097, -0.0025286204339936376, 0.01477486020512879, 0.02222675869986415, -0.14220878236368298, 0.13390854102559388, 0.3354932865193114, 0.03237053557112813, 0.2209936407059431, -0.4494712115004659, -0.2525065658651292, 0.04169799214135855, 0.10980151220876723, 0.16664694085344672, -0.041243579540227074, -0.2491392494942993, 0.03882754294015467, -0.19086069907993078, -0.0925744232183788, -0.13690192716661842, 0.021897678477689624, 0.048287537733092904, -0.26805302008148285, 0.09569985748641192, -0.027484882918652146, 0.06445273596793413, -0.09368206959590315, -0.175836137060076, -0.05433807240566239, 0.1100873529331293, 0.017925365310627966, 0.07462795897119213, 0.1379408456236124, -0.11077780303452164, -0.049637637046631426, 0.4301364706233144, -0.08582532002683729, -0.14672900346294046, 0.2213367677628994, -0.1421802866626531, -0.13443713482283057, 0.1809294099677354, 0.1440217568441294, 0.13272408842481673, -0.1535255707167089, 0.09573552478232887, 0.03936173100117594, 0.1629996318453923, 0.02541860992601141, 0.017834719025995583, 0.1285559485007543, 0.17459915845561771, 0.0390247611515224, 0.07511838359362445, -0.10427637788373977, -0.09563735464587808, -0.2761544104591012, -0.13572955679829465, -0.20199366258410736, -0.009601105509325861, -0.06453129571356112, -0.18369011169858276, 0.3416222996674478, 0.13523309251246973, 0.1582871096804738, 0.0392750979848206, 0.27128873229958117, 0.0965228575785295, 0.024213864341378212, 0.05333324205316603, 0.24586663264781236, 0.13212676111422478, 0.07165330816758797, -0.191341467244667, 0.07110417806170881, 0.030248447562218644] |
1,801.10561 | Hierarchical Bayesian calibration of tidal orbit decay rates among hot
Jupiters | Transiting hot Jupiters occupy a wedge-shaped region in the mass
ratio-orbital separation diagram. Its upper boundary is eroded by tidal
spiral-in of massive, close-in planets and is sensitive to the stellar tidal
dissipation parameter $Q_s'$. We develop a simple generative model of the
orbital separation distribution of the known population of transiting hot
Jupiters, subject to tidal orbital decay, XUV-driven evaporation and
observational selection bias. From the joint likelihood of the observed orbital
separations of hot Jupiters discovered in ground-based wide-field transit
surveys, measured with respect to the hyperparameters of the underlying
population model, we recover narrow posterior probability distributions for
$Q_s'$ in two different tidal forcing frequency regimes. We validate the method
using mock samples of transiting planets with known tidal parameters. We find
that $Q_s'$ and its temperature dependence are retrieved reliably over five
orders of magnitude in $Q_s'$. A large sample of hot Jupiters from
small-aperture ground-based surveys yields $\log_{10} Q_s'=(8.26\pm 0.14)$ for
223 systems in the equilibrium-tide regime. We detect no significant dependence
of $Q_s'$ on stellar effective temperature. A further 19 systems in the
dynamical-tide regime yield $\log_{10} Q_s'=7.3\pm 0.4$, indicating stronger
coupling. Detection probabilities for transiting planets at a given orbital
separation scale inversely with the increase in their tidal migration rates
since birth. The resulting bias towards younger systems explains why the
surface gravities of hot Jupiters correlate with their host stars'
chromospheric emission fluxes. We predict departures from a linear
transit-timing ephemeris of less than 4 seconds for WASP-18 over a 20-year
baseline.
| astro-ph.EP | transiting hot jupiters occupy a wedgeshaped region in the mass ratioorbital separation diagram its upper boundary is eroded by tidal spiralin of massive closein planets and is sensitive to the stellar tidal dissipation parameter q_s we develop a simple generative model of the orbital separation distribution of the known population of transiting hot jupiters subject to tidal orbital decay xuvdriven evaporation and observational selection bias from the joint likelihood of the observed orbital separations of hot jupiters discovered in groundbased widefield transit surveys measured with respect to the hyperparameters of the underlying population model we recover narrow posterior probability distributions for q_s in two different tidal forcing frequency regimes we validate the method using mock samples of transiting planets with known tidal parameters we find that q_s and its temperature dependence are retrieved reliably over five orders of magnitude in q_s a large sample of hot jupiters from smallaperture groundbased surveys yields log_10 q_s826pm 014 for 223 systems in the equilibriumtide regime we detect no significant dependence of q_s on stellar effective temperature a further 19 systems in the dynamicaltide regime yield log_10 q_s73pm 04 indicating stronger coupling detection probabilities for transiting planets at a given orbital separation scale inversely with the increase in their tidal migration rates since birth the resulting bias towards younger systems explains why the surface gravities of hot jupiters correlate with their host stars chromospheric emission fluxes we predict departures from a linear transittiming ephemeris of less than 4 seconds for wasp18 over a 20year baseline | [['transiting', 'hot', 'jupiters', 'occupy', 'a', 'wedgeshaped', 'region', 'in', 'the', 'mass', 'ratioorbital', 'separation', 'diagram', 'its', 'upper', 'boundary', 'is', 'eroded', 'by', 'tidal', 'spiralin', 'of', 'massive', 'closein', 'planets', 'and', 'is', 'sensitive', 'to', 'the', 'stellar', 'tidal', 'dissipation', 'parameter', 'q_s', 'we', 'develop', 'a', 'simple', 'generative', 'model', 'of', 'the', 'orbital', 'separation', 'distribution', 'of', 'the', 'known', 'population', 'of', 'transiting', 'hot', 'jupiters', 'subject', 'to', 'tidal', 'orbital', 'decay', 'xuvdriven', 'evaporation', 'and', 'observational', 'selection', 'bias', 'from', 'the', 'joint', 'likelihood', 'of', 'the', 'observed', 'orbital', 'separations', 'of', 'hot', 'jupiters', 'discovered', 'in', 'groundbased', 'widefield', 'transit', 'surveys', 'measured', 'with', 'respect', 'to', 'the', 'hyperparameters', 'of', 'the', 'underlying', 'population', 'model', 'we', 'recover', 'narrow', 'posterior', 'probability', 'distributions', 'for', 'q_s', 'in', 'two', 'different', 'tidal', 'forcing', 'frequency', 'regimes', 'we', 'validate', 'the', 'method', 'using', 'mock', 'samples', 'of', 'transiting', 'planets', 'with', 'known', 'tidal', 'parameters', 'we', 'find', 'that', 'q_s', 'and', 'its', 'temperature', 'dependence', 'are', 'retrieved', 'reliably', 'over', 'five', 'orders', 'of', 'magnitude', 'in', 'q_s', 'a', 'large', 'sample', 'of', 'hot', 'jupiters', 'from', 'smallaperture', 'groundbased', 'surveys', 'yields', 'log_10', 'q_s826pm', '014', 'for', '223', 'systems', 'in', 'the', 'equilibriumtide', 'regime', 'we', 'detect', 'no', 'significant', 'dependence', 'of', 'q_s', 'on', 'stellar', 'effective', 'temperature', 'a', 'further', '19', 'systems', 'in', 'the', 'dynamicaltide', 'regime', 'yield', 'log_10', 'q_s73pm', '04', 'indicating', 'stronger', 'coupling', 'detection', 'probabilities', 'for', 'transiting', 'planets', 'at', 'a', 'given', 'orbital', 'separation', 'scale', 'inversely', 'with', 'the', 'increase', 'in', 'their', 'tidal', 'migration', 'rates', 'since', 'birth', 'the', 'resulting', 'bias', 'towards', 'younger', 'systems', 'explains', 'why', 'the', 'surface', 'gravities', 'of', 'hot', 'jupiters', 'correlate', 'with', 'their', 'host', 'stars', 'chromospheric', 'emission', 'fluxes', 'we', 'predict', 'departures', 'from', 'a', 'linear', 'transittiming', 'ephemeris', 'of', 'less', 'than', '4', 'seconds', 'for', 'wasp18', 'over', 'a', '20year', 'baseline']] | [-0.12710979651777085, 0.18638753098612915, -0.07667368866370328, 0.11954394661960935, -0.11488186940550804, -0.07255104028710319, 0.08595808681292905, 0.36305933020752573, -0.17236851600681238, -0.37013749225062287, 0.02375588600800904, -0.29773940640852337, -0.047069078294356706, 0.20860450956423726, -0.062190694657960864, 0.014328200083983843, 0.0999721303093907, -0.05929964517246977, -0.054877346567244, -0.2588254078649558, 0.24732921231040347, 0.05762470620983612, 0.08581346424974252, -0.030331195984412786, 0.035811472411723694, -0.06747807746730473, -0.0299178528437308, -0.03913523914171797, -0.21941679406092574, 0.0029825066317151856, 0.21276905236912794, 0.09711297031544783, 0.22117688293240753, -0.33834835839054717, -0.21865434057551986, 0.05891933301199786, 0.16887194506903197, 0.02781565474564971, -0.014871334161247439, -0.2523925116875771, 0.046954263429636295, -0.23991399593776194, -0.15851749804508136, 0.014068521403468134, 0.10419482683295361, 0.021631443635504014, -0.3001562027748003, 0.1687742313331225, 0.042321739669772325, 0.15108394098874872, -0.13625781438106044, -0.15629356019745622, -0.07962619686482271, 0.04839748461063393, 0.06365080330584967, 0.04872635035089364, 0.19204604051072105, -0.09339784818200171, -0.008066909146393358, 0.37514057295841846, -0.12683852607421323, -0.03187771887718304, 0.2332812870837567, -0.2613972803664503, -0.11876023385715237, 0.1810596879092818, 0.19706254122545, 0.14408503356578228, -0.1524050571802091, -0.017697160002852787, 0.0134851026416168, 0.2058899630735881, 0.08375315223575423, 0.08292140648181848, 0.39431270696071963, 0.15263724440957613, 0.07204583733105044, 0.07592042940640482, -0.2510253580938459, -0.057597521666120664, -0.16454084717003092, -0.040098756251984884, -0.15682147986063288, 0.025070334845015155, -0.14397832657747123, -0.12475841141377504, 0.3520145412300702, 0.17623396488830356, 0.20681152524233812, 0.08144023424101171, 0.30988843658343257, 0.09204067106392642, 0.12765508164087996, 0.10655960452135818, 0.304759386425408, 0.17431691511881045, 0.07128009505980923, -0.2820147845304009, 0.10669898784904164, -0.03415087880100112] |
1,801.10562 | Feature Decomposition Based Saliency Detection in Electron
Cryo-Tomograms | Electron Cryo-Tomography (ECT) allows 3D visualization of subcellular
structures at the submolecular resolution in close to the native state.
However, due to the high degree of structural complexity and imaging limits,
the automatic segmentation of cellular components from ECT images is very
difficult. To complement and speed up existing segmentation methods, it is
desirable to develop a generic cell component segmentation method that is 1)
not specific to particular types of cellular components, 2) able to segment
unknown cellular components, 3) fully unsupervised and does not rely on the
availability of training data. As an important step towards this goal, in this
paper, we propose a saliency detection method that computes the likelihood that
a subregion in a tomogram stands out from the background. Our method consists
of four steps: supervoxel over-segmentation, feature extraction, feature matrix
decomposition, and computation of saliency. The method produces a distribution
map that represents the regions' saliency in tomograms. Our experiments show
that our method can successfully label most salient regions detected by a human
observer, and able to filter out regions not containing cellular components.
Therefore, our method can remove the majority of the background region, and
significantly speed up the subsequent processing of segmentation and
recognition of cellular components captured by ECT.
| q-bio.QM cs.CV stat.ML | electron cryotomography ect allows 3d visualization of subcellular structures at the submolecular resolution in close to the native state however due to the high degree of structural complexity and imaging limits the automatic segmentation of cellular components from ect images is very difficult to complement and speed up existing segmentation methods it is desirable to develop a generic cell component segmentation method that is 1 not specific to particular types of cellular components 2 able to segment unknown cellular components 3 fully unsupervised and does not rely on the availability of training data as an important step towards this goal in this paper we propose a saliency detection method that computes the likelihood that a subregion in a tomogram stands out from the background our method consists of four steps supervoxel oversegmentation feature extraction feature matrix decomposition and computation of saliency the method produces a distribution map that represents the regions saliency in tomograms our experiments show that our method can successfully label most salient regions detected by a human observer and able to filter out regions not containing cellular components therefore our method can remove the majority of the background region and significantly speed up the subsequent processing of segmentation and recognition of cellular components captured by ect | [['electron', 'cryotomography', 'ect', 'allows', '3d', 'visualization', 'of', 'subcellular', 'structures', 'at', 'the', 'submolecular', 'resolution', 'in', 'close', 'to', 'the', 'native', 'state', 'however', 'due', 'to', 'the', 'high', 'degree', 'of', 'structural', 'complexity', 'and', 'imaging', 'limits', 'the', 'automatic', 'segmentation', 'of', 'cellular', 'components', 'from', 'ect', 'images', 'is', 'very', 'difficult', 'to', 'complement', 'and', 'speed', 'up', 'existing', 'segmentation', 'methods', 'it', 'is', 'desirable', 'to', 'develop', 'a', 'generic', 'cell', 'component', 'segmentation', 'method', 'that', 'is', '1', 'not', 'specific', 'to', 'particular', 'types', 'of', 'cellular', 'components', '2', 'able', 'to', 'segment', 'unknown', 'cellular', 'components', '3', 'fully', 'unsupervised', 'and', 'does', 'not', 'rely', 'on', 'the', 'availability', 'of', 'training', 'data', 'as', 'an', 'important', 'step', 'towards', 'this', 'goal', 'in', 'this', 'paper', 'we', 'propose', 'a', 'saliency', 'detection', 'method', 'that', 'computes', 'the', 'likelihood', 'that', 'a', 'subregion', 'in', 'a', 'tomogram', 'stands', 'out', 'from', 'the', 'background', 'our', 'method', 'consists', 'of', 'four', 'steps', 'supervoxel', 'oversegmentation', 'feature', 'extraction', 'feature', 'matrix', 'decomposition', 'and', 'computation', 'of', 'saliency', 'the', 'method', 'produces', 'a', 'distribution', 'map', 'that', 'represents', 'the', 'regions', 'saliency', 'in', 'tomograms', 'our', 'experiments', 'show', 'that', 'our', 'method', 'can', 'successfully', 'label', 'most', 'salient', 'regions', 'detected', 'by', 'a', 'human', 'observer', 'and', 'able', 'to', 'filter', 'out', 'regions', 'not', 'containing', 'cellular', 'components', 'therefore', 'our', 'method', 'can', 'remove', 'the', 'majority', 'of', 'the', 'background', 'region', 'and', 'significantly', 'speed', 'up', 'the', 'subsequent', 'processing', 'of', 'segmentation', 'and', 'recognition', 'of', 'cellular', 'components', 'captured', 'by', 'ect']] | [-0.03829852361276603, 0.017794163668771613, -0.06877678966274459, 0.0032141198917697562, -0.0527745911285602, -0.13633446147638645, 0.031925116857830164, 0.41268184897378446, -0.25507134490403566, -0.2989659750540006, 0.07965226838160216, -0.26099418967848914, -0.1752415182827593, 0.17285557638889437, -0.10603594472801875, 0.049707108465219405, 0.12180919140637474, 0.03508952063281071, -0.014518336806241334, -0.20463660771180942, 0.2766272056152661, 0.06658126157151455, 0.33930177230869185, 0.02393555462707957, 0.15481888325093981, -0.04546281439809209, -0.07541164468180692, 0.00048020503006911163, -0.055904241272953785, 0.17650157404655778, 0.3209122641582452, 0.20198380175986858, 0.2612529844134761, -0.4017242432380336, -0.23510448152921273, 0.08423823325320494, 0.1988847615753198, 0.09674950989194964, -0.012747188132706335, -0.29830375436301293, 0.11391063812901778, -0.1125693448099144, -0.05365009647994592, -0.11384863113988922, 0.0006485733935502514, -0.048547316833319025, -0.2579972747218702, 0.06490601849537253, 0.08002338846521585, 0.0340303271010732, -0.06164325180749797, -0.07837832307567794, -0.0066468510069354085, 0.18530706864554417, -0.021616782840039428, 0.06762152346537302, 0.1732679767641083, -0.19120585812260196, -0.09729585553292167, 0.36446237292878203, -0.028175498122732606, -0.22312786322283118, 0.24176934613004042, -0.10748634124107873, -0.1634476378150106, 0.19673180780885963, 0.16514733398965956, 0.12129332784910878, -0.13943289660483277, 0.008602716746399152, 0.004534063116607198, 0.22660598884956046, 0.053057399693136796, -0.02935292897300358, 0.2023000600884232, 0.20813208797826258, 0.08137269419211751, 0.1211751975368655, -0.21292740341307123, -0.02151187456883579, -0.24380628528456655, -0.14497317960842304, -0.18506876853156531, -0.03237623534741551, -0.07764994727764289, -0.15716989365580122, 0.4224834475303113, 0.2073946927828546, 0.20491746342161662, 0.04937667371348688, 0.3669421273371668, 0.026613473526255614, 0.12521994680291015, 0.056298798324460046, 0.17278960648797115, 0.05927672160735897, 0.10840630403978295, -0.18969108900010728, 0.07865039431868771, 0.08517980695764521] |
1,801.10563 | A Novel Centralized Strategy for Coded Caching with Non-uniform Demands | Despite significant progress in the caching literature concerning the worst
case and uniform average case regimes, the algorithms for caching with
nonuniform demands are still at a basic stage and mostly rely on simple
grouping and memory-sharing techniques. In this work we introduce a novel
centralized caching strategy for caching with nonuniform file popularities. Our
scheme allows for assigning more cache to the files which are more likely to be
requested, while maintaining the same sub-packetization for all the files. As a
result, in the delivery phase it is possible to perform linear codes across
files with different popularities without resorting to zero-padding or
concatenation techniques. We will describe our placement strategy for arbitrary
range of parameters. The delivery phase will be outlined for a small example
for which we are able to show a noticeable improvement over the state of the
art.
| cs.IT math.IT | despite significant progress in the caching literature concerning the worst case and uniform average case regimes the algorithms for caching with nonuniform demands are still at a basic stage and mostly rely on simple grouping and memorysharing techniques in this work we introduce a novel centralized caching strategy for caching with nonuniform file popularities our scheme allows for assigning more cache to the files which are more likely to be requested while maintaining the same subpacketization for all the files as a result in the delivery phase it is possible to perform linear codes across files with different popularities without resorting to zeropadding or concatenation techniques we will describe our placement strategy for arbitrary range of parameters the delivery phase will be outlined for a small example for which we are able to show a noticeable improvement over the state of the art | [['despite', 'significant', 'progress', 'in', 'the', 'caching', 'literature', 'concerning', 'the', 'worst', 'case', 'and', 'uniform', 'average', 'case', 'regimes', 'the', 'algorithms', 'for', 'caching', 'with', 'nonuniform', 'demands', 'are', 'still', 'at', 'a', 'basic', 'stage', 'and', 'mostly', 'rely', 'on', 'simple', 'grouping', 'and', 'memorysharing', 'techniques', 'in', 'this', 'work', 'we', 'introduce', 'a', 'novel', 'centralized', 'caching', 'strategy', 'for', 'caching', 'with', 'nonuniform', 'file', 'popularities', 'our', 'scheme', 'allows', 'for', 'assigning', 'more', 'cache', 'to', 'the', 'files', 'which', 'are', 'more', 'likely', 'to', 'be', 'requested', 'while', 'maintaining', 'the', 'same', 'subpacketization', 'for', 'all', 'the', 'files', 'as', 'a', 'result', 'in', 'the', 'delivery', 'phase', 'it', 'is', 'possible', 'to', 'perform', 'linear', 'codes', 'across', 'files', 'with', 'different', 'popularities', 'without', 'resorting', 'to', 'zeropadding', 'or', 'concatenation', 'techniques', 'we', 'will', 'describe', 'our', 'placement', 'strategy', 'for', 'arbitrary', 'range', 'of', 'parameters', 'the', 'delivery', 'phase', 'will', 'be', 'outlined', 'for', 'a', 'small', 'example', 'for', 'which', 'we', 'are', 'able', 'to', 'show', 'a', 'noticeable', 'improvement', 'over', 'the', 'state', 'of', 'the', 'art']] | [-0.13897220144810324, 0.049781513009611124, -0.05853365833538916, 0.030710100495074128, -0.06802547978028864, -0.2009888392599573, 0.12986796955949256, 0.42120084208208364, -0.2483488335404415, -0.32671306334546657, 0.11527117976830895, -0.222465100673852, -0.09264523505845426, 0.17259213059873588, -0.12828876876591386, 0.06552806123439874, 0.056518213957992024, 0.012271370855974151, -0.0741675620922213, -0.3369899042588952, 0.30641255544667895, 0.09038216238385523, 0.3296036513756726, 0.03203814098989213, 0.03866925277955622, 0.021832779798839057, -0.05846792541548505, -0.0027896891554843608, -0.10417312086344911, 0.08394248295824493, 0.3230148503113981, 0.16916055838948676, 0.2426525601348677, -0.4236476176542106, -0.20126194622159213, 0.08521495741577102, 0.15981270721787913, 0.16506417563825787, -0.0676157638461938, -0.22578611444043634, 0.16310672528009498, -0.20889602651676306, -0.05425694803511919, -0.0758301152137818, -0.012466632915738891, 0.045317639733120876, -0.3244905481180111, -0.0185862754217603, 0.026205006989502264, 0.0004429758067032765, -0.031387757017013414, -0.1421951544943259, 0.04355921193745054, 0.16442357140700692, 0.012742335001418654, 0.03562023362366261, 0.09050975267781869, -0.11713371534141472, -0.10340194886719639, 0.41444375270886435, -0.012513228346938854, -0.21532784024794047, 0.1641354730313683, -0.06035259053423688, -0.14721978525305493, 0.14748156997961337, 0.19100893411290396, 0.11443461065499724, -0.12853553213205163, 0.013147527158628316, -0.03206717697667427, 0.18857956568586765, 0.08981111681355827, 0.09374390798783698, 0.15318516988984562, 0.19993748000360556, 0.1265394325348568, 0.14191970732746892, -0.05684334579431875, -0.12076903472636612, -0.23519320455151838, -0.1353786347175043, -0.15003246687258223, -0.02617298133208879, -0.1026331615546544, -0.11742701320225125, 0.36749162252632056, 0.15565590391104872, 0.15227239374462123, 0.11037166940249418, 0.375188056242789, 0.05991656245448841, 0.08709517170160593, 0.15171414895399987, 0.1421245868135426, 0.004358384575877157, 0.14472621101381297, -0.16269727704649256, 0.12202674589751587, 0.014893914300376888] |
1,801.10564 | Least dilatation of pure surface braids | We study the minimal dilatation of pseudo-Anosov pure surface braids and
provide upper and lower bounds as a function of genus and the number of
punctures. For a fixed number of punctures, these bounds tend to infinity as
the genus does. We also bound the dilatation of pseudo-Anosov pure surface
braids away from zero and give a constant upper bound in the case of a
sufficient number of punctures.
| math.GT math.DS math.GR | we study the minimal dilatation of pseudoanosov pure surface braids and provide upper and lower bounds as a function of genus and the number of punctures for a fixed number of punctures these bounds tend to infinity as the genus does we also bound the dilatation of pseudoanosov pure surface braids away from zero and give a constant upper bound in the case of a sufficient number of punctures | [['we', 'study', 'the', 'minimal', 'dilatation', 'of', 'pseudoanosov', 'pure', 'surface', 'braids', 'and', 'provide', 'upper', 'and', 'lower', 'bounds', 'as', 'a', 'function', 'of', 'genus', 'and', 'the', 'number', 'of', 'punctures', 'for', 'a', 'fixed', 'number', 'of', 'punctures', 'these', 'bounds', 'tend', 'to', 'infinity', 'as', 'the', 'genus', 'does', 'we', 'also', 'bound', 'the', 'dilatation', 'of', 'pseudoanosov', 'pure', 'surface', 'braids', 'away', 'from', 'zero', 'and', 'give', 'a', 'constant', 'upper', 'bound', 'in', 'the', 'case', 'of', 'a', 'sufficient', 'number', 'of', 'punctures']] | [-0.19711831306525762, 0.21188764473882274, -0.09456275050541844, 0.07303551368523335, -0.04851260105404409, -0.18735846600400796, 0.11142189303359044, 0.2171007193206553, -0.2029391512463706, -0.3574527144378078, 0.10295012689607246, -0.30269995002426964, -0.13597026420082303, 0.23147450236306674, -0.11149100067120964, 0.07554376589647238, 0.026779752686970693, 0.1273317810496403, -0.12045147989377164, -0.25078706514846155, 0.33488112385722174, -0.011602377950929213, 0.18854821991661322, 0.1353055972174026, 0.014386970810490944, -0.08812265336324555, 0.028117866258717317, -0.030329701666166817, -0.23031712963205317, 0.12963262259744215, 0.22414705961726714, 0.08456397105170332, 0.13147556600903254, -0.4704808156559433, -0.13484513970847795, 0.20039906790075096, 0.13852980562175313, 0.08411334913925848, -0.016336695061645645, -0.1857261053401221, 0.05979735794328693, -0.12287211067218712, -0.2317556915939718, 0.014618936656177908, 0.060787680977280587, -0.024566126774753564, -0.17764528211800085, 0.014669235535489017, 0.1355768569164734, 0.11728885345265566, -0.02441864390520082, -0.17128918843640797, -0.12140158448449295, 0.1644670224505598, 0.09432665010293324, 0.05744262589344188, 0.10399059415457473, -0.1629509348422289, -0.055965217687459524, 0.259018049845337, -0.17372752353549004, -0.26332264350376267, 0.1896629368994331, -0.1778922474173748, -0.1351781069719489, 0.16422509408785382, 0.1853967394436831, 0.17802257135348476, -0.02198367441693942, 0.1764962435733743, -0.13222204702163953, 0.0934544954502928, 0.13469568422685066, -0.00722666484290275, 0.14549267159747906, 0.036317887702497886, 0.1963159571658226, 0.23733160299235495, -0.06795979389731867, 0.03128769991082558, -0.41697989738937735, -0.22365347430214583, -0.18162257202050608, 0.14230487625236096, -0.14880203978627568, -0.2230002422361724, 0.37021097422078036, 0.029488503905958023, 0.19706423391682515, 0.23764098168391248, 0.24352104573146158, 0.06889821053735669, 0.05452053556961102, 0.13255460139202035, 0.13597264045687474, 0.20075618748661075, -0.10942700078737909, -0.19243837445906864, -0.01677932496439072, 0.2023467095501289] |
1,801.10565 | The ILC positron target cooled by thermal radiation | The design of the conversion target for the undulator-based ILC positron
source is still under development. One important issue is the cooling of the
target. Here, the status of the design studies for cooling by thermal radiation
is presented.
| physics.acc-ph | the design of the conversion target for the undulatorbased ilc positron source is still under development one important issue is the cooling of the target here the status of the design studies for cooling by thermal radiation is presented | [['the', 'design', 'of', 'the', 'conversion', 'target', 'for', 'the', 'undulatorbased', 'ilc', 'positron', 'source', 'is', 'still', 'under', 'development', 'one', 'important', 'issue', 'is', 'the', 'cooling', 'of', 'the', 'target', 'here', 'the', 'status', 'of', 'the', 'design', 'studies', 'for', 'cooling', 'by', 'thermal', 'radiation', 'is', 'presented']] | [-0.05418495584327059, 0.16426486235398513, -0.02590134433016945, 0.03918842206864307, -0.06345333884923886, -0.10476063738744228, -0.002701002722367262, 0.37888144205013913, -0.24413665405546242, -0.2782431261088604, 0.14119328711277399, -0.24788600483383888, -0.007740207016468048, 0.26345069515399444, -0.008011180561226912, 0.06889150559138028, 0.03848824826761698, -0.00023708855494474753, -0.019982327193690416, -0.21011037446367434, 0.302868002309249, 0.2174529325312529, 0.32908322474656576, 0.11509740416360541, 0.10537128456127949, -0.0045460445018341905, -0.029523995036307055, -0.10799011454368249, -0.08469904606373838, 0.08933907036388962, 0.2683349108944337, 0.1898328286046401, 0.2770633491902397, -0.3767769525352961, -0.21437623461660665, 0.07473402296025784, 0.08421422744719073, 0.07789263119682288, -0.14650900270312261, -0.17044105576590085, 0.0281264743504998, -0.1344421754280726, -0.12976389623079926, 0.008478452547047382, 0.013941483285564642, -0.009364562180752937, -0.23981993239468488, -0.011947543742373968, 0.07595219553854221, -6.430596113204956e-05, -0.09485499534564905, -0.13131018720853788, 0.04404408866778398, 0.09553268494514319, 0.03686888717138805, 0.036993554494797416, 0.21848061143492276, -0.18690691143274307, -0.11076234008830327, 0.4264626260369252, -0.007075474764674137, -0.16593090912852532, 0.13524751006983793, -0.12376872788016231, -0.12932700980215883, 0.16794442566923606, 0.16080707583863002, 0.0849421655651755, -0.21655614578571075, 0.044118656466404595, 0.020835131979905643, 0.1479173187011232, 0.007902202136719074, 0.02541680285372795, 0.24087757082321706, 0.33995032300933814, 0.05113130380423405, 0.18407942068118316, -0.15029874792656836, -0.017285015911628038, -0.3526851204820933, -0.1607695232408169, -0.12337386388427173, 0.05100345723808576, 0.02799920465510625, -0.0759570457232304, 0.38774097959200543, 0.16707429834283316, 0.09616517822425334, -0.05925151680667813, 0.40413739962073475, 0.09612863022499742, 0.02923779996732871, 0.0274801252481456, 0.3288975052344493, 0.10647039816308862, 0.09190845102644883, -0.33843301517220264, 0.11742825640174441, -0.03855691928989612] |
1,801.10566 | Schwinger mechanism in the SU(3) Nambu--Jona-Lasinio model with an
electric field | In this work we study the electrized quark matter under finite temperature
and density conditions in the context of the SU(2) and SU(3)
Nambu--Jona-Lasinio models. To this end, we evaluate the effective quark masses
and the Schwinger quark-antiquark pair production rate. For the SU(3) NJL model
we incorporate in the Lagrangian the 't Hooft determinant and we present a set
of analytical expressions more convenient for numerical evaluations. We predict
a decrease of the pseudocritical electric field with the increase of the
temperature for both models and a more prominent production rate for the SU(3)
model when compared to the SU(2).
| hep-ph nucl-th | in this work we study the electrized quark matter under finite temperature and density conditions in the context of the su2 and su3 nambujonalasinio models to this end we evaluate the effective quark masses and the schwinger quarkantiquark pair production rate for the su3 njl model we incorporate in the lagrangian the t hooft determinant and we present a set of analytical expressions more convenient for numerical evaluations we predict a decrease of the pseudocritical electric field with the increase of the temperature for both models and a more prominent production rate for the su3 model when compared to the su2 | [['in', 'this', 'work', 'we', 'study', 'the', 'electrized', 'quark', 'matter', 'under', 'finite', 'temperature', 'and', 'density', 'conditions', 'in', 'the', 'context', 'of', 'the', 'su2', 'and', 'su3', 'nambujonalasinio', 'models', 'to', 'this', 'end', 'we', 'evaluate', 'the', 'effective', 'quark', 'masses', 'and', 'the', 'schwinger', 'quarkantiquark', 'pair', 'production', 'rate', 'for', 'the', 'su3', 'njl', 'model', 'we', 'incorporate', 'in', 'the', 'lagrangian', 'the', 't', 'hooft', 'determinant', 'and', 'we', 'present', 'a', 'set', 'of', 'analytical', 'expressions', 'more', 'convenient', 'for', 'numerical', 'evaluations', 'we', 'predict', 'a', 'decrease', 'of', 'the', 'pseudocritical', 'electric', 'field', 'with', 'the', 'increase', 'of', 'the', 'temperature', 'for', 'both', 'models', 'and', 'a', 'more', 'prominent', 'production', 'rate', 'for', 'the', 'su3', 'model', 'when', 'compared', 'to', 'the', 'su2']] | [-0.09043459976324812, 0.17077897478826343, -0.07253369978629053, 0.11802025672746823, -0.03478578156791627, -0.0938061602646485, 0.08862554945750162, 0.3708030065149069, -0.12021097297314555, -0.23238284107297658, 0.03318114726454951, -0.277159435339272, -0.06825451759621501, 0.0948469213442877, 0.04301387473940849, 0.058999758930876854, -0.01406104811001569, 0.10316151429433376, -0.12723141558934004, -0.253469751495868, 0.3228933543347921, 0.012113302852958441, 0.2637644283566624, 0.15843574818863998, 0.058215327900834384, -0.0056446601077914235, -0.0028766685642767696, -0.022353254460758764, -0.12467822784557939, 0.07104503130540252, 0.18071622370487603, 0.03304585952311754, 0.14956317903939634, -0.39360687654465437, -0.21687042956706137, 0.1308555361442268, 0.1226459673140198, 0.17283938064938412, -0.047599158876400906, -0.26970395635813477, 0.10163750922307373, -0.25654325909912584, -0.14682570199947803, -0.11297327191568911, 0.007160049952799455, -0.05881753901252523, -0.3534748001396656, 0.0818496899944148, -0.03284661334007979, 0.06228631242644042, -0.0651363964797929, -0.1480689965665806, -0.046579664438613694, 0.05718043075321475, 0.111773343894165, 0.08069293454522267, 0.1355255006114021, -0.22735571517776407, -0.09157456891611218, 0.41123083075508476, -0.14553122225683182, -0.17819841127842664, 0.158505639154464, -0.1340840116189793, -0.13296399177052082, 0.05409072714857757, 0.20015294051845559, 0.14664760687854142, -0.19017856066886452, 0.10845963229599874, -0.03238188918330707, 0.122540642619133, 0.04453636339865625, -0.003531509623862803, 0.21437183796428144, 0.18970152410445734, -0.019808352869004012, 0.15561858699657022, -0.05744996793568134, -0.15779992525931447, -0.38620586924254896, -0.14284132913220673, -0.0898610799992457, 0.012222696463577449, -0.14691876546872662, -0.14069016870111228, 0.4230365492403507, 0.21639824549405604, 0.21351517537608744, 0.08322180152870715, 0.2901610763557255, 0.1529421964888752, 0.056887645293027166, 0.08555985825136304, 0.2155702893389389, 0.2043383725732565, 0.11728748254477978, -0.3171052984660491, -0.06020260273013264, 0.11284156794892625] |
1,801.10567 | De-biased sparse PCA: Inference and testing for eigenstructure of large
covariance matrices | Sparse principal component analysis (sPCA) has become one of the most widely
used techniques for dimensionality reduction in high-dimensional datasets. The
main challenge underlying sPCA is to estimate the first vector of loadings of
the population covariance matrix, provided that only a certain number of
loadings are non-zero. In this paper, we propose confidence intervals for
individual loadings and for the largest eigenvalue of the population covariance
matrix. Given an independent sample $X^i \in\mathbb R^p, i = 1,...,n,$
generated from an unknown distribution with an unknown covariance matrix
$\Sigma_0$, our aim is to estimate the first vector of loadings and the largest
eigenvalue of $\Sigma_0$ in a setting where $p\gg n$. Next to the
high-dimensionality, another challenge lies in the inherent non-convexity of
the problem. We base our methodology on a Lasso-penalized M-estimator which,
despite non-convexity, may be solved by a polynomial-time algorithm such as
coordinate or gradient descent. We show that our estimator achieves the minimax
optimal rates in $\ell_1$ and $\ell_2$-norm. We identify the bias in the
Lasso-based estimator and propose a de-biased sparse PCA estimator for the
vector of loadings and for the largest eigenvalue of the covariance matrix
$\Sigma_0$. Our main results provide theoretical guarantees for asymptotic
normality of the de-biased estimator. The major conditions we impose are
sparsity in the first eigenvector of small order $\sqrt{n}/\log p$ and sparsity
of the same order in the columns of the inverse Hessian matrix of the
population risk.
| stat.ME math.ST stat.TH | sparse principal component analysis spca has become one of the most widely used techniques for dimensionality reduction in highdimensional datasets the main challenge underlying spca is to estimate the first vector of loadings of the population covariance matrix provided that only a certain number of loadings are nonzero in this paper we propose confidence intervals for individual loadings and for the largest eigenvalue of the population covariance matrix given an independent sample xi inmathbb rp i 1n generated from an unknown distribution with an unknown covariance matrix sigma_0 our aim is to estimate the first vector of loadings and the largest eigenvalue of sigma_0 in a setting where pgg n next to the highdimensionality another challenge lies in the inherent nonconvexity of the problem we base our methodology on a lassopenalized mestimator which despite nonconvexity may be solved by a polynomialtime algorithm such as coordinate or gradient descent we show that our estimator achieves the minimax optimal rates in ell_1 and ell_2norm we identify the bias in the lassobased estimator and propose a debiased sparse pca estimator for the vector of loadings and for the largest eigenvalue of the covariance matrix sigma_0 our main results provide theoretical guarantees for asymptotic normality of the debiased estimator the major conditions we impose are sparsity in the first eigenvector of small order sqrtnlog p and sparsity of the same order in the columns of the inverse hessian matrix of the population risk | [['sparse', 'principal', 'component', 'analysis', 'spca', 'has', 'become', 'one', 'of', 'the', 'most', 'widely', 'used', 'techniques', 'for', 'dimensionality', 'reduction', 'in', 'highdimensional', 'datasets', 'the', 'main', 'challenge', 'underlying', 'spca', 'is', 'to', 'estimate', 'the', 'first', 'vector', 'of', 'loadings', 'of', 'the', 'population', 'covariance', 'matrix', 'provided', 'that', 'only', 'a', 'certain', 'number', 'of', 'loadings', 'are', 'nonzero', 'in', 'this', 'paper', 'we', 'propose', 'confidence', 'intervals', 'for', 'individual', 'loadings', 'and', 'for', 'the', 'largest', 'eigenvalue', 'of', 'the', 'population', 'covariance', 'matrix', 'given', 'an', 'independent', 'sample', 'xi', 'inmathbb', 'rp', 'i', '1n', 'generated', 'from', 'an', 'unknown', 'distribution', 'with', 'an', 'unknown', 'covariance', 'matrix', 'sigma_0', 'our', 'aim', 'is', 'to', 'estimate', 'the', 'first', 'vector', 'of', 'loadings', 'and', 'the', 'largest', 'eigenvalue', 'of', 'sigma_0', 'in', 'a', 'setting', 'where', 'pgg', 'n', 'next', 'to', 'the', 'highdimensionality', 'another', 'challenge', 'lies', 'in', 'the', 'inherent', 'nonconvexity', 'of', 'the', 'problem', 'we', 'base', 'our', 'methodology', 'on', 'a', 'lassopenalized', 'mestimator', 'which', 'despite', 'nonconvexity', 'may', 'be', 'solved', 'by', 'a', 'polynomialtime', 'algorithm', 'such', 'as', 'coordinate', 'or', 'gradient', 'descent', 'we', 'show', 'that', 'our', 'estimator', 'achieves', 'the', 'minimax', 'optimal', 'rates', 'in', 'ell_1', 'and', 'ell_2norm', 'we', 'identify', 'the', 'bias', 'in', 'the', 'lassobased', 'estimator', 'and', 'propose', 'a', 'debiased', 'sparse', 'pca', 'estimator', 'for', 'the', 'vector', 'of', 'loadings', 'and', 'for', 'the', 'largest', 'eigenvalue', 'of', 'the', 'covariance', 'matrix', 'sigma_0', 'our', 'main', 'results', 'provide', 'theoretical', 'guarantees', 'for', 'asymptotic', 'normality', 'of', 'the', 'debiased', 'estimator', 'the', 'major', 'conditions', 'we', 'impose', 'are', 'sparsity', 'in', 'the', 'first', 'eigenvector', 'of', 'small', 'order', 'sqrtnlog', 'p', 'and', 'sparsity', 'of', 'the', 'same', 'order', 'in', 'the', 'columns', 'of', 'the', 'inverse', 'hessian', 'matrix', 'of', 'the', 'population', 'risk']] | [-0.09413309049671789, 0.01695874845481207, -0.06025283022055005, 0.05388456660422212, -0.06096738725160268, -0.11129074671722668, 0.024849027900364265, 0.37055083710279424, -0.2876204735191274, -0.2546960452861819, 0.15728101248864598, -0.27128631274204185, -0.16592929838907175, 0.12045301244765613, -0.09362968828365456, 0.11205221704400006, 0.05741601283019058, 0.04666206890546179, -0.06850403915724433, -0.2706035141088848, 0.31465070152257774, 0.0507708744235555, 0.28571022085448, -0.04819901612349572, 0.12770966362747826, 0.01657806172242162, -0.02626304551432977, -0.013371366785379384, -0.06923455860843018, 0.15410395316578931, 0.27999854536734864, 0.17105710271194408, 0.37372803278890865, -0.34964029522496154, -0.13002137107010853, 0.1658736189874084, 0.14187911026292796, 0.07365932771708343, -0.007925179326676891, -0.2298384841359084, 0.12329679749668361, -0.1332148345592568, -0.11111454353336572, -0.0604067158263769, -0.021581576461026982, -0.027978015380178942, -0.3769432435018716, 0.1373293682626959, 0.08488834049127933, 0.03463200336016781, -0.051422846047636354, -0.2314726033084344, 0.04880405457838435, 0.09713634893894352, 0.11628014069034963, -0.02352726841384397, 0.09547547969059185, -0.08111825625696628, -0.05836473382760042, 0.33627693125175384, -0.0546880094568288, -0.20866923418020727, 0.10400353208238797, -0.14523685655934604, -0.15746005369880273, 0.10329222813088867, 0.23806449292747842, 0.08689262948649698, -0.14026300575794598, 0.09937479750352628, -0.056753563532940886, 0.17079025655829008, 0.0012076123087631859, -0.03705273357913615, 0.08429680985620705, 0.15632505106221434, 0.14633285331980142, 0.1055263797621044, -0.12483935128648037, -0.02170118042701372, -0.3191113348828169, -0.1315983834334992, -0.27834086738152736, 0.022162069107705892, -0.2280436642931932, -0.19146123344943738, 0.40407652993760534, 0.16314084724821837, 0.23578533315524522, 0.10980640325323136, 0.29525207623325006, 0.11864862321519437, 0.018849205303641044, 0.12952651366275816, 0.20598904409097063, 0.18580027623394324, -0.015098793335428469, -0.22981631065568806, 0.12675979708722757, 0.059890039635346774] |
1,801.10568 | Detection of an OH 1665-MHz Maser in M33 | We report one OH 1665-MHz detection in new observations with the NSF's Karl
G. Jansky Very Large Array. To the authors' knowledge, this is the first OH
maser detection in M33. The source occurs at a position of
$\alpha=23.50069(9)^{\circ}$ and $\delta = 30.67984(9)^{\circ}$ (J2000) and is
unresolved at the beam size ($9."7$). Two H$\alpha$ sources from the Moody et
al. (2017) catalogue --- C1-1 and C1-2 --- are consistent within the beam size.
We find a peak flux density of 24.1 mJy in a 1.5 km s$^{-1}$ channel. At the
distance of M33, the source's specific luminosity is consistent with the
brightest Galactic OH 1665-MHz masers.
| astro-ph.GA | we report one oh 1665mhz detection in new observations with the nsfs karl g jansky very large array to the authors knowledge this is the first oh maser detection in m33 the source occurs at a position of alpha23500699circ and delta 30679849circ j2000 and is unresolved at the beam size 97 two halpha sources from the moody et al 2017 catalogue c11 and c12 are consistent within the beam size we find a peak flux density of 241 mjy in a 15 km s1 channel at the distance of m33 the sources specific luminosity is consistent with the brightest galactic oh 1665mhz masers | [['we', 'report', 'one', 'oh', '1665mhz', 'detection', 'in', 'new', 'observations', 'with', 'the', 'nsfs', 'karl', 'g', 'jansky', 'very', 'large', 'array', 'to', 'the', 'authors', 'knowledge', 'this', 'is', 'the', 'first', 'oh', 'maser', 'detection', 'in', 'm33', 'the', 'source', 'occurs', 'at', 'a', 'position', 'of', 'alpha23500699circ', 'and', 'delta', '30679849circ', 'j2000', 'and', 'is', 'unresolved', 'at', 'the', 'beam', 'size', '97', 'two', 'halpha', 'sources', 'from', 'the', 'moody', 'et', 'al', '2017', 'catalogue', 'c11', 'and', 'c12', 'are', 'consistent', 'within', 'the', 'beam', 'size', 'we', 'find', 'a', 'peak', 'flux', 'density', 'of', '241', 'mjy', 'in', 'a', '15', 'km', 's1', 'channel', 'at', 'the', 'distance', 'of', 'm33', 'the', 'sources', 'specific', 'luminosity', 'is', 'consistent', 'with', 'the', 'brightest', 'galactic', 'oh', '1665mhz', 'masers']] | [-0.09762130349431888, 0.07782479043125572, 0.02124474688645194, 0.002789894665250241, -0.08443431730040966, -0.06991113030748201, 0.056017410083867535, 0.4610098084379541, -0.11918549506122818, -0.3683567109822047, 0.0707723233114875, -0.3391103181702149, 0.03702623382358268, 0.15706872418153994, -0.049535924861539564, -0.046569033894724776, 0.07726136561123526, -0.07945915176948108, -0.034116567674987386, -0.20078566734042794, 0.2167970327300822, 0.14039770644711386, 0.20417727518937376, 0.01840730992579224, 0.09261707457630794, -0.1605752362952669, -0.10359453356889363, -0.06702971915336381, -0.14102192729305807, 0.050268952821215414, 0.29718571340683664, 0.08442479378018196, 0.20743008828399204, -0.27915870729317466, -0.15168786818037122, 0.02503408906557182, 0.08154323811891794, 0.07851469827502376, 0.01892980811471986, -0.340319340592158, 0.033888896567617906, -0.16084185666819611, -0.21601018898816096, 0.1936924903662783, 0.12221794523815117, 0.05094655200673064, -0.19418561536101808, 0.15469942310603685, -0.027357438865053183, 0.13905938810641222, -0.0746836737720388, -0.17522713145480887, -0.02939448254367355, 0.01693496234844079, -0.06922211305302854, 0.18844898149721545, 0.13109949082689415, -0.10441758340030982, -0.038983949063585537, 0.3539810814516674, -0.09558426155385995, 0.03324915189296007, 0.20102145181251874, -0.21850432698052413, -0.2808418259817627, 0.2005664434486834, 0.11227109082190707, 0.11849520303594815, -0.1494462633099739, 0.03161321381985274, -0.06850104234619343, 0.24482011440034845, 0.11692180868819135, 0.03299914888742537, 0.27084917965169886, 0.09611022198286903, 0.10111169847152611, 0.10984205862617877, -0.3382317877701935, 0.02007258749546225, -0.30552853293034554, -0.07387740350337607, -0.163525570552833, 0.09197002771946758, -0.09726740424892989, -0.044294859475161104, 0.3548823568306052, 0.07449415020225685, 0.19518957457200872, 0.030394463993535185, 0.2554001776861156, 0.05339847686746628, 0.08531969159122298, 0.1906766179248248, 0.32337404728525937, 0.1922745317667907, 0.09289152581373801, -0.20937731922465827, 0.03890475497516518, -0.006050498494509571] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.