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.10369 | Dark matter interaction between massive standard particles | We propose further tests of the assumption that the mass of the heavy
standard particles ($Z,W,t,...$) arises from a special coupling with dark
matter. We look for effects of new interactions due to dark matter exchanges
between heavy particles in several $e^+e^-$ and hadronic collision processes.
| hep-ph | we propose further tests of the assumption that the mass of the heavy standard particles zwt arises from a special coupling with dark matter we look for effects of new interactions due to dark matter exchanges between heavy particles in several ee and hadronic collision processes | [['we', 'propose', 'further', 'tests', 'of', 'the', 'assumption', 'that', 'the', 'mass', 'of', 'the', 'heavy', 'standard', 'particles', 'zwt', 'arises', 'from', 'a', 'special', 'coupling', 'with', 'dark', 'matter', 'we', 'look', 'for', 'effects', 'of', 'new', 'interactions', 'due', 'to', 'dark', 'matter', 'exchanges', 'between', 'heavy', 'particles', 'in', 'several', 'ee', 'and', 'hadronic', 'collision', 'processes']] | [-0.12635006518710568, 0.2543948197575367, -0.13663838593840963, 0.14735713710441536, -0.051599434880620756, -0.12587987432134864, 0.011803849802716919, 0.2758830957438635, -0.2475136010300206, -0.3338707741856089, -0.0445784349424724, -0.30952587274773774, -0.011700192972531786, 0.08943683378722357, 0.07343074199541108, 0.018913929512643295, 0.04824654741779617, -0.0047632083701698675, -0.04054725312364652, -0.17572017193205006, 0.3694248600134059, 0.06510292949235957, 0.17290473348744537, 0.14434022205355374, 0.08010528758978067, 0.05288641432517856, -0.03710583279557202, -0.05957253884686076, -0.11955863991122738, 0.05262859056592393, 0.13348275285376154, 0.07382711847616441, 0.1886433369540812, -0.451821766388805, -0.18151861653946663, 0.2285632803104818, 0.13809071499449405, 0.11834666551009793, -0.17246216663118938, -0.2957323289516827, 0.010682928456884363, -0.23253490488328363, -0.09914921618917066, -0.033528556409494384, -0.04280056697114006, 0.008933497248622387, -0.3160077419091502, 0.12156208102469859, -0.01616541706228062, -0.06047849545417273, -0.03723587077515929, -0.1329980021464112, 0.014633669720395752, 0.01427901138389564, 0.18940453150350114, -0.08256719681515318, 0.18810892414868527, -0.2229986595718757, -0.12455946819492332, 0.4931283829652745, -0.10606783481299593, -0.1614032471957414, 0.27333382533296297, -0.13509652125851615, -0.170630398661951, 0.11761110459464481, 0.2606921341756116, 0.06180459491746581, -0.19190254411660135, 0.11717401793019076, -0.02636947369445925, 0.13297685349117155, 0.04055246506291239, 0.0781682915681892, 0.28620554621169425, 0.2024954231455922, -0.01795301637004899, 0.08373322933102431, -0.10899126157164574, -0.10162593946670709, -0.36332836066899094, -0.17307703156510126, -0.0945195478954069, -0.0010769244830083587, -0.09151319645151608, -0.09402106665884671, 0.3200097586453447, 0.14407648105660212, 0.21903735023680265, -0.008541473754398201, 0.29973571812329086, 0.048060693697113056, 0.045743839263551585, 0.06884746409385749, 0.32870412601724913, 0.14753168082350623, 0.0953242598992327, -0.21674380995555903, -0.018769789173308273, -0.008350203988020834] |
1,801.1037 | Noncoherent LDPC-Coded Physical-Layer Network Coding using Multitone FSK | A noncoherent two-way relaying system is developed using physical-layer
network coding for improved throughput over conventional relaying in a fading
channel. Energy-efficient noncoherent operation is achieved using multitone
frequency shift keying (FSK). A novel soft-output demodulator is developed for
the relay, and corresponding achievable exchange rates are found for Rayleigh
fading and AWGN channels. Bit-error rate performance approaching the achievable
rate is realized using a capacity-approaching channel code and a receiver
architecture that iterates between demodulation and channel decoding. Iterative
decoding is performed feeding information back from the channel decoder to the
demodulator. Additionally, error-rate performance is made to approach the
achievable rate more closely by optimizing LDPC codes for this system. The
energy efficiency improvement obtained by increasing the modulation order is
more dramatic for the proposed physical-layer network coding scheme than it is
for a conventional point-to-point system. Using optimized LDPC codes, the
bit-error rate performance is improved by as much as 1.1 dB over a widely known
standardized LDPC code, and comes to within 0.7 dB of the limit corresponding
to the achievable rate. Throughout this work, performance for physical-layer
network coding is compared to conventional network coding. When noncoherent FSK
is used, physical-layer network coding enables higher achievable rates, and
conventional network coding exhibits better energy efficiency at low rates.
| cs.IT math.IT | a noncoherent twoway relaying system is developed using physicallayer network coding for improved throughput over conventional relaying in a fading channel energyefficient noncoherent operation is achieved using multitone frequency shift keying fsk a novel softoutput demodulator is developed for the relay and corresponding achievable exchange rates are found for rayleigh fading and awgn channels biterror rate performance approaching the achievable rate is realized using a capacityapproaching channel code and a receiver architecture that iterates between demodulation and channel decoding iterative decoding is performed feeding information back from the channel decoder to the demodulator additionally errorrate performance is made to approach the achievable rate more closely by optimizing ldpc codes for this system the energy efficiency improvement obtained by increasing the modulation order is more dramatic for the proposed physicallayer network coding scheme than it is for a conventional pointtopoint system using optimized ldpc codes the biterror rate performance is improved by as much as 11 db over a widely known standardized ldpc code and comes to within 07 db of the limit corresponding to the achievable rate throughout this work performance for physicallayer network coding is compared to conventional network coding when noncoherent fsk is used physicallayer network coding enables higher achievable rates and conventional network coding exhibits better energy efficiency at low rates | [['a', 'noncoherent', 'twoway', 'relaying', 'system', 'is', 'developed', 'using', 'physicallayer', 'network', 'coding', 'for', 'improved', 'throughput', 'over', 'conventional', 'relaying', 'in', 'a', 'fading', 'channel', 'energyefficient', 'noncoherent', 'operation', 'is', 'achieved', 'using', 'multitone', 'frequency', 'shift', 'keying', 'fsk', 'a', 'novel', 'softoutput', 'demodulator', 'is', 'developed', 'for', 'the', 'relay', 'and', 'corresponding', 'achievable', 'exchange', 'rates', 'are', 'found', 'for', 'rayleigh', 'fading', 'and', 'awgn', 'channels', 'biterror', 'rate', 'performance', 'approaching', 'the', 'achievable', 'rate', 'is', 'realized', 'using', 'a', 'capacityapproaching', 'channel', 'code', 'and', 'a', 'receiver', 'architecture', 'that', 'iterates', 'between', 'demodulation', 'and', 'channel', 'decoding', 'iterative', 'decoding', 'is', 'performed', 'feeding', 'information', 'back', 'from', 'the', 'channel', 'decoder', 'to', 'the', 'demodulator', 'additionally', 'errorrate', 'performance', 'is', 'made', 'to', 'approach', 'the', 'achievable', 'rate', 'more', 'closely', 'by', 'optimizing', 'ldpc', 'codes', 'for', 'this', 'system', 'the', 'energy', 'efficiency', 'improvement', 'obtained', 'by', 'increasing', 'the', 'modulation', 'order', 'is', 'more', 'dramatic', 'for', 'the', 'proposed', 'physicallayer', 'network', 'coding', 'scheme', 'than', 'it', 'is', 'for', 'a', 'conventional', 'pointtopoint', 'system', 'using', 'optimized', 'ldpc', 'codes', 'the', 'biterror', 'rate', 'performance', 'is', 'improved', 'by', 'as', 'much', 'as', '11', 'db', 'over', 'a', 'widely', 'known', 'standardized', 'ldpc', 'code', 'and', 'comes', 'to', 'within', '07', 'db', 'of', 'the', 'limit', 'corresponding', 'to', 'the', 'achievable', 'rate', 'throughout', 'this', 'work', 'performance', 'for', 'physicallayer', 'network', 'coding', 'is', 'compared', 'to', 'conventional', 'network', 'coding', 'when', 'noncoherent', 'fsk', 'is', 'used', 'physicallayer', 'network', 'coding', 'enables', 'higher', 'achievable', 'rates', 'and', 'conventional', 'network', 'coding', 'exhibits', 'better', 'energy', 'efficiency', 'at', 'low', 'rates']] | [-0.2765349470955868, -0.011892735902611688, -0.026542225953180097, 0.042183772580280346, 0.028792697804649228, -0.34368557298651714, 0.1660930253140994, 0.44258806845782517, -0.28337127048409083, -0.21016301528689948, 0.11212995877896358, -0.184708155978854, -0.1832538322038583, 0.2420119782235195, -0.16362328668207662, 0.1217662862406295, 0.0654140682085896, 0.056978994154667256, -0.12609543242800772, -0.30161622277608957, 0.22122094027641465, 0.2757858242665496, 0.43801455794198213, -0.016138310198210805, 0.10648366152287121, -0.008109927167365258, 0.02222610621008082, -0.13709661990260513, -0.0986055682064646, 0.06872493646947544, 0.36002260249186413, 0.17948688576367866, 0.19434638470237223, -0.31829536029041927, -0.32860037180046753, 0.03744316716552233, 0.18692190142317944, 0.13091304142160828, -0.04333526999583559, -0.250793135684706, 0.1685370977692715, -0.3062226567069225, 0.08494656125440428, 0.04860440087961642, -0.11051099131832544, 0.028114466374700837, -0.39146868901536147, 0.042423818077648355, 0.003576964572959832, 0.04307090434045575, 0.004418637622017239, -0.16010805577416165, 0.064239504871124, 0.13926972141970823, -0.04768073926440431, 0.0711795992047143, 0.10525772676620389, -0.05780249495150643, -0.13107816160821886, 0.30756976233064154, -0.060920439341019025, -0.20183300376199534, 0.1074668667083345, -0.03119179171457817, 0.028921556258661166, 0.26395006050033687, 0.250450412501259, 0.04380702395340271, -0.16716732140109605, -0.021665908371220195, 0.06164624291868167, 0.24616801605786187, 0.1359332471511492, 0.17431534773552634, 0.0890554343807189, 0.25511746965762155, 0.08859606755127103, 0.1764479345145905, -0.17083135900244326, -0.13415876389959844, -0.14508065214885452, -0.07360611505976174, -0.20582179961482358, -0.0006185943254260956, -0.123635676171153, -0.005763033673680762, 0.3339329650751216, 0.12515516143083294, 0.0479915593903094, 0.16928634848706772, 0.4425215039437062, 0.10537835900567333, 0.09142007444719741, 0.19668556237593293, 0.23065282039292087, 0.19023199483347517, 0.10022160531757138, -0.20550438265150814, 0.07926024614929039, 0.040721654508994] |
1,801.10371 | Plasmonic surface traps with arbitrary shape for cold atoms | This paper reports on conceptual and experimental work towards the
realization of plasmonic surface traps for cold atoms. The trapping mechanism
is based on the combination of a repulsive and an attractive potential
generated by evanescent light waves that are plasmonically enhanced. The
strength of enhancement can be locally manipulated via the thickness of a metal
nanolayer deposited on top of a dielectric substrate. Thus, in principle
arbitrary potential landscapes can be generated. We present simulations of a
plasmonic lattice potential using a gold grating with sinusoidally modulated
thickness. Experimentally, a first plasmonic test structure is presented and
characterized. Furthermore, the surface potential landscape is detected by
reflecting ultracold atom clouds from the test structure revealing the
influence of both evanescent waves. A parameter range is identified, where
stable traps can be expected.
| physics.atom-ph quant-ph | this paper reports on conceptual and experimental work towards the realization of plasmonic surface traps for cold atoms the trapping mechanism is based on the combination of a repulsive and an attractive potential generated by evanescent light waves that are plasmonically enhanced the strength of enhancement can be locally manipulated via the thickness of a metal nanolayer deposited on top of a dielectric substrate thus in principle arbitrary potential landscapes can be generated we present simulations of a plasmonic lattice potential using a gold grating with sinusoidally modulated thickness experimentally a first plasmonic test structure is presented and characterized furthermore the surface potential landscape is detected by reflecting ultracold atom clouds from the test structure revealing the influence of both evanescent waves a parameter range is identified where stable traps can be expected | [['this', 'paper', 'reports', 'on', 'conceptual', 'and', 'experimental', 'work', 'towards', 'the', 'realization', 'of', 'plasmonic', 'surface', 'traps', 'for', 'cold', 'atoms', 'the', 'trapping', 'mechanism', 'is', 'based', 'on', 'the', 'combination', 'of', 'a', 'repulsive', 'and', 'an', 'attractive', 'potential', 'generated', 'by', 'evanescent', 'light', 'waves', 'that', 'are', 'plasmonically', 'enhanced', 'the', 'strength', 'of', 'enhancement', 'can', 'be', 'locally', 'manipulated', 'via', 'the', 'thickness', 'of', 'a', 'metal', 'nanolayer', 'deposited', 'on', 'top', 'of', 'a', 'dielectric', 'substrate', 'thus', 'in', 'principle', 'arbitrary', 'potential', 'landscapes', 'can', 'be', 'generated', 'we', 'present', 'simulations', 'of', 'a', 'plasmonic', 'lattice', 'potential', 'using', 'a', 'gold', 'grating', 'with', 'sinusoidally', 'modulated', 'thickness', 'experimentally', 'a', 'first', 'plasmonic', 'test', 'structure', 'is', 'presented', 'and', 'characterized', 'furthermore', 'the', 'surface', 'potential', 'landscape', 'is', 'detected', 'by', 'reflecting', 'ultracold', 'atom', 'clouds', 'from', 'the', 'test', 'structure', 'revealing', 'the', 'influence', 'of', 'both', 'evanescent', 'waves', 'a', 'parameter', 'range', 'is', 'identified', 'where', 'stable', 'traps', 'can', 'be', 'expected']] | [-0.14267595525860743, 0.20976220914856372, -0.06301852313563563, -0.015521047312129093, -0.0421849359737191, -0.15807995052055868, 0.05453504297157567, 0.4444384933134219, -0.24784131959444822, -0.2883356426863518, 0.011525489564081724, -0.2729191282988155, -0.16382072609324091, 0.2307316022960091, 0.037916627383912466, 0.018442299847203986, 0.02292859970935081, -0.06421488622917716, -0.003915050152787252, -0.17754518103092573, 0.2949657578133327, 0.08675003447044725, 0.28452145180111765, 0.13657396725077825, 0.061324106259761674, -0.02178742489392372, 0.07488412132024541, 0.03426693032908821, -0.10891613562240596, 0.14577944976053572, 0.19463933790557758, -0.03723660153791981, 0.2343706297408089, -0.4739274647738084, -0.2562261684762692, 0.04748708023374578, 0.16449445441778385, 0.153727714662069, -0.14350070278387853, -0.3314549544251951, 0.028144374622830322, -0.10557845875417772, -0.16175743612229712, -0.038836187746067695, -0.006738865079316206, 0.05361934861910522, -0.25640152821700696, 0.02326754174244247, 0.020212787424067135, 0.08605855955441195, -0.09649224777152776, -0.052688651641172576, -0.05189580212284187, 0.02056794772992485, -0.022269799927235545, 0.03140852195245767, 0.22796458219129004, -0.1110005918662659, -0.08325695540559919, 0.386154657930899, -0.11290501207253315, -0.17121881531565486, 0.1808559704235846, -0.12933690206644902, 0.05637157527743874, 0.15189764246736703, 0.19950432441708513, 0.11485470804434858, -0.1356428831796463, 0.07083757910387296, -0.02251815505647906, 0.21244621957403684, 0.13313442541818535, 0.04586195908977013, 0.29943169928610996, 0.2297818464248028, 0.014401774237254509, 0.18132453197280743, -0.11847002692415583, -0.03061924956886, -0.26028212214490976, -0.1479015379051741, -0.24453240660145262, 0.014741975502496152, -0.059468552627433544, -0.17396718027994484, 0.38805509487489115, 0.09833585369204612, 0.1676602445584827, -0.056075086621077436, 0.2820662128129848, 0.09604017355976473, 0.07392531951287187, -0.02162066394554213, 0.2876946889039101, 0.11803597192581099, 0.035053314024904615, -0.2339256854738368, 0.06210393882514138, -0.0031886361364303227] |
1,801.10372 | The CARMENES search for exoplanets around M dwarfs: Wing asymmetries of
H$\alpha$, Na I D, and He I lines | Stellar activity is ubiquitously encountered in M dwarfs and often
characterised by the H$\alpha$ line. In the most active M dwarfs, H$\alpha$ is
found in emission, sometimes with a complex line profile. Previous studies have
reported extended wings and asymmetries in the H$\alpha$ line during flares. We
used a total of 473 high-resolution spectra of 28 active M dwarfs obtained by
the CARMENES (Calar Alto high-Resolution search for M dwarfs with Exo-earths
with Near-infrared and optical Echelle Spectrographs) spectrograph to study the
occurrence of broadened and asymmetric H$\alpha$ line profiles and their
association with flares, and examine possible physical explanations. We
detected a total of 41 flares and 67 broad, potentially asymmetric, wings in
H$\alpha$. The broadened H$\alpha$ lines display a variety of profiles with
symmetric cases and both red and blue asymmetries. Although some of these line
profiles are found during flares, the majority are at least not obviously
associated with flaring. We propose a mechanism similar to coronal rain or
chromospheric downward condensations as a cause for the observed red
asymmetries; the symmetric cases may also be caused by Stark broadening. We
suggest that blue asymmetries are associated with rising material, and our
results are consistent with a prevalence of blue asymmetries during the flare
onset. Besides the H$\alpha$ asymmetries, we find some cases of additional line
asymmetries in \ion{He}{i} D$_{3}$, \ion{Na}{i}~D lines, and the \ion{He}{i}
line at 10830\,\AA\, taken all simultaneously thanks to the large wavelength
coverage of CARMENES. Our study shows that asymmetric H$\alpha$ lines are a
rather common phenomenon in M~dwarfs and need to be studied in more detail to
obtain a better understanding of the atmospheric dynamics in these objects.
| astro-ph.SR | stellar activity is ubiquitously encountered in m dwarfs and often characterised by the halpha line in the most active m dwarfs halpha is found in emission sometimes with a complex line profile previous studies have reported extended wings and asymmetries in the halpha line during flares we used a total of 473 highresolution spectra of 28 active m dwarfs obtained by the carmenes calar alto highresolution search for m dwarfs with exoearths with nearinfrared and optical echelle spectrographs spectrograph to study the occurrence of broadened and asymmetric halpha line profiles and their association with flares and examine possible physical explanations we detected a total of 41 flares and 67 broad potentially asymmetric wings in halpha the broadened halpha lines display a variety of profiles with symmetric cases and both red and blue asymmetries although some of these line profiles are found during flares the majority are at least not obviously associated with flaring we propose a mechanism similar to coronal rain or chromospheric downward condensations as a cause for the observed red asymmetries the symmetric cases may also be caused by stark broadening we suggest that blue asymmetries are associated with rising material and our results are consistent with a prevalence of blue asymmetries during the flare onset besides the halpha asymmetries we find some cases of additional line asymmetries in ionhei d_3 ionnaid lines and the ionhei line at 10830aa taken all simultaneously thanks to the large wavelength coverage of carmenes our study shows that asymmetric halpha lines are a rather common phenomenon in mdwarfs and need to be studied in more detail to obtain a better understanding of the atmospheric dynamics in these objects | [['stellar', 'activity', 'is', 'ubiquitously', 'encountered', 'in', 'm', 'dwarfs', 'and', 'often', 'characterised', 'by', 'the', 'halpha', 'line', 'in', 'the', 'most', 'active', 'm', 'dwarfs', 'halpha', 'is', 'found', 'in', 'emission', 'sometimes', 'with', 'a', 'complex', 'line', 'profile', 'previous', 'studies', 'have', 'reported', 'extended', 'wings', 'and', 'asymmetries', 'in', 'the', 'halpha', 'line', 'during', 'flares', 'we', 'used', 'a', 'total', 'of', '473', 'highresolution', 'spectra', 'of', '28', 'active', 'm', 'dwarfs', 'obtained', 'by', 'the', 'carmenes', 'calar', 'alto', 'highresolution', 'search', 'for', 'm', 'dwarfs', 'with', 'exoearths', 'with', 'nearinfrared', 'and', 'optical', 'echelle', 'spectrographs', 'spectrograph', 'to', 'study', 'the', 'occurrence', 'of', 'broadened', 'and', 'asymmetric', 'halpha', 'line', 'profiles', 'and', 'their', 'association', 'with', 'flares', 'and', 'examine', 'possible', 'physical', 'explanations', 'we', 'detected', 'a', 'total', 'of', '41', 'flares', 'and', '67', 'broad', 'potentially', 'asymmetric', 'wings', 'in', 'halpha', 'the', 'broadened', 'halpha', 'lines', 'display', 'a', 'variety', 'of', 'profiles', 'with', 'symmetric', 'cases', 'and', 'both', 'red', 'and', 'blue', 'asymmetries', 'although', 'some', 'of', 'these', 'line', 'profiles', 'are', 'found', 'during', 'flares', 'the', 'majority', 'are', 'at', 'least', 'not', 'obviously', 'associated', 'with', 'flaring', 'we', 'propose', 'a', 'mechanism', 'similar', 'to', 'coronal', 'rain', 'or', 'chromospheric', 'downward', 'condensations', 'as', 'a', 'cause', 'for', 'the', 'observed', 'red', 'asymmetries', 'the', 'symmetric', 'cases', 'may', 'also', 'be', 'caused', 'by', 'stark', 'broadening', 'we', 'suggest', 'that', 'blue', 'asymmetries', 'are', 'associated', 'with', 'rising', 'material', 'and', 'our', 'results', 'are', 'consistent', 'with', 'a', 'prevalence', 'of', 'blue', 'asymmetries', 'during', 'the', 'flare', 'onset', 'besides', 'the', 'halpha', 'asymmetries', 'we', 'find', 'some', 'cases', 'of', 'additional', 'line', 'asymmetries', 'in', 'ionhei', 'd_3', 'ionnaid', 'lines', 'and', 'the', 'ionhei', 'line', 'at', '10830aa', 'taken', 'all', 'simultaneously', 'thanks', 'to', 'the', 'large', 'wavelength', 'coverage', 'of', 'carmenes', 'our', 'study', 'shows', 'that', 'asymmetric', 'halpha', 'lines', 'are', 'a', 'rather', 'common', 'phenomenon', 'in', 'mdwarfs', 'and', 'need', 'to', 'be', 'studied', 'in', 'more', 'detail', 'to', 'obtain', 'a', 'better', 'understanding', 'of', 'the', 'atmospheric', 'dynamics', 'in', 'these', 'objects']] | [-0.06602770755787125, 0.1354104009744796, -0.01721080697395585, 0.10779046567707237, -0.09786513637582009, -0.13068506983701478, 0.03850457293743437, 0.5048698327724229, -0.10706008272986352, -0.3377175711857324, 0.07205476712774146, -0.29390196580439804, -0.09326548269272528, 0.20757162253626368, -0.046597173629296856, -0.04634439197919247, 0.0898391191305762, -0.09525087507610971, -0.007564257733492096, -0.2093841259012168, 0.2750977604400197, 0.037470646375811406, 0.1728972727297382, -0.005387144291942769, -0.010913365002382885, -0.1206993840397759, -0.12450522514737465, 0.0389039738693563, -0.11115910658639305, 0.03262445761695165, 0.25506727350875735, 0.10050985908368602, 0.20174769675528462, -0.35020576601678677, -0.2068385740572756, 0.08060548906553199, 0.20454456074163319, -0.00022206464613025838, -0.039981566798312336, -0.29116818310396575, 0.061931056560398164, -0.11110666042363102, -0.16356508259492164, 0.06280449878424406, 0.07919535415585746, 0.053530830315483564, -0.24605664461766455, 0.06549965533501977, 0.015567442191849377, 0.1683608263616704, -0.09486186874945733, -0.10526875596832146, -0.10114855584434487, 0.05184578444216062, 0.026727863196283577, -0.004889820027588443, 0.14028329435397277, -0.11808940563012253, -0.06084822336042469, 0.3821632007340139, -0.11698448864150454, 0.014895637036057782, 0.20274543146983806, -0.22808673153123396, -0.15837185273285617, 0.22045241303741933, 0.1337995885160159, 0.138100579011, -0.10541643796319311, -0.04824000440664928, -0.04906413684768433, 0.15822803462347523, 0.07131864836270159, 0.0783845607731068, 0.30679709152741863, 0.03229405983435837, 0.00103322014847601, 0.10223921814150262, -0.28189101344016804, -0.05519017190862955, -0.24623941361565482, -0.10784731990530748, -0.036254233258607035, 0.04972712024882309, -0.051521260548086666, -0.1418480189212344, 0.37619669788601723, 0.09872131275224753, 0.28147783847864377, -0.00447598886591467, 0.2865256739856506, 0.11123898220714182, 0.12413172534857453, 0.09360484564592216, 0.27789180824469606, 0.18451511404223062, 0.18098558347672225, -0.2374968834729357, 0.06576293596997856, -0.015806068237024275] |
1,801.10373 | Using short drive laser pulses to achieve net focusing forces in
tailored dual grating dielectric structures | Laser-driven grating type DLA (Dielectric Laser Accelerator) structures have
been shown to produce accelerating gradients on the order of GeV/m. In simple
$\beta$-matched grating structures due to the nature of the laser induced
steady-state in-channel fields the per period forces on the particles are
mostly in longitudinal direction. Even though strong transverse magnetic and
electric fields are present, the net focusing effect over one period at maximum
energy gain is negligible in the case of relativistic electrons. Stable
acceleration of realistic electron beams in a DLA channel however requires the
presence of significant net transverse forces. In this work we simulate and
study the effect of using the transient temporal shape of short Gaussian drive
laser pulses in order to achieve suitable field configurations for potentially
stable acceleration of relativistic electrons in the horizontal plane. In order
to achieve this, both the laser pulse and the grating geometry are optimized.
Simulations conducted with the Particle-In-Cell code VSim 7.2 are shown for
both the transient and steady state/long pulse case. Finally we investigate how
the drive laser phase dependence of the focusing forces could affect a
potential DLA-based focusing lattice.
| physics.acc-ph | laserdriven grating type dla dielectric laser accelerator structures have been shown to produce accelerating gradients on the order of gevm in simple betamatched grating structures due to the nature of the laser induced steadystate inchannel fields the per period forces on the particles are mostly in longitudinal direction even though strong transverse magnetic and electric fields are present the net focusing effect over one period at maximum energy gain is negligible in the case of relativistic electrons stable acceleration of realistic electron beams in a dla channel however requires the presence of significant net transverse forces in this work we simulate and study the effect of using the transient temporal shape of short gaussian drive laser pulses in order to achieve suitable field configurations for potentially stable acceleration of relativistic electrons in the horizontal plane in order to achieve this both the laser pulse and the grating geometry are optimized simulations conducted with the particleincell code vsim 72 are shown for both the transient and steady statelong pulse case finally we investigate how the drive laser phase dependence of the focusing forces could affect a potential dlabased focusing lattice | [['laserdriven', 'grating', 'type', 'dla', 'dielectric', 'laser', 'accelerator', 'structures', 'have', 'been', 'shown', 'to', 'produce', 'accelerating', 'gradients', 'on', 'the', 'order', 'of', 'gevm', 'in', 'simple', 'betamatched', 'grating', 'structures', 'due', 'to', 'the', 'nature', 'of', 'the', 'laser', 'induced', 'steadystate', 'inchannel', 'fields', 'the', 'per', 'period', 'forces', 'on', 'the', 'particles', 'are', 'mostly', 'in', 'longitudinal', 'direction', 'even', 'though', 'strong', 'transverse', 'magnetic', 'and', 'electric', 'fields', 'are', 'present', 'the', 'net', 'focusing', 'effect', 'over', 'one', 'period', 'at', 'maximum', 'energy', 'gain', 'is', 'negligible', 'in', 'the', 'case', 'of', 'relativistic', 'electrons', 'stable', 'acceleration', 'of', 'realistic', 'electron', 'beams', 'in', 'a', 'dla', 'channel', 'however', 'requires', 'the', 'presence', 'of', 'significant', 'net', 'transverse', 'forces', 'in', 'this', 'work', 'we', 'simulate', 'and', 'study', 'the', 'effect', 'of', 'using', 'the', 'transient', 'temporal', 'shape', 'of', 'short', 'gaussian', 'drive', 'laser', 'pulses', 'in', 'order', 'to', 'achieve', 'suitable', 'field', 'configurations', 'for', 'potentially', 'stable', 'acceleration', 'of', 'relativistic', 'electrons', 'in', 'the', 'horizontal', 'plane', 'in', 'order', 'to', 'achieve', 'this', 'both', 'the', 'laser', 'pulse', 'and', 'the', 'grating', 'geometry', 'are', 'optimized', 'simulations', 'conducted', 'with', 'the', 'particleincell', 'code', 'vsim', '72', 'are', 'shown', 'for', 'both', 'the', 'transient', 'and', 'steady', 'statelong', 'pulse', 'case', 'finally', 'we', 'investigate', 'how', 'the', 'drive', 'laser', 'phase', 'dependence', 'of', 'the', 'focusing', 'forces', 'could', 'affect', 'a', 'potential', 'dlabased', 'focusing', 'lattice']] | [-0.16155152328287226, 0.19463305096519556, -0.06085229693609919, 0.051238611455679546, -0.03727006372819478, -0.11057523389321727, -0.024364318053011556, 0.47572740654184204, -0.23253301673291907, -0.3121204786933959, 0.026490159891545774, -0.23288926269506682, -0.04787819877745131, 0.23791329372372177, 0.02146559017458679, 0.03290235432166908, 0.04579231563288517, -0.01316826406463578, -0.01378369206386442, -0.20411118958900507, 0.26337561806462506, 0.12016276803018676, 0.30972252559118174, 0.0474071436586815, 0.11491395944628764, 0.014111356476221132, 0.012302793002045537, 0.01234299417685818, -0.09579069353010808, 0.04358558905864688, 0.16472144230973682, -0.02851659307457708, 0.247008626797312, -0.48846240773595667, -0.24409953442377014, 0.06684763752729506, 0.13632138294948115, 0.15202186570779697, -0.09676839271182748, -0.22199059159469767, 0.037350661148996774, -0.150165595768674, -0.1544857309168406, -0.0339979238808155, 0.010595949956316601, 0.11785610185344578, -0.2631092589851972, 0.06089571575457985, 0.05967107199862398, 0.06257823087476395, -0.0662516087922897, -0.03736022331600858, -0.012831195924632452, 0.05034713934968553, 0.05689265316893422, 0.06453145173302777, 0.16019972468650825, -0.14727845728347028, -0.09222370253473118, 0.3981453998970824, -0.06637608677280966, -0.1466932299471385, 0.1609287597506458, -0.23058851616507448, -0.03611761834220709, 0.1990716373447228, 0.23063289112335927, 0.11373262016253696, -0.10643730528142957, 0.03835097333995273, 0.045000589062535276, 0.18788522318055903, 0.12479697746300214, 0.043113450859547466, 0.22945226317120565, 0.1574844789829709, 0.03256311058066785, 0.15592372533739418, -0.15748688938297534, -0.06947673630925852, -0.24754179179970476, -0.09282158479295873, -0.122339838283212, 0.031230403956126522, -0.050481282020730246, -0.1401779913201903, 0.4258767412295817, 0.15058689957183338, 0.112004011225056, -0.05311563048209693, 0.3090767029471494, 0.11849651795535071, 0.037878518765068585, 0.056461319823968036, 0.31999674811959267, 0.1577697703388293, 0.12468208380836389, -0.2644455233488131, 0.02351500077575848, -0.003144942123342205] |
1,801.10374 | Emergence of a Dark Force in Corpuscular Gravity | We investigate the emergent laws of gravity when Dark Energy and the de
Sitter space-time are modelled as a critical Bose-Einstein condensate of a
large number of soft gravitons $N_{\rm G}$. We argue that this scenario
requires the presence of various regimes of gravity in which $N_{\rm G}$ scales
in different ways. Moreover, the local gravitational interaction affecting
baryonic matter can be naturally described in terms of gravitons pulled out
from this Dark Energy condensate (DEC). We then explain the additional
component of the acceleration at galactic scales, commonly attributed to dark
matter, as the reaction of the DEC to the presence of baryonic matter. This
additional dark force is also associated to gravitons pulled out from the DEC
and correctly reproduces the MOND acceleration. It also allows for an effective
description in terms of General Relativity sourced by an anisotropic fluid. We
finally calculate the mass ratio between the contribution of the apparent dark
matter and the baryonic matter in a region of size $r$ at galactic scales and
show that it is consistent with the $\Lambda$CDM predictions.
| gr-qc hep-th | we investigate the emergent laws of gravity when dark energy and the de sitter spacetime are modelled as a critical boseeinstein condensate of a large number of soft gravitons n_rm g we argue that this scenario requires the presence of various regimes of gravity in which n_rm g scales in different ways moreover the local gravitational interaction affecting baryonic matter can be naturally described in terms of gravitons pulled out from this dark energy condensate dec we then explain the additional component of the acceleration at galactic scales commonly attributed to dark matter as the reaction of the dec to the presence of baryonic matter this additional dark force is also associated to gravitons pulled out from the dec and correctly reproduces the mond acceleration it also allows for an effective description in terms of general relativity sourced by an anisotropic fluid we finally calculate the mass ratio between the contribution of the apparent dark matter and the baryonic matter in a region of size r at galactic scales and show that it is consistent with the lambdacdm predictions | [['we', 'investigate', 'the', 'emergent', 'laws', 'of', 'gravity', 'when', 'dark', 'energy', 'and', 'the', 'de', 'sitter', 'spacetime', 'are', 'modelled', 'as', 'a', 'critical', 'boseeinstein', 'condensate', 'of', 'a', 'large', 'number', 'of', 'soft', 'gravitons', 'n_rm', 'g', 'we', 'argue', 'that', 'this', 'scenario', 'requires', 'the', 'presence', 'of', 'various', 'regimes', 'of', 'gravity', 'in', 'which', 'n_rm', 'g', 'scales', 'in', 'different', 'ways', 'moreover', 'the', 'local', 'gravitational', 'interaction', 'affecting', 'baryonic', 'matter', 'can', 'be', 'naturally', 'described', 'in', 'terms', 'of', 'gravitons', 'pulled', 'out', 'from', 'this', 'dark', 'energy', 'condensate', 'dec', 'we', 'then', 'explain', 'the', 'additional', 'component', 'of', 'the', 'acceleration', 'at', 'galactic', 'scales', 'commonly', 'attributed', 'to', 'dark', 'matter', 'as', 'the', 'reaction', 'of', 'the', 'dec', 'to', 'the', 'presence', 'of', 'baryonic', 'matter', 'this', 'additional', 'dark', 'force', 'is', 'also', 'associated', 'to', 'gravitons', 'pulled', 'out', 'from', 'the', 'dec', 'and', 'correctly', 'reproduces', 'the', 'mond', 'acceleration', 'it', 'also', 'allows', 'for', 'an', 'effective', 'description', 'in', 'terms', 'of', 'general', 'relativity', 'sourced', 'by', 'an', 'anisotropic', 'fluid', 'we', 'finally', 'calculate', 'the', 'mass', 'ratio', 'between', 'the', 'contribution', 'of', 'the', 'apparent', 'dark', 'matter', 'and', 'the', 'baryonic', 'matter', 'in', 'a', 'region', 'of', 'size', 'r', 'at', 'galactic', 'scales', 'and', 'show', 'that', 'it', 'is', 'consistent', 'with', 'the', 'lambdacdm', 'predictions']] | [-0.13864901628053888, 0.1815280882258283, -0.132516243652598, 0.12420038327603346, -0.07421546895577255, -0.07845172623995765, -0.04414039061212257, 0.26412468769212966, -0.23042777873960704, -0.370319173744146, -0.013481990676815492, -0.24632279233697751, -0.07070375260033296, 0.13513890601039016, 0.004867104553147973, -0.04366100630748954, -0.04594707443748273, 0.03534401418880544, -0.018380921185745042, -0.21709883152689347, 0.3387709481358091, 0.10284135557773559, 0.20007255837820762, 0.04144363894579963, 0.12044273684706601, -0.057940762893260354, -0.05039426352953611, 0.0202838256877103, -0.157317497702878, 0.027113534471113754, 0.1901055258525114, 0.06754723044278818, 0.18787841838212194, -0.43140339540765105, -0.23262178165628056, 0.15193265993876498, 0.19502128905931476, 0.12932914907474322, -0.02553321923618335, -0.2896106710862993, 0.025181860254567597, -0.20464352385125348, -0.16684740983917476, -0.02337147349065076, 0.034141786635837744, -0.014939950732254115, -0.21816749733680205, 0.16600585039968435, 0.00020551489530828412, -0.04057525240363522, -0.07433258912001876, -0.08970914259761073, -0.03770820996997223, 0.01569028449190817, 0.1292723694155461, 0.038332950387068104, 0.19288526429383698, -0.20143578158998499, -0.03193648009399712, 0.44563398518542335, -0.1177162707011949, -0.13397996823495908, 0.17596793190612556, -0.1538004466415742, -0.13745093930190086, 0.12125432507171395, 0.14037274460304353, 0.07565986254257696, -0.11753604322187043, 0.1313779561523255, -0.021249672374558017, 0.17327162926215367, 0.09525108502595035, 0.037302489750485286, 0.35663786644958917, 0.13578631327872545, 0.02558613477233152, 0.0808240370974517, -0.099640373442668, -0.0785342538339091, -0.3894888075021767, -0.13053871967794645, -0.15471901891554066, 0.023356176131045934, -0.15388173706193492, -0.1133501904993188, 0.32692428978482607, 0.1267609158166627, 0.18606520471259205, 0.02279790720119344, 0.300620873653793, 0.07158835750371062, 0.03262804857814196, 0.10728783440625285, 0.3253372278605593, 0.13469391431550198, 0.09499048360743087, -0.2827045811579547, -0.04091349181682704, 0.008146448042659953] |
1,801.10375 | Lie Algebraic approach to molecular spectroscopy: Diatomic to polyatomic
molecules | Interacting dipole ($p$) bosons along with scalar ($s$) bosons, based on the
ideas drawn from the interacting boson model of atomic nuclei, led to the
development of the vibron model based on $U(4)$ spectrum generating algebra for
diatomic molecules. The $U(4) \supset SO(4) \supset SO(3)$ algebra generates
rotation-vibration spectra. Extending this to two coupled $SO(4)$ algebras and
three $SO(4)$ algebras describe triatomic and four-atomic molecules
respectively. Similarly, appropriately coupled $U(2) \supset SO(2)$ algebras
will describe the stretching vibrations, with proper point group symmetries, in
polyatomic molecules. In addition, coupled $U(3)$ algebras describe coupled
benders. The Lie algebraic approach to molecular spectroscopy is briefly
described along with a list giving future directions and presented in three
appendices results for: (i) $U(3)$ algebra for bending vibrations and coupled
benders; (ii) symmetry mixing Hamiltonians generating regular spectra; (iii)
partition functions for diatomic and triatomic molecules.
| physics.chem-ph | interacting dipole p bosons along with scalar s bosons based on the ideas drawn from the interacting boson model of atomic nuclei led to the development of the vibron model based on u4 spectrum generating algebra for diatomic molecules the u4 supset so4 supset so3 algebra generates rotationvibration spectra extending this to two coupled so4 algebras and three so4 algebras describe triatomic and fouratomic molecules respectively similarly appropriately coupled u2 supset so2 algebras will describe the stretching vibrations with proper point group symmetries in polyatomic molecules in addition coupled u3 algebras describe coupled benders the lie algebraic approach to molecular spectroscopy is briefly described along with a list giving future directions and presented in three appendices results for i u3 algebra for bending vibrations and coupled benders ii symmetry mixing hamiltonians generating regular spectra iii partition functions for diatomic and triatomic molecules | [['interacting', 'dipole', 'p', 'bosons', 'along', 'with', 'scalar', 's', 'bosons', 'based', 'on', 'the', 'ideas', 'drawn', 'from', 'the', 'interacting', 'boson', 'model', 'of', 'atomic', 'nuclei', 'led', 'to', 'the', 'development', 'of', 'the', 'vibron', 'model', 'based', 'on', 'u4', 'spectrum', 'generating', 'algebra', 'for', 'diatomic', 'molecules', 'the', 'u4', 'supset', 'so4', 'supset', 'so3', 'algebra', 'generates', 'rotationvibration', 'spectra', 'extending', 'this', 'to', 'two', 'coupled', 'so4', 'algebras', 'and', 'three', 'so4', 'algebras', 'describe', 'triatomic', 'and', 'fouratomic', 'molecules', 'respectively', 'similarly', 'appropriately', 'coupled', 'u2', 'supset', 'so2', 'algebras', 'will', 'describe', 'the', 'stretching', 'vibrations', 'with', 'proper', 'point', 'group', 'symmetries', 'in', 'polyatomic', 'molecules', 'in', 'addition', 'coupled', 'u3', 'algebras', 'describe', 'coupled', 'benders', 'the', 'lie', 'algebraic', 'approach', 'to', 'molecular', 'spectroscopy', 'is', 'briefly', 'described', 'along', 'with', 'a', 'list', 'giving', 'future', 'directions', 'and', 'presented', 'in', 'three', 'appendices', 'results', 'for', 'i', 'u3', 'algebra', 'for', 'bending', 'vibrations', 'and', 'coupled', 'benders', 'ii', 'symmetry', 'mixing', 'hamiltonians', 'generating', 'regular', 'spectra', 'iii', 'partition', 'functions', 'for', 'diatomic', 'and', 'triatomic', 'molecules']] | [-0.1463264736366716, 0.19791577800494084, -0.002633435821741925, 0.02893084572654561, -0.06881002920633512, -0.23595187514822216, -0.03874615174288868, 0.4017790503311136, -0.24380946907723414, -0.1654185807986304, 0.018421206406172338, -0.3008406827530117, -0.06953825733247906, 0.08738362195023092, 0.03918058933287278, -0.04365297169127363, 0.03378307558794288, 0.01651861652705475, -0.07542905473672118, -0.17153630194300457, 0.27381979081621194, -0.008527247644696674, 0.239047512134656, -0.01396322005646343, 0.10773063934877092, 0.015735011237363022, 0.029508101157778015, -0.1398533375814874, -0.1380623848049931, 0.15812657149970955, 0.24738446984717505, -0.013741257673142649, 0.11564170443023561, -0.44327673777039595, -0.09967716740847216, 0.08236742960718454, 0.22601632732429033, 0.133927887843935, -0.055617399607844495, -0.3329854449389357, -0.05324079605448555, -0.1898492286605133, -0.20154493438172424, -0.1281555249200513, 0.05901237898588272, 0.013513510908059616, -0.26133700425848894, 0.051234231066249365, -0.015474642111741483, 0.1536612500443209, -0.10333041376880113, -0.176979642367182, -0.1324906912764389, -0.030177573689939917, -0.0014594784006476402, 0.03634269887099294, 0.18591068034862823, -0.049783312192133874, -0.1417601955963748, 0.4633988629273595, -0.06009130240484068, -0.23604791858794946, 0.14853181418507022, -0.10033006112401684, -0.2671390545706377, 0.15749632322117157, 0.09848468817344451, 0.10455406462800101, -0.1436746220190263, 0.18503264573462355, -0.05290178940070014, 0.07851933777940803, 0.0556747220367431, 0.031394868491362804, 0.17833972808158566, 0.10464134172978976, -0.017514947788618136, 0.11861155112934503, 0.008733931205611913, -0.1301044017631323, -0.33395516789181434, -0.12480737216909357, -0.09834017523016172, 0.09371784155699589, -0.03903561488571263, -0.10543151046578766, 0.4292200994578765, 0.06478583650227557, 0.13455928115715796, 0.018228361899931485, 0.16539608485045584, 0.055136383986695015, 0.08754098425282443, -0.007294226183509785, 0.15418697550978697, 0.2710717036851173, -0.02978975317153604, -0.28033655647564915, -0.1680302405267531, 0.18396519928186444] |
1,801.10376 | Hamiltonian For String in Newton-Cartan Background | This paper is devoted to the construction of the Hamiltonian for
non-relativistic string in the Newton-Cartan background. We start with the
Hamiltonian for relativistic string in general background. Then we perform
limiting procedure on the metric that leads to Newton-Cartan background. We
determine constraint structure for non-relativistic string and show that these
constraints are the first class constraints. Then we determine corresponding
Lagrangian and discuss its properties.
| hep-th | this paper is devoted to the construction of the hamiltonian for nonrelativistic string in the newtoncartan background we start with the hamiltonian for relativistic string in general background then we perform limiting procedure on the metric that leads to newtoncartan background we determine constraint structure for nonrelativistic string and show that these constraints are the first class constraints then we determine corresponding lagrangian and discuss its properties | [['this', 'paper', 'is', 'devoted', 'to', 'the', 'construction', 'of', 'the', 'hamiltonian', 'for', 'nonrelativistic', 'string', 'in', 'the', 'newtoncartan', 'background', 'we', 'start', 'with', 'the', 'hamiltonian', 'for', 'relativistic', 'string', 'in', 'general', 'background', 'then', 'we', 'perform', 'limiting', 'procedure', 'on', 'the', 'metric', 'that', 'leads', 'to', 'newtoncartan', 'background', 'we', 'determine', 'constraint', 'structure', 'for', 'nonrelativistic', 'string', 'and', 'show', 'that', 'these', 'constraints', 'are', 'the', 'first', 'class', 'constraints', 'then', 'we', 'determine', 'corresponding', 'lagrangian', 'and', 'discuss', 'its', 'properties']] | [-0.10259013350552587, 0.10358675341504112, -0.08600154321696331, 0.11839508361169207, -0.1212830311312938, -0.08940980096222527, -0.016136629732826084, 0.34876200684638164, -0.2398933710725005, -0.2981999256550821, 0.03993458624706784, -0.24376906681138633, -0.16182321968919305, 0.142181181585166, -0.0567833679769911, 0.043323122325471475, 0.04167071288562755, 0.10524096859118609, -0.14072224205193012, -0.22325360962300936, 0.40281823733404504, 0.09233208253646075, 0.2494992605069958, 0.04082199141605577, 0.11455485483270082, 0.0033425328099349542, -0.05640274366892096, 0.05100481363652802, -0.19300880905265969, 0.10860684857384037, 0.18637130384458533, 0.1464663232231874, 0.11985525617084063, -0.47855162406479246, -0.19080181643253874, 0.07408326679368073, 0.09383822507016472, 0.19316676587783801, 0.009570401181022066, -0.26067357963479276, 0.10164112547662721, -0.1571757970516806, -0.15335862850075338, -0.10560033276135018, 0.01111429459901888, -0.052865504884897774, -0.21379839710686216, 0.01950177654568384, 0.0898600068332544, -0.05063483230213621, -0.08528822612663758, -0.032494548067047414, 0.031317168711198135, 0.07401261879687211, 0.10220351507678739, 0.051134042118662106, 0.10594345053741291, -0.14210670121333827, -0.09018883387794469, 0.45229230962916095, -0.09202390629103158, -0.26155275715264814, 0.12209618806755587, -0.10676242395846257, -0.2509881425440423, 0.059599785877864304, 0.1855309650079528, 0.1376514397839557, -0.188507204473109, 0.20554260802350993, -0.0064874077632800856, 0.07633490472642789, 0.05936985160571648, 0.054140279039135895, 0.20714051708745868, 0.11377860122679997, 0.08754561746270577, 0.16950932763683707, -0.07845617817200498, -0.10983082469997567, -0.4060748059080163, -0.1236617539739132, -0.10364093459141788, 0.07603874455080993, -0.08429324397523609, -0.1605209423465404, 0.36930981417422865, 0.18877852453725108, 0.1627540792713859, 0.10005957886243044, 0.22525702400216416, 0.13638804317799522, -0.049917401725064904, 0.07720631959417196, 0.2917951265377785, 0.15933852343917337, 0.040509513641860506, -0.24761452145679896, -0.11678567703173899, 0.14952268356582454] |
1,801.10377 | A note on Waring's problem | In this paper, we will present a new iterative construction for the auxiliary
equation of Waring's problem, which seems a little simpler than the one of so
called "smooth numbers" in papers [4] and [8], and give same upper bounds of
G(k) as in [4], [8].
| math.NT | in this paper we will present a new iterative construction for the auxiliary equation of warings problem which seems a little simpler than the one of so called smooth numbers in papers 4 and 8 and give same upper bounds of gk as in 4 8 | [['in', 'this', 'paper', 'we', 'will', 'present', 'a', 'new', 'iterative', 'construction', 'for', 'the', 'auxiliary', 'equation', 'of', 'warings', 'problem', 'which', 'seems', 'a', 'little', 'simpler', 'than', 'the', 'one', 'of', 'so', 'called', 'smooth', 'numbers', 'in', 'papers', '4', 'and', '8', 'and', 'give', 'same', 'upper', 'bounds', 'of', 'gk', 'as', 'in', '4', '8']] | [-0.12761103661994086, 0.09659175178967416, -0.08785173198734612, 0.11227725072429799, -0.09835084171398827, -0.14339009982169323, 0.04841429711592829, 0.2709154568855529, -0.20889536271114711, -0.37030547087931115, 0.15221455236947487, -0.2309006417737059, -0.1701916484263442, 0.22877233689043508, -0.08950497793114703, 0.008209457357778498, 0.04860058350933959, 0.09421759256688149, -0.119032980195935, -0.30614691826960316, 0.30705347847517417, 0.00952969740509339, 0.16407319732799963, 0.04492243952320322, 0.08787966215902049, -0.00865152777860994, -0.06425811172179553, -0.030018712596400925, -0.1704884179736204, 0.1605379759997089, 0.26667115865680185, 0.13818162837592157, 0.28137553311155544, -0.3961318166845519, -0.12777897716011427, 0.12812338303774595, 0.22718159069874042, 0.11120201886945363, -0.03871797486815764, -0.15708964534670763, 0.09498722652864197, -0.16869018473864897, -0.13461103970589844, 0.016377833712360134, 0.05906287086722643, -0.013972020586547644, -0.2457334597028144, 0.023472157448692167, 0.11272266235850427, 0.07244863465830745, -0.03669681987198799, -0.19417736650970968, 0.051784506189110485, 0.028563242830822, -0.019375649463061407, 0.06458351501952046, -0.015613172972655815, -0.11483459319899102, -0.1126552008031665, 0.35307260339512775, -0.06653372971397956, -0.22160419372274823, 0.15469015166467137, -0.11134269750555573, -0.21017276129239928, 0.14001007207527594, 0.15230567046724583, 0.1645355127427889, -0.15104803329576616, 0.09199735251731118, -0.10020190687931102, 0.14608012087157238, 0.11827824787115274, 0.01810864760014026, 0.06936565940470799, 0.1468839377934194, 0.12839621044290456, 0.18069441633744407, -0.04625137574444323, -0.03354794864097367, -0.3369362841805686, -0.19601291568466442, -0.13736123068804812, 0.10594558027451453, -0.07240592407849719, -0.1547105163512954, 0.37256310005550797, 0.1257893188411127, 0.20453899486860988, 0.08296043852738955, 0.2773940639327402, 0.09567117335973307, 0.025282964839235596, 0.09646439704153201, 0.2037449046847937, 0.12456561987409773, 0.11159211578627076, -0.07227155589878195, -0.016588192665949464, 0.11560086372470402] |
1,801.10378 | Data driven time scale in Gaussian quasi-likelihood inference | We study parametric estimation of ergodic diffusions observed at high
frequency. Different from the previous studies, we suppose that sampling
stepsize is unknown, thereby making the conventional Gaussian quasi-likelihood
not directly applicable. In this situation, we construct estimators of both
model parameters and sampling stepsize in a fully explicit way, and prove that
they are jointly asymptotically normally distributed. The $L^{q}$-boundedness
of the obtained estimator is also derived. Further, we propose the Schwarz
(BIC) type statistics for model selection and show its model-selection
consistency. We conducted some numerical experiments and found that the
observed finite-sample performance well supports our theoretical findings. Also
provided is a real data example.
| math.ST stat.TH | we study parametric estimation of ergodic diffusions observed at high frequency different from the previous studies we suppose that sampling stepsize is unknown thereby making the conventional gaussian quasilikelihood not directly applicable in this situation we construct estimators of both model parameters and sampling stepsize in a fully explicit way and prove that they are jointly asymptotically normally distributed the lqboundedness of the obtained estimator is also derived further we propose the schwarz bic type statistics for model selection and show its modelselection consistency we conducted some numerical experiments and found that the observed finitesample performance well supports our theoretical findings also provided is a real data example | [['we', 'study', 'parametric', 'estimation', 'of', 'ergodic', 'diffusions', 'observed', 'at', 'high', 'frequency', 'different', 'from', 'the', 'previous', 'studies', 'we', 'suppose', 'that', 'sampling', 'stepsize', 'is', 'unknown', 'thereby', 'making', 'the', 'conventional', 'gaussian', 'quasilikelihood', 'not', 'directly', 'applicable', 'in', 'this', 'situation', 'we', 'construct', 'estimators', 'of', 'both', 'model', 'parameters', 'and', 'sampling', 'stepsize', 'in', 'a', 'fully', 'explicit', 'way', 'and', 'prove', 'that', 'they', 'are', 'jointly', 'asymptotically', 'normally', 'distributed', 'the', 'lqboundedness', 'of', 'the', 'obtained', 'estimator', 'is', 'also', 'derived', 'further', 'we', 'propose', 'the', 'schwarz', 'bic', 'type', 'statistics', 'for', 'model', 'selection', 'and', 'show', 'its', 'modelselection', 'consistency', 'we', 'conducted', 'some', 'numerical', 'experiments', 'and', 'found', 'that', 'the', 'observed', 'finitesample', 'performance', 'well', 'supports', 'our', 'theoretical', 'findings', 'also', 'provided', 'is', 'a', 'real', 'data', 'example']] | [-0.0779555661461523, 0.04493065356897811, -0.11011202064670485, 0.1146162452005902, -0.08099843954012075, -0.18245347331847167, 0.09525280852621007, 0.4559520803115986, -0.24546552064863067, -0.25666405005311527, 0.1303652216652322, -0.23076736116868066, -0.19249494345341292, 0.2135861713775537, -0.1045871763576374, 0.10019561937197405, 0.0747060748442352, -0.0004628045156736065, -0.04829649245086195, -0.27622723773863445, 0.2660151030534137, 0.07313226955011487, 0.349148923472967, -0.03180083909925694, 0.09908083707624529, -0.013221615606367036, -0.06837430393271562, 0.007405457656002707, -0.17789484632811325, 0.08156948753727462, 0.25191518912712735, 0.1403834538047064, 0.28606410138309, -0.3307295319089597, -0.2313010728124667, 0.11682141148830177, 0.16526936826132307, 0.09490671920314155, -0.08652575763968613, -0.2784790535526419, 0.08192569569736305, -0.14533045706452363, -0.10468260057624085, -0.13350229236055855, -0.08965216694977479, 0.03974348369768079, -0.3703598896412317, 0.08210992991991117, 0.07556915915834166, 0.043955610991731564, -0.0631674748890671, -0.15213944862976117, 0.011577863065111969, 0.0642477601757963, 0.06908220985766363, -0.042308500339762155, 0.09843299339128728, -0.05020812117598123, -0.1178315557298009, 0.3018968184904359, -0.0562743463087827, -0.2588577754450617, 0.19620669860591147, -0.15183405268557923, -0.153363971037497, 0.06746500220874117, 0.1473541061600877, 0.11769851423472304, -0.1574767527064843, 0.0720901805368528, -0.05197924017233567, 0.13585899815101316, -0.018643335945887008, -0.0094946697699251, 0.11724640584887108, 0.14573258005462034, 0.05976108938921243, 0.1449858353568103, -0.10633063822320697, -0.09615937791575023, -0.3287839610474529, -0.08817588934174704, -0.21657706263337145, -0.010782072219121296, -0.13454083697730243, -0.15039351306795315, 0.3540776717321326, 0.21489331714326032, 0.1804664686486056, 0.14962385089947255, 0.30800962791329733, 0.12475025071439126, -0.008609416085097042, 0.1099938254725809, 0.23319271811056683, 0.10003014689276891, 0.040522799602951166, -0.18587771959654573, 0.08754019915660913, -0.0025821992226324423] |
1,801.10379 | Transmission eigenchannels for coherent phonon transport | We present a procedure to determine transmission eigenchannels for coherent
phonon transport in nanoscale devices using the framework of nonequilibrium
Green's functions. We illustrate our procedure by analyzing a one-dimensional
chain, where all steps can be carried out analytically. More importantly, we
show how the procedure can be combined with ab initio calculations to provide a
better understanding of phonon heat transport in realistic atomic-scale
junctions. In particular, we study the phonon eigenchannels in a gold metallic
atomic-size contact and different single-molecule junctions based on molecules
such as an alkane chain, C$_{60}$, and a brominated benzene-diamine, where in
this latter case destructive phonon interference effects take place.
| cond-mat.mes-hall cond-mat.mtrl-sci | we present a procedure to determine transmission eigenchannels for coherent phonon transport in nanoscale devices using the framework of nonequilibrium greens functions we illustrate our procedure by analyzing a onedimensional chain where all steps can be carried out analytically more importantly we show how the procedure can be combined with ab initio calculations to provide a better understanding of phonon heat transport in realistic atomicscale junctions in particular we study the phonon eigenchannels in a gold metallic atomicsize contact and different singlemolecule junctions based on molecules such as an alkane chain c_60 and a brominated benzenediamine where in this latter case destructive phonon interference effects take place | [['we', 'present', 'a', 'procedure', 'to', 'determine', 'transmission', 'eigenchannels', 'for', 'coherent', 'phonon', 'transport', 'in', 'nanoscale', 'devices', 'using', 'the', 'framework', 'of', 'nonequilibrium', 'greens', 'functions', 'we', 'illustrate', 'our', 'procedure', 'by', 'analyzing', 'a', 'onedimensional', 'chain', 'where', 'all', 'steps', 'can', 'be', 'carried', 'out', 'analytically', 'more', 'importantly', 'we', 'show', 'how', 'the', 'procedure', 'can', 'be', 'combined', 'with', 'ab', 'initio', 'calculations', 'to', 'provide', 'a', 'better', 'understanding', 'of', 'phonon', 'heat', 'transport', 'in', 'realistic', 'atomicscale', 'junctions', 'in', 'particular', 'we', 'study', 'the', 'phonon', 'eigenchannels', 'in', 'a', 'gold', 'metallic', 'atomicsize', 'contact', 'and', 'different', 'singlemolecule', 'junctions', 'based', 'on', 'molecules', 'such', 'as', 'an', 'alkane', 'chain', 'c_60', 'and', 'a', 'brominated', 'benzenediamine', 'where', 'in', 'this', 'latter', 'case', 'destructive', 'phonon', 'interference', 'effects', 'take', 'place']] | [-0.14198275321602785, 0.10558725707137753, -0.10865976017351463, 0.04200277487403565, -0.024356886255990053, -0.1749275969210838, 0.11780903974621966, 0.45264888359843014, -0.24731364381003462, -0.21759480877701087, -0.029541657829578863, -0.2837124465905983, -0.19092834495752178, 0.22467529621175447, 0.05625980654209156, 0.038526593587618584, 0.08246861362098673, -0.08330225438139593, -0.025979740101252202, -0.16228334056909813, 0.23838018451460471, 0.04096312823250594, 0.2993539789970094, 0.12132786487655661, 0.02367298100491829, 0.0614507680576051, 0.06669490910613927, 0.030656225200324693, -0.18794303699875267, 0.09267253947017767, 0.31499019880326484, -0.08191901314394356, 0.2189086408345638, -0.5701261118889969, -0.25606092006385883, 0.01695579958479323, 0.19421928613822012, 0.1885104584572924, -0.006165364299814878, -0.24351158443725207, 0.0366319744830307, -0.13437831897079666, -0.0726935597609622, -0.12920681767548634, -0.05419886539141848, 0.022059858792948875, -0.23626222553778284, 0.068533170820327, 0.003673148130406147, 0.0747600781320454, -0.020176672709210357, -0.10086516908013096, -0.02004020336893535, 0.09724077512727719, -0.041229988112029776, -0.03993944267777152, 0.20561496154557496, -0.046900272175721895, -0.11333622560601368, 0.3686863881944914, -0.05460413809099766, -0.17363488939634272, 0.15016871264474205, -0.14077843150350255, -0.10484885164997845, 0.1197360235518802, 0.13082604505400233, 0.15324011760128436, -0.23725044347180455, 0.028150742217489283, -0.001136907709275033, 0.14296658549247807, 0.059695922963268984, 0.05165209850104891, 0.2110788499344593, 0.21141356605575115, 0.020429108755349694, 0.16459115747597383, -0.11203702158625369, -0.06963021168485284, -0.24658172502765588, -0.19668938318772294, -0.19849399477352223, 0.11355184513431425, -0.050315582837254486, -0.16371405320503166, 0.37765255327571495, 0.15736335581420471, 0.15607180424191266, -0.014272913589168375, 0.29216081262609667, 0.13243512464164992, 0.03807028126059683, 0.008987383342513415, 0.1910422468366467, 0.1430461753233745, 0.03811556555409089, -0.31843412817220823, 0.033520739960754026, -0.023903652190048003] |
1,801.1038 | Global solution for massive Maxwell-Klein-Gordon equations | We derive the asymptotic properties of the mMKG system (Maxwell coupled with
a massive Klein-Gordon scalar field), in the exterior of the domain of
influence of a compact set. This complements the previous well known results,
restricted to compactly supported initial conditions, based on the so called
hyperboloidal method. That method takes advantage of the commutation properties
of the Maxwell and Klein Gordon with the generators of the Poincar\'e group to
resolve the difficulties caused by the fact that they have, separately,
different asymptotic properties. Though the hyperboloidal method is very robust
and applies well to other related systems it has the well known drawback that
it requires compactly supported data. In this paper we remove this limitation
based on a further extension of the vector-field method adapted to the exterior
region. Our method applies, in particular, to nontrivial charges. The full
problem could then be treated by patching together the new estimates in the
exterior with the hyperboloidal ones in the interior. This purely physical
space approach introduced here maintains the robust properties of the old
method and can thus be applied to other situations such as the coupled Einstein
Klein-Gordon equation.
| math.AP gr-qc | we derive the asymptotic properties of the mmkg system maxwell coupled with a massive kleingordon scalar field in the exterior of the domain of influence of a compact set this complements the previous well known results restricted to compactly supported initial conditions based on the so called hyperboloidal method that method takes advantage of the commutation properties of the maxwell and klein gordon with the generators of the poincare group to resolve the difficulties caused by the fact that they have separately different asymptotic properties though the hyperboloidal method is very robust and applies well to other related systems it has the well known drawback that it requires compactly supported data in this paper we remove this limitation based on a further extension of the vectorfield method adapted to the exterior region our method applies in particular to nontrivial charges the full problem could then be treated by patching together the new estimates in the exterior with the hyperboloidal ones in the interior this purely physical space approach introduced here maintains the robust properties of the old method and can thus be applied to other situations such as the coupled einstein kleingordon equation | [['we', 'derive', 'the', 'asymptotic', 'properties', 'of', 'the', 'mmkg', 'system', 'maxwell', 'coupled', 'with', 'a', 'massive', 'kleingordon', 'scalar', 'field', 'in', 'the', 'exterior', 'of', 'the', 'domain', 'of', 'influence', 'of', 'a', 'compact', 'set', 'this', 'complements', 'the', 'previous', 'well', 'known', 'results', 'restricted', 'to', 'compactly', 'supported', 'initial', 'conditions', 'based', 'on', 'the', 'so', 'called', 'hyperboloidal', 'method', 'that', 'method', 'takes', 'advantage', 'of', 'the', 'commutation', 'properties', 'of', 'the', 'maxwell', 'and', 'klein', 'gordon', 'with', 'the', 'generators', 'of', 'the', 'poincare', 'group', 'to', 'resolve', 'the', 'difficulties', 'caused', 'by', 'the', 'fact', 'that', 'they', 'have', 'separately', 'different', 'asymptotic', 'properties', 'though', 'the', 'hyperboloidal', 'method', 'is', 'very', 'robust', 'and', 'applies', 'well', 'to', 'other', 'related', 'systems', 'it', 'has', 'the', 'well', 'known', 'drawback', 'that', 'it', 'requires', 'compactly', 'supported', 'data', 'in', 'this', 'paper', 'we', 'remove', 'this', 'limitation', 'based', 'on', 'a', 'further', 'extension', 'of', 'the', 'vectorfield', 'method', 'adapted', 'to', 'the', 'exterior', 'region', 'our', 'method', 'applies', 'in', 'particular', 'to', 'nontrivial', 'charges', 'the', 'full', 'problem', 'could', 'then', 'be', 'treated', 'by', 'patching', 'together', 'the', 'new', 'estimates', 'in', 'the', 'exterior', 'with', 'the', 'hyperboloidal', 'ones', 'in', 'the', 'interior', 'this', 'purely', 'physical', 'space', 'approach', 'introduced', 'here', 'maintains', 'the', 'robust', 'properties', 'of', 'the', 'old', 'method', 'and', 'can', 'thus', 'be', 'applied', 'to', 'other', 'situations', 'such', 'as', 'the', 'coupled', 'einstein', 'kleingordon', 'equation']] | [-0.09454530402823973, 0.04975845591009905, -0.11854375650242825, 0.055134887938644773, -0.13952887889536214, -0.0954407261669985, -0.009468236607669192, 0.31912017029632506, -0.26127109098282136, -0.28933214741846314, 0.11739934724694952, -0.22069975553373902, -0.1662118075279674, 0.20801187957719472, -0.09356633226479971, 0.07170803064643867, 0.05426126718945549, 0.06201727270430032, -0.07238833906709867, -0.24725305617660828, 0.3844995496280414, 0.024053734154828515, 0.26922637371414265, 0.02060267263247321, 0.10611862060189499, 0.012588635585416341, -0.035108166597638046, 0.053202173802825804, -0.10624609163941538, 0.12096390452097694, 0.1883726726518944, 0.10052917778739356, 0.25979657233013614, -0.4299484009728379, -0.2258548739143104, 0.07416653910695459, 0.15063487075288626, 0.11323045704193646, -0.05734119428052509, -0.32844781446813914, 0.09380431244305025, -0.13748525203967196, -0.202986888269758, -0.07053195698244963, -0.023977106395250303, 0.01750761866424, -0.24326166092578205, 0.07017442203990261, 0.08363001049231873, -0.026462933000099536, -0.1073945229460757, -0.08738961347080476, -0.007849437935268119, 0.10382674038676971, 0.05854065942912712, 0.02248165557102766, 0.08577703102006733, -0.06652960134912671, -0.07660473440713152, 0.3745599669321867, -0.06942868814561128, -0.2959774745201382, 0.20470072397438344, -0.13669528320072763, -0.11794680569437332, 0.10209486003198738, 0.1349116888741264, 0.17729018111519204, -0.14435518722651372, 0.14636720250715976, -0.04390621812126483, 0.11397122884227429, 0.05851471813609047, 0.022973579230892938, 0.16979740468044233, 0.1277541704645652, 0.06365089728812261, 0.15110309294019922, -0.049918099085819755, -0.08696485919426777, -0.31259464942559134, -0.14945336139256446, -0.1972828167854459, 0.0346325208114043, -0.066203494010324, -0.17382185471493963, 0.3770897790012289, 0.16830957255054577, 0.16920210436152652, 0.025711177163126802, 0.30185169765051495, 0.11897309979796471, 0.10142235257080756, 0.08152970835362794, 0.24433110118843615, 0.14808254226712356, 0.10805997081214021, -0.22580860923335422, -0.009514753211078641, 0.08485167360292205] |
1,801.10381 | Noise contrastive estimation: asymptotics, comparison with MC-MLE | A statistical model is said to be un-normalised when its likelihood function
involves an intractable normalising constant. Two popular methods for parameter
inference for these models are MC-MLE (Monte Carlo maximum likelihood
estimation), and NCE (noise contrastive estimation); both methods rely on
simulating artificial data-points to approximate the normalising constant.
While the asymptotics of MC-MLE have been established under general hypotheses
(Geyer, 1994), this is not so for NCE. We establish consistency and asymptotic
normality of NCE estimators under mild assumptions. We compare NCE and MC-MLE
under several asymptotic regimes. In particular, we show that, when m goes to
infinity while n is fixed (m and n being respectively the number of artificial
data-points, and actual data-points), the two estimators are asymptotically
equivalent. Conversely, we prove that, when the artificial data-points are IID,
and when n goes to infinity while m/n converges to a positive constant, the
asymptotic variance of a NCE estimator is always smaller than the asymptotic
variance of the corresponding MC-MLE estimator. We illustrate the variance
reduction brought by NCE through a numerical study.
| math.ST stat.TH | a statistical model is said to be unnormalised when its likelihood function involves an intractable normalising constant two popular methods for parameter inference for these models are mcmle monte carlo maximum likelihood estimation and nce noise contrastive estimation both methods rely on simulating artificial datapoints to approximate the normalising constant while the asymptotics of mcmle have been established under general hypotheses geyer 1994 this is not so for nce we establish consistency and asymptotic normality of nce estimators under mild assumptions we compare nce and mcmle under several asymptotic regimes in particular we show that when m goes to infinity while n is fixed m and n being respectively the number of artificial datapoints and actual datapoints the two estimators are asymptotically equivalent conversely we prove that when the artificial datapoints are iid and when n goes to infinity while mn converges to a positive constant the asymptotic variance of a nce estimator is always smaller than the asymptotic variance of the corresponding mcmle estimator we illustrate the variance reduction brought by nce through a numerical study | [['a', 'statistical', 'model', 'is', 'said', 'to', 'be', 'unnormalised', 'when', 'its', 'likelihood', 'function', 'involves', 'an', 'intractable', 'normalising', 'constant', 'two', 'popular', 'methods', 'for', 'parameter', 'inference', 'for', 'these', 'models', 'are', 'mcmle', 'monte', 'carlo', 'maximum', 'likelihood', 'estimation', 'and', 'nce', 'noise', 'contrastive', 'estimation', 'both', 'methods', 'rely', 'on', 'simulating', 'artificial', 'datapoints', 'to', 'approximate', 'the', 'normalising', 'constant', 'while', 'the', 'asymptotics', 'of', 'mcmle', 'have', 'been', 'established', 'under', 'general', 'hypotheses', 'geyer', '1994', 'this', 'is', 'not', 'so', 'for', 'nce', 'we', 'establish', 'consistency', 'and', 'asymptotic', 'normality', 'of', 'nce', 'estimators', 'under', 'mild', 'assumptions', 'we', 'compare', 'nce', 'and', 'mcmle', 'under', 'several', 'asymptotic', 'regimes', 'in', 'particular', 'we', 'show', 'that', 'when', 'm', 'goes', 'to', 'infinity', 'while', 'n', 'is', 'fixed', 'm', 'and', 'n', 'being', 'respectively', 'the', 'number', 'of', 'artificial', 'datapoints', 'and', 'actual', 'datapoints', 'the', 'two', 'estimators', 'are', 'asymptotically', 'equivalent', 'conversely', 'we', 'prove', 'that', 'when', 'the', 'artificial', 'datapoints', 'are', 'iid', 'and', 'when', 'n', 'goes', 'to', 'infinity', 'while', 'mn', 'converges', 'to', 'a', 'positive', 'constant', 'the', 'asymptotic', 'variance', 'of', 'a', 'nce', 'estimator', 'is', 'always', 'smaller', 'than', 'the', 'asymptotic', 'variance', 'of', 'the', 'corresponding', 'mcmle', 'estimator', 'we', 'illustrate', 'the', 'variance', 'reduction', 'brought', 'by', 'nce', 'through', 'a', 'numerical', 'study']] | [-0.05845988258761538, 0.06322929660382215, -0.09433268417346444, 0.13964154224613903, -0.04937861659195758, -0.20828251993957128, 0.06517917619778717, 0.3981181142962206, -0.22060095853472161, -0.29944958928498927, 0.12909778112895512, -0.3085088102820482, -0.13113332591032725, 0.17108271473171557, -0.10663304508184898, 0.11134368046759076, 0.09456447293813534, 0.04603059960550255, -0.09268721337509105, -0.3250779702491258, 0.2537961596291575, 0.0656772149137437, 0.3180345401843999, -0.06680460256296815, 0.13003405460385384, 0.003059346823411136, -0.018738152381982443, 0.02939324515561263, -0.1709430452485044, 0.07807321952245498, 0.20659405971038444, 0.14889316409721046, 0.33350262303684053, -0.3512813197185764, -0.16207543116965262, 0.19845302645274895, 0.16616735708295358, 0.07383983034119641, 0.043734742200928135, -0.23634806318513754, 0.11981570966131354, -0.11974600968766684, -0.07831190960576474, -0.09622001597962979, -0.010271919786004023, 0.04389800889270201, -0.37333192526610137, 0.09312224766571012, 0.0729695443776936, 0.05854050063733327, 0.015398744443078961, -0.20308349038918877, 0.01557367950635778, 0.06245868638128905, 0.1632173393108477, -0.029754464421815917, 0.08493687459241367, -0.08874155861051954, -0.041854230834350074, 0.24676098187827628, -0.09966543032092208, -0.26091920470787305, 0.15163615125357727, -0.11210472674482623, -0.12979752025277602, 0.10775278924338225, 0.13838395342693827, 0.13918669873553902, -0.15083217318465744, 0.1670420929075266, -0.03227855900886579, 0.13471136574625528, 0.053018907379716804, -0.04530961928451118, 0.09969404218244855, 0.12133621733956629, 0.10826729305251633, 0.13191976307909067, -0.11415761520186345, -0.09645631435027315, -0.29458200830392706, -0.12051914354502144, -0.2271779986508822, 0.06228780584539074, -0.17896047615959826, -0.19308164482936263, 0.2713923166258692, 0.19962735888206184, 0.1980082702686179, 0.17626416333556427, 0.298780571364161, 0.1438514175588044, -0.027796993962762678, 0.12508310419559943, 0.21573532073321822, 0.14966000286378178, -0.01945106971003957, -0.19862638546040776, 0.1445224114698963, 0.041749451001632513] |
1,801.10382 | FirstLight II: Star formation rates of primeval galaxies from z=5-15 | In the FirstLight project, we have used ~300 cosmological, zoom-in
simulations to determine the star-formation histories of distinct first
galaxies with stellar masses between Ms=10^6 and 3 x 10^9 Msun during cosmic
dawn (z=5-15). The evolution of the star formation rate (SFR) in each galaxy is
complex and diverse, characterized by bursts of star formation. Overall, first
galaxies spend 70% of their time in SF bursts. A sample of 1000 of these bursts
indicates that the typical burst at z=6 has a specific SFR (sSFR) maximum of
5-15 Gyr^-1 with an effective width of ~100 Myr, one tenth of the age of the
Universe at that redshift. A quarter of the bursts populate a tail with very
high sSFR maxima of 20-30 Gyr^-1 and significantly shorter timescales of ~40-80
Myr. This diversity of bursts sets the mean and the mass-dependent scatter of
the star-forming main sequence. This scatter is driven by a population of
low-mass, Ms < 10^8 Msun, quiescent galaxies. The mean sSFR and the burst
maximum at fixed mass increase with redshift, with the later always being a
factor ~2 higher than the former. This implies sSFR maxima of ~20-60 Gyr^-1 at
z=9-10. The SFR histories are publicly available at the FirstLight website.
| astro-ph.GA | in the firstlight project we have used 300 cosmological zoomin simulations to determine the starformation histories of distinct first galaxies with stellar masses between ms106 and 3 x 109 msun during cosmic dawn z515 the evolution of the star formation rate sfr in each galaxy is complex and diverse characterized by bursts of star formation overall first galaxies spend 70 of their time in sf bursts a sample of 1000 of these bursts indicates that the typical burst at z6 has a specific sfr ssfr maximum of 515 gyr1 with an effective width of 100 myr one tenth of the age of the universe at that redshift a quarter of the bursts populate a tail with very high ssfr maxima of 2030 gyr1 and significantly shorter timescales of 4080 myr this diversity of bursts sets the mean and the massdependent scatter of the starforming main sequence this scatter is driven by a population of lowmass ms 108 msun quiescent galaxies the mean ssfr and the burst maximum at fixed mass increase with redshift with the later always being a factor 2 higher than the former this implies ssfr maxima of 2060 gyr1 at z910 the sfr histories are publicly available at the firstlight website | [['in', 'the', 'firstlight', 'project', 'we', 'have', 'used', '300', 'cosmological', 'zoomin', 'simulations', 'to', 'determine', 'the', 'starformation', 'histories', 'of', 'distinct', 'first', 'galaxies', 'with', 'stellar', 'masses', 'between', 'ms106', 'and', '3', 'x', '109', 'msun', 'during', 'cosmic', 'dawn', 'z515', 'the', 'evolution', 'of', 'the', 'star', 'formation', 'rate', 'sfr', 'in', 'each', 'galaxy', 'is', 'complex', 'and', 'diverse', 'characterized', 'by', 'bursts', 'of', 'star', 'formation', 'overall', 'first', 'galaxies', 'spend', '70', 'of', 'their', 'time', 'in', 'sf', 'bursts', 'a', 'sample', 'of', '1000', 'of', 'these', 'bursts', 'indicates', 'that', 'the', 'typical', 'burst', 'at', 'z6', 'has', 'a', 'specific', 'sfr', 'ssfr', 'maximum', 'of', '515', 'gyr1', 'with', 'an', 'effective', 'width', 'of', '100', 'myr', 'one', 'tenth', 'of', 'the', 'age', 'of', 'the', 'universe', 'at', 'that', 'redshift', 'a', 'quarter', 'of', 'the', 'bursts', 'populate', 'a', 'tail', 'with', 'very', 'high', 'ssfr', 'maxima', 'of', '2030', 'gyr1', 'and', 'significantly', 'shorter', 'timescales', 'of', '4080', 'myr', 'this', 'diversity', 'of', 'bursts', 'sets', 'the', 'mean', 'and', 'the', 'massdependent', 'scatter', 'of', 'the', 'starforming', 'main', 'sequence', 'this', 'scatter', 'is', 'driven', 'by', 'a', 'population', 'of', 'lowmass', 'ms', '108', 'msun', 'quiescent', 'galaxies', 'the', 'mean', 'ssfr', 'and', 'the', 'burst', 'maximum', 'at', 'fixed', 'mass', 'increase', 'with', 'redshift', 'with', 'the', 'later', 'always', 'being', 'a', 'factor', '2', 'higher', 'than', 'the', 'former', 'this', 'implies', 'ssfr', 'maxima', 'of', '2060', 'gyr1', 'at', 'z910', 'the', 'sfr', 'histories', 'are', 'publicly', 'available', 'at', 'the', 'firstlight', 'website']] | [-0.07632961138403915, 0.17721202940483097, -0.040979541340393236, 0.13781725630574754, -0.04953230345154897, -0.025669866076927502, 0.07012540918116554, 0.44205204423131617, -0.10106008722368866, -0.3827923241557709, 0.030004156757291782, -0.28821843222994814, 0.04923172236599138, 0.20150147610128366, -0.022268243732729127, -0.06549819738356387, 0.060820027729358725, -0.061058267040334166, -0.06780378639240969, -0.38422265661228905, 0.2929355227216399, 0.10968467688733904, 0.18003456632198372, -0.05475084310548903, 0.10239585956129627, -0.15782862056156832, -0.09065736326523208, -0.11346174842847759, -0.2301866538560143, -0.009379102450478913, 0.24595890392370412, 0.16637576839157145, 0.2986641400333109, -0.3085249688043279, -0.18079070661565647, 0.07425246345512386, 0.21289828346789588, -0.003717760529066321, -0.09346419837316636, -0.21544470007214786, 0.09907260292388609, -0.21336904491281844, -0.12146783598097674, 0.19714352534969196, 0.0794579565772796, 0.04623117888795918, -0.18970329187388343, 0.26316283532149354, -0.02712693451023477, 0.10545192774513672, -0.08511897658108013, -0.05301772135715895, -0.09970567413500231, 0.06769931532977048, 0.03322612531219375, 0.1371498057398523, 0.21980907915967512, -0.13997392924020774, -0.009196328300595046, 0.39199162152563705, -0.08285750018748433, 0.08939971198166406, 0.21522295462389665, -0.27426751976915326, -0.17517021581246128, 0.17694176531315373, 0.14755611437294872, 0.1142896364828379, -0.1612428236199919, -0.06632576716445579, 0.056844213509500904, 0.2661243768602729, 0.06579338897047152, 0.05426885520821733, 0.3390226098341785, 0.15821258472668676, 0.04311889144500231, 0.022590173307457582, -0.17617872997251308, -0.012540323602430192, -0.22516419499506946, -0.07631795265909119, -0.11616824201555932, 0.15292743513856102, -0.2125007251452906, -0.06776424117267059, 0.3717744503390466, 0.0800095360567409, 0.253878458850361, 0.18348909379613904, 0.2528168795712916, 0.0849437971508791, 0.14186321847310537, 0.1355380310156277, 0.2552808609732606, 0.14837398557818215, 0.06342219917810168, -0.25032284879068306, 0.10152440043533303, -0.01923713560349175] |
1,801.10383 | Squeezing Enhances Quantum Synchronization | It is desirable to observe synchronization of quantum systems in the quantum
regime, defined by low number of excitations and a highly non-classical steady
state of the self-sustained oscillator. Several existing proposals of observing
synchronization in the quantum regime suffer from the fact that the noise
statistics overwhelms synchronization in this regime. Here we resolve this
issue by driving a self-sustained oscillator with a squeezing Hamiltonian
instead of a harmonic drive and analyze this system in the classical and
quantum regime. We demonstrate that strong entrainment is possible for small
values of squeezing, and in this regime the states are non-classical.
Furthermore, we show that the quality of synchronization measured by the FWHM
of the power spectrum is enhanced with squeezing.
| quant-ph cond-mat.mes-hall | it is desirable to observe synchronization of quantum systems in the quantum regime defined by low number of excitations and a highly nonclassical steady state of the selfsustained oscillator several existing proposals of observing synchronization in the quantum regime suffer from the fact that the noise statistics overwhelms synchronization in this regime here we resolve this issue by driving a selfsustained oscillator with a squeezing hamiltonian instead of a harmonic drive and analyze this system in the classical and quantum regime we demonstrate that strong entrainment is possible for small values of squeezing and in this regime the states are nonclassical furthermore we show that the quality of synchronization measured by the fwhm of the power spectrum is enhanced with squeezing | [['it', 'is', 'desirable', 'to', 'observe', 'synchronization', 'of', 'quantum', 'systems', 'in', 'the', 'quantum', 'regime', 'defined', 'by', 'low', 'number', 'of', 'excitations', 'and', 'a', 'highly', 'nonclassical', 'steady', 'state', 'of', 'the', 'selfsustained', 'oscillator', 'several', 'existing', 'proposals', 'of', 'observing', 'synchronization', 'in', 'the', 'quantum', 'regime', 'suffer', 'from', 'the', 'fact', 'that', 'the', 'noise', 'statistics', 'overwhelms', 'synchronization', 'in', 'this', 'regime', 'here', 'we', 'resolve', 'this', 'issue', 'by', 'driving', 'a', 'selfsustained', 'oscillator', 'with', 'a', 'squeezing', 'hamiltonian', 'instead', 'of', 'a', 'harmonic', 'drive', 'and', 'analyze', 'this', 'system', 'in', 'the', 'classical', 'and', 'quantum', 'regime', 'we', 'demonstrate', 'that', 'strong', 'entrainment', 'is', 'possible', 'for', 'small', 'values', 'of', 'squeezing', 'and', 'in', 'this', 'regime', 'the', 'states', 'are', 'nonclassical', 'furthermore', 'we', 'show', 'that', 'the', 'quality', 'of', 'synchronization', 'measured', 'by', 'the', 'fwhm', 'of', 'the', 'power', 'spectrum', 'is', 'enhanced', 'with', 'squeezing']] | [-0.187933541149332, 0.22396761270563217, -0.04572612004958801, 0.02433093766439398, 0.02935696589329457, -0.15912341329553895, 0.06182456971915854, 0.3431515330679653, -0.26686452947988, -0.26523308345108976, 0.05943355281367775, -0.23849204348877442, -0.17127100372887102, 0.23098594383605994, -0.06317999058072109, 0.07461620147894656, 0.0804430468793004, 0.022164267720654607, -0.008160451991379662, -0.16819059729868593, 0.3154431492598219, 0.04691048320151927, 0.3117338668454962, 0.016528572456156913, 0.11488924909783296, -0.06064096327355393, 0.08038130655022692, 0.014487106803312036, -0.09146078140949898, 0.07429368035965946, 0.2443726419294176, 0.07053636766831614, 0.30105831240850295, -0.38210608981057137, -0.23056224307183884, 0.10077080998400395, 0.13897660331346465, 0.19092271116770004, -0.01513641509265939, -0.2944248766168829, 0.041112046644538026, -0.19740855481768074, -0.11131312572666682, -0.1128895429063065, -0.0015211752923744277, 0.04897201493428635, -0.22924124110059058, 0.10639819023507255, 0.12161134998698926, 0.04289113908759819, 0.005123877486075498, 0.014602543417679931, 0.026020012726653212, 0.11232612016880192, -0.007100342863339408, -0.028958549977026203, 0.11885413901941959, -0.20085718907311959, -0.11274963319455543, 0.35995041462015515, -0.06710224132118978, -0.16004584463359403, 0.17905320826733162, -0.18956201578959947, -0.09553114936710143, 0.10898857871609285, 0.133350155996024, 0.06853697729712614, -0.09469688879321175, 0.0419734429478095, 0.00242932150833124, 0.2125094687250589, 0.07100100754875659, 0.13318457554887272, 0.18803556660605855, 0.1447984950130128, 0.07051212887071874, 0.19555213630934484, -0.10128262355030815, -0.13103201160686523, -0.2915156366503682, -0.10802308439608078, -0.22496302314256586, 0.08327323340710775, -0.0373159647983699, -0.14148881571744532, 0.42483281601636, 0.18312691478587856, 0.17684345098774235, 0.014247955767868841, 0.3035017671025058, 0.18606271482388342, 0.01452697442521241, 0.05777260542978063, 0.34128852345603555, 0.14494852584879075, 0.10942636640388365, -0.3147543003293878, 0.011783730040481392, -0.025905789145507105] |
1,801.10384 | Search for a strangeonium-like structure $Z_s$ decaying into $\phi \pi$
and a measurement of the cross section $e^+e^-\rightarrow\phi\pi\pi$ | Using a data sample of $e^+e^-$ collision data corresponding to an integrated
luminosity of 108 pb$^{-1}$ collected with the BESIII detector at a
center-of-mass energy of 2.125 GeV, we study the process $e^+e^-\rightarrow
\phi\pi\pi$ and search for a strangeoniumlike structure $Z_s$ decaying into
$\phi\pi$. No signal is observed in the $\phi\pi$ mass spectrum. Upper limits
on the cross sections for $Z_s$ production at the 90\% confidence level are
determined. In addition, the cross sections of
$e^+e^-\rightarrow\phi\pi^{+}\pi^{-}$ and $e^+e^-\rightarrow\phi\pi^{0}\pi^{0}$
at 2.125 GeV are measured to be $(436.2\pm6.4\pm30.1)$ pb and
$(237.0\pm8.6\pm15.4)$ pb, respectively, where the first uncertainties are
statistical and the second systematic.
| hep-ex | using a data sample of ee collision data corresponding to an integrated luminosity of 108 pb1 collected with the besiii detector at a centerofmass energy of 2125 gev we study the process eerightarrow phipipi and search for a strangeoniumlike structure z_s decaying into phipi no signal is observed in the phipi mass spectrum upper limits on the cross sections for z_s production at the 90 confidence level are determined in addition the cross sections of eerightarrowphipipi and eerightarrowphipi0pi0 at 2125 gev are measured to be 4362pm64pm301 pb and 2370pm86pm154 pb respectively where the first uncertainties are statistical and the second systematic | [['using', 'a', 'data', 'sample', 'of', 'ee', 'collision', 'data', 'corresponding', 'to', 'an', 'integrated', 'luminosity', 'of', '108', 'pb1', 'collected', 'with', 'the', 'besiii', 'detector', 'at', 'a', 'centerofmass', 'energy', 'of', '2125', 'gev', 'we', 'study', 'the', 'process', 'eerightarrow', 'phipipi', 'and', 'search', 'for', 'a', 'strangeoniumlike', 'structure', 'z_s', 'decaying', 'into', 'phipi', 'no', 'signal', 'is', 'observed', 'in', 'the', 'phipi', 'mass', 'spectrum', 'upper', 'limits', 'on', 'the', 'cross', 'sections', 'for', 'z_s', 'production', 'at', 'the', '90', 'confidence', 'level', 'are', 'determined', 'in', 'addition', 'the', 'cross', 'sections', 'of', 'eerightarrowphipipi', 'and', 'eerightarrowphipi0pi0', 'at', '2125', 'gev', 'are', 'measured', 'to', 'be', '4362pm64pm301', 'pb', 'and', '2370pm86pm154', 'pb', 'respectively', 'where', 'the', 'first', 'uncertainties', 'are', 'statistical', 'and', 'the', 'second', 'systematic']] | [-0.05963261047445391, 0.12074068343262644, -0.06478929565739386, 0.11956404170604466, 0.014533762685647331, -0.05198109364521104, 0.05649489773072533, 0.3456436527854542, -0.16296931855457344, -0.35926900802122563, 0.01811317195299744, -0.41594969335290577, 0.13404056982895762, 0.21410422781290314, 0.10847882284139543, 0.09811537836668725, 0.10188444080215293, 0.04955969378592197, -0.053396904106568735, -0.18883972820230596, 0.24170165736055405, 0.13358850641051287, 0.2495329073947115, 0.11230691067259951, 0.07362514018253952, -0.004136758604442182, -0.030887668498086062, -0.10130040821878566, -0.17731059170280075, 0.07405256869909882, 0.2761733389253123, 0.07415950523458958, 0.11146284349637163, -0.2964212411012322, -0.013403429954610382, 0.1577452963179688, 0.12186417514074248, -0.0024855364997362355, -0.010669060086245774, -0.36445630216951835, 0.14295641578657112, -0.17239735160291808, -0.047948705829372724, 0.05998813972049921, 0.051749195404273945, -0.06590389065953337, -0.3149168652262702, 0.11817798529242732, -0.07920118911460657, 0.08651249251807272, -0.05407853742830993, -0.2064678574259364, -0.1188554368557927, -0.03573875930448322, 0.012574166142004878, 0.056302737010482065, 0.18202324984019103, -0.08642529125911058, -0.1415166796098665, 0.3281135305800696, -0.05368852430052057, -0.09426344970580834, 0.12056948853771865, -0.21266523828806796, -0.14334108248429814, 0.23245882594324263, 0.3117222072767843, 0.028405422628041088, -0.2507944106197551, 0.10386059984094319, 0.04950590187818119, 0.18945327060076303, 0.09418532576834418, 0.037271055185293646, 0.16184857670102537, 0.23937075036774708, -0.023080334374585103, 0.04057465185238451, -0.21062537332871908, -0.01921163797954616, -0.42088279062786055, -0.11281249561759922, -0.06313521388111655, 0.06763323074081894, -0.03457045463842733, -0.02802524207275092, 0.32396259555381907, 0.074648044721077, 0.3667615930905047, 0.040122300331221564, 0.27643573476174443, 0.1898849972754179, 0.03448183709976369, 0.07741181373106527, 0.3358526957394152, 0.1288605027438439, 0.10140390612050584, -0.17676854011939944, -0.002653385363711217, -0.03667351613109259] |
1,801.10385 | Field theoretic renormalization study of reduced quantum electrodynamics
and applications to the ultra-relativistic limit of Dirac liquids | The field theoretic renormalization study of reduced quantum electrodynamics
(QED) is performed up to two loops. In the condensed matter context, reduced
QED constitutes a very natural effective relativistic field theory describing
(planar) Dirac liquids, e.g., graphene and graphene-like materials, the surface
states of some topological insulators and possibly half-filled fractional
quantum Hall systems. From the field theory point of view, the model involves
an effective (reduced) gauge field propagating with a fractional power of the
d'Alembertian in marked contrast with usual QEDs. The use of the BPHZ
prescription allows for a simple and clear understanding of the structure of
the model. In particular, in relation with the ultra-relativistic limit of
graphene, we straightforwardly recover the results for both the interaction
correction to the optical conductivity: $\mathcal{C}^*=(92-9\pi^2)/(18\pi)$ and
the anomalous dimension of the fermion field: $\gamma_{\psi}(\bar{\alpha},\xi)
= 2 \bar{\alpha}\,(1-3\xi)/3 -16\,\left( \zeta_2 N_F + 4/27 \right)\,
\bar{\alpha}^2 + O(\bar{\alpha}^3)$, where $\bar{\alpha} = e^2/(4\pi)^2$ and
$\xi$ is the gauge-fixing parameter.
| hep-th cond-mat.mes-hall | the field theoretic renormalization study of reduced quantum electrodynamics qed is performed up to two loops in the condensed matter context reduced qed constitutes a very natural effective relativistic field theory describing planar dirac liquids eg graphene and graphenelike materials the surface states of some topological insulators and possibly halffilled fractional quantum hall systems from the field theory point of view the model involves an effective reduced gauge field propagating with a fractional power of the dalembertian in marked contrast with usual qeds the use of the bphz prescription allows for a simple and clear understanding of the structure of the model in particular in relation with the ultrarelativistic limit of graphene we straightforwardly recover the results for both the interaction correction to the optical conductivity mathcalc929pi218pi and the anomalous dimension of the fermion field gamma_psibaralphaxi 2 baralpha13xi3 16left zeta_2 n_f 427 right baralpha2 obaralpha3 where baralpha e24pi2 and xi is the gaugefixing parameter | [['the', 'field', 'theoretic', 'renormalization', 'study', 'of', 'reduced', 'quantum', 'electrodynamics', 'qed', 'is', 'performed', 'up', 'to', 'two', 'loops', 'in', 'the', 'condensed', 'matter', 'context', 'reduced', 'qed', 'constitutes', 'a', 'very', 'natural', 'effective', 'relativistic', 'field', 'theory', 'describing', 'planar', 'dirac', 'liquids', 'eg', 'graphene', 'and', 'graphenelike', 'materials', 'the', 'surface', 'states', 'of', 'some', 'topological', 'insulators', 'and', 'possibly', 'halffilled', 'fractional', 'quantum', 'hall', 'systems', 'from', 'the', 'field', 'theory', 'point', 'of', 'view', 'the', 'model', 'involves', 'an', 'effective', 'reduced', 'gauge', 'field', 'propagating', 'with', 'a', 'fractional', 'power', 'of', 'the', 'dalembertian', 'in', 'marked', 'contrast', 'with', 'usual', 'qeds', 'the', 'use', 'of', 'the', 'bphz', 'prescription', 'allows', 'for', 'a', 'simple', 'and', 'clear', 'understanding', 'of', 'the', 'structure', 'of', 'the', 'model', 'in', 'particular', 'in', 'relation', 'with', 'the', 'ultrarelativistic', 'limit', 'of', 'graphene', 'we', 'straightforwardly', 'recover', 'the', 'results', 'for', 'both', 'the', 'interaction', 'correction', 'to', 'the', 'optical', 'conductivity', 'mathcalc929pi218pi', 'and', 'the', 'anomalous', 'dimension', 'of', 'the', 'fermion', 'field', 'gamma_psibaralphaxi', '2', 'baralpha13xi3', '16left', 'zeta_2', 'n_f', '427', 'right', 'baralpha2', 'obaralpha3', 'where', 'baralpha', 'e24pi2', 'and', 'xi', 'is', 'the', 'gaugefixing', 'parameter']] | [-0.15142170195372737, 0.2051253660850672, -0.07419092270868774, 0.049057453904034834, -0.04048909660631499, -0.16445843398026158, 0.017786983183591443, 0.29745518110793867, -0.2193452280383402, -0.2853316271544567, 0.008650661709078519, -0.28635451123983596, -0.15188987820162153, 0.15861931462790207, -0.006292613961284055, 0.0640042513374518, -0.04620535829683392, 0.028156959819195627, -0.09228199523981331, -0.19057647594200056, 0.32766562013975564, 0.008121711645452749, 0.26151448324145304, 0.066784188950428, 0.07539939064355124, 0.025778474482599976, 0.005256819617966203, 0.04590936386514278, -0.11205429630037271, 0.1055175275058758, 0.21215587464790017, -0.05965159183247712, 0.185730592367876, -0.4460146615446425, -0.2324709734169855, 0.02222919419445858, 0.1153897382527848, 0.1407148457895711, -0.03911891798203697, -0.27946394020501447, 0.015088223676406304, -0.17868822737324502, -0.16663432428312366, -0.056278498995364926, 0.001148006170006076, -0.09729581624174452, -0.23985211319190317, 0.07180564165183463, 0.02656721155837077, 0.06411250830104505, -0.04934843602395445, -0.09733555327822156, -0.02190212498982849, 0.08128226144780994, 0.05381686036905819, 0.07110050002740202, 0.13842519012526894, -0.246544895462413, -0.13593629181074598, 0.44801900754714397, -0.08080461645359491, -0.17024731680396057, 0.16714933202570292, -0.17241087759889306, -0.09750870197019888, 0.1281260054575938, 0.1074043668752701, 0.09934329696246708, -0.11721791189399922, 0.19624212696525858, -0.04649747456075484, 0.1405627275605252, 0.0393571727624049, 0.05531891332749201, 0.21440130055305504, 0.1343200916795022, 0.029257030333994197, 0.12370808608988364, -0.06661609143373512, -0.10657935871799686, -0.33448225492294753, -0.2013978854148034, -0.17082098085547284, 0.09448584771351208, -0.13424933781848547, -0.19980557591077827, 0.4068936268881369, 0.16684795248315853, 0.1368359394219457, -0.0033475353824430885, 0.24334342637238707, 0.18625830508591162, 0.04880696661345863, 0.03122804845448862, 0.23062688871987677, 0.22020985789875797, 0.09572013609149323, -0.26937360056362364, -0.08637255571503825, 0.09827773568226772] |
1,801.10386 | Haptics of Screwing and Unscrewing for its Application in Smart
Factories for Disassembly | Reconstruction of skilled humans sensation and control system often leads to
a development of robust control for the robots. We are developing an unscrewing
robot for the automated disassembly which requires a comprehensive control
system, but unscrewing experiments with robots are often limited to several
conditions. On the contrary, humans typically have a broad range of screwing
experiences and sensations throughout their lives, and we conducted an
experiment to find these haptic patterns. Results show that people apply axial
force to the screws to avoid screwdriver slippage (cam-outs), which is one of
the key problems during screwing and unscrewing, and this axial force is
proportional to the torque which is required for screwing. We have found that
type of the screw head influences the amount of axial force applied. Using this
knowledge an unscrewing robot for the smart disassembly factory RecyBot is
developed, and experiments confirm the optimality of the strategy, used by
humans. Finally, a methodology for robust unscrewing algorithm design is
presented as a generalization of the findings. It can seriously speed up the
development of the screwing and unscrewing robots and tools.
| cs.RO | reconstruction of skilled humans sensation and control system often leads to a development of robust control for the robots we are developing an unscrewing robot for the automated disassembly which requires a comprehensive control system but unscrewing experiments with robots are often limited to several conditions on the contrary humans typically have a broad range of screwing experiences and sensations throughout their lives and we conducted an experiment to find these haptic patterns results show that people apply axial force to the screws to avoid screwdriver slippage camouts which is one of the key problems during screwing and unscrewing and this axial force is proportional to the torque which is required for screwing we have found that type of the screw head influences the amount of axial force applied using this knowledge an unscrewing robot for the smart disassembly factory recybot is developed and experiments confirm the optimality of the strategy used by humans finally a methodology for robust unscrewing algorithm design is presented as a generalization of the findings it can seriously speed up the development of the screwing and unscrewing robots and tools | [['reconstruction', 'of', 'skilled', 'humans', 'sensation', 'and', 'control', 'system', 'often', 'leads', 'to', 'a', 'development', 'of', 'robust', 'control', 'for', 'the', 'robots', 'we', 'are', 'developing', 'an', 'unscrewing', 'robot', 'for', 'the', 'automated', 'disassembly', 'which', 'requires', 'a', 'comprehensive', 'control', 'system', 'but', 'unscrewing', 'experiments', 'with', 'robots', 'are', 'often', 'limited', 'to', 'several', 'conditions', 'on', 'the', 'contrary', 'humans', 'typically', 'have', 'a', 'broad', 'range', 'of', 'screwing', 'experiences', 'and', 'sensations', 'throughout', 'their', 'lives', 'and', 'we', 'conducted', 'an', 'experiment', 'to', 'find', 'these', 'haptic', 'patterns', 'results', 'show', 'that', 'people', 'apply', 'axial', 'force', 'to', 'the', 'screws', 'to', 'avoid', 'screwdriver', 'slippage', 'camouts', 'which', 'is', 'one', 'of', 'the', 'key', 'problems', 'during', 'screwing', 'and', 'unscrewing', 'and', 'this', 'axial', 'force', 'is', 'proportional', 'to', 'the', 'torque', 'which', 'is', 'required', 'for', 'screwing', 'we', 'have', 'found', 'that', 'type', 'of', 'the', 'screw', 'head', 'influences', 'the', 'amount', 'of', 'axial', 'force', 'applied', 'using', 'this', 'knowledge', 'an', 'unscrewing', 'robot', 'for', 'the', 'smart', 'disassembly', 'factory', 'recybot', 'is', 'developed', 'and', 'experiments', 'confirm', 'the', 'optimality', 'of', 'the', 'strategy', 'used', 'by', 'humans', 'finally', 'a', 'methodology', 'for', 'robust', 'unscrewing', 'algorithm', 'design', 'is', 'presented', 'as', 'a', 'generalization', 'of', 'the', 'findings', 'it', 'can', 'seriously', 'speed', 'up', 'the', 'development', 'of', 'the', 'screwing', 'and', 'unscrewing', 'robots', 'and', 'tools']] | [-0.09818693289244138, 0.10482772270044514, -0.08341883288716877, 0.004133155850238156, -0.12811084550544416, -0.13839050056156957, 0.03542952761263523, 0.4093679992052225, -0.21973933978006244, -0.34281330234575813, 0.12505424294843348, -0.22568501726785614, -0.18397655165600743, 0.23503832862415647, -0.12539293453389022, 0.06592558154191536, 0.07800419054986847, 0.03233273215540736, 0.025926154205360666, -0.22701383839044106, 0.2494030245618158, 0.052874500407827096, 0.29533065438966505, 0.07009195979009127, 0.1286555649559167, -0.005191079737454816, -0.0024020568247638888, 0.0025678930271949086, -0.09911241184110603, 0.12447561025696265, 0.25956167823988124, 0.13756293039717762, 0.31415646854829005, -0.45598702340458447, -0.15698375628594627, 0.07643835725272996, 0.1407229001633823, 0.11305980423560039, -0.06328395542568414, -0.31404257647611283, 0.09184327639657287, -0.17396469399394407, -0.13409968756732868, -0.10651366245308584, 0.014335292255874354, 0.022862854416566585, -0.2888391262667438, 0.0038704121930545174, 0.03717302530812058, 0.08908691491644156, -0.08768573172958466, -0.05623451905110134, 0.021919089530666288, 0.19374744223742899, 0.05464998231676233, 0.030252882696503957, 0.19975813194229217, -0.15849516091735236, -0.13008812786294863, 0.38724006489328633, 0.04584572867043879, -0.1846909981302835, 0.20836878302353587, -0.06695730572023971, -0.08226971066388004, 0.11433820961206988, 0.20556105617760004, 0.11155327256982583, -0.1598488968044806, -0.023846174070898157, 0.0060460570544659436, 0.1706520816372646, 0.027605764840340632, -0.06696982266749818, 0.1771360216150572, 0.2043056204700126, 0.07928159543835037, 0.09175315553867412, -0.07524159892364968, -0.07852475413064994, -0.2488564106298017, -0.15795957694689816, -0.12119607509409364, -0.015454711310647346, -0.030735124503185583, -0.1158198244290191, 0.3394445980806927, 0.20058575714938343, 0.14655723772171608, 0.04923236201540311, 0.329656794211817, 0.04391856114878984, 0.11881503838262839, 0.0457752578313575, 0.2550681384771571, 0.05067287575438168, 0.15828340964463467, -0.24120788454592412, 0.09681107036022285, -0.016392626502847934] |
1,801.10387 | On the computability of graphons | We investigate the relative computability of exchangeable binary relational
data when presented in terms of the distribution of an invariant measure on
graphs, or as a graphon in either $L^1$ or the cut distance. We establish basic
computable equivalences, and show that $L^1$ representations contain
fundamentally more computable information than the other representations, but
that $0'$ suffices to move between computable such representations. We show
that $0'$ is necessary in general, but that in the case of random-free
graphons, no oracle is necessary. We also provide an example of an
$L^1$-computable random-free graphon that is not weakly isomorphic to any
graphon with an a.e. continuous version.
| math.LO cs.LO math.CO math.PR | we investigate the relative computability of exchangeable binary relational data when presented in terms of the distribution of an invariant measure on graphs or as a graphon in either l1 or the cut distance we establish basic computable equivalences and show that l1 representations contain fundamentally more computable information than the other representations but that 0 suffices to move between computable such representations we show that 0 is necessary in general but that in the case of randomfree graphons no oracle is necessary we also provide an example of an l1computable randomfree graphon that is not weakly isomorphic to any graphon with an ae continuous version | [['we', 'investigate', 'the', 'relative', 'computability', 'of', 'exchangeable', 'binary', 'relational', 'data', 'when', 'presented', 'in', 'terms', 'of', 'the', 'distribution', 'of', 'an', 'invariant', 'measure', 'on', 'graphs', 'or', 'as', 'a', 'graphon', 'in', 'either', 'l1', 'or', 'the', 'cut', 'distance', 'we', 'establish', 'basic', 'computable', 'equivalences', 'and', 'show', 'that', 'l1', 'representations', 'contain', 'fundamentally', 'more', 'computable', 'information', 'than', 'the', 'other', 'representations', 'but', 'that', '0', 'suffices', 'to', 'move', 'between', 'computable', 'such', 'representations', 'we', 'show', 'that', '0', 'is', 'necessary', 'in', 'general', 'but', 'that', 'in', 'the', 'case', 'of', 'randomfree', 'graphons', 'no', 'oracle', 'is', 'necessary', 'we', 'also', 'provide', 'an', 'example', 'of', 'an', 'l1computable', 'randomfree', 'graphon', 'that', 'is', 'not', 'weakly', 'isomorphic', 'to', 'any', 'graphon', 'with', 'an', 'ae', 'continuous', 'version']] | [-0.08514708903108147, 0.09494658576912202, -0.11120680405181788, 0.14594191391453412, -0.08629875769395204, -0.14296139723044776, 0.014295154142503937, 0.4261994681542828, -0.3484255423680657, -0.20603996607519331, 0.11378653203358963, -0.27216449676170235, -0.14483932731673121, 0.15757050336382927, -0.14068158033436962, -0.000671644282660314, 0.07195553456300072, 0.1368085988023917, -0.06634972797806508, -0.2535563500509376, 0.34127831858627145, -0.026142662175975384, 0.19833270384974422, 0.038792456979198114, 0.09156786510499106, 0.015563096010702706, 0.0060581820529131665, 0.027416737164769854, -0.1557651441229003, 0.10412191252357193, 0.27458706476858685, 0.2081394956890671, 0.2651413001419444, -0.38569108029561383, -0.1307565709664708, 0.21603976622046459, 0.13267751926822322, 0.04179695627424822, -0.03902435740081793, -0.2633977839667794, 0.11835240025760695, -0.1482031790450925, -0.0628597223199904, -0.11982524814527659, 0.04589956079920133, 0.01811853028124287, -0.2993082687923951, 0.04155533694900528, 0.17825535091251368, 0.06779670387151696, -0.043742443745334945, -0.08343683753489695, -0.02744500552348438, 0.10771808000420043, 0.007522576783473293, 0.06881884084460103, 0.05549480653412285, -0.11762792236127315, -0.13699942325641, 0.35658375340558235, -0.07809524435974059, -0.2463742815312885, 0.22014851368786323, -0.1427270107813889, -0.20143351071026352, 0.07183560018560715, 0.11309846480421368, 0.1427874784517501, -0.12792630055323354, 0.10462077362850929, -0.10773358106324893, 0.20757910376082042, 0.05947276657624614, 0.06834319067087823, 0.09978183050684276, 0.085493178885164, 0.16633229017080295, 0.15500194402910503, 0.0014352245455873864, -0.06549860350344153, -0.332117278040165, -0.17005156671983146, -0.209376247360238, 0.060443143061101656, -0.12855968307246388, -0.22879498054583866, 0.30379901751875876, 0.1753374079774533, 0.1998533400706947, 0.15686222721068632, 0.2233098084727923, 0.11075066313302766, 0.019250958476082554, 0.14160604595339724, 0.16968335224581615, 0.12501129080497084, -0.03429803011406745, -0.09406089588911051, 0.10555503824725747, 0.09489933170067767] |
1,801.10388 | The Morse index of a triply periodic minimal surface | In the previous work, the first author established an algorithm to compute
the Morse index and the nullity of an $n$-periodic minimal surface in
$\mathbb{R}^n$. In fact, the Morse index can be translated into the number of
negative eigenvalues of a real symmetric matrix and the nullity can be
translated into the number of zero-eigenvalue of a Hermitian matrix. The two
key matrices consist of periods of the abelian differentials of the second kind
on a minimal surface, and the signature of the Hermitian matrix gives a new
invariant of a minimal surface. On the other hand, H family, rPD family, tP
family, tD family, and tCLP family of triply periodic minimal surfaces in
$\mathbb{R}^3$ have been studied in physics, chemistry, and crystallography. In
this paper, we first determine the two key matrices for the five families
explicitly. As its applications, by numerical arguments, we compute the Morse
indices, nullities, and signatures for the five families.
| math.DG | in the previous work the first author established an algorithm to compute the morse index and the nullity of an nperiodic minimal surface in mathbbrn in fact the morse index can be translated into the number of negative eigenvalues of a real symmetric matrix and the nullity can be translated into the number of zeroeigenvalue of a hermitian matrix the two key matrices consist of periods of the abelian differentials of the second kind on a minimal surface and the signature of the hermitian matrix gives a new invariant of a minimal surface on the other hand h family rpd family tp family td family and tclp family of triply periodic minimal surfaces in mathbbr3 have been studied in physics chemistry and crystallography in this paper we first determine the two key matrices for the five families explicitly as its applications by numerical arguments we compute the morse indices nullities and signatures for the five families | [['in', 'the', 'previous', 'work', 'the', 'first', 'author', 'established', 'an', 'algorithm', 'to', 'compute', 'the', 'morse', 'index', 'and', 'the', 'nullity', 'of', 'an', 'nperiodic', 'minimal', 'surface', 'in', 'mathbbrn', 'in', 'fact', 'the', 'morse', 'index', 'can', 'be', 'translated', 'into', 'the', 'number', 'of', 'negative', 'eigenvalues', 'of', 'a', 'real', 'symmetric', 'matrix', 'and', 'the', 'nullity', 'can', 'be', 'translated', 'into', 'the', 'number', 'of', 'zeroeigenvalue', 'of', 'a', 'hermitian', 'matrix', 'the', 'two', 'key', 'matrices', 'consist', 'of', 'periods', 'of', 'the', 'abelian', 'differentials', 'of', 'the', 'second', 'kind', 'on', 'a', 'minimal', 'surface', 'and', 'the', 'signature', 'of', 'the', 'hermitian', 'matrix', 'gives', 'a', 'new', 'invariant', 'of', 'a', 'minimal', 'surface', 'on', 'the', 'other', 'hand', 'h', 'family', 'rpd', 'family', 'tp', 'family', 'td', 'family', 'and', 'tclp', 'family', 'of', 'triply', 'periodic', 'minimal', 'surfaces', 'in', 'mathbbr3', 'have', 'been', 'studied', 'in', 'physics', 'chemistry', 'and', 'crystallography', 'in', 'this', 'paper', 'we', 'first', 'determine', 'the', 'two', 'key', 'matrices', 'for', 'the', 'five', 'families', 'explicitly', 'as', 'its', 'applications', 'by', 'numerical', 'arguments', 'we', 'compute', 'the', 'morse', 'indices', 'nullities', 'and', 'signatures', 'for', 'the', 'five', 'families']] | [-0.14118440497306087, 0.11512925633428348, -0.06129704948755041, 0.06273364232056924, -0.046942838665939145, -0.11504410280275248, -0.007229711449584893, 0.30932108592242, -0.27043589037813004, -0.28772886536354497, 0.11489349152562359, -0.27484522960693275, -0.18228496820257503, 0.20702157155291417, -0.08104041566651675, 0.07037732167762795, 0.0067697102113837195, 0.0828775992977523, -0.09446509854958182, -0.24392926260348288, 0.37728950242481885, -0.03617051445668743, 0.21373076474053726, 0.06818334784794358, 0.04007567935773442, -0.02001751269469218, -0.034583936343269964, -0.0198528332643271, -0.15133256898205277, 0.17425791785015815, 0.21618105963233017, 0.09071440984374814, 0.20259984373265216, -0.38432744430197824, -0.20028361670612807, 0.19216244205111457, 0.10622802798245704, 0.047443190464870104, -0.05687122495334235, -0.23181130118187396, 0.07603111357743582, -0.15611614953471167, -0.1687818524247456, -0.054238335765717974, 0.034303617807886294, -0.01113358281793133, -0.2227953034903734, 0.0002056304534386483, 0.07850816221175445, 0.08745832743663942, -0.03406737337317017, -0.1561926072823905, -0.06314676355029787, 0.10909279251711503, 0.021800220639054332, -0.02535059730852804, 0.042732469015566994, -0.03267690668393287, -0.12851307581727123, 0.36203083390512714, -0.0972001971376519, -0.2391042516882261, 0.13155300229066802, -0.12646944690796155, -0.16842342132041532, 0.14174914082226855, 0.17783213118992505, 0.14576680316559731, -0.09936810704248566, 0.1417325504792614, -0.09703448206907318, 0.12395239642656018, 0.10838697689074663, -0.006360236663491495, 0.1657800095876859, 0.06278954155352567, 0.07690446141416267, 0.14870354900204186, -0.03649742870831922, -0.08721372927088411, -0.31439759507775306, -0.22826192461014275, -0.20497509577281534, 0.05904506071200294, -0.11559099969397779, -0.2128076523181892, 0.47946069865457475, 0.023050072485761297, 0.21170167547440336, 0.05338555741904964, 0.20270308038790621, 0.08148166563647288, 0.03406471447388251, 0.050632483055514675, 0.16336834968308048, 0.1794731348272293, 0.006794854203960107, -0.17093519714619634, 0.014598983306167346, 0.1676131135844175] |
1,801.10389 | Generalized reverse Young and Heinz inequalities | In this paper, we study the further improvements of the reverse Young and
Heinz inequalities for the wider range of $v$, namely $v\in \mathbb{R}$. These
modified inequalities are used to establish corresponding operator inequalities
on a Hilbert space.
| math.CA | in this paper we study the further improvements of the reverse young and heinz inequalities for the wider range of v namely vin mathbbr these modified inequalities are used to establish corresponding operator inequalities on a hilbert space | [['in', 'this', 'paper', 'we', 'study', 'the', 'further', 'improvements', 'of', 'the', 'reverse', 'young', 'and', 'heinz', 'inequalities', 'for', 'the', 'wider', 'range', 'of', 'v', 'namely', 'vin', 'mathbbr', 'these', 'modified', 'inequalities', 'are', 'used', 'to', 'establish', 'corresponding', 'operator', 'inequalities', 'on', 'a', 'hilbert', 'space']] | [-0.04905516370567248, 0.0584858481521032, -0.015638744715895308, 0.11172042432621024, -0.09200187065442533, -0.13693542507673173, 0.02668084898093519, 0.3515926552936435, -0.3169276086417468, -0.2309980218935954, 0.11666653883386109, -0.2734648067210066, -0.12224583602265308, 0.2705367389380148, -0.1087835004161063, 0.06487234453915765, 0.06822353119863883, 0.0013274306823548518, -0.17554079513310603, -0.2621562359609494, 0.3738300304271673, -0.07209992232291322, 0.1705908111394628, 0.09858197968845304, 0.0595392357607029, 0.005268345170311238, -0.03325069365612427, 0.0013915767677214095, -0.2788938967952211, 0.2142818628405956, 0.22593440635031775, 0.15818676939479223, 0.35121600437713296, -0.37149879277536746, -0.18824508634248846, 0.2219532873285444, 0.13394433582250617, -0.0412929021312218, -0.02379993463584565, -0.3519118958839068, 0.048493362546555306, -0.14592179371730277, -0.15431548506756754, -0.050910989851935914, 0.05188452726916263, 0.07869594367098455, -0.33137247084002747, 0.09029370301256054, 0.09034375258182224, 0.04315732826638084, -0.06416975663925864, -0.12672787154779622, 0.03872133927468799, 0.05448110805407755, -0.03831688979469044, 0.07294120821538136, 0.04472536038558342, -0.04240929998923093, -0.13216065654629156, 0.3145922094975647, -0.05542976176213032, -0.21644496496178603, 0.13619015713859545, -0.18075246202122225, -0.16753672062125252, -0.028550915303640068, 0.1943407348161073, 0.15328576812814726, -0.13593613621043532, 0.1503829340631216, -0.09516781818513807, 0.015102168814720292, 0.08785919662515976, 0.08832159275679212, 0.0316064632252643, 0.03326309310566438, 0.13956085729755854, 0.18287081732169577, -0.053117366820132655, -0.054294555735970404, -0.38626344619612946, -0.2309163939943047, -0.14204876225956373, 0.061372948308034164, -0.15592791996612887, -0.1091513600519025, 0.37600949013262597, 0.12378137769471657, 0.1361196060223799, 0.08007644629105926, 0.11094563630850691, 0.15152232888105668, 0.0744334488960081, 0.03632908630625982, 0.19674258218391946, 0.19092466223886922, 0.13935875063026815, -0.149462659340842, 0.020052991856477763, 0.1368488266230806] |
1,801.1039 | Charging in a Superconducting Vortex Due to the Three Force Terms in
Augmented Eilenberger Equations | We derive augmented Eilenberger equations that incorporate the following
missing force terms: (i) the Lorentz force, (ii) the pair-potential gradient
(PPG) force, and (iii) the pressure difference arising from the slope in the
density of states (DOS). Recently, augmented Eilenberger equations with the
Lorentz and PPG forces have been derived microscopically by studying the Hall
and charging effects in superconductors, but the pressure due to the slope in
the DOS has not yet been considered in augmented Eilenberger equations, despite
phenomenological indications that it is a charging mechanism in a vortex of
type-II superconductors. This newly added pressure is called "the SDOS
pressure". We calculate the charging in an isolated vortex of an s-wave
superconductor with a spherical Fermi surface using the augmented Eilenberger
equations incorporating the Lorentz force, PPG force, and SDOS pressure. When
we compare the charge densities due to the three force terms in the augmented
Eilenberger equations, the vortex-core charging due to the SDOS pressure is
larger than that due to the other forces near the superconducting transition
temperature. Thus, when we calculate the charging in an isolated vortex of a
superconductor with a finite slope in the DOS, we should consider not only the
Lorentz and PPG forces but also the SDOS pressure.
| cond-mat.supr-con | we derive augmented eilenberger equations that incorporate the following missing force terms i the lorentz force ii the pairpotential gradient ppg force and iii the pressure difference arising from the slope in the density of states dos recently augmented eilenberger equations with the lorentz and ppg forces have been derived microscopically by studying the hall and charging effects in superconductors but the pressure due to the slope in the dos has not yet been considered in augmented eilenberger equations despite phenomenological indications that it is a charging mechanism in a vortex of typeii superconductors this newly added pressure is called the sdos pressure we calculate the charging in an isolated vortex of an swave superconductor with a spherical fermi surface using the augmented eilenberger equations incorporating the lorentz force ppg force and sdos pressure when we compare the charge densities due to the three force terms in the augmented eilenberger equations the vortexcore charging due to the sdos pressure is larger than that due to the other forces near the superconducting transition temperature thus when we calculate the charging in an isolated vortex of a superconductor with a finite slope in the dos we should consider not only the lorentz and ppg forces but also the sdos pressure | [['we', 'derive', 'augmented', 'eilenberger', 'equations', 'that', 'incorporate', 'the', 'following', 'missing', 'force', 'terms', 'i', 'the', 'lorentz', 'force', 'ii', 'the', 'pairpotential', 'gradient', 'ppg', 'force', 'and', 'iii', 'the', 'pressure', 'difference', 'arising', 'from', 'the', 'slope', 'in', 'the', 'density', 'of', 'states', 'dos', 'recently', 'augmented', 'eilenberger', 'equations', 'with', 'the', 'lorentz', 'and', 'ppg', 'forces', 'have', 'been', 'derived', 'microscopically', 'by', 'studying', 'the', 'hall', 'and', 'charging', 'effects', 'in', 'superconductors', 'but', 'the', 'pressure', 'due', 'to', 'the', 'slope', 'in', 'the', 'dos', 'has', 'not', 'yet', 'been', 'considered', 'in', 'augmented', 'eilenberger', 'equations', 'despite', 'phenomenological', 'indications', 'that', 'it', 'is', 'a', 'charging', 'mechanism', 'in', 'a', 'vortex', 'of', 'typeii', 'superconductors', 'this', 'newly', 'added', 'pressure', 'is', 'called', 'the', 'sdos', 'pressure', 'we', 'calculate', 'the', 'charging', 'in', 'an', 'isolated', 'vortex', 'of', 'an', 'swave', 'superconductor', 'with', 'a', 'spherical', 'fermi', 'surface', 'using', 'the', 'augmented', 'eilenberger', 'equations', 'incorporating', 'the', 'lorentz', 'force', 'ppg', 'force', 'and', 'sdos', 'pressure', 'when', 'we', 'compare', 'the', 'charge', 'densities', 'due', 'to', 'the', 'three', 'force', 'terms', 'in', 'the', 'augmented', 'eilenberger', 'equations', 'the', 'vortexcore', 'charging', 'due', 'to', 'the', 'sdos', 'pressure', 'is', 'larger', 'than', 'that', 'due', 'to', 'the', 'other', 'forces', 'near', 'the', 'superconducting', 'transition', 'temperature', 'thus', 'when', 'we', 'calculate', 'the', 'charging', 'in', 'an', 'isolated', 'vortex', 'of', 'a', 'superconductor', 'with', 'a', 'finite', 'slope', 'in', 'the', 'dos', 'we', 'should', 'consider', 'not', 'only', 'the', 'lorentz', 'and', 'ppg', 'forces', 'but', 'also', 'the', 'sdos', 'pressure']] | [-0.17551713172668734, 0.162624410106988, -0.11793117339346701, 0.05628323886216654, -0.07100417071398205, -0.12843184060049959, 0.049930945988028094, 0.3138535237387539, -0.2542628451024379, -0.29419818648602813, 0.004935794863111089, -0.30199125799565363, -0.11233915327913845, 0.13375756218514512, -0.018546749844692664, 0.011020949486499796, -0.07157961007928512, 0.022283169918899566, -0.1044201934094487, -0.18675072407999183, 0.357557290350087, 0.022707364665201075, 0.3076915358833503, 0.09061917627919823, 0.06643033523981173, -0.02544251226936467, 0.05112786635828133, 0.10276747231658262, -0.132918061520041, 0.0381223185638821, 0.19072483721090697, -0.07406434213044122, 0.2324138329995199, -0.5022361891594931, -0.22862993319106933, 0.046729769318727236, 0.09223586797732143, 0.14707876044961338, -0.06971177144665629, -0.30425534808175425, 0.03222496855820422, -0.20088991638644635, -0.16892907058354467, -0.07551770913414657, 0.030544077997686915, 0.02589420412102929, -0.22239369512960996, 0.11081605522136109, 0.0024587237074648817, 0.052192962297480196, -0.16434585102027854, -0.10633065222981923, -0.05479315999008787, 0.026931166566310612, 0.07656831260548923, 0.0460197835681566, 0.16517282381223944, -0.1558181701369064, -0.029026719083328947, 0.38891699198687163, -0.042442797771960056, -0.15547452577336046, 0.16464344647493606, -0.12469807560913838, -0.05022825456958694, 0.17584396986057982, 0.12113524123448699, 0.06594746787763703, -0.18769553365130448, 0.08549954908840636, -0.012886471342846142, 0.13365482189244807, 0.049629019463631824, -0.015358171537697602, 0.18763255620545422, 0.12364459818658921, 0.05073049550880499, 0.0842027475102021, -0.17755990186616635, -0.05700929118477059, -0.29112127046279895, -0.1401717302189634, -0.19832993639059937, 0.03261840345560184, -0.01552854606451057, -0.17610005857512498, 0.32751305173867595, 0.16859870754986053, 0.16120393373267478, -0.020602218363469895, 0.3104050537781754, 0.17741786983634272, 0.1287042960690227, 0.11144422028043593, 0.29177839627887947, 0.15605485416353287, 0.12207594828914108, -0.33353085758370493, 0.06277393498189318, 0.07272685961484407] |
1,801.10391 | Internet of things forensics: Challenges and Case Study | Today is the era of Internet of Things (IoT), millions of machines such as
cars, smoke detectors, watches, glasses, webcams, etc. are being connected to
the Internet. The number of machines that possess the ability of remote access
to monitor and collect data is continuously increasing. This development makes,
on one hand, the human life more comfort- able, convenient, but it also raises
on other hand issues on security and privacy. However, this development also
raises challenges for the digital investigator when IoT devices involve in
criminal scenes. Indeed, current research in the literature focuses on security
and privacy for IoT environments rather than methods or techniques of forensic
acquisition and analysis for IoT devices. Therefore, in this paper, we discuss
firstly different aspects related to IoT forensics and then focus on the cur-
rent challenges. We also describe forensic approaches for a IoT device
smartwatch as a case study. We analyze forensic artifacts retrieved from
smartwatch devices and discuss on evidence found aligned with challenges in IoT
forensics
| cs.CR | today is the era of internet of things iot millions of machines such as cars smoke detectors watches glasses webcams etc are being connected to the internet the number of machines that possess the ability of remote access to monitor and collect data is continuously increasing this development makes on one hand the human life more comfort able convenient but it also raises on other hand issues on security and privacy however this development also raises challenges for the digital investigator when iot devices involve in criminal scenes indeed current research in the literature focuses on security and privacy for iot environments rather than methods or techniques of forensic acquisition and analysis for iot devices therefore in this paper we discuss firstly different aspects related to iot forensics and then focus on the cur rent challenges we also describe forensic approaches for a iot device smartwatch as a case study we analyze forensic artifacts retrieved from smartwatch devices and discuss on evidence found aligned with challenges in iot forensics | [['today', 'is', 'the', 'era', 'of', 'internet', 'of', 'things', 'iot', 'millions', 'of', 'machines', 'such', 'as', 'cars', 'smoke', 'detectors', 'watches', 'glasses', 'webcams', 'etc', 'are', 'being', 'connected', 'to', 'the', 'internet', 'the', 'number', 'of', 'machines', 'that', 'possess', 'the', 'ability', 'of', 'remote', 'access', 'to', 'monitor', 'and', 'collect', 'data', 'is', 'continuously', 'increasing', 'this', 'development', 'makes', 'on', 'one', 'hand', 'the', 'human', 'life', 'more', 'comfort', 'able', 'convenient', 'but', 'it', 'also', 'raises', 'on', 'other', 'hand', 'issues', 'on', 'security', 'and', 'privacy', 'however', 'this', 'development', 'also', 'raises', 'challenges', 'for', 'the', 'digital', 'investigator', 'when', 'iot', 'devices', 'involve', 'in', 'criminal', 'scenes', 'indeed', 'current', 'research', 'in', 'the', 'literature', 'focuses', 'on', 'security', 'and', 'privacy', 'for', 'iot', 'environments', 'rather', 'than', 'methods', 'or', 'techniques', 'of', 'forensic', 'acquisition', 'and', 'analysis', 'for', 'iot', 'devices', 'therefore', 'in', 'this', 'paper', 'we', 'discuss', 'firstly', 'different', 'aspects', 'related', 'to', 'iot', 'forensics', 'and', 'then', 'focus', 'on', 'the', 'cur', 'rent', 'challenges', 'we', 'also', 'describe', 'forensic', 'approaches', 'for', 'a', 'iot', 'device', 'smartwatch', 'as', 'a', 'case', 'study', 'we', 'analyze', 'forensic', 'artifacts', 'retrieved', 'from', 'smartwatch', 'devices', 'and', 'discuss', 'on', 'evidence', 'found', 'aligned', 'with', 'challenges', 'in', 'iot', 'forensics']] | [-0.13931054730015152, 0.031513152577908786, -0.013168238075835817, 0.06139988575293269, -0.1524707409498122, -0.19194674788362528, 0.05038801118381564, 0.36797899217207053, -0.24306430281883867, -0.314878811946789, 0.18303233400481814, -0.3556020429644447, -0.17945297437698646, 0.2886981483777577, -0.18885005111723432, 0.0521764957804795, 0.06272395006615183, 0.028721271294924106, 0.015227611089874742, -0.2753587929289457, 0.32431531591429075, -0.003966090674429427, 0.3947130624954341, 0.09088603794828233, 0.02217718883598025, -0.012126594659260656, -0.06756415116130898, -0.0535932214842481, -0.07362991913529864, 0.1533965543580666, 0.373638247112198, 0.2558521929378869, 0.3627640061003305, -0.49935369660868445, -0.17803732229991864, 0.07919176472846925, 0.20167828815542824, 0.046248888968870305, -0.09960135122385363, -0.33376878968814727, 0.11429019875758321, -0.224362910631493, -0.11137990801040284, -0.08027140477523428, 0.033873877905863034, 0.03897131232823074, -0.16955087976475086, -0.036833474720303336, -0.029614168853008535, 0.11189762428513117, -0.037229070327566394, -0.07799971821723428, 0.03360976122826691, 0.18366125349272952, 0.09250658870186965, -0.047588775098356885, 0.23491876881801077, -0.21201649278033105, -0.1226985410624597, 0.3892885143152223, 0.0784628137586378, -0.13743211092639537, 0.20601497490383333, -0.04483125754390959, -0.20411726259543786, 0.010205069852003706, 0.22742005136172624, 0.06057721171142346, -0.18093877826232158, 0.030999971761026545, 0.049170492856195694, 0.17231048832402274, 0.043517278692652005, 0.09253145433471885, 0.20564134896680514, 0.23534170697862006, 0.1224686244183038, 0.09437870490468057, -0.05981666162422687, -0.07017288616577373, -0.17655408505650688, -0.19508587930505797, -0.15832361681579707, 0.028789448673759734, -0.015916737794122497, -0.14198969928382416, 0.3475985382104943, 0.29646733344791554, 0.11460691269421013, -0.00390783281440257, 0.45099567632416826, -0.029508887372701565, 0.12900111643520332, 0.07918382631118834, 0.13698534399185594, -0.018266329287617473, 0.26537754205083086, -0.10948460251172128, 0.11957671419309573, -0.061123995492014395] |
1,801.10392 | On the probability that a stationary Gaussian process with spectral gap
remains non-negative on a long interval | Let $f$ be a zero-mean continuous stationary Gaussian process on ${\mathbb
R}$ whose spectral measure vanishes in a $\delta$-neighborhood of the origin.
Then the probability that $f$ stays non-negative on an interval of length $L$
is at most $e^{-c\delta^2 L^2}$ with some absolute $c>0$ and the result is
sharp without additional assumptions.
| math.PR math-ph math.CA math.MP | let f be a zeromean continuous stationary gaussian process on mathbb r whose spectral measure vanishes in a deltaneighborhood of the origin then the probability that f stays nonnegative on an interval of length l is at most ecdelta2 l2 with some absolute c0 and the result is sharp without additional assumptions | [['let', 'f', 'be', 'a', 'zeromean', 'continuous', 'stationary', 'gaussian', 'process', 'on', 'mathbb', 'r', 'whose', 'spectral', 'measure', 'vanishes', 'in', 'a', 'deltaneighborhood', 'of', 'the', 'origin', 'then', 'the', 'probability', 'that', 'f', 'stays', 'nonnegative', 'on', 'an', 'interval', 'of', 'length', 'l', 'is', 'at', 'most', 'ecdelta2', 'l2', 'with', 'some', 'absolute', 'c0', 'and', 'the', 'result', 'is', 'sharp', 'without', 'additional', 'assumptions']] | [-0.17916547357762122, 0.12722356363876458, -0.07991463770432507, -0.005494518587689598, -0.03306139972718323, -0.19374873881757843, 0.029209908803322297, 0.38861050018492865, -0.29695269493979637, -0.1507108235256929, 0.13474459607181521, -0.29708434303528536, -0.047511354015738354, 0.17333721583161285, -0.08868405675771189, 0.03580640839166282, -0.00042975262063098886, 0.175895308418309, -0.07964752139934503, -0.21243629967063374, 0.3202157904412232, -0.011897373725386226, 0.17501813582345552, 0.04199384638637889, 0.08729609441669549, -0.014372586080914034, -0.010458517169086811, -0.055900337927810406, -0.1928301124758482, 0.029196997342046862, 0.18118744372737175, 0.09144172596507798, 0.3458934894525537, -0.32089626509696245, -0.20616088502163835, 0.24665825130125762, 0.118251382665453, -0.07354462972166491, 0.03653970188643856, -0.25806389255997014, 0.15399493292594948, -0.024689791176249, -0.19251570337470256, 0.009948961418487277, 0.12452248359719913, 0.04503387231014523, -0.36483914416064234, 0.060581841560847616, 0.16418763219068447, 0.07094943721541296, -0.0434684182435055, -0.1494998810310647, -0.061542715484678163, 0.03830879326800213, 0.03374688448692562, 0.1681934259946038, 0.10881940918225869, -0.029791022605244435, -0.038071179735090804, 0.3000733535554187, -0.18134472977516114, -0.2627072764158833, 0.12416293090391978, -0.19820871781192573, -0.10819812451361441, 0.16028098466203494, 0.1048807986445871, 0.1306997486846704, -0.0858283196849858, 0.23863763738236407, -0.07909519068312411, 0.179909767455184, 0.09509143100448829, 0.04006770890954809, 0.15854826331248179, 0.05308860233373137, 0.16337034029557423, 0.08250451020156856, -0.07390900775242377, -0.011195854384306014, -0.4341735691562587, -0.10825383244995393, -0.2801965828984976, 0.16437839429515103, -0.15919182680555227, -0.1999426086195836, 0.3110150609567177, 0.04178517490771471, 0.2533637349694675, 0.13402680262886718, 0.2385340965553826, 0.1523215231102179, -0.03973050621639499, 0.10911089000200816, 0.05907380401314346, 0.1553099810570369, -0.0004272464407133121, -0.14433035381393983, 0.09886001914228294, 0.08665376101784847] |
1,801.10393 | Nucleation of titanium nanoparticles in an oxygen-starved environment,
I: Experiments | A constant supply of oxygen has been assumed to be necessary for the growth
of titanium nanoparticles by sputtering. This oxygen supply can arise from a
high background pressure in the vacuum system or from a purposely supplied gas.
The supply of oxygen makes it difficult to grow metallic nanoparticles of
titanium and can cause process problems by reacting with the target. We here
report that growth of titanium nanoparticles in the metallic hexagonal titanium
({\alpha}Ti) phase is possible using a pulsed hollow cathode sputter plasma and
adding a high partial pressure of helium to the process instead of trace
amounts of oxygen. The helium cools the process gas in which the nanoparticles
nucleate. This is important both for the first dimer formation and the
continued growth to a thermodynamically stable size. The parameter region where
the synthesis of nanoparticles is possible is mapped out experimentally and the
theory of the physical processes behind this process window is outlined. A
pressure limit below which no nanoparticles were produced was found at 200 Pa,
and could be attributed to a low dimer formation rate, mainly caused by a more
rapid dilution of the growth material. Nanoparticle production also disappeared
at argon gas flows above 25 sccm. In this case the main reason was identified
as a gas temperature increase within the nucleation zone, giving a too high
evaporation rate from nanoparticles (clusters) in the stage of growth from
dimers to stable nuclei. These two mechanisms are in depth explored in a
companion paper [1]. A process stability limit was also found at low argon gas
partial pressures, and could be attributed to a transition from a hollow
cathode discharge to a glow discharge.
| cond-mat.mtrl-sci | a constant supply of oxygen has been assumed to be necessary for the growth of titanium nanoparticles by sputtering this oxygen supply can arise from a high background pressure in the vacuum system or from a purposely supplied gas the supply of oxygen makes it difficult to grow metallic nanoparticles of titanium and can cause process problems by reacting with the target we here report that growth of titanium nanoparticles in the metallic hexagonal titanium alphati phase is possible using a pulsed hollow cathode sputter plasma and adding a high partial pressure of helium to the process instead of trace amounts of oxygen the helium cools the process gas in which the nanoparticles nucleate this is important both for the first dimer formation and the continued growth to a thermodynamically stable size the parameter region where the synthesis of nanoparticles is possible is mapped out experimentally and the theory of the physical processes behind this process window is outlined a pressure limit below which no nanoparticles were produced was found at 200 pa and could be attributed to a low dimer formation rate mainly caused by a more rapid dilution of the growth material nanoparticle production also disappeared at argon gas flows above 25 sccm in this case the main reason was identified as a gas temperature increase within the nucleation zone giving a too high evaporation rate from nanoparticles clusters in the stage of growth from dimers to stable nuclei these two mechanisms are in depth explored in a companion paper 1 a process stability limit was also found at low argon gas partial pressures and could be attributed to a transition from a hollow cathode discharge to a glow discharge | [['a', 'constant', 'supply', 'of', 'oxygen', 'has', 'been', 'assumed', 'to', 'be', 'necessary', 'for', 'the', 'growth', 'of', 'titanium', 'nanoparticles', 'by', 'sputtering', 'this', 'oxygen', 'supply', 'can', 'arise', 'from', 'a', 'high', 'background', 'pressure', 'in', 'the', 'vacuum', 'system', 'or', 'from', 'a', 'purposely', 'supplied', 'gas', 'the', 'supply', 'of', 'oxygen', 'makes', 'it', 'difficult', 'to', 'grow', 'metallic', 'nanoparticles', 'of', 'titanium', 'and', 'can', 'cause', 'process', 'problems', 'by', 'reacting', 'with', 'the', 'target', 'we', 'here', 'report', 'that', 'growth', 'of', 'titanium', 'nanoparticles', 'in', 'the', 'metallic', 'hexagonal', 'titanium', 'alphati', 'phase', 'is', 'possible', 'using', 'a', 'pulsed', 'hollow', 'cathode', 'sputter', 'plasma', 'and', 'adding', 'a', 'high', 'partial', 'pressure', 'of', 'helium', 'to', 'the', 'process', 'instead', 'of', 'trace', 'amounts', 'of', 'oxygen', 'the', 'helium', 'cools', 'the', 'process', 'gas', 'in', 'which', 'the', 'nanoparticles', 'nucleate', 'this', 'is', 'important', 'both', 'for', 'the', 'first', 'dimer', 'formation', 'and', 'the', 'continued', 'growth', 'to', 'a', 'thermodynamically', 'stable', 'size', 'the', 'parameter', 'region', 'where', 'the', 'synthesis', 'of', 'nanoparticles', 'is', 'possible', 'is', 'mapped', 'out', 'experimentally', 'and', 'the', 'theory', 'of', 'the', 'physical', 'processes', 'behind', 'this', 'process', 'window', 'is', 'outlined', 'a', 'pressure', 'limit', 'below', 'which', 'no', 'nanoparticles', 'were', 'produced', 'was', 'found', 'at', '200', 'pa', 'and', 'could', 'be', 'attributed', 'to', 'a', 'low', 'dimer', 'formation', 'rate', 'mainly', 'caused', 'by', 'a', 'more', 'rapid', 'dilution', 'of', 'the', 'growth', 'material', 'nanoparticle', 'production', 'also', 'disappeared', 'at', 'argon', 'gas', 'flows', 'above', '25', 'sccm', 'in', 'this', 'case', 'the', 'main', 'reason', 'was', 'identified', 'as', 'a', 'gas', 'temperature', 'increase', 'within', 'the', 'nucleation', 'zone', 'giving', 'a', 'too', 'high', 'evaporation', 'rate', 'from', 'nanoparticles', 'clusters', 'in', 'the', 'stage', 'of', 'growth', 'from', 'dimers', 'to', 'stable', 'nuclei', 'these', 'two', 'mechanisms', 'are', 'in', 'depth', 'explored', 'in', 'a', 'companion', 'paper', '1', 'a', 'process', 'stability', 'limit', 'was', 'also', 'found', 'at', 'low', 'argon', 'gas', 'partial', 'pressures', 'and', 'could', 'be', 'attributed', 'to', 'a', 'transition', 'from', 'a', 'hollow', 'cathode', 'discharge', 'to', 'a', 'glow', 'discharge']] | [-0.0544236288205737, 0.2162686688561283, -0.04728377475122531, 0.009758903582185164, 0.022198096412260428, -0.11137177644244639, 0.09230745187712873, 0.39317291929280873, -0.2518141681034488, -0.2853252886338754, 0.10454528975004912, -0.2872963939786803, -0.03687177905367014, 0.15224765228513787, -0.025179895499811165, 0.014791539914632326, -0.013792662414002186, -0.04237185721037949, -0.03114040492140483, -0.22257065995933212, 0.2592124982022, 0.12254862357607997, 0.27578978853610653, 0.10375137741795942, 0.06450533934306198, -0.11548051636632828, 0.054330924431114716, 0.002168797438713253, -0.14052912572110118, 0.050454591458096956, 0.2393937538859289, 0.01737133528977791, 0.23902624409401407, -0.4665978621982091, -0.23739006108082567, 0.059429834368935924, 0.15494144260420972, 0.13205701672108366, -0.13652962999541604, -0.1954905186083782, 0.06232077075607731, -0.16722475530159436, -0.15604451709130587, 0.0196320315747, 0.01772290651177895, 0.020650825085401607, -0.27047888655298064, 0.07696405118839082, 0.06543959670552343, 0.05089638776646214, -0.09417189509981042, -0.08689473010062947, -0.08811680324118029, 0.05210608648423581, 0.02484724803772798, 0.023570332066849508, 0.26757297061667745, -0.0923317303527675, -0.005998448125278273, 0.39334291018255, -0.05885169200280496, -0.07237339074845617, 0.23539946526569705, -0.18821645278074112, -0.06821437844930626, 0.2687470235858535, 0.15033435050384902, 0.11923592473943355, -0.1844970368198532, 0.007454938815653998, 0.02902178085369474, 0.2163095784840894, 0.14898770341752032, -0.036591203761508304, 0.2682344553387783, 0.23494141732040358, 0.009444366212511528, 0.18831998495082042, -0.10010366641680202, -0.027643503172484932, -0.21536480317367834, -0.19431919186270352, -0.144190319717188, 0.04519035668791014, -0.051091495978027576, -0.17469270943485676, 0.30268689054675424, 0.08198209411253267, 0.19033547133002562, -0.07495517890358754, 0.26293389293602965, 0.08160557245450914, 0.07182757488405662, 0.009214396015509751, 0.258283493840565, 0.17166740777415176, 0.14610331799630208, -0.23630021944524826, 0.14339293186480168, 0.008322530080967233] |
1,801.10394 | A structure theorem for euclidean buildings | We prove an affine analog of Scharlau's reduction theorem for spherical
buildings. To be a bit more precise let $X$ be a euclidean building with
spherical building $\partial X$ at infinity. Then there exists a euclidean
building $\bar X$ such that $X$ splits as a product of $\bar X$ with some
euclidean $k$-space such that $\partial \bar X$ is the thick reduction of
$\partial X$ in the sense of Scharlau. \newline In addition we prove a converse
statement saying that an embedding of a thick spherical building at infinity
extends to an embedding of the euclidean building having the extended spherical
building as its boundary.
| math.MG math.CO | we prove an affine analog of scharlaus reduction theorem for spherical buildings to be a bit more precise let x be a euclidean building with spherical building partial x at infinity then there exists a euclidean building bar x such that x splits as a product of bar x with some euclidean kspace such that partial bar x is the thick reduction of partial x in the sense of scharlau newline in addition we prove a converse statement saying that an embedding of a thick spherical building at infinity extends to an embedding of the euclidean building having the extended spherical building as its boundary | [['we', 'prove', 'an', 'affine', 'analog', 'of', 'scharlaus', 'reduction', 'theorem', 'for', 'spherical', 'buildings', 'to', 'be', 'a', 'bit', 'more', 'precise', 'let', 'x', 'be', 'a', 'euclidean', 'building', 'with', 'spherical', 'building', 'partial', 'x', 'at', 'infinity', 'then', 'there', 'exists', 'a', 'euclidean', 'building', 'bar', 'x', 'such', 'that', 'x', 'splits', 'as', 'a', 'product', 'of', 'bar', 'x', 'with', 'some', 'euclidean', 'kspace', 'such', 'that', 'partial', 'bar', 'x', 'is', 'the', 'thick', 'reduction', 'of', 'partial', 'x', 'in', 'the', 'sense', 'of', 'scharlau', 'newline', 'in', 'addition', 'we', 'prove', 'a', 'converse', 'statement', 'saying', 'that', 'an', 'embedding', 'of', 'a', 'thick', 'spherical', 'building', 'at', 'infinity', 'extends', 'to', 'an', 'embedding', 'of', 'the', 'euclidean', 'building', 'having', 'the', 'extended', 'spherical', 'building', 'as', 'its', 'boundary']] | [-0.12837012552168184, 0.06894275706746647, -0.10597661522646937, 0.01909452339728327, -0.06403680324841005, -0.12890058082904524, 0.02663418171620763, 0.3408236232062336, -0.3074267260649671, -0.15366225995911428, 0.12580178267671727, -0.2680808790923598, -0.1185570488182398, 0.168612369940652, -0.12737205380332084, -0.03684422243979778, -0.01256821013521403, 0.06119089522578109, -0.15529547844198532, -0.2444180403656971, 0.31031839568347025, -0.0604990930072605, 0.21159545517786263, 0.014745194285821456, 0.14373643497170774, 0.0332955976050121, 0.02940710661977601, 0.0010589583253022283, -0.13514505739679478, 0.14732879005784455, 0.3057331824829117, 0.10631455555155228, 0.22014587306274244, -0.39881874467783535, -0.20371872003082758, 0.16849297645967454, 0.1543792667082296, 0.019343902491247997, -0.04201515295048571, -0.24873452773317695, 0.15611930987618577, -0.13984582049306482, -0.20990418852306902, 0.0028633538794775423, 0.08374443168661226, -0.04715796774969651, -0.2922469342772204, -0.018788639590359077, 0.1841325095245758, 0.05659152908349195, -0.01839510514065086, -0.1264766859732425, -0.08132079313509166, 0.0976726197807763, 0.008988120365896836, 0.1751530357511141, 0.11140128661197825, -0.020466361042613592, -0.08191850895729239, 0.3597207397150879, -0.05684719076201033, -0.2621962475375487, 0.14412070214390182, -0.15923327152939656, -0.11183841977841578, 0.11362730622148284, 0.14602262818684372, 0.12205413688654797, -0.040015549649699375, 0.19579910730513242, -0.14990294730859416, 0.13878384608632097, 0.16010104647228637, 0.010193259047809988, 0.14342840430254, 0.17434597452386066, 0.1418893914669752, 0.1385616167300703, -0.04823102861757014, -0.003529988444195344, -0.3808156908847965, -0.23056554714947616, -0.14385516890056002, 0.18964445063074192, -0.1506346513877081, -0.2016651629237458, 0.2403542305736874, 0.024345613207865078, 0.2672413369694438, 0.0699687480675773, 0.248255011427458, 0.05615069601425113, 0.04286473388828409, 0.10122300564006974, 0.10430665783105024, 0.15484702736676598, -0.012755184434354305, -0.0906210312834726, -0.024063516193284437, 0.13413042628403324] |
1,801.10395 | Probabilistic Recurrent State-Space Models | State-space models (SSMs) are a highly expressive model class for learning
patterns in time series data and for system identification. Deterministic
versions of SSMs (e.g. LSTMs) proved extremely successful in modeling complex
time series data. Fully probabilistic SSMs, however, are often found hard to
train, even for smaller problems. To overcome this limitation, we propose a
novel model formulation and a scalable training algorithm based on doubly
stochastic variational inference and Gaussian processes. In contrast to
existing work, the proposed variational approximation allows one to fully
capture the latent state temporal correlations. These correlations are the key
to robust training. The effectiveness of the proposed PR-SSM is evaluated on a
set of real-world benchmark datasets in comparison to state-of-the-art
probabilistic model learning methods. Scalability and robustness are
demonstrated on a high dimensional problem.
| stat.ML | statespace models ssms are a highly expressive model class for learning patterns in time series data and for system identification deterministic versions of ssms eg lstms proved extremely successful in modeling complex time series data fully probabilistic ssms however are often found hard to train even for smaller problems to overcome this limitation we propose a novel model formulation and a scalable training algorithm based on doubly stochastic variational inference and gaussian processes in contrast to existing work the proposed variational approximation allows one to fully capture the latent state temporal correlations these correlations are the key to robust training the effectiveness of the proposed prssm is evaluated on a set of realworld benchmark datasets in comparison to stateoftheart probabilistic model learning methods scalability and robustness are demonstrated on a high dimensional problem | [['statespace', 'models', 'ssms', 'are', 'a', 'highly', 'expressive', 'model', 'class', 'for', 'learning', 'patterns', 'in', 'time', 'series', 'data', 'and', 'for', 'system', 'identification', 'deterministic', 'versions', 'of', 'ssms', 'eg', 'lstms', 'proved', 'extremely', 'successful', 'in', 'modeling', 'complex', 'time', 'series', 'data', 'fully', 'probabilistic', 'ssms', 'however', 'are', 'often', 'found', 'hard', 'to', 'train', 'even', 'for', 'smaller', 'problems', 'to', 'overcome', 'this', 'limitation', 'we', 'propose', 'a', 'novel', 'model', 'formulation', 'and', 'a', 'scalable', 'training', 'algorithm', 'based', 'on', 'doubly', 'stochastic', 'variational', 'inference', 'and', 'gaussian', 'processes', 'in', 'contrast', 'to', 'existing', 'work', 'the', 'proposed', 'variational', 'approximation', 'allows', 'one', 'to', 'fully', 'capture', 'the', 'latent', 'state', 'temporal', 'correlations', 'these', 'correlations', 'are', 'the', 'key', 'to', 'robust', 'training', 'the', 'effectiveness', 'of', 'the', 'proposed', 'prssm', 'is', 'evaluated', 'on', 'a', 'set', 'of', 'realworld', 'benchmark', 'datasets', 'in', 'comparison', 'to', 'stateoftheart', 'probabilistic', 'model', 'learning', 'methods', 'scalability', 'and', 'robustness', 'are', 'demonstrated', 'on', 'a', 'high', 'dimensional', 'problem']] | [-0.03964444705652016, -0.014060360980114307, -0.04110176806077079, 0.1343709972023851, -0.10390821402137534, -0.20416621281412628, 0.013995806051587517, 0.43634597251586843, -0.28982851008362503, -0.34563742047457985, 0.10170341633563636, -0.23856257626296914, -0.14608018995557248, 0.209338179219754, -0.10699610353207611, 0.18136711834901661, 0.1527425938384664, -0.015630539861211382, -0.06338770545588693, -0.2569604992520798, 0.2794892117575121, 0.03313690171026709, 0.3674651933763402, -0.019835191027430647, 0.13810674893620395, -0.043022662543631726, -0.025449661954277843, 0.018250541190024127, -0.030801913803302203, 0.17892060252382758, 0.30050971377482766, 0.17014106333072326, 0.33631629993870965, -0.43172011943534017, -0.2733724880063991, 0.1030783750977593, 0.13995562222132293, 0.11708447738706265, -0.017937236027192383, -0.32751718356104736, 0.05460172449150405, -0.15504396984805213, -0.014780505742898888, -0.22072975235906514, -0.024856483373282987, -0.02845385314801454, -0.32776684958882857, 0.07263855822075681, 0.07154087054324478, 0.020137344233014366, -0.03139435433981954, -0.09652869976707734, 0.03615079425402324, 0.060867441557065555, 0.020775215719671298, -0.022171198362202355, 0.0602371141871889, -0.12981624815113196, -0.18367045327040338, 0.3526472353348226, -0.05011653886741084, -0.24826982148894758, 0.23852163928941908, -0.027178882988113346, -0.19961594307625835, 0.12073562611741098, 0.27355399283326487, 0.16115280924273204, -0.19063908702722102, 0.039188144751471664, -0.013311368878930807, 0.1849893118205452, -0.015116275323441985, -0.012599241447098779, 0.12560744001177337, 0.28491539258693316, 0.020821280495235413, 0.12211557000409812, -0.10630038733220179, -0.1727508556619851, -0.20345486981342686, -0.07638110447089386, -0.18688902379168817, -0.045300384990475846, -0.09401406669084364, -0.19642196642234921, 0.39531217457260936, 0.24045878872901527, 0.19598036220254886, 0.13940133855000816, 0.34899452296932315, 0.07713184687302353, 0.047605970331157245, 0.0864279076076028, 0.1642264235159735, 0.09167188183037621, 0.1126262294901332, -0.1518921439119643, 0.12521171289016353, 0.04469994903245771] |
1,801.10396 | Understanding Web Archiving Services and Their (Mis)Use on Social Media | Web archiving services play an increasingly important role in today's
information ecosystem, by ensuring the continuing availability of information,
or by deliberately caching content that might get deleted or removed. Among
these, the Wayback Machine has been proactively archiving, since 2001, versions
of a large number of Web pages, while newer services like archive.is allow
users to create on-demand snapshots of specific Web pages, which serve as time
capsules that can be shared across the Web. In this paper, we present a
large-scale analysis of Web archiving services and their use on social media,
shedding light on the actors involved in this ecosystem, the content that gets
archived, and how it is shared. We crawl and study: 1) 21M URLs from
archive.is, spanning almost two years, and 2) 356K archive.is plus 391K Wayback
Machine URLs that were shared on four social networks: Reddit, Twitter, Gab,
and 4chan's Politically Incorrect board (/pol/) over 14 months. We observe that
news and social media posts are the most common types of content archived,
likely due to their perceived ephemeral and/or controversial nature. Moreover,
URLs of archiving services are extensively shared on "fringe" communities
within Reddit and 4chan to preserve possibly contentious content. Lastly, we
find evidence of moderators nudging or even forcing users to use archives,
instead of direct links, for news sources with opposing ideologies, potentially
depriving them of ad revenue.
| cs.CY cs.DL cs.SI | web archiving services play an increasingly important role in todays information ecosystem by ensuring the continuing availability of information or by deliberately caching content that might get deleted or removed among these the wayback machine has been proactively archiving since 2001 versions of a large number of web pages while newer services like archiveis allow users to create ondemand snapshots of specific web pages which serve as time capsules that can be shared across the web in this paper we present a largescale analysis of web archiving services and their use on social media shedding light on the actors involved in this ecosystem the content that gets archived and how it is shared we crawl and study 1 21m urls from archiveis spanning almost two years and 2 356k archiveis plus 391k wayback machine urls that were shared on four social networks reddit twitter gab and 4chans politically incorrect board pol over 14 months we observe that news and social media posts are the most common types of content archived likely due to their perceived ephemeral andor controversial nature moreover urls of archiving services are extensively shared on fringe communities within reddit and 4chan to preserve possibly contentious content lastly we find evidence of moderators nudging or even forcing users to use archives instead of direct links for news sources with opposing ideologies potentially depriving them of ad revenue | [['web', 'archiving', 'services', 'play', 'an', 'increasingly', 'important', 'role', 'in', 'todays', 'information', 'ecosystem', 'by', 'ensuring', 'the', 'continuing', 'availability', 'of', 'information', 'or', 'by', 'deliberately', 'caching', 'content', 'that', 'might', 'get', 'deleted', 'or', 'removed', 'among', 'these', 'the', 'wayback', 'machine', 'has', 'been', 'proactively', 'archiving', 'since', '2001', 'versions', 'of', 'a', 'large', 'number', 'of', 'web', 'pages', 'while', 'newer', 'services', 'like', 'archiveis', 'allow', 'users', 'to', 'create', 'ondemand', 'snapshots', 'of', 'specific', 'web', 'pages', 'which', 'serve', 'as', 'time', 'capsules', 'that', 'can', 'be', 'shared', 'across', 'the', 'web', 'in', 'this', 'paper', 'we', 'present', 'a', 'largescale', 'analysis', 'of', 'web', 'archiving', 'services', 'and', 'their', 'use', 'on', 'social', 'media', 'shedding', 'light', 'on', 'the', 'actors', 'involved', 'in', 'this', 'ecosystem', 'the', 'content', 'that', 'gets', 'archived', 'and', 'how', 'it', 'is', 'shared', 'we', 'crawl', 'and', 'study', '1', '21m', 'urls', 'from', 'archiveis', 'spanning', 'almost', 'two', 'years', 'and', '2', '356k', 'archiveis', 'plus', '391k', 'wayback', 'machine', 'urls', 'that', 'were', 'shared', 'on', 'four', 'social', 'networks', 'reddit', 'twitter', 'gab', 'and', '4chans', 'politically', 'incorrect', 'board', 'pol', 'over', '14', 'months', 'we', 'observe', 'that', 'news', 'and', 'social', 'media', 'posts', 'are', 'the', 'most', 'common', 'types', 'of', 'content', 'archived', 'likely', 'due', 'to', 'their', 'perceived', 'ephemeral', 'andor', 'controversial', 'nature', 'moreover', 'urls', 'of', 'archiving', 'services', 'are', 'extensively', 'shared', 'on', 'fringe', 'communities', 'within', 'reddit', 'and', '4chan', 'to', 'preserve', 'possibly', 'contentious', 'content', 'lastly', 'we', 'find', 'evidence', 'of', 'moderators', 'nudging', 'or', 'even', 'forcing', 'users', 'to', 'use', 'archives', 'instead', 'of', 'direct', 'links', 'for', 'news', 'sources', 'with', 'opposing', 'ideologies', 'potentially', 'depriving', 'them', 'of', 'ad', 'revenue']] | [-0.14621814711240944, 0.08286363789807884, -0.03161773758443967, 0.10272427558609683, -0.1726060301016212, -0.15856113002217828, 0.13621561072888838, 0.42370855384444744, -0.24842035494558104, -0.37324809654726593, 0.13258373237467302, -0.3912233568752074, -0.12711368874638518, 0.14759210088712857, -0.07899267230868044, -0.05867466775496338, 0.0927301547546473, 0.03268170806923922, 0.07083791373543737, -0.3687278953060869, 0.322668249581403, 0.07012963963217114, 0.331012761474706, 0.0614861825435927, 0.027796235198097607, 0.01825142709645012, -0.17631522296119628, -0.031240821828335392, -0.07651231015111461, 0.14471939300281295, 0.35233554842221315, 0.25470425837697863, 0.3349870530650479, -0.454850976632309, -0.16659694414232992, 0.068321964922997, 0.16439272349393652, 0.05535092588672045, -0.04046180076914581, -0.34986838951526367, 0.07606496160467797, -0.23478006757385536, -0.03451407151419817, -0.07650964785139548, 0.050142204314357466, 0.044910699697078046, -0.170988023311868, 0.015140315411111856, -0.022090516397770543, 0.1185311280023758, -0.011769832259593818, -0.05306716720339748, -0.06241203381552767, 0.22504543910102534, 0.07530253531158972, -0.011840180640564288, 0.1862531786698372, -0.16570622742941218, -0.12037368127071024, 0.39159491106084166, -0.0004445973333455458, -0.08574310234760135, 0.21706718958848636, 0.004139742188336171, -0.15994750849027206, 0.07123420724751928, 0.25193332490103015, 0.03309793154389027, -0.21090523093233154, -0.028522179462784892, -0.06537588765754443, 0.23041908442871523, 0.14060636364961543, 0.057907773187950186, 0.2221055823267491, 0.14377342210056893, 0.06157984221477209, 0.07854952410402982, -0.019324180184548623, -0.07840484892128913, -0.1361500382964963, -0.14538426158358939, -0.13406166197149502, 0.049124877545639, -0.10735776287800733, -0.145893042921222, 0.34771632703456057, 0.16501775522936096, 0.1171543702118033, 7.939891977387477e-05, 0.2899464596512149, -0.07487991957033939, 0.12092406589908132, 0.15173728967963468, 0.12654211994933398, -0.05814755892705189, 0.2790517029952512, -0.050462416694232876, 0.14455060286771523, -0.005311080396671816] |
1,801.10397 | Spin susceptibility of three-dimensional Dirac semimetals | We theoretically study the spin susceptibility of Dirac semimetals using the
linear response theory. The spin susceptibility is decomposed into an intraband
contribution and an interband contribution. We obtain analytical expressions
for the intraband and interband contributions of massless Dirac fermions. The
spin susceptibility is independent of the Fermi energy while it depends on the
cutoff energy, which is introduced to regularize the integration. We find that
the cutoff energy is appropriately determined by comparing the results for the
Wilson-Dirac lattice model, which approximates the massless Dirac Hamiltonian
around the Dirac point. We also calculate the spin susceptibility of massive
Dirac fermions for the model of topological insulators. We discuss the effect
of the band inversion and the strength of spin-orbit coupling.
| cond-mat.mes-hall | we theoretically study the spin susceptibility of dirac semimetals using the linear response theory the spin susceptibility is decomposed into an intraband contribution and an interband contribution we obtain analytical expressions for the intraband and interband contributions of massless dirac fermions the spin susceptibility is independent of the fermi energy while it depends on the cutoff energy which is introduced to regularize the integration we find that the cutoff energy is appropriately determined by comparing the results for the wilsondirac lattice model which approximates the massless dirac hamiltonian around the dirac point we also calculate the spin susceptibility of massive dirac fermions for the model of topological insulators we discuss the effect of the band inversion and the strength of spinorbit coupling | [['we', 'theoretically', 'study', 'the', 'spin', 'susceptibility', 'of', 'dirac', 'semimetals', 'using', 'the', 'linear', 'response', 'theory', 'the', 'spin', 'susceptibility', 'is', 'decomposed', 'into', 'an', 'intraband', 'contribution', 'and', 'an', 'interband', 'contribution', 'we', 'obtain', 'analytical', 'expressions', 'for', 'the', 'intraband', 'and', 'interband', 'contributions', 'of', 'massless', 'dirac', 'fermions', 'the', 'spin', 'susceptibility', 'is', 'independent', 'of', 'the', 'fermi', 'energy', 'while', 'it', 'depends', 'on', 'the', 'cutoff', 'energy', 'which', 'is', 'introduced', 'to', 'regularize', 'the', 'integration', 'we', 'find', 'that', 'the', 'cutoff', 'energy', 'is', 'appropriately', 'determined', 'by', 'comparing', 'the', 'results', 'for', 'the', 'wilsondirac', 'lattice', 'model', 'which', 'approximates', 'the', 'massless', 'dirac', 'hamiltonian', 'around', 'the', 'dirac', 'point', 'we', 'also', 'calculate', 'the', 'spin', 'susceptibility', 'of', 'massive', 'dirac', 'fermions', 'for', 'the', 'model', 'of', 'topological', 'insulators', 'we', 'discuss', 'the', 'effect', 'of', 'the', 'band', 'inversion', 'and', 'the', 'strength', 'of', 'spinorbit', 'coupling']] | [-0.1875488171430274, 0.2152239968449156, -0.03559504168062303, 0.07551300228329101, -0.08097597080298134, -0.1246524810157411, 0.0653710980474048, 0.34077458564558477, -0.21777969065931488, -0.26390378201594117, -0.032531203324219486, -0.3603920493137519, -0.1762312598999773, 0.14609803979620947, 0.09698582503211792, 0.014651401142101185, -0.048160362587936344, 9.62875821612409e-05, -0.1428695976119641, -0.19631540987518478, 0.35223420793724963, 0.02277866223842272, 0.2852115768778947, 0.1437722349913455, 0.061505212379833224, 0.05999260233738078, 0.06649585427014065, -0.027021181395613266, -0.1143004802749497, 0.055753599940112135, 0.18340694452979464, -0.11013207553088385, 0.14946611605004453, -0.3892824868747934, -0.20780126187858766, 0.013215790582881843, 0.13070561740639025, 0.13272115206116902, -0.02175869694701014, -0.2945339138787545, 0.008837010726699086, -0.16335857295446465, -0.15860394318588078, -0.12776110043413327, -0.04270483710665683, -0.08554894317057915, -0.2677473875648174, 0.11934785161822935, 0.04601107134873078, 0.02634049823019104, -0.12897540036527838, -0.13795087471619616, -0.1042444960454662, 0.08652027456670022, 0.11522733714225412, -0.005479424941872597, 0.0989780546448453, -0.1274739296526694, -0.12026380330369976, 0.41179115966450974, -0.09476044369655372, -0.19302912626427896, 0.09556366452092274, -0.14821536989584871, -0.04852744805450994, 0.13995094775206973, 0.12434374062023813, 0.09108770304749773, -0.14676723189529825, 0.15239653206997184, -0.03090028971487076, 0.12355929747587413, -0.004887390187101774, 0.07924377564035479, 0.2752582829018108, 0.13148490598303128, 0.059772816650783184, 0.13653686603905296, -0.14075021186393122, -0.07367154249929075, -0.2882810210061, -0.15759521690731654, -0.2975826418088352, 0.08525806569998137, -0.07627125749697042, -0.18783605860195077, 0.493155555814871, 0.17657964412871077, 0.151170605749701, 0.027915347491574215, 0.2571019358784113, 0.25906434707767256, 0.0703653559655516, 0.07084544927461958, 0.27281304257234834, 0.17769475675333046, 0.07164307438852419, -0.36978802449818027, -0.06271448482179129, 0.08520965323760556] |
1,801.10398 | Surface and core detonations in rotating white dwarfs | The feasibility of the Double Detonation mechanism, -a surface
Helium-detonation followed by the complete carbon detonation of the core-, in a
rotating white dwarf with a mass $\simeq 1 M_{\odot}$ is studied using
three-dimensional hydrodynamic simulations. Assuming rigid rotation, the
rotational speed is taken high enough as to considerably distort the initial
spherical geometry of the white dwarf. Unlike spherically symmetric models, we
found that when helium ignition is located far from the spinning axis the
detonation fronts converge asynchronically at the antipodes of the igniting
point. Nevertheless, the detonation of the carbon core still remains as the
most probable outcome. The detonation of the core gives rise to a strong
explosion, matching many of the basic observational constraints of Type Ia
Supernova. We conclude that the Double Detonation mechanism also works when the
white dwarf is spinning fast. This confirms the sub-Chandrasekhar-mass models
and, maybe some Double Degenerate models (those having some helium fuel at the
merging moment), as appealing channels to produce Type Ia Supernova events.
| astro-ph.HE | the feasibility of the double detonation mechanism a surface heliumdetonation followed by the complete carbon detonation of the core in a rotating white dwarf with a mass simeq 1 m_odot is studied using threedimensional hydrodynamic simulations assuming rigid rotation the rotational speed is taken high enough as to considerably distort the initial spherical geometry of the white dwarf unlike spherically symmetric models we found that when helium ignition is located far from the spinning axis the detonation fronts converge asynchronically at the antipodes of the igniting point nevertheless the detonation of the carbon core still remains as the most probable outcome the detonation of the core gives rise to a strong explosion matching many of the basic observational constraints of type ia supernova we conclude that the double detonation mechanism also works when the white dwarf is spinning fast this confirms the subchandrasekharmass models and maybe some double degenerate models those having some helium fuel at the merging moment as appealing channels to produce type ia supernova events | [['the', 'feasibility', 'of', 'the', 'double', 'detonation', 'mechanism', 'a', 'surface', 'heliumdetonation', 'followed', 'by', 'the', 'complete', 'carbon', 'detonation', 'of', 'the', 'core', 'in', 'a', 'rotating', 'white', 'dwarf', 'with', 'a', 'mass', 'simeq', '1', 'm_odot', 'is', 'studied', 'using', 'threedimensional', 'hydrodynamic', 'simulations', 'assuming', 'rigid', 'rotation', 'the', 'rotational', 'speed', 'is', 'taken', 'high', 'enough', 'as', 'to', 'considerably', 'distort', 'the', 'initial', 'spherical', 'geometry', 'of', 'the', 'white', 'dwarf', 'unlike', 'spherically', 'symmetric', 'models', 'we', 'found', 'that', 'when', 'helium', 'ignition', 'is', 'located', 'far', 'from', 'the', 'spinning', 'axis', 'the', 'detonation', 'fronts', 'converge', 'asynchronically', 'at', 'the', 'antipodes', 'of', 'the', 'igniting', 'point', 'nevertheless', 'the', 'detonation', 'of', 'the', 'carbon', 'core', 'still', 'remains', 'as', 'the', 'most', 'probable', 'outcome', 'the', 'detonation', 'of', 'the', 'core', 'gives', 'rise', 'to', 'a', 'strong', 'explosion', 'matching', 'many', 'of', 'the', 'basic', 'observational', 'constraints', 'of', 'type', 'ia', 'supernova', 'we', 'conclude', 'that', 'the', 'double', 'detonation', 'mechanism', 'also', 'works', 'when', 'the', 'white', 'dwarf', 'is', 'spinning', 'fast', 'this', 'confirms', 'the', 'subchandrasekharmass', 'models', 'and', 'maybe', 'some', 'double', 'degenerate', 'models', 'those', 'having', 'some', 'helium', 'fuel', 'at', 'the', 'merging', 'moment', 'as', 'appealing', 'channels', 'to', 'produce', 'type', 'ia', 'supernova', 'events']] | [-0.08432678338028042, 0.13419723097818442, -0.04069820431577244, 0.10417422915862155, -0.10045009026730276, -0.1447321917771934, 0.06403233719525399, 0.33823568945615945, -0.20704360509288486, -0.2555066181391657, 0.08657589748835595, -0.2651315281638898, -0.05605895305753697, 0.18477347152060772, -0.04266350447510212, -0.027883562976803004, 0.1378945696791101, 0.006640543665032811, -0.12339975998501282, -0.24644616799266358, 0.3276631754832847, 0.09503413076198335, 0.2100194003071821, -0.04970952095351664, 0.044816410356953024, -0.11077259358085961, -0.001797560696400343, -0.06737758206899266, -0.14685479520600225, -0.01759268090525833, 0.1586387897543362, 0.11759977870766657, 0.19670629094029407, -0.4346453877816717, -0.2750347140357347, 0.09275782406778939, 0.18291625112901072, 0.14271985961693054, -0.12072289550216891, -0.2271258494541812, 0.08642420755048473, -0.22153030662707626, -0.20856546557575734, 0.08132949647218753, 0.03683739611093538, 0.0837417161386707, -0.2380736299077924, 0.11549494788453897, 0.120909281076754, -0.035863142766350185, -0.08721920715347606, -0.0991683535345168, -0.07848572370551347, 0.02840406848896149, 0.06016474504848516, 0.03155210181083306, 0.13789089825228754, -0.11840602207272481, 0.007555010146461427, 0.45447567482696316, -0.055373584098429476, -0.05867994007730228, 0.23262608948399324, -0.16435331487972066, -0.10888334588394556, 0.1919111573496407, 0.11392741426208382, 0.11678626137808056, -0.13176645586882152, -0.025771447690554436, -0.030668251746592212, 0.111519424679741, 0.10085015998681984, -0.03160301087231653, 0.32920566378497934, 0.22349920199204976, 0.0071520248118715065, 0.0649628893988409, -0.19482326406581574, -0.07597833401130805, -0.28419271818395836, -0.09524472703854273, -0.1147682498179724, 0.11290200059414358, -0.0863068408972874, -0.19691617166376615, 0.3207536683703986, 0.04940339840432427, 0.1890661123079663, -0.01802898633731417, 0.2912125660286072, 0.04892219334535009, 0.05560463214579252, 0.10609053229669065, 0.31488765789517087, 0.2462925976717351, 0.104726874580921, -0.23593982114563192, 0.08083527172769768, 0.03384103610934914] |
1,801.10399 | Deux am\'eliorations concurrentes des PID | In today's literature "Model-Free Control," or MFC, and "Active Disturbance
Rejection Control," or ADRC, are the most prominent approaches in order to keep
the benefits of PID controllers, that are so popular in the industrial world,
and in the same time for attenuating their severe shortcomings. After a brief
review of MFC and ADRC, several examples show the superiority of MFC, which
permits to tackle most easily a much wider class of systems.
| cs.SY math.OC | in todays literature modelfree control or mfc and active disturbance rejection control or adrc are the most prominent approaches in order to keep the benefits of pid controllers that are so popular in the industrial world and in the same time for attenuating their severe shortcomings after a brief review of mfc and adrc several examples show the superiority of mfc which permits to tackle most easily a much wider class of systems | [['in', 'todays', 'literature', 'modelfree', 'control', 'or', 'mfc', 'and', 'active', 'disturbance', 'rejection', 'control', 'or', 'adrc', 'are', 'the', 'most', 'prominent', 'approaches', 'in', 'order', 'to', 'keep', 'the', 'benefits', 'of', 'pid', 'controllers', 'that', 'are', 'so', 'popular', 'in', 'the', 'industrial', 'world', 'and', 'in', 'the', 'same', 'time', 'for', 'attenuating', 'their', 'severe', 'shortcomings', 'after', 'a', 'brief', 'review', 'of', 'mfc', 'and', 'adrc', 'several', 'examples', 'show', 'the', 'superiority', 'of', 'mfc', 'which', 'permits', 'to', 'tackle', 'most', 'easily', 'a', 'much', 'wider', 'class', 'of', 'systems']] | [-0.07902790449100407, 0.04039983308478577, -0.020425686555314963, 0.02905566717357668, -0.10240046663388405, -0.17157971554065812, 0.007453531447849045, 0.39914761121346526, -0.24245621371465698, -0.3215381847056624, 0.18269611469291355, -0.2542872123407481, -0.14116706209550675, 0.2626376400752733, -0.168378667229761, 0.07927154396558563, 0.011917563091504248, 0.021897925854954002, -0.019240348111863616, -0.23704730046989575, 0.2412125995759023, 0.04495161230841728, 0.29432154918880493, 0.003714980155688851, 0.10358809868562711, -0.04089716471706147, -0.04747844336088747, 0.02879736820006207, -0.04412183958181094, 0.129107556037911, 0.3047381525616838, 0.14828029105261173, 0.3942774723041548, -0.4339019677104199, -0.23421408324055884, 0.09193228784795493, 0.15492574728974332, 0.09854637930163322, -0.07347491748426875, -0.27720200186212585, 0.09630191364414888, -0.20132897266071953, -0.08448329556427181, -0.06401949380970981, 0.012481337225013604, 0.03066326959747566, -0.2219326042343722, 0.009329329538222861, 0.05660523827608726, 0.049776567101529605, -0.036054014100705925, -0.14297435393123187, 0.045586168485349174, 0.1354608659964208, 0.06023734282344988, -0.031329948620947255, 0.1922144214176152, -0.16825472936034203, -0.17242509411163118, 0.38896535143052063, 0.025640620472075493, -0.17322030888028342, 0.2354661309948089, -0.09683159752334276, -0.1196087901799442, 0.12882097919586383, 0.189108135357295, 0.10502204171394648, -0.17128550020135838, 0.01998976955895172, 0.05460600899404859, 0.14582751844116576, 0.037560842191315676, 0.07950746914218754, 0.1434700256851438, 0.19761007158596017, 0.10306433046058025, 0.11571316725306519, -0.05120570336353697, -0.16579551247190938, -0.2506458666654023, -0.14275540928164981, -0.07366113100609142, -0.04169863385901059, -0.04192255280392838, -0.1364471382869739, 0.4079054885939376, 0.2211241520752282, 0.1529669478306011, 0.039112036529456405, 0.38261944465084025, 0.044327991880629566, 0.09966766412931252, 0.04670751934603163, 0.2683932074945267, 0.06571134556186935, 0.12338065964565294, -0.18852646743291862, 0.08128282937782574, -0.026708456363898944] |
1,801.104 | Existence and Uniqueness of Boundary Value Problems for
Hilfer-Hadamard-Type Fractional Differential Equations | In this paper, we used some theorems of fixed point for studying the results
of Existence and Uniqueness For Hilfer-Hadamard-Type Fractional Differential
Equations, \[_{H}D^{\alpha,\beta}x(t)+f(t,x(t))=0, ~~~~~~ on~~the~~ interval~~
J:=(1,e]\] with Boundary Value Problems
\[x(1+\epsilon)=0,~~~~~~~~~~_{H}D^{1,1}x(e)=\nu~_{H}D^{1,1}x(\zeta)\]
| math.AP | in this paper we used some theorems of fixed point for studying the results of existence and uniqueness for hilferhadamardtype fractional differential equations _hdalphabetaxtftxt0 onthe interval j1e with boundary value problems x1epsilon0_hd11xenu_hd11xzeta | [['in', 'this', 'paper', 'we', 'used', 'some', 'theorems', 'of', 'fixed', 'point', 'for', 'studying', 'the', 'results', 'of', 'existence', 'and', 'uniqueness', 'for', 'hilferhadamardtype', 'fractional', 'differential', 'equations', '_hdalphabetaxtftxt0', 'onthe', 'interval', 'j1e', 'with', 'boundary', 'value', 'problems', 'x1epsilon0_hd11xenu_hd11xzeta']] | [-0.1371490029618144, 0.008699193689972162, -0.09313344052061438, 0.05727455586117382, -0.07574076969952633, -0.11345934588462114, 0.043594418128486724, 0.2767586442952355, -0.26913299411535263, -0.2568069908147057, 0.21650238663811858, -0.2707311663155754, -0.10648011175605158, 0.22839994685103496, -0.0949831544732054, 0.15338098319868246, 0.0652054959597687, -0.01971595911309123, -0.11383151361369528, -0.1900624175866445, 0.40761048483351864, -0.08640421616534393, 0.14492129844923815, 0.08478058880815903, 0.14237910214190683, 0.021118836807242285, -0.03427612297236919, 0.053645798253516355, -0.2727650652329127, 0.1080237958425035, 0.31019073844266437, 0.031479210654894514, 0.3034659784287214, -0.37720079546173413, -0.15743340843667586, 0.1641223960245649, 0.07799522628386815, 0.07085962307949861, -0.06546150812258324, -0.2891222274551789, 0.1503587058900545, -0.03998053080867976, -0.25942327876885735, -0.03147430807972948, 0.023929146739343803, 0.056704600279529886, -0.2808498240308836, 0.11200826009735465, 0.09720791916673382, 0.069499457674101, -0.16645809626206756, -0.1397325376359125, 0.010608494856084387, 0.0913306309375912, 0.06641867530997843, -0.04313791395785908, 0.030895034487669667, -0.13265774378863474, -0.16319384767363468, 0.3043384481221437, -0.08986830605814854, -0.27124676915506524, 0.13719830345362424, -0.1344623279447357, -0.20680071050301194, 0.07656326483314237, 0.14702584294912716, 0.1862809758943816, -0.15147141047442952, 0.11579161078164664, -0.07353256822486097, 0.08749698779720347, 0.14122498023013275, 0.01629758233514925, 0.0935815094038844, 0.1286183395733436, 0.1506494225934148, 0.1217423824671035, -0.01787555660897245, -0.1515395909547806, -0.3956471089273691, -0.13479750515737882, -0.08548002044359843, 0.06681772731244565, -0.14069501113408478, -0.1860126911662519, 0.33937469391773145, 0.19505473698178927, 0.1409902417411407, 0.08412419566884637, 0.15921230632811784, 0.2495793428272009, -0.08865856428941091, 0.06887126838167508, 0.1426454950638193, 0.2020451181878646, 0.18232007208280265, -0.18712982637807726, 0.003317834095408519, 0.17528851687287292] |
1,801.10401 | Efficient Algorithms for Measuring the Funnel-likeness of DAGs | Funnels are a new natural subclass of DAGs. Intuitively, a DAG is a funnel if
every source-sink path can be uniquely identified by one of its arcs. Funnels
are an analog to trees for directed graphs that is more restrictive than DAGs
but more expressive than in-/out-trees. Computational problems such as finding
vertex-disjoint paths or tracking the origin of memes remain NP-hard on DAGs
while on funnels they become solvable in polynomial time. Our main focus is the
algorithmic complexity of finding out how funnel-like a given DAG is. To this
end, we study the NP-hard problem of computing the arc-deletion distance to a
funnel of a given DAG. We develop efficient exact and approximation algorithms
for the problem and test them on synthetic random graphs and real-world graphs.
| cs.DS | funnels are a new natural subclass of dags intuitively a dag is a funnel if every sourcesink path can be uniquely identified by one of its arcs funnels are an analog to trees for directed graphs that is more restrictive than dags but more expressive than inouttrees computational problems such as finding vertexdisjoint paths or tracking the origin of memes remain nphard on dags while on funnels they become solvable in polynomial time our main focus is the algorithmic complexity of finding out how funnellike a given dag is to this end we study the nphard problem of computing the arcdeletion distance to a funnel of a given dag we develop efficient exact and approximation algorithms for the problem and test them on synthetic random graphs and realworld graphs | [['funnels', 'are', 'a', 'new', 'natural', 'subclass', 'of', 'dags', 'intuitively', 'a', 'dag', 'is', 'a', 'funnel', 'if', 'every', 'sourcesink', 'path', 'can', 'be', 'uniquely', 'identified', 'by', 'one', 'of', 'its', 'arcs', 'funnels', 'are', 'an', 'analog', 'to', 'trees', 'for', 'directed', 'graphs', 'that', 'is', 'more', 'restrictive', 'than', 'dags', 'but', 'more', 'expressive', 'than', 'inouttrees', 'computational', 'problems', 'such', 'as', 'finding', 'vertexdisjoint', 'paths', 'or', 'tracking', 'the', 'origin', 'of', 'memes', 'remain', 'nphard', 'on', 'dags', 'while', 'on', 'funnels', 'they', 'become', 'solvable', 'in', 'polynomial', 'time', 'our', 'main', 'focus', 'is', 'the', 'algorithmic', 'complexity', 'of', 'finding', 'out', 'how', 'funnellike', 'a', 'given', 'dag', 'is', 'to', 'this', 'end', 'we', 'study', 'the', 'nphard', 'problem', 'of', 'computing', 'the', 'arcdeletion', 'distance', 'to', 'a', 'funnel', 'of', 'a', 'given', 'dag', 'we', 'develop', 'efficient', 'exact', 'and', 'approximation', 'algorithms', 'for', 'the', 'problem', 'and', 'test', 'them', 'on', 'synthetic', 'random', 'graphs', 'and', 'realworld', 'graphs']] | [-0.14760552947666114, 0.08880608945850771, -0.03814394962992226, 0.1386642326027023, -0.1704615249892506, -0.1660639352942487, 0.05968342688829294, 0.45458590397501264, -0.30532234665153063, -0.3149003437866904, 0.1167120469988903, -0.2629065147828399, -0.15727894187274236, 0.1985253880247767, -0.09740820193413909, 0.03958190652939645, 0.13709498287039243, 0.05787748177572498, -0.002177989328056427, -0.25807196932925486, 0.2767052181995145, 0.027948953768634422, 0.18118640595101054, 0.05157206325945774, 0.074056848062305, -0.02025329019126343, 0.026578754190296875, 0.10412944416610861, -0.1246097505656479, 0.13841658532729476, 0.3010207768089659, 0.21907672581196888, 0.25639353978528284, -0.41826151731111455, -0.17103494938708635, 0.20225982240943868, 0.16261656039695102, 0.09059106165315868, 0.01349635977333771, -0.22248254138078014, 0.11287938517437676, -0.08902290345015605, -0.04902990940063605, -0.008212004436223995, 0.07006870771210098, -0.01748665961424094, -0.24862406911753762, 0.009687726140227608, 0.0787304226807722, 0.02491254889182027, 0.04317179191894242, -0.11190652134498273, -0.005514550233611793, 0.09315521866779804, -0.0023259971539240595, 0.04232282189131663, 0.09377835702295892, -0.1348893812098577, -0.20792428222411555, 0.40410048025476886, 0.05857244615995794, -0.19819656763900453, 0.175177750562677, -0.042441060854576704, -0.1875205259535491, 0.13205894365114726, 0.1812516390382657, 0.20529573673279736, -0.14931689804111878, 0.057735504680148174, -0.11437041917449142, 0.10653355097999488, 0.09595890162974655, -0.02331295001914534, 0.20031678438074127, 0.19914552260659577, 0.17162392811307053, 0.2151975671120912, 0.0070467594404627866, -0.10499530676092336, -0.23248752309962756, -0.11690665651974451, -0.19664252190080683, -0.0016073349947623146, -0.17011008095181837, -0.22443361358174424, 0.3897867284891174, 0.15085300633786466, 0.1893878730057966, 0.16784952182733404, 0.29425562365625907, 0.07377748023058603, 0.04397429737416426, 0.19643760135939975, 0.13707701392347124, 0.11661704793374428, 0.030248782199653466, -0.14305455502723968, 0.1247834932631043, 0.08152993084261502] |
1,801.10402 | Deep Multi-view Learning to Rank | We study the problem of learning to rank from multiple information sources.
Though multi-view learning and learning to rank have been studied extensively
leading to a wide range of applications, multi-view learning to rank as a
synergy of both topics has received little attention. The aim of the paper is
to propose a composite ranking method while keeping a close correlation with
the individual rankings simultaneously. We present a generic framework for
multi-view subspace learning to rank (MvSL2R), and two novel solutions are
introduced under the framework. The first solution captures information of
feature mappings from within each view as well as across views using
autoencoder-like networks. Novel feature embedding methods are formulated in
the optimization of multi-view unsupervised and discriminant autoencoders.
Moreover, we introduce an end-to-end solution to learning towards both the
joint ranking objective and the individual rankings. The proposed solution
enhances the joint ranking with minimum view-specific ranking loss, so that it
can achieve the maximum global view agreements in a single optimization
process. The proposed method is evaluated on three different ranking problems,
i.e. university ranking, multi-view lingual text ranking and image data
ranking, providing superior results compared to related methods.
| cs.LG stat.ML | we study the problem of learning to rank from multiple information sources though multiview learning and learning to rank have been studied extensively leading to a wide range of applications multiview learning to rank as a synergy of both topics has received little attention the aim of the paper is to propose a composite ranking method while keeping a close correlation with the individual rankings simultaneously we present a generic framework for multiview subspace learning to rank mvsl2r and two novel solutions are introduced under the framework the first solution captures information of feature mappings from within each view as well as across views using autoencoderlike networks novel feature embedding methods are formulated in the optimization of multiview unsupervised and discriminant autoencoders moreover we introduce an endtoend solution to learning towards both the joint ranking objective and the individual rankings the proposed solution enhances the joint ranking with minimum viewspecific ranking loss so that it can achieve the maximum global view agreements in a single optimization process the proposed method is evaluated on three different ranking problems ie university ranking multiview lingual text ranking and image data ranking providing superior results compared to related methods | [['we', 'study', 'the', 'problem', 'of', 'learning', 'to', 'rank', 'from', 'multiple', 'information', 'sources', 'though', 'multiview', 'learning', 'and', 'learning', 'to', 'rank', 'have', 'been', 'studied', 'extensively', 'leading', 'to', 'a', 'wide', 'range', 'of', 'applications', 'multiview', 'learning', 'to', 'rank', 'as', 'a', 'synergy', 'of', 'both', 'topics', 'has', 'received', 'little', 'attention', 'the', 'aim', 'of', 'the', 'paper', 'is', 'to', 'propose', 'a', 'composite', 'ranking', 'method', 'while', 'keeping', 'a', 'close', 'correlation', 'with', 'the', 'individual', 'rankings', 'simultaneously', 'we', 'present', 'a', 'generic', 'framework', 'for', 'multiview', 'subspace', 'learning', 'to', 'rank', 'mvsl2r', 'and', 'two', 'novel', 'solutions', 'are', 'introduced', 'under', 'the', 'framework', 'the', 'first', 'solution', 'captures', 'information', 'of', 'feature', 'mappings', 'from', 'within', 'each', 'view', 'as', 'well', 'as', 'across', 'views', 'using', 'autoencoderlike', 'networks', 'novel', 'feature', 'embedding', 'methods', 'are', 'formulated', 'in', 'the', 'optimization', 'of', 'multiview', 'unsupervised', 'and', 'discriminant', 'autoencoders', 'moreover', 'we', 'introduce', 'an', 'endtoend', 'solution', 'to', 'learning', 'towards', 'both', 'the', 'joint', 'ranking', 'objective', 'and', 'the', 'individual', 'rankings', 'the', 'proposed', 'solution', 'enhances', 'the', 'joint', 'ranking', 'with', 'minimum', 'viewspecific', 'ranking', 'loss', 'so', 'that', 'it', 'can', 'achieve', 'the', 'maximum', 'global', 'view', 'agreements', 'in', 'a', 'single', 'optimization', 'process', 'the', 'proposed', 'method', 'is', 'evaluated', 'on', 'three', 'different', 'ranking', 'problems', 'ie', 'university', 'ranking', 'multiview', 'lingual', 'text', 'ranking', 'and', 'image', 'data', 'ranking', 'providing', 'superior', 'results', 'compared', 'to', 'related', 'methods']] | [-0.027016315617017717, -0.07215514541632129, -0.07838031600863125, 0.07050649780027465, -0.11327008780610469, -0.18879511251988024, 0.03152174252498242, 0.4541014334194112, -0.29636703828138483, -0.3317481620785103, 0.05469371689142678, -0.30294962574430195, -0.19108542050571017, 0.1298362919748713, -0.13116678631454823, 0.11026931378375932, 0.0822091133708192, 0.07720995585904601, -0.11434829575081654, -0.28724078419882343, 0.33576920115600156, 0.05036372998633336, 0.3826613466917854, 0.030352361769998715, 0.16844264859544864, 0.03650946943233385, -0.055464060631455835, 0.055374439172062674, -0.059437352844903105, 0.20041617173785536, 0.37405454839661373, 0.25732936602825124, 0.375937680300978, -0.32073978248253926, -0.21767185100824715, 0.1153425101704473, 0.12402170195337865, 0.08678317118253674, -0.04617238271868663, -0.3119377459965877, 0.07426452621116697, -0.18198991573857354, 0.04059233283504037, -0.14889101905402602, -0.06479434309330452, -0.0134435331178277, -0.31059659406609985, 0.010386473555645915, 0.03613681343657723, 0.045483044780713994, -0.0864862771848812, -0.13864316235862903, 0.03541604209014397, 0.15318029694446392, 0.07433082199083597, 0.06526251361146089, 0.11203038272479088, -0.16139189628212108, -0.16456201528024994, 0.3810844596993831, -0.03955099581183923, -0.2002980454354403, 0.1974056871960746, -0.01165683848480934, -0.1620999627900262, 0.11086287914016812, 0.2612042498352371, 0.12810469059226795, -0.18123198840671131, 0.004171628184249317, -0.061068742692028895, 0.14490874795022315, 0.04165662328362196, 0.003855963196778267, 0.18114295568630417, 0.2334081999952761, 0.07688424742142141, 0.14311231864549065, -0.12283561651783362, -0.08528257961464163, -0.19004001067837306, -0.08930086002555512, -0.20049651789469355, -0.05862826271193851, -0.130607667316298, -0.12739072067239418, 0.43495000265394673, 0.18280061385978358, 0.22017038797422014, 0.10122460745783288, 0.3269813329175825, 0.03633887694546108, 0.06844765466119442, 0.09378793396382142, 0.19772571688709953, 0.053689497226570765, 0.12579964287459044, -0.13344731065654675, 0.08597557656298939, 0.09477579400913079] |
1,801.10403 | Higher order corrections to mixed QCD-EW contributions to Higgs
production in gluon fusion | We present an estimate of the next-to-leading order QCD corrections to mixed
QCD-electroweak contribution to Higgs boson production cross section in gluon
fusion, combining the recently computed three-loop virtual corrections and the
approximate treatment of real emission in the soft approximation. We find that
the NLO QCD corrections to mixed QCD-electroweak contributions are nearly
identical to NLO QCD corrections to QCD Higgs production. Our result confirms
an earlier estimate of these ${\cal O}\left( \alpha\, \alpha_s^2 \right)$
effects in arXiv:0811.3458 [hep-ph] and provides further support for the
factorization approximation of QCD and electroweak corrections.
| hep-ph | we present an estimate of the nexttoleading order qcd corrections to mixed qcdelectroweak contribution to higgs boson production cross section in gluon fusion combining the recently computed threeloop virtual corrections and the approximate treatment of real emission in the soft approximation we find that the nlo qcd corrections to mixed qcdelectroweak contributions are nearly identical to nlo qcd corrections to qcd higgs production our result confirms an earlier estimate of these cal oleft alpha alpha_s2 right effects in arxiv08113458 hepph and provides further support for the factorization approximation of qcd and electroweak corrections | [['we', 'present', 'an', 'estimate', 'of', 'the', 'nexttoleading', 'order', 'qcd', 'corrections', 'to', 'mixed', 'qcdelectroweak', 'contribution', 'to', 'higgs', 'boson', 'production', 'cross', 'section', 'in', 'gluon', 'fusion', 'combining', 'the', 'recently', 'computed', 'threeloop', 'virtual', 'corrections', 'and', 'the', 'approximate', 'treatment', 'of', 'real', 'emission', 'in', 'the', 'soft', 'approximation', 'we', 'find', 'that', 'the', 'nlo', 'qcd', 'corrections', 'to', 'mixed', 'qcdelectroweak', 'contributions', 'are', 'nearly', 'identical', 'to', 'nlo', 'qcd', 'corrections', 'to', 'qcd', 'higgs', 'production', 'our', 'result', 'confirms', 'an', 'earlier', 'estimate', 'of', 'these', 'cal', 'oleft', 'alpha', 'alpha_s2', 'right', 'effects', 'in', 'arxiv08113458', 'hepph', 'and', 'provides', 'further', 'support', 'for', 'the', 'factorization', 'approximation', 'of', 'qcd', 'and', 'electroweak', 'corrections']] | [-0.03851751182430788, 0.17626821820949376, -0.1427323882893214, 0.16687212225920317, -0.038118709243186145, -0.05948757310397923, 0.022857427270576845, 0.33201185913513537, -0.1545795540669528, -0.19527250799633886, -0.029485607002203797, -0.3713735355084519, 0.004768044023480995, 0.05715565635182429, 0.0633211677296735, 0.1464855653454003, 0.03895351837348679, -0.03946404417207384, -0.05218188611932261, -0.31406462954802683, 0.3153987777389019, 0.03335910319836567, 0.14967984468271228, 0.244485833985812, 0.020735257072374225, 0.027840680918534814, -0.10991079229026345, -0.09951409928338684, -0.1339255319026447, 0.08529970715956195, 0.23024847571049695, -0.029342151317826432, 0.08782589425201244, -0.3226100890694753, -0.07869282554146713, 0.09026385244467984, 0.1683137364351474, 0.1494541758387957, 0.008789406492091392, -0.2541229778131389, 0.13424521728681968, -0.30322150351560634, -0.12195516113728366, -0.17165515664711836, -0.05848085785122669, -0.16357366704260526, -0.41854914034838264, 0.0439742412974896, -0.07973112539595763, -0.06388717314289154, 0.015179591633015029, -0.22740730333000259, -0.036812409265068076, 0.058547570410629975, 0.13247145615194156, 0.10832306207157671, 0.12557126276964403, -0.24917787035076838, -0.2520592871486493, 0.4423854713095352, -0.07826787464791382, -0.1125877099364753, 0.05316951028172574, -0.20292357485943838, -0.20254161216713407, 0.19097123831591528, 0.22832740266280976, 0.11223447770569929, -0.13505921380736097, 0.1864285586210747, 0.06836272768534558, 0.16360339981696123, 0.062001020298339427, 0.042141747519211924, 0.10978361100727774, 0.1102149276741092, -0.06907698070711416, 0.08146561987434878, -0.01825792891094866, -0.14049260543011452, -0.504822747397196, -0.10089156135876218, -0.04001594996889648, 0.05827042627235009, -0.12969000370108202, -0.20325563370209673, 0.2816461687705115, 0.18443765282711905, 0.2097969429273887, 0.08671766391995808, 0.38832330114572594, 0.17101589752849616, 0.06227081550194113, 0.05648406104022718, 0.3455588563709803, 0.22128468227532247, 0.08154523391883982, -0.2953589403718386, -0.030107025563230982, 0.185542387958697] |
1,801.10404 | Dual free energies in Poisson-Boltzmann theory | Poisson-Boltzmann theory allows one to study soft matter and biophysical
systems involving point-like charges of low valencies. The inclusion of
fluctuation corrections beyond the mean-field approach typically requires the
application of loop expansions around a mean-field solution for the
electrostatic potential \(\phi({\bf r})\), or sophisticated variational
approaches. Recently, Poisson-Boltzmann theory has been recast, via a Legendre
transform, as a mean-field theory involving the dielectric displacement field
\({\bf D}({\bf r})\). In this paper we consider the path integral formulation
of the dual theory. Exploiting the transformation between \(\phi\) and \({\bf
D}\), we formulate a dual Sine-Gordon field theory in terms of the displacement
field and provide a strategy for precise numerical computations of free
energies beyond the leading order.
| cond-mat.soft | poissonboltzmann theory allows one to study soft matter and biophysical systems involving pointlike charges of low valencies the inclusion of fluctuation corrections beyond the meanfield approach typically requires the application of loop expansions around a meanfield solution for the electrostatic potential phibf r or sophisticated variational approaches recently poissonboltzmann theory has been recast via a legendre transform as a meanfield theory involving the dielectric displacement field bf dbf r in this paper we consider the path integral formulation of the dual theory exploiting the transformation between phi and bf d we formulate a dual sinegordon field theory in terms of the displacement field and provide a strategy for precise numerical computations of free energies beyond the leading order | [['poissonboltzmann', 'theory', 'allows', 'one', 'to', 'study', 'soft', 'matter', 'and', 'biophysical', 'systems', 'involving', 'pointlike', 'charges', 'of', 'low', 'valencies', 'the', 'inclusion', 'of', 'fluctuation', 'corrections', 'beyond', 'the', 'meanfield', 'approach', 'typically', 'requires', 'the', 'application', 'of', 'loop', 'expansions', 'around', 'a', 'meanfield', 'solution', 'for', 'the', 'electrostatic', 'potential', 'phibf', 'r', 'or', 'sophisticated', 'variational', 'approaches', 'recently', 'poissonboltzmann', 'theory', 'has', 'been', 'recast', 'via', 'a', 'legendre', 'transform', 'as', 'a', 'meanfield', 'theory', 'involving', 'the', 'dielectric', 'displacement', 'field', 'bf', 'dbf', 'r', 'in', 'this', 'paper', 'we', 'consider', 'the', 'path', 'integral', 'formulation', 'of', 'the', 'dual', 'theory', 'exploiting', 'the', 'transformation', 'between', 'phi', 'and', 'bf', 'd', 'we', 'formulate', 'a', 'dual', 'sinegordon', 'field', 'theory', 'in', 'terms', 'of', 'the', 'displacement', 'field', 'and', 'provide', 'a', 'strategy', 'for', 'precise', 'numerical', 'computations', 'of', 'free', 'energies', 'beyond', 'the', 'leading', 'order']] | [-0.12656728608802087, 0.06672146955457658, -0.11960335557696299, 0.07804906322380085, -0.055266968363311963, -0.14178683303722764, 0.022835407524480152, 0.29289929267271597, -0.2680332988971189, -0.27991150125715153, 0.0364724409399491, -0.25882274507738795, -0.18852290666022858, 0.11572087627748753, 0.0012830877518754894, 0.05722119727850718, -0.02002059615422356, 0.06488491371653825, -0.10317646030936453, -0.1550398609597015, 0.2559268364122422, 0.024392936702312556, 0.22481013502199518, 0.05683365516893376, 0.09787566770041772, 0.09740997027700483, 0.013865523809819655, 0.07194028950248987, -0.15962300594438308, 0.14421032073856252, 0.20879283931152698, 0.03554779470906103, 0.2814109836373541, -0.479421250064368, -0.23976549890555315, 0.04937026260412788, 0.146148790392267, 0.12397241656336996, -0.02965059817149067, -0.25410399612007756, 0.04819920963126282, -0.19593969173828077, -0.17301793759530884, -0.12952628518628367, 0.008379081326292165, 0.02353545521204439, -0.3133850773733299, 0.11200094727563877, 0.004672476832391852, 0.06322782936356014, -0.06157334232594328, -0.11364262726284184, 0.03856087700854513, 0.0377665815886773, 0.05708441113523095, 0.07686883266975755, 0.14156734017789427, -0.15786582456657, -0.10972386106682973, 0.37746543083261, -0.05861542469888957, -0.2197741174723132, 0.1576422118814662, -0.11727885617795637, -0.11201759039471715, 0.14002414867755467, 0.13577708156810978, 0.150285467998247, -0.17546008193423435, 0.22423971798423858, 0.014372818919798453, 0.13472342472997004, 0.07567718945506771, 0.015160228922900002, 0.19607779615682253, 0.13144315919302152, 0.03813024284071447, 0.12111700705442009, -0.05440610437653959, -0.17664568200391734, -0.3783562215581789, -0.14353113713027058, -0.1473271766819565, 0.04412172571755946, -0.08834609094480846, -0.19786878446338035, 0.34006236197616335, 0.12338670566914824, 0.09093722022904115, 0.06466614603167557, 0.2574889004285747, 0.1732823808935976, 0.03961734854916142, 0.021180388121076435, 0.23320957498182937, 0.236295968382935, 0.10734740514466065, -0.22905871486962157, -0.0850951240094126, 0.1744275451450356] |
1,801.10405 | Wide-field Ultraviolet Imager for Astronomical Transient Studies | Though the ultraviolet (UV) domain plays a vital role in the studies of
astronomical transient events, the UV time-domain sky remains largely
unexplored. We have designed a wide-field UV imager that can be flown on a
range of available platforms, such as high-altitude balloons, CubeSats, and
larger space missions. The major scientific goals are the variability of
astronomical sources, detection of transients such as supernovae, novae, tidal
disruption events, and characterizing AGN variability. The instrument has an 80
mm aperture with a circular field of view of 10.8 degrees, an angular
resolution of around 22 arcsec, and a 240-390 nm spectral observation window.
The detector for the instrument is a Microchannel Plate (MCP)-based image
intensifier with both photon counting and integration capabilities. An
FPGA-based detector readout mechanism and real-time data processing have been
implemented. The imager is designed in such a way that its lightweight and
compact nature are well fitted for the CubeSat dimensions. Here we present
various design and developmental aspects of this UV wide-field transient
explorer.
| astro-ph.IM | though the ultraviolet uv domain plays a vital role in the studies of astronomical transient events the uv timedomain sky remains largely unexplored we have designed a widefield uv imager that can be flown on a range of available platforms such as highaltitude balloons cubesats and larger space missions the major scientific goals are the variability of astronomical sources detection of transients such as supernovae novae tidal disruption events and characterizing agn variability the instrument has an 80 mm aperture with a circular field of view of 108 degrees an angular resolution of around 22 arcsec and a 240390 nm spectral observation window the detector for the instrument is a microchannel plate mcpbased image intensifier with both photon counting and integration capabilities an fpgabased detector readout mechanism and realtime data processing have been implemented the imager is designed in such a way that its lightweight and compact nature are well fitted for the cubesat dimensions here we present various design and developmental aspects of this uv widefield transient explorer | [['though', 'the', 'ultraviolet', 'uv', 'domain', 'plays', 'a', 'vital', 'role', 'in', 'the', 'studies', 'of', 'astronomical', 'transient', 'events', 'the', 'uv', 'timedomain', 'sky', 'remains', 'largely', 'unexplored', 'we', 'have', 'designed', 'a', 'widefield', 'uv', 'imager', 'that', 'can', 'be', 'flown', 'on', 'a', 'range', 'of', 'available', 'platforms', 'such', 'as', 'highaltitude', 'balloons', 'cubesats', 'and', 'larger', 'space', 'missions', 'the', 'major', 'scientific', 'goals', 'are', 'the', 'variability', 'of', 'astronomical', 'sources', 'detection', 'of', 'transients', 'such', 'as', 'supernovae', 'novae', 'tidal', 'disruption', 'events', 'and', 'characterizing', 'agn', 'variability', 'the', 'instrument', 'has', 'an', '80', 'mm', 'aperture', 'with', 'a', 'circular', 'field', 'of', 'view', 'of', '108', 'degrees', 'an', 'angular', 'resolution', 'of', 'around', '22', 'arcsec', 'and', 'a', '240390', 'nm', 'spectral', 'observation', 'window', 'the', 'detector', 'for', 'the', 'instrument', 'is', 'a', 'microchannel', 'plate', 'mcpbased', 'image', 'intensifier', 'with', 'both', 'photon', 'counting', 'and', 'integration', 'capabilities', 'an', 'fpgabased', 'detector', 'readout', 'mechanism', 'and', 'realtime', 'data', 'processing', 'have', 'been', 'implemented', 'the', 'imager', 'is', 'designed', 'in', 'such', 'a', 'way', 'that', 'its', 'lightweight', 'and', 'compact', 'nature', 'are', 'well', 'fitted', 'for', 'the', 'cubesat', 'dimensions', 'here', 'we', 'present', 'various', 'design', 'and', 'developmental', 'aspects', 'of', 'this', 'uv', 'widefield', 'transient', 'explorer']] | [-0.10722766896720887, 0.12509507904135153, -0.06343825367643842, 0.04849890142629322, -0.10834253671956026, -0.09060503272727753, -0.02149336303756129, 0.463145175815693, -0.17309078364078664, -0.3677867462115717, 0.1708460791421766, -0.3114853579262715, -0.10463623714167625, 0.26470152591355145, -0.07800384202749099, 0.06393796365141281, 0.09978062523684154, -0.10882308881818539, 0.006522121780324683, -0.19000543976601744, 0.20571389890738784, 0.1657296300122869, 0.21684044954184042, -0.0006279569753955695, 0.15603486132611233, -0.026977834082485753, -0.08430709441780068, -0.024169411136210243, -0.11105740859100133, 0.049917616257949875, 0.30262112383969086, 0.16158622554212343, 0.25641163111764137, -0.38838845972107566, -0.22919748904782214, 0.055077581652551, 0.14040202451966857, -0.03806334964437632, -0.07074866571513537, -0.29756949325868237, 0.026183428991186832, -0.18166224120345542, -0.14052805917370798, -0.0010812915307247923, 0.040354802440214416, 0.022675192989741584, -0.211443478937283, -0.01674157164026318, -0.004464121002543141, 0.13114723277422377, -0.08935776209788553, -0.05477567262104934, 0.019223894436782712, 0.13573507785553202, -0.01350833596647828, 0.0748489413318956, 0.17687299470777534, -0.17220064218452621, -0.09277054663869508, 0.37166508407487225, -0.039625767975286136, -0.026109970155673744, 0.19107352983805218, -0.1684799332163363, -0.11992259352977964, 0.17006206042632194, 0.17914555997205234, 0.11905912626562418, -0.20711398932395414, 0.0754222605184103, 0.032109398454416634, 0.23929618549577536, 0.07612620287303191, 0.13552960508691503, 0.30982291489289354, 0.24024907031395873, 0.061523744098459635, 0.10209287558488238, -0.29912311988023466, 0.025274765250893932, -0.2774069829472518, -0.10403770058023622, -0.14843870035561157, 0.05260348013724156, -0.05819685178071917, -0.14647739245577082, 0.36314578249307705, 0.1261764774293018, 0.11637161042086691, -0.013210968607814894, 0.34689420302553725, 0.020626263867598027, 0.14250038006589638, 0.026348831217979922, 0.29611752134570407, 0.06660500804649755, 0.16012093238809721, -0.17732348900227363, 0.005456470293990735, -0.020664810696395024] |
1,801.10406 | Mapping Ricci-based theories of gravity into general relativity | We show that the space of solutions of a wide family of Ricci-based
metric-affine theories of gravity can be put into correspondence with the space
of solutions of general relativity (GR). This allows us to use well-established
methods and results from GR to explore new gravitational physics beyond it.
| gr-qc hep-th | we show that the space of solutions of a wide family of riccibased metricaffine theories of gravity can be put into correspondence with the space of solutions of general relativity gr this allows us to use wellestablished methods and results from gr to explore new gravitational physics beyond it | [['we', 'show', 'that', 'the', 'space', 'of', 'solutions', 'of', 'a', 'wide', 'family', 'of', 'riccibased', 'metricaffine', 'theories', 'of', 'gravity', 'can', 'be', 'put', 'into', 'correspondence', 'with', 'the', 'space', 'of', 'solutions', 'of', 'general', 'relativity', 'gr', 'this', 'allows', 'us', 'to', 'use', 'wellestablished', 'methods', 'and', 'results', 'from', 'gr', 'to', 'explore', 'new', 'gravitational', 'physics', 'beyond', 'it']] | [-0.05925333981091777, 0.027266244743562613, -0.18075900373514742, 0.11755582921856937, -0.16680927077929178, -0.1400397735318014, -0.010665607328216234, 0.27135340589059825, -0.24807768443133682, -0.31364735021876794, 0.017060591713137303, -0.20518339947769468, -0.1688978012340764, 0.2395326402814438, -0.08560633888312925, 0.021060958543481927, 0.01807189193399002, -0.026482239346175145, -0.15147810480266344, -0.2219126042133818, 0.37825071020051837, 0.008713489437165359, 0.2134327539242804, -0.012407517419584716, 0.08965801201217498, -0.007192741002654657, 0.001449121084685127, 0.10219197745391284, -0.19785212716260503, 0.1771199458744377, 0.24566089921669723, 0.21945361571852118, 0.2534378926890592, -0.4176154157612473, -0.2795262146391906, 0.07916280759188037, 0.09169266902608797, 0.21433637997445962, -0.027474482252728194, -0.3231199693788464, 0.04837664150788138, -0.20628132556642717, -0.1427263727916094, -0.12548901539412327, -0.0004938629378254215, -0.02995613655851533, -0.22830171281627068, 0.009412823036351861, 0.017236082135544468, -0.05155366810504347, -0.0737730609847252, -0.041600427042188436, 0.025448289059568197, 0.08892853354336694, 0.1334601029799766, 0.04833176489288841, 0.037298625732849665, -0.1400153158416894, -0.1159386767540127, 0.48792806894804625, -0.1098309454585736, -0.2087528973352164, 0.2552761373420556, -0.23223339567145254, -0.14945487170674218, 0.06850662586900096, 0.1828854982353126, 0.1763100368746867, -0.12116925519270201, 0.17658983372651468, -0.024809378820161026, 0.12659944291226566, 0.05792881098265449, 0.05650135318743802, 0.31731957422258955, 0.13139862204358602, 0.06577763091384743, 0.09719251065447072, -0.04108932285938257, -0.10322256455159125, -0.36627126508392394, -0.18883681795947874, -0.08730066020507365, 0.0453845679924901, -0.11890839584005637, -0.15320781545597129, 0.38524366296284523, 0.21027791621357514, 0.08052672416670248, 0.09911274681023012, 0.18163355203190198, 0.07652280241260694, 0.08457923447713256, 0.023174064757768065, 0.3294951660791412, 0.15867402486037463, 0.06732656848907936, -0.1582448755458851, -0.07938755802266921, 0.07675862806111884] |
1,801.10407 | Latest developments on the highly granular Silicon-Tungsten
Electromagnetic Calorimeter technological prototype for the International
Large Detector | High precision physics at future colliders requires unprecedented highly
granular calorimeters for the application of the Particle Flow (PF) algorithm.
The physical proof of concept was given in the previous campaign of beam tests
of physic prototypes within the CALICE collaboration. We present here the
latest beam and laboratory test results and R&D developments for the
Silicon-Tungsten Electromagnetic Calorimeter technological prototype with fully
embedded very front-end (VFE) electronics for the International Large Detector
at the International Linear Collider project.
| physics.ins-det | high precision physics at future colliders requires unprecedented highly granular calorimeters for the application of the particle flow pf algorithm the physical proof of concept was given in the previous campaign of beam tests of physic prototypes within the calice collaboration we present here the latest beam and laboratory test results and rd developments for the silicontungsten electromagnetic calorimeter technological prototype with fully embedded very frontend vfe electronics for the international large detector at the international linear collider project | [['high', 'precision', 'physics', 'at', 'future', 'colliders', 'requires', 'unprecedented', 'highly', 'granular', 'calorimeters', 'for', 'the', 'application', 'of', 'the', 'particle', 'flow', 'pf', 'algorithm', 'the', 'physical', 'proof', 'of', 'concept', 'was', 'given', 'in', 'the', 'previous', 'campaign', 'of', 'beam', 'tests', 'of', 'physic', 'prototypes', 'within', 'the', 'calice', 'collaboration', 'we', 'present', 'here', 'the', 'latest', 'beam', 'and', 'laboratory', 'test', 'results', 'and', 'rd', 'developments', 'for', 'the', 'silicontungsten', 'electromagnetic', 'calorimeter', 'technological', 'prototype', 'with', 'fully', 'embedded', 'very', 'frontend', 'vfe', 'electronics', 'for', 'the', 'international', 'large', 'detector', 'at', 'the', 'international', 'linear', 'collider', 'project']] | [-0.07685974881618837, 0.1623454944796483, -0.06998397532520415, -0.03161306145211941, -0.08073166955875445, -0.14900168706957675, -0.05876929337406366, 0.34716372662872264, -0.179873889099948, -0.38076244368323986, 0.10845381569388453, -0.32959968825401387, -0.0052100458967829525, 0.23845343274518235, 0.05600870944503577, 0.21961880443452658, 0.13699879454849642, -0.0656370801344231, -0.03648043040899395, -0.1914569047704056, 0.20276593386278122, 0.27420192538418725, 0.32980267779571537, 0.06941519533225064, 0.18407728409253155, 0.0065000298008605645, -0.10157264515616093, -0.031231346557836367, -0.10649332924579459, 0.08701790942916576, 0.3524980272779453, 0.13909473823961108, 0.23859136024360322, -0.44442307321897034, -0.10343301752906386, 0.013527581356230039, 0.0455346253075743, -0.000699331677412685, -0.14485407165027683, -0.31408068132174166, 0.06722034205597106, -0.23529125119359057, -0.18200992785771436, 0.004415140202846614, -0.02912339909426585, 0.060739053053710655, -0.22466925122551148, -0.06073895084695254, -0.02313061474669206, 0.1045297416209986, -0.009564732059930699, -0.16076783982659631, 0.08428561594337225, 0.036917392730335646, -0.040940367003690595, 0.049086737139975724, 0.16395999303771347, -0.1612912957362029, -0.13540367308202422, 0.3698127046109566, 0.007424697407397524, -0.1153822081234259, 0.19116412180761772, -0.25477175359154425, -0.15503769219098495, 0.10641436687489395, 0.3289455469886336, 0.023329754242131226, -0.20481463045447687, 0.11761551006561546, 0.010695099777577422, 0.15704233396232506, 0.015072643335413518, 0.04105761350733759, 0.24900383853848693, 0.36891058594271353, 0.045182766569660436, 0.10362658335214268, -0.11370037603663587, -0.015319506443235317, -0.42683520818812937, -0.16316980603327857, -0.11718588700824523, -0.03069275248312403, 0.01644339358719225, -0.08915109331189078, 0.37235718221945946, 0.10400847380367827, 0.06610299800110014, -0.038828301891873154, 0.3216627000159101, -0.030308506478072157, 0.06554339828943728, -0.010343164022270696, 0.3199796594467156, 0.10400856768747768, 0.23386681605649146, -0.17376088655164726, 0.029432448705870518, 0.04644122862410319] |
1,801.10408 | 'It's Reducing a Human Being to a Percentage'; Perceptions of Justice in
Algorithmic Decisions | Data-driven decision-making consequential to individuals raises important
questions of accountability and justice. Indeed, European law provides
individuals limited rights to 'meaningful information about the logic' behind
significant, autonomous decisions such as loan approvals, insurance quotes, and
CV filtering. We undertake three experimental studies examining people's
perceptions of justice in algorithmic decision-making under different scenarios
and explanation styles. Dimensions of justice previously observed in response
to human decision-making appear similarly engaged in response to algorithmic
decisions. Qualitative analysis identified several concerns and heuristics
involved in justice perceptions including arbitrariness, generalisation, and
(in)dignity. Quantitative analysis indicates that explanation styles primarily
matter to justice perceptions only when subjects are exposed to multiple
different styles---under repeated exposure of one style, scenario effects
obscure any explanation effects. Our results suggests there may be no 'best'
approach to explaining algorithmic decisions, and that reflection on their
automated nature both implicates and mitigates justice dimensions.
| cs.HC cs.CY | datadriven decisionmaking consequential to individuals raises important questions of accountability and justice indeed european law provides individuals limited rights to meaningful information about the logic behind significant autonomous decisions such as loan approvals insurance quotes and cv filtering we undertake three experimental studies examining peoples perceptions of justice in algorithmic decisionmaking under different scenarios and explanation styles dimensions of justice previously observed in response to human decisionmaking appear similarly engaged in response to algorithmic decisions qualitative analysis identified several concerns and heuristics involved in justice perceptions including arbitrariness generalisation and indignity quantitative analysis indicates that explanation styles primarily matter to justice perceptions only when subjects are exposed to multiple different stylesunder repeated exposure of one style scenario effects obscure any explanation effects our results suggests there may be no best approach to explaining algorithmic decisions and that reflection on their automated nature both implicates and mitigates justice dimensions | [['datadriven', 'decisionmaking', 'consequential', 'to', 'individuals', 'raises', 'important', 'questions', 'of', 'accountability', 'and', 'justice', 'indeed', 'european', 'law', 'provides', 'individuals', 'limited', 'rights', 'to', 'meaningful', 'information', 'about', 'the', 'logic', 'behind', 'significant', 'autonomous', 'decisions', 'such', 'as', 'loan', 'approvals', 'insurance', 'quotes', 'and', 'cv', 'filtering', 'we', 'undertake', 'three', 'experimental', 'studies', 'examining', 'peoples', 'perceptions', 'of', 'justice', 'in', 'algorithmic', 'decisionmaking', 'under', 'different', 'scenarios', 'and', 'explanation', 'styles', 'dimensions', 'of', 'justice', 'previously', 'observed', 'in', 'response', 'to', 'human', 'decisionmaking', 'appear', 'similarly', 'engaged', 'in', 'response', 'to', 'algorithmic', 'decisions', 'qualitative', 'analysis', 'identified', 'several', 'concerns', 'and', 'heuristics', 'involved', 'in', 'justice', 'perceptions', 'including', 'arbitrariness', 'generalisation', 'and', 'indignity', 'quantitative', 'analysis', 'indicates', 'that', 'explanation', 'styles', 'primarily', 'matter', 'to', 'justice', 'perceptions', 'only', 'when', 'subjects', 'are', 'exposed', 'to', 'multiple', 'different', 'stylesunder', 'repeated', 'exposure', 'of', 'one', 'style', 'scenario', 'effects', 'obscure', 'any', 'explanation', 'effects', 'our', 'results', 'suggests', 'there', 'may', 'be', 'no', 'best', 'approach', 'to', 'explaining', 'algorithmic', 'decisions', 'and', 'that', 'reflection', 'on', 'their', 'automated', 'nature', 'both', 'implicates', 'and', 'mitigates', 'justice', 'dimensions']] | [-0.08168194433498796, 0.04022828418576503, -0.11485455623486603, 0.1729067754931748, -0.19131041045479272, -0.18780844308729347, 0.1385169649853097, 0.40775068851557805, -0.19119030732840095, -0.36641781897067205, 0.08270036885259699, -0.29271635857142814, -0.1984058884458859, 0.16204105003749672, -0.2233874710844447, 0.009012911226345252, 0.03694404025039036, -0.027573341165656504, 0.07082531866234766, -0.28798896494745724, 0.2608956249433965, 0.03716749183304149, 0.3481023112337475, 0.07013197378805609, 0.07870890292233775, 0.0297174889957915, -0.11120837349412734, 0.016720285396767804, -0.07011544287305609, 0.11426361709552472, 0.41582586705582597, 0.22386727960180644, 0.40053331119659014, -0.44318128530293294, -0.18430067570114586, 0.09083702452145899, 0.10438515913947038, 0.056239640699023354, -0.007374729292167427, -0.3191434366130972, 0.0037671094154301163, -0.20108647509605612, -0.11078927533267295, -0.12312892523485759, 0.031233322193083824, -0.05388990407554458, -0.22024763046368345, 0.064698396777664, 0.07877964735005612, 0.17365972702200078, -0.09223676748471717, -0.13681190049639355, 0.02163406516415743, 0.20933717294306692, 0.17881125747744467, -0.07829949387735113, 0.20776891100781728, -0.17879876579725731, -0.230722366114568, 0.39286993711880625, 0.07057253048557482, -0.12973547517481476, 0.20246805973615728, -0.11622866586230261, -0.18911179717413265, 0.05971608441287161, 0.1725584825485696, 0.00650103040437624, -0.176321958554195, -0.04911137518930657, -0.01804780002287908, 0.22166753725040295, 0.11958300679194907, 0.035450657999481085, 0.2382741580934149, 0.17566529522834934, 0.010637178895867442, 0.02675490594255317, 0.06606836849345175, -0.15759038539884024, -0.23381902624522846, -0.09152635791313464, -0.031762563218426416, 0.05279595985504709, -0.0870464223514555, -0.12587214120638188, 0.3169092856258256, 0.2432753322941047, 0.10585298004228469, 0.00784797716904942, 0.28563300248120643, 0.00483679327849069, 0.05213751226236202, 0.021430432056523348, 0.1827508601159087, -0.002338312046398243, 0.13203543265611697, -0.18415292574743397, 0.21815286608283688, -0.06120660117738051] |
1,801.10409 | Insights into radiation damage from atomic resolution scanning
transmission electron microscopy imaging of mono-layer CuPcCl$_{16}$ films on
graphene | Atomically resolved images of monolayer organic crystals have only been
obtained with scanning probe methods so far. On the one hand, they are usually
prepared on surfaces of bulk materials, which are not accessible by (scanning)
transmission electron microscopy. On the other hand, the critical electron dose
of a monolayer organic crystal is orders of magnitudes lower than the one for
bulk crystals, making (scanning) transmission electron microscopy
characterization very challenging. In this work we present an atomically
resolved study on the dynamics of a monolayer CuPcCl\textsubscript{16} crystal
under the electron beam as well as an image of the undamaged molecules obtained
by low-dose electron microscopy. The results show the dynamics and the
radiation damage mechanisms in the 2D layer of this material, complementing
what has been found for bulk crystals in earlier studies. Furthermore, being
able to image the undamaged molecular crystal allows the characterization of
new composites consisting of 2D materials and organic molecules.
| cond-mat.mtrl-sci | atomically resolved images of monolayer organic crystals have only been obtained with scanning probe methods so far on the one hand they are usually prepared on surfaces of bulk materials which are not accessible by scanning transmission electron microscopy on the other hand the critical electron dose of a monolayer organic crystal is orders of magnitudes lower than the one for bulk crystals making scanning transmission electron microscopy characterization very challenging in this work we present an atomically resolved study on the dynamics of a monolayer cupccltextsubscript16 crystal under the electron beam as well as an image of the undamaged molecules obtained by lowdose electron microscopy the results show the dynamics and the radiation damage mechanisms in the 2d layer of this material complementing what has been found for bulk crystals in earlier studies furthermore being able to image the undamaged molecular crystal allows the characterization of new composites consisting of 2d materials and organic molecules | [['atomically', 'resolved', 'images', 'of', 'monolayer', 'organic', 'crystals', 'have', 'only', 'been', 'obtained', 'with', 'scanning', 'probe', 'methods', 'so', 'far', 'on', 'the', 'one', 'hand', 'they', 'are', 'usually', 'prepared', 'on', 'surfaces', 'of', 'bulk', 'materials', 'which', 'are', 'not', 'accessible', 'by', 'scanning', 'transmission', 'electron', 'microscopy', 'on', 'the', 'other', 'hand', 'the', 'critical', 'electron', 'dose', 'of', 'a', 'monolayer', 'organic', 'crystal', 'is', 'orders', 'of', 'magnitudes', 'lower', 'than', 'the', 'one', 'for', 'bulk', 'crystals', 'making', 'scanning', 'transmission', 'electron', 'microscopy', 'characterization', 'very', 'challenging', 'in', 'this', 'work', 'we', 'present', 'an', 'atomically', 'resolved', 'study', 'on', 'the', 'dynamics', 'of', 'a', 'monolayer', 'cupccltextsubscript16', 'crystal', 'under', 'the', 'electron', 'beam', 'as', 'well', 'as', 'an', 'image', 'of', 'the', 'undamaged', 'molecules', 'obtained', 'by', 'lowdose', 'electron', 'microscopy', 'the', 'results', 'show', 'the', 'dynamics', 'and', 'the', 'radiation', 'damage', 'mechanisms', 'in', 'the', '2d', 'layer', 'of', 'this', 'material', 'complementing', 'what', 'has', 'been', 'found', 'for', 'bulk', 'crystals', 'in', 'earlier', 'studies', 'furthermore', 'being', 'able', 'to', 'image', 'the', 'undamaged', 'molecular', 'crystal', 'allows', 'the', 'characterization', 'of', 'new', 'composites', 'consisting', 'of', '2d', 'materials', 'and', 'organic', 'molecules']] | [-0.07673188608079667, 0.1344248152294782, -0.05846970327679188, -0.017921085947854146, -0.00020710980940249658, -0.17680248669799298, 0.038061481795739385, 0.45153411912821956, -0.22406650554208504, -0.3049328378611995, 0.05852600769890893, -0.33491753563444476, -0.12249556212505747, 0.250075007709975, 0.001647264366188357, 0.08975556678469143, -0.00558392216992234, -0.08012718202606324, -0.0664958285445708, -0.22390656561380431, 0.26244117443359666, 0.0872839589272776, 0.33491577181003745, 0.08311185166953251, 0.08442305263973052, 0.010644621831635314, 0.05695073011804432, 0.02722041420938988, -0.19290328076439758, 0.12895720602884408, 0.2624529506650663, -0.070555473790474, 0.18946988816343008, -0.5367379514079902, -0.2927209370213771, -0.020827745703319387, 0.16023683331441135, 0.1319018501690739, -0.10833314203266656, -0.24178333825642062, 0.0320486928659281, -0.06138714257807982, -0.07545669779722249, -0.07251506632404221, -0.06785615033905713, 0.006097396930319167, -0.18108010338318925, 0.053459897862687226, -0.01272826662151924, 0.10405313536419623, -0.12452619070705447, -0.10083240693164688, -0.05422588783736911, 0.07493440368693442, 0.026039307839387366, 0.027295473519892942, 0.22867948584438813, -0.1707974821659586, -0.10078170053781041, 0.4158122974177522, -0.003388509860791777, -0.12539461743266833, 0.204450398553989, -0.21115514475912336, -0.06734527149087478, 0.20207944234773037, 0.07741455143625517, 0.19267157460037138, -0.18772921806742107, 0.033531498923266845, -0.07619318723257991, 0.2085293822298427, 0.13203547203973418, 0.08952718738827013, 0.2128834930841901, 0.21810582729597244, 0.022400404508375833, 0.12644987387409914, -0.15121477821601495, 0.046248217266533644, -0.13641105435728546, -0.23568623845555609, -0.23197680528485967, 0.06880158119724177, -0.012387065517137788, -0.18438562875793826, 0.392949451992829, 0.09794327554803701, 0.14703447906480682, -0.08478426746648526, 0.31538059189915657, 0.04022266290210668, 0.10079767276653119, -0.07929395009132643, 0.2634820545873334, 0.10273974938918987, 0.09966036187514903, -0.20093117840588093, 0.10159466724181848, -0.0006710758162361961] |
1,801.1041 | The Multiple Holomorphs of Finite $p$-Groups of Class Two | $\DeclareMathOperator{\Hol}{Hol}$$\DeclareMathOperator{\Aut}{Aut}$$\newcommand{\Gp}[0]{\mathcal{G}(p)}$$\newcommand{\Size}[1]{\left\lvert
#1 \right\rvert}$Let $G$ be a group, and $S(G)$ be the group of permutations on
the set $G$. The (abstract) holomorph of $G$ is the natural semidirect product
$\Aut(G) G$. We will write $\Hol(G)$ for the normalizer of the image in $S(G)$
of the right regular representation of $G$, \begin{equation*}
\Hol(G) = N_{S (G)}(\rho(G)) = \Aut(G) \rho(G) \cong \Aut(G) G,
\end{equation*} and also refer to it as the holomorph of $G$. More generally,
if $N$ is any regular subgroup of $S(G)$, then $N_{S(G)}(N)$ is isomorphic to
the holomorph of $N$.
G.A.~Miller has shown that the group \begin{equation*}
T(G) = N_{S(G)}(\Hol(G))/\Hol(G) \end{equation*} acts regularly on the set of
the regular subgroups $N$ of $S(G)$ which are isomorphic to $G$, and have the
same holomorph as $G$, in the sense that $N_{S(G)}(N) = \Hol(G)$.
If $G$ is non-abelian, inversion on $G$ yields an involution in $T(G)$. Other
non-abelian regular subgroups $N$ of $S(G)$ having the same holomorph as $G$
yield (other) involutions in $T(G)$. In the cases studied in the literature,
$T(G)$ turns out to be a finite $2$-group, which is often elementary abelian.
In this paper we exhibit an example of a finite $p$-group $\Gp$ of class $2$,
for $p > 2$ a prime, which is the smallest $p$-group such that $T(\Gp)$ is
non-abelian, and not a $2$-group. Moreover, $T(\Gp)$ is not generated by
involutions when $p > 3$.
More generally, we develop some aspects of a theory of $T(G)$ for $G$ a
finite $p$-group of class $2$, for $p > 2$. In particular, we show that for
such a group $G$ there is an element of order $p-1$ in $T(G)$, and exhibit
examples where $\Size{T(G)} = p - 1$, and others where $T(G)$ contains a large
elementary abelian $p$-subgroup.
| math.GR | declaremathoperatorholholdeclaremathoperatorautautnewcommandgp0mathcalgpnewcommandsize1leftlvert 1 rightrvertlet g be a group and sg be the group of permutations on the set g the abstract holomorph of g is the natural semidirect product autg g we will write holg for the normalizer of the image in sg of the right regular representation of g beginequation holg n_s grhog autg rhog cong autg g endequation and also refer to it as the holomorph of g more generally if n is any regular subgroup of sg then n_sgn is isomorphic to the holomorph of n gamiller has shown that the group beginequation tg n_sgholgholg endequation acts regularly on the set of the regular subgroups n of sg which are isomorphic to g and have the same holomorph as g in the sense that n_sgn holg if g is nonabelian inversion on g yields an involution in tg other nonabelian regular subgroups n of sg having the same holomorph as g yield other involutions in tg in the cases studied in the literature tg turns out to be a finite 2group which is often elementary abelian in this paper we exhibit an example of a finite pgroup gp of class 2 for p 2 a prime which is the smallest pgroup such that tgp is nonabelian and not a 2group moreover tgp is not generated by involutions when p 3 more generally we develop some aspects of a theory of tg for g a finite pgroup of class 2 for p 2 in particular we show that for such a group g there is an element of order p1 in tg and exhibit examples where sizetg p 1 and others where tg contains a large elementary abelian psubgroup | [['declaremathoperatorholholdeclaremathoperatorautautnewcommandgp0mathcalgpnewcommandsize1leftlvert', '1', 'rightrvertlet', 'g', 'be', 'a', 'group', 'and', 'sg', 'be', 'the', 'group', 'of', 'permutations', 'on', 'the', 'set', 'g', 'the', 'abstract', 'holomorph', 'of', 'g', 'is', 'the', 'natural', 'semidirect', 'product', 'autg', 'g', 'we', 'will', 'write', 'holg', 'for', 'the', 'normalizer', 'of', 'the', 'image', 'in', 'sg', 'of', 'the', 'right', 'regular', 'representation', 'of', 'g', 'beginequation', 'holg', 'n_s', 'grhog', 'autg', 'rhog', 'cong', 'autg', 'g', 'endequation', 'and', 'also', 'refer', 'to', 'it', 'as', 'the', 'holomorph', 'of', 'g', 'more', 'generally', 'if', 'n', 'is', 'any', 'regular', 'subgroup', 'of', 'sg', 'then', 'n_sgn', 'is', 'isomorphic', 'to', 'the', 'holomorph', 'of', 'n', 'gamiller', 'has', 'shown', 'that', 'the', 'group', 'beginequation', 'tg', 'n_sgholgholg', 'endequation', 'acts', 'regularly', 'on', 'the', 'set', 'of', 'the', 'regular', 'subgroups', 'n', 'of', 'sg', 'which', 'are', 'isomorphic', 'to', 'g', 'and', 'have', 'the', 'same', 'holomorph', 'as', 'g', 'in', 'the', 'sense', 'that', 'n_sgn', 'holg', 'if', 'g', 'is', 'nonabelian', 'inversion', 'on', 'g', 'yields', 'an', 'involution', 'in', 'tg', 'other', 'nonabelian', 'regular', 'subgroups', 'n', 'of', 'sg', 'having', 'the', 'same', 'holomorph', 'as', 'g', 'yield', 'other', 'involutions', 'in', 'tg', 'in', 'the', 'cases', 'studied', 'in', 'the', 'literature', 'tg', 'turns', 'out', 'to', 'be', 'a', 'finite', '2group', 'which', 'is', 'often', 'elementary', 'abelian', 'in', 'this', 'paper', 'we', 'exhibit', 'an', 'example', 'of', 'a', 'finite', 'pgroup', 'gp', 'of', 'class', '2', 'for', 'p', '2', 'a', 'prime', 'which', 'is', 'the', 'smallest', 'pgroup', 'such', 'that', 'tgp', 'is', 'nonabelian', 'and', 'not', 'a', '2group', 'moreover', 'tgp', 'is', 'not', 'generated', 'by', 'involutions', 'when', 'p', '3', 'more', 'generally', 'we', 'develop', 'some', 'aspects', 'of', 'a', 'theory', 'of', 'tg', 'for', 'g', 'a', 'finite', 'pgroup', 'of', 'class', '2', 'for', 'p', '2', 'in', 'particular', 'we', 'show', 'that', 'for', 'such', 'a', 'group', 'g', 'there', 'is', 'an', 'element', 'of', 'order', 'p1', 'in', 'tg', 'and', 'exhibit', 'examples', 'where', 'sizetg', 'p', '1', 'and', 'others', 'where', 'tg', 'contains', 'a', 'large', 'elementary', 'abelian', 'psubgroup']] | [-0.1864226974557956, 0.1793718590051336, -0.09052671407634923, 0.021682623813326477, -0.12279370520603809, -0.15103157147948704, -0.015504396455336947, 0.38797907481083893, -0.2878313647926425, -0.23306246520271592, 0.09069469130562319, -0.281970068893946, -0.10776931510764058, 0.17211858318935075, -0.11800903248784207, -0.07050429759241206, 0.020813842786707146, 0.22176358784229433, -0.034870119113645036, -0.28523619947564127, 0.30121127725238944, -0.10025249963395134, 0.17867414595773376, -0.00045083950606793384, 0.05500984715338606, -0.04020939917256036, 0.04085700082453308, 0.019728602798205847, -0.15754396966065834, 0.008727289019084542, 0.3129101181096894, 0.054025907866507225, 0.22935036097969316, -0.3388009975344813, -0.15046461553985838, 0.23268715127024556, 0.13473170929941872, -0.0521549460827373, -0.02448681866196511, -0.2321950184949504, 0.18709910954994552, -0.2183037383216739, -0.09827059445975783, -0.03341690306917146, 0.17145056199336792, -0.02459744807930976, -0.283604018577123, -0.010181586826700261, 0.149248887670913, 0.09589360463628409, 0.04633622716544672, -0.14933218424468483, -0.08118172041752314, 0.06899887533575028, -0.043316973941774535, 0.07250755877330912, 0.06215008892744345, -0.09337749031708444, -0.07616411026840839, 0.4572152272172707, -0.07309371391846628, -0.17779988591239726, 0.10105972360551058, -0.17648497511578357, -0.19401713150016364, 0.11348172501715267, 0.06125719330348346, 0.1861834954215472, -0.004930140276664246, 0.2161558907309948, -0.15685700897440097, 0.12076809106183911, 0.05236774681426626, -0.058972739332430336, 0.06674863880221481, 0.12549555028217715, 0.11931144721410067, 0.1099316722105417, 0.0503356409264239, 0.09440193277015521, -0.35308239813282216, -0.17275737681728617, -0.16131854195650802, 0.14265006397149557, -0.08627462134104695, -0.16922575682705443, 0.37919537464401476, 0.06914319762922687, 0.12805964726696376, 0.06478760503066779, 0.15799980773420555, 0.0819200961014645, 0.06224934955936496, 0.10318421840117088, 0.05691339154984806, 0.222237259463108, -0.11933737512963423, -0.19567731232169921, -0.0377303469734076, 0.1814341005260791] |
1,801.10411 | Nucleation of titanium nanoparticles in an oxygen-starved environment,
II: Theory | The nucleation and growth of pure titanium nanoparticles in a low-pressure
sputter plasma has been believed to be essentially impossible. The addition of
impurities, such as oxygen or water, facilitates this and allows the growth of
nanoparticles. However, it seems that this route requires so high oxygen
densities that metallic nanoparticles in the hexagonal aTi-phase cannot be
synthesized. Here we present a model which explains results for the nucleation
and growth of titanium nanoparticles in the absent of reactive impurities. In
these experiments, a high partial pressure of helium gas was added which
increased the cooling rate of the process gas in the region where nucleation
occurred. This is important for two reasons. First, a reduced gas temperature
enhances Ti2 dimer formation mainly because a lower gas temperature gives a
higher gas density, which reduces the dilution of the Ti vapor through
diffusion. The same effect can be achieved by increasing the gas pressure.
Second, a reduced gas temperature has a "more than exponential" effect in
lowering the rate of atom evaporation from the nanoparticles during their
growth from a dimer to size where they are thermodynamically stable, r*. We
show that this early stage evaporation is not possible to model as a
thermodynamical equilibrium. Instead, the single-event nature of the
evaporation process has to be considered. This leads, counter intuitively, to
an evaporation probability from nanoparticles that is exactly zero below a
critical nanoparticle temperature that is size-dependent. Together, the
mechanisms described above explain two experimentally found limits for
nucleation in an oxygen-free environment. First, there is a lower limit to the
pressure for dimer formation. Second, there is an upper limit to the gas
temperature above which evaporation makes the further growth to stable nuclei
impossible.
| cond-mat.mtrl-sci | the nucleation and growth of pure titanium nanoparticles in a lowpressure sputter plasma has been believed to be essentially impossible the addition of impurities such as oxygen or water facilitates this and allows the growth of nanoparticles however it seems that this route requires so high oxygen densities that metallic nanoparticles in the hexagonal atiphase cannot be synthesized here we present a model which explains results for the nucleation and growth of titanium nanoparticles in the absent of reactive impurities in these experiments a high partial pressure of helium gas was added which increased the cooling rate of the process gas in the region where nucleation occurred this is important for two reasons first a reduced gas temperature enhances ti2 dimer formation mainly because a lower gas temperature gives a higher gas density which reduces the dilution of the ti vapor through diffusion the same effect can be achieved by increasing the gas pressure second a reduced gas temperature has a more than exponential effect in lowering the rate of atom evaporation from the nanoparticles during their growth from a dimer to size where they are thermodynamically stable r we show that this early stage evaporation is not possible to model as a thermodynamical equilibrium instead the singleevent nature of the evaporation process has to be considered this leads counter intuitively to an evaporation probability from nanoparticles that is exactly zero below a critical nanoparticle temperature that is sizedependent together the mechanisms described above explain two experimentally found limits for nucleation in an oxygenfree environment first there is a lower limit to the pressure for dimer formation second there is an upper limit to the gas temperature above which evaporation makes the further growth to stable nuclei impossible | [['the', 'nucleation', 'and', 'growth', 'of', 'pure', 'titanium', 'nanoparticles', 'in', 'a', 'lowpressure', 'sputter', 'plasma', 'has', 'been', 'believed', 'to', 'be', 'essentially', 'impossible', 'the', 'addition', 'of', 'impurities', 'such', 'as', 'oxygen', 'or', 'water', 'facilitates', 'this', 'and', 'allows', 'the', 'growth', 'of', 'nanoparticles', 'however', 'it', 'seems', 'that', 'this', 'route', 'requires', 'so', 'high', 'oxygen', 'densities', 'that', 'metallic', 'nanoparticles', 'in', 'the', 'hexagonal', 'atiphase', 'can', 'not', 'be', 'synthesized', 'here', 'we', 'present', 'a', 'model', 'which', 'explains', 'results', 'for', 'the', 'nucleation', 'and', 'growth', 'of', 'titanium', 'nanoparticles', 'in', 'the', 'absent', 'of', 'reactive', 'impurities', 'in', 'these', 'experiments', 'a', 'high', 'partial', 'pressure', 'of', 'helium', 'gas', 'was', 'added', 'which', 'increased', 'the', 'cooling', 'rate', 'of', 'the', 'process', 'gas', 'in', 'the', 'region', 'where', 'nucleation', 'occurred', 'this', 'is', 'important', 'for', 'two', 'reasons', 'first', 'a', 'reduced', 'gas', 'temperature', 'enhances', 'ti2', 'dimer', 'formation', 'mainly', 'because', 'a', 'lower', 'gas', 'temperature', 'gives', 'a', 'higher', 'gas', 'density', 'which', 'reduces', 'the', 'dilution', 'of', 'the', 'ti', 'vapor', 'through', 'diffusion', 'the', 'same', 'effect', 'can', 'be', 'achieved', 'by', 'increasing', 'the', 'gas', 'pressure', 'second', 'a', 'reduced', 'gas', 'temperature', 'has', 'a', 'more', 'than', 'exponential', 'effect', 'in', 'lowering', 'the', 'rate', 'of', 'atom', 'evaporation', 'from', 'the', 'nanoparticles', 'during', 'their', 'growth', 'from', 'a', 'dimer', 'to', 'size', 'where', 'they', 'are', 'thermodynamically', 'stable', 'r', 'we', 'show', 'that', 'this', 'early', 'stage', 'evaporation', 'is', 'not', 'possible', 'to', 'model', 'as', 'a', 'thermodynamical', 'equilibrium', 'instead', 'the', 'singleevent', 'nature', 'of', 'the', 'evaporation', 'process', 'has', 'to', 'be', 'considered', 'this', 'leads', 'counter', 'intuitively', 'to', 'an', 'evaporation', 'probability', 'from', 'nanoparticles', 'that', 'is', 'exactly', 'zero', 'below', 'a', 'critical', 'nanoparticle', 'temperature', 'that', 'is', 'sizedependent', 'together', 'the', 'mechanisms', 'described', 'above', 'explain', 'two', 'experimentally', 'found', 'limits', 'for', 'nucleation', 'in', 'an', 'oxygenfree', 'environment', 'first', 'there', 'is', 'a', 'lower', 'limit', 'to', 'the', 'pressure', 'for', 'dimer', 'formation', 'second', 'there', 'is', 'an', 'upper', 'limit', 'to', 'the', 'gas', 'temperature', 'above', 'which', 'evaporation', 'makes', 'the', 'further', 'growth', 'to', 'stable', 'nuclei', 'impossible']] | [-0.06159536653730255, 0.21918539823001185, -0.07437492360622855, 0.03286470855655605, 0.006872406084666081, -0.10984329836274911, 0.08228030452179762, 0.361314771961285, -0.23432405723562827, -0.2768075249429482, 0.07549599241408739, -0.274005364802128, -0.07699786870944081, 0.1604891597730279, -0.020990522768443043, 0.003369645513000958, -0.03364936257356829, -0.002285942726302892, -0.051347762422463146, -0.2577971203265608, 0.26707107015034937, 0.11898438813740439, 0.289528274370241, 0.12887413425010485, 0.050733335516674236, -0.09638028803682472, 0.0855884185794922, 0.02095798902478742, -0.16997238811339027, 0.05404776395557241, 0.23156677360465336, 0.019190094715061907, 0.23527974904249682, -0.46372142102659886, -0.24732853342559086, 0.0865964869929788, 0.17443856711421782, 0.1597929283759893, -0.11200738113929118, -0.18027684523015827, 0.04860469808368685, -0.1560340629706237, -0.14071746711654973, -0.011148835364211764, 0.034464900155499995, -0.0151081027338983, -0.2742971719029204, 0.09771205463605132, 0.0981617595195227, 0.028608200947019213, -0.09332024685560707, -0.08180985843581665, -0.09227508986886176, 0.06077974952657112, 0.03206795215070694, 0.006753532285478691, 0.23927693651947063, -0.10547210787626682, -0.028961163508938625, 0.39245031152838944, -0.08033732988633346, -0.09876448649689944, 0.23739264202029314, -0.17962777612491562, -0.08304986813002163, 0.2457378474056087, 0.11178377564364281, 0.10730463232837589, -0.16116472042206928, 0.02863806428995809, 0.00437760054086943, 0.21431387842474375, 0.10639120048613727, -0.018691581578524265, 0.24759912352601532, 0.2291627789171697, 0.04699131487965739, 0.16699560242664624, -0.07940601757016136, -0.07782447546701911, -0.21327699617702617, -0.2119595323731321, -0.18408516317059467, 0.049170379976910934, -0.08032329432045218, -0.1811815860613327, 0.28382489172246195, 0.1316153606409595, 0.20455945866463784, -0.03842012555752364, 0.27182273887835134, 0.11839972389619409, 0.07659364523634496, 0.03166506211111179, 0.2670504464153459, 0.14682176905545122, 0.11130564576807148, -0.2606605619417274, 0.15097164617489195, 0.02432241507530206] |
1,801.10412 | SO(4; 2) and derivatively coupled dRGT massive gravity | In this paper we study the possibility of assigning a geometric structure to
the Lie groups. It is shown the Poincar\'{e} and Weyl groups have geometrical
structure of the Riemann-Cartan and Weyl space-time respectively. The geometric
approach to these groups can be carried out by considering the most general
(non)metricity conditions, or equivalently, tetrad postulates which we show
that can be written in terms of the group's gauge fields. By focusing on the
conformal group we apply this procedure to show that a nontrivial 3-metrics
geometry may be extracted from the group's Maurer-Cartan structure equations.
We systematically obtain the general characteristics of this geometry, i.e. its
most general nonmetricity conditions, tetrad postulates and its connections. We
then deal with the gravitational theory associated to the conformal group's
geometry. By proposing an Einstein-Hilbert type action, we conclude that the
resulting gravity theory has the form of quintessence where the scalar field
derivatively coupled to massive gravity building blocks.
| gr-qc hep-th math-ph math.MP | in this paper we study the possibility of assigning a geometric structure to the lie groups it is shown the poincare and weyl groups have geometrical structure of the riemanncartan and weyl spacetime respectively the geometric approach to these groups can be carried out by considering the most general nonmetricity conditions or equivalently tetrad postulates which we show that can be written in terms of the groups gauge fields by focusing on the conformal group we apply this procedure to show that a nontrivial 3metrics geometry may be extracted from the groups maurercartan structure equations we systematically obtain the general characteristics of this geometry ie its most general nonmetricity conditions tetrad postulates and its connections we then deal with the gravitational theory associated to the conformal groups geometry by proposing an einsteinhilbert type action we conclude that the resulting gravity theory has the form of quintessence where the scalar field derivatively coupled to massive gravity building blocks | [['in', 'this', 'paper', 'we', 'study', 'the', 'possibility', 'of', 'assigning', 'a', 'geometric', 'structure', 'to', 'the', 'lie', 'groups', 'it', 'is', 'shown', 'the', 'poincare', 'and', 'weyl', 'groups', 'have', 'geometrical', 'structure', 'of', 'the', 'riemanncartan', 'and', 'weyl', 'spacetime', 'respectively', 'the', 'geometric', 'approach', 'to', 'these', 'groups', 'can', 'be', 'carried', 'out', 'by', 'considering', 'the', 'most', 'general', 'nonmetricity', 'conditions', 'or', 'equivalently', 'tetrad', 'postulates', 'which', 'we', 'show', 'that', 'can', 'be', 'written', 'in', 'terms', 'of', 'the', 'groups', 'gauge', 'fields', 'by', 'focusing', 'on', 'the', 'conformal', 'group', 'we', 'apply', 'this', 'procedure', 'to', 'show', 'that', 'a', 'nontrivial', '3metrics', 'geometry', 'may', 'be', 'extracted', 'from', 'the', 'groups', 'maurercartan', 'structure', 'equations', 'we', 'systematically', 'obtain', 'the', 'general', 'characteristics', 'of', 'this', 'geometry', 'ie', 'its', 'most', 'general', 'nonmetricity', 'conditions', 'tetrad', 'postulates', 'and', 'its', 'connections', 'we', 'then', 'deal', 'with', 'the', 'gravitational', 'theory', 'associated', 'to', 'the', 'conformal', 'groups', 'geometry', 'by', 'proposing', 'an', 'einsteinhilbert', 'type', 'action', 'we', 'conclude', 'that', 'the', 'resulting', 'gravity', 'theory', 'has', 'the', 'form', 'of', 'quintessence', 'where', 'the', 'scalar', 'field', 'derivatively', 'coupled', 'to', 'massive', 'gravity', 'building', 'blocks']] | [-0.17440143960103938, 0.11281054622167795, -0.13253240639664185, 0.055802905126801056, -0.15284699747920227, -0.12655579813038279, -0.04151159858962841, 0.3353991270492411, -0.2737271341504114, -0.2729724699388122, 0.06909392992254038, -0.21442083057140707, -0.21902026796778723, 0.12216952003414036, -0.07496761286165565, -0.046054870926828424, -0.01621281673648294, 0.09398480966556699, -0.12031797959564171, -0.2733064619483201, 0.4179142712182395, 0.04773114229831251, 0.2468540756488634, -0.014027526972203287, 0.09957537853164942, -0.02011124912062126, -0.02412255101682986, 0.07134315629554971, -0.11369709771234582, 0.12150152041992042, 0.2293165446478565, 0.08611924894106616, 0.2053087654858709, -0.4385251481275839, -0.2394693781722598, 0.08468588054251329, 0.09846331416421635, 0.11353550828506898, -0.03651691154075585, -0.34839101553342905, 0.07931273188560632, -0.1607764685040067, -0.14991332529220955, -0.08598627889184815, -0.024787249564116074, -0.07972327236732717, -0.1928465969391185, 0.0511403620587128, 0.03473192632604675, 0.022459246669035808, -0.08112707051335816, -0.05018143166986644, -0.04162734355124983, 0.09237308135985806, 0.08268722610334588, 0.006878935015659518, 0.13576323482664718, -0.1154060716114962, -0.1090334540887018, 0.4126239332376392, -0.054417172648534656, -0.2818320415836943, 0.1484652896260451, -0.1529355963104802, -0.1817844858553237, 0.04647531010400338, 0.14042113075376886, 0.15460241252592036, -0.15802174058385418, 0.16822517833970546, -0.04659786868757408, 0.09803684508416113, 0.08487917176169005, 0.012635738815397476, 0.25610634846506036, 0.05379455745558308, 0.025459263694715822, 0.12370341653849598, 0.01314941195253532, -0.07212146548079743, -0.3746944292430665, -0.1823583799710936, -0.10345104058305762, 0.09782770131922262, -0.14063044077730485, -0.1390392730154533, 0.3936396168150411, 0.12103625166709653, 0.12275264233611761, 0.053180008703267355, 0.19399213963514492, 0.10584163403651635, 0.11304948168100824, 0.07378470144904913, 0.25120869470140333, 0.207069366433284, 0.02063206950896627, -0.19732217099606564, -0.07440688779909804, 0.1319422721225104] |
1,801.10413 | Non-rational varieties with the Hilbert Property | A variety $X/k$ is said to have the Hilbert Property if $X(k)$ is not thin.
We shall describe some examples of varieties, for which the Hilbert Property is
a new result. We give a criterion for determining when the Hilbert Property for
a variety $X$ implies the Hilbert Property for quotients $X/G$ of the variety
by an action of a finite group. In the case of linear actions of the group $G$,
this gives examples of (non-rational) unirational varieties with the Hilbert
Property, providing positive examples to a conjecture by Colliot-Th\'el\`ene
and Sansuc. We focus then on the study of the Hilbert Property for K3 surfaces
that have two elliptic fibrations, in particular on diagonal quartic surfaces,
i.e. varieties of the form $ax^4+by^4+cz^4+dw^4=0$. We then show, through an
explicit application, how one may use the criterion above to provide other
examples of K3 surfaces with the Hilbert Property. Since the Hilbert Property
is related to an abudance of rational points, K3 surfaces should
(conjecturally) represent a limiting case in dimension 2.
| math.AG | a variety xk is said to have the hilbert property if xk is not thin we shall describe some examples of varieties for which the hilbert property is a new result we give a criterion for determining when the hilbert property for a variety x implies the hilbert property for quotients xg of the variety by an action of a finite group in the case of linear actions of the group g this gives examples of nonrational unirational varieties with the hilbert property providing positive examples to a conjecture by colliotthelene and sansuc we focus then on the study of the hilbert property for k3 surfaces that have two elliptic fibrations in particular on diagonal quartic surfaces ie varieties of the form ax4by4cz4dw40 we then show through an explicit application how one may use the criterion above to provide other examples of k3 surfaces with the hilbert property since the hilbert property is related to an abudance of rational points k3 surfaces should conjecturally represent a limiting case in dimension 2 | [['a', 'variety', 'xk', 'is', 'said', 'to', 'have', 'the', 'hilbert', 'property', 'if', 'xk', 'is', 'not', 'thin', 'we', 'shall', 'describe', 'some', 'examples', 'of', 'varieties', 'for', 'which', 'the', 'hilbert', 'property', 'is', 'a', 'new', 'result', 'we', 'give', 'a', 'criterion', 'for', 'determining', 'when', 'the', 'hilbert', 'property', 'for', 'a', 'variety', 'x', 'implies', 'the', 'hilbert', 'property', 'for', 'quotients', 'xg', 'of', 'the', 'variety', 'by', 'an', 'action', 'of', 'a', 'finite', 'group', 'in', 'the', 'case', 'of', 'linear', 'actions', 'of', 'the', 'group', 'g', 'this', 'gives', 'examples', 'of', 'nonrational', 'unirational', 'varieties', 'with', 'the', 'hilbert', 'property', 'providing', 'positive', 'examples', 'to', 'a', 'conjecture', 'by', 'colliotthelene', 'and', 'sansuc', 'we', 'focus', 'then', 'on', 'the', 'study', 'of', 'the', 'hilbert', 'property', 'for', 'k3', 'surfaces', 'that', 'have', 'two', 'elliptic', 'fibrations', 'in', 'particular', 'on', 'diagonal', 'quartic', 'surfaces', 'ie', 'varieties', 'of', 'the', 'form', 'ax4by4cz4dw40', 'we', 'then', 'show', 'through', 'an', 'explicit', 'application', 'how', 'one', 'may', 'use', 'the', 'criterion', 'above', 'to', 'provide', 'other', 'examples', 'of', 'k3', 'surfaces', 'with', 'the', 'hilbert', 'property', 'since', 'the', 'hilbert', 'property', 'is', 'related', 'to', 'an', 'abudance', 'of', 'rational', 'points', 'k3', 'surfaces', 'should', 'conjecturally', 'represent', 'a', 'limiting', 'case', 'in', 'dimension', '2']] | [-0.16105899775181623, 0.07130785105597598, -0.13191395380589016, 0.06318432304063154, -0.0934599855394267, -0.15914988353684106, -0.024188896509654383, 0.3420163926668465, -0.3124676075654433, -0.17674484080087174, 0.10594472875613171, -0.26153148701003587, -0.1669142333776964, 0.2575795615475406, -0.1571853900787092, -0.0033084585988784536, 0.01619196943748273, 0.08050067291256068, -0.09934832625611521, -0.36747599730596825, 0.4453000098850359, -0.037649611057713625, 0.22229429510805537, 0.10235163949649123, 0.12277462442999583, 0.007734523094533121, 0.046611678989275415, -0.04121707253541578, -0.1402900261875081, 0.108646730413003, 0.3271271287189687, 0.07382010335020502, 0.24394069918266992, -0.3768475685049506, -0.1797058053294142, 0.2134131886092398, 0.10329070606898955, 0.0318640644518275, -0.04692541317986872, -0.215452149478883, 0.08835779247695909, -0.13466945775401065, -0.20592674854594994, -0.1309241412933368, 0.05055408231256639, -0.01736708268221906, -0.23744173498228466, -0.05566442330532214, 0.13009785847902736, 0.13626785442671355, -0.0357596036971218, -0.07431397014845381, -0.06920619065572015, 0.04779271751467604, 0.008046688761233408, 0.01598680358421167, 0.0349556623300647, -0.10993154982844477, -0.08879452615099795, 0.3759719444192289, -0.05756975622190272, -0.25721816078704945, 0.1397094627650564, -0.14713665493490063, -0.1528132291551789, 0.1279038341825499, 0.11827957318164409, 0.17724172670996802, -0.026926016631306778, 0.18216587075491106, -0.15701496349099806, 0.07261789428508457, 0.05478992075796294, 0.022177172693259577, 0.09920039656709004, 0.07223650489331168, 0.08717091445372824, 0.14173118330791648, -0.012999870608944227, -0.0316935493829934, -0.37511925795937284, -0.23013531402958667, -0.13373980038278901, 0.15330611177975215, -0.10377886095349609, -0.173997778455583, 0.3893169773208416, 0.04839213117614717, 0.22678385540322565, 0.09551628338351079, 0.18341815598199473, 0.05857414171400973, 0.021977507369592787, 0.035877761326949385, 0.1470695636325913, 0.1760725788416012, -0.06272126522783177, -0.11728808751658482, 0.011316970116732751, 0.21841669191935045] |
1,801.10414 | DQM4HEP - A Generic Online Monitor for Particle Physics Experiments | There is currently a lot of activity in R\&D for future collider experiments.
Multiple detector prototypes are being tested, each one with slightly different
requirements regarding the format of the data to be analysed. This has
generated a variety of ad-hoc solutions for data acquisition and online data
monitoring. We present a generic C++11 online monitoring framework called
DQM4HEP, which is designed for use as a generic online monitor for particle
physics experiments, ranging from small tabletop experiments to large
multi-detector testbeams, such as those currently ongoing/planned at the DESY
II or CERN SPS beamlines. We present results obtained using DQM4HEP at several
testbeams where the CALICE AHCAL, SDHCAL and SiWECAL detector prototypes have
been tested. During these testbeams, online analysis using DQM4HEP\'s framework
has been developed and used. We also present the currently ongoing work to
integrate DQM4HEP within the EUDAQ tool. EUDAQ is a tool for common and generic
data acquisition within the AIDA-2020 collaboration. This will allow these two
frameworks to work together as a generic and complete DAQ and monitoring system
for any type of detector prototype tested on beam tests, which is one of the
goals of the AIDA-2020 project.
| physics.ins-det | there is currently a lot of activity in rd for future collider experiments multiple detector prototypes are being tested each one with slightly different requirements regarding the format of the data to be analysed this has generated a variety of adhoc solutions for data acquisition and online data monitoring we present a generic c11 online monitoring framework called dqm4hep which is designed for use as a generic online monitor for particle physics experiments ranging from small tabletop experiments to large multidetector testbeams such as those currently ongoingplanned at the desy ii or cern sps beamlines we present results obtained using dqm4hep at several testbeams where the calice ahcal sdhcal and siwecal detector prototypes have been tested during these testbeams online analysis using dqm4heps framework has been developed and used we also present the currently ongoing work to integrate dqm4hep within the eudaq tool eudaq is a tool for common and generic data acquisition within the aida2020 collaboration this will allow these two frameworks to work together as a generic and complete daq and monitoring system for any type of detector prototype tested on beam tests which is one of the goals of the aida2020 project | [['there', 'is', 'currently', 'a', 'lot', 'of', 'activity', 'in', 'rd', 'for', 'future', 'collider', 'experiments', 'multiple', 'detector', 'prototypes', 'are', 'being', 'tested', 'each', 'one', 'with', 'slightly', 'different', 'requirements', 'regarding', 'the', 'format', 'of', 'the', 'data', 'to', 'be', 'analysed', 'this', 'has', 'generated', 'a', 'variety', 'of', 'adhoc', 'solutions', 'for', 'data', 'acquisition', 'and', 'online', 'data', 'monitoring', 'we', 'present', 'a', 'generic', 'c11', 'online', 'monitoring', 'framework', 'called', 'dqm4hep', 'which', 'is', 'designed', 'for', 'use', 'as', 'a', 'generic', 'online', 'monitor', 'for', 'particle', 'physics', 'experiments', 'ranging', 'from', 'small', 'tabletop', 'experiments', 'to', 'large', 'multidetector', 'testbeams', 'such', 'as', 'those', 'currently', 'ongoingplanned', 'at', 'the', 'desy', 'ii', 'or', 'cern', 'sps', 'beamlines', 'we', 'present', 'results', 'obtained', 'using', 'dqm4hep', 'at', 'several', 'testbeams', 'where', 'the', 'calice', 'ahcal', 'sdhcal', 'and', 'siwecal', 'detector', 'prototypes', 'have', 'been', 'tested', 'during', 'these', 'testbeams', 'online', 'analysis', 'using', 'dqm4heps', 'framework', 'has', 'been', 'developed', 'and', 'used', 'we', 'also', 'present', 'the', 'currently', 'ongoing', 'work', 'to', 'integrate', 'dqm4hep', 'within', 'the', 'eudaq', 'tool', 'eudaq', 'is', 'a', 'tool', 'for', 'common', 'and', 'generic', 'data', 'acquisition', 'within', 'the', 'aida2020', 'collaboration', 'this', 'will', 'allow', 'these', 'two', 'frameworks', 'to', 'work', 'together', 'as', 'a', 'generic', 'and', 'complete', 'daq', 'and', 'monitoring', 'system', 'for', 'any', 'type', 'of', 'detector', 'prototype', 'tested', 'on', 'beam', 'tests', 'which', 'is', 'one', 'of', 'the', 'goals', 'of', 'the', 'aida2020', 'project']] | [-0.044599912504525614, 0.08741554795701655, -0.08459513835184315, 0.032511956104284895, -0.06871877739765715, -0.18115643849548127, -0.04006477853722407, 0.3756277142357988, -0.17830736298895794, -0.33367105265789776, 0.191493155796339, -0.3010676156179352, -0.0575253589315837, 0.27003003966721945, 0.0008056294028237076, 0.1339971266923366, 0.11973263444909778, -0.001068242760423397, -0.020053602105436046, -0.20432617591568533, 0.2727316338182885, 0.12473983193598108, 0.292055781863128, 0.049313210718179304, 0.1338350473603938, 0.005212011570629659, -0.06095722673968726, 0.0058995166991311345, -0.09385454903674612, 0.10513566871694835, 0.34273624009756765, 0.2080842811418842, 0.2484037069328747, -0.4300577605403767, -0.1554858603905597, 0.08516065878648832, 0.09594580191676143, 0.055388811033537586, -0.12286252814038642, -0.3078990694560072, 0.1142348406623465, -0.21654837506635047, -0.1244855854392457, -0.06548608579779035, -0.02354962809763516, 0.025185858010473648, -0.27708024416876464, -0.07192329525084408, -0.03838250194820986, 0.10135852717529076, -0.027131568147062562, -0.11898065186310752, 0.0650436166007979, 0.11979395699918927, 0.0037196895826627245, 0.059386427329679456, 0.12144931162335944, -0.07956854995808182, -0.14274196808076817, 0.3608636762235082, -0.03130402477365228, -0.13821666002263908, 0.22654378984016102, -0.10490932366436763, -0.18054596484045213, 0.08509564377521912, 0.25175528603465985, 0.08911359873045371, -0.24696225302844005, 0.0500270994965209, -0.010438857721333716, 0.16327297535346136, 0.03765618147381577, 0.0013728558225798483, 0.18307303683379897, 0.2868548475997281, 0.014002294669596122, 0.11652189156660626, -0.12219595229928744, -0.024481784091650756, -0.3104638895559742, -0.12272387131363385, -0.1342783861352044, -0.028836101637758106, 0.016863272241117683, -0.09001848754748085, 0.3959868141254555, 0.13290328782659816, 0.1287457095241956, -0.002277287821058628, 0.3144900177489638, 0.0011096996878915578, 0.12352253770931633, 0.038379175405345564, 0.24311446480530222, 0.007557102347545596, 0.1668237803330153, -0.13765623471989186, 0.05292197678074086, 0.002121033677783037] |
1,801.10415 | Renormalization of QCD in the interpolating momentum subtraction scheme
at three loops | We introduce a more general set of kinematic renormalization schemes than the
original momentum (MOM) subtraction schemes of Celmaster and Gonsalves. These
new schemes will depend on a parameter $\omega$ which tags the external
momentum of one of the legs of the $3$-point vertex functions in Quantum
Chromodynamics (QCD). In each of the three new schemes we renormalize QCD in
the Landau and maximal abelian gauges and establish the three loop
renormalization group functions in each gauge. As an application we evaluate
two critical exponents at the Banks-Zaks fixed point and demonstrate that their
values appear to be numerically scheme independent in a subrange of the
conformal window.
| hep-th hep-ph | we introduce a more general set of kinematic renormalization schemes than the original momentum mom subtraction schemes of celmaster and gonsalves these new schemes will depend on a parameter omega which tags the external momentum of one of the legs of the 3point vertex functions in quantum chromodynamics qcd in each of the three new schemes we renormalize qcd in the landau and maximal abelian gauges and establish the three loop renormalization group functions in each gauge as an application we evaluate two critical exponents at the bankszaks fixed point and demonstrate that their values appear to be numerically scheme independent in a subrange of the conformal window | [['we', 'introduce', 'a', 'more', 'general', 'set', 'of', 'kinematic', 'renormalization', 'schemes', 'than', 'the', 'original', 'momentum', 'mom', 'subtraction', 'schemes', 'of', 'celmaster', 'and', 'gonsalves', 'these', 'new', 'schemes', 'will', 'depend', 'on', 'a', 'parameter', 'omega', 'which', 'tags', 'the', 'external', 'momentum', 'of', 'one', 'of', 'the', 'legs', 'of', 'the', '3point', 'vertex', 'functions', 'in', 'quantum', 'chromodynamics', 'qcd', 'in', 'each', 'of', 'the', 'three', 'new', 'schemes', 'we', 'renormalize', 'qcd', 'in', 'the', 'landau', 'and', 'maximal', 'abelian', 'gauges', 'and', 'establish', 'the', 'three', 'loop', 'renormalization', 'group', 'functions', 'in', 'each', 'gauge', 'as', 'an', 'application', 'we', 'evaluate', 'two', 'critical', 'exponents', 'at', 'the', 'bankszaks', 'fixed', 'point', 'and', 'demonstrate', 'that', 'their', 'values', 'appear', 'to', 'be', 'numerically', 'scheme', 'independent', 'in', 'a', 'subrange', 'of', 'the', 'conformal', 'window']] | [-0.17612247169341166, 0.17036831491592844, -0.12026976987598809, 0.07338703722106638, -0.05177947077080952, -0.1360590967793811, 0.06442267675151082, 0.37281866305770733, -0.20797497708419407, -0.1963138785213232, 0.041476112832444616, -0.24865431728324405, -0.09881470369657984, 0.17978311844786662, -0.006025492524107297, 0.07067724053774362, -0.016174833469213574, 0.034122211845695145, -0.13158586162090716, -0.275123527780158, 0.388976592708517, -0.02644944480400429, 0.2688997134100646, 0.08589231635064438, 0.12504487852048543, 0.00941700021158559, -0.08231867783426962, 0.005818839723899684, -0.13836414877712538, 0.050864007613940714, 0.23122625679415823, 0.015503791793014022, 0.24514326091027921, -0.3454172467571442, -0.1602410108057989, 0.07343538714296839, 0.14990335570096416, 0.11952693668232921, 0.018785747908960156, -0.23781795242663334, 0.0935512269821225, -0.20442242630653912, -0.13637272472368311, -0.1018373857907675, -0.047772591235116124, -0.008557246653018174, -0.26705166417243026, 0.034945457151884005, -0.04615667946119276, 0.03848989645969899, -0.016276345355436206, -0.1372613698336796, -0.02371503127074835, 0.13617874904001062, 0.04033718452168008, 0.06077736660544933, 0.1344078897188107, -0.17943227939738587, -0.1778602996664294, 0.40433930140419827, -0.03490037957696283, -0.2589535277198862, 0.14009882888273784, -0.1643575383350253, -0.16510593729024683, 0.08048895033749028, 0.14014897128153178, 0.150155302572616, -0.11855135319961442, 0.12363328699979724, -0.02885124963466768, 0.11774406333036798, 0.08546395154014506, 0.08084901961491495, 0.13450457994972734, 0.06453120767266093, 0.08588459168634101, 0.1126847505274108, -0.03952660332476996, -0.10717438083331755, -0.40661948136295434, -0.1283889201435226, -0.13609420121819885, 0.016633082638253218, -0.1814210044594128, -0.1734958987907265, 0.4200459879132015, 0.16660953685910768, 0.20050334373351048, 0.0364895497601807, 0.28960149586028244, 0.13905491884940635, 0.101994082954156, 0.0986730205843708, 0.20823987174986136, 0.10764243691853524, 0.04605298255531428, -0.26051455947863694, -0.08674667473436178, 0.17911013761638767] |
1,801.10416 | Hardness, Approximability, and Fixed-Parameter Tractability of the
Clustered Shortest-Path Tree Problem | Given an $n$-vertex non-negatively real-weighted graph $G$, whose vertices
are partitioned into a set of $k$ clusters, a \emph{clustered network design
problem} on $G$ consists of solving a given network design optimization problem
on $G$, subject to some additional constraint on its clusters.
In particular, we focus on the classic problem of designing a
\emph{single-source shortest-path tree}, and we analyze its computational
hardness when in a feasible solution each cluster is required to form a
subtree. We first study the \emph{unweighted} case, and prove that the problem
is \np-hard. However, on the positive side, we show the existence of an
approximation algorithm whose quality essentially depends on few parameters,
but which remarkably is an $O(1)$-approximation when the largest out of all the
\emph{diameters} of the clusters is either $O(1)$ or $\Theta(n)$. Furthermore,
we also show that the problem is \emph{fixed-parameter tractable} with respect
to $k$ or to the number of vertices that belong to clusters of size at least 2.
Then, we focus on the \emph{weighted} case, and show that the problem can be
approximated within a tight factor of $O(n)$, and that it is fixed-parameter
tractable as well. Finally, we analyze the unweighted \emph{single-pair
shortest path problem}, and we show it is hard to approximate within a (tight)
factor of $n^{1-\epsilon}$, for any $\epsilon>0$.
| cs.DS cs.CC cs.NI | given an nvertex nonnegatively realweighted graph g whose vertices are partitioned into a set of k clusters a emphclustered network design problem on g consists of solving a given network design optimization problem on g subject to some additional constraint on its clusters in particular we focus on the classic problem of designing a emphsinglesource shortestpath tree and we analyze its computational hardness when in a feasible solution each cluster is required to form a subtree we first study the emphunweighted case and prove that the problem is nphard however on the positive side we show the existence of an approximation algorithm whose quality essentially depends on few parameters but which remarkably is an o1approximation when the largest out of all the emphdiameters of the clusters is either o1 or thetan furthermore we also show that the problem is emphfixedparameter tractable with respect to k or to the number of vertices that belong to clusters of size at least 2 then we focus on the emphweighted case and show that the problem can be approximated within a tight factor of on and that it is fixedparameter tractable as well finally we analyze the unweighted emphsinglepair shortest path problem and we show it is hard to approximate within a tight factor of n1epsilon for any epsilon0 | [['given', 'an', 'nvertex', 'nonnegatively', 'realweighted', 'graph', 'g', 'whose', 'vertices', 'are', 'partitioned', 'into', 'a', 'set', 'of', 'k', 'clusters', 'a', 'emphclustered', 'network', 'design', 'problem', 'on', 'g', 'consists', 'of', 'solving', 'a', 'given', 'network', 'design', 'optimization', 'problem', 'on', 'g', 'subject', 'to', 'some', 'additional', 'constraint', 'on', 'its', 'clusters', 'in', 'particular', 'we', 'focus', 'on', 'the', 'classic', 'problem', 'of', 'designing', 'a', 'emphsinglesource', 'shortestpath', 'tree', 'and', 'we', 'analyze', 'its', 'computational', 'hardness', 'when', 'in', 'a', 'feasible', 'solution', 'each', 'cluster', 'is', 'required', 'to', 'form', 'a', 'subtree', 'we', 'first', 'study', 'the', 'emphunweighted', 'case', 'and', 'prove', 'that', 'the', 'problem', 'is', 'nphard', 'however', 'on', 'the', 'positive', 'side', 'we', 'show', 'the', 'existence', 'of', 'an', 'approximation', 'algorithm', 'whose', 'quality', 'essentially', 'depends', 'on', 'few', 'parameters', 'but', 'which', 'remarkably', 'is', 'an', 'o1approximation', 'when', 'the', 'largest', 'out', 'of', 'all', 'the', 'emphdiameters', 'of', 'the', 'clusters', 'is', 'either', 'o1', 'or', 'thetan', 'furthermore', 'we', 'also', 'show', 'that', 'the', 'problem', 'is', 'emphfixedparameter', 'tractable', 'with', 'respect', 'to', 'k', 'or', 'to', 'the', 'number', 'of', 'vertices', 'that', 'belong', 'to', 'clusters', 'of', 'size', 'at', 'least', '2', 'then', 'we', 'focus', 'on', 'the', 'emphweighted', 'case', 'and', 'show', 'that', 'the', 'problem', 'can', 'be', 'approximated', 'within', 'a', 'tight', 'factor', 'of', 'on', 'and', 'that', 'it', 'is', 'fixedparameter', 'tractable', 'as', 'well', 'finally', 'we', 'analyze', 'the', 'unweighted', 'emphsinglepair', 'shortest', 'path', 'problem', 'and', 'we', 'show', 'it', 'is', 'hard', 'to', 'approximate', 'within', 'a', 'tight', 'factor', 'of', 'n1epsilon', 'for', 'any', 'epsilon0']] | [-0.1529047993255586, 0.04944068860483108, -0.04283512623009782, 0.04332475521753296, -0.09723855425792588, -0.13574007396884966, 0.09592067004062833, 0.42437393317122085, -0.2938960566721365, -0.32094378923730404, 0.11432009488882339, -0.28619283293417813, -0.15898453222504236, 0.1741179132719858, -0.05928229540915949, 0.027159928382972348, 0.09684588133471685, 0.11338270119092655, -0.017902006731228024, -0.2949887640887645, 0.31207312332062087, 0.0040390719461940085, 0.190370487547831, 0.07167147752419246, 0.10797458506663735, 0.008375611414864906, 0.03453941123542499, 0.09665150056924794, -0.1493917257151413, 0.08513267947534398, 0.22012080480168872, 0.17242802292842171, 0.2940171532297753, -0.39128330567816516, -0.14413212536271872, 0.17091708788802004, 0.14564875645325784, 0.06670331972912569, 0.006509031352525542, -0.19787453268413027, 0.14241607534866077, -0.0863843578054517, -0.07150707133158268, 0.002857905729093923, 0.057349867024555044, -0.02227703593879991, -0.2810272928854486, -0.00034435554245543964, 0.06727057150268559, -0.042666083412631506, -0.03335605914932939, -0.1518230460845549, 0.02947385590479551, 0.09877186684423338, -0.01511747915150031, 0.07463365149758931, 0.04945056251346854, -0.11489866123719246, -0.1056903611494114, 0.40793066563190156, -0.023574650144305535, -0.19747129753275933, 0.13908314665797045, -0.08719687328129164, -0.190855609905414, 0.1043461670721266, 0.18887464748915145, 0.1791140182637873, -0.111364829158361, 0.11784797039773658, -0.11558775663077128, 0.19154752114620763, 0.07251885787030365, -0.01695150039641995, 0.12278568086133779, 0.1930765154362955, 0.18777640456913636, 0.19856906460734294, -0.014887737032280848, -0.036388628871755604, -0.2820923918383723, -0.10090368719912081, -0.22197143039457448, 0.039794540915743644, -0.144942148722242, -0.18879971256093034, 0.3640796072959004, 0.11047649141928216, 0.21720866003196757, 0.12701033270436796, 0.2656203741251649, 0.11644110415370548, 0.02438891739233063, 0.17080950667809272, 0.1681589401654629, 0.09211701661554815, -0.03215733370502075, -0.21548955269895917, 0.07898564733244162, 0.07917783219578131] |
1,801.10417 | Multilayer Network Planning - A Practical Perspective | The paper presents a pragmatic and practical multilayer network planning
approach based on a candidate lightpath auxiliary graph model. The paper
discusses, how this approach can be applied to offline network planning as well
as dynamic planning and provisioning of services.
| cs.NI | the paper presents a pragmatic and practical multilayer network planning approach based on a candidate lightpath auxiliary graph model the paper discusses how this approach can be applied to offline network planning as well as dynamic planning and provisioning of services | [['the', 'paper', 'presents', 'a', 'pragmatic', 'and', 'practical', 'multilayer', 'network', 'planning', 'approach', 'based', 'on', 'a', 'candidate', 'lightpath', 'auxiliary', 'graph', 'model', 'the', 'paper', 'discusses', 'how', 'this', 'approach', 'can', 'be', 'applied', 'to', 'offline', 'network', 'planning', 'as', 'well', 'as', 'dynamic', 'planning', 'and', 'provisioning', 'of', 'services']] | [-0.10326467379473331, -0.03192272650577673, -0.0833358355775112, 0.03574816901634288, -0.18224862267876543, -0.15688125936814198, 0.08522264301072716, 0.45355239401503306, -0.28500791530056696, -0.36512815534341625, 0.13514173591918335, -0.1702810929315846, -0.28033270414282635, 0.16841500038394658, -0.16562244100723325, 0.12226334996748625, 0.1304122574354817, 0.02105851540705416, 0.02275087754810002, -0.20102610856240682, 0.2910256206580415, 0.0748000445934694, 0.34595845916830914, 0.08937773696237766, 0.12043019041146447, 0.07370341042192971, -0.008425068144300362, 0.0550421399984327, -0.07276078127324581, 0.19768432748117826, 0.38439972480622736, 0.2455050491773319, 0.3450468317946283, -0.45745778374555635, -0.2399529070116398, 0.05018714131651128, 0.17748546735497145, 0.06324119591040582, 0.020509343773194747, -0.3228111371579694, 0.04762222131759655, -0.276470181146046, -0.04039649965196121, -0.13940549369265393, -0.05535466963334418, -0.004594169170936433, -0.2993548636938014, -0.045557090694584496, 0.022943426653311203, 0.020369004049315687, -0.06894071061709305, -0.09571533027763773, 0.031651600576346604, 0.14202154778716405, -0.003940355535255882, 0.07275636663387824, 0.14765322067570397, -0.11570052958729608, -0.23210415648432767, 0.4521431970160182, 0.009373129141039965, -0.18007286270887296, 0.11779903826621793, 0.10717813061868273, -0.16559150553785446, 0.007321039328306187, 0.32460690310179463, 0.15176254016824248, -0.27997903602209123, 0.021895185041968232, -0.013925981730586144, 0.10355424990014332, -0.007805415156592683, 0.003957565964722052, 0.1904546192551895, 0.37048801416304056, 0.13536656650192128, 0.19739318245783358, -0.07511707878580726, -0.09530802161955251, -0.24291379999641965, -0.11945664941719393, -0.18287526988765088, -0.010504405035512386, -0.08500316359667766, -0.16197671968399024, 0.4152251087674281, 0.25388508095837586, 0.12216167215282019, 0.08167717855696272, 0.4110331684805271, 0.06280779223548384, 0.02272514040332015, 0.09630183302002346, 0.12174883400794209, -0.02796387168147215, 0.2215558992494352, -0.14457861038788064, 0.11897395454097266, 0.049398163583402224] |
1,801.10418 | Extremal values of the Sackin tree balance index | Tree balance plays an important role in different research areas like
theoretical computer science and mathematical phylogenetics. For example, it
has long been known that under the Yule model, a pure birth process, imbalanced
trees are more likely than balanced ones. Also, concerning ordered search
trees, more balanced ones allow for more efficient data structuring than
imbalanced ones. Therefore, different methods to measure the balance of trees
were introduced. The Sackin index is one of the most frequently used measures
for this purpose. In many contexts, statements about the minimal and maximal
values of this index have been discussed, but formal proofs have only been
provided for some of them, and only in the context of ordered binary (search)
trees, not for general rooted trees. Moreover, while the number of trees with
maximal Sackin index as well as the number of trees with minimal Sackin index
when the number of leaves is a power of 2 are relatively easy to understand,
the number of trees with minimal Sackin index for all other numbers of leaves
has been completely unknown. In this manuscript, we extend the findings on
trees with minimal and maximal Sackin indices from the literature on ordered
trees and subsequently use our results to provide formulas to explicitly
calculate the numbers of such trees. We also extend previous studies by
analyzing the case when the underlying trees need not be binary. Finally, we
use our results to contribute both to the phylogenetic as well as the computer
scientific literature by using the new findings on Sackin minimal and maximal
trees in order to derive formulas to calculate the number of both minimal and
maximal phylogenetic trees as well as minimal and maximal ordered trees both in
the binary and non-binary settings. All our results have been implemented in
the Mathematica package SackinMinimizer, which has been made publicly
available.
| q-bio.PE math.CO | tree balance plays an important role in different research areas like theoretical computer science and mathematical phylogenetics for example it has long been known that under the yule model a pure birth process imbalanced trees are more likely than balanced ones also concerning ordered search trees more balanced ones allow for more efficient data structuring than imbalanced ones therefore different methods to measure the balance of trees were introduced the sackin index is one of the most frequently used measures for this purpose in many contexts statements about the minimal and maximal values of this index have been discussed but formal proofs have only been provided for some of them and only in the context of ordered binary search trees not for general rooted trees moreover while the number of trees with maximal sackin index as well as the number of trees with minimal sackin index when the number of leaves is a power of 2 are relatively easy to understand the number of trees with minimal sackin index for all other numbers of leaves has been completely unknown in this manuscript we extend the findings on trees with minimal and maximal sackin indices from the literature on ordered trees and subsequently use our results to provide formulas to explicitly calculate the numbers of such trees we also extend previous studies by analyzing the case when the underlying trees need not be binary finally we use our results to contribute both to the phylogenetic as well as the computer scientific literature by using the new findings on sackin minimal and maximal trees in order to derive formulas to calculate the number of both minimal and maximal phylogenetic trees as well as minimal and maximal ordered trees both in the binary and nonbinary settings all our results have been implemented in the mathematica package sackinminimizer which has been made publicly available | [['tree', 'balance', 'plays', 'an', 'important', 'role', 'in', 'different', 'research', 'areas', 'like', 'theoretical', 'computer', 'science', 'and', 'mathematical', 'phylogenetics', 'for', 'example', 'it', 'has', 'long', 'been', 'known', 'that', 'under', 'the', 'yule', 'model', 'a', 'pure', 'birth', 'process', 'imbalanced', 'trees', 'are', 'more', 'likely', 'than', 'balanced', 'ones', 'also', 'concerning', 'ordered', 'search', 'trees', 'more', 'balanced', 'ones', 'allow', 'for', 'more', 'efficient', 'data', 'structuring', 'than', 'imbalanced', 'ones', 'therefore', 'different', 'methods', 'to', 'measure', 'the', 'balance', 'of', 'trees', 'were', 'introduced', 'the', 'sackin', 'index', 'is', 'one', 'of', 'the', 'most', 'frequently', 'used', 'measures', 'for', 'this', 'purpose', 'in', 'many', 'contexts', 'statements', 'about', 'the', 'minimal', 'and', 'maximal', 'values', 'of', 'this', 'index', 'have', 'been', 'discussed', 'but', 'formal', 'proofs', 'have', 'only', 'been', 'provided', 'for', 'some', 'of', 'them', 'and', 'only', 'in', 'the', 'context', 'of', 'ordered', 'binary', 'search', 'trees', 'not', 'for', 'general', 'rooted', 'trees', 'moreover', 'while', 'the', 'number', 'of', 'trees', 'with', 'maximal', 'sackin', 'index', 'as', 'well', 'as', 'the', 'number', 'of', 'trees', 'with', 'minimal', 'sackin', 'index', 'when', 'the', 'number', 'of', 'leaves', 'is', 'a', 'power', 'of', '2', 'are', 'relatively', 'easy', 'to', 'understand', 'the', 'number', 'of', 'trees', 'with', 'minimal', 'sackin', 'index', 'for', 'all', 'other', 'numbers', 'of', 'leaves', 'has', 'been', 'completely', 'unknown', 'in', 'this', 'manuscript', 'we', 'extend', 'the', 'findings', 'on', 'trees', 'with', 'minimal', 'and', 'maximal', 'sackin', 'indices', 'from', 'the', 'literature', 'on', 'ordered', 'trees', 'and', 'subsequently', 'use', 'our', 'results', 'to', 'provide', 'formulas', 'to', 'explicitly', 'calculate', 'the', 'numbers', 'of', 'such', 'trees', 'we', 'also', 'extend', 'previous', 'studies', 'by', 'analyzing', 'the', 'case', 'when', 'the', 'underlying', 'trees', 'need', 'not', 'be', 'binary', 'finally', 'we', 'use', 'our', 'results', 'to', 'contribute', 'both', 'to', 'the', 'phylogenetic', 'as', 'well', 'as', 'the', 'computer', 'scientific', 'literature', 'by', 'using', 'the', 'new', 'findings', 'on', 'sackin', 'minimal', 'and', 'maximal', 'trees', 'in', 'order', 'to', 'derive', 'formulas', 'to', 'calculate', 'the', 'number', 'of', 'both', 'minimal', 'and', 'maximal', 'phylogenetic', 'trees', 'as', 'well', 'as', 'minimal', 'and', 'maximal', 'ordered', 'trees', 'both', 'in', 'the', 'binary', 'and', 'nonbinary', 'settings', 'all', 'our', 'results', 'have', 'been', 'implemented', 'in', 'the', 'mathematica', 'package', 'sackinminimizer', 'which', 'has', 'been', 'made', 'publicly', 'available']] | [-0.06004428126774638, 0.1440155766795568, -0.04598741170808576, 0.12083428188416175, -0.10838830767615328, -0.12009760094384593, 0.05964569267771632, 0.3732262109285733, -0.23540526706971, -0.34767115918443237, 0.152141036143644, -0.28072211042221357, -0.15031944784640205, 0.24544506459884965, -0.07765723426001596, 0.06751996901457637, 0.06412093533793747, 0.0721714165376109, -0.0023675113197749115, -0.28573780961057416, 0.30555228248139105, 0.07699819865808324, 0.26253863541608297, 0.033638789248238335, 0.05710897900346474, 0.020971439646566014, -0.0854830103007094, 0.052633117139942245, -0.15734078494457904, 0.12190168709561988, 0.29362534567288767, 0.17417639002963467, 0.21501490107849, -0.39506526667516206, -0.21553869973446174, 0.16875511476307395, 0.13952919136895572, 0.12033997668129691, -0.025410965550267048, -0.1964492440320895, 0.1195537751856257, -0.1887728385875924, -0.09621300497378636, -0.07812006526527185, 0.05990497828205041, 0.03129433336291721, -0.2126617839222346, 0.012697659440046255, 0.08013684188451281, 0.07320266588618166, -0.003568975578143614, -0.18465105422266118, -0.056712032678916835, 0.15537943114382652, 0.04785064545271294, 0.00865391068971297, 0.04293338816106609, -0.10542529366358898, -0.17728972897060896, 0.3488438885567053, -0.015798980273245337, -0.21784334944133138, 0.21508963079030496, -0.11717054467199184, -0.18776350892163982, 0.065602563981654, 0.15082282827063961, 0.13626775022333903, -0.14199881664973465, 0.0758444522776864, -0.07048239728716929, 0.12957879049028345, 0.10881259793891876, 0.0029766213589251453, 0.16813078257752564, 0.1440553511734027, 0.06760400975131337, 0.17290482429269863, -0.023362566075083562, -0.08876511342763226, -0.21875278817785115, -0.13673328576476876, -0.143621058738263, -0.012553637007814243, -0.12749632098443595, -0.20245742088999044, 0.37087184364657283, 0.15202553995770424, 0.19506369913027027, 0.1030092622962717, 0.2704409811755757, 0.06642848952382525, 0.07450642972064889, 0.07597918620387327, 0.16284622114596656, 0.15635757527350294, 0.04070971721578329, -0.10664497790925964, 0.12487935332557289, 0.06094285991633594] |
1,801.10419 | A topological approach to Neutrino masses by using exotic smoothness | In this paper, we will consider a cosmological model with two topological
transitions of the space. The smooth 4-dimensional spacetime of the model
admits topological transitions of its 3-dimensional slices. The whole approach
is inspired by a class of exotic smoothness structure on
$S^{3}\times\mathbb{R}$. In particular, this class of smoothness structures
induces two topological transitions. Then, we are able to calculate the energy
scales as associated to these topological transitions. For the first transition
we will get the value of the GUT scale and the energy of the second transition
is at the electroweak scale. The topology of the exotic $S^{3}\times\mathbb{R}$
determines both, the energy of the scales by certain topological invariants,
and the existence of the right-handed sterile neutrino. It is the input for the
seesaw mechanism. Secondly, based on this model, we are able to calculate the
neutrino masses which are in a very good agreement with experiments. Finally,
we will speculate, again based on topology, why there are three generations of
neutrinos and an asymmetry between neutrinos and anti-neutrinos.
| hep-th gr-qc hep-ph | in this paper we will consider a cosmological model with two topological transitions of the space the smooth 4dimensional spacetime of the model admits topological transitions of its 3dimensional slices the whole approach is inspired by a class of exotic smoothness structure on s3timesmathbbr in particular this class of smoothness structures induces two topological transitions then we are able to calculate the energy scales as associated to these topological transitions for the first transition we will get the value of the gut scale and the energy of the second transition is at the electroweak scale the topology of the exotic s3timesmathbbr determines both the energy of the scales by certain topological invariants and the existence of the righthanded sterile neutrino it is the input for the seesaw mechanism secondly based on this model we are able to calculate the neutrino masses which are in a very good agreement with experiments finally we will speculate again based on topology why there are three generations of neutrinos and an asymmetry between neutrinos and antineutrinos | [['in', 'this', 'paper', 'we', 'will', 'consider', 'a', 'cosmological', 'model', 'with', 'two', 'topological', 'transitions', 'of', 'the', 'space', 'the', 'smooth', '4dimensional', 'spacetime', 'of', 'the', 'model', 'admits', 'topological', 'transitions', 'of', 'its', '3dimensional', 'slices', 'the', 'whole', 'approach', 'is', 'inspired', 'by', 'a', 'class', 'of', 'exotic', 'smoothness', 'structure', 'on', 's3timesmathbbr', 'in', 'particular', 'this', 'class', 'of', 'smoothness', 'structures', 'induces', 'two', 'topological', 'transitions', 'then', 'we', 'are', 'able', 'to', 'calculate', 'the', 'energy', 'scales', 'as', 'associated', 'to', 'these', 'topological', 'transitions', 'for', 'the', 'first', 'transition', 'we', 'will', 'get', 'the', 'value', 'of', 'the', 'gut', 'scale', 'and', 'the', 'energy', 'of', 'the', 'second', 'transition', 'is', 'at', 'the', 'electroweak', 'scale', 'the', 'topology', 'of', 'the', 'exotic', 's3timesmathbbr', 'determines', 'both', 'the', 'energy', 'of', 'the', 'scales', 'by', 'certain', 'topological', 'invariants', 'and', 'the', 'existence', 'of', 'the', 'righthanded', 'sterile', 'neutrino', 'it', 'is', 'the', 'input', 'for', 'the', 'seesaw', 'mechanism', 'secondly', 'based', 'on', 'this', 'model', 'we', 'are', 'able', 'to', 'calculate', 'the', 'neutrino', 'masses', 'which', 'are', 'in', 'a', 'very', 'good', 'agreement', 'with', 'experiments', 'finally', 'we', 'will', 'speculate', 'again', 'based', 'on', 'topology', 'why', 'there', 'are', 'three', 'generations', 'of', 'neutrinos', 'and', 'an', 'asymmetry', 'between', 'neutrinos', 'and', 'antineutrinos']] | [-0.14731554200853827, 0.22251623109882213, -0.06554763305656136, 0.1433817540474106, -0.06930774140583221, -0.10103825196558826, 0.021553933788984365, 0.35040118082339855, -0.25515995371740224, -0.29434380482145867, 0.07487912133652826, -0.2665091319995131, -0.13392584762254425, 0.1435081558423875, 0.0031107418377190653, 0.011432086195739875, -0.012350474769888488, 0.03713754916206262, -0.11752983012106703, -0.22005985663164146, 0.41260626548792906, 0.03921105764768368, 0.24234347639004375, 0.07416654669755507, 0.09672429834676603, -0.09577777917458957, 0.0031446770948985983, -0.01384054016620381, -0.15601090590339586, 0.1100440863337162, 0.18770417360572664, 0.07547007934840093, 0.16696843102189907, -0.40388421776033073, -0.19110362507608655, 0.1454982670744188, 0.1055952128575205, 0.0990746404811859, -0.05871212298827527, -0.2930459162263676, 0.10713516504011052, -0.14493548264320896, -0.09938095336195168, -0.08272378820232874, -0.028805938552047106, -0.028285428771998213, -0.25555482279775976, 0.04778811324598961, 0.014888253211866804, -0.016738117695515326, -0.07679336312630344, -0.063502041608106, -0.04604655327979302, 0.1086149285682802, 0.09301998780439283, -0.02185553195886314, 0.08057346698275746, -0.14531343536814242, -0.13315314607055814, 0.42924606444335783, -0.055509418004455024, -0.16524956446834083, 0.17096698883823444, -0.1537819506795427, -0.14866015826741796, 0.11372040051203437, 0.15579863177439154, 0.09945190478614423, -0.08916331604319397, 0.12819180492891086, -0.06131687817477816, 0.14910291788590596, 0.0244988213810355, 0.041763501582546415, 0.2424002210853275, 0.20977785889746967, 0.09567975074724229, 0.08293619310093481, -0.117119724070721, -0.07190405681924245, -0.3766002688167054, -0.15725785841472273, -0.14561187456426924, 0.06790431588346701, -0.0729277686098845, -0.15634742315836944, 0.46332273402435403, 0.13803685250350944, 0.23906388500607897, 0.044995549036769285, 0.2527595045380728, 0.08249452042455654, 0.034397946340356804, 0.02937442276810924, 0.26568023926648854, 0.10938652160274255, 0.09133292087570352, -0.2227398383021314, 0.007468424350304832, 0.1059946709225864] |
1,801.1042 | The $\mathsf{HOD}$ Hypothesis and a supercompact cardinal | In this paper, we prove that: if $\kappa$ is supercompact and the $\mathsf{HOD}$ Hypothesis holds, then there is a proper class of regular cardinals in $V_{\kappa}$ which are measurable in $\mathsf{HOD}$. Woodin also proved this result. As a corollary, we prove Woodin's Local Universality Theorem. This work shows that under the assumption of the $\mathsf{HOD}$ Hypothesis and supercompact cardinals, large cardinals in $\mathsf{V}$ are reflected to be large cardinals in $\mathsf{HOD}$ in a local way, and reveals the huge difference between $\mathsf{HOD}$-supercompact cardinals and supercompact cardinals under the $\mathsf{HOD}$ Hypothesis. | math.LO | in this paper we prove that if kappa is supercompact and the mathsfhod hypothesis holds then there is a proper class of regular cardinals in v_kappa which are measurable in mathsfhod woodin also proved this result as a corollary we prove woodins local universality theorem this work shows that under the assumption of the mathsfhod hypothesis and supercompact cardinals large cardinals in mathsfv are reflected to be large cardinals in mathsfhod in a local way and reveals the huge difference between mathsfhodsupercompact cardinals and supercompact cardinals under the mathsfhod hypothesis | [['in', 'this', 'paper', 'we', 'prove', 'that', 'if', 'kappa', 'is', 'supercompact', 'and', 'the', 'mathsfhod', 'hypothesis', 'holds', 'then', 'there', 'is', 'a', 'proper', 'class', 'of', 'regular', 'cardinals', 'in', 'v_kappa', 'which', 'are', 'measurable', 'in', 'mathsfhod', 'woodin', 'also', 'proved', 'this', 'result', 'as', 'a', 'corollary', 'we', 'prove', 'woodins', 'local', 'universality', 'theorem', 'this', 'work', 'shows', 'that', 'under', 'the', 'assumption', 'of', 'the', 'mathsfhod', 'hypothesis', 'and', 'supercompact', 'cardinals', 'large', 'cardinals', 'in', 'mathsfv', 'are', 'reflected', 'to', 'be', 'large', 'cardinals', 'in', 'mathsfhod', 'in', 'a', 'local', 'way', 'and', 'reveals', 'the', 'huge', 'difference', 'between', 'mathsfhodsupercompact', 'cardinals', 'and', 'supercompact', 'cardinals', 'under', 'the', 'mathsfhod', 'hypothesis']] | [-0.16547173045031474, 0.16267140035967478, -0.1528332502688438, 0.12588719396166545, -0.0925559712929672, -0.13184928967816273, 0.01471137669685642, 0.30352318207367085, -0.30310140451248946, -0.162653646070845, 0.0718864779291528, -0.2843808749209294, -0.06241233219926277, 0.15584854021919578, -0.17492247788298332, -0.00895665418042728, 0.09792387347375409, 0.0010617762134316263, 0.06296384318736957, -0.19724620173402715, 0.4004546465414963, -0.10215740048148658, 0.23263164725824353, 0.10844592962105329, 0.0996392211364059, -0.05449616113217192, 0.04130284508083309, 0.12327250151821736, -0.16000192667952126, 0.05719387045540857, 0.2883960431378879, 0.17172401274418395, 0.3010594537367212, -0.27431423491222806, -0.13786857432176966, 0.20537365982936842, 0.03331345748260952, 0.001202965059757149, 0.004513273748119225, -0.3091023463776775, 0.1802392371019788, -0.14745067585301533, -0.2114735370229804, -0.0934631825225909, 0.09806976048799043, 0.026380429159473168, -0.34095247605752743, 0.09479258304397743, 0.25625806996661626, 0.08879058883431253, -0.0430498380499128, -0.04623228566867582, 0.009148641604553448, -0.0035810407742941646, 0.11525441046406547, 0.01595735362092598, 0.03529895804927088, -0.06910486577413558, -0.07109733767744698, 0.3203639659927269, -0.14140792936871477, -0.16410624146921915, 0.22297487934276963, -0.24942575506028836, -0.28319025612069987, 0.029031993748013223, -0.033793033540165156, 0.12869053708619616, -0.11488234222960773, 0.20426859012595638, -0.21536858773821693, 0.20294354375179732, 0.16707874341669043, 0.0908398675219564, 0.18424064004558316, 0.14535989512406874, 0.12913256936204318, 0.16770599468407127, 0.008184846825479122, 0.04639836211343495, -0.34201048789650534, -0.1018699650244599, -0.1584386998143968, 0.131209128923463, -0.08663603723025619, -0.19022641459668285, 0.2498951655475088, 0.20428032457849452, 0.1207618841985136, 0.20609940098875904, 0.20061374652419198, 0.03354751459830388, 0.038876660646912586, 0.1047089266449506, 0.21687261919292172, 0.09787263010178557, 0.006565182375606526, -0.0527292547088242, 0.09055997607078445, 0.08395897858681974] |
1,801.10421 | Composition Operators on Sobolev Spaces and Neumann Eigenvalues | In this paper we discuss applications of the geometric theory of composition
operators on Sobolev spaces to the spectral theory of non-linear elliptic
operators. The lower estimates of the first non-trivial Neumann eigenvalues of
the $p$-Laplace operator in cusp domains $\Omega\subset\mathbb R^n$, $n\geq 2$,
are given.
| math.AP | in this paper we discuss applications of the geometric theory of composition operators on sobolev spaces to the spectral theory of nonlinear elliptic operators the lower estimates of the first nontrivial neumann eigenvalues of the plaplace operator in cusp domains omegasubsetmathbb rn ngeq 2 are given | [['in', 'this', 'paper', 'we', 'discuss', 'applications', 'of', 'the', 'geometric', 'theory', 'of', 'composition', 'operators', 'on', 'sobolev', 'spaces', 'to', 'the', 'spectral', 'theory', 'of', 'nonlinear', 'elliptic', 'operators', 'the', 'lower', 'estimates', 'of', 'the', 'first', 'nontrivial', 'neumann', 'eigenvalues', 'of', 'the', 'plaplace', 'operator', 'in', 'cusp', 'domains', 'omegasubsetmathbb', 'rn', 'ngeq', '2', 'are', 'given']] | [-0.15662057813175995, 0.07031381551338278, -0.052932762743338295, 0.08158389160298216, -0.09060482451003855, -0.08075800809361365, -0.08157638132663282, 0.30853088381801447, -0.2915149892720839, -0.17443092815254047, 0.16986827046671155, -0.3562324472865009, -0.1558343418266462, 0.19631989010731163, -0.14538380685869767, 0.12711093995882117, 0.029510739279667967, 0.08376968324022449, -0.16841318891586168, -0.2182529777612375, 0.5043101990392999, -0.11527916782981028, 0.14645060868022722, 0.11990980255549126, 0.017979683010312525, -0.05515280897405161, -0.0005483384719928322, -0.0690938674784063, -0.22721746693486752, 0.24030931451884302, 0.2836281922848328, 0.05161634947011328, 0.29376588858987973, -0.44815777306971344, -0.22270771780091783, 0.18707078321755904, 0.13275214429418353, -0.045500208056815296, -0.0058386047173331936, -0.32184179042182537, 0.07629754789092619, -0.08978771118690139, -0.19909597937341617, -0.05117226349007662, 0.03183264173972218, 0.02443080512887758, -0.3114285875648341, 0.1377083950716516, 0.13592040397064842, 0.07998972452934021, -0.2073574984425922, -0.1159322593037201, -0.019347003924295954, 0.08116959804750007, -0.020733211523569797, 0.0038972551144821487, 0.028109211079857272, -0.09929521055385956, -0.12761836588058784, 0.299433164662965, -0.06127709873101633, -0.24495097711358382, 0.06855159842044763, -0.2544665704076381, -0.1456358448460536, 0.01349432527533044, 0.21094292311159812, 0.22130243140070335, -0.07632883824408054, 0.2422733942411192, -0.043142011682705386, 0.11915096976672826, 0.12111021899213285, 0.038537408913607185, 0.016335316751476214, 0.08473301606009835, 0.19934991271356525, 0.12632600623992798, 0.047337005952494626, -0.06382129226340508, -0.39332110726315045, -0.15723470112551813, -0.1914917920999553, 0.08255680255672854, -0.19718100422102472, -0.23632852866759765, 0.39164910481675813, 0.07588973758823198, 0.1773040767090962, 0.047058230807559324, 0.1852687939637057, 0.2006818037783808, 0.006447857670971881, 0.05654755670010396, 0.12445261426593947, 0.21325590440234088, 0.1586432971323476, -0.189329931795921, -0.07464858562604565, 0.22735324554631245] |
1,801.10422 | On the foundation of equipartition in supernova remnants | A widely accepted paradigm is that equipartition (eqp) between the energy
density of cosmic rays (CRs) and the energy density of the magnetic field
cannot be sustained in supernova remnants (SNRs). However, our 3D hydrodynamic
supercomputer simulations, coupled with a non-linear diffusive shock
acceleration model (NLDSA), provide evidence that eqp may be established at the
end of the Sedov phase of evolution in which most SNRs spend the longest
portions of their lives. We introduce term "constant partition" for any
constant ratio between the CR energy density and the energy density of magnetic
field in an SNR, while term "equipartition" should be reserved for the case of
approximately the same values of the energy density (also, it is {constant
partition} in the order of magnitude) of ultrarelativistic electrons only (or
CRs in total) and the energy density of magnetic field. Our simulations suggest
that this approximate constant partition does exist in all but the youngest
SNRs. We speculate that since evolved SNRs at the end of the Sedov phase of
evolution can reach eqp between CRs and magnetic fields, they may be
responsible for initializing this type of eqp in the interstellar medium.
Additionally, we show that eqp between the electron component of CRs and
magnetic field may be used for calculating the magnetic field strength directly
from observations of synchrotron emission from SNRs. The values of magnetic
field strengths in SNRs given here are approximately 2.5 times lower than
values calculated by Arbutina et al. (2012, 2013).
| astro-ph.HE | a widely accepted paradigm is that equipartition eqp between the energy density of cosmic rays crs and the energy density of the magnetic field cannot be sustained in supernova remnants snrs however our 3d hydrodynamic supercomputer simulations coupled with a nonlinear diffusive shock acceleration model nldsa provide evidence that eqp may be established at the end of the sedov phase of evolution in which most snrs spend the longest portions of their lives we introduce term constant partition for any constant ratio between the cr energy density and the energy density of magnetic field in an snr while term equipartition should be reserved for the case of approximately the same values of the energy density also it is constant partition in the order of magnitude of ultrarelativistic electrons only or crs in total and the energy density of magnetic field our simulations suggest that this approximate constant partition does exist in all but the youngest snrs we speculate that since evolved snrs at the end of the sedov phase of evolution can reach eqp between crs and magnetic fields they may be responsible for initializing this type of eqp in the interstellar medium additionally we show that eqp between the electron component of crs and magnetic field may be used for calculating the magnetic field strength directly from observations of synchrotron emission from snrs the values of magnetic field strengths in snrs given here are approximately 25 times lower than values calculated by arbutina et al 2012 2013 | [['a', 'widely', 'accepted', 'paradigm', 'is', 'that', 'equipartition', 'eqp', 'between', 'the', 'energy', 'density', 'of', 'cosmic', 'rays', 'crs', 'and', 'the', 'energy', 'density', 'of', 'the', 'magnetic', 'field', 'can', 'not', 'be', 'sustained', 'in', 'supernova', 'remnants', 'snrs', 'however', 'our', '3d', 'hydrodynamic', 'supercomputer', 'simulations', 'coupled', 'with', 'a', 'nonlinear', 'diffusive', 'shock', 'acceleration', 'model', 'nldsa', 'provide', 'evidence', 'that', 'eqp', 'may', 'be', 'established', 'at', 'the', 'end', 'of', 'the', 'sedov', 'phase', 'of', 'evolution', 'in', 'which', 'most', 'snrs', 'spend', 'the', 'longest', 'portions', 'of', 'their', 'lives', 'we', 'introduce', 'term', 'constant', 'partition', 'for', 'any', 'constant', 'ratio', 'between', 'the', 'cr', 'energy', 'density', 'and', 'the', 'energy', 'density', 'of', 'magnetic', 'field', 'in', 'an', 'snr', 'while', 'term', 'equipartition', 'should', 'be', 'reserved', 'for', 'the', 'case', 'of', 'approximately', 'the', 'same', 'values', 'of', 'the', 'energy', 'density', 'also', 'it', 'is', 'constant', 'partition', 'in', 'the', 'order', 'of', 'magnitude', 'of', 'ultrarelativistic', 'electrons', 'only', 'or', 'crs', 'in', 'total', 'and', 'the', 'energy', 'density', 'of', 'magnetic', 'field', 'our', 'simulations', 'suggest', 'that', 'this', 'approximate', 'constant', 'partition', 'does', 'exist', 'in', 'all', 'but', 'the', 'youngest', 'snrs', 'we', 'speculate', 'that', 'since', 'evolved', 'snrs', 'at', 'the', 'end', 'of', 'the', 'sedov', 'phase', 'of', 'evolution', 'can', 'reach', 'eqp', 'between', 'crs', 'and', 'magnetic', 'fields', 'they', 'may', 'be', 'responsible', 'for', 'initializing', 'this', 'type', 'of', 'eqp', 'in', 'the', 'interstellar', 'medium', 'additionally', 'we', 'show', 'that', 'eqp', 'between', 'the', 'electron', 'component', 'of', 'crs', 'and', 'magnetic', 'field', 'may', 'be', 'used', 'for', 'calculating', 'the', 'magnetic', 'field', 'strength', 'directly', 'from', 'observations', 'of', 'synchrotron', 'emission', 'from', 'snrs', 'the', 'values', 'of', 'magnetic', 'field', 'strengths', 'in', 'snrs', 'given', 'here', 'are', 'approximately', '25', 'times', 'lower', 'than', 'values', 'calculated', 'by', 'arbutina', 'et', 'al', '2012', '2013']] | [-0.13094429832727333, 0.1906305453510633, -0.05379728782516453, 0.10304927651774168, -0.0401685708690615, -0.05733338117058719, 0.020050662752774152, 0.39238577754417014, -0.2406586626447895, -0.35228575504715404, 0.007949460379501444, -0.22230461812127503, -0.04057044973653261, 0.18201583328303264, 0.061016411188193745, -0.07874800206140677, 0.03591690511224912, 0.02018175973294532, -0.04371257213595879, -0.2370669782723135, 0.2826928540561048, 0.15346944919456879, 0.23873979398312287, 0.0567663706240109, 0.06506912188201715, -0.08688218788536746, 0.018497005559413904, 0.03201211933159239, -0.12407498384782817, 0.041244361932659825, 0.20502111803245732, 0.09945056803201535, 0.22591788675861374, -0.4622704890526591, -0.274737134034137, 0.1263906316336004, 0.19706446411568793, 0.06557683406713148, -0.03842834808681566, -0.22093063074956468, 0.06590059289550071, -0.17410507698678562, -0.15319359040304628, 0.039835280479652985, 0.016402976669093232, 0.0757797171214817, -0.25361161955046435, 0.14055856117204624, 0.012390413219221838, 0.016780358507305443, -0.1339254359594516, -0.1128968988759293, -0.006333073839590314, 0.07767434750548413, 0.09365501240385891, 0.0709082372195553, 0.13642068982740202, -0.16067656166213115, -0.06440706271302676, 0.37557697114759997, -0.05898011010591994, -0.08380015937220905, 0.18737754487571487, -0.1873381566209343, -0.12480278618186863, 0.18696897002331342, 0.14661233700744267, 0.06721797443629664, -0.14099529751336143, 0.081618317934983, -0.008123432393110688, 0.1624633396155156, 0.045675914676394314, 0.027931419446612118, 0.2453609219566363, 0.08998956022250856, 0.026044642663515742, 0.080278038129402, -0.14085136462968112, -0.06340411413135195, -0.2807546974790673, -0.16283969046743285, -0.20413995167262095, 0.09916983550183725, -0.14442829924395953, -0.13286671645267145, 0.3491123477241114, 0.17056743022863707, 0.15156996998590447, 0.011834046458393605, 0.2856526575609854, 0.13263937058640765, 0.03360707511761105, 0.2068033563461335, 0.31546569966726123, 0.16241509502006304, 0.12257813488888074, -0.2086817143020697, 0.06692988359446322, 0.04338560337125654] |
1,801.10423 | Assessing the time dependence of reconnection with Poynting's theorem:
MMS observations | We investigate the time dependence of electromagnetic-field-to-plasma energy
conversion in the electron diffusion region of asymmetric magnetic
reconnection. To do so, we consider the terms in Poynting's theorem. In a
steady state there is a perfect balance between the divergence of the
electromagnetic energy flux $\nabla \cdot \vec{S}$ and the conversion between
electromagnetic field and particle energy $\vec{J} \cdot \vec{E}$. This energy
balance is demonstrated with a particle-in-cell simulation of reconnection. We
also evaluate each of the terms in Poynting's theorem during an observation of
a magnetopause reconnection region by Magnetospheric Multiscale (MMS). We take
the equivalence of both sides of Poynting's theorem as an indication that the
errors associated with the approximation of each term with MMS data are small.
We find that, for this event, balance between
$\vec{J}\cdot\vec{E}=-\nabla\cdot\vec{S}$ is only achieved for a small fraction
of the energy conversion region at/near the X-point. Magnetic energy was
rapidly accumulating on either side of the current sheet at roughly three times
the predicted energy conversion rate. Furthermore, we find that while
$\vec{J}\cdot\vec{E}>0$ and $\nabla\cdot\vec{S}<0$ are observed, as is expected
for reconnection, the energy accumulation is driven by the overcompensation for
$\vec{J}\cdot\vec{E}$ by $-\nabla\cdot\vec{S}>\vec{J}\cdot\vec{E}$. We note
that due to the assumptions necessary to do this calculation, the accurate
evaluation of $\nabla\cdot\vec{S}$ may not be possible for every MMS-observed
reconnection event; but if possible, this is a simple approach to determine if
reconnection is or is not in a steady-state.
| physics.space-ph | we investigate the time dependence of electromagneticfieldtoplasma energy conversion in the electron diffusion region of asymmetric magnetic reconnection to do so we consider the terms in poyntings theorem in a steady state there is a perfect balance between the divergence of the electromagnetic energy flux nabla cdot vecs and the conversion between electromagnetic field and particle energy vecj cdot vece this energy balance is demonstrated with a particleincell simulation of reconnection we also evaluate each of the terms in poyntings theorem during an observation of a magnetopause reconnection region by magnetospheric multiscale mms we take the equivalence of both sides of poyntings theorem as an indication that the errors associated with the approximation of each term with mms data are small we find that for this event balance between vecjcdotvecenablacdotvecs is only achieved for a small fraction of the energy conversion region atnear the xpoint magnetic energy was rapidly accumulating on either side of the current sheet at roughly three times the predicted energy conversion rate furthermore we find that while vecjcdotvece0 and nablacdotvecs0 are observed as is expected for reconnection the energy accumulation is driven by the overcompensation for vecjcdotvece by nablacdotvecsvecjcdotvece we note that due to the assumptions necessary to do this calculation the accurate evaluation of nablacdotvecs may not be possible for every mmsobserved reconnection event but if possible this is a simple approach to determine if reconnection is or is not in a steadystate | [['we', 'investigate', 'the', 'time', 'dependence', 'of', 'electromagneticfieldtoplasma', 'energy', 'conversion', 'in', 'the', 'electron', 'diffusion', 'region', 'of', 'asymmetric', 'magnetic', 'reconnection', 'to', 'do', 'so', 'we', 'consider', 'the', 'terms', 'in', 'poyntings', 'theorem', 'in', 'a', 'steady', 'state', 'there', 'is', 'a', 'perfect', 'balance', 'between', 'the', 'divergence', 'of', 'the', 'electromagnetic', 'energy', 'flux', 'nabla', 'cdot', 'vecs', 'and', 'the', 'conversion', 'between', 'electromagnetic', 'field', 'and', 'particle', 'energy', 'vecj', 'cdot', 'vece', 'this', 'energy', 'balance', 'is', 'demonstrated', 'with', 'a', 'particleincell', 'simulation', 'of', 'reconnection', 'we', 'also', 'evaluate', 'each', 'of', 'the', 'terms', 'in', 'poyntings', 'theorem', 'during', 'an', 'observation', 'of', 'a', 'magnetopause', 'reconnection', 'region', 'by', 'magnetospheric', 'multiscale', 'mms', 'we', 'take', 'the', 'equivalence', 'of', 'both', 'sides', 'of', 'poyntings', 'theorem', 'as', 'an', 'indication', 'that', 'the', 'errors', 'associated', 'with', 'the', 'approximation', 'of', 'each', 'term', 'with', 'mms', 'data', 'are', 'small', 'we', 'find', 'that', 'for', 'this', 'event', 'balance', 'between', 'vecjcdotvecenablacdotvecs', 'is', 'only', 'achieved', 'for', 'a', 'small', 'fraction', 'of', 'the', 'energy', 'conversion', 'region', 'atnear', 'the', 'xpoint', 'magnetic', 'energy', 'was', 'rapidly', 'accumulating', 'on', 'either', 'side', 'of', 'the', 'current', 'sheet', 'at', 'roughly', 'three', 'times', 'the', 'predicted', 'energy', 'conversion', 'rate', 'furthermore', 'we', 'find', 'that', 'while', 'vecjcdotvece0', 'and', 'nablacdotvecs0', 'are', 'observed', 'as', 'is', 'expected', 'for', 'reconnection', 'the', 'energy', 'accumulation', 'is', 'driven', 'by', 'the', 'overcompensation', 'for', 'vecjcdotvece', 'by', 'nablacdotvecsvecjcdotvece', 'we', 'note', 'that', 'due', 'to', 'the', 'assumptions', 'necessary', 'to', 'do', 'this', 'calculation', 'the', 'accurate', 'evaluation', 'of', 'nablacdotvecs', 'may', 'not', 'be', 'possible', 'for', 'every', 'mmsobserved', 'reconnection', 'event', 'but', 'if', 'possible', 'this', 'is', 'a', 'simple', 'approach', 'to', 'determine', 'if', 'reconnection', 'is', 'or', 'is', 'not', 'in', 'a', 'steadystate']] | [-0.15976473139217606, 0.16239476857964322, -0.034264256814414445, 0.09702313225816711, -0.039435468965354534, -0.07235077702528636, 0.03172154792741037, 0.37892168135671267, -0.25136759824416566, -0.3213795372164519, 0.06232289469887197, -0.25204844175785746, -0.07121095814991035, 0.19229481401271187, -0.008710461607828119, -0.029325015808792848, 0.06640845463723587, 0.04991959357846946, -0.04869124085272578, -0.1529715702134377, 0.2863722649229297, 0.10570151707486666, 0.26666584943726274, 0.11069465395271906, 0.1299977447393005, -0.051231935000095256, 0.03183441771021723, 0.014231085945884216, -0.14937337685904792, 0.0491485694124251, 0.18842469002842774, 0.07247399497357727, 0.256325139894937, -0.4539580986254742, -0.18932020442022396, 0.09619657905844586, 0.14325789071956713, 0.06627979514802253, -0.052942205479886414, -0.2044493961087749, 0.08826014260331908, -0.15606829450979573, -0.09117699521423141, -0.029679229897487072, 0.043253689227075766, 0.04090522077854859, -0.32524552060580203, 0.1152822249176348, 0.08795642625472251, 0.023522125512907475, -0.08858070022864106, -0.04015499299215474, -0.047294950781084984, 0.08087086766368132, 0.10259834877546507, 0.07947318357463669, 0.1306785411491954, -0.14358078224299317, -0.08862773994292968, 0.3587499628413533, -0.03468781586330994, -0.18384486693760443, 0.14790341776598984, -0.19548884660591662, -0.09226298446020369, 0.17388007068677389, 0.1186678073286673, 0.08640810065894741, -0.13271754441747957, 0.05320414344319504, -0.03980258620065107, 0.13725590629919365, 0.06888710129965932, -0.010888933854434511, 0.21582721213705774, 0.1442736300412999, 0.07611263049706206, 0.12595006145821916, -0.1442034558178797, -0.07693160947558775, -0.3411552985841087, -0.17299995354570175, -0.1771406485404441, 0.08873881316045801, -0.05513355244624234, -0.14745665253902754, 0.3682367040641237, 0.1477485190768895, 0.17413953379118224, 0.004774153398165223, 0.3006837644297148, 0.18302312809502272, 0.04126746873050157, 0.1468870176146899, 0.2788800437260291, 0.10608648605431945, 0.12700151449223931, -0.22964825392660587, 0.05875766872135312, 0.051381075359852826] |
1,801.10424 | Generalised Langevin Equation Formulation for Anomalous Diffusion in the
Ising Model at the Critical Temperature | We consider the two- (2D) and three-dimensional (3D) Ising model on a square
lattice at the critical temperature $T_c$, under Monte-Carlo spin flip
dynamics. The bulk magnetisation and the magnetisation of a tagged line in the
2D Ising model, and the bulk magnetisation and the magnetisation of a tagged
plane in the 3D Ising model exhibit anomalous diffusion. Specifically, their
mean-square displacement increases as power-laws in time, collectively denoted
as $\sim t^c$, where $c$ is the anomalous exponent. We argue that the anomalous
diffusion in all these quantities for the Ising model stems from time-dependent
restoring forces, decaying as power-laws in time --- also with exponent $c$ ---
in striking similarity to anomalous diffusion in polymeric systems. Prompted by
our previous work that has established a memory-kernel based Generalised
Langevin Equation (GLE) formulation for polymeric systems, we show that a
closely analogous GLE formulation holds for the Ising model as well. We obtain
the memory kernels from spin-spin correlation functions, and the formulation
allows us to consistently explain anomalous diffusion as well as anomalous
response of the Ising model to an externally applied magnetic field in a
consistent manner.
| cond-mat.stat-mech | we consider the two 2d and threedimensional 3d ising model on a square lattice at the critical temperature t_c under montecarlo spin flip dynamics the bulk magnetisation and the magnetisation of a tagged line in the 2d ising model and the bulk magnetisation and the magnetisation of a tagged plane in the 3d ising model exhibit anomalous diffusion specifically their meansquare displacement increases as powerlaws in time collectively denoted as sim tc where c is the anomalous exponent we argue that the anomalous diffusion in all these quantities for the ising model stems from timedependent restoring forces decaying as powerlaws in time also with exponent c in striking similarity to anomalous diffusion in polymeric systems prompted by our previous work that has established a memorykernel based generalised langevin equation gle formulation for polymeric systems we show that a closely analogous gle formulation holds for the ising model as well we obtain the memory kernels from spinspin correlation functions and the formulation allows us to consistently explain anomalous diffusion as well as anomalous response of the ising model to an externally applied magnetic field in a consistent manner | [['we', 'consider', 'the', 'two', '2d', 'and', 'threedimensional', '3d', 'ising', 'model', 'on', 'a', 'square', 'lattice', 'at', 'the', 'critical', 'temperature', 't_c', 'under', 'montecarlo', 'spin', 'flip', 'dynamics', 'the', 'bulk', 'magnetisation', 'and', 'the', 'magnetisation', 'of', 'a', 'tagged', 'line', 'in', 'the', '2d', 'ising', 'model', 'and', 'the', 'bulk', 'magnetisation', 'and', 'the', 'magnetisation', 'of', 'a', 'tagged', 'plane', 'in', 'the', '3d', 'ising', 'model', 'exhibit', 'anomalous', 'diffusion', 'specifically', 'their', 'meansquare', 'displacement', 'increases', 'as', 'powerlaws', 'in', 'time', 'collectively', 'denoted', 'as', 'sim', 'tc', 'where', 'c', 'is', 'the', 'anomalous', 'exponent', 'we', 'argue', 'that', 'the', 'anomalous', 'diffusion', 'in', 'all', 'these', 'quantities', 'for', 'the', 'ising', 'model', 'stems', 'from', 'timedependent', 'restoring', 'forces', 'decaying', 'as', 'powerlaws', 'in', 'time', 'also', 'with', 'exponent', 'c', 'in', 'striking', 'similarity', 'to', 'anomalous', 'diffusion', 'in', 'polymeric', 'systems', 'prompted', 'by', 'our', 'previous', 'work', 'that', 'has', 'established', 'a', 'memorykernel', 'based', 'generalised', 'langevin', 'equation', 'gle', 'formulation', 'for', 'polymeric', 'systems', 'we', 'show', 'that', 'a', 'closely', 'analogous', 'gle', 'formulation', 'holds', 'for', 'the', 'ising', 'model', 'as', 'well', 'we', 'obtain', 'the', 'memory', 'kernels', 'from', 'spinspin', 'correlation', 'functions', 'and', 'the', 'formulation', 'allows', 'us', 'to', 'consistently', 'explain', 'anomalous', 'diffusion', 'as', 'well', 'as', 'anomalous', 'response', 'of', 'the', 'ising', 'model', 'to', 'an', 'externally', 'applied', 'magnetic', 'field', 'in', 'a', 'consistent', 'manner']] | [-0.10769848947856515, 0.1808118870424108, -0.04675094987305297, 0.06546510817585165, -0.032681684680208364, -0.16874695986628852, -0.0003933901226217734, 0.37302981441053634, -0.26861403815019974, -0.2841839508955332, 0.02314900193004844, -0.29842467338257944, -0.17305266856524676, 0.17988085826201475, 0.05898034977502523, 0.09352581345421426, -0.044258873452766134, 0.04236721278063674, -0.06911580349607542, -0.15978394013351419, 0.24698021102517365, 0.008241138886660337, 0.2896742476872542, 0.04272456355561019, 0.10413669284064582, 0.013099610075892451, 0.06689064251679185, 0.07418912875510872, -0.14663585932749632, 0.01708562614210697, 0.14543336600234563, -0.04367125744527993, 0.15827815655997413, -0.41772444260351477, -0.25502592203192376, 0.06706439598617867, 0.17271133946045675, 0.12550121543799492, 0.0010404013723563303, -0.26796191011401105, 0.000904685149048978, -0.15943472813765075, -0.15525827213454454, -0.09257002933608259, 0.024772734851277567, 0.018438129695779817, -0.28613403269194343, 0.18411176449934863, 0.09155367697087331, 0.08499505780736871, -0.09078811480816862, -0.10164868750455067, -0.029015782900543057, 0.09922561006381471, 0.07148989223449287, 0.08696014254309117, 0.14357495194868766, -0.15132798302301112, -0.1793811453489542, 0.36097094006114266, -0.09302420009744358, -0.19417891334891718, 0.18480469680012745, -0.1875908472737108, -0.13320359347197028, 0.12499717348952465, 0.17517284260512414, 0.07147951226651589, -0.1702120346241297, 0.09343087416668895, -0.04620275380498266, 0.13409031799840018, -0.03558910321593683, -0.028346672860835802, 0.17605992205650173, 0.1710449774067271, 0.019283386365694797, 0.19124900017252422, -0.1089448066388461, -0.1421344837343151, -0.2735983675288505, -0.18640335011146564, -0.22914897999975253, 0.09425504460811296, -0.12274229776991698, -0.18764057892429478, 0.3704366622403025, 0.20316090943779855, 0.21432537255549733, 0.06192130671395736, 0.22193198050696025, 0.1259716614541712, 0.06210630080777216, 0.09539920565258851, 0.19897114126980403, 0.15304507826265684, 0.1708089251091136, -0.27691804330278047, 0.06228886212516118, 0.10097329788666995] |
1,801.10425 | A Deep Reinforcement Learning Approach for Dynamically Stable Inverse
Kinematics of Humanoid Robots | Real time calculation of inverse kinematics (IK) with dynamically stable
configuration is of high necessity in humanoid robots as they are highly
susceptible to lose balance. This paper proposes a methodology to generate
joint-space trajectories of stable configurations for solving inverse
kinematics using Deep Reinforcement Learning (RL). Our approach is based on the
idea of exploring the entire configuration space of the robot and learning the
best possible solutions using Deep Deterministic Policy Gradient (DDPG). The
proposed strategy was evaluated on the highly articulated upper body of a
humanoid model with 27 degree of freedom (DoF). The trained model was able to
solve inverse kinematics for the end effectors with 90% accuracy while
maintaining the balance in double support phase.
| cs.RO | real time calculation of inverse kinematics ik with dynamically stable configuration is of high necessity in humanoid robots as they are highly susceptible to lose balance this paper proposes a methodology to generate jointspace trajectories of stable configurations for solving inverse kinematics using deep reinforcement learning rl our approach is based on the idea of exploring the entire configuration space of the robot and learning the best possible solutions using deep deterministic policy gradient ddpg the proposed strategy was evaluated on the highly articulated upper body of a humanoid model with 27 degree of freedom dof the trained model was able to solve inverse kinematics for the end effectors with 90 accuracy while maintaining the balance in double support phase | [['real', 'time', 'calculation', 'of', 'inverse', 'kinematics', 'ik', 'with', 'dynamically', 'stable', 'configuration', 'is', 'of', 'high', 'necessity', 'in', 'humanoid', 'robots', 'as', 'they', 'are', 'highly', 'susceptible', 'to', 'lose', 'balance', 'this', 'paper', 'proposes', 'a', 'methodology', 'to', 'generate', 'jointspace', 'trajectories', 'of', 'stable', 'configurations', 'for', 'solving', 'inverse', 'kinematics', 'using', 'deep', 'reinforcement', 'learning', 'rl', 'our', 'approach', 'is', 'based', 'on', 'the', 'idea', 'of', 'exploring', 'the', 'entire', 'configuration', 'space', 'of', 'the', 'robot', 'and', 'learning', 'the', 'best', 'possible', 'solutions', 'using', 'deep', 'deterministic', 'policy', 'gradient', 'ddpg', 'the', 'proposed', 'strategy', 'was', 'evaluated', 'on', 'the', 'highly', 'articulated', 'upper', 'body', 'of', 'a', 'humanoid', 'model', 'with', '27', 'degree', 'of', 'freedom', 'dof', 'the', 'trained', 'model', 'was', 'able', 'to', 'solve', 'inverse', 'kinematics', 'for', 'the', 'end', 'effectors', 'with', '90', 'accuracy', 'while', 'maintaining', 'the', 'balance', 'in', 'double', 'support', 'phase']] | [-0.07229908470762894, 0.054709672516522305, -0.09287591414370884, 0.028756847951444797, -0.12489272400271148, -0.16920367018319665, 0.05843885070353281, 0.4306417530712982, -0.23557465724491825, -0.3702385982964188, 0.06976382226954835, -0.20963913661350186, -0.16813928868311148, 0.15208360210914787, -0.07074617387261242, 0.1019001932737107, 0.0921082637301879, 0.004791118624658945, -0.006835584471991752, -0.23763547646231017, 0.2877178862962561, 0.07783769793992784, 0.29078177929235, -0.02602254048300286, 0.18999360497497644, 0.00021867801745732626, 0.011485950462520123, -0.01529051945375007, -0.061294896563777, 0.14497564356230822, 0.2768278276664205, 0.17001054281524072, 0.28549779889096194, -0.3854954559976856, -0.1644212032513072, 0.08861110396683217, 0.16434293892040538, 0.06830460640097348, -0.03316178478805038, -0.3135336299814905, 0.08957289302488788, -0.15542353898357153, -0.14804073074289287, -0.11529888896426807, -0.010575234354473651, -0.01868550971169801, -0.28112502245542903, 0.015567849231107782, 0.03859155809041113, 0.06396921329214819, -0.10518999033180686, -0.10916898960325246, -0.0013237059950673331, 0.13088647473681098, 0.006486367080166626, 0.04939851539602387, 0.16865879451700796, -0.17743239715879705, -0.13202276203082874, 0.36642008035754164, -0.002946766504707436, -0.2443762152591565, 0.20075966251121524, -0.07055061624851078, -0.08880865458243838, 0.15596152593692145, 0.2326115148704654, 0.1853128680047424, -0.16924237907320883, 0.05267432387869728, -0.032948889742450166, 0.16491487330446641, 0.022465536918025462, -0.07890757775167004, 0.15035072570996513, 0.2593863864565113, 0.07676877808601906, 0.13434313789087657, -0.09813956233750408, -0.1827782430157337, -0.22812636794211963, -0.10540391443840538, -0.12980110592519242, -0.020677725388668477, -0.09768438049735172, -0.10473786220536567, 0.35370035177329556, 0.17140856391682366, 0.19432933543575928, 0.10653226404065208, 0.34318796093575654, 0.07337836502993014, 0.07635135727323358, 0.12557426972392324, 0.27511496040970085, 0.07450391862075775, 0.12536071947348926, -0.2364469955985745, 0.10096734919764762, 0.05355564308119938] |
1,801.10426 | Vectorial near-field coupling | The coherent exchange of optical near fields between two neighboring dipoles
plays an essential role for the optical properties, quantum dynamics and thus
for the function of many naturally occurring and artificial nanosystems. These
interactions are inherently short-ranged, extending over a few nanometers only,
and depend sensitively on relative orientation, detuning and dephasing, i.e.,
on the vectorial properties of the coupled dipolar near fields. This makes it
challenging to analyze them experimentally. Here, we introduce plasmonic
nanofocusing spectroscopy to record coherent light scattering spectra with 5-nm
spatial resolution from a small dipole antenna, excited solely by evanescent
fields and coupled to plasmon resonances in a single gold nanorod. We resolve
mode couplings, resonance energy shifts and Purcell effects as a function of
dipole distance and relative orientation, and show how they arise from
different vectorial components of the interacting optical near-fields. Our
results pave the way for using dipolar alignment to control the optical
properties and function of nanoscale systems.
| physics.optics | the coherent exchange of optical near fields between two neighboring dipoles plays an essential role for the optical properties quantum dynamics and thus for the function of many naturally occurring and artificial nanosystems these interactions are inherently shortranged extending over a few nanometers only and depend sensitively on relative orientation detuning and dephasing ie on the vectorial properties of the coupled dipolar near fields this makes it challenging to analyze them experimentally here we introduce plasmonic nanofocusing spectroscopy to record coherent light scattering spectra with 5nm spatial resolution from a small dipole antenna excited solely by evanescent fields and coupled to plasmon resonances in a single gold nanorod we resolve mode couplings resonance energy shifts and purcell effects as a function of dipole distance and relative orientation and show how they arise from different vectorial components of the interacting optical nearfields our results pave the way for using dipolar alignment to control the optical properties and function of nanoscale systems | [['the', 'coherent', 'exchange', 'of', 'optical', 'near', 'fields', 'between', 'two', 'neighboring', 'dipoles', 'plays', 'an', 'essential', 'role', 'for', 'the', 'optical', 'properties', 'quantum', 'dynamics', 'and', 'thus', 'for', 'the', 'function', 'of', 'many', 'naturally', 'occurring', 'and', 'artificial', 'nanosystems', 'these', 'interactions', 'are', 'inherently', 'shortranged', 'extending', 'over', 'a', 'few', 'nanometers', 'only', 'and', 'depend', 'sensitively', 'on', 'relative', 'orientation', 'detuning', 'and', 'dephasing', 'ie', 'on', 'the', 'vectorial', 'properties', 'of', 'the', 'coupled', 'dipolar', 'near', 'fields', 'this', 'makes', 'it', 'challenging', 'to', 'analyze', 'them', 'experimentally', 'here', 'we', 'introduce', 'plasmonic', 'nanofocusing', 'spectroscopy', 'to', 'record', 'coherent', 'light', 'scattering', 'spectra', 'with', '5nm', 'spatial', 'resolution', 'from', 'a', 'small', 'dipole', 'antenna', 'excited', 'solely', 'by', 'evanescent', 'fields', 'and', 'coupled', 'to', 'plasmon', 'resonances', 'in', 'a', 'single', 'gold', 'nanorod', 'we', 'resolve', 'mode', 'couplings', 'resonance', 'energy', 'shifts', 'and', 'purcell', 'effects', 'as', 'a', 'function', 'of', 'dipole', 'distance', 'and', 'relative', 'orientation', 'and', 'show', 'how', 'they', 'arise', 'from', 'different', 'vectorial', 'components', 'of', 'the', 'interacting', 'optical', 'nearfields', 'our', 'results', 'pave', 'the', 'way', 'for', 'using', 'dipolar', 'alignment', 'to', 'control', 'the', 'optical', 'properties', 'and', 'function', 'of', 'nanoscale', 'systems']] | [-0.15573595220048447, 0.19805434917007006, -0.03559549189121754, 0.03852520901582466, -0.05720750285545364, -0.13561874741862995, 0.009190489746106322, 0.4625228241391596, -0.28981190210324714, -0.31504358489473816, -0.016668621909775538, -0.2813326970092021, -0.15685597436386162, 0.22490220667677932, 0.04753626566862294, 0.013398667036744883, 0.012105831941880751, -0.04473331147746649, -0.00020431612283573487, -0.12717004582373193, 0.29940003344090654, 0.026927924566552974, 0.3110427812061971, 0.09283580433984753, 0.09476443915627897, 0.0752844961345545, 0.04919209550571395, -0.024842749239178376, -0.10241167240019422, 0.15280419960909059, 0.2106614159347373, -0.035967855307535504, 0.2202628061917494, -0.4559121094178408, -0.1784942824720929, 0.057577884736065246, 0.1737690392696095, 0.16637563992262586, -0.0472305685718311, -0.29253223884152246, -0.013759579334873706, -0.07129821165872272, -0.14656362490641187, -0.08491123363055522, -0.0031646101066144182, 0.07824036225974851, -0.24409611812479853, 0.07264929251687136, 0.036338290367439186, 0.09405552109819837, -0.06787618539528921, -0.05477877799457929, -0.01230333946441533, 0.12257081431453117, -0.013069847025326453, -0.011244536226149649, 0.2190297714987537, -0.15468367010180373, -0.10114249481703155, 0.3734695861581713, -0.08083788344229106, -0.17229412516317097, 0.21022793161682785, -0.1512256460329809, -0.012940832860294904, 0.1505120623507537, 0.19392544241272844, 0.12925611728423975, -0.11786508937657345, 0.032005055024274046, 0.02896458492614329, 0.20732674056489486, 0.1045893296803115, 0.17640071621281095, 0.2767247448908165, 0.14673831484396943, 0.024282572821493886, 0.13444804726022994, -0.13276508753351662, -0.07413291783741442, -0.245299208520737, -0.09634433092869585, -0.1911254350305171, 0.05960314957192168, -0.07411589869798263, -0.1598316603747662, 0.39517280136060434, 0.14442800988326782, 0.18721924264755216, -0.04056204452936072, 0.3123644114006311, 0.07867230984556954, 0.10767889788839966, -0.02177080736582866, 0.3319416521728272, 0.20774899022653698, 0.051420542995765574, -0.3068036407814361, -0.012558686822012532, -0.030562295316485688] |
1,801.10427 | Coupled magnetic and ferroelectric states in the distorted honeycomb
system Fe$_{4}$Ta$_{2}$O$_{9}$ | We report on the magnetic, thermodynamic, dielectric, and pyroelectric
measurements on the hitherto unreported Fe${_4}$Ta${_2}$O${_9}$. This system is
seen to exhibit a series of magnetic transitions, many of which are coupled to
the emergence of ferroelectric order, making Fe${_4}$Ta${_2}$O${_9}$ the only
genuine multiferroic in its material class. We suggest that the observed
properties arise as a consequence of an effective reduction in the
dimensionality of the magnetic lattice, with the magnetically active
Fe${^{2+}}$ ions preferentially occupying a quasi 2D buckled honeycomb
structure. The low temperature $H$-$T$ phase diagram of Fe${_4}$Ta${_2}$O${_9}$
reveals a rich variety of coupled magnetic and ferroelectric phases, in
similarity with that observed in the distorted Kagome systems.
| cond-mat.str-el | we report on the magnetic thermodynamic dielectric and pyroelectric measurements on the hitherto unreported fe_4ta_2o_9 this system is seen to exhibit a series of magnetic transitions many of which are coupled to the emergence of ferroelectric order making fe_4ta_2o_9 the only genuine multiferroic in its material class we suggest that the observed properties arise as a consequence of an effective reduction in the dimensionality of the magnetic lattice with the magnetically active fe2 ions preferentially occupying a quasi 2d buckled honeycomb structure the low temperature ht phase diagram of fe_4ta_2o_9 reveals a rich variety of coupled magnetic and ferroelectric phases in similarity with that observed in the distorted kagome systems | [['we', 'report', 'on', 'the', 'magnetic', 'thermodynamic', 'dielectric', 'and', 'pyroelectric', 'measurements', 'on', 'the', 'hitherto', 'unreported', 'fe_4ta_2o_9', 'this', 'system', 'is', 'seen', 'to', 'exhibit', 'a', 'series', 'of', 'magnetic', 'transitions', 'many', 'of', 'which', 'are', 'coupled', 'to', 'the', 'emergence', 'of', 'ferroelectric', 'order', 'making', 'fe_4ta_2o_9', 'the', 'only', 'genuine', 'multiferroic', 'in', 'its', 'material', 'class', 'we', 'suggest', 'that', 'the', 'observed', 'properties', 'arise', 'as', 'a', 'consequence', 'of', 'an', 'effective', 'reduction', 'in', 'the', 'dimensionality', 'of', 'the', 'magnetic', 'lattice', 'with', 'the', 'magnetically', 'active', 'fe2', 'ions', 'preferentially', 'occupying', 'a', 'quasi', '2d', 'buckled', 'honeycomb', 'structure', 'the', 'low', 'temperature', 'ht', 'phase', 'diagram', 'of', 'fe_4ta_2o_9', 'reveals', 'a', 'rich', 'variety', 'of', 'coupled', 'magnetic', 'and', 'ferroelectric', 'phases', 'in', 'similarity', 'with', 'that', 'observed', 'in', 'the', 'distorted', 'kagome', 'systems']] | [-0.1932918523692272, 0.18691939867051338, -0.0063763856273991145, -0.021066412834228356, -0.07223672000902959, -0.10526465121233328, 0.07074500415474176, 0.402834647572176, -0.26599051810123703, -0.2903274255720052, 0.03262528154618022, -0.2917623649605296, -0.16495687332935632, 0.16400163204737261, 0.047929178648204965, -0.01721849036032588, -0.04861490084705028, 0.00837277899580923, -0.1164863853757693, -0.18490010838405313, 0.25264293799515475, -0.006118112328377637, 0.28750632706479257, 0.010518970509821719, 0.05977625155884942, -0.05264584702989933, 0.13240966786503452, 0.07122254065153273, -0.12276338612388248, 0.0709306486712938, 0.21453507263213395, -0.0684851226058196, 0.15960813612804156, -0.41846910856071523, -0.21353486124426127, 0.030504238927228883, 0.13118616831488908, 0.13453566815005616, -0.09230683790096506, -0.2714028242382814, 0.02071635180565698, -0.12117217945104296, -0.12304728774523194, -0.1277213130040433, -0.03696757480925457, 0.008210956364531409, -0.22825337056419812, 0.09330022999969184, 0.08439869654618881, 0.1286019553165798, -0.13824923159660432, -0.11427613933126188, -0.08023457508322529, 0.05250978320837021, 0.04629149225921455, 0.06270571618594907, 0.1347131912257861, -0.11118290546053851, -0.1153507657264444, 0.39950051245025614, -0.02334932199869813, -0.0672993847168982, 0.2152354050406509, -0.2265248034044899, -0.16757706594653426, 0.2005029494408518, 0.14824554370292886, 0.09514828839720312, -0.11766327323275619, 0.051375678420035084, -0.028823189871301027, 0.19441559435799718, -0.008550839909267697, 0.10762133970856666, 0.26733109463344923, 0.21575346636077897, -0.011064233479026535, 0.2166604856537147, -0.12962100259451703, -0.07698580552823842, -0.19409720311893827, -0.17728811972351236, -0.20016379376280713, 0.050386120014908636, -0.09816435539899182, -0.27759391529993577, 0.37953340863300994, 0.11667127975749529, 0.18812375626611438, -0.12692453560355882, 0.20738099657676437, 0.04379971025892618, 0.07885941211557523, 0.019472463134760885, 0.2853265358177437, 0.18001631279052657, 0.13885831109840763, -0.2874892442825843, 0.08773045643994754, 0.025482057394798505] |
1,801.10428 | Straight knots | Jablan and Radovi\'c originally defined two invariants called the Meander
number and OGC number of knots for certain classes of knots. We generalize
these definitions to all knots and name the straight number and contained
straight number of a knot, respectively, and prove they are well defined. We
answer two questions and prove a generalization of a conjecture of Jablan and
Radovi\'c. We also give some relations to crossing number and petal number.
Then we compute the straight numbers for all the knots in the standard knot
table and present some interesting questions and the complete table of knots
with 10 or fewer crossing and their straight number and contained straight
number.
| math.GT | jablan and radovic originally defined two invariants called the meander number and ogc number of knots for certain classes of knots we generalize these definitions to all knots and name the straight number and contained straight number of a knot respectively and prove they are well defined we answer two questions and prove a generalization of a conjecture of jablan and radovic we also give some relations to crossing number and petal number then we compute the straight numbers for all the knots in the standard knot table and present some interesting questions and the complete table of knots with 10 or fewer crossing and their straight number and contained straight number | [['jablan', 'and', 'radovic', 'originally', 'defined', 'two', 'invariants', 'called', 'the', 'meander', 'number', 'and', 'ogc', 'number', 'of', 'knots', 'for', 'certain', 'classes', 'of', 'knots', 'we', 'generalize', 'these', 'definitions', 'to', 'all', 'knots', 'and', 'name', 'the', 'straight', 'number', 'and', 'contained', 'straight', 'number', 'of', 'a', 'knot', 'respectively', 'and', 'prove', 'they', 'are', 'well', 'defined', 'we', 'answer', 'two', 'questions', 'and', 'prove', 'a', 'generalization', 'of', 'a', 'conjecture', 'of', 'jablan', 'and', 'radovic', 'we', 'also', 'give', 'some', 'relations', 'to', 'crossing', 'number', 'and', 'petal', 'number', 'then', 'we', 'compute', 'the', 'straight', 'numbers', 'for', 'all', 'the', 'knots', 'in', 'the', 'standard', 'knot', 'table', 'and', 'present', 'some', 'interesting', 'questions', 'and', 'the', 'complete', 'table', 'of', 'knots', 'with', '10', 'or', 'fewer', 'crossing', 'and', 'their', 'straight', 'number', 'and', 'contained', 'straight', 'number']] | [-0.23677718265597442, 0.11798979094601236, -0.014313883148133755, 0.08894145397269833, -0.09674326159958062, -0.15847883948507452, 0.052091800830177296, 0.3491690043759133, -0.2600494305869298, -0.39252251465638566, 0.08688357580831507, -0.25860356890188996, -0.12164655490154733, 0.21556450525323662, -0.09160944345473711, 0.037501189117652496, 0.04017498725443147, 0.0642270743046538, -0.018503153876476323, -0.2683317464377199, 0.2945522523701324, -0.07656849406859172, 0.15376956301874348, 0.08082415419007052, 0.06567239757610618, -0.00591761788070601, -0.07425960445211136, 0.08593258231745235, -0.18419671051170944, 0.12565540280619253, 0.19350829150062054, 0.14209769901935942, 0.16436034539531516, -0.41074206004850566, -0.10073135682406635, 0.1573496949193733, 0.17618807372387632, 0.03828953973217202, 0.014203931282671485, -0.2354253612388025, 0.1032770214161636, -0.15689941220002115, -0.1626935688213312, -0.030220974612997713, 0.05186527214079563, 0.10024328095771905, -0.1187809966234324, -0.013334997832186803, 0.06111756395486217, 0.08792552113365153, 0.040859680651919916, -0.12581061307823152, -0.007014871539597932, 0.12886851743990388, 0.030176049994671366, 0.02602301918003442, 0.04861833713532958, -0.14197759882413916, -0.14150531206230102, 0.35578763272081104, 0.03185708948876709, -0.205434245165504, 0.17761042567768268, -0.12353528863916706, -0.18236631828975597, 0.16251442513229059, 0.07122771658136376, 0.11848165670276753, -0.007299800245423934, 0.012853314549179881, -0.1732704576903156, 0.07626622141106054, 0.17901536398650414, 0.01330490134257291, 0.17943600932734885, 0.02036424070995833, 0.020039960675473725, 0.17126847549973587, -0.08085564181341656, -0.03230093662776718, -0.35229933852679096, -0.24847305912408046, -0.10480075960887396, 0.039901798320767866, -0.06781457195393159, -0.2129355120622287, 0.4181336831367974, 0.08156587127762448, 0.2539285233443869, 0.15947627239594503, 0.24269811948761344, 0.01188629710148754, 0.025965800461043336, 0.1517882099745163, 0.09156128709115105, 0.16032281532950168, -0.0082088461744466, -0.06505718787437738, -0.020320366835221648, 0.16745175049540453] |
1,801.10429 | Quasi-Fuchsian co-Minkowski manifolds | This survey is an introduction to the geometry of co-Minkowksi space, the
space of unoriented spacelike hyperplanes of the Minkowski space. Affine
deformations of cocompact lattices of hyperbolic isometries act on it, in a way
similar to the way that quasi-Fuchsian groups act on hyperbolic space. In
particular, there is a convex core. There is also a unique "mean" hypersurface,
i.e. with traceless second fundamental form. The mean distance between the mean
hypersurface and the lower boundary of the convex core endows the space of
affine deformations of a given lattice with an asymmetric norm. The
symmetrization of the asymmetric norm is simply the volume of the convex core.
In dimension 2+1, the asymmetric norm is the total length of the bending
lamination of the lower boundary component of the convex core. We obtain an
extrinsic proof of a theorem of Thurston saying that, on the tangent space of
Teichm\"{u}ller space, the total length of measured geodesic laminations is an
asymmetric norm.
We also exhibit and comment the Anosov-like character of these deformations,
similar to the Anosov character of the quasi-Fuchsians representations pointed
out in Guichard--Wienhard.
| math.DG | this survey is an introduction to the geometry of cominkowksi space the space of unoriented spacelike hyperplanes of the minkowski space affine deformations of cocompact lattices of hyperbolic isometries act on it in a way similar to the way that quasifuchsian groups act on hyperbolic space in particular there is a convex core there is also a unique mean hypersurface ie with traceless second fundamental form the mean distance between the mean hypersurface and the lower boundary of the convex core endows the space of affine deformations of a given lattice with an asymmetric norm the symmetrization of the asymmetric norm is simply the volume of the convex core in dimension 21 the asymmetric norm is the total length of the bending lamination of the lower boundary component of the convex core we obtain an extrinsic proof of a theorem of thurston saying that on the tangent space of teichmuller space the total length of measured geodesic laminations is an asymmetric norm we also exhibit and comment the anosovlike character of these deformations similar to the anosov character of the quasifuchsians representations pointed out in guichardwienhard | [['this', 'survey', 'is', 'an', 'introduction', 'to', 'the', 'geometry', 'of', 'cominkowksi', 'space', 'the', 'space', 'of', 'unoriented', 'spacelike', 'hyperplanes', 'of', 'the', 'minkowski', 'space', 'affine', 'deformations', 'of', 'cocompact', 'lattices', 'of', 'hyperbolic', 'isometries', 'act', 'on', 'it', 'in', 'a', 'way', 'similar', 'to', 'the', 'way', 'that', 'quasifuchsian', 'groups', 'act', 'on', 'hyperbolic', 'space', 'in', 'particular', 'there', 'is', 'a', 'convex', 'core', 'there', 'is', 'also', 'a', 'unique', 'mean', 'hypersurface', 'ie', 'with', 'traceless', 'second', 'fundamental', 'form', 'the', 'mean', 'distance', 'between', 'the', 'mean', 'hypersurface', 'and', 'the', 'lower', 'boundary', 'of', 'the', 'convex', 'core', 'endows', 'the', 'space', 'of', 'affine', 'deformations', 'of', 'a', 'given', 'lattice', 'with', 'an', 'asymmetric', 'norm', 'the', 'symmetrization', 'of', 'the', 'asymmetric', 'norm', 'is', 'simply', 'the', 'volume', 'of', 'the', 'convex', 'core', 'in', 'dimension', '21', 'the', 'asymmetric', 'norm', 'is', 'the', 'total', 'length', 'of', 'the', 'bending', 'lamination', 'of', 'the', 'lower', 'boundary', 'component', 'of', 'the', 'convex', 'core', 'we', 'obtain', 'an', 'extrinsic', 'proof', 'of', 'a', 'theorem', 'of', 'thurston', 'saying', 'that', 'on', 'the', 'tangent', 'space', 'of', 'teichmuller', 'space', 'the', 'total', 'length', 'of', 'measured', 'geodesic', 'laminations', 'is', 'an', 'asymmetric', 'norm', 'we', 'also', 'exhibit', 'and', 'comment', 'the', 'anosovlike', 'character', 'of', 'these', 'deformations', 'similar', 'to', 'the', 'anosov', 'character', 'of', 'the', 'quasifuchsians', 'representations', 'pointed', 'out', 'in', 'guichardwienhard']] | [-0.17926599742373922, 0.11875714839258293, -0.11381217928738896, 0.053485393522250985, -0.10068447495155691, -0.06184632460341103, -0.017173104356605927, 0.3581761545092277, -0.32034030982426237, -0.1899169547544731, 0.09858842180487905, -0.2753461738383131, -0.14777810475021436, 0.1694192889218147, -0.14399630614175143, 0.011336417157448583, 0.032904529185443704, 0.10141119524672791, -0.13259321869770577, -0.26347293443773145, 0.39918271146182505, 0.015420136832540015, 0.251279048442554, 0.07753594815897356, 0.13985009775957563, 0.0036980262522554987, -0.0064909063653181215, 0.030421674749359827, -0.14787994656536874, 0.17699361848900771, 0.20619257127707516, 0.0762209407147276, 0.2024035128844124, -0.3730368703248102, -0.17876980004443244, 0.17177182933377041, 0.1095131173126072, 0.011529066364516269, -0.00953554765226647, -0.28991429789431883, 0.024193772698169226, -0.08294370185051646, -0.18594206174180566, -0.016273742464913445, 0.061752408814544864, -0.012449376762251031, -0.17086907440366653, 0.0624939469837425, 0.13317784210308814, 0.09237588086462283, -0.11605759436513456, -0.08731810139635435, -0.08131128342330947, 0.09227104746841487, 0.034382755880929775, 0.09859443236152632, 0.11958607531838365, -0.05236069511258872, -0.07401589747354552, 0.38388866066144633, -0.05050427414819721, -0.26716283803989926, 0.13633738857934477, -0.16338424006947777, -0.0983643680491106, 0.16170655458635946, 0.1746921972576324, 0.13236851585967527, -0.044364057292353876, 0.15591474152157328, -0.1091913678030903, 0.09954126073485035, 0.09307993764241973, 0.005550560325570916, 0.15768051490310456, 0.1225710347106752, 0.17561346283028986, 0.1624490674856953, -0.04927447979251475, -0.08788771270313761, -0.4037148055139479, -0.22234243354350738, -0.18701551684592901, 0.08915307585170472, -0.16559044199027914, -0.22125607608321154, 0.3345358896550241, -0.011219525453890418, 0.2163178856077778, 0.08060656762221358, 0.22673737261812765, 0.050650666087256886, 0.09145627153498775, 0.09691302397078579, 0.2135847524258789, 0.17564044127133316, -0.019394737847435933, -0.2031681314125148, -0.027495149359270766, 0.16538977048584966] |
1,801.1043 | Robust Designs of Beamforming and Power Splitting for Distributed
Antenna Systems with Wireless Energy Harvesting | In this paper, we investigate a multiuser distributed antenna system with
simultaneous wireless information and power transmission under the assumption
of imperfect channel state information (CSI). In this system, a distributed
antenna port with multiple antennas supports a set of mobile stations who can
decode information and harvest energy simultaneously via a power splitter. To
design robust transmit beamforming vectors and the power splitting (PS) factors
in the presence of CSI errors, we maximize the average worst-case
signal-to-interference-plus- noise ratio (SINR) while achieving individual
energy harvesting constraint for each mobile station. First, we develop an
efficient algorithm to convert the max-min SINR problem to a set of "dual"
min-max power balancing problems. Then, motivated by the penalty function
method, an iterative algorithm based on semi-definite programming (SDP) is
proposed to achieve a local optimal rank-one solution. Also, to reduce the
computational complexity, we present another iterative scheme based on the
Lagrangian method and the successive convex approximation (SCA) technique to
yield a suboptimal solution. Simulation results are shown to validate the
robustness and effectiveness of the proposed algorithms.
| cs.IT math.IT | in this paper we investigate a multiuser distributed antenna system with simultaneous wireless information and power transmission under the assumption of imperfect channel state information csi in this system a distributed antenna port with multiple antennas supports a set of mobile stations who can decode information and harvest energy simultaneously via a power splitter to design robust transmit beamforming vectors and the power splitting ps factors in the presence of csi errors we maximize the average worstcase signaltointerferenceplus noise ratio sinr while achieving individual energy harvesting constraint for each mobile station first we develop an efficient algorithm to convert the maxmin sinr problem to a set of dual minmax power balancing problems then motivated by the penalty function method an iterative algorithm based on semidefinite programming sdp is proposed to achieve a local optimal rankone solution also to reduce the computational complexity we present another iterative scheme based on the lagrangian method and the successive convex approximation sca technique to yield a suboptimal solution simulation results are shown to validate the robustness and effectiveness of the proposed algorithms | [['in', 'this', 'paper', 'we', 'investigate', 'a', 'multiuser', 'distributed', 'antenna', 'system', 'with', 'simultaneous', 'wireless', 'information', 'and', 'power', 'transmission', 'under', 'the', 'assumption', 'of', 'imperfect', 'channel', 'state', 'information', 'csi', 'in', 'this', 'system', 'a', 'distributed', 'antenna', 'port', 'with', 'multiple', 'antennas', 'supports', 'a', 'set', 'of', 'mobile', 'stations', 'who', 'can', 'decode', 'information', 'and', 'harvest', 'energy', 'simultaneously', 'via', 'a', 'power', 'splitter', 'to', 'design', 'robust', 'transmit', 'beamforming', 'vectors', 'and', 'the', 'power', 'splitting', 'ps', 'factors', 'in', 'the', 'presence', 'of', 'csi', 'errors', 'we', 'maximize', 'the', 'average', 'worstcase', 'signaltointerferenceplus', 'noise', 'ratio', 'sinr', 'while', 'achieving', 'individual', 'energy', 'harvesting', 'constraint', 'for', 'each', 'mobile', 'station', 'first', 'we', 'develop', 'an', 'efficient', 'algorithm', 'to', 'convert', 'the', 'maxmin', 'sinr', 'problem', 'to', 'a', 'set', 'of', 'dual', 'minmax', 'power', 'balancing', 'problems', 'then', 'motivated', 'by', 'the', 'penalty', 'function', 'method', 'an', 'iterative', 'algorithm', 'based', 'on', 'semidefinite', 'programming', 'sdp', 'is', 'proposed', 'to', 'achieve', 'a', 'local', 'optimal', 'rankone', 'solution', 'also', 'to', 'reduce', 'the', 'computational', 'complexity', 'we', 'present', 'another', 'iterative', 'scheme', 'based', 'on', 'the', 'lagrangian', 'method', 'and', 'the', 'successive', 'convex', 'approximation', 'sca', 'technique', 'to', 'yield', 'a', 'suboptimal', 'solution', 'simulation', 'results', 'are', 'shown', 'to', 'validate', 'the', 'robustness', 'and', 'effectiveness', 'of', 'the', 'proposed', 'algorithms']] | [-0.209251571090217, -0.04883739514406535, -0.06338413492802614, 0.010114053665173732, -0.09618571207052871, -0.24105744449496322, 0.13037387413310222, 0.3875180943398161, -0.2965577592068676, -0.31438833934495625, 0.0813361920129895, -0.2375843989626201, -0.18667973713554295, 0.11885466066639075, -0.1440495891350039, 0.11327882539847176, 0.055734192165075226, 0.016084032402677317, -0.04947934824753594, -0.2769289572750679, 0.24839864181631946, 0.14919414983936743, 0.3734392921251946, 0.015551636975554206, 0.15241416277928968, 0.02876369026881967, 0.0006138375807250065, -0.0014530925572002202, -0.0728120601064332, 0.1100144251302052, 0.3304565072705802, 0.22588550995322784, 0.30976914231445685, -0.43804360450581603, -0.1873404352161824, 0.10995771361677123, 0.12548643799912018, 0.06612015415108606, -0.050810633190604075, -0.24332310449792427, 0.14924872003030032, -0.1905525217180695, -0.013935202212083372, -0.030027890530822988, -0.12043146391953813, 0.0467590124701448, -0.40666553034352954, -0.006501329902021916, -0.013131107829067741, -0.023162158560910355, -0.07587198267450158, -0.14823574660309288, 0.061116949521695794, 0.10570056721557643, 0.02080644752171016, -0.02567173102857503, 0.12253801124739419, -0.045086746844410726, -0.12822859912180679, 0.32870137976302494, -0.0013728566125056215, -0.26753648485742465, 0.09982930900812871, -0.02923856957376087, -0.09110614371203472, 0.20327255544200373, 0.2831119902770747, 0.11550646912034475, -0.18569397616979738, 0.024306080114093787, -0.01092440966160947, 0.21355789489887153, 0.07106006304142222, 0.08943715219037984, 0.13108532496445466, 0.18603585395710856, 0.2106110156419572, 0.166190195470274, -0.09409379267808719, -0.10009555480040065, -0.20869983900554237, -0.1165631142355962, -0.24556515963023445, -0.002843443476961235, -0.11024735578860018, -0.07453518302563782, 0.3671572649102549, 0.1361043774208912, 0.11000277874127994, 0.14221406859879412, 0.4573070232369257, 0.13308552885379019, -0.015497930622607303, 0.15393584696157428, 0.19728095205945453, 0.11656057397184862, 0.12062476519259802, -0.2855097930669115, 0.019725589640176948, 0.04896056936174799] |
1,801.10431 | On the size of the set $AA+A$ | It is established that there exists an absolute constant $c>0$ such that for
any finite set $A$ of positive real numbers $$|AA+A| \gg |A|^{\frac{3}{2}+c}.$$
On the other hand, we give an explicit construction of a finite set $A \subset
\mathbb R$ such that $|AA+A|=o(|A|^2)$, disproving a conjecture of Balog.
| math.CO | it is established that there exists an absolute constant c0 such that for any finite set a of positive real numbers aaa gg afrac32c on the other hand we give an explicit construction of a finite set a subset mathbb r such that aaaoa2 disproving a conjecture of balog | [['it', 'is', 'established', 'that', 'there', 'exists', 'an', 'absolute', 'constant', 'c0', 'such', 'that', 'for', 'any', 'finite', 'set', 'a', 'of', 'positive', 'real', 'numbers', 'aaa', 'gg', 'afrac32c', 'on', 'the', 'other', 'hand', 'we', 'give', 'an', 'explicit', 'construction', 'of', 'a', 'finite', 'set', 'a', 'subset', 'mathbb', 'r', 'such', 'that', 'aaaoa2', 'disproving', 'a', 'conjecture', 'of', 'balog']] | [-0.21917278902664622, 0.11337044257039026, -0.045144294824530466, 0.03149743664742229, -0.0642954669100173, -0.18054700745864116, 0.04840804109389477, 0.3231330969707763, -0.23887264239106407, -0.165595865313043, 0.12604438276723662, -0.27935523996030553, -0.12375861140800283, 0.2606870797165531, -0.05660533502777206, -0.010533895026496116, 0.04022485468576246, 0.12034912328136728, -0.030319819774260705, -0.2912441921634649, 0.3228114003196676, -0.09990018693373558, 0.18267228119471607, 0.12836268557077077, 0.16332486976294758, -0.015311105295698693, 0.030862048882594768, 0.05583093525405894, -0.20606597185743591, 0.06632888909587835, 0.2340766626925386, 0.18089741257395833, 0.30320006759559853, -0.3213609954976338, -0.15437440559245705, 0.2416714039690634, 0.11472980122260273, 0.05438214522647731, -0.11675875813531827, -0.20068629502140461, 0.18169120930016358, -0.1665372999900199, -0.1489931739311903, -0.07518659970980693, 0.16149563635600375, -0.02168159028317066, -0.3335182588705991, -0.03480515569606994, 0.12757313128640044, 0.12632377648805368, -0.030695192585203875, -0.15951174289542944, -0.00323876166874741, 0.1076696377564618, -0.01450529320542007, 0.14320332267410815, 0.019003050847652744, -0.05676805320136408, -0.1048051192563899, 0.33534521609544754, -0.09233725685229961, -0.24815872117401439, 0.16753965027709591, -0.11325053559576577, -0.16402122928225932, 0.081938768519049, 0.03406959304467161, 0.15588539394926518, 0.016136186871122806, 0.20765838425289443, -0.19974374701764355, 0.17953876495123544, 0.09978602979173685, -0.019065003217931125, 0.10154720463175723, 0.06784243192127411, 0.1502303639724058, 0.05704929504389974, 0.011688014873838488, 0.029818471194185476, -0.44101949535468793, -0.17722889670589442, -0.22593015295631708, 0.1633197417126057, -0.15377888379697788, -0.29331979425029553, 0.27196005042246046, 0.07514920736108213, 0.21607252434292373, 0.12725621408366777, 0.22834701141332614, 0.08954247251274361, 0.01539151454245315, 0.07925074057098716, 0.09712715985927176, 0.0855597895074715, -0.06040208127864815, -0.1546774902975464, 0.036036626881662204, 0.12458154372870922] |
1,801.10432 | A Variable Density Sampling Scheme for Compressive Fourier Transform
Interferometry | Fourier Transform Interferometry (FTI) is an appealing Hyperspectral (HS)
imaging modality for many applications demanding high spectral resolution,
e.g., in fluorescence microscopy. However, the effective resolution of FTI is
limited by the durability of biological elements when exposed to illuminating
light. Overexposed elements are subject to photo-bleaching and become unable to
fluoresce. In this context, the acquisition of biological HS volumes based on
sampling the Optical Path Difference (OPD) axis at Nyquist rate leads to
unpleasant trade-offs between spectral resolution, quality of the HS volume,
and light exposure intensity. We propose two variants of the FTI imager, i.e.,
Coded Illumination-FTI (CI-FTI) and Structured Illumination FTI (SI-FTI), based
on the theory of compressive sensing (CS). These schemes efficiently modulate
light exposure temporally (in CI-FTI) or spatiotemporally (in SI-FTI).
Leveraging a variable density sampling strategy recently introduced in CS, we
provide near-optimal illumination strategies, so that the light exposure
imposed on a biological specimen is minimized while the spectral resolution is
preserved. Our analysis focuses on two criteria: (i) a trade-off between
exposure intensity and the quality of the reconstructed HS volume for a given
spectral resolution; (ii) maximizing HS volume quality for a fixed spectral
resolution and constrained exposure budget. Our contributions can be adapted to
an FTI imager without hardware modifications. The reconstruction of HS volumes
from CS-FTI measurements relies on an $l_1$-norm minimization problem promoting
a spatiospectral sparsity prior. Numerically, we support the proposed methods
on synthetic data and simulated CS measurements (from actual FTI measurements)
under various scenarios. In particular, the biological HS volumes can be
reconstructed with a three-to-ten-fold reduction in the light exposure.
| cs.IT math.IT | fourier transform interferometry fti is an appealing hyperspectral hs imaging modality for many applications demanding high spectral resolution eg in fluorescence microscopy however the effective resolution of fti is limited by the durability of biological elements when exposed to illuminating light overexposed elements are subject to photobleaching and become unable to fluoresce in this context the acquisition of biological hs volumes based on sampling the optical path difference opd axis at nyquist rate leads to unpleasant tradeoffs between spectral resolution quality of the hs volume and light exposure intensity we propose two variants of the fti imager ie coded illuminationfti cifti and structured illumination fti sifti based on the theory of compressive sensing cs these schemes efficiently modulate light exposure temporally in cifti or spatiotemporally in sifti leveraging a variable density sampling strategy recently introduced in cs we provide nearoptimal illumination strategies so that the light exposure imposed on a biological specimen is minimized while the spectral resolution is preserved our analysis focuses on two criteria i a tradeoff between exposure intensity and the quality of the reconstructed hs volume for a given spectral resolution ii maximizing hs volume quality for a fixed spectral resolution and constrained exposure budget our contributions can be adapted to an fti imager without hardware modifications the reconstruction of hs volumes from csfti measurements relies on an l_1norm minimization problem promoting a spatiospectral sparsity prior numerically we support the proposed methods on synthetic data and simulated cs measurements from actual fti measurements under various scenarios in particular the biological hs volumes can be reconstructed with a threetotenfold reduction in the light exposure | [['fourier', 'transform', 'interferometry', 'fti', 'is', 'an', 'appealing', 'hyperspectral', 'hs', 'imaging', 'modality', 'for', 'many', 'applications', 'demanding', 'high', 'spectral', 'resolution', 'eg', 'in', 'fluorescence', 'microscopy', 'however', 'the', 'effective', 'resolution', 'of', 'fti', 'is', 'limited', 'by', 'the', 'durability', 'of', 'biological', 'elements', 'when', 'exposed', 'to', 'illuminating', 'light', 'overexposed', 'elements', 'are', 'subject', 'to', 'photobleaching', 'and', 'become', 'unable', 'to', 'fluoresce', 'in', 'this', 'context', 'the', 'acquisition', 'of', 'biological', 'hs', 'volumes', 'based', 'on', 'sampling', 'the', 'optical', 'path', 'difference', 'opd', 'axis', 'at', 'nyquist', 'rate', 'leads', 'to', 'unpleasant', 'tradeoffs', 'between', 'spectral', 'resolution', 'quality', 'of', 'the', 'hs', 'volume', 'and', 'light', 'exposure', 'intensity', 'we', 'propose', 'two', 'variants', 'of', 'the', 'fti', 'imager', 'ie', 'coded', 'illuminationfti', 'cifti', 'and', 'structured', 'illumination', 'fti', 'sifti', 'based', 'on', 'the', 'theory', 'of', 'compressive', 'sensing', 'cs', 'these', 'schemes', 'efficiently', 'modulate', 'light', 'exposure', 'temporally', 'in', 'cifti', 'or', 'spatiotemporally', 'in', 'sifti', 'leveraging', 'a', 'variable', 'density', 'sampling', 'strategy', 'recently', 'introduced', 'in', 'cs', 'we', 'provide', 'nearoptimal', 'illumination', 'strategies', 'so', 'that', 'the', 'light', 'exposure', 'imposed', 'on', 'a', 'biological', 'specimen', 'is', 'minimized', 'while', 'the', 'spectral', 'resolution', 'is', 'preserved', 'our', 'analysis', 'focuses', 'on', 'two', 'criteria', 'i', 'a', 'tradeoff', 'between', 'exposure', 'intensity', 'and', 'the', 'quality', 'of', 'the', 'reconstructed', 'hs', 'volume', 'for', 'a', 'given', 'spectral', 'resolution', 'ii', 'maximizing', 'hs', 'volume', 'quality', 'for', 'a', 'fixed', 'spectral', 'resolution', 'and', 'constrained', 'exposure', 'budget', 'our', 'contributions', 'can', 'be', 'adapted', 'to', 'an', 'fti', 'imager', 'without', 'hardware', 'modifications', 'the', 'reconstruction', 'of', 'hs', 'volumes', 'from', 'csfti', 'measurements', 'relies', 'on', 'an', 'l_1norm', 'minimization', 'problem', 'promoting', 'a', 'spatiospectral', 'sparsity', 'prior', 'numerically', 'we', 'support', 'the', 'proposed', 'methods', 'on', 'synthetic', 'data', 'and', 'simulated', 'cs', 'measurements', 'from', 'actual', 'fti', 'measurements', 'under', 'various', 'scenarios', 'in', 'particular', 'the', 'biological', 'hs', 'volumes', 'can', 'be', 'reconstructed', 'with', 'a', 'threetotenfold', 'reduction', 'in', 'the', 'light', 'exposure']] | [-0.06423778116448875, 0.09074523067962732, -0.07946875130398669, 0.05393086571045547, -0.04093793868922579, -0.13755724323071, 0.03405809051242572, 0.45615332044006984, -0.2829545583995415, -0.330001741624615, 0.15060138617480487, -0.25499562585356694, -0.12607490442220462, 0.18104403742983624, -0.14904807009227675, 0.07030672764135454, 0.06658827227572306, -0.027281959130466944, -0.08560472537091585, -0.23837107907145777, 0.22591564660618182, 0.0826837588510412, 0.3381855383645103, 0.021876041717669138, 0.12579353659934514, 0.05290487497149192, -0.05411955823887225, 0.017763747044533262, -0.08275586561729642, 0.15645632178314697, 0.25335682665516857, 0.16488539385681394, 0.24813654009281225, -0.44005793021042755, -0.24791765678585115, 0.0705241726738941, 0.10826123429177718, 0.04489586359682628, -0.08451239393138903, -0.2785774459769125, 0.03217640814257213, -0.0567431083155213, -0.04382703906877805, -0.07541743594840283, -0.03178425886284361, 0.003998149335890909, -0.30904905240403363, 0.07759128799890826, -0.031840096082083366, 0.09348303771343168, -0.11099859142768417, -0.09261084772035025, 0.016293393747920156, 0.08125231419887681, 0.01150982551816993, 0.009917107954592878, 0.12620496918369112, -0.13229172042738077, -0.066172773148669, 0.3576779195484314, -0.04123643489478099, -0.1839935866678631, 0.2028457163664235, -0.11389743223900103, -0.0959483765017682, 0.20988076959757973, 0.157812202130471, 0.12041771183075216, -0.12308843907988355, 0.06773074868335993, 0.033500158343062456, 0.2529026529136761, 0.1351701352720412, 0.11200942085586658, 0.17206838037472647, 0.1965566228822812, 0.09050249186489297, 0.11974989534297936, -0.1937647747832976, -0.015532347432316374, -0.21151135563281656, -0.13720388127533534, -0.22092804056414553, 0.03091255242257372, -0.09661873579098583, -0.115970654983628, 0.3662278489418826, 0.1359190595467781, 0.1781662490524579, -0.001546529798860882, 0.3613139750615459, 0.07396780892998649, 0.052161497217993485, -0.022853733776208324, 0.18771340179555687, 0.11476944216201793, 0.1319071326079558, -0.23989613666128054, 0.031449402085299255, 0.02618142200779625] |
1,801.10433 | Hierarchical restricted isometry property for Kronecker product
measurements | Hierarchically sparse signals and Kronecker product structured measurements
arise naturally in a variety of applications. The simplest example of a
hierarchical sparsity structure is two-level $(s,\sigma)$-hierarchical sparsity
which features $s$-block-sparse signals with $\sigma$-sparse blocks. For a
large class of algorithms recovery guarantees can be derived based on the
restricted isometry property (RIP) of the measurement matrix and model-based
variants thereof. We show that given two matrices $\mathbf{A}$ and $\mathbf{B}$
having the standard $s$-sparse and $\sigma$-sparse RIP their Kronecker product
$\mathbf{A}\otimes\mathbf{B}$ has two-level $(s,\sigma)$-hierarchically sparse
RIP (HiRIP). This result can be recursively generalized to signals with
multiple hierarchical sparsity levels and measurements with multiple Kronecker
product factors. As a corollary we establish the efficient reconstruction of
hierarchical sparse signals from Kronecker product measurements using the HiHTP
algorithm. We argue that Kronecker product measurement matrices allow to design
large practical compressed sensing systems that are deterministically certified
to reliably recover signals in a stable fashion. We elaborate on their
motivation from the perspective of applications.
| cs.IT math.IT | hierarchically sparse signals and kronecker product structured measurements arise naturally in a variety of applications the simplest example of a hierarchical sparsity structure is twolevel ssigmahierarchical sparsity which features sblocksparse signals with sigmasparse blocks for a large class of algorithms recovery guarantees can be derived based on the restricted isometry property rip of the measurement matrix and modelbased variants thereof we show that given two matrices mathbfa and mathbfb having the standard ssparse and sigmasparse rip their kronecker product mathbfaotimesmathbfb has twolevel ssigmahierarchically sparse rip hirip this result can be recursively generalized to signals with multiple hierarchical sparsity levels and measurements with multiple kronecker product factors as a corollary we establish the efficient reconstruction of hierarchical sparse signals from kronecker product measurements using the hihtp algorithm we argue that kronecker product measurement matrices allow to design large practical compressed sensing systems that are deterministically certified to reliably recover signals in a stable fashion we elaborate on their motivation from the perspective of applications | [['hierarchically', 'sparse', 'signals', 'and', 'kronecker', 'product', 'structured', 'measurements', 'arise', 'naturally', 'in', 'a', 'variety', 'of', 'applications', 'the', 'simplest', 'example', 'of', 'a', 'hierarchical', 'sparsity', 'structure', 'is', 'twolevel', 'ssigmahierarchical', 'sparsity', 'which', 'features', 'sblocksparse', 'signals', 'with', 'sigmasparse', 'blocks', 'for', 'a', 'large', 'class', 'of', 'algorithms', 'recovery', 'guarantees', 'can', 'be', 'derived', 'based', 'on', 'the', 'restricted', 'isometry', 'property', 'rip', 'of', 'the', 'measurement', 'matrix', 'and', 'modelbased', 'variants', 'thereof', 'we', 'show', 'that', 'given', 'two', 'matrices', 'mathbfa', 'and', 'mathbfb', 'having', 'the', 'standard', 'ssparse', 'and', 'sigmasparse', 'rip', 'their', 'kronecker', 'product', 'mathbfaotimesmathbfb', 'has', 'twolevel', 'ssigmahierarchically', 'sparse', 'rip', 'hirip', 'this', 'result', 'can', 'be', 'recursively', 'generalized', 'to', 'signals', 'with', 'multiple', 'hierarchical', 'sparsity', 'levels', 'and', 'measurements', 'with', 'multiple', 'kronecker', 'product', 'factors', 'as', 'a', 'corollary', 'we', 'establish', 'the', 'efficient', 'reconstruction', 'of', 'hierarchical', 'sparse', 'signals', 'from', 'kronecker', 'product', 'measurements', 'using', 'the', 'hihtp', 'algorithm', 'we', 'argue', 'that', 'kronecker', 'product', 'measurement', 'matrices', 'allow', 'to', 'design', 'large', 'practical', 'compressed', 'sensing', 'systems', 'that', 'are', 'deterministically', 'certified', 'to', 'reliably', 'recover', 'signals', 'in', 'a', 'stable', 'fashion', 'we', 'elaborate', 'on', 'their', 'motivation', 'from', 'the', 'perspective', 'of', 'applications']] | [-0.10613000475747797, 0.09064854582389578, -0.0539872554035332, 0.02642132788269709, -0.10791698561157458, -0.188531487269733, 0.013940693412083559, 0.39850381209712044, -0.38185442751273513, -0.2463529482901765, 0.17519232142531577, -0.20857389410659194, -0.21787672738756578, 0.12553680908436385, -0.08627480112660962, 0.1002446810882061, 0.1261356778245849, 0.04948602532609724, -0.14766705182951112, -0.22706434023656094, 0.30423980963547737, 0.04574622826886554, 0.2902127866730622, -0.06333536257704672, 0.10547832720196591, 0.04503850963933823, -0.005906288498618568, -0.010733614375707336, -0.04662174492911548, 0.14608389174547762, 0.313658418006992, 0.2282092931690829, 0.23798867302069154, -0.42975528496436965, -0.1651084610583404, 0.16408867603585792, 0.14073729739287116, 0.10746538938390306, -0.07418489469012293, -0.3102219116945679, 0.11193602147380798, -0.1875114985383474, -0.025146688854035277, -0.1343117951302049, -0.08026622244133017, -0.02115468890704692, -0.37804125813440453, 0.085057981792115, 0.05843741931498815, -0.012803154907977352, -0.023342355641011052, -0.1459552951139183, 0.09593565639284535, 0.10113038554883157, -0.004484608268681675, -0.06922633382969369, 0.14317518821618974, -0.05624307368028288, -0.13621213971055113, 0.3697019582315802, -0.049023871690270684, -0.22564766326775917, 0.16347460739183214, -0.11372459295037118, -0.20842168447919762, 0.09423523088797736, 0.20980840186492947, 0.06644571166133317, -0.10251814519011905, 0.10461963225829188, -0.09153590337015115, 0.14788599256187296, 0.08194439835617044, 0.06260467971113916, 0.12402485165251001, 0.11740546389065014, 0.08225512933224821, 0.1298739953594915, -0.028065287203599628, -0.014636696979719907, -0.21028105545683035, -0.1201918600530077, -0.22854618398615947, 0.0479835332192194, -0.20556721930906627, -0.19934825693221334, 0.3873942020850686, 0.09070636524866597, 0.24345372082331243, 0.09716355317579702, 0.3263915591538908, 0.0640869319337444, 0.08695556678009243, 0.03630789990524928, 0.16641273537728316, 0.22334768193123195, 0.03174406410051653, -0.10542730181716764, 0.08142349277384198, 0.067414592163494] |
1,801.10434 | Robust 3D Human Motion Reconstruction Via Dynamic Template Construction | In multi-view human body capture systems, the recovered 3D geometry or even
the acquired imagery data can be heavily corrupted due to occlusions, noise,
limited field of- view, etc. Direct estimation of 3D pose, body shape or motion
on these low-quality data has been traditionally challenging.In this paper, we
present a graph-based non-rigid shape registration framework that can
simultaneously recover 3D human body geometry and estimate pose/motion at high
fidelity.Our approach first generates a global full-body template by
registering all poses in the acquired motion sequence.We then construct a
deformable graph by utilizing the rigid components in the global template. We
directly warp the global template graph back to each motion frame in order to
fill in missing geometry. Specifically, we combine local rigidity and temporal
coherence constraints to maintain geometry and motion consistencies.
Comprehensive experiments on various scenes show that our method is accurate
and robust even in the presence of drastic motions.
| cs.CV cs.GR | in multiview human body capture systems the recovered 3d geometry or even the acquired imagery data can be heavily corrupted due to occlusions noise limited field of view etc direct estimation of 3d pose body shape or motion on these lowquality data has been traditionally challengingin this paper we present a graphbased nonrigid shape registration framework that can simultaneously recover 3d human body geometry and estimate posemotion at high fidelityour approach first generates a global fullbody template by registering all poses in the acquired motion sequencewe then construct a deformable graph by utilizing the rigid components in the global template we directly warp the global template graph back to each motion frame in order to fill in missing geometry specifically we combine local rigidity and temporal coherence constraints to maintain geometry and motion consistencies comprehensive experiments on various scenes show that our method is accurate and robust even in the presence of drastic motions | [['in', 'multiview', 'human', 'body', 'capture', 'systems', 'the', 'recovered', '3d', 'geometry', 'or', 'even', 'the', 'acquired', 'imagery', 'data', 'can', 'be', 'heavily', 'corrupted', 'due', 'to', 'occlusions', 'noise', 'limited', 'field', 'of', 'view', 'etc', 'direct', 'estimation', 'of', '3d', 'pose', 'body', 'shape', 'or', 'motion', 'on', 'these', 'lowquality', 'data', 'has', 'been', 'traditionally', 'challengingin', 'this', 'paper', 'we', 'present', 'a', 'graphbased', 'nonrigid', 'shape', 'registration', 'framework', 'that', 'can', 'simultaneously', 'recover', '3d', 'human', 'body', 'geometry', 'and', 'estimate', 'posemotion', 'at', 'high', 'fidelityour', 'approach', 'first', 'generates', 'a', 'global', 'fullbody', 'template', 'by', 'registering', 'all', 'poses', 'in', 'the', 'acquired', 'motion', 'sequencewe', 'then', 'construct', 'a', 'deformable', 'graph', 'by', 'utilizing', 'the', 'rigid', 'components', 'in', 'the', 'global', 'template', 'we', 'directly', 'warp', 'the', 'global', 'template', 'graph', 'back', 'to', 'each', 'motion', 'frame', 'in', 'order', 'to', 'fill', 'in', 'missing', 'geometry', 'specifically', 'we', 'combine', 'local', 'rigidity', 'and', 'temporal', 'coherence', 'constraints', 'to', 'maintain', 'geometry', 'and', 'motion', 'consistencies', 'comprehensive', 'experiments', 'on', 'various', 'scenes', 'show', 'that', 'our', 'method', 'is', 'accurate', 'and', 'robust', 'even', 'in', 'the', 'presence', 'of', 'drastic', 'motions']] | [-0.06869824577433367, -0.006367049148927132, -0.08938766343945947, 0.04348014711014306, -0.10128455615291992, -0.12409543849838277, -0.025763452398435523, 0.44103811661402387, -0.2959364634628097, -0.3737204017583281, 0.11255733063289275, -0.2480243989949425, -0.18386163235059938, 0.12273361646841902, -0.21868202452082186, 0.08368084930271531, 0.136027060089012, 0.01574667969097694, -0.06386342950320492, -0.15877606053099347, 0.2801179383182898, 0.002890021620939175, 0.288488152474165, -0.03211677622515708, 0.1447735208987433, 0.0558809395118927, -0.07127005841874051, 0.07943072554655373, -0.07471797526241668, 0.18114662230946124, 0.24211239678785204, 0.13874473113411417, 0.20906280616919198, -0.49073124196380374, -0.2542268152907491, 0.07700512390118092, 0.1305912217622002, 0.1535220245209833, -0.05886212539238234, -0.36235334594345964, 0.0880161840096116, -0.12457445915400361, -0.06858470994358261, -0.13642659357748926, 0.01152420078481858, -0.050167775561567395, -0.2522427291423082, 0.0871786557044834, 0.06414990693175544, 0.07279154088658592, -0.11347195896242435, -0.035159261875475446, -0.006187327716033906, 0.21966716478889187, 0.025428203411089877, 0.058723866520449516, 0.17804333561720947, -0.1738295580338066, -0.0779688104063583, 0.3984324503565828, -0.024303700139280408, -0.2552153397180761, 0.20920397334111235, -0.14955875865494211, -0.12490162450820208, 0.1794289407785982, 0.2522645898299137, 0.11942621085327118, -0.17463253169630966, 0.036941612448232866, -0.029366310624754987, 0.18827158180996775, 0.0666938953831171, -0.025844635323931775, 0.22994372145816064, 0.16340637712428968, 0.06593057340588226, 0.12563805030426012, -0.1875233200514534, -0.035336817841356, -0.22993190644308925, -0.07495713412519156, -0.19166198454486827, -0.024662351167450348, -0.09957292654105307, -0.13719219042085265, 0.38706861150140565, 0.1901267517109712, 0.25194447140209375, 0.03552630844370772, 0.3954669575517376, 0.007795529836633553, 0.061886839830937485, 0.04137232574944695, 0.22437657841170827, 0.0187936404440552, 0.0880142710916698, -0.17879750286228954, 0.06265772470273077, 0.06670717654904972] |
1,801.10435 | Constitutive theory of inhomogeneous turbulent flow based on two-scale
Lagrangian formalism | A closure theory is developed for inhomogeneous turbulent flow, which enables
a systematic derivation of the turbulence constitutive relations without
relying on any empirical parameters. Renormalized-perturbation approximation is
performed in the convective coordinate frame based on the mean flow,
successfully incorporating the convective integration in generally covariant
manner.
| physics.flu-dyn | a closure theory is developed for inhomogeneous turbulent flow which enables a systematic derivation of the turbulence constitutive relations without relying on any empirical parameters renormalizedperturbation approximation is performed in the convective coordinate frame based on the mean flow successfully incorporating the convective integration in generally covariant manner | [['a', 'closure', 'theory', 'is', 'developed', 'for', 'inhomogeneous', 'turbulent', 'flow', 'which', 'enables', 'a', 'systematic', 'derivation', 'of', 'the', 'turbulence', 'constitutive', 'relations', 'without', 'relying', 'on', 'any', 'empirical', 'parameters', 'renormalizedperturbation', 'approximation', 'is', 'performed', 'in', 'the', 'convective', 'coordinate', 'frame', 'based', 'on', 'the', 'mean', 'flow', 'successfully', 'incorporating', 'the', 'convective', 'integration', 'in', 'generally', 'covariant', 'manner']] | [-0.13260515631632286, 0.1107123779489639, -0.16031692807557696, 0.04281883094796633, -0.13854844306417285, -0.04131505897942376, 0.012209965317371362, 0.34291396361399207, -0.23156699688827737, -0.26707019910533375, 0.04144654099512449, -0.17216293987362308, -0.11082298681139946, 0.193100844371192, -0.036629636222100324, 0.10157595229077529, 0.05622353880329335, 0.007236931710801226, -0.1117666723563316, -0.13460460676256805, 0.3246430389315603, 0.05314315859466157, 0.3378099416917626, -0.021813891989060065, 0.13874460881615572, -0.023733294192463793, -0.12105166949046914, 0.07353634115784093, -0.1641045207197362, 0.12621767878373888, 0.18054387584685327, 0.042923190630972385, 0.26455620141263975, -0.5085181702483208, -0.3270469024935935, 0.003404948840591502, 0.15805549245882541, 0.11543046620406924, -0.004102542208745442, -0.2275502933783734, 0.02710735782029781, -0.18804731111022385, -0.0877649445641548, -0.09369935801728292, 0.0015609742716905918, 0.006258835936797426, -0.32386428839031683, 0.1275226538208254, 0.07124677692302206, 0.16217827927717504, -0.10611172787290304, -0.03397813268956986, -0.0011260594498920947, 0.10338880055326413, 0.0113141571290474, 0.023351504982627454, 0.1606196889237679, -0.08178513822086314, -0.003624125879178656, 0.41901822293058355, -0.0861601983494264, -0.3035586357830053, 0.10436404693098937, -0.08126699975988966, -0.08973981293433524, 0.11057829813278736, 0.15637768928873094, 0.1115389049469315, -0.1925597775806772, 0.07080378985785424, -0.04727517680681132, 0.16424525485552371, 0.023889331483936058, -0.07691297394798156, 0.15406607898903338, 0.19173519264044675, 0.03919428254061557, 0.029947927261286592, -0.08486581430275073, -0.1792208843250224, -0.3696503097865176, -0.10242528313810521, -0.12475673701772665, 0.04459452910467665, -0.12103134668134946, -0.19825259342472604, 0.33730899358287136, 0.12837890769414445, 0.10499020866019294, 0.07036265722684007, 0.3595616712849191, 0.15256832460773753, 0.09295854591170048, 0.1676602314047991, 0.2793518074768338, 0.2195952865394189, 0.12478472295147862, -0.2428748252296305, 0.0995898958632445, 0.180505827782636] |
1,801.10436 | Lower Bounds for Synchronizing Word Lengths in Partial Automata | It was conjectured by \v{C}ern\'y in 1964, that a synchronizing DFA on $n$
states always has a synchronizing word of length at most $(n-1)^2$, and he gave
a sequence of DFAs for which this bound is reached. Until now a full analysis
of all DFAs reaching this bound was only given for $n \leq 5$, and with bounds
on the number of symbols for $n \leq 12$. Here we give the full analysis for $n
\leq 7$, without bounds on the number of symbols.
For PFAs (partial automata) on $\leq 7$ states we do a similar analysis as
for DFAs and find the maximal shortest synchronizing word lengths, exceeding
$(n-1)^2$ for $n \geq 4$. Where DFAs with long synchronization typically have
very few symbols, for PFAs we observe that more symbols may increase the
synchronizing word length. For PFAs on $\leq 10$ states and two symbols we
investigate all occurring synchronizing word lengths.
We give series of PFAs on two and three symbols, reaching the maximal
possible length for some small values of $n$. For $n=6,7,8,9$, the construction
on two symbols is the unique one reaching the maximal length. For both series
the growth is faster than $(n-1)^2$, although still quadratic.
Based on string rewriting, for arbitrary size we construct a PFA on three
symbols with exponential shortest synchronizing word length, giving
significantly better bounds than earlier exponential constructions. We give a
transformation of this PFA to a PFA on two symbols keeping exponential shortest
synchronizing word length, yielding a better bound than applying a similar
known transformation. Both PFAs are transitive.
Finally, we show that exponential lengths are even possible with just one
single undefined transition, again with transitive constructions.
| cs.FL | it was conjectured by vcerny in 1964 that a synchronizing dfa on n states always has a synchronizing word of length at most n12 and he gave a sequence of dfas for which this bound is reached until now a full analysis of all dfas reaching this bound was only given for n leq 5 and with bounds on the number of symbols for n leq 12 here we give the full analysis for n leq 7 without bounds on the number of symbols for pfas partial automata on leq 7 states we do a similar analysis as for dfas and find the maximal shortest synchronizing word lengths exceeding n12 for n geq 4 where dfas with long synchronization typically have very few symbols for pfas we observe that more symbols may increase the synchronizing word length for pfas on leq 10 states and two symbols we investigate all occurring synchronizing word lengths we give series of pfas on two and three symbols reaching the maximal possible length for some small values of n for n6789 the construction on two symbols is the unique one reaching the maximal length for both series the growth is faster than n12 although still quadratic based on string rewriting for arbitrary size we construct a pfa on three symbols with exponential shortest synchronizing word length giving significantly better bounds than earlier exponential constructions we give a transformation of this pfa to a pfa on two symbols keeping exponential shortest synchronizing word length yielding a better bound than applying a similar known transformation both pfas are transitive finally we show that exponential lengths are even possible with just one single undefined transition again with transitive constructions | [['it', 'was', 'conjectured', 'by', 'vcerny', 'in', '1964', 'that', 'a', 'synchronizing', 'dfa', 'on', 'n', 'states', 'always', 'has', 'a', 'synchronizing', 'word', 'of', 'length', 'at', 'most', 'n12', 'and', 'he', 'gave', 'a', 'sequence', 'of', 'dfas', 'for', 'which', 'this', 'bound', 'is', 'reached', 'until', 'now', 'a', 'full', 'analysis', 'of', 'all', 'dfas', 'reaching', 'this', 'bound', 'was', 'only', 'given', 'for', 'n', 'leq', '5', 'and', 'with', 'bounds', 'on', 'the', 'number', 'of', 'symbols', 'for', 'n', 'leq', '12', 'here', 'we', 'give', 'the', 'full', 'analysis', 'for', 'n', 'leq', '7', 'without', 'bounds', 'on', 'the', 'number', 'of', 'symbols', 'for', 'pfas', 'partial', 'automata', 'on', 'leq', '7', 'states', 'we', 'do', 'a', 'similar', 'analysis', 'as', 'for', 'dfas', 'and', 'find', 'the', 'maximal', 'shortest', 'synchronizing', 'word', 'lengths', 'exceeding', 'n12', 'for', 'n', 'geq', '4', 'where', 'dfas', 'with', 'long', 'synchronization', 'typically', 'have', 'very', 'few', 'symbols', 'for', 'pfas', 'we', 'observe', 'that', 'more', 'symbols', 'may', 'increase', 'the', 'synchronizing', 'word', 'length', 'for', 'pfas', 'on', 'leq', '10', 'states', 'and', 'two', 'symbols', 'we', 'investigate', 'all', 'occurring', 'synchronizing', 'word', 'lengths', 'we', 'give', 'series', 'of', 'pfas', 'on', 'two', 'and', 'three', 'symbols', 'reaching', 'the', 'maximal', 'possible', 'length', 'for', 'some', 'small', 'values', 'of', 'n', 'for', 'n6789', 'the', 'construction', 'on', 'two', 'symbols', 'is', 'the', 'unique', 'one', 'reaching', 'the', 'maximal', 'length', 'for', 'both', 'series', 'the', 'growth', 'is', 'faster', 'than', 'n12', 'although', 'still', 'quadratic', 'based', 'on', 'string', 'rewriting', 'for', 'arbitrary', 'size', 'we', 'construct', 'a', 'pfa', 'on', 'three', 'symbols', 'with', 'exponential', 'shortest', 'synchronizing', 'word', 'length', 'giving', 'significantly', 'better', 'bounds', 'than', 'earlier', 'exponential', 'constructions', 'we', 'give', 'a', 'transformation', 'of', 'this', 'pfa', 'to', 'a', 'pfa', 'on', 'two', 'symbols', 'keeping', 'exponential', 'shortest', 'synchronizing', 'word', 'length', 'yielding', 'a', 'better', 'bound', 'than', 'applying', 'a', 'similar', 'known', 'transformation', 'both', 'pfas', 'are', 'transitive', 'finally', 'we', 'show', 'that', 'exponential', 'lengths', 'are', 'even', 'possible', 'with', 'just', 'one', 'single', 'undefined', 'transition', 'again', 'with', 'transitive', 'constructions']] | [-0.17465169910711048, 0.21785382511180384, 0.0026429322568096514, 0.1062263395186527, -0.04088290386213474, -0.2189240703273074, 0.0969320935349633, 0.3683568851747202, -0.22982883570571613, -0.29909266761149483, 0.10208742480391132, -0.3175576255023745, -0.07260200988627254, 0.252464358135975, -0.02625677802805454, 0.06366259723391551, 0.06767842067021121, 0.16263393550660474, -0.08868600939213235, -0.31279200674830093, 0.25385057469796773, 0.0034826033229995983, 0.20657712522706886, -0.0031100440813059457, 0.07855056801287198, 0.00942661132733089, -0.01668285642621303, -0.023720759875223943, -0.16363046251796579, 0.07987310530019599, 0.2496156925675244, 0.14357126214843097, 0.24771967837487568, -0.39276239067130453, -0.168187760011259, 0.14620156252460084, 0.18139612356124585, 0.12923810512674277, 0.012861763097060384, -0.21214770880077047, 0.1748822270598415, -0.12475661937917129, -0.053755898467758904, -0.011917313191297322, 0.14600401820641448, -0.0024046712234745537, -0.237506769044454, 0.004700617511416793, 0.13341292077708605, 0.07837139258535705, -0.0019996403305322344, -0.1750609354004993, 0.05925047322212854, 0.10721542906957376, -0.007995814237465213, 0.03456327915224794, 0.004914777698923314, -0.05439155686313611, -0.1413560138362397, 0.2876132733297942, -0.06790755632070591, -0.1798227066240436, 0.1684331339527107, -0.12520773175215594, -0.16766998055805302, 0.13560462580145308, 0.11031391923034106, 0.11790548099761702, -0.06639830267646771, 0.076395311360322, -0.0952841633486684, 0.25582973675112974, 0.20953016256867144, 0.07463682548133027, 0.10561872986758467, 0.15530527931608235, 0.10163809861026678, 0.13281601456613729, -0.015302792340649617, -0.044042486414475716, -0.3041903502059259, -0.12161238767275855, -0.17227209256083648, 0.07260617295866732, -0.12136640509672743, -0.1728452947359446, 0.3535978868371704, 0.10117011180510446, 0.20864100110621003, 0.22655862827041248, 0.21835918981396324, 0.10653071996989558, 0.06673991598115962, 0.13512767393842548, 0.12681539369188996, 0.09108782594350708, -0.009746977091631007, -0.17510527967942674, 0.08246711477242888, 0.1468605672794782] |
1,801.10437 | Deep Learning Works in Practice. But Does it Work in Theory? | Deep learning relies on a very specific kind of neural networks: those
superposing several neural layers. In the last few years, deep learning
achieved major breakthroughs in many tasks such as image analysis, speech
recognition, natural language processing, and so on. Yet, there is no
theoretical explanation of this success. In particular, it is not clear why the
deeper the network, the better it actually performs.
We argue that the explanation is intimately connected to a key feature of the
data collected from our surrounding universe to feed the machine learning
algorithms: large non-parallelizable logical depth. Roughly speaking, we
conjecture that the shortest computational descriptions of the universe are
algorithms with inherently large computation times, even when a large number of
computers are available for parallelization. Interestingly, this conjecture,
combined with the folklore conjecture in theoretical computer science that $ P
\neq NC$, explains the success of deep learning.
| cs.AI | deep learning relies on a very specific kind of neural networks those superposing several neural layers in the last few years deep learning achieved major breakthroughs in many tasks such as image analysis speech recognition natural language processing and so on yet there is no theoretical explanation of this success in particular it is not clear why the deeper the network the better it actually performs we argue that the explanation is intimately connected to a key feature of the data collected from our surrounding universe to feed the machine learning algorithms large nonparallelizable logical depth roughly speaking we conjecture that the shortest computational descriptions of the universe are algorithms with inherently large computation times even when a large number of computers are available for parallelization interestingly this conjecture combined with the folklore conjecture in theoretical computer science that p neq nc explains the success of deep learning | [['deep', 'learning', 'relies', 'on', 'a', 'very', 'specific', 'kind', 'of', 'neural', 'networks', 'those', 'superposing', 'several', 'neural', 'layers', 'in', 'the', 'last', 'few', 'years', 'deep', 'learning', 'achieved', 'major', 'breakthroughs', 'in', 'many', 'tasks', 'such', 'as', 'image', 'analysis', 'speech', 'recognition', 'natural', 'language', 'processing', 'and', 'so', 'on', 'yet', 'there', 'is', 'no', 'theoretical', 'explanation', 'of', 'this', 'success', 'in', 'particular', 'it', 'is', 'not', 'clear', 'why', 'the', 'deeper', 'the', 'network', 'the', 'better', 'it', 'actually', 'performs', 'we', 'argue', 'that', 'the', 'explanation', 'is', 'intimately', 'connected', 'to', 'a', 'key', 'feature', 'of', 'the', 'data', 'collected', 'from', 'our', 'surrounding', 'universe', 'to', 'feed', 'the', 'machine', 'learning', 'algorithms', 'large', 'nonparallelizable', 'logical', 'depth', 'roughly', 'speaking', 'we', 'conjecture', 'that', 'the', 'shortest', 'computational', 'descriptions', 'of', 'the', 'universe', 'are', 'algorithms', 'with', 'inherently', 'large', 'computation', 'times', 'even', 'when', 'a', 'large', 'number', 'of', 'computers', 'are', 'available', 'for', 'parallelization', 'interestingly', 'this', 'conjecture', 'combined', 'with', 'the', 'folklore', 'conjecture', 'in', 'theoretical', 'computer', 'science', 'that', 'p', 'neq', 'nc', 'explains', 'the', 'success', 'of', 'deep', 'learning']] | [-0.09934759429165137, 0.03726012702099979, -0.07523582027469938, 0.09638416610824926, -0.10716036033369852, -0.18787059527381347, 0.002656709509775848, 0.41287984263554617, -0.27949267430242775, -0.33983440851876073, 0.06007323273445001, -0.24148009165750212, -0.20712269780326736, 0.2361942989676184, -0.1309521890595804, 0.056823962078605954, 0.14143835596199072, 0.052883713292209686, -0.03817609457513066, -0.3231094744987786, 0.26680471117897714, 0.03342841445673666, 0.33165441965684295, 0.04078140637225383, 0.08899939049120262, -0.04449883523409733, -0.020525639672209887, -0.02360862589243019, -0.06290329530801918, 0.1865177599082361, 0.3429493812743474, 0.242429311283411, 0.3363187738105881, -0.453293673530523, -0.21105037831443338, 0.12103681803234173, 0.15951598192426703, 0.12112334923743195, -0.040258819311290876, -0.2610413006733398, 0.07524572328563679, -0.12252246973583021, -0.020292974684412615, -0.10430418312879172, 0.05130138633634291, -0.047066799202159906, -0.18422633437424069, 0.019925506836640322, 0.11180080362041858, 0.08278212786457073, 0.006782503005721279, -0.12893431876137904, 0.05180527162392045, 0.12125989071953243, 0.06539713212672772, 0.09452614276292357, 0.10623353306830206, -0.20836575344091635, -0.1396779335305296, 0.35552795643200846, -0.033417574164608645, -0.10803545893459404, 0.2189094155029444, -0.09170185738853556, -0.23272168371713142, 0.11745995389316483, 0.16713953621660335, 0.07775192128532138, -0.11397721076817205, 0.03712932204133894, -0.0959038928818159, 0.1863876269293345, 0.06756345028170964, 0.012831040465342183, 0.214785244493632, 0.2749473598024279, 0.011414401943880334, 0.0691676587243942, -0.061356924112407944, -0.11537987087551202, -0.2559097804462638, -0.10952898799882245, -0.2290980706740221, 0.04976084894853459, -0.09305168032586005, -0.1372898234356497, 0.3292968839161551, 0.18773931932072802, 0.2054132058574642, 0.09902002649834833, 0.3355421653596332, 0.040988289875393685, 0.16000027061956054, 0.11795364071086452, 0.22711416345476676, 0.09543907924907634, 0.14014820146493967, -0.13815349611733738, 0.08623617422779568, 0.010335785792621382] |
1,801.10438 | Light rays and waves on geodesic lenses | Starting from well-known absolute instruments for perfect imaging, we
introduce a type of rotational-symmetrical compact closed manifolds, namely
geodesic lenses. We demonstrate that light rays confined on geodesic lenses are
closed trajectories. While for optical waves, the spectrum of geodesic lens is
(at least approximately) degenerate and equidistant with numerical methods.
Based on this property, we show a periodical evolution of optical waves and
quantum waves on geodesic lenses. Moreover, we fabricate two geodesic lenses in
sub-micrometer scale, where curved light rays are observed with high accurate
precision. Our results may offer a new platform to investigate light
propagation on curved surfaces.
| physics.optics | starting from wellknown absolute instruments for perfect imaging we introduce a type of rotationalsymmetrical compact closed manifolds namely geodesic lenses we demonstrate that light rays confined on geodesic lenses are closed trajectories while for optical waves the spectrum of geodesic lens is at least approximately degenerate and equidistant with numerical methods based on this property we show a periodical evolution of optical waves and quantum waves on geodesic lenses moreover we fabricate two geodesic lenses in submicrometer scale where curved light rays are observed with high accurate precision our results may offer a new platform to investigate light propagation on curved surfaces | [['starting', 'from', 'wellknown', 'absolute', 'instruments', 'for', 'perfect', 'imaging', 'we', 'introduce', 'a', 'type', 'of', 'rotationalsymmetrical', 'compact', 'closed', 'manifolds', 'namely', 'geodesic', 'lenses', 'we', 'demonstrate', 'that', 'light', 'rays', 'confined', 'on', 'geodesic', 'lenses', 'are', 'closed', 'trajectories', 'while', 'for', 'optical', 'waves', 'the', 'spectrum', 'of', 'geodesic', 'lens', 'is', 'at', 'least', 'approximately', 'degenerate', 'and', 'equidistant', 'with', 'numerical', 'methods', 'based', 'on', 'this', 'property', 'we', 'show', 'a', 'periodical', 'evolution', 'of', 'optical', 'waves', 'and', 'quantum', 'waves', 'on', 'geodesic', 'lenses', 'moreover', 'we', 'fabricate', 'two', 'geodesic', 'lenses', 'in', 'submicrometer', 'scale', 'where', 'curved', 'light', 'rays', 'are', 'observed', 'with', 'high', 'accurate', 'precision', 'our', 'results', 'may', 'offer', 'a', 'new', 'platform', 'to', 'investigate', 'light', 'propagation', 'on', 'curved', 'surfaces']] | [-0.16092654731007072, 0.16149258710407088, -0.09619749040979117, 0.08171778488074347, -0.1329527578851448, -0.1411677934021901, -0.04997121348820332, 0.47233083792547187, -0.2324803444639881, -0.26421856723430726, 0.07232067142359654, -0.35210373034625253, -0.13609464055545037, 0.2899578610933063, -0.04968168834537858, 0.07896510764292561, 0.11914485018921665, -0.016405451821513695, -0.05822425928326453, -0.1891864469841971, 0.33299746302574285, 0.010013482499969108, 0.2646721349936901, 0.04484214741589114, 0.1880329326117909, 0.016938374516102347, -0.0004154665506269672, 0.05117264476208256, -0.14678172622658922, 0.1187028359174544, 0.18892102196148716, 0.04247870568259813, 0.1489019803011255, -0.42068234781301256, -0.2599777317200188, 0.0783786299583124, 0.16555158660682565, 0.08423616481359385, -0.11307197018978324, -0.29410507034805444, 0.058955249404258066, -0.008925331569747022, -0.21602880877516425, -0.01739465746807285, -0.018457780343176116, 0.06299495044115949, -0.16270167443274272, 0.0415008463896811, 0.019294144599560168, 0.07555267223074, -0.06552743467751264, -0.04682195081034362, 0.033337077142043724, 0.030483804375744692, -0.020486847831784647, -0.003850596721772805, 0.09368281347658669, -0.04972587081910305, -0.10156391000508856, 0.41900655006676324, -0.10303034975497734, -0.21531704436563473, 0.17619283617437254, -0.18885196940045537, -0.07241725434300185, 0.16318216137956865, 0.2521498883050857, 0.16710522947925152, -0.10622192125324861, 0.04806316392104335, -0.005892019437644446, 0.14239506860549497, 0.13991667559868334, 0.05642407952743297, 0.28496782454007336, 0.158120920881629, 0.08040032012037712, 0.09955955255951843, -0.14335632646032195, -0.015700482860170673, -0.30201116174178216, -0.17290062810588827, -0.14002777219261273, 0.11450172654851017, -0.1077537364969007, -0.21920447930518427, 0.35913638696812167, 0.08481485391667315, 0.12333217129517014, 0.07493803980022595, 0.31634142690587164, 0.015935350277479554, 0.025439363138953057, 0.09437683479293332, 0.328575876117269, 0.11540574734421945, 0.022560498651836326, -0.14609741671056958, -0.07434503407687834, 0.039709977118648807] |
1,801.10439 | Additional set-theoretic assumptions and twisted sums of Banach spaces | In this paper, we discuss the role played by additional set-theoretic
assumptions in the investigation of the existence of nontrivial twisted sums of
$c_0$ and spaces of continuous functions on nonmetrizable compact Hausdorff
spaces.
| math.FA | in this paper we discuss the role played by additional settheoretic assumptions in the investigation of the existence of nontrivial twisted sums of c_0 and spaces of continuous functions on nonmetrizable compact hausdorff spaces | [['in', 'this', 'paper', 'we', 'discuss', 'the', 'role', 'played', 'by', 'additional', 'settheoretic', 'assumptions', 'in', 'the', 'investigation', 'of', 'the', 'existence', 'of', 'nontrivial', 'twisted', 'sums', 'of', 'c_0', 'and', 'spaces', 'of', 'continuous', 'functions', 'on', 'nonmetrizable', 'compact', 'hausdorff', 'spaces']] | [-0.212437466115636, 0.11402880801709697, -0.08420888519407634, 0.1302892605000285, -0.068639816606746, -0.0016310357981744934, 0.05007747545331607, 0.3835753831902848, -0.2703420564751415, -0.15051979900282972, 0.15133879685034865, -0.23622667731936364, -0.16730696105343454, 0.20035876114578807, -0.13363413904410074, 0.0189470751758884, 0.04372808846699841, 0.017353015842244905, -0.1429695774362806, -0.2744327772080022, 0.5519917370641932, -0.06800371145500857, 0.19341303139705868, 0.08565644662388984, 0.10251236512490056, 0.03058484077508397, -0.08736874919850379, -0.04068054938141037, -0.2141184240908307, 0.19595930610290346, 0.21088073577950983, 0.09397863383021425, 0.3097139851135366, -0.39843540331896615, -0.1942281503613819, 0.20402299886678948, 0.09502996696049676, -0.09717374766135917, -0.043111175945823026, -0.32500162611112876, 0.06552634316989604, -0.10622799004811574, -0.16354015427093735, -0.13846994837855592, 0.056292960653081536, 0.024124885854475638, -0.23784399624941321, 0.004035508643616648, 0.19754301055389292, 0.10951807933366474, -0.12402196672251996, -0.09352148272206678, -0.06069843951777062, 0.08610907832489294, 0.048552227644797635, 0.03308453346493051, 0.06341344514615177, -0.09414244639714632, -0.1250649488887147, 0.32551152102977915, -0.07919233222834438, -0.24726577141486547, 0.12758051231503487, -0.19230362012818017, -0.24121727224658518, 0.0889130671892096, 0.14206703390706987, 0.13547604618703618, -0.012530572630245896, 0.20243757576784394, -0.1341738588286235, 0.08713537146446898, 0.12414138901102192, 0.18418932700639262, 0.1479699243517483, 0.1548889890203581, 0.11536681406912119, 0.1874513254254399, 0.07202242504504017, -0.06617219344479963, -0.4141413041335695, -0.19649613440475044, -0.12770404803621418, 0.1363928176681785, -0.12452746849628644, -0.23408368963967352, 0.3677584556314875, 0.09585857829626869, 0.1308955822879558, 0.023492846446221367, 0.19183589413981228, 0.04233840946792899, -0.04296838617130347, 0.02302137652740759, 0.16103315694421969, 0.178535845301881, -0.002825320150484057, -0.14611654241076288, 0.01396208259222262, 0.20283959937446258] |
1,801.1044 | The Maxwell operator with periodic coefficients in a cylinder | In the paper we consider the Maxwell operator in a three-dimensional cylinder
with coefficients periodic along the axis of a cylinder. It is proved that for
cylinders with circular and rectangular cross-section the spectrum of the
Maxwell operator is absolutely continuous.
| math-ph math.MP math.SP | in the paper we consider the maxwell operator in a threedimensional cylinder with coefficients periodic along the axis of a cylinder it is proved that for cylinders with circular and rectangular crosssection the spectrum of the maxwell operator is absolutely continuous | [['in', 'the', 'paper', 'we', 'consider', 'the', 'maxwell', 'operator', 'in', 'a', 'threedimensional', 'cylinder', 'with', 'coefficients', 'periodic', 'along', 'the', 'axis', 'of', 'a', 'cylinder', 'it', 'is', 'proved', 'that', 'for', 'cylinders', 'with', 'circular', 'and', 'rectangular', 'crosssection', 'the', 'spectrum', 'of', 'the', 'maxwell', 'operator', 'is', 'absolutely', 'continuous']] | [-0.1913740509530393, 0.12971238021897832, -0.0553178470468194, -0.05186316772454941, -0.07322785373572714, -0.09400159386895234, -0.09354441618921644, 0.41687984637370923, -0.23941661627031863, -0.14208705005485836, 0.15310209471073638, -0.30502287189408045, -0.11200753708438176, 0.19158405133682052, -0.03709722033179388, 0.13237844325783776, 0.05891462270647469, 0.06666171993696834, -0.0755114615951642, -0.15752909264936135, 0.3676272021924577, -0.020969454289936438, 0.2305900131511252, 0.03964509080141419, 0.11162740918921261, 0.07476153505239182, 0.007816741083998506, 0.03402844839161489, -0.13238068452625246, 0.08813164135577475, 0.16395521395635315, -0.0599402220147412, 0.1647113070073651, -0.424879175815277, -0.15494607953791628, 0.07901967650779136, 0.10866659307261793, 0.019093314958054844, -0.019276019344787773, -0.2399156378445829, 0.07372120559419983, -0.13157736629293096, -0.2633660819336045, 0.02945364421097244, 0.0956637264206642, 0.015568917844353653, -0.2941851241559517, 0.07137170016038709, 0.10951855356191717, 0.05279592386015305, -0.11345378341289555, -0.04485235287149141, -0.03500586666348504, 0.05554447647911019, 0.09515157714202183, 0.029288271476128478, 0.09067506008077322, -0.05311443706656375, -0.06774651668057209, 0.39415279557792154, -0.10875932572454941, -0.31225536413854216, 0.09465230238146899, -0.2217963363793565, -0.039355454330400726, 0.14201316891646967, 0.14041266844766895, 0.12910844665304644, -0.11532120103379939, 0.18619657139628898, -0.16211719701929792, 0.13635698394713605, 0.11031907821846444, -0.07583193741057341, 0.21716102912295154, 0.10764356657135778, 0.1383062093859402, 0.20350744520745626, -0.07826843157001748, -0.08840073488096184, -0.32916703284150217, -0.19680844678929665, -0.18349357945390227, 0.03315207807392609, -0.05906620242302136, -0.2613755360745439, 0.38335573818625474, 0.044225576220125684, 0.21629211108949853, 0.07586007469856157, 0.292065539544948, 0.17020811408576442, 0.060089866062853395, 0.10024390419627108, 0.24107215922075984, 0.19791480139602066, 0.14682598611930522, -0.19255072325922368, -0.09234136457146122, 0.0976959958490802] |
1,801.10441 | Weighted Nonlocal Total Variation in Image Processing | In this paper, a novel weighted nonlocal total variation (WNTV) method is
proposed. Compared to the classical nonlocal total variation methods, our
method modifies the energy functional to introduce a weight to balance between
the labeled sets and unlabeled sets. With extensive numerical examples in
semi-supervised clustering, image inpainting and image colorization, we
demonstrate that WNTV provides an effective and efficient method in many image
processing and machine learning problems.
| cs.CV math.OC | in this paper a novel weighted nonlocal total variation wntv method is proposed compared to the classical nonlocal total variation methods our method modifies the energy functional to introduce a weight to balance between the labeled sets and unlabeled sets with extensive numerical examples in semisupervised clustering image inpainting and image colorization we demonstrate that wntv provides an effective and efficient method in many image processing and machine learning problems | [['in', 'this', 'paper', 'a', 'novel', 'weighted', 'nonlocal', 'total', 'variation', 'wntv', 'method', 'is', 'proposed', 'compared', 'to', 'the', 'classical', 'nonlocal', 'total', 'variation', 'methods', 'our', 'method', 'modifies', 'the', 'energy', 'functional', 'to', 'introduce', 'a', 'weight', 'to', 'balance', 'between', 'the', 'labeled', 'sets', 'and', 'unlabeled', 'sets', 'with', 'extensive', 'numerical', 'examples', 'in', 'semisupervised', 'clustering', 'image', 'inpainting', 'and', 'image', 'colorization', 'we', 'demonstrate', 'that', 'wntv', 'provides', 'an', 'effective', 'and', 'efficient', 'method', 'in', 'many', 'image', 'processing', 'and', 'machine', 'learning', 'problems']] | [-0.012380624422803521, -0.04940743072395836, -0.08479347605230834, 0.09968690708389177, -0.10013890386942555, -0.10991470062393038, 0.02224739367203951, 0.452257454943131, -0.319343797479044, -0.38439522427506745, 0.0017493287724552348, -0.31328147885334845, -0.21164748617721832, 0.1963490283335833, -0.17271194322144284, 0.10672284943489906, 0.15158652710070944, 0.022777270753388566, -0.0793486865278443, -0.28435234055402414, 0.29933090984602184, 0.026974808417863268, 0.35126126426107745, 0.06266995007172227, 0.1576836253173978, -0.003984823059427607, -0.08225896720336202, 0.048251997388433665, -0.08940542183582319, 0.24437073837650722, 0.2898484903990346, 0.1761628591304864, 0.34667394530055495, -0.37555992424912643, -0.2552320859121049, 0.13028577419326587, 0.12126301215304171, 0.12377067813855212, -0.1006577416213558, -0.28012667063568886, 0.09663887051112183, -0.12209531295743278, 0.03550991805968806, -0.19679110590710908, -0.025879607974168134, -0.008881620679269819, -0.32784557924605906, 0.10557571228598724, 0.04836565406773897, 0.041029938345994145, -0.09905501099659458, -0.1000084779362249, 0.050660974431700784, 0.07119806868243306, 0.013800331552321202, 0.06508281451019951, 0.11094964920844444, -0.15647557180251598, -0.14288502794635646, 0.3378592922407038, -0.06518374536843861, -0.24500722192940028, 0.20129820488064604, 0.00936153600581319, -0.1318140618968755, 0.09595570158596863, 0.20820245243307642, 0.1682516510516186, -0.14666857359492602, 0.04232521919081645, -0.04931765981018543, 0.18145022846703582, 0.04578118901425863, -0.025293492540881476, 0.09078323431586956, 0.22486969773821971, 0.11496255042370382, 0.2038858866007478, -0.14810915209133835, -0.0574047458358109, -0.26567453875973385, -0.11005765018875108, -0.23115167963345917, -0.059373408864142704, -0.12873896340041777, -0.19008757697541595, 0.39037307998275056, 0.2231167842495351, 0.21226505091523423, 0.06911871419288218, 0.38998855486073913, 0.06188298509326106, 0.0899594034999609, 0.08610738164690487, 0.13031829608029083, 0.08281282387564287, 0.14102527371826856, -0.23769254349035157, -0.008593798489635126, 0.10555217728730948] |
1,801.10442 | From Benedict Cumberbatch to Sherlock Holmes: Character Identification
in TV series without a Script | The goal of this paper is the automatic identification of characters in TV
and feature film material. In contrast to standard approaches to this task,
which rely on the weak supervision afforded by transcripts and subtitles, we
propose a new method requiring only a cast list. This list is used to obtain
images of actors from freely available sources on the web, providing a form of
partial supervision for this task. In using images of actors to recognize
characters, we make the following three contributions: (i) We demonstrate that
an automated semi-supervised learning approach is able to adapt from the
actor's face to the character's face, including the face context of the hair;
(ii) By building voice models for every character, we provide a bridge between
frontal faces (for which there is plenty of actor-level supervision) and
profile (for which there is very little or none); and (iii) by combining face
context and speaker identification, we are able to identify characters with
partially occluded faces and extreme facial poses. Results are presented on the
TV series 'Sherlock' and the feature film 'Casablanca'. We achieve the
state-of-the-art on the Casablanca benchmark, surpassing previous methods that
have used the stronger supervision available from transcripts.
| cs.CV | the goal of this paper is the automatic identification of characters in tv and feature film material in contrast to standard approaches to this task which rely on the weak supervision afforded by transcripts and subtitles we propose a new method requiring only a cast list this list is used to obtain images of actors from freely available sources on the web providing a form of partial supervision for this task in using images of actors to recognize characters we make the following three contributions i we demonstrate that an automated semisupervised learning approach is able to adapt from the actors face to the characters face including the face context of the hair ii by building voice models for every character we provide a bridge between frontal faces for which there is plenty of actorlevel supervision and profile for which there is very little or none and iii by combining face context and speaker identification we are able to identify characters with partially occluded faces and extreme facial poses results are presented on the tv series sherlock and the feature film casablanca we achieve the stateoftheart on the casablanca benchmark surpassing previous methods that have used the stronger supervision available from transcripts | [['the', 'goal', 'of', 'this', 'paper', 'is', 'the', 'automatic', 'identification', 'of', 'characters', 'in', 'tv', 'and', 'feature', 'film', 'material', 'in', 'contrast', 'to', 'standard', 'approaches', 'to', 'this', 'task', 'which', 'rely', 'on', 'the', 'weak', 'supervision', 'afforded', 'by', 'transcripts', 'and', 'subtitles', 'we', 'propose', 'a', 'new', 'method', 'requiring', 'only', 'a', 'cast', 'list', 'this', 'list', 'is', 'used', 'to', 'obtain', 'images', 'of', 'actors', 'from', 'freely', 'available', 'sources', 'on', 'the', 'web', 'providing', 'a', 'form', 'of', 'partial', 'supervision', 'for', 'this', 'task', 'in', 'using', 'images', 'of', 'actors', 'to', 'recognize', 'characters', 'we', 'make', 'the', 'following', 'three', 'contributions', 'i', 'we', 'demonstrate', 'that', 'an', 'automated', 'semisupervised', 'learning', 'approach', 'is', 'able', 'to', 'adapt', 'from', 'the', 'actors', 'face', 'to', 'the', 'characters', 'face', 'including', 'the', 'face', 'context', 'of', 'the', 'hair', 'ii', 'by', 'building', 'voice', 'models', 'for', 'every', 'character', 'we', 'provide', 'a', 'bridge', 'between', 'frontal', 'faces', 'for', 'which', 'there', 'is', 'plenty', 'of', 'actorlevel', 'supervision', 'and', 'profile', 'for', 'which', 'there', 'is', 'very', 'little', 'or', 'none', 'and', 'iii', 'by', 'combining', 'face', 'context', 'and', 'speaker', 'identification', 'we', 'are', 'able', 'to', 'identify', 'characters', 'with', 'partially', 'occluded', 'faces', 'and', 'extreme', 'facial', 'poses', 'results', 'are', 'presented', 'on', 'the', 'tv', 'series', 'sherlock', 'and', 'the', 'feature', 'film', 'casablanca', 'we', 'achieve', 'the', 'stateoftheart', 'on', 'the', 'casablanca', 'benchmark', 'surpassing', 'previous', 'methods', 'that', 'have', 'used', 'the', 'stronger', 'supervision', 'available', 'from', 'transcripts']] | [-0.04703041588984875, -0.03666632386254302, -0.03614170383777821, 0.034797689792310904, -0.12614631463671613, -0.1543719701431877, 0.04779530988035455, 0.44390671240601376, -0.23297932572588695, -0.3236468727955252, 0.09965612972444804, -0.3054720509023549, -0.15076922232734585, 0.20052377787877373, -0.15692166208210795, 0.020205765305809788, 0.12269497448080381, 0.06565912728054815, -0.015096975219828675, -0.26443575815452885, 0.34360568134452385, -0.014793404236676829, 0.2881545470378811, 0.03692065811118306, 0.12934655336366585, -0.01173573665422809, -0.0525815913103873, -0.025033949624135424, -0.062240714523307074, 0.20987192438382526, 0.32316136442146054, 0.1821851445019097, 0.264787657478296, -0.417713665922806, -0.15784934406581136, 0.06930711341382408, 0.09790951074668627, 0.1327250819839769, -0.07065977282887001, -0.35971096013464143, 0.10544012012006483, -0.15941602121737428, 0.012121750011725064, -0.10294499704428944, -0.01929216885786337, -0.04545685178160074, -0.2634866855857866, 0.03834636409336062, 0.08690781409930975, 0.09717062214303725, -0.0638727961613134, -0.1071674527463721, 0.021989017710511326, 0.2182520686507466, 0.08056401596949042, 0.041317094112769584, 0.09371166596558658, -0.2198620483890843, -0.11383006543347343, 0.3964914281352131, -0.05864605897648344, -0.20933210390124155, 0.249717183656694, -0.06144044921265461, -0.13857787011181982, 0.10488287128267151, 0.18839834528901053, 0.12994263745831042, -0.1615960934716022, 0.0230769304149154, -0.06142657385925897, 0.21034261846534946, 0.084957009843963, -0.027690025722950845, 0.19101151953965648, 0.18362218482577386, 0.021931527234586096, 0.1417610726087002, -0.13798648381689146, 0.0044706641112579335, -0.23411465191110895, -0.13649949199399583, -0.16489354243956098, -0.02536461898704889, -0.036456306211506154, -0.15624392804873885, 0.4057394277793239, 0.21954987507049384, 0.2034128541762498, 0.07673983182005158, 0.28971296402889846, 0.009035647699646467, 0.1337891715168675, 0.05619266303198236, 0.19924296156748833, -0.010050905621680083, 0.1070318267899635, -0.13187733920498412, 0.09635916792101862, 0.07568369218176092] |
1,801.10443 | Counting Cells in Time-Lapse Microscopy using Deep Neural Networks | An automatic approach to counting any kind of cells could alleviate work of
the experts and boost the research in fields such as regenerative medicine. In
this paper, a method for microscopy cell counting using multiple frames (hence
temporal information) is proposed. Unlike previous approaches where the cell
counting is done independently in each frame (static cell counting), in this
work the cell counting prediction is done using multiple frames (dynamic cell
counting). A spatiotemporal model using ConvNets and long short term memory
(LSTM) recurrent neural networks is proposed to overcome temporal variations.
The model outperforms static cell counting in a publicly available dataset of
stem cells. The advantages, working conditions and limitations of the
ConvNet-LSTM method are discussed. Although our method is tested in cell
counting, it can be extrapolated to quantify in video (or correlated image
series) any kind of objects or volumes.
| cs.CV | an automatic approach to counting any kind of cells could alleviate work of the experts and boost the research in fields such as regenerative medicine in this paper a method for microscopy cell counting using multiple frames hence temporal information is proposed unlike previous approaches where the cell counting is done independently in each frame static cell counting in this work the cell counting prediction is done using multiple frames dynamic cell counting a spatiotemporal model using convnets and long short term memory lstm recurrent neural networks is proposed to overcome temporal variations the model outperforms static cell counting in a publicly available dataset of stem cells the advantages working conditions and limitations of the convnetlstm method are discussed although our method is tested in cell counting it can be extrapolated to quantify in video or correlated image series any kind of objects or volumes | [['an', 'automatic', 'approach', 'to', 'counting', 'any', 'kind', 'of', 'cells', 'could', 'alleviate', 'work', 'of', 'the', 'experts', 'and', 'boost', 'the', 'research', 'in', 'fields', 'such', 'as', 'regenerative', 'medicine', 'in', 'this', 'paper', 'a', 'method', 'for', 'microscopy', 'cell', 'counting', 'using', 'multiple', 'frames', 'hence', 'temporal', 'information', 'is', 'proposed', 'unlike', 'previous', 'approaches', 'where', 'the', 'cell', 'counting', 'is', 'done', 'independently', 'in', 'each', 'frame', 'static', 'cell', 'counting', 'in', 'this', 'work', 'the', 'cell', 'counting', 'prediction', 'is', 'done', 'using', 'multiple', 'frames', 'dynamic', 'cell', 'counting', 'a', 'spatiotemporal', 'model', 'using', 'convnets', 'and', 'long', 'short', 'term', 'memory', 'lstm', 'recurrent', 'neural', 'networks', 'is', 'proposed', 'to', 'overcome', 'temporal', 'variations', 'the', 'model', 'outperforms', 'static', 'cell', 'counting', 'in', 'a', 'publicly', 'available', 'dataset', 'of', 'stem', 'cells', 'the', 'advantages', 'working', 'conditions', 'and', 'limitations', 'of', 'the', 'convnetlstm', 'method', 'are', 'discussed', 'although', 'our', 'method', 'is', 'tested', 'in', 'cell', 'counting', 'it', 'can', 'be', 'extrapolated', 'to', 'quantify', 'in', 'video', 'or', 'correlated', 'image', 'series', 'any', 'kind', 'of', 'objects', 'or', 'volumes']] | [-0.06717848774720112, 0.051402309695198524, -0.034568131764435434, 0.05881841654552083, -0.07018820148057722, -0.15855836124833803, 0.05849917494282447, 0.4285857485543037, -0.2526260689928614, -0.2923222546690497, 0.07507973505135883, -0.2384375352846009, -0.18601186315304247, 0.20411078763226498, -0.17780340160082642, 0.06949506666960902, 0.1011351308873694, 0.06982904887148018, 0.009742516227837266, -0.2753544033890397, 0.22674573846161367, 0.04080700241350408, 0.36493288662027695, 0.02324246816529796, 0.12816049575741434, -0.006292126970044498, -0.08485346995213808, 0.052786877436627605, -0.04162828559055924, 0.15588254572598842, 0.2761350935148396, 0.1661033712199022, 0.30665047353390473, -0.46237164384460655, -0.2874567695925462, 0.08903205157097044, 0.18611571237862368, 0.11341411195502712, -0.00881635238866097, -0.2435230140221016, 0.11687583475180997, -0.17022151097269922, -0.052830087907355404, -0.10345612407696096, -0.04788563723258417, 0.04951287188149732, -0.28914487773937914, 0.05645300473552197, 0.04528994822321693, 0.07320643910046282, -0.0641758637422503, -0.0577516850453384, 0.08125280804434341, 0.19966869069070653, 0.03365335551186882, 0.04970691143615364, 0.14352305943210578, -0.14013544628717775, -0.18525457025088113, 0.37708925902201185, -0.020554169169466556, -0.2543978455765494, 0.15459300356692282, -0.09934986520815513, -0.15111096132675123, 0.12146365589959997, 0.15997662348993893, 0.14224546292218668, -0.20530861292098618, 0.023328278251072584, -0.03897211078297475, 0.19577337151457525, 0.16205641451645, 0.011493799472548838, 0.1699016201213516, 0.2644875644561674, -0.02226113612153407, 0.10391267000553038, -0.1491899981773619, -0.07717483460598079, -0.2248352598238351, -0.10979233647471871, -0.21762394526138387, -0.019416354034609836, -0.06035483238289277, -0.16565938053074583, 0.3968781903739376, 0.17534444187928377, 0.1589596215410736, 0.06873045118449352, 0.3670330236184186, 0.04350922214316911, 0.14094794056667337, -0.008344849221536825, 0.11368248949212761, 0.05446187587262227, 0.15465415943542432, -0.19236165740173952, 0.033970657731245815, 0.08508006145310557] |
1,801.10444 | Device-independent entanglement certification of all entangled states | We present a method to certify the entanglement of all bipartite entangled
quantum states in a device-independent way. This is achieved by placing the
state in a quantum network and constructing a correlation inequality based on
an entanglement witness for the state. Our method is device-independent, in the
sense that entanglement can be certified from the observed statistics alone,
under minimal assumptions on the underlying physics. Conceptually, our results
borrow ideas from the field of self-testing to bring the recently introduced
measurement-device-independent entanglement witnesses into the fully
device-independent regime.
| quant-ph | we present a method to certify the entanglement of all bipartite entangled quantum states in a deviceindependent way this is achieved by placing the state in a quantum network and constructing a correlation inequality based on an entanglement witness for the state our method is deviceindependent in the sense that entanglement can be certified from the observed statistics alone under minimal assumptions on the underlying physics conceptually our results borrow ideas from the field of selftesting to bring the recently introduced measurementdeviceindependent entanglement witnesses into the fully deviceindependent regime | [['we', 'present', 'a', 'method', 'to', 'certify', 'the', 'entanglement', 'of', 'all', 'bipartite', 'entangled', 'quantum', 'states', 'in', 'a', 'deviceindependent', 'way', 'this', 'is', 'achieved', 'by', 'placing', 'the', 'state', 'in', 'a', 'quantum', 'network', 'and', 'constructing', 'a', 'correlation', 'inequality', 'based', 'on', 'an', 'entanglement', 'witness', 'for', 'the', 'state', 'our', 'method', 'is', 'deviceindependent', 'in', 'the', 'sense', 'that', 'entanglement', 'can', 'be', 'certified', 'from', 'the', 'observed', 'statistics', 'alone', 'under', 'minimal', 'assumptions', 'on', 'the', 'underlying', 'physics', 'conceptually', 'our', 'results', 'borrow', 'ideas', 'from', 'the', 'field', 'of', 'selftesting', 'to', 'bring', 'the', 'recently', 'introduced', 'measurementdeviceindependent', 'entanglement', 'witnesses', 'into', 'the', 'fully', 'deviceindependent', 'regime']] | [-0.08482679321817803, 0.1362254086247805, -0.182180911354888, 0.078860316008298, 0.007018796722875552, -0.2172473327497418, 0.07450833263953499, 0.29242562225841906, -0.2563569134498915, -0.264527842255958, 0.04852995333612342, -0.23892244185959355, -0.09194824658334255, 0.23870511026529784, -0.09398563799521562, 0.13300342299044132, 0.05359878703909979, 0.003434484787913186, -0.019977569444042245, -0.27338441743860753, 0.34931282543190073, 0.021776006073073558, 0.3307619408463662, 0.09220066345022113, 0.110087641488677, -0.009429541798413134, 0.045001682150439266, -0.0010302282812262183, -0.12889088408308944, 0.16537085132283588, 0.27588630892503796, 0.19828808938121695, 0.28392333604311676, -0.4022277389454205, -0.21203349603946958, 0.11560775757128938, 0.07383546947888779, 0.21866973767873277, -0.05695583422542707, -0.39513126252156294, -0.00023168986767865298, -0.18104200169778942, -0.09201321430148536, -0.12057282075055697, -0.0626730707126115, -0.1267019740483734, -0.27688658435232516, 0.0909221622925461, 0.07852080816486745, 0.021861421485860528, 0.07551312818338446, 0.007229193657887786, 0.02678239897019073, 0.11627293400612942, -0.10471698137921061, 0.02066756548945991, 0.11013774472822467, -0.1038140946779442, -0.22217148120758343, 0.30227896602552257, -0.021874993840713848, -0.2057741865766852, 0.13884839665254556, -0.11277311960277095, -0.15501671758110194, 0.006515652631943146, 0.11686959482855007, 0.08902133854493248, -0.13948540830084782, 0.06356114573355534, -0.09862495583921588, 0.2095112752253085, 0.02030880931304412, 0.1536254461781446, 0.1757683798754483, 0.07439485575553825, 0.10937473675487248, 0.2092729716501565, -0.03608723080277527, -0.15547744829856444, -0.32193354395050766, -0.2247981457667572, -0.32651735043932756, 0.09327345780421341, -0.07847313789027519, -0.10535575616895483, 0.4482609313190653, 0.19120026435807683, 0.1284567228612605, 0.04686831648126663, 0.2996060456151896, 0.07444121586315836, 0.057084981938091556, 0.11205241151593542, 0.3072070889881278, 0.15772523399275007, 0.06408976470486502, -0.1887267571455391, 0.14203049630198752, 0.0602824009383971] |
1,801.10445 | A Lie-theoretic description of the solution space of the tt*-Toda
equations | We give a Lie-theoretic explanation for the convex polytope which
parametrizes the globally smooth solutions of the topological-antitopological
fusion equations of Toda type (tt$^*$-Toda equations) which were introduced by
Cecotti and Vafa. It is known from [GL] [GIL1] [M1] [M2] that these solutions
can be parametrized by monodromy data of a certain flat
$SL_{n+1}\mathbb{R}$-connection. Using Boalch's Lie-theoretic description of
Stokes data, and Steinberg's description of regular conjugacy classes of a
linear algebraic group, we express this monodromy data as a convex subset of a
Weyl alcove of $SU_{n+1}$.
| math.DG hep-th | we give a lietheoretic explanation for the convex polytope which parametrizes the globally smooth solutions of the topologicalantitopological fusion equations of toda type tttoda equations which were introduced by cecotti and vafa it is known from gl gil1 m1 m2 that these solutions can be parametrized by monodromy data of a certain flat sl_n1mathbbrconnection using boalchs lietheoretic description of stokes data and steinbergs description of regular conjugacy classes of a linear algebraic group we express this monodromy data as a convex subset of a weyl alcove of su_n1 | [['we', 'give', 'a', 'lietheoretic', 'explanation', 'for', 'the', 'convex', 'polytope', 'which', 'parametrizes', 'the', 'globally', 'smooth', 'solutions', 'of', 'the', 'topologicalantitopological', 'fusion', 'equations', 'of', 'toda', 'type', 'tttoda', 'equations', 'which', 'were', 'introduced', 'by', 'cecotti', 'and', 'vafa', 'it', 'is', 'known', 'from', 'gl', 'gil1', 'm1', 'm2', 'that', 'these', 'solutions', 'can', 'be', 'parametrized', 'by', 'monodromy', 'data', 'of', 'a', 'certain', 'flat', 'sl_n1mathbbrconnection', 'using', 'boalchs', 'lietheoretic', 'description', 'of', 'stokes', 'data', 'and', 'steinbergs', 'description', 'of', 'regular', 'conjugacy', 'classes', 'of', 'a', 'linear', 'algebraic', 'group', 'we', 'express', 'this', 'monodromy', 'data', 'as', 'a', 'convex', 'subset', 'of', 'a', 'weyl', 'alcove', 'of', 'su_n1']] | [-0.17622444364020512, 0.03788062211658273, -0.0978171990940436, 0.05898245137428776, -0.15420019393786788, -0.16906247525808535, -0.010632064481753679, 0.22884126615134023, -0.3113530755952178, -0.224049294992472, 0.12691464861633167, -0.2406740561903765, -0.18285611289597692, 0.19218265387185274, -0.1373257325917837, 0.047632768794539426, 0.046383710456125084, 0.04015750370343171, -0.107745440829257, -0.2526699176911886, 0.36823839428169386, -0.0759798405481325, 0.21135964026186793, -0.005761282889926363, 0.13130464328735666, -0.006162713819538199, -0.017191257106051558, 0.02687599297080721, -0.16208610962842482, 0.13431324953091375, 0.32322069535508663, 0.12318779893394094, 0.14433006677565918, -0.38651822443075834, -0.16525186833903371, 0.12210292660858527, 0.12164839271766444, 0.07083836840631973, -0.039704306899303834, -0.30215310227746767, 0.07818941744266167, -0.15419255862278597, -0.18953074297557274, -0.10182410828946602, 0.053152353663574015, 0.050093046810832764, -0.2682057076599449, 0.029255161546946813, 0.08975126729568556, 0.07721102676199128, -0.1103010611896891, -0.07357009943059113, -0.07125405402344075, 0.023130894389136562, 0.012622814062827578, 0.026924888037943413, 0.019499137199350765, -0.08081104874422419, -0.10573782190857899, 0.38735344589111353, -0.0417468310915865, -0.24343254743421094, 0.10594013194730949, -0.09612237721947688, -0.14140632839241465, 0.16013132454827428, 0.09800032208052774, 0.17154184631293729, -0.1378050686270442, 0.19546407852959374, -0.16828601499132456, 0.058916301666093726, 0.12194699135475925, -0.05552057165741211, 0.1528850303840868, 0.09462081414780446, 0.027372895618013683, 0.10934566230640658, 0.01965534878850338, -0.04710574277366201, -0.39158002708462025, -0.15423289090505846, -0.13757571768725202, 0.13863841601691784, -0.11545271858250046, -0.21208937125768335, 0.42516977107152343, 0.018497647251933813, 0.1959017774677791, 0.11039475926164803, 0.16636962401736083, 0.10477406245107497, 0.058274245543760206, 0.05434620520654356, 0.14973890528615033, 0.2005842065721351, 0.01247986980403463, -0.19913928205746093, -0.04187459141636888, 0.24394174066505261] |
1,801.10446 | Self-testing of Pauli observables for device-independent entanglement
certification | We present self-testing protocols to certify the presence of tensor products
of Pauli measurements on maximally entangled states of local dimension $2^n$
for $n\in\mathbb{N}$. This provides self-tests of sets of informationally
complete measurements in arbitrarily high dimension. We then show that this can
be used for the device-independent certification of the entanglement of all
bipartite entangled states by exploiting a connection to measurement
device-independent entanglement witnesses and quantum networks. This work
extends a more compact parallel work on the same subject and provides all the
required technical proofs.
| quant-ph | we present selftesting protocols to certify the presence of tensor products of pauli measurements on maximally entangled states of local dimension 2n for ninmathbbn this provides selftests of sets of informationally complete measurements in arbitrarily high dimension we then show that this can be used for the deviceindependent certification of the entanglement of all bipartite entangled states by exploiting a connection to measurement deviceindependent entanglement witnesses and quantum networks this work extends a more compact parallel work on the same subject and provides all the required technical proofs | [['we', 'present', 'selftesting', 'protocols', 'to', 'certify', 'the', 'presence', 'of', 'tensor', 'products', 'of', 'pauli', 'measurements', 'on', 'maximally', 'entangled', 'states', 'of', 'local', 'dimension', '2n', 'for', 'ninmathbbn', 'this', 'provides', 'selftests', 'of', 'sets', 'of', 'informationally', 'complete', 'measurements', 'in', 'arbitrarily', 'high', 'dimension', 'we', 'then', 'show', 'that', 'this', 'can', 'be', 'used', 'for', 'the', 'deviceindependent', 'certification', 'of', 'the', 'entanglement', 'of', 'all', 'bipartite', 'entangled', 'states', 'by', 'exploiting', 'a', 'connection', 'to', 'measurement', 'deviceindependent', 'entanglement', 'witnesses', 'and', 'quantum', 'networks', 'this', 'work', 'extends', 'a', 'more', 'compact', 'parallel', 'work', 'on', 'the', 'same', 'subject', 'and', 'provides', 'all', 'the', 'required', 'technical', 'proofs']] | [-0.17683633542897456, 0.15829206082377245, -0.07801162091676485, 0.03629334195548753, 0.0061419475982388986, -0.21191144466865808, 0.07102703758705915, 0.3142430971334265, -0.19524529602759602, -0.22458137296119027, 0.06778126848935657, -0.2667280233951963, -0.06952983975960789, 0.20814884337596595, -0.08770662928807062, 0.1407108612157489, 0.08796404160834341, 0.0077034988525238905, -0.061775169541678304, -0.3066084344702011, 0.3752693706827069, 0.01026961982742333, 0.2836226748874072, 0.09566817157478495, 0.10182103451172059, 0.05049385735235939, -0.013770956614859064, 0.002361373774791983, -0.11411519839194542, 0.18977108281714292, 0.31368440394924785, 0.20190282236382534, 0.23424630634359678, -0.40721958452327683, -0.15515613282464488, 0.17414814530109818, 0.10389723763695326, 0.19391306467481295, 0.0003296329912039007, -0.33532398508396, 0.054112639587567006, -0.1737050345929509, -0.11006541357545013, -0.16794543264603073, -0.013104411429429258, -0.09581199272493408, -0.2796074792065404, 0.08495462705931542, 0.09188049377619543, 0.04317697057426399, 0.029959951146421106, -0.02763651224086061, 0.020094020452233963, 0.12410645555990579, -0.11403808256992223, -0.014206775416493077, 0.08593253815673631, -0.07370872213637499, -0.22569847286848183, 0.3155111047142947, -0.005675633141601627, -0.22778694181628947, 0.17951809781846928, -0.14355203193421898, -0.18255462049538354, 0.006820214740318162, 0.1494158094918186, 0.1319094178298573, -0.11738093152896246, 0.06022116254396017, -0.10539881704078818, 0.1815784758232026, 0.08970825602194633, 0.1839830650556409, 0.1267362951237539, 0.05658199108173986, 0.16465915051627567, 0.21839306980175685, 0.01389199232851917, -0.07232924725394696, -0.3574711328203028, -0.2419312864923003, -0.2762331690940879, 0.15186404382323168, -0.10961370020860076, -0.11647321594699117, 0.4077740880152719, 0.13744370132917538, 0.12995330215794224, 0.0626057407088493, 0.3024872047614984, 0.014566841826308519, 0.04858481263826517, 0.11161912793547592, 0.24008700990287418, 0.19550705203966406, 0.040625785128213465, -0.15764283707407725, 0.11102863201151857, 0.015217355745831313] |
1,801.10447 | Recovering from Random Pruning: On the Plasticity of Deep Convolutional
Neural Networks | Recently there has been a lot of work on pruning filters from deep
convolutional neural networks (CNNs) with the intention of reducing
computations. The key idea is to rank the filters based on a certain criterion
(say, $l_1$-norm, average percentage of zeros, etc) and retain only the top
ranked filters. Once the low scoring filters are pruned away the remainder of
the network is fine tuned and is shown to give performance comparable to the
original unpruned network. In this work, we report experiments which suggest
that the comparable performance of the pruned network is not due to the
specific criterion chosen but due to the inherent plasticity of deep neural
networks which allows them to recover from the loss of pruned filters once the
rest of the filters are fine-tuned. Specifically, we show counter-intuitive
results wherein by randomly pruning 25-50\% filters from deep CNNs we are able
to obtain the same performance as obtained by using state of the art pruning
methods. We empirically validate our claims by doing an exhaustive evaluation
with VGG-16 and ResNet-50. Further, we also evaluate a real world scenario
where a CNN trained on all 1000 ImageNet classes needs to be tested on only a
small set of classes at test time (say, only animals). We create a new
benchmark dataset from ImageNet to evaluate such class specific pruning and
show that even here a random pruning strategy gives close to state of the art
performance. Lastly, unlike existing approaches which mainly focus on the task
of image classification, in this work we also report results on object
detection. We show that using a simple random pruning strategy we can achieve
significant speed up in object detection (74$\%$ improvement in fps) while
retaining the same accuracy as that of the original Faster RCNN model.
| cs.CV | recently there has been a lot of work on pruning filters from deep convolutional neural networks cnns with the intention of reducing computations the key idea is to rank the filters based on a certain criterion say l_1norm average percentage of zeros etc and retain only the top ranked filters once the low scoring filters are pruned away the remainder of the network is fine tuned and is shown to give performance comparable to the original unpruned network in this work we report experiments which suggest that the comparable performance of the pruned network is not due to the specific criterion chosen but due to the inherent plasticity of deep neural networks which allows them to recover from the loss of pruned filters once the rest of the filters are finetuned specifically we show counterintuitive results wherein by randomly pruning 2550 filters from deep cnns we are able to obtain the same performance as obtained by using state of the art pruning methods we empirically validate our claims by doing an exhaustive evaluation with vgg16 and resnet50 further we also evaluate a real world scenario where a cnn trained on all 1000 imagenet classes needs to be tested on only a small set of classes at test time say only animals we create a new benchmark dataset from imagenet to evaluate such class specific pruning and show that even here a random pruning strategy gives close to state of the art performance lastly unlike existing approaches which mainly focus on the task of image classification in this work we also report results on object detection we show that using a simple random pruning strategy we can achieve significant speed up in object detection 74 improvement in fps while retaining the same accuracy as that of the original faster rcnn model | [['recently', 'there', 'has', 'been', 'a', 'lot', 'of', 'work', 'on', 'pruning', 'filters', 'from', 'deep', 'convolutional', 'neural', 'networks', 'cnns', 'with', 'the', 'intention', 'of', 'reducing', 'computations', 'the', 'key', 'idea', 'is', 'to', 'rank', 'the', 'filters', 'based', 'on', 'a', 'certain', 'criterion', 'say', 'l_1norm', 'average', 'percentage', 'of', 'zeros', 'etc', 'and', 'retain', 'only', 'the', 'top', 'ranked', 'filters', 'once', 'the', 'low', 'scoring', 'filters', 'are', 'pruned', 'away', 'the', 'remainder', 'of', 'the', 'network', 'is', 'fine', 'tuned', 'and', 'is', 'shown', 'to', 'give', 'performance', 'comparable', 'to', 'the', 'original', 'unpruned', 'network', 'in', 'this', 'work', 'we', 'report', 'experiments', 'which', 'suggest', 'that', 'the', 'comparable', 'performance', 'of', 'the', 'pruned', 'network', 'is', 'not', 'due', 'to', 'the', 'specific', 'criterion', 'chosen', 'but', 'due', 'to', 'the', 'inherent', 'plasticity', 'of', 'deep', 'neural', 'networks', 'which', 'allows', 'them', 'to', 'recover', 'from', 'the', 'loss', 'of', 'pruned', 'filters', 'once', 'the', 'rest', 'of', 'the', 'filters', 'are', 'finetuned', 'specifically', 'we', 'show', 'counterintuitive', 'results', 'wherein', 'by', 'randomly', 'pruning', '2550', 'filters', 'from', 'deep', 'cnns', 'we', 'are', 'able', 'to', 'obtain', 'the', 'same', 'performance', 'as', 'obtained', 'by', 'using', 'state', 'of', 'the', 'art', 'pruning', 'methods', 'we', 'empirically', 'validate', 'our', 'claims', 'by', 'doing', 'an', 'exhaustive', 'evaluation', 'with', 'vgg16', 'and', 'resnet50', 'further', 'we', 'also', 'evaluate', 'a', 'real', 'world', 'scenario', 'where', 'a', 'cnn', 'trained', 'on', 'all', '1000', 'imagenet', 'classes', 'needs', 'to', 'be', 'tested', 'on', 'only', 'a', 'small', 'set', 'of', 'classes', 'at', 'test', 'time', 'say', 'only', 'animals', 'we', 'create', 'a', 'new', 'benchmark', 'dataset', 'from', 'imagenet', 'to', 'evaluate', 'such', 'class', 'specific', 'pruning', 'and', 'show', 'that', 'even', 'here', 'a', 'random', 'pruning', 'strategy', 'gives', 'close', 'to', 'state', 'of', 'the', 'art', 'performance', 'lastly', 'unlike', 'existing', 'approaches', 'which', 'mainly', 'focus', 'on', 'the', 'task', 'of', 'image', 'classification', 'in', 'this', 'work', 'we', 'also', 'report', 'results', 'on', 'object', 'detection', 'we', 'show', 'that', 'using', 'a', 'simple', 'random', 'pruning', 'strategy', 'we', 'can', 'achieve', 'significant', 'speed', 'up', 'in', 'object', 'detection', '74', 'improvement', 'in', 'fps', 'while', 'retaining', 'the', 'same', 'accuracy', 'as', 'that', 'of', 'the', 'original', 'faster', 'rcnn', 'model']] | [-0.029413048134883865, 0.02187140471500849, -0.06111881804264461, 0.03292566155549139, -0.08831822847248987, -0.17375060524248206, 0.09304828329167018, 0.45776710054216285, -0.23590266868472098, -0.3311902520532021, 0.09361865344534938, -0.2520644495209854, -0.20213390985193352, 0.19050261999402815, -0.1207983304047957, 0.07970907792720633, 0.15458882496886267, 0.07387972625593345, -0.07370738895998026, -0.35443077054495614, 0.28354199373939387, 0.07237311573553598, 0.3294653498707339, 0.023011881889930617, 0.12806161901831123, -0.059273015245174365, -0.04189386830665171, -0.0003228098957333714, -0.06608594380290014, 0.12406835133035202, 0.2303806398783733, 0.1440515373329011, 0.31037708174282064, -0.3986499197470645, -0.1985813385838022, 0.11202169217634945, 0.13370218590134755, 0.11320657195678602, -0.002378792997915298, -0.3237184709473513, 0.15344539107153346, -0.16060056150890886, 0.0005941072075317304, -0.1317720835741299, -0.02711742147919722, 0.005820699638182608, -0.2556001052718299, 0.006939373318067131, 0.07307217434669534, 0.024165359122368196, -0.024340696555833954, -0.15045290096352498, -0.0153769724125353, 0.11469839002626638, 0.012070974835636055, 0.05475351119724413, 0.1359103499026969, -0.19223287060619138, -0.1400619657357068, 0.3425960696178178, -0.08020005551322053, -0.19561353804388393, 0.21149526193194712, -0.05431753056201463, -0.13303413822979565, 0.11964622572122607, 0.2247061224988041, 0.12546227957752612, -0.12444174703210592, -0.0019065091245768903, -0.0658748442827103, 0.20164908312105884, 0.07970671190026526, 0.01103646340314299, 0.14443192512456637, 0.24970555687594848, 0.04487747455791881, 0.17368769418098964, -0.152315587119762, -0.061299132373727236, -0.22524878320400604, -0.096689236300687, -0.20556823511181088, 0.008162129869888304, -0.09932816214840083, -0.13198343767418313, 0.42604742622934283, 0.24854562965386626, 0.23353502997507652, 0.13634455083364933, 0.31226671061788996, 0.04385876300827173, 0.15607492720203783, 0.1017268565108922, 0.2427316812177499, 0.013765678881512334, 0.07529221651386858, -0.14433572800985228, 0.07403932069263343, 0.06705933066958096] |
1,801.10448 | Probing the muon g_\mu-2 anomaly, L_{\mu} - L_{\tau} gauge boson and
Dark Matter in dark photon experiments | In the L_{\mu} - L_{\tau} model the 3.6$\sigma$ discrepancy between the
predicted and measured values of the anomalous magnetic moment of positive
muons can be explained by the existence of a new dark boson Z' with a mass in
the sub-GeV range, which is coupled at tree level predominantly to the second
and third lepton generations. However, at the one-loop level, the Z' coupling
to electrons or quarks can be induced via the \gamma -Z' kinetic mixing, which
is generated through the loop involving the muon and tau lepton. This loophole
has important experimental consequences since it opens up new possibilities, in
particular for the complementary searches of the Z' in the ongoing NA64 and
incoming dark photon experiments with high-energy electrons. An extension of
the model able to explain relic Dark Matter density is also discussed.
| hep-ph hep-ex | in the l_mu l_tau model the 36sigma discrepancy between the predicted and measured values of the anomalous magnetic moment of positive muons can be explained by the existence of a new dark boson z with a mass in the subgev range which is coupled at tree level predominantly to the second and third lepton generations however at the oneloop level the z coupling to electrons or quarks can be induced via the gamma z kinetic mixing which is generated through the loop involving the muon and tau lepton this loophole has important experimental consequences since it opens up new possibilities in particular for the complementary searches of the z in the ongoing na64 and incoming dark photon experiments with highenergy electrons an extension of the model able to explain relic dark matter density is also discussed | [['in', 'the', 'l_mu', 'l_tau', 'model', 'the', '36sigma', 'discrepancy', 'between', 'the', 'predicted', 'and', 'measured', 'values', 'of', 'the', 'anomalous', 'magnetic', 'moment', 'of', 'positive', 'muons', 'can', 'be', 'explained', 'by', 'the', 'existence', 'of', 'a', 'new', 'dark', 'boson', 'z', 'with', 'a', 'mass', 'in', 'the', 'subgev', 'range', 'which', 'is', 'coupled', 'at', 'tree', 'level', 'predominantly', 'to', 'the', 'second', 'and', 'third', 'lepton', 'generations', 'however', 'at', 'the', 'oneloop', 'level', 'the', 'z', 'coupling', 'to', 'electrons', 'or', 'quarks', 'can', 'be', 'induced', 'via', 'the', 'gamma', 'z', 'kinetic', 'mixing', 'which', 'is', 'generated', 'through', 'the', 'loop', 'involving', 'the', 'muon', 'and', 'tau', 'lepton', 'this', 'loophole', 'has', 'important', 'experimental', 'consequences', 'since', 'it', 'opens', 'up', 'new', 'possibilities', 'in', 'particular', 'for', 'the', 'complementary', 'searches', 'of', 'the', 'z', 'in', 'the', 'ongoing', 'na64', 'and', 'incoming', 'dark', 'photon', 'experiments', 'with', 'highenergy', 'electrons', 'an', 'extension', 'of', 'the', 'model', 'able', 'to', 'explain', 'relic', 'dark', 'matter', 'density', 'is', 'also', 'discussed']] | [-0.08663778936298673, 0.28879531003247605, -0.040943535275907966, 0.14275778970263406, -0.06910828276715406, -0.13864807102158117, 0.056485295558077804, 0.30462863823563296, -0.2607118586721994, -0.35161785537596135, -0.0011715309331467485, -0.28163922508247197, -0.00010713652676820536, 0.16340623995433012, 0.09174422756939962, 0.01822914802120495, 0.02498521917818032, 0.012588111033170101, -0.028644962585531175, -0.2213260150165297, 0.28649245247737887, 0.08804214076029465, 0.1873032856896958, 0.12548356699099875, 0.10830531559323016, -0.02578985216506921, -0.04352684155695469, -0.06452580583829652, -0.09560768242226914, 0.06867674219521337, 0.18142521929214983, 0.04023903838413603, 0.14724091350559748, -0.3715413326246883, -0.14738753869075, 0.17328171527204925, 0.15244744573411642, 0.058220616543514875, -0.10816625918275402, -0.33024734428481145, 0.09175507429138045, -0.18999782466220067, -0.11917323995422681, -0.01922644770820625, -0.04308001136900309, -0.04334770750874133, -0.3020373258178177, 0.11952228496952824, -0.02076861905344926, -0.030362999683026883, 0.012470031639917152, -0.13150032552178292, -0.05133755403050386, 0.0321509430599262, 0.16415147366933525, 0.06674679642609964, 0.12530315489001462, -0.19602598991032744, -0.1732923247550121, 0.3980360992170651, -0.1129195777398041, -0.14944554569528384, 0.17866054497768774, -0.21587202802081318, -0.1485404061831479, 0.15854626280419967, 0.16181167721429923, 0.04881299114854568, -0.17039463984752623, 0.15819689246777938, -0.04301784689938787, 0.15920951922239243, 0.046177304341279736, 0.009170250706922482, 0.30434510380248814, 0.19268536985841553, 0.04701878468725173, 0.04672618998087915, -0.12537606231703916, -0.0033775584580486313, -0.3812061994514592, -0.16576987726833015, -0.11909791838158579, 0.03949462650138337, -0.036889958906292174, -0.06799748578273199, 0.41240178664927096, 0.12638396067846128, 0.21605333997457124, -0.017082611177637076, 0.30663752367528263, 0.13740043566384189, 0.09064371454502072, 0.028297857508090708, 0.30575647891964763, 0.1706106489051736, 0.08301495537093348, -0.24517159318565973, 0.025707070109680954, 0.04025239737101776] |
1,801.10449 | Fractional $p\&q$ Laplacian problems in $\mathbb{R}^{N}$ with critical
growth | We deal with the following nonlinear problem involving fractional $p\&q$
Laplacians: \begin{equation*}
(-\Delta)^{s}_{p}u+(-\Delta)^{s}_{q}u+|u|^{p-2}u+|u|^{q-2}u=\lambda h(x)
f(u)+|u|^{q^{*}_{s}-2}u \mbox{ in } \mathbb{R}^{N}, \end{equation*} where $s\in
(0,1)$, $1<p<q<\frac{N}{s}$, $q^{*}_{s}=\frac{Nq}{N-sq}$, $\lambda>0$ is a
parameter, $h$ is a nontrivial bounded perturbation and $f$ is a superlinear
continuous function with subcritical growth. Using suitable variational
arguments and concentration-compactness lemma, we prove the existence of a
nontrivial non-negative solution for $\lambda$ sufficiently large.
| math.AP | we deal with the following nonlinear problem involving fractional pq laplacians beginequation deltas_pudeltas_quup2uuq2ulambda hx fuuq_s2u mbox in mathbbrn endequation where sin 01 1pqfracns q_sfracnqnsq lambda0 is a parameter h is a nontrivial bounded perturbation and f is a superlinear continuous function with subcritical growth using suitable variational arguments and concentrationcompactness lemma we prove the existence of a nontrivial nonnegative solution for lambda sufficiently large | [['we', 'deal', 'with', 'the', 'following', 'nonlinear', 'problem', 'involving', 'fractional', 'pq', 'laplacians', 'beginequation', 'deltas_pudeltas_quup2uuq2ulambda', 'hx', 'fuuq_s2u', 'mbox', 'in', 'mathbbrn', 'endequation', 'where', 'sin', '01', '1pqfracns', 'q_sfracnqnsq', 'lambda0', 'is', 'a', 'parameter', 'h', 'is', 'a', 'nontrivial', 'bounded', 'perturbation', 'and', 'f', 'is', 'a', 'superlinear', 'continuous', 'function', 'with', 'subcritical', 'growth', 'using', 'suitable', 'variational', 'arguments', 'and', 'concentrationcompactness', 'lemma', 'we', 'prove', 'the', 'existence', 'of', 'a', 'nontrivial', 'nonnegative', 'solution', 'for', 'lambda', 'sufficiently', 'large']] | [-0.2204671670217067, 0.07825396053958684, -0.013098816573619842, 0.04258335687724563, -0.14233296843400847, -0.21638302067294718, -0.027279796699682873, 0.3068257078373184, -0.3367656166354815, -0.14497692772808174, 0.14758778520820973, -0.34284933073989426, -0.09383509313920513, 0.14837045748718083, -0.05326165339599053, 0.1411719781967501, 0.028128162259235978, 0.03392827141021068, -0.04901753711358955, -0.14472082520563465, 0.3634580616528789, -0.22024927207579215, 0.1254639674909413, 0.08526058023174604, 0.11117055309005082, -0.04392743033434575, 0.06437660686982175, -0.0056227653753012415, -0.32045971936313433, 0.06543578124740937, 0.22414333458291366, 0.04094926234101877, 0.4222809879730145, -0.35055411225184796, -0.18882619296200573, 0.22641697123957177, 0.11490000023040921, -0.04273509024642408, -0.062074382754508405, -0.2871597120227913, 0.1510011361601452, -0.059786100126802924, -0.205079571933796, -0.05131668003741652, 0.11187451047201952, 0.05626032813937248, -0.4709690033225343, 0.17095903772472715, 0.10752226978850861, 0.0018977717651675146, -0.0574470902744603, -0.11993640655030807, -0.03132090683599623, -0.028480143216438592, 0.010610116696140419, 0.14480756228828492, -0.003860287228599191, -0.08669339730404317, -0.028846912016160787, 0.3222592222969979, -0.1276838338468224, -0.3068828693901499, 0.057930389582179484, -0.17588570212634902, -0.21113709196603547, 0.08193417954607866, 0.12959935820884613, 0.23979506464675068, -0.05998697277779381, 0.29516396644952086, -0.0682103393774014, 0.1878472242814799, 0.13537843856029214, -0.028405799778799215, 0.015333309245761484, 0.11591569896554574, 0.18086747396737338, 0.11175671877960364, 0.010833437057832877, -0.04836139213293791, -0.3718674436211586, -0.10530943760337928, -0.2134533172706142, 0.20436037226269643, -0.17124479104871473, -0.18094007800488424, 0.28296509948947157, 0.020004738681018354, 0.21217951959309478, 0.10255666063167154, 0.15204875666337708, 0.24291466331730285, -0.062166116976489626, 0.05493037224902461, 0.07890494436724112, 0.1626002005301416, 0.10968488485862811, -0.1818615990341641, -0.006598993103640775, 0.13569116495467218] |
1,801.1045 | Reconfigurable generation and measurement of mutually unbiased bases for
time-bin qudits | We propose a new method for implementing mutually unbiased generation and
measurement of time-bin qudits using a cascade of electro-optic phase modulator
-- coded fiber Bragg grating pairs. Our approach requires only a single spatial
mode and can switch rapidly between basis choices. We obtain explicit solutions
for dimensions $d=2,3,4$ that realize all $d+1$ possible mutually unbiased
bases and analyze the performance of our approach in quantum key distribution.
Given its practicality and compatibility with current technology, our approach
provides a promising springboard for scalable processing of high-dimensional
time-bin states.
| quant-ph | we propose a new method for implementing mutually unbiased generation and measurement of timebin qudits using a cascade of electrooptic phase modulator coded fiber bragg grating pairs our approach requires only a single spatial mode and can switch rapidly between basis choices we obtain explicit solutions for dimensions d234 that realize all d1 possible mutually unbiased bases and analyze the performance of our approach in quantum key distribution given its practicality and compatibility with current technology our approach provides a promising springboard for scalable processing of highdimensional timebin states | [['we', 'propose', 'a', 'new', 'method', 'for', 'implementing', 'mutually', 'unbiased', 'generation', 'and', 'measurement', 'of', 'timebin', 'qudits', 'using', 'a', 'cascade', 'of', 'electrooptic', 'phase', 'modulator', 'coded', 'fiber', 'bragg', 'grating', 'pairs', 'our', 'approach', 'requires', 'only', 'a', 'single', 'spatial', 'mode', 'and', 'can', 'switch', 'rapidly', 'between', 'basis', 'choices', 'we', 'obtain', 'explicit', 'solutions', 'for', 'dimensions', 'd234', 'that', 'realize', 'all', 'd1', 'possible', 'mutually', 'unbiased', 'bases', 'and', 'analyze', 'the', 'performance', 'of', 'our', 'approach', 'in', 'quantum', 'key', 'distribution', 'given', 'its', 'practicality', 'and', 'compatibility', 'with', 'current', 'technology', 'our', 'approach', 'provides', 'a', 'promising', 'springboard', 'for', 'scalable', 'processing', 'of', 'highdimensional', 'timebin', 'states']] | [-0.16489427881001423, 0.10192054186508143, -0.07344075864745994, -0.03068966902282319, -0.041588670893289735, -0.24145222821513587, 0.08200068035937344, 0.4568819697067309, -0.20946477108708259, -0.25353568771937757, 0.0473213603058202, -0.2269193365583929, -0.14740489038123403, 0.24423419336756963, -0.029289891106191644, 0.12757493487266258, 0.07901892616423999, -0.06008035863822933, -0.033493152239459326, -0.22652516641727324, 0.2758342038965627, 0.022176826298184526, 0.4097299729238442, -0.04439670709746607, 0.19862051238305867, 0.04748390990654739, -0.015370547844703947, -0.07935518168404782, -0.08576935260555657, 0.2116669229057806, 0.26889299740230016, 0.1607752568964857, 0.2493068682124022, -0.37566720510131857, -0.17720279565311214, 0.07844569389656018, 0.16903327819838954, 0.17485247922831038, -0.09209798464095063, -0.2691477181107392, 0.04129507973413454, -0.18444080088873593, -0.10976457253642631, -0.1998582093903188, -0.018532713079887828, -0.042175961051429255, -0.33090154413301287, 0.036243371157959274, 0.01799159732469347, 0.023028532346564063, 0.03162592234942811, -0.07392108278202542, 0.03381692156394462, 0.09713872005130306, -0.11741825451634907, -0.0025463461813129734, 0.09582904081993077, -0.0501078858035041, -0.21486213091719017, 0.3265369867466474, -0.04248981285065915, -0.22654446122351657, 0.13911310577074462, -0.09949108377214144, -0.0836088244667214, 0.07726595821800862, 0.16858629466379793, 0.12180641031918231, -0.12180989692929421, 0.0063892653593898155, 0.020174755149761612, 0.23491346921897335, 0.1017131072971342, 0.16298617121732134, 0.22277144207933058, 0.21796929623847933, 0.08238447382470614, 0.16932477546709307, -0.09266266772481666, -0.07736245781939288, -0.3078007880556449, -0.20655247199956034, -0.21702629097788384, 0.04783787563694327, -0.15268511251282219, -0.12029699836805295, 0.39490805082860286, 0.17491925074038714, 0.1363825203871794, 0.035389174477019336, 0.35963547692288844, 0.05523600445908568, 0.06230042808364784, 0.03479351328811451, 0.20894293006760686, 0.1286112978803308, 0.0706450870532668, -0.18575808640799663, 0.008240770025367147, 0.025832242287925623] |
1,801.10451 | Flow-based nodal cost allocation in a heterogeneous highly renewable
European electricity network | For a cost efficient design of a future renewable European electricity
system, the placement of renewable generation capacity will seek to exploit
locations with good resource quality, that is for instance onshore wind in
countries bordering the North Sea and solar PV in South European countries.
Regions with less favorable renewable generation conditions benefit from this
remote capacity by importing the respective electricity as power flows through
the transmission grid. The resulting intricate pattern of imports and exports
represents a challenge for the analysis of system costs on the level of
individual countries. Using a tracing technique, we introduce flow-based nodal
levelized costs of electricity (LCOE) which allow to incorporate capital and
operational costs associated with the usage of generation capacity located
outside the respective country under consideration. This concept and a
complementary allocation of transmission infrastructure costs is applied to a
simplified model of an interconnected highly renewable European electricity
system. We observe that cooperation between the European countries in a
heterogeneous system layout does not only reduce the system-wide LCOE, but also
the flow-based nodal LCOEs for every country individually.
| physics.soc-ph | for a cost efficient design of a future renewable european electricity system the placement of renewable generation capacity will seek to exploit locations with good resource quality that is for instance onshore wind in countries bordering the north sea and solar pv in south european countries regions with less favorable renewable generation conditions benefit from this remote capacity by importing the respective electricity as power flows through the transmission grid the resulting intricate pattern of imports and exports represents a challenge for the analysis of system costs on the level of individual countries using a tracing technique we introduce flowbased nodal levelized costs of electricity lcoe which allow to incorporate capital and operational costs associated with the usage of generation capacity located outside the respective country under consideration this concept and a complementary allocation of transmission infrastructure costs is applied to a simplified model of an interconnected highly renewable european electricity system we observe that cooperation between the european countries in a heterogeneous system layout does not only reduce the systemwide lcoe but also the flowbased nodal lcoes for every country individually | [['for', 'a', 'cost', 'efficient', 'design', 'of', 'a', 'future', 'renewable', 'european', 'electricity', 'system', 'the', 'placement', 'of', 'renewable', 'generation', 'capacity', 'will', 'seek', 'to', 'exploit', 'locations', 'with', 'good', 'resource', 'quality', 'that', 'is', 'for', 'instance', 'onshore', 'wind', 'in', 'countries', 'bordering', 'the', 'north', 'sea', 'and', 'solar', 'pv', 'in', 'south', 'european', 'countries', 'regions', 'with', 'less', 'favorable', 'renewable', 'generation', 'conditions', 'benefit', 'from', 'this', 'remote', 'capacity', 'by', 'importing', 'the', 'respective', 'electricity', 'as', 'power', 'flows', 'through', 'the', 'transmission', 'grid', 'the', 'resulting', 'intricate', 'pattern', 'of', 'imports', 'and', 'exports', 'represents', 'a', 'challenge', 'for', 'the', 'analysis', 'of', 'system', 'costs', 'on', 'the', 'level', 'of', 'individual', 'countries', 'using', 'a', 'tracing', 'technique', 'we', 'introduce', 'flowbased', 'nodal', 'levelized', 'costs', 'of', 'electricity', 'lcoe', 'which', 'allow', 'to', 'incorporate', 'capital', 'and', 'operational', 'costs', 'associated', 'with', 'the', 'usage', 'of', 'generation', 'capacity', 'located', 'outside', 'the', 'respective', 'country', 'under', 'consideration', 'this', 'concept', 'and', 'a', 'complementary', 'allocation', 'of', 'transmission', 'infrastructure', 'costs', 'is', 'applied', 'to', 'a', 'simplified', 'model', 'of', 'an', 'interconnected', 'highly', 'renewable', 'european', 'electricity', 'system', 'we', 'observe', 'that', 'cooperation', 'between', 'the', 'european', 'countries', 'in', 'a', 'heterogeneous', 'system', 'layout', 'does', 'not', 'only', 'reduce', 'the', 'systemwide', 'lcoe', 'but', 'also', 'the', 'flowbased', 'nodal', 'lcoes', 'for', 'every', 'country', 'individually']] | [-0.1679556262087674, 0.07857616784673979, -0.004659929440114956, 0.05479886841275909, -0.0646198794505564, -0.1378489160699286, 0.16074992669231736, 0.36610010146544164, -0.2750172716673484, -0.3091588758770891, 0.11808785100310568, -0.2868169153490919, -0.0891001749364402, 0.20553846477732854, -0.1529045766836948, -0.005482674738423106, 0.08209039364942705, -0.027483037885185847, 0.040689133910429456, -0.22680545728061946, 0.25701433583355676, 0.16299800687978938, 0.4087280800813058, 0.05602911491691809, 0.08872704099843186, -0.05803734236988573, -0.03934264964377765, 0.006048233773127116, -0.040978525531364385, 0.2365856029347964, 0.34015759705432086, 0.17268762838491625, 0.34845364458591405, -0.4878679868777717, -0.21001775545140122, 0.08470748071893226, 0.03984488624158362, -0.0176612308077792, -0.003797082029777008, -0.22075115515238178, 0.006547605092714423, -0.2904821855854758, -0.13807741067763316, -0.041634684198957904, -0.024851174999378334, 0.05704441465931374, -0.283763510609838, 0.01944379759833438, -0.047755154512194885, 0.07317473267678438, -0.058753986772180675, -0.11722780237982862, -0.10934055460236185, 0.19336134770586674, 0.01815092074491845, -0.07202934960687395, 0.13399897628330024, -0.1389966287646309, -0.11380925571201214, 0.3955424114777475, 0.0133607624734119, -0.14750999381035074, 0.11914852216263502, -0.1407545287347301, -0.14883317165231094, 0.1099260217453564, 0.25893356317836913, 0.02071574218416823, -0.2074604855930093, 0.016679748245746473, -0.008494064103469808, 0.15908625548916422, 0.07022697398135469, 0.027317917599594888, 0.25401578430672955, 0.22649674159886304, 0.20187027051077527, 0.1396961509280977, -0.11582043015903623, -0.15411601494483196, -0.2193878324791141, -0.12866264989198242, -0.12139548794546509, 0.02246951706167529, -0.0899753872860218, -0.13375020644354804, 0.3892350319608305, 0.13978884007282638, 0.059711130774574794, 0.04136407022809517, 0.3628726009876359, 0.08126613674286588, 0.08528698874812429, 0.15222722543107645, 0.14002903174475165, -0.03684094027250758, 0.2296935638981403, -0.21683310870034878, 0.1252836436386997, 0.002190102347126488] |
1,801.10452 | RAPTOR I: Time-dependent radiative transfer in arbitrary spacetimes | Observational efforts to image the immediate environment of a black hole at
the scale of the event horizon benefit from the development of efficient
imaging codes that are capable of producing synthetic data, which may be
compared with observational data. We aim to present RAPTOR, a new public code
that produces accurate images, animations, and spectra of relativistic plasmas
in strong gravity by numerically integrating the equations of motion of light
rays and performing time-dependent radiative transfer calculations along the
rays. The code is compatible with any analytical or numerical spacetime. It is
hardware-agnostic and may be compiled and run both on GPUs and CPUs. We
describe the algorithms used in RAPTOR and test the code's performance. We have
performed a detailed comparison of RAPTOR output with that of other
radiative-transfer codes and demonstrate convergence of the results. We then
applied RAPTOR to study accretion models of supermassive black holes,
performing time-dependent radiative transfer through general relativistic
magneto-hydrodynamical (GRMHD) simulations and investigating the expected
observational differences between the so-called fast-light and slow-light
paradigms. Using RAPTOR to produce synthetic images and light curves of a GRMHD
model of an accreting black hole, we find that the relative difference between
fast-light and slow-light light curves is less than 5%. Using two distinct
radiative-transfer codes to process the same data, we find integrated flux
densities with a relative difference less than 0.01%. For two-dimensional GRMHD
models, such as those examined in this paper, the fast-light approximation
suffices as long as errors of a few percent are acceptable. The convergence of
the results of two different codes demonstrates that they are, at a minimum,
consistent.
| astro-ph.HE | observational efforts to image the immediate environment of a black hole at the scale of the event horizon benefit from the development of efficient imaging codes that are capable of producing synthetic data which may be compared with observational data we aim to present raptor a new public code that produces accurate images animations and spectra of relativistic plasmas in strong gravity by numerically integrating the equations of motion of light rays and performing timedependent radiative transfer calculations along the rays the code is compatible with any analytical or numerical spacetime it is hardwareagnostic and may be compiled and run both on gpus and cpus we describe the algorithms used in raptor and test the codes performance we have performed a detailed comparison of raptor output with that of other radiativetransfer codes and demonstrate convergence of the results we then applied raptor to study accretion models of supermassive black holes performing timedependent radiative transfer through general relativistic magnetohydrodynamical grmhd simulations and investigating the expected observational differences between the socalled fastlight and slowlight paradigms using raptor to produce synthetic images and light curves of a grmhd model of an accreting black hole we find that the relative difference between fastlight and slowlight light curves is less than 5 using two distinct radiativetransfer codes to process the same data we find integrated flux densities with a relative difference less than 001 for twodimensional grmhd models such as those examined in this paper the fastlight approximation suffices as long as errors of a few percent are acceptable the convergence of the results of two different codes demonstrates that they are at a minimum consistent | [['observational', 'efforts', 'to', 'image', 'the', 'immediate', 'environment', 'of', 'a', 'black', 'hole', 'at', 'the', 'scale', 'of', 'the', 'event', 'horizon', 'benefit', 'from', 'the', 'development', 'of', 'efficient', 'imaging', 'codes', 'that', 'are', 'capable', 'of', 'producing', 'synthetic', 'data', 'which', 'may', 'be', 'compared', 'with', 'observational', 'data', 'we', 'aim', 'to', 'present', 'raptor', 'a', 'new', 'public', 'code', 'that', 'produces', 'accurate', 'images', 'animations', 'and', 'spectra', 'of', 'relativistic', 'plasmas', 'in', 'strong', 'gravity', 'by', 'numerically', 'integrating', 'the', 'equations', 'of', 'motion', 'of', 'light', 'rays', 'and', 'performing', 'timedependent', 'radiative', 'transfer', 'calculations', 'along', 'the', 'rays', 'the', 'code', 'is', 'compatible', 'with', 'any', 'analytical', 'or', 'numerical', 'spacetime', 'it', 'is', 'hardwareagnostic', 'and', 'may', 'be', 'compiled', 'and', 'run', 'both', 'on', 'gpus', 'and', 'cpus', 'we', 'describe', 'the', 'algorithms', 'used', 'in', 'raptor', 'and', 'test', 'the', 'codes', 'performance', 'we', 'have', 'performed', 'a', 'detailed', 'comparison', 'of', 'raptor', 'output', 'with', 'that', 'of', 'other', 'radiativetransfer', 'codes', 'and', 'demonstrate', 'convergence', 'of', 'the', 'results', 'we', 'then', 'applied', 'raptor', 'to', 'study', 'accretion', 'models', 'of', 'supermassive', 'black', 'holes', 'performing', 'timedependent', 'radiative', 'transfer', 'through', 'general', 'relativistic', 'magnetohydrodynamical', 'grmhd', 'simulations', 'and', 'investigating', 'the', 'expected', 'observational', 'differences', 'between', 'the', 'socalled', 'fastlight', 'and', 'slowlight', 'paradigms', 'using', 'raptor', 'to', 'produce', 'synthetic', 'images', 'and', 'light', 'curves', 'of', 'a', 'grmhd', 'model', 'of', 'an', 'accreting', 'black', 'hole', 'we', 'find', 'that', 'the', 'relative', 'difference', 'between', 'fastlight', 'and', 'slowlight', 'light', 'curves', 'is', 'less', 'than', '5', 'using', 'two', 'distinct', 'radiativetransfer', 'codes', 'to', 'process', 'the', 'same', 'data', 'we', 'find', 'integrated', 'flux', 'densities', 'with', 'a', 'relative', 'difference', 'less', 'than', '001', 'for', 'twodimensional', 'grmhd', 'models', 'such', 'as', 'those', 'examined', 'in', 'this', 'paper', 'the', 'fastlight', 'approximation', 'suffices', 'as', 'long', 'as', 'errors', 'of', 'a', 'few', 'percent', 'are', 'acceptable', 'the', 'convergence', 'of', 'the', 'results', 'of', 'two', 'different', 'codes', 'demonstrates', 'that', 'they', 'are', 'at', 'a', 'minimum', 'consistent']] | [-0.10752079470041878, 0.06286576471762513, -0.08710238682381066, 0.13245026203974608, -0.04254806043779498, -0.14736076619225208, 0.001609983634911615, 0.4264823312233666, -0.21331045096499562, -0.35503306698631426, 0.10303124977744828, -0.2969601261309207, -0.07009137295980378, 0.27771409425448035, -0.03209715138096706, 0.0819500284492832, 0.1156131853529929, -0.059541067455610004, -0.11225863482083136, -0.23198720820358099, 0.2987212452589022, 0.13578512668403422, 0.2293973941365824, -0.02490479502731563, 0.08884781331375476, -0.06430235551390968, -0.05726250595365036, 0.020600993208573424, -0.12715588170050568, 0.10331812418990415, 0.22575278407791513, 0.15491618095756238, 0.210471214501469, -0.44658397981807646, -0.25705375059806773, 0.0472217046490757, 0.14418813719403864, 0.14957667849059053, -0.10881896401760667, -0.22663666541787805, 0.09489278183481914, -0.1992870892966819, -0.06808022651357432, -0.05043543553722136, -0.008535285335123485, 0.04148463552432802, -0.2687612365230203, 0.04328149278984127, 0.020541255604881688, 0.061110347510001675, -0.07370469668653289, -0.06779616452861797, -0.0398823888130431, 0.10979645470641829, 0.047845981292906854, 0.025046957181199588, 0.11466412061380353, -0.10194970063033525, -0.13008376688445572, 0.4133438228241192, -0.07715521445225089, -0.14831065997563825, 0.1964827517435862, -0.15369347260570723, -0.0780768243860577, 0.14169406311369992, 0.22771820659548167, 0.14819303665454484, -0.13084214298927477, 0.01397097100717672, -0.014879720800167905, 0.1682556295800504, 0.03407424095437288, 0.03138916701790653, 0.24987414276237666, 0.14183236857896803, -0.038980019305458094, 0.1335861744357847, -0.13280047361326155, -0.07713955937157904, -0.2700917847399562, -0.12842904021605855, -0.14211335874375686, 0.05244557971626218, -0.1349727387870924, -0.1420722390699881, 0.37421873764296465, 0.18475604462918457, 0.14281651606900117, 0.06334009205594288, 0.32427666745326283, 0.045513580359494474, 0.06088736655303995, 0.16047345537767915, 0.2667550810589541, 0.12398720781724364, 0.0752068068144836, -0.23468692576756695, 0.018316656552131435, 0.010144698988591282] |
1,801.10453 | Multi-wavelength Polarimetry of Isolated Neutron Stars | Isolated Neutron Stars are known to be endowed with extreme magnetic fields,
whose maximum intensity ranges from 10^12 to 10^15 G, which permeates their
magnetospheres. Their surrounding environment is also strongly magnetised,
especially in the compact nebulae powered by the relativistic wind from young
neutron stars. The radiation from isolated neutron stars and their surrounding
nebulae is, thus, supposed to bring a strong polarisation signature. Measuring
the neutron star polarisation brings important information on the properties of
their magnetosphere and of their highly magnetised environment. Being the most
numerous class of isolated neutron stars, polarisation measurements have been
traditionally carried out for radio pulsars, hence in the radio band. In this
review, I summarise multi-wavelength linear polarisation measurements obtained
at wavelengths other than radio both for pulsars and other types of isolated
neutron stars and outline future perspectives with the upcoming observing
facilities.
| astro-ph.HE | isolated neutron stars are known to be endowed with extreme magnetic fields whose maximum intensity ranges from 1012 to 1015 g which permeates their magnetospheres their surrounding environment is also strongly magnetised especially in the compact nebulae powered by the relativistic wind from young neutron stars the radiation from isolated neutron stars and their surrounding nebulae is thus supposed to bring a strong polarisation signature measuring the neutron star polarisation brings important information on the properties of their magnetosphere and of their highly magnetised environment being the most numerous class of isolated neutron stars polarisation measurements have been traditionally carried out for radio pulsars hence in the radio band in this review i summarise multiwavelength linear polarisation measurements obtained at wavelengths other than radio both for pulsars and other types of isolated neutron stars and outline future perspectives with the upcoming observing facilities | [['isolated', 'neutron', 'stars', 'are', 'known', 'to', 'be', 'endowed', 'with', 'extreme', 'magnetic', 'fields', 'whose', 'maximum', 'intensity', 'ranges', 'from', '1012', 'to', '1015', 'g', 'which', 'permeates', 'their', 'magnetospheres', 'their', 'surrounding', 'environment', 'is', 'also', 'strongly', 'magnetised', 'especially', 'in', 'the', 'compact', 'nebulae', 'powered', 'by', 'the', 'relativistic', 'wind', 'from', 'young', 'neutron', 'stars', 'the', 'radiation', 'from', 'isolated', 'neutron', 'stars', 'and', 'their', 'surrounding', 'nebulae', 'is', 'thus', 'supposed', 'to', 'bring', 'a', 'strong', 'polarisation', 'signature', 'measuring', 'the', 'neutron', 'star', 'polarisation', 'brings', 'important', 'information', 'on', 'the', 'properties', 'of', 'their', 'magnetosphere', 'and', 'of', 'their', 'highly', 'magnetised', 'environment', 'being', 'the', 'most', 'numerous', 'class', 'of', 'isolated', 'neutron', 'stars', 'polarisation', 'measurements', 'have', 'been', 'traditionally', 'carried', 'out', 'for', 'radio', 'pulsars', 'hence', 'in', 'the', 'radio', 'band', 'in', 'this', 'review', 'i', 'summarise', 'multiwavelength', 'linear', 'polarisation', 'measurements', 'obtained', 'at', 'wavelengths', 'other', 'than', 'radio', 'both', 'for', 'pulsars', 'and', 'other', 'types', 'of', 'isolated', 'neutron', 'stars', 'and', 'outline', 'future', 'perspectives', 'with', 'the', 'upcoming', 'observing', 'facilities']] | [-0.09038719545294355, 0.19998701819107978, -0.03576805705035275, 0.09842101206035855, -0.16765807938462424, -0.059968303182403315, 0.037697667742011276, 0.42390750781014247, -0.1839409608082924, -0.35383954264835776, 0.06408839976542037, -0.32433645894842134, 0.03905678723476358, 0.2834228193810718, 0.01678326601566343, -0.05324638906908645, 0.09231719869279328, -0.018926990964169894, -0.04792818140525084, -0.18036271544446894, 0.322900558131506, 0.1073729805045898, 0.16416509155105877, -0.0368490090308356, 0.034950735003549456, -0.09196052576538984, -0.09132497954724512, 0.0029270172207062684, -0.0728917875556337, 0.04812510385197568, 0.28266777292909945, 0.16032807127950335, 0.15424705689473378, -0.447244842113419, -0.22802591665120392, 0.07563400242585115, 0.12409449061883575, 0.008980759910399002, -0.08836727784018494, -0.2883246001246926, 0.08003698916205407, -0.20585917009177482, -0.20718971978554704, 0.019519003720341863, 0.050346436978715076, 0.10474096538199411, -0.17194893303607311, 0.023691106962741813, 0.029377035024067896, 0.06324214963535485, -0.11232081512998711, -0.1336140910463108, -0.019489025184233393, 0.06385726531498603, 0.054475578046371265, 0.08064885749367645, 0.19012988535231434, -0.1882389454070114, -0.06910563983272279, 0.4039800587220938, -0.006970369736228457, -0.04581738304398902, 0.22994378531657786, -0.3046045316728418, -0.18017099608041973, 0.13825496463626102, 0.17055081551360501, 0.19233627098944636, -0.17956726813780052, -0.008797963524328453, 0.014717554959299212, 0.1275641616259643, 0.05850306129200267, 0.13814290167138607, 0.4281236058869562, 0.13971836803891285, -0.020137297114930473, 0.10536749424556127, -0.21242950520465165, -0.006629403740805867, -0.20658168079611566, -0.050810104164366536, -0.1120830034638488, 0.13166257550034646, -0.08705575004426788, -0.11583327724748141, 0.3324951422286291, 0.08886238332134444, 0.08659239483081778, -0.04585795306358031, 0.3196098418121545, 0.0653828594026032, 0.052569347007161045, 0.14219725423759513, 0.35837787616398786, 0.24213509136726233, 0.12384672984122656, -0.2390851411020865, 0.07158896005614758, -0.0696885882017131] |
1,801.10454 | Computational Prediction of Muon Stopping Sites Using Ab Initio Random
Structure Searching (AIRSS) | The stopping site of the muon in a muon-spin relaxation experiment ({\mu}+SR)
is in general unknown. There are some techniques that can be used to guess the
muon stopping site, but they often rely on approximations and are not generally
applicable to all cases. In this work, we propose a purely theoretical method
to predict muon stopping sites in crystalline materials from first principles.
The method is based on a combination of ab initio calculations, random
structure searching and machine learning, and it has successfully predicted the
MuT and MuBC stopping sites of muonium in Si, Diamond and Ge, as well as the
muonium stopping site in LiF, without any recourse to experimental results. The
method makes use of Soprano, a Python library developed to aid ab-initio
computational crystallography, that was publicly released and contains all the
software tools necessary to reproduce our analysis.
| cond-mat.mtrl-sci | the stopping site of the muon in a muonspin relaxation experiment musr is in general unknown there are some techniques that can be used to guess the muon stopping site but they often rely on approximations and are not generally applicable to all cases in this work we propose a purely theoretical method to predict muon stopping sites in crystalline materials from first principles the method is based on a combination of ab initio calculations random structure searching and machine learning and it has successfully predicted the mut and mubc stopping sites of muonium in si diamond and ge as well as the muonium stopping site in lif without any recourse to experimental results the method makes use of soprano a python library developed to aid abinitio computational crystallography that was publicly released and contains all the software tools necessary to reproduce our analysis | [['the', 'stopping', 'site', 'of', 'the', 'muon', 'in', 'a', 'muonspin', 'relaxation', 'experiment', 'musr', 'is', 'in', 'general', 'unknown', 'there', 'are', 'some', 'techniques', 'that', 'can', 'be', 'used', 'to', 'guess', 'the', 'muon', 'stopping', 'site', 'but', 'they', 'often', 'rely', 'on', 'approximations', 'and', 'are', 'not', 'generally', 'applicable', 'to', 'all', 'cases', 'in', 'this', 'work', 'we', 'propose', 'a', 'purely', 'theoretical', 'method', 'to', 'predict', 'muon', 'stopping', 'sites', 'in', 'crystalline', 'materials', 'from', 'first', 'principles', 'the', 'method', 'is', 'based', 'on', 'a', 'combination', 'of', 'ab', 'initio', 'calculations', 'random', 'structure', 'searching', 'and', 'machine', 'learning', 'and', 'it', 'has', 'successfully', 'predicted', 'the', 'mut', 'and', 'mubc', 'stopping', 'sites', 'of', 'muonium', 'in', 'si', 'diamond', 'and', 'ge', 'as', 'well', 'as', 'the', 'muonium', 'stopping', 'site', 'in', 'lif', 'without', 'any', 'recourse', 'to', 'experimental', 'results', 'the', 'method', 'makes', 'use', 'of', 'soprano', 'a', 'python', 'library', 'developed', 'to', 'aid', 'abinitio', 'computational', 'crystallography', 'that', 'was', 'publicly', 'released', 'and', 'contains', 'all', 'the', 'software', 'tools', 'necessary', 'to', 'reproduce', 'our', 'analysis']] | [0.00575210593463332, 0.09932875652086003, -0.09089771618454398, 0.10311368788784643, -0.08012169936893286, -0.1748158347115598, 0.07596553644406369, 0.4467869004221646, -0.2530992662442939, -0.30084167437797243, 0.10163464412008497, -0.29522583636592004, -0.10351533167882557, 0.22124957301575768, 0.007700457791244233, 0.0718409420297175, 0.07180094742378988, 0.014437772323852861, -0.051317008102306175, -0.2555344218625915, 0.21080395548076897, 0.09645145298861019, 0.28714510405572924, 0.0792234191488657, 0.06262360210367642, 0.01342742797964207, -0.00822013991044743, 0.006557224102739479, -0.1383651363069291, 0.10232871922748196, 0.27794124823311095, 0.1403807308752793, 0.21271664257343675, -0.4673409291080662, -0.19172111572209302, 0.06810316707087367, 0.09499229428234633, 0.17587360118880505, -0.08296055749052211, -0.23129331045686366, 0.08596900485983522, -0.12116360205056315, -0.09282293871502632, -0.14607372403249042, -0.03319691325264325, 0.027761139127041597, -0.2933059494532938, 0.026936290187311807, 0.004266684055303946, 0.0911100630015375, -0.0944709164347708, -0.16043100477736835, 0.042414493259641674, 0.09510709586637942, 0.04016919299582397, 0.07935638896147297, 0.14889916495853137, -0.04644600150539292, -0.16523438057751505, 0.4106088356616405, -0.04325684811268653, -0.1581844224975529, 0.2017952005877127, -0.13083953929452838, -0.1594626625081511, 0.1382981460701049, 0.13681890863039486, 0.15131860463375266, -0.19215811733066893, 0.08175503564070441, -0.005805658306796234, 0.17640957492566506, 0.01677244488749054, -0.04438839978302367, 0.14505787606683226, 0.18664763674752174, 0.03551489479882135, 0.08294507783065856, -0.11040713344342433, -0.053185977810225285, -0.2794868316211562, -0.15723331142021538, -0.23333966205958145, 0.052431678494794284, -0.0027503523962585244, -0.15941089010712775, 0.3395150391176551, 0.1521851460488474, 0.13659017260831136, -0.018621062675093697, 0.3021771440158722, 0.03938510580480073, 0.09045909896128244, 0.053451753494987535, 0.20205951972324823, 0.12828159694343325, 0.09688982968316316, -0.2207243645724912, 0.12561761237472505, 0.053886637671270984] |
1,801.10455 | The free energy of biomembrane and nerve excitation and the role of
anesthetics | In the electromechanical theory of nerve stimulation, the nerve impulse
consists of a traveling region of solid membrane in a liquid environment.
Therefore, the free energy necessary to stimulate a pulse is directly related
to the free energy difference necessary to induce a phase transition in the
nerve membrane. It is a function of temperature and pressure, and it is
sensitively dependent on the presence of anesthetics which lower melting
transitions. We investigate the free energy difference of solid and liquid
membrane phases under the influence of anesthetics. We calculate
stimulus-response curves of electromechanical pulses and compare them to
measured stimulus-response profiles in lobster and earthworm axons. We also
compare them to stimulus-response experiments on human median nerve and frog
sciatic nerve published in the literature.
| physics.bio-ph | in the electromechanical theory of nerve stimulation the nerve impulse consists of a traveling region of solid membrane in a liquid environment therefore the free energy necessary to stimulate a pulse is directly related to the free energy difference necessary to induce a phase transition in the nerve membrane it is a function of temperature and pressure and it is sensitively dependent on the presence of anesthetics which lower melting transitions we investigate the free energy difference of solid and liquid membrane phases under the influence of anesthetics we calculate stimulusresponse curves of electromechanical pulses and compare them to measured stimulusresponse profiles in lobster and earthworm axons we also compare them to stimulusresponse experiments on human median nerve and frog sciatic nerve published in the literature | [['in', 'the', 'electromechanical', 'theory', 'of', 'nerve', 'stimulation', 'the', 'nerve', 'impulse', 'consists', 'of', 'a', 'traveling', 'region', 'of', 'solid', 'membrane', 'in', 'a', 'liquid', 'environment', 'therefore', 'the', 'free', 'energy', 'necessary', 'to', 'stimulate', 'a', 'pulse', 'is', 'directly', 'related', 'to', 'the', 'free', 'energy', 'difference', 'necessary', 'to', 'induce', 'a', 'phase', 'transition', 'in', 'the', 'nerve', 'membrane', 'it', 'is', 'a', 'function', 'of', 'temperature', 'and', 'pressure', 'and', 'it', 'is', 'sensitively', 'dependent', 'on', 'the', 'presence', 'of', 'anesthetics', 'which', 'lower', 'melting', 'transitions', 'we', 'investigate', 'the', 'free', 'energy', 'difference', 'of', 'solid', 'and', 'liquid', 'membrane', 'phases', 'under', 'the', 'influence', 'of', 'anesthetics', 'we', 'calculate', 'stimulusresponse', 'curves', 'of', 'electromechanical', 'pulses', 'and', 'compare', 'them', 'to', 'measured', 'stimulusresponse', 'profiles', 'in', 'lobster', 'and', 'earthworm', 'axons', 'we', 'also', 'compare', 'them', 'to', 'stimulusresponse', 'experiments', 'on', 'human', 'median', 'nerve', 'and', 'frog', 'sciatic', 'nerve', 'published', 'in', 'the', 'literature']] | [-0.10372349786542592, 0.18838856972768783, -0.0794458908975006, 0.055110470545182505, -0.05605857875493784, -0.10477686947995117, 0.08304778634965981, 0.42605906297704055, -0.25586681305948233, -0.24041420283416906, 0.04580518448751213, -0.26639450921137475, -0.1995822855877498, 0.18240946677646466, -0.11971723500270552, 0.011569932746213107, -0.004125035155401934, 0.04709728745861896, -0.0022920813293211043, -0.14379532631978187, 0.2462951724883169, 0.02388776187592792, 0.31791300146234414, 0.09676328812502251, 0.12804852939018654, -0.005284349373098286, 0.04544652324347269, 0.0033298993727103585, -0.19516722884376547, 0.086766306325675, 0.23399217899090477, 0.03503974639840188, 0.1922336185631889, -0.48154927373287226, -0.24218274574608556, 0.08898922995967229, 0.05580128607384506, 0.10971138908228438, -0.013986887811269198, -0.2574623087310188, 0.041885259236016915, -0.12610401182494585, -0.12205043398509068, -0.01621807815270528, 0.04036561710878261, 0.09214604031969054, -0.209228360027607, 0.1016434939383688, -0.002904779821013411, 0.06189855308796737, -0.1354063878811541, -0.035128486701213414, -0.05746397121609854, 0.14720260141932937, 0.029674912871245945, 0.04932025542837523, 0.26064854206901694, -0.14144726349447395, -0.043734294916724877, 0.35583416158185593, -0.061610640691859384, -0.13400154609772716, 0.19912211061824883, -0.1597743552559959, -0.034268206950010996, 0.17344977806455322, 0.1516801862818529, 0.06956104230919173, -0.14203613524192146, -0.017156050439798346, 0.02942580679091551, 0.19480013125206505, 0.12303453133374985, -0.019443257881831082, 0.17835435763533627, 0.2005397205246568, 0.028389072393081964, 0.18112037799114156, -0.08474551523446165, -0.07039464244365855, -0.28556509604014635, -0.15051266405406216, -0.09881139140842217, 0.010760894586541874, -0.03085191545029548, -0.2049291987611454, 0.43514270862261395, 0.1166284028265167, 0.14691169599499848, 0.018766929632947144, 0.25044615878280074, 0.04802743069058846, 0.034582091794748394, -0.042520635482293394, 0.23512384415574608, 0.1798880559314663, 0.1044830049476808, -0.30126774180606597, 0.07813568881459697, 0.029777043951778777] |
1,801.10456 | Tension-dependent transverse buckles and wrinkles in twisted elastic
sheets | We investigate with experiments the twist induced transverse buckling
instabilities of an elastic sheet of length $L$, width $W$, and thickness $t$,
that is clamped at two opposite ends while held under a tension $T$. Above a
critical tension $T_\lambda$ and critical twist angle $\eta_{tr}$, we find that
the sheet buckles with a mode number $n \geq 1$ transverse to the axis of
twist. Three distinct buckling regimes characterized as clamp-dominated,
bendable, and stiff are identified, by introducing a bendability length $L_B$
and a clamp length $L_{C}(<L_B)$. In the stiff regime ($L>L_B$), we find that
mode $n=1$ develops above $\eta_{tr} \equiv \eta_S \sim (t/W) T^{-1/2}$,
independent of $L$. In the bendable regime $L_{C}<L<L_B$, $n=1$ as well as $n >
1$ occur above $\eta_{tr} \equiv \eta_B \sim \sqrt{t/L}T^{-1/4}$. Here, we find
the wavelength $\lambda_B \sim \sqrt{Lt}T^{-1/4}$, when $n > 1$. These scalings
agree with those derived from a covariant form of the F\"oppl-von K\'arm\'an
equations, however, we find that the $n=1$ mode also occurs over a surprisingly
large range of $L$ in the bendable regime. Finally, in the clamp-dominated
regime ($L < L_c$), we find that $\eta_{tr}$ is higher compared to $\eta_B$ due
to additional stiffening induced by the clamped boundary conditions.
| cond-mat.soft | we investigate with experiments the twist induced transverse buckling instabilities of an elastic sheet of length l width w and thickness t that is clamped at two opposite ends while held under a tension t above a critical tension t_lambda and critical twist angle eta_tr we find that the sheet buckles with a mode number n geq 1 transverse to the axis of twist three distinct buckling regimes characterized as clampdominated bendable and stiff are identified by introducing a bendability length l_b and a clamp length l_cl_b in the stiff regime ll_b we find that mode n1 develops above eta_tr equiv eta_s sim tw t12 independent of l in the bendable regime l_cll_b n1 as well as n 1 occur above eta_tr equiv eta_b sim sqrttlt14 here we find the wavelength lambda_b sim sqrtltt14 when n 1 these scalings agree with those derived from a covariant form of the fopplvon karman equations however we find that the n1 mode also occurs over a surprisingly large range of l in the bendable regime finally in the clampdominated regime l l_c we find that eta_tr is higher compared to eta_b due to additional stiffening induced by the clamped boundary conditions | [['we', 'investigate', 'with', 'experiments', 'the', 'twist', 'induced', 'transverse', 'buckling', 'instabilities', 'of', 'an', 'elastic', 'sheet', 'of', 'length', 'l', 'width', 'w', 'and', 'thickness', 't', 'that', 'is', 'clamped', 'at', 'two', 'opposite', 'ends', 'while', 'held', 'under', 'a', 'tension', 't', 'above', 'a', 'critical', 'tension', 't_lambda', 'and', 'critical', 'twist', 'angle', 'eta_tr', 'we', 'find', 'that', 'the', 'sheet', 'buckles', 'with', 'a', 'mode', 'number', 'n', 'geq', '1', 'transverse', 'to', 'the', 'axis', 'of', 'twist', 'three', 'distinct', 'buckling', 'regimes', 'characterized', 'as', 'clampdominated', 'bendable', 'and', 'stiff', 'are', 'identified', 'by', 'introducing', 'a', 'bendability', 'length', 'l_b', 'and', 'a', 'clamp', 'length', 'l_cl_b', 'in', 'the', 'stiff', 'regime', 'll_b', 'we', 'find', 'that', 'mode', 'n1', 'develops', 'above', 'eta_tr', 'equiv', 'eta_s', 'sim', 'tw', 't12', 'independent', 'of', 'l', 'in', 'the', 'bendable', 'regime', 'l_cll_b', 'n1', 'as', 'well', 'as', 'n', '1', 'occur', 'above', 'eta_tr', 'equiv', 'eta_b', 'sim', 'sqrttlt14', 'here', 'we', 'find', 'the', 'wavelength', 'lambda_b', 'sim', 'sqrtltt14', 'when', 'n', '1', 'these', 'scalings', 'agree', 'with', 'those', 'derived', 'from', 'a', 'covariant', 'form', 'of', 'the', 'fopplvon', 'karman', 'equations', 'however', 'we', 'find', 'that', 'the', 'n1', 'mode', 'also', 'occurs', 'over', 'a', 'surprisingly', 'large', 'range', 'of', 'l', 'in', 'the', 'bendable', 'regime', 'finally', 'in', 'the', 'clampdominated', 'regime', 'l', 'l_c', 'we', 'find', 'that', 'eta_tr', 'is', 'higher', 'compared', 'to', 'eta_b', 'due', 'to', 'additional', 'stiffening', 'induced', 'by', 'the', 'clamped', 'boundary', 'conditions']] | [-0.2161205572378456, 0.27659198073299995, -0.008135574974646275, 0.011974614542660288, -0.012379861411185087, -0.18766497124683756, 0.018364851877424884, 0.3458608367543726, -0.2635886158564991, -0.26287235077763105, 0.03648683547587207, -0.28336060228050536, -0.08653043945202926, 0.1569604678810891, 0.0382194812567289, 0.020223890041142546, -0.008402897240057666, 0.018530654694143858, -0.05304462366727673, -0.1361918641858934, 0.2519013981617675, 0.0028533545269079858, 0.26247312526184463, 0.04435574148107486, 0.052917156245374165, -0.036823419181152166, 0.06915423421905965, 0.05977794781683198, -0.26257022764355936, -0.03291021521247104, 0.1996547942152198, -0.04524340225400858, 0.22498297666965042, -0.38395408022154065, -0.14218659118867444, 0.049929715586257535, 0.19903384847810288, 0.05698860757943841, 0.05304141371530427, -0.19118042131191051, 0.11861818153118588, -0.13745249761146597, -0.17108871441100437, 0.011831859443629288, 0.09435207026167065, -0.01575693025263465, -0.2813453176668333, 0.13874130088611047, 0.067417078888585, 0.04660284289290534, -0.023823234313201155, -0.1583194874107584, -0.06476946725115101, 0.026817909229323707, 0.10106839030781146, 0.08664903187934134, 0.1596974140491473, -0.1570655833344653, -0.026366481238108187, 0.3291814693673977, -0.07647714839976388, -0.14983328090522302, 0.1304906342149327, -0.18802662263014866, -0.08286972932702817, 0.16209696794138412, 0.09805615827519232, 0.09042221366754533, -0.02414594048608877, 0.09777855559213194, -0.03753513585366504, 0.18098922827432215, 0.17883910323220126, -0.014764140650181402, 0.16416027746285208, 0.16845672365390155, 0.03794078780972052, 0.12945287393196364, -0.10619157699365851, -0.018365712118388704, -0.3876833539378112, -0.09917385792067147, -0.11703670484087605, 0.10854987132104592, -0.09840587158632558, -0.12950848776320512, 0.28787565871912263, 0.07943103571757015, 0.2820917649160466, 0.07935490969724524, 0.21315473281042113, 0.10211437993929161, 0.0740740038795855, 0.10066185222392542, 0.2563845842628111, 0.1479137790948884, 0.07888593876256525, -0.26258246609160957, -0.026260482903121343, 0.034808013266371805] |
1,801.10457 | Irreducible 4-critical triangle-free toroidal graphs | The theory of Dvorak, Kral, and Thomas (2015) shows that a 4-critical
triangle-free graph embedded in the torus has only a bounded number of faces of
length greater than 4 and that the size of these faces is also bounded. We
study the natural reduction in such embedded graphs - identification of
opposite vertices in 4-faces. We give a computer-assisted argument showing that
there are exactly four 4-critical triangle-free irreducible toroidal graphs in
which this reduction cannot be applied without creating a triangle. Using this
result, we show that every 4-critical triangle-free graph embedded in the torus
has at most four 5-faces, or a 6-face and two 5-faces, or a 7-face and a
5-face, in addition to at least seven 4-faces. This result serves as a basis
for the exact description of $4$-critical triangle-free toroidal graphs, which
we present in a followup paper.
| math.CO | the theory of dvorak kral and thomas 2015 shows that a 4critical trianglefree graph embedded in the torus has only a bounded number of faces of length greater than 4 and that the size of these faces is also bounded we study the natural reduction in such embedded graphs identification of opposite vertices in 4faces we give a computerassisted argument showing that there are exactly four 4critical trianglefree irreducible toroidal graphs in which this reduction cannot be applied without creating a triangle using this result we show that every 4critical trianglefree graph embedded in the torus has at most four 5faces or a 6face and two 5faces or a 7face and a 5face in addition to at least seven 4faces this result serves as a basis for the exact description of 4critical trianglefree toroidal graphs which we present in a followup paper | [['the', 'theory', 'of', 'dvorak', 'kral', 'and', 'thomas', '2015', 'shows', 'that', 'a', '4critical', 'trianglefree', 'graph', 'embedded', 'in', 'the', 'torus', 'has', 'only', 'a', 'bounded', 'number', 'of', 'faces', 'of', 'length', 'greater', 'than', '4', 'and', 'that', 'the', 'size', 'of', 'these', 'faces', 'is', 'also', 'bounded', 'we', 'study', 'the', 'natural', 'reduction', 'in', 'such', 'embedded', 'graphs', 'identification', 'of', 'opposite', 'vertices', 'in', '4faces', 'we', 'give', 'a', 'computerassisted', 'argument', 'showing', 'that', 'there', 'are', 'exactly', 'four', '4critical', 'trianglefree', 'irreducible', 'toroidal', 'graphs', 'in', 'which', 'this', 'reduction', 'can', 'not', 'be', 'applied', 'without', 'creating', 'a', 'triangle', 'using', 'this', 'result', 'we', 'show', 'that', 'every', '4critical', 'trianglefree', 'graph', 'embedded', 'in', 'the', 'torus', 'has', 'at', 'most', 'four', '5faces', 'or', 'a', '6face', 'and', 'two', '5faces', 'or', 'a', '7face', 'and', 'a', '5face', 'in', 'addition', 'to', 'at', 'least', 'seven', '4faces', 'this', 'result', 'serves', 'as', 'a', 'basis', 'for', 'the', 'exact', 'description', 'of', '4critical', 'trianglefree', 'toroidal', 'graphs', 'which', 'we', 'present', 'in', 'a', 'followup', 'paper']] | [-0.16571079032894756, 0.09441010053269565, -0.06248650518245995, 0.024242749336242143, -0.06731099619397095, -0.12874597719803985, 0.006469450616610369, 0.3827519877281572, -0.1906960053677072, -0.3113365507817694, 0.12225630950332353, -0.3018693700898439, -0.16230376299271093, 0.1700485250197484, -0.10800149288095001, -0.028645856142143853, 0.12108433167117515, 0.06494663516225825, 0.023006305318059667, -0.2789092679079788, 0.279573017558349, -0.055960746541885396, 0.1534180560273983, 0.10031018465358232, 0.09589259150171918, 0.011303209353770528, 0.02246317444701812, 0.10682839217728803, -0.13883354045621152, 0.11598977883279855, 0.26663867779841116, 0.1250034344249538, 0.22687745102781004, -0.4126260748288977, -0.1557649135140569, 0.19270315663556437, 0.15207857047207654, 0.11274930840590969, -0.03602884703515363, -0.18451122365991718, 0.11735511121140527, -0.13941519225814514, -0.13785154872041727, 0.0002914353007716792, 0.08607273924364044, -0.04980138961525102, -0.22005517815372774, -0.023861309575191367, 0.1738982144743204, 0.10081352185724037, 0.04397147381096147, -0.13305005918789123, -0.042641152368326274, 0.0984421902045142, -0.06282378552049132, 0.09213103153243928, 0.025434214126185645, -0.1215015443640628, -0.18761949291718857, 0.37131169236797307, -0.028298575882321788, -0.17321900959858405, 0.17113879901090903, -0.14867222695611418, -0.24127779536814029, 0.12639661305916627, 0.1324615058123267, 0.14704754694498012, -0.0832171596254089, 0.0952074324728788, -0.1479746958640005, 0.15292221796033637, 0.16063321083451487, -0.03519460757462574, 0.1323927734146959, 0.1473149646273149, 0.11908438445867173, 0.1903090258985425, -0.02737881424171584, 0.014431932468765549, -0.31072004346975257, -0.13805691082546087, -0.20305531051708386, 0.09302173765120512, -0.160729768515947, -0.20392470538749227, 0.40896933756635656, 0.08806831745896489, 0.19349482751983618, 0.06485226152123817, 0.23177595171977633, 0.05691779525867397, 0.07887378120129662, 0.17894524033513984, 0.17969763283617796, 0.12336643852177076, -0.013118419513505484, -0.12426308405452541, 0.01665561401085662, 0.118345138186539] |
1,801.10458 | The impact of $\mathbf{K^+\Lambda}$ photoproduction on the resonance
spectrum | The J\"ulich-Bonn coupled-channel framework is extended to $K^+\Lambda$
photoproduction. The spectrum of nucleon and $\Delta$ resonances is extracted
from simultaneous fits to several pion-induced reactions in addition to pion,
eta and $K^+\Lambda$ photoproduction off the proton. More than 40,000 data
points up to a center-of-mass energy of E$\sim$2.3 GeV including recently
measured double-polarization observables are analyzed. The influence of the
$\gamma p\to K^+\Lambda$ channel on the extracted resonance parameters and the
appearance of states not seen in other channels is investigated. The
J\"ulich-Bonn model includes effective three-body channels and guarantees
unitarity and analyticity, which is a prerequisite for a reliable determination
of the resonance spectrum in terms of poles and residues.
| nucl-th hep-ph nucl-ex | the julichbonn coupledchannel framework is extended to klambda photoproduction the spectrum of nucleon and delta resonances is extracted from simultaneous fits to several pioninduced reactions in addition to pion eta and klambda photoproduction off the proton more than 40000 data points up to a centerofmass energy of esim23 gev including recently measured doublepolarization observables are analyzed the influence of the gamma pto klambda channel on the extracted resonance parameters and the appearance of states not seen in other channels is investigated the julichbonn model includes effective threebody channels and guarantees unitarity and analyticity which is a prerequisite for a reliable determination of the resonance spectrum in terms of poles and residues | [['the', 'julichbonn', 'coupledchannel', 'framework', 'is', 'extended', 'to', 'klambda', 'photoproduction', 'the', 'spectrum', 'of', 'nucleon', 'and', 'delta', 'resonances', 'is', 'extracted', 'from', 'simultaneous', 'fits', 'to', 'several', 'pioninduced', 'reactions', 'in', 'addition', 'to', 'pion', 'eta', 'and', 'klambda', 'photoproduction', 'off', 'the', 'proton', 'more', 'than', '40000', 'data', 'points', 'up', 'to', 'a', 'centerofmass', 'energy', 'of', 'esim23', 'gev', 'including', 'recently', 'measured', 'doublepolarization', 'observables', 'are', 'analyzed', 'the', 'influence', 'of', 'the', 'gamma', 'pto', 'klambda', 'channel', 'on', 'the', 'extracted', 'resonance', 'parameters', 'and', 'the', 'appearance', 'of', 'states', 'not', 'seen', 'in', 'other', 'channels', 'is', 'investigated', 'the', 'julichbonn', 'model', 'includes', 'effective', 'threebody', 'channels', 'and', 'guarantees', 'unitarity', 'and', 'analyticity', 'which', 'is', 'a', 'prerequisite', 'for', 'a', 'reliable', 'determination', 'of', 'the', 'resonance', 'spectrum', 'in', 'terms', 'of', 'poles', 'and', 'residues']] | [-0.10535241007614372, 0.14812123399143193, -0.10849343402267302, 0.12597757844169707, -0.03309951546940614, -0.12779371993912553, 0.060437454863197425, 0.32892293774268844, -0.19369328959252347, -0.23459746452387084, -0.04562107854746335, -0.3563682467422702, -0.012276375396388838, 0.1640144240978936, 0.09596158225427974, 0.13426444389307024, 0.09455901393666863, 0.07541481947357004, -0.01148923237765716, -0.11137082819848067, 0.3265831130980091, 0.08489746349779043, 0.21161657068878412, 0.17135493213480169, 0.03239783631235531, 0.07861608031248166, -0.037436244975436815, -0.1115836791524833, -0.13854592108188873, 0.08475559353987179, 0.2789150343361226, 0.07953278970896711, 0.08014991727911613, -0.3412822605534033, -0.18731658607298, 0.11776336847211827, 0.18734162422320383, 0.07127511096292768, 0.026453802252415864, -0.3252802680754526, 0.10597934642467986, -0.17110010818154975, -0.1266669286425564, -0.1024847284975377, 0.03590263243214312, -0.03348388745322485, -0.3459232341540469, 0.06196120726659005, -0.041813053080907346, 0.07132826051251455, -0.06785479315810583, -0.2344803060489622, -0.018983747103166852, 0.07935546804642812, 0.08917658330385828, 0.059789715576070275, 0.1808573090852323, -0.15577694921838967, -0.09799168864900076, 0.39512087988921185, -0.01770653391788735, -0.16510682725770906, 0.10799386800235053, -0.19181688554923643, -0.1028341591866179, 0.20016248456456445, 0.19324462048878724, 0.07702076912180267, -0.22695973461747848, 0.09070678442737765, -0.0109964990649711, 0.17742633171040903, 0.12674828176386654, 0.06493772678077221, 0.09007853517647493, 0.15600062166658146, -0.05322232633321123, 0.057598446575734256, -0.13185493823098526, -0.0982240516438403, -0.33877744402694093, -0.03728249237174168, -0.09294366210868413, 0.03790179135672092, -0.024496960956656204, -0.06423335178670558, 0.4036069719628854, 0.01835448923600118, 0.3061473390182734, -0.01682091149268672, 0.3052759797777981, 0.12533302208916708, 0.09544355613179505, 0.06651745596477254, 0.29075020588087763, 0.20517144099893894, 0.09435307107950476, -0.24329694559247317, 0.00668478167869828, -0.025591994534161958] |
1,801.10459 | Pretraining Deep Actor-Critic Reinforcement Learning Algorithms With
Expert Demonstrations | Pretraining with expert demonstrations have been found useful in speeding up
the training process of deep reinforcement learning algorithms since less
online simulation data is required. Some people use supervised learning to
speed up the process of feature learning, others pretrain the policies by
imitating expert demonstrations. However, these methods are unstable and not
suitable for actor-critic reinforcement learning algorithms. Also, some
existing methods rely on the global optimum assumption, which is not true in
most scenarios. In this paper, we employ expert demonstrations in a
actor-critic reinforcement learning framework, and meanwhile ensure that the
performance is not affected by the fact that expert demonstrations are not
global optimal. We theoretically derive a method for computing policy gradients
and value estimators with only expert demonstrations. Our method is
theoretically plausible for actor-critic reinforcement learning algorithms that
pretrains both policy and value functions. We apply our method to two of the
typical actor-critic reinforcement learning algorithms, DDPG and ACER, and
demonstrate with experiments that our method not only outperforms the RL
algorithms without pretraining process, but also is more simulation efficient.
| cs.AI cs.LG stat.ML | pretraining with expert demonstrations have been found useful in speeding up the training process of deep reinforcement learning algorithms since less online simulation data is required some people use supervised learning to speed up the process of feature learning others pretrain the policies by imitating expert demonstrations however these methods are unstable and not suitable for actorcritic reinforcement learning algorithms also some existing methods rely on the global optimum assumption which is not true in most scenarios in this paper we employ expert demonstrations in a actorcritic reinforcement learning framework and meanwhile ensure that the performance is not affected by the fact that expert demonstrations are not global optimal we theoretically derive a method for computing policy gradients and value estimators with only expert demonstrations our method is theoretically plausible for actorcritic reinforcement learning algorithms that pretrains both policy and value functions we apply our method to two of the typical actorcritic reinforcement learning algorithms ddpg and acer and demonstrate with experiments that our method not only outperforms the rl algorithms without pretraining process but also is more simulation efficient | [['pretraining', 'with', 'expert', 'demonstrations', 'have', 'been', 'found', 'useful', 'in', 'speeding', 'up', 'the', 'training', 'process', 'of', 'deep', 'reinforcement', 'learning', 'algorithms', 'since', 'less', 'online', 'simulation', 'data', 'is', 'required', 'some', 'people', 'use', 'supervised', 'learning', 'to', 'speed', 'up', 'the', 'process', 'of', 'feature', 'learning', 'others', 'pretrain', 'the', 'policies', 'by', 'imitating', 'expert', 'demonstrations', 'however', 'these', 'methods', 'are', 'unstable', 'and', 'not', 'suitable', 'for', 'actorcritic', 'reinforcement', 'learning', 'algorithms', 'also', 'some', 'existing', 'methods', 'rely', 'on', 'the', 'global', 'optimum', 'assumption', 'which', 'is', 'not', 'true', 'in', 'most', 'scenarios', 'in', 'this', 'paper', 'we', 'employ', 'expert', 'demonstrations', 'in', 'a', 'actorcritic', 'reinforcement', 'learning', 'framework', 'and', 'meanwhile', 'ensure', 'that', 'the', 'performance', 'is', 'not', 'affected', 'by', 'the', 'fact', 'that', 'expert', 'demonstrations', 'are', 'not', 'global', 'optimal', 'we', 'theoretically', 'derive', 'a', 'method', 'for', 'computing', 'policy', 'gradients', 'and', 'value', 'estimators', 'with', 'only', 'expert', 'demonstrations', 'our', 'method', 'is', 'theoretically', 'plausible', 'for', 'actorcritic', 'reinforcement', 'learning', 'algorithms', 'that', 'pretrains', 'both', 'policy', 'and', 'value', 'functions', 'we', 'apply', 'our', 'method', 'to', 'two', 'of', 'the', 'typical', 'actorcritic', 'reinforcement', 'learning', 'algorithms', 'ddpg', 'and', 'acer', 'and', 'demonstrate', 'with', 'experiments', 'that', 'our', 'method', 'not', 'only', 'outperforms', 'the', 'rl', 'algorithms', 'without', 'pretraining', 'process', 'but', 'also', 'is', 'more', 'simulation', 'efficient']] | [0.02747814598317038, 0.01617496829583413, -0.11746276788827446, 0.07110367476043393, -0.17293879905612106, -0.21641512543169988, 0.06466973396341523, 0.5581763627628485, -0.24020184633619565, -0.3302189969587036, 0.0891054624297087, -0.21132645185312462, -0.22883830862119794, 0.2392880175068664, -0.13575476818821497, 0.11075390778908817, 0.1409083584517551, 0.027462143826091454, -0.05831755013075761, -0.33702014150330795, 0.2898814038114829, 0.017279523190518377, 0.34205759267012276, -0.012548859958123002, 0.16041579353687768, -0.06321838644152093, 0.03216969699844614, -0.018360693238597982, -0.07741809337635965, 0.15499024699868943, 0.3651036019023094, 0.24165577459174933, 0.4367030137942897, -0.38696907424471444, -0.20275999980254306, 0.14659734407646788, 0.17868090287989213, 0.12245625012955215, -0.08097516883014275, -0.3319719683378935, 0.09247706205480628, -0.16188083134022438, 0.024085595321634578, -0.199678542997895, -0.06774873370046003, -0.00163647806750507, -0.34473763750089953, 0.004452735820410049, 0.09606920318231763, 0.04548380562983867, -0.06215470898120354, -0.13387170842874588, 0.09858962754434389, 0.12680648935234382, 0.0600193381434009, 0.03866294495657914, 0.18462479675654322, -0.20022188834587318, -0.21601899615488945, 0.2789628144612329, -0.013601710471428103, -0.20188706012106397, 0.20302757081937872, 0.002296095910585589, -0.1438266537404464, 0.10881429483286209, 0.2096801550489747, 0.19737267081315318, -0.16635670165997, 0.03857603838809559, -0.04339826760503153, 0.15850440615322442, -0.012836206841489508, -0.0478647913525088, 0.05744335345807485, 0.2376255237342169, 0.07159441073632075, 0.0559991171117872, -0.03140018807607703, -0.14600862418172053, -0.20305958030383206, -0.08752360785535226, -0.22136561777701394, -0.039700627069800654, -0.11575680845627277, -0.10618060182573066, 0.29988163223024455, 0.2756020048426257, 0.16315312361241216, 0.15296056865255298, 0.383292062415017, 0.054231522154037114, 0.11415989715088573, 0.1841843965709106, 0.27792100689871907, -0.01564747688308772, 0.16038092657561517, -0.19724465368522537, 0.16310980338344558, 0.039991807026995556] |
1,801.1046 | On families of periodic orbits in the restricted three-body problem | Since Poincar\'e, periodic orbits have been one of the most important objects
in dynamical systems. However, searching them is in general quite difficult. A
common way to find them is to construct families of periodic orbits which start
at obvious periodic orbits. On the other hand, given two periodic orbits one
might ask if they are connected by an orbit cylinder, i.e., by a one-parameter
family of periodic orbits.
In this article we study this question for a certain class of periodic orbits
in the planar circular restricted three-body problem. Our strategy is to
compare the Cieliebak-Frauenfelder-van Koert invariants which are obstructions
to the existence of an orbit cylinder.
| math.DS math-ph math.MP | since poincare periodic orbits have been one of the most important objects in dynamical systems however searching them is in general quite difficult a common way to find them is to construct families of periodic orbits which start at obvious periodic orbits on the other hand given two periodic orbits one might ask if they are connected by an orbit cylinder ie by a oneparameter family of periodic orbits in this article we study this question for a certain class of periodic orbits in the planar circular restricted threebody problem our strategy is to compare the cieliebakfrauenfeldervan koert invariants which are obstructions to the existence of an orbit cylinder | [['since', 'poincare', 'periodic', 'orbits', 'have', 'been', 'one', 'of', 'the', 'most', 'important', 'objects', 'in', 'dynamical', 'systems', 'however', 'searching', 'them', 'is', 'in', 'general', 'quite', 'difficult', 'a', 'common', 'way', 'to', 'find', 'them', 'is', 'to', 'construct', 'families', 'of', 'periodic', 'orbits', 'which', 'start', 'at', 'obvious', 'periodic', 'orbits', 'on', 'the', 'other', 'hand', 'given', 'two', 'periodic', 'orbits', 'one', 'might', 'ask', 'if', 'they', 'are', 'connected', 'by', 'an', 'orbit', 'cylinder', 'ie', 'by', 'a', 'oneparameter', 'family', 'of', 'periodic', 'orbits', 'in', 'this', 'article', 'we', 'study', 'this', 'question', 'for', 'a', 'certain', 'class', 'of', 'periodic', 'orbits', 'in', 'the', 'planar', 'circular', 'restricted', 'threebody', 'problem', 'our', 'strategy', 'is', 'to', 'compare', 'the', 'cieliebakfrauenfeldervan', 'koert', 'invariants', 'which', 'are', 'obstructions', 'to', 'the', 'existence', 'of', 'an', 'orbit', 'cylinder']] | [-0.22532067748855938, 0.11491984912626557, -0.09959004372056504, 0.08221756238856835, -0.08944556591342445, -0.1538464469259553, -0.006135698071577483, 0.3706809006527894, -0.28032047803949184, -0.24962252193061565, 0.13836277802517913, -0.24399826097888527, -0.1541368734712402, 0.25628754277541127, -0.11770198753651197, 0.08437562547300735, 0.11965849184909733, 0.07996953337203229, -0.05858536888263188, -0.27338910212360873, 0.3682720173771183, -0.0468266112341856, 0.12158413814311778, -0.043673617834294284, 0.026712155689623346, 0.010206765327085223, 0.02454487100045231, -0.004268052772170416, -0.16452095542680817, 0.13205470843563993, 0.22954932771002254, 0.035119932397113494, 0.23827912442006724, -0.3806694435921532, -0.17079621717264806, 0.14430305943393182, 0.14708685709370506, 0.11930150028826945, -0.0397515751268387, -0.2722520714332522, 0.1111755494925159, -0.14467687437879956, -0.2368142106052902, -0.048322350248108034, 0.1477461492004632, 0.013620632011831427, -0.19520946798029062, 0.006666047619310794, 0.12739694402504634, 0.055934914793060335, -0.048388035957166856, -0.025510331075767882, -0.030119847042779264, 0.1319668357976264, 0.08127802371745929, -0.0006808713380316341, 0.08739368553721795, -0.043075908262161886, -0.12220314664214298, 0.4299174770772138, -0.003939161451179879, -0.216575647359369, 0.262359351342268, -0.16233557933204187, -0.1730029031686071, 0.15612519912732145, 0.16828931858590632, 0.16309583154334514, -0.17726727671645306, 0.10096281960917015, -0.11479867328415383, 0.1065720673478036, 0.15872081940027852, -0.0152846579628574, 0.29776965198753813, 0.09767991199623793, 0.14774686719842808, 0.1204296294820745, -0.03101785576964849, -0.0936603113789008, -0.22605276276805886, -0.08401010116062092, -0.10499317948792682, 0.03978261719802739, -0.01250330897285797, -0.22881686268374324, 0.3924809307726618, 0.09780379752111104, 0.2136286432484027, 0.013242912192018357, 0.23248178379920623, 0.08417433246008672, 0.038967363118125056, 0.08855417031251515, 0.2489498592093932, 0.0945285015170359, -0.010758139619914195, -0.16480570665508923, -0.0005760849286431309, 0.10485350797211544] |
1,801.10461 | Characteristic polynomials of modified permutation matrices at
microscopic scale | We study the characteristic polynomial of random permutation matrices
following some measures which are invariant by conjugation, including Ewens'
measures which are one-parameter deformations of the uniform distribution on
the permutation group. We also look at some modifications of permutation
matrices where the entries equal to one are replaced by i.i.d uniform variables
on the unit circle. Once appropriately normalized and scaled, we show that the
characteristic polynomial converges in distribution on every compact subset of
$\mathbb{C}$ to an explicit limiting entire function, when the size of the
matrices goes to infinity. Our findings can be related to results by Chhaibi,
Najnudel and Nikeghbali on the limiting characteristic polynomial of the
Circular Unitary Ensemble.
| math.PR | we study the characteristic polynomial of random permutation matrices following some measures which are invariant by conjugation including ewens measures which are oneparameter deformations of the uniform distribution on the permutation group we also look at some modifications of permutation matrices where the entries equal to one are replaced by iid uniform variables on the unit circle once appropriately normalized and scaled we show that the characteristic polynomial converges in distribution on every compact subset of mathbbc to an explicit limiting entire function when the size of the matrices goes to infinity our findings can be related to results by chhaibi najnudel and nikeghbali on the limiting characteristic polynomial of the circular unitary ensemble | [['we', 'study', 'the', 'characteristic', 'polynomial', 'of', 'random', 'permutation', 'matrices', 'following', 'some', 'measures', 'which', 'are', 'invariant', 'by', 'conjugation', 'including', 'ewens', 'measures', 'which', 'are', 'oneparameter', 'deformations', 'of', 'the', 'uniform', 'distribution', 'on', 'the', 'permutation', 'group', 'we', 'also', 'look', 'at', 'some', 'modifications', 'of', 'permutation', 'matrices', 'where', 'the', 'entries', 'equal', 'to', 'one', 'are', 'replaced', 'by', 'iid', 'uniform', 'variables', 'on', 'the', 'unit', 'circle', 'once', 'appropriately', 'normalized', 'and', 'scaled', 'we', 'show', 'that', 'the', 'characteristic', 'polynomial', 'converges', 'in', 'distribution', 'on', 'every', 'compact', 'subset', 'of', 'mathbbc', 'to', 'an', 'explicit', 'limiting', 'entire', 'function', 'when', 'the', 'size', 'of', 'the', 'matrices', 'goes', 'to', 'infinity', 'our', 'findings', 'can', 'be', 'related', 'to', 'results', 'by', 'chhaibi', 'najnudel', 'and', 'nikeghbali', 'on', 'the', 'limiting', 'characteristic', 'polynomial', 'of', 'the', 'circular', 'unitary', 'ensemble']] | [-0.10991951139989943, 0.15934888442550205, -0.07686714086871166, 0.04794341720541758, -0.029800220067093593, -0.1213756918050019, 0.02557988551577174, 0.37275900037349324, -0.3075115173989165, -0.19021159691521816, 0.12796977014730032, -0.2891894144302778, -0.1401550339471005, 0.1744783631880331, -0.09987318034456895, 0.0799065327634458, 0.009785085442616085, 0.10215173719401381, -0.12911103715897596, -0.3055463022834712, 0.3614514365656285, 0.018701808757882202, 0.24040596604149425, -0.02860644290767676, 0.09280585725348756, 0.02950596252808644, -0.04366689001877619, -0.009641156489631177, -0.11645088616205612, 0.05774152888792806, 0.184982291991468, 0.10634181737092084, 0.23862022745826866, -0.3703046303303743, -0.12537939879482826, 0.193453302021773, 0.15743707877015117, 0.019233113268093592, 0.01646793592078364, -0.28609145522546187, 0.14329340899197293, -0.11921663229988344, -0.16573833316086536, -0.055879921355672116, 0.05335417042066038, 0.09877850440901548, -0.29656984248256263, 0.017681223360679434, 0.10498844987951812, 0.060695681634433236, -0.007952004110654899, -0.15813229670253606, 0.02847817733438801, 0.1129769008903892, 0.050622816139881587, 0.03077447952278189, 0.15362475691229285, -0.03495716301114422, -0.07488655700735682, 0.33310282086197335, -0.06803330671520227, -0.2816536806449624, 0.10578098170772458, -0.21660872327217387, -0.16909401612850813, 0.1024229445791416, 0.15280165223083336, 0.0986072958768469, -0.09137976869996906, 0.11805532034589554, -0.14052401488828184, 0.10715082789713566, 0.11832983560233781, -0.003175113323367143, 0.14324329543520853, 0.026414481393448944, 0.10758287886536755, 0.16012847100990305, -0.01651529932345173, -0.11802187325243335, -0.33792134273830243, -0.1317654156493872, -0.2388930970646309, 0.11643012633662572, -0.18814226093189998, -0.17193746463337964, 0.43069199688600757, 0.0947613423006131, 0.2419189905203813, 0.13633657942641428, 0.1906366461756087, 0.14145721968539487, 0.059736777962375004, 0.07293510925750026, 0.06344257168465632, 0.1722975883764767, -0.037380478962992146, -0.1720326268979538, 0.05537166203958378, 0.1052286643246436] |
1,801.10462 | Modelling the Performance of Single-Photon Counting Kinetic Inductance
Detectors | Using conventional superconductor theory we discuss and validate a model that
describes the energy-resolving performance of an aluminium LEKID to
single-photon absorption events. While aluminium is not the optimum material
for single-photon counting applications, this material is well understood and
is used to understand the underlying device physics of these detectors. We also
discuss data analysis techniques used to extract single-photon detections from
noisy data.
| astro-ph.IM | using conventional superconductor theory we discuss and validate a model that describes the energyresolving performance of an aluminium lekid to singlephoton absorption events while aluminium is not the optimum material for singlephoton counting applications this material is well understood and is used to understand the underlying device physics of these detectors we also discuss data analysis techniques used to extract singlephoton detections from noisy data | [['using', 'conventional', 'superconductor', 'theory', 'we', 'discuss', 'and', 'validate', 'a', 'model', 'that', 'describes', 'the', 'energyresolving', 'performance', 'of', 'an', 'aluminium', 'lekid', 'to', 'singlephoton', 'absorption', 'events', 'while', 'aluminium', 'is', 'not', 'the', 'optimum', 'material', 'for', 'singlephoton', 'counting', 'applications', 'this', 'material', 'is', 'well', 'understood', 'and', 'is', 'used', 'to', 'understand', 'the', 'underlying', 'device', 'physics', 'of', 'these', 'detectors', 'we', 'also', 'discuss', 'data', 'analysis', 'techniques', 'used', 'to', 'extract', 'singlephoton', 'detections', 'from', 'noisy', 'data']] | [-0.05817079286879072, 0.053782014887502345, -0.06675821951088998, 0.09604792536522906, -0.059423390990839556, -0.1920015652377445, 0.06681991308891716, 0.4330088422848628, -0.22053859680891036, -0.3404924431959024, 0.0698840291884083, -0.35167748546944216, -0.12790709586384205, 0.2472099148050452, -0.07972685484072337, 0.10749879641315112, 0.030734046620245162, -0.04087163036545882, -0.05531990054923181, -0.18872105189814017, 0.2567374919111339, 0.09267849432161221, 0.35029259401445206, 0.0731464226801808, 0.10194434124188355, -0.03290790785104036, -0.023907951896007244, -0.035610301047563554, -0.12290911748703086, 0.08749791152345446, 0.3417584803062849, 0.12272991202771663, 0.182077364401462, -0.45424892297730995, -0.2154714468580026, 0.03698216697487693, 0.10981704336232864, 0.14367657428105862, -0.0560183215743074, -0.28727497229209314, 0.06973438692780641, -0.1506620874771705, -0.12087534497348736, -0.0904565337830438, -0.07006584394436616, -0.005201235600711348, -0.24397198776356302, -0.01494611926206674, 0.013013466277446312, -0.00190907299446945, -0.01047343138533716, -0.08189118916097168, 0.040774255736659354, 0.08394385945195189, -0.025843525504191906, -0.024329875144534385, 0.20952888161230546, -0.14351877968829985, -0.15082588081176465, 0.3471549047013888, -0.06905064237518953, -0.12103326902366601, 0.1857525398954749, -0.1046200569289235, -0.07821794700307341, 0.14296267114293118, 0.1722559890494897, 0.08046449272570988, -0.22287456696996322, 0.02391181957657234, 0.012379234298490562, 0.24339476388234357, 0.021185901646430676, 0.11596998338086101, 0.18272752481548546, 0.26851105841879663, -0.024525307491421698, 0.1529929508652108, -0.15252123617996963, 0.02188729612300029, -0.2934576830611779, -0.16228556604339525, -0.2135114073753357, 0.03993335671279615, -0.03053168956002292, -0.16436677122345336, 0.36002738341115986, 0.2549313380741156, 0.14016472925073825, -0.056819633695368583, 0.33471223591611937, 0.09302718027566488, 0.05836766184522556, -0.00684270987000603, 0.2728150153765455, 0.14506696048550882, 0.1137622190818477, -0.19484884723340376, 0.07312163895425888, -0.03148592716226211] |
1,801.10463 | Skyrmions formation due to unconventional magnetic modes in anisotropic
multi-band superconductors | Multiband superconductors have a sufficient number of degrees of freedom to
allow topological excitations characterized by Skyrmionic topological
invariants. In the most common, clean s-wave multiband, systems the interband
magnetic coupling favours composite vortex solutions, without a Skyrmionic
topological charge. It was discussed recently that certain kinds of
anisotropies lead to hybridisation of the interband phase difference (Leggett)
mode with magnetic modes, dramatically changing the hydromagnetostatics of the
system. Here we report this effect for a range of parameters that substantially
alter the nature of the topological excitations, leading to solutions
characterized by a nontrivial topological invariant, rather than the standard
composite vortex solutions. This invariant is not truly topologically conserved
but is energetically conserved, leading to a texture formed of bound
excitations in each band, namely fractional vortices, each carrying a fraction
of the flux quantum. We demonstrate that in this regime there is a rich
spectrum of Skyrmion solutions, with various topological charges, that are
robust with respect to changes of parameters of the system and present for a
wide range of anisotropies.
| cond-mat.supr-con | multiband superconductors have a sufficient number of degrees of freedom to allow topological excitations characterized by skyrmionic topological invariants in the most common clean swave multiband systems the interband magnetic coupling favours composite vortex solutions without a skyrmionic topological charge it was discussed recently that certain kinds of anisotropies lead to hybridisation of the interband phase difference leggett mode with magnetic modes dramatically changing the hydromagnetostatics of the system here we report this effect for a range of parameters that substantially alter the nature of the topological excitations leading to solutions characterized by a nontrivial topological invariant rather than the standard composite vortex solutions this invariant is not truly topologically conserved but is energetically conserved leading to a texture formed of bound excitations in each band namely fractional vortices each carrying a fraction of the flux quantum we demonstrate that in this regime there is a rich spectrum of skyrmion solutions with various topological charges that are robust with respect to changes of parameters of the system and present for a wide range of anisotropies | [['multiband', 'superconductors', 'have', 'a', 'sufficient', 'number', 'of', 'degrees', 'of', 'freedom', 'to', 'allow', 'topological', 'excitations', 'characterized', 'by', 'skyrmionic', 'topological', 'invariants', 'in', 'the', 'most', 'common', 'clean', 'swave', 'multiband', 'systems', 'the', 'interband', 'magnetic', 'coupling', 'favours', 'composite', 'vortex', 'solutions', 'without', 'a', 'skyrmionic', 'topological', 'charge', 'it', 'was', 'discussed', 'recently', 'that', 'certain', 'kinds', 'of', 'anisotropies', 'lead', 'to', 'hybridisation', 'of', 'the', 'interband', 'phase', 'difference', 'leggett', 'mode', 'with', 'magnetic', 'modes', 'dramatically', 'changing', 'the', 'hydromagnetostatics', 'of', 'the', 'system', 'here', 'we', 'report', 'this', 'effect', 'for', 'a', 'range', 'of', 'parameters', 'that', 'substantially', 'alter', 'the', 'nature', 'of', 'the', 'topological', 'excitations', 'leading', 'to', 'solutions', 'characterized', 'by', 'a', 'nontrivial', 'topological', 'invariant', 'rather', 'than', 'the', 'standard', 'composite', 'vortex', 'solutions', 'this', 'invariant', 'is', 'not', 'truly', 'topologically', 'conserved', 'but', 'is', 'energetically', 'conserved', 'leading', 'to', 'a', 'texture', 'formed', 'of', 'bound', 'excitations', 'in', 'each', 'band', 'namely', 'fractional', 'vortices', 'each', 'carrying', 'a', 'fraction', 'of', 'the', 'flux', 'quantum', 'we', 'demonstrate', 'that', 'in', 'this', 'regime', 'there', 'is', 'a', 'rich', 'spectrum', 'of', 'skyrmion', 'solutions', 'with', 'various', 'topological', 'charges', 'that', 'are', 'robust', 'with', 'respect', 'to', 'changes', 'of', 'parameters', 'of', 'the', 'system', 'and', 'present', 'for', 'a', 'wide', 'range', 'of', 'anisotropies']] | [-0.24346305885293318, 0.23849962427462826, -0.06541979387830729, 0.047425162547599826, -0.07806633029604094, -0.14267791963942433, 0.059479851032146945, 0.30166136272165966, -0.23930380528527795, -0.29550679771386185, 0.028168327978614117, -0.2748551003537248, -0.12766546766733985, 0.16098968257281887, 0.009536329046662512, 0.038591923923418994, -0.0070531237529237465, -0.023787924373554516, -0.10221676806780114, -0.19313260136926869, 0.3431134493914486, -0.027690468522607637, 0.32094421512019106, 0.056600733332325244, 0.04869518243579258, -0.0338743371399248, 0.07040094581132235, 0.04902917794861841, -0.15435077884350235, 0.07669520774966102, 0.24134353086909002, -0.03648113670234365, 0.15385643854983494, -0.4171118277617484, -0.22596509149833316, 0.09434675533008686, 0.1671560451772396, 0.153585703112185, -0.06251167382003911, -0.2909797971590695, 0.09917574587088057, -0.1761987899141065, -0.14577330561922114, -0.13467867767181377, 0.044231731974487674, -0.0027612256844281808, -0.23317000348971964, 0.09407822896415989, 0.05637199172065004, 0.06365783599301658, -0.08114362860783592, -0.0643336768569853, -0.09542887378283295, 0.05601156758540578, 0.08049978439805858, 0.02414140660628869, 0.10512543510881135, -0.17382171234228358, -0.13272514817808037, 0.3781662041123357, -0.03518706798092154, -0.19605564030058598, 0.1853016452895927, -0.1391081240927351, -0.10529318697022638, 0.2018912656409345, 0.09231364677744468, 0.10410848673066424, -0.11356551009604986, 0.06440575308154402, -0.024401705294590573, 0.19929088915473428, 0.01664285428404551, 0.16839871033705, 0.3075386539647548, 0.15430472065405598, 0.08205621988357355, 0.1610820281463836, -0.0874394272397548, -0.0860765942013769, -0.2637024175097374, -0.1509523663322586, -0.2114592267435523, 0.03861814948213996, -0.04125108047455065, -0.2215606122352611, 0.4739747924847935, 0.13892560807021934, 0.18018642203158422, -0.0468213567844774, 0.22193798861444938, 0.12281808731361592, 0.09342801930107197, 0.036923942330089964, 0.2638034242695069, 0.13543558925465177, 0.09008936777151585, -0.26434550284215347, 0.026664475500904793, 0.03089447587262839] |
1,801.10464 | Unified presentation of four fundamental inequalities | We suggest an unified presentation to teach fundamental constants to graduate
students, by introducing four lower limits to observed phenomena. The reduced
Planck constant $\hbar$ is the lowest classically definable action. The inverse
of invariant speed, $s$, is the lowest observable slowness. The Planck time,
$t_{\rm P}$, is the lowest observable time scale. The Boltzmann constant, $k$,
determines the lowest coherent degree of freedom; we recall a Einstein
criterion on the fluctuations of small thermal systems and show that it has
far-reaching implications, such as demonstrating the relations between critical
exponents. Each of these four fundamental limits enters in an inequality, which
marks a horizon of the universe we can perceive. This compact presentation can
resolve some difficulties encountered when trying to defining the epistemologic
status of these constants, and emphasizes their useful role in shaping our
intuitive vision of the universe.
| physics.pop-ph | we suggest an unified presentation to teach fundamental constants to graduate students by introducing four lower limits to observed phenomena the reduced planck constant hbar is the lowest classically definable action the inverse of invariant speed s is the lowest observable slowness the planck time t_rm p is the lowest observable time scale the boltzmann constant k determines the lowest coherent degree of freedom we recall a einstein criterion on the fluctuations of small thermal systems and show that it has farreaching implications such as demonstrating the relations between critical exponents each of these four fundamental limits enters in an inequality which marks a horizon of the universe we can perceive this compact presentation can resolve some difficulties encountered when trying to defining the epistemologic status of these constants and emphasizes their useful role in shaping our intuitive vision of the universe | [['we', 'suggest', 'an', 'unified', 'presentation', 'to', 'teach', 'fundamental', 'constants', 'to', 'graduate', 'students', 'by', 'introducing', 'four', 'lower', 'limits', 'to', 'observed', 'phenomena', 'the', 'reduced', 'planck', 'constant', 'hbar', 'is', 'the', 'lowest', 'classically', 'definable', 'action', 'the', 'inverse', 'of', 'invariant', 'speed', 's', 'is', 'the', 'lowest', 'observable', 'slowness', 'the', 'planck', 'time', 't_rm', 'p', 'is', 'the', 'lowest', 'observable', 'time', 'scale', 'the', 'boltzmann', 'constant', 'k', 'determines', 'the', 'lowest', 'coherent', 'degree', 'of', 'freedom', 'we', 'recall', 'a', 'einstein', 'criterion', 'on', 'the', 'fluctuations', 'of', 'small', 'thermal', 'systems', 'and', 'show', 'that', 'it', 'has', 'farreaching', 'implications', 'such', 'as', 'demonstrating', 'the', 'relations', 'between', 'critical', 'exponents', 'each', 'of', 'these', 'four', 'fundamental', 'limits', 'enters', 'in', 'an', 'inequality', 'which', 'marks', 'a', 'horizon', 'of', 'the', 'universe', 'we', 'can', 'perceive', 'this', 'compact', 'presentation', 'can', 'resolve', 'some', 'difficulties', 'encountered', 'when', 'trying', 'to', 'defining', 'the', 'epistemologic', 'status', 'of', 'these', 'constants', 'and', 'emphasizes', 'their', 'useful', 'role', 'in', 'shaping', 'our', 'intuitive', 'vision', 'of', 'the', 'universe']] | [-0.1538414585351257, 0.19300687440083997, -0.0990417032363884, 0.10249747633967046, -0.12199875782409035, -0.11866922155584057, 0.03713417918328856, 0.3132333823897486, -0.2984969454507033, -0.3175143354394017, 0.05946466616183149, -0.2456840398087305, -0.11255573554968475, 0.19403384372440055, -0.05246257476825664, 0.028934207441060678, -0.016795123067803362, 0.07482700650943509, -0.07922019267121184, -0.26504170232789315, 0.3125320620279997, 0.09705179873919974, 0.2597237556697206, 0.07435055847316055, 0.1259077140542407, -0.046112529822816765, -0.025318339272197468, -0.0025392491535567645, -0.17007153010820839, 0.10350047405115625, 0.27403522005588715, 0.12871532955583423, 0.2915506711335364, -0.3730420507919968, -0.17992695473821452, 0.11072036430754877, 0.131713238171779, 0.1102054249883319, 0.022312160385673508, -0.26352001175759954, 0.0423284171306832, -0.1095808686892682, -0.17497500775593286, -0.06366835865819602, 0.04980044621736445, -0.056403917993636844, -0.1808605061460894, 0.08547309025501211, 0.060671643759801004, 0.05146380307166078, -0.08301537645260758, -0.12770501787754449, 0.018324917866782357, 0.1593173834693813, 0.049485222675923445, 0.020110589445482753, 0.15226530921744538, -0.15684455907110997, -0.11050020754073106, 0.4148842272421358, -0.07637111179147524, -0.13933722509718532, 0.15870698974698993, -0.18590034337727523, -0.155210265050913, 0.0784532680202619, 0.11478385507584886, 0.08458652069911043, -0.11036910427092733, 0.12079144293584379, 0.0006541418066869179, 0.18081848731046504, 0.08700113432442254, 0.061205464233611284, 0.25117609289256815, 0.13920810492874408, 0.0311499722037755, 0.09060217453668831, -0.009656064284152966, -0.08384649183581326, -0.3596873128826314, -0.15841003438682422, -0.1636901903791842, 0.07102330988405127, -0.13450014920131606, -0.10563633966107741, 0.3379998707496528, 0.15959602411991605, 0.19701999014719052, 0.0361256184137314, 0.24909782084695836, 0.1507378267078885, 0.050256734154127694, 0.07673705672244178, 0.25793248789318085, 0.12256217583128852, 0.07936758579395659, -0.23812601362282398, 0.04005961366623627, 0.06134243928728268] |
1,801.10465 | Constant Factor Time Optimal Multi-Robot Routing on High-Dimensional
Grids in Mostly Sub-Quadratic Time | Let $G = (V, E)$ be an $m_1 \times \ldots \times m_k$ grid. Assuming that
each $v \in V$ is occupied by a robot and a robot may move to a neighboring
vertex in a step via synchronized rotations along cycles of $G$, we first
establish that the arbitrary reconfiguration of labeled robots on $G$ can be
performed in $O(k\sum_i m_i)$ makespan and requires $O(|V|^2)$ running time in
the worst case and $o(|V|^2)$ when $G$ is non-degenerate (in the current
context, a grid is degenerate if it is nearly one dimensional). The resulting
algorithm, iSAG, provides average case $O(1)$-approximate (i.e.,
constant-factor) time optimality guarantee. When all dimensions are of similar
size $O(|V|^{\frac{1}{k}})$, the running time of iSAG approaches a linear
$O(|V|)$. Define $d_g(p)$ as the largest distance between individual initial
and goal configurations over all robots for a given problem instance $p$,
building on iSAG, we develop the PartitionAndFlow (PAF) algorithm that computes
$O(d_g(p))$ makespan solutions for arbitrary fixed $k \ge 2$, using mostly
$o(|V|^2)$ running time. PAF provides worst case $O(1)$-approximation regarding
solution time optimality. We note that the worst case running time for the
problem is $\Omega(|V|^2)$.
| cs.RO cs.DS | let g v e be an m_1 times ldots times m_k grid assuming that each v in v is occupied by a robot and a robot may move to a neighboring vertex in a step via synchronized rotations along cycles of g we first establish that the arbitrary reconfiguration of labeled robots on g can be performed in oksum_i m_i makespan and requires ov2 running time in the worst case and ov2 when g is nondegenerate in the current context a grid is degenerate if it is nearly one dimensional the resulting algorithm isag provides average case o1approximate ie constantfactor time optimality guarantee when all dimensions are of similar size ovfrac1k the running time of isag approaches a linear ov define d_gp as the largest distance between individual initial and goal configurations over all robots for a given problem instance p building on isag we develop the partitionandflow paf algorithm that computes od_gp makespan solutions for arbitrary fixed k ge 2 using mostly ov2 running time paf provides worst case o1approximation regarding solution time optimality we note that the worst case running time for the problem is omegav2 | [['let', 'g', 'v', 'e', 'be', 'an', 'm_1', 'times', 'ldots', 'times', 'm_k', 'grid', 'assuming', 'that', 'each', 'v', 'in', 'v', 'is', 'occupied', 'by', 'a', 'robot', 'and', 'a', 'robot', 'may', 'move', 'to', 'a', 'neighboring', 'vertex', 'in', 'a', 'step', 'via', 'synchronized', 'rotations', 'along', 'cycles', 'of', 'g', 'we', 'first', 'establish', 'that', 'the', 'arbitrary', 'reconfiguration', 'of', 'labeled', 'robots', 'on', 'g', 'can', 'be', 'performed', 'in', 'oksum_i', 'm_i', 'makespan', 'and', 'requires', 'ov2', 'running', 'time', 'in', 'the', 'worst', 'case', 'and', 'ov2', 'when', 'g', 'is', 'nondegenerate', 'in', 'the', 'current', 'context', 'a', 'grid', 'is', 'degenerate', 'if', 'it', 'is', 'nearly', 'one', 'dimensional', 'the', 'resulting', 'algorithm', 'isag', 'provides', 'average', 'case', 'o1approximate', 'ie', 'constantfactor', 'time', 'optimality', 'guarantee', 'when', 'all', 'dimensions', 'are', 'of', 'similar', 'size', 'ovfrac1k', 'the', 'running', 'time', 'of', 'isag', 'approaches', 'a', 'linear', 'ov', 'define', 'd_gp', 'as', 'the', 'largest', 'distance', 'between', 'individual', 'initial', 'and', 'goal', 'configurations', 'over', 'all', 'robots', 'for', 'a', 'given', 'problem', 'instance', 'p', 'building', 'on', 'isag', 'we', 'develop', 'the', 'partitionandflow', 'paf', 'algorithm', 'that', 'computes', 'od_gp', 'makespan', 'solutions', 'for', 'arbitrary', 'fixed', 'k', 'ge', '2', 'using', 'mostly', 'ov2', 'running', 'time', 'paf', 'provides', 'worst', 'case', 'o1approximation', 'regarding', 'solution', 'time', 'optimality', 'we', 'note', 'that', 'the', 'worst', 'case', 'running', 'time', 'for', 'the', 'problem', 'is', 'omegav2']] | [-0.21289582490782857, 0.09397392362622597, -0.024514437892351422, 0.002738776273262984, -0.04681762119954718, -0.193721216566001, 0.07433273493450462, 0.4172699122515681, -0.2363214823724395, -0.33393248400886305, 0.09325320469305062, -0.24223114362569872, -0.08340728521515912, 0.16699844800194233, -0.06071178477889459, 0.024572315269964107, 0.10240765020844865, 0.08232572779397142, -0.027293319867637295, -0.30564842552744914, 0.22234157387136513, -0.00442259342430139, 0.19081453187966843, -0.00508606792836972, 0.10608524830300607, 0.0310487590012509, 0.038309455189117034, 0.02595789189569417, -0.11793823858002164, 0.019182377826207533, 0.2749528703215829, 0.14432667061727453, 0.28659360513991705, -0.40717174983736903, -0.09811530605465132, 0.20671526766586845, 0.14821255777816666, 0.03524233111190599, 0.02539502516782914, -0.20687450102279678, 0.13397009803780488, -0.10328513972850127, -0.1133005444835462, 0.01980205414820575, 0.11015822373044032, -0.013416842666229459, -0.33465569365032755, 0.010578416811128321, 0.04973608737806329, 0.004028731885437782, -0.03485173741381124, -0.1422072783736819, -0.0002504710637667513, 0.1345644673082471, -0.0022764309388738904, 0.09507301084794473, 0.05636870041348879, -0.05621452779806722, -0.14176326848702137, 0.41278217791241933, -0.06127124174691834, -0.17880826764983115, 0.11455784571884138, -0.11202503256448595, -0.11641332045757816, 0.10873328764528896, 0.18258645348660238, 0.18460930803928852, -0.0909117444948956, 0.15297469533954308, -0.07373179449903866, 0.15053153329446994, 0.10706480851673245, -0.03469592904426403, 0.1129889396444004, 0.18336453694584115, 0.19289440057588395, 0.10756469179318379, -0.014375827867527502, -0.04895971734383768, -0.3156863188289188, -0.13085601261735683, -0.19275726157030768, 0.07210093503817916, -0.15198795690558145, -0.08178297818669088, 0.3654458374603764, 0.1000663367305386, 0.20152114282085837, 0.1465858371600836, 0.30652845145720004, 0.10847034070392621, 0.011728018190926658, 0.1869153813139157, 0.13823562104684803, 0.04921008124538175, 0.047038240311539394, -0.20671040778032984, 0.07155117077578964, 0.10969609293605682] |
1,801.10466 | Photo-excited Dynamics in the Excitonic Insulator Ta2NiSe5 | The excitonic insulator is an intriguing correlated electron phase formed of
condensed excitons. A promising candidate is the small band gap semiconductor
Ta2NiSe5. Here we investigate the quasiparticle and coherent phonon dynamics in
Ta2NiSe5 in a time resolved pump probe experiment. Using the models originally
developed by Kabanov et al. for superconductors, we show that the material's
intrinsic gap can be described as almost temperature independent for
temperatures up to about 250 K to 275 K. This behavior supports the existence
of the excitonic insulator state in Ta2NiSe5. The onset of an additional
temperature dependent component to the gap above these temperatures suggests
that the material is located in the BEC-BCS crossover regime. Furthermore, we
show that this state is very stable against strong photoexcitation, which
reveals that the free charge carriers are unable to effectively screen the
attractive Coulomb interaction between electrons and holes, likely due to the
quasi one-dimensional structure of Ta2NiSe5.
| cond-mat.str-el | the excitonic insulator is an intriguing correlated electron phase formed of condensed excitons a promising candidate is the small band gap semiconductor ta2nise5 here we investigate the quasiparticle and coherent phonon dynamics in ta2nise5 in a time resolved pump probe experiment using the models originally developed by kabanov et al for superconductors we show that the materials intrinsic gap can be described as almost temperature independent for temperatures up to about 250 k to 275 k this behavior supports the existence of the excitonic insulator state in ta2nise5 the onset of an additional temperature dependent component to the gap above these temperatures suggests that the material is located in the becbcs crossover regime furthermore we show that this state is very stable against strong photoexcitation which reveals that the free charge carriers are unable to effectively screen the attractive coulomb interaction between electrons and holes likely due to the quasi onedimensional structure of ta2nise5 | [['the', 'excitonic', 'insulator', 'is', 'an', 'intriguing', 'correlated', 'electron', 'phase', 'formed', 'of', 'condensed', 'excitons', 'a', 'promising', 'candidate', 'is', 'the', 'small', 'band', 'gap', 'semiconductor', 'ta2nise5', 'here', 'we', 'investigate', 'the', 'quasiparticle', 'and', 'coherent', 'phonon', 'dynamics', 'in', 'ta2nise5', 'in', 'a', 'time', 'resolved', 'pump', 'probe', 'experiment', 'using', 'the', 'models', 'originally', 'developed', 'by', 'kabanov', 'et', 'al', 'for', 'superconductors', 'we', 'show', 'that', 'the', 'materials', 'intrinsic', 'gap', 'can', 'be', 'described', 'as', 'almost', 'temperature', 'independent', 'for', 'temperatures', 'up', 'to', 'about', '250', 'k', 'to', '275', 'k', 'this', 'behavior', 'supports', 'the', 'existence', 'of', 'the', 'excitonic', 'insulator', 'state', 'in', 'ta2nise5', 'the', 'onset', 'of', 'an', 'additional', 'temperature', 'dependent', 'component', 'to', 'the', 'gap', 'above', 'these', 'temperatures', 'suggests', 'that', 'the', 'material', 'is', 'located', 'in', 'the', 'becbcs', 'crossover', 'regime', 'furthermore', 'we', 'show', 'that', 'this', 'state', 'is', 'very', 'stable', 'against', 'strong', 'photoexcitation', 'which', 'reveals', 'that', 'the', 'free', 'charge', 'carriers', 'are', 'unable', 'to', 'effectively', 'screen', 'the', 'attractive', 'coulomb', 'interaction', 'between', 'electrons', 'and', 'holes', 'likely', 'due', 'to', 'the', 'quasi', 'onedimensional', 'structure', 'of', 'ta2nise5']] | [-0.148201481227509, 0.23857247270738205, -0.08374665804545987, 0.07739258821798162, -0.022619376926646603, -0.16159575531718792, 0.09813121274603506, 0.3923890579419283, -0.26913497394991, -0.29544192939609676, -0.011439784705130891, -0.3088030880317092, -0.10568389266898687, 0.15635037419647765, 0.03920548064513253, -0.007836067740648212, -0.03542810083667796, -0.06642425539918462, -0.06494080800526812, -0.19307816021337912, 0.30569718882151237, 0.06600179034285247, 0.29748235648655175, 0.12794858712533658, 0.03486857635223053, -0.022290628949972476, 0.11300645856331888, 0.005322420519063032, -0.14886876642072797, 0.03849876728271703, 0.29635330300480783, -0.09985000403964017, 0.21785128482333202, -0.4024456367652573, -0.23671297559683974, 0.028258975583140725, 0.14842996614937543, 0.14289450291438366, -0.08779019093316338, -0.2895468088931271, 0.056687186012504165, -0.14362414212679708, -0.14814260371283375, -0.07452851913675859, 0.03128061810351134, -0.027361902074174736, -0.22343286294255757, 0.12095791249318266, 0.060875625230142144, 0.008887044027864981, -0.10117696198277998, -0.0858727479837351, -0.04843919615218924, 0.05375591547087791, 0.02288221354995455, 0.04134615225862567, 0.13954703967002305, -0.10983038775005995, -0.06932466982730798, 0.34673205194631956, -0.09671244938259146, -0.021730079128128754, 0.22552587980307737, -0.149409530911135, -0.0309213059984583, 0.1916619786605626, 0.07864652813545295, 0.10353908258378385, -0.13352772408329833, 0.06655816200674797, -0.04434651879944488, 0.22029912359721493, 0.02501523257278559, 0.09815442228883312, 0.2836709251905513, 0.18923308248268803, 0.03202986916188489, 0.14719123524453417, -0.11449258314224879, -0.08450456516546584, -0.23470572902603293, -0.15981013174833997, -0.2380134551695173, 0.06235378301988186, -0.004866477516109378, -0.16953548978312644, 0.39260188228165915, 0.17355844154409678, 0.18842150971396257, -0.06492570863791754, 0.22302771763178816, 0.12437662257821988, 0.04231453367641994, 0.07350668381440738, 0.2788097300255284, 0.15871946625381272, 0.09787051914737548, -0.28594979771122625, 0.030921018089760433, -0.007076174737401791] |
1,801.10467 | Deep Reinforcement Learning for Programming Language Correction | Novice programmers often struggle with the formal syntax of programming
languages. To assist them, we design a novel programming language correction
framework amenable to reinforcement learning. The framework allows an agent to
mimic human actions for text navigation and editing. We demonstrate that the
agent can be trained through self-exploration directly from the raw input, that
is, program text itself, without any knowledge of the formal syntax of the
programming language. We leverage expert demonstrations for one tenth of the
training data to accelerate training. The proposed technique is evaluated on
6975 erroneous C programs with typographic errors, written by students during
an introductory programming course. Our technique fixes 14% more programs and
29% more compiler error messages relative to those fixed by a state-of-the-art
tool, DeepFix, which uses a fully supervised neural machine translation
approach.
| cs.AI cs.PL cs.SE | novice programmers often struggle with the formal syntax of programming languages to assist them we design a novel programming language correction framework amenable to reinforcement learning the framework allows an agent to mimic human actions for text navigation and editing we demonstrate that the agent can be trained through selfexploration directly from the raw input that is program text itself without any knowledge of the formal syntax of the programming language we leverage expert demonstrations for one tenth of the training data to accelerate training the proposed technique is evaluated on 6975 erroneous c programs with typographic errors written by students during an introductory programming course our technique fixes 14 more programs and 29 more compiler error messages relative to those fixed by a stateoftheart tool deepfix which uses a fully supervised neural machine translation approach | [['novice', 'programmers', 'often', 'struggle', 'with', 'the', 'formal', 'syntax', 'of', 'programming', 'languages', 'to', 'assist', 'them', 'we', 'design', 'a', 'novel', 'programming', 'language', 'correction', 'framework', 'amenable', 'to', 'reinforcement', 'learning', 'the', 'framework', 'allows', 'an', 'agent', 'to', 'mimic', 'human', 'actions', 'for', 'text', 'navigation', 'and', 'editing', 'we', 'demonstrate', 'that', 'the', 'agent', 'can', 'be', 'trained', 'through', 'selfexploration', 'directly', 'from', 'the', 'raw', 'input', 'that', 'is', 'program', 'text', 'itself', 'without', 'any', 'knowledge', 'of', 'the', 'formal', 'syntax', 'of', 'the', 'programming', 'language', 'we', 'leverage', 'expert', 'demonstrations', 'for', 'one', 'tenth', 'of', 'the', 'training', 'data', 'to', 'accelerate', 'training', 'the', 'proposed', 'technique', 'is', 'evaluated', 'on', '6975', 'erroneous', 'c', 'programs', 'with', 'typographic', 'errors', 'written', 'by', 'students', 'during', 'an', 'introductory', 'programming', 'course', 'our', 'technique', 'fixes', '14', 'more', 'programs', 'and', '29', 'more', 'compiler', 'error', 'messages', 'relative', 'to', 'those', 'fixed', 'by', 'a', 'stateoftheart', 'tool', 'deepfix', 'which', 'uses', 'a', 'fully', 'supervised', 'neural', 'machine', 'translation', 'approach']] | [-0.02221107220587631, -0.021990668825175683, -0.1028419596449196, 0.09974957140748976, -0.2449994812840251, -0.22883759736669837, 0.07881034935859066, 0.42162303601702056, -0.3133933800893525, -0.38927212451343185, 0.045712406164104186, -0.26129313398818743, -0.14758522042797673, 0.2126191618093462, -0.17012118554363648, 0.09508103398882128, 0.13572544799255276, 0.050280065493037304, -0.04495093289728242, -0.296024015892504, 0.27065018199349716, 0.021785565631257164, 0.25582815772957274, -0.03417128213612294, 0.1166641048371309, 0.013681347631952829, -0.012083698077886193, -0.05537065955318717, -0.03768652408886097, 0.17945416347572096, 0.4297619782698651, 0.30546354892905114, 0.3839782483496324, -0.4281873319642963, -0.11182471153981707, -0.008800535269633487, 0.0826071496932181, 0.14828336461947333, 0.0020863399976709237, -0.3683116333697129, 0.08057247498762553, -0.2112314399711236, 0.03633001567882106, -0.14663303822141002, -0.032258333745240064, -0.07000625798289009, -0.2701603244351982, -0.0852831099078887, 0.12244245773725669, 0.15141696430811727, -0.007188485270038385, -0.10441797084209543, 0.029873811405290055, 0.1667696371778018, 0.02351641562870807, 0.11389801407500205, 0.1862681897977988, -0.11609057752346551, -0.19971130191934883, 0.37411932356103705, -0.05054243186281787, -0.21620666537934016, 0.19338303985746785, 0.005454130657017231, -0.15779513719112234, 0.1258197739513384, 0.2520553998373173, 0.11183161341274778, -0.20785498975396707, 0.053168999596016, 0.031015064462984878, 0.27905477351095115, 0.037087454182458006, -0.09562261072159917, 0.17903211099975225, 0.21857335068009517, -0.012321929495643686, 0.11576621587888372, 0.006236888055853477, -0.050071924697193834, -0.2509010920577027, -0.1549985880204649, -0.15819447030209832, -0.04759269034214042, -0.09409194959314643, -0.137966522305376, 0.34142144042308686, 0.2349912791236959, 0.07822976296905566, 0.18063274621359865, 0.3492300145328045, 0.04086757352385946, 0.1495854523903863, 0.12358676701163253, 0.10156247006315323, -0.006772871988101138, 0.17984399515445584, -0.1746175811022382, 0.12799325770939943, 0.04760746841525866] |
1,801.10468 | Scrutinizing $\bar B \to D^*(D \pi) \ell^- \bar \nu_\ell$ and $\bar B
\to D^*(D \gamma) \ell^- \bar \nu_\ell$ in search of new physics footprints | Besides being important to determine Standard Model parameters such as the
CKM matrix elements $|V_{cb}|$ and $|V_{ub}|$, semileptonic $B$ decays seem
also promising to reveal new physics (NP) phenomena, in particular in
connection with the possibility of uncovering lepton flavour universality (LFU)
violating effects. In this view, it could be natural to connect the tensions in
the inclusive versus exclusive determinations of $|V_{cb}|$ to the anomalies in
the ratios $R(D^{(*)})$ of decay rates into $\tau$ vs $\mu, e$. However, the
question has been raised about the role of the parametrization of the hadronic
$B \to D^{(*)}$ form factors in exclusive $B$ decay modes. We focus on the
fully differential angular distributions of $\bar B \to D^* \ell^-{\bar
\nu}_\ell$ with $D^* \to D \pi$ or $D^* \to D \gamma$, the latter mode being
important in the case of $B_s \to D_s^*$ decays. We show that the angular
coefficients in the distributions can be used to scrutinize the role of the
form factor parametrization and to pin down deviations from SM. As an example
of a NP scenario, we include a tensor operator in the $b \to c$ semileptonic
effective Hamiltonian, and discuss how the angular coefficients allow to
construct observables sensitive to this structure, also defining ratios useful
to test LFU.
| hep-ph hep-ex hep-lat | besides being important to determine standard model parameters such as the ckm matrix elements v_cb and v_ub semileptonic b decays seem also promising to reveal new physics np phenomena in particular in connection with the possibility of uncovering lepton flavour universality lfu violating effects in this view it could be natural to connect the tensions in the inclusive versus exclusive determinations of v_cb to the anomalies in the ratios rd of decay rates into tau vs mu e however the question has been raised about the role of the parametrization of the hadronic b to d form factors in exclusive b decay modes we focus on the fully differential angular distributions of bar b to d ellbar nu_ell with d to d pi or d to d gamma the latter mode being important in the case of b_s to d_s decays we show that the angular coefficients in the distributions can be used to scrutinize the role of the form factor parametrization and to pin down deviations from sm as an example of a np scenario we include a tensor operator in the b to c semileptonic effective hamiltonian and discuss how the angular coefficients allow to construct observables sensitive to this structure also defining ratios useful to test lfu | [['besides', 'being', 'important', 'to', 'determine', 'standard', 'model', 'parameters', 'such', 'as', 'the', 'ckm', 'matrix', 'elements', 'v_cb', 'and', 'v_ub', 'semileptonic', 'b', 'decays', 'seem', 'also', 'promising', 'to', 'reveal', 'new', 'physics', 'np', 'phenomena', 'in', 'particular', 'in', 'connection', 'with', 'the', 'possibility', 'of', 'uncovering', 'lepton', 'flavour', 'universality', 'lfu', 'violating', 'effects', 'in', 'this', 'view', 'it', 'could', 'be', 'natural', 'to', 'connect', 'the', 'tensions', 'in', 'the', 'inclusive', 'versus', 'exclusive', 'determinations', 'of', 'v_cb', 'to', 'the', 'anomalies', 'in', 'the', 'ratios', 'rd', 'of', 'decay', 'rates', 'into', 'tau', 'vs', 'mu', 'e', 'however', 'the', 'question', 'has', 'been', 'raised', 'about', 'the', 'role', 'of', 'the', 'parametrization', 'of', 'the', 'hadronic', 'b', 'to', 'd', 'form', 'factors', 'in', 'exclusive', 'b', 'decay', 'modes', 'we', 'focus', 'on', 'the', 'fully', 'differential', 'angular', 'distributions', 'of', 'bar', 'b', 'to', 'd', 'ellbar', 'nu_ell', 'with', 'd', 'to', 'd', 'pi', 'or', 'd', 'to', 'd', 'gamma', 'the', 'latter', 'mode', 'being', 'important', 'in', 'the', 'case', 'of', 'b_s', 'to', 'd_s', 'decays', 'we', 'show', 'that', 'the', 'angular', 'coefficients', 'in', 'the', 'distributions', 'can', 'be', 'used', 'to', 'scrutinize', 'the', 'role', 'of', 'the', 'form', 'factor', 'parametrization', 'and', 'to', 'pin', 'down', 'deviations', 'from', 'sm', 'as', 'an', 'example', 'of', 'a', 'np', 'scenario', 'we', 'include', 'a', 'tensor', 'operator', 'in', 'the', 'b', 'to', 'c', 'semileptonic', 'effective', 'hamiltonian', 'and', 'discuss', 'how', 'the', 'angular', 'coefficients', 'allow', 'to', 'construct', 'observables', 'sensitive', 'to', 'this', 'structure', 'also', 'defining', 'ratios', 'useful', 'to', 'test', 'lfu']] | [-0.07498341874618615, 0.17754336632628803, -0.06060022237721742, 0.08790685316253942, -0.07309678347914346, -0.17999046556429849, 0.07877707061402145, 0.28073522900452924, -0.28304001546154417, -0.2463868433166118, -0.008710127606034457, -0.30850201010526646, -0.05223884225623416, 0.11954854119879504, 0.034930031720016685, 0.09381440719589591, 0.036998566434652144, 0.008841398240820992, -0.08270796691178389, -0.18201731016282185, 0.2654517025997241, 0.03365820668903845, 0.1951107451913967, 0.10118144306886409, -0.04264483313759445, -0.021688014809929188, -0.08475170271703973, -0.042683774583219064, -0.1755565237089329, 0.0698979314643934, 0.22324131776334807, 0.13963900711401256, 0.11774717150810396, -0.3512074034528008, -0.09891994277547513, 0.16503290176568997, 0.1728429809866828, 0.05241447383582237, 0.011561129006579341, -0.27369986617316805, 0.11115212246908673, -0.15604689828940624, -0.12366471612559897, -0.11000195895654283, 0.11023009339170087, -0.08922375565494543, -0.36763613606675616, 0.0715113087359073, 0.009591295680729672, 0.009403042765777735, 0.03071192752658611, -0.23306534900108264, 0.03164731926572997, 0.09746227925088966, 0.14549730565964378, 0.08338677178225702, 0.13715991429940222, -0.13155184153999602, -0.14287856747174546, 0.4336983932403936, -0.07522127383743368, -0.23362313646690122, 0.15706693842740996, -0.23559882511783922, -0.17547246757610646, 0.07242526459241552, 0.23757081023262192, 0.05455297082662582, -0.1567666414085709, 0.1386488181619262, -0.027664708666409188, 0.12310251316964804, 0.05804981482880456, 0.0777458345761434, 0.18590974053326395, 0.13636221446296468, -0.012594482249447278, 0.04767508766103891, -0.06795564347745052, -0.03323439904488623, -0.36358741768414066, -0.1626722878599096, -0.06341622105752495, 0.12003572574550551, -0.06511346839258858, -0.09318122466405233, 0.37680651463733306, 0.09175212612996499, 0.29660159327738383, -0.03340457616972604, 0.24748514339859998, 0.05952155633629965, 0.08926972638943144, 0.04262923134180407, 0.2778188111814892, 0.20565521857934072, 0.10132982579636432, -0.2836435366965209, 0.0819731608077529, 0.049899537699474465] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.