id float64 706 1.8k | title stringlengths 1 343 | abstract stringlengths 6 6.09k | categories stringlengths 5 125 | processed_abstract stringlengths 2 5.96k | tokenized_abstract stringlengths 8 8.74k | centroid stringlengths 2.1k 2.17k |
|---|---|---|---|---|---|---|
1,802.0016 | Bipartite discrimination of independently prepared quantum states as a
counterexample to a parallel repetition conjecture | For distinguishing quantum states sampled from a fixed ensemble, the gap in
bipartite and single-party distinguishability can be interpreted as a
nonlocality of the ensemble. In this paper, we consider bipartite state
discrimination in a composite system consisting of $N$ subsystems, where each
subsystem is shared between two parties and the state of each subsystem is
randomly sampled from a particular ensemble comprising the Bell states. We show
that the success probability of perfectly identifying the state converges to
$1$ as $N\rightarrow\infty$ if the entropy of the probability distribution
associated with the ensemble is less than $1$, even if the success probability
is less than $1$ for any finite $N$. In other words, the nonlocality of the
$N$-fold ensemble asymptotically disappears if the probability distribution
associated with each ensemble is concentrated. Furthermore, we show that the
disappearance of the nonlocality can be regarded as a remarkable counterexample
of a fundamental open question in theoretical computer science, called a
parallel repetition conjecture of interactive games with two classically
communicating players. Measurements for the discrimination task include a
projective measurement of one party represented by stabilizer states, which
enable the other party to perfectly distinguish states that are sampled with
high probability.
| quant-ph cs.CC | for distinguishing quantum states sampled from a fixed ensemble the gap in bipartite and singleparty distinguishability can be interpreted as a nonlocality of the ensemble in this paper we consider bipartite state discrimination in a composite system consisting of n subsystems where each subsystem is shared between two parties and the state of each subsystem is randomly sampled from a particular ensemble comprising the bell states we show that the success probability of perfectly identifying the state converges to 1 as nrightarrowinfty if the entropy of the probability distribution associated with the ensemble is less than 1 even if the success probability is less than 1 for any finite n in other words the nonlocality of the nfold ensemble asymptotically disappears if the probability distribution associated with each ensemble is concentrated furthermore we show that the disappearance of the nonlocality can be regarded as a remarkable counterexample of a fundamental open question in theoretical computer science called a parallel repetition conjecture of interactive games with two classically communicating players measurements for the discrimination task include a projective measurement of one party represented by stabilizer states which enable the other party to perfectly distinguish states that are sampled with high probability | [['for', 'distinguishing', 'quantum', 'states', 'sampled', 'from', 'a', 'fixed', 'ensemble', 'the', 'gap', 'in', 'bipartite', 'and', 'singleparty', 'distinguishability', 'can', 'be', 'interpreted', 'as', 'a', 'nonlocality', 'of', 'the', 'ensemble', 'in', 'this', 'paper', 'we', 'consider', 'bipartite', 'state', 'discrimination', 'in', 'a', 'composite', 'system', 'consisting', 'of', 'n', 'subsystems', 'where', 'each', 'subsystem', 'is', 'shared', 'between', 'two', 'parties', 'and', 'the', 'state', 'of', 'each', 'subsystem', 'is', 'randomly', 'sampled', 'from', 'a', 'particular', 'ensemble', 'comprising', 'the', 'bell', 'states', 'we', 'show', 'that', 'the', 'success', 'probability', 'of', 'perfectly', 'identifying', 'the', 'state', 'converges', 'to', '1', 'as', 'nrightarrowinfty', 'if', 'the', 'entropy', 'of', 'the', 'probability', 'distribution', 'associated', 'with', 'the', 'ensemble', 'is', 'less', 'than', '1', 'even', 'if', 'the', 'success', 'probability', 'is', 'less', 'than', '1', 'for', 'any', 'finite', 'n', 'in', 'other', 'words', 'the', 'nonlocality', 'of', 'the', 'nfold', 'ensemble', 'asymptotically', 'disappears', 'if', 'the', 'probability', 'distribution', 'associated', 'with', 'each', 'ensemble', 'is', 'concentrated', 'furthermore', 'we', 'show', 'that', 'the', 'disappearance', 'of', 'the', 'nonlocality', 'can', 'be', 'regarded', 'as', 'a', 'remarkable', 'counterexample', 'of', 'a', 'fundamental', 'open', 'question', 'in', 'theoretical', 'computer', 'science', 'called', 'a', 'parallel', 'repetition', 'conjecture', 'of', 'interactive', 'games', 'with', 'two', 'classically', 'communicating', 'players', 'measurements', 'for', 'the', 'discrimination', 'task', 'include', 'a', 'projective', 'measurement', 'of', 'one', 'party', 'represented', 'by', 'stabilizer', 'states', 'which', 'enable', 'the', 'other', 'party', 'to', 'perfectly', 'distinguish', 'states', 'that', 'are', 'sampled', 'with', 'high', 'probability']] | [-0.13103543185628952, 0.19613466459850315, -0.08221894412767142, 0.055052311391336844, 0.03508540226262994, -0.23974040779750794, 0.050723830046481455, 0.3379503032146022, -0.2636186466003346, -0.2880814651190303, 0.06806914424698335, -0.31597584000672213, -0.08803422376979142, 0.13608802459464642, -0.07334338210523128, 0.05758913336321712, 0.0993518035823945, 0.11462199748377316, -0.028040130329318343, -0.24898867067997343, 0.3404289347585291, 0.007933992551988922, 0.2732253397721797, -0.024260925645940006, 0.0951832175871823, 0.03979532767203636, 0.04231526717019733, 0.03338007892249152, -0.0394217666651457, 0.10826525615411811, 0.29136580624151975, 0.18423906764481215, 0.30176245284266767, -0.3592277344688773, -0.18296997805475257, 0.17029987212736158, 0.12538277804618703, 0.10888092951092404, -0.007043846361339093, -0.2918883026461117, 0.05189044561237097, -0.18417584291659295, -0.1032440842781216, -0.027292399629950524, 0.008006450987886637, -0.008843157112132759, -0.27554293545079417, 0.07340263277757914, 0.060688766603125256, 0.02929016888490878, 0.006470302542438731, -0.08870591855316888, -0.008105194165837019, 0.15937455421779304, -0.03965086384618189, 0.03247904900461435, 0.11375691928667947, -0.12772086095996202, -0.17109441287815572, 0.3490423072432168, -0.044411844338319496, -0.2145422748941928, 0.1620830954692792, -0.14835208334261551, -0.13602751220809295, 0.07231526174815371, 0.09997993220109493, 0.09981951522640883, -0.09029835042194463, 0.030579195448954124, -0.09217070050537586, 0.22048178558878134, 0.08376637776382267, 0.08037417133338749, 0.19343896634294652, 0.12066722784540616, 0.11143974860780873, 0.18352566664980258, -0.061523435714188966, -0.15251372613944114, -0.3131823122547939, -0.1976664171135053, -0.2805272915866226, 0.10073784155305475, -0.06648251427322975, -0.14166706726886333, 0.3810142585565336, 0.10763753873761743, 0.20736014269758016, 0.07169059848005417, 0.24877650039154106, 0.07721852556336671, 0.003971524438820779, 0.1130991303033079, 0.1982207481842488, 0.12009239965700544, -0.00750757705885917, -0.18256121674108727, 0.10369304165244103, 0.014107154722441919] |
1,802.00161 | HST spectrum and timing of the ultra-compact X-ray binary candidate 47
Tuc X9 | To confirm the nature of the donor star in the ultra-compact X-ray binary
candidate 47 Tuc X9, we obtained optical spectra (3,000$-$10,000 {\AA}) with
the Hubble Space Telescope / Space Telescope Imaging Spectrograph. We find no
strong emission or absorption features in the spectrum of X9. In particular, we
place $3\sigma$ upper limits on the H$\alpha$ and HeII $\lambda 4686$ emission
line equivalent widths $-$EW$_{\mathrm{H\alpha}} \lesssim 14$ {\AA} and
$-$EW$_{\mathrm{HeII}} \lesssim 9$ {\AA}, respectively. This is much lower than
seen for typical X-ray binaries at a similar X-ray luminosity (which, for
$L_{\mathrm{2-10 keV}} \approx 10^{33}-10^{34}$ erg s$^{-1}$ is typically
$-$EW$_{\mathrm{H\alpha}} \sim 50$ {\AA}). This supports our previous
suggestion (by Bahramian et al.) of an H-poor donor in X9. We perform timing
analysis on archival far-ultraviolet, $V$ and $I$-band data to search for
periodicities. In the optical bands we recover the seven-day superorbital
period initially discovered in X-rays, but we do not recover the orbital
period. In the far-ultraviolet we find evidence for a 27.2 min period (shorter
than the 28.2 min period seen in X-rays). We find that either a neutron star or
black hole could explain the observed properties of X9. We also perform binary
evolution calculations, showing that the formation of an initial black hole /
He-star binary early in the life of a globular cluster could evolve into a
present-day system such as X9 (should the compact object in this system indeed
be a black hole) via mass-transfer driven by gravitational wave radiation.
| astro-ph.HE astro-ph.SR | to confirm the nature of the donor star in the ultracompact xray binary candidate 47 tuc x9 we obtained optical spectra 300010000 aa with the hubble space telescope space telescope imaging spectrograph we find no strong emission or absorption features in the spectrum of x9 in particular we place 3sigma upper limits on the halpha and heii lambda 4686 emission line equivalent widths ew_mathrmhalpha lesssim 14 aa and ew_mathrmheii lesssim 9 aa respectively this is much lower than seen for typical xray binaries at a similar xray luminosity which for l_mathrm210 kev approx 10331034 erg s1 is typically ew_mathrmhalpha sim 50 aa this supports our previous suggestion by bahramian et al of an hpoor donor in x9 we perform timing analysis on archival farultraviolet v and iband data to search for periodicities in the optical bands we recover the sevenday superorbital period initially discovered in xrays but we do not recover the orbital period in the farultraviolet we find evidence for a 272 min period shorter than the 282 min period seen in xrays we find that either a neutron star or black hole could explain the observed properties of x9 we also perform binary evolution calculations showing that the formation of an initial black hole hestar binary early in the life of a globular cluster could evolve into a presentday system such as x9 should the compact object in this system indeed be a black hole via masstransfer driven by gravitational wave radiation | [['to', 'confirm', 'the', 'nature', 'of', 'the', 'donor', 'star', 'in', 'the', 'ultracompact', 'xray', 'binary', 'candidate', '47', 'tuc', 'x9', 'we', 'obtained', 'optical', 'spectra', '300010000', 'aa', 'with', 'the', 'hubble', 'space', 'telescope', 'space', 'telescope', 'imaging', 'spectrograph', 'we', 'find', 'no', 'strong', 'emission', 'or', 'absorption', 'features', 'in', 'the', 'spectrum', 'of', 'x9', 'in', 'particular', 'we', 'place', '3sigma', 'upper', 'limits', 'on', 'the', 'halpha', 'and', 'heii', 'lambda', '4686', 'emission', 'line', 'equivalent', 'widths', 'ew_mathrmhalpha', 'lesssim', '14', 'aa', 'and', 'ew_mathrmheii', 'lesssim', '9', 'aa', 'respectively', 'this', 'is', 'much', 'lower', 'than', 'seen', 'for', 'typical', 'xray', 'binaries', 'at', 'a', 'similar', 'xray', 'luminosity', 'which', 'for', 'l_mathrm210', 'kev', 'approx', '10331034', 'erg', 's1', 'is', 'typically', 'ew_mathrmhalpha', 'sim', '50', 'aa', 'this', 'supports', 'our', 'previous', 'suggestion', 'by', 'bahramian', 'et', 'al', 'of', 'an', 'hpoor', 'donor', 'in', 'x9', 'we', 'perform', 'timing', 'analysis', 'on', 'archival', 'farultraviolet', 'v', 'and', 'iband', 'data', 'to', 'search', 'for', 'periodicities', 'in', 'the', 'optical', 'bands', 'we', 'recover', 'the', 'sevenday', 'superorbital', 'period', 'initially', 'discovered', 'in', 'xrays', 'but', 'we', 'do', 'not', 'recover', 'the', 'orbital', 'period', 'in', 'the', 'farultraviolet', 'we', 'find', 'evidence', 'for', 'a', '272', 'min', 'period', 'shorter', 'than', 'the', '282', 'min', 'period', 'seen', 'in', 'xrays', 'we', 'find', 'that', 'either', 'a', 'neutron', 'star', 'or', 'black', 'hole', 'could', 'explain', 'the', 'observed', 'properties', 'of', 'x9', 'we', 'also', 'perform', 'binary', 'evolution', 'calculations', 'showing', 'that', 'the', 'formation', 'of', 'an', 'initial', 'black', 'hole', 'hestar', 'binary', 'early', 'in', 'the', 'life', 'of', 'a', 'globular', 'cluster', 'could', 'evolve', 'into', 'a', 'presentday', 'system', 'such', 'as', 'x9', 'should', 'the', 'compact', 'object', 'in', 'this', 'system', 'indeed', 'be', 'a', 'black', 'hole', 'via', 'masstransfer', 'driven', 'by', 'gravitational', 'wave', 'radiation']] | [-0.09095305642483281, 0.10961564949377066, -0.049236108502178265, 0.13487486651354316, -0.08896712890035126, -0.10742752442222135, 0.07469141729386469, 0.4677524372241674, -0.1499634050261463, -0.34914745076532205, 0.07216895841038688, -0.31578209717216355, -0.032067433409743544, 0.23605758284177694, -0.02201641647916708, -0.051383703588596966, 0.10736844274137465, -0.04469893346262987, -0.07991376843388197, -0.24290620237754496, 0.2358235543930833, 0.07198149040360861, 0.12289151457181224, -0.037208632432845196, 0.01029587289363255, -0.016394040501524525, -0.022039833426510596, -0.04371836445723937, -0.17043027088415535, 0.011770073203886294, 0.22966211536026337, 0.14233307876754708, 0.18490271349963597, -0.3329183893652329, -0.21028082637763174, 0.060792804592402036, 0.20424750648004444, 0.020072086643579585, -0.025212309530753034, -0.2654353950877, 0.06902737222674252, -0.20400310398925048, -0.1399999461411966, 0.09368609107502787, 0.12047603207535137, -0.012280747150246319, -0.21183084253471143, 0.12518317727691097, 0.02562779615337037, 0.06326670006704083, -0.20372536424235693, -0.07606978165901511, -0.05736150413899679, -0.011934924163469834, -0.013285975247157824, 0.09966864262680254, 0.1252722713597524, -0.08082021217087915, -0.06132256382517127, 0.35474535357694154, -0.11340582001017636, 0.06579399464464898, 0.21070297491428866, -0.2306150958598611, -0.19200410343566324, 0.18679196772235737, 0.12704767202071954, 0.13543156259225594, -0.13894885042331584, 0.012326738004383697, -0.0171251957972459, 0.30497563634823743, 0.08654092023125752, 0.11388403361918459, 0.3400768713390447, 0.10913417159402393, -0.017818013369787687, 0.10314793324060972, -0.2616526938996289, 0.015217803974653435, -0.20555437401630702, -0.10231264382522849, -0.10801518778182725, 0.13759409593297442, -0.102408429152134, -0.12481840647889543, 0.30095338307527597, 0.10015384343094251, 0.23056083883423842, 0.002322646956325793, 0.24166046604747926, 0.11982257602196654, 0.06964828015420665, 0.11746247335644945, 0.36065309309248644, 0.13122812777301726, 0.1461982867216777, -0.23716230834658925, 0.02303077949203208, 0.004383717551554658] |
1,802.00162 | Throughput Analysis of IEEE 802.11 Multi-hop Wireless Networks with
Routing Consideration: A General Framework | The end-to-end throughput of multi-hop communication in wireless ad hoc
networks is affected by the conflict between forwarding nodes. It has been
shown that sending more packets than maximum achievable end-to-end throughput
not only fails to increase throughput, but also decreases throughput owing to
high contention and collision. Accordingly, it is of crucial importance for a
source node to know the maximum end-to-end throughput. The end-to-end
throughput depends on multiple factors, such as physical layer limitations, MAC
protocol properties, routing policy and nodes distribution. There have been
many studies on analytical modeling of end-to-end throughput but none of them
has taken routing policy and nodes distribution as well as MAC layer altogether
into account. In this paper, the end-to-end throughput with perfect MAC layer
is obtained based on routing policy and nodes distribution in one and two
dimensional networks. Then, imperfections of IEEE 802:11 protocol is added to
the model to obtain precise value. An exhaustive simulation is also made to
validate the proposed models using NS2 simulator. Results show that if the
distribution to the next hop for a particular routing policy is known, our
methodology can obtain the maximum end-to-end throughput precisely.
| cs.NI | the endtoend throughput of multihop communication in wireless ad hoc networks is affected by the conflict between forwarding nodes it has been shown that sending more packets than maximum achievable endtoend throughput not only fails to increase throughput but also decreases throughput owing to high contention and collision accordingly it is of crucial importance for a source node to know the maximum endtoend throughput the endtoend throughput depends on multiple factors such as physical layer limitations mac protocol properties routing policy and nodes distribution there have been many studies on analytical modeling of endtoend throughput but none of them has taken routing policy and nodes distribution as well as mac layer altogether into account in this paper the endtoend throughput with perfect mac layer is obtained based on routing policy and nodes distribution in one and two dimensional networks then imperfections of ieee 80211 protocol is added to the model to obtain precise value an exhaustive simulation is also made to validate the proposed models using ns2 simulator results show that if the distribution to the next hop for a particular routing policy is known our methodology can obtain the maximum endtoend throughput precisely | [['the', 'endtoend', 'throughput', 'of', 'multihop', 'communication', 'in', 'wireless', 'ad', 'hoc', 'networks', 'is', 'affected', 'by', 'the', 'conflict', 'between', 'forwarding', 'nodes', 'it', 'has', 'been', 'shown', 'that', 'sending', 'more', 'packets', 'than', 'maximum', 'achievable', 'endtoend', 'throughput', 'not', 'only', 'fails', 'to', 'increase', 'throughput', 'but', 'also', 'decreases', 'throughput', 'owing', 'to', 'high', 'contention', 'and', 'collision', 'accordingly', 'it', 'is', 'of', 'crucial', 'importance', 'for', 'a', 'source', 'node', 'to', 'know', 'the', 'maximum', 'endtoend', 'throughput', 'the', 'endtoend', 'throughput', 'depends', 'on', 'multiple', 'factors', 'such', 'as', 'physical', 'layer', 'limitations', 'mac', 'protocol', 'properties', 'routing', 'policy', 'and', 'nodes', 'distribution', 'there', 'have', 'been', 'many', 'studies', 'on', 'analytical', 'modeling', 'of', 'endtoend', 'throughput', 'but', 'none', 'of', 'them', 'has', 'taken', 'routing', 'policy', 'and', 'nodes', 'distribution', 'as', 'well', 'as', 'mac', 'layer', 'altogether', 'into', 'account', 'in', 'this', 'paper', 'the', 'endtoend', 'throughput', 'with', 'perfect', 'mac', 'layer', 'is', 'obtained', 'based', 'on', 'routing', 'policy', 'and', 'nodes', 'distribution', 'in', 'one', 'and', 'two', 'dimensional', 'networks', 'then', 'imperfections', 'of', 'ieee', '80211', 'protocol', 'is', 'added', 'to', 'the', 'model', 'to', 'obtain', 'precise', 'value', 'an', 'exhaustive', 'simulation', 'is', 'also', 'made', 'to', 'validate', 'the', 'proposed', 'models', 'using', 'ns2', 'simulator', 'results', 'show', 'that', 'if', 'the', 'distribution', 'to', 'the', 'next', 'hop', 'for', 'a', 'particular', 'routing', 'policy', 'is', 'known', 'our', 'methodology', 'can', 'obtain', 'the', 'maximum', 'endtoend', 'throughput', 'precisely']] | [-0.23143272688876376, -0.013993332202629709, -0.0388403619332335, 0.018948983860120523, -0.07763173218730107, -0.24199758432613513, 0.14372489972462513, 0.48429100050293294, -0.25695055025898533, -0.30745471971224725, 0.05592398681334633, -0.2524616296220686, -0.16714697172409212, 0.1510571297822213, -0.13521363552102877, 0.11562523093511418, 0.11142358918117416, 0.07628981674992547, 0.00860203498705607, -0.30950724888477743, 0.25908164444773163, 0.15849934797734022, 0.3745255556111176, 0.09901327869768456, 0.0860049249556338, 0.00678350630014674, 0.01934796126472965, -0.005369276782862612, -0.11330408308951763, 0.0660929719475818, 0.29334538073117916, 0.18433312589264253, 0.2647525612168859, -0.4367014220003615, -0.31007112075392274, 0.0779814750943861, 0.20138311557430946, 0.04102029251870843, 0.00633363865672061, -0.26324731819619684, 0.15144326414711312, -0.2529974218431534, -0.02996421638712978, -0.006823214553488591, -0.034798180662844444, 0.05916391821702961, -0.30070674926859864, -0.024266847282391254, -0.030223836238404793, 0.007627908284852423, -0.038103675222523586, -0.07823608623164677, -0.026320873524455987, 0.1925313159074519, 0.037332946974088045, 0.024535793769077312, 0.11793851746203013, -0.10091837760249, -0.12392311021637593, 0.3711705700561558, 0.02850176337660835, -0.19967783587629495, 0.11918959493590423, 0.00848376566361751, -0.11684240286296099, 0.13211904941234717, 0.21193091732272207, 0.04938546226290295, -0.19163172737006387, -0.02324993490000236, -0.019387359781305968, 0.2025540152795075, 0.10087394497846973, 0.10348446198172637, 0.09613898667247639, 0.2490891455996724, 0.14649944040131005, 0.1117765084245079, -0.09983179858449448, -0.14789964273552766, -0.2119333415880881, -0.13520381630868794, -0.2245912685037408, 0.029718385453737395, -0.12792409842882782, -0.07540060707038514, 0.3433425504061365, 0.20015084101745292, 0.1573310399685444, 0.14440917100315703, 0.41801179659351245, 0.07823293855457, 0.10569471009939756, 0.19787694247362694, 0.23629715364935241, 0.04733158898847081, 0.15360093887501694, -0.1554032533535177, 0.1659957231586492, -0.0013546891493684391] |
1,802.00163 | Study of Uniform Jitter Mechanism for Metric-based Wireless Routing | Many wireless protocols wait a small and random amount of time which is
called jitter before sending a packet to avoid high contention and packet
collision. Jitter has been already proposed for many routing protocols
including AODV and LOADng. However, since they do not consider any link quality
parameters or metrics (such as ETX) in routing, they fail to be efficient in
metric-based routing protocols. A metric-based jitter mechanism is proposed in
this paper and a closed form expression is derived that enables us to obtain
the probability of delay inversion for all jitter mechanisms available.
Simulation results are also presented to show the performance of different
jitter mechanisms.
| cs.NI | many wireless protocols wait a small and random amount of time which is called jitter before sending a packet to avoid high contention and packet collision jitter has been already proposed for many routing protocols including aodv and loadng however since they do not consider any link quality parameters or metrics such as etx in routing they fail to be efficient in metricbased routing protocols a metricbased jitter mechanism is proposed in this paper and a closed form expression is derived that enables us to obtain the probability of delay inversion for all jitter mechanisms available simulation results are also presented to show the performance of different jitter mechanisms | [['many', 'wireless', 'protocols', 'wait', 'a', 'small', 'and', 'random', 'amount', 'of', 'time', 'which', 'is', 'called', 'jitter', 'before', 'sending', 'a', 'packet', 'to', 'avoid', 'high', 'contention', 'and', 'packet', 'collision', 'jitter', 'has', 'been', 'already', 'proposed', 'for', 'many', 'routing', 'protocols', 'including', 'aodv', 'and', 'loadng', 'however', 'since', 'they', 'do', 'not', 'consider', 'any', 'link', 'quality', 'parameters', 'or', 'metrics', 'such', 'as', 'etx', 'in', 'routing', 'they', 'fail', 'to', 'be', 'efficient', 'in', 'metricbased', 'routing', 'protocols', 'a', 'metricbased', 'jitter', 'mechanism', 'is', 'proposed', 'in', 'this', 'paper', 'and', 'a', 'closed', 'form', 'expression', 'is', 'derived', 'that', 'enables', 'us', 'to', 'obtain', 'the', 'probability', 'of', 'delay', 'inversion', 'for', 'all', 'jitter', 'mechanisms', 'available', 'simulation', 'results', 'are', 'also', 'presented', 'to', 'show', 'the', 'performance', 'of', 'different', 'jitter', 'mechanisms']] | [-0.22930947398989027, 0.0789020303380462, -0.07916342341896454, 0.08002116575777325, -0.07230067497050953, -0.23788190045214574, 0.1022312819601011, 0.4632120911339554, -0.23471947928993117, -0.30732707334938675, 0.09985185612885948, -0.20871094140916244, -0.13380682584402417, 0.23065280143081834, -0.17217005138422167, 0.13707717303656589, 0.08623947426217497, 0.0461028710759561, -0.0018939582947128956, -0.25590301517273273, 0.2502007331494071, 0.10375981312458736, 0.32429548221375415, 0.08839488903983334, 0.09658040123705436, 0.004581346202197425, -0.02234624495832335, -0.008340292330404077, -0.10237841124983062, 0.025809660182257586, 0.2733994778758342, 0.18968484479016273, 0.26439961549663626, -0.43482409699589286, -0.2992171059072086, 0.13357472523978545, 0.1695074132887151, 0.1294711577148527, -0.04553483179855852, -0.2441950359578253, 0.15916533132698898, -0.2348804965427299, -0.038873834868705055, -0.054613440459884637, 0.024839420909694303, 0.07428253159554966, -0.27138551243435627, -0.01894802429927983, 0.0037953916620975785, -0.0241537003034572, -0.030970013764507455, -0.0378955647503154, 0.021440511671911685, 0.15388711142234093, 0.034925831581141216, 0.02277659520788819, 0.10575407012921134, -0.07719896817868234, -0.17599131657374562, 0.41644484064447773, 0.013146865198713376, -0.21920576596786395, 0.15200663488913635, -0.01630206557349601, -0.11029724243156817, 0.1548389901552315, 0.1998195145236448, 0.08165972620470945, -0.18750056200618043, -0.019672552501748597, 0.05169288432994567, 0.1841878376029637, 0.12336621697086396, 0.133559137830562, 0.08791905053925418, 0.1443980631478336, 0.10474814425560074, 0.05666119738699817, -0.09692700450103559, -0.11523939492693598, -0.2315142318657642, -0.14574666254632518, -0.14031766038153048, 0.03861415471442133, -0.06240044422704009, -0.13321753034427966, 0.3633000234787036, 0.19125751951077116, 0.1797939658089148, 0.09225120651001674, 0.4209121244216184, 0.10892812135189327, 0.08952255984084732, 0.15673428473977047, 0.20384632250071938, 0.036121266697524884, 0.11870196588559571, -0.16025613400649383, 0.16264193518078723, 0.010354480432739498] |
1,802.00164 | Investigation of La and Al substitution on the spontaneous polarization
and lattice dynamics of the Pb(1-x)LaxTi(1-x)AlxO3 ceramics | The phase purity and crystal structure of PLTA samples (synthesized via
sol-gel process) were confirmed using synchrotron x-ray powder diffraction
(wavelength, lmbda= 0.44573 A. Rietveld analyses of powder x-ray diffraction
data confirmed the tetragonal structure for compositions with more than 0.18
and cubic structure for the sample with 0.25 composition. Temperature-dependent
XRD was performed to investigate the structural change from tetragonal to cubic
structure phase transition. Raman spectroscopy at room temperature also
confirmed this phase transition with composition. Field emission scanning
electron provided information about surface morphology while an energy
dispersive x-ray spectrometer attached with FESEM confirmed the chemical
compositions of samples. Temperature and frequency dependent dielectric studies
showed that the tetragonal to cubic phase transition decreased from 680 K to
175 K with the increase in the x from 0.03 to 0.25, respectively. This is
correlated with the structural studies. Electric field dependent spontaneous
polarization showed proper ferroelectric loop for 0.06 to 0.18 belonging to a
tetragonal phase while after 0.25 composition the spontaneous polarization
vanishes.Bipolar strain versus electric field revealed a butterfly loop for
0.06 to 0.18 compositions. Energy storage efficiency initially increases
nominally with substitution but beyond 0.18 composition enhances considerably.
| cond-mat.mtrl-sci | the phase purity and crystal structure of plta samples synthesized via solgel process were confirmed using synchrotron xray powder diffraction wavelength lmbda 044573 a rietveld analyses of powder xray diffraction data confirmed the tetragonal structure for compositions with more than 018 and cubic structure for the sample with 025 composition temperaturedependent xrd was performed to investigate the structural change from tetragonal to cubic structure phase transition raman spectroscopy at room temperature also confirmed this phase transition with composition field emission scanning electron provided information about surface morphology while an energy dispersive xray spectrometer attached with fesem confirmed the chemical compositions of samples temperature and frequency dependent dielectric studies showed that the tetragonal to cubic phase transition decreased from 680 k to 175 k with the increase in the x from 003 to 025 respectively this is correlated with the structural studies electric field dependent spontaneous polarization showed proper ferroelectric loop for 006 to 018 belonging to a tetragonal phase while after 025 composition the spontaneous polarization vanishesbipolar strain versus electric field revealed a butterfly loop for 006 to 018 compositions energy storage efficiency initially increases nominally with substitution but beyond 018 composition enhances considerably | [['the', 'phase', 'purity', 'and', 'crystal', 'structure', 'of', 'plta', 'samples', 'synthesized', 'via', 'solgel', 'process', 'were', 'confirmed', 'using', 'synchrotron', 'xray', 'powder', 'diffraction', 'wavelength', 'lmbda', '044573', 'a', 'rietveld', 'analyses', 'of', 'powder', 'xray', 'diffraction', 'data', 'confirmed', 'the', 'tetragonal', 'structure', 'for', 'compositions', 'with', 'more', 'than', '018', 'and', 'cubic', 'structure', 'for', 'the', 'sample', 'with', '025', 'composition', 'temperaturedependent', 'xrd', 'was', 'performed', 'to', 'investigate', 'the', 'structural', 'change', 'from', 'tetragonal', 'to', 'cubic', 'structure', 'phase', 'transition', 'raman', 'spectroscopy', 'at', 'room', 'temperature', 'also', 'confirmed', 'this', 'phase', 'transition', 'with', 'composition', 'field', 'emission', 'scanning', 'electron', 'provided', 'information', 'about', 'surface', 'morphology', 'while', 'an', 'energy', 'dispersive', 'xray', 'spectrometer', 'attached', 'with', 'fesem', 'confirmed', 'the', 'chemical', 'compositions', 'of', 'samples', 'temperature', 'and', 'frequency', 'dependent', 'dielectric', 'studies', 'showed', 'that', 'the', 'tetragonal', 'to', 'cubic', 'phase', 'transition', 'decreased', 'from', '680', 'k', 'to', '175', 'k', 'with', 'the', 'increase', 'in', 'the', 'x', 'from', '003', 'to', '025', 'respectively', 'this', 'is', 'correlated', 'with', 'the', 'structural', 'studies', 'electric', 'field', 'dependent', 'spontaneous', 'polarization', 'showed', 'proper', 'ferroelectric', 'loop', 'for', '006', 'to', '018', 'belonging', 'to', 'a', 'tetragonal', 'phase', 'while', 'after', '025', 'composition', 'the', 'spontaneous', 'polarization', 'vanishesbipolar', 'strain', 'versus', 'electric', 'field', 'revealed', 'a', 'butterfly', 'loop', 'for', '006', 'to', '018', 'compositions', 'energy', 'storage', 'efficiency', 'initially', 'increases', 'nominally', 'with', 'substitution', 'but', 'beyond', '018', 'composition', 'enhances', 'considerably']] | [-0.07337574171772422, 0.24374238718124902, -0.06267950047346714, -0.05388328974332628, -0.06992288209301861, -0.1026558396872133, 0.17627615612858025, 0.4865500980497975, -0.27837866605504563, -0.34394707237615396, 0.028995942978163887, -0.36481908398043167, -0.02067827632356631, 0.1724154194718913, 0.06442047709623645, 0.016086494697159844, -0.04406444072159693, -0.05096754250851901, -0.1508786362173085, -0.19011487818176026, 0.2194412817798653, 0.09756165019873726, 0.34417386058914035, 0.024254924752504417, 0.0411620333233211, 0.010586786201517833, 0.0639227956372595, 0.03649426086462642, -0.1608338833396326, -0.006447987705714217, 0.24168524233575323, -0.06442684737940955, 0.09395621571395742, -0.3596520102384889, -0.2588295998345864, -0.00925302703644296, 0.08724820076512467, 0.01080674600395325, -0.11467455804300507, -0.23960345444808664, 0.08551434908601406, -0.07589578206626404, -0.1398821504247424, -0.0616482600716776, -0.04022340687837354, -0.030662418431970047, -0.250827303689929, 0.1448410742608279, 0.0002759916285101913, 0.18539771224911275, -0.1625359799590354, -0.16444094986899904, -0.10991438416224954, 0.010051330558244923, 0.014386078630310582, 0.1075622916840458, 0.18487196572517095, -0.019353693501876764, -0.04688086409709955, 0.3851972498232499, -0.040245839811656255, 0.0423441935410282, 0.11495808582434333, -0.27177618156236255, -0.10640662623842026, 0.3001950596557244, 0.06540651437550735, 0.09714230261865611, -0.15536680726738844, 0.02910302227246575, 0.0920488567263084, 0.33717095583285156, 0.13294594047689123, 0.030135482821711586, 0.22225278485076208, 0.1851543930230515, -0.04977124072611332, 0.1891697461226661, -0.1742849115674433, 0.0009696697546659332, -0.14523001582435283, -0.14506464706929892, -0.1353633886962933, 0.07745512621722331, -0.15403538847956377, -0.1730185242271737, 0.32238383218891137, 0.07858352773381691, 0.1632770117151698, -0.040123036842008956, 0.25067879561408374, 0.05013456478665926, 0.08985112090778881, -0.018918696082638284, 0.2471584325711439, 0.22946802051370277, 0.1724428816772017, -0.2938379241410937, 0.10551937769425997, -0.04124178285465429] |
1,802.00165 | Rigidity for relative $0$-cycles | We present a relation between the classical Chow group of relative $0$-cycles
on a regular scheme $\mathcal{X}$, projective and flat over an excellent
Henselian discrete valuation ring, and the Levine-Weibel Chow group of 0-cycles
on the special fiber. We show that these two Chow groups are isomorphic with
finite coefficients under extra assumptions. This generalizes a result of
Esnault, Kerz and Wittenberg.
| math.AG | we present a relation between the classical chow group of relative 0cycles on a regular scheme mathcalx projective and flat over an excellent henselian discrete valuation ring and the levineweibel chow group of 0cycles on the special fiber we show that these two chow groups are isomorphic with finite coefficients under extra assumptions this generalizes a result of esnault kerz and wittenberg | [['we', 'present', 'a', 'relation', 'between', 'the', 'classical', 'chow', 'group', 'of', 'relative', '0cycles', 'on', 'a', 'regular', 'scheme', 'mathcalx', 'projective', 'and', 'flat', 'over', 'an', 'excellent', 'henselian', 'discrete', 'valuation', 'ring', 'and', 'the', 'levineweibel', 'chow', 'group', 'of', '0cycles', 'on', 'the', 'special', 'fiber', 'we', 'show', 'that', 'these', 'two', 'chow', 'groups', 'are', 'isomorphic', 'with', 'finite', 'coefficients', 'under', 'extra', 'assumptions', 'this', 'generalizes', 'a', 'result', 'of', 'esnault', 'kerz', 'and', 'wittenberg']] | [-0.262249520769523, -0.028266414584762853, -0.18111982041849725, 0.024996479104776235, -0.11106639224735479, -0.15410485515941777, -0.0002414468195169203, 0.37563396664336324, -0.3130062385537331, -0.1508699146666444, 0.07010975871573112, -0.1819556988963497, -0.13722661364402983, 0.23509089961167304, -0.24577717175106367, -0.0680376265306897, -0.017426896964259926, 0.07761693625680861, -0.07955377961644122, -0.38175533657833455, 0.395783384390656, -0.03444327586781113, 0.30278381646700925, 0.028047600144242506, 0.14869913225993514, 0.05075320187625625, -0.04680603861268009, -0.02607717665453111, -0.17831653319433005, 0.1357357166970389, 0.31914401102450585, -0.0319986978410593, 0.21140125511221647, -0.3727649855277231, -0.11523671866199302, 0.22147705870860768, 0.043139081463337905, -0.008770227041696348, -0.02216311036834433, -0.26418143970471236, 0.12072474571065075, -0.24454625238544278, -0.1211948363380807, -0.06984282924132722, 0.04074302423865565, 0.05669270855404677, -0.19897436471834343, -0.0030806649987015033, 0.09184063886606318, 0.2235505607940497, -0.09789347765035927, -0.07746894801065567, -0.06503139546651754, 0.012955395196894965, -0.014722079699558596, 0.022070478550308654, 0.0898796588167428, -0.038316878200989335, -0.08382121022159775, 0.39304163868749337, -0.13420435816289916, -0.1924868296050737, 0.12102452466910284, -0.16972829737970907, -0.16061945629846905, 0.12159728808065635, 0.04092914032779874, 0.1812028894200921, 0.1074303873934813, 0.2093228729368533, -0.21863047577320568, 0.0991389349012846, 0.1121289970638651, 0.011563699639913055, 0.06222219739650046, 0.02983835371842067, 0.07298523365687053, 0.08742284754501475, 0.03736461723606373, -0.03495352313433203, -0.3697812562027285, -0.2043279880928176, -0.07656046812753042, 0.19141562042697782, -0.16257985953862156, -0.1205202930554327, 0.3801700255456038, 0.02034001871323844, 0.15271780505445937, 0.16112462937411282, 0.22443529047473754, -0.031112584255395398, 0.007296616767322825, 0.03360915615802139, 0.11267471277425366, 0.28686063334105477, -0.10860587248856562, -0.15929557581342035, -0.01872218132109171, 0.2167664469339915] |
1,802.00166 | PCOT: Cache Oblivious Tiling of Polyhedral Programs | This paper studies two variants of tiling: iteration space tiling (or loop
blocking) and cache-oblivious methods that recursively split the iteration
space with divide-and-conquer. The key question to answer is when we should be
using one over the other. The answer to this question is complicated for modern
architecture due to a number of reasons. In this paper, we present a detailed
empirical study to answer this question for a range of kernels that fit the
polyhedral model. Our study is based on a generalized cache oblivious code
generator that support this class, which is a superset of those supported by
existing tools. The conclusion is that cache oblivious code is most useful when
the aim is to have reduced off-chip memory accesses, e.g., lower energy, albeit
certain situations that diminish its effectiveness exist.
| cs.PL | this paper studies two variants of tiling iteration space tiling or loop blocking and cacheoblivious methods that recursively split the iteration space with divideandconquer the key question to answer is when we should be using one over the other the answer to this question is complicated for modern architecture due to a number of reasons in this paper we present a detailed empirical study to answer this question for a range of kernels that fit the polyhedral model our study is based on a generalized cache oblivious code generator that support this class which is a superset of those supported by existing tools the conclusion is that cache oblivious code is most useful when the aim is to have reduced offchip memory accesses eg lower energy albeit certain situations that diminish its effectiveness exist | [['this', 'paper', 'studies', 'two', 'variants', 'of', 'tiling', 'iteration', 'space', 'tiling', 'or', 'loop', 'blocking', 'and', 'cacheoblivious', 'methods', 'that', 'recursively', 'split', 'the', 'iteration', 'space', 'with', 'divideandconquer', 'the', 'key', 'question', 'to', 'answer', 'is', 'when', 'we', 'should', 'be', 'using', 'one', 'over', 'the', 'other', 'the', 'answer', 'to', 'this', 'question', 'is', 'complicated', 'for', 'modern', 'architecture', 'due', 'to', 'a', 'number', 'of', 'reasons', 'in', 'this', 'paper', 'we', 'present', 'a', 'detailed', 'empirical', 'study', 'to', 'answer', 'this', 'question', 'for', 'a', 'range', 'of', 'kernels', 'that', 'fit', 'the', 'polyhedral', 'model', 'our', 'study', 'is', 'based', 'on', 'a', 'generalized', 'cache', 'oblivious', 'code', 'generator', 'that', 'support', 'this', 'class', 'which', 'is', 'a', 'superset', 'of', 'those', 'supported', 'by', 'existing', 'tools', 'the', 'conclusion', 'is', 'that', 'cache', 'oblivious', 'code', 'is', 'most', 'useful', 'when', 'the', 'aim', 'is', 'to', 'have', 'reduced', 'offchip', 'memory', 'accesses', 'eg', 'lower', 'energy', 'albeit', 'certain', 'situations', 'that', 'diminish', 'its', 'effectiveness', 'exist']] | [-0.09703867448234944, 0.04614711246877186, -0.05473945782964688, 0.09851317694792941, -0.12319051464950082, -0.17384937509143752, 0.0903110350204159, 0.3843514110559403, -0.2866927836509074, -0.31019586458135007, 0.12867235696836332, -0.23872745841908366, -0.1535397082230132, 0.20507099674606294, -0.11755232170307592, 0.03552735278968449, 0.11354883739238461, 0.003985933340919107, -0.021710462717481876, -0.30659927994207437, 0.364176336703683, 0.07783719047698985, 0.2594733113343063, 0.05296045715170009, 0.04054036534477352, -0.03288547440480663, -0.0237534902850861, 0.02260281883637115, -0.10224958996375573, 0.1498956845772675, 0.2897308145427326, 0.18690719712636808, 0.3108850749845464, -0.3991059381653791, -0.18379796833758166, 0.11755951872067665, 0.14661302492089845, 0.10581168014149585, -0.039619996065600536, -0.1935776231998105, 0.1569453538464966, -0.16991987219775345, -0.07367377603468277, -0.09020593086841391, -0.0005662178016031411, -0.02585657783644969, -0.2657667686954252, -0.037536767269693204, 0.12604548836799354, 0.03366396424304972, -0.024339207033661485, -0.09430646236443808, 0.05773861218007532, 0.10180050604620518, 0.03487934528342141, 0.0760695341446284, 0.09341615259494465, -0.05972066605915385, -0.14721546316373427, 0.3826093233412882, 0.0018630613114184408, -0.23826222107120193, 0.18206488011828834, -0.08986270560278321, -0.17217453213325187, 0.10712631961761682, 0.16901070731665954, 0.1103008827058826, -0.12958971088176155, 0.09560732000443126, -0.10639717273584415, 0.19348480063403692, 0.07239264092727829, 0.02367388079318204, 0.14557165797077007, 0.18203358644786388, 0.08581537637449523, 0.15808006984037487, -0.02881235361130519, -0.11027992266376238, -0.24638426085628234, -0.168120959620756, -0.18991502629134305, 0.027827457384963922, -0.061081950010539815, -0.1583350838662417, 0.38441309091763626, 0.19661912142730026, 0.18364914243609937, 0.09682316155913077, 0.36311522316632433, 0.1018506617149783, 0.08828725671367858, 0.11857984755049224, 0.11398231194340694, 0.046019639126581156, 0.07235778732583233, -0.1909676093026933, 0.0925502934555676, 0.09356891595994804] |
1,802.00167 | Consensus-based Distributed Quickest Detection of Attacks with Unknown
Parameters | Sequential attack detection in a distributed estimation system is considered,
where each sensor successively produces one-bit quantized samples of a desired
deterministic scalar parameter corrupted by additive noise. The unknown
parameters in the pre-attack and post-attack models, namely the desired
parameter to be estimated and the injected malicious data at the attacked
sensors pose a significant challenge for designing a computationally efficient
scheme for each sensor to detect the occurrence of attacks by only using local
communication with neighboring sensors. The generalized Cumulative Sum (GCUSUM)
algorithm is considered, which replaces the unknown parameters with their
maximum likelihood estimates in the CUSUM test statistic. For the problem under
consideration, a sufficient condition is provided under which the expected
false alarm period of the GCUSUM can be guaranteed to be larger than any given
value. Next, we consider the distributed implementation of the GCUSUM. We first
propose an alternative test statistic which is asymptotically equivalent to
that of GCUSUM. Then based on the proposed alternative test statistic and
running consensus algorithms, we propose a distributed approximate GCUSUM
algorithm which significantly reduce the prohibitively high computational
complexity of the centralized GCUSUM. Numerical results show that the
distributed approximate GCUSUM algorithm can provide a performance that is
comparable to the centralized GCUSUM.
| cs.IT math.IT | sequential attack detection in a distributed estimation system is considered where each sensor successively produces onebit quantized samples of a desired deterministic scalar parameter corrupted by additive noise the unknown parameters in the preattack and postattack models namely the desired parameter to be estimated and the injected malicious data at the attacked sensors pose a significant challenge for designing a computationally efficient scheme for each sensor to detect the occurrence of attacks by only using local communication with neighboring sensors the generalized cumulative sum gcusum algorithm is considered which replaces the unknown parameters with their maximum likelihood estimates in the cusum test statistic for the problem under consideration a sufficient condition is provided under which the expected false alarm period of the gcusum can be guaranteed to be larger than any given value next we consider the distributed implementation of the gcusum we first propose an alternative test statistic which is asymptotically equivalent to that of gcusum then based on the proposed alternative test statistic and running consensus algorithms we propose a distributed approximate gcusum algorithm which significantly reduce the prohibitively high computational complexity of the centralized gcusum numerical results show that the distributed approximate gcusum algorithm can provide a performance that is comparable to the centralized gcusum | [['sequential', 'attack', 'detection', 'in', 'a', 'distributed', 'estimation', 'system', 'is', 'considered', 'where', 'each', 'sensor', 'successively', 'produces', 'onebit', 'quantized', 'samples', 'of', 'a', 'desired', 'deterministic', 'scalar', 'parameter', 'corrupted', 'by', 'additive', 'noise', 'the', 'unknown', 'parameters', 'in', 'the', 'preattack', 'and', 'postattack', 'models', 'namely', 'the', 'desired', 'parameter', 'to', 'be', 'estimated', 'and', 'the', 'injected', 'malicious', 'data', 'at', 'the', 'attacked', 'sensors', 'pose', 'a', 'significant', 'challenge', 'for', 'designing', 'a', 'computationally', 'efficient', 'scheme', 'for', 'each', 'sensor', 'to', 'detect', 'the', 'occurrence', 'of', 'attacks', 'by', 'only', 'using', 'local', 'communication', 'with', 'neighboring', 'sensors', 'the', 'generalized', 'cumulative', 'sum', 'gcusum', 'algorithm', 'is', 'considered', 'which', 'replaces', 'the', 'unknown', 'parameters', 'with', 'their', 'maximum', 'likelihood', 'estimates', 'in', 'the', 'cusum', 'test', 'statistic', 'for', 'the', 'problem', 'under', 'consideration', 'a', 'sufficient', 'condition', 'is', 'provided', 'under', 'which', 'the', 'expected', 'false', 'alarm', 'period', 'of', 'the', 'gcusum', 'can', 'be', 'guaranteed', 'to', 'be', 'larger', 'than', 'any', 'given', 'value', 'next', 'we', 'consider', 'the', 'distributed', 'implementation', 'of', 'the', 'gcusum', 'we', 'first', 'propose', 'an', 'alternative', 'test', 'statistic', 'which', 'is', 'asymptotically', 'equivalent', 'to', 'that', 'of', 'gcusum', 'then', 'based', 'on', 'the', 'proposed', 'alternative', 'test', 'statistic', 'and', 'running', 'consensus', 'algorithms', 'we', 'propose', 'a', 'distributed', 'approximate', 'gcusum', 'algorithm', 'which', 'significantly', 'reduce', 'the', 'prohibitively', 'high', 'computational', 'complexity', 'of', 'the', 'centralized', 'gcusum', 'numerical', 'results', 'show', 'that', 'the', 'distributed', 'approximate', 'gcusum', 'algorithm', 'can', 'provide', 'a', 'performance', 'that', 'is', 'comparable', 'to', 'the', 'centralized', 'gcusum']] | [-0.14151555269741192, 0.042791211181885454, -0.07139190437344177, 0.057334345358239426, -0.06699473860871569, -0.22919062677329938, 0.09854150735345728, 0.3626712058706812, -0.2519490979319429, -0.32695709880450424, 0.13460427263339955, -0.20378994367044342, -0.1488157033758319, 0.17957015291636963, -0.1272152468836574, 0.11146649437988006, 0.06253966254042687, 0.06360680512099184, -0.056213441905498075, -0.30762898502084046, 0.22336050410471534, 0.1097106804350247, 0.3128260604650286, -0.049984268430768905, 0.14235342777916793, -0.012357724849207795, -0.01695004953389227, 0.023010365699827312, -0.09139571426453036, 0.0951594437595124, 0.2657427301363839, 0.18926750767103212, 0.31992443819228866, -0.39890623186683455, -0.15331225834139015, 0.15394992643521857, 0.14392267820562554, 0.08807492498668351, -0.04582009884778518, -0.2966933652605627, 0.158530703317239, -0.16719547576037042, -0.06027261919712036, -0.037450208149823375, -0.03211531334147217, 0.022614725968903966, -0.3757307269893911, 0.057449521807332836, 0.012797973744103299, -0.015353989112528338, -0.04405604498258427, -0.10911922774036924, 0.05314269246857451, 0.09037005984345856, 0.034644214498837464, 0.00020843983801072777, 0.14560843879752905, -0.0826492148709083, -0.12324320100268106, 0.3443344087859589, -0.03906145804610322, -0.24620777021956872, 0.11271725471383455, -0.033233032150167055, -0.12498191866465813, 0.1615219349221547, 0.20457487170031105, 0.13084243141240687, -0.15965143999237802, 0.031098930499514177, -0.024668843098488696, 0.19547514651186657, 0.035662408879899604, 0.007307428427958402, 0.14525377705967693, 0.1635741501448199, 0.1606435145865586, 0.15542285411971832, -0.12294781225247552, -0.07579460723892502, -0.27118507468991954, -0.13137659495291504, -0.24381689158614706, 0.0008683814217250992, -0.12195212779329596, -0.16205969604254128, 0.35592090265081555, 0.21670189939871215, 0.17106124317691918, 0.1172040264023207, 0.3781282769759064, 0.13263632219868537, 0.03458410746999735, 0.13086271486672515, 0.2178725142567306, 0.0499832226589979, 0.03430400959076585, -0.19668133925884998, 0.14469200813386968, 0.02936993655523708] |
1,802.00168 | Deep Neural Nets with Interpolating Function as Output Activation | We replace the output layer of deep neural nets, typically the softmax
function, by a novel interpolating function. And we propose end-to-end training
and testing algorithms for this new architecture. Compared to classical neural
nets with softmax function as output activation, the surrogate with
interpolating function as output activation combines advantages of both deep
and manifold learning. The new framework demonstrates the following major
advantages: First, it is better applicable to the case with insufficient
training data. Second, it significantly improves the generalization accuracy on
a wide variety of networks. The algorithm is implemented in PyTorch, and code
will be made publicly available.
| cs.LG cs.CV stat.ML | we replace the output layer of deep neural nets typically the softmax function by a novel interpolating function and we propose endtoend training and testing algorithms for this new architecture compared to classical neural nets with softmax function as output activation the surrogate with interpolating function as output activation combines advantages of both deep and manifold learning the new framework demonstrates the following major advantages first it is better applicable to the case with insufficient training data second it significantly improves the generalization accuracy on a wide variety of networks the algorithm is implemented in pytorch and code will be made publicly available | [['we', 'replace', 'the', 'output', 'layer', 'of', 'deep', 'neural', 'nets', 'typically', 'the', 'softmax', 'function', 'by', 'a', 'novel', 'interpolating', 'function', 'and', 'we', 'propose', 'endtoend', 'training', 'and', 'testing', 'algorithms', 'for', 'this', 'new', 'architecture', 'compared', 'to', 'classical', 'neural', 'nets', 'with', 'softmax', 'function', 'as', 'output', 'activation', 'the', 'surrogate', 'with', 'interpolating', 'function', 'as', 'output', 'activation', 'combines', 'advantages', 'of', 'both', 'deep', 'and', 'manifold', 'learning', 'the', 'new', 'framework', 'demonstrates', 'the', 'following', 'major', 'advantages', 'first', 'it', 'is', 'better', 'applicable', 'to', 'the', 'case', 'with', 'insufficient', 'training', 'data', 'second', 'it', 'significantly', 'improves', 'the', 'generalization', 'accuracy', 'on', 'a', 'wide', 'variety', 'of', 'networks', 'the', 'algorithm', 'is', 'implemented', 'in', 'pytorch', 'and', 'code', 'will', 'be', 'made', 'publicly', 'available']] | [-0.01036402678967101, -0.04072208501832578, -0.04351274347276363, 0.08704762452494498, -0.105626508394636, -0.20734763401334436, 0.024559180135838687, 0.440853270430805, -0.29893795784237315, -0.31609778149614054, 0.03755175341282365, -0.22501028768573572, -0.21471953211189473, 0.21003415747726498, -0.11807939870445763, 0.16749753038968565, 0.1465619205343492, -0.011142726680173458, -0.09184514901525051, -0.30265148552767573, 0.3141571135278249, 0.07849369217467594, 0.35348041562670934, 0.01449229817801309, 0.17192381338410767, -0.0007969499610870788, 0.014042398643688959, -0.040677600458843034, -0.04275448393139952, 0.17062342753724277, 0.2641556538196136, 0.22966042827380803, 0.33709646302989676, -0.41062511941327634, -0.24092705688864283, 0.09179142945744459, 0.14225739285856195, 0.0961335294843805, -0.0044707193647429925, -0.2696841344467898, 0.08202223078284449, -0.210398590666902, 0.01439027131526071, -0.14312134505005428, -0.0657380537821649, 0.05260567909481854, -0.31926970880080774, 0.011923888101450448, 0.05973617026347269, 0.041941968119026216, -0.040115022475749836, -0.1696881161439255, 0.01537715462804998, 0.11932574762302695, -0.014761429371592562, 0.15059794118352127, 0.1024763093090354, -0.15996958726555904, -0.11957529384317328, 0.2820118474005495, -0.11114182240483396, -0.21955720430185782, 0.18208101856775438, 0.0014668934146683773, -0.12172626923697377, 0.08721040550266727, 0.22600694869767007, 0.11805361458688106, -0.16118402709479182, 0.005340157411269192, 0.019251112102811198, 0.16777107232584826, 0.0155621525442716, -0.027998076674971475, 0.1421811510989605, 0.30934288912425634, 0.00886577858761387, 0.2136721570955734, -0.11657382899051016, -0.09247136847183868, -0.2700374962997089, -0.1284456123299535, -0.22953285313735816, -0.027635982802626, -0.08839745930728313, -0.16046169043622585, 0.4005749200118109, 0.19183651041589878, 0.22405789778070542, 0.17482734684384818, 0.3676110932476891, 0.06231109109634841, 0.19491149677705127, 0.11311749891531699, 0.20358052170943938, 0.06496085559054124, 0.12677687491534403, -0.12440656171348714, 0.08678966619128596, 0.06428775977958175] |
1,802.00169 | Entanglement Entropy for Open Bosonic Strings on $Dp$-branes | We study the entanglement entropy for open bosonic strings on multiple
$Dp$-branes by using the covariant open string field theory. Choosing one of
the spatial coordinates which are tangential to the hyperplane on which
$Dp$-branes are located, we divide the hyperplane into two halves. By using the
string wavefunction in the Fock space representation, we evaluate the
entanglement entropy. The entanglement entropy is found to be proportional to
the area of $(p-1)$-dimensional boundary of the bipartite hyperplanes and
divergent in the ultraviolet (UV) region as well as in the infrared (IR)
region. However, the leading divergences are mainly due to tachyon
contributions to the entanglement entropy, which may be absent in
supersymmetric string theories. Apart from the divergences thanks to tachyons,
the entanglement entropy for open bosonic strings on $Dp$-branes is finite for
$2 \le p \le d_{\text{critical}} -2$ and logarithmically divergent for $p =1,
d_{\text{critical}}-1$.
| hep-th gr-qc | we study the entanglement entropy for open bosonic strings on multiple dpbranes by using the covariant open string field theory choosing one of the spatial coordinates which are tangential to the hyperplane on which dpbranes are located we divide the hyperplane into two halves by using the string wavefunction in the fock space representation we evaluate the entanglement entropy the entanglement entropy is found to be proportional to the area of p1dimensional boundary of the bipartite hyperplanes and divergent in the ultraviolet uv region as well as in the infrared ir region however the leading divergences are mainly due to tachyon contributions to the entanglement entropy which may be absent in supersymmetric string theories apart from the divergences thanks to tachyons the entanglement entropy for open bosonic strings on dpbranes is finite for 2 le p le d_textcritical 2 and logarithmically divergent for p 1 d_textcritical1 | [['we', 'study', 'the', 'entanglement', 'entropy', 'for', 'open', 'bosonic', 'strings', 'on', 'multiple', 'dpbranes', 'by', 'using', 'the', 'covariant', 'open', 'string', 'field', 'theory', 'choosing', 'one', 'of', 'the', 'spatial', 'coordinates', 'which', 'are', 'tangential', 'to', 'the', 'hyperplane', 'on', 'which', 'dpbranes', 'are', 'located', 'we', 'divide', 'the', 'hyperplane', 'into', 'two', 'halves', 'by', 'using', 'the', 'string', 'wavefunction', 'in', 'the', 'fock', 'space', 'representation', 'we', 'evaluate', 'the', 'entanglement', 'entropy', 'the', 'entanglement', 'entropy', 'is', 'found', 'to', 'be', 'proportional', 'to', 'the', 'area', 'of', 'p1dimensional', 'boundary', 'of', 'the', 'bipartite', 'hyperplanes', 'and', 'divergent', 'in', 'the', 'ultraviolet', 'uv', 'region', 'as', 'well', 'as', 'in', 'the', 'infrared', 'ir', 'region', 'however', 'the', 'leading', 'divergences', 'are', 'mainly', 'due', 'to', 'tachyon', 'contributions', 'to', 'the', 'entanglement', 'entropy', 'which', 'may', 'be', 'absent', 'in', 'supersymmetric', 'string', 'theories', 'apart', 'from', 'the', 'divergences', 'thanks', 'to', 'tachyons', 'the', 'entanglement', 'entropy', 'for', 'open', 'bosonic', 'strings', 'on', 'dpbranes', 'is', 'finite', 'for', '2', 'le', 'p', 'le', 'd_textcritical', '2', 'and', 'logarithmically', 'divergent', 'for', 'p', '1', 'd_textcritical1']] | [-0.12766621867194772, 0.2161625045312879, -0.09636901523723888, 0.11504142182820942, -0.006770226315388249, -0.1723848937286271, 0.012659912527144317, 0.3015042622056272, -0.2311390602392041, -0.22031635470274422, 0.07720324944400797, -0.34784078100670335, -0.057848090551690094, 0.12697544126260457, -0.08877620634262308, 0.048383244318554515, -0.028370320581517363, 0.0892330657871854, -0.04371991313463594, -0.27561313105009805, 0.3857414127980721, -0.007762197571638454, 0.27616973254286376, 0.09744858907328711, 0.06814389023606458, 0.0066260733001399785, -0.023885646602138877, 0.02760615799696906, -0.13984523730727638, 0.11857848615767984, 0.2727158509628175, 0.11430359756842437, 0.1638058664385527, -0.3998656266679366, -0.19987038635271245, 0.09893896829453297, 0.21102161239509265, 0.11406174708342103, 0.05383608825973675, -0.25599802727487664, 0.02136541773345218, -0.11961429267022242, -0.13180766071309336, -0.04603976283882124, 0.03996870733115227, -0.07905827139378137, -0.2157267503951314, 0.08248067604048022, -0.009282654496524224, 0.040902648231066346, -0.03913631843816903, -0.05380682496373387, -0.04721044576500491, 0.09500114465804978, 0.08712244789866316, 0.11321371532620914, 0.1293219376109644, -0.1557768732935377, -0.11426936514100008, 0.31559102919547716, -0.05613969677102028, -0.2173577880926637, 0.1549179390834373, -0.14986858542154854, -0.11739828938476017, 0.12350675772500432, 0.08351327984645548, 0.14479690970276554, -0.12383611769311959, 0.18821597362127956, 0.01675536642061262, 0.12210039108968987, 0.14272834758675243, 0.1134009010792296, 0.25772934954147786, 0.011622638286401829, 0.04506636258722412, 0.21940165209202356, -0.07018620072954541, -0.15263007590935254, -0.402510090430749, -0.16468688864066885, -0.19640520508013046, 0.058427363629258856, -0.13238946876804725, -0.1758116291020997, 0.33483823376324534, 0.07707770685616804, 0.19162329005484935, 0.03518715978376955, 0.22571666933233953, 0.08298690709489165, 0.09350365601454137, 0.10505171166732907, 0.2265184383528928, 0.10416853084138387, 0.05426475294370903, -0.26295880594989285, -0.09014260762261175, 0.16372271830914542] |
1,802.0017 | Classification of solitons for pluriclosed flow on complex surfaces | We give a classification of compact solitons for the pluriclosed flow on
complex surfaces. First, by exploiting results from the Kodaira classification
of surfaces, we show that the complex surface underlying a soliton must be
K\"ahler except for the possibility of steady solitons on minimal Hopf
surfaces. Then, we construct steady solitons on all class $1$ Hopf surfaces by
exploiting a natural symmetry ansatz.
| math.DG | we give a classification of compact solitons for the pluriclosed flow on complex surfaces first by exploiting results from the kodaira classification of surfaces we show that the complex surface underlying a soliton must be kahler except for the possibility of steady solitons on minimal hopf surfaces then we construct steady solitons on all class 1 hopf surfaces by exploiting a natural symmetry ansatz | [['we', 'give', 'a', 'classification', 'of', 'compact', 'solitons', 'for', 'the', 'pluriclosed', 'flow', 'on', 'complex', 'surfaces', 'first', 'by', 'exploiting', 'results', 'from', 'the', 'kodaira', 'classification', 'of', 'surfaces', 'we', 'show', 'that', 'the', 'complex', 'surface', 'underlying', 'a', 'soliton', 'must', 'be', 'kahler', 'except', 'for', 'the', 'possibility', 'of', 'steady', 'solitons', 'on', 'minimal', 'hopf', 'surfaces', 'then', 'we', 'construct', 'steady', 'solitons', 'on', 'all', 'class', '1', 'hopf', 'surfaces', 'by', 'exploiting', 'a', 'natural', 'symmetry', 'ansatz']] | [-0.1937136551568983, 0.07474383347289404, -0.09904755826573819, 0.09309316499275155, -0.11735584740381455, -0.17498479170171777, -0.024655661414726637, 0.3900655222023488, -0.23887435055803508, -0.20200020149059128, 0.14069447604197194, -0.21680383407510817, -0.21270643416210078, 0.24940145175423822, -0.09134955644549336, 0.022460891304945108, 0.08382331280154176, 0.03722186730010435, -0.10455469559747144, -0.25378169858595356, 0.501927045173943, -0.09739157947478816, 0.2643627226498211, 0.08445994987414451, 0.12659289989096578, -0.028307482920354232, 0.05638554871256929, -0.008100936247501522, -0.23264001062909756, 0.13225856010103598, 0.2198652229271829, 0.012498704651079606, 0.14371216903236927, -0.4071663649810944, -0.27371447586483555, 0.15549232834018767, 0.1230930745441583, 0.16641489579342306, -0.0649619077139505, -0.32687449712102534, 0.10964695728216611, -0.1092171963682631, -0.16855094190395903, -0.14858560813445365, 0.014554862777004018, 0.047458327186177485, -0.1235570372955408, 0.031182157646981068, 0.1294431021233322, 0.08428639920020942, -0.09740233589764102, -0.017069245979655534, -0.15056523674866185, 0.060405245087167714, 0.009496849910647143, -0.029738315133727156, 0.08171401599429373, -0.14207236902439035, -0.12294079270213842, 0.359972047386691, -0.12149541983671952, -0.26796251177438535, 0.17242390194587642, -0.09510225667327177, -0.1147195558223757, 0.18437486796756275, 0.1748721748153912, 0.16822313751617912, -0.04586996490252204, 0.09777381614730984, -0.08875936310505494, 0.10443657021096442, 0.1431647581339348, -0.05762795330520021, 0.19675997148442548, 0.17776301872072509, 0.12092549467342906, 0.12138816796687024, -0.03945535351158469, -0.05502155485737603, -0.34898597141727805, -0.20882164384238422, -0.14311558100052935, 0.1499429020586831, -0.10493851022329181, -0.1301495543884812, 0.4621644258731976, -0.03840846533421427, 0.21598423009709222, 0.0726424418244278, 0.19084258569637313, 0.02451669230867992, 0.03944287193007767, 0.1312865252548363, 0.1956271234594169, 0.15779468268010532, 0.022464199289970566, -0.14364919209401705, -0.08997795072355075, 0.16091230536767398] |
1,802.00171 | Accelerated Variational Quantum Eigensolver | The problem of finding the ground state energy of a Hamiltonian using a
quantum computer is currently solved using either the quantum phase estimation
(QPE) or variational quantum eigensolver (VQE) algorithms. For precision
$\epsilon$, QPE requires $O(1)$ repetitions of circuits with depth
$O(1/\epsilon)$, whereas each expectation estimation subroutine within VQE
requires $O(1/\epsilon^{2})$ samples from circuits with depth $O(1)$. We
propose a generalised VQE algorithm that interpolates between these two regimes
via a free parameter $\alpha\in[0,1]$ which can exploit quantum coherence over
a circuit depth of $O(1/\epsilon^{\alpha})$ to reduce the number of samples to
$O(1/\epsilon^{2(1-\alpha)})$. Along the way, we give a new routine for
expectation estimation under limited quantum resources that is of independent
interest.
| quant-ph | the problem of finding the ground state energy of a hamiltonian using a quantum computer is currently solved using either the quantum phase estimation qpe or variational quantum eigensolver vqe algorithms for precision epsilon qpe requires o1 repetitions of circuits with depth o1epsilon whereas each expectation estimation subroutine within vqe requires o1epsilon2 samples from circuits with depth o1 we propose a generalised vqe algorithm that interpolates between these two regimes via a free parameter alphain01 which can exploit quantum coherence over a circuit depth of o1epsilonalpha to reduce the number of samples to o1epsilon21alpha along the way we give a new routine for expectation estimation under limited quantum resources that is of independent interest | [['the', 'problem', 'of', 'finding', 'the', 'ground', 'state', 'energy', 'of', 'a', 'hamiltonian', 'using', 'a', 'quantum', 'computer', 'is', 'currently', 'solved', 'using', 'either', 'the', 'quantum', 'phase', 'estimation', 'qpe', 'or', 'variational', 'quantum', 'eigensolver', 'vqe', 'algorithms', 'for', 'precision', 'epsilon', 'qpe', 'requires', 'o1', 'repetitions', 'of', 'circuits', 'with', 'depth', 'o1epsilon', 'whereas', 'each', 'expectation', 'estimation', 'subroutine', 'within', 'vqe', 'requires', 'o1epsilon2', 'samples', 'from', 'circuits', 'with', 'depth', 'o1', 'we', 'propose', 'a', 'generalised', 'vqe', 'algorithm', 'that', 'interpolates', 'between', 'these', 'two', 'regimes', 'via', 'a', 'free', 'parameter', 'alphain01', 'which', 'can', 'exploit', 'quantum', 'coherence', 'over', 'a', 'circuit', 'depth', 'of', 'o1epsilonalpha', 'to', 'reduce', 'the', 'number', 'of', 'samples', 'to', 'o1epsilon21alpha', 'along', 'the', 'way', 'we', 'give', 'a', 'new', 'routine', 'for', 'expectation', 'estimation', 'under', 'limited', 'quantum', 'resources', 'that', 'is', 'of', 'independent', 'interest']] | [-0.12485828583261796, 0.14726149350462947, -0.05771575212046238, 0.008072286730956486, -0.023673052367355143, -0.20480093739128538, 0.09880078011233959, 0.3700003956910223, -0.2992640412100757, -0.35634586802500834, 0.0821144777749266, -0.23201704171619245, -0.10557189489190932, 0.23409723876102362, -0.06200060573714187, 0.15741520167960385, 0.07679306437577386, 0.05223772980389185, -0.10369861760825318, -0.23577804287197068, 0.21386870452261064, 0.02207177597925433, 0.2496746658829839, -0.027737349910499427, 0.14468156316018263, 0.025162291045749692, 0.06705563714162313, 0.021345367289281318, -0.13059423998038255, 0.13099578917899635, 0.2802323566907684, 0.16139939225149647, 0.30845648616585614, -0.4254530411396575, -0.1894323180396376, 0.14934598649519362, 0.1629106847062108, 0.15228657920358404, -0.023121436978856633, -0.26173866787991884, 0.04390933903050609, -0.1322813978643223, -0.05122404866519251, -0.09188560111631107, -0.03098955885174551, -0.04822569388696658, -0.3179065883325945, 0.0616318024528612, -0.0011247682663711853, 0.018577750738976256, 0.03835679818127703, -0.12115456301918519, 0.10153615894523682, 0.10657225744424588, -0.05675046295177059, 0.045160836776111477, 0.10723165364886102, -0.14754912501874579, -0.1705246033421385, 0.3224594184762931, -0.028203897487920977, -0.19625925266050867, 0.09962196771188506, -0.03548923256624091, -0.12597666544024833, 0.13419940416601353, 0.11958107180076435, 0.11799637935057815, -0.09668905186117627, 0.16355557146848046, -0.01154680731373706, 0.22843102131238474, 0.03182211926364938, 0.06379415651151378, 0.13384199586497353, 0.12542613236499683, 0.1445631941231633, 0.17864787273408314, -0.07895677086032395, -0.15494053855737938, -0.2975985060287972, -0.17825784153371518, -0.2734135295031592, 0.0509741918400063, -0.12426543489813671, -0.1958641326387546, 0.3728791702721667, 0.18032602445288962, 0.1828825503637615, 0.11236896046674312, 0.3249578833180879, 0.12820646668634644, 0.058189727536435906, 0.11776754178884273, 0.16245020564487536, 0.13288602036949929, 0.015714448283168685, -0.23207206358139437, 0.08903336279659665, 0.0976474550822916] |
1,802.00172 | Phenomenology of anomalous chiral transports in heavy-ion collisions | High-energy Heavy-ion collisions can generate extremely hot quark-gluon
matter and also extremely strong magnetic fields and fluid vorticity. Once
coupled to chiral anomaly, the magnetic fields and fluid vorticity can induce a
variety of novel transport phenomena, including the chiral magnetic effect,
chiral vortical effect, etc. Some of them require the environmental violation
of parity and thus provide a means to test the possible parity violation in hot
strongly interacting matter. We will discuss the underlying mechanism and
implications of these anomalous chiral transports in heavy-ion collisions.
| nucl-th hep-ph nucl-ex | highenergy heavyion collisions can generate extremely hot quarkgluon matter and also extremely strong magnetic fields and fluid vorticity once coupled to chiral anomaly the magnetic fields and fluid vorticity can induce a variety of novel transport phenomena including the chiral magnetic effect chiral vortical effect etc some of them require the environmental violation of parity and thus provide a means to test the possible parity violation in hot strongly interacting matter we will discuss the underlying mechanism and implications of these anomalous chiral transports in heavyion collisions | [['highenergy', 'heavyion', 'collisions', 'can', 'generate', 'extremely', 'hot', 'quarkgluon', 'matter', 'and', 'also', 'extremely', 'strong', 'magnetic', 'fields', 'and', 'fluid', 'vorticity', 'once', 'coupled', 'to', 'chiral', 'anomaly', 'the', 'magnetic', 'fields', 'and', 'fluid', 'vorticity', 'can', 'induce', 'a', 'variety', 'of', 'novel', 'transport', 'phenomena', 'including', 'the', 'chiral', 'magnetic', 'effect', 'chiral', 'vortical', 'effect', 'etc', 'some', 'of', 'them', 'require', 'the', 'environmental', 'violation', 'of', 'parity', 'and', 'thus', 'provide', 'a', 'means', 'to', 'test', 'the', 'possible', 'parity', 'violation', 'in', 'hot', 'strongly', 'interacting', 'matter', 'we', 'will', 'discuss', 'the', 'underlying', 'mechanism', 'and', 'implications', 'of', 'these', 'anomalous', 'chiral', 'transports', 'in', 'heavyion', 'collisions']] | [-0.19906739565047393, 0.3285104339278635, -0.1253663518288087, 0.11830291565743158, -0.14269467839307484, -0.09609794447562475, -0.062420674112636125, 0.31078075896948576, -0.258912931464013, -0.3174969053388327, 0.0014711735454313029, -0.2538232730016455, -0.08177368768394508, 0.12039793710941556, 0.07067897735998549, 0.06062089743884815, -0.01730120240914068, 0.022976941373212604, -0.001160347295474079, -0.17706602699813787, 0.29796442323118105, 0.05721461557215829, 0.2851217384931856, 0.19988932850203295, 0.06988300748661845, -0.03662397016385763, 0.0007532533557935693, 0.07692094972549841, -0.07670210002407689, 0.012173541206679168, 0.2047226946511916, -0.006861789837137036, 0.13955328580869855, -0.5298533927777718, -0.2396660646552156, 0.11384190610963209, 0.13721782606009436, 0.18125195026226426, -0.1557297057354416, -0.28989123065966643, 0.04504987637073487, -0.19486953955860917, -0.1677011231966745, -0.17151567008581825, -0.00920030098387051, -0.008937680147101182, -0.3002906798374379, 0.1319954510555394, 0.04592080366926204, 0.06667368132192855, -0.008050255073320078, -0.09610563110902734, -0.05508145920653967, 0.03568020421240864, 0.1130797887948909, 0.01913852785746085, 0.22878930827431465, -0.2504449613899496, -0.12208459536470044, 0.45077174966191424, -0.04406958308884467, -0.11469676805895636, 0.2371648030446564, -0.1642714600432022, -0.1523316469814243, 0.11790711795590048, 0.23661021293066015, 0.08115764691804846, -0.15832699749661588, 0.02420232129676653, -0.037978394770587995, 0.07198768583843591, 0.05900153011115718, 0.1259968801048295, 0.3579940580088517, 0.14106652869082903, 0.010963713327401328, 0.10515439918200517, -0.11204996324798638, -0.06061480348814686, -0.3384768584550455, -0.12404020658383767, -0.11384089587620277, 0.05078532799644176, -0.06143084599622445, -0.13230828523378949, 0.36442982833083165, 0.19038421272075381, 0.15260903851996208, -0.12533516131726832, 0.27525371060460463, 0.04374967183618025, 0.022194979915759343, 0.0898117702186707, 0.27618440642756215, 0.24265964252167735, 0.1787086814259254, -0.34405641211732024, 0.010580495706406134, 0.03861116760292615] |
1,802.00173 | Demonstration of a compact linear accelerator | Recently, we presented a new approach for a compact radio-frequency (RF)
accelerator structure and demonstrated the functionality of the individual
components: acceleration units and focusing elements. In this paper, we combine
these units to form a working accelerator structure including a matching
section between the ion source extraction grids and the RF-acceleration unit.
The matching section consist of six electrostatic quadrupoles (ESQs) fabricated
using 3D-printing techniques. The matching section enables us to capture twice
the amount of beam and match the beam envelope to conditions for an
acceleration lattice. We present data from an integrated accelerator consisting
of the source, matching section, and an ESQ doublet sandwiched between two
RF-acceleration units.
| physics.acc-ph | recently we presented a new approach for a compact radiofrequency rf accelerator structure and demonstrated the functionality of the individual components acceleration units and focusing elements in this paper we combine these units to form a working accelerator structure including a matching section between the ion source extraction grids and the rfacceleration unit the matching section consist of six electrostatic quadrupoles esqs fabricated using 3dprinting techniques the matching section enables us to capture twice the amount of beam and match the beam envelope to conditions for an acceleration lattice we present data from an integrated accelerator consisting of the source matching section and an esq doublet sandwiched between two rfacceleration units | [['recently', 'we', 'presented', 'a', 'new', 'approach', 'for', 'a', 'compact', 'radiofrequency', 'rf', 'accelerator', 'structure', 'and', 'demonstrated', 'the', 'functionality', 'of', 'the', 'individual', 'components', 'acceleration', 'units', 'and', 'focusing', 'elements', 'in', 'this', 'paper', 'we', 'combine', 'these', 'units', 'to', 'form', 'a', 'working', 'accelerator', 'structure', 'including', 'a', 'matching', 'section', 'between', 'the', 'ion', 'source', 'extraction', 'grids', 'and', 'the', 'rfacceleration', 'unit', 'the', 'matching', 'section', 'consist', 'of', 'six', 'electrostatic', 'quadrupoles', 'esqs', 'fabricated', 'using', '3dprinting', 'techniques', 'the', 'matching', 'section', 'enables', 'us', 'to', 'capture', 'twice', 'the', 'amount', 'of', 'beam', 'and', 'match', 'the', 'beam', 'envelope', 'to', 'conditions', 'for', 'an', 'acceleration', 'lattice', 'we', 'present', 'data', 'from', 'an', 'integrated', 'accelerator', 'consisting', 'of', 'the', 'source', 'matching', 'section', 'and', 'an', 'esq', 'doublet', 'sandwiched', 'between', 'two', 'rfacceleration', 'units']] | [-0.1152642065489834, 0.06585903184962015, -0.03187769243324345, -0.0022873028297908603, -0.04685415428089486, -0.1174914135936309, -0.01078244916081365, 0.4289334240962159, -0.25596460305492985, -0.3300894765945321, 0.043774433424484664, -0.2979320231973278, -0.032081817092627966, 0.22777883037924768, 0.014784623559733683, 0.06754959071351385, 0.060158251189965414, -0.009338049226525156, -0.04010296480582011, -0.1774424777080474, 0.3002930920994417, 0.10889562702399086, 0.3075572530061684, 0.05208793828602542, 0.17099713593488558, 0.003688890000127933, -0.007774303104220466, -0.038360595935955644, -0.0862551789519123, 0.2171366790140217, 0.2037809147309004, 0.1007562829731879, 0.17166825974444774, -0.46672090981155634, -0.1486494051207873, 0.0371591229647906, 0.11322246574034744, 0.0757035882381553, -0.09856326246041466, -0.2178236069835045, 0.029667984002100474, -0.2057792751475724, -0.08886549493128604, -0.009859989648711317, -0.022872939528050747, 0.03693770578088747, -0.30069387306734413, -0.038101743326776405, 0.031233412583308317, 0.06375246509401636, -0.03578122574836016, -0.12395679823953701, 0.05916578743014146, 0.10063243897801095, -0.04384028604254127, 0.004510171130426567, 0.14684453756887128, -0.10094732124654746, -0.10408093987921761, 0.35322669805450874, -0.04565159833820706, -0.1609055421484465, 0.16074931403960693, -0.12056515527973798, -0.09899722043509511, 0.10690100872254168, 0.2141594129953195, 0.07150804269635543, -0.18168336352100595, 0.0334072942099407, 0.01892176533795216, 0.21671077621725668, 0.15479040112007747, -0.0010485741203989495, 0.2319773199714043, 0.2115718048023568, 0.04867188947596746, 0.14084853844264714, -0.13906890984878623, -0.0351815145535511, -0.32051679497076707, -0.15612754518039185, -0.10792377300729805, -0.02278703646734357, -0.014373382370765533, -0.1657565344209698, 0.4174756813857874, 0.10371667553501374, 0.22209223581224002, -0.03975161808325951, 0.3327066118066961, 0.06828474279450761, 0.12369775017300112, 0.07813451368869706, 0.20680103853704745, 0.16194969496520406, 0.10551981076555834, -0.19378684181190858, -0.016311206943778828, 0.04368084162812341] |
1,802.00174 | Augmented Space Linear Model | The linear model uses the space defined by the input to project the target or
desired signal and find the optimal set of model parameters. When the problem
is nonlinear, the adaption requires nonlinear models for good performance, but
it becomes slower and more cumbersome. In this paper, we propose a linear model
called Augmented Space Linear Model (ASLM), which uses the full joint space of
input and desired signal as the projection space and approaches the performance
of nonlinear models. This new algorithm takes advantage of the linear solution,
and corrects the estimate for the current testing phase input with the error
assigned to the input space neighborhood in the training phase. This algorithm
can solve the nonlinear problem with the computational efficiency of linear
methods, which can be regarded as a trade off between accuracy and
computational complexity. Making full use of the training data, the proposed
augmented space model may provide a new way to improve many modeling tasks.
| cs.LG | the linear model uses the space defined by the input to project the target or desired signal and find the optimal set of model parameters when the problem is nonlinear the adaption requires nonlinear models for good performance but it becomes slower and more cumbersome in this paper we propose a linear model called augmented space linear model aslm which uses the full joint space of input and desired signal as the projection space and approaches the performance of nonlinear models this new algorithm takes advantage of the linear solution and corrects the estimate for the current testing phase input with the error assigned to the input space neighborhood in the training phase this algorithm can solve the nonlinear problem with the computational efficiency of linear methods which can be regarded as a trade off between accuracy and computational complexity making full use of the training data the proposed augmented space model may provide a new way to improve many modeling tasks | [['the', 'linear', 'model', 'uses', 'the', 'space', 'defined', 'by', 'the', 'input', 'to', 'project', 'the', 'target', 'or', 'desired', 'signal', 'and', 'find', 'the', 'optimal', 'set', 'of', 'model', 'parameters', 'when', 'the', 'problem', 'is', 'nonlinear', 'the', 'adaption', 'requires', 'nonlinear', 'models', 'for', 'good', 'performance', 'but', 'it', 'becomes', 'slower', 'and', 'more', 'cumbersome', 'in', 'this', 'paper', 'we', 'propose', 'a', 'linear', 'model', 'called', 'augmented', 'space', 'linear', 'model', 'aslm', 'which', 'uses', 'the', 'full', 'joint', 'space', 'of', 'input', 'and', 'desired', 'signal', 'as', 'the', 'projection', 'space', 'and', 'approaches', 'the', 'performance', 'of', 'nonlinear', 'models', 'this', 'new', 'algorithm', 'takes', 'advantage', 'of', 'the', 'linear', 'solution', 'and', 'corrects', 'the', 'estimate', 'for', 'the', 'current', 'testing', 'phase', 'input', 'with', 'the', 'error', 'assigned', 'to', 'the', 'input', 'space', 'neighborhood', 'in', 'the', 'training', 'phase', 'this', 'algorithm', 'can', 'solve', 'the', 'nonlinear', 'problem', 'with', 'the', 'computational', 'efficiency', 'of', 'linear', 'methods', 'which', 'can', 'be', 'regarded', 'as', 'a', 'trade', 'off', 'between', 'accuracy', 'and', 'computational', 'complexity', 'making', 'full', 'use', 'of', 'the', 'training', 'data', 'the', 'proposed', 'augmented', 'space', 'model', 'may', 'provide', 'a', 'new', 'way', 'to', 'improve', 'many', 'modeling', 'tasks']] | [-0.054055057171737975, 0.013869878500468613, -0.0670402651617986, 0.06206784385649823, -0.12358414489336265, -0.14620884370509973, 0.05866219378177724, 0.3558105905974133, -0.31807418946199906, -0.34423739133368, 0.09697183787169063, -0.21118798622896212, -0.17124930632760552, 0.19307661874318113, -0.08103376139904031, 0.12246071979958818, 0.0847015796368074, 0.03884057534778323, -0.10505263463258512, -0.2679712170596171, 0.28296716431060354, 0.07046911785934375, 0.2893523554034207, -0.05285157570441872, 0.17667945286024778, 0.02145607379516037, -0.021851021851418736, 0.009603252481475403, -0.060087987623807994, 0.1352723669361971, 0.26124090608991196, 0.1924482787444447, 0.31858264598185604, -0.41529340015273103, -0.2294406042092983, 0.12700950293888494, 0.13615631785891627, 0.13030442518401913, 3.966740113813199e-05, -0.2772205566339519, 0.051809469327585116, -0.1365414266445622, -0.06100285539160604, -0.0993427162630605, -0.039613768840150804, -0.018113804379512804, -0.3355624374545972, 0.02990025734262807, 0.06808771351236642, -0.006738347446788912, -0.05366563033283636, -0.10152405898971772, -0.007343809304018476, 0.14221788384399944, 0.0113519585470131, 0.06839379369460555, 0.0784921004691433, -0.12923572814635795, -0.0986353590685342, 0.40589055746377256, -0.060540142524061924, -0.25345710128175547, 0.15556223325789992, -0.0669313288143379, -0.08314764248612135, 0.13505779610518714, 0.24269752721562518, 0.08238060928314277, -0.10951096009398356, 0.10724910904338109, -0.013655873981553206, 0.20160897015969945, -0.00591550163508202, 0.022009432370780232, 0.1323714984366844, 0.24965306223798195, 0.09666991919266082, 0.15888688154735528, -0.08835444322885563, -0.07272657497514108, -0.2828690469241846, -0.13889016719211056, -0.171406072431377, -0.05723302067483064, -0.10440826889142678, -0.15812085921766225, 0.4102269196882844, 0.178408749625, 0.21675324460537815, 0.10021999248257196, 0.36352604322181725, 0.13824049045951092, 0.05472163968431758, 0.08982861231468757, 0.21182968186052598, 0.05330371978744772, 0.0961956571185996, -0.21598663751863129, 0.08864578623353556, 0.07077758875530885] |
1,802.00175 | Hot spots of solutions to the heat equation with inverse square
potential | We investigate the large time behavior of the hot spots of the solution to
the Cauchy problem for the heat equation with a potential $\partial_t u-\Delta
u+V(|x|)u=0$, where $V=V(r)$ decays quadratically as $r\to\infty$. In this
paper, based on the arguments in [K. Ishige and A. Mukai, preprint
(arXiv:1709.00809)], we classify the large time behavior of the hot spots of
$u$ and reveal the relationship between the behavior of the hot spots and the
harmonic functions for $-\Delta+V$.
| math.AP | we investigate the large time behavior of the hot spots of the solution to the cauchy problem for the heat equation with a potential partial_t udelta uvxu0 where vvr decays quadratically as rtoinfty in this paper based on the arguments in k ishige and a mukai preprint arxiv170900809 we classify the large time behavior of the hot spots of u and reveal the relationship between the behavior of the hot spots and the harmonic functions for deltav | [['we', 'investigate', 'the', 'large', 'time', 'behavior', 'of', 'the', 'hot', 'spots', 'of', 'the', 'solution', 'to', 'the', 'cauchy', 'problem', 'for', 'the', 'heat', 'equation', 'with', 'a', 'potential', 'partial_t', 'udelta', 'uvxu0', 'where', 'vvr', 'decays', 'quadratically', 'as', 'rtoinfty', 'in', 'this', 'paper', 'based', 'on', 'the', 'arguments', 'in', 'k', 'ishige', 'and', 'a', 'mukai', 'preprint', 'arxiv170900809', 'we', 'classify', 'the', 'large', 'time', 'behavior', 'of', 'the', 'hot', 'spots', 'of', 'u', 'and', 'reveal', 'the', 'relationship', 'between', 'the', 'behavior', 'of', 'the', 'hot', 'spots', 'and', 'the', 'harmonic', 'functions', 'for', 'deltav']] | [-0.156952615512686, 0.109628936260108, -0.07347112578163678, 0.026593401038553566, -0.06118799312468115, -0.0905366020176459, 0.050960788928047826, 0.273430519350301, -0.29713960496608066, -0.23816704402702885, 0.10745235469909636, -0.37666241731494665, -0.11224789665760221, 0.1598344995251643, -0.019650221726781613, 0.04804445196547218, 0.022246732231783303, 0.02994736366766832, -0.05089288260598944, -0.19342142355349465, 0.3631761923158617, -0.01662131816752859, 0.19624369689011695, 0.1280454096283663, 0.0620242771377938, -0.036994542674841105, 0.005938454417864213, -0.010471061602033474, -0.16604801141216444, 0.051864963350502925, 0.18757394900092403, 0.03676432040771721, 0.2935016584154722, -0.42134355622771624, -0.20342712624099207, 0.13733548582909075, 0.11393021434746883, 0.02676617109997047, -0.03232478818107346, -0.2801029198375103, 0.051380268285504065, -0.0734047110230234, -0.16363122519357381, -0.013831524175239375, 0.07672321333902309, 0.08660546413660553, -0.2777444696355913, 0.14340850447833137, 0.07184793412012073, 0.047102389680976804, -0.09635468442984102, -0.10078529019311473, 0.007643508743746458, 0.0783202673270795, 0.08751064588038905, 0.03589299111627042, 0.04902934270432672, -0.14451088927799483, -0.022740683408227522, 0.3982141932246049, -0.15172009718780582, -0.15601982558901245, 0.1582603542153044, -0.2067047681319653, -0.09043913622814659, 0.08879027135097547, 0.21959285108322227, 0.18875327605653452, -0.11471770847266591, 0.10356235224517642, -0.061662375725604394, 0.14298557034517462, 0.049220884508277114, 0.018330170250673954, 0.16366616201058432, 0.15398974534174478, 0.05914629533543956, 0.15621108523840588, -0.10694186448283191, -0.07419665310708051, -0.29911725643418124, -0.16113479083051552, -0.16590553583778642, 0.05497092955015801, -0.06682751960741715, -0.18877109307150758, 0.418123869175041, 0.10917265172040946, 0.26848715689738056, 0.04955467229356637, 0.25942450673696965, 0.1365152065299225, 0.0006058224401361233, 0.14356015296023641, 0.1699234765538996, 0.13213513713216762, 0.17743880668579526, -0.3174766483842521, -0.004541218727575363, 0.07936321599157276] |
1,802.00176 | Perceptual Compressive Sensing | Compressive sensing (CS) works to acquire measurements at sub-Nyquist rate
and recover the scene images. Existing CS methods always recover the scene
images in pixel level. This causes the smoothness of recovered images and lack
of structure information, especially at a low measurement rate. To overcome
this drawback, in this paper, we propose perceptual CS to obtain high-level
structured recovery. Our task no longer focuses on pixel level. Instead, we
work to make a better visual effect. In detail, we employ perceptual loss,
defined on feature level, to enhance the structure information of the recovered
images. Experiments show that our method achieves better visual results with
stronger structure information than existing CS methods at the same measurement
rate.
| cs.CV | compressive sensing cs works to acquire measurements at subnyquist rate and recover the scene images existing cs methods always recover the scene images in pixel level this causes the smoothness of recovered images and lack of structure information especially at a low measurement rate to overcome this drawback in this paper we propose perceptual cs to obtain highlevel structured recovery our task no longer focuses on pixel level instead we work to make a better visual effect in detail we employ perceptual loss defined on feature level to enhance the structure information of the recovered images experiments show that our method achieves better visual results with stronger structure information than existing cs methods at the same measurement rate | [['compressive', 'sensing', 'cs', 'works', 'to', 'acquire', 'measurements', 'at', 'subnyquist', 'rate', 'and', 'recover', 'the', 'scene', 'images', 'existing', 'cs', 'methods', 'always', 'recover', 'the', 'scene', 'images', 'in', 'pixel', 'level', 'this', 'causes', 'the', 'smoothness', 'of', 'recovered', 'images', 'and', 'lack', 'of', 'structure', 'information', 'especially', 'at', 'a', 'low', 'measurement', 'rate', 'to', 'overcome', 'this', 'drawback', 'in', 'this', 'paper', 'we', 'propose', 'perceptual', 'cs', 'to', 'obtain', 'highlevel', 'structured', 'recovery', 'our', 'task', 'no', 'longer', 'focuses', 'on', 'pixel', 'level', 'instead', 'we', 'work', 'to', 'make', 'a', 'better', 'visual', 'effect', 'in', 'detail', 'we', 'employ', 'perceptual', 'loss', 'defined', 'on', 'feature', 'level', 'to', 'enhance', 'the', 'structure', 'information', 'of', 'the', 'recovered', 'images', 'experiments', 'show', 'that', 'our', 'method', 'achieves', 'better', 'visual', 'results', 'with', 'stronger', 'structure', 'information', 'than', 'existing', 'cs', 'methods', 'at', 'the', 'same', 'measurement', 'rate']] | [-0.03748084298508652, -0.016616801814160358, -0.06233270592214066, 0.04590240009109316, -0.08023756253533065, -0.1405715524787241, 0.04248518968825781, 0.45264612163527534, -0.2902323424666173, -0.3379652622645184, 0.08366654067540984, -0.25211968541666235, -0.1672947005116207, 0.1240734503509761, -0.19383298131337356, 0.04762548462377261, 0.11664371415222916, 0.059199350009972264, -0.14978311900878166, -0.2529034612372802, 0.25643539654832903, 0.1313636164650542, 0.368193120869287, 0.006180318021136573, 0.14068906396722136, -0.007169201449191166, -0.06741381494991355, -0.03607609598123926, -0.08330973970411015, 0.17932095236571158, 0.3357129594058556, 0.18071623155652036, 0.2572610207924114, -0.4372738160003545, -0.26899748839540566, 0.05258909384798953, 0.1195572905456529, 0.13818705574435702, -0.07014380961111984, -0.310044112638965, 0.13844969569926419, -0.08169089200890671, -0.0007639520654111501, -0.08729434107682842, -0.08461727286783695, -0.1072705295114478, -0.3063963995570656, 0.11399807537298144, 0.0841174593976683, 0.08513298456288748, -0.06732340881372091, -0.12050543634726082, 0.04052519853526758, 0.1588521691954742, 0.01796811281987545, 0.07006408792789197, 0.18385001709605803, -0.18920838199279635, -0.07752209590053406, 0.3754934757253376, -0.08934646661719406, -0.21321044183509835, 0.20186216695928724, -0.17306386518007996, -0.1476194935740303, 0.1585054291171511, 0.19971004798534817, 0.11507432712873412, -0.12391932475552263, -0.022915189914845355, -0.009336606394183837, 0.24062381181629153, 0.08505618986397413, 0.11195788826789486, 0.1352500804439503, 0.18771998867613532, 0.0686488795820308, 0.11980360713432212, -0.17805744717450087, -0.007563141845482386, -0.1806714994185683, -0.08931412069537377, -0.19752767367951446, -0.03299673850316617, -0.07574838233723945, -0.08248704332479481, 0.36345933818937104, 0.28735533379555, 0.2500087578435156, 0.08018551119682142, 0.4176765946766077, 0.05401589808358132, 0.10534568385899824, 0.03093992680325015, 0.23052089203196435, 0.045107353032740244, 0.13047496568445133, -0.1769547194293779, 0.07597158154299072, 0.04821080879024151] |
1,802.00177 | Black Hole Entropy production and Transport coefficients in Lovelock
Gravity | We study the entropy evolution of black holes in Lovelock gravity by
formulating a thermodynamic generalization of null Raychaudhuri equation. We
show that the similarity between the expressions of entropy change of the black
hole horizon due to perturbation and that of a fluid, which is out of
equilibrium, transcends beyond general relativity to the Lovelock class of
theories. Exploiting this analogy we find that the shear and bulk viscosities
for the black holes in Lovelock theories exactly match with those obtained in
the membrane paradigm and also from holographic considerations.
| gr-qc hep-th | we study the entropy evolution of black holes in lovelock gravity by formulating a thermodynamic generalization of null raychaudhuri equation we show that the similarity between the expressions of entropy change of the black hole horizon due to perturbation and that of a fluid which is out of equilibrium transcends beyond general relativity to the lovelock class of theories exploiting this analogy we find that the shear and bulk viscosities for the black holes in lovelock theories exactly match with those obtained in the membrane paradigm and also from holographic considerations | [['we', 'study', 'the', 'entropy', 'evolution', 'of', 'black', 'holes', 'in', 'lovelock', 'gravity', 'by', 'formulating', 'a', 'thermodynamic', 'generalization', 'of', 'null', 'raychaudhuri', 'equation', 'we', 'show', 'that', 'the', 'similarity', 'between', 'the', 'expressions', 'of', 'entropy', 'change', 'of', 'the', 'black', 'hole', 'horizon', 'due', 'to', 'perturbation', 'and', 'that', 'of', 'a', 'fluid', 'which', 'is', 'out', 'of', 'equilibrium', 'transcends', 'beyond', 'general', 'relativity', 'to', 'the', 'lovelock', 'class', 'of', 'theories', 'exploiting', 'this', 'analogy', 'we', 'find', 'that', 'the', 'shear', 'and', 'bulk', 'viscosities', 'for', 'the', 'black', 'holes', 'in', 'lovelock', 'theories', 'exactly', 'match', 'with', 'those', 'obtained', 'in', 'the', 'membrane', 'paradigm', 'and', 'also', 'from', 'holographic', 'considerations']] | [-0.13942274908729635, 0.08370129634104259, -0.11093740803854805, 0.10218580008822155, -0.05995021731807636, -0.14133271076562967, 0.015244194214324375, 0.22082932579464146, -0.20126992069021032, -0.2999956654077703, 0.0389576260202595, -0.32572868011973716, -0.1730388491081872, 0.13503205416990177, -0.05989926584208241, 0.05173220566299918, -0.027056577440177264, 0.03919046171582662, -0.14755115118952325, -0.22279306888023193, 0.4028275962509624, 0.08589886883683093, 0.25861483149148606, 0.02334864167394219, 0.09719436442233868, -0.03609753648781187, 0.02561023344214146, 0.15270582349090786, -0.21732188993417287, 0.0956028965864699, 0.234133897466933, 0.11814381660647937, 0.18882461547196566, -0.4205796410953933, -0.2933978917445619, 0.04340934990342338, 0.09494976138607804, 0.2040426418387362, -0.0547561530243851, -0.23447646130040123, 0.05852737661532976, -0.23319230185678372, -0.13491384596512704, -0.07348317443649029, 0.04233056714164687, -0.059790165176369495, -0.18825799685769848, 0.1589976510382897, 0.08333779562387493, -0.05788762972784193, -0.13405503871963248, -0.007209367405656459, -0.06393290546999036, 0.06652747604300033, 0.17357481653983756, 0.000494480690826754, 0.15849979984021367, -0.16068461114939833, -0.1047247496464259, 0.4046233466079274, -0.09360138019853896, -0.22219387153265896, 0.16209805828703383, -0.2518049978118922, -0.1374456977400069, 0.060854797722300985, 0.12104551367727774, 0.20701136352599261, -0.16016075164489038, 0.12875191651215612, 0.008386689642505659, 0.13424342832973246, 0.1588119178253052, 0.04765246159481499, 0.37508186591523035, 0.06561924619369905, 0.004280328699438781, 0.1808729319536424, 0.013008454292603246, -0.14697766855133923, -0.35642492728164565, -0.20239372549906046, -0.1743966732788217, 0.08572442012398944, -0.20233477270285022, -0.17819697980431246, 0.2949090607177753, 0.1460948528595279, 0.11014093880178305, 0.09603674395731394, 0.19914234959135654, 0.08351358032406686, 0.021552916948816607, 0.09446438313410668, 0.3618952972138976, 0.14715936365742033, 0.14062564386883852, -0.282323694909452, -0.054478491546463344, 0.1549962361069437] |
1,802.00178 | Theory of spin and lattice wave dynamics excited by focused laser pulses | We develop a theory of the spin wave dynamics excited by ultrafast focused
laser pulses in a magnetic film. We take into account both volume and surface
spin wave modes in the presence of applied, dipolar and magnetic anisotropy
fields and include the dependence on laser spot exposure size and magnetic
damping. We show that the sound waves generated by local heating by an
ultrafast focused laser pulse can excite a wide spectrum of spin waves (on top
of a dominant magnon-phonon contribution). Good agreement with recent
experiments supports the validity of the model.
| cond-mat.mes-hall | we develop a theory of the spin wave dynamics excited by ultrafast focused laser pulses in a magnetic film we take into account both volume and surface spin wave modes in the presence of applied dipolar and magnetic anisotropy fields and include the dependence on laser spot exposure size and magnetic damping we show that the sound waves generated by local heating by an ultrafast focused laser pulse can excite a wide spectrum of spin waves on top of a dominant magnonphonon contribution good agreement with recent experiments supports the validity of the model | [['we', 'develop', 'a', 'theory', 'of', 'the', 'spin', 'wave', 'dynamics', 'excited', 'by', 'ultrafast', 'focused', 'laser', 'pulses', 'in', 'a', 'magnetic', 'film', 'we', 'take', 'into', 'account', 'both', 'volume', 'and', 'surface', 'spin', 'wave', 'modes', 'in', 'the', 'presence', 'of', 'applied', 'dipolar', 'and', 'magnetic', 'anisotropy', 'fields', 'and', 'include', 'the', 'dependence', 'on', 'laser', 'spot', 'exposure', 'size', 'and', 'magnetic', 'damping', 'we', 'show', 'that', 'the', 'sound', 'waves', 'generated', 'by', 'local', 'heating', 'by', 'an', 'ultrafast', 'focused', 'laser', 'pulse', 'can', 'excite', 'a', 'wide', 'spectrum', 'of', 'spin', 'waves', 'on', 'top', 'of', 'a', 'dominant', 'magnonphonon', 'contribution', 'good', 'agreement', 'with', 'recent', 'experiments', 'supports', 'the', 'validity', 'of', 'the', 'model']] | [-0.17197892646567817, 0.23852855395764097, -0.05440127981351094, 0.04456385298374486, -0.0599409523320959, -0.049932420273569034, -0.001046697942272542, 0.41712437254039847, -0.22225120954928881, -0.28436221091195624, 0.013008190329468988, -0.2558377366413937, -0.07442164604373752, 0.2698577930432487, 0.09486165416347696, 0.01988609278316986, 0.016103954708322564, -0.05793873457475863, 0.015947354969845964, -0.13737673577951623, 0.27331458399210995, 0.05220220967361882, 0.3226412572759263, 0.09188715994675109, 0.09968269759531509, 0.06752882748743162, 0.0486481979568588, 0.001157722772752985, -0.13655260705893446, 0.061372440556024616, 0.18457228305967563, -0.014459767569589646, 0.2417584905559395, -0.5516114056585951, -0.28670312861287767, -0.021467491607875266, 0.11829987560656477, 0.17309878234493922, -0.11065435414004357, -0.2950162112123353, -0.012351791552723722, -0.1431584928204563, -0.12406547938131708, -0.0817157267791001, 0.010539498105843334, 0.05696235483195236, -0.27058298317121066, 0.06401401483503348, 0.08983993226726678, 0.07596200576765423, -0.10202219450667976, -0.033281723725946344, -0.06570760558973601, 0.03218480363547643, 0.08210810009722024, 0.07442582311836923, 0.1764360087245029, -0.1369489709192768, -0.10496034962620507, 0.3441286537043275, -0.1539210992211357, -0.12615059490781277, 0.1409497155381882, -0.20963018323651494, -0.0241417814283929, 0.2034619582737697, 0.20811836750672616, 0.12348610219208801, -0.0712713809049827, 0.05257723942904317, 0.012671707346948715, 0.24990008690176493, 0.10078932018950582, 0.05530471379174839, 0.302006482632157, 0.20149503002299907, 0.011174560695430859, 0.1494343990529392, -0.15177129424657634, -0.01191767298200346, -0.24062588198935275, -0.07506838156544465, -0.1750574591866833, 0.04224064670586116, -0.02621108015808475, -0.13040508073259224, 0.46548958267382484, 0.1786931520724233, 0.11856156216557831, -0.05027633763730843, 0.29246160403845156, 0.1274474552588567, 0.02645691989009526, 0.03338309726182451, 0.28042214941926935, 0.20840363044717766, 0.08520832655832489, -0.3142159491618897, 0.031178336532320827, -0.02473855793396843] |
1,802.00179 | Full Image Recover for Block-Based Compressive Sensing | Recent years, compressive sensing (CS) has improved greatly for the
application of deep learning technology. For convenience, the input image is
usually measured and reconstructed block by block. This usually causes block
effect in reconstructed images. In this paper, we present a novel CNN-based
network to solve this problem. In measurement part, the input image is
adaptively measured block by block to acquire a group of measurements. While in
reconstruction part, all the measurements from one image are used to
reconstruct the full image at the same time. Different from previous method
recovering block by block, the structure information destroyed in measurement
part is recovered in our framework. Block effect is removed accordingly. We
train the proposed framework by mean square error (MSE) loss function.
Experiments show that there is no block effect at all in the proposed method.
And our results outperform 1.8 dB compared with existing methods.
| cs.CV | recent years compressive sensing cs has improved greatly for the application of deep learning technology for convenience the input image is usually measured and reconstructed block by block this usually causes block effect in reconstructed images in this paper we present a novel cnnbased network to solve this problem in measurement part the input image is adaptively measured block by block to acquire a group of measurements while in reconstruction part all the measurements from one image are used to reconstruct the full image at the same time different from previous method recovering block by block the structure information destroyed in measurement part is recovered in our framework block effect is removed accordingly we train the proposed framework by mean square error mse loss function experiments show that there is no block effect at all in the proposed method and our results outperform 18 db compared with existing methods | [['recent', 'years', 'compressive', 'sensing', 'cs', 'has', 'improved', 'greatly', 'for', 'the', 'application', 'of', 'deep', 'learning', 'technology', 'for', 'convenience', 'the', 'input', 'image', 'is', 'usually', 'measured', 'and', 'reconstructed', 'block', 'by', 'block', 'this', 'usually', 'causes', 'block', 'effect', 'in', 'reconstructed', 'images', 'in', 'this', 'paper', 'we', 'present', 'a', 'novel', 'cnnbased', 'network', 'to', 'solve', 'this', 'problem', 'in', 'measurement', 'part', 'the', 'input', 'image', 'is', 'adaptively', 'measured', 'block', 'by', 'block', 'to', 'acquire', 'a', 'group', 'of', 'measurements', 'while', 'in', 'reconstruction', 'part', 'all', 'the', 'measurements', 'from', 'one', 'image', 'are', 'used', 'to', 'reconstruct', 'the', 'full', 'image', 'at', 'the', 'same', 'time', 'different', 'from', 'previous', 'method', 'recovering', 'block', 'by', 'block', 'the', 'structure', 'information', 'destroyed', 'in', 'measurement', 'part', 'is', 'recovered', 'in', 'our', 'framework', 'block', 'effect', 'is', 'removed', 'accordingly', 'we', 'train', 'the', 'proposed', 'framework', 'by', 'mean', 'square', 'error', 'mse', 'loss', 'function', 'experiments', 'show', 'that', 'there', 'is', 'no', 'block', 'effect', 'at', 'all', 'in', 'the', 'proposed', 'method', 'and', 'our', 'results', 'outperform', '18', 'db', 'compared', 'with', 'existing', 'methods']] | [-0.038659492060667114, 0.0063379180833272285, -0.049101074113691814, 0.006997892204922118, -0.02458824631350776, -0.14835299949642997, -0.0020903790839979014, 0.411299249547965, -0.3082020295496355, -0.3259360277712745, 0.14993500086750786, -0.26993042033090686, -0.18170290927858962, 0.15602064481155084, -0.11172630036899807, 0.08036937759001583, 0.12797516090139097, 0.04621969807843034, -0.1082562276571614, -0.2737528370965222, 0.2544467620810981, 0.08160995157578517, 0.3500652689230472, -0.019178535163421308, 0.12925965688191354, 0.03687712807058288, -0.08433625655836308, 0.0074930488117876766, -0.0705111398982863, 0.105684179177464, 0.29675324886237214, 0.15352344684548286, 0.26822191818254754, -0.4168215922373753, -0.24177705768445795, 0.06887985852659499, 0.15867183940960156, 0.15186700126587493, -0.07949429350801987, -0.29084353975251614, 0.14413578752990838, -0.15074849883781982, -0.023819917119139392, -0.03639644654170804, -0.05054447899538174, -0.07988371413815204, -0.3014340469501944, 0.08203904858584073, 0.045508572903630515, 0.02792834878692891, -0.03633240720057147, -0.15488875384798786, 0.06362144401196966, 0.15295016784345944, 0.03094875946134679, 0.0829002722846219, 0.16586484852553213, -0.10173599821970104, -0.08380730784398148, 0.3417138333028829, -0.10349275929159515, -0.2120435548658739, 0.10653847010943714, -0.09564772328586886, -0.11848978104769883, 0.16011662295106924, 0.19832328538529126, 0.09801951035757193, -0.14893497507308215, 0.03327558807413025, -0.03434177738733139, 0.17060241654152739, 0.04382369468682414, 0.02560444032435849, 0.13871748542144344, 0.1812452676896656, 0.05850173786107526, 0.1424562484596312, -0.14297606730396115, -0.03209325648069182, -0.2201620802836455, -0.11166953826135637, -0.25407579049136764, -0.03816825142067751, -0.07373415934052412, -0.08391017319897077, 0.41318677502040496, 0.21224593823063093, 0.21208492213010088, 0.06970976369342947, 0.3795511734315613, 0.060610979936091894, 0.15614426760323308, 0.07420940178090193, 0.24362302313389994, 0.10793057535837511, 0.10559390196397013, -0.1798709969305052, 0.08087095521443567, 0.08617488322654526] |
1,802.0018 | Machine learning and evolutionary techniques in interplanetary
trajectory design | After providing a brief historical overview on the synergies between
artificial intelligence research, in the areas of evolutionary computations and
machine learning, and the optimal design of interplanetary trajectories, we
propose and study the use of deep artificial neural networks to represent,
on-board, the optimal guidance profile of an interplanetary mission. The
results, limited to the chosen test case of an Earth-Mars orbital transfer,
extend the findings made previously for landing scenarios and quadcopter
dynamics, opening a new research area in interplanetary trajectory planning.
| cs.NE cs.SY | after providing a brief historical overview on the synergies between artificial intelligence research in the areas of evolutionary computations and machine learning and the optimal design of interplanetary trajectories we propose and study the use of deep artificial neural networks to represent onboard the optimal guidance profile of an interplanetary mission the results limited to the chosen test case of an earthmars orbital transfer extend the findings made previously for landing scenarios and quadcopter dynamics opening a new research area in interplanetary trajectory planning | [['after', 'providing', 'a', 'brief', 'historical', 'overview', 'on', 'the', 'synergies', 'between', 'artificial', 'intelligence', 'research', 'in', 'the', 'areas', 'of', 'evolutionary', 'computations', 'and', 'machine', 'learning', 'and', 'the', 'optimal', 'design', 'of', 'interplanetary', 'trajectories', 'we', 'propose', 'and', 'study', 'the', 'use', 'of', 'deep', 'artificial', 'neural', 'networks', 'to', 'represent', 'onboard', 'the', 'optimal', 'guidance', 'profile', 'of', 'an', 'interplanetary', 'mission', 'the', 'results', 'limited', 'to', 'the', 'chosen', 'test', 'case', 'of', 'an', 'earthmars', 'orbital', 'transfer', 'extend', 'the', 'findings', 'made', 'previously', 'for', 'landing', 'scenarios', 'and', 'quadcopter', 'dynamics', 'opening', 'a', 'new', 'research', 'area', 'in', 'interplanetary', 'trajectory', 'planning']] | [-0.13393765335647567, 0.10384411269201553, -0.07635792823913064, 0.06460433384580981, -0.12102522862897742, -0.10696472182115983, 0.0471128884070952, 0.41472409878458294, -0.24862464622683114, -0.3774788455061969, 0.08461785757459611, -0.23744042232144802, -0.21649284725121798, 0.24075006531174517, -0.11116602880481098, 0.08099187460417549, 0.12152722176341783, -0.03778909510445027, -0.03411614585396213, -0.24313129196386962, 0.23762305287389263, 0.13705311059484734, 0.280982827590335, -0.0025419972371309996, 0.12162175030624937, 0.014917586054209443, -0.05694667875788929, -0.04885269823439774, -0.15572573898160563, 0.19770204123952204, 0.2722629791103481, 0.23098239685697036, 0.3351267725451007, -0.4889688018177237, -0.24322339033131443, 0.04494898896553509, 0.10854095417363126, 0.04411462077405304, -0.05822107518075167, -0.34517285688724814, -0.01504389640952771, -0.16181902630653763, -0.1412383954351147, -0.054387806194080485, 0.0524102884754982, 0.047021258122792155, -0.23426487652856545, -0.0958328965020233, 0.01112198814128836, 0.14297628424884307, -0.160748450645423, -0.10337624515107434, 0.056121831150015906, 0.19862661739101722, 0.06551456066959613, 0.07311862841015682, 0.16747274873445608, -0.15808016312907316, -0.15550445504708305, 0.346927862791788, -0.011005992557676066, -0.13582630068274393, 0.17277252635990625, -0.054150175680184646, -0.13935236197098025, 0.0744865119534855, 0.27681841026545345, 0.0946739954718699, -0.16244995801909162, 0.022144542582931796, 0.01707391894333774, 0.1259792667627889, -0.0025961987876577212, -0.02627509878948331, 0.2616211740227993, 0.25453169138303827, 0.10136548121504131, 0.12932756124341505, -0.15836980094900355, -0.16283266468062288, -0.2613998298932399, -0.15813871164850535, -0.13341587175437736, 0.030077547835563087, -0.06200184993975286, -0.11788059418488826, 0.3830739171355076, 0.22439376045007348, 0.16327841106491783, 0.025586293988107217, 0.34215934018027927, -0.02175698841788939, 0.03847279248847848, 0.0775032172040526, 0.2675551197802027, 0.04314043732093913, 0.20147259800606185, -0.1943790940678723, 0.08427021453999692, 0.01994401085401131] |
1,802.00181 | Magnetic and magnetocaloric properties of the exactly solvable
mixed-spin Ising model on a decorated triangular lattice in a magnetic field | The ground state, zero-temperature magnetization process, critical behaviour
and isothermal entropy change of the mixed-spin Ising model on a decorated
triangular lattice in a magnetic field are exactly studied after performing the
generalized decoration-iteration mapping transformation. It is shown that both
the inverse and conventional magnetocaloric effect can be found near the
absolute zero temperature. The former phenomenon can be found in a vicinity of
the discontinuous phase transitions and their crossing, while the latter one
occurs in some paramagnetic phases due to a spin frustration to be present at
zero magnetic field. The inverse magnetocaloric effect can also be detected
slightly above continuous phase transitions following the power-law dependence
$|-\Delta{\cal S}_{iso}^{min}|\propto h^n$, where $n$ depends basically on the
ground-state spin ordering.
| cond-mat.stat-mech | the ground state zerotemperature magnetization process critical behaviour and isothermal entropy change of the mixedspin ising model on a decorated triangular lattice in a magnetic field are exactly studied after performing the generalized decorationiteration mapping transformation it is shown that both the inverse and conventional magnetocaloric effect can be found near the absolute zero temperature the former phenomenon can be found in a vicinity of the discontinuous phase transitions and their crossing while the latter one occurs in some paramagnetic phases due to a spin frustration to be present at zero magnetic field the inverse magnetocaloric effect can also be detected slightly above continuous phase transitions following the powerlaw dependence deltacal s_isominpropto hn where n depends basically on the groundstate spin ordering | [['the', 'ground', 'state', 'zerotemperature', 'magnetization', 'process', 'critical', 'behaviour', 'and', 'isothermal', 'entropy', 'change', 'of', 'the', 'mixedspin', 'ising', 'model', 'on', 'a', 'decorated', 'triangular', 'lattice', 'in', 'a', 'magnetic', 'field', 'are', 'exactly', 'studied', 'after', 'performing', 'the', 'generalized', 'decorationiteration', 'mapping', 'transformation', 'it', 'is', 'shown', 'that', 'both', 'the', 'inverse', 'and', 'conventional', 'magnetocaloric', 'effect', 'can', 'be', 'found', 'near', 'the', 'absolute', 'zero', 'temperature', 'the', 'former', 'phenomenon', 'can', 'be', 'found', 'in', 'a', 'vicinity', 'of', 'the', 'discontinuous', 'phase', 'transitions', 'and', 'their', 'crossing', 'while', 'the', 'latter', 'one', 'occurs', 'in', 'some', 'paramagnetic', 'phases', 'due', 'to', 'a', 'spin', 'frustration', 'to', 'be', 'present', 'at', 'zero', 'magnetic', 'field', 'the', 'inverse', 'magnetocaloric', 'effect', 'can', 'also', 'be', 'detected', 'slightly', 'above', 'continuous', 'phase', 'transitions', 'following', 'the', 'powerlaw', 'dependence', 'deltacal', 's_isominpropto', 'hn', 'where', 'n', 'depends', 'basically', 'on', 'the', 'groundstate', 'spin', 'ordering']] | [-0.15580130034330308, 0.2565874598674045, -0.07100176058463321, 0.056289028083453506, -0.06588018018452158, -0.15772775417455465, 0.0658878283555935, 0.37135280219237665, -0.2902037528774524, -0.2689523628858988, 0.08684391890987292, -0.29257009313095456, -0.1066675272929335, 0.1455812388319091, 0.0673219761156962, 0.009516299124961058, -0.05566912991464261, 0.08416001328598123, -0.1459242973980794, -0.19211920078705289, 0.26511767139458214, 0.005971514852958046, 0.3057485875050145, 0.07253694891052181, 0.0285926912218517, -0.016160308441131813, 0.14991262750238304, 0.07061403294955958, -0.13423492113535518, -0.05260606308675502, 0.21038008596717325, -0.06931288406437586, 0.15088291279201912, -0.3744501162720613, -0.21041748678111585, 0.1419238975494792, 0.1593165766747961, 0.10846936356176214, -0.02203064579093321, -0.29009466199974016, 0.0035953983926206583, -0.1257733591555133, -0.1318767699538076, -0.08632564887958617, -0.016369188933687145, -0.023768839311366516, -0.24380021754840836, 0.12433789473027351, 0.12256623878651722, 0.118284939605481, -0.0654984085189471, -0.12985884723800026, -0.07155001497912136, 0.06615247750993479, 0.05397913938129421, 0.07800189490730236, 0.1602553633803671, -0.09304414771897487, -0.09604602366347205, 0.3560340924973577, -0.033363316962418475, -0.11700155179452609, 0.1297090323334021, -0.20968688259198048, -0.11249686219952693, 0.18597074932118585, 0.09272402561315882, 0.10018947662801043, -0.11647905248471281, 0.10287180815271126, 0.03623838559531969, 0.15992841229212185, 0.0217665278291222, -0.027267073919950438, 0.24575836586906413, 0.12117533833327249, 0.03977435984656461, 0.21870285879497317, -0.10769765499271144, -0.1516881542634373, -0.23634527197246216, -0.14172716527284424, -0.24472164009382164, 0.07959647610021586, -0.10475699132857248, -0.1804357845120205, 0.3679615523635356, 0.14183393194944374, 0.19835422526706348, -0.032731067578785494, 0.2342750461972203, 0.17479029042292232, 0.027742449704111237, 0.042930205622957324, 0.26727739193266037, 0.1670979985867219, 0.13424717372645092, -0.3229789816531976, 0.09158198221024773, 0.07547427497781074] |
1,802.00182 | Modeling and control of permanent-magnet synchronous generators under
open-switch converter faults | The mathematical modeling of open-switch faults in two-level machine-side
converters and the fault-tolerant current control of isotropic permanent-magnet
synchronous generators are discussed. The proposed converter model is generic
for any open-switch fault and independent of the operation mode of the
electrical machine. The proposed fault-tolerant current control system gives
improved control performance and reduced torque ripple under open-switch faults
by (i) modifying the anti-windup strategy, (ii) adapting the space-vector
modulation scheme and (iii) by injecting additional reference currents. The
theoretical derivations of model and control are validated by comparative
simulation and measurement results.
| cs.SY | the mathematical modeling of openswitch faults in twolevel machineside converters and the faulttolerant current control of isotropic permanentmagnet synchronous generators are discussed the proposed converter model is generic for any openswitch fault and independent of the operation mode of the electrical machine the proposed faulttolerant current control system gives improved control performance and reduced torque ripple under openswitch faults by i modifying the antiwindup strategy ii adapting the spacevector modulation scheme and iii by injecting additional reference currents the theoretical derivations of model and control are validated by comparative simulation and measurement results | [['the', 'mathematical', 'modeling', 'of', 'openswitch', 'faults', 'in', 'twolevel', 'machineside', 'converters', 'and', 'the', 'faulttolerant', 'current', 'control', 'of', 'isotropic', 'permanentmagnet', 'synchronous', 'generators', 'are', 'discussed', 'the', 'proposed', 'converter', 'model', 'is', 'generic', 'for', 'any', 'openswitch', 'fault', 'and', 'independent', 'of', 'the', 'operation', 'mode', 'of', 'the', 'electrical', 'machine', 'the', 'proposed', 'faulttolerant', 'current', 'control', 'system', 'gives', 'improved', 'control', 'performance', 'and', 'reduced', 'torque', 'ripple', 'under', 'openswitch', 'faults', 'by', 'i', 'modifying', 'the', 'antiwindup', 'strategy', 'ii', 'adapting', 'the', 'spacevector', 'modulation', 'scheme', 'and', 'iii', 'by', 'injecting', 'additional', 'reference', 'currents', 'the', 'theoretical', 'derivations', 'of', 'model', 'and', 'control', 'are', 'validated', 'by', 'comparative', 'simulation', 'and', 'measurement', 'results']] | [-0.19571354117689896, 0.0752525239393277, 0.009601386350012668, -0.04378026809338379, -0.03619293221171298, -0.24218924984376392, 0.07658705755855645, 0.33905085141811037, -0.2386373636191306, -0.31144088858981495, 0.10864630029106553, -0.2050510152121601, -0.11940127544854161, 0.24155784594704924, -0.10174162252603666, 0.1318821426400024, 0.05310559917716486, -0.044579445705850325, -0.019802060919692336, -0.19130123999860624, 0.22562510968924945, 0.13027238829628282, 0.3782591831404716, -0.04153047606624845, 0.11111206995606747, 0.031048550946212818, -0.045564332192399255, -0.008875566963346817, -0.0907888486576469, 0.08215138881781098, 0.2327964020204609, 0.11105870722554834, 0.19941344383456136, -0.47226222371682525, -0.19717463113952166, 0.022106663736454008, 0.08216388877886145, 0.12253649208856665, -0.0683935057958993, -0.28785694307526166, 0.12755965889158213, -0.22158208889279352, -0.059629584956185325, -0.09362810172909952, -0.0111862171584305, 0.06504738230622657, -0.2795941883434906, 0.021687561696719215, 0.12463803935553068, 0.09940983601035955, -0.0870449140607177, -0.09772342513694995, -0.026040419531257256, 0.08109634877283774, -0.0439076242391425, -0.009171321947613487, 0.2264508918211188, -0.0915045325047053, -0.20210975452083285, 0.30957317613470164, -0.0039036258847614668, -0.23459323721370942, 0.11983392456718518, -0.01862082711380461, -0.05800375879967443, 0.10322688999535191, 0.1595269902508058, 0.02710036288076283, -0.17419973329600433, 0.06688805554775805, 0.06999566001215261, 0.15024393258373375, 0.011517184876340805, -0.008209046788776861, 0.16084808483972904, 0.2235882566108004, 0.05181270129674965, 0.13322474573910964, -0.07499271963024512, -0.10464296255351814, -0.3163931404351783, -0.11147344853025457, -0.1233259521474753, -0.009085941433390279, -0.06796763928097156, -0.11334385627718724, 0.44493355428806786, 0.18850462787541683, 0.06499925735609038, 0.028428207637499207, 0.38876441624218033, 0.13908833841813487, 0.05282773914665956, 0.09529063857221247, 0.251810600940624, 0.13184658116812858, 0.079106614459306, -0.2896515280109547, 0.0967823761824073, -0.005047781995254691] |
1,802.00183 | The H$\alpha$ and H$\beta$ Raman-scattering line profiles of the
symbiotic star AG Peg | The H$\alpha$ and H$\beta$ line profiles of the symbiotic star AG Peg
observed on 1998 September (phase $\phi$ = 10.24), display the top narrow
double Gaussian and bottom broad (FWHM of 200 -- 400 kms$^{-1}$) components.
The photo-ionization model indicated that the ionized zone, responsible for the
hydrogen Balmer and Lyman lines, is radiation-bounded, with a hydrogen gas
number density of $n_{\rm H} \sim 10^{9.85}$ cm$^{-3}$ and a gas temperature of
T$_e$ = 12\,000 -- 15\,000~K. We carried out Monte Carlo simulations to fit the
Raman scattering broad wings, assuming that the hydrogen Ly$\beta$ and
Ly$\gamma$ lines emitted within the radiation-bounded HII zone around a white
dwarf have the same double Gaussian line profile shape as the hydrogen Balmer
lines. The simulation shows that the scattering HI zones are attached to (or
located just outside of) the inner HII shells. The best fit to the observed
broad HI line profiles indicates that the column density of the scattering
neutral zone is $N_{\rm H} \simeq $ 3 -- 5 $\times$ 10$^{19}$ cm$^{-2}$. We
examined whether the geometrical structure responsible for the observed
H$\alpha$ and H$\beta$ line profiles is a bipolar conical shell structure,
consisting of the radiation-bounded ionized zone and the outer material bounded
neutral zone. The expanding bipolar structure might be two opposite regions of
the common envelope or the outer shell of the Roche lobe around the hot white
dwarf, formed through the mass inflows from the giant star and pushed out by
the fast winds from the hot white dwarf.
| astro-ph.SR | the halpha and hbeta line profiles of the symbiotic star ag peg observed on 1998 september phase phi 1024 display the top narrow double gaussian and bottom broad fwhm of 200 400 kms1 components the photoionization model indicated that the ionized zone responsible for the hydrogen balmer and lyman lines is radiationbounded with a hydrogen gas number density of n_rm h sim 10985 cm3 and a gas temperature of t_e 12000 15000k we carried out monte carlo simulations to fit the raman scattering broad wings assuming that the hydrogen lybeta and lygamma lines emitted within the radiationbounded hii zone around a white dwarf have the same double gaussian line profile shape as the hydrogen balmer lines the simulation shows that the scattering hi zones are attached to or located just outside of the inner hii shells the best fit to the observed broad hi line profiles indicates that the column density of the scattering neutral zone is n_rm h simeq 3 5 times 1019 cm2 we examined whether the geometrical structure responsible for the observed halpha and hbeta line profiles is a bipolar conical shell structure consisting of the radiationbounded ionized zone and the outer material bounded neutral zone the expanding bipolar structure might be two opposite regions of the common envelope or the outer shell of the roche lobe around the hot white dwarf formed through the mass inflows from the giant star and pushed out by the fast winds from the hot white dwarf | [['the', 'halpha', 'and', 'hbeta', 'line', 'profiles', 'of', 'the', 'symbiotic', 'star', 'ag', 'peg', 'observed', 'on', '1998', 'september', 'phase', 'phi', '1024', 'display', 'the', 'top', 'narrow', 'double', 'gaussian', 'and', 'bottom', 'broad', 'fwhm', 'of', '200', '400', 'kms1', 'components', 'the', 'photoionization', 'model', 'indicated', 'that', 'the', 'ionized', 'zone', 'responsible', 'for', 'the', 'hydrogen', 'balmer', 'and', 'lyman', 'lines', 'is', 'radiationbounded', 'with', 'a', 'hydrogen', 'gas', 'number', 'density', 'of', 'n_rm', 'h', 'sim', '10985', 'cm3', 'and', 'a', 'gas', 'temperature', 'of', 't_e', '12000', '15000k', 'we', 'carried', 'out', 'monte', 'carlo', 'simulations', 'to', 'fit', 'the', 'raman', 'scattering', 'broad', 'wings', 'assuming', 'that', 'the', 'hydrogen', 'lybeta', 'and', 'lygamma', 'lines', 'emitted', 'within', 'the', 'radiationbounded', 'hii', 'zone', 'around', 'a', 'white', 'dwarf', 'have', 'the', 'same', 'double', 'gaussian', 'line', 'profile', 'shape', 'as', 'the', 'hydrogen', 'balmer', 'lines', 'the', 'simulation', 'shows', 'that', 'the', 'scattering', 'hi', 'zones', 'are', 'attached', 'to', 'or', 'located', 'just', 'outside', 'of', 'the', 'inner', 'hii', 'shells', 'the', 'best', 'fit', 'to', 'the', 'observed', 'broad', 'hi', 'line', 'profiles', 'indicates', 'that', 'the', 'column', 'density', 'of', 'the', 'scattering', 'neutral', 'zone', 'is', 'n_rm', 'h', 'simeq', '3', '5', 'times', '1019', 'cm2', 'we', 'examined', 'whether', 'the', 'geometrical', 'structure', 'responsible', 'for', 'the', 'observed', 'halpha', 'and', 'hbeta', 'line', 'profiles', 'is', 'a', 'bipolar', 'conical', 'shell', 'structure', 'consisting', 'of', 'the', 'radiationbounded', 'ionized', 'zone', 'and', 'the', 'outer', 'material', 'bounded', 'neutral', 'zone', 'the', 'expanding', 'bipolar', 'structure', 'might', 'be', 'two', 'opposite', 'regions', 'of', 'the', 'common', 'envelope', 'or', 'the', 'outer', 'shell', 'of', 'the', 'roche', 'lobe', 'around', 'the', 'hot', 'white', 'dwarf', 'formed', 'through', 'the', 'mass', 'inflows', 'from', 'the', 'giant', 'star', 'and', 'pushed', 'out', 'by', 'the', 'fast', 'winds', 'from', 'the', 'hot', 'white', 'dwarf']] | [-0.0497229226413468, 0.11800011922510303, 0.02487237988686075, 0.0561446034633412, -0.032010920444617466, -0.11092613188606897, 0.07431779881863265, 0.43998492804108835, -0.1607180684503187, -0.2834439960555459, 0.024388302210718395, -0.3254285281067904, 0.015093037060328893, 0.1437350857518233, 0.05367925018683903, -0.07107050214342925, 0.031997488319104046, -0.10060622316989477, -0.05288197971638102, -0.17602514290554944, 0.2808147068800671, 0.09038299285065458, 0.15644759486942572, 0.030026524395881486, -0.0008035225470607378, -0.12485196337826093, -0.04719426114758363, -0.04421575223760946, -0.15341084256485504, 0.017765359567212206, 0.203723523880911, 0.08032030165765662, 0.19849044259694615, -0.3803399646464659, -0.22507445381156035, 0.02277682419291374, 0.21928409771727664, -0.021066200158413862, -0.03179535490071059, -0.2902655308039821, 0.004267196266018614, -0.19158262445458343, -0.22348014804515606, 0.14588236673735083, 0.06370083470163601, 0.020971569364738405, -0.2168788053359057, 0.12726783154874433, 0.028280066561942197, 0.08812619511332667, -0.0678512877467497, -0.1197671486007772, -0.14224134603971425, 0.01665118724269298, -0.017250998867485597, 0.016302378115134922, 0.2919082087445624, -0.09149857652681727, 0.0635471157444527, 0.3894982988449593, -0.13438188266769355, 0.05192710345240348, 0.20100900978135058, -0.2371514736256581, -0.10111727716819364, 0.3137070875472332, 0.0923859886996144, 0.1125376713889822, -0.08904635928338393, 0.019493200837121326, -0.09784102987174934, 0.21495147647302865, 0.09389983342808424, -0.00515560538279919, 0.35402656785611597, 0.0452068591167276, -0.007618361447340267, 0.08202051206453874, -0.31464632017233846, -0.071067338734295, -0.24560131540602756, -0.10660170116283627, -0.08151549257775198, 0.05877239922802819, -0.12092620036849866, -0.17709767954918196, 0.3364367865025997, 0.05398257331048348, 0.2683434777427465, -0.04223913205502441, 0.3116233255714178, 0.11698457641165931, 0.07999158940487067, 0.17384784641884723, 0.26814488315460633, 0.26068032629483817, 0.1020263671875, -0.24957127280305236, 0.06611769673490554, 0.013955117408744515] |
1,802.00184 | Wave equations associated to Liouville-type problems: global existence
in time and blow up criteria | We are concerned with wave equations associated to some Liouville-type
problems on compact surfaces, focusing on sinh-Gordon equation and general Toda
systems. Our aim is on one side to develop the analysis for wave equations
associated to the latter problems and second, to substantially refine the
analysis initiated in [11] concerning the mean field equation. In particular,
by exploiting the variational analysis recently derived for Liouville-type
problems we prove global existence in time for the sub-critical case and we
give general blow up criteria for the super-critical and critical case. The
strategy is mainly based on fixed point arguments and improved versions of the
Moser-Trudinger inequality.
| math.AP | we are concerned with wave equations associated to some liouvilletype problems on compact surfaces focusing on sinhgordon equation and general toda systems our aim is on one side to develop the analysis for wave equations associated to the latter problems and second to substantially refine the analysis initiated in 11 concerning the mean field equation in particular by exploiting the variational analysis recently derived for liouvilletype problems we prove global existence in time for the subcritical case and we give general blow up criteria for the supercritical and critical case the strategy is mainly based on fixed point arguments and improved versions of the mosertrudinger inequality | [['we', 'are', 'concerned', 'with', 'wave', 'equations', 'associated', 'to', 'some', 'liouvilletype', 'problems', 'on', 'compact', 'surfaces', 'focusing', 'on', 'sinhgordon', 'equation', 'and', 'general', 'toda', 'systems', 'our', 'aim', 'is', 'on', 'one', 'side', 'to', 'develop', 'the', 'analysis', 'for', 'wave', 'equations', 'associated', 'to', 'the', 'latter', 'problems', 'and', 'second', 'to', 'substantially', 'refine', 'the', 'analysis', 'initiated', 'in', '11', 'concerning', 'the', 'mean', 'field', 'equation', 'in', 'particular', 'by', 'exploiting', 'the', 'variational', 'analysis', 'recently', 'derived', 'for', 'liouvilletype', 'problems', 'we', 'prove', 'global', 'existence', 'in', 'time', 'for', 'the', 'subcritical', 'case', 'and', 'we', 'give', 'general', 'blow', 'up', 'criteria', 'for', 'the', 'supercritical', 'and', 'critical', 'case', 'the', 'strategy', 'is', 'mainly', 'based', 'on', 'fixed', 'point', 'arguments', 'and', 'improved', 'versions', 'of', 'the', 'mosertrudinger', 'inequality']] | [-0.12327277062917655, 0.01039595416096865, -0.05899758313624364, 0.10848268394947122, -0.08720104783149611, -0.14896323509022313, 0.02947112182506694, 0.2863165717308392, -0.24327116502659782, -0.2339728555448775, 0.19735841314804758, -0.27892524511377625, -0.1484392661038997, 0.24653547634107043, -0.057051167113899764, 0.09635244325717103, 0.056552137584284935, 0.0207919979749142, -0.09457847655460871, -0.2488912889769055, 0.4266417335261995, -0.02595796604763787, 0.25083424925874426, 0.07663102834463506, 0.07569620335246173, 0.03575144670870735, -0.028842687229010858, -0.0029176586210938557, -0.21693128524436, 0.1333255704562619, 0.20239092478142032, 0.06867237987198849, 0.2662908401480823, -0.42830702285545896, -0.2416594883312805, 0.09988677631712185, 0.13487310372545594, 0.1158342587702275, -0.05379305857470927, -0.3095963621854712, 0.0979107131584073, -0.05092561563898651, -0.23248941154342215, -0.04991978446443407, -0.004052911326069526, 0.07757657684192483, -0.2564592190385568, 0.11866481666110526, 0.07853602806000777, 0.03434578650015986, -0.14738476072725804, -0.10823104491255264, 0.023760573834154475, 0.04852183857264946, 0.06798384545089782, 0.033828862815357325, 0.032611847031457385, -0.12512115708482013, -0.11220775092600511, 0.34597115879351237, -0.07153236058118911, -0.24570226988245575, 0.1957358090242125, -0.12221923939233541, -0.20511334588013166, 0.10133616840752405, 0.21901746193070035, 0.15688783772078888, -0.11734423880412612, 0.10756006092437156, -0.018179536524463778, 0.12547697357197493, 0.09134278276425628, -0.03600389715437865, 0.0997066871144475, 0.13326987434169804, 0.13226571983991647, 0.1503352905087665, -0.005216061921223541, -0.15389546633364176, -0.3292922481437618, -0.13849414262990906, -0.11184725177118485, 0.07365950883584721, -0.0867100376233553, -0.13224120216690144, 0.36291490650937874, 0.1335092125688943, 0.1224154081494319, 0.07407176585314479, 0.2068797714463523, 0.20197884704069816, -0.02038167779615181, 0.08025719526768574, 0.23942628716923656, 0.1947820648959539, 0.14060000972031564, -0.18458433324094414, -0.02137194427591309, 0.18826417585962257] |
1,802.00185 | Spatio-temporal transfer function conditions of positive realness for
translation invariant lattice networks of interacting linear systems | This paper is concerned with networks of interacting linear systems at sites
of a multidimensional lattice. The systems are governed by linear ODEs with
constant coefficients driven by external inputs, and their internal dynamics
and coupling with the other component systems are translation invariant. Such
systems occur, for example, in finite-difference models of large-scale flexible
structures manufactured from homogeneous materials. Using the spatio-temporal
transfer function of this translation invariant network, we establish
conditions for its positive realness in the sense of energy dissipation. The
latter is formulated in terms of block Toeplitz bilinear forms of the input and
output variables of the composite system. We also discuss quadratic stability
of the network in isolation from the environment and phonon theoretic
dispersion relations.
| cs.SY math.DS math.OC | this paper is concerned with networks of interacting linear systems at sites of a multidimensional lattice the systems are governed by linear odes with constant coefficients driven by external inputs and their internal dynamics and coupling with the other component systems are translation invariant such systems occur for example in finitedifference models of largescale flexible structures manufactured from homogeneous materials using the spatiotemporal transfer function of this translation invariant network we establish conditions for its positive realness in the sense of energy dissipation the latter is formulated in terms of block toeplitz bilinear forms of the input and output variables of the composite system we also discuss quadratic stability of the network in isolation from the environment and phonon theoretic dispersion relations | [['this', 'paper', 'is', 'concerned', 'with', 'networks', 'of', 'interacting', 'linear', 'systems', 'at', 'sites', 'of', 'a', 'multidimensional', 'lattice', 'the', 'systems', 'are', 'governed', 'by', 'linear', 'odes', 'with', 'constant', 'coefficients', 'driven', 'by', 'external', 'inputs', 'and', 'their', 'internal', 'dynamics', 'and', 'coupling', 'with', 'the', 'other', 'component', 'systems', 'are', 'translation', 'invariant', 'such', 'systems', 'occur', 'for', 'example', 'in', 'finitedifference', 'models', 'of', 'largescale', 'flexible', 'structures', 'manufactured', 'from', 'homogeneous', 'materials', 'using', 'the', 'spatiotemporal', 'transfer', 'function', 'of', 'this', 'translation', 'invariant', 'network', 'we', 'establish', 'conditions', 'for', 'its', 'positive', 'realness', 'in', 'the', 'sense', 'of', 'energy', 'dissipation', 'the', 'latter', 'is', 'formulated', 'in', 'terms', 'of', 'block', 'toeplitz', 'bilinear', 'forms', 'of', 'the', 'input', 'and', 'output', 'variables', 'of', 'the', 'composite', 'system', 'we', 'also', 'discuss', 'quadratic', 'stability', 'of', 'the', 'network', 'in', 'isolation', 'from', 'the', 'environment', 'and', 'phonon', 'theoretic', 'dispersion', 'relations']] | [-0.19594289099255607, 0.11515941635560488, -0.020176521994814765, 0.040421615258340156, -0.028508308473363764, -0.13719032527726205, -0.006637048891356185, 0.3572317832225903, -0.34290710416790404, -0.2639884809184758, 0.10927754527980797, -0.257586590947152, -0.191728850792269, 0.18834573336586843, -0.013515059687349885, 0.10753478297770985, 0.046718150862019324, 0.02631075225091066, -0.07022466902529485, -0.22092837538020532, 0.3923356670382448, 0.03349244436554489, 0.272373676000184, -0.02866772472568345, 0.1409655066329192, 0.005606644963425752, -0.02344220565807563, -0.0008966226729976594, -0.08664879771369341, 0.15120600771061604, 0.23837879837098075, 0.050272415178354644, 0.23911127415256667, -0.4275422992535913, -0.22077923046699802, 0.07016292251799194, 0.09964651052580505, 0.08621541003040115, -0.022119328112448336, -0.26652074578508245, 0.056430741256202156, -0.16692535249806453, -0.12460885929004824, -0.0825808570991255, 0.0006081283657399357, 0.07800156462815452, -0.2874509432795839, 0.10619261220921038, 0.09319852805146794, 0.12264229008378308, -0.09972118440210118, -0.07748374762872356, -0.04272624631565003, 0.11530332875315893, 0.012731810844671286, -0.025824240615904392, 0.12727550447052038, -0.14505484221564208, -0.10009020471995024, 0.39672899441640885, -0.08634596622022266, -0.26479536301044165, 0.2228699768588069, -0.09255662245950738, -0.11418700772032264, 0.0850583345697979, 0.22234097863623842, 0.08966102530477477, -0.1618488691441837, 0.10835027844133618, -0.015524191980357052, 0.1551138890036916, 0.03537976277656243, 0.06326402696307565, 0.19449393838533338, 0.16315439517884592, 0.04232019825731633, 0.17604866255214055, 0.021951755446040253, -0.12142764874943913, -0.26848291882054237, -0.13397282492903778, -0.16411351484292355, 0.02644769862946886, -0.09069566325557449, -0.16355470584736007, 0.3801181192212112, 0.08903638732650118, 0.1692361825252654, 0.07122200544060925, 0.25442027673125267, 0.169607439612756, 0.07168031447246427, 0.06926838406285302, 0.1995453693384885, 0.1554715723757342, 0.1206498619085025, -0.22438497608145852, 0.05684848701138599, 0.06881796890014752] |
1,802.00186 | Weakly solutions to the complex Monge-Amp\`ere equation on bounded
plurifinely hyperconvex domains | Let $\mu$ be a non-negative measure defined on bounded $\mathcal
F$-hyperconvex domain $\Omega$. We are interested in giving sufficient
conditions on $\mu$ such that we can find a plurifinely plurisubharmonic
function satisfying $NP (dd^c u)^n =\mu$ in $QB(\Omega)$.
| math.CV | let mu be a nonnegative measure defined on bounded mathcal fhyperconvex domain omega we are interested in giving sufficient conditions on mu such that we can find a plurifinely plurisubharmonic function satisfying np ddc un mu in qbomega | [['let', 'mu', 'be', 'a', 'nonnegative', 'measure', 'defined', 'on', 'bounded', 'mathcal', 'fhyperconvex', 'domain', 'omega', 'we', 'are', 'interested', 'in', 'giving', 'sufficient', 'conditions', 'on', 'mu', 'such', 'that', 'we', 'can', 'find', 'a', 'plurifinely', 'plurisubharmonic', 'function', 'satisfying', 'np', 'ddc', 'un', 'mu', 'in', 'qbomega']] | [-0.21828159167327815, 0.13271182734105322, -0.05243545985366735, 0.07136229311840402, -0.09161191588241814, -0.17723036878224877, 0.015039106119527586, 0.3600067259329889, -0.2858429822760324, -0.1403217305843201, 0.05459299475316786, -0.26841551531106234, -0.08488534496993655, 0.1474255345625958, -0.1448996280087158, 0.041718806701990414, 0.01209206136667894, 0.08318264473281387, -0.07209322792348555, -0.1868804934848514, 0.3895363719461279, -0.1683813334028754, 0.16265459224167797, 0.16377887036651373, 0.06938857556734648, -0.04465248058032659, 0.028220343112479895, 0.017415076927540615, -0.3092559055086086, -0.0031719282657528916, 0.27147570211026406, 0.20934594231140283, 0.25210615154355764, -0.3385376528215905, -0.11533509297037704, 0.3298707852825626, 0.15703770131545347, -0.19626601919945744, -0.015251920852784274, -0.3170008255272276, 0.20097611078785527, -0.03653532153920322, -0.12998940399847925, -0.09144800717735456, 0.08943749891801013, 0.06170733935303158, -0.4688281846853594, 0.0234792351257056, 0.043962098761565156, 0.05100651773520642, -0.06169319439989825, -0.1795529433681319, -0.05509293208726578, 0.011852652571784953, -0.08703797698641817, 0.19657920132805076, 0.10443822126318184, 0.005462756199348304, -0.022743417881429195, 0.3501998183265742, -0.19937028704831997, -0.4017806189755599, 0.15475275784006548, -0.2453196320372323, -0.13356448087789533, 0.012371928638054265, 0.17310132853324628, 0.1874902419383741, -0.08006433898117393, 0.32280532989857924, -0.08673788332897756, 0.1199586025128762, 0.14544397953432053, 0.05901030633443346, 0.14647747783197296, 0.1114439025728239, 0.1944125487449734, 0.10334028673241846, 0.08658696169085386, 0.062220459829808936, -0.3810359508626991, -0.097750183660537, -0.19092061828511456, 0.23565023583877417, -0.05769755872380403, -0.17598062355278266, 0.2902697580349114, 0.0028297018596074646, 0.20699534601428443, 0.14913287060335279, 0.133712746306426, 0.17382870468201064, 0.004304401657362986, 0.051757638860079974, 0.015710191904670663, 0.11095068317243001, 0.04377130918308265, -0.16527087008580565, 0.040733136961029634, 0.0707168390262167] |
1,802.00187 | Clustering and Unsupervised Anomaly Detection with L2 Normalized Deep
Auto-Encoder Representations | Clustering is essential to many tasks in pattern recognition and computer
vision. With the advent of deep learning, there is an increasing interest in
learning deep unsupervised representations for clustering analysis. Many works
on this domain rely on variants of auto-encoders and use the encoder outputs as
representations/features for clustering. In this paper, we show that an l2
normalization constraint on these representations during auto-encoder training,
makes the representations more separable and compact in the Euclidean space
after training. This greatly improves the clustering accuracy when k-means
clustering is employed on the representations. We also propose a clustering
based unsupervised anomaly detection method using l2 normalized deep
auto-encoder representations. We show the effect of l2 normalization on anomaly
detection accuracy. We further show that the proposed anomaly detection method
greatly improves accuracy compared to previously proposed deep methods such as
reconstruction error based anomaly detection.
| cs.LG | clustering is essential to many tasks in pattern recognition and computer vision with the advent of deep learning there is an increasing interest in learning deep unsupervised representations for clustering analysis many works on this domain rely on variants of autoencoders and use the encoder outputs as representationsfeatures for clustering in this paper we show that an l2 normalization constraint on these representations during autoencoder training makes the representations more separable and compact in the euclidean space after training this greatly improves the clustering accuracy when kmeans clustering is employed on the representations we also propose a clustering based unsupervised anomaly detection method using l2 normalized deep autoencoder representations we show the effect of l2 normalization on anomaly detection accuracy we further show that the proposed anomaly detection method greatly improves accuracy compared to previously proposed deep methods such as reconstruction error based anomaly detection | [['clustering', 'is', 'essential', 'to', 'many', 'tasks', 'in', 'pattern', 'recognition', 'and', 'computer', 'vision', 'with', 'the', 'advent', 'of', 'deep', 'learning', 'there', 'is', 'an', 'increasing', 'interest', 'in', 'learning', 'deep', 'unsupervised', 'representations', 'for', 'clustering', 'analysis', 'many', 'works', 'on', 'this', 'domain', 'rely', 'on', 'variants', 'of', 'autoencoders', 'and', 'use', 'the', 'encoder', 'outputs', 'as', 'representationsfeatures', 'for', 'clustering', 'in', 'this', 'paper', 'we', 'show', 'that', 'an', 'l2', 'normalization', 'constraint', 'on', 'these', 'representations', 'during', 'autoencoder', 'training', 'makes', 'the', 'representations', 'more', 'separable', 'and', 'compact', 'in', 'the', 'euclidean', 'space', 'after', 'training', 'this', 'greatly', 'improves', 'the', 'clustering', 'accuracy', 'when', 'kmeans', 'clustering', 'is', 'employed', 'on', 'the', 'representations', 'we', 'also', 'propose', 'a', 'clustering', 'based', 'unsupervised', 'anomaly', 'detection', 'method', 'using', 'l2', 'normalized', 'deep', 'autoencoder', 'representations', 'we', 'show', 'the', 'effect', 'of', 'l2', 'normalization', 'on', 'anomaly', 'detection', 'accuracy', 'we', 'further', 'show', 'that', 'the', 'proposed', 'anomaly', 'detection', 'method', 'greatly', 'improves', 'accuracy', 'compared', 'to', 'previously', 'proposed', 'deep', 'methods', 'such', 'as', 'reconstruction', 'error', 'based', 'anomaly', 'detection']] | [-0.03476193411673497, -0.046346564804480295, -0.09919300340859788, 0.07291638888030623, -0.12071646434196737, -0.12323866699524741, -0.010527713944611605, 0.4682394976585379, -0.27534353473068524, -0.32733069448214436, 0.09919162396302757, -0.2711021730210632, -0.24541340122555588, 0.18310036228892082, -0.14054090808106898, 0.10496341513418075, 0.16311596249256077, 0.10611508842784032, -0.12499617432331434, -0.31439408195567214, 0.3060470518895373, 0.06818899668724043, 0.39823956597441185, 0.020065813994733617, 0.142196602091038, 0.030673174617630947, -0.058614172817518316, -0.042620748174966944, -0.03169077908761311, 0.18945768005343983, 0.30917754258876406, 0.21414958031770462, 0.30193002081392073, -0.3476608565833885, -0.2685091648414123, 0.14546514482289138, 0.22259656259686583, 0.09842289744928065, -0.0774417729202873, -0.358487893620299, 0.07391878247532684, -0.1446600269862554, 0.0764572724648234, -0.18191805386514817, -0.035496058815624565, -0.04320125689911139, -0.267881677350993, 0.08337509304995668, 0.09806911000568005, 0.05542427924228832, -0.09514165996936047, -0.1450908227901285, 0.09517069036115168, 0.09023680946625569, 0.04296969742831101, 0.08946769369908401, 0.1245889022700592, -0.21325811057047556, -0.14083842100485022, 0.3107179296332308, -0.1026829569956236, -0.22453206328565203, 0.20990722514236243, -0.005500357440420582, -0.2379982973183764, 0.07857986082348765, 0.23301054447397795, 0.1139148070037158, -0.09658663672568461, 0.040863173650399806, -0.01773003495246586, 0.1764592161044776, 0.05773370976223507, -0.018256575559563417, 0.10632555147054114, 0.2999948680759796, 0.08662940076747974, 0.12009678729049887, -0.1810143329575011, 0.0038730565461769905, -0.21985088486690074, -0.09850444884634474, -0.226492054144425, -0.05069429186389445, -0.12876493731780808, -0.1380907861684035, 0.37260173393102985, 0.23855009372992855, 0.24585530070099695, 0.12759263940905738, 0.36213807779778207, 0.05983108614843028, 0.14858857046541138, 0.11339677629520237, 0.22167692925480273, 0.048158840353911124, 0.07543366596413155, -0.19112871331486125, 0.05898368115756764, 0.11784475427379625] |
1,802.00188 | Enhancing photon squeezing one Leviton at a time | A mesoscopic device in the simple tunnel junction or quantum point contact
geometry emits microwaves with remarkable quantum properties, when subjected to
a sinusoidal drive in the GHz range. In particular, single and two-photon
squeezing as well as entanglement in the frequency domain have been reported.
By revising the photo-assisted noise analysis developed in the framework of
electron quantum optics, we present a detailed comparison between the cosine
drive case and other experimentally relavent periodic voltages such as
rectangular and Lorentzian pulses. We show that the latter drive is the best
candidate in order to enhance quantum features and purity of the outgoing
single and two-photon states, a noteworthy result in a quantum information
perspective.
| cond-mat.mes-hall | a mesoscopic device in the simple tunnel junction or quantum point contact geometry emits microwaves with remarkable quantum properties when subjected to a sinusoidal drive in the ghz range in particular single and twophoton squeezing as well as entanglement in the frequency domain have been reported by revising the photoassisted noise analysis developed in the framework of electron quantum optics we present a detailed comparison between the cosine drive case and other experimentally relavent periodic voltages such as rectangular and lorentzian pulses we show that the latter drive is the best candidate in order to enhance quantum features and purity of the outgoing single and twophoton states a noteworthy result in a quantum information perspective | [['a', 'mesoscopic', 'device', 'in', 'the', 'simple', 'tunnel', 'junction', 'or', 'quantum', 'point', 'contact', 'geometry', 'emits', 'microwaves', 'with', 'remarkable', 'quantum', 'properties', 'when', 'subjected', 'to', 'a', 'sinusoidal', 'drive', 'in', 'the', 'ghz', 'range', 'in', 'particular', 'single', 'and', 'twophoton', 'squeezing', 'as', 'well', 'as', 'entanglement', 'in', 'the', 'frequency', 'domain', 'have', 'been', 'reported', 'by', 'revising', 'the', 'photoassisted', 'noise', 'analysis', 'developed', 'in', 'the', 'framework', 'of', 'electron', 'quantum', 'optics', 'we', 'present', 'a', 'detailed', 'comparison', 'between', 'the', 'cosine', 'drive', 'case', 'and', 'other', 'experimentally', 'relavent', 'periodic', 'voltages', 'such', 'as', 'rectangular', 'and', 'lorentzian', 'pulses', 'we', 'show', 'that', 'the', 'latter', 'drive', 'is', 'the', 'best', 'candidate', 'in', 'order', 'to', 'enhance', 'quantum', 'features', 'and', 'purity', 'of', 'the', 'outgoing', 'single', 'and', 'twophoton', 'states', 'a', 'noteworthy', 'result', 'in', 'a', 'quantum', 'information', 'perspective']] | [-0.12006509071011749, 0.14505661192366429, -0.0560009816054892, 0.020776799550124753, -0.022231608253429857, -0.21326092939023256, 0.057192701252030305, 0.4123133530742244, -0.237356631005624, -0.28946510991571767, 0.011126614591360027, -0.27346470848281396, -0.15635702322980619, 0.2544156593625973, -0.01528681553655157, 0.10297333899877247, 0.04104743351579823, 0.01418579511115687, -0.0372102477060827, -0.1447416087571662, 0.26421768201531415, 0.043108343064025244, 0.321562500123196, 0.05774605088344399, 0.09346963475017171, 0.016695533289365766, 0.052974531484212266, -0.0067141377530469185, -0.09485042726514062, 0.025547036653478516, 0.25684068759641887, 0.004791186066556787, 0.23124672102807253, -0.43398080529285626, -0.23403422723181153, 0.0499650041956716, 0.10358235253258036, 0.1609201781664109, -0.05975934957958791, -0.3051708069478832, 0.016220605108078177, -0.16805752450110098, -0.11505486336618401, -0.06820031112517443, -0.0009950365658784122, 0.02394810475392692, -0.223637154566843, 0.06651040020229279, 0.0858941269015256, 0.05528209355185952, 0.010152697289493261, -0.026808754117697838, 0.007237590040619436, 0.11504818986117914, -0.05658545599343549, 0.02318896508363092, 0.1673675624147188, -0.13602373426322611, -0.16959660636310123, 0.3492589193486135, -0.09069678250990253, -0.1712025957347482, 0.16901631811797097, -0.1797368034328285, -0.0582603595276739, 0.0894528131139579, 0.12344706679792389, 0.07877513269991859, -0.1482908859063428, 0.04197259981076952, 0.0013151620718928282, 0.18134735204537783, 0.137805214331469, 0.11785787879489362, 0.2310063233353982, 0.13639529614725657, 0.04411835825732468, 0.2229647122067195, -0.13138940346247532, -0.12143730108724221, -0.29154288514696974, -0.15654290771814422, -0.2027992851166218, 0.0982081950759605, -0.04476098309762739, -0.15340176121772905, 0.4313362792722489, 0.12200110287225821, 0.1812499661321278, -0.06830391693827614, 0.3261718078140627, 0.15366901095094682, 0.05435341597420343, 0.01306821493288449, 0.2725856341278638, 0.16437619214207588, 0.11972788658826367, -0.2352949178148584, 0.015691231584928016, -0.03244690491670841] |
1,802.00189 | Propelled micro-probes in turbulence | The temporal statistics of incompressible fluid velocity and passive scalar
fields in developed turbulent conditions is investigated by means of direct
numerical simulations along the trajectories of self-propelled point-like
probes drifting in a flow. Such probes are characterised by a propulsion
velocity which is fixed in intensity and direction; however, like vessels in a
flow they are continuously deviated by their intended course as the result of
local sweeping of the fluid flow. The recorded time-series by these moving
probes represent the simplest realisation of transect measurements in a fluid
flow environment. We investigate the non trivial combination of Lagrangian and
Eulerian statistical properties displayed by the transect time-series. We show
that, as a result of the homogeneity and isotropy of the flow, the single-point
acceleration statistics of the probes follows a predictable trend at varying
the propulsion speed, a feature that is also present in the scalar
time-derivative fluctuations. Further, by focusing on two-time statistics we
characterize how the Lagrangian-to-Eulerian transition occurs at increasing the
propulsion velocity. The analysis of intermittency of temporal increments
highlights in a striking way the opposite trends displayed by the fluid
velocity and passive scalars.
| physics.flu-dyn physics.ao-ph | the temporal statistics of incompressible fluid velocity and passive scalar fields in developed turbulent conditions is investigated by means of direct numerical simulations along the trajectories of selfpropelled pointlike probes drifting in a flow such probes are characterised by a propulsion velocity which is fixed in intensity and direction however like vessels in a flow they are continuously deviated by their intended course as the result of local sweeping of the fluid flow the recorded timeseries by these moving probes represent the simplest realisation of transect measurements in a fluid flow environment we investigate the non trivial combination of lagrangian and eulerian statistical properties displayed by the transect timeseries we show that as a result of the homogeneity and isotropy of the flow the singlepoint acceleration statistics of the probes follows a predictable trend at varying the propulsion speed a feature that is also present in the scalar timederivative fluctuations further by focusing on twotime statistics we characterize how the lagrangiantoeulerian transition occurs at increasing the propulsion velocity the analysis of intermittency of temporal increments highlights in a striking way the opposite trends displayed by the fluid velocity and passive scalars | [['the', 'temporal', 'statistics', 'of', 'incompressible', 'fluid', 'velocity', 'and', 'passive', 'scalar', 'fields', 'in', 'developed', 'turbulent', 'conditions', 'is', 'investigated', 'by', 'means', 'of', 'direct', 'numerical', 'simulations', 'along', 'the', 'trajectories', 'of', 'selfpropelled', 'pointlike', 'probes', 'drifting', 'in', 'a', 'flow', 'such', 'probes', 'are', 'characterised', 'by', 'a', 'propulsion', 'velocity', 'which', 'is', 'fixed', 'in', 'intensity', 'and', 'direction', 'however', 'like', 'vessels', 'in', 'a', 'flow', 'they', 'are', 'continuously', 'deviated', 'by', 'their', 'intended', 'course', 'as', 'the', 'result', 'of', 'local', 'sweeping', 'of', 'the', 'fluid', 'flow', 'the', 'recorded', 'timeseries', 'by', 'these', 'moving', 'probes', 'represent', 'the', 'simplest', 'realisation', 'of', 'transect', 'measurements', 'in', 'a', 'fluid', 'flow', 'environment', 'we', 'investigate', 'the', 'non', 'trivial', 'combination', 'of', 'lagrangian', 'and', 'eulerian', 'statistical', 'properties', 'displayed', 'by', 'the', 'transect', 'timeseries', 'we', 'show', 'that', 'as', 'a', 'result', 'of', 'the', 'homogeneity', 'and', 'isotropy', 'of', 'the', 'flow', 'the', 'singlepoint', 'acceleration', 'statistics', 'of', 'the', 'probes', 'follows', 'a', 'predictable', 'trend', 'at', 'varying', 'the', 'propulsion', 'speed', 'a', 'feature', 'that', 'is', 'also', 'present', 'in', 'the', 'scalar', 'timederivative', 'fluctuations', 'further', 'by', 'focusing', 'on', 'twotime', 'statistics', 'we', 'characterize', 'how', 'the', 'lagrangiantoeulerian', 'transition', 'occurs', 'at', 'increasing', 'the', 'propulsion', 'velocity', 'the', 'analysis', 'of', 'intermittency', 'of', 'temporal', 'increments', 'highlights', 'in', 'a', 'striking', 'way', 'the', 'opposite', 'trends', 'displayed', 'by', 'the', 'fluid', 'velocity', 'and', 'passive', 'scalars']] | [-0.1650373273993242, 0.19745478104971545, -0.1356660874290882, 0.02931309394709962, -0.032101772985372104, -0.10312388545441392, -0.03246221907734013, 0.3499381083995104, -0.28504014785377013, -0.29106757723187143, 0.06705455300581985, -0.2576886052363797, -0.11838580746522272, 0.18307221812245092, -0.020991013137819734, 0.05579091663668422, 0.022844314114435722, 0.01359407551292526, -0.024492190365057658, -0.14620224148476202, 0.28077826446510457, 0.05400654093674874, 0.2889745540181665, -0.01659815472942826, 0.1295844828758977, -0.018263335388741996, -0.10455778899700625, 0.10429067969947171, -0.14681531657797198, 0.05698422617707892, 0.17604678394272924, 0.055967448248932336, 0.24792235538755591, -0.42658049990668107, -0.25142354592190763, 0.05276748141837551, 0.1534446664228055, 0.08018469376379232, -0.07282358222873882, -0.293685440194646, 0.0417709413033567, -0.1158510546426681, -0.17445888952107022, -0.050961255419411156, 0.015714761322842125, 0.09863827885434914, -0.21665480569323622, 0.14858946506972548, 0.065202121114922, 0.12513461005138724, -0.04708011351207173, -0.02440316440341504, -0.05667668498660389, 0.10924202799787484, 0.08325086697617448, -0.010643510071952876, 0.19776353213543954, -0.1968792537227273, -0.07541870013504338, 0.40271575929302916, -0.1088956037861001, -0.19651952856342847, 0.19832602683944922, -0.1687886601730593, -0.08566610017840408, 0.12698562903740246, 0.18617827139739682, 0.08950459036216336, -0.1330474173331535, 0.026020927571287183, -0.039235748081026894, 0.12173613682144174, 0.06772844276366462, -0.021919701840287367, 0.23368300173284584, 0.14655128238526613, 0.06182797179238773, 0.11148362894738584, -0.11025822046335394, -0.10050750473318132, -0.3142342040707406, -0.1554417408708679, -0.18833832513344914, 0.01718681550057801, -0.11606875837016177, -0.12950711619403016, 0.40582742744958716, 0.12826014155227888, 0.19328305130383294, 0.026800409594771306, 0.31537245708811834, 0.08344848437639149, 0.01240320823179852, 0.0914037933781449, 0.27690431708715074, 0.14629513431512015, 0.18777983140592514, -0.2230025267779925, 0.07408254609296197, 0.060715774656273425] |
1,802.0019 | Relations between the single-pass and double-pass transition
probabilities in quantum systems with two and three states | In the experimental determination of the population transfer efficiency
between discrete states of a coherently driven quantum system it is often
inconvenient to measure the population of the target state. Instead, after the
interaction that transfers the population from the initial state to the target
state, a second interaction is applied which brings the system back to the
initial state, the population of which is easy to measure and normalize. If the
transition probability is $p$ in the forward process, then classical intuition
suggests that the probability to return to the initial state after the backward
process should be $p^2$. However, this classical expectation is generally
misleading because it neglects interference effects. This paper presents a
rigorous theoretical analysis based on the SU(2) and SU(3) symmetries of the
propagators describing the evolution of quantum systems with two and three
states, resulting in explicit analytic formulas that link the two-step
probabilities to the single-step ones. Explicit examples are given with the
popular techniques of rapid adiabatic passage and stimulated Raman adiabatic
passage. The present results suggest that quantum-mechanical probabilities
degrade faster in repeated processes than classical probabilities. Therefore,
the actual single-pass efficiencies in various experiments, calculated from
double-pass probabilities, might have been greater than the reported values.
| quant-ph | in the experimental determination of the population transfer efficiency between discrete states of a coherently driven quantum system it is often inconvenient to measure the population of the target state instead after the interaction that transfers the population from the initial state to the target state a second interaction is applied which brings the system back to the initial state the population of which is easy to measure and normalize if the transition probability is p in the forward process then classical intuition suggests that the probability to return to the initial state after the backward process should be p2 however this classical expectation is generally misleading because it neglects interference effects this paper presents a rigorous theoretical analysis based on the su2 and su3 symmetries of the propagators describing the evolution of quantum systems with two and three states resulting in explicit analytic formulas that link the twostep probabilities to the singlestep ones explicit examples are given with the popular techniques of rapid adiabatic passage and stimulated raman adiabatic passage the present results suggest that quantummechanical probabilities degrade faster in repeated processes than classical probabilities therefore the actual singlepass efficiencies in various experiments calculated from doublepass probabilities might have been greater than the reported values | [['in', 'the', 'experimental', 'determination', 'of', 'the', 'population', 'transfer', 'efficiency', 'between', 'discrete', 'states', 'of', 'a', 'coherently', 'driven', 'quantum', 'system', 'it', 'is', 'often', 'inconvenient', 'to', 'measure', 'the', 'population', 'of', 'the', 'target', 'state', 'instead', 'after', 'the', 'interaction', 'that', 'transfers', 'the', 'population', 'from', 'the', 'initial', 'state', 'to', 'the', 'target', 'state', 'a', 'second', 'interaction', 'is', 'applied', 'which', 'brings', 'the', 'system', 'back', 'to', 'the', 'initial', 'state', 'the', 'population', 'of', 'which', 'is', 'easy', 'to', 'measure', 'and', 'normalize', 'if', 'the', 'transition', 'probability', 'is', 'p', 'in', 'the', 'forward', 'process', 'then', 'classical', 'intuition', 'suggests', 'that', 'the', 'probability', 'to', 'return', 'to', 'the', 'initial', 'state', 'after', 'the', 'backward', 'process', 'should', 'be', 'p2', 'however', 'this', 'classical', 'expectation', 'is', 'generally', 'misleading', 'because', 'it', 'neglects', 'interference', 'effects', 'this', 'paper', 'presents', 'a', 'rigorous', 'theoretical', 'analysis', 'based', 'on', 'the', 'su2', 'and', 'su3', 'symmetries', 'of', 'the', 'propagators', 'describing', 'the', 'evolution', 'of', 'quantum', 'systems', 'with', 'two', 'and', 'three', 'states', 'resulting', 'in', 'explicit', 'analytic', 'formulas', 'that', 'link', 'the', 'twostep', 'probabilities', 'to', 'the', 'singlestep', 'ones', 'explicit', 'examples', 'are', 'given', 'with', 'the', 'popular', 'techniques', 'of', 'rapid', 'adiabatic', 'passage', 'and', 'stimulated', 'raman', 'adiabatic', 'passage', 'the', 'present', 'results', 'suggest', 'that', 'quantummechanical', 'probabilities', 'degrade', 'faster', 'in', 'repeated', 'processes', 'than', 'classical', 'probabilities', 'therefore', 'the', 'actual', 'singlepass', 'efficiencies', 'in', 'various', 'experiments', 'calculated', 'from', 'doublepass', 'probabilities', 'might', 'have', 'been', 'greater', 'than', 'the', 'reported', 'values']] | [-0.08338805490051333, 0.15141909205110618, -0.12524173072611605, 0.09544946796956794, -0.041157513616145454, -0.11588969429529913, 0.10889599853346703, 0.377221508842251, -0.256942210993074, -0.2713105338806449, 0.07158449427021252, -0.2588547568325206, -0.09847408786271382, 0.18194503264809117, -0.026599135868874656, 0.07389327927298439, 0.09346109260612809, 0.06239598308626598, -0.058239175373512024, -0.1995969665851625, 0.3198515408439562, 0.07212035485782922, 0.3127415424384611, 0.008098542824776355, 0.08277257707917123, 0.007380113903053322, -0.001333132390728564, -0.062236566272862615, -0.08385995805709401, 0.09099141517863157, 0.23579031874220005, 0.11461310815043495, 0.2685665018965029, -0.460460858573251, -0.2098682258234052, 0.10414540403391442, 0.13223598202468953, 0.17322835610677642, -0.0315062126977758, -0.29766357215392647, 0.04154930566070213, -0.1614184196003107, -0.1154147217240076, -0.05253718374183998, 0.04715154776846972, -0.008309170045975813, -0.26774263507867396, 0.08177409686704247, 0.06766950244477327, 0.001104131860187214, -0.04250965597338577, -0.11102345422050436, -0.020927783739820884, 0.1250340345595936, 0.04597082446432148, 0.01682937189284486, 0.13659441877988357, -0.11633466419908535, -0.13353518273193135, 0.351688133955038, -0.037604367039624144, -0.17234719206649105, 0.18672570064370023, -0.16289032543489473, -0.08888528238783039, 0.16039013853341846, 0.12339158834114182, 0.11492200742602277, -0.14078799453880458, 0.02522225787939992, 0.021620778890227156, 0.16295353643645902, 0.02988320249652725, 0.021222565176182435, 0.16208915277022543, 0.10983670512056068, 0.026091029828253825, 0.13715070034931098, -0.06777652806220395, -0.20087033700993628, -0.28303665538924266, -0.1515080303380953, -0.17495960360325113, 0.08627478499248063, -0.04531048869604507, -0.13425197373133027, 0.3696934640818972, 0.17908203472678313, 0.21317217014142248, 0.03291213087335193, 0.3147407912850398, 0.1724007346224293, 0.009790244843421992, 0.03339613958836072, 0.26173890927564625, 0.11933663852729844, 0.06948958936789372, -0.23861083580314937, 0.12042604294126329, 0.042571819303738115] |
1,802.00191 | Powerful Solar Flares of September 2017: Correspondence Between
Parameters of Microwave Bursts and Proton Fluxes near Earth | In this note, we consider radio characteristics of three proton flares that
caused discrete enhancements of solar energetic particles (SEPs) near Earth.
The analysis confirmed that the flux density and frequency spectrum of
microwave bursts, although the latter are generated by electrons propagating to
the photosphere, reflect the number and energy spectrum of accelerated
particles, including the 10-100 MeV protons coming to Earth.
| astro-ph.SR | in this note we consider radio characteristics of three proton flares that caused discrete enhancements of solar energetic particles seps near earth the analysis confirmed that the flux density and frequency spectrum of microwave bursts although the latter are generated by electrons propagating to the photosphere reflect the number and energy spectrum of accelerated particles including the 10100 mev protons coming to earth | [['in', 'this', 'note', 'we', 'consider', 'radio', 'characteristics', 'of', 'three', 'proton', 'flares', 'that', 'caused', 'discrete', 'enhancements', 'of', 'solar', 'energetic', 'particles', 'seps', 'near', 'earth', 'the', 'analysis', 'confirmed', 'that', 'the', 'flux', 'density', 'and', 'frequency', 'spectrum', 'of', 'microwave', 'bursts', 'although', 'the', 'latter', 'are', 'generated', 'by', 'electrons', 'propagating', 'to', 'the', 'photosphere', 'reflect', 'the', 'number', 'and', 'energy', 'spectrum', 'of', 'accelerated', 'particles', 'including', 'the', '10100', 'mev', 'protons', 'coming', 'to', 'earth']] | [-0.11944111000509962, 0.33588422688522507, 0.018518240649312262, 0.15007909713128198, -0.030423536252263666, -0.025264969187056913, 0.02030668401765445, 0.38676863311538623, -0.21907688131822006, -0.38061748031112885, -0.032712298162680654, -0.3309496489782182, -0.024174118591915993, 0.22584049000094333, 0.03281928368267559, -0.05030804638943029, 0.11186275700668967, -0.03901415791303393, -0.01176042120815033, -0.116418836362076, 0.24600935270196744, 0.1892861026553585, 0.21438245012587498, 0.050836637113539, 0.0770584461205299, -0.08234955383361214, -0.03630184449462427, -0.03614647692764208, -0.059108418932910786, 0.10370166115980181, 0.1831982032292419, 0.07907101520825, 0.16069126007930626, -0.4933547731193285, -0.29426117850438, 0.1279013347959826, 0.1722511791675869, -0.02990535831832815, -0.07226913998879138, -0.26045468508724184, 0.05590564106029296, -0.1556253336843044, -0.19111018746884334, 0.09633566944726876, -0.01159668421106679, 0.07475483515078113, -0.21216657329055053, 0.11662974544165153, 0.033429374792687004, 0.047839914448559284, -0.1207808727058508, -0.07827533932314032, -0.0362292831201875, 0.04064751594578699, 0.2030539179483192, -0.00838057930389094, 0.22348041191608423, -0.05162798758551833, -0.07255937530112172, 0.39732481355941485, -0.032431740594643446, -0.028886502608656883, 0.1757225604609601, -0.2587440737138783, -0.11798426666341368, 0.25097866487940623, 0.18077513248112703, 0.054122337103185675, -0.1462554522505444, 0.022431620642439358, 0.008748856260411678, 0.1541645780117029, 0.12422572128799936, 0.08075489677370541, 0.26308450535945005, 0.08616671914101712, 0.010314344576308651, 0.07377835414889786, -0.21356190410110035, -0.007349878483052764, -0.2586001056002888, -0.0989161349855186, -0.18290667633511246, 0.09040768568899246, -0.04463250408760302, -0.1647608050732829, 0.4665189618096938, 0.14711378786772017, 0.1553257548117212, -0.04482972890966468, 0.29121626706586945, 0.10805914113445887, -0.002176067784487728, 0.1605408692377664, 0.33259734984428163, 0.14711989207001078, 0.15829476189341338, -0.22508609229846607, -0.019956700769918307, 0.030394783173318184] |
1,802.00192 | Non-symplectic automorphisms of odd prime order on manifolds of
$K3^{[n]}$-type | We classify non-symplectic automorphisms of odd prime order on irreducible
holomorphic symplectic manifolds which are deformations of Hilbert schemes of
any number n of points on K3 surfaces, extending results already known for n=2.
In order to do so, we study the properties of the invariant lattice of the
automorphism (and its orthogonal complement) inside the second cohomology
lattice of the manifold. We also explain how to construct automorphisms with
fixed action on cohomology: in the cases n=3,4 the examples provided allow to
realize all admissible actions in our classification. For n=4, we present a
construction of non-symplectic automorphisms on the Lehn-Lehn-Sorger-van
Straten eightfold, which come from automorphisms of the underlying cubic
fourfold.
| math.AG | we classify nonsymplectic automorphisms of odd prime order on irreducible holomorphic symplectic manifolds which are deformations of hilbert schemes of any number n of points on k3 surfaces extending results already known for n2 in order to do so we study the properties of the invariant lattice of the automorphism and its orthogonal complement inside the second cohomology lattice of the manifold we also explain how to construct automorphisms with fixed action on cohomology in the cases n34 the examples provided allow to realize all admissible actions in our classification for n4 we present a construction of nonsymplectic automorphisms on the lehnlehnsorgervan straten eightfold which come from automorphisms of the underlying cubic fourfold | [['we', 'classify', 'nonsymplectic', 'automorphisms', 'of', 'odd', 'prime', 'order', 'on', 'irreducible', 'holomorphic', 'symplectic', 'manifolds', 'which', 'are', 'deformations', 'of', 'hilbert', 'schemes', 'of', 'any', 'number', 'n', 'of', 'points', 'on', 'k3', 'surfaces', 'extending', 'results', 'already', 'known', 'for', 'n2', 'in', 'order', 'to', 'do', 'so', 'we', 'study', 'the', 'properties', 'of', 'the', 'invariant', 'lattice', 'of', 'the', 'automorphism', 'and', 'its', 'orthogonal', 'complement', 'inside', 'the', 'second', 'cohomology', 'lattice', 'of', 'the', 'manifold', 'we', 'also', 'explain', 'how', 'to', 'construct', 'automorphisms', 'with', 'fixed', 'action', 'on', 'cohomology', 'in', 'the', 'cases', 'n34', 'the', 'examples', 'provided', 'allow', 'to', 'realize', 'all', 'admissible', 'actions', 'in', 'our', 'classification', 'for', 'n4', 'we', 'present', 'a', 'construction', 'of', 'nonsymplectic', 'automorphisms', 'on', 'the', 'lehnlehnsorgervan', 'straten', 'eightfold', 'which', 'come', 'from', 'automorphisms', 'of', 'the', 'underlying', 'cubic', 'fourfold']] | [-0.20141532340301282, 0.0723459030320225, -0.07027576865826164, 0.024658353764365995, -0.10086884594159777, -0.11217001308810658, 0.0013184253995891957, 0.35146506500751834, -0.2668547272987136, -0.2526645531004245, 0.10882969194944882, -0.2792324885660041, -0.17513706363465603, 0.16498549069191404, -0.13455280542901132, 0.01179373247159513, 0.016657501360220192, 0.10889750448121499, -0.12797073871556636, -0.37141120702489816, 0.4268636525880578, -0.02607671604945069, 0.18200375409425953, 0.03674234684342436, 0.09589040680763732, -0.017729876550590305, -0.003459665223758305, -0.0794903999450932, -0.1670396360774747, 0.1217115428092667, 0.3022827192300321, -0.015988725786979734, 0.08824858845796733, -0.3999266165877338, -0.1540865750416219, 0.19014836384696407, 0.13862891525310356, 0.0670672296608213, -0.00455909683492727, -0.24312882971397676, 0.09217557358448353, -0.14487561805223206, -0.20095327471803248, -0.15475385697904678, -0.0009252266315496073, -0.009889631299301982, -0.18156828543797662, -0.05260923833908736, 0.13571742295691397, 0.14032986196400846, -0.08165588568735341, -0.10704514308445222, -0.10925443851867014, 0.11175583639239843, -0.0017168386386031598, 0.024326088576602328, 0.057148726949616604, -0.07604816216827098, -0.16496212029648302, 0.4040761438190146, -0.02688233533295168, -0.24780493541167373, 0.1482769126398077, -0.18568712293656658, -0.24441592599702092, 0.15266344981037278, 0.15363562728517352, 0.18364747135644466, 0.03404236734078257, 0.18616799532953007, -0.08638671002622726, 0.08333558621775128, 0.09833810661828755, -0.028955992797505013, 0.08997261560464327, 0.07766008725909071, 0.10329961733567009, 0.12877471973929983, 0.01009971481558364, -0.054798768004979445, -0.3824899214797909, -0.16111228564178234, -0.10587915418508867, 0.15621494856226234, -0.09324135846008683, -0.15861740348596884, 0.4240980839595792, 0.08431095268939977, 0.19759312790892689, 0.09955227256966837, 0.2030258205373137, -0.02381772839204631, 0.09362914846319936, 0.05845064351353712, 0.14497034016798818, 0.19144677274396327, -0.1057095949422667, -0.1999575759871941, -0.09870996910551216, 0.22256204996060217] |
1,802.00193 | Manifestation of Lepton Interaction Nonuniversality in Spontaneously
Violated Mirror Symmetry | LHCb data indicate a significant difference in widths between the B->K (or
K^*) + e^+ e^- and B->K (or K^*) + {\mu}^+ {\mu}^- decays (April 2017). The
width of the e^+ e^--channel is noticeably larger than that of the {\mu}^+
{\mu}^--channel. SM-calculations require equality here. The difference may mean
that a new interaction exists which changes generations and distinguishes
leptons, with coupling constants much larger than, and inverse in power to, the
SM-coupling of fermions with the Higgs boson. In the spontaneously violated
mirror symmetry, the coupling between SM particles and the heavy (in principle)
second Higgs scalar, necessarily present here, is characterized by precisely
such properties. The inverse strong power of such a coupling is not an
additional hypothesis but also a necessary condition for the qualitative
reproduction of the observed mass hierarchy of charged leptons and the
structure of lepton weak mixing, the PMNS matrix. In the mirror model being
discussed, all properties, including the inverse power of the new interaction,
are dictated by the hierarchical character of mass spectra for quarks and
charged leptons.
| hep-ph | lhcb data indicate a significant difference in widths between the bk or k e e and bk or k mu mu decays april 2017 the width of the e echannel is noticeably larger than that of the mu muchannel smcalculations require equality here the difference may mean that a new interaction exists which changes generations and distinguishes leptons with coupling constants much larger than and inverse in power to the smcoupling of fermions with the higgs boson in the spontaneously violated mirror symmetry the coupling between sm particles and the heavy in principle second higgs scalar necessarily present here is characterized by precisely such properties the inverse strong power of such a coupling is not an additional hypothesis but also a necessary condition for the qualitative reproduction of the observed mass hierarchy of charged leptons and the structure of lepton weak mixing the pmns matrix in the mirror model being discussed all properties including the inverse power of the new interaction are dictated by the hierarchical character of mass spectra for quarks and charged leptons | [['lhcb', 'data', 'indicate', 'a', 'significant', 'difference', 'in', 'widths', 'between', 'the', 'bk', 'or', 'k', 'e', 'e', 'and', 'bk', 'or', 'k', 'mu', 'mu', 'decays', 'april', '2017', 'the', 'width', 'of', 'the', 'e', 'echannel', 'is', 'noticeably', 'larger', 'than', 'that', 'of', 'the', 'mu', 'muchannel', 'smcalculations', 'require', 'equality', 'here', 'the', 'difference', 'may', 'mean', 'that', 'a', 'new', 'interaction', 'exists', 'which', 'changes', 'generations', 'and', 'distinguishes', 'leptons', 'with', 'coupling', 'constants', 'much', 'larger', 'than', 'and', 'inverse', 'in', 'power', 'to', 'the', 'smcoupling', 'of', 'fermions', 'with', 'the', 'higgs', 'boson', 'in', 'the', 'spontaneously', 'violated', 'mirror', 'symmetry', 'the', 'coupling', 'between', 'sm', 'particles', 'and', 'the', 'heavy', 'in', 'principle', 'second', 'higgs', 'scalar', 'necessarily', 'present', 'here', 'is', 'characterized', 'by', 'precisely', 'such', 'properties', 'the', 'inverse', 'strong', 'power', 'of', 'such', 'a', 'coupling', 'is', 'not', 'an', 'additional', 'hypothesis', 'but', 'also', 'a', 'necessary', 'condition', 'for', 'the', 'qualitative', 'reproduction', 'of', 'the', 'observed', 'mass', 'hierarchy', 'of', 'charged', 'leptons', 'and', 'the', 'structure', 'of', 'lepton', 'weak', 'mixing', 'the', 'pmns', 'matrix', 'in', 'the', 'mirror', 'model', 'being', 'discussed', 'all', 'properties', 'including', 'the', 'inverse', 'power', 'of', 'the', 'new', 'interaction', 'are', 'dictated', 'by', 'the', 'hierarchical', 'character', 'of', 'mass', 'spectra', 'for', 'quarks', 'and', 'charged', 'leptons']] | [-0.11780539674097618, 0.26254634646709935, -0.03930451732796396, 0.12286559128097523, -0.06355615793808089, -0.17050504089316967, 0.024970401305236957, 0.30717764893072963, -0.25558666567818794, -0.3161752016978026, 0.00579121996543634, -0.2936216640808334, -0.04012025185225456, 0.11415771090404017, 0.04643723276319962, 0.035086584344743134, 0.052038677806583784, 0.025009538897587728, -0.07677149776143231, -0.19249937414511972, 0.3144907887858161, 0.029415689484146287, 0.22832524581850006, 0.08970545782947191, 0.05902606680399787, -0.0073839297741543864, -0.00523100794202815, -0.038035006258324476, -0.10425873315057682, 0.07165411113317406, 0.12102490157828359, 0.07064371760073253, 0.15950084076736748, -0.35632620372868684, -0.1211644383631862, 0.16916487413873046, 0.1335050240293619, 0.0322780019268555, -0.06976345532931753, -0.28850740779223555, 0.1082916291460201, -0.15131473988348434, -0.10676295999329903, -0.031235776610155672, 0.030861952595111264, -0.03392372296778539, -0.3587646428027966, 0.11676886267647163, 0.05770220473069547, 0.05046383553114585, -0.0022139692964366063, -0.17177122591246416, -0.07278396967378568, 0.04245262879964416, 0.14388505048105074, -0.008414662615369165, 0.09823336604931472, -0.17254479225143532, -0.11837515645496267, 0.41132642805705527, -0.0814847977008641, -0.1702615934144167, 0.16997989401695013, -0.18821185309913635, -0.1127647645629349, 0.13821671031969948, 0.16510451882081698, 0.07327754989890867, -0.14368254070020836, 0.14833444258470002, -0.05370886074032532, 0.19286333760744595, 0.055390865194767366, 0.05410186608316581, 0.21330298526438674, 0.14856551183829073, 0.06373842736178567, 0.04426240590481744, -0.05343755967968892, -0.05987523683492159, -0.36863404956533213, -0.16498077656223165, -0.13432528700671464, 0.07466239225251581, -0.0836302344810091, -0.10200167994009536, 0.39932842323061274, 0.07507180334728297, 0.24163971655070782, 0.01781442945734248, 0.268417058584571, 0.12624984663087507, 0.09895145503610286, 0.05039101672854081, 0.3128241304593494, 0.16837180751601954, 0.1048458302790579, -0.26656462401949066, 0.028114258467806557, 0.047251353978389345] |
1,802.00194 | Tradeoff between Delay and Physical Layer Security in Wireless Networks | Exchange of crucial and confidential information leads to the unprecedented
attention on the security problem in wireless networks. Though the security has
been studied in a number of works, the joint optimization of the physical layer
security and the end-to-end delay management, which requires a meticulous
cross-layer design, has seldom been evaluated. In this work, by combining the
tools from stochastic geometry and queueing theory, we analyze the tradeoff
between the delay and the security performance in large wireless networks. We
further propose a simple transmission mechanism which splits a message into two
packets and evaluate its effect on the mean delay and the secrecy outage
probability. Our numerical results reveal that the security performance is
better for larger path loss exponent when the density of legitimate nodes is
large, and it is reverse when the density is small. Moreover, it is observed
that by introducing the simple mechanism of message split, the security
performance is greatly improved in the backlogged scenario and slightly
improved in the dynamic scenario when the density of legitimate transmitters is
large. In summary, this work provides an understanding and a rule-of-thumb for
the practical design of wireless networks where both the delay and the security
are key concerns.
| cs.IT math.IT | exchange of crucial and confidential information leads to the unprecedented attention on the security problem in wireless networks though the security has been studied in a number of works the joint optimization of the physical layer security and the endtoend delay management which requires a meticulous crosslayer design has seldom been evaluated in this work by combining the tools from stochastic geometry and queueing theory we analyze the tradeoff between the delay and the security performance in large wireless networks we further propose a simple transmission mechanism which splits a message into two packets and evaluate its effect on the mean delay and the secrecy outage probability our numerical results reveal that the security performance is better for larger path loss exponent when the density of legitimate nodes is large and it is reverse when the density is small moreover it is observed that by introducing the simple mechanism of message split the security performance is greatly improved in the backlogged scenario and slightly improved in the dynamic scenario when the density of legitimate transmitters is large in summary this work provides an understanding and a ruleofthumb for the practical design of wireless networks where both the delay and the security are key concerns | [['exchange', 'of', 'crucial', 'and', 'confidential', 'information', 'leads', 'to', 'the', 'unprecedented', 'attention', 'on', 'the', 'security', 'problem', 'in', 'wireless', 'networks', 'though', 'the', 'security', 'has', 'been', 'studied', 'in', 'a', 'number', 'of', 'works', 'the', 'joint', 'optimization', 'of', 'the', 'physical', 'layer', 'security', 'and', 'the', 'endtoend', 'delay', 'management', 'which', 'requires', 'a', 'meticulous', 'crosslayer', 'design', 'has', 'seldom', 'been', 'evaluated', 'in', 'this', 'work', 'by', 'combining', 'the', 'tools', 'from', 'stochastic', 'geometry', 'and', 'queueing', 'theory', 'we', 'analyze', 'the', 'tradeoff', 'between', 'the', 'delay', 'and', 'the', 'security', 'performance', 'in', 'large', 'wireless', 'networks', 'we', 'further', 'propose', 'a', 'simple', 'transmission', 'mechanism', 'which', 'splits', 'a', 'message', 'into', 'two', 'packets', 'and', 'evaluate', 'its', 'effect', 'on', 'the', 'mean', 'delay', 'and', 'the', 'secrecy', 'outage', 'probability', 'our', 'numerical', 'results', 'reveal', 'that', 'the', 'security', 'performance', 'is', 'better', 'for', 'larger', 'path', 'loss', 'exponent', 'when', 'the', 'density', 'of', 'legitimate', 'nodes', 'is', 'large', 'and', 'it', 'is', 'reverse', 'when', 'the', 'density', 'is', 'small', 'moreover', 'it', 'is', 'observed', 'that', 'by', 'introducing', 'the', 'simple', 'mechanism', 'of', 'message', 'split', 'the', 'security', 'performance', 'is', 'greatly', 'improved', 'in', 'the', 'backlogged', 'scenario', 'and', 'slightly', 'improved', 'in', 'the', 'dynamic', 'scenario', 'when', 'the', 'density', 'of', 'legitimate', 'transmitters', 'is', 'large', 'in', 'summary', 'this', 'work', 'provides', 'an', 'understanding', 'and', 'a', 'ruleofthumb', 'for', 'the', 'practical', 'design', 'of', 'wireless', 'networks', 'where', 'both', 'the', 'delay', 'and', 'the', 'security', 'are', 'key', 'concerns']] | [-0.207125956934475, 0.015059702610325949, -0.055542733399288766, 0.04435360319878194, -0.050877932545000816, -0.20234886204878635, 0.09655756140230498, 0.36999301113160876, -0.2626179981629784, -0.29933236772651034, 0.0833451799065669, -0.2530382611085752, -0.18686083465068162, 0.16800009688435524, -0.14093749003722242, 0.08881784205332938, 0.04099959845873801, 0.05403496717974799, -0.016720059068700045, -0.28433742313074406, 0.31795658245933806, 0.12395860834101982, 0.373663725958014, 0.1250544835752853, 0.06363529036867012, 0.02003509666788958, -0.006854363970513291, -0.015437632225061237, -0.10429011767009083, 0.11697486987367145, 0.28186410336239337, 0.18834291093448616, 0.3358379017913203, -0.42105811764029605, -0.2661276677550346, 0.06220162833365155, 0.15290870401405104, 0.08352297430917364, -0.05611041764952425, -0.2893056144718738, 0.11332658856340191, -0.21775865259434224, -0.028376881923416957, -0.009419774040853715, -0.03591190685298951, 0.027234765467594613, -0.28426507919343125, 0.0051848423968562304, 0.02485575722347872, 0.034662285567024165, -0.006987085685193283, -0.07187984103346061, 0.004051941370491085, 0.17877070179797466, 0.06783146645009801, -0.01170302705677208, 0.08884239501511569, -0.13573195663928916, -0.09776997659127136, 0.363673499216983, 0.004269398350551652, -0.20180935836305805, 0.13608279257495465, -0.05634097440633923, -0.11804198106184748, 0.14782183225421855, 0.23058335038185046, 0.05189865951508503, -0.1819398088212206, 0.05082340800721545, -0.010909382671040172, 0.19002260697272824, 0.03537538972701512, 0.09038907192720502, 0.14295846328394535, 0.23862277152925254, 0.11269757921314415, 0.13895400258936172, -0.09847801408100434, -0.13905965027572842, -0.2263079384597493, -0.15291489511682635, -0.20107732187185035, 0.03209530654723993, -0.12055103609486205, -0.06760766080069337, 0.39018721198012557, 0.16926193551768723, 0.15977901786876222, 0.07932908904245671, 0.4132686453487943, 0.11597644958893914, 0.046249005709564785, 0.12405389803233464, 0.2394604088702038, 0.08547762409765639, 0.14195203797563033, -0.19210104257388808, 0.15481177414767444, -0.019006820525700116] |
1,802.00195 | On the Expressive Completeness of Bernays-Sch\"onfinkel-Ramsey
Separation Logic | This paper investigates the satisfiability problem for Separation Logic, with
unrestricted nesting of separating conjunctions and implications, for prenex
formulae with quantifier prefix in the language $\exists^*\forall^*$, in the
cases where the universe of possible locations is either countably infinite or
finite. In analogy with first-order logic with uninterpreted predicates and
equality, we call this fragment Bernays-Sch\"onfinkel-Ramsey Separation Logic
[BSR(SLk)]. We show that, unlike in first-order logic, the (in)finite
satisfiability problem is undecidable for BSR(SLk) and we define two
non-trivial subsets thereof, that are decidable for finite and infinite
satisfiability, respectively, by controlling the occurrences of universally
quantified variables within the scope of separating implications, as well as
the polarity of the occurrences of the latter. The decidability results are
obtained by a controlled elimination of separating connectives, described as
(i) an effective translation of a prenex form Separation Logic formula into a
combination of a small number of \emph{test formulae}, using only first-order
connectives, followed by (ii) a translation of the latter into an
equisatisfiable first-order formula.
| cs.LO | this paper investigates the satisfiability problem for separation logic with unrestricted nesting of separating conjunctions and implications for prenex formulae with quantifier prefix in the language existsforall in the cases where the universe of possible locations is either countably infinite or finite in analogy with firstorder logic with uninterpreted predicates and equality we call this fragment bernaysschonfinkelramsey separation logic bsrslk we show that unlike in firstorder logic the infinite satisfiability problem is undecidable for bsrslk and we define two nontrivial subsets thereof that are decidable for finite and infinite satisfiability respectively by controlling the occurrences of universally quantified variables within the scope of separating implications as well as the polarity of the occurrences of the latter the decidability results are obtained by a controlled elimination of separating connectives described as i an effective translation of a prenex form separation logic formula into a combination of a small number of emphtest formulae using only firstorder connectives followed by ii a translation of the latter into an equisatisfiable firstorder formula | [['this', 'paper', 'investigates', 'the', 'satisfiability', 'problem', 'for', 'separation', 'logic', 'with', 'unrestricted', 'nesting', 'of', 'separating', 'conjunctions', 'and', 'implications', 'for', 'prenex', 'formulae', 'with', 'quantifier', 'prefix', 'in', 'the', 'language', 'existsforall', 'in', 'the', 'cases', 'where', 'the', 'universe', 'of', 'possible', 'locations', 'is', 'either', 'countably', 'infinite', 'or', 'finite', 'in', 'analogy', 'with', 'firstorder', 'logic', 'with', 'uninterpreted', 'predicates', 'and', 'equality', 'we', 'call', 'this', 'fragment', 'bernaysschonfinkelramsey', 'separation', 'logic', 'bsrslk', 'we', 'show', 'that', 'unlike', 'in', 'firstorder', 'logic', 'the', 'infinite', 'satisfiability', 'problem', 'is', 'undecidable', 'for', 'bsrslk', 'and', 'we', 'define', 'two', 'nontrivial', 'subsets', 'thereof', 'that', 'are', 'decidable', 'for', 'finite', 'and', 'infinite', 'satisfiability', 'respectively', 'by', 'controlling', 'the', 'occurrences', 'of', 'universally', 'quantified', 'variables', 'within', 'the', 'scope', 'of', 'separating', 'implications', 'as', 'well', 'as', 'the', 'polarity', 'of', 'the', 'occurrences', 'of', 'the', 'latter', 'the', 'decidability', 'results', 'are', 'obtained', 'by', 'a', 'controlled', 'elimination', 'of', 'separating', 'connectives', 'described', 'as', 'i', 'an', 'effective', 'translation', 'of', 'a', 'prenex', 'form', 'separation', 'logic', 'formula', 'into', 'a', 'combination', 'of', 'a', 'small', 'number', 'of', 'emphtest', 'formulae', 'using', 'only', 'firstorder', 'connectives', 'followed', 'by', 'ii', 'a', 'translation', 'of', 'the', 'latter', 'into', 'an', 'equisatisfiable', 'firstorder', 'formula']] | [-0.13811750095655126, 0.1301790443339886, -0.01931141887255239, 0.12475831796499816, -0.11274829335002737, -0.1488088348936854, 0.1101164306690352, 0.31189499081422883, -0.33148912622903787, -0.27133174562318757, 0.09560765501281077, -0.24186903502453458, -0.06300810374686439, 0.17107569816606966, -0.08345150784307132, 0.04332986617968841, -0.024014242988249116, 0.07344382150860673, -0.09673652904184013, -0.2001679859688562, 0.3151262472919894, -0.10017080781416911, 0.19784353083620468, 0.03874822415580804, 0.08935298402582041, 0.06228098710998893, 0.021252454705818585, 0.10817321045684697, -0.08346306196542697, 0.08701773548188309, 0.34516434820058445, 0.23599827981582194, 0.27758328841265406, -0.4285897881018393, -0.12040237755034909, 0.09469017141470404, 0.13511795533792764, 0.0999603474315143, -0.005510503041670855, -0.2984043256351442, 0.0741478975318993, -0.19294573819885652, -0.0358259679495611, -0.07585837427583156, 0.09679678093754884, 0.032786525938321244, -0.2133252484505206, 0.016614200416634875, 0.24168435596282398, 0.11177184209792, -0.07151317029316542, -0.11158226121668563, 0.03167978966975528, 0.036928005438918866, -0.004070825838116986, -0.003027130158222986, 0.045285638399196394, -0.1005377454852516, -0.19101747123976098, 0.34802366935394025, -0.0427417684741544, -0.20283109746083167, 0.10524064120413228, -0.08631835608446801, -0.18210514563446242, 0.10084729959031172, 0.07241267331339644, 0.1458278696109174, -0.1056812043384663, 0.1401166841571632, -0.060085981945987, 0.22959734520409256, 0.18681643096250342, 0.03921994065978762, 0.20511806766700114, 0.17633591525143746, 0.010147322724911976, 0.2298245108502945, 0.020492149735659812, -0.13347528150171098, -0.3640629628842527, -0.15301154422446747, -0.09688521066793439, -0.0601102236037453, -0.10071853895735165, -0.22690005830178658, 0.33740971441606454, 0.12258738990534436, 0.14081956691136865, 0.18987818860702893, 0.2901186936097502, 0.1564727230315012, 0.08481333249559005, 0.012831639804679787, 0.11194787234011473, 0.15157225885089826, 0.022298295148754154, -0.20326419605760637, 0.13826284058335603, 0.13668714980877034] |
1,802.00196 | Parametrization of 3x3 unitary matrices based on polarization algebra | A parametrization of 3x3 unitary matrices is presented. This mathematical
approach is inspired on polarization algebra and is formulated through the
identification of a set of three orthonormal three-dimensional Jones vectors
representing the respective pure polarization states. This approach leads to
the representation of a 3x3 unitary matrix as an orthogonal similarity
transformation of a particular type of unitary matrix that depends on six
independent parameters, while the remaining three parameters correspond to the
orthogonal matrix of the said transformation. The results obtained are applied
to determine the structure of the second component of the characteristic
decomposition of a 3x3 positive semidefinite Hermitian matrix.
| math-ph math.MP | a parametrization of 3x3 unitary matrices is presented this mathematical approach is inspired on polarization algebra and is formulated through the identification of a set of three orthonormal threedimensional jones vectors representing the respective pure polarization states this approach leads to the representation of a 3x3 unitary matrix as an orthogonal similarity transformation of a particular type of unitary matrix that depends on six independent parameters while the remaining three parameters correspond to the orthogonal matrix of the said transformation the results obtained are applied to determine the structure of the second component of the characteristic decomposition of a 3x3 positive semidefinite hermitian matrix | [['a', 'parametrization', 'of', '3x3', 'unitary', 'matrices', 'is', 'presented', 'this', 'mathematical', 'approach', 'is', 'inspired', 'on', 'polarization', 'algebra', 'and', 'is', 'formulated', 'through', 'the', 'identification', 'of', 'a', 'set', 'of', 'three', 'orthonormal', 'threedimensional', 'jones', 'vectors', 'representing', 'the', 'respective', 'pure', 'polarization', 'states', 'this', 'approach', 'leads', 'to', 'the', 'representation', 'of', 'a', '3x3', 'unitary', 'matrix', 'as', 'an', 'orthogonal', 'similarity', 'transformation', 'of', 'a', 'particular', 'type', 'of', 'unitary', 'matrix', 'that', 'depends', 'on', 'six', 'independent', 'parameters', 'while', 'the', 'remaining', 'three', 'parameters', 'correspond', 'to', 'the', 'orthogonal', 'matrix', 'of', 'the', 'said', 'transformation', 'the', 'results', 'obtained', 'are', 'applied', 'to', 'determine', 'the', 'structure', 'of', 'the', 'second', 'component', 'of', 'the', 'characteristic', 'decomposition', 'of', 'a', '3x3', 'positive', 'semidefinite', 'hermitian', 'matrix']] | [-0.13056303192682278, 0.10203643802168909, -0.06444000391862713, -0.03693862591283575, -0.04616746254480229, -0.11764198440505425, -0.007099312245442819, 0.33043987886048853, -0.29316776655972576, -0.21731072744408336, 0.11693302921216506, -0.22409282239207712, -0.19352063359334493, 0.12772249121469662, -0.002726214275193902, 0.05626973621726323, 0.04719034486109964, 0.07874238113604057, -0.20099280319006468, -0.23756713205008195, 0.3554253441465195, 0.012270273282550849, 0.2889395836346711, -0.036547510813062005, 0.1596366845142956, 0.0384426392444696, -0.09296307985026103, -0.033781978874825515, -0.01026553845363546, 0.1462962467602875, 0.2466611731887007, 0.17005488272724717, 0.1839535510897314, -0.3756779849063605, -0.10958312133040565, 0.11917823650247346, 0.09890193035020135, 0.06304296297961488, 0.004106616155835441, -0.26621570319940263, 0.0507200175197795, -0.14745422856112084, -0.14920094268521866, -0.07171476187291913, 0.02362276889079322, -0.06717434832703126, -0.32115691211443986, 0.04708795545446684, 0.055112776024123795, 0.029475361574441195, -0.04905916304470828, -0.18582880244447061, 0.015670152060920373, 0.10905032101212643, -0.04479940750304824, -0.0026212451372815007, 0.12630433993203602, -0.05390130046558065, -0.09039896582880129, 0.38054576178546995, -0.044306320747217305, -0.27985298450892937, 0.1315324985099813, -0.11348848141586551, -0.1154800208706337, 0.12696928607944685, 0.15070953772654042, 0.10310121696406546, -0.13919565578656218, 0.11898569658772501, -0.14864922652038962, 0.1476268890837673, 0.07992095314414026, -0.002564968827825326, 0.1590564766912184, 0.08427881848631212, 0.056311060584938295, 0.13584340423963462, -0.015747352136084095, -0.10083602156597547, -0.3056802462893896, -0.15986041180216348, -0.2419219107452171, 0.08855546697024973, -0.15274927509003297, -0.191787849946055, 0.5202073142505609, 0.061142643422219686, 0.2304207281424449, 0.028581444782992967, 0.21957287331147549, 0.12578253789881552, 0.07423281468128642, 0.01428965777785589, 0.20318160220407522, 0.26144177890203607, 0.00026742233491789264, -0.22478881987206897, 0.026265965785849124, 0.1382978419759848] |
1,802.00197 | On commuting $p$-version projection-based interpolation on tetrahedra | On the reference tetrahedron $\widehat K$, we define three projection-based
interpolation operators on $H^2(\widehat K)$, ${\mathbf H}^1(\widehat
K,\operatorname{\mathbf{curl}})$, and ${\mathbf H}^1(\widehat
K,\operatorname{div})$. These operators are projections onto space of
polynomials, they have the commuting diagram property and feature the optimal
convergence rate as the polynomial degree increases in $H^{1-s}(\widehat K)$,
${\mathbf H}^{-s}(\widehat K,\operatorname{\mathbf{curl}})$, ${\mathbf
H}^{-s}(\widehat K,\operatorname{div})$ for $0 \leq s \leq 1$.
| math.NA cs.NA | on the reference tetrahedron widehat k we define three projectionbased interpolation operators on h2widehat k mathbf h1widehat koperatornamemathbfcurl and mathbf h1widehat koperatornamediv these operators are projections onto space of polynomials they have the commuting diagram property and feature the optimal convergence rate as the polynomial degree increases in h1swidehat k mathbf hswidehat koperatornamemathbfcurl mathbf hswidehat koperatornamediv for 0 leq s leq 1 | [['on', 'the', 'reference', 'tetrahedron', 'widehat', 'k', 'we', 'define', 'three', 'projectionbased', 'interpolation', 'operators', 'on', 'h2widehat', 'k', 'mathbf', 'h1widehat', 'koperatornamemathbfcurl', 'and', 'mathbf', 'h1widehat', 'koperatornamediv', 'these', 'operators', 'are', 'projections', 'onto', 'space', 'of', 'polynomials', 'they', 'have', 'the', 'commuting', 'diagram', 'property', 'and', 'feature', 'the', 'optimal', 'convergence', 'rate', 'as', 'the', 'polynomial', 'degree', 'increases', 'in', 'h1swidehat', 'k', 'mathbf', 'hswidehat', 'koperatornamemathbfcurl', 'mathbf', 'hswidehat', 'koperatornamediv', 'for', '0', 'leq', 's', 'leq', '1']] | [-0.19907797346464717, 0.13885021541052714, 0.010845330006514605, -0.039404720273943476, -0.0316768690245226, -0.16920299134933606, 0.013477737648197664, 0.3977909908594134, -0.3836941219006593, -0.14104681704730654, 0.08320101869713444, -0.36407337887570834, -0.05036599090537773, 0.12895862858455914, -0.035527413979602546, 0.05190131105840779, -0.027703066951989267, 0.07847291489060108, -0.17810531475697644, -0.27144345942025, 0.2916026083716693, -0.098639568582607, 0.1989682108665315, -0.05087045420749256, 0.13156126314201033, -0.004267574681972082, 0.06060831952625169, -0.07779818287179716, -0.23133389784309727, 0.04548225501695505, 0.27643898768851966, 0.1612519385973708, 0.231619098653587, -0.3186501484507552, -0.08765063816323303, 0.21662770009313065, 0.21988717992252743, -0.08488968595002706, 0.03838359259624177, -0.23582299806786558, 0.14236294333106622, -0.06034225794792292, -0.127070743832379, -0.13311139094786575, 0.10066270117218104, 0.05321864126465069, -0.3575827992306306, 0.04835286288289353, 0.134628007453732, 0.1556380225273852, -0.029930375614919916, -0.26429571616105163, -0.07095798698719591, 0.05598039283918647, -0.08016646477895287, 0.14646677117651472, 0.0538916572236653, -0.01974900937280976, -0.04966337965631213, 0.3241443822805125, -0.06466025907474642, -0.23601148915118897, 0.07831306781512327, -0.2285794743981499, -0.16003616197905593, 0.10049911606340454, 0.16008915718143377, 0.22032986398503104, 0.006545864618741549, 0.24546073354520978, -0.11068446321699482, 0.07859555449193487, 0.09485814943372343, 0.06267601760247579, 0.08769879808935982, -0.0028101707665392985, 0.11995769571960689, 0.05764649708110552, -0.023786176819927417, -0.023130909799454875, -0.34849436085026425, -0.16420548229227558, -0.22205201398509627, 0.09712308254809333, -0.2381488143801107, -0.08017925524081175, 0.31622520260190445, 0.105663421510074, 0.25279433473658103, 0.10378231742204382, 0.16617606717717046, 0.09216592064387022, 0.033349745387498006, 0.09215858505250743, 0.0741620703618257, 0.18851040500717667, 0.03661432355427398, -0.18059252435341477, 0.02871036193727587, 0.2428293951536314] |
1,802.00198 | The zenithal 4-m International Liquid Mirror Telescope: a unique
facility for supernova studies | The 4-m International Liquid Mirror Telescope (ILMT) will soon become
operational at the newly developed Devasthal observatory near Nainital
(Uttarakhand, India). Coupled with a 4k $\times$ 4k pixels CCD detector and TDI
optical corrector, it will reach approximately 22.8, 22.3 and 21.4 magnitude in
the $g'$, $r'$ and $i'$ spectral bands, respectively in a single scan. The
limiting magnitudes can be further improved by co-adding the consecutive night
images in particular filters. The uniqueness to observe the same sky region by
looking towards the zenith direction every night, makes the ILMT a unique
instrument to detect new supernovae (SNe) by applying the image subtraction
technique. High cadence ($\sim$24 hours) observations will help to construct
dense sampling multi-band SNe light curves. We discuss the importance of the
ILMT facility in the context of SNe studies. Considering the various plausible
cosmological parameters and observational constraints, we perform detailed
calculations of the expected SNe rate that can be detected with the ILMT in
different spectral bands.
| astro-ph.IM astro-ph.HE | the 4m international liquid mirror telescope ilmt will soon become operational at the newly developed devasthal observatory near nainital uttarakhand india coupled with a 4k times 4k pixels ccd detector and tdi optical corrector it will reach approximately 228 223 and 214 magnitude in the g r and i spectral bands respectively in a single scan the limiting magnitudes can be further improved by coadding the consecutive night images in particular filters the uniqueness to observe the same sky region by looking towards the zenith direction every night makes the ilmt a unique instrument to detect new supernovae sne by applying the image subtraction technique high cadence sim24 hours observations will help to construct dense sampling multiband sne light curves we discuss the importance of the ilmt facility in the context of sne studies considering the various plausible cosmological parameters and observational constraints we perform detailed calculations of the expected sne rate that can be detected with the ilmt in different spectral bands | [['the', '4m', 'international', 'liquid', 'mirror', 'telescope', 'ilmt', 'will', 'soon', 'become', 'operational', 'at', 'the', 'newly', 'developed', 'devasthal', 'observatory', 'near', 'nainital', 'uttarakhand', 'india', 'coupled', 'with', 'a', '4k', 'times', '4k', 'pixels', 'ccd', 'detector', 'and', 'tdi', 'optical', 'corrector', 'it', 'will', 'reach', 'approximately', '228', '223', 'and', '214', 'magnitude', 'in', 'the', 'g', 'r', 'and', 'i', 'spectral', 'bands', 'respectively', 'in', 'a', 'single', 'scan', 'the', 'limiting', 'magnitudes', 'can', 'be', 'further', 'improved', 'by', 'coadding', 'the', 'consecutive', 'night', 'images', 'in', 'particular', 'filters', 'the', 'uniqueness', 'to', 'observe', 'the', 'same', 'sky', 'region', 'by', 'looking', 'towards', 'the', 'zenith', 'direction', 'every', 'night', 'makes', 'the', 'ilmt', 'a', 'unique', 'instrument', 'to', 'detect', 'new', 'supernovae', 'sne', 'by', 'applying', 'the', 'image', 'subtraction', 'technique', 'high', 'cadence', 'sim24', 'hours', 'observations', 'will', 'help', 'to', 'construct', 'dense', 'sampling', 'multiband', 'sne', 'light', 'curves', 'we', 'discuss', 'the', 'importance', 'of', 'the', 'ilmt', 'facility', 'in', 'the', 'context', 'of', 'sne', 'studies', 'considering', 'the', 'various', 'plausible', 'cosmological', 'parameters', 'and', 'observational', 'constraints', 'we', 'perform', 'detailed', 'calculations', 'of', 'the', 'expected', 'sne', 'rate', 'that', 'can', 'be', 'detected', 'with', 'the', 'ilmt', 'in', 'different', 'spectral', 'bands']] | [-0.08589410988176156, 0.1150588725159299, -0.0822927654875111, 0.07799194976001796, -0.09460986145997728, -0.14361893601267045, 0.06652818338094177, 0.43264422449711826, -0.20730956399561895, -0.35245568528085763, 0.13712002889023225, -0.3355544087151351, -0.04036032491894953, 0.21372868928578367, -0.07729309909043242, -0.015290758772496065, 0.1306533133768208, -0.0815984416764481, -0.08507170923414177, -0.289688184974498, 0.20364775019697845, 0.12714607381130472, 0.24743928913165603, -0.04236453721025513, 0.10106144863197956, -0.017605640322321373, -0.0912433444933703, -0.019390332731104062, -0.14363398728486004, 0.022223552394704037, 0.2919271361222776, 0.12492963239162064, 0.20326438470475056, -0.36993844877050736, -0.18997086012347436, 0.10260520221385533, 0.1158642776059044, 0.01745039402890059, 0.003627288452366744, -0.31486183240084104, 0.03698159295185669, -0.12184268050748345, -0.15958843013111706, 0.031565886551508555, -0.011625466346197927, 0.04414568251506654, -0.21587829832330438, 0.004424598916473747, -0.06104451872299831, 0.09261268416866539, -0.07563202911016582, -0.1304624226649379, -0.023902217546860727, 0.08997618147897665, -0.01724851385124622, 0.06606102129158799, 0.07773115894681505, -0.11709142845064013, -0.03403044646845822, 0.36892169345444514, -0.10510735685774268, 0.01737465194220786, 0.13130610589612207, -0.22350611950790772, -0.13979271842749572, 0.16492875735275447, 0.16442680985672525, 0.0938213777819797, -0.18616805741837694, 0.013512682396792835, 0.02090468682617269, 0.18658557374236043, 0.0863067214462929, 0.06627701242751459, 0.26734726379505513, 0.1521486097209704, 0.07294538646844999, 0.10209523491844237, -0.30365845070511926, 0.04672342194301402, -0.28151566055289073, -0.10915931357653594, -0.1320902416511136, 0.052314767589724046, -0.12390285206814382, -0.046887877648639165, 0.4179551523661618, 0.15777348312106487, 0.1356664645268462, 0.006333052693506235, 0.2887800450092524, 0.047154745781234256, 0.11657981823649874, 0.055150518725209076, 0.3119082721778723, 0.06904425019644019, 0.1598979061093764, -0.180749338168788, -0.017856246369685178, 0.019336316924887863] |
1,802.00199 | Vibronic Dephasing Model for Coherent-to-Incoherent Crossover in DNA | In this work we investigate the interplay between coherent and incoherent
charge transport in cytosine-guanine (GC) rich DNA molecules. Our objective is
to introduce physically grounded approach to dephasing in large molecules and
to understand the length dependent charge transport characteristics and
especially the crossover from coherent tunneling to incoherent hopping regime
at different temperatures. Therefore, we apply the vibronic dephasing model and
compare the results to the B\"uttiker probe model which is commonly used to
describe decoherence effects in charge transport. Using the full ladder model
and simplified 1D model of DNA, we consider molecular junctions with
alternating and stacked GC sequences and compare our results to recent
experimental measurements.
| cond-mat.mes-hall | in this work we investigate the interplay between coherent and incoherent charge transport in cytosineguanine gc rich dna molecules our objective is to introduce physically grounded approach to dephasing in large molecules and to understand the length dependent charge transport characteristics and especially the crossover from coherent tunneling to incoherent hopping regime at different temperatures therefore we apply the vibronic dephasing model and compare the results to the buttiker probe model which is commonly used to describe decoherence effects in charge transport using the full ladder model and simplified 1d model of dna we consider molecular junctions with alternating and stacked gc sequences and compare our results to recent experimental measurements | [['in', 'this', 'work', 'we', 'investigate', 'the', 'interplay', 'between', 'coherent', 'and', 'incoherent', 'charge', 'transport', 'in', 'cytosineguanine', 'gc', 'rich', 'dna', 'molecules', 'our', 'objective', 'is', 'to', 'introduce', 'physically', 'grounded', 'approach', 'to', 'dephasing', 'in', 'large', 'molecules', 'and', 'to', 'understand', 'the', 'length', 'dependent', 'charge', 'transport', 'characteristics', 'and', 'especially', 'the', 'crossover', 'from', 'coherent', 'tunneling', 'to', 'incoherent', 'hopping', 'regime', 'at', 'different', 'temperatures', 'therefore', 'we', 'apply', 'the', 'vibronic', 'dephasing', 'model', 'and', 'compare', 'the', 'results', 'to', 'the', 'buttiker', 'probe', 'model', 'which', 'is', 'commonly', 'used', 'to', 'describe', 'decoherence', 'effects', 'in', 'charge', 'transport', 'using', 'the', 'full', 'ladder', 'model', 'and', 'simplified', '1d', 'model', 'of', 'dna', 'we', 'consider', 'molecular', 'junctions', 'with', 'alternating', 'and', 'stacked', 'gc', 'sequences', 'and', 'compare', 'our', 'results', 'to', 'recent', 'experimental', 'measurements']] | [-0.08660841594788839, 0.14651279387445273, -0.0599188187117265, 0.1040850312247957, -0.007065518456511199, -0.1679046575107019, 0.060261978606947444, 0.40364399198442696, -0.2969744670924477, -0.2569657113614746, -0.04365903592922471, -0.2873848844065585, -0.1390390524725345, 0.17337310504676265, 0.005145684566179459, 0.014092398705807599, 0.02572980480776592, -0.07958233841451477, -0.037495076956904745, -0.17713915271345865, 0.27774053621529177, 0.054664783586155286, 0.3261827545917847, 0.0959808584260331, 0.07336958457440645, 0.017479898052459412, -0.00036924602252177215, -0.020568556863475928, -0.1948029749645767, 0.10825711094181646, 0.26309930239169094, -0.027508508924140848, 0.15598714625547555, -0.4961197581142187, -0.22661447294733741, 0.029565378622448242, 0.15684564569171264, 0.21930126322285187, -0.006499495361508294, -0.2574126925742762, 0.024538672920739787, -0.15332332867282358, -0.07543335855245294, -0.09961327527522702, -0.0011203733992508867, 0.04158196887848052, -0.2642914992841807, 0.12007423498223281, 0.014808573612985624, 0.02915627570526505, -0.051945839267732066, -0.06505916789597409, 0.0019974530970847063, 0.12272713418563151, 0.02369391996392303, 0.01859874053942886, 0.200940944948657, -0.0868980132868852, -0.11729762484742837, 0.3444655434651808, -0.104760684045455, -0.1710313193542375, 0.24602478752759369, -0.1591091974723068, -0.0997324356788092, 0.09249432489106602, 0.13819028688806362, 0.11219330852935937, -0.21047621619972315, 0.024276572381760078, -0.014903245282105425, 0.1587748325895518, 0.011627404973842204, 0.10191785993731835, 0.19905266851948744, 0.20870157024738464, -0.010828927561471408, 0.17798909066160293, -0.1396609768059782, -0.15232627438804644, -0.2224495230200277, -0.10249521452086893, -0.1681786037875678, 0.07027279644019224, -0.023571428740317722, -0.12829945342276583, 0.41843434301289645, 0.23470615911805495, 0.20911346430974928, 0.013031726579224183, 0.3070078802041032, 0.06936169268499891, 0.0412764497154223, -0.0019021606898273933, 0.19264341026163576, 0.17602981762135061, 0.07618386688726869, -0.34392852707639, 0.03683757852784104, -0.015243815660307353] |
1,802.002 | A method for model-independent measurement of the CKM angle $\beta$ via
time-dependent analysis of the $B^0\to D\pi^+\pi^-$, $D\to K_S^0\pi^+\pi^-$
decays | A new method for model-independent measurement of the CKM angle $\beta$ is
proposed, that employs time-dependent analysis of flavour-tagged $B^0\to
D\pi^+\pi^-$ decays with $D$ meson decays into CP-specific
and~$K_S^0\pi^+\pi^-$ final states. This method can be used to measure the
angle $\beta$ with future data from the Belle II and LHCb experiments with the
precision level of one degree.
| hep-ph physics.atom-ph | a new method for modelindependent measurement of the ckm angle beta is proposed that employs timedependent analysis of flavourtagged b0to dpipi decays with d meson decays into cpspecific andk_s0pipi final states this method can be used to measure the angle beta with future data from the belle ii and lhcb experiments with the precision level of one degree | [['a', 'new', 'method', 'for', 'modelindependent', 'measurement', 'of', 'the', 'ckm', 'angle', 'beta', 'is', 'proposed', 'that', 'employs', 'timedependent', 'analysis', 'of', 'flavourtagged', 'b0to', 'dpipi', 'decays', 'with', 'd', 'meson', 'decays', 'into', 'cpspecific', 'andk_s0pipi', 'final', 'states', 'this', 'method', 'can', 'be', 'used', 'to', 'measure', 'the', 'angle', 'beta', 'with', 'future', 'data', 'from', 'the', 'belle', 'ii', 'and', 'lhcb', 'experiments', 'with', 'the', 'precision', 'level', 'of', 'one', 'degree']] | [-0.025551245398154215, 0.20145305452336157, -0.12833800981752574, 0.024549545853265693, -0.064220377609932, -0.22005980564115038, 0.08686518496168512, 0.28098463360220194, -0.2186480267472299, -0.2372272708037469, -0.01637425576336682, -0.35083007819152306, -0.021572379861027002, 0.18779968867810176, 0.08050359792209097, 0.1714277553172516, 0.1621128673349241, -0.022178163452606117, -0.08653162575709368, -0.16080660474420125, 0.2557533894931631, 0.05877314085539963, 0.2072771594560306, 0.07866213643657309, -0.015669138650991954, -0.005208660399408213, -0.06159318729104208, -0.01868896954277131, -0.13601433294921403, 0.07652045646162671, 0.20593026310338505, 0.2235838000862194, 0.1362918476640646, -0.30853201665117275, -0.04112841698016772, 0.14112156217119523, 0.14208220149989106, 0.059537587371388714, -0.020398119896916405, -0.4317997587246022, 0.09783203963784867, -0.15148921809642552, -0.13594722920762642, -0.12286093979076083, 0.008959123598677772, -0.08353535538273198, -0.41970931499132086, 0.11165505323775246, -0.12712600485454978, 0.03209321714738118, 0.0433485233391236, -0.2509408055837931, 0.02976525788627831, 0.05068449167967109, 0.09585270178753749, 0.11820970736204929, 0.1569676193342145, -0.07617418519138093, -0.1740814681397751, 0.33624430473095607, -0.10445443890057504, -0.2062875774239988, 0.07690168310156358, -0.23930654115143365, -0.1472901321581698, 0.13359770930505224, 0.22456589128289903, 0.05774800863582641, -0.15206900904221193, 0.08986149972666421, -0.02503027835129095, 0.2166575504067753, 0.04405178956637558, 0.032557642174651846, 0.14913238671475224, 0.2361887225748173, 0.026072369306348264, 0.02231138759816531, -0.17334520655484603, 0.008370502103519226, -0.39175935009760515, -0.1449294386132221, -0.11146629742246919, 0.05250784229428973, -0.07229080693105061, -0.061862745189241, 0.41067774736854645, 0.06928318786335044, 0.27581683662720025, 0.0010210171375157578, 0.3395495424712343, 0.08341170353482344, 0.0585195574863714, 0.025828741914925298, 0.3187492542617422, 0.17068106250371784, 0.12020730749437851, -0.30084719058608506, 0.08377071306209213, 0.052626792316524576] |
1,802.00201 | Supernovae study: Context of the 4-m ILMT facility | The upcoming 4-m International Liquid Mirror Telescope (ILMT) facility will
perform deep imaging (in single scan $g'$ $\sim$22 mag.) of a narrow strip of
sky each clear night in the Time Delayed Integration mode. A cadence of one day
observation will provide unique opportunities to discover different types of
supernovae (SNe) along with many other types of variable sources. We present
the approach to discover SNe with the ILMT and discuss the follow-up strategy
in the context of other existing observational facilities. The advantages of
the ILMT observations over the traditional glass mirror telescopes are also
discussed.
| astro-ph.IM astro-ph.HE | the upcoming 4m international liquid mirror telescope ilmt facility will perform deep imaging in single scan g sim22 mag of a narrow strip of sky each clear night in the time delayed integration mode a cadence of one day observation will provide unique opportunities to discover different types of supernovae sne along with many other types of variable sources we present the approach to discover sne with the ilmt and discuss the followup strategy in the context of other existing observational facilities the advantages of the ilmt observations over the traditional glass mirror telescopes are also discussed | [['the', 'upcoming', '4m', 'international', 'liquid', 'mirror', 'telescope', 'ilmt', 'facility', 'will', 'perform', 'deep', 'imaging', 'in', 'single', 'scan', 'g', 'sim22', 'mag', 'of', 'a', 'narrow', 'strip', 'of', 'sky', 'each', 'clear', 'night', 'in', 'the', 'time', 'delayed', 'integration', 'mode', 'a', 'cadence', 'of', 'one', 'day', 'observation', 'will', 'provide', 'unique', 'opportunities', 'to', 'discover', 'different', 'types', 'of', 'supernovae', 'sne', 'along', 'with', 'many', 'other', 'types', 'of', 'variable', 'sources', 'we', 'present', 'the', 'approach', 'to', 'discover', 'sne', 'with', 'the', 'ilmt', 'and', 'discuss', 'the', 'followup', 'strategy', 'in', 'the', 'context', 'of', 'other', 'existing', 'observational', 'facilities', 'the', 'advantages', 'of', 'the', 'ilmt', 'observations', 'over', 'the', 'traditional', 'glass', 'mirror', 'telescopes', 'are', 'also', 'discussed']] | [-0.1023141680448556, 0.10429354596249375, -0.08320066542604689, 0.061748689525405465, -0.1634386534485774, -0.184802485149853, 0.06024948586517772, 0.4391840927149217, -0.23231671072906315, -0.3249635404148667, 0.13665195417736858, -0.3356287668545529, -0.039986698840235924, 0.23577509914553657, -0.05446907303173913, -0.023517765671245215, 0.15120863449788585, -0.06449342948911452, -0.060559408931234446, -0.29053717168988946, 0.2269788347556707, 0.08466219594528102, 0.25952492809443994, -0.04925442927699421, 0.07415876140069101, -0.021355908032213867, -0.12480082499468219, -0.038175303940229194, -0.1352385407620945, 0.049643184351206744, 0.29688957686171163, 0.1733033988401582, 0.24299693240102418, -0.39899551979093284, -0.22621573593237043, 0.09717392121422459, 0.11223027846996778, 0.01756648429352598, -0.037936166723345204, -0.2981960071087575, -0.005863834297303686, -0.15037408111532657, -0.20162141849718912, 0.033092650133617146, -0.01589831475590922, 0.08865821042749791, -0.17792967224455217, 0.006613026922460664, -0.05658287814213443, 0.08644859626236343, -0.07465672861189418, -0.13221142212524242, 0.02173116527372952, 0.0805890266255466, 0.01769081001006758, 0.041009360861954926, 0.060685092636105636, -0.16159926732512928, -0.11205710923676043, 0.3682078547180467, -0.05964795027657883, 0.01962135764818216, 0.1823162255693496, -0.20508883285729848, -0.17217738801594248, 0.1268159132738857, 0.1768051214304935, 0.10591370593180362, -0.14780568359803753, -0.0035736284839210206, 0.01664710577130894, 0.16293300499601923, 0.03542729012533715, 0.10820694339759264, 0.2885931081705026, 0.22806303416013948, 0.0911874376644246, 0.10705294057885281, -0.2937184355471322, -0.008341418291182862, -0.317775210509672, -0.13795499154666593, -0.07694614706074905, 0.01829520045520411, -0.07147521245729577, -0.09970384251899998, 0.40818024518870816, 0.14634441449930988, 0.12101412203508555, 0.007952155166103975, 0.3165056391321507, -0.025678043704979198, 0.1420192257789223, -0.018998444483605856, 0.3043320455405976, 0.051894718891528156, 0.16870292297626854, -0.18029395355987027, -0.015009768191993851, -0.006461160953550302] |
1,802.00202 | Network construction: A learning framework through localizing principal
eigenvector | Information of localization properties of eigenvectors of the complex network
has applicability in many different areas which include networks centrality
measures, spectral partitioning, development of approximation algorithms, and
disease spreading phenomenon. For linear dynamical process localization of
principal eigenvector (PEV) of adjacency matrices infers condensation of the
information in the smaller section of the network. For a network, an
eigenvector is said to be localized when most of its components are near to
zero with few taking very high values. Here, we provide three different
random-sampling-based algorithms which, by using the edge rewiring method, can
evolve a random network having a delocalized PEV to a network having a highly
localized PEV. In other words, we develop a learning framework to explore the
localization of PEV through a random sampling-based optimization method. We
discuss the drawbacks and advantages of these algorithms. Additionally, we show
that the construction of such networks corresponding to the highly localized
PEV is a non-convex optimization problem when the objective function is the
inverse participation ratio. This framework is also relevant to construct a
network structure for other lower-order eigenvectors.
| physics.soc-ph cs.SI | information of localization properties of eigenvectors of the complex network has applicability in many different areas which include networks centrality measures spectral partitioning development of approximation algorithms and disease spreading phenomenon for linear dynamical process localization of principal eigenvector pev of adjacency matrices infers condensation of the information in the smaller section of the network for a network an eigenvector is said to be localized when most of its components are near to zero with few taking very high values here we provide three different randomsamplingbased algorithms which by using the edge rewiring method can evolve a random network having a delocalized pev to a network having a highly localized pev in other words we develop a learning framework to explore the localization of pev through a random samplingbased optimization method we discuss the drawbacks and advantages of these algorithms additionally we show that the construction of such networks corresponding to the highly localized pev is a nonconvex optimization problem when the objective function is the inverse participation ratio this framework is also relevant to construct a network structure for other lowerorder eigenvectors | [['information', 'of', 'localization', 'properties', 'of', 'eigenvectors', 'of', 'the', 'complex', 'network', 'has', 'applicability', 'in', 'many', 'different', 'areas', 'which', 'include', 'networks', 'centrality', 'measures', 'spectral', 'partitioning', 'development', 'of', 'approximation', 'algorithms', 'and', 'disease', 'spreading', 'phenomenon', 'for', 'linear', 'dynamical', 'process', 'localization', 'of', 'principal', 'eigenvector', 'pev', 'of', 'adjacency', 'matrices', 'infers', 'condensation', 'of', 'the', 'information', 'in', 'the', 'smaller', 'section', 'of', 'the', 'network', 'for', 'a', 'network', 'an', 'eigenvector', 'is', 'said', 'to', 'be', 'localized', 'when', 'most', 'of', 'its', 'components', 'are', 'near', 'to', 'zero', 'with', 'few', 'taking', 'very', 'high', 'values', 'here', 'we', 'provide', 'three', 'different', 'randomsamplingbased', 'algorithms', 'which', 'by', 'using', 'the', 'edge', 'rewiring', 'method', 'can', 'evolve', 'a', 'random', 'network', 'having', 'a', 'delocalized', 'pev', 'to', 'a', 'network', 'having', 'a', 'highly', 'localized', 'pev', 'in', 'other', 'words', 'we', 'develop', 'a', 'learning', 'framework', 'to', 'explore', 'the', 'localization', 'of', 'pev', 'through', 'a', 'random', 'samplingbased', 'optimization', 'method', 'we', 'discuss', 'the', 'drawbacks', 'and', 'advantages', 'of', 'these', 'algorithms', 'additionally', 'we', 'show', 'that', 'the', 'construction', 'of', 'such', 'networks', 'corresponding', 'to', 'the', 'highly', 'localized', 'pev', 'is', 'a', 'nonconvex', 'optimization', 'problem', 'when', 'the', 'objective', 'function', 'is', 'the', 'inverse', 'participation', 'ratio', 'this', 'framework', 'is', 'also', 'relevant', 'to', 'construct', 'a', 'network', 'structure', 'for', 'other', 'lowerorder', 'eigenvectors']] | [-0.11195821606728075, 0.08855752416658996, -0.06502125872769854, 0.0888797437352408, -0.059598198910192635, -0.1416565574440788, 0.007500173375624549, 0.41978352074767206, -0.31088777776144877, -0.27389667965829945, 0.0850307818989597, -0.2799016458882981, -0.2023123314957247, 0.13090599422978882, -0.025676439639058087, 0.05962204856385162, 0.0912540184415795, 0.04008915607071006, -0.07297623888870886, -0.21481425931119452, 0.31679333532536097, 0.058842497093092576, 0.28597479220863514, 0.07285476418641898, 0.08415275870676531, -0.00942491806767226, 0.01588039018807339, 0.021105648165538008, -0.06590014816138537, 0.17676392485129208, 0.29154251803833336, 0.17749170160719327, 0.33503845531959087, -0.37476532318844247, -0.2305050264066277, 0.14216673846745476, 0.17767439317725764, 0.09177064099016466, 0.01537037529511848, -0.2991744932913027, 0.1466713973889025, -0.18095646546334848, -0.0956980203058325, -0.07618810298883326, -0.013278150905414924, 0.014424827887553844, -0.2856131065307456, 0.05435307731370283, 0.04197507153139168, 0.009149561016973886, -0.031143942112896263, -0.11673428921110846, 0.015064153781897583, 0.12923088569128835, 0.060807690019098845, -0.018786307208106985, 0.1479838598662844, -0.13180362845254182, -0.16543666585246203, 0.34501546633092095, 0.0046690675886706095, -0.2063501283124564, 0.18116164672096352, -0.07859136937646666, -0.14636162222378407, 0.16566638024216826, 0.22940646274914647, 0.1165301901759109, -0.15794096998042034, 0.03502358835488609, -0.021064832844965898, 0.13260984270939613, 0.012700664040704187, 0.026858762715774292, 0.1648374188264095, 0.2200571187224321, 0.15150440846640037, 0.12023258034733462, -0.10042850840785592, -0.08744529555909909, -0.23271112220750734, -0.105206899955302, -0.22233634449958617, 0.04016546008898621, -0.15135296766763262, -0.21230888378980395, 0.4757503497690617, 0.1694444919613978, 0.24602569209585723, 0.07028442580421752, 0.28072740572535404, 0.1067528199483794, 0.05105935143061228, 0.09003780508966563, 0.19925947413283432, 0.11963792857256651, 0.09770764586270102, -0.16091838314269596, 0.07073290613838114, 0.07636215983602797] |
1,802.00203 | Optimizing the dynamical behavior of a dual frequency parametric
amplifier with quadratic and cubic nonlinearities | The paper describes a novel parametric excitation scheme that acts as a
tunable amplifier by controlling two pumping signals and two nonlinear feedback
terms. By modulating the stiffness of a mechanical oscillator with a digital
signal processor, low frequency inputs are projected onto a higher resonance
frequency, thus exploiting the natural selective filtering of such structures.
Described is an optimized dual-term nonlinear stiffness resonator that enhances
the input signal level and the sensitivity to changes in both amplitude and
phase, while limiting the obtained response to desired levels. This amplifier
is geared to cases when the frequency of the input is known or measurable, like
in rotating structures, while the amplitude and phase are too weak to be
detected without amplification. It is shown that by tuning the cubic and
quadratic feedback terms, the amplifier benefits from a nearly linear response
behavior, while exploiting the benefits of nonlinear and pumping signal
enhancements.
| physics.app-ph | the paper describes a novel parametric excitation scheme that acts as a tunable amplifier by controlling two pumping signals and two nonlinear feedback terms by modulating the stiffness of a mechanical oscillator with a digital signal processor low frequency inputs are projected onto a higher resonance frequency thus exploiting the natural selective filtering of such structures described is an optimized dualterm nonlinear stiffness resonator that enhances the input signal level and the sensitivity to changes in both amplitude and phase while limiting the obtained response to desired levels this amplifier is geared to cases when the frequency of the input is known or measurable like in rotating structures while the amplitude and phase are too weak to be detected without amplification it is shown that by tuning the cubic and quadratic feedback terms the amplifier benefits from a nearly linear response behavior while exploiting the benefits of nonlinear and pumping signal enhancements | [['the', 'paper', 'describes', 'a', 'novel', 'parametric', 'excitation', 'scheme', 'that', 'acts', 'as', 'a', 'tunable', 'amplifier', 'by', 'controlling', 'two', 'pumping', 'signals', 'and', 'two', 'nonlinear', 'feedback', 'terms', 'by', 'modulating', 'the', 'stiffness', 'of', 'a', 'mechanical', 'oscillator', 'with', 'a', 'digital', 'signal', 'processor', 'low', 'frequency', 'inputs', 'are', 'projected', 'onto', 'a', 'higher', 'resonance', 'frequency', 'thus', 'exploiting', 'the', 'natural', 'selective', 'filtering', 'of', 'such', 'structures', 'described', 'is', 'an', 'optimized', 'dualterm', 'nonlinear', 'stiffness', 'resonator', 'that', 'enhances', 'the', 'input', 'signal', 'level', 'and', 'the', 'sensitivity', 'to', 'changes', 'in', 'both', 'amplitude', 'and', 'phase', 'while', 'limiting', 'the', 'obtained', 'response', 'to', 'desired', 'levels', 'this', 'amplifier', 'is', 'geared', 'to', 'cases', 'when', 'the', 'frequency', 'of', 'the', 'input', 'is', 'known', 'or', 'measurable', 'like', 'in', 'rotating', 'structures', 'while', 'the', 'amplitude', 'and', 'phase', 'are', 'too', 'weak', 'to', 'be', 'detected', 'without', 'amplification', 'it', 'is', 'shown', 'that', 'by', 'tuning', 'the', 'cubic', 'and', 'quadratic', 'feedback', 'terms', 'the', 'amplifier', 'benefits', 'from', 'a', 'nearly', 'linear', 'response', 'behavior', 'while', 'exploiting', 'the', 'benefits', 'of', 'nonlinear', 'and', 'pumping', 'signal', 'enhancements']] | [-0.16131304187734075, 0.15375036486998486, -0.014291286813897013, -0.00791071449631566, -0.09556454540514048, -0.1724664435247021, 0.04671027017556846, 0.3888684790704819, -0.28906184096900833, -0.28813918837691527, 0.10904805579867263, -0.2519485957192763, -0.18474549923665723, 0.23563184013547042, -0.019375224897656466, 0.05900137794947264, 0.0066407698854982905, 0.005415814333527491, -0.04980003428398724, -0.14438465325044628, 0.25690861298149104, 0.0878355290420008, 0.3212123125055666, -0.028154291656633086, 0.1628917484306761, -0.007280712434270308, 0.03390776702443397, -0.008097725501662257, -0.03462954233195255, 0.06881139198722301, 0.27078770323724344, 0.053022197934965425, 0.26750655560303227, -0.38230760627432375, -0.2269396755508215, 0.08302083759898604, 0.12619931569834864, 0.14219171350161908, -0.05592807757649694, -0.2738250610079394, 0.049733509976472336, -0.14673490606908324, -0.09154453700013607, -0.08438696602778818, -0.02105274684542161, 0.05140978724238272, -0.3058673790995254, 0.0570389939478247, 0.11532390912044917, 0.042202051309560305, -0.02265940407531595, -0.061776594736841536, -0.05166293949733754, 0.09982984557239777, -0.03375059554495213, 0.019318504996994043, 0.18978755321008284, -0.17936934505601643, -0.0848075995061374, 0.3573368811137228, -0.11519337096714125, -0.20043074312181958, 0.15225086289007736, -0.13583014788035155, -0.02269030108489713, 0.17408506566078852, 0.1716882390253838, 0.030284752555820624, -0.13285373066159178, 0.024922952197258135, 0.09196826748994012, 0.24698479694394482, 0.12414788323707435, 0.08920725681109737, 0.18852587378219954, 0.1669482216470264, 0.07224250395723698, 0.18013487210333817, -0.07422147751924588, -0.04791224944337413, -0.25888398429186127, -0.05678097943510145, -0.17511492098576778, 0.003321310206908511, -0.058889339332020105, -0.12205412747555826, 0.44168777053871494, 0.10090535067465921, 0.19620738980292485, 0.021833786022362134, 0.3718582609335318, 0.20850535242167603, 0.08755104224018703, 0.013429007099768677, 0.28980734638117306, 0.15065566569548225, 0.08460434627509522, -0.2783770628793116, 0.04825762410444633, -0.02950561887720316] |
1,802.00204 | High-energy Emission Properties of Pulsars | The sheer number of new gamma-ray pulsar discoveries by the Fermi Large Area
Telescope since 2008, combined with the quality of new multi-frequency data,
has caused a revolution in the field of high-energy rotation-powered pulsars.
These rapidly rotating neutron stars exhibit rich spectral and temporal
phenomenology, indicating that there are still many unsolved mysteries
regarding the magnetospheric conditions in these stars - even after 50 years of
research! Indeed, 2017 marks the golden anniversary of the discovery of the
first radio pulsar, and theorists and observers alike are looking forward to
another half-century of discovery, with many new experiments coming online in
the next decades. In this review paper, we will briefly summarise recent HE
pulsar observations, mention some theoretical models that provide a basic
framework within which to make sense of the varied measurements, and finally
review some of the latest theoretical developments in pulsar emission
modelling.
| astro-ph.HE | the sheer number of new gammaray pulsar discoveries by the fermi large area telescope since 2008 combined with the quality of new multifrequency data has caused a revolution in the field of highenergy rotationpowered pulsars these rapidly rotating neutron stars exhibit rich spectral and temporal phenomenology indicating that there are still many unsolved mysteries regarding the magnetospheric conditions in these stars even after 50 years of research indeed 2017 marks the golden anniversary of the discovery of the first radio pulsar and theorists and observers alike are looking forward to another halfcentury of discovery with many new experiments coming online in the next decades in this review paper we will briefly summarise recent he pulsar observations mention some theoretical models that provide a basic framework within which to make sense of the varied measurements and finally review some of the latest theoretical developments in pulsar emission modelling | [['the', 'sheer', 'number', 'of', 'new', 'gammaray', 'pulsar', 'discoveries', 'by', 'the', 'fermi', 'large', 'area', 'telescope', 'since', '2008', 'combined', 'with', 'the', 'quality', 'of', 'new', 'multifrequency', 'data', 'has', 'caused', 'a', 'revolution', 'in', 'the', 'field', 'of', 'highenergy', 'rotationpowered', 'pulsars', 'these', 'rapidly', 'rotating', 'neutron', 'stars', 'exhibit', 'rich', 'spectral', 'and', 'temporal', 'phenomenology', 'indicating', 'that', 'there', 'are', 'still', 'many', 'unsolved', 'mysteries', 'regarding', 'the', 'magnetospheric', 'conditions', 'in', 'these', 'stars', 'even', 'after', '50', 'years', 'of', 'research', 'indeed', '2017', 'marks', 'the', 'golden', 'anniversary', 'of', 'the', 'discovery', 'of', 'the', 'first', 'radio', 'pulsar', 'and', 'theorists', 'and', 'observers', 'alike', 'are', 'looking', 'forward', 'to', 'another', 'halfcentury', 'of', 'discovery', 'with', 'many', 'new', 'experiments', 'coming', 'online', 'in', 'the', 'next', 'decades', 'in', 'this', 'review', 'paper', 'we', 'will', 'briefly', 'summarise', 'recent', 'he', 'pulsar', 'observations', 'mention', 'some', 'theoretical', 'models', 'that', 'provide', 'a', 'basic', 'framework', 'within', 'which', 'to', 'make', 'sense', 'of', 'the', 'varied', 'measurements', 'and', 'finally', 'review', 'some', 'of', 'the', 'latest', 'theoretical', 'developments', 'in', 'pulsar', 'emission', 'modelling']] | [-0.0810254905372858, 0.16757194797958241, -0.05507656347266316, 0.08478707154352712, -0.17731280437493252, -0.10766688486890627, 0.05946223174940896, 0.35785998226631255, -0.21833274535023842, -0.3454762519951783, 0.11936601781885006, -0.3005668106710627, -0.11006098990740419, 0.2831392696215993, -0.082942627243251, 0.005385028375756173, 0.1459183738864705, -0.026867217233612007, -0.06615895112235175, -0.2722378107469662, 0.27516962576429455, 0.10862471685320342, 0.19931817761793427, 0.046812879380953756, 0.05733104162060713, -0.05233252989635074, -0.11256392124318043, -0.032581434262042144, -0.14121974365150977, 0.12512101275651544, 0.27828108332529017, 0.19854822234079547, 0.2694419248815195, -0.4513020030077116, -0.21942074141911783, 0.052189947508250165, 0.13227819677974498, 0.058240107371318184, -0.10440275268185706, -0.29602365783054607, 0.013407331127926808, -0.21351096146188828, -0.182671086048568, -0.021022298268349778, 0.06804684693624145, 0.053889834084453025, -0.09643333933560089, 0.0271203122640244, 0.05073076305470626, 0.07871430957504567, -0.07421350747039605, -0.12496173448170073, 0.10048190085771716, 0.08132933164142123, 0.15598978581173079, 0.0587060973760957, 0.044136624359589094, -0.18372461231596462, -0.14556434998988826, 0.36729712840359735, -0.034169213583797445, 0.010567573862162982, 0.19223042303176763, -0.24494443885145747, -0.2585884536407432, 0.1114873867481947, 0.1702819672685598, 0.06366102016676649, -0.1782938300879026, 0.04677241723224217, -0.05160706716614972, 0.14258644351621672, 0.05418514351037388, 0.059298962329317924, 0.33206003472893214, 0.19323962158998664, -0.021394337091094427, 0.0726521512791261, -0.1800249124097885, -0.08002208400086887, -0.2705204728753211, -0.10159223983507781, -0.1248437244156819, 0.06705585953171309, -0.02396526836059975, -0.11509379877575807, 0.4136723361998087, 0.1605679371368875, 0.1504231969110009, -0.021314795763345853, 0.2684810663491082, 0.049029174225157776, 0.024286743418193188, 0.12185375812007304, 0.33729583903280763, 0.14447789449010323, 0.1647147804397304, -0.14778768849324714, 0.07238923272729351, -0.03485415221134923] |
1,802.00205 | Manipulating spins of magnetic molecules: Hysteretic behavior with
respect to bias voltage | Formation of a magnetic hysteresis loop with respect to a bias voltage is
investigated theoretically in a spin-valve device based on a single magnetic
molecule. We consider a device consisting of two ferromagnetic electrodes
bridged by a carbon nanotube, acting as a quantum dot, to which a
spin-anisotropic molecule is exchange coupled. Such a coupling allows for
transfer of angular momentum between the molecule and a spin current flowing
through the dot, and thus, for switching orientation of the molecular spin. We
demonstrate that this current-induced switching process exhibits a hysteretic
behavior with respect to a bias voltage applied to the device. The analysis is
carried out with the use of the real-time diagrammatic technique in the
lowest-order expansion of the tunnel coupling of the dot to electrodes. The
influence of both the intrinsic properties of the spin-valve device (the spin
polarization of electrodes and the coupling strength of the molecule to the
dot) and those of the molecule itself (magnetic anisotropy and spin relaxation)
on the size of the magnetic hysteresis loop is discussed.
| cond-mat.mes-hall | formation of a magnetic hysteresis loop with respect to a bias voltage is investigated theoretically in a spinvalve device based on a single magnetic molecule we consider a device consisting of two ferromagnetic electrodes bridged by a carbon nanotube acting as a quantum dot to which a spinanisotropic molecule is exchange coupled such a coupling allows for transfer of angular momentum between the molecule and a spin current flowing through the dot and thus for switching orientation of the molecular spin we demonstrate that this currentinduced switching process exhibits a hysteretic behavior with respect to a bias voltage applied to the device the analysis is carried out with the use of the realtime diagrammatic technique in the lowestorder expansion of the tunnel coupling of the dot to electrodes the influence of both the intrinsic properties of the spinvalve device the spin polarization of electrodes and the coupling strength of the molecule to the dot and those of the molecule itself magnetic anisotropy and spin relaxation on the size of the magnetic hysteresis loop is discussed | [['formation', 'of', 'a', 'magnetic', 'hysteresis', 'loop', 'with', 'respect', 'to', 'a', 'bias', 'voltage', 'is', 'investigated', 'theoretically', 'in', 'a', 'spinvalve', 'device', 'based', 'on', 'a', 'single', 'magnetic', 'molecule', 'we', 'consider', 'a', 'device', 'consisting', 'of', 'two', 'ferromagnetic', 'electrodes', 'bridged', 'by', 'a', 'carbon', 'nanotube', 'acting', 'as', 'a', 'quantum', 'dot', 'to', 'which', 'a', 'spinanisotropic', 'molecule', 'is', 'exchange', 'coupled', 'such', 'a', 'coupling', 'allows', 'for', 'transfer', 'of', 'angular', 'momentum', 'between', 'the', 'molecule', 'and', 'a', 'spin', 'current', 'flowing', 'through', 'the', 'dot', 'and', 'thus', 'for', 'switching', 'orientation', 'of', 'the', 'molecular', 'spin', 'we', 'demonstrate', 'that', 'this', 'currentinduced', 'switching', 'process', 'exhibits', 'a', 'hysteretic', 'behavior', 'with', 'respect', 'to', 'a', 'bias', 'voltage', 'applied', 'to', 'the', 'device', 'the', 'analysis', 'is', 'carried', 'out', 'with', 'the', 'use', 'of', 'the', 'realtime', 'diagrammatic', 'technique', 'in', 'the', 'lowestorder', 'expansion', 'of', 'the', 'tunnel', 'coupling', 'of', 'the', 'dot', 'to', 'electrodes', 'the', 'influence', 'of', 'both', 'the', 'intrinsic', 'properties', 'of', 'the', 'spinvalve', 'device', 'the', 'spin', 'polarization', 'of', 'electrodes', 'and', 'the', 'coupling', 'strength', 'of', 'the', 'molecule', 'to', 'the', 'dot', 'and', 'those', 'of', 'the', 'molecule', 'itself', 'magnetic', 'anisotropy', 'and', 'spin', 'relaxation', 'on', 'the', 'size', 'of', 'the', 'magnetic', 'hysteresis', 'loop', 'is', 'discussed']] | [-0.22103942944668234, 0.12311139136020627, -0.02323137194051274, -0.02810150622418275, -0.0366137021780014, -0.15860660360061696, 0.07226758014011596, 0.4105911892492856, -0.2653640013879963, -0.2909331688371354, -0.00393408940971962, -0.2547156478319084, -0.08752846107951233, 0.22240391001637494, 0.05658004652442677, -0.004696882694427456, 0.015125072186014481, 0.009877631855862481, -0.05325844475999474, -0.12955466870883744, 0.27659949600297423, 0.012012263732696218, 0.2949542841847454, 0.10947979386629803, 0.12492748021813375, -0.008849803797368492, 0.12518633402750962, 0.05982238824479282, -0.10193739375519466, 0.09843270554473357, 0.1724782647059432, -0.10233720717951655, 0.2043040622965366, -0.47347971481404133, -0.1491047942585179, -0.0021513385166014943, 0.11814528507845742, 0.146887097642757, -0.04647776561747638, -0.26025612012217086, 0.03523105709547443, -0.16889675141844365, -0.09037805747739705, -0.03768232102505863, -0.001980305892814483, 0.0461883091407695, -0.29155522359269004, 0.06310632126405835, 0.06720902566398892, 0.05085449698381126, -0.015700596635163364, -0.05704938116350344, -0.06906929369483675, 0.10259351275096248, 0.025386119670334405, 0.05593534315803221, 0.269616393220744, -0.1260911017496671, -0.1491923696707402, 0.30510142220982484, -0.0815922067327691, -0.18037282867623228, 0.13478590783530048, -0.19007425088568458, -0.04240972275180476, 0.09111883938112961, 0.11568063605044569, 0.11453146417957864, -0.18352096802155887, 0.07254895705031231, 0.04012719783399786, 0.16749289713400814, 0.04179327514155635, 0.033075607678453835, 0.2709876018177186, 0.24565309923674378, 0.059441599031644206, 0.2027506464081151, -0.1741393182692783, -0.10416087660539364, -0.2407071074258004, -0.19674896434880793, -0.20149265036519085, 0.13022437067901982, -0.06696686130673957, -0.20873933648956675, 0.44888629961226667, 0.14380017038168652, 0.18285845308165466, -0.054739326716932865, 0.3160459000510829, 0.1160206350970215, 0.09474828565227134, -0.024210588937359195, 0.24706698763583387, 0.2488358112118606, 0.12214852771987872, -0.38726741170244555, 0.07548326597682067, -0.049049165827621304] |
1,802.00206 | Angular correlation results from ALICE | In heavy-ion collisions, the quark-gluon plasma is expected to be produced,
which is an almost perfect liquid that made up the Universe a few microseconds
after the Big Bang. In these collisions, jets are also formed from hadronizing
partons with high transverse momentum, and they traverse the hot and dense
medium and interact with it. Their properties can be modified by these
interactions, therefore these modifications, if present, can give insight into
the properties of the plasma itself. Angular correlation measurements can be
used to study jets in Pb-Pb collisions in a transverse momentum ($p_{\rm T}$)
regime where jets are not easily reconstructable above the fluctuating
background. Small collision systems (e.g., pp or p-Pb) can be used as reference
for these measurements; however, these collisions themselves are of interest.
For example, particle production mechanisms and conservation laws can be tested
in these systems. Results from Pb-Pb and pp collisions recorded by the ALICE
detector are presented in this paper.
| hep-ex nucl-ex | in heavyion collisions the quarkgluon plasma is expected to be produced which is an almost perfect liquid that made up the universe a few microseconds after the big bang in these collisions jets are also formed from hadronizing partons with high transverse momentum and they traverse the hot and dense medium and interact with it their properties can be modified by these interactions therefore these modifications if present can give insight into the properties of the plasma itself angular correlation measurements can be used to study jets in pbpb collisions in a transverse momentum p_rm t regime where jets are not easily reconstructable above the fluctuating background small collision systems eg pp or ppb can be used as reference for these measurements however these collisions themselves are of interest for example particle production mechanisms and conservation laws can be tested in these systems results from pbpb and pp collisions recorded by the alice detector are presented in this paper | [['in', 'heavyion', 'collisions', 'the', 'quarkgluon', 'plasma', 'is', 'expected', 'to', 'be', 'produced', 'which', 'is', 'an', 'almost', 'perfect', 'liquid', 'that', 'made', 'up', 'the', 'universe', 'a', 'few', 'microseconds', 'after', 'the', 'big', 'bang', 'in', 'these', 'collisions', 'jets', 'are', 'also', 'formed', 'from', 'hadronizing', 'partons', 'with', 'high', 'transverse', 'momentum', 'and', 'they', 'traverse', 'the', 'hot', 'and', 'dense', 'medium', 'and', 'interact', 'with', 'it', 'their', 'properties', 'can', 'be', 'modified', 'by', 'these', 'interactions', 'therefore', 'these', 'modifications', 'if', 'present', 'can', 'give', 'insight', 'into', 'the', 'properties', 'of', 'the', 'plasma', 'itself', 'angular', 'correlation', 'measurements', 'can', 'be', 'used', 'to', 'study', 'jets', 'in', 'pbpb', 'collisions', 'in', 'a', 'transverse', 'momentum', 'p_rm', 't', 'regime', 'where', 'jets', 'are', 'not', 'easily', 'reconstructable', 'above', 'the', 'fluctuating', 'background', 'small', 'collision', 'systems', 'eg', 'pp', 'or', 'ppb', 'can', 'be', 'used', 'as', 'reference', 'for', 'these', 'measurements', 'however', 'these', 'collisions', 'themselves', 'are', 'of', 'interest', 'for', 'example', 'particle', 'production', 'mechanisms', 'and', 'conservation', 'laws', 'can', 'be', 'tested', 'in', 'these', 'systems', 'results', 'from', 'pbpb', 'and', 'pp', 'collisions', 'recorded', 'by', 'the', 'alice', 'detector', 'are', 'presented', 'in', 'this', 'paper']] | [-0.07747709905324539, 0.2858711650732168, -0.16493255679778251, 0.10740064545578482, -0.0018192882586999814, -0.10920919766415309, -0.11727605441822407, 0.38130620244082136, -0.2641512167716176, -0.32740529320852935, 0.026606765498096745, -0.3482426220562848, 0.05184055227235709, 0.16807526121217664, 0.02238199661878295, 0.06869924879697321, 0.13957988949633152, -0.007347549956127908, -0.006770477391418462, -0.23350039992551758, 0.2767161347335146, 0.1074329213275495, 0.18810144082625518, 0.12062624608512101, 0.05568182798184501, -0.002746314463445788, -0.01052618157169811, 0.07505100155717828, -0.08845567562455002, 0.012464258227674526, 0.2998094324157251, 0.07282070176230755, 0.16163202265576598, -0.4571448609601917, -0.17769856681115925, 0.11223930159126813, 0.1900590992419733, 0.10005514506388268, -0.08501777355339518, -0.26674966462126365, 0.11203829422662673, -0.22187777248404497, -0.1183304509042569, -0.07468414399040711, -0.015607682551673186, 0.06942920320657808, -0.27175819799787243, 0.10657510485147922, 0.027243667005769228, 0.02986602635860865, 0.0031091566065783206, -0.09241425072621999, -0.07301399918308235, 0.05561711518650394, 0.05719705841228741, 0.07117048404823825, 0.20039018833096017, -0.13889321027273815, -0.12157268109460473, 0.41758095858466326, 0.017781874639386276, -0.15810382857907024, 0.25181974246570804, -0.19515605094555602, -0.10437509252209475, 0.1594458552232633, 0.274127934809698, 0.0982296992043537, -0.22320643785034758, -0.01092515837982496, -0.0020533422470889375, 0.13277406298039984, 0.10473037449607872, 0.09682809138442126, 0.2428045270367051, 0.13728033224085592, -0.05302492622798602, 0.08622063331250336, -0.06099072843790054, -0.06441029596198115, -0.36558246343622114, -0.10352630490062278, -0.13734248989853282, 0.05786898632106626, -0.0634204417644852, -0.037793328391048334, 0.3169317803222616, 0.1181479527369001, 0.27516424285728225, -0.07980440412545518, 0.2903214676668809, 0.09175604617343219, 0.046470875230928264, 0.14616756766314074, 0.30899110297034, 0.12230238352123203, 0.1976945982812523, -0.17829780823275823, 0.06691976972623528, 0.026821481965997682] |
1,802.00207 | Highly Deformable and Mobile Palladium Nanocrystals as Efficient Carbon
Scavengers | Fouling of surfaces leads to performance degradation in many energy-intensive
industrial processes, but the present solutions are either too complicated to
be routinely used or incomplete for eradication. Here we propose and
demonstrate that carbon-containing deposits can be catalytically wiped out in
an efficient way by roaming palladium nanoparticles with extreme shape
flexibility at relatively low temperatures. Surprisingly, during their dramatic
liquid-like migrations, these particles could still maintain crystalline
interior and conserve their initial crystal orientations through self-surface
diffusion. Moreover, these catalytic particles were even able to become
regenerated by other roaming particles after occasionally deactivated by
surface coking or multiple-particle sintering. These findings shed light on
metabolically driven, "living" nanocrystals, and also open a new avenue for
efficient catalysis.
| physics.app-ph cond-mat.mes-hall | fouling of surfaces leads to performance degradation in many energyintensive industrial processes but the present solutions are either too complicated to be routinely used or incomplete for eradication here we propose and demonstrate that carboncontaining deposits can be catalytically wiped out in an efficient way by roaming palladium nanoparticles with extreme shape flexibility at relatively low temperatures surprisingly during their dramatic liquidlike migrations these particles could still maintain crystalline interior and conserve their initial crystal orientations through selfsurface diffusion moreover these catalytic particles were even able to become regenerated by other roaming particles after occasionally deactivated by surface coking or multipleparticle sintering these findings shed light on metabolically driven living nanocrystals and also open a new avenue for efficient catalysis | [['fouling', 'of', 'surfaces', 'leads', 'to', 'performance', 'degradation', 'in', 'many', 'energyintensive', 'industrial', 'processes', 'but', 'the', 'present', 'solutions', 'are', 'either', 'too', 'complicated', 'to', 'be', 'routinely', 'used', 'or', 'incomplete', 'for', 'eradication', 'here', 'we', 'propose', 'and', 'demonstrate', 'that', 'carboncontaining', 'deposits', 'can', 'be', 'catalytically', 'wiped', 'out', 'in', 'an', 'efficient', 'way', 'by', 'roaming', 'palladium', 'nanoparticles', 'with', 'extreme', 'shape', 'flexibility', 'at', 'relatively', 'low', 'temperatures', 'surprisingly', 'during', 'their', 'dramatic', 'liquidlike', 'migrations', 'these', 'particles', 'could', 'still', 'maintain', 'crystalline', 'interior', 'and', 'conserve', 'their', 'initial', 'crystal', 'orientations', 'through', 'selfsurface', 'diffusion', 'moreover', 'these', 'catalytic', 'particles', 'were', 'even', 'able', 'to', 'become', 'regenerated', 'by', 'other', 'roaming', 'particles', 'after', 'occasionally', 'deactivated', 'by', 'surface', 'coking', 'or', 'multipleparticle', 'sintering', 'these', 'findings', 'shed', 'light', 'on', 'metabolically', 'driven', 'living', 'nanocrystals', 'and', 'also', 'open', 'a', 'new', 'avenue', 'for', 'efficient', 'catalysis']] | [-0.0441147867607798, 0.2667749731131573, -0.07265075519602715, 0.05719132228175319, -0.04687784137028199, -0.1976232929076968, 0.08897520839862776, 0.4575305407663353, -0.2633220060266742, -0.3371000577140005, 0.12209556555226758, -0.25760326035978165, -0.13611477955064477, 0.1836463711146234, -0.08127766617910326, 0.018891468392968756, 0.06660920067909448, -0.07089602562819976, 0.03262237132675633, -0.24722172948727464, 0.20992064807527824, 0.083945529965856, 0.2707664085074696, 0.10208977498270634, 0.0416805591520329, -0.0563046793197086, 0.04838188340546986, 0.013990991678433259, -0.11687520092399449, 0.09628949748956747, 0.2694062772480881, 0.014475200125681502, 0.21702753991952964, -0.5650121156721055, -0.23482562579652844, 0.10049288192403917, 0.20518144604773456, 0.1046098989978464, -0.15085640137706013, -0.2356868796520123, 0.0725392338226964, -0.1277967909930133, -0.16811799795265084, -0.1437375479115627, 0.0007742346585297785, 0.018668107790657234, -0.19898416566126392, 0.0774172572592692, 0.044164267640576516, 0.049493846609726735, -0.05396479963297572, -0.10219897017344645, -0.07298856190045779, 0.09701583281691585, 0.056558866804160425, -0.0383916716619606, 0.26919296133809356, -0.11511671661101908, -0.06980437739212222, 0.38225246664183604, 0.017799702011236623, -0.16146352114605897, 0.2734413741942996, -0.12888633913239228, -0.09737179128202696, 0.23426748892808913, 0.18913531722060695, 0.12541593035229115, -0.18865942642750108, -0.02022767980987042, 0.0689789828161529, 0.13977051463404655, 0.12384417231640771, 0.02071116664720809, 0.2702930552646236, 0.18539869061772937, 0.03605427539138468, 0.12437715225494976, -0.04967148710597901, -0.07404114491063632, -0.14526926769929774, -0.1765476992126836, -0.1135522282345831, 0.07792603608979962, -0.06920282082877244, -0.15618020187312065, 0.29774363496548206, 0.12448188328739851, 0.1693028787213589, -0.03682167614426683, 0.23287180316157075, 0.00496066188118851, 0.08200487856432295, 0.05264360655075675, 0.23422677415626578, 0.04688112027630085, 0.13377497152683615, -0.1987962302352701, 0.15321429414643334, -0.038335362899297176] |
1,802.00208 | Selection dynamics in transient compartmentalization | Transient compartments have been recently shown to be able to maintain
functional replicators in the context of prebiotic studies. Motivated by this
experiment, we show that a broad class of selection dynamics is able to achieve
this goal. We identify two key parameters, the relative amplification of
non-active replicators (parasites) and the size of compartments. Since the
basic ingredients of our model are the competition between a host and its
parasite, and the diversity generated by small size compartments, our results
are relevant to various phage-bacteria or virus-host ecology problems.
| q-bio.PE cond-mat.soft physics.bio-ph | transient compartments have been recently shown to be able to maintain functional replicators in the context of prebiotic studies motivated by this experiment we show that a broad class of selection dynamics is able to achieve this goal we identify two key parameters the relative amplification of nonactive replicators parasites and the size of compartments since the basic ingredients of our model are the competition between a host and its parasite and the diversity generated by small size compartments our results are relevant to various phagebacteria or virushost ecology problems | [['transient', 'compartments', 'have', 'been', 'recently', 'shown', 'to', 'be', 'able', 'to', 'maintain', 'functional', 'replicators', 'in', 'the', 'context', 'of', 'prebiotic', 'studies', 'motivated', 'by', 'this', 'experiment', 'we', 'show', 'that', 'a', 'broad', 'class', 'of', 'selection', 'dynamics', 'is', 'able', 'to', 'achieve', 'this', 'goal', 'we', 'identify', 'two', 'key', 'parameters', 'the', 'relative', 'amplification', 'of', 'nonactive', 'replicators', 'parasites', 'and', 'the', 'size', 'of', 'compartments', 'since', 'the', 'basic', 'ingredients', 'of', 'our', 'model', 'are', 'the', 'competition', 'between', 'a', 'host', 'and', 'its', 'parasite', 'and', 'the', 'diversity', 'generated', 'by', 'small', 'size', 'compartments', 'our', 'results', 'are', 'relevant', 'to', 'various', 'phagebacteria', 'or', 'virushost', 'ecology', 'problems']] | [-0.06534295776315655, 0.11582332162393463, -0.03216647996256749, 0.08057774035648133, -0.04095216537308362, -0.10938337334017786, 0.042372928264861304, 0.3555261361102263, -0.27155106181485783, -0.31177121976442224, 0.07867981513393008, -0.23613878954201936, -0.22184843114939415, 0.15084019106191893, -0.1003098933543596, 0.022779230069136246, 0.01942410858658453, -0.00712245489574141, 0.07702869037424939, -0.28863065876066685, 0.29345132270310487, 0.04109530718997121, 0.28116929819031306, 0.026195788766360945, 0.10613172268753665, -0.08606375294427077, -0.04081392253542112, 0.045857984572649, -0.16874555790475118, 0.13600779792500867, 0.28520794241792624, 0.16253691734487397, 0.31568858451727366, -0.4211467080853052, -0.25034050387847756, 0.1327742988140219, 0.13220739158051503, 0.1321720676402846, -0.05461924803029332, -0.26448583982160523, 0.11449710977160268, -0.15617128519063248, -0.11653937206914028, -0.06190440815795834, 0.023422025620109505, 0.08612484176539713, -0.25137456241581174, 0.053562305329574476, 0.03571468544905656, 0.033260628187821974, -0.052754669316992575, -0.09171831030398607, -0.04375565012839312, 0.20950704562775274, 0.06859810089226812, -0.03435565665519486, 0.16622391300172443, -0.12951951117461755, -0.11750976290139888, 0.3715338552991549, 0.002379959723394778, -0.17614902613374095, 0.2727817876678374, -0.10817972607910634, -0.1480490166383485, 0.10992499210664795, 0.18542368576551477, 0.11051294238099621, -0.19306268690981798, 0.003947909898771387, -0.033566658793845114, 0.18580031196276348, 0.02538703265082505, 0.02354111243556771, 0.185109062699808, 0.23172178677697147, 0.012176421949536435, 0.13009530376358372, -0.07125709657557308, -0.12456371282330818, -0.22128294128924608, -0.13281006519165303, -0.12636669739666911, -0.007376242325537735, -0.060491942753530266, -0.11611581527621537, 0.40798020491169557, 0.16406712078799804, 0.20354009645913418, 0.01656382935018175, 0.24771423319147692, 0.02220692393796829, 0.10973166406878995, 0.006226545755958391, 0.23125211541773752, 0.127527700473244, 0.04609396124465598, -0.25486633871268066, 0.13910138530967137, 0.003831586924691995] |
1,802.00209 | Dual Recurrent Attention Units for Visual Question Answering | Visual Question Answering (VQA) requires AI models to comprehend data in two
domains, vision and text. Current state-of-the-art models use learned attention
mechanisms to extract relevant information from the input domains to answer a
certain question. Thus, robust attention mechanisms are essential for powerful
VQA models. In this paper, we propose a recurrent attention mechanism and show
its benefits compared to the traditional convolutional approach. We perform two
ablation studies to evaluate recurrent attention. First, we introduce a
baseline VQA model with visual attention and test the performance difference
between convolutional and recurrent attention on the VQA 2.0 dataset. Secondly,
we design an architecture for VQA which utilizes dual (textual and visual)
Recurrent Attention Units (RAUs). Using this model, we show the effect of all
possible combinations of recurrent and convolutional dual attention. Our single
model outperforms the first place winner on the VQA 2016 challenge and to the
best of our knowledge, it is the second best performing single model on the VQA
1.0 dataset. Furthermore, our model noticeably improves upon the winner of the
VQA 2017 challenge. Moreover, we experiment replacing attention mechanisms in
state-of-the-art models with our RAUs and show increased performance.
| cs.AI cs.CL cs.CV cs.NE stat.ML | visual question answering vqa requires ai models to comprehend data in two domains vision and text current stateoftheart models use learned attention mechanisms to extract relevant information from the input domains to answer a certain question thus robust attention mechanisms are essential for powerful vqa models in this paper we propose a recurrent attention mechanism and show its benefits compared to the traditional convolutional approach we perform two ablation studies to evaluate recurrent attention first we introduce a baseline vqa model with visual attention and test the performance difference between convolutional and recurrent attention on the vqa 20 dataset secondly we design an architecture for vqa which utilizes dual textual and visual recurrent attention units raus using this model we show the effect of all possible combinations of recurrent and convolutional dual attention our single model outperforms the first place winner on the vqa 2016 challenge and to the best of our knowledge it is the second best performing single model on the vqa 10 dataset furthermore our model noticeably improves upon the winner of the vqa 2017 challenge moreover we experiment replacing attention mechanisms in stateoftheart models with our raus and show increased performance | [['visual', 'question', 'answering', 'vqa', 'requires', 'ai', 'models', 'to', 'comprehend', 'data', 'in', 'two', 'domains', 'vision', 'and', 'text', 'current', 'stateoftheart', 'models', 'use', 'learned', 'attention', 'mechanisms', 'to', 'extract', 'relevant', 'information', 'from', 'the', 'input', 'domains', 'to', 'answer', 'a', 'certain', 'question', 'thus', 'robust', 'attention', 'mechanisms', 'are', 'essential', 'for', 'powerful', 'vqa', 'models', 'in', 'this', 'paper', 'we', 'propose', 'a', 'recurrent', 'attention', 'mechanism', 'and', 'show', 'its', 'benefits', 'compared', 'to', 'the', 'traditional', 'convolutional', 'approach', 'we', 'perform', 'two', 'ablation', 'studies', 'to', 'evaluate', 'recurrent', 'attention', 'first', 'we', 'introduce', 'a', 'baseline', 'vqa', 'model', 'with', 'visual', 'attention', 'and', 'test', 'the', 'performance', 'difference', 'between', 'convolutional', 'and', 'recurrent', 'attention', 'on', 'the', 'vqa', '20', 'dataset', 'secondly', 'we', 'design', 'an', 'architecture', 'for', 'vqa', 'which', 'utilizes', 'dual', 'textual', 'and', 'visual', 'recurrent', 'attention', 'units', 'raus', 'using', 'this', 'model', 'we', 'show', 'the', 'effect', 'of', 'all', 'possible', 'combinations', 'of', 'recurrent', 'and', 'convolutional', 'dual', 'attention', 'our', 'single', 'model', 'outperforms', 'the', 'first', 'place', 'winner', 'on', 'the', 'vqa', '2016', 'challenge', 'and', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'it', 'is', 'the', 'second', 'best', 'performing', 'single', 'model', 'on', 'the', 'vqa', '10', 'dataset', 'furthermore', 'our', 'model', 'noticeably', 'improves', 'upon', 'the', 'winner', 'of', 'the', 'vqa', '2017', 'challenge', 'moreover', 'we', 'experiment', 'replacing', 'attention', 'mechanisms', 'in', 'stateoftheart', 'models', 'with', 'our', 'raus', 'and', 'show', 'increased', 'performance']] | [-0.01700074487628463, -0.05469426388952296, -0.00924708518701104, 0.07598685326281553, -0.15380171802706824, -0.2206561799901418, 0.05296274090532022, 0.47636933143799887, -0.25390773362551744, -0.33493736240153127, 0.026395449878719564, -0.3008705514936875, -0.22058331632795625, 0.1931856744074955, -0.15161591489703802, 0.08923203580182953, 0.1453499174509675, 0.051253844810745276, -0.027300673538448814, -0.33968527117767966, 0.29640433239774444, 0.05626449016854167, 0.35687662648299756, 0.05621487918572548, 0.12720595967943948, -0.0850604757702408, -0.05005654680888909, -0.08127370720776991, -0.08814078700215293, 0.18373864572734022, 0.25727990628317154, 0.19543794794008135, 0.3471186173029053, -0.41044199829204725, -0.23710224089535095, 0.06534357430616346, 0.10071022042001669, 0.09957259116718212, -0.03798552109107662, -0.33206946280522226, 0.05047409596781318, -0.1987887577094042, 0.08787514392453699, -0.12969891030866748, 0.01110633689050491, -0.06281169131517601, -0.30050152951899245, -0.0030329069624153468, 0.15892503950028466, 0.04008846355554385, -0.06270902181247201, -0.10896092385817797, 0.04301856067031622, 0.17675976027519658, 0.03677710028419264, 0.09531107846205719, 0.09675166286671391, -0.20474856089026733, -0.16673401677204916, 0.3700626595089069, -0.06917689840954083, -0.21048783878915203, 0.19564018436970237, -0.033944894727438876, -0.16805144689786128, 0.03316654770229107, 0.24275044553363934, 0.11826436975075362, -0.1306959019591793, 0.0071435164791555745, -0.0861995171636152, 0.2242495747211461, 0.02945133993605104, -0.009103407667806516, 0.20299431195196052, 0.33960302951148685, -0.027944575786256254, 0.13680778046926625, -0.11133248873938544, -0.11083513332727866, -0.14596706052812247, -0.05430700947076846, -0.12418646776797966, -0.018813052158563947, -0.044750369098395686, -0.08675138220811883, 0.46134949255352603, 0.31836266465103014, 0.23926820823600373, 0.11143490370804779, 0.3604116836992594, -0.025977899979513424, 0.11355180722923996, 0.07533711291228731, 0.19525878954535494, -0.010117907888996296, 0.1401772416005723, -0.18696023437734813, 0.05745411350702246, 0.08111210950077154] |
1,802.0021 | Generation of single and two-mode multiphoton states in waveguide QED | Single and two-mode multiphoton states are the cornerstone of many quantum
technologies, e.g., metrology. In the optical regime these states are generally
obtained combining heralded single-photons with linear optics tools and
post-selection, leading to inherent low success probabilities. In a recent
paper, we design several protocols that harness the long-range atomic
interactions induced in waveguide QED to improve fidelities and protocols of
single-mode multiphoton emission. Here, we give full details of these
protocols, revisit them to simplify some of their requirements and also extend
them to generate two-mode multiphoton states, such as Yurke or NOON states.
| quant-ph | single and twomode multiphoton states are the cornerstone of many quantum technologies eg metrology in the optical regime these states are generally obtained combining heralded singlephotons with linear optics tools and postselection leading to inherent low success probabilities in a recent paper we design several protocols that harness the longrange atomic interactions induced in waveguide qed to improve fidelities and protocols of singlemode multiphoton emission here we give full details of these protocols revisit them to simplify some of their requirements and also extend them to generate twomode multiphoton states such as yurke or noon states | [['single', 'and', 'twomode', 'multiphoton', 'states', 'are', 'the', 'cornerstone', 'of', 'many', 'quantum', 'technologies', 'eg', 'metrology', 'in', 'the', 'optical', 'regime', 'these', 'states', 'are', 'generally', 'obtained', 'combining', 'heralded', 'singlephotons', 'with', 'linear', 'optics', 'tools', 'and', 'postselection', 'leading', 'to', 'inherent', 'low', 'success', 'probabilities', 'in', 'a', 'recent', 'paper', 'we', 'design', 'several', 'protocols', 'that', 'harness', 'the', 'longrange', 'atomic', 'interactions', 'induced', 'in', 'waveguide', 'qed', 'to', 'improve', 'fidelities', 'and', 'protocols', 'of', 'singlemode', 'multiphoton', 'emission', 'here', 'we', 'give', 'full', 'details', 'of', 'these', 'protocols', 'revisit', 'them', 'to', 'simplify', 'some', 'of', 'their', 'requirements', 'and', 'also', 'extend', 'them', 'to', 'generate', 'twomode', 'multiphoton', 'states', 'such', 'as', 'yurke', 'or', 'noon', 'states']] | [-0.10284090265243624, 0.20685062929927275, -0.03678994111942302, 0.05289906774123665, 0.013733942301769275, -0.22914861390684868, 0.07925289437480387, 0.4414560168709916, -0.24005893272502968, -0.2704742035542343, 0.015095117454620777, -0.2637772763846442, -0.12423441429321731, 0.2476120071053932, -0.061371563060674816, 0.1948291976004839, 0.067130952772762, -0.08031467190206361, -0.026225290074459433, -0.23132407557083448, 0.3053418919056033, 0.03331604947137142, 0.3190582292590989, 0.041132080596677646, 0.07626313928631134, 0.03181787850432253, 0.01602514421392698, -0.0875167297005343, -0.09172393515268595, 0.14166612496046582, 0.3214004571782425, 0.13399431728369868, 0.26174929887444404, -0.49477718921843916, -0.20428907538977606, 0.09482732504337339, 0.1328747311082831, 0.24178820386684188, -0.03195732523939417, -0.3533909058314748, -0.029116814548615366, -0.20103005897938905, -0.11299535819368127, -0.1558338127991495, -0.05110764759592712, 0.018031535744389277, -0.23477633794148764, 0.015247156443062218, 0.045234073917526985, 0.006901230604853481, 0.060255740958382376, -0.035817782675925024, 0.040672937010337286, 0.11141969240513087, -0.12837594248897707, -0.050917248428352956, 0.1572172057494754, -0.18273152795821565, -0.26590227846463677, 0.3298883558430437, -0.007517418455487738, -0.13283479885528018, 0.20346384365014578, -0.12368940666298538, -0.12225193312769989, 0.09124937347951345, 0.1481281059095636, 0.06453768026343217, -0.11103021129383706, 0.020045671563821088, 0.06015064580424223, 0.17539026834613955, 0.11950816446672737, 0.2830632022911838, 0.15837515001961341, 0.07308328548727634, 0.012877144317826605, 0.16701708326581866, -0.06100081575262569, -0.11198743810139906, -0.27621211908505455, -0.15418259998599146, -0.16979392764915247, 0.0731594863270099, -0.024661038460787193, -0.13109345184845247, 0.37126311102959636, 0.17718590555887204, 0.12251558841914327, 0.0024849320955884955, 0.3332496227618928, 0.10641636779837427, 0.020637691643059952, 0.01973752446186457, 0.31976760975430807, 0.1822944264858961, 0.07626753109313238, -0.2107397340781366, 0.018743665070360294, -0.047472156108900286] |
1,802.00211 | Hoeffding's lemma for Markov Chains and its applications to statistical
learning | We extend Hoeffding's lemma to general-state-space and not necessarily
reversible Markov chains. Let $\{X_i\}_{i \ge 1}$ be a stationary Markov chain
with invariant measure $\pi$ and absolute spectral gap $1-\lambda$, where
$\lambda$ is defined as the operator norm of the transition kernel acting on
mean zero and square-integrable functions with respect to $\pi$. Then, for any
bounded functions $f_i: x \mapsto [a_i,b_i]$, the sum of $f_i(X_i)$ is
sub-Gaussian with variance proxy $\frac{1+\lambda}{1-\lambda} \cdot \sum_i
\frac{(b_i-a_i)^2}{4}$. This result differs from the classical Hoeffding's
lemma by a multiplicative coefficient of $(1+\lambda)/(1-\lambda)$, and
simplifies to the latter when $\lambda = 0$. The counterpart of Hoeffding's
inequality for Markov chains immediately follows. Our results assume none of
countable state space, reversibility and time-homogeneity of Markov chains and
cover time-dependent functions with various ranges. We illustrate the utility
of these results by applying them to six problems in statistics and machine
learning.
| math.ST stat.TH | we extend hoeffdings lemma to generalstatespace and not necessarily reversible markov chains let x_i_i ge 1 be a stationary markov chain with invariant measure pi and absolute spectral gap 1lambda where lambda is defined as the operator norm of the transition kernel acting on mean zero and squareintegrable functions with respect to pi then for any bounded functions f_i x mapsto a_ib_i the sum of f_ix_i is subgaussian with variance proxy frac1lambda1lambda cdot sum_i fracb_ia_i24 this result differs from the classical hoeffdings lemma by a multiplicative coefficient of 1lambda1lambda and simplifies to the latter when lambda 0 the counterpart of hoeffdings inequality for markov chains immediately follows our results assume none of countable state space reversibility and timehomogeneity of markov chains and cover timedependent functions with various ranges we illustrate the utility of these results by applying them to six problems in statistics and machine learning | [['we', 'extend', 'hoeffdings', 'lemma', 'to', 'generalstatespace', 'and', 'not', 'necessarily', 'reversible', 'markov', 'chains', 'let', 'x_i_i', 'ge', '1', 'be', 'a', 'stationary', 'markov', 'chain', 'with', 'invariant', 'measure', 'pi', 'and', 'absolute', 'spectral', 'gap', '1lambda', 'where', 'lambda', 'is', 'defined', 'as', 'the', 'operator', 'norm', 'of', 'the', 'transition', 'kernel', 'acting', 'on', 'mean', 'zero', 'and', 'squareintegrable', 'functions', 'with', 'respect', 'to', 'pi', 'then', 'for', 'any', 'bounded', 'functions', 'f_i', 'x', 'mapsto', 'a_ib_i', 'the', 'sum', 'of', 'f_ix_i', 'is', 'subgaussian', 'with', 'variance', 'proxy', 'frac1lambda1lambda', 'cdot', 'sum_i', 'fracb_ia_i24', 'this', 'result', 'differs', 'from', 'the', 'classical', 'hoeffdings', 'lemma', 'by', 'a', 'multiplicative', 'coefficient', 'of', '1lambda1lambda', 'and', 'simplifies', 'to', 'the', 'latter', 'when', 'lambda', '0', 'the', 'counterpart', 'of', 'hoeffdings', 'inequality', 'for', 'markov', 'chains', 'immediately', 'follows', 'our', 'results', 'assume', 'none', 'of', 'countable', 'state', 'space', 'reversibility', 'and', 'timehomogeneity', 'of', 'markov', 'chains', 'and', 'cover', 'timedependent', 'functions', 'with', 'various', 'ranges', 'we', 'illustrate', 'the', 'utility', 'of', 'these', 'results', 'by', 'applying', 'them', 'to', 'six', 'problems', 'in', 'statistics', 'and', 'machine', 'learning']] | [-0.07324376079896597, 0.15082272807296865, -0.05273123223086144, 0.059038106972699275, -0.06458545866763403, -0.1755506587936215, 0.06486633921150302, 0.38131957365409797, -0.3434460435036412, -0.1969124780706307, 0.09773599071113366, -0.2988870727114747, -0.0755093749055088, 0.18013702288169978, -0.059203587515069774, 0.06579551965483582, 0.020493029738107408, 0.0640250506489472, -0.09435570101798053, -0.1985285007886746, 0.31652813985891326, -0.01764747791949817, 0.2255573010524656, 0.02236428298814465, 0.11327944505749873, 0.047302983307712515, -0.0036187507039998515, -0.04674533798304406, -0.18980311451506027, 0.0770724369090011, 0.2521585744189125, 0.12772558929241248, 0.2859686815743925, -0.3293239168075084, -0.16164263830402156, 0.2161132864027717, 0.11790004358331764, -0.01710045687906759, 0.06717208046531699, -0.30207011788676846, 0.10634936369188182, -0.14201877526340442, -0.11861294955933388, -0.06311349907535797, 0.029182862536325842, 0.08268350196189024, -0.3399469409413426, 0.07695542487748702, 0.14193356700379298, 0.05173904080153771, -0.028271966221132382, -0.19428163759318562, -0.00987744068605563, 0.0624119167990448, 0.03797814846497921, 0.08766903922709465, 0.12567386715131826, -0.04622089698694279, -0.1327065786700958, 0.2972892273699497, -0.12351298119059541, -0.24580726010436324, 0.12169577511565262, -0.15880463654044227, -0.16438935005473315, 0.0959661909195424, 0.07887998956393345, 0.13089665881699133, -0.09735455024140169, 0.18773218710016473, -0.0463997120173766, 0.15651241209174335, 0.05802134250644857, 0.02603967096263044, 0.06359147866466411, 0.059720752860786736, 0.1283859449150172, 0.1531653246558665, 0.004314648670195208, -0.11676254173315255, -0.3438967809238484, -0.164973844167396, -0.2266796518405768, 0.12787450878386153, -0.13367769758892983, -0.16779723978178365, 0.31256848541875437, 0.07474824474099516, 0.1960909120036735, 0.18115999394844115, 0.19452918802460156, 0.17015837741897663, 0.006375265282309864, 0.08811132333173358, 0.08461578138021779, 0.2112347596803759, 0.0381319963235513, -0.15213664245470362, 0.06811487093292387, 0.10196831187849838] |
1,802.00212 | Training Neural Networks by Using Power Linear Units (PoLUs) | In this paper, we introduce "Power Linear Unit" (PoLU) which increases the
nonlinearity capacity of a neural network and thus helps improving its
performance. PoLU adopts several advantages of previously proposed activation
functions. First, the output of PoLU for positive inputs is designed to be
identity to avoid the gradient vanishing problem. Second, PoLU has a non-zero
output for negative inputs such that the output mean of the units is close to
zero, hence reducing the bias shift effect. Thirdly, there is a saturation on
the negative part of PoLU, which makes it more noise-robust for negative
inputs. Furthermore, we prove that PoLU is able to map more portions of every
layer's input to the same space by using the power function and thus increases
the number of response regions of the neural network. We use image
classification for comparing our proposed activation function with others. In
the experiments, MNIST, CIFAR-10, CIFAR-100, Street View House Numbers (SVHN)
and ImageNet are used as benchmark datasets. The neural networks we implemented
include widely-used ELU-Network, ResNet-50, and VGG16, plus a couple of shallow
networks. Experimental results show that our proposed activation function
outperforms other state-of-the-art models with most networks.
| cs.LG | in this paper we introduce power linear unit polu which increases the nonlinearity capacity of a neural network and thus helps improving its performance polu adopts several advantages of previously proposed activation functions first the output of polu for positive inputs is designed to be identity to avoid the gradient vanishing problem second polu has a nonzero output for negative inputs such that the output mean of the units is close to zero hence reducing the bias shift effect thirdly there is a saturation on the negative part of polu which makes it more noiserobust for negative inputs furthermore we prove that polu is able to map more portions of every layers input to the same space by using the power function and thus increases the number of response regions of the neural network we use image classification for comparing our proposed activation function with others in the experiments mnist cifar10 cifar100 street view house numbers svhn and imagenet are used as benchmark datasets the neural networks we implemented include widelyused elunetwork resnet50 and vgg16 plus a couple of shallow networks experimental results show that our proposed activation function outperforms other stateoftheart models with most networks | [['in', 'this', 'paper', 'we', 'introduce', 'power', 'linear', 'unit', 'polu', 'which', 'increases', 'the', 'nonlinearity', 'capacity', 'of', 'a', 'neural', 'network', 'and', 'thus', 'helps', 'improving', 'its', 'performance', 'polu', 'adopts', 'several', 'advantages', 'of', 'previously', 'proposed', 'activation', 'functions', 'first', 'the', 'output', 'of', 'polu', 'for', 'positive', 'inputs', 'is', 'designed', 'to', 'be', 'identity', 'to', 'avoid', 'the', 'gradient', 'vanishing', 'problem', 'second', 'polu', 'has', 'a', 'nonzero', 'output', 'for', 'negative', 'inputs', 'such', 'that', 'the', 'output', 'mean', 'of', 'the', 'units', 'is', 'close', 'to', 'zero', 'hence', 'reducing', 'the', 'bias', 'shift', 'effect', 'thirdly', 'there', 'is', 'a', 'saturation', 'on', 'the', 'negative', 'part', 'of', 'polu', 'which', 'makes', 'it', 'more', 'noiserobust', 'for', 'negative', 'inputs', 'furthermore', 'we', 'prove', 'that', 'polu', 'is', 'able', 'to', 'map', 'more', 'portions', 'of', 'every', 'layers', 'input', 'to', 'the', 'same', 'space', 'by', 'using', 'the', 'power', 'function', 'and', 'thus', 'increases', 'the', 'number', 'of', 'response', 'regions', 'of', 'the', 'neural', 'network', 'we', 'use', 'image', 'classification', 'for', 'comparing', 'our', 'proposed', 'activation', 'function', 'with', 'others', 'in', 'the', 'experiments', 'mnist', 'cifar10', 'cifar100', 'street', 'view', 'house', 'numbers', 'svhn', 'and', 'imagenet', 'are', 'used', 'as', 'benchmark', 'datasets', 'the', 'neural', 'networks', 'we', 'implemented', 'include', 'widelyused', 'elunetwork', 'resnet50', 'and', 'vgg16', 'plus', 'a', 'couple', 'of', 'shallow', 'networks', 'experimental', 'results', 'show', 'that', 'our', 'proposed', 'activation', 'function', 'outperforms', 'other', 'stateoftheart', 'models', 'with', 'most', 'networks']] | [-0.07043680243719465, 0.01884189805087562, -0.02645368006808731, 0.04928951019015259, -0.09138627467820278, -0.17879813997648084, 0.0417823512531005, 0.3870968725484533, -0.2616552885460596, -0.30022036667244556, 0.06103492081523515, -0.3124122692176547, -0.21352700298914734, 0.22329424179027765, -0.09791577802254603, 0.09190466328291222, 0.09753038588469513, 0.053250002414465716, -0.05922162279991123, -0.3165140288129735, 0.30182276442049977, 0.07308480390944543, 0.32133602720688287, 0.04851233546251957, 0.15096780803914253, -0.06289076228649952, 0.021324770611663085, 0.004695812314121912, -0.03648917830996185, 0.12020700566697484, 0.23416250690495824, 0.14732562044802575, 0.32030575012501616, -0.39550897384178824, -0.23343322990127863, 0.12904128673402832, 0.10080862716795543, 0.0775995640210264, -0.024790132702596914, -0.2584420175005037, 0.14006592959213332, -0.16440434167877985, -0.004967956764336962, -0.12162791494853221, 0.0026804811512239467, 0.027122745174580278, -0.31319622232650335, 0.06455975483314923, 0.06766073684423016, 0.030892525354209235, -0.06047506984024762, -0.17761020428047347, -0.03375697125418064, 0.17807702524587513, 0.0020303498493889583, 0.06016677149678939, 0.14191244843935308, -0.18173796781099952, -0.13218197689349884, 0.30478137682836787, -0.10668384945736481, -0.2298652072893814, 0.1557422407031155, -0.054274478358909105, -0.11595728686825635, 0.07936943166602689, 0.1937836985115726, 0.09459308816943891, -0.06664973207486746, 0.013327544980133192, -0.054784777033357664, 0.2048670865786381, 0.0837034452909556, -0.015363499802799944, 0.11823751799499568, 0.22737865274628768, 0.07715662172547756, 0.20146313893387857, -0.1477826126942184, -0.06330133150033175, -0.23901566301400845, -0.09806156437366437, -0.1912043281783087, -0.0016325443457716551, -0.10243136857200462, -0.13941102375586828, 0.41710416013374924, 0.19306643105183657, 0.23277698365541605, 0.1629173051676331, 0.3416945486687697, 0.07749523643750507, 0.15005964737815353, 0.09820468112444267, 0.19071953032070246, 0.0832761621962373, 0.11767170258009663, -0.18635088753877566, 0.07573270040731399, 0.029104469229395573] |
1,802.00213 | Phase Stochastic Resonance in a forced nano-electromechanical oscillator | Stochastic resonance is a general phenomenon usually observed in
one-dimensional, amplitude modulated, bistable systems.We show experimentally
the emergence of phase stochastic resonance in the bidimensional response of a
forced nano-electromechanical membrane by evidencing the enhancement of a weak
phase modulated signal thanks to the addition of phase noise. Based on a
general forced Duffing oscillator model, we demonstrate experimentally and
theoretically that phase noise acts multiplicatively inducing important
physical consequences. These results may open interesting prospects for phase
noise metrology or coherent signal transmission applications in nanomechanical
oscillators. Moreover, our approach, due to its general character, may apply to
various systems.
| physics.optics | stochastic resonance is a general phenomenon usually observed in onedimensional amplitude modulated bistable systemswe show experimentally the emergence of phase stochastic resonance in the bidimensional response of a forced nanoelectromechanical membrane by evidencing the enhancement of a weak phase modulated signal thanks to the addition of phase noise based on a general forced duffing oscillator model we demonstrate experimentally and theoretically that phase noise acts multiplicatively inducing important physical consequences these results may open interesting prospects for phase noise metrology or coherent signal transmission applications in nanomechanical oscillators moreover our approach due to its general character may apply to various systems | [['stochastic', 'resonance', 'is', 'a', 'general', 'phenomenon', 'usually', 'observed', 'in', 'onedimensional', 'amplitude', 'modulated', 'bistable', 'systemswe', 'show', 'experimentally', 'the', 'emergence', 'of', 'phase', 'stochastic', 'resonance', 'in', 'the', 'bidimensional', 'response', 'of', 'a', 'forced', 'nanoelectromechanical', 'membrane', 'by', 'evidencing', 'the', 'enhancement', 'of', 'a', 'weak', 'phase', 'modulated', 'signal', 'thanks', 'to', 'the', 'addition', 'of', 'phase', 'noise', 'based', 'on', 'a', 'general', 'forced', 'duffing', 'oscillator', 'model', 'we', 'demonstrate', 'experimentally', 'and', 'theoretically', 'that', 'phase', 'noise', 'acts', 'multiplicatively', 'inducing', 'important', 'physical', 'consequences', 'these', 'results', 'may', 'open', 'interesting', 'prospects', 'for', 'phase', 'noise', 'metrology', 'or', 'coherent', 'signal', 'transmission', 'applications', 'in', 'nanomechanical', 'oscillators', 'moreover', 'our', 'approach', 'due', 'to', 'its', 'general', 'character', 'may', 'apply', 'to', 'various', 'systems']] | [-0.20345841888522748, 0.19570545442310153, -0.04800175287124544, 0.04497131892124947, -0.06940702282556213, -0.1949004445012917, 0.0669126208908487, 0.37103890505905196, -0.2843665859505239, -0.21834223562076982, 0.07787737855341949, -0.21900607325542387, -0.3043927416864709, 0.2489739143229689, -0.060602658183894834, 0.0793274391372227, 0.03680884784507095, 0.0007433124292309922, -0.0013050638660235276, -0.1449757580331868, 0.2696779355093247, 0.03489280560677456, 0.3052393082035982, 0.008688043567840711, 0.10425418333639161, -0.031345032021809036, 0.055905267845212235, -0.012847642151472887, -0.09762127424792287, 0.04514383976716585, 0.24765458215249353, -0.017391131752825313, 0.24824180803953275, -0.43760482141157925, -0.2642765608477858, 0.12988224682649702, 0.15505408061556472, 0.17748688832663073, -0.0935125727918792, -0.34002012355566613, -0.01577243323225786, -0.13398835475160048, -0.1430819616099764, -0.12133002932192666, 0.011908868111042989, 0.034845222857328925, -0.2748334301764717, 0.10225424097648056, 0.08670864594491696, 0.04310550735249083, -0.053816091883604845, -0.03667244923849691, 0.016185521001761575, 0.06104811083405546, -0.028909685158189202, -0.019069065909261013, 0.1928532611034663, -0.09555951126685164, -0.12397832184624259, 0.35678615686621995, -0.122250474270175, -0.16977055750756714, 0.19168544164397708, -0.15349396815440516, -0.08960287714616792, 0.15200123623345452, 0.18663888557417557, 0.035810137118802446, -0.152694351258826, 0.04476081862029076, 0.05390587801316587, 0.21204888894502766, 0.05937759306208037, 0.09780528886407373, 0.19930694764941045, 0.21019897671729917, 0.03604401069886909, 0.20932199295361223, -0.09740607058030028, -0.12770838530199363, -0.24345455804636867, -0.07425806343112842, -0.14684125939660733, 0.04815638965078731, -0.05222688728726197, -0.16249958838861767, 0.4261909850347455, 0.1934043040134861, 0.16886895024540402, -0.06056157729616112, 0.3207424528306664, 0.15662448320855932, -0.008906730316985067, -0.057011090140642214, 0.30015483354610195, 0.20265146127514688, 0.11619288779306455, -0.27678808685516626, 0.03544616121061073, -0.02985490601288505] |
1,802.00214 | Analytical construction of non local operator for n-qubit Dicke state | Entanglement in multipartite quantum systems is much more elusive than its
bipartite counterpart. In recent past the usefulness of multipartite entangled
states in several information theoretic tasks have been demonstrated. Being a
resource, the detection of multipartite entanglement is an imperative
necessity. Among the different classes of multipartite entangled states the
Dicke state has found importance in several tasks due to its permutation
symmetric nature. In this work we propose a simple and elegant way of detecting
n qubit Dicke states using permutation symmetric Bell operators. We conjecture
that maximal expectation value of the operator corresponds to the detection of
Dicke states.
| quant-ph | entanglement in multipartite quantum systems is much more elusive than its bipartite counterpart in recent past the usefulness of multipartite entangled states in several information theoretic tasks have been demonstrated being a resource the detection of multipartite entanglement is an imperative necessity among the different classes of multipartite entangled states the dicke state has found importance in several tasks due to its permutation symmetric nature in this work we propose a simple and elegant way of detecting n qubit dicke states using permutation symmetric bell operators we conjecture that maximal expectation value of the operator corresponds to the detection of dicke states | [['entanglement', 'in', 'multipartite', 'quantum', 'systems', 'is', 'much', 'more', 'elusive', 'than', 'its', 'bipartite', 'counterpart', 'in', 'recent', 'past', 'the', 'usefulness', 'of', 'multipartite', 'entangled', 'states', 'in', 'several', 'information', 'theoretic', 'tasks', 'have', 'been', 'demonstrated', 'being', 'a', 'resource', 'the', 'detection', 'of', 'multipartite', 'entanglement', 'is', 'an', 'imperative', 'necessity', 'among', 'the', 'different', 'classes', 'of', 'multipartite', 'entangled', 'states', 'the', 'dicke', 'state', 'has', 'found', 'importance', 'in', 'several', 'tasks', 'due', 'to', 'its', 'permutation', 'symmetric', 'nature', 'in', 'this', 'work', 'we', 'propose', 'a', 'simple', 'and', 'elegant', 'way', 'of', 'detecting', 'n', 'qubit', 'dicke', 'states', 'using', 'permutation', 'symmetric', 'bell', 'operators', 'we', 'conjecture', 'that', 'maximal', 'expectation', 'value', 'of', 'the', 'operator', 'corresponds', 'to', 'the', 'detection', 'of', 'dicke', 'states']] | [-0.15541898276013158, 0.17772460261981263, -0.08552546027189523, 0.05779554017970119, -0.022480386932490066, -0.21367230827865355, 0.033285250638465526, 0.3639321620302165, -0.18350626467851244, -0.25432402257095366, 0.042775259210554625, -0.27884421683619637, -0.11563200420841538, 0.14277715760958837, -0.06977779410925566, 0.1588351402475097, 0.06522305212074928, 0.07834065247180999, -0.07372328175423558, -0.2711032397780275, 0.33157695793574127, 0.012857970091121673, 0.3247736364593912, 0.06900052418110564, 0.04516333190030327, -0.011766841630542688, 0.04005326768417623, -0.034826754396050874, -0.05205027023868181, 0.1381805318193145, 0.3397479339744713, 0.23109078399754843, 0.2952347595025511, -0.3685446423204506, -0.20058223127853125, 0.21246186272222914, 0.1092501321462823, 0.20092493980465567, -0.01781445556601587, -0.3992241822621402, -0.02526067272193876, -0.242765022124456, -0.10345108395296276, -0.11898655712823658, 0.0979226125112059, -0.16480537771484724, -0.2008185782378503, 0.11571032475844464, 0.08757968972820569, 0.05686157852338225, 0.05049747161055897, -0.058687531654083844, 0.0043343726235131426, 0.0897072037024533, -0.07668591976535562, -0.05367499550829605, 0.0866548702686879, -0.15975431283004582, -0.2699927048502015, 0.3515431503308754, 0.008922108754204065, -0.1856661586264404, 0.18576209208193034, -0.10176774776339823, -0.16958458506155247, 0.03815602243184021, 0.09962756271638415, 0.15978452789725042, -0.13566019114873865, 0.06454285927169372, -0.1133004505662065, 0.16188638043640108, 0.07343310921215544, 0.1990458813778983, 0.1892910693753876, 0.09679758626803317, 0.10914261026682295, 0.2907301101778798, -0.012400188163726353, -0.16400994932936394, -0.23096401597756674, -0.19109837813120262, -0.2791250613883284, 0.10130375036832821, -0.07537286424100303, -0.08915963244861831, 0.4621139741502702, 0.1429929851061281, 0.1084107352082855, 0.027406080568884956, 0.24323752218419137, 0.0809735871906228, 0.04942074464634061, 0.0826990705413753, 0.2459716016937997, 0.2205532740107646, 0.041422005103645375, -0.2493083763721527, 0.09301429095919993, 0.011970871685109302] |
1,802.00215 | Discontinuous traveling waves as weak solutions to the Fornberg-Whitham
equation | We analyze the weak solution concept for the Fornberg-Whitham equation in
case of traveling waves with a piecewise smooth profile function. The existence
of discontinuous weak traveling wave solutions is shown by means of analysis of
a corresponding planar dynamical system and appropriate patching of
disconnected orbits.
| math.AP | we analyze the weak solution concept for the fornbergwhitham equation in case of traveling waves with a piecewise smooth profile function the existence of discontinuous weak traveling wave solutions is shown by means of analysis of a corresponding planar dynamical system and appropriate patching of disconnected orbits | [['we', 'analyze', 'the', 'weak', 'solution', 'concept', 'for', 'the', 'fornbergwhitham', 'equation', 'in', 'case', 'of', 'traveling', 'waves', 'with', 'a', 'piecewise', 'smooth', 'profile', 'function', 'the', 'existence', 'of', 'discontinuous', 'weak', 'traveling', 'wave', 'solutions', 'is', 'shown', 'by', 'means', 'of', 'analysis', 'of', 'a', 'corresponding', 'planar', 'dynamical', 'system', 'and', 'appropriate', 'patching', 'of', 'disconnected', 'orbits']] | [-0.2539452188109553, 0.0631239352366352, -0.10609476087971571, 0.05808572551641772, -0.08043173822435609, -0.09027298693693778, 0.007622417498459207, 0.29345972990577524, -0.2900535380665926, -0.1936773611430792, 0.1291526951059263, -0.2677091152427044, -0.2024778189494255, 0.18466665516508388, 0.03409521016193197, 0.1532593519096213, 0.06642311914982472, 0.001468812301259567, -0.0860686662701018, -0.12980035159419825, 0.3891177549958229, -0.07241317982527803, 0.260358157944172, 0.01986682304042451, 0.1277231569302843, 0.036339795489379385, 0.004717370495200157, 0.0698337792394128, -0.1574478317052126, 0.05984064678047249, 0.1928339011749213, 0.10574459875042135, 0.2882854011345734, -0.41239162142130925, -0.23995465819941872, 0.10159920280838901, 0.12175409638501228, 0.13784671357852665, -0.07565220528619086, -0.3453609899350224, 0.09379641426370498, -0.13332517453013581, -0.30545278663370523, -0.028496067200668475, 0.04218054297281072, 0.14433612949908414, -0.24618364767508305, 0.09969792005784334, 0.06492255315707224, 0.005915351984824272, -0.1413236213649841, 0.013022848635297665, -0.05944693881146451, 0.04859249182838075, 0.04927921201538374, 0.022351017836085025, 0.01894527956090392, -0.11248789882247752, -0.046509313124648115, 0.3488273750594322, -0.13858503073780856, -0.2612826424710294, 0.2089316914492148, -0.14203557890265228, -0.043285391511435206, 0.18936888720998737, 0.18177270935848355, 0.18376863728019785, -0.14276052652759122, 0.10817326589343831, -0.051502904735513014, 0.13733588989348489, 0.14878903438356963, -0.05043157805351818, 0.16989820918187182, 0.1367617184678625, 0.16181692302702588, 0.1710574274605259, 0.0015822255865056464, -0.10015114380958233, -0.3196604479342065, -0.11444927209076729, -0.11788203575192614, 0.05310445616084914, -0.10337339420623315, -0.24922790299256412, 0.4295158295872364, 0.053436525443449935, 0.13235283294256697, 0.04278868707293208, 0.25313205994229687, 0.20658805649331274, -0.05932910241028096, 0.08399711201522261, 0.2501723833302868, 0.16665409375081194, 0.08324824741229098, -0.21765167303284275, 0.021590096806671392, 0.1603521935126566] |
1,802.00216 | Spectral Modelling of H.E.S.S.-detected Pulsar Wind Nebulae | In the last decade, ground-based Imaging Atmospheric Cherenkov Telescopes
have discovered about 175 very-high-energy (VHE; $E >$ 100 GeV) gamma-ray
sources, with more to follow with the development of H.E.S.S. II and CTA.
Nearly 40 of these are confirmed pulsar wind nebulae (PWNe). We present results
from a leptonic emission code that models the spectral energy density of a PWN
by solving a Fokker-Planck-type transport equation and calculating inverse
Compton and synchrotron emissivities. Although models such as these have been
developed before, most of them model the geometry of a PWN as that of a single
sphere. We have created a time-dependent, multi-zone model to investigate
changes in the particle spectrum as the particles traverse through the PWN, by
considering a time and spatially-dependent magnetic field, spatially-dependent
bulk particle motion causing convection, diffusion, and energy losses (SR, IC
and adiabatic). Our code predicts the radiation spectrum at different positions
in the nebula, yielding novel results, e.g., the surface brightness versus the
radius and the PWN size as function of energy. We calibrated our new model
against more basic models using the observed spectrum of PWN G0.9+0.1,
incorporating data from H.E.S.S. as well as radio and X-ray experiments. We fit
our predicted radiation spectra to data from G21.5$-$0.9, G54.1+0.3, and HESS
J1356$-$645 and found that our model yields reasonable results for young PWNe.
We next performed a parameter study which gave significant insight into the
behaviour of the PWN for different scenarios. Our model is now ready to be
applied to a population of PWNe to probe possible trends such as the surface
brightness as a function of spin-down of the pulsar.
| astro-ph.HE | in the last decade groundbased imaging atmospheric cherenkov telescopes have discovered about 175 veryhighenergy vhe e 100 gev gammaray sources with more to follow with the development of hess ii and cta nearly 40 of these are confirmed pulsar wind nebulae pwne we present results from a leptonic emission code that models the spectral energy density of a pwn by solving a fokkerplancktype transport equation and calculating inverse compton and synchrotron emissivities although models such as these have been developed before most of them model the geometry of a pwn as that of a single sphere we have created a timedependent multizone model to investigate changes in the particle spectrum as the particles traverse through the pwn by considering a time and spatiallydependent magnetic field spatiallydependent bulk particle motion causing convection diffusion and energy losses sr ic and adiabatic our code predicts the radiation spectrum at different positions in the nebula yielding novel results eg the surface brightness versus the radius and the pwn size as function of energy we calibrated our new model against more basic models using the observed spectrum of pwn g0901 incorporating data from hess as well as radio and xray experiments we fit our predicted radiation spectra to data from g21509 g54103 and hess j1356645 and found that our model yields reasonable results for young pwne we next performed a parameter study which gave significant insight into the behaviour of the pwn for different scenarios our model is now ready to be applied to a population of pwne to probe possible trends such as the surface brightness as a function of spindown of the pulsar | [['in', 'the', 'last', 'decade', 'groundbased', 'imaging', 'atmospheric', 'cherenkov', 'telescopes', 'have', 'discovered', 'about', '175', 'veryhighenergy', 'vhe', 'e', '100', 'gev', 'gammaray', 'sources', 'with', 'more', 'to', 'follow', 'with', 'the', 'development', 'of', 'hess', 'ii', 'and', 'cta', 'nearly', '40', 'of', 'these', 'are', 'confirmed', 'pulsar', 'wind', 'nebulae', 'pwne', 'we', 'present', 'results', 'from', 'a', 'leptonic', 'emission', 'code', 'that', 'models', 'the', 'spectral', 'energy', 'density', 'of', 'a', 'pwn', 'by', 'solving', 'a', 'fokkerplancktype', 'transport', 'equation', 'and', 'calculating', 'inverse', 'compton', 'and', 'synchrotron', 'emissivities', 'although', 'models', 'such', 'as', 'these', 'have', 'been', 'developed', 'before', 'most', 'of', 'them', 'model', 'the', 'geometry', 'of', 'a', 'pwn', 'as', 'that', 'of', 'a', 'single', 'sphere', 'we', 'have', 'created', 'a', 'timedependent', 'multizone', 'model', 'to', 'investigate', 'changes', 'in', 'the', 'particle', 'spectrum', 'as', 'the', 'particles', 'traverse', 'through', 'the', 'pwn', 'by', 'considering', 'a', 'time', 'and', 'spatiallydependent', 'magnetic', 'field', 'spatiallydependent', 'bulk', 'particle', 'motion', 'causing', 'convection', 'diffusion', 'and', 'energy', 'losses', 'sr', 'ic', 'and', 'adiabatic', 'our', 'code', 'predicts', 'the', 'radiation', 'spectrum', 'at', 'different', 'positions', 'in', 'the', 'nebula', 'yielding', 'novel', 'results', 'eg', 'the', 'surface', 'brightness', 'versus', 'the', 'radius', 'and', 'the', 'pwn', 'size', 'as', 'function', 'of', 'energy', 'we', 'calibrated', 'our', 'new', 'model', 'against', 'more', 'basic', 'models', 'using', 'the', 'observed', 'spectrum', 'of', 'pwn', 'g0901', 'incorporating', 'data', 'from', 'hess', 'as', 'well', 'as', 'radio', 'and', 'xray', 'experiments', 'we', 'fit', 'our', 'predicted', 'radiation', 'spectra', 'to', 'data', 'from', 'g21509', 'g54103', 'and', 'hess', 'j1356645', 'and', 'found', 'that', 'our', 'model', 'yields', 'reasonable', 'results', 'for', 'young', 'pwne', 'we', 'next', 'performed', 'a', 'parameter', 'study', 'which', 'gave', 'significant', 'insight', 'into', 'the', 'behaviour', 'of', 'the', 'pwn', 'for', 'different', 'scenarios', 'our', 'model', 'is', 'now', 'ready', 'to', 'be', 'applied', 'to', 'a', 'population', 'of', 'pwne', 'to', 'probe', 'possible', 'trends', 'such', 'as', 'the', 'surface', 'brightness', 'as', 'a', 'function', 'of', 'spindown', 'of', 'the', 'pulsar']] | [-0.0157452776139878, 0.11688513326527619, -0.06837528468523589, 0.12348844416361923, -0.10003104782490818, -0.11425597827786718, 0.013374253047664684, 0.4249710132505883, -0.22557348788293355, -0.3924018604956843, 0.046054789207065135, -0.28495647187379225, -0.02998597631662118, 0.25768877235780197, 0.02186296094204644, 0.011148435490085156, 0.10563587779437916, -0.0829120351622502, -0.012402449801124425, -0.16476924259687722, 0.2612954334968149, 0.1637844600542276, 0.1752414824458322, 0.041809098558776354, 0.09573361292800486, -0.0644566036010575, -0.020971079569534156, -0.005189180948461095, -0.1045594479608149, 0.06472153374216523, 0.19941568289961853, 0.141309899603948, 0.15116512185411043, -0.419632247689663, -0.2935978371925928, 0.07783343911136466, 0.16043450629475517, 0.010580066283539594, -0.045818922216939326, -0.3005262553217579, 0.037135343379082364, -0.24576010754659633, -0.19248449492647693, 0.03491589220551153, 0.008946400975670527, 0.03783538180006737, -0.20881422474566433, 0.06834646749775856, -0.00599959128174103, 0.055568195065845635, -0.15050166828333641, -0.12688380287942924, -0.017056317194537433, 0.06537312621388722, 0.08609790693002718, 0.0330757821202968, 0.1288789388528568, -0.1522115752618346, -0.11830068430173453, 0.40766267654727456, -0.05057316088221139, -0.059403291974363295, 0.18972616883822613, -0.1948253184367247, -0.14363578873755478, 0.16809718931283527, 0.162372205143415, 0.08307397023826424, -0.17430196826139258, 0.04056870196644148, -0.04263779100589023, 0.17172183190662138, 0.020517991389216925, 0.020049969015505025, 0.25921385899807015, 0.16564272176819267, 0.013494148946160243, 0.1473521859225541, -0.2581715410332873, -0.01814867686501842, -0.27070393771347073, -0.10000411016193943, -0.17195425607626222, 0.09794628838146174, -0.10009931846364419, -0.1410462437264397, 0.42857694692081877, 0.12994037393859967, 0.1756663677489592, 0.002442151828479298, 0.3129820100980362, 0.11636903791524539, 0.05222280310527249, 0.13384818506461602, 0.29810731312673955, 0.12914578940512406, 0.14742829858980797, -0.19588849926281168, 0.05235164528195229, -0.02129045288181967] |
1,802.00217 | AMPA, NMDA and GABAA receptor mediated network burst dynamics in
cortical cultures in vitro | In this work we study the excitatory AMPA, and NMDA, and inhibitory GABAA
receptor mediated dynamical changes in neuronal networks of neonatal rat cortex
in vitro. Extracellular network-wide activity was recorded with 59 planar
electrodes simultaneously under different pharmacological conditions. We
analyzed the changes of overall network activity and network-wide burst
frequency between baseline and AMPA receptor (AMPA-R) or NMDA receptor (NMDA-R)
driven activity, as well as between the latter states and disinhibited
activity. Additionally, spatiotemporal structures of pharmacologically modified
bursts and recruitment of electrodes during the network bursts were studied.
Our results show that AMPA-R and NMDA-R receptors have clearly distinct roles
in network dynamics. AMPA-Rs are in greater charge to initiate network wide
bursts. Therefore NMDA-Rs maintain the already initiated activity. GABAA
receptors (GABAA-Rs) inhibit AMPA-R driven network activity more strongly than
NMDA-R driven activity during the bursts.
| q-bio.NC q-bio.CB | in this work we study the excitatory ampa and nmda and inhibitory gabaa receptor mediated dynamical changes in neuronal networks of neonatal rat cortex in vitro extracellular networkwide activity was recorded with 59 planar electrodes simultaneously under different pharmacological conditions we analyzed the changes of overall network activity and networkwide burst frequency between baseline and ampa receptor ampar or nmda receptor nmdar driven activity as well as between the latter states and disinhibited activity additionally spatiotemporal structures of pharmacologically modified bursts and recruitment of electrodes during the network bursts were studied our results show that ampar and nmdar receptors have clearly distinct roles in network dynamics ampars are in greater charge to initiate network wide bursts therefore nmdars maintain the already initiated activity gabaa receptors gabaars inhibit ampar driven network activity more strongly than nmdar driven activity during the bursts | [['in', 'this', 'work', 'we', 'study', 'the', 'excitatory', 'ampa', 'and', 'nmda', 'and', 'inhibitory', 'gabaa', 'receptor', 'mediated', 'dynamical', 'changes', 'in', 'neuronal', 'networks', 'of', 'neonatal', 'rat', 'cortex', 'in', 'vitro', 'extracellular', 'networkwide', 'activity', 'was', 'recorded', 'with', '59', 'planar', 'electrodes', 'simultaneously', 'under', 'different', 'pharmacological', 'conditions', 'we', 'analyzed', 'the', 'changes', 'of', 'overall', 'network', 'activity', 'and', 'networkwide', 'burst', 'frequency', 'between', 'baseline', 'and', 'ampa', 'receptor', 'ampar', 'or', 'nmda', 'receptor', 'nmdar', 'driven', 'activity', 'as', 'well', 'as', 'between', 'the', 'latter', 'states', 'and', 'disinhibited', 'activity', 'additionally', 'spatiotemporal', 'structures', 'of', 'pharmacologically', 'modified', 'bursts', 'and', 'recruitment', 'of', 'electrodes', 'during', 'the', 'network', 'bursts', 'were', 'studied', 'our', 'results', 'show', 'that', 'ampar', 'and', 'nmdar', 'receptors', 'have', 'clearly', 'distinct', 'roles', 'in', 'network', 'dynamics', 'ampars', 'are', 'in', 'greater', 'charge', 'to', 'initiate', 'network', 'wide', 'bursts', 'therefore', 'nmdars', 'maintain', 'the', 'already', 'initiated', 'activity', 'gabaa', 'receptors', 'gabaars', 'inhibit', 'ampar', 'driven', 'network', 'activity', 'more', 'strongly', 'than', 'nmdar', 'driven', 'activity', 'during', 'the', 'bursts']] | [-0.12598321298508486, 0.20212328748311847, 0.07414865385794984, 0.06374027537590271, -0.0019632588955573738, -0.18142332769407338, 0.075388583648221, 0.45454186481842096, -0.20600789403745337, -0.2685247768337528, -0.0014882713659207566, -0.266086028996801, -0.33344291005641274, 0.15091406317019457, -0.086158218793571, -0.06911753606645094, 0.07879154585290066, -0.0054044252113047715, 0.10810834295420058, -0.1631751618968311, 0.17413112286991184, 0.12374471868320867, 0.30544782338825904, 0.043591629930997966, 0.08698057990345726, -0.08720035619180767, -0.011289783294542112, -0.04162638812356264, -0.07561607963762598, 0.07307558154834491, 0.2878099116564229, 0.1192553611224972, 0.2667134662287013, -0.571529028289344, -0.2827139330042553, 0.11652075145663558, 0.1319171196723735, 0.04726458080720319, -0.0025527696636635337, -0.3146316710508604, 0.07314084071423048, -0.1563808080483822, -0.007208584772382417, -0.005187894462310857, 0.05108914021115777, 0.13257035406043186, -0.2596518503488514, 0.1624926252548323, 0.013109766496674401, 0.14633724631984596, -0.11421861422443898, -0.013736026631533236, -0.0969161418725507, 0.21004968391144244, 0.0612165947255773, 0.05476090639063656, 0.3149138229588668, -0.13345299573067704, -0.11497963530321915, 0.2004319100262786, -0.02229953603956096, -0.0960604615367787, 0.23880331646786004, -0.14534651149280262, -0.16193095843672103, 0.1378911286238176, 0.18912212720032837, 0.0530361341788312, -0.1997723453568524, -0.10395859622044752, 0.0712221336223698, 0.1970673882321495, 0.12228245737260558, 0.010552336261067809, 0.14732335018250498, 0.24459601675862094, -0.03340621064990705, 0.12469925114588029, -0.1146359078457876, -0.04152262184947756, -0.15688032847559213, -0.023566722434580974, -0.08331839853064224, 0.0459983038591167, -0.06615041842799299, -0.09949680105310635, 0.4689452612799579, 0.040057684305002506, 0.17651902483202572, 0.07472945922526761, 0.15450508177172448, -0.02631229019565238, 0.0992084650248559, 0.04846817680189143, 0.1998124065204942, 0.11351622778929069, 0.15613448427166735, -0.3216636113795465, 0.18892580300798992, -0.0014470434221236603] |
1,802.00218 | Inequivalent Berry phases for the bulk polarization | We discuss characterization of the polarization for insulators under the
periodic boundary condition in terms of the Berry phase, clarifying confusing
subtleties. For band insulators, the Berry phase can be formulated in terms of
the Bloch function in the momentum space. More generally, in the presence of
interactions or disorders, one can instead use the many-body ground state as a
function of the flux piercing the ring. However, the definition of the Bloch
function and the way describing the flux are not unique. As a result, the value
of the Berry phase and its behavior depend on how precisely it is defined. In
particular, identifying the Berry phase as a polarization, its change
represents a polarization current which also depends on the definition. We
demonstrate this by elucidating mutual relations among different definitions of
the Berry phase, and that they correspond to the current measured differently
in the real space. Despite the non-uniqueness of the polarization current, the
total charge transported during a Thouless pumping process is independent of
the definition, reflecting its topological nature.
| cond-mat.str-el cond-mat.dis-nn cond-mat.other cond-mat.stat-mech | we discuss characterization of the polarization for insulators under the periodic boundary condition in terms of the berry phase clarifying confusing subtleties for band insulators the berry phase can be formulated in terms of the bloch function in the momentum space more generally in the presence of interactions or disorders one can instead use the manybody ground state as a function of the flux piercing the ring however the definition of the bloch function and the way describing the flux are not unique as a result the value of the berry phase and its behavior depend on how precisely it is defined in particular identifying the berry phase as a polarization its change represents a polarization current which also depends on the definition we demonstrate this by elucidating mutual relations among different definitions of the berry phase and that they correspond to the current measured differently in the real space despite the nonuniqueness of the polarization current the total charge transported during a thouless pumping process is independent of the definition reflecting its topological nature | [['we', 'discuss', 'characterization', 'of', 'the', 'polarization', 'for', 'insulators', 'under', 'the', 'periodic', 'boundary', 'condition', 'in', 'terms', 'of', 'the', 'berry', 'phase', 'clarifying', 'confusing', 'subtleties', 'for', 'band', 'insulators', 'the', 'berry', 'phase', 'can', 'be', 'formulated', 'in', 'terms', 'of', 'the', 'bloch', 'function', 'in', 'the', 'momentum', 'space', 'more', 'generally', 'in', 'the', 'presence', 'of', 'interactions', 'or', 'disorders', 'one', 'can', 'instead', 'use', 'the', 'manybody', 'ground', 'state', 'as', 'a', 'function', 'of', 'the', 'flux', 'piercing', 'the', 'ring', 'however', 'the', 'definition', 'of', 'the', 'bloch', 'function', 'and', 'the', 'way', 'describing', 'the', 'flux', 'are', 'not', 'unique', 'as', 'a', 'result', 'the', 'value', 'of', 'the', 'berry', 'phase', 'and', 'its', 'behavior', 'depend', 'on', 'how', 'precisely', 'it', 'is', 'defined', 'in', 'particular', 'identifying', 'the', 'berry', 'phase', 'as', 'a', 'polarization', 'its', 'change', 'represents', 'a', 'polarization', 'current', 'which', 'also', 'depends', 'on', 'the', 'definition', 'we', 'demonstrate', 'this', 'by', 'elucidating', 'mutual', 'relations', 'among', 'different', 'definitions', 'of', 'the', 'berry', 'phase', 'and', 'that', 'they', 'correspond', 'to', 'the', 'current', 'measured', 'differently', 'in', 'the', 'real', 'space', 'despite', 'the', 'nonuniqueness', 'of', 'the', 'polarization', 'current', 'the', 'total', 'charge', 'transported', 'during', 'a', 'thouless', 'pumping', 'process', 'is', 'independent', 'of', 'the', 'definition', 'reflecting', 'its', 'topological', 'nature']] | [-0.19529290922185671, 0.18587873896317822, -0.08565928991518117, 0.05304118287322386, -0.06047634331775563, -0.06102362992241979, 0.05789911244197615, 0.3275022030621767, -0.2761741574694003, -0.2967927241644689, 0.07676468003108831, -0.2567893347090908, -0.18542961698470337, 0.1679065539687872, -0.054964370589171134, -0.0005475243633346898, -0.022806702413197075, 0.013015128895640373, -0.1350803870568052, -0.19244869901399528, 0.34614414103329183, 0.0059241313048239265, 0.2954695503560028, 0.08969209353273203, 0.06202126268297434, 0.022877572552034896, 0.004896099341234991, 0.010034987708121272, -0.10356464432939122, 0.06451566404263888, 0.198203339769638, 0.04715781866335809, 0.19667024352986898, -0.40725881625499044, -0.20314921205597264, 0.11227611912946615, 0.10164082588960549, 0.09923855439161083, 0.015452675254865815, -0.30743338425244604, -0.0038400501518377236, -0.11695787221858545, -0.1263945759486939, -0.08192772758858545, 0.038905957601964476, -0.004905084647637393, -0.19353997629934125, 0.08085273326890144, 0.06399698694502669, 0.04501707285027286, -0.0864900271827355, -0.08418843354231545, -0.09933314411235707, 0.1340721024213625, 0.06949905163924476, 0.059973385429808075, 0.13386630410927214, -0.15830696319096854, -0.10774380109139851, 0.3868249093634742, -0.04967132937362684, -0.22458911216950841, 0.1288526226207614, -0.17872861480872546, -0.05836874392149704, 0.12291424050128885, 0.09650759437786681, 0.11162463423662952, -0.09944049727703844, 0.06784891750563735, -0.021628297231426195, 0.10998841744980642, 0.037796908035441966, 0.11211518721655012, 0.2756365958069052, 0.11756730637978763, 0.08866505509059477, 0.14975251881272664, -0.08900490214915148, -0.11836639153105873, -0.33885510650064266, -0.19540652653169152, -0.25821528663060495, 0.059997925973314395, -0.06178154859666912, -0.19997221495956183, 0.46942597388689006, 0.1453904201489474, 0.20955389904124397, -0.03374088907813919, 0.27516338544897734, 0.17232175930469695, 0.04190650119579264, 0.030876126009305675, 0.2749091376710151, 0.14067916588990817, 0.1286682514646756, -0.26455706259767925, 0.1009643581988556, 0.045988562683175714] |
1,802.00219 | Correlation-driven charge order in a frustrated two-dimensional atom
lattice | We thoroughly examine the ground state of the triangular lattice of Pb on
Si(111) using scanning tunneling microscopy. We detect charge-order,
accompanied by a subtle structural reconstruction. Applying the extended
variational cluster approach we map out the phase diagram as a function of
local and non-local Coulomb interactions. Comparing the experimental data with
the theoretical modeling leads us to conclude that electron correlations are
the driving force of the charge-ordered state in Pb/Si(111), rather than Fermi
surface nesting. These results resolve the discussion about the origin of the
well known $3\times 3$ reconstruction forming below $86\,$K. By exploiting the
tunability of correlation strength, hopping parameters and bandfilling, this
material class represents a promising platform to search for exotic states of
matter, in particular, for chiral topological superconductivity.
| cond-mat.str-el | we thoroughly examine the ground state of the triangular lattice of pb on si111 using scanning tunneling microscopy we detect chargeorder accompanied by a subtle structural reconstruction applying the extended variational cluster approach we map out the phase diagram as a function of local and nonlocal coulomb interactions comparing the experimental data with the theoretical modeling leads us to conclude that electron correlations are the driving force of the chargeordered state in pbsi111 rather than fermi surface nesting these results resolve the discussion about the origin of the well known 3times 3 reconstruction forming below 86k by exploiting the tunability of correlation strength hopping parameters and bandfilling this material class represents a promising platform to search for exotic states of matter in particular for chiral topological superconductivity | [['we', 'thoroughly', 'examine', 'the', 'ground', 'state', 'of', 'the', 'triangular', 'lattice', 'of', 'pb', 'on', 'si111', 'using', 'scanning', 'tunneling', 'microscopy', 'we', 'detect', 'chargeorder', 'accompanied', 'by', 'a', 'subtle', 'structural', 'reconstruction', 'applying', 'the', 'extended', 'variational', 'cluster', 'approach', 'we', 'map', 'out', 'the', 'phase', 'diagram', 'as', 'a', 'function', 'of', 'local', 'and', 'nonlocal', 'coulomb', 'interactions', 'comparing', 'the', 'experimental', 'data', 'with', 'the', 'theoretical', 'modeling', 'leads', 'us', 'to', 'conclude', 'that', 'electron', 'correlations', 'are', 'the', 'driving', 'force', 'of', 'the', 'chargeordered', 'state', 'in', 'pbsi111', 'rather', 'than', 'fermi', 'surface', 'nesting', 'these', 'results', 'resolve', 'the', 'discussion', 'about', 'the', 'origin', 'of', 'the', 'well', 'known', '3times', '3', 'reconstruction', 'forming', 'below', '86k', 'by', 'exploiting', 'the', 'tunability', 'of', 'correlation', 'strength', 'hopping', 'parameters', 'and', 'bandfilling', 'this', 'material', 'class', 'represents', 'a', 'promising', 'platform', 'to', 'search', 'for', 'exotic', 'states', 'of', 'matter', 'in', 'particular', 'for', 'chiral', 'topological', 'superconductivity']] | [-0.16023932090458748, 0.1530992044394629, -0.07075006288840317, 0.08868273379445622, -0.03964977492652242, -0.1466242658262629, 0.10279993689480416, 0.3688502233578927, -0.2656551808384912, -0.3247314353606531, 0.011697545869364626, -0.3131433816197964, -0.13968758584399307, 0.16523988090736408, 0.0538422056133785, 0.034892404548055124, 0.0023041191096935007, -0.037324781168348316, -0.15379343650651178, -0.19440389073468625, 0.33092571669332094, 0.045314240295232996, 0.28748830272224807, 0.09373272458342688, 0.03580522660021892, 0.03882872635528209, 0.03142329068144872, 0.02699200894742731, -0.16205620330173776, 0.1021327679909374, 0.21372382996034706, -0.020610032289008064, 0.18223439511059533, -0.4362036657504856, -0.22953189072746133, 0.023773507805474634, 0.13325299227994586, 0.12872682409065347, -0.09060969321142202, -0.3506498362070748, 0.026010813017834037, -0.1448604448417586, -0.13799888139501923, -0.13374695144150228, -0.040392199830551236, -0.009482859929520932, -0.21895705399635648, 0.12737151305560793, 0.03501809442264309, 0.0809275686033144, -0.09900179315018394, -0.09309966644153946, -0.046050642841562094, 0.0723763360449719, 0.010238489357843286, 0.0823415811358404, 0.1430474950817399, -0.15830054658369, -0.10818120844741648, 0.3599854973514402, -0.025843075654559053, -0.10159743032353516, 0.1975500715752354, -0.15544398998959907, -0.08858520390155415, 0.15944568720454025, 0.09021764232717927, 0.07442205367861168, -0.1297608679262108, 0.0524669425268214, -0.018236939085736162, 0.18263767681006962, 0.04415565598127802, 0.065822780960136, 0.23902479082804232, 0.2250327430277442, 0.06990266200672421, 0.14797176377818225, -0.1600039029763716, -0.09327896898021064, -0.25855491696191685, -0.13725066359343363, -0.203272654933648, 0.049583915421473126, -0.054046228520400336, -0.15487179878751733, 0.4069115913739624, 0.16432493394388567, 0.20236314368796432, -0.05694627577054595, 0.23221946827280113, 0.07587084798641237, 0.06425893150033458, -0.013472562919126912, 0.25486705761905465, 0.16546957856524616, 0.06307431448450578, -0.27204811721411903, 0.06439761220872964, 0.03824632568192476] |
1,802.0022 | Robust multigrid solvers for the biharmonic problem in isogeometric
analysis | In this paper, we develop multigrid solvers for the biharmonic problem in the
framework of isogeometric analysis (IgA). In this framework, one typically sets
up B-splines on the unit square or cube and transforms them to the domain of
interest by a global smooth geometry function. With this approach, it is
feasible to set up $H^2$-conforming discretizations. We propose two multigrid
methods for such a discretization, one based on Gauss Seidel smoothing and one
based on mass smoothing. We prove that both are robust in the grid size, the
latter is also robust in the spline degree. Numerical experiments illustrate
the convergence theory and indicate the efficiency of the proposed multigrid
approaches, particularly of a hybrid approach combining both smoothers.
| math.NA | in this paper we develop multigrid solvers for the biharmonic problem in the framework of isogeometric analysis iga in this framework one typically sets up bsplines on the unit square or cube and transforms them to the domain of interest by a global smooth geometry function with this approach it is feasible to set up h2conforming discretizations we propose two multigrid methods for such a discretization one based on gauss seidel smoothing and one based on mass smoothing we prove that both are robust in the grid size the latter is also robust in the spline degree numerical experiments illustrate the convergence theory and indicate the efficiency of the proposed multigrid approaches particularly of a hybrid approach combining both smoothers | [['in', 'this', 'paper', 'we', 'develop', 'multigrid', 'solvers', 'for', 'the', 'biharmonic', 'problem', 'in', 'the', 'framework', 'of', 'isogeometric', 'analysis', 'iga', 'in', 'this', 'framework', 'one', 'typically', 'sets', 'up', 'bsplines', 'on', 'the', 'unit', 'square', 'or', 'cube', 'and', 'transforms', 'them', 'to', 'the', 'domain', 'of', 'interest', 'by', 'a', 'global', 'smooth', 'geometry', 'function', 'with', 'this', 'approach', 'it', 'is', 'feasible', 'to', 'set', 'up', 'h2conforming', 'discretizations', 'we', 'propose', 'two', 'multigrid', 'methods', 'for', 'such', 'a', 'discretization', 'one', 'based', 'on', 'gauss', 'seidel', 'smoothing', 'and', 'one', 'based', 'on', 'mass', 'smoothing', 'we', 'prove', 'that', 'both', 'are', 'robust', 'in', 'the', 'grid', 'size', 'the', 'latter', 'is', 'also', 'robust', 'in', 'the', 'spline', 'degree', 'numerical', 'experiments', 'illustrate', 'the', 'convergence', 'theory', 'and', 'indicate', 'the', 'efficiency', 'of', 'the', 'proposed', 'multigrid', 'approaches', 'particularly', 'of', 'a', 'hybrid', 'approach', 'combining', 'both', 'smoothers']] | [-0.06019295533575739, -0.04052482544599722, -0.1047362715859587, 0.04089474393040291, -0.05582617896143347, -0.11697790238152568, -0.0015044282947201282, 0.4096656501448403, -0.30560133459512145, -0.26845148477004843, 0.15477603781716123, -0.24363188261243826, -0.16606870246469044, 0.22115707283373923, -0.0968498113992003, 0.10708284737387051, 0.07736027388212581, -0.03284030263312161, -0.12103513581854865, -0.2753613477533994, 0.32853724279169305, 0.004815123369917273, 0.2880264699788919, 0.037188487408760316, 0.11660604562299946, -0.057911630153345564, -0.04553881512256339, 0.041970487874156484, -0.10830223508752776, 0.18484489993716124, 0.2178225704895643, 0.09801614567792664, 0.34597925003618, -0.40679583894088867, -0.20199254295633484, 0.0713051160525841, 0.13052100451022852, 0.08935905705050876, -0.06632803761167452, -0.23754796954841975, 0.0902790455147624, -0.12256762951838027, -0.11170153451384976, -0.14820745587348938, -0.0689257557115828, 0.037227220862405375, -0.3031402406282723, 0.053524400084036944, 0.07304371022231256, 0.058610144762011866, -0.02814443501022955, -0.14654502044431866, 0.03810594125146357, 0.024147045532784735, 0.011724431017258514, 0.016171470901463182, 0.0417844240165626, -0.04439874953629139, -0.09950438499605904, 0.3787996717146598, -0.046557840115080275, -0.31171316855276626, 0.15888969432950642, -0.08774586115420485, -0.13345754817516234, 0.1019369948344926, 0.21365452879884592, 0.1994751966597202, -0.09901406791371604, 0.10419974371179705, -0.011507858813274652, 0.15576012544333934, 0.05350425718546224, -0.049418889422668144, 0.11536439383247246, 0.2277021324339633, 0.15769075380327802, 0.11820318706644078, -0.10428833771802601, -0.1148128064814955, -0.31361979973347237, -0.13658946615372164, -0.2022912923770491, -0.04053333048844555, -0.1614806175344711, -0.21556427729083225, 0.40996922737297914, 0.18276744701627953, 0.14556366412434726, 0.07908158079565814, 0.3504941446085771, 0.11421555196005405, 0.07026014416284548, 0.09639479042962193, 0.16822930082756404, 0.13862251521010574, 0.07767660603470479, -0.21886821584193966, -0.020218762400327252, 0.17078773138734202] |
1,802.00221 | Dust evolution in protoplanetary discs and the formation of
planetesimals. What have we learned from laboratory experiments? | After 25 years of laboratory research on protoplanetary dust agglomeration, a
consistent picture of the various processes that involve colliding dust
aggregates has emerged. Besides sticking, bouncing and fragmentation, other
effects, like, e.g., erosion or mass transfer, have now been extensively
studied. Coagulation simulations consistently show that $\rm \mu$m-sized dust
grains can grow to mm- to cm-sized aggregates before they encounter the
bouncing barrier, whereas sub-$\rm \mu$m-sized water-ice particles can directly
grow to planetesimal sizes. For siliceous materials, other processes have to be
responsible for turning the dust aggregates into planetesimals. In this
article, these processes are discussed, the physical properties of the emerging
dusty or icy planetesimals are presented and compared to empirical evidence
from within and without the Solar System. In conclusion, the formation of
planetesimals by a gravitational collapse of dust "pebbles" seems the most
likely.
| astro-ph.EP | after 25 years of laboratory research on protoplanetary dust agglomeration a consistent picture of the various processes that involve colliding dust aggregates has emerged besides sticking bouncing and fragmentation other effects like eg erosion or mass transfer have now been extensively studied coagulation simulations consistently show that rm mumsized dust grains can grow to mm to cmsized aggregates before they encounter the bouncing barrier whereas subrm mumsized waterice particles can directly grow to planetesimal sizes for siliceous materials other processes have to be responsible for turning the dust aggregates into planetesimals in this article these processes are discussed the physical properties of the emerging dusty or icy planetesimals are presented and compared to empirical evidence from within and without the solar system in conclusion the formation of planetesimals by a gravitational collapse of dust pebbles seems the most likely | [['after', '25', 'years', 'of', 'laboratory', 'research', 'on', 'protoplanetary', 'dust', 'agglomeration', 'a', 'consistent', 'picture', 'of', 'the', 'various', 'processes', 'that', 'involve', 'colliding', 'dust', 'aggregates', 'has', 'emerged', 'besides', 'sticking', 'bouncing', 'and', 'fragmentation', 'other', 'effects', 'like', 'eg', 'erosion', 'or', 'mass', 'transfer', 'have', 'now', 'been', 'extensively', 'studied', 'coagulation', 'simulations', 'consistently', 'show', 'that', 'rm', 'mumsized', 'dust', 'grains', 'can', 'grow', 'to', 'mm', 'to', 'cmsized', 'aggregates', 'before', 'they', 'encounter', 'the', 'bouncing', 'barrier', 'whereas', 'subrm', 'mumsized', 'waterice', 'particles', 'can', 'directly', 'grow', 'to', 'planetesimal', 'sizes', 'for', 'siliceous', 'materials', 'other', 'processes', 'have', 'to', 'be', 'responsible', 'for', 'turning', 'the', 'dust', 'aggregates', 'into', 'planetesimals', 'in', 'this', 'article', 'these', 'processes', 'are', 'discussed', 'the', 'physical', 'properties', 'of', 'the', 'emerging', 'dusty', 'or', 'icy', 'planetesimals', 'are', 'presented', 'and', 'compared', 'to', 'empirical', 'evidence', 'from', 'within', 'and', 'without', 'the', 'solar', 'system', 'in', 'conclusion', 'the', 'formation', 'of', 'planetesimals', 'by', 'a', 'gravitational', 'collapse', 'of', 'dust', 'pebbles', 'seems', 'the', 'most', 'likely']] | [-0.029505064837091293, 0.21690054671110018, -0.0922608172159939, 0.07375837520922304, -0.010730302227876973, -0.05913816029003457, -0.044674298164613574, 0.378165117336734, -0.2353486023291581, -0.3041047117524389, 0.08624173486706517, -0.2907885067110908, -0.05072487493895966, 0.14256106444594005, -0.01648072465457886, 0.059255830976484423, 0.08103320996641465, -0.14165962417354278, 0.04350415998445554, -0.25263873380575114, 0.29986377054676955, 0.114209467821849, 0.12412322403701104, 0.07362532426318005, 0.027721476412978886, -0.13309986509241, -0.02825170511757766, -0.03063436584763121, -0.20626555164262358, 0.05980845226862373, 0.19781542858918724, 0.09541139103796172, 0.24371912856788738, -0.5478762582592343, -0.3018327130315204, 0.06900350590560424, 0.2155317808403355, 0.09954327444437945, -0.09043183307875406, -0.21396521555826717, 0.05299756929710291, -0.2104754808858253, -0.1699029964806539, 0.048026187182572816, 0.11898043535842115, 0.013726270341726047, -0.2579600006701303, 0.07489714288976097, 0.07788040910415567, 0.03538155488237955, -0.1050204641195824, -0.14620770384689144, -0.09959492968830644, 0.05576172650309172, 0.07644719733566424, -0.041507272694286876, 0.3256033901867551, -0.08150859461106913, -0.030475655953615795, 0.4499899310370286, -0.023606149063857298, -0.07319981527204315, 0.32004205701346305, -0.21553130880119684, -0.10243304031631113, 0.23554499467929313, 0.2096708003445056, 0.09477294772606937, -0.176446923586216, -0.024562063921779474, -0.018570474920072255, 0.13567338274130464, 0.17278064093788734, 0.028473018371648548, 0.37070997995054483, 0.18889501880503434, -0.041667634390962674, 0.09279077642502775, -0.1038233553096517, -0.14714796244558218, -0.18476299082259715, -0.160872557564922, -0.15476354134633488, 0.0602322479919193, -0.1231170516707673, -0.11276035155743307, 0.2111958511548279, 0.14498584802883366, 0.21247990818802212, 0.014460430352314226, 0.25239981200707995, -0.006255545848271931, 0.17220874177629425, 0.08533103375162497, 0.30206914041258826, 0.07088188989006955, 0.1314362359530144, -0.18024446456726856, 0.1706693878674043, -0.007091480686896197] |
1,802.00222 | The Hackbusch conjecture on tensor formats - part two | We prove a conjecture of W.~Hackbusch in a bigger generality than in our
previous article. Here we consider Tensor Train (TT) model with an arbitrary
number of leaves and a corresponding "almost binary tree" for Hierarchical
Tucker (HT) model, i.e. the deepest tree with the same number of leaves. Our
main result is an algorithm that computes the flattening rank of a generic
tensor in a Tensor Network State (TNS) model on a given tree with respect to
any flattening coming from combinatorics of the space. The methods also imply
that the tensor rank (which is also called CP-rank) of most tensors in a TNS
model grows exponentially with the growth of the number of leaves for any shape
of the tree.
| math.CO math.AG | we prove a conjecture of whackbusch in a bigger generality than in our previous article here we consider tensor train tt model with an arbitrary number of leaves and a corresponding almost binary tree for hierarchical tucker ht model ie the deepest tree with the same number of leaves our main result is an algorithm that computes the flattening rank of a generic tensor in a tensor network state tns model on a given tree with respect to any flattening coming from combinatorics of the space the methods also imply that the tensor rank which is also called cprank of most tensors in a tns model grows exponentially with the growth of the number of leaves for any shape of the tree | [['we', 'prove', 'a', 'conjecture', 'of', 'whackbusch', 'in', 'a', 'bigger', 'generality', 'than', 'in', 'our', 'previous', 'article', 'here', 'we', 'consider', 'tensor', 'train', 'tt', 'model', 'with', 'an', 'arbitrary', 'number', 'of', 'leaves', 'and', 'a', 'corresponding', 'almost', 'binary', 'tree', 'for', 'hierarchical', 'tucker', 'ht', 'model', 'ie', 'the', 'deepest', 'tree', 'with', 'the', 'same', 'number', 'of', 'leaves', 'our', 'main', 'result', 'is', 'an', 'algorithm', 'that', 'computes', 'the', 'flattening', 'rank', 'of', 'a', 'generic', 'tensor', 'in', 'a', 'tensor', 'network', 'state', 'tns', 'model', 'on', 'a', 'given', 'tree', 'with', 'respect', 'to', 'any', 'flattening', 'coming', 'from', 'combinatorics', 'of', 'the', 'space', 'the', 'methods', 'also', 'imply', 'that', 'the', 'tensor', 'rank', 'which', 'is', 'also', 'called', 'cprank', 'of', 'most', 'tensors', 'in', 'a', 'tns', 'model', 'grows', 'exponentially', 'with', 'the', 'growth', 'of', 'the', 'number', 'of', 'leaves', 'for', 'any', 'shape', 'of', 'the', 'tree']] | [-0.10763543186716981, 0.1296995828317359, -0.07511108876052043, 0.02385752460503689, -0.07057785501795982, -0.1026730237967404, -0.0017855741961066388, 0.3198294686730797, -0.2844169745577715, -0.2591671963277165, 0.09898520509273676, -0.24777903960255737, -0.18838626426098146, 0.14661471783529875, -0.028936823444202356, 0.012094443499433907, 0.08453136130644023, 0.12962091701059056, -0.07376356604932384, -0.265427095401832, 0.3837152177945149, 0.055984446055386675, 0.24616806722084475, 0.013525774463826468, 0.13035994583417562, 0.026088650242140715, -0.03131110210756748, 0.03761557496440489, -0.07753882565295558, 0.1349240734034087, 0.19923882557402464, 0.18630476984241592, 0.2271712330931967, -0.3787010590668983, -0.17681684589190486, 0.16922133566026598, 0.11885791615975544, 0.14580749650582026, 0.0026330212602576563, -0.19104733462503165, 0.15199478881525968, -0.20010083016346802, -0.12125618189326988, -0.054320087737195995, 0.013734018299266819, -0.05358155857731226, -0.26048174999223267, 0.04282956466815734, 0.09662076319213803, 0.008627598860862949, -0.08539410467906124, -0.16333103596717735, -0.047543556766184276, 0.08129836195571856, 0.020414767959078175, 0.08477447843486982, 0.031903470704747625, -0.14072514562444252, -0.1314736838714212, 0.34364245177731534, -0.07255781112368169, -0.20815761288828102, 0.17269210832208887, -0.11465557800867587, -0.19799763574996146, 0.10849459827800613, 0.1762310498709644, 0.11780654985413402, -0.05283305284467118, 0.13076020321522047, -0.09522536752576177, 0.18058880130675706, 0.07590497636875092, -0.04113490622075013, 0.13449971756536114, 0.17374736111811248, 0.12242121605418069, 0.177503407994393, -0.04683443893339823, -0.048477434480085596, -0.2879669401594553, -0.17553587522057523, -0.22646651524773315, 0.03863824041144661, -0.17590831693111292, -0.25206384125881454, 0.4242841477875313, 0.11978985801770174, 0.2524392281847521, 0.17557888855284065, 0.2939912072606077, 0.062072819046876275, 0.06909614524319152, 0.12760090613968608, 0.1637050410576765, 0.1595469210643229, 0.020975583282968967, -0.13983989014936812, 0.07963006940385527, 0.10802557589178366] |
1,802.00223 | Interference Mitigation Methods for Unmanned Aerial Vehicles Served by
Cellular Networks | A main challenge in providing connectivity to the low altitude unmanned
aerial vehicles (UAVs) through existing cellular network arises due to the
increased interference in the network. The increased altitude and favourable
propagation condition cause UAVs to generate more interference to the
neighbouring cells, and at the same time experience more interference from the
downlink transmissions of the neighbouring base stations. The uplink
interference problem may result in terrestrial UEs having degraded performance,
whereas the downlink interference problem may make it challenging for a UAV to
maintain connection with the network. In this paper, we propose several uplink
and downlink interference mitigation techniques to address these issues. The
results indicate that the proposed solutions can reduce the uplink throughput
degradation of terrestrial UEs and ensure UAVs to remain in LTE coverage under
the worst case scenarios when all the base stations transmit at full power.
| cs.IT math.IT | a main challenge in providing connectivity to the low altitude unmanned aerial vehicles uavs through existing cellular network arises due to the increased interference in the network the increased altitude and favourable propagation condition cause uavs to generate more interference to the neighbouring cells and at the same time experience more interference from the downlink transmissions of the neighbouring base stations the uplink interference problem may result in terrestrial ues having degraded performance whereas the downlink interference problem may make it challenging for a uav to maintain connection with the network in this paper we propose several uplink and downlink interference mitigation techniques to address these issues the results indicate that the proposed solutions can reduce the uplink throughput degradation of terrestrial ues and ensure uavs to remain in lte coverage under the worst case scenarios when all the base stations transmit at full power | [['a', 'main', 'challenge', 'in', 'providing', 'connectivity', 'to', 'the', 'low', 'altitude', 'unmanned', 'aerial', 'vehicles', 'uavs', 'through', 'existing', 'cellular', 'network', 'arises', 'due', 'to', 'the', 'increased', 'interference', 'in', 'the', 'network', 'the', 'increased', 'altitude', 'and', 'favourable', 'propagation', 'condition', 'cause', 'uavs', 'to', 'generate', 'more', 'interference', 'to', 'the', 'neighbouring', 'cells', 'and', 'at', 'the', 'same', 'time', 'experience', 'more', 'interference', 'from', 'the', 'downlink', 'transmissions', 'of', 'the', 'neighbouring', 'base', 'stations', 'the', 'uplink', 'interference', 'problem', 'may', 'result', 'in', 'terrestrial', 'ues', 'having', 'degraded', 'performance', 'whereas', 'the', 'downlink', 'interference', 'problem', 'may', 'make', 'it', 'challenging', 'for', 'a', 'uav', 'to', 'maintain', 'connection', 'with', 'the', 'network', 'in', 'this', 'paper', 'we', 'propose', 'several', 'uplink', 'and', 'downlink', 'interference', 'mitigation', 'techniques', 'to', 'address', 'these', 'issues', 'the', 'results', 'indicate', 'that', 'the', 'proposed', 'solutions', 'can', 'reduce', 'the', 'uplink', 'throughput', 'degradation', 'of', 'terrestrial', 'ues', 'and', 'ensure', 'uavs', 'to', 'remain', 'in', 'lte', 'coverage', 'under', 'the', 'worst', 'case', 'scenarios', 'when', 'all', 'the', 'base', 'stations', 'transmit', 'at', 'full', 'power']] | [-0.31075556815023825, 0.040948794075641136, 0.04754509627819061, 0.04493287483406863, -0.05848828245371837, -0.20417592706608362, 0.1673963022940182, 0.386737541597465, -0.26399293056978235, -0.3302134655159095, 0.03953451385785794, -0.2370055835822533, -0.20437369014553983, 0.08147379709728833, -0.2077552650766126, 0.03323434155819745, 0.1158457580921722, 0.022061221545626376, 0.013844032983038703, -0.2546534310030783, 0.24967614116532535, 0.16274619560110673, 0.3952769522779974, 0.05433437034351237, 0.02736797403415729, -0.021175258972778402, -0.004649357780300338, -0.06723507323125698, -0.051444603366514366, 0.045951271890502035, 0.39074640063376265, 0.20734589116262464, 0.2690686537723603, -0.516250237565616, -0.2843203443985689, 0.1311568139313624, 0.20063785651441793, 0.02661128210923474, 0.001331431689021852, -0.31871939229795004, 0.13583486643459264, -0.22688487574201205, -0.07211954198649217, 0.079182262082809, -0.10311924505914594, 0.059159440010513084, -0.34490295627379214, -0.029386915086672225, -0.05705017069161966, 0.04343170172310081, -0.06132600165839339, -0.0865224221127172, 0.0026715400596630983, 0.23866685840465804, 0.10189774425636078, -0.04601239480624168, 0.0977706383271464, -0.09950112061984516, -0.04951869109152477, 0.4298769766015225, 0.05908052572852065, -0.21059437229715544, 0.1925689803629086, -0.12254471910599588, -0.07369435787650531, 0.19008056418809655, 0.2666388243019324, 0.03641327706904247, -0.17568793052953974, -0.03513851016418655, 0.032893371048929365, 0.09779707084024518, 0.15235670376207744, 0.11180251736097552, 0.17698877289537981, 0.20798292362516554, 0.23693593382064637, 0.0830000422011804, -0.1803037482217468, -0.10398171005192502, -0.14955224392229113, -0.09151709541871116, -0.1705198540392428, 0.015966458223631668, -0.058990613964851946, -0.03680891990260189, 0.3404703683765798, 0.17560652258709586, 0.10048308459688621, 0.12946347728339505, 0.4724562112787931, 0.07295409290858641, 0.06899172536193811, 0.1174981669811853, 0.21186769904713307, 0.065583722831296, 0.19897731309114344, -0.24868160496257116, 0.055363392837923665, -0.050237458836736866] |
1,802.00224 | Polarimetry and Spectroscopy of the `Oxygen Flaring' DQ Herculis-like
nova: V5668 Sagittarii (2015) | Classical novae are eruptions on the surface of a white dwarf in a binary
system. The material ejected from the white dwarf surface generally forms an
axisymmetric shell of gas and dust around the system. The three-dimensional
structure of these shells is difficult to untangle when viewed on the plane of
the sky. In this work a geometrical model is developed to explain new
observations of the 2015 nova V5668 Sagittarii. To understand the ionisation
structure in terms of the nova shell morphology and estimate the emission
distribution directly following the light-curve's dust-dip.
High-cadence optical polarimetry and spectroscopy observations of a nova are
presented. The ejecta is modelled in terms of morpho-kinematics and
photoionisation structure.
Initially observational results are presented, including broadband
polarimetry and spectroscopy of V5668 Sgr nova during eruption. Variability
over these observations provides clues towards the evolving structure of the
nova shell. The position angle of the shell is derived from polarimetry, which
is attributed to scattering from small dust grains. Shocks in the nova outflow
are suggested in the photometry and the effect of these on the nova shell are
illustrated with various physical diagnostics. Changes in density and
temperature as the super soft source phase of the nova began are discussed. Gas
densities are found to be of the order of 10$^{9}$ cm$^{-3}$ for the nova in
its auroral phase. The blackbody temperature of the central stellar system is
estimated to be around $2.2\times10^{5}$ K at times coincident with the super
soft source turn-on. It was found that the blend around 4640 $\rm{\AA}$
commonly called `nitrogen flaring' is more naturally explained as flaring of
the O~{\sc ii} multiplet (V1) from 4638 - 4696 $\rm{\AA}$, i.e. `oxygen
flaring'.
| astro-ph.SR astro-ph.HE | classical novae are eruptions on the surface of a white dwarf in a binary system the material ejected from the white dwarf surface generally forms an axisymmetric shell of gas and dust around the system the threedimensional structure of these shells is difficult to untangle when viewed on the plane of the sky in this work a geometrical model is developed to explain new observations of the 2015 nova v5668 sagittarii to understand the ionisation structure in terms of the nova shell morphology and estimate the emission distribution directly following the lightcurves dustdip highcadence optical polarimetry and spectroscopy observations of a nova are presented the ejecta is modelled in terms of morphokinematics and photoionisation structure initially observational results are presented including broadband polarimetry and spectroscopy of v5668 sgr nova during eruption variability over these observations provides clues towards the evolving structure of the nova shell the position angle of the shell is derived from polarimetry which is attributed to scattering from small dust grains shocks in the nova outflow are suggested in the photometry and the effect of these on the nova shell are illustrated with various physical diagnostics changes in density and temperature as the super soft source phase of the nova began are discussed gas densities are found to be of the order of 109 cm3 for the nova in its auroral phase the blackbody temperature of the central stellar system is estimated to be around 22times105 k at times coincident with the super soft source turnon it was found that the blend around 4640 rmaa commonly called nitrogen flaring is more naturally explained as flaring of the osc ii multiplet v1 from 4638 4696 rmaa ie oxygen flaring | [['classical', 'novae', 'are', 'eruptions', 'on', 'the', 'surface', 'of', 'a', 'white', 'dwarf', 'in', 'a', 'binary', 'system', 'the', 'material', 'ejected', 'from', 'the', 'white', 'dwarf', 'surface', 'generally', 'forms', 'an', 'axisymmetric', 'shell', 'of', 'gas', 'and', 'dust', 'around', 'the', 'system', 'the', 'threedimensional', 'structure', 'of', 'these', 'shells', 'is', 'difficult', 'to', 'untangle', 'when', 'viewed', 'on', 'the', 'plane', 'of', 'the', 'sky', 'in', 'this', 'work', 'a', 'geometrical', 'model', 'is', 'developed', 'to', 'explain', 'new', 'observations', 'of', 'the', '2015', 'nova', 'v5668', 'sagittarii', 'to', 'understand', 'the', 'ionisation', 'structure', 'in', 'terms', 'of', 'the', 'nova', 'shell', 'morphology', 'and', 'estimate', 'the', 'emission', 'distribution', 'directly', 'following', 'the', 'lightcurves', 'dustdip', 'highcadence', 'optical', 'polarimetry', 'and', 'spectroscopy', 'observations', 'of', 'a', 'nova', 'are', 'presented', 'the', 'ejecta', 'is', 'modelled', 'in', 'terms', 'of', 'morphokinematics', 'and', 'photoionisation', 'structure', 'initially', 'observational', 'results', 'are', 'presented', 'including', 'broadband', 'polarimetry', 'and', 'spectroscopy', 'of', 'v5668', 'sgr', 'nova', 'during', 'eruption', 'variability', 'over', 'these', 'observations', 'provides', 'clues', 'towards', 'the', 'evolving', 'structure', 'of', 'the', 'nova', 'shell', 'the', 'position', 'angle', 'of', 'the', 'shell', 'is', 'derived', 'from', 'polarimetry', 'which', 'is', 'attributed', 'to', 'scattering', 'from', 'small', 'dust', 'grains', 'shocks', 'in', 'the', 'nova', 'outflow', 'are', 'suggested', 'in', 'the', 'photometry', 'and', 'the', 'effect', 'of', 'these', 'on', 'the', 'nova', 'shell', 'are', 'illustrated', 'with', 'various', 'physical', 'diagnostics', 'changes', 'in', 'density', 'and', 'temperature', 'as', 'the', 'super', 'soft', 'source', 'phase', 'of', 'the', 'nova', 'began', 'are', 'discussed', 'gas', 'densities', 'are', 'found', 'to', 'be', 'of', 'the', 'order', 'of', '109', 'cm3', 'for', 'the', 'nova', 'in', 'its', 'auroral', 'phase', 'the', 'blackbody', 'temperature', 'of', 'the', 'central', 'stellar', 'system', 'is', 'estimated', 'to', 'be', 'around', '22times105', 'k', 'at', 'times', 'coincident', 'with', 'the', 'super', 'soft', 'source', 'turnon', 'it', 'was', 'found', 'that', 'the', 'blend', 'around', '4640', 'rmaa', 'commonly', 'called', 'nitrogen', 'flaring', 'is', 'more', 'naturally', 'explained', 'as', 'flaring', 'of', 'the', 'osc', 'ii', 'multiplet', 'v1', 'from', '4638', '4696', 'rmaa', 'ie', 'oxygen', 'flaring']] | [-0.040864611315607494, 0.1019172702987167, -0.06380743993546016, 0.08197233046105663, -0.05593780469581751, -0.08884210099017115, 0.02204247469282044, 0.4202785276516806, -0.1952227543390888, -0.32208062193323195, 0.10888449035742918, -0.3126866034797526, -0.06825445239852083, 0.19240901906159708, -0.058326381948199925, -0.031572508762266284, 0.07490091732553472, -0.06272406287483007, -0.0652389743302982, -0.21811276478900773, 0.2704209699312092, 0.10560078426663365, 0.13652209791990963, -0.024624824968174964, 0.04974598146010456, -0.10004622502601705, -0.05221359718624236, -0.06824863970770301, -0.08995087228761674, 0.03797885134972603, 0.2008987845741753, 0.1051199257639902, 0.1306424999592959, -0.4079506400415474, -0.2630566430045292, 0.0012853263037478817, 0.15835132615674022, 0.010030430210671121, -0.0143896622741782, -0.26879063876986037, 0.012801677474219885, -0.1849430427695292, -0.19347601393736633, 0.05985487646789157, 0.057202154688119275, 0.03439506766361384, -0.22022687107008615, 0.09972052433212021, 0.03718763240820928, 0.08152336617806993, -0.1323383567950389, -0.07756970256907932, -0.08447953857955456, 0.05976366184653931, 0.051884140315814876, 0.08469544743753171, 0.1512293508159928, -0.11298094651345829, -0.008449970215692052, 0.4019910838849942, -0.07664735289997354, 0.015304109769307876, 0.22327027537934815, -0.22743416679856768, -0.1305232964007051, 0.2075437876063266, 0.12990124045671628, 0.11413548976332615, -0.1698728791557057, 0.004512999659345951, -0.02883372204502978, 0.16755940458803836, 0.048956364752874446, 0.038877495579488046, 0.31356634776540365, 0.15954106726899875, -0.03186935757486416, 0.12291862687644815, -0.2665706254982589, -0.06337214311185692, -0.2691870583171424, -0.11750338854367978, -0.14852272771406985, 0.08288669737272097, -0.09240747766582769, -0.144424253107614, 0.36023561474950316, 0.07425486806376803, 0.2134210307783048, -0.06858719414989796, 0.264802182407584, 0.0680995224966734, 0.06456002155900933, 0.12576141899584659, 0.322858272961873, 0.20550532456919818, 0.14129421680658458, -0.25771759260844973, 0.10822576025135017, 0.03069937507555421] |
1,802.00225 | The electromagnetic scattering problem by a cylindrical doubly-connected
domain at oblique incidence: the direct problem | We consider the direct electromagnetic scattering problem of time-harmonic
obliquely incident waves by a infinitely long, homogeneous and doubly-connected
cylinder in three dimensions. We apply a hybrid integral equation method
(combination of the direct and indirect methods) and we transform the
scattering problem to a system of singular and hypersingular integral
equations. The well-posedness of the corresponding problem is proven. We use
trigonometric polynomial approximations and we solve the system of the
discretized integral operators by a collocation method.
| math.AP math.NA | we consider the direct electromagnetic scattering problem of timeharmonic obliquely incident waves by a infinitely long homogeneous and doublyconnected cylinder in three dimensions we apply a hybrid integral equation method combination of the direct and indirect methods and we transform the scattering problem to a system of singular and hypersingular integral equations the wellposedness of the corresponding problem is proven we use trigonometric polynomial approximations and we solve the system of the discretized integral operators by a collocation method | [['we', 'consider', 'the', 'direct', 'electromagnetic', 'scattering', 'problem', 'of', 'timeharmonic', 'obliquely', 'incident', 'waves', 'by', 'a', 'infinitely', 'long', 'homogeneous', 'and', 'doublyconnected', 'cylinder', 'in', 'three', 'dimensions', 'we', 'apply', 'a', 'hybrid', 'integral', 'equation', 'method', 'combination', 'of', 'the', 'direct', 'and', 'indirect', 'methods', 'and', 'we', 'transform', 'the', 'scattering', 'problem', 'to', 'a', 'system', 'of', 'singular', 'and', 'hypersingular', 'integral', 'equations', 'the', 'wellposedness', 'of', 'the', 'corresponding', 'problem', 'is', 'proven', 'we', 'use', 'trigonometric', 'polynomial', 'approximations', 'and', 'we', 'solve', 'the', 'system', 'of', 'the', 'discretized', 'integral', 'operators', 'by', 'a', 'collocation', 'method']] | [-0.18221742994096013, 0.028284787806045687, -0.0995085366023115, 0.07832879891443727, -0.12710188120261684, -0.08182977822526724, -0.011125389062151124, 0.363879515258949, -0.33963879669391656, -0.21987324898850313, 0.1353625761731115, -0.2994389723915654, -0.17871264923552546, 0.2124177464460836, 0.031619015774583516, 0.1571840315326294, 0.10036324291737585, -0.028736164457388694, -0.11048641312820247, -0.19260747721595572, 0.37266693424574937, -0.06987402007526046, 0.21273238665153144, 0.029430425525466097, 0.19362493411083764, 0.07681188006189806, -0.0428723607660283, 0.0006669495384432847, -0.13090479124302068, 0.14837309473659843, 0.23712593376565771, 0.014900027830271593, 0.26676389140583856, -0.47551236322880547, -0.20100269611641952, 0.09180590831099927, 0.16870581028582174, 0.09751637990857605, -0.01640342432958416, -0.2974756032794337, -0.0025803545472223924, -0.1275453446668726, -0.21372638997633622, -0.03903210515604366, 0.0009349534712448905, 0.06069119215671775, -0.29701182184905944, 0.09713558667144868, 0.027651943348914007, 0.009692840737915492, -0.15660336318932758, -0.07727665190962202, 0.08140337434184702, 0.027407986960739275, 0.021266485987337234, -0.03284620493060992, 0.013058609181802861, -0.0989676814031186, -0.08362237646987167, 0.35857628735336416, -0.10677323078359419, -0.30320660461070414, 0.14772499122810137, -0.09899988314844196, -0.059079433803128294, 0.18338766758907823, 0.18672987876483535, 0.23550957289253233, -0.15009103622876957, 0.155227703958178, -0.07718885996485059, 0.09751174000056484, 0.11280495892691461, -0.04952522057780548, 0.11181435088002228, 0.15496658497266, 0.10902793845751241, 0.15692291534918396, -0.07323686523315838, -0.04324488136681575, -0.3071879622868345, -0.16000300922867242, -0.19517198617900192, 0.054824462872222535, -0.07354970637353762, -0.19928763398924207, 0.34800150063879126, 0.143239550557742, 0.09983722243127943, 0.038379386951557445, 0.3131933253128789, 0.24103076655794925, 0.000879981915342704, 0.0588360444901959, 0.1978375877701689, 0.206583404047061, 0.13629462822234328, -0.25199093435643405, -0.06964183541580657, 0.19264326698465062] |
1,802.00226 | Optimal isoperimetric inequalities for surfaces in any codimension in
Cartan-Hadamard manifolds | Let $(M^n,g)$ be simply connected, complete, with non-positive sectional
curvatures, and $\Sigma$ a 2-dimensional closed integral current (or flat chain
mod 2) with compact support in $M$. Let $S$ be an area minimising integral
3-current (resp. flat chain mod 2) such that $\partial S = \Sigma$. We use a
weak mean curvature flow, obtained via elliptic regularisation, starting from
$\Sigma$, to show that S satisfies the optimal Euclidean isoperimetric
inequality: $ 6 \sqrt{\pi}\, \mathbf{M}[S] \leq (\mathbf{M}[\Sigma])^{3/2} $.
We also obtain an optimal estimate in case the sectional curvatures of M are
bounded from above by $-\kappa < 0$ and characterise the case of equality. The
proof follows from an almost monotonicity of a suitable isoperimetric
difference along the approximating flows in one dimension higher and an optimal
estimate for the Willmore energy of a 2-dimensional integral varifold with
first variation summable in $L^2$.
| math.DG math.AP | let mng be simply connected complete with nonpositive sectional curvatures and sigma a 2dimensional closed integral current or flat chain mod 2 with compact support in m let s be an area minimising integral 3current resp flat chain mod 2 such that partial s sigma we use a weak mean curvature flow obtained via elliptic regularisation starting from sigma to show that s satisfies the optimal euclidean isoperimetric inequality 6 sqrtpi mathbfms leq mathbfmsigma32 we also obtain an optimal estimate in case the sectional curvatures of m are bounded from above by kappa 0 and characterise the case of equality the proof follows from an almost monotonicity of a suitable isoperimetric difference along the approximating flows in one dimension higher and an optimal estimate for the willmore energy of a 2dimensional integral varifold with first variation summable in l2 | [['let', 'mng', 'be', 'simply', 'connected', 'complete', 'with', 'nonpositive', 'sectional', 'curvatures', 'and', 'sigma', 'a', '2dimensional', 'closed', 'integral', 'current', 'or', 'flat', 'chain', 'mod', '2', 'with', 'compact', 'support', 'in', 'm', 'let', 's', 'be', 'an', 'area', 'minimising', 'integral', '3current', 'resp', 'flat', 'chain', 'mod', '2', 'such', 'that', 'partial', 's', 'sigma', 'we', 'use', 'a', 'weak', 'mean', 'curvature', 'flow', 'obtained', 'via', 'elliptic', 'regularisation', 'starting', 'from', 'sigma', 'to', 'show', 'that', 's', 'satisfies', 'the', 'optimal', 'euclidean', 'isoperimetric', 'inequality', '6', 'sqrtpi', 'mathbfms', 'leq', 'mathbfmsigma32', 'we', 'also', 'obtain', 'an', 'optimal', 'estimate', 'in', 'case', 'the', 'sectional', 'curvatures', 'of', 'm', 'are', 'bounded', 'from', 'above', 'by', 'kappa', '0', 'and', 'characterise', 'the', 'case', 'of', 'equality', 'the', 'proof', 'follows', 'from', 'an', 'almost', 'monotonicity', 'of', 'a', 'suitable', 'isoperimetric', 'difference', 'along', 'the', 'approximating', 'flows', 'in', 'one', 'dimension', 'higher', 'and', 'an', 'optimal', 'estimate', 'for', 'the', 'willmore', 'energy', 'of', 'a', '2dimensional', 'integral', 'varifold', 'with', 'first', 'variation', 'summable', 'in', 'l2']] | [-0.19414605483111433, 0.09730216245182366, -0.05364055917529827, 0.0749827081008869, -0.07526431726771132, -0.19968086022281034, -0.02547110496979097, 0.348727388168781, -0.2951434582603671, -0.22592531270450256, 0.12119879161678802, -0.3261238790308947, -0.0841982029404094, 0.17613042084164643, -0.11062274380545954, 0.020782711176092133, 0.027676209420486188, 0.11746043996091056, -0.08612997705794816, -0.2312326290206436, 0.35983124969061464, -0.07061472005443648, 0.17837488464668722, 0.06400229243873208, 0.12159537672928042, 0.026769407896448254, 0.008622161016854294, 0.06244863602949087, -0.2640565959170678, 0.1605864278475672, 0.23536015583051587, 0.02752498964785927, 0.2178911902365679, -0.35875070711036267, -0.197154734742499, 0.19573396608671723, 0.13879540617327782, -0.0713486207429977, 0.026394592344706112, -0.25749680509119677, 0.1360251926628681, -0.07632953041534432, -0.2116585001726087, -0.029400718088522005, 0.07763304730178788, 0.018152255825150537, -0.2771528857787523, 0.09819179880993462, 0.10826279898174107, 0.09704179438823998, -0.10804832683403648, -0.15830780389746102, -0.07457618297570769, 0.06784748228400371, 0.008600932662375271, 0.11213729181840523, 0.0583580285858582, -0.052573821514242274, -0.06981430006870891, 0.2761340092470431, -0.14998134109533995, -0.26507016079609885, 0.04156344016219544, -0.15840098631280639, -0.1028904833844589, 0.14768890520174274, 0.1124712007928311, 0.16435746377443566, -0.07214590252089478, 0.18951536101667443, -0.05940987602876061, 0.1372063762973994, 0.12150948951774113, -0.05662272943813792, 0.11271600965205032, 0.075335724703858, 0.22114308772142977, 0.14065454190302476, -0.03534153399317909, -0.018256341201349106, -0.4171731813591631, -0.21728252138778129, -0.1898209668142954, 0.21709338631754851, -0.16828162148361597, -0.14211783562923835, 0.2676750373519847, -0.008292064103644033, 0.20434570320717552, 0.17141691134747816, 0.21364661720444394, 0.09914996325182181, -0.0009491654825122917, 0.1555695852251066, 0.1445699876794071, 0.20225803315920263, 0.024452795363579166, -0.13127342271378867, -0.04922803900177207, 0.12632025822152654] |
1,802.00227 | Is quantum mechanics creationism, and not science? | I revisit the reply of Bohr to Einstein. Bohr's assertion that there are no causes in atomic scale systems is, as a closer analysis reveals, not in line with the Copenhagen interpretation since it would contain a statement about reality. What Bohr should have written is that there are no causes in mathematics, which is universally acknowledged. The law of causality requires physical effects to be due to physical causes. For this reason any theoretical model which replaces physical causes by mathematical objects is creationism, that is, it creates physical objects out of mathematical elements. I show that this is the case for most of quantum mechanics. | physics.hist-ph physics.pop-ph | i revisit the reply of bohr to einstein bohrs assertion that there are no causes in atomic scale systems is as a closer analysis reveals not in line with the copenhagen interpretation since it would contain a statement about reality what bohr should have written is that there are no causes in mathematics which is universally acknowledged the law of causality requires physical effects to be due to physical causes for this reason any theoretical model which replaces physical causes by mathematical objects is creationism that is it creates physical objects out of mathematical elements i show that this is the case for most of quantum mechanics | [['i', 'revisit', 'the', 'reply', 'of', 'bohr', 'to', 'einstein', 'bohrs', 'assertion', 'that', 'there', 'are', 'no', 'causes', 'in', 'atomic', 'scale', 'systems', 'is', 'as', 'a', 'closer', 'analysis', 'reveals', 'not', 'in', 'line', 'with', 'the', 'copenhagen', 'interpretation', 'since', 'it', 'would', 'contain', 'a', 'statement', 'about', 'reality', 'what', 'bohr', 'should', 'have', 'written', 'is', 'that', 'there', 'are', 'no', 'causes', 'in', 'mathematics', 'which', 'is', 'universally', 'acknowledged', 'the', 'law', 'of', 'causality', 'requires', 'physical', 'effects', 'to', 'be', 'due', 'to', 'physical', 'causes', 'for', 'this', 'reason', 'any', 'theoretical', 'model', 'which', 'replaces', 'physical', 'causes', 'by', 'mathematical', 'objects', 'is', 'creationism', 'that', 'is', 'it', 'creates', 'physical', 'objects', 'out', 'of', 'mathematical', 'elements', 'i', 'show', 'that', 'this', 'is', 'the', 'case', 'for', 'most', 'of', 'quantum', 'mechanics']] | [-0.1049704350495957, 0.11054319651349324, -0.1369373014126465, 0.10368793146280607, -0.1246366004617709, -0.1723558882115198, 0.027613387836301524, 0.3305977341226952, -0.20980978154968294, -0.29411805887653864, 0.06244833525028607, -0.2870194101091123, -0.1753377328134792, 0.19157718891444844, -0.15181161603837642, -0.03961071681631026, 0.036679587291799626, 0.05921963354537509, -0.03169337211985071, -0.20847109889277732, 0.3232324482600714, 0.05691702710354771, 0.22243822641002964, 0.09052647001720648, 0.06007795553338134, -0.020963504550240514, -0.020333847485675988, 0.03359790820681121, -0.048042343706738225, 0.07221632688921296, 0.2788592074417843, 0.2092192516012012, 0.3105215526554944, -0.4312069773463146, -0.22167491117703184, 0.09688107498903882, 0.10108862148668125, 0.14606935219654707, 0.008062022786482045, -0.219766264304712, 0.08770631432186214, -0.11446016437356483, -0.1620701342812335, -0.03956043658083973, 0.1212317269857762, -0.08316897326654245, -0.17678115291099222, 0.07333752178622163, 0.1313532788332833, 0.09854445192207284, -0.0329578084462621, -0.08108111958564171, 0.02221748095778924, 0.08553767286873651, 0.0790829763501742, 0.017907822320132324, 0.12821081455550948, -0.07536371086091506, -0.10531473433915174, 0.5099904018823268, 0.05198485903520981, -0.21536021806159109, 0.18403567939355336, -0.13108071097708746, -0.14475232625450446, 0.09324416555112826, 0.030869937062544643, 0.0198158234161383, -0.1382067382493812, 0.08496541983035025, -0.08448084022955231, 0.2274665859975975, 0.07248529805011063, 0.07538398133177873, 0.27496072208895433, 0.11983587239640502, 0.01747004523706394, 0.05932752641229803, -0.009714071313797866, -0.16916930499785351, -0.3491283132571657, -0.17079459179526651, -0.17027659578449839, 0.12231728405911883, 0.003535758821460647, -0.17230478943905458, 0.2703217199239177, 0.2287308436572411, 0.1545523552505194, -0.03466813999913492, 0.23659768972088988, 0.13203729565127947, 0.10797513719595406, 0.05058512587170556, 0.3001086491265528, 0.11727046608301055, 0.131450394116878, -0.12453240469396817, 0.13130846832228718, 0.037094370235759275] |
1,802.00228 | Strength of forensic evidence for composite hypotheses: An empirical
Bayes view with a fixed prior quantile | Motivated by the forensic problem of determining the strength of evidence of
a continuously distributed measurement of evidence, in the situation of
composite hypotheses of the prosecutor and the defence concerning a parameter
of a parametric model, we consider empirical Bayes methods with a prescribed
quantile value for the prior distribution.
Firstly we derive the strength of evidence for nonparametric priors. It turns
out that we get the by now more or less accepted strength of evidence as the
ratio of two suprema,
$\sup_{\theta\geq\theta_0}f(x|\theta)/\sup_{\theta<\theta_0}f(x|\theta)$. Here
the hypotheses of the prosecutor and defence are given by $H_p: \theta\geq
\theta_0$ and $H_d:\theta<\theta_0$. The evidence is seen as a measurement $x$
which is a realization of a random variable with a density $f(x|\theta)$.
Secondly we consider a similar parametric empirical Bayes method with a
quantile restriction on the prior where the prior distribution is assumed to be
normal. Some interesting strength of evidence functions are derived for this
situation.
| stat.AP | motivated by the forensic problem of determining the strength of evidence of a continuously distributed measurement of evidence in the situation of composite hypotheses of the prosecutor and the defence concerning a parameter of a parametric model we consider empirical bayes methods with a prescribed quantile value for the prior distribution firstly we derive the strength of evidence for nonparametric priors it turns out that we get the by now more or less accepted strength of evidence as the ratio of two suprema sup_thetageqtheta_0fxthetasup_thetatheta_0fxtheta here the hypotheses of the prosecutor and defence are given by h_p thetageq theta_0 and h_dthetatheta_0 the evidence is seen as a measurement x which is a realization of a random variable with a density fxtheta secondly we consider a similar parametric empirical bayes method with a quantile restriction on the prior where the prior distribution is assumed to be normal some interesting strength of evidence functions are derived for this situation | [['motivated', 'by', 'the', 'forensic', 'problem', 'of', 'determining', 'the', 'strength', 'of', 'evidence', 'of', 'a', 'continuously', 'distributed', 'measurement', 'of', 'evidence', 'in', 'the', 'situation', 'of', 'composite', 'hypotheses', 'of', 'the', 'prosecutor', 'and', 'the', 'defence', 'concerning', 'a', 'parameter', 'of', 'a', 'parametric', 'model', 'we', 'consider', 'empirical', 'bayes', 'methods', 'with', 'a', 'prescribed', 'quantile', 'value', 'for', 'the', 'prior', 'distribution', 'firstly', 'we', 'derive', 'the', 'strength', 'of', 'evidence', 'for', 'nonparametric', 'priors', 'it', 'turns', 'out', 'that', 'we', 'get', 'the', 'by', 'now', 'more', 'or', 'less', 'accepted', 'strength', 'of', 'evidence', 'as', 'the', 'ratio', 'of', 'two', 'suprema', 'sup_thetageqtheta_0fxthetasup_thetatheta_0fxtheta', 'here', 'the', 'hypotheses', 'of', 'the', 'prosecutor', 'and', 'defence', 'are', 'given', 'by', 'h_p', 'thetageq', 'theta_0', 'and', 'h_dthetatheta_0', 'the', 'evidence', 'is', 'seen', 'as', 'a', 'measurement', 'x', 'which', 'is', 'a', 'realization', 'of', 'a', 'random', 'variable', 'with', 'a', 'density', 'fxtheta', 'secondly', 'we', 'consider', 'a', 'similar', 'parametric', 'empirical', 'bayes', 'method', 'with', 'a', 'quantile', 'restriction', 'on', 'the', 'prior', 'where', 'the', 'prior', 'distribution', 'is', 'assumed', 'to', 'be', 'normal', 'some', 'interesting', 'strength', 'of', 'evidence', 'functions', 'are', 'derived', 'for', 'this', 'situation']] | [-0.09861897987445302, 0.08376007205439046, -0.10626134343482063, 0.08289295205337878, -0.06129595111461209, -0.1256289777627803, 0.11150811195961739, 0.37766083881357, -0.23482604961272477, -0.28098043878440204, 0.11929597024496424, -0.23046632794859379, -0.1379162546930418, 0.1951008149695362, -0.04337102883360594, 0.058346866685161855, 0.006378468421093873, 0.053800928467688594, -0.0720047764954966, -0.20730841039422607, 0.3375738994287339, 0.032179809935194884, 0.27538744563935325, 0.0036273826906261476, 0.08424692741276599, 0.014652133931552893, -0.05126578502179319, 0.012090222845711795, -0.16049665832107216, 0.12769433506611294, 0.20598104598282493, 0.16475346424359535, 0.3500375381799562, -0.3454538909672441, -0.21714867114420294, 0.14919486458070183, 0.1004371026187743, 0.06532038868585675, -0.04618372210260484, -0.26481044386807634, 0.04768956434226742, -0.17333375399864867, -0.1316940569361721, -0.039588210485434455, 0.02813394622276782, 0.04334013023272794, -0.3634627515290815, 0.09861100399345894, 0.10349288614662855, 0.08987392645978712, -0.05304057541376862, -0.1458448328776285, 0.012614108177857767, 0.05712678431576167, 0.11089690784712347, 0.016407427837532993, 0.10791855379628894, -0.1539538021633665, -0.08226925930725165, 0.33391721346216446, -0.058145714335535705, -0.21218067239724883, 0.13672078271874374, -0.11487810691438713, -0.13598962821905794, 0.07134962710283856, 0.13408252840714627, 0.11065438026899325, -0.1390933804030187, 0.06495680270209529, -0.0912577334805208, 0.1552427254102536, 0.032690304154560805, -0.027460805627541912, 0.19165479114867354, 0.15547116859325846, 0.07756449537976694, 0.15101936799520013, -0.11360395465836566, -0.07806626480305567, -0.34036442585209825, -0.1531802325227641, -0.18510426468396632, 0.0591162227976479, -0.10917952873004604, -0.19113227479944103, 0.3550972851348649, 0.15168013765574678, 0.244127856742125, 0.06280220187143545, 0.26782483133291335, 0.14519312702529868, 0.02249594507003693, 0.036155727995240965, 0.23317429241146065, 0.1404949443025735, 0.014388541179390526, -0.12582750541811324, 0.15215787937861597, -0.002845402744194297] |
1,802.00229 | The population of single and binary white dwarfs of the Galactic bulge | Recent Hubble Space Telescope observations have unveiled the white dwarf
cooling sequence of the Galactic bulge. Although the degenerate sequence can be
well fitted employing the most up-to-date theoretical cooling sequences,
observations show a systematic excess of red objects that cannot be explained
by the theoretical models of single carbon-oxygen white dwarfs of the
appropriate masses. Here we present a population synthesis study of the white
dwarf cooling sequence of the Galactic bulge that takes into account the
populations of both single white dwarfs and binary systems containing at least
one white dwarf. These calculations incorporate state-of-the-art cooling
sequences for white dwarfs with hydrogen-rich and hydrogen-deficient
atmospheres, for both white dwarfs with carbon-oxygen and helium cores, and
also take into account detailed prescriptions of the evolutionary history of
binary systems. Our Monte Carlo simulator also incorporates all the known
observational biases. This allows us to model with a high degree of realism the
white dwarf population of the Galactic bulge. We find that the observed excess
of red stars can be partially attributed to white dwarf plus main sequence
binaries, and to cataclysmic variables or dwarf novae. Our best fit is obtained
with a higher binary fraction and an initial mass function slope steeper than
standard values, as well as with the inclusion of differential reddening and
blending. Our results also show that the possible contribution of double
degenerate systems or young and thick-disk bulge stars is negligible.
| astro-ph.GA | recent hubble space telescope observations have unveiled the white dwarf cooling sequence of the galactic bulge although the degenerate sequence can be well fitted employing the most uptodate theoretical cooling sequences observations show a systematic excess of red objects that cannot be explained by the theoretical models of single carbonoxygen white dwarfs of the appropriate masses here we present a population synthesis study of the white dwarf cooling sequence of the galactic bulge that takes into account the populations of both single white dwarfs and binary systems containing at least one white dwarf these calculations incorporate stateoftheart cooling sequences for white dwarfs with hydrogenrich and hydrogendeficient atmospheres for both white dwarfs with carbonoxygen and helium cores and also take into account detailed prescriptions of the evolutionary history of binary systems our monte carlo simulator also incorporates all the known observational biases this allows us to model with a high degree of realism the white dwarf population of the galactic bulge we find that the observed excess of red stars can be partially attributed to white dwarf plus main sequence binaries and to cataclysmic variables or dwarf novae our best fit is obtained with a higher binary fraction and an initial mass function slope steeper than standard values as well as with the inclusion of differential reddening and blending our results also show that the possible contribution of double degenerate systems or young and thickdisk bulge stars is negligible | [['recent', 'hubble', 'space', 'telescope', 'observations', 'have', 'unveiled', 'the', 'white', 'dwarf', 'cooling', 'sequence', 'of', 'the', 'galactic', 'bulge', 'although', 'the', 'degenerate', 'sequence', 'can', 'be', 'well', 'fitted', 'employing', 'the', 'most', 'uptodate', 'theoretical', 'cooling', 'sequences', 'observations', 'show', 'a', 'systematic', 'excess', 'of', 'red', 'objects', 'that', 'can', 'not', 'be', 'explained', 'by', 'the', 'theoretical', 'models', 'of', 'single', 'carbonoxygen', 'white', 'dwarfs', 'of', 'the', 'appropriate', 'masses', 'here', 'we', 'present', 'a', 'population', 'synthesis', 'study', 'of', 'the', 'white', 'dwarf', 'cooling', 'sequence', 'of', 'the', 'galactic', 'bulge', 'that', 'takes', 'into', 'account', 'the', 'populations', 'of', 'both', 'single', 'white', 'dwarfs', 'and', 'binary', 'systems', 'containing', 'at', 'least', 'one', 'white', 'dwarf', 'these', 'calculations', 'incorporate', 'stateoftheart', 'cooling', 'sequences', 'for', 'white', 'dwarfs', 'with', 'hydrogenrich', 'and', 'hydrogendeficient', 'atmospheres', 'for', 'both', 'white', 'dwarfs', 'with', 'carbonoxygen', 'and', 'helium', 'cores', 'and', 'also', 'take', 'into', 'account', 'detailed', 'prescriptions', 'of', 'the', 'evolutionary', 'history', 'of', 'binary', 'systems', 'our', 'monte', 'carlo', 'simulator', 'also', 'incorporates', 'all', 'the', 'known', 'observational', 'biases', 'this', 'allows', 'us', 'to', 'model', 'with', 'a', 'high', 'degree', 'of', 'realism', 'the', 'white', 'dwarf', 'population', 'of', 'the', 'galactic', 'bulge', 'we', 'find', 'that', 'the', 'observed', 'excess', 'of', 'red', 'stars', 'can', 'be', 'partially', 'attributed', 'to', 'white', 'dwarf', 'plus', 'main', 'sequence', 'binaries', 'and', 'to', 'cataclysmic', 'variables', 'or', 'dwarf', 'novae', 'our', 'best', 'fit', 'is', 'obtained', 'with', 'a', 'higher', 'binary', 'fraction', 'and', 'an', 'initial', 'mass', 'function', 'slope', 'steeper', 'than', 'standard', 'values', 'as', 'well', 'as', 'with', 'the', 'inclusion', 'of', 'differential', 'reddening', 'and', 'blending', 'our', 'results', 'also', 'show', 'that', 'the', 'possible', 'contribution', 'of', 'double', 'degenerate', 'systems', 'or', 'young', 'and', 'thickdisk', 'bulge', 'stars', 'is', 'negligible']] | [-0.018200889410486126, 0.1319232643636116, -0.0869293294040385, 0.12938983322103667, -0.12912784770976704, -0.08909148372179794, 0.10976984246368968, 0.378405937433991, -0.16562459964907209, -0.36153791828283643, 0.01515610987480309, -0.31315786107429877, -0.05983369962885103, 0.2171579219720416, -0.11349654820977581, -0.03272807772195105, 0.1503016534222438, -0.08175523350795606, -0.04383043104136815, -0.33075404403902686, 0.3366920888895426, 0.044600629707541174, 0.07446657937184702, -0.1454122601793962, 0.06138684310685847, -0.08814550647473111, -0.06206120662274283, -0.05818041335125493, -0.1395864432004707, -0.030786544711925247, 0.22520028656148208, 0.11714668137656532, 0.2006969769235903, -0.3676358380522501, -0.2952104664590818, 0.09549005686794505, 0.1963962595831899, 0.05028291919880457, -0.12247925944563984, -0.23881988307396845, 0.07718207614660014, -0.21828308459387158, -0.1366695251732784, 0.009423538267020151, 0.011365682467288302, 0.07334309948167947, -0.2542381580767054, 0.1070738607530714, 0.13154959839488142, 0.04593715491038177, -0.15080595860247029, -0.20632868547140618, -0.06747616576293881, 0.10054664436638137, 0.007966748817734202, 0.04547637841414863, 0.13047443837059902, -0.09264349704121227, -0.028434239094102733, 0.38101346870308556, -0.13416690622081553, -0.010983840400201101, 0.2256772313325444, -0.18182873801682845, -0.1530661577374429, 0.10204700735752241, 0.1441305967936269, 0.14137710394166317, -0.20381310193070745, -0.0009848894999522294, 0.01209855582136427, 0.20642279907203742, -0.0008534939451119765, 0.05433058666813511, 0.3704954867297978, 0.1771627131461801, -0.009380654733877426, 0.07320913116624929, -0.22815798763107806, -0.10121977353633176, -0.21842233936017902, -0.0989916347820608, -0.11666600988100373, 0.09906375767361367, -0.1261955072692202, -0.18479164640875104, 0.3079128193700195, 0.09221700311026626, 0.22287020124066387, 0.04968461814087087, 0.3370341230573515, 0.105677057805551, 0.11724043518565908, 0.0941004487574741, 0.2653994691912786, 0.23350295946040975, 0.04694485265535602, -0.24772297834517693, 0.08173063878899355, -0.024175632356327012] |
1,802.0023 | Integrity Coded Databases: An Evaluation of Performance, Efficiency, and
Practicality | In recent years, cloud database storage has become an inexpensive and
convenient option for businesses and individuals to store information. While
its positive aspects make the cloud extremely attractive for data storage, it
is a relatively new area of service, making it vulnerable to cyber-attacks and
security breaches. Storing data in a foreign location also requires the owner
to relinquish control of their information to system administrators of these
online database services. This opens the possibility for malicious, internal
attacks on the data that may involve the manipulation, omission, or addition of
data. The retention of the data as it was intended to be stored is referred to
as the database's integrity. Our research tests a potential solution for
maintaining the integrity of these cloud-storage databases by converting the
original databases to Integrity Coded Databases (ICDB). ICDBs utilize Integrity
Codes: cryptographic codes created alongside the data by a private key that
only the data owner has access to. When the database is queried, an integrity
code is returned along with the queried information. The owner is then able to
verify that the information is correct, complete, and fresh. Consequently,
ICDBs also incur performance and memory penalties. In our research, we explore,
test, and benchmark ICDBs to determine the costs and benefits of maintaining an
ICDB versus a standard database.
| cs.DB cs.CR | in recent years cloud database storage has become an inexpensive and convenient option for businesses and individuals to store information while its positive aspects make the cloud extremely attractive for data storage it is a relatively new area of service making it vulnerable to cyberattacks and security breaches storing data in a foreign location also requires the owner to relinquish control of their information to system administrators of these online database services this opens the possibility for malicious internal attacks on the data that may involve the manipulation omission or addition of data the retention of the data as it was intended to be stored is referred to as the databases integrity our research tests a potential solution for maintaining the integrity of these cloudstorage databases by converting the original databases to integrity coded databases icdb icdbs utilize integrity codes cryptographic codes created alongside the data by a private key that only the data owner has access to when the database is queried an integrity code is returned along with the queried information the owner is then able to verify that the information is correct complete and fresh consequently icdbs also incur performance and memory penalties in our research we explore test and benchmark icdbs to determine the costs and benefits of maintaining an icdb versus a standard database | [['in', 'recent', 'years', 'cloud', 'database', 'storage', 'has', 'become', 'an', 'inexpensive', 'and', 'convenient', 'option', 'for', 'businesses', 'and', 'individuals', 'to', 'store', 'information', 'while', 'its', 'positive', 'aspects', 'make', 'the', 'cloud', 'extremely', 'attractive', 'for', 'data', 'storage', 'it', 'is', 'a', 'relatively', 'new', 'area', 'of', 'service', 'making', 'it', 'vulnerable', 'to', 'cyberattacks', 'and', 'security', 'breaches', 'storing', 'data', 'in', 'a', 'foreign', 'location', 'also', 'requires', 'the', 'owner', 'to', 'relinquish', 'control', 'of', 'their', 'information', 'to', 'system', 'administrators', 'of', 'these', 'online', 'database', 'services', 'this', 'opens', 'the', 'possibility', 'for', 'malicious', 'internal', 'attacks', 'on', 'the', 'data', 'that', 'may', 'involve', 'the', 'manipulation', 'omission', 'or', 'addition', 'of', 'data', 'the', 'retention', 'of', 'the', 'data', 'as', 'it', 'was', 'intended', 'to', 'be', 'stored', 'is', 'referred', 'to', 'as', 'the', 'databases', 'integrity', 'our', 'research', 'tests', 'a', 'potential', 'solution', 'for', 'maintaining', 'the', 'integrity', 'of', 'these', 'cloudstorage', 'databases', 'by', 'converting', 'the', 'original', 'databases', 'to', 'integrity', 'coded', 'databases', 'icdb', 'icdbs', 'utilize', 'integrity', 'codes', 'cryptographic', 'codes', 'created', 'alongside', 'the', 'data', 'by', 'a', 'private', 'key', 'that', 'only', 'the', 'data', 'owner', 'has', 'access', 'to', 'when', 'the', 'database', 'is', 'queried', 'an', 'integrity', 'code', 'is', 'returned', 'along', 'with', 'the', 'queried', 'information', 'the', 'owner', 'is', 'then', 'able', 'to', 'verify', 'that', 'the', 'information', 'is', 'correct', 'complete', 'and', 'fresh', 'consequently', 'icdbs', 'also', 'incur', 'performance', 'and', 'memory', 'penalties', 'in', 'our', 'research', 'we', 'explore', 'test', 'and', 'benchmark', 'icdbs', 'to', 'determine', 'the', 'costs', 'and', 'benefits', 'of', 'maintaining', 'an', 'icdb', 'versus', 'a', 'standard', 'database']] | [-0.13589894581317216, -0.01380776362182385, -0.06229063127884055, 0.07063942809246429, -0.11686425519831202, -0.19315849032891155, 0.13227920836113669, 0.35561927299163976, -0.3130492249604652, -0.345581838322148, 0.17221819153281911, -0.3547530374619075, -0.04398642333722415, 0.18835113388141272, -0.1579432010271207, 0.08399326660583029, 0.0691999867402181, 0.05234504780943367, 0.015505640059321498, -0.33421949741292606, 0.2678237573730897, 0.14023988549726912, 0.318627761630557, 0.07494576371499095, 0.042973173026540384, 0.013306787170155009, -0.05606005178816741, -0.046977049362828475, -0.05375263705055086, 0.16616941607693056, 0.3244641061443232, 0.2635391754318132, 0.3049555764537891, -0.44436587808067324, -0.15641388142291732, 0.07533674419715276, 0.10622458997682703, 0.1237898535931621, -0.09801260216961426, -0.30006388049676186, 0.11364051408815647, -0.2138336028082348, -0.08439799302680141, -0.15480865929782373, 0.05181753865650131, -0.008439256221377204, -0.276712515490578, -0.04119774471365855, -0.004604576481075061, 0.07298423342527477, -0.0408514191388989, -0.04502234269522079, -0.04845869188041737, 0.21933938842226375, 0.04573113349804906, 0.011169723200038317, 0.15148310301581794, -0.14283240829590121, -0.09690362322780183, 0.40936654101608805, 0.01589626394383635, -0.1575664528257524, 0.1466528925117961, -0.011009806363964108, -0.1403849553122806, 0.11633307675246787, 0.213459701768847, 0.03647809971287778, -0.21090831487371933, 0.04142255774247503, -0.01553214603336528, 0.2198938368792706, 0.05754667022631987, 0.07835386164003501, 0.2010504456713399, 0.16800595898826873, 0.05875844188806325, 0.1520939894560595, -0.07822312144709806, -0.0782426215397815, -0.20034837461005534, -0.1716973874394575, -0.19643791977216973, -0.005186915647721401, -0.07611755881717491, -0.14678361076275231, 0.34298823010586027, 0.21732464808964222, 0.1335884291720167, 0.02121269178503469, 0.3944897417806917, -0.0266521202865988, 0.16973825026259334, 0.14145393044573548, 0.15598446167186247, -0.005391253837505819, 0.1715457441195785, -0.14943192648287448, 0.18331084536502776, -0.06638228756923194] |
1,802.00231 | Adapting predominant and novel sense discovery algorithms for
identifying corpus-specific sense differences | Word senses are not static and may have temporal, spatial or corpus-specific
scopes. Identifying such scopes might benefit the existing WSD systems largely.
In this paper, while studying corpus specific word senses, we adapt three
existing predominant and novel-sense discovery algorithms to identify these
corpus-specific senses. We make use of text data available in the form of
millions of digitized books and newspaper archives as two different sources of
corpora and propose automated methods to identify corpus-specific word senses
at various time points. We conduct an extensive and thorough human judgment
experiment to rigorously evaluate and compare the performance of these
approaches. Post adaptation, the output of the three algorithms are in the same
format and the accuracy results are also comparable, with roughly 45-60% of the
reported corpus-specific senses being judged as genuine.
| cs.CL | word senses are not static and may have temporal spatial or corpusspecific scopes identifying such scopes might benefit the existing wsd systems largely in this paper while studying corpus specific word senses we adapt three existing predominant and novelsense discovery algorithms to identify these corpusspecific senses we make use of text data available in the form of millions of digitized books and newspaper archives as two different sources of corpora and propose automated methods to identify corpusspecific word senses at various time points we conduct an extensive and thorough human judgment experiment to rigorously evaluate and compare the performance of these approaches post adaptation the output of the three algorithms are in the same format and the accuracy results are also comparable with roughly 4560 of the reported corpusspecific senses being judged as genuine | [['word', 'senses', 'are', 'not', 'static', 'and', 'may', 'have', 'temporal', 'spatial', 'or', 'corpusspecific', 'scopes', 'identifying', 'such', 'scopes', 'might', 'benefit', 'the', 'existing', 'wsd', 'systems', 'largely', 'in', 'this', 'paper', 'while', 'studying', 'corpus', 'specific', 'word', 'senses', 'we', 'adapt', 'three', 'existing', 'predominant', 'and', 'novelsense', 'discovery', 'algorithms', 'to', 'identify', 'these', 'corpusspecific', 'senses', 'we', 'make', 'use', 'of', 'text', 'data', 'available', 'in', 'the', 'form', 'of', 'millions', 'of', 'digitized', 'books', 'and', 'newspaper', 'archives', 'as', 'two', 'different', 'sources', 'of', 'corpora', 'and', 'propose', 'automated', 'methods', 'to', 'identify', 'corpusspecific', 'word', 'senses', 'at', 'various', 'time', 'points', 'we', 'conduct', 'an', 'extensive', 'and', 'thorough', 'human', 'judgment', 'experiment', 'to', 'rigorously', 'evaluate', 'and', 'compare', 'the', 'performance', 'of', 'these', 'approaches', 'post', 'adaptation', 'the', 'output', 'of', 'the', 'three', 'algorithms', 'are', 'in', 'the', 'same', 'format', 'and', 'the', 'accuracy', 'results', 'are', 'also', 'comparable', 'with', 'roughly', '4560', 'of', 'the', 'reported', 'corpusspecific', 'senses', 'being', 'judged', 'as', 'genuine']] | [-0.07172117972067256, 0.03052800288172246, -0.02102335843894827, 0.09199408775360036, -0.12819368122635702, -0.13758328706166126, 0.05952403697279751, 0.4662735428577079, -0.26107520152376157, -0.3505299962020682, 0.0940642932935835, -0.34556600281660604, -0.10527579722176761, 0.2027804985269554, -0.10029991145798922, 0.05337931781777888, 0.1178058520794489, 0.08892694987178101, -0.05372982065340406, -0.2986252826491469, 0.30864986385870025, 0.015754692935685915, 0.3333277423144843, -0.006197906366227321, 0.08050004972750671, -0.0823661760020917, -0.1310736661767272, -0.019464018288999796, -0.08854475223172203, 0.14187944474799866, 0.33848353716215696, 0.22223315478208006, 0.3131559217467736, -0.39670911575212403, -0.15308406386398396, 0.06145765690511107, 0.1781042608681058, 0.09208833943541281, -0.007265295514738874, -0.34936291580893714, 0.11692121244014654, -0.1544745686022859, 0.002921428370352526, -0.12692227067173759, -0.0057098169607999625, 0.03961462680122612, -0.1918171525712272, 0.03654772925686924, 0.0674194130360296, 0.10806199246527333, -0.05850177946416451, -0.14867742574612672, 0.06084188739716643, 0.23870453744237416, 0.10992680828234083, 0.004383955945617946, 0.11427357698671688, -0.13473226641836755, -0.19929279726964974, 0.37783772260987, -0.055149427391028495, -0.2021725211516583, 0.2540824696897788, -0.07189451208464186, -0.13480812915831916, 0.05948213447949716, 0.20325238991150618, 0.0870053078769181, -0.20069907689677144, -0.028699207367792138, -0.004113814956333516, 0.2059263152891378, 0.10941960654550589, 0.0496307696991327, 0.17745938328710995, 0.1787352915546906, -0.038943415968083685, 0.10974386206099805, -0.09761566878274552, -0.037223007690154464, -0.2104080373463326, -0.1208057998543031, -0.13913011550028018, -0.04945774348196661, -0.07412235538531672, -0.15809219954246514, 0.37622663741791273, 0.24839174047498036, 0.15737992344788254, 0.06987676830941293, 0.30625456998551864, -0.0010772097708755418, 0.07730784688032884, 0.07351881839839139, 0.18641205519241721, -0.033118280415822356, 0.14475272233331843, -0.13063597536638827, 0.09963912414772001, 0.01988344748952615] |
1,802.00232 | Magnetic phase diagrams and magnetization plateaus of the spin-1/2
antiferromagnetic Heisenberg model on square-kagome lattice with three
nonequivalent exchange interactions | Magnetization plateaus in quantum spin systems emerges in two-dimensional
frustrated systems such as kagome lattice. The spin-1/2 antiferromagnetic
Heisenberg model on square-kagome lattice is also appropriate for the study of
magnetization plateau. Motivated by recent experimental finding of such a
square-kagome lattice with nonequivalent three bonds, we investigate the phase
diagrams and magnetization plateaus of the lattice by the exact diagonalization
method. In addition to previously reported the 1/3 and 2/3 plateaus in the
model with two equivalent bonds, we find a new 2/3 plateau whose magnetic
structure is characterized by spontaneously broken four-fold rotational
symmetry. The plateau appears only in the case of three nonequivalent bonds. We
propose the possibility of finding plateaus including the new one.
| cond-mat.str-el | magnetization plateaus in quantum spin systems emerges in twodimensional frustrated systems such as kagome lattice the spin12 antiferromagnetic heisenberg model on squarekagome lattice is also appropriate for the study of magnetization plateau motivated by recent experimental finding of such a squarekagome lattice with nonequivalent three bonds we investigate the phase diagrams and magnetization plateaus of the lattice by the exact diagonalization method in addition to previously reported the 13 and 23 plateaus in the model with two equivalent bonds we find a new 23 plateau whose magnetic structure is characterized by spontaneously broken fourfold rotational symmetry the plateau appears only in the case of three nonequivalent bonds we propose the possibility of finding plateaus including the new one | [['magnetization', 'plateaus', 'in', 'quantum', 'spin', 'systems', 'emerges', 'in', 'twodimensional', 'frustrated', 'systems', 'such', 'as', 'kagome', 'lattice', 'the', 'spin12', 'antiferromagnetic', 'heisenberg', 'model', 'on', 'squarekagome', 'lattice', 'is', 'also', 'appropriate', 'for', 'the', 'study', 'of', 'magnetization', 'plateau', 'motivated', 'by', 'recent', 'experimental', 'finding', 'of', 'such', 'a', 'squarekagome', 'lattice', 'with', 'nonequivalent', 'three', 'bonds', 'we', 'investigate', 'the', 'phase', 'diagrams', 'and', 'magnetization', 'plateaus', 'of', 'the', 'lattice', 'by', 'the', 'exact', 'diagonalization', 'method', 'in', 'addition', 'to', 'previously', 'reported', 'the', '13', 'and', '23', 'plateaus', 'in', 'the', 'model', 'with', 'two', 'equivalent', 'bonds', 'we', 'find', 'a', 'new', '23', 'plateau', 'whose', 'magnetic', 'structure', 'is', 'characterized', 'by', 'spontaneously', 'broken', 'fourfold', 'rotational', 'symmetry', 'the', 'plateau', 'appears', 'only', 'in', 'the', 'case', 'of', 'three', 'nonequivalent', 'bonds', 'we', 'propose', 'the', 'possibility', 'of', 'finding', 'plateaus', 'including', 'the', 'new', 'one']] | [-0.22424272849950624, 0.21450543106075817, 0.004876339401639366, 0.0402316899185357, -0.014227928641110154, -0.19006130125342033, 0.07204417661088913, 0.39614446701134665, -0.2578944616785305, -0.2901432631099281, 0.07655014682233617, -0.2863421784398162, -0.13543707418050302, 0.14166615126502574, 0.06869208579093723, 0.026497287210077047, -0.021794569939059222, -0.027025969553012716, -0.11306521744404177, -0.24546469463789203, 0.26232789806484924, -0.02856535839915307, 0.28587308054063787, 0.02692293659073569, 0.07188667217960139, 0.011572843421471574, 0.10443346999522488, 0.04126344019768097, -0.18169144201644902, 0.06743265866002036, 0.16982033162504057, -0.10648028170137461, 0.13061921019304418, -0.42822084335957544, -0.16743395553301957, 0.06517757892498147, 0.15327965753089826, 0.1950011283703843, -0.021648590623645776, -0.2659600355328945, -0.01494785601873014, -0.14402951097699923, -0.1488310642253363, -0.09011585489115224, -0.022843531940637502, -0.027834869994213647, -0.19345574008973743, 0.1617240551126612, 0.07594908184127219, 0.1409818369547947, -0.08012506911546875, -0.1333329206158928, -0.07817677155105492, 0.04166879223351824, 0.06289496890987444, 0.06655541851019518, 0.03521889487332743, -0.12024820307111841, -0.21852540919533536, 0.41466368936096965, -0.025893401070419004, -0.08066020039367978, 0.12155399419035826, -0.18625040432651355, -0.17827536059164648, 0.13813839535528827, 0.03969317459169838, 0.06383618423360068, -0.13113579687601254, 0.0733442751728235, -0.06045965821150753, 0.13038218234492055, -0.0033477013457124515, 0.019073023997499782, 0.26535991977868695, 0.1753055071142518, 0.04875657401221283, 0.22862729229727538, -0.12258783514587746, -0.1724887182383593, -0.2496666093041205, -0.15380942115414162, -0.2219649296790614, 0.09346354280014411, -0.08396913716939507, -0.17084423823171627, 0.4207889424415968, 0.10200828717038887, 0.21421212320274208, -0.025689062601255284, 0.1659395885574868, 0.08018889159686327, 0.06429756289127014, 0.03533002001556994, 0.22022633287676815, 0.1381710534076743, 0.08048744037968375, -0.2841190914899679, 0.008808989929216835, 0.06266359941169651] |
1,802.00233 | On Polynomial time Constructions of Minimum Height Decision Tree | In this paper we study a polynomial time algorithms that for an input
$A\subseteq {B_m}$ outputs a decision tree for $A$ of minimum depth. This
problem has many applications that include, to name a few, computer vision,
group testing, exact learning from membership queries and game theory.
Arkin et al. and Moshkov gave a polynomial time $(\ln |A|)$- approximation
algorithm (for the depth). The result of Dinur and Steurer for set cover
implies that this problem cannot be approximated with ratio $(1-o(1))\cdot \ln
|A|$, unless P=NP. Moskov the combinatorial measure of extended teaching
dimension of $A$, $ETD(A)$. He showed that $ETD(A)$ is a lower bound for the
depth of the decision tree for $A$ and then gave an {\it exponential time}
$ETD(A)/\log(ETD(A))$-approximation algorithm.
In this paper we further study the $ETD(A)$ measure and a new combinatorial
measure, $DEN(A)$, that we call the density of the set $A$. We show that
$DEN(A)\le ETD(A)+1$. We then give two results. The first result is that the
lower bound $ETD(A)$ of Moshkov for the depth of the decision tree for $A$ is
greater than the bounds that are obtained by the classical technique used in
the literature. The second result is a polynomial time $(\ln 2)
DEN(A)$-approximation (and therefore $(\ln 2) ETD(A)$-approximation) algorithm
for the depth of the decision tree of $A$. We also show that a better
approximation ratio implies P=NP.
We then apply the above results to learning the class of disjunctions of
predicates from membership queries. We show that the $ETD$ of this class is
bounded from above by the degree $d$ of its Hasse diagram. We then show that
Moshkov algorithm can be run in polynomial time and is $(d/\log
d)$-approximation algorithm. This gives optimal algorithms when the degree is
constant. For example, learning axis parallel rays over constant dimension
space.
| cs.DS cs.LG | in this paper we study a polynomial time algorithms that for an input asubseteq b_m outputs a decision tree for a of minimum depth this problem has many applications that include to name a few computer vision group testing exact learning from membership queries and game theory arkin et al and moshkov gave a polynomial time ln a approximation algorithm for the depth the result of dinur and steurer for set cover implies that this problem cannot be approximated with ratio 1o1cdot ln a unless pnp moskov the combinatorial measure of extended teaching dimension of a etda he showed that etda is a lower bound for the depth of the decision tree for a and then gave an it exponential time etdalogetdaapproximation algorithm in this paper we further study the etda measure and a new combinatorial measure dena that we call the density of the set a we show that denale etda1 we then give two results the first result is that the lower bound etda of moshkov for the depth of the decision tree for a is greater than the bounds that are obtained by the classical technique used in the literature the second result is a polynomial time ln 2 denaapproximation and therefore ln 2 etdaapproximation algorithm for the depth of the decision tree of a we also show that a better approximation ratio implies pnp we then apply the above results to learning the class of disjunctions of predicates from membership queries we show that the etd of this class is bounded from above by the degree d of its hasse diagram we then show that moshkov algorithm can be run in polynomial time and is dlog dapproximation algorithm this gives optimal algorithms when the degree is constant for example learning axis parallel rays over constant dimension space | [['in', 'this', 'paper', 'we', 'study', 'a', 'polynomial', 'time', 'algorithms', 'that', 'for', 'an', 'input', 'asubseteq', 'b_m', 'outputs', 'a', 'decision', 'tree', 'for', 'a', 'of', 'minimum', 'depth', 'this', 'problem', 'has', 'many', 'applications', 'that', 'include', 'to', 'name', 'a', 'few', 'computer', 'vision', 'group', 'testing', 'exact', 'learning', 'from', 'membership', 'queries', 'and', 'game', 'theory', 'arkin', 'et', 'al', 'and', 'moshkov', 'gave', 'a', 'polynomial', 'time', 'ln', 'a', 'approximation', 'algorithm', 'for', 'the', 'depth', 'the', 'result', 'of', 'dinur', 'and', 'steurer', 'for', 'set', 'cover', 'implies', 'that', 'this', 'problem', 'can', 'not', 'be', 'approximated', 'with', 'ratio', '1o1cdot', 'ln', 'a', 'unless', 'pnp', 'moskov', 'the', 'combinatorial', 'measure', 'of', 'extended', 'teaching', 'dimension', 'of', 'a', 'etda', 'he', 'showed', 'that', 'etda', 'is', 'a', 'lower', 'bound', 'for', 'the', 'depth', 'of', 'the', 'decision', 'tree', 'for', 'a', 'and', 'then', 'gave', 'an', 'it', 'exponential', 'time', 'etdalogetdaapproximation', 'algorithm', 'in', 'this', 'paper', 'we', 'further', 'study', 'the', 'etda', 'measure', 'and', 'a', 'new', 'combinatorial', 'measure', 'dena', 'that', 'we', 'call', 'the', 'density', 'of', 'the', 'set', 'a', 'we', 'show', 'that', 'denale', 'etda1', 'we', 'then', 'give', 'two', 'results', 'the', 'first', 'result', 'is', 'that', 'the', 'lower', 'bound', 'etda', 'of', 'moshkov', 'for', 'the', 'depth', 'of', 'the', 'decision', 'tree', 'for', 'a', 'is', 'greater', 'than', 'the', 'bounds', 'that', 'are', 'obtained', 'by', 'the', 'classical', 'technique', 'used', 'in', 'the', 'literature', 'the', 'second', 'result', 'is', 'a', 'polynomial', 'time', 'ln', '2', 'denaapproximation', 'and', 'therefore', 'ln', '2', 'etdaapproximation', 'algorithm', 'for', 'the', 'depth', 'of', 'the', 'decision', 'tree', 'of', 'a', 'we', 'also', 'show', 'that', 'a', 'better', 'approximation', 'ratio', 'implies', 'pnp', 'we', 'then', 'apply', 'the', 'above', 'results', 'to', 'learning', 'the', 'class', 'of', 'disjunctions', 'of', 'predicates', 'from', 'membership', 'queries', 'we', 'show', 'that', 'the', 'etd', 'of', 'this', 'class', 'is', 'bounded', 'from', 'above', 'by', 'the', 'degree', 'd', 'of', 'its', 'hasse', 'diagram', 'we', 'then', 'show', 'that', 'moshkov', 'algorithm', 'can', 'be', 'run', 'in', 'polynomial', 'time', 'and', 'is', 'dlog', 'dapproximation', 'algorithm', 'this', 'gives', 'optimal', 'algorithms', 'when', 'the', 'degree', 'is', 'constant', 'for', 'example', 'learning', 'axis', 'parallel', 'rays', 'over', 'constant', 'dimension', 'space']] | [-0.08834431412927553, 0.08189339802664194, -0.10343397158628874, 0.06313555351764179, -0.07095737914637136, -0.1320045231326743, 0.08679979598129067, 0.35937659633836905, -0.2924558196064769, -0.30685253660701417, 0.09650111310286955, -0.2264204113680844, -0.178044710111912, 0.20754576648180026, -0.08387406392745217, 0.04060737333924915, 0.057335997493715866, 0.0689889328953411, -0.04021857034364124, -0.3166634201826084, 0.2898978303316474, 0.02560027266795538, 0.20448765469490088, 0.06231141586464887, 0.10033159247095867, 0.004848888238929972, 0.006659405401410522, 0.05985621339948389, -0.16277634993182763, 0.1058107378415852, 0.25510706986319653, 0.2144935840778813, 0.2831520517420049, -0.34591865862662696, -0.14340764218482005, 0.13837516658819046, 0.13876185118265094, 0.09963235261431914, -0.017803129837072145, -0.23023547899598876, 0.12745064686426297, -0.13687461481968552, -0.09316906562632546, -0.033466305755566625, 0.054942989848604816, -0.015068398747984383, -0.31488715571059916, 0.017327265561218563, 0.11347642668275809, 0.04022438471763059, -0.03697036595129706, -0.12333061250376509, 0.06605057299872037, 0.07157944022453323, -0.025660142246285315, 0.08674277616728122, 0.04277915696828898, -0.11261174491555968, -0.1651683015032944, 0.34048986643217, -0.07171864611941879, -0.15626614898455893, 0.1331231935950769, -0.10126255761965045, -0.1773040219064371, 0.12277912006073562, 0.16766967418838014, 0.14490558037718088, -0.09697453799558729, 0.14660730566627497, -0.13112317566755133, 0.18156840425098733, 0.09323845162107071, -0.020074265434083586, 0.08346986902488053, 0.15209921752340255, 0.12853530592575738, 0.14221848554348535, -0.05770061531683848, -0.0350256774617679, -0.2809948026912198, -0.20441804731820654, -0.1964192741580599, 0.020154779320030368, -0.1457628019635275, -0.1684235235938302, 0.3572481901616137, 0.15003255118681658, 0.2014457303935624, 0.17326332045541631, 0.27598923220341554, 0.13751261250591493, 0.024136109673972464, 0.13418314402469503, 0.1788828141423462, 0.09292714098677496, 0.05468691220201336, -0.179842462954543, 0.10062988219643329, 0.11812754129359561] |
1,802.00234 | Biexciton as a Feshbach resonance and Bose-Einstein condensation of
paraexcitons in Cu$_{2}$O | Paraexcitons, the lowest energy exciton states in Cu$_{2}$O, have been
considered a good system for realizing exciton Bose-Einstein condensation
(BEC). The fact that their BEC has not been attained so far is attributed to a
collision-induced loss, whose nature remains unclear. To understand collisional
properties of cold paraexcitons governing their BEC, we perform here a
microscopic consideration of the s-wave paraexciton-paraexciton scattering. We
show its two-channel character with incoming paraexcitons coupled to a
biexciton, which is a Feshbach resonance producing a paraexciton loss and a
diminution of their background scattering length. The former elucidates the
mechanism of the long-observed paraexciton loss, which turns out to be
inefficient at temperatures near one Kelvin and below, whereas the latter makes
the paraexciton scattering length in strain-induced traps negative under stress
exceeding a critical value. Our rough estimates give this value of order of one
kilobar, hence already moderate stress creates a serious obstacle to attaining
a stable paraexciton BEC. Thus our results indicate that BEC of trapped
paraexcitons might be achieved at a subkelvin temperature, but only under low
stress.
| cond-mat.quant-gas | paraexcitons the lowest energy exciton states in cu_2o have been considered a good system for realizing exciton boseeinstein condensation bec the fact that their bec has not been attained so far is attributed to a collisioninduced loss whose nature remains unclear to understand collisional properties of cold paraexcitons governing their bec we perform here a microscopic consideration of the swave paraexcitonparaexciton scattering we show its twochannel character with incoming paraexcitons coupled to a biexciton which is a feshbach resonance producing a paraexciton loss and a diminution of their background scattering length the former elucidates the mechanism of the longobserved paraexciton loss which turns out to be inefficient at temperatures near one kelvin and below whereas the latter makes the paraexciton scattering length in straininduced traps negative under stress exceeding a critical value our rough estimates give this value of order of one kilobar hence already moderate stress creates a serious obstacle to attaining a stable paraexciton bec thus our results indicate that bec of trapped paraexcitons might be achieved at a subkelvin temperature but only under low stress | [['paraexcitons', 'the', 'lowest', 'energy', 'exciton', 'states', 'in', 'cu_2o', 'have', 'been', 'considered', 'a', 'good', 'system', 'for', 'realizing', 'exciton', 'boseeinstein', 'condensation', 'bec', 'the', 'fact', 'that', 'their', 'bec', 'has', 'not', 'been', 'attained', 'so', 'far', 'is', 'attributed', 'to', 'a', 'collisioninduced', 'loss', 'whose', 'nature', 'remains', 'unclear', 'to', 'understand', 'collisional', 'properties', 'of', 'cold', 'paraexcitons', 'governing', 'their', 'bec', 'we', 'perform', 'here', 'a', 'microscopic', 'consideration', 'of', 'the', 'swave', 'paraexcitonparaexciton', 'scattering', 'we', 'show', 'its', 'twochannel', 'character', 'with', 'incoming', 'paraexcitons', 'coupled', 'to', 'a', 'biexciton', 'which', 'is', 'a', 'feshbach', 'resonance', 'producing', 'a', 'paraexciton', 'loss', 'and', 'a', 'diminution', 'of', 'their', 'background', 'scattering', 'length', 'the', 'former', 'elucidates', 'the', 'mechanism', 'of', 'the', 'longobserved', 'paraexciton', 'loss', 'which', 'turns', 'out', 'to', 'be', 'inefficient', 'at', 'temperatures', 'near', 'one', 'kelvin', 'and', 'below', 'whereas', 'the', 'latter', 'makes', 'the', 'paraexciton', 'scattering', 'length', 'in', 'straininduced', 'traps', 'negative', 'under', 'stress', 'exceeding', 'a', 'critical', 'value', 'our', 'rough', 'estimates', 'give', 'this', 'value', 'of', 'order', 'of', 'one', 'kilobar', 'hence', 'already', 'moderate', 'stress', 'creates', 'a', 'serious', 'obstacle', 'to', 'attaining', 'a', 'stable', 'paraexciton', 'bec', 'thus', 'our', 'results', 'indicate', 'that', 'bec', 'of', 'trapped', 'paraexcitons', 'might', 'be', 'achieved', 'at', 'a', 'subkelvin', 'temperature', 'but', 'only', 'under', 'low', 'stress']] | [-0.15019577416056895, 0.207074265998513, -0.09659627499323423, 0.07159062352796107, -0.03292162148467138, -0.17089368900368837, 0.06550391466126629, 0.3708592030822977, -0.2442691536800174, -0.24209306433939756, 0.02887438999525991, -0.2609831788615173, -0.07037788787750866, 0.1913445986812638, 0.022152043584686577, 0.030718344723771388, 0.0355863156721832, 0.035358300961392655, -0.04851068579327231, -0.22924071806582189, 0.2889185040152039, 0.09263994029077532, 0.2834162022217325, 0.1668051831266811, 0.09194322170382789, -0.03691796509718353, 0.10607027695302597, -0.04194420823808865, -0.14970767048089328, 0.06607165956566777, 0.2520738386877135, -0.029672866277947338, 0.26638659727442165, -0.39881028346082364, -0.24714764660298402, 0.10261610117529264, 0.18218273814272834, 0.18770497682139234, -0.04543256959930824, -0.24262598041572014, 0.04481606391808865, -0.13318384896940022, -0.1494823120883666, -0.07884219119626902, 0.014386901520827616, -0.041437234433198515, -0.2499766729260128, 0.1064911165740341, 0.08537743118358776, 0.04033722242721441, -0.09658089779325317, -0.09499267192288906, -0.02686921967721322, 0.03937911991008811, 0.026022369882742747, 0.02270819633320736, 0.1698323228602848, -0.16640532203944697, -0.03133071794978936, 0.3738237495999783, -0.06741867424716474, -0.11371293133098251, 0.1992558290916019, -0.14533357120076704, -0.014978928808969531, 0.22629085151658562, 0.11088067224673895, 0.09519374257863754, -0.1286225028955166, 0.012558600789899092, -0.042158516039225186, 0.19444343221072236, 0.12119405313701877, 0.09163187243129042, 0.28366736894796224, 0.18651560789757324, 0.029121665032686327, 0.14218707821617665, -0.09063297412252393, -0.10232367837637536, -0.23449030333061024, -0.12223513043930077, -0.20258403896216556, 0.08129560365879032, 0.0012313487745400794, -0.16757824769592844, 0.3191832110804336, 0.14298521081747656, 0.23479925553758882, -0.004992508444543505, 0.2761349831892982, 0.1513387831893686, 0.08673019425028046, 0.04060602598209781, 0.3129641445702873, 0.15499104716119208, 0.08171859615156957, -0.3022053109188247, 0.06061352086941373, -0.01616700009749779] |
1,802.00235 | The fractional Schr\"odinger equation with Hardy-type potentials and
sign-changing nonlinearities | We look for solutions to a fractional Schr\"odinger equation of the following
form $$ (-\Delta)^{\alpha / 2} u + \left( V(x) - \frac{\mu}{|x|^{\alpha}}
\right) u = f(x,u)-K(x)|u|^{q-2}u\hbox{ on }\mathbb{R}^N \setminus \{0\}, $$
where $V$ is bounded and close-to-periodic potential and $-
\frac{\mu}{|x|^{\alpha}}$ is a Hardy-type potential. We assume that $V$ is
positive and $f$ has the subcritical growth but not higher than $|u|^{q-2}u$.
If $\mu$ is positive and small enough we find a ground state solution, i.e. a
critical point of the energy being minimizer on the Nehari manifold. If $\mu$
is negative we show that there is no ground state solutions. We are also
interested in an asymptotic behaviour of solutions as $\mu \to 0^+$ and $K \to
0$.
| math.AP | we look for solutions to a fractional schrodinger equation of the following form deltaalpha 2 u left vx fracmuxalpha right u fxukxuq2uhbox on mathbbrn setminus 0 where v is bounded and closetoperiodic potential and fracmuxalpha is a hardytype potential we assume that v is positive and f has the subcritical growth but not higher than uq2u if mu is positive and small enough we find a ground state solution ie a critical point of the energy being minimizer on the nehari manifold if mu is negative we show that there is no ground state solutions we are also interested in an asymptotic behaviour of solutions as mu to 0 and k to 0 | [['we', 'look', 'for', 'solutions', 'to', 'a', 'fractional', 'schrodinger', 'equation', 'of', 'the', 'following', 'form', 'deltaalpha', '2', 'u', 'left', 'vx', 'fracmuxalpha', 'right', 'u', 'fxukxuq2uhbox', 'on', 'mathbbrn', 'setminus', '0', 'where', 'v', 'is', 'bounded', 'and', 'closetoperiodic', 'potential', 'and', 'fracmuxalpha', 'is', 'a', 'hardytype', 'potential', 'we', 'assume', 'that', 'v', 'is', 'positive', 'and', 'f', 'has', 'the', 'subcritical', 'growth', 'but', 'not', 'higher', 'than', 'uq2u', 'if', 'mu', 'is', 'positive', 'and', 'small', 'enough', 'we', 'find', 'a', 'ground', 'state', 'solution', 'ie', 'a', 'critical', 'point', 'of', 'the', 'energy', 'being', 'minimizer', 'on', 'the', 'nehari', 'manifold', 'if', 'mu', 'is', 'negative', 'we', 'show', 'that', 'there', 'is', 'no', 'ground', 'state', 'solutions', 'we', 'are', 'also', 'interested', 'in', 'an', 'asymptotic', 'behaviour', 'of', 'solutions', 'as', 'mu', 'to', '0', 'and', 'k', 'to', '0']] | [-0.1871458556772201, 0.08962839736441394, -0.03106510650725403, 0.04091722037805535, -0.09026602445888, -0.20995753946278348, 0.031059232420809227, 0.3505526317599648, -0.2824211432983022, -0.15691207957917552, 0.13101528357573436, -0.4001870254618586, -0.10486354302068096, 0.12212502366410347, -0.01369385925279674, 0.02307733143209864, 0.023259268306759655, 0.13113230963263217, -0.0393303067449036, -0.18370573869436432, 0.3758884595328976, -0.12253404194019188, 0.146946734372834, 0.10550258342826038, 0.10421556199755554, -0.09319173902168511, 0.12191514388835399, 0.0013286869272316267, -0.23112075534259896, 0.015433712708635614, 0.19310593382891164, 0.10336955823004246, 0.34975925954315096, -0.35687735796384856, -0.16444749582490517, 0.24447404620143662, 0.14844729334603005, 0.0004179294844832989, -0.05041960669348204, -0.2858146212379867, 0.19244711734610823, -0.08203246088595975, -0.17087743596233632, -0.0733520808680957, 0.15702169431253857, 0.04167323275266318, -0.3557116275935203, 0.08985772976142337, 0.07679813742902505, -0.007894065026022972, -0.14072489618204123, -0.1793402457831923, -0.06258349286375242, 0.07954761435474278, 0.044182316024163996, 0.14195185075428576, 0.02307480420712211, -0.14908421838254488, -0.005049255659479067, 0.3662320775996654, -0.12697123180620412, -0.274740463139814, 0.1400427764085113, -0.22841849507456388, -0.08420327658671031, 0.08414236145572515, 0.09005567082631137, 0.1663978758925965, -0.07248716569855945, 0.23346093169001247, -0.030156770276777243, 0.1852792518690267, 0.07313616478542259, -0.016816609860568762, 0.09093686551872401, 0.10412563298991241, 0.21037288020587092, 0.06612744040513804, -0.052713948425862495, -0.03405786779871501, -0.3512427853676704, -0.15284258986549845, -0.1939986189827323, 0.18500891887105428, -0.05398793118605882, -0.162392182805396, 0.32187914229724385, 0.07879435838362493, 0.21101424012572392, 0.05221008455568771, 0.19056439964493754, 0.18753487952032186, -0.03767995287262655, 0.11916405125093911, 0.1530172434900332, 0.08309270460115865, 0.10016418817034418, -0.18045228120733112, 0.024533744179430085, 0.05731813370828504] |
1,802.00236 | Laser induced breakdown spectroscopy for multielement analysis of powder
materials utilized in additive technologies | Powder materials utilized in additive technologies were quantitatively
analyzed by laser induced breakdown spectroscopy for the first time. Laser
induced breakdown spectroscopy mapping of loose metal powder attached to the
double-sided adhesive tape provided high reproducibility of measurements even
for powder mixtures with large difference of particles densities (tungsten
carbide particles in nickel alloy powder). Laser induced breakdown spectroscopy
analytical capabilities for tungsten and carbon analysis were estimated by
calibration curve construction and accuracy estimation by leave-one-out
cross-validation procedure. Laser induced breakdown spectroscopy and X-ray
fluorescence spectroscopy techniques comparison revealed better results for
laser induced breakdown spectroscopy analysis. Improved accuracy of analysis
and capability to quantify light elements (carbon etc.) demonstrated large
perspectives of laser induced breakdown spectroscopy as a technique for express
on-site multelement analysis of powder materials utilized in additive
technologies.
| physics.app-ph | powder materials utilized in additive technologies were quantitatively analyzed by laser induced breakdown spectroscopy for the first time laser induced breakdown spectroscopy mapping of loose metal powder attached to the doublesided adhesive tape provided high reproducibility of measurements even for powder mixtures with large difference of particles densities tungsten carbide particles in nickel alloy powder laser induced breakdown spectroscopy analytical capabilities for tungsten and carbon analysis were estimated by calibration curve construction and accuracy estimation by leaveoneout crossvalidation procedure laser induced breakdown spectroscopy and xray fluorescence spectroscopy techniques comparison revealed better results for laser induced breakdown spectroscopy analysis improved accuracy of analysis and capability to quantify light elements carbon etc demonstrated large perspectives of laser induced breakdown spectroscopy as a technique for express onsite multelement analysis of powder materials utilized in additive technologies | [['powder', 'materials', 'utilized', 'in', 'additive', 'technologies', 'were', 'quantitatively', 'analyzed', 'by', 'laser', 'induced', 'breakdown', 'spectroscopy', 'for', 'the', 'first', 'time', 'laser', 'induced', 'breakdown', 'spectroscopy', 'mapping', 'of', 'loose', 'metal', 'powder', 'attached', 'to', 'the', 'doublesided', 'adhesive', 'tape', 'provided', 'high', 'reproducibility', 'of', 'measurements', 'even', 'for', 'powder', 'mixtures', 'with', 'large', 'difference', 'of', 'particles', 'densities', 'tungsten', 'carbide', 'particles', 'in', 'nickel', 'alloy', 'powder', 'laser', 'induced', 'breakdown', 'spectroscopy', 'analytical', 'capabilities', 'for', 'tungsten', 'and', 'carbon', 'analysis', 'were', 'estimated', 'by', 'calibration', 'curve', 'construction', 'and', 'accuracy', 'estimation', 'by', 'leaveoneout', 'crossvalidation', 'procedure', 'laser', 'induced', 'breakdown', 'spectroscopy', 'and', 'xray', 'fluorescence', 'spectroscopy', 'techniques', 'comparison', 'revealed', 'better', 'results', 'for', 'laser', 'induced', 'breakdown', 'spectroscopy', 'analysis', 'improved', 'accuracy', 'of', 'analysis', 'and', 'capability', 'to', 'quantify', 'light', 'elements', 'carbon', 'etc', 'demonstrated', 'large', 'perspectives', 'of', 'laser', 'induced', 'breakdown', 'spectroscopy', 'as', 'a', 'technique', 'for', 'express', 'onsite', 'multelement', 'analysis', 'of', 'powder', 'materials', 'utilized', 'in', 'additive', 'technologies']] | [-0.024495743296222026, 0.1652441136115654, -0.07234447402526822, 0.015543507936826878, -0.011708428772787252, -0.191282675225838, 0.1435459387262888, 0.48915891439625714, -0.22031003689732065, -0.3603773845684235, 0.02463983289745749, -0.3471759557388864, -0.07687461469322443, 0.24059663861143318, -0.0084273845140794, 0.11879498489857228, 0.10008686031478371, -0.16885962150285416, -0.0664283940868424, -0.16672268092886292, 0.16969856568329938, 0.11943457979059806, 0.4054588908329606, 0.08264035760227918, 0.10367413122333925, 0.07182061239930618, -0.028750133827667345, 0.03391933732200414, -0.1703395394319104, 0.0835393472992688, 0.2653616296522545, -0.041166718093198586, 0.19311725005338137, -0.45473016052027093, -0.2648306809642236, 0.02245451707153045, 0.09302966509748137, 0.05075942748578999, -0.12378977704440441, -0.2868020695556576, 0.0392503998371081, -0.13075313122438578, -0.1725613908264484, -0.13253862315534867, -0.05851003131829202, 0.06989280961252833, -0.26296869115762866, 0.03384046452552094, 0.006363823092683699, 0.19028217534562855, -0.09343736113585306, -0.10313936238261787, 0.0018683287569067695, 0.036490330592531595, 0.004613089156478192, 0.004123571030725019, 0.25732405257947516, -0.09056328332305631, -0.10760834095686511, 0.3293518598798211, -0.11407311079374542, -0.020240044990328675, 0.14201622672209685, -0.1715222706940646, -0.08318675537311444, 0.23800539278498478, 0.11362182644590961, 0.1268311219102929, -0.19480058341287076, -0.0037048814578376937, 0.08886617508886213, 0.2129059691885204, 0.1836854885191177, 0.06366072482231891, 0.15873303056243016, 0.26865212179836817, -0.05530657789627598, 0.1652320870498167, -0.16714090050311026, 0.06690116396533664, -0.17931255837902427, -0.14662328382771442, -0.1933847377535351, 0.06897035869416979, -0.07176891832469581, -0.15414444680297465, 0.286210365357075, 0.06846637167318752, 0.052158026211669276, -0.10902175390528458, 0.340364632618289, 0.04104202646924408, 0.062326307630759074, -0.10541746852157469, 0.22366628955051332, 0.24618643224697956, 0.09704828453532448, -0.2858038137342329, 0.09480778854622533, 0.029194403490912395] |
1,802.00237 | Face Aging with Contextual Generative Adversarial Nets | Face aging, which renders aging faces for an input face, has attracted
extensive attention in the multimedia research. Recently, several conditional
Generative Adversarial Nets (GANs) based methods have achieved great success.
They can generate images fitting the real face distributions conditioned on
each individual age group. However, these methods fail to capture the
transition patterns, e.g., the gradual shape and texture changes between
adjacent age groups. In this paper, we propose a novel Contextual Generative
Adversarial Nets (C-GANs) to specifically take it into consideration. The
C-GANs consists of a conditional transformation network and two discriminative
networks. The conditional transformation network imitates the aging procedure
with several specially designed residual blocks. The age discriminative network
guides the synthesized face to fit the real conditional distribution. The
transition pattern discriminative network is novel, aiming to distinguish the
real transition patterns with the fake ones. It serves as an extra
regularization term for the conditional transformation network, ensuring the
generated image pairs to fit the corresponding real transition pattern
distribution. Experimental results demonstrate the proposed framework produces
appealing results by comparing with the state-of-the-art and ground truth. We
also observe performance gain for cross-age face verification.
| cs.CV | face aging which renders aging faces for an input face has attracted extensive attention in the multimedia research recently several conditional generative adversarial nets gans based methods have achieved great success they can generate images fitting the real face distributions conditioned on each individual age group however these methods fail to capture the transition patterns eg the gradual shape and texture changes between adjacent age groups in this paper we propose a novel contextual generative adversarial nets cgans to specifically take it into consideration the cgans consists of a conditional transformation network and two discriminative networks the conditional transformation network imitates the aging procedure with several specially designed residual blocks the age discriminative network guides the synthesized face to fit the real conditional distribution the transition pattern discriminative network is novel aiming to distinguish the real transition patterns with the fake ones it serves as an extra regularization term for the conditional transformation network ensuring the generated image pairs to fit the corresponding real transition pattern distribution experimental results demonstrate the proposed framework produces appealing results by comparing with the stateoftheart and ground truth we also observe performance gain for crossage face verification | [['face', 'aging', 'which', 'renders', 'aging', 'faces', 'for', 'an', 'input', 'face', 'has', 'attracted', 'extensive', 'attention', 'in', 'the', 'multimedia', 'research', 'recently', 'several', 'conditional', 'generative', 'adversarial', 'nets', 'gans', 'based', 'methods', 'have', 'achieved', 'great', 'success', 'they', 'can', 'generate', 'images', 'fitting', 'the', 'real', 'face', 'distributions', 'conditioned', 'on', 'each', 'individual', 'age', 'group', 'however', 'these', 'methods', 'fail', 'to', 'capture', 'the', 'transition', 'patterns', 'eg', 'the', 'gradual', 'shape', 'and', 'texture', 'changes', 'between', 'adjacent', 'age', 'groups', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'contextual', 'generative', 'adversarial', 'nets', 'cgans', 'to', 'specifically', 'take', 'it', 'into', 'consideration', 'the', 'cgans', 'consists', 'of', 'a', 'conditional', 'transformation', 'network', 'and', 'two', 'discriminative', 'networks', 'the', 'conditional', 'transformation', 'network', 'imitates', 'the', 'aging', 'procedure', 'with', 'several', 'specially', 'designed', 'residual', 'blocks', 'the', 'age', 'discriminative', 'network', 'guides', 'the', 'synthesized', 'face', 'to', 'fit', 'the', 'real', 'conditional', 'distribution', 'the', 'transition', 'pattern', 'discriminative', 'network', 'is', 'novel', 'aiming', 'to', 'distinguish', 'the', 'real', 'transition', 'patterns', 'with', 'the', 'fake', 'ones', 'it', 'serves', 'as', 'an', 'extra', 'regularization', 'term', 'for', 'the', 'conditional', 'transformation', 'network', 'ensuring', 'the', 'generated', 'image', 'pairs', 'to', 'fit', 'the', 'corresponding', 'real', 'transition', 'pattern', 'distribution', 'experimental', 'results', 'demonstrate', 'the', 'proposed', 'framework', 'produces', 'appealing', 'results', 'by', 'comparing', 'with', 'the', 'stateoftheart', 'and', 'ground', 'truth', 'we', 'also', 'observe', 'performance', 'gain', 'for', 'crossage', 'face', 'verification']] | [-0.02148283234739512, 0.011098248977726807, -0.07837066506735324, 0.09758701535916545, -0.10182635652364613, -0.18977636056879796, -0.008090777537988142, 0.4832553694439676, -0.26807725600357807, -0.3195851968572393, 0.04388699219791325, -0.29328996289284404, -0.22148030234857854, 0.11323866869173364, -0.14811350379158486, 0.11130847307006525, 0.09205336020921642, 0.04622169372377136, -0.07344219245353154, -0.2766809118555743, 0.31729939416258407, 0.011609258735793706, 0.4134191627339146, -0.016647481828821833, 0.14614764541638484, -0.016869031251745947, -0.009038701844088, -0.02092401023020418, -0.04509173382865024, 0.1621811288120385, 0.25850597846712625, 0.21300005350609363, 0.29235400674005707, -0.4385907033873346, -0.2463517726382115, 0.1305470716255268, 0.10866746876092924, 0.10818340637844172, -0.07581974387740707, -0.38608967529493987, 0.0810163894926386, -0.16915424683715163, 0.021341799044199868, -0.13417968730450672, -0.03287496223715206, -0.033866563046754006, -0.3207167539494643, 0.004346817408567277, 0.08580140470420951, 0.07452144082925172, -0.04333356937388721, -0.1103078885981994, -0.01693547269754073, 0.20470217695469375, 0.046229601016152325, 0.03748014972453522, 0.14153904702581968, -0.16252000299264277, -0.11892204457795044, 0.346991999735911, -0.023516692505869533, -0.179613115218012, 0.17194596409117271, -0.051924726924583935, -0.12846801677052838, 0.13412498051923136, 0.20523520908921647, 0.07966269948519766, -0.15340756007754897, -0.02376102527013589, -0.03452203937967843, 0.1503002059723159, 0.034992783703151224, -0.009753419414169875, 0.21486707209667355, 0.2208049834942339, 0.011517913692686321, 0.17949506932618628, -0.14980113542870344, -0.09518023773091676, -0.20584472923640915, -0.08449896069821404, -0.19436298192592116, -0.03069512717367917, -0.12375122059953647, -0.16583468062487078, 0.43299637190572954, 0.19706342964664758, 0.2647042549984322, 0.11728023170249856, 0.3176699813088605, 0.048991507237144974, 0.12637819646293094, 0.025011237010412846, 0.15559072556080286, 0.04584912400526221, 0.10394496500366633, -0.1574878541226716, 0.16329458026683508, 0.05439911584171993] |
1,802.00238 | Orthogonally additive polynomials on the algebras of approximable
operators | Let $X$ and $Y$ be Banach spaces, let $\mathcal{A}(X)$ stands for the algebra
of approximable operators on $X$, and let $P\colon\mathcal{A}(X)\to Y$ be an
orthogonally additive, continuous $n$-homogeneous polynomial. If $X^*$ has the
bounded approximation property, then we show that there exists a unique
continuous linear map $\Phi\colon\mathcal{A}(X)\to Y$ such that
$P(T)=\Phi(T^n)$ for each $T\in\mathcal{A}(X)$.
| math.FA | let x and y be banach spaces let mathcalax stands for the algebra of approximable operators on x and let pcolonmathcalaxto y be an orthogonally additive continuous nhomogeneous polynomial if x has the bounded approximation property then we show that there exists a unique continuous linear map phicolonmathcalaxto y such that ptphitn for each tinmathcalax | [['let', 'x', 'and', 'y', 'be', 'banach', 'spaces', 'let', 'mathcalax', 'stands', 'for', 'the', 'algebra', 'of', 'approximable', 'operators', 'on', 'x', 'and', 'let', 'pcolonmathcalaxto', 'y', 'be', 'an', 'orthogonally', 'additive', 'continuous', 'nhomogeneous', 'polynomial', 'if', 'x', 'has', 'the', 'bounded', 'approximation', 'property', 'then', 'we', 'show', 'that', 'there', 'exists', 'a', 'unique', 'continuous', 'linear', 'map', 'phicolonmathcalaxto', 'y', 'such', 'that', 'ptphitn', 'for', 'each', 'tinmathcalax']] | [-0.15731696735190995, 0.1225523544665467, -0.08141137854944841, -0.019068353973767337, -0.05025157011479285, -0.22490009069260136, 0.0012569623615811853, 0.4323912023329267, -0.44913087288538617, -0.038425845273213424, 0.07518974213984192, -0.3195125394884278, -0.10000132116507374, 0.17198631870469042, -0.14198657513285676, -0.042811839412167374, 0.011097343620278087, 0.10578854139163799, -0.15496565146809993, -0.2649025749780384, 0.3579002656042576, -0.15465610905313024, 0.13581109092589103, 0.00924099349946368, 0.25435031672903136, 0.05470302947522963, 0.04839885727885891, 0.04459796798890274, -0.14746063439473373, 0.055496548192904276, 0.3632767948678092, 0.12345706816653118, 0.3258579410612583, -0.306078047327259, -0.15549029302144168, 0.3466367119302352, 0.1359719301930026, -0.22188598299216405, -0.03584904259518154, -0.27988266252784755, 0.17676662538638888, -0.08667740992763463, -0.09231746624059536, -0.14337581796936838, 0.16104402407711627, 0.041720301551999996, -0.41004562713936266, -0.08201427908395142, 0.13598470871939378, 0.0643416567723833, -0.04203147201013623, -0.14668314889365552, -0.15927799579267407, 0.04587841399160086, -0.09629991592145433, 0.24841486271607743, 0.025940653667146086, 0.05560041739441016, -0.10536806406133681, 0.3474684847774459, -0.14193497300513236, -0.31046688618759316, 0.08680944054332726, -0.2604364626767004, -0.14583130803087033, 0.07457104759911697, 0.10091375720267202, 0.13043195261236498, -0.010023125898156899, 0.35230399514594135, -0.19472786292945052, 0.17327138701198147, 0.051397812534488885, 0.025870176899593835, 0.10944548453770432, 0.06545669172762655, 0.1905215625130736, 0.0705359864423015, 0.048639781220688245, 0.06653109818865892, -0.36213571393825844, -0.1422256283169868, -0.1432212350944824, 0.2116639576487097, -0.12582597483403743, -0.18841697635384752, 0.27408781600202997, 0.03152790927218602, 0.19169653345849, 0.09573707386266951, 0.1700476163372799, 0.1358188098369568, -0.06276404236753781, 0.10666884920176338, 0.016289639925839854, 0.2228689993841245, -0.046448118391209374, -0.054859040752418486, 0.0713840938063667, 0.18461626831199016] |
1,802.00239 | Orthogonally additive polynomials on convolution algebras associated
with a compact group | Let $G$ be a compact group, let $X$ be a Banach space, and let $P\colon
L^1(G)\to X$ be an orthogonally additive, continuous $n$-homogeneous
polynomial. Then we show that there exists a unique continuous linear map
$\Phi\colon L^1(G)\to X$ such that $P(f)=\Phi
\bigl(f\ast\stackrel{n}{\cdots}\ast f \bigr)$ for each $f\in L^1(G)$. We also
seek analogues of this result about $L^1(G)$ for various other convolution
algebras, including $L^p(G)$, for $1< p\le\infty$, and $C(G)$.
| math.FA | let g be a compact group let x be a banach space and let pcolon l1gto x be an orthogonally additive continuous nhomogeneous polynomial then we show that there exists a unique continuous linear map phicolon l1gto x such that pfphi biglfaststackrelncdotsast f bigr for each fin l1g we also seek analogues of this result about l1g for various other convolution algebras including lpg for 1 pleinfty and cg | [['let', 'g', 'be', 'a', 'compact', 'group', 'let', 'x', 'be', 'a', 'banach', 'space', 'and', 'let', 'pcolon', 'l1gto', 'x', 'be', 'an', 'orthogonally', 'additive', 'continuous', 'nhomogeneous', 'polynomial', 'then', 'we', 'show', 'that', 'there', 'exists', 'a', 'unique', 'continuous', 'linear', 'map', 'phicolon', 'l1gto', 'x', 'such', 'that', 'pfphi', 'biglfaststackrelncdotsast', 'f', 'bigr', 'for', 'each', 'fin', 'l1g', 'we', 'also', 'seek', 'analogues', 'of', 'this', 'result', 'about', 'l1g', 'for', 'various', 'other', 'convolution', 'algebras', 'including', 'lpg', 'for', '1', 'pleinfty', 'and', 'cg']] | [-0.14077171579419606, 0.0982370070610848, -0.08166292136901933, -0.006588736092177869, -0.09186402797896528, -0.1986945718032957, -0.03739888681042375, 0.46562593684277753, -0.42156310684301634, -0.06646383455672274, 0.10904144577480937, -0.2684269547885792, -0.13743842872932102, 0.23241310995636563, -0.13615834998728876, -0.05450898038477383, 0.02009279779017423, 0.1093847162344239, -0.11985093131520305, -0.22981643767244267, 0.32929575132826966, -0.14731818536000157, 0.10532746337015521, -0.01691569069005323, 0.15996883566152642, 0.004840205409422968, 0.054532105667573036, 0.010128540780208299, -0.20979374835631903, 0.06342868964103135, 0.35221643030826905, 0.1216676529835571, 0.3058895872567188, -0.31679010887940723, -0.17183048436135956, 0.3295146861663935, 0.11004706323640703, -0.18800073174872634, -0.06582777357349794, -0.29491269950416277, 0.1723216443012158, -0.16658738549008514, -0.08598704514742801, -0.11766584985183948, 0.1677393393421715, 0.03453387751836668, -0.40426371280442586, -0.054012470797963695, 0.13437790549924652, 0.06740590266064939, -0.05057513978416947, -0.156574456620905, -0.11029877078500717, 0.06392425975310757, -0.13514530963518404, 0.23302220035111532, 0.06897587088557582, 0.024392108478809172, -0.09229965282208992, 0.3575264745476571, -0.14023071485148234, -0.25376800422302703, 0.12672640220967657, -0.2204955846184131, -0.19420528994294617, 0.07623141884070003, 0.09043896212383654, 0.14696198061927024, -0.028361839863161247, 0.26752519325854146, -0.17192217632845946, 0.15477904793100827, 0.06845290201123465, 0.024302523674894914, 0.08598373822910203, 0.047189439085989514, 0.17907986897184994, 0.09072823178245347, 0.06733240757250425, 0.13805650254344623, -0.3571995843314763, -0.2203853104517541, -0.12928538449517818, 0.2158156062448115, -0.12931111523357686, -0.14135997798858266, 0.2965031476959473, 0.05125342370504796, 0.16216837383355154, 0.1177532127493936, 0.146949793074534, 0.08281562505219357, -0.020017137221822686, 0.11045101308969385, -0.00778788137672977, 0.20643179585000104, -0.0850571036113031, -0.09291511855201062, -0.03712925431318581, 0.1632535597873908] |
1,802.0024 | Affine factorable surfaces in isotropic spaces | In this paper, we study the problem of finding the affine factorable surfaces
in a 3-dimensional isotropic space with prescribed Gaussian (K) and mean (H)
curvature. Because the absolute figure two different types of these surfaces
appear by permutation of coordinates. We firstly classify the affine factorable
surfaces of type 1 with K,H constants. Afterwards, we provide the affine
factorable surfaces of type 2 with K=const. and H=0. In addition, in a
particular case, the affine factorable surfaces of type 2 with H=const. were
obtained.
| math.DG | in this paper we study the problem of finding the affine factorable surfaces in a 3dimensional isotropic space with prescribed gaussian k and mean h curvature because the absolute figure two different types of these surfaces appear by permutation of coordinates we firstly classify the affine factorable surfaces of type 1 with kh constants afterwards we provide the affine factorable surfaces of type 2 with kconst and h0 in addition in a particular case the affine factorable surfaces of type 2 with hconst were obtained | [['in', 'this', 'paper', 'we', 'study', 'the', 'problem', 'of', 'finding', 'the', 'affine', 'factorable', 'surfaces', 'in', 'a', '3dimensional', 'isotropic', 'space', 'with', 'prescribed', 'gaussian', 'k', 'and', 'mean', 'h', 'curvature', 'because', 'the', 'absolute', 'figure', 'two', 'different', 'types', 'of', 'these', 'surfaces', 'appear', 'by', 'permutation', 'of', 'coordinates', 'we', 'firstly', 'classify', 'the', 'affine', 'factorable', 'surfaces', 'of', 'type', '1', 'with', 'kh', 'constants', 'afterwards', 'we', 'provide', 'the', 'affine', 'factorable', 'surfaces', 'of', 'type', '2', 'with', 'kconst', 'and', 'h0', 'in', 'addition', 'in', 'a', 'particular', 'case', 'the', 'affine', 'factorable', 'surfaces', 'of', 'type', '2', 'with', 'hconst', 'were', 'obtained']] | [-0.12918579266132676, 0.12678895716500632, -0.01082938667934607, 0.006084192975643365, -0.04454016572631457, -0.18580400426598156, -0.010264076641760767, 0.40339161473162033, -0.3076205596766051, -0.24817205400151365, 0.10190140435143429, -0.23597021349431838, -0.15756107204977204, 0.1733137992101119, -0.10296950313974829, 0.018791851357502096, 0.0010218336329083232, 0.053124288039843495, -0.1489323882618919, -0.30846125264378155, 0.43134481977013983, -0.0635824435226181, 0.22292232587933541, -0.016091037964831818, 0.08222088406191153, 0.019731421798796337, -0.051609791749540494, 0.03615522737964057, -0.21760729304514825, 0.17796831545556951, 0.2387603469686035, 0.014604893655461424, 0.1665664664524443, -0.3478593973990749, -0.1950373272466309, 0.1815454214811325, 0.11756347214036128, 0.05012832854819648, -0.019710669776096063, -0.2353635043864522, 0.06270114868221914, -0.07230458340662367, -0.18367842213962884, 0.002554030146668939, 0.008286618704304976, 0.06003436576848959, -0.2075517894809737, 0.056526999720646176, 0.11925949548535487, 0.11647965604548945, -0.10098267762976534, -0.14105528483495994, -0.03847699440906153, 0.05513711716322338, -0.014462279265417773, 0.02427945143324049, 0.04953244764029103, -0.0842497916700428, -0.11211335941436974, 0.3623843836433747, -0.0765022808466764, -0.25834382564267694, 0.13614102701711303, -0.1619124743156135, -0.11111335414187873, 0.15415997515665367, 0.16582287471220994, 0.12971721918267362, -0.06978199586053105, 0.13646968855002128, -0.03026605749721913, 0.05094543224310174, 0.10845759612891603, -0.01990481112152338, 0.11448496237725896, 0.06007000332807794, 0.04156672136091134, 0.14752518222393357, -0.10439302892533733, 0.00019417650011532446, -0.3945343967746286, -0.24561157033723943, -0.10233723838430117, 0.09554850279408343, -0.10069132224786753, -0.18090183178291602, 0.37698398477343076, 0.0038091779960428966, 0.19619053955025534, 0.07718812347499325, 0.17352752548039835, 0.04628949197118773, 0.013412636847180479, 0.08015563425553196, 0.19949908422251397, 0.13098367984571002, -0.016592328617458834, -0.15374450887389043, -0.024473101799787185, 0.12162797213258113] |
1,802.00241 | Anticorrelated emission of high-harmonics and fast electron beams from
plasma mirrors | We report for the first time on the anticorrelated emission of high-order
harmonics and energetic electron beams from a solid-density plasma with a sharp
vacuum interface$-$plasma mirror$-$driven by an intense ultrashort laser pulse.
We highlight the key role played by the nanoscale structure of the plasma
surface during the interaction by measuring the spatial and spectral properties
of harmonics and electron beams emitted by a plasma mirror. We show that the
nanoscale behavior of the plasma mirror can be controlled by tuning the scale
length of the electronic density gradient, which is measured in-situ using
spatial-domain interferometry.
| physics.plasm-ph | we report for the first time on the anticorrelated emission of highorder harmonics and energetic electron beams from a soliddensity plasma with a sharp vacuum interfaceplasma mirrordriven by an intense ultrashort laser pulse we highlight the key role played by the nanoscale structure of the plasma surface during the interaction by measuring the spatial and spectral properties of harmonics and electron beams emitted by a plasma mirror we show that the nanoscale behavior of the plasma mirror can be controlled by tuning the scale length of the electronic density gradient which is measured insitu using spatialdomain interferometry | [['we', 'report', 'for', 'the', 'first', 'time', 'on', 'the', 'anticorrelated', 'emission', 'of', 'highorder', 'harmonics', 'and', 'energetic', 'electron', 'beams', 'from', 'a', 'soliddensity', 'plasma', 'with', 'a', 'sharp', 'vacuum', 'interfaceplasma', 'mirrordriven', 'by', 'an', 'intense', 'ultrashort', 'laser', 'pulse', 'we', 'highlight', 'the', 'key', 'role', 'played', 'by', 'the', 'nanoscale', 'structure', 'of', 'the', 'plasma', 'surface', 'during', 'the', 'interaction', 'by', 'measuring', 'the', 'spatial', 'and', 'spectral', 'properties', 'of', 'harmonics', 'and', 'electron', 'beams', 'emitted', 'by', 'a', 'plasma', 'mirror', 'we', 'show', 'that', 'the', 'nanoscale', 'behavior', 'of', 'the', 'plasma', 'mirror', 'can', 'be', 'controlled', 'by', 'tuning', 'the', 'scale', 'length', 'of', 'the', 'electronic', 'density', 'gradient', 'which', 'is', 'measured', 'insitu', 'using', 'spatialdomain', 'interferometry']] | [-0.11786748890666977, 0.27710566527200986, -0.10715938585957414, 0.033072295745430316, 0.027408950285691965, -0.09110370275172355, -0.03674109157566961, 0.4498976480411856, -0.2477595878764987, -0.3219609349769981, 0.03533930888791618, -0.24580293484277238, -0.06375906289015945, 0.22723538001116952, 0.029252296362660433, 0.06175400060172634, 0.036159404521631106, -0.08798032435833623, -0.019450286077335475, -0.088292377125962, 0.32168381343056496, 0.15331901691633423, 0.27500295315526035, 0.0987521041699342, 0.13159382216338264, 0.013899709651932905, -0.004352134971046134, -0.02157867788092086, -0.08319154436628053, 0.11219568898607242, 0.17551483043628793, 0.0033037291582379688, 0.24371949408056312, -0.5141822204974137, -0.25563129124868855, 0.008629123773578995, 0.13671906304202583, 0.08551763635692432, -0.12586840245701175, -0.2718419959964721, -0.007938043126150181, -0.09802552732810574, -0.15695218179669035, -0.02947500482397644, -0.011483029903549897, 0.11099608269716171, -0.2584992519414395, 0.05921421680893553, 0.039462470708071795, 0.06017480141140128, -0.020301930236287024, -0.02563617224314887, -0.029379058322611902, 0.0467442000333808, 0.03687981073744595, 0.04137624209183023, 0.2037482705555464, -0.14825021970134816, -0.06963262460929782, 0.36144686976545737, -0.10546624744801145, -0.07059360211224933, 0.11188231247330183, -0.23071946909062957, -0.02911506236873959, 0.18860654770151564, 0.14267136087199966, 0.1464576949414454, -0.10695673421478684, -0.00982398478694162, 0.014916787496277768, 0.22039231724154792, 0.15030719026138908, 0.08072819180884644, 0.2575656279823498, 0.17467616733629257, 0.019420905048517803, 0.15536555577020503, -0.16519018421684833, 0.026254895621126418, -0.27273697640354694, -0.12122736000701001, -0.20791332235461787, 0.024541621407690017, -0.0740777472813773, -0.09262541263413272, 0.47859841640058315, 0.10343436268893512, 0.14616267118406923, -0.10613929283143463, 0.3059111051653561, 0.13392287490791396, 0.021633750301981836, 0.028526924829930068, 0.2852418147419628, 0.16739112230777545, 0.1123558146732026, -0.3361964236871388, 0.035535236403934266, 0.052203779704378624] |
1,802.00242 | The Strong Gravitationally Lensed Herschel Galaxy HLock01: Optical
Spectroscopy Reveals a Close Galaxy Merger with Evidence of Inflowing Gas | The submillimeter galaxy (SMG) HERMES J105751.1+573027 (hereafter HLock01) at
z = 2.9574 +/- 0.0001 is one of the brightest gravitationally lensed sources
discovered in the Herschel Multi-tiered Extragalactic Survey. Apart from the
high flux densities in the far-infrared, it is also extremely bright in the
rest-frame ultraviolet (UV), with a total apparent magnitude m_UV = 19.7 mag.
We report here deep spectroscopic observations with the Gran Telescopio
Canarias of the optically bright lensed images of HLock01. Our results suggest
that HLock01 is a merger system composed of the Herschel-selected SMG and an
optically bright Lyman break-like galaxy (LBG), separated by only 3.3 kpc in
projection. While the SMG appears very massive (M* = 5x10^11 Msun), with a
highly extinguished stellar component (A_V = 4.3), the LBG is a young,
lower-mass (M* = 1x10^10 Msun), but still luminous (10xL*_UV) satellite galaxy.
Detailed analysis of the high signal-to-noise (S/N) rest-frame UV spectrum of
the LBG shows complex kinematics of the gas, exhibiting both blueshifted and
redshifted absorption components. While the blueshifted component is associated
with strong galactic outflows from the massive stars in the LBG, as is common
in most star-forming galaxies, the redshifted component may be associated with
gas inflow seen along a favorable sightline to the LBG. We also find evidence
of an extended gas reservoir around HLock01 at an impact parameter of 110 kpc,
through the detection of C II 1334$\AA$ absorption in the red wing of a bright
Ly-alpha emitter at z = 3.327. The data presented here highlight the power of
gravitational lensing in high S/N studies to probe deeply into the physics of
high-z star forming galaxies.
| astro-ph.GA | the submillimeter galaxy smg hermes j1057511573027 hereafter hlock01 at z 29574 00001 is one of the brightest gravitationally lensed sources discovered in the herschel multitiered extragalactic survey apart from the high flux densities in the farinfrared it is also extremely bright in the restframe ultraviolet uv with a total apparent magnitude m_uv 197 mag we report here deep spectroscopic observations with the gran telescopio canarias of the optically bright lensed images of hlock01 our results suggest that hlock01 is a merger system composed of the herschelselected smg and an optically bright lyman breaklike galaxy lbg separated by only 33 kpc in projection while the smg appears very massive m 5x1011 msun with a highly extinguished stellar component a_v 43 the lbg is a young lowermass m 1x1010 msun but still luminous 10xl_uv satellite galaxy detailed analysis of the high signaltonoise sn restframe uv spectrum of the lbg shows complex kinematics of the gas exhibiting both blueshifted and redshifted absorption components while the blueshifted component is associated with strong galactic outflows from the massive stars in the lbg as is common in most starforming galaxies the redshifted component may be associated with gas inflow seen along a favorable sightline to the lbg we also find evidence of an extended gas reservoir around hlock01 at an impact parameter of 110 kpc through the detection of c ii 1334aa absorption in the red wing of a bright lyalpha emitter at z 3327 the data presented here highlight the power of gravitational lensing in high sn studies to probe deeply into the physics of highz star forming galaxies | [['the', 'submillimeter', 'galaxy', 'smg', 'hermes', 'j1057511573027', 'hereafter', 'hlock01', 'at', 'z', '29574', '00001', 'is', 'one', 'of', 'the', 'brightest', 'gravitationally', 'lensed', 'sources', 'discovered', 'in', 'the', 'herschel', 'multitiered', 'extragalactic', 'survey', 'apart', 'from', 'the', 'high', 'flux', 'densities', 'in', 'the', 'farinfrared', 'it', 'is', 'also', 'extremely', 'bright', 'in', 'the', 'restframe', 'ultraviolet', 'uv', 'with', 'a', 'total', 'apparent', 'magnitude', 'm_uv', '197', 'mag', 'we', 'report', 'here', 'deep', 'spectroscopic', 'observations', 'with', 'the', 'gran', 'telescopio', 'canarias', 'of', 'the', 'optically', 'bright', 'lensed', 'images', 'of', 'hlock01', 'our', 'results', 'suggest', 'that', 'hlock01', 'is', 'a', 'merger', 'system', 'composed', 'of', 'the', 'herschelselected', 'smg', 'and', 'an', 'optically', 'bright', 'lyman', 'breaklike', 'galaxy', 'lbg', 'separated', 'by', 'only', '33', 'kpc', 'in', 'projection', 'while', 'the', 'smg', 'appears', 'very', 'massive', 'm', '5x1011', 'msun', 'with', 'a', 'highly', 'extinguished', 'stellar', 'component', 'a_v', '43', 'the', 'lbg', 'is', 'a', 'young', 'lowermass', 'm', '1x1010', 'msun', 'but', 'still', 'luminous', '10xl_uv', 'satellite', 'galaxy', 'detailed', 'analysis', 'of', 'the', 'high', 'signaltonoise', 'sn', 'restframe', 'uv', 'spectrum', 'of', 'the', 'lbg', 'shows', 'complex', 'kinematics', 'of', 'the', 'gas', 'exhibiting', 'both', 'blueshifted', 'and', 'redshifted', 'absorption', 'components', 'while', 'the', 'blueshifted', 'component', 'is', 'associated', 'with', 'strong', 'galactic', 'outflows', 'from', 'the', 'massive', 'stars', 'in', 'the', 'lbg', 'as', 'is', 'common', 'in', 'most', 'starforming', 'galaxies', 'the', 'redshifted', 'component', 'may', 'be', 'associated', 'with', 'gas', 'inflow', 'seen', 'along', 'a', 'favorable', 'sightline', 'to', 'the', 'lbg', 'we', 'also', 'find', 'evidence', 'of', 'an', 'extended', 'gas', 'reservoir', 'around', 'hlock01', 'at', 'an', 'impact', 'parameter', 'of', '110', 'kpc', 'through', 'the', 'detection', 'of', 'c', 'ii', '1334aa', 'absorption', 'in', 'the', 'red', 'wing', 'of', 'a', 'bright', 'lyalpha', 'emitter', 'at', 'z', '3327', 'the', 'data', 'presented', 'here', 'highlight', 'the', 'power', 'of', 'gravitational', 'lensing', 'in', 'high', 'sn', 'studies', 'to', 'probe', 'deeply', 'into', 'the', 'physics', 'of', 'highz', 'star', 'forming', 'galaxies']] | [-0.04730899436018752, 0.06849657485430585, -0.04829731719532552, 0.07747293950031654, -0.11378977545178853, -0.08831395802911944, 0.01008502100683892, 0.4715324276843323, -0.0732790200796444, -0.32405752052302256, 0.010584961801158407, -0.3475569617970345, 0.012775149216087392, 0.16975978019930224, 0.006320205243089451, -0.07318904074222352, 0.03930139233752226, -0.16511693603735275, 0.0062034299892659945, -0.29341462815377434, 0.2711765592523779, 0.09133951836881282, 0.14192206577516536, -0.06774046884384007, 0.10602519314404792, -0.1475412416853942, -0.11861948828356197, -0.07046490914206235, -0.1299278573662797, 0.004176282047522434, 0.2712516216650748, 0.11597751124959009, 0.24654861419067647, -0.2656682213696723, -0.1655807901985379, 0.06670062761628427, 0.2569740483429856, 0.015505134608023441, -0.06821835894493583, -0.34367439458728766, 0.050448523322777945, -0.12240572377296093, -0.20711765384409003, 0.1602390179418972, 0.03487573914955227, 0.017133687416431852, -0.17206236734592284, 0.1846358177317038, -0.028206602545329727, 0.11157847251563978, -0.09162059161955348, -0.07439571940563977, -0.13069266512936267, -0.010247591452207416, -0.020808067307091102, 0.12272123541109838, 0.21392178233856193, -0.19700257607277868, 0.026324135672229413, 0.4159569458964352, -0.09545877766885007, 0.1130543173219149, 0.23609909358291098, -0.23377980339842347, -0.23887241644820628, 0.22445294554569184, 0.11749898651972986, 0.12011977800508387, -0.15048881637272782, -0.010010877166104574, -0.02964929759171075, 0.26365698935875953, 0.00822846314851911, 0.12686277987746647, 0.37589924970570093, 0.09220548062943495, 0.041158131032912375, 0.09441325206873724, -0.3102750072860195, 0.03963540764570308, -0.2247549618445471, -0.10124244064477703, -0.14101920772809534, 0.14606511580730933, -0.16875188881161962, -0.0936900845614638, 0.2949578829951441, 0.09241037138227302, 0.24835549398916415, 0.06601309944302416, 0.34190913582256494, 0.08337365624879917, 0.12406496644566337, 0.11193652750897365, 0.3498650944755914, 0.18936610402485643, 0.06821541831103296, -0.24073404561226758, 0.0015084358635179412, -0.027771358255099934] |
1,802.00243 | Greedy Active Learning Algorithm for Logistic Regression Models | We study a logistic model-based active learning procedure for binary
classification problems, in which we adopt a batch subject selection strategy
with a modified sequential experimental design method. Moreover, accompanying
the proposed subject selection scheme, we simultaneously conduct a greedy
variable selection procedure such that we can update the classification model
with all labeled training subjects. The proposed algorithm repeatedly performs
both subject and variable selection steps until a prefixed stopping criterion
is reached. Our numerical results show that the proposed procedure has
competitive performance, with smaller training size and a more compact model,
comparing with that of the classifier trained with all variables and a full
data set. We also apply the proposed procedure to a well-known wave data set
(Breiman et al., 1984) to confirm the performance of our method.
| stat.ML | we study a logistic modelbased active learning procedure for binary classification problems in which we adopt a batch subject selection strategy with a modified sequential experimental design method moreover accompanying the proposed subject selection scheme we simultaneously conduct a greedy variable selection procedure such that we can update the classification model with all labeled training subjects the proposed algorithm repeatedly performs both subject and variable selection steps until a prefixed stopping criterion is reached our numerical results show that the proposed procedure has competitive performance with smaller training size and a more compact model comparing with that of the classifier trained with all variables and a full data set we also apply the proposed procedure to a wellknown wave data set breiman et al 1984 to confirm the performance of our method | [['we', 'study', 'a', 'logistic', 'modelbased', 'active', 'learning', 'procedure', 'for', 'binary', 'classification', 'problems', 'in', 'which', 'we', 'adopt', 'a', 'batch', 'subject', 'selection', 'strategy', 'with', 'a', 'modified', 'sequential', 'experimental', 'design', 'method', 'moreover', 'accompanying', 'the', 'proposed', 'subject', 'selection', 'scheme', 'we', 'simultaneously', 'conduct', 'a', 'greedy', 'variable', 'selection', 'procedure', 'such', 'that', 'we', 'can', 'update', 'the', 'classification', 'model', 'with', 'all', 'labeled', 'training', 'subjects', 'the', 'proposed', 'algorithm', 'repeatedly', 'performs', 'both', 'subject', 'and', 'variable', 'selection', 'steps', 'until', 'a', 'prefixed', 'stopping', 'criterion', 'is', 'reached', 'our', 'numerical', 'results', 'show', 'that', 'the', 'proposed', 'procedure', 'has', 'competitive', 'performance', 'with', 'smaller', 'training', 'size', 'and', 'a', 'more', 'compact', 'model', 'comparing', 'with', 'that', 'of', 'the', 'classifier', 'trained', 'with', 'all', 'variables', 'and', 'a', 'full', 'data', 'set', 'we', 'also', 'apply', 'the', 'proposed', 'procedure', 'to', 'a', 'wellknown', 'wave', 'data', 'set', 'breiman', 'et', 'al', '1984', 'to', 'confirm', 'the', 'performance', 'of', 'our', 'method']] | [-0.026967749824204173, -0.02318325535320169, -0.10509711940716387, 0.022721027938656112, -0.12503587295809251, -0.20666214863233495, 0.1493062362988536, 0.4506208725188943, -0.22218013559397537, -0.3296186907365071, 0.08855142535299598, -0.21550486432600088, -0.18927599764411393, 0.2077288411703855, -0.11004057134304082, 0.12103629533102679, 0.14844310611740433, 0.01699399628154369, -0.04119444265432486, -0.38440959265624935, 0.25206092844371486, 0.07928274177847373, 0.34537753824031714, -0.08525244418926763, 0.14429863890676864, 0.029796323975350595, -0.06626410170627589, 0.07075585858106162, -0.09847662204811058, 0.08299608135447753, 0.24416389211899403, 0.2131886002819308, 0.36737302786698844, -0.3230949612934086, -0.20972803566573103, 0.11409131807599668, 0.09660171922014067, 0.1292830680974999, -0.057283934343793204, -0.2842033563144717, 0.09371168761175465, -0.18365789599148696, -0.043464925161308864, -0.13065540424025984, -0.037708861326488353, -0.0018138055148125259, -0.37935946308866597, 0.03895496636356587, 0.08473338925449009, 0.0017303069700684512, -0.06729246819899841, -0.1391235433596497, 0.01787474937736988, 0.06371102872512754, 0.032322291344771104, 0.04930988915271662, 0.10264323375921583, -0.06105797031583885, -0.1777319187513609, 0.3279265678403052, -0.032654004601874585, -0.21287618115390863, 0.2041724690334928, -0.011942864931894072, -0.16535101833075963, 0.12056320563494934, 0.2173930499702692, 0.1431434102057458, -0.15769447599516503, -0.008119149694032261, -0.08448565610899206, 0.16653657016683032, 0.015937622603043124, -0.06777669628376537, 0.0983308959112037, 0.2623414925765246, 0.04337223878158539, 0.1570948614830603, -0.14153012513556998, -0.06285611826663653, -0.2806364915529478, -0.0749212274236153, -0.18337122123215743, -0.044736145909237995, -0.09793143930713114, -0.13617022382624616, 0.37190094449703215, 0.21350238703642832, 0.2136743452724521, 0.11864961834119943, 0.3166354477941764, 0.06937475242695214, 0.0647267133974696, 0.12146904273664183, 0.18569294432403916, 0.052394849881018286, 0.07969884134151718, -0.22983306988184762, 0.06727584933678647, 0.08046766358716978] |
1,802.00244 | A few notes on Lorentz spaces | In the sequel, we recall and comment some classical results on the
non-increasing rearrangement and Lorentz spaces. There are papers in the
existing literature that seemed to have been bypassed as regards its
contractive property in~$L^p$ spaces. Also, we provide detailed proofs and some
properties that does not seem to arise in the existing literature.
| math.FA | in the sequel we recall and comment some classical results on the nonincreasing rearrangement and lorentz spaces there are papers in the existing literature that seemed to have been bypassed as regards its contractive property inlp spaces also we provide detailed proofs and some properties that does not seem to arise in the existing literature | [['in', 'the', 'sequel', 'we', 'recall', 'and', 'comment', 'some', 'classical', 'results', 'on', 'the', 'nonincreasing', 'rearrangement', 'and', 'lorentz', 'spaces', 'there', 'are', 'papers', 'in', 'the', 'existing', 'literature', 'that', 'seemed', 'to', 'have', 'been', 'bypassed', 'as', 'regards', 'its', 'contractive', 'property', 'inlp', 'spaces', 'also', 'we', 'provide', 'detailed', 'proofs', 'and', 'some', 'properties', 'that', 'does', 'not', 'seem', 'to', 'arise', 'in', 'the', 'existing', 'literature']] | [-0.07598108426900581, 0.04321901522291062, -0.09978310271928256, 0.12654142835262147, -0.1605568244037303, -0.11204415233805776, 0.019977628566663373, 0.4490229971029542, -0.2464263201267882, -0.22055280002003366, 0.16019886687651955, -0.2831171292134307, -0.17018418452617798, 0.21873628713867882, -0.19226679402318866, 0.05076609023486857, 0.04564586987464943, 0.04171349170501344, -0.14743986017155378, -0.3146780990910801, 0.3257689771327105, 0.023556324196132745, 0.22829474294134838, 0.10656516252254898, 0.0019946596500548448, -0.058433754962276326, -0.08763632196933031, 0.04371709576384588, -0.20509898699105675, 0.06837234656241807, 0.2818269234997305, 0.15479542902162807, 0.2930783399126746, -0.42554340091618625, -0.21055310597135263, 0.14829888011921535, 0.13836566151373766, 0.07902007096193053, -0.05495638882487335, -0.2567859176884998, 0.09055978748947383, -0.12693076735701073, -0.10250649137253111, -0.16995611061680724, -0.0035131506791168995, 0.05209289050491696, -0.15984585983678698, 0.04365006319024939, 0.18105941888960925, 0.042723735388029704, -0.07442524625538764, -0.16959798830476674, 0.012130882624875416, 0.10278519893234427, 0.12736047198149292, 0.04908543566072529, 0.09044899827885357, -0.0600129439749501, -0.15497340648223393, 0.36627800315618514, 0.003962863723493435, -0.23267672756178812, 0.2456034643829546, -0.15592854715545068, -0.2392889786088331, 0.04972661676901308, 0.08530620300973003, 0.09142800795168361, -0.10954330914061178, 0.11186410298422826, -0.10535218976438046, 0.09534323882650245, 0.08331553306938573, 0.12338217999786139, 0.10032393278723413, 0.046105835112658415, 0.04130445580336858, 0.08843746490522542, 0.03732621634421362, -0.12200525521343066, -0.3354668024419384, -0.14168609817597, -0.12223855617286807, 0.04736727881271773, 0.00919649237846236, -0.15146651024168187, 0.3150623417713425, 0.18474016320277853, 0.16702940694310447, 0.06823934640904719, 0.21644195291129026, 0.04703438205178827, 0.06785839490423148, 0.05626385689459064, 0.2935818255677904, 0.11902268332513896, 0.1500982057387856, -0.1104063593105159, 0.07458605912768028, 0.09210325359282169] |
1,802.00245 | Towards Reliable (and Efficient) Job Executions in a Practical
Geo-distributed Data Analytics System | Geo-distributed data analytics are increasingly common to derive useful
information in large organisations. Naive extension of existing cluster-scale
data analytics systems to the scale of geo-distributed data centers faces
unique challenges including WAN bandwidth limits, regulatory constraints,
changeable/unreliable runtime environment, and monetary costs. Our goal in this
work is to develop a practical geo-distribued data analytics system that (1)
employs an intelligent mechanism for jobs to efficiently utilize (adjust to)
the resources (changeable environment) across data centers; (2) guarantees the
reliability of jobs due to the possible failures; and (3) is generic and
flexible enough to run a wide range of data analytics jobs without requiring
any changes.
To this end, we present a new, general geo-distributed data analytics system,
HOUTU, that is composed of multiple autonomous systems, each operating in a
sovereign data center. HOUTU maintains a job manager (JM) for a geo-distributed
job in each data center, so that these replicated JMs could individually and
cooperatively manage resources and assign tasks. Our experiments on the
prototype of HOUTU running across four Alibaba Cloud regions show that HOUTU
provides nearly efficient job performance as in the existing centralized
architecture, and guarantees reliable job executions when facing failures.
| cs.DC | geodistributed data analytics are increasingly common to derive useful information in large organisations naive extension of existing clusterscale data analytics systems to the scale of geodistributed data centers faces unique challenges including wan bandwidth limits regulatory constraints changeableunreliable runtime environment and monetary costs our goal in this work is to develop a practical geodistribued data analytics system that 1 employs an intelligent mechanism for jobs to efficiently utilize adjust to the resources changeable environment across data centers 2 guarantees the reliability of jobs due to the possible failures and 3 is generic and flexible enough to run a wide range of data analytics jobs without requiring any changes to this end we present a new general geodistributed data analytics system houtu that is composed of multiple autonomous systems each operating in a sovereign data center houtu maintains a job manager jm for a geodistributed job in each data center so that these replicated jms could individually and cooperatively manage resources and assign tasks our experiments on the prototype of houtu running across four alibaba cloud regions show that houtu provides nearly efficient job performance as in the existing centralized architecture and guarantees reliable job executions when facing failures | [['geodistributed', 'data', 'analytics', 'are', 'increasingly', 'common', 'to', 'derive', 'useful', 'information', 'in', 'large', 'organisations', 'naive', 'extension', 'of', 'existing', 'clusterscale', 'data', 'analytics', 'systems', 'to', 'the', 'scale', 'of', 'geodistributed', 'data', 'centers', 'faces', 'unique', 'challenges', 'including', 'wan', 'bandwidth', 'limits', 'regulatory', 'constraints', 'changeableunreliable', 'runtime', 'environment', 'and', 'monetary', 'costs', 'our', 'goal', 'in', 'this', 'work', 'is', 'to', 'develop', 'a', 'practical', 'geodistribued', 'data', 'analytics', 'system', 'that', '1', 'employs', 'an', 'intelligent', 'mechanism', 'for', 'jobs', 'to', 'efficiently', 'utilize', 'adjust', 'to', 'the', 'resources', 'changeable', 'environment', 'across', 'data', 'centers', '2', 'guarantees', 'the', 'reliability', 'of', 'jobs', 'due', 'to', 'the', 'possible', 'failures', 'and', '3', 'is', 'generic', 'and', 'flexible', 'enough', 'to', 'run', 'a', 'wide', 'range', 'of', 'data', 'analytics', 'jobs', 'without', 'requiring', 'any', 'changes', 'to', 'this', 'end', 'we', 'present', 'a', 'new', 'general', 'geodistributed', 'data', 'analytics', 'system', 'houtu', 'that', 'is', 'composed', 'of', 'multiple', 'autonomous', 'systems', 'each', 'operating', 'in', 'a', 'sovereign', 'data', 'center', 'houtu', 'maintains', 'a', 'job', 'manager', 'jm', 'for', 'a', 'geodistributed', 'job', 'in', 'each', 'data', 'center', 'so', 'that', 'these', 'replicated', 'jms', 'could', 'individually', 'and', 'cooperatively', 'manage', 'resources', 'and', 'assign', 'tasks', 'our', 'experiments', 'on', 'the', 'prototype', 'of', 'houtu', 'running', 'across', 'four', 'alibaba', 'cloud', 'regions', 'show', 'that', 'houtu', 'provides', 'nearly', 'efficient', 'job', 'performance', 'as', 'in', 'the', 'existing', 'centralized', 'architecture', 'and', 'guarantees', 'reliable', 'job', 'executions', 'when', 'facing', 'failures']] | [-0.16470673451038573, 0.011154674949336498, -0.0634778083458885, 0.03734848860886461, -0.13334655990272912, -0.1901284310389405, 0.12201336418083698, 0.39674849747870194, -0.26536185753042335, -0.35950322231581927, 0.13512483066718844, -0.28695383223904564, -0.0575899372449886, 0.17562329977256608, -0.13495147506806202, 0.0883585745611285, 0.1453233932267295, 0.0018999597951009565, 0.03497638071890759, -0.2890529001330035, 0.26565887994425164, 0.07112090389377304, 0.3528813570975421, 0.040890051370334565, 0.061664734861922775, -0.0002864114631309497, -0.015509854690338085, -0.029773675202278003, -0.05251471058311706, 0.13637732951258152, 0.3872629361362577, 0.24577699341972795, 0.35271315446018947, -0.46831776502504185, -0.13237303331891093, 0.11457243843754868, 0.1367850664507702, 0.032352787472203146, -0.03533724650956823, -0.255622903467156, 0.11856247137041706, -0.21641735773775916, -0.09391324251310482, -0.09565180621219191, 0.03186288117003456, 0.014213557511910188, -0.3210121297600622, -0.03262227237799528, -0.02768130462684393, 0.04594825116955504, -0.05250041464068072, -0.06273765265953499, 0.015165075051541231, 0.17976678130219867, 0.009787006894060011, 0.017389963897733892, 0.204322150312079, -0.1093852354031845, -0.15992819477773712, 0.4099237589089542, 0.015833874288898875, -0.13081583787870654, 0.21653660276562584, -0.02883635292312888, -0.2196644667122627, 0.0813707365103218, 0.24934029319722736, 0.030903574015127912, -0.2219236278262765, 0.056164168790149106, 0.031038444416778048, 0.18286462642052875, 0.0011063004672831418, 0.013614223872332796, 0.18226475337144862, 0.23374904543802866, 0.1184451148408104, 0.11033463391133261, -0.03985197413403883, -0.10839339713025506, -0.18613900005142828, -0.12559277281386075, -0.1798145641164132, -0.019232316714787513, -0.11820459107073067, -0.11828195693313467, 0.3414502500643127, 0.20605473882965364, 0.18552655925676084, 0.09915087450912213, 0.3933744243350906, -0.003928305361745404, 0.15973401931114495, 0.19195972170148576, 0.10676618191123731, -0.06800631638640081, 0.2021417569378581, -0.16478321906321738, 0.07242505827607416, -0.09443109504621933] |
1,802.00246 | A group law on the projective plane with applications in Public Key
Cryptography | We present a new group law defined on a subset of the projective plane
$\mathbb{F}P^2$ over an arbitrary field $\mathbb{F}$, which lends itself to
applications in Public Key Cryptography, in particular to a Diffie-Hellman-like
key agreement protocol. We analyze the computational difficulty of solving the
mathematical problem underlying the proposed Abelian group law and we prove
that the security of our proposal is equivalent to the discrete logarithm
problem in the multiplicative group of the cubic extension of the finite field
considered. Finally, we present a variant of the proposed group law but over
the ring $\mathbb{Z}/pq\mathbb{Z}$, and explain how the security becomes
enhanced, though at the cost of a longer key length.
| cs.CR | we present a new group law defined on a subset of the projective plane mathbbfp2 over an arbitrary field mathbbf which lends itself to applications in public key cryptography in particular to a diffiehellmanlike key agreement protocol we analyze the computational difficulty of solving the mathematical problem underlying the proposed abelian group law and we prove that the security of our proposal is equivalent to the discrete logarithm problem in the multiplicative group of the cubic extension of the finite field considered finally we present a variant of the proposed group law but over the ring mathbbzpqmathbbz and explain how the security becomes enhanced though at the cost of a longer key length | [['we', 'present', 'a', 'new', 'group', 'law', 'defined', 'on', 'a', 'subset', 'of', 'the', 'projective', 'plane', 'mathbbfp2', 'over', 'an', 'arbitrary', 'field', 'mathbbf', 'which', 'lends', 'itself', 'to', 'applications', 'in', 'public', 'key', 'cryptography', 'in', 'particular', 'to', 'a', 'diffiehellmanlike', 'key', 'agreement', 'protocol', 'we', 'analyze', 'the', 'computational', 'difficulty', 'of', 'solving', 'the', 'mathematical', 'problem', 'underlying', 'the', 'proposed', 'abelian', 'group', 'law', 'and', 'we', 'prove', 'that', 'the', 'security', 'of', 'our', 'proposal', 'is', 'equivalent', 'to', 'the', 'discrete', 'logarithm', 'problem', 'in', 'the', 'multiplicative', 'group', 'of', 'the', 'cubic', 'extension', 'of', 'the', 'finite', 'field', 'considered', 'finally', 'we', 'present', 'a', 'variant', 'of', 'the', 'proposed', 'group', 'law', 'but', 'over', 'the', 'ring', 'mathbbzpqmathbbz', 'and', 'explain', 'how', 'the', 'security', 'becomes', 'enhanced', 'though', 'at', 'the', 'cost', 'of', 'a', 'longer', 'key', 'length']] | [-0.1756285971915769, 0.018674928624825844, -0.1167351133064241, 0.05157655999924451, -0.07756960097498991, -0.1355478135210269, 0.05597484607232718, 0.33489274508781264, -0.3189059938262175, -0.2578830877780444, 0.10272359739892555, -0.18958301065691016, -0.15362410718440875, 0.2222799041920954, -0.13032703296289788, 0.0273175944767154, -0.025608767560255284, 0.06994889142528714, -0.04015006927557306, -0.29459924093103623, 0.33436973898793226, 0.03606868202185577, 0.29313707549695495, 0.05930857621301133, 0.13003844411640958, 0.04542964484190216, -0.04371479621811493, 0.022168575156782125, -0.11616650267604052, 0.1480765520565648, 0.25479417375230173, 0.0982608516188758, 0.300915645250866, -0.3852366114471544, -0.18935632148782747, 0.13856946065526893, 0.1474275233073009, 0.0818059509022262, -0.07286642104920067, -0.24116174230637313, 0.10451803437375405, -0.1966028442639891, -0.16839832723610573, -0.02192637783492001, 0.025515597105982737, -0.014236809081725171, -0.23920276969134271, 0.014193047144290831, 0.05826750897743681, 0.08161670831661369, -0.024716872982009575, -0.05225137315547882, 0.03233415587922676, 0.10144504112074035, 0.03919229924737534, 0.041495352378324815, 0.10045658523606993, -0.11135063912753049, -0.11696597792812295, 0.4155556557549013, -0.07243622916064703, -0.16813620246174904, 0.11371331096853356, -0.12090276251337281, -0.15531967493898427, 0.10823247369445928, 0.15389114015878322, 0.10805991985870532, -0.06890380620822176, 0.1419584545053055, -0.1144392509349026, 0.19511707122060093, -0.0006353564241582209, 0.028462427411779557, 0.12967596682174518, 0.14806164962004636, 0.08420745349674788, 0.16309218608715512, -0.02451260963786259, -0.13719823633463266, -0.3528504995796997, -0.18371256360698174, -0.1719997654289326, 0.06421410288191862, -0.10624487864441944, -0.14456073519027046, 0.4092057468537409, 0.1674084411934018, 0.13291552557970757, 0.09372318140965223, 0.2868469054642897, 0.09266013402579906, 0.07417912076453904, 0.08967956200426629, 0.14630423274797363, 0.15679105463215393, 0.053071453817071276, -0.22307726803135025, 0.05789814225339272, 0.08606985702204543] |
1,802.00247 | Fermi-Pasta-Ulam chains with harmonic and anharmonic long-range
interactions | We study the dynamics of Fermi-Pasta-Ulam chains with both harmonic and
anharmonic power-law long-range interactions. We show that the dynamics is
described in the continuum limit by a generalized fractional Boussinesq
differential equation, whose derivation is performed in full detail. We also
discuss a version of the model where couplings are alternating in sign.
| cond-mat.stat-mech | we study the dynamics of fermipastaulam chains with both harmonic and anharmonic powerlaw longrange interactions we show that the dynamics is described in the continuum limit by a generalized fractional boussinesq differential equation whose derivation is performed in full detail we also discuss a version of the model where couplings are alternating in sign | [['we', 'study', 'the', 'dynamics', 'of', 'fermipastaulam', 'chains', 'with', 'both', 'harmonic', 'and', 'anharmonic', 'powerlaw', 'longrange', 'interactions', 'we', 'show', 'that', 'the', 'dynamics', 'is', 'described', 'in', 'the', 'continuum', 'limit', 'by', 'a', 'generalized', 'fractional', 'boussinesq', 'differential', 'equation', 'whose', 'derivation', 'is', 'performed', 'in', 'full', 'detail', 'we', 'also', 'discuss', 'a', 'version', 'of', 'the', 'model', 'where', 'couplings', 'are', 'alternating', 'in', 'sign']] | [-0.172226306223483, 0.1487699078430456, -0.05270994706963258, 0.09580932642522923, -0.03245797348467426, -0.13400708613227363, -0.03650265750992629, 0.35358633290700336, -0.27515843639978105, -0.23073703588710892, 0.07815410703187808, -0.3039685284235963, -0.1907898348721641, 0.13337814103794732, 0.06144450890348741, 0.02123775407326994, 0.042670327359465535, 0.010849090310296527, -0.048079633960258904, -0.1755444970223363, 0.2746896836691088, 0.009572487762111618, 0.19648613227117392, 0.04991651879175118, 0.08760737939047869, 0.03034319228458184, -0.004182536068751856, 0.03449752664676419, -0.18176590018817848, 0.05549109670230084, 0.15969745214614603, -0.06665672610203426, 0.2086551815478338, -0.4445267759125542, -0.22741564858221897, 0.08808466559275985, 0.1568023845191217, 0.13094760629313965, -0.010978295916208514, -0.282126764551288, 0.006088169843510345, -0.18422075754238498, -0.18928468408476976, -0.09492658273558374, 0.005316377306977908, 0.10536804763789943, -0.2499487209306271, 0.1562890092410035, 0.11156926579187038, 0.05917483625105686, -0.05839135001965419, -0.062251219249985834, -0.015095100686368015, 0.016327542459799185, 0.022772417117030947, -0.056137133031842056, 0.04510541587067699, -0.14108556245143214, -0.13614381771724396, 0.4003899829393184, -0.16278850428622077, -0.2766328332255836, 0.13244659428622713, -0.18257934742400217, -0.16019446031121468, 0.07931010889027405, 0.13974347310485663, 0.08995364299388947, -0.1975043529851569, 0.14704729768318767, -0.04993745427647674, 0.17450765572074387, 0.014510893806194266, -0.031282240309304106, 0.14240389964025882, 0.1947629956735505, 0.011199033577685003, 0.21401561258567703, -0.03992077783510063, -0.21846617263293377, -0.30389685459710936, -0.12099480425456056, -0.16123270422340957, 0.06442462918521077, -0.05950512750806175, -0.1606711423093522, 0.4102333815837348, 0.13388766515655098, 0.1578446467648502, 0.06986971108104896, 0.2280585206700144, 0.225746541508232, -0.016778010008339252, 0.030267479156868324, 0.23090740757201006, 0.17829545710184094, 0.08234634829892053, -0.28371566037336987, -0.03982842179808627, 0.1278154434705222] |
1,802.00248 | Decomposable $(4,7)$ solutions in eleven-dimensional supergravity | Consider an oriented four-dimensional Lorentzian manifold $(\widetilde{M}^{3,
1}, \widetilde{g})$ and an oriented seven-dimensional Riemannian manifold
$(M^{7}, g)$. We describe a class of decomposable eleven-dimensional
supergravity backgrounds on the product manifold $({\mathcal{M}}^{10,
1}=\widetilde{M}^{3,1} \times M^7, g_{{\mathcal{M}}}=\widetilde{g}+g)$, endowed
with a flux form given in terms of the volume form on $\widetilde{M}^{3, 1}$
and a closed $4$-form $F^{4}$ on $M^{7}$. We show that the Maxwell equation for
such a flux form can be read in terms of the co-closed 3-form
$\phi=\star_{7}F^{4}$. Moreover, the supergravity equation reduces to the
condition that $(\widetilde{M}^{3,1},\widetilde{g})$ is an Einstein manifold
with negative Einstein constant and $(M^7, g, F)$ is a Riemannian manifold
which satisfies the Einstein equation with a stress-energy tensor associated to
the 3-form $\phi$. Whenever this 3-form is generic, the Maxwell equation
induces a weak ${\rm G}_2$-structure on $M^{7}$ and then we obtain decomposable
supergravity backgrounds given by the product of a weak ${\rm G}_2$-manifold
$(M^7, \phi, g)$ with a Lorentzian Einstein manifold
$(\widetilde{M}^{3,1},\widetilde{g})$. We classify homogeneous 7-manifolds
$M^{7}=G/H$ of a compact Lie group $G$ and indicate the cosets which admit an
invariant or non-invariant ${\rm G}_2$-structure, or even no ${\rm
G}_2$-structure. Then we construct examples of compact homogeneous Riemannian
7-manifolds endowed with non-generic invariant 3-forms which satisfy the
Maxwell equation, but the construction of decomposable homogeneous supergravity
backgrounds of this type remains an open problem.
| math.DG hep-th | consider an oriented fourdimensional lorentzian manifold widetildem3 1 widetildeg and an oriented sevendimensional riemannian manifold m7 g we describe a class of decomposable elevendimensional supergravity backgrounds on the product manifold mathcalm10 1widetildem31 times m7 g_mathcalmwidetildegg endowed with a flux form given in terms of the volume form on widetildem3 1 and a closed 4form f4 on m7 we show that the maxwell equation for such a flux form can be read in terms of the coclosed 3form phistar_7f4 moreover the supergravity equation reduces to the condition that widetildem31widetildeg is an einstein manifold with negative einstein constant and m7 g f is a riemannian manifold which satisfies the einstein equation with a stressenergy tensor associated to the 3form phi whenever this 3form is generic the maxwell equation induces a weak rm g_2structure on m7 and then we obtain decomposable supergravity backgrounds given by the product of a weak rm g_2manifold m7 phi g with a lorentzian einstein manifold widetildem31widetildeg we classify homogeneous 7manifolds m7gh of a compact lie group g and indicate the cosets which admit an invariant or noninvariant rm g_2structure or even no rm g_2structure then we construct examples of compact homogeneous riemannian 7manifolds endowed with nongeneric invariant 3forms which satisfy the maxwell equation but the construction of decomposable homogeneous supergravity backgrounds of this type remains an open problem | [['consider', 'an', 'oriented', 'fourdimensional', 'lorentzian', 'manifold', 'widetildem3', '1', 'widetildeg', 'and', 'an', 'oriented', 'sevendimensional', 'riemannian', 'manifold', 'm7', 'g', 'we', 'describe', 'a', 'class', 'of', 'decomposable', 'elevendimensional', 'supergravity', 'backgrounds', 'on', 'the', 'product', 'manifold', 'mathcalm10', '1widetildem31', 'times', 'm7', 'g_mathcalmwidetildegg', 'endowed', 'with', 'a', 'flux', 'form', 'given', 'in', 'terms', 'of', 'the', 'volume', 'form', 'on', 'widetildem3', '1', 'and', 'a', 'closed', '4form', 'f4', 'on', 'm7', 'we', 'show', 'that', 'the', 'maxwell', 'equation', 'for', 'such', 'a', 'flux', 'form', 'can', 'be', 'read', 'in', 'terms', 'of', 'the', 'coclosed', '3form', 'phistar_7f4', 'moreover', 'the', 'supergravity', 'equation', 'reduces', 'to', 'the', 'condition', 'that', 'widetildem31widetildeg', 'is', 'an', 'einstein', 'manifold', 'with', 'negative', 'einstein', 'constant', 'and', 'm7', 'g', 'f', 'is', 'a', 'riemannian', 'manifold', 'which', 'satisfies', 'the', 'einstein', 'equation', 'with', 'a', 'stressenergy', 'tensor', 'associated', 'to', 'the', '3form', 'phi', 'whenever', 'this', '3form', 'is', 'generic', 'the', 'maxwell', 'equation', 'induces', 'a', 'weak', 'rm', 'g_2structure', 'on', 'm7', 'and', 'then', 'we', 'obtain', 'decomposable', 'supergravity', 'backgrounds', 'given', 'by', 'the', 'product', 'of', 'a', 'weak', 'rm', 'g_2manifold', 'm7', 'phi', 'g', 'with', 'a', 'lorentzian', 'einstein', 'manifold', 'widetildem31widetildeg', 'we', 'classify', 'homogeneous', '7manifolds', 'm7gh', 'of', 'a', 'compact', 'lie', 'group', 'g', 'and', 'indicate', 'the', 'cosets', 'which', 'admit', 'an', 'invariant', 'or', 'noninvariant', 'rm', 'g_2structure', 'or', 'even', 'no', 'rm', 'g_2structure', 'then', 'we', 'construct', 'examples', 'of', 'compact', 'homogeneous', 'riemannian', '7manifolds', 'endowed', 'with', 'nongeneric', 'invariant', '3forms', 'which', 'satisfy', 'the', 'maxwell', 'equation', 'but', 'the', 'construction', 'of', 'decomposable', 'homogeneous', 'supergravity', 'backgrounds', 'of', 'this', 'type', 'remains', 'an', 'open', 'problem']] | [-0.2225437790126856, 0.1015106640404825, -0.015828172379735647, 0.07274934159479772, -0.18892503958986193, -0.19078539356255447, -0.10810092375350167, 0.3562756678043373, -0.16689973887723852, -0.2325815291205456, 0.10411298992815164, -0.26327263197492595, -0.1590805304948381, 0.1325922373721798, -0.11286560061853379, -0.07127751437244269, 0.06871721400760712, 0.15985562260930408, -0.16416427715931897, -0.2613893958008497, 0.45588476828273106, -0.05724410626945033, 0.21074591486556632, -0.017364425761493378, 0.20981507910028943, -0.09280257516667985, 0.04645108233342158, 0.034898503404549974, -0.1697404171198904, 0.05973285465898818, 0.21242727617566246, 0.10081374503351981, 0.08681239343230736, -0.3805217144078408, -0.1797002045390194, 0.2005174146780639, 0.11502731026958604, -0.010355614210843583, 0.01034437304687739, -0.3422206089884605, 0.08042482634729547, -0.12391910347692177, -0.18802819092854647, -0.06878569867145622, 0.05202408862862525, -0.092830365106358, -0.24175485646910086, 0.03277727793287134, 0.08358120461618353, 0.02775416259636294, -0.12917168714811164, -0.07386770148823073, -0.09062618929629196, 0.015143073257278511, 0.019181137430626584, 0.15827456590684377, 0.10414068696950123, -0.08037167186365586, -0.07914857657292401, 0.34057575253492994, -0.16196606741374675, -0.3348866323413292, 0.07132579182836947, -0.09564177684029038, -0.1810198606295019, 0.13840968332929923, 0.09102342654467684, 0.19893584512657364, -0.09633254174792147, 0.23995975630203006, -0.05706394996652204, 0.09350345294894036, 0.08971638789396065, -0.027023942739689583, 0.1810693254261629, 0.08835096948753761, 0.14256102300220486, 0.09984691294029856, 0.015987346082528227, 0.007522987597182674, -0.4176971907244187, -0.19118208923711516, -0.07728318290626805, 0.28836369137213796, -0.177670580729991, -0.2326189161054263, 0.32533414251245735, -0.06742721774729567, 0.13925297343515888, 0.10874486174135148, 0.16026274203147106, 0.09000322785456928, 0.06266440520225584, 0.157587728346698, 0.17085810728867556, 0.25085578238666234, 0.01650065950223438, -0.17783617443528096, -0.19026727017173367, 0.14734042642356934] |
1,802.00249 | Spectral control of high harmonics from relativistic plasmas using
bicircular fields | We introduce two-color counterrotating circularly polarized laser fields as a
new way to spectrally control high harmonic generation (HHG) from relativistic
plasma mirrors. Through particle-in-cell simulations, we show that only a
selected group of harmonic orders can appear owing to the symmetry of the laser
fields and the related conservation laws. By adjusting the intensity ratio of
the two driving field components, we demonstrate the overall HHG efficiency,
the relative intensity of allowed neighboring harmonic orders, and the
polarization state of the harmonic source can be tuned. The HHG efficiency of
this scheme can be as high as that driven by a linearly polarized laser field.
| physics.plasm-ph | we introduce twocolor counterrotating circularly polarized laser fields as a new way to spectrally control high harmonic generation hhg from relativistic plasma mirrors through particleincell simulations we show that only a selected group of harmonic orders can appear owing to the symmetry of the laser fields and the related conservation laws by adjusting the intensity ratio of the two driving field components we demonstrate the overall hhg efficiency the relative intensity of allowed neighboring harmonic orders and the polarization state of the harmonic source can be tuned the hhg efficiency of this scheme can be as high as that driven by a linearly polarized laser field | [['we', 'introduce', 'twocolor', 'counterrotating', 'circularly', 'polarized', 'laser', 'fields', 'as', 'a', 'new', 'way', 'to', 'spectrally', 'control', 'high', 'harmonic', 'generation', 'hhg', 'from', 'relativistic', 'plasma', 'mirrors', 'through', 'particleincell', 'simulations', 'we', 'show', 'that', 'only', 'a', 'selected', 'group', 'of', 'harmonic', 'orders', 'can', 'appear', 'owing', 'to', 'the', 'symmetry', 'of', 'the', 'laser', 'fields', 'and', 'the', 'related', 'conservation', 'laws', 'by', 'adjusting', 'the', 'intensity', 'ratio', 'of', 'the', 'two', 'driving', 'field', 'components', 'we', 'demonstrate', 'the', 'overall', 'hhg', 'efficiency', 'the', 'relative', 'intensity', 'of', 'allowed', 'neighboring', 'harmonic', 'orders', 'and', 'the', 'polarization', 'state', 'of', 'the', 'harmonic', 'source', 'can', 'be', 'tuned', 'the', 'hhg', 'efficiency', 'of', 'this', 'scheme', 'can', 'be', 'as', 'high', 'as', 'that', 'driven', 'by', 'a', 'linearly', 'polarized', 'laser', 'field']] | [-0.1324052485958058, 0.24211223452474992, -0.05518411059494851, 0.0018431711755253655, -0.004191266640774765, -0.08869877176904031, 0.006170006591896966, 0.48991420949405096, -0.3078428585750033, -0.296149492408764, -0.0050316796734718216, -0.20773248016430101, -0.05633247709604648, 0.24123485255459287, 0.00772180557602419, 0.024534290669626504, -0.006812461397065869, -0.07869980740800218, 0.034572849669581594, -0.19179882719576852, 0.31463253935183977, 0.08317726636019904, 0.31049404200166464, 0.028904287019340356, 0.13030056247733673, -0.03047130115435652, -0.005370693105571675, 0.005520162238510993, -0.030264832992062746, 0.1178595909106387, 0.21586281869050888, 0.013916557195666686, 0.24886252840031992, -0.40585190235672275, -0.23313141503494303, 0.04111672449364977, 0.14240484790687608, 0.1349175669459345, -0.0882160291866452, -0.25381414436533134, -0.00961214173936619, -0.15292488362306272, -0.15936813141737696, -0.11079330295807559, -0.05844623749012584, 0.14833953811892503, -0.29692632547702713, 0.02364621052676636, 0.060219571638299385, 0.02557786812923161, -0.030404718882702995, -0.025157982935988397, -0.09870703384842512, 0.08380739883857972, 0.03290151104875753, 0.0755490380908222, 0.17629932726893732, -0.15214934069685251, -0.14597474852190265, 0.4405590588894655, -0.16162972918377733, -0.1448550387461371, 0.15399185976646138, -0.2379460942334021, -0.04107699596393361, 0.18394417712412212, 0.16643502349297534, 0.16602879767042567, -0.07592977390993598, 0.017294634106120903, 0.00951164444240759, 0.23099852968578422, 0.14621972334834765, 0.03925740605501352, 0.2543618925583531, 0.08638968663334073, 0.06882374344182471, 0.18950199444101737, -0.11303685366545084, -0.052323104216242734, -0.28783351558981074, -0.09310096511968745, -0.1725800768944505, 0.06505518396086288, -0.057736988394369616, -0.07450957518765035, 0.4509829604056955, 0.13687698098936313, 0.0987015447122449, -0.05114508136439155, 0.35045193518810674, 0.21354543760897732, 0.035801095747441614, 0.0005349729227710445, 0.2880501089055302, 0.19094786326234, 0.07095227426111277, -0.26852422099745005, -0.0579726957141659, 0.02300094955881952] |
1,802.0025 | Risk-sensitive performance criteria and robustness of quantum systems
with a relative entropy description of state uncertainty | This paper considers links between the original risk-sensitive performance
criterion for quantum control systems and its recent quadratic-exponential
counterpart. We discuss a connection between the minimization of these cost
functionals and robustness with respect to uncertainty in system-environment
quantum states whose deviation from a nominal state is described in terms of
the quantum relative entropy. These relations are similar to those in minimax
LQG control for classical systems. The results of the paper can be of use in
providing a rational choice of the risk-sensitivity parameter in the context of
robust quantum control with entropy theoretic quantification of statistical
uncertainty in the system-field state.
| quant-ph cs.SY math.OC | this paper considers links between the original risksensitive performance criterion for quantum control systems and its recent quadraticexponential counterpart we discuss a connection between the minimization of these cost functionals and robustness with respect to uncertainty in systemenvironment quantum states whose deviation from a nominal state is described in terms of the quantum relative entropy these relations are similar to those in minimax lqg control for classical systems the results of the paper can be of use in providing a rational choice of the risksensitivity parameter in the context of robust quantum control with entropy theoretic quantification of statistical uncertainty in the systemfield state | [['this', 'paper', 'considers', 'links', 'between', 'the', 'original', 'risksensitive', 'performance', 'criterion', 'for', 'quantum', 'control', 'systems', 'and', 'its', 'recent', 'quadraticexponential', 'counterpart', 'we', 'discuss', 'a', 'connection', 'between', 'the', 'minimization', 'of', 'these', 'cost', 'functionals', 'and', 'robustness', 'with', 'respect', 'to', 'uncertainty', 'in', 'systemenvironment', 'quantum', 'states', 'whose', 'deviation', 'from', 'a', 'nominal', 'state', 'is', 'described', 'in', 'terms', 'of', 'the', 'quantum', 'relative', 'entropy', 'these', 'relations', 'are', 'similar', 'to', 'those', 'in', 'minimax', 'lqg', 'control', 'for', 'classical', 'systems', 'the', 'results', 'of', 'the', 'paper', 'can', 'be', 'of', 'use', 'in', 'providing', 'a', 'rational', 'choice', 'of', 'the', 'risksensitivity', 'parameter', 'in', 'the', 'context', 'of', 'robust', 'quantum', 'control', 'with', 'entropy', 'theoretic', 'quantification', 'of', 'statistical', 'uncertainty', 'in', 'the', 'systemfield', 'state']] | [-0.12461926384220043, 0.0780033558436956, -0.09480448847618671, 0.06791526748565957, -0.015127765184913117, -0.13052935060113668, 0.07517952009780296, 0.32030955660873306, -0.3090414763338721, -0.2997906569267238, 0.08382717785403096, -0.2665071045809712, -0.13650043545147547, 0.2155656806873874, -0.1607359868581765, 0.1400860084591281, 0.032619546964549676, 0.06524918665393041, -0.11355527028130243, -0.2188300565623929, 0.33155576927842606, 0.05134430850515715, 0.27898513865343727, 0.00896963030698736, 0.09640758789961322, 0.02628538744801727, 0.012479205817306558, 0.04850544794820822, -0.14387582944562802, 0.1988629474827366, 0.29118420962298003, 0.12083532760600345, 0.30495301126323354, -0.35905210385457254, -0.20671835504114056, 0.12242626640587471, 0.06401733038588785, 0.10884369723498821, 0.008356758115741495, -0.29529377633634096, 0.04896122544036748, -0.20176604227610648, -0.0888325516313601, -0.07021319941626504, -0.034645492515455074, 0.018436902856382612, -0.24244746385822788, 0.12270947779492977, 0.0633008710667407, 0.07169885353561348, -0.0647428118312606, -0.07508426286781636, 0.013027282803355215, 0.12601729451517502, 0.01827928408434113, -0.00043322908906982496, 0.11269362745896125, -0.15327856601708426, -0.19266401342555092, 0.36133678490296006, -0.03105633681004222, -0.24115411691869107, 0.18008546808806175, -0.0869802775604722, -0.1212367780726009, 0.0405852737917135, 0.17363820135450134, 0.06670462156538494, -0.15509937249589711, 0.11141346201929991, 0.012736625508785857, 0.15485655389448555, 0.0018176690791733563, 0.1323913375560481, 0.17223618407241212, 0.12920003354968054, 0.1198339260971317, 0.18445852819422726, -0.03546023701066868, -0.22956857909985745, -0.336497771482055, -0.18638156668748707, -0.15521122173567375, 0.052262155419717043, -0.10249656017017864, -0.13772222105091295, 0.37537544714107823, 0.15444297475523155, 0.16334381780157295, 0.10734877790449761, 0.26127405447634655, 0.16202307980543432, -0.020493067667792693, 0.043510542289228536, 0.2813611816874562, 0.18330173168438846, 0.04369853779028814, -0.2612635101026032, 0.10182795851477959, 0.05220095893421855] |
1,802.00251 | On indicated coloring of some classes of graphs | Indicated coloring is a type of game coloring in which two players
collectively color the vertices of a graph in the following way. In each round
the first player (Ann) selects a vertex, and then the second player (Ben)
colors it properly, using a fixed set of colors. The goal of Ann is to achieve
a proper coloring of the whole graph, while Ben is trying to prevent the
realization of this project. The smallest number of colors necessary for Ann to
win the game on a graph $G$ (regardless of Ben's strategy) is called the
indicated chromatic number of $G$, denoted by $\chi_i(G)$. In this paper, we
obtain structural characterization of connected $\{P_5,K_4,Kite,Bull\}$-free
graphs which contains an induced $C_5$ and connected $\{P_6,C_5,
K_{1,3}\}$-free graphs that contains an induced $C_6$. Also, we prove that
$\{P_5,K_4,Kite,Bull\}$-free graphs that contains an induced $C_5$ and
$\{P_6,C_5,\overline{P_5}, K_{1,3}\}$-free graphs which contains an induced
$C_6$ are $k$-indicated colorable for all $k\geq\chi(G)$. In addition, we show
that $\mathbb{K}[C_5]$ is $k$-indicated colorable for all $k\geq\chi(G)$ and as
a consequence, we exhibit that $\{P_2\cup P_3, C_4\}$-free graphs,
$\{P_5,C_4\}$-free graphs are $k$-indicated colorable for all $k\geq\chi(G)$.
This partially answers one of the questions which was raised by A. Grzesik in
\cite{and}.
| math.CO | indicated coloring is a type of game coloring in which two players collectively color the vertices of a graph in the following way in each round the first player ann selects a vertex and then the second player ben colors it properly using a fixed set of colors the goal of ann is to achieve a proper coloring of the whole graph while ben is trying to prevent the realization of this project the smallest number of colors necessary for ann to win the game on a graph g regardless of bens strategy is called the indicated chromatic number of g denoted by chi_ig in this paper we obtain structural characterization of connected p_5k_4kitebullfree graphs which contains an induced c_5 and connected p_6c_5 k_13free graphs that contains an induced c_6 also we prove that p_5k_4kitebullfree graphs that contains an induced c_5 and p_6c_5overlinep_5 k_13free graphs which contains an induced c_6 are kindicated colorable for all kgeqchig in addition we show that mathbbkc_5 is kindicated colorable for all kgeqchig and as a consequence we exhibit that p_2cup p_3 c_4free graphs p_5c_4free graphs are kindicated colorable for all kgeqchig this partially answers one of the questions which was raised by a grzesik in citeand | [['indicated', 'coloring', 'is', 'a', 'type', 'of', 'game', 'coloring', 'in', 'which', 'two', 'players', 'collectively', 'color', 'the', 'vertices', 'of', 'a', 'graph', 'in', 'the', 'following', 'way', 'in', 'each', 'round', 'the', 'first', 'player', 'ann', 'selects', 'a', 'vertex', 'and', 'then', 'the', 'second', 'player', 'ben', 'colors', 'it', 'properly', 'using', 'a', 'fixed', 'set', 'of', 'colors', 'the', 'goal', 'of', 'ann', 'is', 'to', 'achieve', 'a', 'proper', 'coloring', 'of', 'the', 'whole', 'graph', 'while', 'ben', 'is', 'trying', 'to', 'prevent', 'the', 'realization', 'of', 'this', 'project', 'the', 'smallest', 'number', 'of', 'colors', 'necessary', 'for', 'ann', 'to', 'win', 'the', 'game', 'on', 'a', 'graph', 'g', 'regardless', 'of', 'bens', 'strategy', 'is', 'called', 'the', 'indicated', 'chromatic', 'number', 'of', 'g', 'denoted', 'by', 'chi_ig', 'in', 'this', 'paper', 'we', 'obtain', 'structural', 'characterization', 'of', 'connected', 'p_5k_4kitebullfree', 'graphs', 'which', 'contains', 'an', 'induced', 'c_5', 'and', 'connected', 'p_6c_5', 'k_13free', 'graphs', 'that', 'contains', 'an', 'induced', 'c_6', 'also', 'we', 'prove', 'that', 'p_5k_4kitebullfree', 'graphs', 'that', 'contains', 'an', 'induced', 'c_5', 'and', 'p_6c_5overlinep_5', 'k_13free', 'graphs', 'which', 'contains', 'an', 'induced', 'c_6', 'are', 'kindicated', 'colorable', 'for', 'all', 'kgeqchig', 'in', 'addition', 'we', 'show', 'that', 'mathbbkc_5', 'is', 'kindicated', 'colorable', 'for', 'all', 'kgeqchig', 'and', 'as', 'a', 'consequence', 'we', 'exhibit', 'that', 'p_2cup', 'p_3', 'c_4free', 'graphs', 'p_5c_4free', 'graphs', 'are', 'kindicated', 'colorable', 'for', 'all', 'kgeqchig', 'this', 'partially', 'answers', 'one', 'of', 'the', 'questions', 'which', 'was', 'raised', 'by', 'a', 'grzesik', 'in', 'citeand']] | [-0.1449988503829417, 0.11880960712273282, -0.04094498908663545, 0.008828010155525, -0.10924538459334465, -0.127366602312233, 0.0633290190571784, 0.41611647242535427, -0.2354793518303937, -0.32186173583327193, 0.06083931787668756, -0.32496439033414726, -0.1770078738867257, 0.09112123935121483, -0.16997954858360823, -0.03500551080519401, 0.08361286535820504, 0.09319462783760125, 0.10751713441873037, -0.29940658677933335, 0.2870242752260263, -0.07000550706846727, 0.1364584419818431, 0.09769296718259472, 0.08915937246562952, 0.03127578541954951, -0.009498328868048796, 0.10756062666542944, -0.17504246369305995, 0.054399548425674536, 0.24686365653615966, 0.1550195815845108, 0.2636094998261877, -0.33902637945690767, -0.12328718234350605, 0.21035440030647684, 0.07070072754973865, 0.06324511678126964, 0.0007925417203060472, -0.2242804790986943, 0.15368269712765523, -0.1194536733845794, -0.07873467593260804, 0.007539526449632228, 0.1030985789248054, -0.00857703850050867, -0.29919365337456294, -0.04583900613355006, 0.1252996038510995, 0.04106539388433331, 0.04755538770050737, -0.14293912126697175, -0.06671003889113934, 0.1546204137342012, -0.07919803479990387, 0.09347416421668749, -0.00016050785297402447, -0.14661995804485012, -0.19961535486928308, 0.38732554622168214, -0.018238365434838817, -0.0965036620492106, 0.09217895406245259, -0.08447628102501747, -0.20875850852779138, 0.09175322918520536, 0.09261397072451835, 0.15277890618794013, -0.12666060075458196, 0.07969622413743616, -0.14120976581030714, 0.13749471438537145, 0.14360918349060448, -0.0009900416401962852, 0.10232131623716088, 0.14276836012668637, 0.16796164976799657, 0.17172549990695837, 0.02469301470458855, 0.013011181555746288, -0.30148012652858086, -0.11084103336258565, -0.2426534410429771, 0.05727924898126853, -0.11735160699460434, -0.19575593676514577, 0.4321365620641742, 0.10851745219621325, 0.17842283742647097, 0.07159987950716844, 0.21707291113528776, 0.044818743931957755, 0.062033874378418986, 0.17435461808951486, 0.1525951274860665, 0.15684466514919784, -0.02940487435661797, -0.17144474288381736, 0.06692079048895716, 0.1502811504350589] |
1,802.00252 | Energy Harvesting Fairness in AN-aided Secure MU-MIMO SWIPT Systems with
Cooperative Jammer | In this paper, we study a multi-user multiple-input-multiple-output secrecy
simultaneous wireless information and power transfer (SWIPT) channel which
consists of one transmitter, one cooperative jammer (CJ), multiple energy
receivers (potential eavesdroppers, ERs), and multiple co-located receivers
(CRs). We exploit the dual of artificial noise (AN) generation for facilitating
efficient wireless energy transfer and secure transmission. Our aim is to
maximize the minimum harvested energy among ERs and CRs subject to secrecy rate
constraints for each CR and total transmit power constraint. By incorporating
norm-bounded channel uncertainty model, we propose a iterative algorithm based
on sequential parametric convex approximation to find a near-optimal solution.
Finally, simulation results are presented to validate the performance of the
proposed algorithm outperforms that of the conventional AN-aided scheme and
CJ-aided scheme.
| cs.IT math.IT | in this paper we study a multiuser multipleinputmultipleoutput secrecy simultaneous wireless information and power transfer swipt channel which consists of one transmitter one cooperative jammer cj multiple energy receivers potential eavesdroppers ers and multiple colocated receivers crs we exploit the dual of artificial noise an generation for facilitating efficient wireless energy transfer and secure transmission our aim is to maximize the minimum harvested energy among ers and crs subject to secrecy rate constraints for each cr and total transmit power constraint by incorporating normbounded channel uncertainty model we propose a iterative algorithm based on sequential parametric convex approximation to find a nearoptimal solution finally simulation results are presented to validate the performance of the proposed algorithm outperforms that of the conventional anaided scheme and cjaided scheme | [['in', 'this', 'paper', 'we', 'study', 'a', 'multiuser', 'multipleinputmultipleoutput', 'secrecy', 'simultaneous', 'wireless', 'information', 'and', 'power', 'transfer', 'swipt', 'channel', 'which', 'consists', 'of', 'one', 'transmitter', 'one', 'cooperative', 'jammer', 'cj', 'multiple', 'energy', 'receivers', 'potential', 'eavesdroppers', 'ers', 'and', 'multiple', 'colocated', 'receivers', 'crs', 'we', 'exploit', 'the', 'dual', 'of', 'artificial', 'noise', 'an', 'generation', 'for', 'facilitating', 'efficient', 'wireless', 'energy', 'transfer', 'and', 'secure', 'transmission', 'our', 'aim', 'is', 'to', 'maximize', 'the', 'minimum', 'harvested', 'energy', 'among', 'ers', 'and', 'crs', 'subject', 'to', 'secrecy', 'rate', 'constraints', 'for', 'each', 'cr', 'and', 'total', 'transmit', 'power', 'constraint', 'by', 'incorporating', 'normbounded', 'channel', 'uncertainty', 'model', 'we', 'propose', 'a', 'iterative', 'algorithm', 'based', 'on', 'sequential', 'parametric', 'convex', 'approximation', 'to', 'find', 'a', 'nearoptimal', 'solution', 'finally', 'simulation', 'results', 'are', 'presented', 'to', 'validate', 'the', 'performance', 'of', 'the', 'proposed', 'algorithm', 'outperforms', 'that', 'of', 'the', 'conventional', 'anaided', 'scheme', 'and', 'cjaided', 'scheme']] | [-0.2724454723037779, -0.04664558699249756, 0.002566625703126192, 0.027695289760828017, -0.09423983589559794, -0.2784612187333405, 0.12330207153502852, 0.39116312194429337, -0.2804815478138626, -0.2822237672521005, 0.040547829215414825, -0.2589274511486292, -0.15928966623172164, 0.1252169981431216, -0.10791230464167893, 0.08382832221314311, 0.04505011912435293, 0.0156258480027318, 0.008260896803811193, -0.28213227112311867, 0.3033546519652009, 0.20020584783330558, 0.40070685708522796, 0.035165032912045716, 0.1459846089296043, 0.04322729624994099, -0.03242907160241157, -0.08669474227726459, -0.1187185100785573, 0.11806013852730393, 0.33825200027227403, 0.22317510564997792, 0.29437359076738356, -0.41895889715105294, -0.291784251395613, 0.11862485403940082, 0.14367488852608948, 0.05820573386456818, -0.06818356537539512, -0.22844818340614437, 0.14295232620090245, -0.2588453377485275, 0.052659400310367345, 0.01768895026296377, -0.15652017532289028, 0.08127976971166208, -0.42481587147526445, 0.024318282883614303, 0.005351983282482251, -0.013163130305707454, -0.12092746592313051, -0.11143303163535893, 0.03637536199577153, 0.1318503283429891, 0.00196526360232383, -0.030860450747422875, 0.09806475747330114, -0.06858208431489765, -0.13783520253734605, 0.33036508232867345, -0.002664795369375497, -0.21474440847709775, 0.11714178077457472, -0.024193506263196468, -0.08220083856582641, 0.1858827243950218, 0.2936709360331297, 0.08146582087129355, -0.211032665560022, 0.004032179084606469, 0.01268975136987865, 0.18953195014223456, 0.0515556554235518, 0.14414993194118142, 0.14122210862021894, 0.1574596294015646, 0.18960159865021706, 0.15123307241685688, -0.15075252877548337, -0.13388170508760958, -0.20477336913812905, -0.11572555852681399, -0.2568534611244686, 0.019624965336173774, -0.0791255433440674, 0.008884152449667454, 0.34952529820631023, 0.16213273143395782, 0.07303409846499562, 0.12213834597263486, 0.4966939799785614, 0.10289621569681913, -0.01605507156252861, 0.1862344460748136, 0.23818924579769374, 0.12226172850606963, 0.12693234981968998, -0.2634591666571796, 0.016013006525114178, -0.017816623985767364] |
1,802.00253 | On the state space and dynamics selection in linear stochastic models: a
spectral factorization approach | Matrix spectral factorization is traditionally described as finding spectral
factors having a fixed analytic pole configuration. The classification of
spectral factors then involves studying the solutions of a certain algebraic
Riccati equation which parametrizes their zero structure. The pole structure of
the spectral factors can be also parametrized in terms of solutions of another
Riccati equation. We study the relation between the solution sets of these two
Riccati equations and describe the construction of general spectral factors
which involve both zero- and pole-flipping on an arbitrary reference spectral
factor.
| cs.SY | matrix spectral factorization is traditionally described as finding spectral factors having a fixed analytic pole configuration the classification of spectral factors then involves studying the solutions of a certain algebraic riccati equation which parametrizes their zero structure the pole structure of the spectral factors can be also parametrized in terms of solutions of another riccati equation we study the relation between the solution sets of these two riccati equations and describe the construction of general spectral factors which involve both zero and poleflipping on an arbitrary reference spectral factor | [['matrix', 'spectral', 'factorization', 'is', 'traditionally', 'described', 'as', 'finding', 'spectral', 'factors', 'having', 'a', 'fixed', 'analytic', 'pole', 'configuration', 'the', 'classification', 'of', 'spectral', 'factors', 'then', 'involves', 'studying', 'the', 'solutions', 'of', 'a', 'certain', 'algebraic', 'riccati', 'equation', 'which', 'parametrizes', 'their', 'zero', 'structure', 'the', 'pole', 'structure', 'of', 'the', 'spectral', 'factors', 'can', 'be', 'also', 'parametrized', 'in', 'terms', 'of', 'solutions', 'of', 'another', 'riccati', 'equation', 'we', 'study', 'the', 'relation', 'between', 'the', 'solution', 'sets', 'of', 'these', 'two', 'riccati', 'equations', 'and', 'describe', 'the', 'construction', 'of', 'general', 'spectral', 'factors', 'which', 'involve', 'both', 'zero', 'and', 'poleflipping', 'on', 'an', 'arbitrary', 'reference', 'spectral', 'factor']] | [-0.16458286373579706, 0.035574343930089854, -0.1310547454261475, 0.07436325018087783, -0.09851136833524586, -0.11362173173851757, 0.006436179638099434, 0.3074270165102048, -0.30502958238569344, -0.26150464808928187, 0.12099095628549218, -0.22637846615080806, -0.17789832085095855, 0.15435734184310687, 0.0027854856717484918, 0.038148603148081085, 0.04382039017086341, 0.04265868945830417, -0.15363671174484558, -0.19085219900510061, 0.4401548571715301, -0.0006619056856090373, 0.24003743105144662, 0.02300970070064068, 0.1412264952590373, -0.01345134376209568, -0.0662894069021356, -0.005993021757934581, -0.13613498918923803, 0.11871420913005502, 0.2734668707919561, 0.13572645525511523, 0.20463508913367565, -0.33602199087512086, -0.1662998779181428, 0.11735294018448754, 0.16521513211244548, 0.06609368451013738, 0.03548934203122785, -0.2434838553784754, 0.06611426278356124, -0.14629922087558292, -0.20911056972214614, -0.1010062201927543, -0.03719871510243551, 0.06745954291545786, -0.2552316683828725, 0.04869143078229337, 0.05815475604454563, 0.03329658740073104, -0.09744488490237431, -0.16178422325174324, 0.006932664405956695, 0.12652121476871384, 0.05637169381159104, -0.031870326045794754, 0.06963972046188163, -0.14425588949498805, -0.0997764768914997, 0.3647514260797338, -0.059147829306311905, -0.26573566464834253, 0.12183377250436354, -0.12087873377921907, -0.1101145298638254, 0.14226841179400004, 0.13452796412589538, 0.12483944183490663, -0.16647394681587518, 0.14839115752502866, -0.037593844727697695, 0.16880571448498152, 0.11853304388668304, 0.024374860072302083, 0.12790210741910746, 0.08625878956676884, 0.048017984414896506, 0.09487999948032666, 0.013694102979074656, -0.11984881501517851, -0.31602429666302423, -0.13446589423090866, -0.14183899975879202, 0.11345145549222996, -0.20964841599627768, -0.24516477169130335, 0.46381250078874553, 0.003107478201854974, 0.2226030615010214, 0.01244197404065, 0.2418309367917986, 0.2454664514476793, 0.037869550856571135, 0.04822635534219444, 0.1745682505742562, 0.20052981842044657, 0.03497450248952108, -0.24458923499465032, 0.005233406830071049, 0.1305961101633412] |
1,802.00254 | Phonetic and Graphemic Systems for Multi-Genre Broadcast Transcription | State-of-the-art English automatic speech recognition systems typically use
phonetic rather than graphemic lexicons. Graphemic systems are known to perform
less well for English as the mapping from the written form to the spoken form
is complicated. However, in recent years the representational power of
deep-learning based acoustic models has improved, raising interest in graphemic
acoustic models for English, due to the simplicity of generating the lexicon.
In this paper, phonetic and graphemic models are compared for an English
Multi-Genre Broadcast transcription task. A range of acoustic models based on
lattice-free MMI training are constructed using phonetic and graphemic
lexicons. For this task, it is found that having a long-span temporal history
reduces the difference in performance between the two forms of models. In
addition, system combination is examined, using parameter smoothing and
hypothesis combination. As the combination approaches become more complicated
the difference between the phonetic and graphemic systems further decreases.
Finally, for all configurations examined the combination of phonetic and
graphemic systems yields consistent gains.
| cs.SD cs.CL eess.AS | stateoftheart english automatic speech recognition systems typically use phonetic rather than graphemic lexicons graphemic systems are known to perform less well for english as the mapping from the written form to the spoken form is complicated however in recent years the representational power of deeplearning based acoustic models has improved raising interest in graphemic acoustic models for english due to the simplicity of generating the lexicon in this paper phonetic and graphemic models are compared for an english multigenre broadcast transcription task a range of acoustic models based on latticefree mmi training are constructed using phonetic and graphemic lexicons for this task it is found that having a longspan temporal history reduces the difference in performance between the two forms of models in addition system combination is examined using parameter smoothing and hypothesis combination as the combination approaches become more complicated the difference between the phonetic and graphemic systems further decreases finally for all configurations examined the combination of phonetic and graphemic systems yields consistent gains | [['stateoftheart', 'english', 'automatic', 'speech', 'recognition', 'systems', 'typically', 'use', 'phonetic', 'rather', 'than', 'graphemic', 'lexicons', 'graphemic', 'systems', 'are', 'known', 'to', 'perform', 'less', 'well', 'for', 'english', 'as', 'the', 'mapping', 'from', 'the', 'written', 'form', 'to', 'the', 'spoken', 'form', 'is', 'complicated', 'however', 'in', 'recent', 'years', 'the', 'representational', 'power', 'of', 'deeplearning', 'based', 'acoustic', 'models', 'has', 'improved', 'raising', 'interest', 'in', 'graphemic', 'acoustic', 'models', 'for', 'english', 'due', 'to', 'the', 'simplicity', 'of', 'generating', 'the', 'lexicon', 'in', 'this', 'paper', 'phonetic', 'and', 'graphemic', 'models', 'are', 'compared', 'for', 'an', 'english', 'multigenre', 'broadcast', 'transcription', 'task', 'a', 'range', 'of', 'acoustic', 'models', 'based', 'on', 'latticefree', 'mmi', 'training', 'are', 'constructed', 'using', 'phonetic', 'and', 'graphemic', 'lexicons', 'for', 'this', 'task', 'it', 'is', 'found', 'that', 'having', 'a', 'longspan', 'temporal', 'history', 'reduces', 'the', 'difference', 'in', 'performance', 'between', 'the', 'two', 'forms', 'of', 'models', 'in', 'addition', 'system', 'combination', 'is', 'examined', 'using', 'parameter', 'smoothing', 'and', 'hypothesis', 'combination', 'as', 'the', 'combination', 'approaches', 'become', 'more', 'complicated', 'the', 'difference', 'between', 'the', 'phonetic', 'and', 'graphemic', 'systems', 'further', 'decreases', 'finally', 'for', 'all', 'configurations', 'examined', 'the', 'combination', 'of', 'phonetic', 'and', 'graphemic', 'systems', 'yields', 'consistent', 'gains']] | [-0.06125091320164614, 0.03590774834122725, -0.025856878506075816, 0.10630465500093211, -0.13094108937454063, -0.14554663973647247, 0.024789722822185785, 0.4111788585692285, -0.2387035936453795, -0.30034486304145275, 0.06368887162113741, -0.30840478788679804, -0.15148683602596263, 0.2806560280087617, -0.09268497760514224, 0.0480393199755036, 0.11244553587881916, 0.07584420144866523, -0.0951700466222141, -0.24534768815690944, 0.2953243304635903, 0.03765424271955727, 0.3624448417405407, -0.04158406825357465, 0.10434734805891044, -0.055270837568004716, -0.05864771238545023, -0.060427324771348115, -0.020538190594554882, 0.18991582568577794, 0.30376871714177095, 0.19187379409334657, 0.2777347752560738, -0.3807581627618028, -0.23624854510319027, 0.06132643731487691, 0.16683242414763802, 0.12710938459621315, -0.009092033902167045, -0.30867993189807397, 0.06254257605669189, -0.20554623888603535, 0.06539415396435792, -0.1139935314738057, 0.043772787082917895, -0.011776617742900973, -0.22574483592579342, 0.11119546448595889, 0.11631836559334545, 0.1612912500150928, -0.06127462193302541, -0.15894998040075514, 0.005620587404665862, 0.1514712390840525, 0.055101122865621674, 0.05715530516344111, 0.06507794507386455, -0.17395927618308193, -0.11936740130073874, 0.40218271973756065, -0.07861771801963845, -0.25072371870481286, 0.2207954092798418, -0.02415957339444613, -0.12387431781887671, 0.05181547121358025, 0.2085254402937794, 0.08328665454215538, -0.1679041561367641, 0.03241661834882584, -0.010102071586143539, 0.262731879343649, 0.1413900603186788, 0.01611988163968346, 0.19335009609994266, 0.24479413997516575, -0.04622993319216801, 0.1345709363357669, -0.062113075459611616, -0.06457386535020118, -0.17301355228276857, -0.08179687828958843, -0.15443005907161342, -0.04627517319189003, -0.054768905477967894, -0.15390600978273405, 0.37377000672291527, 0.1815544440108071, 0.14551313477848848, 0.10959708838757262, 0.31093357933730065, 0.07385026243745338, 0.12047895964190185, 0.059193442454309124, 0.18287307654818835, 0.020564869983144194, 0.1381739058997482, -0.16293759284301168, 0.10682054860615564, 0.057075306266147915] |
1,802.00255 | A Nonparametric Delayed Feedback Model for Conversion Rate Prediction | Predicting conversion rates (CVRs) in display advertising (e.g., predicting
the proportion of users who purchase an item (i.e., a conversion) after its
corresponding ad is clicked) is important when measuring the effects of ads
shown to users and to understanding the interests of the users. There is
generally a time delay (i.e., so-called {\it delayed feedback}) between the ad
click and conversion. Owing to the delayed feedback, samples that are converted
after an observation period may be treated as negative. To overcome this
drawback, CVR prediction assuming that the time delay follows an exponential
distribution has been proposed. In practice, however, there is no guarantee
that the delay is generated from the exponential distribution, and the best
distribution with which to represent the delay depends on the data. In this
paper, we propose a nonparametric delayed feedback model for CVR prediction
that represents the distribution of the time delay without assuming a
parametric distribution, such as an exponential or Weibull distribution.
Because the distribution of the time delay is modeled depending on the content
of an ad and the features of a user, various shapes of the distribution can be
represented potentially. In experiments, we show that the proposed model can
capture the distribution for the time delay on a synthetic dataset, even when
the distribution is complicated. Moreover, on a real dataset, we show that the
proposed model outperforms the existing method that assumes an exponential
distribution for the time delay in terms of conversion rate prediction.
| cs.LG stat.AP stat.ML | predicting conversion rates cvrs in display advertising eg predicting the proportion of users who purchase an item ie a conversion after its corresponding ad is clicked is important when measuring the effects of ads shown to users and to understanding the interests of the users there is generally a time delay ie socalled it delayed feedback between the ad click and conversion owing to the delayed feedback samples that are converted after an observation period may be treated as negative to overcome this drawback cvr prediction assuming that the time delay follows an exponential distribution has been proposed in practice however there is no guarantee that the delay is generated from the exponential distribution and the best distribution with which to represent the delay depends on the data in this paper we propose a nonparametric delayed feedback model for cvr prediction that represents the distribution of the time delay without assuming a parametric distribution such as an exponential or weibull distribution because the distribution of the time delay is modeled depending on the content of an ad and the features of a user various shapes of the distribution can be represented potentially in experiments we show that the proposed model can capture the distribution for the time delay on a synthetic dataset even when the distribution is complicated moreover on a real dataset we show that the proposed model outperforms the existing method that assumes an exponential distribution for the time delay in terms of conversion rate prediction | [['predicting', 'conversion', 'rates', 'cvrs', 'in', 'display', 'advertising', 'eg', 'predicting', 'the', 'proportion', 'of', 'users', 'who', 'purchase', 'an', 'item', 'ie', 'a', 'conversion', 'after', 'its', 'corresponding', 'ad', 'is', 'clicked', 'is', 'important', 'when', 'measuring', 'the', 'effects', 'of', 'ads', 'shown', 'to', 'users', 'and', 'to', 'understanding', 'the', 'interests', 'of', 'the', 'users', 'there', 'is', 'generally', 'a', 'time', 'delay', 'ie', 'socalled', 'it', 'delayed', 'feedback', 'between', 'the', 'ad', 'click', 'and', 'conversion', 'owing', 'to', 'the', 'delayed', 'feedback', 'samples', 'that', 'are', 'converted', 'after', 'an', 'observation', 'period', 'may', 'be', 'treated', 'as', 'negative', 'to', 'overcome', 'this', 'drawback', 'cvr', 'prediction', 'assuming', 'that', 'the', 'time', 'delay', 'follows', 'an', 'exponential', 'distribution', 'has', 'been', 'proposed', 'in', 'practice', 'however', 'there', 'is', 'no', 'guarantee', 'that', 'the', 'delay', 'is', 'generated', 'from', 'the', 'exponential', 'distribution', 'and', 'the', 'best', 'distribution', 'with', 'which', 'to', 'represent', 'the', 'delay', 'depends', 'on', 'the', 'data', 'in', 'this', 'paper', 'we', 'propose', 'a', 'nonparametric', 'delayed', 'feedback', 'model', 'for', 'cvr', 'prediction', 'that', 'represents', 'the', 'distribution', 'of', 'the', 'time', 'delay', 'without', 'assuming', 'a', 'parametric', 'distribution', 'such', 'as', 'an', 'exponential', 'or', 'weibull', 'distribution', 'because', 'the', 'distribution', 'of', 'the', 'time', 'delay', 'is', 'modeled', 'depending', 'on', 'the', 'content', 'of', 'an', 'ad', 'and', 'the', 'features', 'of', 'a', 'user', 'various', 'shapes', 'of', 'the', 'distribution', 'can', 'be', 'represented', 'potentially', 'in', 'experiments', 'we', 'show', 'that', 'the', 'proposed', 'model', 'can', 'capture', 'the', 'distribution', 'for', 'the', 'time', 'delay', 'on', 'a', 'synthetic', 'dataset', 'even', 'when', 'the', 'distribution', 'is', 'complicated', 'moreover', 'on', 'a', 'real', 'dataset', 'we', 'show', 'that', 'the', 'proposed', 'model', 'outperforms', 'the', 'existing', 'method', 'that', 'assumes', 'an', 'exponential', 'distribution', 'for', 'the', 'time', 'delay', 'in', 'terms', 'of', 'conversion', 'rate', 'prediction']] | [-0.10384179269397376, 0.06160433831727489, -0.09082719088332998, 0.0737268775368237, -0.07565950821416693, -0.13719262025457987, 0.07226254608559107, 0.40690477174000755, -0.2640081794978018, -0.3293047062602014, 0.09134112088572839, -0.2789695868062066, -0.13307487391472433, 0.19911835347950052, -0.0933051949434171, 0.02500255009316231, 0.0511549518125849, 0.08448235770770078, -0.028156921641634507, -0.2512880242251295, 0.29530393843109076, 0.0999173364694035, 0.3240593375324557, 0.024566284534821826, 0.10502025472317567, -0.004445575847996459, -0.05012464721420979, -0.016498252380246884, -0.05255809391966919, 0.05924776678476783, 0.2181712161193812, 0.17802651187699783, 0.29610001865113456, -0.41475398142281317, -0.2506024723682663, 0.15664820418403966, 0.13818395554834192, 0.07361591933248189, -0.0808061072771858, -0.25842516523909814, 0.08112290360206258, -0.18305078326656873, -0.05673007703679163, -0.004490546072408888, 0.040616240786133156, 0.03920410658780647, -0.33057782318510653, 0.07022140792011464, 0.05199527841684739, -0.013170441041467947, -0.05355928882706775, -0.06102110197084145, -0.012227583229222575, 0.16429283595930283, 0.08643252951338992, -0.010392317358749889, 0.09608667555374033, -0.16425157567080592, -0.10843307067426072, 0.39905266922259247, -0.07275417495252294, -0.19552242675901302, 0.1351374386417334, -0.10803052376122063, -0.06579358673526815, 0.1284864054694246, 0.20183435709059855, 0.10828236367219247, -0.1486201934886565, 0.00745284320850436, -0.03554260939915454, 0.22399982582822803, 0.0583805798735064, 0.002814753837752036, 0.15516276560318207, 0.19571500718255616, 0.05630419725709925, 0.0958047854148918, -0.09140811604823196, -0.11928793266528256, -0.2619516703698243, -0.1383484913040452, -0.20048326266659122, 0.0540676066405966, -0.09837350126279841, -0.1488395650393936, 0.3995728419320057, 0.14404967077866931, 0.22888835997606116, 0.09374800372320498, 0.3034125916479576, 0.17790373392128986, 0.056686177952865215, 0.07765657778473987, 0.2027446835681105, 0.00518793413709406, 0.10209280294610278, -0.21637795660400674, 0.20333929554251354, -0.023756396189715052] |
1,802.00256 | Imaginaries, invariant types and pseudo p-adically closed fields | In this paper, we give a very general criterion for elimination of
imaginaries using an abstract independent relation. We also study germs of
definable functions at certain well-behaved invariant types. Finally we apply
these tools to the elimination of imaginaries in bounded pseudo-p-adically
closed fields.
| math.LO | in this paper we give a very general criterion for elimination of imaginaries using an abstract independent relation we also study germs of definable functions at certain wellbehaved invariant types finally we apply these tools to the elimination of imaginaries in bounded pseudopadically closed fields | [['in', 'this', 'paper', 'we', 'give', 'a', 'very', 'general', 'criterion', 'for', 'elimination', 'of', 'imaginaries', 'using', 'an', 'abstract', 'independent', 'relation', 'we', 'also', 'study', 'germs', 'of', 'definable', 'functions', 'at', 'certain', 'wellbehaved', 'invariant', 'types', 'finally', 'we', 'apply', 'these', 'tools', 'to', 'the', 'elimination', 'of', 'imaginaries', 'in', 'bounded', 'pseudopadically', 'closed', 'fields']] | [-0.14787505016746846, 0.0759365934252194, -0.13182106200309301, 0.14895597945591857, -0.12757629638707096, -0.08709351808383045, 0.05448443428031169, 0.35508684729310597, -0.31720978529615834, -0.1855396620019085, 0.07059526708590882, -0.17513863714835184, -0.17628005950246006, 0.19102774382653562, -0.13693539100296964, 0.024111682845448904, 0.0007589842954819852, 0.060551655309444126, -0.10239203364207325, -0.3062916877467863, 0.4442351841452447, -0.0664357232268561, 0.20202278191308407, 0.09805253632789986, 0.1135656132191798, 0.045489825763400986, -0.04392756078265269, 0.06701060782440683, -0.22240471220786937, 0.11742359455886552, 0.33113796007290314, 0.16607644660408286, 0.2594633942723952, -0.4129467454146255, -0.09956634820396588, 0.16080528940074146, 0.1313100980425423, 0.11640637480145828, -0.026104297827590595, -0.25002146571535955, 0.1413677539888092, -0.15248869452625513, -0.1959271507168358, -0.16625477160612884, 0.010978469773280349, 0.01988278354242952, -0.2561056330927055, 0.021209446030049796, 0.17835003363275478, 0.1966752935073931, -0.08829268343238668, -0.024437891025710003, 0.07280916556588966, 0.05259123304858804, -0.03965888379819014, 0.015425692391793498, 0.08643395630431107, -0.05876598671734841, -0.11985360593958334, 0.29878019403920253, -0.10127261967467018, -0.251412813805721, 0.20897332011637362, -0.09752432407218624, -0.24684409026733853, 0.08227622060274536, 0.1388457906855778, 0.2166914713399654, -0.1473985795481977, 0.14982197643257678, -0.0869299340146509, 0.08196047240529548, 0.17184889547272839, 0.0640218780886657, 0.10898888178847053, 0.050931639186191285, 0.06666832518848506, 0.2283529860539023, 0.06169332974505695, -0.034120941016061064, -0.4268794047900222, -0.13731488369574602, -0.027204368348148735, 0.055550999008119106, -0.08134908832355657, -0.27357311885465274, 0.4000833575529131, 0.15979761267821727, 0.12501578147269107, 0.1683364431373775, 0.2608588188039986, 0.12293225154280663, 0.03344444742172279, 0.06450691342946481, 0.13269984705204313, 0.19968056249093602, -0.027252321237359534, -0.10217661191497675, 0.007343340464020995, 0.09175066701870739] |
1,802.00257 | Individual Resource Games and Resource Redistributions | We introduce a class of resource games where resources and preferences are
specified with the language of a resource-sensitive logic. The agents are
endowed with a bag of resources and try to achieve a resource objective. For
each agent, an action consists in making available a part of their endowed
resources. All the resources made available can be used towards the agents'
objectives. We study three decision problems, the first of which is deciding
whether an action profile is a Nash equilibrium: when all the agents have
chosen an action, it is a Nash Equilibrium if no agent has an incentive to
change their action unilaterally. When dealing with resources, interesting
questions arise as to whether some equilibria can be eliminated or constructed
by a central authority by redistributing the available resources among the
agents. In our economies, division of property in divorce law exemplifies how a
central authority can redistribute the resources of individuals and why they
would desire to do so. We thus study two related decision problems: (i)
rational elimination: given an action profile's outcome, can the endowed
resources be redistributed so that it is not the outcome of a Nash equilibrium?
(ii) Rational construction: given an action profile's outcome, can the endowed
resources be redistributed so that it is the outcome of a Nash equilibrium?
Among other results, we prove that all three problems are PSPACE-complete when
the resources are described in the very expressive language of the
propositional multiplicative and additive linear logic. We also identify a new
modest fragment of linear logic that we call MULT, suitable to represent
multisets and reason about the inclusion and equality of bags of resources. We
show that when the resources are described in MULT, the problem of deciding
whether a profile is a Nash equilibrium is in PTIME.
| cs.GT | we introduce a class of resource games where resources and preferences are specified with the language of a resourcesensitive logic the agents are endowed with a bag of resources and try to achieve a resource objective for each agent an action consists in making available a part of their endowed resources all the resources made available can be used towards the agents objectives we study three decision problems the first of which is deciding whether an action profile is a nash equilibrium when all the agents have chosen an action it is a nash equilibrium if no agent has an incentive to change their action unilaterally when dealing with resources interesting questions arise as to whether some equilibria can be eliminated or constructed by a central authority by redistributing the available resources among the agents in our economies division of property in divorce law exemplifies how a central authority can redistribute the resources of individuals and why they would desire to do so we thus study two related decision problems i rational elimination given an action profiles outcome can the endowed resources be redistributed so that it is not the outcome of a nash equilibrium ii rational construction given an action profiles outcome can the endowed resources be redistributed so that it is the outcome of a nash equilibrium among other results we prove that all three problems are pspacecomplete when the resources are described in the very expressive language of the propositional multiplicative and additive linear logic we also identify a new modest fragment of linear logic that we call mult suitable to represent multisets and reason about the inclusion and equality of bags of resources we show that when the resources are described in mult the problem of deciding whether a profile is a nash equilibrium is in ptime | [['we', 'introduce', 'a', 'class', 'of', 'resource', 'games', 'where', 'resources', 'and', 'preferences', 'are', 'specified', 'with', 'the', 'language', 'of', 'a', 'resourcesensitive', 'logic', 'the', 'agents', 'are', 'endowed', 'with', 'a', 'bag', 'of', 'resources', 'and', 'try', 'to', 'achieve', 'a', 'resource', 'objective', 'for', 'each', 'agent', 'an', 'action', 'consists', 'in', 'making', 'available', 'a', 'part', 'of', 'their', 'endowed', 'resources', 'all', 'the', 'resources', 'made', 'available', 'can', 'be', 'used', 'towards', 'the', 'agents', 'objectives', 'we', 'study', 'three', 'decision', 'problems', 'the', 'first', 'of', 'which', 'is', 'deciding', 'whether', 'an', 'action', 'profile', 'is', 'a', 'nash', 'equilibrium', 'when', 'all', 'the', 'agents', 'have', 'chosen', 'an', 'action', 'it', 'is', 'a', 'nash', 'equilibrium', 'if', 'no', 'agent', 'has', 'an', 'incentive', 'to', 'change', 'their', 'action', 'unilaterally', 'when', 'dealing', 'with', 'resources', 'interesting', 'questions', 'arise', 'as', 'to', 'whether', 'some', 'equilibria', 'can', 'be', 'eliminated', 'or', 'constructed', 'by', 'a', 'central', 'authority', 'by', 'redistributing', 'the', 'available', 'resources', 'among', 'the', 'agents', 'in', 'our', 'economies', 'division', 'of', 'property', 'in', 'divorce', 'law', 'exemplifies', 'how', 'a', 'central', 'authority', 'can', 'redistribute', 'the', 'resources', 'of', 'individuals', 'and', 'why', 'they', 'would', 'desire', 'to', 'do', 'so', 'we', 'thus', 'study', 'two', 'related', 'decision', 'problems', 'i', 'rational', 'elimination', 'given', 'an', 'action', 'profiles', 'outcome', 'can', 'the', 'endowed', 'resources', 'be', 'redistributed', 'so', 'that', 'it', 'is', 'not', 'the', 'outcome', 'of', 'a', 'nash', 'equilibrium', 'ii', 'rational', 'construction', 'given', 'an', 'action', 'profiles', 'outcome', 'can', 'the', 'endowed', 'resources', 'be', 'redistributed', 'so', 'that', 'it', 'is', 'the', 'outcome', 'of', 'a', 'nash', 'equilibrium', 'among', 'other', 'results', 'we', 'prove', 'that', 'all', 'three', 'problems', 'are', 'pspacecomplete', 'when', 'the', 'resources', 'are', 'described', 'in', 'the', 'very', 'expressive', 'language', 'of', 'the', 'propositional', 'multiplicative', 'and', 'additive', 'linear', 'logic', 'we', 'also', 'identify', 'a', 'new', 'modest', 'fragment', 'of', 'linear', 'logic', 'that', 'we', 'call', 'mult', 'suitable', 'to', 'represent', 'multisets', 'and', 'reason', 'about', 'the', 'inclusion', 'and', 'equality', 'of', 'bags', 'of', 'resources', 'we', 'show', 'that', 'when', 'the', 'resources', 'are', 'described', 'in', 'mult', 'the', 'problem', 'of', 'deciding', 'whether', 'a', 'profile', 'is', 'a', 'nash', 'equilibrium', 'is', 'in', 'ptime']] | [-0.13351006055578737, 0.09234519341936957, -0.10901304705442082, 0.10021100973863575, -0.13251667379082932, -0.19358026224538138, 0.0822585948056037, 0.4059497528273204, -0.3262597489328529, -0.28796747804192385, 0.08998955154027233, -0.2699154398637666, -0.10395425161814001, 0.1086567898796859, -0.13431941067463177, -0.0044851862760477285, 0.06758815237163161, 0.0829322697761843, 0.041468872979168854, -0.29191785889864896, 0.33761807501105673, 0.034154292110561014, 0.23344499712958436, 0.029573792863101158, 0.08048847412916389, -0.03378738237829551, 0.011899380273250647, 0.08519171458511209, -0.083033884071616, 0.11255394621362347, 0.3503782059440383, 0.2341407770654527, 0.37236043074372477, -0.43135556241379824, -0.13718594570342138, 0.16845389721649034, 0.09158598317337714, 0.07472336463099562, 0.0008380626524764537, -0.23526158321345614, 0.06936294788322984, -0.2077908714269396, -0.10725691127343308, -0.08474831428592312, 0.025159092220876898, 0.02869110809564838, -0.2847852520946339, -0.04034037760815094, 0.08411248195050068, 0.06437235112933201, -0.08861844461454554, -0.08378145405311026, -0.036918744948411054, 0.16748705568226005, -0.001783360497394818, -0.014860526441814582, 0.1490982006848527, -0.1677615014508218, -0.17243514998245094, 0.4214783598084089, -0.015445833123038427, -0.23300254534608206, 0.17161765163671536, -0.07580801251768274, -0.14751214797622478, 0.07596384122367465, 0.12148829096575511, 0.1283465441626211, -0.16298605716169234, 0.06963128446369468, -0.08488085672748198, 0.21252898783252833, 0.06442552029721414, 0.02133063824833417, 0.20754492520184514, 0.12492106010382407, 0.1284473689313223, 0.13938671120993973, 0.05051694391140609, -0.14402923839819615, -0.2768753556506801, -0.1404645977306073, -0.15480338352836495, 0.04730035991341601, -0.05131034031821696, -0.13827162312244706, 0.3347806932522213, 0.12419880568158141, 0.13128496750035135, 0.09722329524115186, 0.27298306183351134, 0.10855993176145214, 0.06111059265607269, 0.12607753648735162, 0.17441470325938765, 0.048035991496864425, 0.0681801373634079, -0.19815202178514757, 0.1424861318150232, 0.014797805733452752] |
1,802.00258 | Finite volume effects with stationary wave solution from
Nambu--Jona-Lasinio model | In this paper, we use the two-flavor Nambu-Jona-Lasinio (NJL) model with the
proper time regularization to study the finite-volume effects of QCD chiral
phase transition.
Within a cubic volume of finite size $L$, we choose the stationary wave
condition (SWC) as the real physical spatial boundary conditions of quark
fields and compare our results with that by means of commonly used
(anti-)period boundary condition (APBC or PBC). It is found that the results by
means of SWC are obviously different to the results from the APBC or PBC.
Although the three boundary conditions give the same chiral crossover
transition curve in the infinite volume limit, the limit size $L_0$ (when
$L\geq L_{0}$, the chiral quark condensate $-\left\langle { \bar \psi \psi}
\right\rangle_L$ is indistinguishable from that at $L=\infty$) using SWC is
$L_0\approx 500$ fm which is much larger than the results obtained using APBC
or PBC. More importantly, $L_0\approx 500$ fm is also much large than the
typical size of the quark-gluon plasma produced by the relativistic heavy ion
collisions. This means that the finite volume effects play a very important
role in Relativistic Heavy Ion Collisions. In addition, we also found that when
$L\leq 2$ fm, even at zero temperature the chiral symmetry is effectively
restored. Furthermore, to quantitatively reflect the finite volume effects on
the QCD chiral phase transition, we introduce a new vacuum susceptibility,
$\chi_{1/L}(T)=-\frac{\partial \left\langle { \bar \psi \psi}
\right\rangle}{\partial (1/L)}$. With this new vacuum susceptibility, it is
very interesting to find $\chi_{1/L}(T=0)=\chi_{1/L}(T=1/L)$ for SWC.
| hep-ph | in this paper we use the twoflavor nambujonalasinio njl model with the proper time regularization to study the finitevolume effects of qcd chiral phase transition within a cubic volume of finite size l we choose the stationary wave condition swc as the real physical spatial boundary conditions of quark fields and compare our results with that by means of commonly used antiperiod boundary condition apbc or pbc it is found that the results by means of swc are obviously different to the results from the apbc or pbc although the three boundary conditions give the same chiral crossover transition curve in the infinite volume limit the limit size l_0 when lgeq l_0 the chiral quark condensate leftlangle bar psi psi rightrangle_l is indistinguishable from that at linfty using swc is l_0approx 500 fm which is much larger than the results obtained using apbc or pbc more importantly l_0approx 500 fm is also much large than the typical size of the quarkgluon plasma produced by the relativistic heavy ion collisions this means that the finite volume effects play a very important role in relativistic heavy ion collisions in addition we also found that when lleq 2 fm even at zero temperature the chiral symmetry is effectively restored furthermore to quantitatively reflect the finite volume effects on the qcd chiral phase transition we introduce a new vacuum susceptibility chi_1ltfracpartial leftlangle bar psi psi rightranglepartial 1l with this new vacuum susceptibility it is very interesting to find chi_1lt0chi_1lt1l for swc | [['in', 'this', 'paper', 'we', 'use', 'the', 'twoflavor', 'nambujonalasinio', 'njl', 'model', 'with', 'the', 'proper', 'time', 'regularization', 'to', 'study', 'the', 'finitevolume', 'effects', 'of', 'qcd', 'chiral', 'phase', 'transition', 'within', 'a', 'cubic', 'volume', 'of', 'finite', 'size', 'l', 'we', 'choose', 'the', 'stationary', 'wave', 'condition', 'swc', 'as', 'the', 'real', 'physical', 'spatial', 'boundary', 'conditions', 'of', 'quark', 'fields', 'and', 'compare', 'our', 'results', 'with', 'that', 'by', 'means', 'of', 'commonly', 'used', 'antiperiod', 'boundary', 'condition', 'apbc', 'or', 'pbc', 'it', 'is', 'found', 'that', 'the', 'results', 'by', 'means', 'of', 'swc', 'are', 'obviously', 'different', 'to', 'the', 'results', 'from', 'the', 'apbc', 'or', 'pbc', 'although', 'the', 'three', 'boundary', 'conditions', 'give', 'the', 'same', 'chiral', 'crossover', 'transition', 'curve', 'in', 'the', 'infinite', 'volume', 'limit', 'the', 'limit', 'size', 'l_0', 'when', 'lgeq', 'l_0', 'the', 'chiral', 'quark', 'condensate', 'leftlangle', 'bar', 'psi', 'psi', 'rightrangle_l', 'is', 'indistinguishable', 'from', 'that', 'at', 'linfty', 'using', 'swc', 'is', 'l_0approx', '500', 'fm', 'which', 'is', 'much', 'larger', 'than', 'the', 'results', 'obtained', 'using', 'apbc', 'or', 'pbc', 'more', 'importantly', 'l_0approx', '500', 'fm', 'is', 'also', 'much', 'large', 'than', 'the', 'typical', 'size', 'of', 'the', 'quarkgluon', 'plasma', 'produced', 'by', 'the', 'relativistic', 'heavy', 'ion', 'collisions', 'this', 'means', 'that', 'the', 'finite', 'volume', 'effects', 'play', 'a', 'very', 'important', 'role', 'in', 'relativistic', 'heavy', 'ion', 'collisions', 'in', 'addition', 'we', 'also', 'found', 'that', 'when', 'lleq', '2', 'fm', 'even', 'at', 'zero', 'temperature', 'the', 'chiral', 'symmetry', 'is', 'effectively', 'restored', 'furthermore', 'to', 'quantitatively', 'reflect', 'the', 'finite', 'volume', 'effects', 'on', 'the', 'qcd', 'chiral', 'phase', 'transition', 'we', 'introduce', 'a', 'new', 'vacuum', 'susceptibility', 'chi_1ltfracpartial', 'leftlangle', 'bar', 'psi', 'psi', 'rightranglepartial', '1l', 'with', 'this', 'new', 'vacuum', 'susceptibility', 'it', 'is', 'very', 'interesting', 'to', 'find', 'chi_1lt0chi_1lt1l', 'for', 'swc']] | [-0.10658388835278552, 0.25771189636240405, -0.11356900655664504, 0.08570057900700097, -0.036485760303912686, -0.12063496100793904, 0.005560892273691328, 0.34724059596968193, -0.19810032780709055, -0.21734151199828677, 0.07918976549941968, -0.2889824857857699, -0.06131884770366014, 0.11220898758814049, 0.025556533324803846, 0.05766363709432577, 0.018933666740000868, 0.06184537546165909, -0.10477192193933055, -0.20809450603458876, 0.33541443668170057, -0.009697921201586723, 0.26739782593601075, 0.1250755273324709, 0.04158020957838744, -0.026545399295476575, 0.06072075810952811, 0.030639328353572637, -0.15177494658270613, -0.006347652037463073, 0.19561566903964073, -0.005860783570581892, 0.2001729022420477, -0.39898789166472853, -0.19377971398547136, 0.08915038315559892, 0.12579880281797765, 0.10929509013318844, -0.035389531098977994, -0.2682691649330081, 0.1376358467231815, -0.1594569892632232, -0.17571677443823622, -0.057643066459180166, 0.015081221930449829, -0.0502480205973067, -0.330338705109898, 0.11003362673000083, 0.023137466911915303, 0.07085208345670253, -0.0137135956203565, -0.16437948954602083, -0.043808775184637244, 0.058660039067278076, 0.0680997259230935, 0.09885392518190202, 0.1267853881091772, -0.11172762576995107, -0.03958322010391081, 0.42066784978378563, -0.06693310964001284, -0.17661236968124286, 0.16049852833384648, -0.18373745426457996, -0.09302283015761835, 0.12977552827699887, 0.12337250537239015, 0.10694767677729639, -0.1349845754881244, 0.07483185268235198, -0.048283506059124195, 0.17855162344558267, 0.09650817395013292, 0.04351632369604583, 0.16005498415446104, 0.1542326902684484, 0.03529007458128035, 0.15270510289228695, -0.06759989994073597, -0.09773888282167414, -0.35976960401749236, -0.08658649321102227, -0.18295779313193633, 0.0470801968824162, -0.1383546312576679, -0.15709128461312502, 0.33329406461368005, 0.1590605927456636, 0.20114503474129986, 0.016796790370426605, 0.27633361356371705, 0.12059973674501331, 0.08269659199965342, 0.08922549182995378, 0.22245499849086628, 0.1337697225768352, 0.12076607199657398, -0.2948742541416626, -0.0010639429247627655, 0.0845191930187866] |
1,802.00259 | Anomaly Detection in Log Data using Graph Databases and Machine Learning
to Defend Advanced Persistent Threats | Advanced Persistent Threats (APTs) are a main impendence in cyber security of
computer networks. In 2015, a successful breach remains undetected 146 days on
average, reported by [Fi16].With our work we demonstrate a feasible and fast
way to analyse real world log data to detect breaches or breach attempts. By
adapting well-known kill chain mechanisms and a combine of a time series
database and an abstracted graph approach, it is possible to create flexible
attack profiles. Using this approach, it can be demonstrated that the graph
analysis successfully detects simulated attacks by analysing the log data of a
simulated computer network. Considering another source for log data, the
framework is capable to deliver sufficient performance for analysing real-world
data in short time. By using the computing power of the graph database it is
possible to identify the attacker and furthermore it is feasible to detect
other affected system components. We believe to significantly reduce the
detection time of breaches with this approach and react fast to new attack
vectors.
| cs.DB cs.CR | advanced persistent threats apts are a main impendence in cyber security of computer networks in 2015 a successful breach remains undetected 146 days on average reported by fi16with our work we demonstrate a feasible and fast way to analyse real world log data to detect breaches or breach attempts by adapting wellknown kill chain mechanisms and a combine of a time series database and an abstracted graph approach it is possible to create flexible attack profiles using this approach it can be demonstrated that the graph analysis successfully detects simulated attacks by analysing the log data of a simulated computer network considering another source for log data the framework is capable to deliver sufficient performance for analysing realworld data in short time by using the computing power of the graph database it is possible to identify the attacker and furthermore it is feasible to detect other affected system components we believe to significantly reduce the detection time of breaches with this approach and react fast to new attack vectors | [['advanced', 'persistent', 'threats', 'apts', 'are', 'a', 'main', 'impendence', 'in', 'cyber', 'security', 'of', 'computer', 'networks', 'in', '2015', 'a', 'successful', 'breach', 'remains', 'undetected', '146', 'days', 'on', 'average', 'reported', 'by', 'fi16with', 'our', 'work', 'we', 'demonstrate', 'a', 'feasible', 'and', 'fast', 'way', 'to', 'analyse', 'real', 'world', 'log', 'data', 'to', 'detect', 'breaches', 'or', 'breach', 'attempts', 'by', 'adapting', 'wellknown', 'kill', 'chain', 'mechanisms', 'and', 'a', 'combine', 'of', 'a', 'time', 'series', 'database', 'and', 'an', 'abstracted', 'graph', 'approach', 'it', 'is', 'possible', 'to', 'create', 'flexible', 'attack', 'profiles', 'using', 'this', 'approach', 'it', 'can', 'be', 'demonstrated', 'that', 'the', 'graph', 'analysis', 'successfully', 'detects', 'simulated', 'attacks', 'by', 'analysing', 'the', 'log', 'data', 'of', 'a', 'simulated', 'computer', 'network', 'considering', 'another', 'source', 'for', 'log', 'data', 'the', 'framework', 'is', 'capable', 'to', 'deliver', 'sufficient', 'performance', 'for', 'analysing', 'realworld', 'data', 'in', 'short', 'time', 'by', 'using', 'the', 'computing', 'power', 'of', 'the', 'graph', 'database', 'it', 'is', 'possible', 'to', 'identify', 'the', 'attacker', 'and', 'furthermore', 'it', 'is', 'feasible', 'to', 'detect', 'other', 'affected', 'system', 'components', 'we', 'believe', 'to', 'significantly', 'reduce', 'the', 'detection', 'time', 'of', 'breaches', 'with', 'this', 'approach', 'and', 'react', 'fast', 'to', 'new', 'attack', 'vectors']] | [-0.12655648944789955, 0.006280871235763438, -0.08483448857718724, 0.08081919890329507, -0.08612531153596051, -0.20312732034342065, 0.09174163026979104, 0.36904095836992684, -0.26398590967125657, -0.3787782814220658, 0.12746524356286196, -0.29629261444677557, -0.161823144368273, 0.23261360270996756, -0.12152643556362905, 0.0727698813425377, 0.07938307856619801, 0.00022535324179833488, 0.03699338812328365, -0.2891998850278642, 0.2769264187719229, 0.07498787474330693, 0.3012171157599715, 0.0332723487711822, 0.07755728977194633, -0.00758906085615135, -0.068598242845924, -0.004127438183613343, -0.059154107907748506, 0.11198371208350484, 0.31006249966421384, 0.23668801297788464, 0.26790969511715784, -0.4346744171343744, -0.21217613936113638, 0.11149252136826926, 0.11445609757356578, 0.12148037498229228, -0.025262382040160618, -0.33268564015937346, 0.13486041461112022, -0.19732831330232634, -0.1275119307614486, -0.13088580531655766, 0.05298616872390821, -0.02204024942503089, -0.22679944672355695, 0.0057497104890422805, 0.011389023596642628, 0.039825983838887795, 0.01080962065801335, -0.019068857668095178, 0.008617183109024717, 0.13893651825769449, 0.03614606304715077, 0.03157055234138776, 0.16328211288366998, -0.08430490346342724, -0.13621715201865991, 0.34454664801956997, -0.04310629449069633, -0.10917879823440065, 0.17874941295650343, -0.028843876079744882, -0.163783798839653, 0.14097753950738393, 0.22357956067259824, 0.10882548425988284, -0.18006712396717853, 0.00020378938608614372, -0.00010683024412996712, 0.21528232259221286, 0.04818269481585871, -0.0334883323244174, 0.1518206241765126, 0.2118493788653896, 0.06168462777432502, 0.13814291448874255, -0.11624691790452094, -0.06565000824256069, -0.20803689195669167, -0.129192408044695, -0.19121043827839285, 0.016042969231854103, -0.04314317431678882, -0.11057277916309734, 0.3956026422134268, 0.23609765851091152, 0.19044225053845107, 0.059506852684232094, 0.37984916663152124, 0.048203034283817815, 0.10038087797805756, 0.11955575885007247, 0.18000611607151637, 0.013197586058162241, 0.11250952848266545, -0.15973931292371293, 0.13695824442714052, -0.05452725586170951] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.