id
float64 706
1.8k
| title
stringlengths 1
343
| abstract
stringlengths 6
6.09k
| categories
stringlengths 5
125
| processed_abstract
stringlengths 2
5.96k
| tokenized_abstract
stringlengths 8
8.74k
| centroid
stringlengths 2.1k
2.17k
|
|---|---|---|---|---|---|---|
1,803.04067
|
Valley-selective exciton bistability in a suspended monolayer
semiconductor
|
We demonstrate robust power- and wavelength-dependent optical bistability in
fully suspended monolayers of WSe2 near the exciton resonance. Bistability has
been achieved under continuous-wave optical excitation at an intensity level of
10^3 W/cm^2. The observed bistability is originated from a photo-thermal
mechanism, which provides both optical nonlinearity and passive feedback, two
essential elements for optical bistability. Under a finite magnetic field, the
exciton bistability becomes helicity dependent, which enables repeatable
switching of light purely by its polarization.
|
cond-mat.mes-hall
|
we demonstrate robust power and wavelengthdependent optical bistability in fully suspended monolayers of wse2 near the exciton resonance bistability has been achieved under continuouswave optical excitation at an intensity level of 103 wcm2 the observed bistability is originated from a photothermal mechanism which provides both optical nonlinearity and passive feedback two essential elements for optical bistability under a finite magnetic field the exciton bistability becomes helicity dependent which enables repeatable switching of light purely by its polarization
|
[['we', 'demonstrate', 'robust', 'power', 'and', 'wavelengthdependent', 'optical', 'bistability', 'in', 'fully', 'suspended', 'monolayers', 'of', 'wse2', 'near', 'the', 'exciton', 'resonance', 'bistability', 'has', 'been', 'achieved', 'under', 'continuouswave', 'optical', 'excitation', 'at', 'an', 'intensity', 'level', 'of', '103', 'wcm2', 'the', 'observed', 'bistability', 'is', 'originated', 'from', 'a', 'photothermal', 'mechanism', 'which', 'provides', 'both', 'optical', 'nonlinearity', 'and', 'passive', 'feedback', 'two', 'essential', 'elements', 'for', 'optical', 'bistability', 'under', 'a', 'finite', 'magnetic', 'field', 'the', 'exciton', 'bistability', 'becomes', 'helicity', 'dependent', 'which', 'enables', 'repeatable', 'switching', 'of', 'light', 'purely', 'by', 'its', 'polarization']]
|
[-0.18199889183455667, 0.21914328950591078, -0.03889269544440624, -0.01597447844990227, -0.019407321324015594, -0.1944654833876177, 0.07052353378264355, 0.5033846291435229, -0.2418340855798164, -0.21805781908575203, -0.009727788129035238, -0.20607686876137923, -0.16375300481721952, 0.25308735928703824, 0.0030450208668971993, 0.043141307447607594, -0.04160235588462999, -0.09966155346301565, 0.08582919877470023, -0.08913348549855994, 0.22758759400964557, 0.008718056047891642, 0.3684096179521558, 0.08862414467904427, 0.15874484869010455, -0.04588587576970942, 0.09455687578090212, -0.066447183335587, -0.08380085715643046, 0.05593003696072605, 0.22118994564592065, -0.07396721222147636, 0.2591057400908563, -0.45381797746114144, -0.235939060626612, 0.07349376430033476, 0.1608895342071335, 0.1809023286657432, -0.10449788800452824, -0.2438702383501963, 0.00797318359957887, -0.10201648096614457, -0.09841183526441455, -0.0747765168644391, 0.0419014614187302, -0.003522222456910652, -0.32239475229440573, 0.07124440737262175, 0.04128300136729301, 0.1301154577681287, -0.0981161412556184, -0.02825434626210118, -0.1127638765308377, 0.04702896515872063, -0.05884570327539045, -0.0010313809491760498, 0.2516281580999977, -0.16676034788939764, -0.12246327278167977, 0.34264903006373676, -0.12323317430042602, -0.04289620999525023, 0.12734776494008573, -0.20855902094400017, 0.028194260171179163, 0.2629711647675215, 0.13757554641864322, 0.09595596633077443, -0.11618804277900557, 0.008046075388752892, 0.009295126278098528, 0.25322227666227076, 0.09743768473869407, 0.16300326491427886, 0.25815405377319883, 0.2300532056962128, 0.03659298416686716, 0.13452563921062202, -0.13751178898836497, -0.027724312787706203, -0.2181279900084649, -0.05095899437687227, -0.1268949009683709, 0.13004216984180467, -0.09024428862242283, -0.13621166468198811, 0.4555336431382442, 0.11211740732338134, 0.13045467298580696, -0.025799623418405845, 0.354777709472102, 0.19124662111718932, 0.0531671981738469, -0.022865234469003105, 0.4153705276246485, 0.20529063163603378, 0.1491069153870468, -0.33074969927744047, 0.05843480403063359, -0.07186041053311971]
|
1,803.04068
|
Performance Analysis of Decision Directed Maximum Likelihood MIMO
Channel Tracking Algorithm
|
In this paper, the performance of decision directed (DD) maximum likelihood
(ML) channel tracking algorithm is analyzed. The ML channel tracking algorithm
presents efficient performance especially in the decision directed mode of the
operation. In this paper, after introducing the method for analysis of DD
algorithms, the performance of ML Multiple-Input Multiple-Output (MIMO) channel
tracking algorithm in the DD mode of operation is analyzed. In this method
channel tracking error is evaluated for given decision error rate. Then, the
decision error rate is approximated for given channel tracking error. By
solving these two derived equations jointly, both the decision error rate and
the channel tracking error are computed. The presented analysis is compared
with simulation results for different channel ranks, Doppler frequency shifts,
and SNRs, and it is shown that the analysis is a good match for simulation
results especially in high rank MIMO channels and high Doppler shifts.
|
eess.SP
|
in this paper the performance of decision directed dd maximum likelihood ml channel tracking algorithm is analyzed the ml channel tracking algorithm presents efficient performance especially in the decision directed mode of the operation in this paper after introducing the method for analysis of dd algorithms the performance of ml multipleinput multipleoutput mimo channel tracking algorithm in the dd mode of operation is analyzed in this method channel tracking error is evaluated for given decision error rate then the decision error rate is approximated for given channel tracking error by solving these two derived equations jointly both the decision error rate and the channel tracking error are computed the presented analysis is compared with simulation results for different channel ranks doppler frequency shifts and snrs and it is shown that the analysis is a good match for simulation results especially in high rank mimo channels and high doppler shifts
|
[['in', 'this', 'paper', 'the', 'performance', 'of', 'decision', 'directed', 'dd', 'maximum', 'likelihood', 'ml', 'channel', 'tracking', 'algorithm', 'is', 'analyzed', 'the', 'ml', 'channel', 'tracking', 'algorithm', 'presents', 'efficient', 'performance', 'especially', 'in', 'the', 'decision', 'directed', 'mode', 'of', 'the', 'operation', 'in', 'this', 'paper', 'after', 'introducing', 'the', 'method', 'for', 'analysis', 'of', 'dd', 'algorithms', 'the', 'performance', 'of', 'ml', 'multipleinput', 'multipleoutput', 'mimo', 'channel', 'tracking', 'algorithm', 'in', 'the', 'dd', 'mode', 'of', 'operation', 'is', 'analyzed', 'in', 'this', 'method', 'channel', 'tracking', 'error', 'is', 'evaluated', 'for', 'given', 'decision', 'error', 'rate', 'then', 'the', 'decision', 'error', 'rate', 'is', 'approximated', 'for', 'given', 'channel', 'tracking', 'error', 'by', 'solving', 'these', 'two', 'derived', 'equations', 'jointly', 'both', 'the', 'decision', 'error', 'rate', 'and', 'the', 'channel', 'tracking', 'error', 'are', 'computed', 'the', 'presented', 'analysis', 'is', 'compared', 'with', 'simulation', 'results', 'for', 'different', 'channel', 'ranks', 'doppler', 'frequency', 'shifts', 'and', 'snrs', 'and', 'it', 'is', 'shown', 'that', 'the', 'analysis', 'is', 'a', 'good', 'match', 'for', 'simulation', 'results', 'especially', 'in', 'high', 'rank', 'mimo', 'channels', 'and', 'high', 'doppler', 'shifts']]
|
[-0.19588547552726387, 0.01629199969250984, -0.04093027766168918, 0.05561075156442071, -0.002562181308440514, -0.23091053147956528, 0.07612016678462742, 0.4385571680813028, -0.24353964750548737, -0.2866159635939754, 0.1472376084983374, -0.2060021935905886, -0.15134413122205725, 0.21565795226035103, -0.10539340773509853, 0.1575252422375367, 0.17307509063124257, 0.057448822389288036, -0.06426749516422267, -0.26057526206710196, 0.2514449417491087, 0.14980840786741484, 0.3433079430177158, -0.029696116802101366, 0.09937053255349297, 0.05798518649558693, -0.06444027994903143, -0.03318990486355236, -0.11142578072426568, 0.06364092507380867, 0.3399622693107832, 0.19888554099359668, 0.2563930273512316, -0.28453780840707305, -0.202308282212373, 0.07360393866027812, 0.19178902871372341, 0.08412462093511083, -0.05723044887535124, -0.30149994291765175, 0.13842382883315518, -0.18613020698196137, 2.487445361099687e-05, 0.014977483160093726, -0.06622500130016007, 0.0031249499629757947, -0.3659116305331168, 0.09209152670020875, 0.026528372066783025, 0.06088799586982135, -0.04915575177139984, -0.1857588081763223, 0.06699453014567894, 0.13660248888081453, 0.03981534528683546, 0.019637785664440802, 0.11281991770003466, -0.12818469270445007, -0.13313221900830133, 0.31510523846685484, -0.0260016271006941, -0.25521982138923327, 0.13449140724799463, -0.08572953877870569, -0.0757279536255554, 0.21608127099180582, 0.2799776767680559, 0.08241797893346388, -0.1966905732031274, 0.012116191888403072, 0.03033856011852122, 0.16868332694847163, 0.04565924067587761, 0.047882183476807484, 0.09236907624583317, 0.2499850336368502, 0.07327707680629804, 0.11830942024283062, -0.16849048721022755, -0.10662981935295483, -0.22781216416932992, -0.15254022544187387, -0.18670079545016344, -0.07990058285618613, -0.11055478472973614, -0.09077490076806315, 0.3418299728323199, 0.15695267876660163, 0.11025314164916741, 0.1368063052916187, 0.389802575661432, 0.15937230948221265, 0.003274345307942205, 0.13807325039977744, 0.2616732716013446, 0.16935103587437447, 0.08756767095522892, -0.2730042003032645, 0.09791151471998567, 0.03590278500291025]
|
1,803.04069
|
Electromagnetic form factors of singly heavy baryons in the
self-consistent SU(3) chiral quark-soliton model
|
The self-consistent chiral quark-soliton model is a relativistic pion
mean-field approach in the large $N_c$ limit, which describes both light and
heavy baryons on an equal footing. In the limit of the infinitely heavy mass of
the heavy quark, a heavy baryon can be regarded as $N_c-1$ valence quarks bound
by the pion mean fields, leaving the heavy quark as a color static source. The
structure of the heavy baryon in this scheme is mainly governed by the
light-quark degrees of freedom. Based on this framework, we evaluate the
electromagnetic form factors of the lowest-lying heavy baryons. The rotational
$1/N_c$ and strange current quark mass corrections in linear order are
considered. We discuss the electric charge and magnetic densities of heavy
baryons in comparison with those of the nucleons. The results of the electric
charge radii of the positive-charged heavy baryons show explicitly that the
heavy baryon is a compact object. The electric form factors are presented. The
form factor of $\Sigma_c^{++}$ is compared with that from a lattice QCD. We
also discuss the results of the magnetic form factors. The magnetic moments of
the baryon sextet with spin 1/2 and the magnetic radii are compared with other
works and the lattice data.
|
hep-ph hep-ex hep-lat nucl-th
|
the selfconsistent chiral quarksoliton model is a relativistic pion meanfield approach in the large n_c limit which describes both light and heavy baryons on an equal footing in the limit of the infinitely heavy mass of the heavy quark a heavy baryon can be regarded as n_c1 valence quarks bound by the pion mean fields leaving the heavy quark as a color static source the structure of the heavy baryon in this scheme is mainly governed by the lightquark degrees of freedom based on this framework we evaluate the electromagnetic form factors of the lowestlying heavy baryons the rotational 1n_c and strange current quark mass corrections in linear order are considered we discuss the electric charge and magnetic densities of heavy baryons in comparison with those of the nucleons the results of the electric charge radii of the positivecharged heavy baryons show explicitly that the heavy baryon is a compact object the electric form factors are presented the form factor of sigma_c is compared with that from a lattice qcd we also discuss the results of the magnetic form factors the magnetic moments of the baryon sextet with spin 12 and the magnetic radii are compared with other works and the lattice data
|
[['the', 'selfconsistent', 'chiral', 'quarksoliton', 'model', 'is', 'a', 'relativistic', 'pion', 'meanfield', 'approach', 'in', 'the', 'large', 'n_c', 'limit', 'which', 'describes', 'both', 'light', 'and', 'heavy', 'baryons', 'on', 'an', 'equal', 'footing', 'in', 'the', 'limit', 'of', 'the', 'infinitely', 'heavy', 'mass', 'of', 'the', 'heavy', 'quark', 'a', 'heavy', 'baryon', 'can', 'be', 'regarded', 'as', 'n_c1', 'valence', 'quarks', 'bound', 'by', 'the', 'pion', 'mean', 'fields', 'leaving', 'the', 'heavy', 'quark', 'as', 'a', 'color', 'static', 'source', 'the', 'structure', 'of', 'the', 'heavy', 'baryon', 'in', 'this', 'scheme', 'is', 'mainly', 'governed', 'by', 'the', 'lightquark', 'degrees', 'of', 'freedom', 'based', 'on', 'this', 'framework', 'we', 'evaluate', 'the', 'electromagnetic', 'form', 'factors', 'of', 'the', 'lowestlying', 'heavy', 'baryons', 'the', 'rotational', '1n_c', 'and', 'strange', 'current', 'quark', 'mass', 'corrections', 'in', 'linear', 'order', 'are', 'considered', 'we', 'discuss', 'the', 'electric', 'charge', 'and', 'magnetic', 'densities', 'of', 'heavy', 'baryons', 'in', 'comparison', 'with', 'those', 'of', 'the', 'nucleons', 'the', 'results', 'of', 'the', 'electric', 'charge', 'radii', 'of', 'the', 'positivecharged', 'heavy', 'baryons', 'show', 'explicitly', 'that', 'the', 'heavy', 'baryon', 'is', 'a', 'compact', 'object', 'the', 'electric', 'form', 'factors', 'are', 'presented', 'the', 'form', 'factor', 'of', 'sigma_c', 'is', 'compared', 'with', 'that', 'from', 'a', 'lattice', 'qcd', 'we', 'also', 'discuss', 'the', 'results', 'of', 'the', 'magnetic', 'form', 'factors', 'the', 'magnetic', 'moments', 'of', 'the', 'baryon', 'sextet', 'with', 'spin', '12', 'and', 'the', 'magnetic', 'radii', 'are', 'compared', 'with', 'other', 'works', 'and', 'the', 'lattice', 'data']]
|
[-0.11287841736453727, 0.2897314190517754, -0.0716398104720203, 0.10975349945844302, -0.020639760763811067, -0.048062950923231436, 0.06722449263433922, 0.30756503480298475, -0.15309359350246307, -0.2624239915972713, -0.03720397999787731, -0.3287679987129173, 0.01801860659369474, 0.0718690643392118, 0.06504948406475665, 0.034174898372082214, 2.911636660912354e-05, 0.08986089717633472, -0.06758772068670744, -0.2165475310471019, 0.3554266055431125, -0.022044450659396614, 0.2382781125187617, 0.1472562650038535, 0.03305882274194992, -0.018228156760786866, -0.00713346648750267, -0.007117442639884103, -0.052199428183444675, 0.08278532664743458, 0.1403098610402406, 0.0034998292803048647, 0.15668973352030616, -0.4061606527246498, -0.16569267083395253, 0.07224102648608204, 0.14361766498567985, 0.18798910899792012, -0.07523877845831638, -0.2824865404397176, 0.09577453803337578, -0.2122363895453109, -0.20961662109831136, -0.12451769305815177, -0.0285714512640436, 0.04272689842137283, -0.31245789849778566, 0.1237078050423581, -0.003713374949987115, 0.017890227391393718, -0.06102696993603862, -0.25204064731435677, -0.06263933477124997, 0.05553234943757614, 0.1440858066860779, 0.08216333873294697, 0.1597399459693012, -0.19699378468131667, -0.10724675156929636, 0.4625558774239324, -0.07474276292530058, -0.17928157942231945, 0.09084771584898343, -0.17423416790208351, -0.1119662193309635, 0.09783724418226537, 0.2006113666196909, 0.1243481557366663, -0.17599754408489354, 0.11025349658958641, -0.08254491196477355, 0.16183240690527786, 0.05279639310758616, 0.08723982420332473, 0.26708683111874637, 0.1816455903210737, -0.053068338280883184, 0.059347789149371256, -0.08236560700094245, -0.08647269016049178, -0.3361756940064906, -0.10058032269985301, -0.1469116330587218, 0.04151901488967717, -0.12927888319819014, -0.12772229704042448, 0.3904239754760809, 0.09064411578798584, 0.22401650962098663, -0.039020645238913305, 0.33538219461153296, 0.11437591116444157, 0.09310630655026274, 0.12624821559241584, 0.2737626518407295, 0.23266400781854657, 0.11243159424346123, -0.31417901354974936, -0.045298015015208956, 0.09501581197762816]
|
1,803.0407
|
A Novel Detection Algorithm Efficient for Turbo coded CDMA Signals in
Detect and Forward Cooperative Channels
|
In this paper, a new detection algorithm is proposed for turbo coded Code
Division Multiple Access (CDMA) signals in detect and forward cooperative
channels. Use of user cooperation makes much improvement in the performance of
CDMA systems. Due to the special structure of CDMA systems, cooperative schemes
increase the sum and cutoff capacities of CDMA based wireless systems and
improve the quality of user-partner link which enhances the overall performance
of the system. In this paper, a new combining scheme is proposed that makes the
receiver more robust against the decision errors in the partner link. This
structure is simulated for punctured 1/2 rate 4 states turbo code in a channel
with first-order Markov time variation and different Rice factor variances.
Through various simulations, it is shown when the channel estimates are
available in the partner and receiver, the cooperation between users provides
much diversity gain especially while using the new proposed combining
algorithm.
|
eess.SP
|
in this paper a new detection algorithm is proposed for turbo coded code division multiple access cdma signals in detect and forward cooperative channels use of user cooperation makes much improvement in the performance of cdma systems due to the special structure of cdma systems cooperative schemes increase the sum and cutoff capacities of cdma based wireless systems and improve the quality of userpartner link which enhances the overall performance of the system in this paper a new combining scheme is proposed that makes the receiver more robust against the decision errors in the partner link this structure is simulated for punctured 12 rate 4 states turbo code in a channel with firstorder markov time variation and different rice factor variances through various simulations it is shown when the channel estimates are available in the partner and receiver the cooperation between users provides much diversity gain especially while using the new proposed combining algorithm
|
[['in', 'this', 'paper', 'a', 'new', 'detection', 'algorithm', 'is', 'proposed', 'for', 'turbo', 'coded', 'code', 'division', 'multiple', 'access', 'cdma', 'signals', 'in', 'detect', 'and', 'forward', 'cooperative', 'channels', 'use', 'of', 'user', 'cooperation', 'makes', 'much', 'improvement', 'in', 'the', 'performance', 'of', 'cdma', 'systems', 'due', 'to', 'the', 'special', 'structure', 'of', 'cdma', 'systems', 'cooperative', 'schemes', 'increase', 'the', 'sum', 'and', 'cutoff', 'capacities', 'of', 'cdma', 'based', 'wireless', 'systems', 'and', 'improve', 'the', 'quality', 'of', 'userpartner', 'link', 'which', 'enhances', 'the', 'overall', 'performance', 'of', 'the', 'system', 'in', 'this', 'paper', 'a', 'new', 'combining', 'scheme', 'is', 'proposed', 'that', 'makes', 'the', 'receiver', 'more', 'robust', 'against', 'the', 'decision', 'errors', 'in', 'the', 'partner', 'link', 'this', 'structure', 'is', 'simulated', 'for', 'punctured', '12', 'rate', '4', 'states', 'turbo', 'code', 'in', 'a', 'channel', 'with', 'firstorder', 'markov', 'time', 'variation', 'and', 'different', 'rice', 'factor', 'variances', 'through', 'various', 'simulations', 'it', 'is', 'shown', 'when', 'the', 'channel', 'estimates', 'are', 'available', 'in', 'the', 'partner', 'and', 'receiver', 'the', 'cooperation', 'between', 'users', 'provides', 'much', 'diversity', 'gain', 'especially', 'while', 'using', 'the', 'new', 'proposed', 'combining', 'algorithm']]
|
[-0.21251030284869546, 0.0131348111587607, -0.053073054532599605, 0.054563774323255265, -0.04962787977602406, -0.24018082768333698, 0.11146442665949804, 0.39249977104219735, -0.2616006328018224, -0.26216733403917813, 0.09621617466202188, -0.22804978733510997, -0.1944661371963817, 0.1871405621104892, -0.11160824403738956, 0.07299684476277797, 0.09093551870642437, 0.022208680275498945, -0.05160230421613342, -0.28034904534666755, 0.289552163390528, 0.17876892560275784, 0.36724337705280147, 0.024872555510061824, 0.07055362515468029, 0.03537977589244857, -0.061722359680905454, -0.0658936459644168, -0.06429136870604875, 0.08193764643815157, 0.29794919228917777, 0.17421207308854444, 0.26496968437534046, -0.3469242441705337, -0.25722012824677176, 0.07408659744192085, 0.17201048825879647, 0.10493833064086419, -0.05820473707161214, -0.27741093043651843, 0.13070020808463953, -0.24971646182482538, -0.0015998728380438086, 0.007081093994011871, -0.06777254232735026, 0.03235287178464514, -0.33780152926121054, 0.035215728086483315, 0.007465908729952145, 0.05851728637136665, -0.026972195497269626, -0.12614235252954578, 0.04122542522564603, 0.1692904524379212, 0.007191132382775833, 0.003954348020450352, 0.07813670570517775, -0.08512083206210115, -0.159062722414805, 0.37106515146986724, -0.03933689888304988, -0.23763970774750598, 0.20049399044592955, -0.08109346002315969, -0.08514391766934126, 0.1981351487285281, 0.2434420003220926, 0.0634680524304071, -0.16126283954836967, 0.01811560220351394, 0.008171333980083077, 0.21893811583963338, 0.06733400825398907, 0.11974248110188865, 0.13709995799296187, 0.20828584089930005, 0.1005430445029382, 0.14938588941688924, -0.11304745574792226, -0.1490419583115118, -0.1671803196925621, -0.162409676281504, -0.18061755681897398, -0.04473597365827148, -0.0966317989231731, -0.07678271041254002, 0.37815484503105573, 0.1652991427230387, 0.10323286511983991, 0.1167111978173755, 0.38809453574879693, 0.06707650066956002, 0.07288235269206898, 0.1253207934528796, 0.19268200071330724, 0.10993652274600821, 0.12808009190332703, -0.22992514471334766, 0.09198778355798495, -0.005637378526206304]
|
1,803.04071
|
On a Class of Permutation Trinomials in Characteristic 2
|
Recently, Tu, Zeng, Li, and Helleseth considered trinomials of the form
$f(X)=X+aX^{q(q-1)+1}+bX^{2(q-1)+1}\in\Bbb F_{q^2}[X]$, where $q$ is even and
$a,b\in\Bbb F_{q^2}^*$. They found sufficient conditions on $a,b$ for $f$ to be
a permutation polynomial (PP) of $\Bbb F_{q^2}$ and they conjectured that the
sufficient conditions are also necessary. The conjecture has been confirmed by
Bartoli using the Hasse-Weil bound. In this paper, we give an alternative
solution to the question. We also use the Hasse-Weil bound, but in a different
way. Moreover, the necessity and sufficiency of the conditions are proved by
the same approach.
|
math.NT
|
recently tu zeng li and helleseth considered trinomials of the form fxxaxqq11bx2q11inbbb f_q2x where q is even and abinbbb f_q2 they found sufficient conditions on ab for f to be a permutation polynomial pp of bbb f_q2 and they conjectured that the sufficient conditions are also necessary the conjecture has been confirmed by bartoli using the hasseweil bound in this paper we give an alternative solution to the question we also use the hasseweil bound but in a different way moreover the necessity and sufficiency of the conditions are proved by the same approach
|
[['recently', 'tu', 'zeng', 'li', 'and', 'helleseth', 'considered', 'trinomials', 'of', 'the', 'form', 'fxxaxqq11bx2q11inbbb', 'f_q2x', 'where', 'q', 'is', 'even', 'and', 'abinbbb', 'f_q2', 'they', 'found', 'sufficient', 'conditions', 'on', 'ab', 'for', 'f', 'to', 'be', 'a', 'permutation', 'polynomial', 'pp', 'of', 'bbb', 'f_q2', 'and', 'they', 'conjectured', 'that', 'the', 'sufficient', 'conditions', 'are', 'also', 'necessary', 'the', 'conjecture', 'has', 'been', 'confirmed', 'by', 'bartoli', 'using', 'the', 'hasseweil', 'bound', 'in', 'this', 'paper', 'we', 'give', 'an', 'alternative', 'solution', 'to', 'the', 'question', 'we', 'also', 'use', 'the', 'hasseweil', 'bound', 'but', 'in', 'a', 'different', 'way', 'moreover', 'the', 'necessity', 'and', 'sufficiency', 'of', 'the', 'conditions', 'are', 'proved', 'by', 'the', 'same', 'approach']]
|
[-0.151189739737437, 0.08559251447735258, -0.13599805042410837, 0.09180590582748308, -0.03296624991344288, -0.15584807484613164, 0.04064958022765653, 0.33349229436641076, -0.22968815914962604, -0.2815041192604796, 0.0980426987896309, -0.1820832463158497, -0.18078353667996175, 0.19893243412851638, -0.08392421537807779, 0.08788050548173487, 0.04314058772338878, 0.056028511628265616, -0.048537573425362454, -0.3856648402693479, 0.3088122177540082, 0.006983954353136537, 0.23680884994404472, 0.13308948144802582, 0.03008356775567138, -0.04248800464278168, -0.017894010459396825, -0.014417743583655229, -0.21371737230639037, 0.07647757440724451, 0.23165906693168875, 0.15163120973359226, 0.24135649214377222, -0.3894628645983808, -0.11500388140658564, 0.16850836962744917, 0.15468415202390726, 0.061389648092343756, -0.052996754974035706, -0.26189787738511094, 0.15858511520934332, -0.15319549242722924, -0.13549168113335644, -0.09600266525724335, 0.09787611074178763, 0.011949048504111883, -0.35114146304397803, 0.03778902650241355, 0.1332583615110944, 0.08735604565995543, -0.06358483885718591, -0.15861797896112598, 0.0008556425417064811, 0.06572784149877565, 0.008186891976156798, 0.06714221006056861, -0.010476070557437513, -0.08900284606194042, -0.08461221610195935, 0.3592351224759351, -0.02391943891163227, -0.21314863457708902, 0.15953815631750648, -0.13719028021391158, -0.152388627782626, 0.08350721364790249, 0.08500690367477744, 0.13649502222466728, -0.14773938221016736, 0.15996005625777837, -0.12768030944077866, 0.07572565288485392, 0.1543448049392875, -0.002612571716662901, 0.07908980719208636, 0.016293734676488068, 0.048514407948064414, 0.11249049112033706, -0.009751116978409498, 0.008758195392463518, -0.3106804560545994, -0.17861408530861017, -0.16668723323179976, 0.08891728096489754, -0.04374690768599976, -0.0835108720550678, 0.33546433712953055, 0.10803043185834489, 0.17525097822932445, 0.05243794645344758, 0.18766732834805938, 0.1302039451434014, 0.03262682364362737, 0.10097286815289408, 0.1989859714015873, 0.17980551025475902, 0.03387559821282554, -0.15363395967490404, 0.0869409203549604, 0.12055856131179177]
|
1,803.04072
|
Blind Identification of Invertible Graph Filters with Multiple Sparse
Inputs
|
This paper deals with problem of blind identification of a graph filter and
its sparse input signal, thus broadening the scope of classical blind
deconvolution of temporal and spatial signals to irregular graph domains. While
the observations are bilinear functions of the unknowns, a mild requirement on
invertibility of the filter enables an efficient convex formulation, without
relying on matrix lifting that can hinder applicability to large graphs. On top
of scaling, it is argued that (non-cyclic) permutation ambiguities may arise
with some particular graphs. Deterministic sufficient conditions under which
the proposed convex relaxation can exactly recover the unknowns are stated,
along with those guaranteeing identifiability under the Bernoulli-Gaussian
model for the inputs. Numerical tests with synthetic and real-world networks
illustrate the merits of the proposed algorithm, as well as the benefits of
leveraging multiple signals to aid the (blind) localization of sources of
diffusion.
|
eess.SP cs.IT math.IT
|
this paper deals with problem of blind identification of a graph filter and its sparse input signal thus broadening the scope of classical blind deconvolution of temporal and spatial signals to irregular graph domains while the observations are bilinear functions of the unknowns a mild requirement on invertibility of the filter enables an efficient convex formulation without relying on matrix lifting that can hinder applicability to large graphs on top of scaling it is argued that noncyclic permutation ambiguities may arise with some particular graphs deterministic sufficient conditions under which the proposed convex relaxation can exactly recover the unknowns are stated along with those guaranteeing identifiability under the bernoulligaussian model for the inputs numerical tests with synthetic and realworld networks illustrate the merits of the proposed algorithm as well as the benefits of leveraging multiple signals to aid the blind localization of sources of diffusion
|
[['this', 'paper', 'deals', 'with', 'problem', 'of', 'blind', 'identification', 'of', 'a', 'graph', 'filter', 'and', 'its', 'sparse', 'input', 'signal', 'thus', 'broadening', 'the', 'scope', 'of', 'classical', 'blind', 'deconvolution', 'of', 'temporal', 'and', 'spatial', 'signals', 'to', 'irregular', 'graph', 'domains', 'while', 'the', 'observations', 'are', 'bilinear', 'functions', 'of', 'the', 'unknowns', 'a', 'mild', 'requirement', 'on', 'invertibility', 'of', 'the', 'filter', 'enables', 'an', 'efficient', 'convex', 'formulation', 'without', 'relying', 'on', 'matrix', 'lifting', 'that', 'can', 'hinder', 'applicability', 'to', 'large', 'graphs', 'on', 'top', 'of', 'scaling', 'it', 'is', 'argued', 'that', 'noncyclic', 'permutation', 'ambiguities', 'may', 'arise', 'with', 'some', 'particular', 'graphs', 'deterministic', 'sufficient', 'conditions', 'under', 'which', 'the', 'proposed', 'convex', 'relaxation', 'can', 'exactly', 'recover', 'the', 'unknowns', 'are', 'stated', 'along', 'with', 'those', 'guaranteeing', 'identifiability', 'under', 'the', 'bernoulligaussian', 'model', 'for', 'the', 'inputs', 'numerical', 'tests', 'with', 'synthetic', 'and', 'realworld', 'networks', 'illustrate', 'the', 'merits', 'of', 'the', 'proposed', 'algorithm', 'as', 'well', 'as', 'the', 'benefits', 'of', 'leveraging', 'multiple', 'signals', 'to', 'aid', 'the', 'blind', 'localization', 'of', 'sources', 'of', 'diffusion']]
|
[-0.10760011731101007, 0.016264750147017587, -0.041380131003800134, 0.03572264559213714, -0.12415474993497903, -0.14940880392517508, 0.017103393893721033, 0.39465739498364516, -0.31017180137850087, -0.3072807515875019, 0.174000666477589, -0.22236160672879937, -0.1814116311163224, 0.1780698088302823, -0.12170968608095728, 0.1285707927100232, 0.10490378657805509, 0.013221370855924385, -0.09999285734997228, -0.24668587169264733, 0.2996094321671488, 0.05304467830935429, 0.264542048209114, 0.03872874560203917, 0.11475201732125775, 0.033782419343960694, -0.05113253144483114, 0.008043248962675189, -0.0295990055142942, 0.08208198621307082, 0.25701109386001036, 0.1854464111392033, 0.27248631763304104, -0.4278786918341086, -0.23586941670369485, 0.14610169379939808, 0.12782940809325924, 0.08432144379536301, -0.034960445966411, -0.33296521087658815, 0.1032399649571242, -0.08147136449075208, -0.08302401064911151, -0.082525050954829, -0.054136978147615644, 0.04778715928269807, -0.33567513688949163, 0.08487108351405838, 0.08649065360699877, 0.0343615944818433, -0.02859667923124828, -0.13782545558080592, 0.017748365039005877, 0.11224864434033376, 0.03791187956431431, -0.03840845742680389, 0.10297911453285608, -0.12536921652901017, -0.14278425328305056, 0.37441734637551266, -0.0189795779180713, -0.24333739752784886, 0.20710649677905543, -0.0838263377908553, -0.15218979174849287, 0.14204227826718627, 0.1772492459075975, 0.10850291374974466, -0.15058021856600354, 0.0988552521629227, -0.06443135390893139, 0.16055518127817275, 0.06243711131030758, 0.057373184145524586, 0.12987392688218247, 0.15238538800481835, 0.12316166684352632, 0.15954553094082352, -0.09190715040915229, -0.0880450286549227, -0.2835383402693471, -0.08025025622598056, -0.21246254970801287, -0.02135306112147097, -0.1486656148922991, -0.17078777086270716, 0.4222322315941083, 0.18617991685168817, 0.1674156580842903, 0.1155975637098389, 0.3189969952924755, 0.0844075374140661, 0.06606228755915473, 0.05975890748909321, 0.16302250962933237, 0.1736830646396968, 0.06638200736990006, -0.20612554892672805, 0.09071458349453992, 0.04536669548151308]
|
1,803.04073
|
Thermal rectification with interacting electronic channels: Exploiting
degeneracy, quantum superpositions and interference
|
This work explores different mechanisms that induce thermal rectification in
the nanoscale. The presence of interacting energy channels combined with simple
asymmetries is sufficient for promoting the desired behavior. We use simple
quantum dot configurations, identifying the basic properties that enhance
rectification for each case: the size of a quantum dot state space (which
suggests the use of scaled up systems with many interacting channels),
tunneling asymmetries due to coherent tunneling in a double quantum dot, or
quantum interference in a triangular triple quantum dot. An efficient and
tunable thermal diode is proposed using a channel capacitively coupled to a
mesoscopic switch.
|
cond-mat.mes-hall
|
this work explores different mechanisms that induce thermal rectification in the nanoscale the presence of interacting energy channels combined with simple asymmetries is sufficient for promoting the desired behavior we use simple quantum dot configurations identifying the basic properties that enhance rectification for each case the size of a quantum dot state space which suggests the use of scaled up systems with many interacting channels tunneling asymmetries due to coherent tunneling in a double quantum dot or quantum interference in a triangular triple quantum dot an efficient and tunable thermal diode is proposed using a channel capacitively coupled to a mesoscopic switch
|
[['this', 'work', 'explores', 'different', 'mechanisms', 'that', 'induce', 'thermal', 'rectification', 'in', 'the', 'nanoscale', 'the', 'presence', 'of', 'interacting', 'energy', 'channels', 'combined', 'with', 'simple', 'asymmetries', 'is', 'sufficient', 'for', 'promoting', 'the', 'desired', 'behavior', 'we', 'use', 'simple', 'quantum', 'dot', 'configurations', 'identifying', 'the', 'basic', 'properties', 'that', 'enhance', 'rectification', 'for', 'each', 'case', 'the', 'size', 'of', 'a', 'quantum', 'dot', 'state', 'space', 'which', 'suggests', 'the', 'use', 'of', 'scaled', 'up', 'systems', 'with', 'many', 'interacting', 'channels', 'tunneling', 'asymmetries', 'due', 'to', 'coherent', 'tunneling', 'in', 'a', 'double', 'quantum', 'dot', 'or', 'quantum', 'interference', 'in', 'a', 'triangular', 'triple', 'quantum', 'dot', 'an', 'efficient', 'and', 'tunable', 'thermal', 'diode', 'is', 'proposed', 'using', 'a', 'channel', 'capacitively', 'coupled', 'to', 'a', 'mesoscopic', 'switch']]
|
[-0.20009701765671956, 0.17719743034118152, -0.04369055600517301, 0.02247118185315391, -0.008257547626271844, -0.2601460611913353, 0.04590779740829021, 0.36468374930943054, -0.2936648643694307, -0.2414866029741425, -0.016009701839328615, -0.2674863821571218, -0.13181542037009245, 0.21972323929224455, -0.018809616232436953, 0.03312081076643046, 0.058168524177744985, -0.034864238034203354, -0.03122964116982093, -0.16610534977186106, 0.2906702743665151, 0.047067638601327094, 0.3126050567017028, 0.05286570112038331, 0.11956712239257553, 0.037532516156395156, 0.09020664255527377, 4.389150240504201e-05, -0.12407175097320636, 0.07444642565907071, 0.22337131325255932, -0.06579706460287721, 0.20520716995530414, -0.46291751797110137, -0.1905790895095789, 0.08263733469507048, 0.16389458158136774, 0.13978316561819976, -0.07620778876612437, -0.26882005897441913, 0.05498157108348666, -0.1817814387591081, -0.09274670644206744, -0.0562236783523843, -0.03286977588911267, 0.008663087104008916, -0.28691275389043286, 0.04934630170921046, 0.0415741516500894, 0.0019986123376178975, 0.03855251968043911, -0.020087331293753403, 0.03167375029913862, 0.1179057081188897, -0.10453875939699583, -0.020597610453728075, 0.23484987364830814, -0.15163297860143596, -0.19988630494723716, 0.3225167869937186, -0.05786778970037167, -0.1923122577113556, 0.20014227654239364, -0.1324181320173118, -0.07195940460352336, 0.11983271810573105, 0.14740703037629524, 0.09271009087873001, -0.18961226769412556, 0.06656952177610376, 0.013332349321275366, 0.16566434420426102, 0.05399428917935081, 0.143542445150624, 0.2794863198902093, 0.19591017772315764, 0.06300427413981535, 0.19043039494906278, -0.11104109380325741, -0.1655523117321233, -0.2605265425061624, -0.19996564995095717, -0.18124664145722694, 0.12379325191503478, -0.04920900391637891, -0.1741451440086844, 0.40874585218490195, 0.13780364808261247, 0.19077342785164422, -0.06352943812003907, 0.3134656000001283, 0.162520382212653, 0.06652051017290968, 0.011980256394428365, 0.20960073546944735, 0.20806483938997866, 0.07680842063535809, -0.32908392207258763, 0.013491889735793365, -0.0633522401901656]
|
1,803.04074
|
Development of a culturally-oriented website usability evaluation
|
As the uni-cultural studies of website usability have matured, the paucity of
cross-cultural studies of usability become increasingly apparent. Moving toward
these cross-cultural studies will require the development of a new tool to
assess website usability in the context of cultural dimensions. This paper
introduces the preliminary results from the first phase of this project and
then presents the proposed method for the research in progress that
specifically is directed to the development and quantitative evaluation of a
measurement scale of a culture sensitive measurement of website usability. The
recognition of the need to develop this scale resulted from the identification
of culture-related shortcomings of previous measurement tools that have been
used widely within the Management of Information Systems (MIS) literature.
|
cs.HC
|
as the unicultural studies of website usability have matured the paucity of crosscultural studies of usability become increasingly apparent moving toward these crosscultural studies will require the development of a new tool to assess website usability in the context of cultural dimensions this paper introduces the preliminary results from the first phase of this project and then presents the proposed method for the research in progress that specifically is directed to the development and quantitative evaluation of a measurement scale of a culture sensitive measurement of website usability the recognition of the need to develop this scale resulted from the identification of culturerelated shortcomings of previous measurement tools that have been used widely within the management of information systems mis literature
|
[['as', 'the', 'unicultural', 'studies', 'of', 'website', 'usability', 'have', 'matured', 'the', 'paucity', 'of', 'crosscultural', 'studies', 'of', 'usability', 'become', 'increasingly', 'apparent', 'moving', 'toward', 'these', 'crosscultural', 'studies', 'will', 'require', 'the', 'development', 'of', 'a', 'new', 'tool', 'to', 'assess', 'website', 'usability', 'in', 'the', 'context', 'of', 'cultural', 'dimensions', 'this', 'paper', 'introduces', 'the', 'preliminary', 'results', 'from', 'the', 'first', 'phase', 'of', 'this', 'project', 'and', 'then', 'presents', 'the', 'proposed', 'method', 'for', 'the', 'research', 'in', 'progress', 'that', 'specifically', 'is', 'directed', 'to', 'the', 'development', 'and', 'quantitative', 'evaluation', 'of', 'a', 'measurement', 'scale', 'of', 'a', 'culture', 'sensitive', 'measurement', 'of', 'website', 'usability', 'the', 'recognition', 'of', 'the', 'need', 'to', 'develop', 'this', 'scale', 'resulted', 'from', 'the', 'identification', 'of', 'culturerelated', 'shortcomings', 'of', 'previous', 'measurement', 'tools', 'that', 'have', 'been', 'used', 'widely', 'within', 'the', 'management', 'of', 'information', 'systems', 'mis', 'literature']]
|
[-0.07694618094634885, 0.013652093285539497, -0.10179218191187829, 0.006490800957059643, -0.11116105931190153, -0.0912596183673789, 0.03317391969394521, 0.3702198694770535, -0.18703554761596025, -0.3451312291940364, 0.14062088490463792, -0.26974302928041044, -0.14401236264238831, 0.2093294719234109, -0.08822228525338384, 0.08741862943473583, 0.10382411632454022, 0.004735293266518662, -0.042843295734686156, -0.24493758397487303, 0.3226561377833908, 0.09788299162561695, 0.35469049893241994, 0.10872156605473719, 0.022634893389961993, -0.020088501495774836, -0.12338104801407705, 0.020670723163251144, -0.12863221259770702, 0.19415695766316882, 0.3294320763088763, 0.21819548078152973, 0.3789385892295589, -0.3911378980148584, -0.1953350813256596, 0.052439609379507604, 0.17472529681544985, 0.11015727861473958, -0.10739997973044714, -0.3170066754644116, 0.07036998803572109, -0.20756824982042113, -0.12738107362917314, -0.06154260515080144, 0.013381222387154897, 0.006234611023683101, -0.18822976029478014, 0.013960562324306617, 0.0362488049431704, 0.15391587573103607, 0.004940854174977479, -0.12534900828419873, 0.04491844570535856, 0.2216468902498794, 0.10692756611194151, 0.03924006349310124, 0.13352056505779425, -0.13879750506603158, -0.15496415691935303, 0.39591179150156675, -0.014990404061973096, -0.13683825332457974, 0.1979434280685382, -0.10598225415839503, -0.2174921717029065, 0.08010403738978009, 0.23848350562620907, 0.08247672230936587, -0.21037971665306637, 0.027227160453912803, -0.004187794689399501, 0.17732835134180883, 0.004553486358296747, 0.03514207052843024, 0.18401838287633535, 0.25719707255872587, 0.025481699030691137, 0.11907064186525532, -0.08221153219540914, -0.08984600814680259, -0.24444955476404479, -0.18212783329266433, -0.119531401906958, 0.0038402877127130825, -0.026396156408736715, -0.15584070320085933, 0.40001651511217157, 0.27262369911186396, 0.10338720427826047, 0.0022001742695768674, 0.3415396832705786, 0.008218730617954861, 0.1112518892933925, 0.01654583386844024, 0.2537064037198434, 0.03069573089790841, 0.19502374574852485, -0.1759292336840493, 0.13673049876233562, 0.010810358138405718]
|
1,803.04075
|
Kernel estimation of the instantaneous frequency
|
We consider kernel estimators of the instantaneous frequency of a slowly
evolving sinusoid in white noise. The expected estimation error consists of two
terms. The systematic bias error grows as the kernel halfwidth increases while
the random error decreases. For a non-modulated signal, $g(t)$, the kernel
halfwidth which minimizes the expected error scales as$h \sim \left[{ \sigma^2
\over
N| \partial_t^2 g^{}|^2 } \right]^{1/ 5}$, where %$A^{(\ell)}$ is the
coherent signal at frequency, $f_{\ell}$, $\sigma^2$ is the noise variance and
$N$ is the number of measurements per unit time. We show that estimating the
instantaneous frequency corresponds to estimating the first derivative of a
modulated signal, $A(t)\exp(i\phi(t))$. For instantaneous frequency estimation,
the halfwidth which minimizes the expected error is larger: $h_{1,3} \sim
\left[{ \sigma^2 \over A^2N| \partial_t^3 (e^{i \tilde{\phi}(t)} )|^2 }
\right]^{1/ 7}$. Since the optimal halfwidths depend on derivatives of the
unknown function, we initially estimate these derivatives prior to estimating
the actual signal.
|
stat.ME eess.AS eess.SP math.ST stat.AP stat.TH
|
we consider kernel estimators of the instantaneous frequency of a slowly evolving sinusoid in white noise the expected estimation error consists of two terms the systematic bias error grows as the kernel halfwidth increases while the random error decreases for a nonmodulated signal gt the kernel halfwidth which minimizes the expected error scales ash sim left sigma2 over n partial_t2 g2 right1 5 where aell is the coherent signal at frequency f_ell sigma2 is the noise variance and n is the number of measurements per unit time we show that estimating the instantaneous frequency corresponds to estimating the first derivative of a modulated signal atexpiphit for instantaneous frequency estimation the halfwidth which minimizes the expected error is larger h_13 sim left sigma2 over a2n partial_t3 ei tildephit 2 right1 7 since the optimal halfwidths depend on derivatives of the unknown function we initially estimate these derivatives prior to estimating the actual signal
|
[['we', 'consider', 'kernel', 'estimators', 'of', 'the', 'instantaneous', 'frequency', 'of', 'a', 'slowly', 'evolving', 'sinusoid', 'in', 'white', 'noise', 'the', 'expected', 'estimation', 'error', 'consists', 'of', 'two', 'terms', 'the', 'systematic', 'bias', 'error', 'grows', 'as', 'the', 'kernel', 'halfwidth', 'increases', 'while', 'the', 'random', 'error', 'decreases', 'for', 'a', 'nonmodulated', 'signal', 'gt', 'the', 'kernel', 'halfwidth', 'which', 'minimizes', 'the', 'expected', 'error', 'scales', 'ash', 'sim', 'left', 'sigma2', 'over', 'n', 'partial_t2', 'g2', 'right1', '5', 'where', 'aell', 'is', 'the', 'coherent', 'signal', 'at', 'frequency', 'f_ell', 'sigma2', 'is', 'the', 'noise', 'variance', 'and', 'n', 'is', 'the', 'number', 'of', 'measurements', 'per', 'unit', 'time', 'we', 'show', 'that', 'estimating', 'the', 'instantaneous', 'frequency', 'corresponds', 'to', 'estimating', 'the', 'first', 'derivative', 'of', 'a', 'modulated', 'signal', 'atexpiphit', 'for', 'instantaneous', 'frequency', 'estimation', 'the', 'halfwidth', 'which', 'minimizes', 'the', 'expected', 'error', 'is', 'larger', 'h_13', 'sim', 'left', 'sigma2', 'over', 'a2n', 'partial_t3', 'ei', 'tildephit', '2', 'right1', '7', 'since', 'the', 'optimal', 'halfwidths', 'depend', 'on', 'derivatives', 'of', 'the', 'unknown', 'function', 'we', 'initially', 'estimate', 'these', 'derivatives', 'prior', 'to', 'estimating', 'the', 'actual', 'signal']]
|
[-0.16393285523475015, 0.14253241631933708, 0.005945983403768615, 0.07549376852635369, -0.030663462944841326, -0.12523373847064756, 0.05372873958998716, 0.3502343097239133, -0.25744791701436043, -0.2634373868084294, 0.12437562204681762, -0.3310592626315235, -0.08482884124097971, 0.17977778177908402, -0.07176837337597104, 0.03870854137040325, -0.015154467165882656, 0.1160210797203011, -0.12301873296167977, -0.21764384221594982, 0.22430244712596573, 0.0802129453060611, 0.23344850662748812, -0.05439589406838703, 0.1442651244086657, 0.00884179483267835, -0.046608216204249216, -0.08615950906911753, -0.1490397437371805, 0.016786236733185664, 0.19082942199205744, 0.08388887186090918, 0.33505073650083783, -0.3104594491981595, -0.16429118770205933, 0.16347763900279424, 0.1588679037602609, 0.02776671227711509, 0.05481842120456191, -0.242434945910694, 0.07645805903722926, -0.13705785173122714, -0.07405060671282394, 0.06109949403861225, 0.07296854458849301, 0.04425594107921379, -0.36614524533084575, 0.20470987645684172, 0.04791113436722115, 0.027077313920407988, -0.05597098884188364, -0.2190801880928694, 0.016328750279788303, 0.09135421032973584, 0.05010072150245784, 0.1073098166911369, 0.1635928574962004, -0.0875258318323567, -0.00201280333801804, 0.2782655563600043, -0.11946299307410849, -0.20393391169104474, 0.040137015279982514, -0.21493599185057535, -0.04034794387098983, 0.17832736238186947, 0.16862695532799746, 0.07611384254180195, -0.08296794559019025, 0.08143390208793704, 0.0456375526201805, 0.2368059740808086, 0.09007029067224905, 0.04223477224828738, 0.10795468863899876, 0.14236229826889982, 0.12723817688572353, 0.09443274810253924, -0.20276132012692424, -0.04156127582997984, -0.32784998819744526, -0.11453311494864124, -0.24021249915466913, 0.057393427063154694, -0.1661616117222158, -0.15119740743498278, 0.39851737223665584, 0.1260760375454822, 0.21277239515552385, 0.13748698513611102, 0.32565836467148873, 0.2075877367259447, 0.017512369783745214, 0.10556161521360491, 0.19393202337442628, 0.1361497029593377, 0.027077943564786405, -0.2484430605623771, 0.0911199160720278, 0.004102126985863351]
|
1,803.04076
|
Blowup criterion for Navier-Stokes equation in critical Besov space with
spatial dimensions $d \geq 4$
|
This paper is concerned with the blowup criterion for mild solution to the
incompressible Navier-Stokes equation in higher spatial dimensions $d \geq 4$.
By establishing an $\epsilon$ regularity criterion, we show that if the mild
solution $u$ with initial data in $\dot B^{-1+d/p}_{p,q}(\mathbb{R}^d) $,
$d<p,\,q<\infty$ becomes singular at a finite time $T_*$, then
$$
\limsup_{t\to T_*} \|u(t)\|_{\dot B^{-1+d/p}_{p,q}(\mathbb{R}^d)} = \infty.
$$
The corresponding result in 3D case has been obtained by I.Gallagher,
G.S.KochandF.Planchon. As a by-product, we also prove a regularity criterion
for the Leray-Hopf solution in the critical Besov space, which generalizes the
results in~\cite{DoDu09}, where blowup criterion in critical Lebesgue space
$L^d(\mathbb{R}^d)$ is obtained.
|
math.AP
|
this paper is concerned with the blowup criterion for mild solution to the incompressible navierstokes equation in higher spatial dimensions d geq 4 by establishing an epsilon regularity criterion we show that if the mild solution u with initial data in dot b1dp_pqmathbbrd dpqinfty becomes singular at a finite time t_ then limsup_tto t_ ut_dot b1dp_pqmathbbrd infty the corresponding result in 3d case has been obtained by igallagher gskochandfplanchon as a byproduct we also prove a regularity criterion for the lerayhopf solution in the critical besov space which generalizes the results incitedodu09 where blowup criterion in critical lebesgue space ldmathbbrd is obtained
|
[['this', 'paper', 'is', 'concerned', 'with', 'the', 'blowup', 'criterion', 'for', 'mild', 'solution', 'to', 'the', 'incompressible', 'navierstokes', 'equation', 'in', 'higher', 'spatial', 'dimensions', 'd', 'geq', '4', 'by', 'establishing', 'an', 'epsilon', 'regularity', 'criterion', 'we', 'show', 'that', 'if', 'the', 'mild', 'solution', 'u', 'with', 'initial', 'data', 'in', 'dot', 'b1dp_pqmathbbrd', 'dpqinfty', 'becomes', 'singular', 'at', 'a', 'finite', 'time', 't_', 'then', 'limsup_tto', 't_', 'ut_dot', 'b1dp_pqmathbbrd', 'infty', 'the', 'corresponding', 'result', 'in', '3d', 'case', 'has', 'been', 'obtained', 'by', 'igallagher', 'gskochandfplanchon', 'as', 'a', 'byproduct', 'we', 'also', 'prove', 'a', 'regularity', 'criterion', 'for', 'the', 'lerayhopf', 'solution', 'in', 'the', 'critical', 'besov', 'space', 'which', 'generalizes', 'the', 'results', 'incitedodu09', 'where', 'blowup', 'criterion', 'in', 'critical', 'lebesgue', 'space', 'ldmathbbrd', 'is', 'obtained']]
|
[-0.13829317469345895, 0.06939150671686022, -0.08393413570072306, 0.08412176778074354, -0.015217278118392354, -0.18745067168125196, 0.0026908059665737183, 0.288455940390888, -0.28077929375301064, -0.1868752583959385, 0.16610283017232033, -0.26725124522651494, -0.09620414075294607, 0.17101455424226036, -0.09345100665170895, 0.1008046124308174, 0.06053862439860639, 0.06349260629595894, -0.08914755065190165, -0.2698065982543324, 0.3976388031126637, -0.05297642454112831, 0.24646752085414175, 0.06174987760421477, 0.10593772284582405, -0.04533676502637957, 0.043160210118481986, -0.0003060299566162652, -0.283419083140095, -0.014835202066521896, 0.24188952326382462, 0.06551063910102177, 0.3136224369077306, -0.35352876855942766, -0.20351071610654656, 0.1487191895758243, 0.1840738435030768, 0.06035674997041688, -0.010651609921631845, -0.28483019382692876, 0.16862014496061756, -0.0839030816268764, -0.2440322506682653, -0.056473631480414614, 0.07095948218515044, 0.011193124116643478, -0.36997951739712764, 0.12097047437687013, 0.12053888740973841, 0.07317958248681143, -0.15907307143176072, -0.08059835031040405, -0.047039316756356704, 0.024444989786532364, 0.06306689955588234, 0.09987019649951866, -0.007119700593236637, -0.11379961988790648, -0.018300641146733573, 0.31963287899025566, -0.1046609064319024, -0.25167606916082536, 0.15190829672654602, -0.18833428879611586, -0.12402318862119788, 0.10166331240417141, 0.08552136108475296, 0.1654913466374733, -0.09455532961966176, 0.18149445178477389, -0.09272082073515968, 0.13344322636135314, 0.11624175619922186, 0.00483887158824425, 0.026544494071583213, 0.16445389155384252, 0.21180980134461272, 0.1255027191639927, -0.04873306319411648, -0.05255077239616137, -0.371751655912713, -0.1767246652688635, -0.1870892030334002, 0.13524514153403672, -0.1636958507820964, -0.13498304869587485, 0.2736115305537456, 0.11879821762834725, 0.20164786614477634, 0.11759183647135567, 0.21092891159810517, 0.19140084604365065, -0.04901460532687212, 0.1049343972515903, 0.17100877200596426, 0.10442976378835737, 0.15237491722953947, -0.16770400762263882, 0.02024511077294224, 0.21726623222624]
|
1,803.04077
|
Statistical tests for evaluating an earthquake prediction method
|
The impact of including postcursors in the null hypothesis test is discussed.
Unequal prediction probabilities can be included in the null hypothesis test
using a generalization of the central limit theorem. A test for determining the
enhancement factor over random chance is given. The seismic earthquake signal
may preferentially precede earthquakes even if the VAN methodology fails to
forecast the earthquakes. We formulate a statistical test for this possibility.
|
stat.ME physics.data-an physics.geo-ph stat.AP
|
the impact of including postcursors in the null hypothesis test is discussed unequal prediction probabilities can be included in the null hypothesis test using a generalization of the central limit theorem a test for determining the enhancement factor over random chance is given the seismic earthquake signal may preferentially precede earthquakes even if the van methodology fails to forecast the earthquakes we formulate a statistical test for this possibility
|
[['the', 'impact', 'of', 'including', 'postcursors', 'in', 'the', 'null', 'hypothesis', 'test', 'is', 'discussed', 'unequal', 'prediction', 'probabilities', 'can', 'be', 'included', 'in', 'the', 'null', 'hypothesis', 'test', 'using', 'a', 'generalization', 'of', 'the', 'central', 'limit', 'theorem', 'a', 'test', 'for', 'determining', 'the', 'enhancement', 'factor', 'over', 'random', 'chance', 'is', 'given', 'the', 'seismic', 'earthquake', 'signal', 'may', 'preferentially', 'precede', 'earthquakes', 'even', 'if', 'the', 'van', 'methodology', 'fails', 'to', 'forecast', 'the', 'earthquakes', 'we', 'formulate', 'a', 'statistical', 'test', 'for', 'this', 'possibility']]
|
[-0.1142950547805083, 0.0922558619843229, -0.10268484376222435, 0.1931608573658446, -0.03380287538512029, -0.09706902948032686, 0.09248482399498639, 0.27933194337115774, -0.1757208546353639, -0.2804002481094305, 0.08688563138475992, -0.2530556732410754, -0.14185978326460588, 0.22371591379245123, -0.06959580621290681, 0.06817232277514278, 0.08336956101545408, 0.053321249823531376, -0.037665058470641576, -0.2524088807825836, 0.2293830445252251, 0.13617788857200008, 0.33802375559141673, 0.0261401806998512, 0.04724505182652586, 0.022310078859437203, -0.06044775120698023, 0.01478721586096546, -0.07314533739607187, 0.04380637374909028, 0.24047463793186066, 0.15877230708365855, 0.31706398763302446, -0.40120424079857225, -0.22583280869530162, 0.18620171055089738, 0.0780261459260963, 0.09924233337000445, 0.014072024357923563, -0.2867985156405231, 0.12038025210031132, -0.18215342752797448, -0.17331647500395775, 0.003068561517242072, 0.019897284566600254, 0.018155813055193943, -0.3353163181277721, 0.13420842211369588, 0.12910534623686387, 0.0696450122575144, -0.052005330640552704, -0.05093717612866042, 0.03572746841371923, 0.08943096301990791, 0.10287945316699536, -0.014620980673024187, 0.14431749665569785, -0.08217218428836677, -0.10847127642752467, 0.40422948876368825, -0.051340234033979366, -0.197001532557002, 0.14787992088637059, -0.17289167213375153, -0.17370691571546637, 0.06579497695117649, 0.1964078729270377, 0.031739103761366634, -0.14313344608155498, 0.005525276064872742, -0.027427543167267806, 0.11237815401746311, 0.13566862521153214, -0.08660511549670195, 0.2923673921251211, 0.18015289241178095, 0.036302615206796625, 0.14708553568925709, -0.20746933814624083, -0.04884840338153468, -0.33556066545239394, -0.13627041776435098, -0.1870696016492835, 0.06493411607453195, -0.1285848683623624, -0.17189527821281683, 0.37384260597004404, 0.20049680276787368, 0.13679665260934742, 0.06643610445620574, 0.21941794001200385, 0.12650594100410092, 0.02916132749152788, 0.05919601850926984, 0.2781844907912655, 0.10880334517392128, 0.0014797495998631136, -0.14060313196049706, 0.16113091833835494, 0.03711423654095742]
|
1,803.04078
|
Minimum bias multiple taper spectral estimation
|
Two families of orthonormal tapers are proposed for multi-taper spectral
analysis: minimum bias tapers, and sinusoidal tapers $\{ \bf{v}^{(k)}\}$, where
$v_n^{(k)}=\sqrt{\frac{2}{N+1}}\sin\frac{\pi kn}{N+1}$, and $N$ is the number
of points. The resulting sinusoidal multitaper spectral estimate is
$\hat{S}(f)=\frac{1}{2K(N+1)} \sum_{j=1}^K |y(f+\frac{j}{2N+2})
-y(f-\frac{j}{2N+2})|^2$, where $y(f)$ is the Fourier transform of the
stationary time series, $S(f)$ is the spectral density, and $K$ is the number
of tapers. For fixed $j$, the sinusoidal tapers converge to the minimum bias
tapers like $1/N$. Since the sinusoidal tapers have analytic expressions, no
numerical eigenvalue decomposition is necessary. Both the minimum bias and
sinusoidal tapers have no additional parameter for the spectral bandwidth. The
bandwidth of the $j$th taper is simply $\frac{1}{N}$ centered about the
frequencies $\frac{\pm j}{2N+2}$. Thus the bandwidth of the multitaper spectral
estimate can be adjusted locally by simply adding or deleting tapers. The band
limited spectral concentration, $\int_{-w}^w |V(f)|^2 df$, of both the minimum
bias and sinusoidal tapers is very close to the optimal concentration achieved
by the Slepian tapers. In contrast, the Slepian tapers can have the local bias,
$\int_{-1/2}^{1/2} f^2 |V(f)|^2 df$, much larger than of the minimum bias
tapers and the sinusoidal tapers.
|
stat.ME eess.AS eess.SP math.ST physics.data-an stat.TH
|
two families of orthonormal tapers are proposed for multitaper spectral analysis minimum bias tapers and sinusoidal tapers bfvk where v_nksqrtfrac2n1sinfracpi knn1 and n is the number of points the resulting sinusoidal multitaper spectral estimate is hatsffrac12kn1 sum_j1k yffracj2n2 yffracj2n22 where yf is the fourier transform of the stationary time series sf is the spectral density and k is the number of tapers for fixed j the sinusoidal tapers converge to the minimum bias tapers like 1n since the sinusoidal tapers have analytic expressions no numerical eigenvalue decomposition is necessary both the minimum bias and sinusoidal tapers have no additional parameter for the spectral bandwidth the bandwidth of the jth taper is simply frac1n centered about the frequencies fracpm j2n2 thus the bandwidth of the multitaper spectral estimate can be adjusted locally by simply adding or deleting tapers the band limited spectral concentration int_ww vf2 df of both the minimum bias and sinusoidal tapers is very close to the optimal concentration achieved by the slepian tapers in contrast the slepian tapers can have the local bias int_1212 f2 vf2 df much larger than of the minimum bias tapers and the sinusoidal tapers
|
[['two', 'families', 'of', 'orthonormal', 'tapers', 'are', 'proposed', 'for', 'multitaper', 'spectral', 'analysis', 'minimum', 'bias', 'tapers', 'and', 'sinusoidal', 'tapers', 'bfvk', 'where', 'v_nksqrtfrac2n1sinfracpi', 'knn1', 'and', 'n', 'is', 'the', 'number', 'of', 'points', 'the', 'resulting', 'sinusoidal', 'multitaper', 'spectral', 'estimate', 'is', 'hatsffrac12kn1', 'sum_j1k', 'yffracj2n2', 'yffracj2n22', 'where', 'yf', 'is', 'the', 'fourier', 'transform', 'of', 'the', 'stationary', 'time', 'series', 'sf', 'is', 'the', 'spectral', 'density', 'and', 'k', 'is', 'the', 'number', 'of', 'tapers', 'for', 'fixed', 'j', 'the', 'sinusoidal', 'tapers', 'converge', 'to', 'the', 'minimum', 'bias', 'tapers', 'like', '1n', 'since', 'the', 'sinusoidal', 'tapers', 'have', 'analytic', 'expressions', 'no', 'numerical', 'eigenvalue', 'decomposition', 'is', 'necessary', 'both', 'the', 'minimum', 'bias', 'and', 'sinusoidal', 'tapers', 'have', 'no', 'additional', 'parameter', 'for', 'the', 'spectral', 'bandwidth', 'the', 'bandwidth', 'of', 'the', 'jth', 'taper', 'is', 'simply', 'frac1n', 'centered', 'about', 'the', 'frequencies', 'fracpm', 'j2n2', 'thus', 'the', 'bandwidth', 'of', 'the', 'multitaper', 'spectral', 'estimate', 'can', 'be', 'adjusted', 'locally', 'by', 'simply', 'adding', 'or', 'deleting', 'tapers', 'the', 'band', 'limited', 'spectral', 'concentration', 'int_ww', 'vf2', 'df', 'of', 'both', 'the', 'minimum', 'bias', 'and', 'sinusoidal', 'tapers', 'is', 'very', 'close', 'to', 'the', 'optimal', 'concentration', 'achieved', 'by', 'the', 'slepian', 'tapers', 'in', 'contrast', 'the', 'slepian', 'tapers', 'can', 'have', 'the', 'local', 'bias', 'int_1212', 'f2', 'vf2', 'df', 'much', 'larger', 'than', 'of', 'the', 'minimum', 'bias', 'tapers', 'and', 'the', 'sinusoidal', 'tapers']]
|
[-0.14359902357425314, 0.06207410649020863, -0.07888817941533267, 0.015658343244261668, -0.07241448578013117, -0.1932306598244204, 0.08798247493947572, 0.4359458707959921, -0.24711029825845313, -0.28335518515488717, 0.11734895209218402, -0.2753713431341049, -0.10531605961308069, 0.19305004622885, -0.0682648225013393, 0.09667872087978527, -0.012023526902480349, 0.017226701597194315, -0.06924771107939066, -0.21344264223914367, 0.1804444674487375, 0.09434449437295617, 0.2738647063448318, -0.02494922797169886, 0.038861413653528326, 0.01806206360474764, -0.01894659189525374, -0.032625741109210814, -0.12811432288990496, 0.04843623620246985, 0.20451753615473722, 0.03650255529441516, 0.3031517061512938, -0.34648849403495946, -0.21073371258909038, 0.1464431246932987, 0.16659051905648567, 0.04975620958084519, 0.012365338985566358, -0.18725984017699135, 0.10939548742952268, -0.09321801474148109, -0.11518140553975303, -0.04046720093455763, 0.04539839621087876, 0.0804570916865165, -0.3422630712729544, 0.09577979060991035, 0.06706350421769679, 0.050937451944475506, 0.016013767948446188, -0.17529383994309614, -0.05933517773856939, 0.047266479496694894, -0.0010464507880625805, 0.055987753981251005, 0.11759989078861574, -0.07413771850936815, -0.01635947333936945, 0.2931285382387388, -0.09453484419006816, -0.1635507941902075, 0.07595942780190246, -0.13666975554799177, 0.02446131044690039, 0.1870112971490177, 0.08461023951225878, 0.0644965871682298, -0.11974536522049765, 0.11129963705997956, 0.020963041499663576, 0.2209492396326602, 0.21679324707407402, 0.04398556303063109, 0.14041405087253284, 0.07034048363592126, 0.16513116834093483, 0.13378031015362674, -0.14871472663642293, -0.002079747837211793, -0.2578257971546305, -0.047527998814472505, -0.278753170870934, 0.019029891363458284, -0.18916174237830538, -0.2060325889287321, 0.44019452080603955, 0.03218689373982504, 0.20591039493041968, 0.08313522025819312, 0.3106632803808589, 0.24042536118659524, 0.07938288874378767, 0.09220642741327045, 0.22461885969200845, 0.17070051902411146, 0.01867446857530274, -0.24897368393133482, 0.00720074435905682, 0.023448121555159848]
|
1,803.04079
|
A generalized wave-particle duality relation for finite groups
|
Wave-particle duality relations express the fact that knowledge about the
path a particle took suppresses information about its wave-like properties, in
particular, its ability to generate an interference pattern. Recently, duality
relations in which the wave-like properties are quantified by using measures of
quantum coherence have been proposed. Quantum coherence can be generalized to a
property called group asymmetry. Here we derive a generalized duality relation
involving group asymmetry, which is closely related to the success probability
of discriminating between the actions of the elements of a group. The second
quantity in the duality relation, the one generalizing which-path information,
is related to information about the irreducible representations that make up
the group representation.
|
quant-ph
|
waveparticle duality relations express the fact that knowledge about the path a particle took suppresses information about its wavelike properties in particular its ability to generate an interference pattern recently duality relations in which the wavelike properties are quantified by using measures of quantum coherence have been proposed quantum coherence can be generalized to a property called group asymmetry here we derive a generalized duality relation involving group asymmetry which is closely related to the success probability of discriminating between the actions of the elements of a group the second quantity in the duality relation the one generalizing whichpath information is related to information about the irreducible representations that make up the group representation
|
[['waveparticle', 'duality', 'relations', 'express', 'the', 'fact', 'that', 'knowledge', 'about', 'the', 'path', 'a', 'particle', 'took', 'suppresses', 'information', 'about', 'its', 'wavelike', 'properties', 'in', 'particular', 'its', 'ability', 'to', 'generate', 'an', 'interference', 'pattern', 'recently', 'duality', 'relations', 'in', 'which', 'the', 'wavelike', 'properties', 'are', 'quantified', 'by', 'using', 'measures', 'of', 'quantum', 'coherence', 'have', 'been', 'proposed', 'quantum', 'coherence', 'can', 'be', 'generalized', 'to', 'a', 'property', 'called', 'group', 'asymmetry', 'here', 'we', 'derive', 'a', 'generalized', 'duality', 'relation', 'involving', 'group', 'asymmetry', 'which', 'is', 'closely', 'related', 'to', 'the', 'success', 'probability', 'of', 'discriminating', 'between', 'the', 'actions', 'of', 'the', 'elements', 'of', 'a', 'group', 'the', 'second', 'quantity', 'in', 'the', 'duality', 'relation', 'the', 'one', 'generalizing', 'whichpath', 'information', 'is', 'related', 'to', 'information', 'about', 'the', 'irreducible', 'representations', 'that', 'make', 'up', 'the', 'group', 'representation']]
|
[-0.1266227724161326, 0.14697625132376152, -0.18426665679330573, 0.12764411079166293, -0.1365601835739717, -0.10399754624813795, 0.02190801243118027, 0.3283313530039761, -0.3442240655401787, -0.2858901385038176, 0.0540680672468928, -0.29524040432940973, -0.19238759203111394, 0.1543668994522784, -0.08501168902914383, 0.010503399781188355, -0.0020649264476735865, 0.10989831363488185, -0.11555488088593018, -0.1959540228800554, 0.3273594411776254, 0.037717813070405996, 0.33688289079030875, 0.0626352487801852, 0.14518775416766866, 0.025133190341620593, -0.04230343956467614, -0.009570505581346847, -0.09482052983583887, 0.15160394015542247, 0.24403961094937762, 0.1568636591117339, 0.21280681887404634, -0.3899661449290681, -0.20444853541751704, 0.11255651436288629, 0.11669458935788848, 0.07666905187356302, -0.03776793326496294, -0.31382841393024774, 0.06050738910000706, -0.1618697514447073, -0.11730715681864112, -0.06556562464194078, 0.02371489160628826, -0.02002543206132638, -0.22558464170351886, 0.07190618048046242, 0.08350615522807889, 0.046474256128963214, 0.02421206681735879, -0.0032730871125271448, -0.0018777154230823119, 0.1785422038826111, 0.016243072598355644, 0.022027083052722572, 0.09183162242876725, -0.15087946356639773, -0.1653546106627848, 0.3712347234158139, -0.006222804442554582, -0.21784349780513398, 0.14381026114304468, -0.15322934930711135, -0.1406975799901901, 0.08997287341034073, 0.1216937942316004, 0.07775449878388092, -0.16015447980087055, 0.04253615862118047, -0.10720974032914168, 0.15655560552432576, 0.10113030138196782, 0.14316896614853472, 0.1997384627188455, 0.0874158558987179, 0.03616131830086376, 0.12876800292788335, -0.0176280375177923, -0.13996604164825394, -0.2821221559047045, -0.1980247473581122, -0.1619944918774101, 0.047971507583401705, -0.07349040167275489, -0.07398790264861625, 0.3745013045620892, 0.15352972344854815, 0.1725537336406935, 0.04375153985650589, 0.23255101160816194, 0.12849967847496532, 0.10213038547520052, 0.02730629020860713, 0.21287205803265238, 0.24468783652940929, 0.025363207708946185, -0.2524759615957839, 0.09447759688472408, 0.11223050730972829]
|
1,803.0408
|
Rashba induced Kondo screening of a magnetic impurity in two-dimensional
superconductor
|
We study the Kondo screening of a magnetic impurity in a two-dimensional
superconductor with Rashba spin-orbit coupling (SOC). It is found that the
Rashba interaction generates a novel Kondo screening channel, in which the
local moment is screened by the exchange coupling with conduction electrons in
different spin and orbital states. The Kondo temperature associated with this
process is determined by the interplay between the Rashba SOC and
superconducting energy gap. As a result, the quantum phase transition between
the magnetic doublet and Kondo singlet ground states is significantly affected
by increasing Rashba SOC in such a system. This result uncovers that the Rashba
SOC plays an instructive role and provides a novel screening channel for the
Kondo effect, which is expected to be observed in future experiments.
|
cond-mat.str-el
|
we study the kondo screening of a magnetic impurity in a twodimensional superconductor with rashba spinorbit coupling soc it is found that the rashba interaction generates a novel kondo screening channel in which the local moment is screened by the exchange coupling with conduction electrons in different spin and orbital states the kondo temperature associated with this process is determined by the interplay between the rashba soc and superconducting energy gap as a result the quantum phase transition between the magnetic doublet and kondo singlet ground states is significantly affected by increasing rashba soc in such a system this result uncovers that the rashba soc plays an instructive role and provides a novel screening channel for the kondo effect which is expected to be observed in future experiments
|
[['we', 'study', 'the', 'kondo', 'screening', 'of', 'a', 'magnetic', 'impurity', 'in', 'a', 'twodimensional', 'superconductor', 'with', 'rashba', 'spinorbit', 'coupling', 'soc', 'it', 'is', 'found', 'that', 'the', 'rashba', 'interaction', 'generates', 'a', 'novel', 'kondo', 'screening', 'channel', 'in', 'which', 'the', 'local', 'moment', 'is', 'screened', 'by', 'the', 'exchange', 'coupling', 'with', 'conduction', 'electrons', 'in', 'different', 'spin', 'and', 'orbital', 'states', 'the', 'kondo', 'temperature', 'associated', 'with', 'this', 'process', 'is', 'determined', 'by', 'the', 'interplay', 'between', 'the', 'rashba', 'soc', 'and', 'superconducting', 'energy', 'gap', 'as', 'a', 'result', 'the', 'quantum', 'phase', 'transition', 'between', 'the', 'magnetic', 'doublet', 'and', 'kondo', 'singlet', 'ground', 'states', 'is', 'significantly', 'affected', 'by', 'increasing', 'rashba', 'soc', 'in', 'such', 'a', 'system', 'this', 'result', 'uncovers', 'that', 'the', 'rashba', 'soc', 'plays', 'an', 'instructive', 'role', 'and', 'provides', 'a', 'novel', 'screening', 'channel', 'for', 'the', 'kondo', 'effect', 'which', 'is', 'expected', 'to', 'be', 'observed', 'in', 'future', 'experiments']]
|
[-0.24323793598887278, 0.22704353491110396, -0.011968172068009153, 0.07857609444324964, -0.026124870099010877, -0.22181456196631189, 0.0560981509775047, 0.3324865013000817, -0.26828101017235895, -0.31471636466812924, -0.07980735592445853, -0.2762078903360816, -0.14079931152809877, 0.14390033056406537, 0.06200621114294336, -0.05199820859343163, -0.020004990185043425, -0.08298151607414184, -0.10000834021229821, -0.21901759623142425, 0.3439886367050349, 0.03820610071397823, 0.28042173341600574, 0.17717237044780632, -0.0013812924589728937, 0.02956584233106696, 0.17964697508796235, 0.005628216487593818, -0.08848743531370928, 0.032202528432208055, 0.22758213089446144, -0.15921727231761906, 0.2372953965823399, -0.3950827778025996, -0.16516364070412237, -0.010237586395305698, 0.11298471422196599, 0.18153945273479621, -0.09340120328306512, -0.35776783047185745, -0.021869266251542285, -0.21476063286536373, -0.06949454517234699, -0.07889530608736095, 0.01624844368052436, -0.07364329305164574, -0.349734336417896, 0.10678199104404484, 0.0900233919492166, 0.09479174411535496, -0.0723175361927133, -0.10358730911229941, -0.06624740693951026, 0.056499496480682865, 0.09045073324682562, 0.08047403458112967, 0.14040022964400123, -0.13215934580148314, -0.10813329712982522, 0.373383750236826, -0.10541701321744767, -0.12377391102086222, 0.16710251227868866, -0.14132653214983293, -0.011191576533747138, 0.12323279696283862, 0.11247249434381956, 0.020625515735446243, -0.1432230618520407, 0.14852535398495093, -0.038006359623977914, 0.14993064295686054, -0.07562150944613677, 0.10758593723767262, 0.30411410226952285, 0.2216339535661973, 0.08911713306588354, 0.15341694994913269, -0.15052721659185408, -0.09420194389531389, -0.21132450418372173, -0.16747013595886528, -0.2981269138545031, 0.07041172195204126, -0.047849159261659224, -0.1692625045980094, 0.43478153471369296, 0.19118695929500973, 0.1785940207191743, -0.10523502467276558, 0.22062064936108072, 0.14488755349611893, 0.10446294416396995, 0.04221629982475861, 0.2935578825781704, 0.17795506254515203, 0.09694626558484742, -0.40802725342291524, 0.07036425383194, 0.02317998818034539]
|
1,803.04081
|
Nilpotence of Frobenius actions on local cohomology and Frobenius
closure of ideals
|
The study of Frobenius actions on local cohomology modules over a local ring
of prime characteristic has interesting connections with the theory of tight
closure. This paper establishes new connections by developing the notion of
relative Frobenius actions on local cohomology. As an application, we show that
a ring has $F$-nilpotent singularities if and only if the tight closure of
every parameter ideal is equal to its Frobenius closure.
|
math.AC math.AG
|
the study of frobenius actions on local cohomology modules over a local ring of prime characteristic has interesting connections with the theory of tight closure this paper establishes new connections by developing the notion of relative frobenius actions on local cohomology as an application we show that a ring has fnilpotent singularities if and only if the tight closure of every parameter ideal is equal to its frobenius closure
|
[['the', 'study', 'of', 'frobenius', 'actions', 'on', 'local', 'cohomology', 'modules', 'over', 'a', 'local', 'ring', 'of', 'prime', 'characteristic', 'has', 'interesting', 'connections', 'with', 'the', 'theory', 'of', 'tight', 'closure', 'this', 'paper', 'establishes', 'new', 'connections', 'by', 'developing', 'the', 'notion', 'of', 'relative', 'frobenius', 'actions', 'on', 'local', 'cohomology', 'as', 'an', 'application', 'we', 'show', 'that', 'a', 'ring', 'has', 'fnilpotent', 'singularities', 'if', 'and', 'only', 'if', 'the', 'tight', 'closure', 'of', 'every', 'parameter', 'ideal', 'is', 'equal', 'to', 'its', 'frobenius', 'closure']]
|
[-0.23189183414333325, 0.021163199915410612, -0.11349644331072552, 0.05393501804412707, -0.07922589085807187, -0.1400381775262455, -0.011678323142932377, 0.30394651038923126, -0.3660601164092836, -0.1930144159798173, 0.0862815463308083, -0.19341925221184889, -0.192927122278058, 0.1808638379274719, -0.15554991126924322, -0.07209993218345082, 0.04629411237935225, 0.1739254534393009, -0.12590134943889428, -0.29144820579044195, 0.4263227375804622, 0.06032542522618736, 0.20464545109417234, 0.050515780326415974, 0.12849537044277656, 0.02297609532251954, -0.003450309290834095, 0.0398175984998976, -0.18377028472193913, 0.14338419757837403, 0.27024978661126847, 0.07801408270724873, 0.28067655743275216, -0.39818684749121347, -0.08889800459956346, 0.21341183398296867, 0.10723981667525959, -0.022706640020444775, -0.008728089715367641, -0.23072950234231743, 0.17847326874355043, -0.21814843515555063, -0.12433490127939191, -0.1022679374107848, 0.10827090782855732, 0.0527179549900356, -0.22082661055838285, -0.053229261506888746, 0.10649717127808549, 0.16948220634536035, -0.06876935378439131, -0.02037963275190281, -0.016693395565844316, 0.09108557913830315, -0.007435093358820439, 0.021302742502260684, 0.11700665606506358, -0.0976656352210304, -0.12742021944427837, 0.34467115204619325, -0.05657150360850104, -0.16012564440176863, 0.1710927397876546, -0.17255909286736362, -0.1244115418707277, 0.10458309710889623, 0.02743512826661269, 0.12815646605863087, -0.015955713145650814, 0.2168539601464189, -0.18133265199814586, 0.09554869152497554, 0.07363641179720129, 0.04837443294219565, 0.1672307436550171, 0.1327609681672808, 0.15529273978208422, 0.10162095282145817, -0.01969729389141624, -0.03084215629791868, -0.36227051514214365, -0.1949758413247764, -0.15145550859903079, 0.12400377977747416, -0.10954468918983669, -0.1532752638871687, 0.4438842153581588, 0.05678896445349075, 0.17764777601089166, 0.1114850081368417, 0.2855867083197918, 0.05438441797868227, 0.0954338693788842, 0.06311018299986271, 0.17269883400666108, 0.25081541251890577, -0.07572775293121357, -0.16429686459942142, 0.03314157692121639, 0.18703606410248988]
|
1,803.04082
|
Real entropy rigidity under quasi-conformal deformations
|
We set up a real entropy function $h_\Bbb{R}$ on the space $\mathcal{M}'_d$
of M\"obius conjugacy classes of real rational maps of degree $d$ by assigning
to each class the real entropy of a representative $f\in\Bbb{R}(z)$; namely,
the topological entropy of its restriction $f\restriction_{\hat{\Bbb{R}}}$ to
the real circle. We prove a rigidity result stating that $h_\Bbb{R}$ is locally
constant on the subspace determined by real maps quasi-conformally conjugate to
$f$. As examples of this result, we analyze real analytic stable families of
hyperbolic and flexible Latt\`es maps with real coefficients along with
numerous families of degree $d$ real maps of real entropy $\log(d)$. The latter
discussion moreover entails a complete classification of maps of maximal real
entropy.
|
math.DS
|
we set up a real entropy function h_bbbr on the space mathcalm_d of mobius conjugacy classes of real rational maps of degree d by assigning to each class the real entropy of a representative finbbbrz namely the topological entropy of its restriction frestriction_hatbbbr to the real circle we prove a rigidity result stating that h_bbbr is locally constant on the subspace determined by real maps quasiconformally conjugate to f as examples of this result we analyze real analytic stable families of hyperbolic and flexible lattes maps with real coefficients along with numerous families of degree d real maps of real entropy logd the latter discussion moreover entails a complete classification of maps of maximal real entropy
|
[['we', 'set', 'up', 'a', 'real', 'entropy', 'function', 'h_bbbr', 'on', 'the', 'space', 'mathcalm_d', 'of', 'mobius', 'conjugacy', 'classes', 'of', 'real', 'rational', 'maps', 'of', 'degree', 'd', 'by', 'assigning', 'to', 'each', 'class', 'the', 'real', 'entropy', 'of', 'a', 'representative', 'finbbbrz', 'namely', 'the', 'topological', 'entropy', 'of', 'its', 'restriction', 'frestriction_hatbbbr', 'to', 'the', 'real', 'circle', 'we', 'prove', 'a', 'rigidity', 'result', 'stating', 'that', 'h_bbbr', 'is', 'locally', 'constant', 'on', 'the', 'subspace', 'determined', 'by', 'real', 'maps', 'quasiconformally', 'conjugate', 'to', 'f', 'as', 'examples', 'of', 'this', 'result', 'we', 'analyze', 'real', 'analytic', 'stable', 'families', 'of', 'hyperbolic', 'and', 'flexible', 'lattes', 'maps', 'with', 'real', 'coefficients', 'along', 'with', 'numerous', 'families', 'of', 'degree', 'd', 'real', 'maps', 'of', 'real', 'entropy', 'logd', 'the', 'latter', 'discussion', 'moreover', 'entails', 'a', 'complete', 'classification', 'of', 'maps', 'of', 'maximal', 'real', 'entropy']]
|
[-0.17927655232571332, 0.08632960459051121, -0.030239319836255163, 0.022926657389949208, -0.05325102419426132, -0.12706940020351404, 0.044722056861051636, 0.3289347578704889, -0.300726211762854, -0.21367599751933344, 0.0973504628532932, -0.2977178371927169, -0.18924705383168267, 0.24906601613786603, -0.09597155859228224, 0.08792848562370637, 0.04553495852763133, 0.08739296031334172, -0.0895733022126868, -0.3083404568283835, 0.4185441674365263, -0.0749289157496865, 0.2157812755285704, 0.06330108090021115, 0.14270421474066097, -0.006745308043069339, -0.055249502751394175, 0.03376142522211012, -0.161758047901003, 0.15855169188164706, 0.21450212648155034, 0.16695763667303254, 0.20144134067439673, -0.2778009460473965, -0.19469877951321127, 0.22767265598979844, 0.050280015175563415, 0.00894750961534945, 0.0017646568095577614, -0.2880855917880711, 0.11217637816194578, -0.1055902960176484, -0.17463209162399704, -0.13755165219273685, 0.07475191378034651, 0.026294905675708184, -0.23939064095195914, 0.030135318445640484, 0.07927752203873492, 0.142533651544779, -0.06921199323447322, -0.058541988240384465, -0.1017977211221088, 0.11377523150960249, 0.01335015931856885, 0.05259342103298487, 0.11387436474407357, -0.03170332733550042, -0.11648809752244103, 0.34416493377648294, -0.07771195963765162, -0.2643335764096264, 0.20220928708191163, -0.17884265411495498, -0.15268922551851055, 0.12599647406854533, 0.1642025367972175, 0.14900042000226676, -0.031233665155014023, 0.170830074123452, -0.11919853137806058, 0.11800417446439886, 0.09706696322453874, -0.05007824071799405, 0.12886239809241878, 0.03078572326921858, 0.12757111542824923, 0.21349181081002047, 0.015199264835765851, -0.07365433110888782, -0.3554217597702518, -0.21284091167763108, -0.22070064614152735, 0.12108317126694601, -0.16501262012323942, -0.23271986160710054, 0.44014656124220763, 0.015626909240381792, 0.2678273712933463, 0.13009999026378086, 0.2679199232994246, 0.08825455378207282, 0.030318404757833508, 0.04496504400075147, 0.08252626991348475, 0.14455904300848488, -0.009742967684620194, -0.14112380632182717, -0.009545664769705451, 0.12664986754576343]
|
1,803.04083
|
Zeroth law of thermodynamics for thermalized open quantum systems having
integrals of motion
|
We study the evolution of an open quantum system described by a dynamical
semigroup having the Lindblad superoperator as a generator. This generator may
have an eigenfunction with a unity eigenvalue, referred to as a constant of
motion (COM). An open quantum system has a unique stationary state if and only
if it has no COMs. A system with multiple stationary states has a basis of
COMs; any COM of the system is a linear combination of the basis COMs. The
basis divides the space of system states into subspaces. Each subspace has its
own stationary state, and any stationary state of the system is a linear
combination of these states. Usually, neither the basis of COMs nor even the
number of COMs is known. We demonstrate that finding the stationary state of
the system does not require looking for the COMs. Instead, one can construct a
set of invariant subspaces. If the system evolution begins from one of these
subspaces, the system will remain in it, arriving at a stationary state
independent of evolution in other subspaces. We suggest a direct way of finding
the invariant subspaces by studying the evolution of the system. We show that
the sets of invariant subspaces and subspaces generated by the basis of COMs
are equivalent. A stationary state of the system is a weighted sum of
stationary states in each invariant subspace; the weighted factors are
determined by the initial state of the system.
|
quant-ph
|
we study the evolution of an open quantum system described by a dynamical semigroup having the lindblad superoperator as a generator this generator may have an eigenfunction with a unity eigenvalue referred to as a constant of motion com an open quantum system has a unique stationary state if and only if it has no coms a system with multiple stationary states has a basis of coms any com of the system is a linear combination of the basis coms the basis divides the space of system states into subspaces each subspace has its own stationary state and any stationary state of the system is a linear combination of these states usually neither the basis of coms nor even the number of coms is known we demonstrate that finding the stationary state of the system does not require looking for the coms instead one can construct a set of invariant subspaces if the system evolution begins from one of these subspaces the system will remain in it arriving at a stationary state independent of evolution in other subspaces we suggest a direct way of finding the invariant subspaces by studying the evolution of the system we show that the sets of invariant subspaces and subspaces generated by the basis of coms are equivalent a stationary state of the system is a weighted sum of stationary states in each invariant subspace the weighted factors are determined by the initial state of the system
|
[['we', 'study', 'the', 'evolution', 'of', 'an', 'open', 'quantum', 'system', 'described', 'by', 'a', 'dynamical', 'semigroup', 'having', 'the', 'lindblad', 'superoperator', 'as', 'a', 'generator', 'this', 'generator', 'may', 'have', 'an', 'eigenfunction', 'with', 'a', 'unity', 'eigenvalue', 'referred', 'to', 'as', 'a', 'constant', 'of', 'motion', 'com', 'an', 'open', 'quantum', 'system', 'has', 'a', 'unique', 'stationary', 'state', 'if', 'and', 'only', 'if', 'it', 'has', 'no', 'coms', 'a', 'system', 'with', 'multiple', 'stationary', 'states', 'has', 'a', 'basis', 'of', 'coms', 'any', 'com', 'of', 'the', 'system', 'is', 'a', 'linear', 'combination', 'of', 'the', 'basis', 'coms', 'the', 'basis', 'divides', 'the', 'space', 'of', 'system', 'states', 'into', 'subspaces', 'each', 'subspace', 'has', 'its', 'own', 'stationary', 'state', 'and', 'any', 'stationary', 'state', 'of', 'the', 'system', 'is', 'a', 'linear', 'combination', 'of', 'these', 'states', 'usually', 'neither', 'the', 'basis', 'of', 'coms', 'nor', 'even', 'the', 'number', 'of', 'coms', 'is', 'known', 'we', 'demonstrate', 'that', 'finding', 'the', 'stationary', 'state', 'of', 'the', 'system', 'does', 'not', 'require', 'looking', 'for', 'the', 'coms', 'instead', 'one', 'can', 'construct', 'a', 'set', 'of', 'invariant', 'subspaces', 'if', 'the', 'system', 'evolution', 'begins', 'from', 'one', 'of', 'these', 'subspaces', 'the', 'system', 'will', 'remain', 'in', 'it', 'arriving', 'at', 'a', 'stationary', 'state', 'independent', 'of', 'evolution', 'in', 'other', 'subspaces', 'we', 'suggest', 'a', 'direct', 'way', 'of', 'finding', 'the', 'invariant', 'subspaces', 'by', 'studying', 'the', 'evolution', 'of', 'the', 'system', 'we', 'show', 'that', 'the', 'sets', 'of', 'invariant', 'subspaces', 'and', 'subspaces', 'generated', 'by', 'the', 'basis', 'of', 'coms', 'are', 'equivalent', 'a', 'stationary', 'state', 'of', 'the', 'system', 'is', 'a', 'weighted', 'sum', 'of', 'stationary', 'states', 'in', 'each', 'invariant', 'subspace', 'the', 'weighted', 'factors', 'are', 'determined', 'by', 'the', 'initial', 'state', 'of', 'the', 'system']]
|
[-0.17337135694322584, 0.12202252756604831, -0.10524690844511136, 0.007226604921647063, 0.008788490385078817, -0.09955082867681318, 0.018518406235851534, 0.3262771823220263, -0.2948788510065926, -0.2101307737925821, 0.13169576840937977, -0.2644808778716328, -0.09904747334509041, 0.15901193222462023, -0.015679127940800317, 0.0804597811447745, 0.1155659032399643, 0.07503332951383218, -0.06205758448085971, -0.20575111084194345, 0.3946508861643316, 0.02806035143300152, 0.21000116327796747, -0.0485827886145408, 0.15001560395491148, -0.03493045613916267, 0.02723817320151855, -0.009757936533953232, -0.0622922478165898, 0.09941086135823896, 0.23287617383921164, 0.17716947262107913, 0.282551107658766, -0.39233810511179085, -0.21209266316530503, 0.14450782926585756, 0.1606380892253658, 0.1254281851247507, -0.006370006131069843, -0.298143564906233, 0.05616450098161355, -0.157130076372919, -0.1630700088639105, -0.07999660115311892, 0.040908631510755494, 0.0162472192319264, -0.261451705721638, 0.029308487703515726, 0.08808481098912282, 0.030760622564087476, -0.11427818403785187, -0.10603377448341017, -0.0741638309247253, 0.1292144453580191, -0.03222815168652037, 0.03731468827694593, 0.13656666054013222, -0.09168230989478406, -0.12641781308757497, 0.3800274452660233, -0.07065121426385604, -0.2500266084462656, 0.20425138450112224, -0.16388224254454647, -0.11439398456795895, 0.14464355153147102, 0.11843431582058633, 0.10960887332854807, -0.1374361171187017, 0.0996818794430946, -0.10748008811559667, 0.18544961162169332, 0.008093033786401275, 0.0655960369588661, 0.22180007683490366, 0.12857868114855786, 0.12139680096206125, 0.13472323604567893, -0.03282779587378864, -0.09499200862401343, -0.3031475351729396, -0.1929277620674688, -0.22151071520345209, 0.07058881170550277, -0.03793597364843167, -0.19463451228042958, 0.4132853355239461, 0.05341100365294851, 0.21525996099880412, 0.004383585732314767, 0.24070183981079146, 0.15699673602642533, 0.019486909331022647, 0.11441255288106228, 0.1891930695471146, 0.11910139561692361, 0.024714694958765153, -0.2324117437851219, 0.10305343536575409, 0.07688793900984624]
|
1,803.04084
|
Link prediction for egocentrically sampled networks
|
Link prediction in networks is typically accomplished by estimating or
ranking the probabilities of edges for all pairs of nodes. In practice,
especially for social networks, the data are often collected by egocentric
sampling, which means selecting a subset of nodes and recording all of their
edges. This sampling mechanism requires different prediction tools than the
typical assumption of links missing at random. We propose a new computationally
efficient link prediction algorithm for egocentrically sampled networks, which
estimates the underlying probability matrix by estimating its row space. For
networks created by sampling rows, our method outperforms many popular link
prediction and graphon estimation techniques.
|
stat.CO cs.LG stat.ML
|
link prediction in networks is typically accomplished by estimating or ranking the probabilities of edges for all pairs of nodes in practice especially for social networks the data are often collected by egocentric sampling which means selecting a subset of nodes and recording all of their edges this sampling mechanism requires different prediction tools than the typical assumption of links missing at random we propose a new computationally efficient link prediction algorithm for egocentrically sampled networks which estimates the underlying probability matrix by estimating its row space for networks created by sampling rows our method outperforms many popular link prediction and graphon estimation techniques
|
[['link', 'prediction', 'in', 'networks', 'is', 'typically', 'accomplished', 'by', 'estimating', 'or', 'ranking', 'the', 'probabilities', 'of', 'edges', 'for', 'all', 'pairs', 'of', 'nodes', 'in', 'practice', 'especially', 'for', 'social', 'networks', 'the', 'data', 'are', 'often', 'collected', 'by', 'egocentric', 'sampling', 'which', 'means', 'selecting', 'a', 'subset', 'of', 'nodes', 'and', 'recording', 'all', 'of', 'their', 'edges', 'this', 'sampling', 'mechanism', 'requires', 'different', 'prediction', 'tools', 'than', 'the', 'typical', 'assumption', 'of', 'links', 'missing', 'at', 'random', 'we', 'propose', 'a', 'new', 'computationally', 'efficient', 'link', 'prediction', 'algorithm', 'for', 'egocentrically', 'sampled', 'networks', 'which', 'estimates', 'the', 'underlying', 'probability', 'matrix', 'by', 'estimating', 'its', 'row', 'space', 'for', 'networks', 'created', 'by', 'sampling', 'rows', 'our', 'method', 'outperforms', 'many', 'popular', 'link', 'prediction', 'and', 'graphon', 'estimation', 'techniques']]
|
[-0.13030608283056958, 0.07197699923954833, -0.0008527845135316825, 0.11235710661835932, -0.0693419412284409, -0.18947611369926912, 0.1257332261168183, 0.44717881069160426, -0.26978888478165924, -0.35058659595401526, 0.10983342728622329, -0.26973036515454835, -0.18130512382665004, 0.1416442652004592, -0.08614282011806679, 0.09257811849630133, 0.16407968051051006, 0.03555239740615854, -0.03209289804418894, -0.2568428149052824, 0.3000997880366273, 0.0568282304582401, 0.33325602262182374, -0.05014386835346858, 0.103455774205101, 0.08831541092457393, -0.12356867524683296, 0.0034831962231972003, -0.07211205372228645, 0.18838059489140646, 0.3105859015754854, 0.18210855369957593, 0.3465881283538273, -0.41911396459013656, -0.24437164912859982, 0.17364260993109873, 0.14731819128456453, 0.07538692688775392, -0.024375684599642858, -0.30035645126974064, 0.11414247346916594, -0.1418405743315816, -0.00571055582734586, -0.08259096549367174, -0.02770146316078563, 0.004450613140271833, -0.33897074398835403, 0.05507798225600989, -0.014279045648156451, 0.05337101463318014, 0.03928229000638776, -0.14408763589409107, 0.02095196808043581, 0.15022410481469706, 0.028621781324125968, 0.010653939921982013, 0.1332571408845699, -0.1729157130981688, -0.1695684041478671, 0.3370942202880262, 0.021283485104364584, -0.20752947833030844, 0.1612589888704511, -0.058653719360546135, -0.16116314622698924, 0.1531595980229143, 0.18291829636571214, 0.108649860622021, -0.20986494119279087, -0.017714294109072607, -0.049733095963557176, 0.09039493596467835, 0.05146540477961445, 0.018925295412862815, 0.14878733690756446, 0.20967822453866786, 0.08522486469938975, 0.05433089755779992, -0.10762162785253028, -0.07774752005934715, -0.1964299847045018, -0.08767270093085244, -0.3007914744151864, -0.03582053685722013, -0.18499231480298198, -0.1727904764523443, 0.4048404228972056, 0.16980558195008108, 0.2199920533815972, 0.12826990478676564, 0.3406896323520833, 0.044088896705383934, 0.05898344711994678, 0.12783175684699716, 0.11708369620184665, 0.06568850004651512, 0.055159116808611616, -0.08068117145963837, 0.19786998084209, 0.0795449097304999]
|
1,803.04085
|
Temporal processing and context dependency in C. elegans
mechanosensation
|
A quantitative understanding of how sensory signals are transformed into
motor outputs places useful constraints on brain function and helps reveal the
brain's underlying computations. We investigate how the nematode C. elegans
responds to time-varying mechanosensory signals using a high-throughput
optogenetic assay and automated behavior quantification. In the prevailing
picture of the touch circuit, the animal's behavior is determined by which
neurons are stimulated and by the stimulus amplitude. In contrast, we find that
the behavioral response is tuned to temporal properties of mechanosensory
signals, like its integral and derivative, that extend over many seconds.
Mechanosensory signals, even in the same neurons, can be tailored to elicit
different behavioral responses. Moreover, we find that the animal's response
also depends on its behavioral context. Most dramatically, the animal ignores
all tested mechanosensory stimuli during turns. Finally, we present a
linear-nonlinear model that predicts the animal's behavioral response to
stimulus.
|
q-bio.NC physics.bio-ph
|
a quantitative understanding of how sensory signals are transformed into motor outputs places useful constraints on brain function and helps reveal the brains underlying computations we investigate how the nematode c elegans responds to timevarying mechanosensory signals using a highthroughput optogenetic assay and automated behavior quantification in the prevailing picture of the touch circuit the animals behavior is determined by which neurons are stimulated and by the stimulus amplitude in contrast we find that the behavioral response is tuned to temporal properties of mechanosensory signals like its integral and derivative that extend over many seconds mechanosensory signals even in the same neurons can be tailored to elicit different behavioral responses moreover we find that the animals response also depends on its behavioral context most dramatically the animal ignores all tested mechanosensory stimuli during turns finally we present a linearnonlinear model that predicts the animals behavioral response to stimulus
|
[['a', 'quantitative', 'understanding', 'of', 'how', 'sensory', 'signals', 'are', 'transformed', 'into', 'motor', 'outputs', 'places', 'useful', 'constraints', 'on', 'brain', 'function', 'and', 'helps', 'reveal', 'the', 'brains', 'underlying', 'computations', 'we', 'investigate', 'how', 'the', 'nematode', 'c', 'elegans', 'responds', 'to', 'timevarying', 'mechanosensory', 'signals', 'using', 'a', 'highthroughput', 'optogenetic', 'assay', 'and', 'automated', 'behavior', 'quantification', 'in', 'the', 'prevailing', 'picture', 'of', 'the', 'touch', 'circuit', 'the', 'animals', 'behavior', 'is', 'determined', 'by', 'which', 'neurons', 'are', 'stimulated', 'and', 'by', 'the', 'stimulus', 'amplitude', 'in', 'contrast', 'we', 'find', 'that', 'the', 'behavioral', 'response', 'is', 'tuned', 'to', 'temporal', 'properties', 'of', 'mechanosensory', 'signals', 'like', 'its', 'integral', 'and', 'derivative', 'that', 'extend', 'over', 'many', 'seconds', 'mechanosensory', 'signals', 'even', 'in', 'the', 'same', 'neurons', 'can', 'be', 'tailored', 'to', 'elicit', 'different', 'behavioral', 'responses', 'moreover', 'we', 'find', 'that', 'the', 'animals', 'response', 'also', 'depends', 'on', 'its', 'behavioral', 'context', 'most', 'dramatically', 'the', 'animal', 'ignores', 'all', 'tested', 'mechanosensory', 'stimuli', 'during', 'turns', 'finally', 'we', 'present', 'a', 'linearnonlinear', 'model', 'that', 'predicts', 'the', 'animals', 'behavioral', 'response', 'to', 'stimulus']]
|
[-0.08564455043902067, 0.1528764935106124, -0.07932971424432597, 0.06093806458630826, -0.1422223573726778, -0.1661036283413351, 0.039994468624590315, 0.4201142010404854, -0.27055181574620735, -0.24751497923421698, 0.05532026057826934, -0.2676184935695051, -0.3265962717249184, 0.20301072384904115, -0.10355584837049497, 0.005675798936470135, 0.04332306358579395, 0.08267629718741502, 0.0468850597681012, -0.18087245149920794, 0.19545115398029117, 0.020443004913898687, 0.30789269404045333, -0.015654040616150392, 0.12117748770145448, 0.020342272309888457, -0.02571782631157721, 0.009738757010750674, -0.07874937092816942, 0.1207398213068577, 0.3051813967868912, 0.19366325989422212, 0.2800395309144782, -0.5289190876473849, -0.2522453000970386, 0.10883296734175167, 0.10756152274198767, 0.09342006846516696, 0.013412512198556215, -0.3001014633620208, 0.07217697393325334, -0.10137167246225667, -0.05259074869792204, -0.13088366121362038, 0.03272124877627436, 0.058921517964729386, -0.2423745796172502, 0.06367574265754523, 0.026603966913220624, 0.11433301968625872, -0.09565129712683375, -0.03803701136053565, -0.03279814687148492, 0.22022854805156286, 0.04998271593054547, -0.0021722095489904686, 0.2783663694092349, -0.17232912398066144, -0.11519638874026872, 0.3323828854371567, -0.03596445795571797, -0.1757475450370269, 0.21974960425113504, -0.13802588412324218, -0.11552499549941637, 0.09793218458763304, 0.17753727198578417, 0.04256755141446971, -0.1881441097782069, -0.006802917223713185, 0.001097697821269567, 0.2525227016366616, 0.06596248706399992, 0.0031412919240726813, 0.19615077356354813, 0.19559030921349452, -0.030073503715086828, 0.14517213678541216, -0.06210962144698872, -0.056578768155304715, -0.2146536518695349, -0.07438210193445352, -0.1031540340430896, 0.005137559429607102, -0.07806751638536052, -0.11196904252692302, 0.4657495690862069, 0.2053929801331833, 0.20279643713572137, 0.10468122037835545, 0.25627091232485866, 0.07225150575962018, 0.08750913037707701, -0.009688177199505672, 0.1987170634800694, 0.0648821621198786, 0.13339950082858243, -0.2872891643374051, 0.1893037517737547, -0.020519919761116744]
|
1,803.04086
|
Tunable single-photon diode by chiral quantum physics
|
We investigate the single photon scattering by an emitter chirally coupled to
a one-dimensional waveguide. The single-photon transport property is
essentially different from the symmetrical coupling case. The single photons
propagating towards the emitter in opposite directions show different
transmission behaviors, which is a manifestation of the single-photon diode. In
the ideal chiral coupling case, the transmission probability of the single
photon transport in one direction is zero by critical coupling, while in the
opposite direction it is unity. The diode works well only when the
single-photon frequency meets certain conditions. For a two-level emitter, the
diode works well when the single photon is nearly resonant to the emitter. For
a $\Lambda $-type three-level emitter, when the single-photon frequency is
greatly altered, we can adjust the parameters of the external laser to ensure
the diode works well. The latter provides a manner to realize a single-photon
switch, in which the single-photon transmission probability can reach zero or
unity although the emitter's decay is considered.
|
quant-ph
|
we investigate the single photon scattering by an emitter chirally coupled to a onedimensional waveguide the singlephoton transport property is essentially different from the symmetrical coupling case the single photons propagating towards the emitter in opposite directions show different transmission behaviors which is a manifestation of the singlephoton diode in the ideal chiral coupling case the transmission probability of the single photon transport in one direction is zero by critical coupling while in the opposite direction it is unity the diode works well only when the singlephoton frequency meets certain conditions for a twolevel emitter the diode works well when the single photon is nearly resonant to the emitter for a lambda type threelevel emitter when the singlephoton frequency is greatly altered we can adjust the parameters of the external laser to ensure the diode works well the latter provides a manner to realize a singlephoton switch in which the singlephoton transmission probability can reach zero or unity although the emitters decay is considered
|
[['we', 'investigate', 'the', 'single', 'photon', 'scattering', 'by', 'an', 'emitter', 'chirally', 'coupled', 'to', 'a', 'onedimensional', 'waveguide', 'the', 'singlephoton', 'transport', 'property', 'is', 'essentially', 'different', 'from', 'the', 'symmetrical', 'coupling', 'case', 'the', 'single', 'photons', 'propagating', 'towards', 'the', 'emitter', 'in', 'opposite', 'directions', 'show', 'different', 'transmission', 'behaviors', 'which', 'is', 'a', 'manifestation', 'of', 'the', 'singlephoton', 'diode', 'in', 'the', 'ideal', 'chiral', 'coupling', 'case', 'the', 'transmission', 'probability', 'of', 'the', 'single', 'photon', 'transport', 'in', 'one', 'direction', 'is', 'zero', 'by', 'critical', 'coupling', 'while', 'in', 'the', 'opposite', 'direction', 'it', 'is', 'unity', 'the', 'diode', 'works', 'well', 'only', 'when', 'the', 'singlephoton', 'frequency', 'meets', 'certain', 'conditions', 'for', 'a', 'twolevel', 'emitter', 'the', 'diode', 'works', 'well', 'when', 'the', 'single', 'photon', 'is', 'nearly', 'resonant', 'to', 'the', 'emitter', 'for', 'a', 'lambda', 'type', 'threelevel', 'emitter', 'when', 'the', 'singlephoton', 'frequency', 'is', 'greatly', 'altered', 'we', 'can', 'adjust', 'the', 'parameters', 'of', 'the', 'external', 'laser', 'to', 'ensure', 'the', 'diode', 'works', 'well', 'the', 'latter', 'provides', 'a', 'manner', 'to', 'realize', 'a', 'singlephoton', 'switch', 'in', 'which', 'the', 'singlephoton', 'transmission', 'probability', 'can', 'reach', 'zero', 'or', 'unity', 'although', 'the', 'emitters', 'decay', 'is', 'considered']]
|
[-0.18771574501993088, 0.18563940673408158, -0.023091856549244102, -0.0010255481458621145, -0.03475158161727893, -0.2717460127570098, 0.059660336485405155, 0.4447094790904397, -0.24292925376127042, -0.24481919210222436, -0.011791187789285465, -0.292913499844783, -0.033754008607768525, 0.20969724778807153, -0.0010623779859509719, 0.05047844168616504, 0.0025435450356226506, 0.04087147034886407, 0.02873921816424671, -0.14089962640186635, 0.28971211841364003, 0.07645922095980495, 0.38238264134767036, 0.03920953355661434, 0.11186360937497783, 0.018529748532739355, 0.09812449624889003, -0.07786886887227344, -0.05677923152121011, 0.017675625722892243, 0.2368584256789579, -0.010644828897855448, 0.24128480042364994, -0.38678402650147314, -0.20546145262423812, 0.060762445553115045, 0.2032665080907641, 0.1670812888542281, -0.02990378625690937, -0.2834618911913755, 0.012340655678133593, -0.121761162350772, -0.16005605926578184, 0.049179639996642745, -0.05525540466073946, 0.019382156939572293, -0.2624292396485987, -0.008787268744327309, 0.03082111061809062, -0.027347228455743413, 0.019834396111347328, -0.013434902557580754, -0.016460997051071014, 0.08001149038300798, -0.014882596060576871, 0.011923203500351164, 0.2020694397548895, -0.16872535629209312, -0.13710846219328232, 0.35284435204244446, -0.09485647571982997, -0.1953981557854582, 0.1409828828607981, -0.1887763110273404, -0.017876079278056105, 0.1645372380366231, 0.06982244682929865, 0.12139220009046811, -0.1404077349437036, 0.048770553940657255, -0.018192495381965008, 0.2100192085566871, 0.10553941918287153, 0.11211751436349005, 0.22269753366708755, 0.16521080266173202, 0.0625366524107493, 0.1785064318058331, -0.1078916084299591, -0.06166313046862076, -0.30270688477960395, -0.15172231153559462, -0.19843547585670177, 0.09755823614711805, -0.07739917199814511, -0.1564977616185277, 0.4119105556292641, 0.11848131431232593, 0.14555645869794961, -0.017018665240157577, 0.3544629845284096, 0.24039389823404392, 0.05651067306355732, 0.003331620876518328, 0.3446325590016275, 0.13224044312700267, 0.08615731822877623, -0.2651403629896799, 0.05024849410557824, -0.04695127292808781]
|
1,803.04087
|
Learning discrete Bayesian networks in polynomial time and sample
complexity
|
In this paper, we study the problem of structure learning for Bayesian
networks in which nodes take discrete values. The problem is NP-hard in general
but we show that under certain conditions we can recover the true structure of
a Bayesian network with sufficient number of samples. We develop a mathematical
model which does not assume any specific conditional probability distributions
for the nodes. We use a primal-dual witness construction to prove that, under
some technical conditions on the interaction between node pairs, we can do
exact recovery of the parents and children of a node by performing group
l_12-regularized multivariate regression. Thus, we recover the true Bayesian
network structure. If degree of a node is bounded then the sample complexity of
our proposed approach grows logarithmically with respect to the number of nodes
in the Bayesian network. Furthermore, our method runs in polynomial time.
|
cs.LG stat.ML
|
in this paper we study the problem of structure learning for bayesian networks in which nodes take discrete values the problem is nphard in general but we show that under certain conditions we can recover the true structure of a bayesian network with sufficient number of samples we develop a mathematical model which does not assume any specific conditional probability distributions for the nodes we use a primaldual witness construction to prove that under some technical conditions on the interaction between node pairs we can do exact recovery of the parents and children of a node by performing group l_12regularized multivariate regression thus we recover the true bayesian network structure if degree of a node is bounded then the sample complexity of our proposed approach grows logarithmically with respect to the number of nodes in the bayesian network furthermore our method runs in polynomial time
|
[['in', 'this', 'paper', 'we', 'study', 'the', 'problem', 'of', 'structure', 'learning', 'for', 'bayesian', 'networks', 'in', 'which', 'nodes', 'take', 'discrete', 'values', 'the', 'problem', 'is', 'nphard', 'in', 'general', 'but', 'we', 'show', 'that', 'under', 'certain', 'conditions', 'we', 'can', 'recover', 'the', 'true', 'structure', 'of', 'a', 'bayesian', 'network', 'with', 'sufficient', 'number', 'of', 'samples', 'we', 'develop', 'a', 'mathematical', 'model', 'which', 'does', 'not', 'assume', 'any', 'specific', 'conditional', 'probability', 'distributions', 'for', 'the', 'nodes', 'we', 'use', 'a', 'primaldual', 'witness', 'construction', 'to', 'prove', 'that', 'under', 'some', 'technical', 'conditions', 'on', 'the', 'interaction', 'between', 'node', 'pairs', 'we', 'can', 'do', 'exact', 'recovery', 'of', 'the', 'parents', 'and', 'children', 'of', 'a', 'node', 'by', 'performing', 'group', 'l_12regularized', 'multivariate', 'regression', 'thus', 'we', 'recover', 'the', 'true', 'bayesian', 'network', 'structure', 'if', 'degree', 'of', 'a', 'node', 'is', 'bounded', 'then', 'the', 'sample', 'complexity', 'of', 'our', 'proposed', 'approach', 'grows', 'logarithmically', 'with', 'respect', 'to', 'the', 'number', 'of', 'nodes', 'in', 'the', 'bayesian', 'network', 'furthermore', 'our', 'method', 'runs', 'in', 'polynomial', 'time']]
|
[-0.1198959733770203, 0.03530603622655488, -0.0898575949896541, 0.05688962064596126, -0.0925974602481195, -0.15791387506437282, 0.10473265688132313, 0.39692370312210795, -0.307944771911328, -0.29019635254331255, 0.0686990372123546, -0.22066137174099115, -0.20114551216829568, 0.11571332879975671, -0.10751806235121977, 0.058516206400175484, 0.09830129433733721, 0.09837906815098701, -0.07109418858211332, -0.2898801947158063, 0.341351690975393, 0.03636668100565051, 0.27916007466329673, 0.014900485347122109, 0.11709766744429038, 0.03478163368870608, 0.011195500382907793, 0.04303706147200299, -0.11688580843282478, 0.09973438635643106, 0.2631155954348085, 0.19725351015060572, 0.33380692632150993, -0.4241357901350966, -0.19681684827871018, 0.1903919490319418, 0.12465638615604904, 0.13712601688166615, 0.0026501894729638784, -0.24593758214420328, 0.1308284585053722, -0.1580201769644797, -0.08994272965679152, -0.06743333679494551, -0.03746689041145146, 0.01566340882143575, -0.3275412623346104, 0.060640284461745374, 0.05568530916288081, 0.02660519364710328, -0.048167448004177355, -0.08849576591536687, -0.001809637540847891, 0.11055286167862101, 0.017966891074845788, -0.0023916437753036413, 0.07682147065578546, -0.11800009059920234, -0.11384019721622786, 0.32351869984348824, -0.0037373145589501494, -0.23925962165877637, 0.159407909257829, -0.1275780057055979, -0.21125955077655412, 0.07983965042512864, 0.21646320943384328, 0.1327675334113236, -0.13311822470010762, 0.08353250712025329, -0.10637642013736898, 0.1647478164652259, 0.030270293312949233, -0.0086604410070221, 0.10936365433089021, 0.15526856634662384, 0.13080975482201515, 0.15363640743049067, -0.09536188212142507, -0.07685355316465979, -0.3029775084449082, -0.13962319659124964, -0.2346890578305142, 0.0125919614269555, -0.13828021917197475, -0.1787994441013628, 0.42239744261476314, 0.18251439426330762, 0.2163881849264726, 0.18099798977588458, 0.2583764369547781, 0.08620871760609185, 0.03973138426145953, 0.13563984000938945, 0.15850361296684745, 0.1083563086722279, 0.04659614372131829, -0.16264373067274895, 0.15086744629338178, 0.04353610486365748]
|
1,803.04088
|
Pre-Eruptive Magnetic Reconnection within a Multi-Flux-Rope System in
the Solar Corona
|
The solar corona is frequently disrupted by coronal mass ejections (CMEs),
whose core structure is believed to be a flux rope made of helical magnetic
field. This has become a "standard" picture although it remains elusive how the
flux rope forms and evolves toward eruption. While 1/3 of the ejecta passing
through spacecrafts demonstrate a flux-rope structure, the rest have complex
magnetic fields. Are they originating from a coherent flux rope, too? Here we
investigate the source region of a complex ejecta, focusing on a flare
precursor with definitive signatures of magnetic reconnection, i.e., nonthermal
electrons, flaring plasma, and bi-directional outflowing blobs. Aided by
nonlinear force-free field modeling, we conclude that the reconnection occurs
within a system of multiple braided flux ropes with different degree of
coherency. The observation signifies the importance of internal structure and
dynamics in understanding CMEs and in predicting their impacts on Earth.
|
astro-ph.SR physics.space-ph
|
the solar corona is frequently disrupted by coronal mass ejections cmes whose core structure is believed to be a flux rope made of helical magnetic field this has become a standard picture although it remains elusive how the flux rope forms and evolves toward eruption while 13 of the ejecta passing through spacecrafts demonstrate a fluxrope structure the rest have complex magnetic fields are they originating from a coherent flux rope too here we investigate the source region of a complex ejecta focusing on a flare precursor with definitive signatures of magnetic reconnection ie nonthermal electrons flaring plasma and bidirectional outflowing blobs aided by nonlinear forcefree field modeling we conclude that the reconnection occurs within a system of multiple braided flux ropes with different degree of coherency the observation signifies the importance of internal structure and dynamics in understanding cmes and in predicting their impacts on earth
|
[['the', 'solar', 'corona', 'is', 'frequently', 'disrupted', 'by', 'coronal', 'mass', 'ejections', 'cmes', 'whose', 'core', 'structure', 'is', 'believed', 'to', 'be', 'a', 'flux', 'rope', 'made', 'of', 'helical', 'magnetic', 'field', 'this', 'has', 'become', 'a', 'standard', 'picture', 'although', 'it', 'remains', 'elusive', 'how', 'the', 'flux', 'rope', 'forms', 'and', 'evolves', 'toward', 'eruption', 'while', '13', 'of', 'the', 'ejecta', 'passing', 'through', 'spacecrafts', 'demonstrate', 'a', 'fluxrope', 'structure', 'the', 'rest', 'have', 'complex', 'magnetic', 'fields', 'are', 'they', 'originating', 'from', 'a', 'coherent', 'flux', 'rope', 'too', 'here', 'we', 'investigate', 'the', 'source', 'region', 'of', 'a', 'complex', 'ejecta', 'focusing', 'on', 'a', 'flare', 'precursor', 'with', 'definitive', 'signatures', 'of', 'magnetic', 'reconnection', 'ie', 'nonthermal', 'electrons', 'flaring', 'plasma', 'and', 'bidirectional', 'outflowing', 'blobs', 'aided', 'by', 'nonlinear', 'forcefree', 'field', 'modeling', 'we', 'conclude', 'that', 'the', 'reconnection', 'occurs', 'within', 'a', 'system', 'of', 'multiple', 'braided', 'flux', 'ropes', 'with', 'different', 'degree', 'of', 'coherency', 'the', 'observation', 'signifies', 'the', 'importance', 'of', 'internal', 'structure', 'and', 'dynamics', 'in', 'understanding', 'cmes', 'and', 'in', 'predicting', 'their', 'impacts', 'on', 'earth']]
|
[-0.17434573983242987, 0.25456735066638714, 0.0024374554339213436, 0.1558422451263902, -0.10118686157551145, -0.04655900711136661, 0.001493206242143753, 0.44820980577203795, -0.2025378497925644, -0.3585282471664503, 0.0526715281299081, -0.20435542033883888, -0.10210175101081428, 0.19380084354886595, 0.010938677275323683, -0.043424993341623926, 0.13542766331181844, -0.01884047972310816, -0.04875902480803759, -0.13978840944319204, 0.2956133880264436, 0.1284540615798462, 0.20910040665493937, 0.013249145278257324, 0.10420853631938395, -0.1224248954530514, 0.0022378236144071535, 0.002630417616317226, -0.06186567561527307, 0.04836802679861636, 0.1173859810089173, 0.08976682506859632, 0.24540924733713726, -0.5157914126076463, -0.2828793160009141, -0.02605053261207531, 0.21094096887585087, 0.009468235894340742, -0.025755279439305064, -0.274083434192299, 0.03627338709145765, -0.1552231695708307, -0.1308979662958862, 0.04727593280824826, 0.026208339726273604, -0.011172464745021014, -0.24948867549446607, 0.08823800784833476, 0.06002471329356056, 0.10816852049743693, -0.11348433052284682, 0.006887198013228168, -0.10350496355653266, 0.08543475267166893, 0.14568826412706046, 0.0977580400744491, 0.26033749400961154, -0.1595272213572218, -0.09156720029811065, 0.37499429041608456, 0.03208067728250864, -0.049752396423699094, 0.18644310003716727, -0.22577867274280308, -0.15015362817667374, 0.25064197787381454, 0.13544696186499697, 0.057956621955231234, -0.10720493942998084, -0.011710086734458601, -0.06768279180855674, 0.11397464457601562, 0.03709530748179829, -0.020982986636029013, 0.38215987812600977, 0.15171271084877505, 0.013769277064193066, 0.13444996484140326, -0.19050050543329747, -0.05969874453762559, -0.24112984607491933, -0.14159943575402215, -0.10815885511455031, 0.1100080413363722, -0.04457920910054058, -0.25150749347723866, 0.4253813371341042, 0.1494243073872715, 0.2053676893313726, -0.10089656063925703, 0.27926772556641477, 0.0771153988506721, 0.044265123798518255, 0.19147376065795013, 0.30732913624469926, 0.22942666228398123, 0.19701145732059416, -0.21227774279965025, 0.09816766882213909, 0.07931195568692471]
|
1,803.04089
|
Energy spectra in $p$-shell $\Lambda$ hypernuclei and
$^{19}_{\Lambda}\textrm{F}$ and spin-dependent $\Lambda N$ interactions
|
Energy spectra of $0s$-orbit $\Lambda$ states in $p$-shell $\Lambda$
hypernuclei ($^{A}_\Lambda Z$) and those in $^{19}_{\Lambda}\textrm{F}$ are
studied with the microscopic cluster model and antisymmetrized molecular
dynamics using the $G$-matrix effective $\Lambda N$ ($\Lambda NG$)
interactions. Spin-dependent terms of the ESC08a version of the $\Lambda NG$
interactions are tested and phenomenologically tuned to reproduce observed
energy spectra in $p$-shell $^{A}_\Lambda Z$. Spin-dependent contributions of
the $\Lambda N$ interactions to spin-doublet splitting and excitation energies
are discussed. Energy spectra for unobserved excited states in $p$-shell
$^{A}_\Lambda Z$ and $^{19}_{\Lambda}\textrm{F}$ are predicted with the
modified $\Lambda NG$ interactions.
|
nucl-th
|
energy spectra of 0sorbit lambda states in pshell lambda hypernuclei a_lambda z and those in 19_lambdatextrmf are studied with the microscopic cluster model and antisymmetrized molecular dynamics using the gmatrix effective lambda n lambda ng interactions spindependent terms of the esc08a version of the lambda ng interactions are tested and phenomenologically tuned to reproduce observed energy spectra in pshell a_lambda z spindependent contributions of the lambda n interactions to spindoublet splitting and excitation energies are discussed energy spectra for unobserved excited states in pshell a_lambda z and 19_lambdatextrmf are predicted with the modified lambda ng interactions
|
[['energy', 'spectra', 'of', '0sorbit', 'lambda', 'states', 'in', 'pshell', 'lambda', 'hypernuclei', 'a_lambda', 'z', 'and', 'those', 'in', '19_lambdatextrmf', 'are', 'studied', 'with', 'the', 'microscopic', 'cluster', 'model', 'and', 'antisymmetrized', 'molecular', 'dynamics', 'using', 'the', 'gmatrix', 'effective', 'lambda', 'n', 'lambda', 'ng', 'interactions', 'spindependent', 'terms', 'of', 'the', 'esc08a', 'version', 'of', 'the', 'lambda', 'ng', 'interactions', 'are', 'tested', 'and', 'phenomenologically', 'tuned', 'to', 'reproduce', 'observed', 'energy', 'spectra', 'in', 'pshell', 'a_lambda', 'z', 'spindependent', 'contributions', 'of', 'the', 'lambda', 'n', 'interactions', 'to', 'spindoublet', 'splitting', 'and', 'excitation', 'energies', 'are', 'discussed', 'energy', 'spectra', 'for', 'unobserved', 'excited', 'states', 'in', 'pshell', 'a_lambda', 'z', 'and', '19_lambdatextrmf', 'are', 'predicted', 'with', 'the', 'modified', 'lambda', 'ng', 'interactions']]
|
[-0.119093531742692, 0.24121600703426427, -0.027395796035453977, 0.1952832136603613, 0.037059988846541735, -0.17182882015983905, -0.027811021989672093, 0.37051140322720494, -0.22333126544692022, -0.3088317139334576, -0.15230197350304292, -0.34467611260591974, 0.029155113934824037, 0.07839036850829519, 0.21405690181399545, -0.004425100371321683, 0.016500199461475976, 0.002700449618440802, 0.06016876922059123, -0.1551359405112703, 0.2971634311070766, 0.07828528475597181, 0.1363993937610298, 0.07996896866668937, -0.013472064328129573, 0.007919135220569147, 0.03912190103813285, -0.054981477558612823, -0.22787515891675827, 0.09566347136585322, 0.25378995835130175, -0.01027891985691523, 0.11726177790232244, -0.3260768370762948, -0.1577266031495666, 0.10006648868006925, 0.17776824753250806, 0.09275289164275251, 0.007075784547675041, -0.3535226899129088, 0.023317216074354545, -0.17154988468254126, -0.15297191646150363, -0.116659943973245, 0.08815853801425746, 0.07559230816500481, -0.28154644334528556, 0.1316859464656176, -0.046927384581537016, 0.014080321871905877, -0.08099947875786212, -0.25416373921137664, -0.12088403885342902, -0.00530608889636814, 0.01943508878986161, 0.00040859110673428865, 0.1515783283068368, -0.13054803032953774, -0.07863212626938137, 0.4296711653831505, -0.12019039484952647, -0.13488214869823267, 0.10763244333887292, -0.1354460519317898, -0.15685138713333116, 0.16047697926881493, 0.08627421229637118, 0.08909123000890387, -0.102539611119096, 0.2352656138408679, 0.04783245912748038, 0.18830470882997077, 0.06530640057979091, 0.09386193796351391, 0.11290937967558382, 0.11858463719967872, -0.10137123614549637, 0.005575638324502976, -0.08542581511441097, -0.1028655577483537, -0.2986024637864302, -0.034886497994183856, -0.15029245487073817, 0.09620091356136785, -0.025129252538223932, -0.048236995196265356, 0.3545320774278333, 0.011242646964326981, 0.23849353689940705, 0.010767270307687501, 0.18084700103668916, 0.11936120845137103, 0.04444731057180913, -0.015406635624947406, 0.2773618924541659, 0.21708997183539455, 0.01656600398071591, -0.29661855692424444, -0.04273226249322135, 0.01271579313963171]
|
1,803.0409
|
The Rigidity and Gap Theorem for Liouville's Equation
|
In this paper, we study the properties of the first global term in the
polyhomogeneous expansions for Liouville's equation. We obtain rigidity and gap
results for the boundary integral of the global coefficient. We prove that such
a boundary integral is always nonpositive, and is zero if and only if the
underlying domain is a disc. More generally, we prove some gap theorems
relating such a boundary integral to the number of components of the boundary.
The conformal structure plays an essential role.
|
math.DG
|
in this paper we study the properties of the first global term in the polyhomogeneous expansions for liouvilles equation we obtain rigidity and gap results for the boundary integral of the global coefficient we prove that such a boundary integral is always nonpositive and is zero if and only if the underlying domain is a disc more generally we prove some gap theorems relating such a boundary integral to the number of components of the boundary the conformal structure plays an essential role
|
[['in', 'this', 'paper', 'we', 'study', 'the', 'properties', 'of', 'the', 'first', 'global', 'term', 'in', 'the', 'polyhomogeneous', 'expansions', 'for', 'liouvilles', 'equation', 'we', 'obtain', 'rigidity', 'and', 'gap', 'results', 'for', 'the', 'boundary', 'integral', 'of', 'the', 'global', 'coefficient', 'we', 'prove', 'that', 'such', 'a', 'boundary', 'integral', 'is', 'always', 'nonpositive', 'and', 'is', 'zero', 'if', 'and', 'only', 'if', 'the', 'underlying', 'domain', 'is', 'a', 'disc', 'more', 'generally', 'we', 'prove', 'some', 'gap', 'theorems', 'relating', 'such', 'a', 'boundary', 'integral', 'to', 'the', 'number', 'of', 'components', 'of', 'the', 'boundary', 'the', 'conformal', 'structure', 'plays', 'an', 'essential', 'role']]
|
[-0.19013052182805062, 0.06543393849822306, -0.13927576355972743, 0.07751090764292483, -0.11590597722454961, -0.05995923004685396, -0.027094655720017714, 0.33178875667144014, -0.30493081971464386, -0.2049622029200735, 0.17092964760903046, -0.2648871152785169, -0.20115160117352224, 0.16900263037756982, -0.057456805034125424, 0.04306868400918432, 0.0622953411461, 0.08905356772474002, -0.08633462185634816, -0.2044620885070503, 0.4089916120451617, -0.028866269098347927, 0.20167076983769616, 0.1401337203401399, 0.10214125152946596, 0.015606536165283746, -0.002962300307061299, 0.0159034312265106, -0.20418786422774848, 0.13649316158717925, 0.21758209040994386, 0.02714461067194226, 0.27486206086475895, -0.41231805254447174, -0.19843619195772447, 0.13430264428347707, 0.1277509763127148, 0.05594541686755347, -0.022515310985295675, -0.20982915570353528, 0.13680181613034872, -0.10568577548242118, -0.20822409415864443, -0.05305771147046821, 0.02644567786300757, -0.019873392445607537, -0.28770373195917515, 0.09383870886795852, 0.1326858926654221, 0.05148354915520513, -0.13900242785990508, -0.08497995974114501, -0.019418709019356103, 0.15615614897470517, 0.06651948957075646, 0.024104491743001055, 0.056955894432872176, -0.17454602555596235, -0.02374320523813367, 0.3298973674964474, -0.07244915418685918, -0.24676733681685234, 0.14990853334227242, -0.17039875025967563, -0.14636228952826147, 0.06960837372455252, 0.07769322739801852, 0.13595368282263537, -0.12442145138734907, 0.14652907440834398, -0.07309444053435182, 0.14405003234362565, 0.07371639300990536, 0.02576994574460459, 0.13889049462615008, 0.10660834603729737, 0.17236896369987412, 0.1654108679006213, -0.046159438955799555, -0.0741924529962511, -0.39492864015860013, -0.24811439090464488, -0.1845942373185542, 0.08685565312359347, -0.12262379323046077, -0.21259234848864242, 0.3759078572291028, 0.11026538978804167, 0.1984005894481081, 0.06274504957339132, 0.2387806704514716, 0.1851660101225667, 0.039325712820941425, 0.11361743407099541, 0.20372958301394023, 0.1619418775326157, 0.0864283664149221, -0.21581922566899694, 0.026298202001994633, 0.14877373175358916]
|
1,803.04091
|
Planetary Candidates from K2 Campaign 16
|
Given that Campaign 16 of the K2 mission is one of just two K2 campaigns
observed so far in "forward-facing" mode, which enables immediate follow-up
observations from the ground, we present a catalog of interesting targets
identified through photometry alone. Our catalog includes 30 high-quality
planet candidates (showing no signs of being non-planetary in nature), 48 more
ambiguous events that may be either planets or false positives, 164 eclipsing
binaries, and 231 other regularly periodic variable sources. We have released
light curves for all targets in C16, and have also released system parameters
and transit vetting plots for all interesting candidates identified in this
paper. Of particular interest is a candidate planet orbiting the bright F dwarf
HD 73344 (V=6.9, K=5.6) with an orbital period of 15 days. If confirmed, this
object would correspond to a $2.56 \pm 0.18 \ R_\oplus$ planet and would likely
be a favorable target for radial velocity characterization. This paper is
intended as a rapid release of planet candidates, eclipsing binaries and other
interesting periodic variables to maximize the scientific yield of this
campaign, and as a test run for the upcoming TESS mission, whose frequent data
releases call for similarly rapid candidate identification and efficient
follow-up.
|
astro-ph.EP
|
given that campaign 16 of the k2 mission is one of just two k2 campaigns observed so far in forwardfacing mode which enables immediate followup observations from the ground we present a catalog of interesting targets identified through photometry alone our catalog includes 30 highquality planet candidates showing no signs of being nonplanetary in nature 48 more ambiguous events that may be either planets or false positives 164 eclipsing binaries and 231 other regularly periodic variable sources we have released light curves for all targets in c16 and have also released system parameters and transit vetting plots for all interesting candidates identified in this paper of particular interest is a candidate planet orbiting the bright f dwarf hd 73344 v69 k56 with an orbital period of 15 days if confirmed this object would correspond to a 256 pm 018 r_oplus planet and would likely be a favorable target for radial velocity characterization this paper is intended as a rapid release of planet candidates eclipsing binaries and other interesting periodic variables to maximize the scientific yield of this campaign and as a test run for the upcoming tess mission whose frequent data releases call for similarly rapid candidate identification and efficient followup
|
[['given', 'that', 'campaign', '16', 'of', 'the', 'k2', 'mission', 'is', 'one', 'of', 'just', 'two', 'k2', 'campaigns', 'observed', 'so', 'far', 'in', 'forwardfacing', 'mode', 'which', 'enables', 'immediate', 'followup', 'observations', 'from', 'the', 'ground', 'we', 'present', 'a', 'catalog', 'of', 'interesting', 'targets', 'identified', 'through', 'photometry', 'alone', 'our', 'catalog', 'includes', '30', 'highquality', 'planet', 'candidates', 'showing', 'no', 'signs', 'of', 'being', 'nonplanetary', 'in', 'nature', '48', 'more', 'ambiguous', 'events', 'that', 'may', 'be', 'either', 'planets', 'or', 'false', 'positives', '164', 'eclipsing', 'binaries', 'and', '231', 'other', 'regularly', 'periodic', 'variable', 'sources', 'we', 'have', 'released', 'light', 'curves', 'for', 'all', 'targets', 'in', 'c16', 'and', 'have', 'also', 'released', 'system', 'parameters', 'and', 'transit', 'vetting', 'plots', 'for', 'all', 'interesting', 'candidates', 'identified', 'in', 'this', 'paper', 'of', 'particular', 'interest', 'is', 'a', 'candidate', 'planet', 'orbiting', 'the', 'bright', 'f', 'dwarf', 'hd', '73344', 'v69', 'k56', 'with', 'an', 'orbital', 'period', 'of', '15', 'days', 'if', 'confirmed', 'this', 'object', 'would', 'correspond', 'to', 'a', '256', 'pm', '018', 'r_oplus', 'planet', 'and', 'would', 'likely', 'be', 'a', 'favorable', 'target', 'for', 'radial', 'velocity', 'characterization', 'this', 'paper', 'is', 'intended', 'as', 'a', 'rapid', 'release', 'of', 'planet', 'candidates', 'eclipsing', 'binaries', 'and', 'other', 'interesting', 'periodic', 'variables', 'to', 'maximize', 'the', 'scientific', 'yield', 'of', 'this', 'campaign', 'and', 'as', 'a', 'test', 'run', 'for', 'the', 'upcoming', 'tess', 'mission', 'whose', 'frequent', 'data', 'releases', 'call', 'for', 'similarly', 'rapid', 'candidate', 'identification', 'and', 'efficient', 'followup']]
|
[-0.1354173933825223, 0.1243171633460588, -0.068664770568721, 0.06542021810775622, -0.16582189397799085, -0.16206217785831542, 0.13484633481188213, 0.36403393507003784, -0.14019323750166224, -0.3918761829659343, 0.13591901607927867, -0.3521035719290376, -0.08731010317336768, 0.25906680852989666, -0.08726620951667428, 0.04325097837136127, 0.1900993603526149, -0.01977885666419752, 0.024734288995387033, -0.3292509655375034, 0.19129663714877096, 0.06385395394056104, 0.07476514866575598, -0.08667963798739947, 0.03520380297297379, -0.01262070934928488, -0.0898300655289495, -0.07613399914233014, -0.16168407741737612, 0.019388694476219825, 0.2788148100534454, 0.16674524371395819, 0.22516734845703468, -0.2888453108316753, -0.18823069104808382, 0.10486326224170625, 0.16795212538039778, 0.018319729894283227, -0.06890038387886306, -0.2929957625246607, 0.0972135938401334, -0.19722376151476056, -0.18477606176864356, -0.020594114541308953, 0.1547486198064871, 0.030769999460317193, -0.264365406956058, 0.06335883822161122, 0.03006994613679126, 0.1324317919590976, -0.16997263739471236, -0.1402871108078398, -0.05009774359758012, 0.08841819123015739, 0.030782213479396886, 0.09293866541353055, 0.08948676189407706, -0.07374802499776706, -0.07840860719617922, 0.39864848673343656, -0.060589321239385756, -0.01262967515271157, 0.21730532215326093, -0.14724505854537712, -0.1883733497420326, 0.16307502086739986, 0.17771013001154642, 0.15276333850226365, -0.21125269647222011, -0.06364578452397836, 0.0012768311705440283, 0.2230536670604488, 0.06881411338923499, 0.077244021158549, 0.3664894035866018, 0.11961448974325321, 0.06156784731312655, 0.10640009657887277, -0.255424615717493, 0.007649599791038781, -0.23619283472187816, -0.14554845063947142, -0.14730969048381667, 0.05755445169459563, -0.05032463101619214, -0.10828574311657575, 0.35242449985817076, 0.1259489705809392, 0.1542128639947623, -0.014666629580897279, 0.26253090205136687, 0.01428415832517203, 0.09611068429636362, 0.06739883633272256, 0.3080164070962928, 0.05561509962397395, 0.08154215544695034, -0.14446534423157573, 0.07463175790771856, -0.06146355867036618]
|
1,803.04092
|
Estimating Shape of Target Object Moving on Unknown Trajectory by Using
Location-Unknown Distance Sensors: Theoretical Framework
|
By using directional distance sensors that have unknown locations, this paper
proposes a method of estimating the shape of a location-unknown target object
$T$ moving with unknown speed on an unknown straight line trajectory.
Regardless of many unknown factors, the proposed method can estimate the shape
by using each sensor's continuous report of the measured distance to $T$
without using side information or additional mechanisms such as locations of
anchor sensors and angle-of-arrival measurements. By using the sensor reports,
the proposed method estimates (i) the moving speed of $T$, (ii) the length and
direction of an edge of $T$, and (iii) the order of consecutive edges. As a
result, we can obtain the shape of $T$.
|
eess.SP
|
by using directional distance sensors that have unknown locations this paper proposes a method of estimating the shape of a locationunknown target object t moving with unknown speed on an unknown straight line trajectory regardless of many unknown factors the proposed method can estimate the shape by using each sensors continuous report of the measured distance to t without using side information or additional mechanisms such as locations of anchor sensors and angleofarrival measurements by using the sensor reports the proposed method estimates i the moving speed of t ii the length and direction of an edge of t and iii the order of consecutive edges as a result we can obtain the shape of t
|
[['by', 'using', 'directional', 'distance', 'sensors', 'that', 'have', 'unknown', 'locations', 'this', 'paper', 'proposes', 'a', 'method', 'of', 'estimating', 'the', 'shape', 'of', 'a', 'locationunknown', 'target', 'object', 't', 'moving', 'with', 'unknown', 'speed', 'on', 'an', 'unknown', 'straight', 'line', 'trajectory', 'regardless', 'of', 'many', 'unknown', 'factors', 'the', 'proposed', 'method', 'can', 'estimate', 'the', 'shape', 'by', 'using', 'each', 'sensors', 'continuous', 'report', 'of', 'the', 'measured', 'distance', 'to', 't', 'without', 'using', 'side', 'information', 'or', 'additional', 'mechanisms', 'such', 'as', 'locations', 'of', 'anchor', 'sensors', 'and', 'angleofarrival', 'measurements', 'by', 'using', 'the', 'sensor', 'reports', 'the', 'proposed', 'method', 'estimates', 'i', 'the', 'moving', 'speed', 'of', 't', 'ii', 'the', 'length', 'and', 'direction', 'of', 'an', 'edge', 'of', 't', 'and', 'iii', 'the', 'order', 'of', 'consecutive', 'edges', 'as', 'a', 'result', 'we', 'can', 'obtain', 'the', 'shape', 'of', 't']]
|
[-0.12652995972691672, 0.10397878036778622, -0.05424984391049846, -0.06573295200081623, -0.061919973863531715, -0.15445710150524974, 0.08410870253321026, 0.42446604973596075, -0.2789261073521946, -0.3617929514497519, 0.09683776337491429, -0.2643926965639643, -0.11823102058893394, 0.1519670006353408, -0.07604732038655683, 0.08572064848697704, 0.035642893632630936, 0.11352478597697842, -0.06438171154611906, -0.1715928542043042, 0.28736040620943126, 0.060023771145421526, 0.24539818978342026, 0.002824003217012986, 0.15746727727110618, 0.051760566315573193, -0.07823650246971975, 0.04622904537650554, -0.11923564578762086, 0.1364515604537345, 0.18742771251532048, 0.1374667619921915, 0.25472927990814914, -0.4127112832143093, -0.21778228810745412, 0.08949754735778855, 0.13958919371235307, 0.07098683041075002, -0.03934439329086276, -0.3188258831024818, 0.10445051641891832, -0.09812015735584756, -0.14688564787578323, 0.018457400183314862, 0.043404295281304614, 0.07866485041930624, -0.26993908851366977, 0.05455537380893593, 0.05199099889268046, 0.047906344819247076, -0.05888243339874822, -0.11267738069772072, 0.012534756181032761, 0.18831874176495425, 0.040840189288491785, 0.05515670461640896, 0.16522066844627262, -0.13316299461597658, -0.1363636307944746, 0.3200951384947352, -0.0710861633066088, -0.18622297685917305, 0.15915440282096033, -0.10883586596414123, -0.04602013669462632, 0.11876823539319245, 0.20033452990262404, 0.17121178095188477, -0.16657505047953, 0.04554951199502482, -0.02023044783703011, 0.16534824118666028, 0.08149975019750064, 0.01924971024222348, 0.1741149737864085, 0.12770817342477486, 0.10386670122641826, 0.11733215860921242, -0.22757046957824217, 0.02237430037525685, -0.3230682380537948, -0.13930970215765032, -0.22699168831433938, -0.009369123370751091, -0.11047711627034004, -0.1447095904013385, 0.37255132923955503, 0.1711146148002666, 0.2980686465561714, 0.013287089238672153, 0.33088649233560197, 0.08270604091838164, 0.05870359074729292, 0.08755199739142605, 0.17258074484846514, 0.0643237372080836, 0.06759683048028661, -0.20660286627547897, 0.15698530059712737, 0.0705037121883715]
|
1,803.04093
|
Nonlocal scalar field equations: qualitative properties, asymptotic
profiles and local uniqueness of solutions
|
We study the nonlocal scalar field equation with a vanishing parameter \[
\left\{\begin{array}{lll}
(-\Delta)^s u+\epsilon u &=|u|^{p-2}u -|u|^{q-2}u
\quad\text{in}\quad\mathbb{R}^N \\ u >0, & u \in H^s(\mathbb{R}^N),
\end{array}
\right. \] where $s\in(0,1)$, $N>2s$, $q>p>2$ are fixed parameters and
$\epsilon>0$ is a vanishing parameter. For $\epsilon>0$ small, we prove the
existence of a ground state solution and show that any positive solution of
above problem is a classical solution and radially symmetric and symmetric
decreasing. We also obtain the decay rate of solution at infinity. Next, we
study the asymptotic behavior of ground state solutions when $p$ is
subcritical, supercritical or critical Sobolev exponent $2^*=\frac{2N}{N-2s}$.
For $p<2^*$, the solution asymptotically coincides with unique positive ground
state solution of $(-\Delta)^s u+u=u^p$. On the other hand, for $p=2^*$ the
asymptotic behaviour of the solutions is given by the unique positive solution
of the nonlocal critical Emden-Fowler type equation. For $p>2^*$, the solution
asymptotically coincides with a ground-state solution of $(-\Delta)^s
u=u^p-u^q$. Furthermore, using these asymptotic profile of solutions, we prove
the \textit{local uniqueness} of solution in the case $p\leq 2^*$.
|
math.AP
|
we study the nonlocal scalar field equation with a vanishing parameter leftbeginarraylll deltas uepsilon u up2u uq2u quadtextinquadmathbbrn u 0 u in hsmathbbrn endarray right where sin01 n2s qp2 are fixed parameters and epsilon0 is a vanishing parameter for epsilon0 small we prove the existence of a ground state solution and show that any positive solution of above problem is a classical solution and radially symmetric and symmetric decreasing we also obtain the decay rate of solution at infinity next we study the asymptotic behavior of ground state solutions when p is subcritical supercritical or critical sobolev exponent 2frac2nn2s for p2 the solution asymptotically coincides with unique positive ground state solution of deltas uuup on the other hand for p2 the asymptotic behaviour of the solutions is given by the unique positive solution of the nonlocal critical emdenfowler type equation for p2 the solution asymptotically coincides with a groundstate solution of deltas uupuq furthermore using these asymptotic profile of solutions we prove the textitlocal uniqueness of solution in the case pleq 2
|
[['we', 'study', 'the', 'nonlocal', 'scalar', 'field', 'equation', 'with', 'a', 'vanishing', 'parameter', 'leftbeginarraylll', 'deltas', 'uepsilon', 'u', 'up2u', 'uq2u', 'quadtextinquadmathbbrn', 'u', '0', 'u', 'in', 'hsmathbbrn', 'endarray', 'right', 'where', 'sin01', 'n2s', 'qp2', 'are', 'fixed', 'parameters', 'and', 'epsilon0', 'is', 'a', 'vanishing', 'parameter', 'for', 'epsilon0', 'small', 'we', 'prove', 'the', 'existence', 'of', 'a', 'ground', 'state', 'solution', 'and', 'show', 'that', 'any', 'positive', 'solution', 'of', 'above', 'problem', 'is', 'a', 'classical', 'solution', 'and', 'radially', 'symmetric', 'and', 'symmetric', 'decreasing', 'we', 'also', 'obtain', 'the', 'decay', 'rate', 'of', 'solution', 'at', 'infinity', 'next', 'we', 'study', 'the', 'asymptotic', 'behavior', 'of', 'ground', 'state', 'solutions', 'when', 'p', 'is', 'subcritical', 'supercritical', 'or', 'critical', 'sobolev', 'exponent', '2frac2nn2s', 'for', 'p2', 'the', 'solution', 'asymptotically', 'coincides', 'with', 'unique', 'positive', 'ground', 'state', 'solution', 'of', 'deltas', 'uuup', 'on', 'the', 'other', 'hand', 'for', 'p2', 'the', 'asymptotic', 'behaviour', 'of', 'the', 'solutions', 'is', 'given', 'by', 'the', 'unique', 'positive', 'solution', 'of', 'the', 'nonlocal', 'critical', 'emdenfowler', 'type', 'equation', 'for', 'p2', 'the', 'solution', 'asymptotically', 'coincides', 'with', 'a', 'groundstate', 'solution', 'of', 'deltas', 'uupuq', 'furthermore', 'using', 'these', 'asymptotic', 'profile', 'of', 'solutions', 'we', 'prove', 'the', 'textitlocal', 'uniqueness', 'of', 'solution', 'in', 'the', 'case', 'pleq', '2']]
|
[-0.20102556160760715, 0.05499203461770187, -0.028131141746416687, 0.038007321748334696, -0.0637843818133286, -0.22267806300729076, 0.025467823626583112, 0.2734051868045593, -0.2800828917770345, -0.15450282077140667, 0.17058999519247342, -0.39904348181341504, -0.0816609477494186, 0.127170032521655, 0.015730779541327674, 0.09449858727371868, 0.030438244959120366, 0.1085480753934997, -0.07181568626273314, -0.16593558833770017, 0.3856947619906243, -0.12130397534655298, 0.21075963004875709, 0.061624075847623104, 0.10402822417433046, -0.05834451238631171, 0.11807071320602999, -0.009672310186878723, -0.2720742408325296, -0.002645065333447693, 0.20689211539951535, 0.07956461622379721, 0.3145258786923745, -0.3410320850527462, -0.15169187434675063, 0.1957449597580468, 0.16559316883384087, 0.04740844131447375, -0.05705471432986943, -0.29852809755761617, 0.16122692525386811, -0.1109411457365187, -0.27000868225141483, -0.06306431343888536, 0.0811304732451818, 0.07753846815869431, -0.3596924944945118, 0.14252629463461583, 0.09095854394699392, -0.029998748475576147, -0.20017511641250593, -0.1494408707572695, -0.017738215858116746, 0.05585737765907063, 0.07702400577528512, 0.08504069313365857, -0.019189555433524005, -0.1768309396246503, -0.015731171968475205, 0.3127711451448062, -0.12220079461934373, -0.2543755710398888, 0.07878626584732795, -0.18776193797204863, -0.08265420599731015, 0.10635490334757111, 0.08310528022017988, 0.22477347414447543, -0.0477459705534891, 0.23967760094742785, -0.049040189121082864, 0.18262811460230938, 0.1109633425332825, -0.011617460422327414, 0.051475108699763523, 0.1039039681213634, 0.1936434215903693, 0.13030381425427656, -0.019869131141561358, -0.10543548808953561, -0.36311225413399584, -0.1678315597189152, -0.1558361843406387, 0.15176053490525673, -0.15923479988808087, -0.18027298188603977, 0.33340069199227457, 0.059089019914459, 0.15786718581255307, 0.07937374185113345, 0.17708718729041079, 0.17722000187427245, -0.0917097012676737, 0.11572138467214672, 0.18094390315305003, 0.10555486557594336, 0.1283842168720987, -0.24931258348309818, 0.030155865698778893, 0.16009544087026048]
|
1,803.04094
|
Mean Field Games with Partial Information for Algorithmic Trading
|
Financial markets are often driven by latent factors which traders cannot
observe. Here, we address an algorithmic trading problem with collections of
heterogeneous agents who aim to perform optimal execution or statistical
arbitrage, where all agents filter the latent states of the world, and their
trading actions have permanent and temporary price impact. This leads to a
large stochastic game with heterogeneous agents. We solve the stochastic game
by investigating its mean-field game (MFG) limit, with sub-populations of
heterogeneous agents, and, using a convex analysis approach, we show that the
solution is characterized by a vector-valued forward-backward stochastic
differential equation (FBSDE). We demonstrate that the FBSDE admits a unique
solution, obtain it in closed-form, and characterize the optimal behaviour of
the agents in the MFG equilibrium. Moreover, we prove the MFG equilibrium
provides an $\epsilon$-Nash equilibrium for the finite player game. We conclude
by illustrating the behaviour of agents using the optimal MFG strategy through
simulated examples.
|
q-fin.MF math.PR q-fin.ST q-fin.TR
|
financial markets are often driven by latent factors which traders cannot observe here we address an algorithmic trading problem with collections of heterogeneous agents who aim to perform optimal execution or statistical arbitrage where all agents filter the latent states of the world and their trading actions have permanent and temporary price impact this leads to a large stochastic game with heterogeneous agents we solve the stochastic game by investigating its meanfield game mfg limit with subpopulations of heterogeneous agents and using a convex analysis approach we show that the solution is characterized by a vectorvalued forwardbackward stochastic differential equation fbsde we demonstrate that the fbsde admits a unique solution obtain it in closedform and characterize the optimal behaviour of the agents in the mfg equilibrium moreover we prove the mfg equilibrium provides an epsilonnash equilibrium for the finite player game we conclude by illustrating the behaviour of agents using the optimal mfg strategy through simulated examples
|
[['financial', 'markets', 'are', 'often', 'driven', 'by', 'latent', 'factors', 'which', 'traders', 'can', 'not', 'observe', 'here', 'we', 'address', 'an', 'algorithmic', 'trading', 'problem', 'with', 'collections', 'of', 'heterogeneous', 'agents', 'who', 'aim', 'to', 'perform', 'optimal', 'execution', 'or', 'statistical', 'arbitrage', 'where', 'all', 'agents', 'filter', 'the', 'latent', 'states', 'of', 'the', 'world', 'and', 'their', 'trading', 'actions', 'have', 'permanent', 'and', 'temporary', 'price', 'impact', 'this', 'leads', 'to', 'a', 'large', 'stochastic', 'game', 'with', 'heterogeneous', 'agents', 'we', 'solve', 'the', 'stochastic', 'game', 'by', 'investigating', 'its', 'meanfield', 'game', 'mfg', 'limit', 'with', 'subpopulations', 'of', 'heterogeneous', 'agents', 'and', 'using', 'a', 'convex', 'analysis', 'approach', 'we', 'show', 'that', 'the', 'solution', 'is', 'characterized', 'by', 'a', 'vectorvalued', 'forwardbackward', 'stochastic', 'differential', 'equation', 'fbsde', 'we', 'demonstrate', 'that', 'the', 'fbsde', 'admits', 'a', 'unique', 'solution', 'obtain', 'it', 'in', 'closedform', 'and', 'characterize', 'the', 'optimal', 'behaviour', 'of', 'the', 'agents', 'in', 'the', 'mfg', 'equilibrium', 'moreover', 'we', 'prove', 'the', 'mfg', 'equilibrium', 'provides', 'an', 'epsilonnash', 'equilibrium', 'for', 'the', 'finite', 'player', 'game', 'we', 'conclude', 'by', 'illustrating', 'the', 'behaviour', 'of', 'agents', 'using', 'the', 'optimal', 'mfg', 'strategy', 'through', 'simulated', 'examples']]
|
[-0.12677484612228185, 0.03177295415533288, -0.13689586152381536, 0.10943274514431346, -0.09944862035820423, -0.18610848318726483, 0.13330843722480173, 0.39951856996675456, -0.32722108257651517, -0.2688540133730143, 0.10726486955232598, -0.28204534381415836, -0.20556421282766033, 0.06898340733008625, -0.1355617813400547, 0.03544369763422085, 0.07508300336024759, 0.02090882772986506, 0.08118820383620177, -0.2885959401278745, 0.3343888220901872, -0.00989371495298552, 0.23263341490079095, -0.01652693802997753, 0.18956917200732645, -0.002548234484193823, 0.004855430292266221, 0.09039002267903165, -0.15265481376954534, 0.08794365840399626, 0.3398930917691463, 0.1489547859049178, 0.41245571511379103, -0.4616136315714898, -0.14052217214993096, 0.16289662700028548, 0.09668760943684072, 0.10377980345090898, -0.008739927287738111, -0.3084749833598167, 0.059890492388955024, -0.1957528025141764, -0.13276302612304122, -0.12718866358634934, -0.04774266486115093, 0.09280101572829476, -0.3395631801885187, 0.004732361452394649, 0.03505509994154843, 0.0673930186224229, -0.10541930576989757, -0.08229910706382103, -0.011300053479904426, 0.13611637855013478, 0.0670234611643997, -0.10297708874980954, 0.1580222200431354, -0.14075314864012284, -0.21586000032227817, 0.34779063525574305, -0.07693928152674963, -0.21224302971511608, 0.1382656784085675, -0.11259407341433099, -0.10383939870656762, 0.1215133176927891, 0.1926077835120355, 0.125226868749773, -0.2111276145081354, 0.08318647706757382, -0.084518087131879, 0.16137786372969976, 0.02564192247647745, -0.021264513424020026, 0.12728391259487223, 0.1856235135582429, 0.19750778951912035, 0.15056104237166576, 0.041417919161222595, -0.2567027004964685, -0.23633251866750135, -0.10195649875021434, -0.12896603761650505, 0.07684687539263514, -0.1631722459005917, -0.15035425313406542, 0.3318765447740266, 0.1371259807455766, 0.103024377304872, 0.13706504347913934, 0.26151548819970105, 0.16213310980886408, -0.08394712691830436, 0.15052729716105975, 0.19026606417367165, 0.05017914165023573, 0.14609500962380273, -0.2661833949998622, 0.1510791190578661, 0.041455677255127533]
|
1,803.04095
|
Action dimensions of some simple complexes of groups
|
The action dimension of a discrete group $G$ is the minimum dimension of
contractible manifold that admits a proper $G$-action. We compute the action
dimension of the direct limit of a simple complex of groups for several classes
of examples including: 1) Artin groups, 2) graph products of groups, and 3)
fundamental groups of aspherical complements of arrangements of affine
hyperplanes.
|
math.GT math.GR
|
the action dimension of a discrete group g is the minimum dimension of contractible manifold that admits a proper gaction we compute the action dimension of the direct limit of a simple complex of groups for several classes of examples including 1 artin groups 2 graph products of groups and 3 fundamental groups of aspherical complements of arrangements of affine hyperplanes
|
[['the', 'action', 'dimension', 'of', 'a', 'discrete', 'group', 'g', 'is', 'the', 'minimum', 'dimension', 'of', 'contractible', 'manifold', 'that', 'admits', 'a', 'proper', 'gaction', 'we', 'compute', 'the', 'action', 'dimension', 'of', 'the', 'direct', 'limit', 'of', 'a', 'simple', 'complex', 'of', 'groups', 'for', 'several', 'classes', 'of', 'examples', 'including', '1', 'artin', 'groups', '2', 'graph', 'products', 'of', 'groups', 'and', '3', 'fundamental', 'groups', 'of', 'aspherical', 'complements', 'of', 'arrangements', 'of', 'affine', 'hyperplanes']]
|
[-0.2333502333428039, 0.09229526270303082, -0.08130115953075592, 0.04076496369136711, -0.11109756443985418, -0.10739153257922315, 0.027816717390764932, 0.37590866243909493, -0.2931059763812628, -0.23105978977973343, 0.11267275568174168, -0.23390710628667816, -0.14248774843443124, 0.2177053437583515, -0.138543363439194, -0.06717403510921315, 0.07314565244176593, 0.1407628135725123, -0.08458811765704609, -0.28290188597700344, 0.4616559353641799, -0.09089433320904852, 0.2013098023770774, 0.02635115503379312, 0.16689774806260085, 0.013522402673471169, -0.042894755291645645, 0.05390435619065996, -0.12420247405536995, 0.18051370878352738, 0.2645502057018094, 0.0668872217991252, 0.1775248590551439, -0.32273131789120496, -0.20463103701772747, 0.22941413337028907, 0.11556862804611198, 0.00084895451293617, -0.007155449282316888, -0.2558107680305228, 0.09879936055723028, -0.17129974525238648, -0.19079285160806336, -0.019290476106107235, 0.11997620556808886, -0.021128632586266172, -0.20665472840936092, 0.0020893774544972865, 0.11452697467089432, 0.15463711938164273, -0.05527123109605469, -0.11107929679946821, -0.06436361053378367, 0.1957649603451709, -0.04380582122239055, -0.0056752423893232816, 0.1323255586407346, -0.10423711220138386, -0.18632711928154602, 0.4503397734942617, -0.0031092528742356377, -0.19414511405420107, 0.20355373923285086, -0.15391011565129775, -0.2162317866306813, 0.19271161746172633, 0.1355853266708675, 0.1599692483432591, 0.008899548090994358, 0.218253027150583, -0.1408753231106723, 0.07639832247323433, 0.07094468077125608, -0.021116118412464857, 0.030295465408717512, 0.12497063524272965, 0.16825021580472344, 0.11679221799627679, 0.040792061189632314, 0.03961395516564123, -0.3490933805215554, -0.22494905190084313, -0.11797489677784873, 0.14484867752056385, -0.20426237210368958, -0.1711327924591596, 0.4273434351580065, -0.019737017806619406, 0.15010237935014437, 0.12143468119387256, 0.20443373745246257, -0.02072892400634582, 0.055194790085747104, 0.07230122667569362, 0.06253041336923594, 0.250896870479232, -0.1728138501801696, -0.11683319204441103, -0.09870527746140591, 0.22787062927591997]
|
1,803.04096
|
Saliency Inspired Quality Assessment of Stereoscopic 3D Video
|
To study the visual attentional behavior of Human Visual System (HVS) on 3D
content, eye tracking experiments are performed and Visual Attention Models
(VAMs) are designed. One of the main applications of these VAMs is in quality
assessment of 3D video. The usage of 2D VAMs in designing 2D quality metrics is
already well explored. This paper investigates the added value of incorporating
3D VAMs into Full-Reference (FR) and No-Reference (NR) quality assessment
metrics for stereoscopic 3D video. To this end, state-of-the-art 3D VAMs are
integrated to quality assessment pipeline of various existing FR and NR
stereoscopic video quality metrics. Performance evaluations using a large scale
database of stereoscopic videos with various types of distortions demonstrated
that using saliency maps generally improves the performance of the quality
assessment task for stereoscopic video. However, depending on the type of
distortion, utilized metric, and VAM, the amount of improvement will change.
|
eess.IV
|
to study the visual attentional behavior of human visual system hvs on 3d content eye tracking experiments are performed and visual attention models vams are designed one of the main applications of these vams is in quality assessment of 3d video the usage of 2d vams in designing 2d quality metrics is already well explored this paper investigates the added value of incorporating 3d vams into fullreference fr and noreference nr quality assessment metrics for stereoscopic 3d video to this end stateoftheart 3d vams are integrated to quality assessment pipeline of various existing fr and nr stereoscopic video quality metrics performance evaluations using a large scale database of stereoscopic videos with various types of distortions demonstrated that using saliency maps generally improves the performance of the quality assessment task for stereoscopic video however depending on the type of distortion utilized metric and vam the amount of improvement will change
|
[['to', 'study', 'the', 'visual', 'attentional', 'behavior', 'of', 'human', 'visual', 'system', 'hvs', 'on', '3d', 'content', 'eye', 'tracking', 'experiments', 'are', 'performed', 'and', 'visual', 'attention', 'models', 'vams', 'are', 'designed', 'one', 'of', 'the', 'main', 'applications', 'of', 'these', 'vams', 'is', 'in', 'quality', 'assessment', 'of', '3d', 'video', 'the', 'usage', 'of', '2d', 'vams', 'in', 'designing', '2d', 'quality', 'metrics', 'is', 'already', 'well', 'explored', 'this', 'paper', 'investigates', 'the', 'added', 'value', 'of', 'incorporating', '3d', 'vams', 'into', 'fullreference', 'fr', 'and', 'noreference', 'nr', 'quality', 'assessment', 'metrics', 'for', 'stereoscopic', '3d', 'video', 'to', 'this', 'end', 'stateoftheart', '3d', 'vams', 'are', 'integrated', 'to', 'quality', 'assessment', 'pipeline', 'of', 'various', 'existing', 'fr', 'and', 'nr', 'stereoscopic', 'video', 'quality', 'metrics', 'performance', 'evaluations', 'using', 'a', 'large', 'scale', 'database', 'of', 'stereoscopic', 'videos', 'with', 'various', 'types', 'of', 'distortions', 'demonstrated', 'that', 'using', 'saliency', 'maps', 'generally', 'improves', 'the', 'performance', 'of', 'the', 'quality', 'assessment', 'task', 'for', 'stereoscopic', 'video', 'however', 'depending', 'on', 'the', 'type', 'of', 'distortion', 'utilized', 'metric', 'and', 'vam', 'the', 'amount', 'of', 'improvement', 'will', 'change']]
|
[-0.07867463543579832, -0.04036471962885019, -0.02377850681874626, 0.03893893370217325, -0.10221882204618149, -0.1327921946567402, -0.05944102856833738, 0.4546756214093442, -0.15295754978120726, -0.40744404699778397, 0.06798875036074362, -0.29945669954505144, -0.16939780925050527, 0.20907471427418942, -0.20448684603000847, 0.1541672992026246, 0.1633305670068468, 0.03569407219648511, -0.10083410847188293, -0.27892560318453025, 0.2937520839773456, 0.1036396551027194, 0.39819527111147474, 0.0196535272911291, 0.09792791370727472, -0.04791711994771839, -0.07457140776885036, 0.06434051415774793, -0.10988928491880394, 0.19213002088992237, 0.2855505739012157, 0.21713070487876027, 0.2703499905014998, -0.3706249639941942, -0.24449686729817982, 0.00544221230763817, 0.14296079874538736, 0.020518295373142564, -0.11434213578507255, -0.37860993810948107, 0.11269439224719426, -0.173483046085805, 0.04139189163672944, -0.09471404248060997, -0.033938129588761586, -0.0058962858552363195, -0.275780496481281, 0.01245964707762953, 0.00941942642120982, 0.12640084111875535, -0.09604600574602466, -0.06936194116621584, 0.0037088129206891826, 0.27886549621857953, 0.06685741397320924, 0.07251110476451057, 0.15239293160129513, -0.2418691654906033, -0.10339513715183138, 0.45945777011497707, -0.049264012721848466, -0.23446660388836124, 0.1942946225554751, -0.059133988936375455, -0.1262698076109108, 0.13042216263742704, 0.25380327347541015, 0.06961790607279579, -0.1523974005370432, -0.001867561196383314, 0.02778392149472997, 0.22376722539618812, 0.08301443532429598, 0.046468722587138814, 0.19573253234098323, 0.2590392064896956, -0.01941383363102444, 0.1356320528113502, -0.14611872614692623, -0.008007478834623659, -0.1890851681639484, -0.15937847897547902, -0.1561129124547611, -0.019360649227570966, -0.12191908112719292, -0.1633253788291133, 0.45582871944112263, 0.22400400078474175, 0.15725509393585207, 0.048514427818770474, 0.39767355095570117, -0.008877385213921134, 0.049367223617827034, -0.0058096180792629164, 0.21487742472102478, -0.09289605800537455, 0.16454336845984796, -0.17554053347307763, 0.02830521885740052, 0.10502330160812294]
|
1,803.04097
|
Structure-preserving $H^2$ optimal model reduction based on Riemannian
trust-region method
|
This paper studies stability and symmetry preserving $H^2$ optimal model
reduction problems of linear systems which include linear gradient systems as a
special case. The problem is formulated as a nonlinear optimization problem on
the product manifold of the manifold of symmetric positive definite matrices
and the Euclidean spaces. To solve the problem by using the trust-region
method, the gradient and Hessian of the objective function are derived.
Furthermore, it is shown that if we restrict our systems to gradient systems,
the gradient and Hessian can be obtained more efficiently. More concretely, by
symmetry, we can reduce linear matrix equations to be solved. In addition, by a
simple example, we show that the solutions to our problem and a similar problem
in some literatures are not unique and the solution sets of both problems do
not contain each other in general. Also, it is revealed that the attained
optimal values do not coincide. Numerical experiments show that the proposed
method gives a reduced system with the same structure with the original system
although the balanced truncation method does not.
|
math.OC
|
this paper studies stability and symmetry preserving h2 optimal model reduction problems of linear systems which include linear gradient systems as a special case the problem is formulated as a nonlinear optimization problem on the product manifold of the manifold of symmetric positive definite matrices and the euclidean spaces to solve the problem by using the trustregion method the gradient and hessian of the objective function are derived furthermore it is shown that if we restrict our systems to gradient systems the gradient and hessian can be obtained more efficiently more concretely by symmetry we can reduce linear matrix equations to be solved in addition by a simple example we show that the solutions to our problem and a similar problem in some literatures are not unique and the solution sets of both problems do not contain each other in general also it is revealed that the attained optimal values do not coincide numerical experiments show that the proposed method gives a reduced system with the same structure with the original system although the balanced truncation method does not
|
[['this', 'paper', 'studies', 'stability', 'and', 'symmetry', 'preserving', 'h2', 'optimal', 'model', 'reduction', 'problems', 'of', 'linear', 'systems', 'which', 'include', 'linear', 'gradient', 'systems', 'as', 'a', 'special', 'case', 'the', 'problem', 'is', 'formulated', 'as', 'a', 'nonlinear', 'optimization', 'problem', 'on', 'the', 'product', 'manifold', 'of', 'the', 'manifold', 'of', 'symmetric', 'positive', 'definite', 'matrices', 'and', 'the', 'euclidean', 'spaces', 'to', 'solve', 'the', 'problem', 'by', 'using', 'the', 'trustregion', 'method', 'the', 'gradient', 'and', 'hessian', 'of', 'the', 'objective', 'function', 'are', 'derived', 'furthermore', 'it', 'is', 'shown', 'that', 'if', 'we', 'restrict', 'our', 'systems', 'to', 'gradient', 'systems', 'the', 'gradient', 'and', 'hessian', 'can', 'be', 'obtained', 'more', 'efficiently', 'more', 'concretely', 'by', 'symmetry', 'we', 'can', 'reduce', 'linear', 'matrix', 'equations', 'to', 'be', 'solved', 'in', 'addition', 'by', 'a', 'simple', 'example', 'we', 'show', 'that', 'the', 'solutions', 'to', 'our', 'problem', 'and', 'a', 'similar', 'problem', 'in', 'some', 'literatures', 'are', 'not', 'unique', 'and', 'the', 'solution', 'sets', 'of', 'both', 'problems', 'do', 'not', 'contain', 'each', 'other', 'in', 'general', 'also', 'it', 'is', 'revealed', 'that', 'the', 'attained', 'optimal', 'values', 'do', 'not', 'coincide', 'numerical', 'experiments', 'show', 'that', 'the', 'proposed', 'method', 'gives', 'a', 'reduced', 'system', 'with', 'the', 'same', 'structure', 'with', 'the', 'original', 'system', 'although', 'the', 'balanced', 'truncation', 'method', 'does', 'not']]
|
[-0.09040496142271531, 0.014331746362565949, -0.07695013749824223, 0.07415873534176186, -0.08875233557741236, -0.14677250264316546, 0.0015484589892153383, 0.37654772738005193, -0.3106275869210839, -0.26389391404998036, 0.16254728314806266, -0.25705180519687104, -0.21961160854035833, 0.20224142525938218, -0.07647833105842661, 0.08386470370884665, 0.09133610480943663, 0.03180332269582003, -0.1327966684293439, -0.29185337623172863, 0.3389927918278721, 0.019369098727263553, 0.25440424298815556, 0.04593457427791543, 0.13030592744972286, -0.031131771806752383, 0.03265272594686577, 0.09597272091992616, -0.06845612286192666, 0.11556584339435394, 0.2442249824480263, 0.15389929885336057, 0.28016493540366477, -0.41162013579888385, -0.23382675151377083, 0.1511386793013142, 0.1540788254185512, 0.12155391668898247, -0.040739547380788624, -0.2347378632217625, 0.12178800759093014, -0.13002514728350179, -0.10717501110974803, -0.10603689642586646, -0.047958394658215886, 0.0069148343007012615, -0.28860578544381954, 0.07149737089850898, 0.0754523442090065, -0.01676631691883833, -0.10617183925786873, -0.12102256944031044, -0.01698021910429084, 0.08362587292772307, 0.03127115601140423, 0.027039989643709413, 0.08413590118744249, -0.07620764677360779, -0.09845929873675399, 0.40227078792103177, -0.054882891226414196, -0.3146177437468614, 0.1633159035079275, -0.10755142678543093, -0.1293135969288252, 0.10812275013535196, 0.174017736737684, 0.18626071445971687, -0.12797550862822837, 0.10696362806341023, -0.09078561694116732, 0.17203195255923517, 0.01811052638095642, -0.03616937708113519, 0.10580467204459261, 0.09146686776264118, 0.1672113257272991, 0.13574033016605594, 0.020963352442817898, -0.11132407388695406, -0.28258365751686376, -0.1300729992461271, -0.18644149666495996, 0.006323927230729758, -0.08586050609764695, -0.1557145348271061, 0.3569476097385144, 0.12235758960892201, 0.20170230978017661, 0.06845249825706133, 0.27544566355749717, 0.17347962348904022, 0.06841853274001256, 0.0985617405818203, 0.22847467102842045, 0.1269529928991769, 0.09063586681904323, -0.24292851151253342, 0.04287682595928122, 0.08939804794011877]
|
1,803.04098
|
Time-dependent numerical renormalization group method for multiple
quenches: towards exact results for the long time limit of thermodynamic
observables and spectral functions
|
We develop an alternative time-dependent numerical renormalization group
(TDNRG) formalism for multiple quenches and implement it to study the response
of a quantum impurity system to a general pulse. Within this approach, we
reduce the contribution of the NRG approximation to numerical errors in the
time evolution of observables by a formulation that avoids the use of the
generalized overlap matrix elements in our previous multiple-quench TDNRG
formalism [Nghiem {\em et al.,} Phys. Rev. B {\bf 89}, 075118 (2014); Phys.
Rev. B {\bf 90}, 035129 (2014)]. We demonstrate that the formalism yields a
smaller cumulative error in the trace of the projected density matrix as a
function of time and a smaller discontinuity of local observables between
quenches than in our previous approach. Moreover, by increasing the switch-on
time, the time between the first and last quench of the discretized pulse, the
long-time limit of observables systematically converges to its expected value
in the final state, i.e., the more adiabatic the switching, the more accurately
is the long-time limit recovered. The present formalism can be
straightforwardly extended to infinite switch-on times. We show that this
yields highly accurate results for the long-time limit of both thermodynamic
observables and spectral functions, and overcomes the significant errors within
the single quench formalism [Anders {\em et al.}, Phys. Rev. Lett. {\bf 95},
196801 (2005); Nghiem {\em et al.}, Phys. Rev. Lett. {\bf 119}, 156601 (2017)].
This improvement provides a first step towards an accurate description of
nonequilibrium steady states of quantum impurity systems, e.g., within the
scattering states NRG approach [Anders, Phys. Rev. Lett. {\bf 101}, 066804
(2008)].
|
cond-mat.str-el
|
we develop an alternative timedependent numerical renormalization group tdnrg formalism for multiple quenches and implement it to study the response of a quantum impurity system to a general pulse within this approach we reduce the contribution of the nrg approximation to numerical errors in the time evolution of observables by a formulation that avoids the use of the generalized overlap matrix elements in our previous multiplequench tdnrg formalism nghiem em et al phys rev b bf 89 075118 2014 phys rev b bf 90 035129 2014 we demonstrate that the formalism yields a smaller cumulative error in the trace of the projected density matrix as a function of time and a smaller discontinuity of local observables between quenches than in our previous approach moreover by increasing the switchon time the time between the first and last quench of the discretized pulse the longtime limit of observables systematically converges to its expected value in the final state ie the more adiabatic the switching the more accurately is the longtime limit recovered the present formalism can be straightforwardly extended to infinite switchon times we show that this yields highly accurate results for the longtime limit of both thermodynamic observables and spectral functions and overcomes the significant errors within the single quench formalism anders em et al phys rev lett bf 95 196801 2005 nghiem em et al phys rev lett bf 119 156601 2017 this improvement provides a first step towards an accurate description of nonequilibrium steady states of quantum impurity systems eg within the scattering states nrg approach anders phys rev lett bf 101 066804 2008
|
[['we', 'develop', 'an', 'alternative', 'timedependent', 'numerical', 'renormalization', 'group', 'tdnrg', 'formalism', 'for', 'multiple', 'quenches', 'and', 'implement', 'it', 'to', 'study', 'the', 'response', 'of', 'a', 'quantum', 'impurity', 'system', 'to', 'a', 'general', 'pulse', 'within', 'this', 'approach', 'we', 'reduce', 'the', 'contribution', 'of', 'the', 'nrg', 'approximation', 'to', 'numerical', 'errors', 'in', 'the', 'time', 'evolution', 'of', 'observables', 'by', 'a', 'formulation', 'that', 'avoids', 'the', 'use', 'of', 'the', 'generalized', 'overlap', 'matrix', 'elements', 'in', 'our', 'previous', 'multiplequench', 'tdnrg', 'formalism', 'nghiem', 'em', 'et', 'al', 'phys', 'rev', 'b', 'bf', '89', '075118', '2014', 'phys', 'rev', 'b', 'bf', '90', '035129', '2014', 'we', 'demonstrate', 'that', 'the', 'formalism', 'yields', 'a', 'smaller', 'cumulative', 'error', 'in', 'the', 'trace', 'of', 'the', 'projected', 'density', 'matrix', 'as', 'a', 'function', 'of', 'time', 'and', 'a', 'smaller', 'discontinuity', 'of', 'local', 'observables', 'between', 'quenches', 'than', 'in', 'our', 'previous', 'approach', 'moreover', 'by', 'increasing', 'the', 'switchon', 'time', 'the', 'time', 'between', 'the', 'first', 'and', 'last', 'quench', 'of', 'the', 'discretized', 'pulse', 'the', 'longtime', 'limit', 'of', 'observables', 'systematically', 'converges', 'to', 'its', 'expected', 'value', 'in', 'the', 'final', 'state', 'ie', 'the', 'more', 'adiabatic', 'the', 'switching', 'the', 'more', 'accurately', 'is', 'the', 'longtime', 'limit', 'recovered', 'the', 'present', 'formalism', 'can', 'be', 'straightforwardly', 'extended', 'to', 'infinite', 'switchon', 'times', 'we', 'show', 'that', 'this', 'yields', 'highly', 'accurate', 'results', 'for', 'the', 'longtime', 'limit', 'of', 'both', 'thermodynamic', 'observables', 'and', 'spectral', 'functions', 'and', 'overcomes', 'the', 'significant', 'errors', 'within', 'the', 'single', 'quench', 'formalism', 'anders', 'em', 'et', 'al', 'phys', 'rev', 'lett', 'bf', '95', '196801', '2005', 'nghiem', 'em', 'et', 'al', 'phys', 'rev', 'lett', 'bf', '119', '156601', '2017', 'this', 'improvement', 'provides', 'a', 'first', 'step', 'towards', 'an', 'accurate', 'description', 'of', 'nonequilibrium', 'steady', 'states', 'of', 'quantum', 'impurity', 'systems', 'eg', 'within', 'the', 'scattering', 'states', 'nrg', 'approach', 'anders', 'phys', 'rev', 'lett', 'bf', '101', '066804', '2008']]
|
[-0.09567012058453228, 0.09319766261179974, -0.09559151673175652, -0.03925396012895209, -0.0011904552093639227, -0.063934370006481, 0.11546450896256415, 0.3161778477951884, -0.1533759845745432, -0.32459539712774227, -0.04146613468910243, -0.23282928121636598, -0.158670909442293, 0.18147556074106375, -0.08472214640277556, 0.05843468291227352, 0.0511237731492468, -0.07372887236765546, -0.13611095167082732, -0.26313126896921957, 0.15059258145685184, 0.11366135481311458, 0.2805607597463161, 0.04073874375932775, 0.05258511320306024, 0.0875171190671894, -0.016978609232924224, -0.00613356270814864, -0.1875072912258349, 0.0189925937773303, 0.20481217968709395, 0.07108827176864234, 0.2731868708970104, -0.41529778696924907, -0.2197021793215482, 0.06740362799487351, 0.0723793797153811, 0.1792964766255198, 0.05979207483817416, -0.36620961146436315, 0.031525090076314766, -0.2519042600861526, -0.13289177201338598, -0.12194160997360888, 0.15286282427837336, -0.01921000185429736, -0.3034406667298698, 0.2176142488829292, 0.04603335904439205, -0.0028858474064154473, 0.00828952859271803, -0.067477891577579, -0.005684844186079913, 0.008380395925864292, -0.034113023131265095, 0.10805367168228203, 0.12390710721666642, -0.02774855889240815, -0.1103647358499653, 0.33161233855461364, -0.07920109468693551, -0.13188249615763253, 0.19156544428618474, -0.11185721569236054, -0.12551331464415308, 0.10831897543793209, 0.149924215949872, 0.18699534721155134, -0.1705867616081489, 0.14648248310985001, -0.07670738483766644, 0.14270267253777305, 0.05861975275554562, 0.005405644163840818, 0.12398845739519916, 0.10062110993896979, -0.004397193983311397, 0.07967301522215678, -0.09453147204888991, -0.1447705019823404, -0.33221473547356145, -0.15527890423846966, -0.2144318584645331, 0.08906995125696548, -0.01653580422667292, -0.13873473574118367, 0.4201323572132323, 0.2127455751611441, 0.22356065561445393, 0.03934357393625767, 0.21947452161725167, 0.16455007481171974, -0.04743025796907201, 0.18261457538282164, 0.2580179637761865, 0.19379345145543958, 0.10129987367810646, -0.2730979686014183, -0.012548802857611943, 0.07616732639679417]
|
1,803.04099
|
Context-aware Human Intent Inference for Improving Human Machine
Cooperation
|
The ability of human beings to precisely recog- nize others intents is a
significant mental activity in reasoning about actions, such as, what other
people are doing and what they will do next. Recent research has revealed that
human intents could be inferred by measuring human cognitive activities through
heterogeneous body and brain sensors (e.g., sensors for detecting physiological
signals like ECG, brain signals like EEG and IMU sensors like accelerometers
and gyros etc.). In this proposal, we aim at developing a computa- tional
framework for enabling reliable and precise real-time human intent recognition
by measuring human cognitive and physiological activities through the
heterogeneous body and brain sensors for improving human machine interactions,
and serving intent-based human activity prediction.
|
cs.HC
|
the ability of human beings to precisely recog nize others intents is a significant mental activity in reasoning about actions such as what other people are doing and what they will do next recent research has revealed that human intents could be inferred by measuring human cognitive activities through heterogeneous body and brain sensors eg sensors for detecting physiological signals like ecg brain signals like eeg and imu sensors like accelerometers and gyros etc in this proposal we aim at developing a computa tional framework for enabling reliable and precise realtime human intent recognition by measuring human cognitive and physiological activities through the heterogeneous body and brain sensors for improving human machine interactions and serving intentbased human activity prediction
|
[['the', 'ability', 'of', 'human', 'beings', 'to', 'precisely', 'recog', 'nize', 'others', 'intents', 'is', 'a', 'significant', 'mental', 'activity', 'in', 'reasoning', 'about', 'actions', 'such', 'as', 'what', 'other', 'people', 'are', 'doing', 'and', 'what', 'they', 'will', 'do', 'next', 'recent', 'research', 'has', 'revealed', 'that', 'human', 'intents', 'could', 'be', 'inferred', 'by', 'measuring', 'human', 'cognitive', 'activities', 'through', 'heterogeneous', 'body', 'and', 'brain', 'sensors', 'eg', 'sensors', 'for', 'detecting', 'physiological', 'signals', 'like', 'ecg', 'brain', 'signals', 'like', 'eeg', 'and', 'imu', 'sensors', 'like', 'accelerometers', 'and', 'gyros', 'etc', 'in', 'this', 'proposal', 'we', 'aim', 'at', 'developing', 'a', 'computa', 'tional', 'framework', 'for', 'enabling', 'reliable', 'and', 'precise', 'realtime', 'human', 'intent', 'recognition', 'by', 'measuring', 'human', 'cognitive', 'and', 'physiological', 'activities', 'through', 'the', 'heterogeneous', 'body', 'and', 'brain', 'sensors', 'for', 'improving', 'human', 'machine', 'interactions', 'and', 'serving', 'intentbased', 'human', 'activity', 'prediction']]
|
[-0.06493505957867887, 0.1386515896854196, -0.029010149548165658, 0.07353949066946062, -0.18040932812806915, -0.22244498996316628, 0.030419273732103787, 0.4436622562392031, -0.19804850217128583, -0.3459648846380286, 0.08945327116002849, -0.33730267277145287, -0.28823860965164033, 0.2082677391304445, -0.20270591078847014, 0.1060066286679673, 0.10060676742814702, 0.14557051017754158, 0.05888587362389475, -0.1422960396848177, 0.19942323178431745, 0.06853437601683378, 0.2917653705245989, 0.025578163666808505, 0.09067777582538962, 0.026863520081012934, -0.07564615403791353, -0.034886144882983576, -0.03225005445026416, 0.2015307430193712, 0.4408329711668095, 0.27410595927198056, 0.36217872856847816, -0.5315669627418205, -0.2667434796635693, 0.10088892559379327, 0.1329704226823119, 0.02861206912853897, -0.031074857846360212, -0.4537336615001057, 0.09444783333199636, -0.15860356157250954, -0.023384644267133485, -0.09298573561423158, 0.06170284452402207, -0.03574833917131616, -0.2338329545435322, 0.03038795863009863, 0.01154409879936947, 0.20281549883311836, -0.10854903178021186, -0.04283771220342082, 0.0739380139877262, 0.34091263036322544, 0.061127176564541974, 0.04632490514225121, 0.33718506435042844, -0.21245819568570892, -0.16407555659593603, 0.3363306558043775, 0.05690011332379812, -0.19091223328082302, 0.2605029408883114, -0.1171313925819882, -0.13901549118365777, 0.02525772669715649, 0.22605518421347617, 0.017783111657836807, -0.23563583080964637, -0.07855311176202939, 0.06959142858730787, 0.1618675578867038, 0.07213938559437076, 0.01590317106111196, 0.24701150196557076, 0.22233217667346283, 0.017694817202844482, 0.009541715506633934, -0.08787170622371517, 4.3788579513587184e-05, -0.1394586255842962, -0.12467526017009455, -0.13044795178674098, 0.02446456326090857, -0.06648547696719198, -0.06983849841122658, 0.3858010825223558, 0.19181509113917916, 0.10173059603045458, 0.0772638538831616, 0.35142413821955354, -0.04786544646061483, 0.11923114011474585, -0.007019802811555564, 0.16280440583537034, -0.047625834302842555, 0.20143156102463855, -0.19176203503778552, 0.185107678454172, -0.04270066611934453]
|
1,803.041
|
Multi-Hop Routing in Covert Wireless Networks
|
In covert communication, Alice tries to communicate with Bob without being
detected by a warden Willie. When the distance between Alice and Bob becomes
large compared to the distance between Alice and Willie(s), the performance of
covert communication will be degraded. In this case, multi-hop message
transmission via intermediate relays can help to improve performance. Hence, in
this work multi-hop covert communication over a moderate size network and in
the presence of multiple collaborating Willies is considered. The relays can
transmit covertly using either a single key for all relays, or different
independent keys at the relays. For each case, we develop efficient algorithms
to find optimal paths with maximum throughput and minimum end-to-end delay
between Alice and Bob. As expected, employing multiple hops significantly
improves the ability to communicate covertly versus the case of a single-hop
transmission. Furthermore, at the expense of more shared key bits, analytical
results and numerical simulations demonstrate that multi-hop covert
communication with different independent keys at the relays has better
performance than multi-hop covert communication with a single key.
|
cs.NI
|
in covert communication alice tries to communicate with bob without being detected by a warden willie when the distance between alice and bob becomes large compared to the distance between alice and willies the performance of covert communication will be degraded in this case multihop message transmission via intermediate relays can help to improve performance hence in this work multihop covert communication over a moderate size network and in the presence of multiple collaborating willies is considered the relays can transmit covertly using either a single key for all relays or different independent keys at the relays for each case we develop efficient algorithms to find optimal paths with maximum throughput and minimum endtoend delay between alice and bob as expected employing multiple hops significantly improves the ability to communicate covertly versus the case of a singlehop transmission furthermore at the expense of more shared key bits analytical results and numerical simulations demonstrate that multihop covert communication with different independent keys at the relays has better performance than multihop covert communication with a single key
|
[['in', 'covert', 'communication', 'alice', 'tries', 'to', 'communicate', 'with', 'bob', 'without', 'being', 'detected', 'by', 'a', 'warden', 'willie', 'when', 'the', 'distance', 'between', 'alice', 'and', 'bob', 'becomes', 'large', 'compared', 'to', 'the', 'distance', 'between', 'alice', 'and', 'willies', 'the', 'performance', 'of', 'covert', 'communication', 'will', 'be', 'degraded', 'in', 'this', 'case', 'multihop', 'message', 'transmission', 'via', 'intermediate', 'relays', 'can', 'help', 'to', 'improve', 'performance', 'hence', 'in', 'this', 'work', 'multihop', 'covert', 'communication', 'over', 'a', 'moderate', 'size', 'network', 'and', 'in', 'the', 'presence', 'of', 'multiple', 'collaborating', 'willies', 'is', 'considered', 'the', 'relays', 'can', 'transmit', 'covertly', 'using', 'either', 'a', 'single', 'key', 'for', 'all', 'relays', 'or', 'different', 'independent', 'keys', 'at', 'the', 'relays', 'for', 'each', 'case', 'we', 'develop', 'efficient', 'algorithms', 'to', 'find', 'optimal', 'paths', 'with', 'maximum', 'throughput', 'and', 'minimum', 'endtoend', 'delay', 'between', 'alice', 'and', 'bob', 'as', 'expected', 'employing', 'multiple', 'hops', 'significantly', 'improves', 'the', 'ability', 'to', 'communicate', 'covertly', 'versus', 'the', 'case', 'of', 'a', 'singlehop', 'transmission', 'furthermore', 'at', 'the', 'expense', 'of', 'more', 'shared', 'key', 'bits', 'analytical', 'results', 'and', 'numerical', 'simulations', 'demonstrate', 'that', 'multihop', 'covert', 'communication', 'with', 'different', 'independent', 'keys', 'at', 'the', 'relays', 'has', 'better', 'performance', 'than', 'multihop', 'covert', 'communication', 'with', 'a', 'single', 'key']]
|
[-0.25897712420339564, 0.05513688786354448, -0.027086106786238295, 0.0021624231055778053, -0.049567050782165355, -0.37983269197334135, 0.16717335701055291, 0.4012426830389138, -0.2801987680100969, -0.3120591860158103, 0.02648604446556419, -0.322373439025666, -0.09163588819360094, 0.1329186768443989, -0.13928995010576078, 0.05777216808072158, 0.07039597237216574, 0.08043294098361262, 0.003058180387264916, -0.31549038051627576, 0.24995431447073185, 0.15430250378591673, 0.2969838667235204, 0.016152387083108937, 0.05645252711006573, 0.08832676975655236, -0.013081574393103697, -0.07522169417502092, -0.07560507701398039, 0.05066970806036677, 0.36215946909306307, 0.16454228856792075, 0.2836293576178806, -0.44124992748456343, -0.2581866627931595, 0.14748815969430976, 0.21162337274157575, 0.07905705439059862, -0.003879910860892518, -0.29209582082661134, 0.1626923617481121, -0.22499009163651082, 0.01952097001884665, 0.06520129446403838, -0.09786186614739044, 0.06219254721521533, -0.3302092165553144, -0.022495923273797545, -0.07369164449062997, 0.023850388995238715, 0.04202753104535597, -0.029285349468035356, 0.02224125602681722, 0.26628624527864825, 0.008118015248328447, 0.03045473514124751, 0.08796111575194768, -0.07470750610477157, -0.166410493967695, 0.2997847382777504, -0.0028396623545891737, -0.19309832994427, 0.1820688598443355, -0.06799478047236335, -0.05474892932921648, 0.12564232866412828, 0.23789645170792936, 0.0658422092694257, -0.15945515583044784, -0.04675745241809636, -0.0017505796679428646, 0.23610921578282223, 0.14133568531168358, 0.15693661026390535, 0.13178799569207642, 0.16259967908396253, 0.1289023094757327, 0.12368591077692274, -0.1052382150345615, -0.1205795040753271, -0.23032013387618852, -0.15429369357813683, -0.2589381850730362, 0.03144642234912941, -0.14944374819369322, 0.038396034623895375, 0.3085595079538013, 0.17152569131260473, 0.12779643433301577, 0.12804776522863123, 0.46748032339981627, -0.007730979198989059, 0.07221375804394484, 0.24342869985316481, 0.21503731051592956, 0.08630742892755994, 0.12654454276165258, -0.19490777472433235, 0.14367411261690513, -0.06684063219066178]
|
1,803.04101
|
Ab Initio No Core Shell Model with Leadership-Class Supercomputers
|
Nuclear structure and reaction theory is undergoing a major renaissance with
advances in many-body methods, strong interactions with greatly improved links
to Quantum Chromodynamics (QCD), the advent of high performance computing, and
improved computational algorithms. Predictive power, with well-quantified
uncertainty, is emerging from non-perturbative approaches along with the
potential for guiding experiments to new discoveries. We present an overview of
some of our recent developments and discuss challenges that lie ahead. Our foci
include: (1) strong interactions derived from chiral effective field theory;
(2) advances in solving the large sparse matrix eigenvalue problem on
leadership-class supercomputers; (3) selected observables in light nuclei with
the JISP16 interaction; (4) effective electroweak operators consistent with the
Hamiltonian; and, (5) discussion of A=48 system as an opportunity for the
no-core approach with the reintroduction of the core.
|
nucl-th
|
nuclear structure and reaction theory is undergoing a major renaissance with advances in manybody methods strong interactions with greatly improved links to quantum chromodynamics qcd the advent of high performance computing and improved computational algorithms predictive power with wellquantified uncertainty is emerging from nonperturbative approaches along with the potential for guiding experiments to new discoveries we present an overview of some of our recent developments and discuss challenges that lie ahead our foci include 1 strong interactions derived from chiral effective field theory 2 advances in solving the large sparse matrix eigenvalue problem on leadershipclass supercomputers 3 selected observables in light nuclei with the jisp16 interaction 4 effective electroweak operators consistent with the hamiltonian and 5 discussion of a48 system as an opportunity for the nocore approach with the reintroduction of the core
|
[['nuclear', 'structure', 'and', 'reaction', 'theory', 'is', 'undergoing', 'a', 'major', 'renaissance', 'with', 'advances', 'in', 'manybody', 'methods', 'strong', 'interactions', 'with', 'greatly', 'improved', 'links', 'to', 'quantum', 'chromodynamics', 'qcd', 'the', 'advent', 'of', 'high', 'performance', 'computing', 'and', 'improved', 'computational', 'algorithms', 'predictive', 'power', 'with', 'wellquantified', 'uncertainty', 'is', 'emerging', 'from', 'nonperturbative', 'approaches', 'along', 'with', 'the', 'potential', 'for', 'guiding', 'experiments', 'to', 'new', 'discoveries', 'we', 'present', 'an', 'overview', 'of', 'some', 'of', 'our', 'recent', 'developments', 'and', 'discuss', 'challenges', 'that', 'lie', 'ahead', 'our', 'foci', 'include', '1', 'strong', 'interactions', 'derived', 'from', 'chiral', 'effective', 'field', 'theory', '2', 'advances', 'in', 'solving', 'the', 'large', 'sparse', 'matrix', 'eigenvalue', 'problem', 'on', 'leadershipclass', 'supercomputers', '3', 'selected', 'observables', 'in', 'light', 'nuclei', 'with', 'the', 'jisp16', 'interaction', '4', 'effective', 'electroweak', 'operators', 'consistent', 'with', 'the', 'hamiltonian', 'and', '5', 'discussion', 'of', 'a48', 'system', 'as', 'an', 'opportunity', 'for', 'the', 'nocore', 'approach', 'with', 'the', 'reintroduction', 'of', 'the', 'core']]
|
[-0.08007392185369044, 0.11519793157235551, -0.0542216946563904, 0.03722981424718619, -0.06175049964760437, -0.12743632775150182, 0.0019550597053581385, 0.35489176661546407, -0.22887825456454902, -0.32236145716860776, 0.07974967213237703, -0.3170434503108823, -0.15053133292760895, 0.18613547431059965, -0.002452052464442594, 0.09596612171402999, 0.11498285585111077, -0.0032822114846115945, -0.1057457524352651, -0.22297216253880328, 0.29464965385973063, 0.07886750347950824, 0.2438231737351157, 0.11422421979977, 0.07898372943999764, 0.031307031413631274, -0.03013801726659662, -0.00012637113914229815, -0.09778134205538991, 0.1982381175827109, 0.2522366613756228, 0.11426375559496141, 0.27602987647882865, -0.4652002007189326, -0.2141700224334696, 0.032497159315665304, 0.15575823539349817, 0.14513216371458948, -0.10560020229943741, -0.3178615202055894, 0.03687713080596991, -0.2157837578578663, -0.16974754907414877, -0.10081041255034506, 0.005219812239730325, 0.016585355992183873, -0.25230083734723147, 0.028978072293715452, -0.02831900939415384, 0.07377500774442128, -0.03523287156078601, -0.18269961139561847, 0.08134092616496776, 0.1057950221877405, 0.0438417549055994, 0.09069523950920552, 0.12526329189952098, -0.19569619499230967, -0.18470346090502868, 0.40618076505965756, -0.032367983216741926, -0.09747818511336538, 0.17211904749449314, -0.10408945781829998, -0.1963738801931136, 0.12186116798556781, 0.18677080173178442, 0.05372981948750023, -0.11888221209856535, 0.11700778740066055, 0.04963468632807857, 0.13811711093001208, -0.03493152215159533, 0.04831103312509848, 0.19634358928874976, 0.2230201782868769, 0.03947739867638811, 0.0382749890152337, -0.04103426376875854, -0.1401492700232823, -0.2871534690309904, -0.06874778113306913, -0.13416073743001858, 0.044141538280125396, -0.11365292289887759, -0.1177149351154055, 0.3655513806716728, 0.16007864906949767, 0.1526537982718949, 0.02441870659253651, 0.3128296597195523, 0.06761185163929638, 0.08312378119838361, 0.07224489224696518, 0.2694322362157457, 0.18443027003913334, 0.09208035609453805, -0.23702427043572516, -0.03923473360902749, 0.05453504836606912]
|
1,803.04102
|
Hardware Trojan Detection through Information Flow Security Verification
|
Semiconductor design houses are increasingly becoming dependent on third
party vendors to procure intellectual property (IP) and meet time-to-market
constraints. However, these third party IPs cannot be trusted as hardware
Trojans can be maliciously inserted into them by untrusted vendors. While
different approaches have been proposed to detect Trojans in third party IPs,
their limitations have not been extensively studied. In this paper, we analyze
the limitations of the state-of-the-art Trojan detection techniques and
demonstrate with experimental results how to defeat these detection mechanisms.
We then propose a Trojan detection framework based on information flow security
(IFS) verification. Our framework detects violation of IFS policies caused by
Trojans without the need of white-box knowledge of the IP. We experimentally
validate the efficacy of our proposed technique by accurately identifying
Trojans in the trust-hub benchmarks. We also demonstrate that our technique
does not share the limitations of the previously proposed Trojan detection
techniques.
|
cs.CR
|
semiconductor design houses are increasingly becoming dependent on third party vendors to procure intellectual property ip and meet timetomarket constraints however these third party ips cannot be trusted as hardware trojans can be maliciously inserted into them by untrusted vendors while different approaches have been proposed to detect trojans in third party ips their limitations have not been extensively studied in this paper we analyze the limitations of the stateoftheart trojan detection techniques and demonstrate with experimental results how to defeat these detection mechanisms we then propose a trojan detection framework based on information flow security ifs verification our framework detects violation of ifs policies caused by trojans without the need of whitebox knowledge of the ip we experimentally validate the efficacy of our proposed technique by accurately identifying trojans in the trusthub benchmarks we also demonstrate that our technique does not share the limitations of the previously proposed trojan detection techniques
|
[['semiconductor', 'design', 'houses', 'are', 'increasingly', 'becoming', 'dependent', 'on', 'third', 'party', 'vendors', 'to', 'procure', 'intellectual', 'property', 'ip', 'and', 'meet', 'timetomarket', 'constraints', 'however', 'these', 'third', 'party', 'ips', 'can', 'not', 'be', 'trusted', 'as', 'hardware', 'trojans', 'can', 'be', 'maliciously', 'inserted', 'into', 'them', 'by', 'untrusted', 'vendors', 'while', 'different', 'approaches', 'have', 'been', 'proposed', 'to', 'detect', 'trojans', 'in', 'third', 'party', 'ips', 'their', 'limitations', 'have', 'not', 'been', 'extensively', 'studied', 'in', 'this', 'paper', 'we', 'analyze', 'the', 'limitations', 'of', 'the', 'stateoftheart', 'trojan', 'detection', 'techniques', 'and', 'demonstrate', 'with', 'experimental', 'results', 'how', 'to', 'defeat', 'these', 'detection', 'mechanisms', 'we', 'then', 'propose', 'a', 'trojan', 'detection', 'framework', 'based', 'on', 'information', 'flow', 'security', 'ifs', 'verification', 'our', 'framework', 'detects', 'violation', 'of', 'ifs', 'policies', 'caused', 'by', 'trojans', 'without', 'the', 'need', 'of', 'whitebox', 'knowledge', 'of', 'the', 'ip', 'we', 'experimentally', 'validate', 'the', 'efficacy', 'of', 'our', 'proposed', 'technique', 'by', 'accurately', 'identifying', 'trojans', 'in', 'the', 'trusthub', 'benchmarks', 'we', 'also', 'demonstrate', 'that', 'our', 'technique', 'does', 'not', 'share', 'the', 'limitations', 'of', 'the', 'previously', 'proposed', 'trojan', 'detection', 'techniques']]
|
[-0.09822707047619349, -0.0021114147522511254, -0.10679874270633598, 0.05037940617292311, -0.10531965730172631, -0.2201765851136052, 0.0708621669580584, 0.388438416350829, -0.2127741559555656, -0.3605361213895345, 0.1332728453631525, -0.29137272628538896, -0.16528634855670757, 0.19466997761475413, -0.15727992662179627, 0.13245673145866022, 0.05820953315675357, -0.04481032535458278, 0.01121636309299471, -0.31274787222470257, 0.31313690801586125, 0.017505614975418308, 0.28793926524782654, 0.10559771415366988, 0.03846266154371398, -0.03377804042936891, -0.01814775401726365, -0.016997758482925986, -0.04532353230929163, 0.11808190778155174, 0.2833593194158503, 0.21731651447848171, 0.3112302406347896, -0.44817768052024276, -0.20387694754677604, 0.11840359579027311, 0.16155208126905277, 0.08265145630177453, -0.0697671152930094, -0.3807304729707539, 0.16506217887294233, -0.2722887824117941, -0.10329495426451199, -0.13721802270064423, -0.0509530505882331, 0.03041454311651729, -0.1978727714219866, -0.03722652601936716, 0.06588315803827227, 0.059776115684622995, -0.029571456595716115, -0.09801595997200102, 0.0048632362067062215, 0.17695861974521235, 0.033455273361668286, -0.08654347638443333, 0.20468400509439802, -0.07029327035324011, -0.21328090711904224, 0.34854866517707705, -0.014708646479687703, -0.15616613149789996, 0.20425806036540675, -0.04988042051340208, -0.1871553541461349, 0.08470439784593366, 0.20668035158029707, 0.08834381140523444, -0.20536318086210245, 0.00013372880034455048, -0.00563514455050034, 0.23438801104202867, 0.06204382759843659, 0.05168371315812692, 0.2009387695304069, 0.13714209456290855, 0.05463468098069394, 0.11887513063878655, -0.1280513223841569, -0.07701821239377175, -0.18521342268295962, -0.12599885786001228, -0.1898051643940179, -0.04784784129314128, -0.005905196091924536, -0.09264057029749413, 0.38269473346391397, 0.28049764941955035, 0.09782460584047888, 0.03226749490529887, 0.44406359048872746, 0.017685473228323787, 0.1779127686581648, 0.12025743116330552, 0.3107577493978361, -0.03349800166018356, 0.12222255419137103, -0.18455646825053632, 0.19757092076102517, 0.004198760323082465]
|
1,803.04103
|
Full Reference Objective Quality Assessment for Reconstructed Background
Images
|
With an increased interest in applications that require a clean background
image, such as video surveillance, object tracking, street view imaging and
location-based services on web-based maps, multiple algorithms have been
developed to reconstruct a background image from cluttered scenes.
Traditionally, statistical measures and existing image quality techniques have
been applied for evaluating the quality of the reconstructed background images.
Though these quality assessment methods have been widely used in the past,
their performance in evaluating the perceived quality of the reconstructed
background image has not been verified. In this work, we discuss the
shortcomings in existing metrics and propose a full reference Reconstructed
Background image Quality Index (RBQI) that combines color and structural
information at multiple scales using a probability summation model to predict
the perceived quality in the reconstructed background image given a reference
image. To compare the performance of the proposed quality index with existing
image quality assessment measures, we construct two different datasets
consisting of reconstructed background images and corresponding subjective
scores. The quality assessment measures are evaluated by correlating their
objective scores with human subjective ratings. The correlation results show
that the proposed RBQI outperforms all the existing approaches. Additionally,
the constructed datasets and the corresponding subjective scores provide a
benchmark to evaluate the performance of future metrics that are developed to
evaluate the perceived quality of reconstructed background images.
|
cs.CV
|
with an increased interest in applications that require a clean background image such as video surveillance object tracking street view imaging and locationbased services on webbased maps multiple algorithms have been developed to reconstruct a background image from cluttered scenes traditionally statistical measures and existing image quality techniques have been applied for evaluating the quality of the reconstructed background images though these quality assessment methods have been widely used in the past their performance in evaluating the perceived quality of the reconstructed background image has not been verified in this work we discuss the shortcomings in existing metrics and propose a full reference reconstructed background image quality index rbqi that combines color and structural information at multiple scales using a probability summation model to predict the perceived quality in the reconstructed background image given a reference image to compare the performance of the proposed quality index with existing image quality assessment measures we construct two different datasets consisting of reconstructed background images and corresponding subjective scores the quality assessment measures are evaluated by correlating their objective scores with human subjective ratings the correlation results show that the proposed rbqi outperforms all the existing approaches additionally the constructed datasets and the corresponding subjective scores provide a benchmark to evaluate the performance of future metrics that are developed to evaluate the perceived quality of reconstructed background images
|
[['with', 'an', 'increased', 'interest', 'in', 'applications', 'that', 'require', 'a', 'clean', 'background', 'image', 'such', 'as', 'video', 'surveillance', 'object', 'tracking', 'street', 'view', 'imaging', 'and', 'locationbased', 'services', 'on', 'webbased', 'maps', 'multiple', 'algorithms', 'have', 'been', 'developed', 'to', 'reconstruct', 'a', 'background', 'image', 'from', 'cluttered', 'scenes', 'traditionally', 'statistical', 'measures', 'and', 'existing', 'image', 'quality', 'techniques', 'have', 'been', 'applied', 'for', 'evaluating', 'the', 'quality', 'of', 'the', 'reconstructed', 'background', 'images', 'though', 'these', 'quality', 'assessment', 'methods', 'have', 'been', 'widely', 'used', 'in', 'the', 'past', 'their', 'performance', 'in', 'evaluating', 'the', 'perceived', 'quality', 'of', 'the', 'reconstructed', 'background', 'image', 'has', 'not', 'been', 'verified', 'in', 'this', 'work', 'we', 'discuss', 'the', 'shortcomings', 'in', 'existing', 'metrics', 'and', 'propose', 'a', 'full', 'reference', 'reconstructed', 'background', 'image', 'quality', 'index', 'rbqi', 'that', 'combines', 'color', 'and', 'structural', 'information', 'at', 'multiple', 'scales', 'using', 'a', 'probability', 'summation', 'model', 'to', 'predict', 'the', 'perceived', 'quality', 'in', 'the', 'reconstructed', 'background', 'image', 'given', 'a', 'reference', 'image', 'to', 'compare', 'the', 'performance', 'of', 'the', 'proposed', 'quality', 'index', 'with', 'existing', 'image', 'quality', 'assessment', 'measures', 'we', 'construct', 'two', 'different', 'datasets', 'consisting', 'of', 'reconstructed', 'background', 'images', 'and', 'corresponding', 'subjective', 'scores', 'the', 'quality', 'assessment', 'measures', 'are', 'evaluated', 'by', 'correlating', 'their', 'objective', 'scores', 'with', 'human', 'subjective', 'ratings', 'the', 'correlation', 'results', 'show', 'that', 'the', 'proposed', 'rbqi', 'outperforms', 'all', 'the', 'existing', 'approaches', 'additionally', 'the', 'constructed', 'datasets', 'and', 'the', 'corresponding', 'subjective', 'scores', 'provide', 'a', 'benchmark', 'to', 'evaluate', 'the', 'performance', 'of', 'future', 'metrics', 'that', 'are', 'developed', 'to', 'evaluate', 'the', 'perceived', 'quality', 'of', 'reconstructed', 'background', 'images']]
|
[-0.022769071690053284, -0.06186175859587282, -0.093093722527262, 0.09807925493844823, -0.04212356528952183, -0.10850617189102309, -0.0300621050389091, 0.4830433212120437, -0.1851195581403515, -0.3786987372707459, 0.08198051208383801, -0.3196357777926887, -0.12487254142782112, 0.18963949230599797, -0.1731605976882637, 0.12536618871470254, 0.12217261830152684, 0.07133741812446914, -0.0908713124341628, -0.30144096718267893, 0.2741363505695032, 0.07220960337242671, 0.43027377866559363, 0.026638752989671423, 0.11914487045748089, -0.02796245330418439, -0.13224023994386735, 0.07136684616259195, -0.07787642465651687, 0.1494929838462027, 0.3277979975288542, 0.24674366481681542, 0.27423956277132905, -0.36450997972234483, -0.23927233948668825, 0.06938894778581946, 0.11843881868828306, 0.034041226859389276, -0.08532599541264682, -0.40159168047621646, 0.10644420049745264, -0.13290303450645755, 0.0096886488859596, -0.12313018939269899, -0.04677123093879427, -0.01499624659344888, -0.26443832728285094, 0.038903075269310666, -0.03217000291461434, 0.09304752693022915, -0.07048577574632996, -0.12542702953045093, -0.00044864151864876397, 0.25427462599520056, 0.0706268486122062, 0.07177912760181394, 0.19524106874460598, -0.20902402510008025, -0.1772890980196219, 0.387694629180692, -0.0807257991632856, -0.26252827028255293, 0.20335147226220956, -0.08100771834038098, -0.11175722326465251, 0.14931421119285404, 0.22001541507870978, 0.07242598970976111, -0.1721621997729612, 0.005220392015720864, 0.011165907350682023, 0.1925511578152232, 0.1047956332514238, 0.0420832819338771, 0.1904467937041642, 0.16942018462603936, -0.025531422097294386, 0.13302778707077986, -0.1474262519662306, 0.009687364834356602, -0.16817538591045386, -0.10423216233322305, -0.18710771558290523, -0.03240983384433505, -0.10776970248354595, -0.19025393344478622, 0.42283618092670566, 0.24833395799012195, 0.17474248689795624, 0.04447127562517409, 0.4058616727652162, 0.018699214821409918, 0.06064099172597977, 0.016047220920408854, 0.2240602145271142, -0.02571513557142574, 0.11996756029689075, -0.1297537463645643, 0.08968736908206457, 0.04640437700658318]
|
1,803.04104
|
Dedekind Zeta Zeroes and Faster Complex Dimension Computation
|
Thanks to earlier work of Koiran, it is known that the truth of the
Generalized Riemann Hypothesis (GRH) implies that the dimension of algebraic
sets over the complex numbers can be determined within the
polynomial-hierarchy. The truth of GRH thus provides a direct connection
between a concrete algebraic geometry problem and the P vs.NP Problem, in a
radically different direction from the geometric complexity theory approach to
VP vs. VNP. We explore more plausible hypotheses yielding the same speed-up.
One minimalist hypothesis we derive involves improving the error term (as a
function of the degree, coefficient height, and $x$) on the fraction of primes
$p\!\leq\!x$ for which a univariate polynomial has roots mod $p$. A second
minimalist hypothesis involves sharpening current zero-free regions for
Dedekind zeta functions. Both our hypotheses allow failures of GRH but still
enable complex dimension computation in the polynomial hierarchy.
|
cs.CC math.AG math.NT
|
thanks to earlier work of koiran it is known that the truth of the generalized riemann hypothesis grh implies that the dimension of algebraic sets over the complex numbers can be determined within the polynomialhierarchy the truth of grh thus provides a direct connection between a concrete algebraic geometry problem and the p vsnp problem in a radically different direction from the geometric complexity theory approach to vp vs vnp we explore more plausible hypotheses yielding the same speedup one minimalist hypothesis we derive involves improving the error term as a function of the degree coefficient height and x on the fraction of primes pleqx for which a univariate polynomial has roots mod p a second minimalist hypothesis involves sharpening current zerofree regions for dedekind zeta functions both our hypotheses allow failures of grh but still enable complex dimension computation in the polynomial hierarchy
|
[['thanks', 'to', 'earlier', 'work', 'of', 'koiran', 'it', 'is', 'known', 'that', 'the', 'truth', 'of', 'the', 'generalized', 'riemann', 'hypothesis', 'grh', 'implies', 'that', 'the', 'dimension', 'of', 'algebraic', 'sets', 'over', 'the', 'complex', 'numbers', 'can', 'be', 'determined', 'within', 'the', 'polynomialhierarchy', 'the', 'truth', 'of', 'grh', 'thus', 'provides', 'a', 'direct', 'connection', 'between', 'a', 'concrete', 'algebraic', 'geometry', 'problem', 'and', 'the', 'p', 'vsnp', 'problem', 'in', 'a', 'radically', 'different', 'direction', 'from', 'the', 'geometric', 'complexity', 'theory', 'approach', 'to', 'vp', 'vs', 'vnp', 'we', 'explore', 'more', 'plausible', 'hypotheses', 'yielding', 'the', 'same', 'speedup', 'one', 'minimalist', 'hypothesis', 'we', 'derive', 'involves', 'improving', 'the', 'error', 'term', 'as', 'a', 'function', 'of', 'the', 'degree', 'coefficient', 'height', 'and', 'x', 'on', 'the', 'fraction', 'of', 'primes', 'pleqx', 'for', 'which', 'a', 'univariate', 'polynomial', 'has', 'roots', 'mod', 'p', 'a', 'second', 'minimalist', 'hypothesis', 'involves', 'sharpening', 'current', 'zerofree', 'regions', 'for', 'dedekind', 'zeta', 'functions', 'both', 'our', 'hypotheses', 'allow', 'failures', 'of', 'grh', 'but', 'still', 'enable', 'complex', 'dimension', 'computation', 'in', 'the', 'polynomial', 'hierarchy']]
|
[-0.17903042628003799, 0.02763978436800605, -0.13676877124961598, 0.12021672572851419, -0.10632246006808593, -0.14064030624688306, 0.08030310322296086, 0.26676141101361667, -0.30713235921596327, -0.2932937978898961, 0.04077119597048889, -0.1780320434692375, -0.14831560011292602, 0.21263876750384927, -0.06876250817948219, 0.0574781135622914, 0.02249261782445172, 0.056926380778524154, -0.0716027611658532, -0.31834420006959996, 0.3270450830921953, 0.004803325048753503, 0.23096741388175399, 0.05787344003040079, 0.08852102096819613, 0.003158325375658823, 0.0009670877459307088, -0.025532759039114554, -0.11225012730501992, 0.13405521258303948, 0.25501866274718066, 0.16897000629349168, 0.2628178086118601, -0.39992892296311067, -0.17649482449529863, 0.15657677364796532, 0.11773780070522681, 0.01949170315951928, 0.04130185957606271, -0.23900018118203004, 0.11096881350489161, -0.1289335956528877, -0.16213752133507572, -0.05508335716758214, 0.051867436843838356, -0.019554328297245058, -0.3087117695414745, 0.09213594201925798, 0.08990876901736285, 0.1115226080931776, -0.036495932082295526, -0.17172107467566558, 0.042528382949993435, 0.052243237705663484, 0.056014573080993606, 0.06420224686054156, 0.0675511921571026, -0.12701884969236685, -0.13191235068762766, 0.341926249982591, -0.008832338838243579, -0.2302230112161735, 0.16804191791815748, -0.15094942913938922, -0.16776158907681915, 0.12781499711803246, 0.10050384895149486, 0.11333077126810102, -0.04940242743687638, 0.15094432194390275, -0.11080132218421246, 0.1780281481927538, 0.12084457922416429, -0.02688509469409308, 0.16293110823298387, 0.08867336123362712, 0.0705641427206153, 0.1382393917450285, -0.053341310218650295, -0.07784795658821851, -0.3195837724240536, -0.2047544441298179, -0.16322420739918841, 0.08164875352662718, -0.13268068677734202, -0.16541637682953705, 0.3961347660168688, 0.12768350869536083, 0.18095527504115028, 0.17564518276043897, 0.2664071464950734, 0.10625659239045773, 0.05546168627957186, 0.035725300742032756, 0.14894512595925877, 0.15972908379523254, 0.011933454363573844, -0.13661031665281287, 0.1249018990738542, 0.11956170301038957]
|
1,803.04105
|
Construction of controlled-NOT gate based on microwave-activated phase
(MAP) gate in two transmon system
|
We experimentally constructed an all-microwave scheme for the controlled-NOT
(cNOT) gate between two superconducting transmon qubits in a three dimensional
cavity. Our cNOT gate is based on the microwave-activated phase (MAP) gate,
which requires an additional procedure to compensate the accumulated phases
during the operation of the MAP gate. We applied Z-axis phase gates using
microwave hyperbolic secant pulse on both qubits with adequate rotation angles
systematically calibrated by separate measurements.We evaluated the gate
performance of the constructed cNOT gate by performing two-qubit quantum
process tomography (QPT). Finally, we present the experimental implementation
of Deutsch-Jozsa algorithm using the cNOT gate.
|
quant-ph
|
we experimentally constructed an allmicrowave scheme for the controllednot cnot gate between two superconducting transmon qubits in a three dimensional cavity our cnot gate is based on the microwaveactivated phase map gate which requires an additional procedure to compensate the accumulated phases during the operation of the map gate we applied zaxis phase gates using microwave hyperbolic secant pulse on both qubits with adequate rotation angles systematically calibrated by separate measurementswe evaluated the gate performance of the constructed cnot gate by performing twoqubit quantum process tomography qpt finally we present the experimental implementation of deutschjozsa algorithm using the cnot gate
|
[['we', 'experimentally', 'constructed', 'an', 'allmicrowave', 'scheme', 'for', 'the', 'controllednot', 'cnot', 'gate', 'between', 'two', 'superconducting', 'transmon', 'qubits', 'in', 'a', 'three', 'dimensional', 'cavity', 'our', 'cnot', 'gate', 'is', 'based', 'on', 'the', 'microwaveactivated', 'phase', 'map', 'gate', 'which', 'requires', 'an', 'additional', 'procedure', 'to', 'compensate', 'the', 'accumulated', 'phases', 'during', 'the', 'operation', 'of', 'the', 'map', 'gate', 'we', 'applied', 'zaxis', 'phase', 'gates', 'using', 'microwave', 'hyperbolic', 'secant', 'pulse', 'on', 'both', 'qubits', 'with', 'adequate', 'rotation', 'angles', 'systematically', 'calibrated', 'by', 'separate', 'measurementswe', 'evaluated', 'the', 'gate', 'performance', 'of', 'the', 'constructed', 'cnot', 'gate', 'by', 'performing', 'twoqubit', 'quantum', 'process', 'tomography', 'qpt', 'finally', 'we', 'present', 'the', 'experimental', 'implementation', 'of', 'deutschjozsa', 'algorithm', 'using', 'the', 'cnot', 'gate']]
|
[-0.1876861622231081, 0.1773475089322892, 0.01656242536613718, -0.049899681415899975, 0.07967014332301915, -0.31197086249943823, 0.16675645741284825, 0.5031869223341345, -0.19004784790799023, -0.31376099584624173, 0.0282267756795045, -0.1817938528279774, -0.12014153521507978, 0.3224718289449811, -0.0595798542466946, 0.17338610275648533, 0.03753465142101049, -0.10165101086720824, -0.15789559941738843, -0.31977756972191856, 0.22451115558855236, -0.005641607110155746, 0.3134049100894481, -0.04783782541751862, 0.18599219216499477, -0.02167403253261, 0.08229095562361181, -0.10718485507299193, -0.06395308081991971, 0.028053363963845186, 0.2364263180224225, 0.08650666187517345, 0.1315743331820704, -0.4926828266796656, -0.09531265959143638, 0.030181100784102455, 0.08801791127771139, 0.19166302416822872, -0.06565778841497377, -0.36595991507172587, -0.04049283046275377, -0.1717814945243299, 0.001789427693001926, -0.13841567669995128, -0.005302143222652375, -0.06789252838585526, -0.24741021882742642, -0.0033572904113680123, 0.05096830573864281, 0.09085427226265892, 0.06174510220531374, 0.0036803053435869515, 0.014368928002659232, 0.0915949993301183, -0.17260877467953833, 0.06317980747902766, 0.23953899471089243, -0.011206970332204946, -0.2263614001031965, 0.2484441494382918, -0.007917053823475725, -0.1670318341642269, 0.03764839240116999, -0.09332176692565554, -0.015149457976222039, 0.06107451897114515, 0.08520014992682264, 0.08632140198722482, -0.1487008219771087, 0.09181185777764768, 0.06769718857249245, 0.2997311598714441, 0.07212372743524612, 0.04017926883592736, 0.1413145034998888, 0.1282286272291094, 0.09900959513150155, 0.26294476006180045, -0.13961671253899113, -0.09002185720019043, -0.35230335392057893, -0.16879721990786492, -0.24967542522586883, 0.068882026062347, -0.07647731230594218, -0.15344318806775845, 0.4779544614524275, 0.15918376563873607, 0.12584686750546098, -0.02636941119446419, 0.3913633296568878, 0.13282343626196963, 0.1200789552880451, 0.018682753094471993, 0.22065927101299165, 0.21169495966751128, -0.000868185164872557, -0.3302143905370031, 0.02979400913231075, 0.07532028234563767]
|
1,803.04106
|
Tolman temperature gradients in a gravitational field
|
Tolman's relation for the temperature gradient in an equilibrium
self-gravitating general relativistic fluid is broadly accepted within the
general relativity community. However, the concept of temperature gradients in
thermal equilibrium continues to cause confusion in other branches of physics,
since it contradicts naive versions of the laws of classical thermodynamics. In
this paper we discuss the crucial role of the universality of free fall, and
how thermodynamics emphasises the great distinction between gravity and other
forces. To do so we will present an argument given by Maxwell and apply it to
an electro-thermal system, concluding with an reductio ad absurdum. Among other
issues we shall show that Tolman temperature gradients could also (in
principle) have been derived circa 1905 - a decade before the development of
full general relativity.
|
gr-qc cond-mat.stat-mech
|
tolmans relation for the temperature gradient in an equilibrium selfgravitating general relativistic fluid is broadly accepted within the general relativity community however the concept of temperature gradients in thermal equilibrium continues to cause confusion in other branches of physics since it contradicts naive versions of the laws of classical thermodynamics in this paper we discuss the crucial role of the universality of free fall and how thermodynamics emphasises the great distinction between gravity and other forces to do so we will present an argument given by maxwell and apply it to an electrothermal system concluding with an reductio ad absurdum among other issues we shall show that tolman temperature gradients could also in principle have been derived circa 1905 a decade before the development of full general relativity
|
[['tolmans', 'relation', 'for', 'the', 'temperature', 'gradient', 'in', 'an', 'equilibrium', 'selfgravitating', 'general', 'relativistic', 'fluid', 'is', 'broadly', 'accepted', 'within', 'the', 'general', 'relativity', 'community', 'however', 'the', 'concept', 'of', 'temperature', 'gradients', 'in', 'thermal', 'equilibrium', 'continues', 'to', 'cause', 'confusion', 'in', 'other', 'branches', 'of', 'physics', 'since', 'it', 'contradicts', 'naive', 'versions', 'of', 'the', 'laws', 'of', 'classical', 'thermodynamics', 'in', 'this', 'paper', 'we', 'discuss', 'the', 'crucial', 'role', 'of', 'the', 'universality', 'of', 'free', 'fall', 'and', 'how', 'thermodynamics', 'emphasises', 'the', 'great', 'distinction', 'between', 'gravity', 'and', 'other', 'forces', 'to', 'do', 'so', 'we', 'will', 'present', 'an', 'argument', 'given', 'by', 'maxwell', 'and', 'apply', 'it', 'to', 'an', 'electrothermal', 'system', 'concluding', 'with', 'an', 'reductio', 'ad', 'absurdum', 'among', 'other', 'issues', 'we', 'shall', 'show', 'that', 'tolman', 'temperature', 'gradients', 'could', 'also', 'in', 'principle', 'have', 'been', 'derived', 'circa', '1905', 'a', 'decade', 'before', 'the', 'development', 'of', 'full', 'general', 'relativity']]
|
[-0.09177670255667181, 0.12031888593992335, -0.13987922799879016, 0.09771332510717912, -0.09095944090222474, -0.1254697426884377, 0.01338967848187167, 0.3158294326494797, -0.25657359122124035, -0.3082749319328286, 0.05648383836069115, -0.2419357387261698, -0.1363188503382844, 0.18042082395641046, -0.12684494394670764, 0.014319121701873883, -0.0023560832490829853, 0.01876870551313914, -0.06946950316887524, -0.22299097665745649, 0.32715289291809313, 0.12102239417436067, 0.2828126891181455, 0.09400042142806342, 0.05748346714517538, -0.02751027510566928, -0.02782156169632799, 0.06771823208327987, -0.15373937230680212, 0.051967258910735836, 0.24316469009863795, 0.1444398917901708, 0.30786151778738713, -0.4549286118563032, -0.24954617959156167, 0.08992202999070287, 0.12015514765289481, 0.15187737601445406, -0.05605615953572851, -0.21221854687246378, 0.0127206865035987, -0.195072617749247, -0.18442979848623509, -0.05008916600218072, 0.06942589255049825, -0.017216607605405443, -0.15358543639786149, 0.11010138697361072, 0.10552124402602203, 0.05729097675066441, -0.06762446461561922, -0.11098759687411075, 0.020335054643510375, 0.10669256261826376, 0.08550394692611007, 0.0037680197547160788, 0.13799293633564957, -0.10723140372829221, -0.10216110014516744, 0.41750745233730413, -0.05904707706031331, -0.15292997803771868, 0.20272935449247598, -0.14538320993233356, -0.17352606133681547, 0.04084944822534453, 0.10209352977835806, 0.0944170748389297, -0.19016931397709413, 0.07645383679346196, -0.006870002958748955, 0.13206331309083907, 0.047932338255122886, -0.02105049546162263, 0.2769497195549775, 0.11305590367555851, 0.02707744971576176, 0.08930955993628231, -0.026511988076890702, -0.1658782267550123, -0.3266925267816987, -0.17924067181047576, -0.12253117101499811, 0.05719184500776464, -0.05637383752002734, -0.15341207073652185, 0.29941170643451187, 0.21698490995322572, 0.079041528293601, 0.03988213657976303, 0.2520590088679455, 0.10259700268215965, 0.04952725706243655, 0.09192247364626382, 0.35661886925663566, 0.15657456978624396, 0.18219279129516508, -0.1993850489552642, 0.039877995593997184, 0.06406082046123629]
|
1,803.04107
|
Uniqueness and stability of coexistence states in two species models
with/without chemotaxis on bounded heterogeneous environments
|
The current paper is concerned with the asymptotic dynamics of two species
competition systems with/without chemotaxis in heterogeneous media. In the
previous work \cite{ITBWS17a}, we find conditions on the parameters in such
systems for the persistence of the two species and the existence of positive
coexistence states. In this paper, we find conditions on the parameters for the
uniqueness and stability of positive coexistence states of such systems. The
established results are new even for the two species competition systems
without chemotaxis but with space dependent coefficients.
|
math.DS
|
the current paper is concerned with the asymptotic dynamics of two species competition systems withwithout chemotaxis in heterogeneous media in the previous work citeitbws17a we find conditions on the parameters in such systems for the persistence of the two species and the existence of positive coexistence states in this paper we find conditions on the parameters for the uniqueness and stability of positive coexistence states of such systems the established results are new even for the two species competition systems without chemotaxis but with space dependent coefficients
|
[['the', 'current', 'paper', 'is', 'concerned', 'with', 'the', 'asymptotic', 'dynamics', 'of', 'two', 'species', 'competition', 'systems', 'withwithout', 'chemotaxis', 'in', 'heterogeneous', 'media', 'in', 'the', 'previous', 'work', 'citeitbws17a', 'we', 'find', 'conditions', 'on', 'the', 'parameters', 'in', 'such', 'systems', 'for', 'the', 'persistence', 'of', 'the', 'two', 'species', 'and', 'the', 'existence', 'of', 'positive', 'coexistence', 'states', 'in', 'this', 'paper', 'we', 'find', 'conditions', 'on', 'the', 'parameters', 'for', 'the', 'uniqueness', 'and', 'stability', 'of', 'positive', 'coexistence', 'states', 'of', 'such', 'systems', 'the', 'established', 'results', 'are', 'new', 'even', 'for', 'the', 'two', 'species', 'competition', 'systems', 'without', 'chemotaxis', 'but', 'with', 'space', 'dependent', 'coefficients']]
|
[-0.1959857726550856, 0.13744545855754337, -0.008413717302298823, 0.038258075465036685, 0.02661548527282511, -0.11466299200993638, 0.032383206511609426, 0.30482516327309744, -0.2494977890827888, -0.2560248005117268, 0.11451173660367034, -0.28386636984772806, -0.16540533901993618, 0.15850923632726419, -0.006369612093061902, 0.034075322138622056, 0.06053110221292564, 0.005496390900293062, -0.011239364014960132, -0.23388527710867915, 0.41737911809062544, -0.040889021539844056, 0.2828746621691903, 0.07864868244546097, 0.09825649351791241, -0.018810490958479253, 0.009241497539373677, 0.027472473177070685, -0.17784375771013802, 0.09715946986161303, 0.21959441259156826, 0.08374052010693175, 0.23987814524146014, -0.4317621658231283, -0.2654912730159108, 0.12634286392740038, 0.13777344993878762, 0.13517954783124286, -0.06778374679527398, -0.2622509635551724, 0.0404248833981191, -0.13650140948160444, -0.1468998024586675, -0.04395764980595126, 0.023451995212844638, 0.09261589458342208, -0.29519454257692707, 0.11297990995199354, 0.07956195369276196, 0.10246476394579161, -0.17474864694279033, -0.13289684555385, -0.023174553968792044, 0.16474477416594774, 0.061510427993029186, -0.0984161110556966, 0.04571956739392738, -0.17121569518552182, -0.12208177141715275, 0.35221007073211463, -0.0846957360329323, -0.24485458957767764, 0.3120967342063438, -0.13771881064573346, -0.1703814547346515, 0.06621987605467439, 0.1762578550098074, 0.12551155330634914, -0.1435561588597159, 0.05372085135164779, -0.030580343992644272, 0.14423632465281286, 0.027794416522780478, 0.04951536165940207, 0.16141480715609655, 0.17522290447553576, 0.12088123705714594, 0.1139167984108289, -0.009517452955722462, -0.14814228411807223, -0.24892723132574626, -0.16623566623203195, -0.12016368644355341, -0.0051956137988802996, -0.06900297740418843, -0.1471746795550855, 0.414298735845964, 0.1452574778942467, 0.20199511798510197, 0.056570808175777976, 0.23702319808910752, 0.08556145855203964, -0.031244140952219102, 0.01842401818328992, 0.25269705971139805, 0.08525017330552949, 0.1415270731221278, -0.2650497828902633, 0.12855350718357014, 0.028446184563298903]
|
1,803.04108
|
Style Aggregated Network for Facial Landmark Detection
|
Recent advances in facial landmark detection achieve success by learning
discriminative features from rich deformation of face shapes and poses. Besides
the variance of faces themselves, the intrinsic variance of image styles, e.g.,
grayscale vs. color images, light vs. dark, intense vs. dull, and so on, has
constantly been overlooked. This issue becomes inevitable as increasing web
images are collected from various sources for training neural networks. In this
work, we propose a style-aggregated approach to deal with the large intrinsic
variance of image styles for facial landmark detection. Our method transforms
original face images to style-aggregated images by a generative adversarial
module. The proposed scheme uses the style-aggregated image to maintain face
images that are more robust to environmental changes. Then the original face
images accompanying with style-aggregated ones play a duet to train a landmark
detector which is complementary to each other. In this way, for each face, our
method takes two images as input, i.e., one in its original style and the other
in the aggregated style. In experiments, we observe that the large variance of
image styles would degenerate the performance of facial landmark detectors.
Moreover, we show the robustness of our method to the large variance of image
styles by comparing to a variant of our approach, in which the generative
adversarial module is removed, and no style-aggregated images are used. Our
approach is demonstrated to perform well when compared with state-of-the-art
algorithms on benchmark datasets AFLW and 300-W. Code is publicly available on
GitHub: https://github.com/D-X-Y/SAN
|
cs.CV
|
recent advances in facial landmark detection achieve success by learning discriminative features from rich deformation of face shapes and poses besides the variance of faces themselves the intrinsic variance of image styles eg grayscale vs color images light vs dark intense vs dull and so on has constantly been overlooked this issue becomes inevitable as increasing web images are collected from various sources for training neural networks in this work we propose a styleaggregated approach to deal with the large intrinsic variance of image styles for facial landmark detection our method transforms original face images to styleaggregated images by a generative adversarial module the proposed scheme uses the styleaggregated image to maintain face images that are more robust to environmental changes then the original face images accompanying with styleaggregated ones play a duet to train a landmark detector which is complementary to each other in this way for each face our method takes two images as input ie one in its original style and the other in the aggregated style in experiments we observe that the large variance of image styles would degenerate the performance of facial landmark detectors moreover we show the robustness of our method to the large variance of image styles by comparing to a variant of our approach in which the generative adversarial module is removed and no styleaggregated images are used our approach is demonstrated to perform well when compared with stateoftheart algorithms on benchmark datasets aflw and 300w code is publicly available on github httpsgithubcomdxysan
|
[['recent', 'advances', 'in', 'facial', 'landmark', 'detection', 'achieve', 'success', 'by', 'learning', 'discriminative', 'features', 'from', 'rich', 'deformation', 'of', 'face', 'shapes', 'and', 'poses', 'besides', 'the', 'variance', 'of', 'faces', 'themselves', 'the', 'intrinsic', 'variance', 'of', 'image', 'styles', 'eg', 'grayscale', 'vs', 'color', 'images', 'light', 'vs', 'dark', 'intense', 'vs', 'dull', 'and', 'so', 'on', 'has', 'constantly', 'been', 'overlooked', 'this', 'issue', 'becomes', 'inevitable', 'as', 'increasing', 'web', 'images', 'are', 'collected', 'from', 'various', 'sources', 'for', 'training', 'neural', 'networks', 'in', 'this', 'work', 'we', 'propose', 'a', 'styleaggregated', 'approach', 'to', 'deal', 'with', 'the', 'large', 'intrinsic', 'variance', 'of', 'image', 'styles', 'for', 'facial', 'landmark', 'detection', 'our', 'method', 'transforms', 'original', 'face', 'images', 'to', 'styleaggregated', 'images', 'by', 'a', 'generative', 'adversarial', 'module', 'the', 'proposed', 'scheme', 'uses', 'the', 'styleaggregated', 'image', 'to', 'maintain', 'face', 'images', 'that', 'are', 'more', 'robust', 'to', 'environmental', 'changes', 'then', 'the', 'original', 'face', 'images', 'accompanying', 'with', 'styleaggregated', 'ones', 'play', 'a', 'duet', 'to', 'train', 'a', 'landmark', 'detector', 'which', 'is', 'complementary', 'to', 'each', 'other', 'in', 'this', 'way', 'for', 'each', 'face', 'our', 'method', 'takes', 'two', 'images', 'as', 'input', 'ie', 'one', 'in', 'its', 'original', 'style', 'and', 'the', 'other', 'in', 'the', 'aggregated', 'style', 'in', 'experiments', 'we', 'observe', 'that', 'the', 'large', 'variance', 'of', 'image', 'styles', 'would', 'degenerate', 'the', 'performance', 'of', 'facial', 'landmark', 'detectors', 'moreover', 'we', 'show', 'the', 'robustness', 'of', 'our', 'method', 'to', 'the', 'large', 'variance', 'of', 'image', 'styles', 'by', 'comparing', 'to', 'a', 'variant', 'of', 'our', 'approach', 'in', 'which', 'the', 'generative', 'adversarial', 'module', 'is', 'removed', 'and', 'no', 'styleaggregated', 'images', 'are', 'used', 'our', 'approach', 'is', 'demonstrated', 'to', 'perform', 'well', 'when', 'compared', 'with', 'stateoftheart', 'algorithms', 'on', 'benchmark', 'datasets', 'aflw', 'and', '300w', 'code', 'is', 'publicly', 'available', 'on', 'github', 'httpsgithubcomdxysan']]
|
[-0.006165108629036695, -0.02898091996088624, -0.08317018193658442, 0.07238236274616792, -0.07735038851108401, -0.17474966115504503, -0.02989457784919068, 0.47582886870205404, -0.23895241991616786, -0.35196033983677627, 0.07571896641375497, -0.3226814525835216, -0.17657676406484096, 0.19555736492108552, -0.21124892684584484, 0.07672490828647278, 0.12777250483771785, 0.02818853700812906, -0.028937725283787585, -0.30362110754102467, 0.2925332412859425, 0.031629018510691824, 0.3536698780776933, -0.001048245120793581, 0.14454122818569887, -0.03895526919653639, -0.06312145452015101, -0.0025841340124607088, -0.016707422727078664, 0.17468330588776734, 0.3082525177914649, 0.2081946620233357, 0.272723862930201, -0.4061377708213404, -0.1842809401442064, 0.07231742697022855, 0.11230940354632912, 0.13791103393171217, -0.08043659959064098, -0.36802088072896005, 0.09472462980262936, -0.12577404297888278, 0.024361640458926557, -0.10961404228769243, 0.004042777203023434, -0.0288638525120914, -0.26434115614881737, 0.040760524011217054, 0.06924668922880664, 0.08479118313454091, -0.03278148292237893, -0.13010699956677854, -0.009886260711122304, 0.17658862774411682, 0.06284911859733984, 0.07343696819990873, 0.15130978462472558, -0.22220806309441105, -0.11002342136204243, 0.3734617653787136, -0.05556608815584332, -0.19807200441905298, 0.19287620391417296, -0.054776173152960836, -0.1177122616712004, 0.13194034419767559, 0.2103429435524158, 0.1239179040165618, -0.1347443748184596, -0.0022726779414806515, -0.04901467264443636, 0.1814534234907478, 0.06014477621484548, 0.0036366487671621144, 0.18503507811296732, 0.2036853022624273, 0.018071168690919875, 0.18002446357905866, -0.19425387477781625, -0.01530670814961195, -0.18863491915166378, -0.09295489108748733, -0.20668275902513414, -0.04355456624820363, -0.09638851715502096, -0.15209907097026007, 0.42856978180589794, 0.24922313830442727, 0.23869188258610666, 0.07891949097020552, 0.38783773108944297, -0.005087984656449407, 0.1439480905944947, 0.029474487057421356, 0.17687438413128256, -0.014596115454565734, 0.10621540926583112, -0.15880885812267662, 0.08686342650232837, 0.05710769730899483]
|
1,803.04109
|
What is parameterized $Om(z)$ diagnostics telling us in light of recent
observations?
|
In this paper, we propose a new parametrization of $Om(z)$ diagnostics and
show how the most recent and significantly improved observations concerning the
$H(z)$ and SN Ia measurements can be used to probe the consistency or tension
between $\Lambda$CDM model and observations. Our results demonstrates that
$H_0$ plays a very important role in the consistency test of $\Lambda$CDM with
the $H(z)$ data. Adopting the Hubble constant priors from \textit{Planck} 2013
and Riess (2016), one finds a considerable tension between the current $H(z)$
data and $\Lambda$CDM model and confirms the conclusions obtained previously by
the others. However, with the Hubble constant prior taken from WMAP9, the
discrepancy between $H(z)$ data and $\Lambda$CDM disappears, i.e., the current
$H(z)$ observations still support the cosmological constant scenario. This
conclusion is also supported by the results derived from the JLA SNe Ia sample.
The best-fit Hubble constant from the combination of $H(z)$+JLA
($H_0=68.81^{+1.50}_{-1.49}$ km/s/Mpc) is well consistent with the results
derived both by Planck 2013 and WMAP9, which is significantly different from
the recent local measurement by Riess (2016).
|
astro-ph.CO gr-qc
|
in this paper we propose a new parametrization of omz diagnostics and show how the most recent and significantly improved observations concerning the hz and sn ia measurements can be used to probe the consistency or tension between lambdacdm model and observations our results demonstrates that h_0 plays a very important role in the consistency test of lambdacdm with the hz data adopting the hubble constant priors from textitplanck 2013 and riess 2016 one finds a considerable tension between the current hz data and lambdacdm model and confirms the conclusions obtained previously by the others however with the hubble constant prior taken from wmap9 the discrepancy between hz data and lambdacdm disappears ie the current hz observations still support the cosmological constant scenario this conclusion is also supported by the results derived from the jla sne ia sample the bestfit hubble constant from the combination of hzjla h_06881150_149 kmsmpc is well consistent with the results derived both by planck 2013 and wmap9 which is significantly different from the recent local measurement by riess 2016
|
[['in', 'this', 'paper', 'we', 'propose', 'a', 'new', 'parametrization', 'of', 'omz', 'diagnostics', 'and', 'show', 'how', 'the', 'most', 'recent', 'and', 'significantly', 'improved', 'observations', 'concerning', 'the', 'hz', 'and', 'sn', 'ia', 'measurements', 'can', 'be', 'used', 'to', 'probe', 'the', 'consistency', 'or', 'tension', 'between', 'lambdacdm', 'model', 'and', 'observations', 'our', 'results', 'demonstrates', 'that', 'h_0', 'plays', 'a', 'very', 'important', 'role', 'in', 'the', 'consistency', 'test', 'of', 'lambdacdm', 'with', 'the', 'hz', 'data', 'adopting', 'the', 'hubble', 'constant', 'priors', 'from', 'textitplanck', '2013', 'and', 'riess', '2016', 'one', 'finds', 'a', 'considerable', 'tension', 'between', 'the', 'current', 'hz', 'data', 'and', 'lambdacdm', 'model', 'and', 'confirms', 'the', 'conclusions', 'obtained', 'previously', 'by', 'the', 'others', 'however', 'with', 'the', 'hubble', 'constant', 'prior', 'taken', 'from', 'wmap9', 'the', 'discrepancy', 'between', 'hz', 'data', 'and', 'lambdacdm', 'disappears', 'ie', 'the', 'current', 'hz', 'observations', 'still', 'support', 'the', 'cosmological', 'constant', 'scenario', 'this', 'conclusion', 'is', 'also', 'supported', 'by', 'the', 'results', 'derived', 'from', 'the', 'jla', 'sne', 'ia', 'sample', 'the', 'bestfit', 'hubble', 'constant', 'from', 'the', 'combination', 'of', 'hzjla', 'h_06881150_149', 'kmsmpc', 'is', 'well', 'consistent', 'with', 'the', 'results', 'derived', 'both', 'by', 'planck', '2013', 'and', 'wmap9', 'which', 'is', 'significantly', 'different', 'from', 'the', 'recent', 'local', 'measurement', 'by', 'riess', '2016']]
|
[-0.03651987622508259, 0.06707490741296909, -0.07130352957011742, 0.040000459477765656, -0.133078305581368, -0.12296312799011248, 0.08529368518150499, 0.32687052789815635, -0.20489440749867732, -0.3685898152234163, 0.08525086752799621, -0.2943627966004749, -0.055545755863720334, 0.25583277718126124, -0.03387725169074635, 0.013472792381816001, 0.13138198907497925, -0.06921309585748024, -0.05339728024663663, -0.2983190187274717, 0.3020356522499432, 0.15988310606511266, 0.3025075526485696, -0.044055153829652034, 0.06305890357213874, -0.09029988353790412, -0.13578661011943463, 0.015488911041080258, -0.2519900821960957, 0.07311342970561507, 0.19810534378535352, 0.1869318395254722, 0.19130911582777665, -0.3520083332629817, -0.25636120912683913, 0.0941526310607726, 0.10658748624954632, 0.11734908358478204, -0.026166057440203203, -0.33539917111006934, 0.0021731692507083334, -0.15399781032465398, -0.06998736299790961, 0.009955259226804037, -0.024740063628658306, -0.03997374341963942, -0.2876666826304308, 0.2405963062001108, -0.0167085918642548, 0.006739947515767241, -0.1277453535639811, -0.13331964673937385, -0.022279494666754333, 0.041712815210705106, 0.097458996996825, 0.11768116789523425, 0.06489252680262854, -0.10497652976990265, -0.06933596158443495, 0.3879540873539829, -0.13524735659404202, -0.04787852481646507, 0.1701248077632383, -0.17057654479800097, -0.12471616214823497, 0.0012189926861157251, 0.07499310424616344, -0.009875274915789623, -0.14308335481558082, 0.12129869565691224, 0.016331422840499557, 0.2041905785797077, 0.059517809284612706, -0.05310400362873753, 0.23429803178797282, 0.12134163921460682, 0.01142020276097884, 0.018293160396265298, -0.16198999422797283, 0.006775207221941199, -0.31684555130371783, -0.048671007159079405, -0.18256384988456184, 0.05158014866241882, -0.2035405822036494, -0.06345866871239661, 0.33677143444778224, 0.1788305500684696, 0.2772776893161367, 0.08409860339130784, 0.3175241351560798, 0.02773940065594087, 0.05842938375805483, 0.07402138720363985, 0.3759738133332237, 0.11434358791827202, 0.10933534750988338, -0.20343217320150025, 0.06650608488450606, -0.044759934215784766]
|
1,803.0411
|
Simultaneous Observation of Topological Edge State and Exceptional Point
in an Open and Non-Hermitian System
|
This paper reports on the experimental observation of topologically protected
edge state and exceptional point in an open and Non-Hermitian system. While the
theoretical underpinning is generic to wave physics, the simulations and
experiments are performed for an acoustic system whose structure has
non-trivial topological properties that can be characterized by the Chern
number provided that a synthetic dimension is introduced. Unidirectional
reectionless propagation, a hallmark of exceptional point, is unambiguously
observed in both simulations and experiments.
|
cond-mat.mes-hall
|
this paper reports on the experimental observation of topologically protected edge state and exceptional point in an open and nonhermitian system while the theoretical underpinning is generic to wave physics the simulations and experiments are performed for an acoustic system whose structure has nontrivial topological properties that can be characterized by the chern number provided that a synthetic dimension is introduced unidirectional reectionless propagation a hallmark of exceptional point is unambiguously observed in both simulations and experiments
|
[['this', 'paper', 'reports', 'on', 'the', 'experimental', 'observation', 'of', 'topologically', 'protected', 'edge', 'state', 'and', 'exceptional', 'point', 'in', 'an', 'open', 'and', 'nonhermitian', 'system', 'while', 'the', 'theoretical', 'underpinning', 'is', 'generic', 'to', 'wave', 'physics', 'the', 'simulations', 'and', 'experiments', 'are', 'performed', 'for', 'an', 'acoustic', 'system', 'whose', 'structure', 'has', 'nontrivial', 'topological', 'properties', 'that', 'can', 'be', 'characterized', 'by', 'the', 'chern', 'number', 'provided', 'that', 'a', 'synthetic', 'dimension', 'is', 'introduced', 'unidirectional', 'reectionless', 'propagation', 'a', 'hallmark', 'of', 'exceptional', 'point', 'is', 'unambiguously', 'observed', 'in', 'both', 'simulations', 'and', 'experiments']]
|
[-0.20892768026648187, 0.16549367627081474, -0.07531037611739808, -0.01012880847433974, -0.07338472430618774, -0.14103793182508334, 0.03682601043194728, 0.3573363477388691, -0.24537192128206553, -0.2776454817013521, 0.10904466870890342, -0.30243342654093314, -0.23525814071150594, 0.2205174774372656, 0.01608482776148441, 0.10644150356222924, 0.06446172569045111, 0.0077159340174770665, -0.03069334418978542, -0.1916785877363413, 0.31973542538502153, 0.05491119189383952, 0.31619082646150337, 0.07601342367400464, 0.07586454378906637, -0.05186100128891045, 0.021259534947794714, 0.05029360129724649, -0.10424307450184163, 0.06669347567826901, 0.2551241463393365, 0.061467260338280254, 0.1782221668430506, -0.43652385946265176, -0.2422280083165357, 0.0582713492177917, 0.14014983349357193, 0.101808203699827, -0.09927050994194456, -0.3491781693638155, 0.12331278570682595, -0.10906658993151627, -0.1673825943879293, -0.1119555302368673, 0.018174700824984985, -0.05654500182304458, -0.21772233189748427, 0.023051353453315403, 0.05113579242453469, 0.10189627803322908, -0.0508548215444343, -0.04215836827336859, -0.07785484605272741, 0.10243885004188326, 0.008542798058203372, 0.012145581937051918, 0.05873171557476254, -0.13239860503726, -0.20090644461053767, 0.3859377542424849, -0.019452638856723513, -0.17614382078969165, 0.2393787655685293, -0.11780592497234466, -0.0890779911454669, 0.13792248057373063, 0.13199647565029168, 0.06752848109279416, -0.09638492565825704, 0.09211581818894238, -0.0911132417078127, 0.15789930851698095, -0.018963443127607827, 0.04154129621670827, 0.24193774849960678, 0.18519292192190492, 0.02443455913912897, 0.12007028291976128, -0.07805723199424774, -0.09171003040146868, -0.3089718307540017, -0.14731779615287546, -0.27478855372847694, 0.054468331074818514, -0.013395571449348753, -0.16753748771244367, 0.47269213905459956, 0.15199142914436953, 0.20605078459055604, -0.03873889872767521, 0.25418429573274853, 0.1233293729049987, 0.01298933121142909, 0.04726824139269363, 0.2473415032237474, 0.10282047803967113, 0.02932478405751968, -0.22749426667455977, 0.043590966091295216, 0.03372347508066971]
|
1,803.04111
|
Commuting probabilities of $n$-centralizer finite rings
|
Let $R$ be a finite ring. The commuting probability of $R$, denoted by
$\Pr(R)$, is the probability that any two randomly chosen elements of $R$
commute. $R$ is called an $n$-centralizer ring if it has $n$ distinct
centralizers. In this paper, we compute $\Pr(R)$ for some $n$-centralizer
finite rings.
|
math.RA
|
let r be a finite ring the commuting probability of r denoted by prr is the probability that any two randomly chosen elements of r commute r is called an ncentralizer ring if it has n distinct centralizers in this paper we compute prr for some ncentralizer finite rings
|
[['let', 'r', 'be', 'a', 'finite', 'ring', 'the', 'commuting', 'probability', 'of', 'r', 'denoted', 'by', 'prr', 'is', 'the', 'probability', 'that', 'any', 'two', 'randomly', 'chosen', 'elements', 'of', 'r', 'commute', 'r', 'is', 'called', 'an', 'ncentralizer', 'ring', 'if', 'it', 'has', 'n', 'distinct', 'centralizers', 'in', 'this', 'paper', 'we', 'compute', 'prr', 'for', 'some', 'ncentralizer', 'finite', 'rings']]
|
[-0.2705712543078223, 0.16230087430122528, -0.07402832125674705, -0.04338985900822267, -0.005861284173264795, -0.21223647119857522, -0.06639710239524364, 0.35765923194739285, -0.3165071843458073, -0.10963108707979626, 0.04545156798106903, -0.30389218290849607, -0.07041303563045756, 0.09929358848959816, -0.13587631655818955, -0.09403333140118998, 0.010554343509506814, 0.1473378594584611, -0.049688339722817956, -0.30459999452744213, 0.29865579170231915, 0.008261202929579482, 0.14599427941958515, 0.01023980818346751, 0.08682952895380404, 0.02760803782172045, -0.03455738413233158, 0.06925562365759848, -0.18129729147485518, 0.05867181501674409, 0.2831132075920397, 0.15835213079592403, 0.2763209914674564, -0.35107287620099226, -0.09939701256475278, 0.2647857989697736, 0.17789300237497202, -0.02973179963930529, 0.0018728080452704917, -0.19714154154822536, 0.22953441098560484, -0.3010632730640319, -0.12699003991841964, 0.017289099758680985, 0.20886438237313104, 0.0643129712921016, -0.33986823950723116, -0.06909954070816843, 0.0819089412689209, 0.11750647849498355, 0.07056637162494721, -0.11187927962793988, -0.037083856647416036, 0.07837624519075058, -0.06437395829517319, 0.029819213747217948, 0.08143977063460922, 0.055346078339165876, -0.06740867736160147, 0.36565757010664257, -0.09520679436700076, -0.20729717078181553, 0.07523297393048296, -0.19891411224760266, -0.09413241003925095, 0.11162441954662909, 0.052240380808254896, 0.177577103545167, -0.07512747625611266, 0.2527277040656428, -0.17482962461226448, 0.10497602483979901, 0.09061216743548914, 0.022039411446953913, 0.16015925847602133, 0.00671486389272067, 0.10029501893809445, 0.09960895099876714, -0.02174187075270682, 0.06187194365323806, -0.34798870881905364, -0.16762809903950107, -0.27088752770036156, 0.12709911696954954, -0.13470614328030117, -0.14682280384384247, 0.39986460671132923, 0.10440142283558237, 0.20734641185904645, 0.0730630768348976, 0.21612971352071178, 0.09044121220536834, 0.038490613428305606, 0.13622213512354966, 0.02449681928526249, 0.1678169391412592, -0.10361164648618017, -0.18610756040303683, 0.03923395086003809, 0.1654569473763814]
|
1,803.04112
|
Hadronic origin of prompt high-energy emission of gamma-ray bursts
revisited: in the case of a limited maximum proton energy
|
The high-energy (> 100MeV) emission observed by Fermi-LAT during the prompt
phase of some luminous gamma-ray bursts (GRBs) could arise from the cascade
induced by interactions between accelerated protons and the radiation field of
GRBs. The photomeson process, which is usually suggested to operate in such a
hadronic explanation, requires a rather high proton energy (> 10^17eV) for an
efficient interaction. However, whether GRBs can accelerate protons to such a
high energy is far from guaranteed, although they have been suggested as the
candidate source for ultrahigh-energy cosmic rays. In this work, we revisit the
hadronic model for the prompt high-energy emission of GRBs with a smaller
maximum proton energy than the usually adopted value estimated from the Bohm
condition. In this case, the Bethe-Heitler pair production process becomes
comparably important or even dominates over the photomeson process. We show
that with a relatively low maximum proton energy with a Lorentz factor of 10^5
in the comoving frame, the cascade emission can still reproduce various types
of high-energy spectrum of GRBs. For most GRBs without high-energy emission
detected, the maximum proton energy could be even lower and relax the
constraints on the parameters of GRB jet resulting from the fact of
non-detection of GRB neutrinos by IceCube.
|
astro-ph.HE
|
the highenergy 100mev emission observed by fermilat during the prompt phase of some luminous gammaray bursts grbs could arise from the cascade induced by interactions between accelerated protons and the radiation field of grbs the photomeson process which is usually suggested to operate in such a hadronic explanation requires a rather high proton energy 1017ev for an efficient interaction however whether grbs can accelerate protons to such a high energy is far from guaranteed although they have been suggested as the candidate source for ultrahighenergy cosmic rays in this work we revisit the hadronic model for the prompt highenergy emission of grbs with a smaller maximum proton energy than the usually adopted value estimated from the bohm condition in this case the betheheitler pair production process becomes comparably important or even dominates over the photomeson process we show that with a relatively low maximum proton energy with a lorentz factor of 105 in the comoving frame the cascade emission can still reproduce various types of highenergy spectrum of grbs for most grbs without highenergy emission detected the maximum proton energy could be even lower and relax the constraints on the parameters of grb jet resulting from the fact of nondetection of grb neutrinos by icecube
|
[['the', 'highenergy', '100mev', 'emission', 'observed', 'by', 'fermilat', 'during', 'the', 'prompt', 'phase', 'of', 'some', 'luminous', 'gammaray', 'bursts', 'grbs', 'could', 'arise', 'from', 'the', 'cascade', 'induced', 'by', 'interactions', 'between', 'accelerated', 'protons', 'and', 'the', 'radiation', 'field', 'of', 'grbs', 'the', 'photomeson', 'process', 'which', 'is', 'usually', 'suggested', 'to', 'operate', 'in', 'such', 'a', 'hadronic', 'explanation', 'requires', 'a', 'rather', 'high', 'proton', 'energy', '1017ev', 'for', 'an', 'efficient', 'interaction', 'however', 'whether', 'grbs', 'can', 'accelerate', 'protons', 'to', 'such', 'a', 'high', 'energy', 'is', 'far', 'from', 'guaranteed', 'although', 'they', 'have', 'been', 'suggested', 'as', 'the', 'candidate', 'source', 'for', 'ultrahighenergy', 'cosmic', 'rays', 'in', 'this', 'work', 'we', 'revisit', 'the', 'hadronic', 'model', 'for', 'the', 'prompt', 'highenergy', 'emission', 'of', 'grbs', 'with', 'a', 'smaller', 'maximum', 'proton', 'energy', 'than', 'the', 'usually', 'adopted', 'value', 'estimated', 'from', 'the', 'bohm', 'condition', 'in', 'this', 'case', 'the', 'betheheitler', 'pair', 'production', 'process', 'becomes', 'comparably', 'important', 'or', 'even', 'dominates', 'over', 'the', 'photomeson', 'process', 'we', 'show', 'that', 'with', 'a', 'relatively', 'low', 'maximum', 'proton', 'energy', 'with', 'a', 'lorentz', 'factor', 'of', '105', 'in', 'the', 'comoving', 'frame', 'the', 'cascade', 'emission', 'can', 'still', 'reproduce', 'various', 'types', 'of', 'highenergy', 'spectrum', 'of', 'grbs', 'for', 'most', 'grbs', 'without', 'highenergy', 'emission', 'detected', 'the', 'maximum', 'proton', 'energy', 'could', 'be', 'even', 'lower', 'and', 'relax', 'the', 'constraints', 'on', 'the', 'parameters', 'of', 'grb', 'jet', 'resulting', 'from', 'the', 'fact', 'of', 'nondetection', 'of', 'grb', 'neutrinos', 'by', 'icecube']]
|
[-0.039790717171641385, 0.2505935073529921, -0.044025942573619144, 0.22120685476749224, -0.09716691194647332, -0.07305567989966309, 0.028022667520293375, 0.4130865063427425, -0.21192225535207132, -0.3407249076337349, -0.022519918374444652, -0.3082255162707553, 0.05174473910830296, 0.2251403131991981, 0.04697358013562313, -0.005591846204635392, 0.09459944554354723, -0.02681494038324894, -0.028211133912909865, -0.16104042088590198, 0.2693209862870323, 0.20639990741705022, 0.23381100842905253, 0.07835239769845474, 0.09951767648184082, -0.034218331066346384, -0.027121754173223475, -0.049553240388745395, -0.05783009280400243, 0.04243976524718696, 0.23667810883560422, 0.12446513575638031, 0.17562162171390544, -0.4230136264569876, -0.2863694755809109, 0.18766183765128072, 0.16140864843945588, 0.028323245994042515, -0.05256405675431668, -0.25672812011978796, 0.05455358343244326, -0.22266484082267596, -0.1265569070603971, 0.056003208441387224, -0.014228858355228313, 0.04434999818516123, -0.22899669688649293, 0.10370628858757455, 0.026899248332057785, -0.01676930389537408, -0.06249275314735203, -0.05759832880618732, 0.0029601184509285704, 0.006422282899616332, 0.14671476995018765, 0.06843131419907256, 0.1530258927698724, -0.1721556220652263, -0.10435641043842202, 0.43899580690237444, -0.038088422999277186, -0.02599908591861405, 0.1822194323625143, -0.18421763645757624, -0.16940048281557676, 0.2421497316213279, 0.14074109734558476, 0.09202772153246148, -0.18223113088028098, 0.028718611755459457, 0.029443580707217136, 0.15798084280317332, 0.06546767348105588, 0.06269343744100231, 0.2507541322490064, 0.15759280363052355, 0.023164170034933925, 0.08051695688230144, -0.17895394453165553, 0.016402024505432787, -0.3297811164543396, -0.0965461833220793, -0.1820054173009561, 0.1532840720710072, -0.08106788924722023, -0.09952910138612113, 0.3892872951197915, 0.09223612532950938, 0.21304499952622302, 0.000960646178459794, 0.3074660403971992, 0.11715894979935866, 0.05757920934773254, 0.1306157325916901, 0.3790397993886628, 0.07747883411896665, 0.10553056279185978, -0.18772605678475485, 0.11942200373188115, 0.018806634152807842]
|
1,803.04113
|
Circuit QED-based measurement of vortex lattice order in a Josephson
junction array
|
Superconductivity provides a canonical example of a quantum phase of matter.
When superconducting islands are connected by Josephson junctions in a lattice,
the low temperature state of the system can map to the celebrated XY model and
its associated universality classes. This has been used to experimentally
implement realizations of Mott insulator and Berezinskii--Kosterlitz--Thouless
(BKT) transitions to vortex dynamics analogous to those in type-II
superconductors. When an external magnetic field is added, the effective spins
of the XY model become frustrated, leading to the formation of topological
defects (vortices). Here we observe the many-body dynamics of such an array,
including frustration, via its coupling to a superconducting microwave cavity.
We take the design of the transmon qubit, but replace the single junction
between two antenna pads with the complete array. This allows us to probe the
system at 10 mK with minimal self-heating by using weak coherent states at the
single (microwave) photon level to probe the resonance frequency of the cavity.
We observe signatures of ordered vortex lattice at rational flux fillings of
the array.
|
quant-ph cond-mat.mes-hall
|
superconductivity provides a canonical example of a quantum phase of matter when superconducting islands are connected by josephson junctions in a lattice the low temperature state of the system can map to the celebrated xy model and its associated universality classes this has been used to experimentally implement realizations of mott insulator and berezinskiikosterlitzthouless bkt transitions to vortex dynamics analogous to those in typeii superconductors when an external magnetic field is added the effective spins of the xy model become frustrated leading to the formation of topological defects vortices here we observe the manybody dynamics of such an array including frustration via its coupling to a superconducting microwave cavity we take the design of the transmon qubit but replace the single junction between two antenna pads with the complete array this allows us to probe the system at 10 mk with minimal selfheating by using weak coherent states at the single microwave photon level to probe the resonance frequency of the cavity we observe signatures of ordered vortex lattice at rational flux fillings of the array
|
[['superconductivity', 'provides', 'a', 'canonical', 'example', 'of', 'a', 'quantum', 'phase', 'of', 'matter', 'when', 'superconducting', 'islands', 'are', 'connected', 'by', 'josephson', 'junctions', 'in', 'a', 'lattice', 'the', 'low', 'temperature', 'state', 'of', 'the', 'system', 'can', 'map', 'to', 'the', 'celebrated', 'xy', 'model', 'and', 'its', 'associated', 'universality', 'classes', 'this', 'has', 'been', 'used', 'to', 'experimentally', 'implement', 'realizations', 'of', 'mott', 'insulator', 'and', 'berezinskiikosterlitzthouless', 'bkt', 'transitions', 'to', 'vortex', 'dynamics', 'analogous', 'to', 'those', 'in', 'typeii', 'superconductors', 'when', 'an', 'external', 'magnetic', 'field', 'is', 'added', 'the', 'effective', 'spins', 'of', 'the', 'xy', 'model', 'become', 'frustrated', 'leading', 'to', 'the', 'formation', 'of', 'topological', 'defects', 'vortices', 'here', 'we', 'observe', 'the', 'manybody', 'dynamics', 'of', 'such', 'an', 'array', 'including', 'frustration', 'via', 'its', 'coupling', 'to', 'a', 'superconducting', 'microwave', 'cavity', 'we', 'take', 'the', 'design', 'of', 'the', 'transmon', 'qubit', 'but', 'replace', 'the', 'single', 'junction', 'between', 'two', 'antenna', 'pads', 'with', 'the', 'complete', 'array', 'this', 'allows', 'us', 'to', 'probe', 'the', 'system', 'at', '10', 'mk', 'with', 'minimal', 'selfheating', 'by', 'using', 'weak', 'coherent', 'states', 'at', 'the', 'single', 'microwave', 'photon', 'level', 'to', 'probe', 'the', 'resonance', 'frequency', 'of', 'the', 'cavity', 'we', 'observe', 'signatures', 'of', 'ordered', 'vortex', 'lattice', 'at', 'rational', 'flux', 'fillings', 'of', 'the', 'array']]
|
[-0.2129051756253995, 0.21568906927016293, -0.022404352096517952, 0.02902992862073006, -0.039435976551348256, -0.19621074010369324, 0.07094097879069688, 0.36803649360858387, -0.23689530541940423, -0.2744527599689635, 0.007782465403910133, -0.30020636969402403, -0.08093803597413088, 0.17996098767616786, 0.04645949438351884, 0.03791391722188564, -0.036113018222915176, -0.006686252459820191, -0.0756924285603666, -0.19925865449278551, 0.3021499422928338, 0.023753533903800417, 0.3132169240852818, 0.041444314641094854, 0.09165457483058245, -0.05578218553141183, 0.14436336540860462, 0.007505802119505295, -0.15185820840733041, 0.04649750773486713, 0.2460808727489414, -0.05885282756406179, 0.16059369464743545, -0.47470917575992644, -0.1946886257435174, 0.08999863361664624, 0.13914954475678148, 0.1824838679961183, 0.0029226465002548966, -0.31825466271997854, 0.025861237925544792, -0.16144943532047115, -0.13078336665256013, -0.06955548818223178, -0.03830519226175966, -0.01563646034231748, -0.2465836092014797, 0.028888999131760847, 0.05554209483869437, 0.07247040369177492, 0.007662602580901214, -0.02137183013672422, -0.03322686313053551, 0.0733019777891803, -0.03358936806960793, 0.06390075844435407, 0.15100243760389276, -0.1394662072641288, -0.1395131945213176, 0.3362134759478398, -0.040512691683199424, -0.10594438873125579, 0.18312018815512685, -0.18356403363974427, -0.07502903475225056, 0.16320118380562318, 0.10617540444416756, 0.029378843826800057, -0.11560481394239601, 0.08005667189536325, -0.003043427391358736, 0.19018487800018524, 0.028830621780467813, 0.09081659040053967, 0.3062232887340625, 0.21576862504166042, 0.06877460937010421, 0.2239535660543714, -0.1460684421978261, -0.07841196946736256, -0.26234601869575935, -0.14478934311509048, -0.2134597037590786, 0.08574496107228863, -0.052167033920175694, -0.21320034048668193, 0.41739510068807495, 0.16363864472209985, 0.17053253475453609, -0.0674609950510785, 0.25980264229953964, 0.10499867993216454, 0.07859176810068841, -0.0019740111602004617, 0.24155559812524272, 0.20280276144463147, 0.0969131890534217, -0.30720639201039873, -0.023803041406526147, 0.04157223621405137]
|
1,803.04114
|
Learning the quantum algorithm for state overlap
|
Short-depth algorithms are crucial for reducing computational error on
near-term quantum computers, for which decoherence and gate infidelity remain
important issues. Here we present a machine-learning approach for discovering
such algorithms. We apply our method to a ubiquitous primitive: computing the
overlap ${\rm Tr}(\rho\sigma)$ between two quantum states $\rho$ and $\sigma$.
The standard algorithm for this task, known as the Swap Test, is used in many
applications such as quantum support vector machines, and, when specialized to
$\rho = \sigma$, quantifies the Renyi entanglement. Here, we find algorithms
that have shorter depths than the Swap Test, including one that has a constant
depth (independent of problem size). Furthermore, we apply our approach to the
hardware-specific connectivity and gate sets used by Rigetti's and IBM's
quantum computers and demonstrate that the shorter algorithms that we derive
significantly reduce the error - compared to the Swap Test - on these
computers.
|
quant-ph
|
shortdepth algorithms are crucial for reducing computational error on nearterm quantum computers for which decoherence and gate infidelity remain important issues here we present a machinelearning approach for discovering such algorithms we apply our method to a ubiquitous primitive computing the overlap rm trrhosigma between two quantum states rho and sigma the standard algorithm for this task known as the swap test is used in many applications such as quantum support vector machines and when specialized to rho sigma quantifies the renyi entanglement here we find algorithms that have shorter depths than the swap test including one that has a constant depth independent of problem size furthermore we apply our approach to the hardwarespecific connectivity and gate sets used by rigettis and ibms quantum computers and demonstrate that the shorter algorithms that we derive significantly reduce the error compared to the swap test on these computers
|
[['shortdepth', 'algorithms', 'are', 'crucial', 'for', 'reducing', 'computational', 'error', 'on', 'nearterm', 'quantum', 'computers', 'for', 'which', 'decoherence', 'and', 'gate', 'infidelity', 'remain', 'important', 'issues', 'here', 'we', 'present', 'a', 'machinelearning', 'approach', 'for', 'discovering', 'such', 'algorithms', 'we', 'apply', 'our', 'method', 'to', 'a', 'ubiquitous', 'primitive', 'computing', 'the', 'overlap', 'rm', 'trrhosigma', 'between', 'two', 'quantum', 'states', 'rho', 'and', 'sigma', 'the', 'standard', 'algorithm', 'for', 'this', 'task', 'known', 'as', 'the', 'swap', 'test', 'is', 'used', 'in', 'many', 'applications', 'such', 'as', 'quantum', 'support', 'vector', 'machines', 'and', 'when', 'specialized', 'to', 'rho', 'sigma', 'quantifies', 'the', 'renyi', 'entanglement', 'here', 'we', 'find', 'algorithms', 'that', 'have', 'shorter', 'depths', 'than', 'the', 'swap', 'test', 'including', 'one', 'that', 'has', 'a', 'constant', 'depth', 'independent', 'of', 'problem', 'size', 'furthermore', 'we', 'apply', 'our', 'approach', 'to', 'the', 'hardwarespecific', 'connectivity', 'and', 'gate', 'sets', 'used', 'by', 'rigettis', 'and', 'ibms', 'quantum', 'computers', 'and', 'demonstrate', 'that', 'the', 'shorter', 'algorithms', 'that', 'we', 'derive', 'significantly', 'reduce', 'the', 'error', 'compared', 'to', 'the', 'swap', 'test', 'on', 'these', 'computers']]
|
[-0.06748518978323166, 0.10398453311710101, -0.05373858866126587, 0.11303885870923598, 0.0004104837878710694, -0.2138176011665362, 0.08166484357692146, 0.395148065018778, -0.26461062969529947, -0.31892456778182854, 0.11233277943473594, -0.23916901128056148, -0.17099195119064664, 0.303437314920302, -0.070787201803695, 0.13091087858710024, 0.07720784063955459, 0.04204894091849888, -0.06553352949170706, -0.3091000727411786, 0.25089866676232003, 0.024071419660079602, 0.27363192803588593, 0.04166498004795156, 0.07671473792935204, -0.00849810072557173, 0.009104404549968118, 0.00573811824950907, -0.12136871478873622, 0.1493536561130087, 0.23619678146658568, 0.1776989751107673, 0.29269058131629005, -0.4365251618437469, -0.17115980506059714, 0.11648465715309915, 0.13674295031200423, 0.14632475705083278, -0.01648357115239681, -0.2729728188149036, 0.07971959028509445, -0.14798945400010174, -0.04341749495425676, -0.12763071484449837, 0.03305266959553895, -0.03172152078736366, -0.24085334151984877, 0.06082942940863884, 0.033757514435920816, 0.04039261790846164, 0.017010504811575327, -0.13679712799300128, 0.08700030974270906, 0.15358952480306065, -0.02960352330895451, 0.03663246000198544, 0.15243206192584088, -0.11348003117988507, -0.20374282360878876, 0.3659812878662099, -0.030387529846747283, -0.18883923913947204, 0.19282304126924524, -0.05613105919393194, -0.1433091654600705, 0.04165577340690005, 0.19774830305767763, 0.09232947879031093, -0.09255248834849933, 0.0694579762033148, 0.010335021047568362, 0.18890539420923838, 0.038805335032520816, 0.07897443998242831, 0.14527026807708251, 0.15164445513154431, 0.08813118084597388, 0.153034931811918, -0.10906196112369394, -0.10137079114146116, -0.2790051155671891, -0.20780673014006526, -0.21202632062745075, 0.04118277116504032, -0.08171623299070536, -0.1536705032016875, 0.35340828326944673, 0.2468065391763553, 0.15051046797371884, 0.10696346218578077, 0.3387165288537896, 0.09614052987146554, 0.11218017914830448, 0.1417915534269317, 0.19727589134708978, 0.10733856997588494, 0.03504100950279584, -0.2509998508119477, 0.06574238928846575, 0.017079206806051336]
|
1,803.04115
|
Allosteric interactions in a birod model of DNA
|
Allosteric interactions between molecules bound to DNA at distant locations
have been known for a long time. The phenomenon has been studied via
experiments and numerical simulations, but a comprehensive understanding
grounded in a theory of DNA elasticity remains a challenge. Here we quantify
allosteric interactions between two entities bound to DNA by using the theory
of birods. We recognize that molecules bound to DNA cause local deformations
that can be captured in a birod model which consists of two elastic strands
interacting via an elastic web representing the base-pairs. We show that the
displacement field caused by bound entities decays exponentially with distance
from the binding site. We compute the interaction energy between two proteins
on DNA as a function of distance between them and find that it decays
exponentially while oscillating with the periodicity of the double-helix, in
excellent agreement with experiments. The decay length of the interaction
energy can be determined in terms of the mechanical properties of the strands
and the webbing in our birod model, and it varies with the GC content of the
DNA. Our model provides a framework for viewing allosteric interactions in DNA
within the ambit of configurational forces of continuum elasticity.
|
cond-mat.soft
|
allosteric interactions between molecules bound to dna at distant locations have been known for a long time the phenomenon has been studied via experiments and numerical simulations but a comprehensive understanding grounded in a theory of dna elasticity remains a challenge here we quantify allosteric interactions between two entities bound to dna by using the theory of birods we recognize that molecules bound to dna cause local deformations that can be captured in a birod model which consists of two elastic strands interacting via an elastic web representing the basepairs we show that the displacement field caused by bound entities decays exponentially with distance from the binding site we compute the interaction energy between two proteins on dna as a function of distance between them and find that it decays exponentially while oscillating with the periodicity of the doublehelix in excellent agreement with experiments the decay length of the interaction energy can be determined in terms of the mechanical properties of the strands and the webbing in our birod model and it varies with the gc content of the dna our model provides a framework for viewing allosteric interactions in dna within the ambit of configurational forces of continuum elasticity
|
[['allosteric', 'interactions', 'between', 'molecules', 'bound', 'to', 'dna', 'at', 'distant', 'locations', 'have', 'been', 'known', 'for', 'a', 'long', 'time', 'the', 'phenomenon', 'has', 'been', 'studied', 'via', 'experiments', 'and', 'numerical', 'simulations', 'but', 'a', 'comprehensive', 'understanding', 'grounded', 'in', 'a', 'theory', 'of', 'dna', 'elasticity', 'remains', 'a', 'challenge', 'here', 'we', 'quantify', 'allosteric', 'interactions', 'between', 'two', 'entities', 'bound', 'to', 'dna', 'by', 'using', 'the', 'theory', 'of', 'birods', 'we', 'recognize', 'that', 'molecules', 'bound', 'to', 'dna', 'cause', 'local', 'deformations', 'that', 'can', 'be', 'captured', 'in', 'a', 'birod', 'model', 'which', 'consists', 'of', 'two', 'elastic', 'strands', 'interacting', 'via', 'an', 'elastic', 'web', 'representing', 'the', 'basepairs', 'we', 'show', 'that', 'the', 'displacement', 'field', 'caused', 'by', 'bound', 'entities', 'decays', 'exponentially', 'with', 'distance', 'from', 'the', 'binding', 'site', 'we', 'compute', 'the', 'interaction', 'energy', 'between', 'two', 'proteins', 'on', 'dna', 'as', 'a', 'function', 'of', 'distance', 'between', 'them', 'and', 'find', 'that', 'it', 'decays', 'exponentially', 'while', 'oscillating', 'with', 'the', 'periodicity', 'of', 'the', 'doublehelix', 'in', 'excellent', 'agreement', 'with', 'experiments', 'the', 'decay', 'length', 'of', 'the', 'interaction', 'energy', 'can', 'be', 'determined', 'in', 'terms', 'of', 'the', 'mechanical', 'properties', 'of', 'the', 'strands', 'and', 'the', 'webbing', 'in', 'our', 'birod', 'model', 'and', 'it', 'varies', 'with', 'the', 'gc', 'content', 'of', 'the', 'dna', 'our', 'model', 'provides', 'a', 'framework', 'for', 'viewing', 'allosteric', 'interactions', 'in', 'dna', 'within', 'the', 'ambit', 'of', 'configurational', 'forces', 'of', 'continuum', 'elasticity']]
|
[-0.13462199400428382, 0.16945270814580404, -0.06767436247665877, 0.06709604117210315, 0.006566739161357735, -0.131552335389918, 0.05531911825704755, 0.3768327536080221, -0.2904604706334684, -0.31338609927192784, -0.01823976123470324, -0.29466732524363604, -0.1810796438755157, 0.1657489801067953, 0.03492014068813825, -0.00651064816617755, 0.07022874725211148, 0.056172820661837854, 0.00848591833581473, -0.17539743303540023, 0.23821874230281648, 0.0733294809124529, 0.25564410513257513, 0.09940509755644157, 0.08518419442039848, -0.005266561549194533, 0.03090504093820022, 0.036917610901803004, -0.1578805913657451, 0.17384217084488934, 0.22991043441362133, 0.0692884607612146, 0.23538849653318675, -0.4786477680447408, -0.21794851022335052, 0.09439896819042982, 0.1702216575016277, 0.1435283624356603, -0.03933365078233747, -0.27089861380653646, 0.057750279363715136, -0.14262813545123795, -0.08692867798740138, -0.043149862097425745, 0.04664975502163717, 0.08257890779570902, -0.22225531623369515, 0.12344798171655227, 0.01269000735971136, 0.07324714953023376, -0.09163838085328051, -0.056403349468842, -0.016109034459040772, 0.1706801768318242, 0.10549559720278591, 0.031415890815263296, 0.18041219386610796, -0.11784571279169559, -0.10836378083037532, 0.37979294995617385, -0.05759700984139033, -0.19210664436847003, 0.20877872692007157, -0.08725081653348311, -0.11635842810930552, 0.1323421897408976, 0.13954738454159463, 0.08221957782951343, -0.1760641031268269, 0.06859084389130161, -0.023214447313232932, 0.2135682909671838, 0.09221048910297792, 0.024626815726536955, 0.23446174289542016, 0.20059528791185732, -0.001971473889143178, 0.16510449947596462, -0.09102106149407747, -0.13700258035701934, -0.26461903574979967, -0.14469711027329205, -0.19141067146803392, 0.0246189995715865, -0.0680447643422263, -0.1715225804117367, 0.3625678173642643, 0.08527390215301303, 0.21356402560504098, 0.059635281035408494, 0.2496292492882772, 0.012845608001842982, 0.10386230060689602, 0.01272293944687893, 0.24534438099862652, 0.1118875131442569, 0.024946635717765963, -0.25563776551750533, 0.09740999953661378, 0.059943171568459484]
|
1,803.04116
|
Tunable two-dimensional Dirac nodal nets
|
Nodal line semimetals are characterized by symmetry-protected band crossing
lines and are expected to exhibit nontrivial electronic properties. Connections
of the multiple nodal lines, resulting in nodal nets, chains, or links, are
envisioned to produce even more exotic quantum states. In this work, we propose
a feasible approach to realize tunable nodal line connections in real
materials. We show that certain space group symmetries support the coexistence
of the planar symmetry enforced and accidental nodal lines, which are robust to
spin-orbit coupling and can be tailored into intricate patterns by chemical
substitution, pressure, or strain. Based on first-principles calculations, we
identify non-symmorphic centrosymmetric quasi-one-dimensional compounds,
K$_{2}$SnBi and MX$_{3}$ (M = Ti, Zr, Hf and X = Cl, Br, I), as materials
hosting such tunable 2D Dirac nodal nets. Unique Landau levels are predicted
for the nodal line semimetals with the 2D Dirac nodal nets. Our results provide
a viable approach for realize the novel physics of the nodal line connections
in practice.
|
cond-mat.mes-hall
|
nodal line semimetals are characterized by symmetryprotected band crossing lines and are expected to exhibit nontrivial electronic properties connections of the multiple nodal lines resulting in nodal nets chains or links are envisioned to produce even more exotic quantum states in this work we propose a feasible approach to realize tunable nodal line connections in real materials we show that certain space group symmetries support the coexistence of the planar symmetry enforced and accidental nodal lines which are robust to spinorbit coupling and can be tailored into intricate patterns by chemical substitution pressure or strain based on firstprinciples calculations we identify nonsymmorphic centrosymmetric quasionedimensional compounds k_2snbi and mx_3 m ti zr hf and x cl br i as materials hosting such tunable 2d dirac nodal nets unique landau levels are predicted for the nodal line semimetals with the 2d dirac nodal nets our results provide a viable approach for realize the novel physics of the nodal line connections in practice
|
[['nodal', 'line', 'semimetals', 'are', 'characterized', 'by', 'symmetryprotected', 'band', 'crossing', 'lines', 'and', 'are', 'expected', 'to', 'exhibit', 'nontrivial', 'electronic', 'properties', 'connections', 'of', 'the', 'multiple', 'nodal', 'lines', 'resulting', 'in', 'nodal', 'nets', 'chains', 'or', 'links', 'are', 'envisioned', 'to', 'produce', 'even', 'more', 'exotic', 'quantum', 'states', 'in', 'this', 'work', 'we', 'propose', 'a', 'feasible', 'approach', 'to', 'realize', 'tunable', 'nodal', 'line', 'connections', 'in', 'real', 'materials', 'we', 'show', 'that', 'certain', 'space', 'group', 'symmetries', 'support', 'the', 'coexistence', 'of', 'the', 'planar', 'symmetry', 'enforced', 'and', 'accidental', 'nodal', 'lines', 'which', 'are', 'robust', 'to', 'spinorbit', 'coupling', 'and', 'can', 'be', 'tailored', 'into', 'intricate', 'patterns', 'by', 'chemical', 'substitution', 'pressure', 'or', 'strain', 'based', 'on', 'firstprinciples', 'calculations', 'we', 'identify', 'nonsymmorphic', 'centrosymmetric', 'quasionedimensional', 'compounds', 'k_2snbi', 'and', 'mx_3', 'm', 'ti', 'zr', 'hf', 'and', 'x', 'cl', 'br', 'i', 'as', 'materials', 'hosting', 'such', 'tunable', '2d', 'dirac', 'nodal', 'nets', 'unique', 'landau', 'levels', 'are', 'predicted', 'for', 'the', 'nodal', 'line', 'semimetals', 'with', 'the', '2d', 'dirac', 'nodal', 'nets', 'our', 'results', 'provide', 'a', 'viable', 'approach', 'for', 'realize', 'the', 'novel', 'physics', 'of', 'the', 'nodal', 'line', 'connections', 'in', 'practice']]
|
[-0.24528211859456095, 0.1396904731300768, 0.029813530515153078, 0.06916335464690214, -0.11111377539265456, -0.2498244121846444, 0.1326363925974371, 0.42229272262120043, -0.24688122868127887, -0.26516965963825023, -0.009266631115804889, -0.32593986078065895, -0.17532931367204813, 0.1460137267087428, 0.018218209750294312, 0.03098802691993286, -0.033932099575704, -0.09923203773456099, -0.1451612499025621, -0.20100699908117642, 0.337317285865967, -0.03876663782888637, 0.3296706994743608, 0.05224141623421591, -0.02281405366430024, -0.07120512910157957, 0.09855316603796428, 0.04877166683421728, -0.12202629284097985, 0.14265088060886874, 0.30824756361514843, -0.051302880237652164, 0.14503710476224715, -0.4570299380535037, -0.23460042346034599, 0.04392450289660186, 0.15398186718482734, 0.1189408614439304, -0.06906496274767153, -0.3454809364564014, 0.07888005501824964, -0.11191721204316842, -0.16126889160815217, -0.16510340448105768, -0.05343528275829066, 0.00037007353051840883, -0.18331216747887907, 0.013115676026205596, 0.055024811447416465, 0.13280618079507295, -0.05882181838131363, -0.09658074084021014, -0.16092573356545242, 0.023379348113008264, 0.011853359802186771, -0.021531332181708055, 0.07089157216909851, -0.06063386527294258, -0.16624617798593622, 0.4342097556042784, -0.02421502105352826, -0.14779748782697105, 0.18318843121242082, -0.1024487697659939, -0.14080481186989438, 0.18155454404567187, 0.13994391830110886, 0.08370474743240941, -0.062052728532104744, 0.1059280482202083, -0.051922592000029806, 0.08563335558235552, 0.01527166194077464, 0.08404083597713953, 0.3000564087393149, 0.1151682231150591, 0.08394313139479267, 0.06367969487423265, -0.12920993141999831, -0.0513491555872672, -0.24523169247751306, -0.2070860766641702, -0.2140292113693724, 0.035433408618266195, -0.032713249872959184, -0.2380285517213011, 0.42532483447026814, 0.10785526845680327, 0.21489455600550292, -0.047998903886672786, 0.18338094607475888, 0.11707017308616507, 0.08819792075844118, 0.04176785878883968, 0.20284501375314198, 0.12105564197302802, 0.05433117499012711, -0.22039734229808614, 0.03255644143682043, 0.04616026588534034]
|
1,803.04117
|
The Limit of Large Mass Monopoles
|
In this paper we consider $\rm SU(2)$ monopoles on an asymptotically conical,
oriented, Riemannian $3$-manifold with one end. The connected components of the
moduli space of monopoles in this setting are labeled by an integer called the
charge. We analyse the limiting behavior of sequences of monopoles with fixed
charge, and whose sequence of Yang--Mills--Higgs energies is unbounded. We
prove that the limiting behavior of such monopoles is characterized by energy
concentration along a certain set, which we call the blow-up set. Our work
shows that this set is finite, and using a bubbling analysis obtain effective
bounds on its cardinality, with such bounds depending solely on the charge of
the monopole. Moreover, for such sequences of monopoles there is another
naturally associated set, the zero set, which consists on the set at which the
zeros of the Higgs fields accumulate. Regarding this, our results show that for
such sequences of monopoles, the zero set and the blow-up set coincide. In
particular, proving that in this "large mass" limit, the zero set is a finite
set of points. Some of our work extends for sequences of finite mass critical
points of the Yang--Mills--Higgs functional for which the Yang--Mills--Higgs
energies are $O(m_i)$ as $i\to\infty$, where $m_i$ are the masses of the
configurations.
|
math.DG
|
in this paper we consider rm su2 monopoles on an asymptotically conical oriented riemannian 3manifold with one end the connected components of the moduli space of monopoles in this setting are labeled by an integer called the charge we analyse the limiting behavior of sequences of monopoles with fixed charge and whose sequence of yangmillshiggs energies is unbounded we prove that the limiting behavior of such monopoles is characterized by energy concentration along a certain set which we call the blowup set our work shows that this set is finite and using a bubbling analysis obtain effective bounds on its cardinality with such bounds depending solely on the charge of the monopole moreover for such sequences of monopoles there is another naturally associated set the zero set which consists on the set at which the zeros of the higgs fields accumulate regarding this our results show that for such sequences of monopoles the zero set and the blowup set coincide in particular proving that in this large mass limit the zero set is a finite set of points some of our work extends for sequences of finite mass critical points of the yangmillshiggs functional for which the yangmillshiggs energies are om_i as itoinfty where m_i are the masses of the configurations
|
[['in', 'this', 'paper', 'we', 'consider', 'rm', 'su2', 'monopoles', 'on', 'an', 'asymptotically', 'conical', 'oriented', 'riemannian', '3manifold', 'with', 'one', 'end', 'the', 'connected', 'components', 'of', 'the', 'moduli', 'space', 'of', 'monopoles', 'in', 'this', 'setting', 'are', 'labeled', 'by', 'an', 'integer', 'called', 'the', 'charge', 'we', 'analyse', 'the', 'limiting', 'behavior', 'of', 'sequences', 'of', 'monopoles', 'with', 'fixed', 'charge', 'and', 'whose', 'sequence', 'of', 'yangmillshiggs', 'energies', 'is', 'unbounded', 'we', 'prove', 'that', 'the', 'limiting', 'behavior', 'of', 'such', 'monopoles', 'is', 'characterized', 'by', 'energy', 'concentration', 'along', 'a', 'certain', 'set', 'which', 'we', 'call', 'the', 'blowup', 'set', 'our', 'work', 'shows', 'that', 'this', 'set', 'is', 'finite', 'and', 'using', 'a', 'bubbling', 'analysis', 'obtain', 'effective', 'bounds', 'on', 'its', 'cardinality', 'with', 'such', 'bounds', 'depending', 'solely', 'on', 'the', 'charge', 'of', 'the', 'monopole', 'moreover', 'for', 'such', 'sequences', 'of', 'monopoles', 'there', 'is', 'another', 'naturally', 'associated', 'set', 'the', 'zero', 'set', 'which', 'consists', 'on', 'the', 'set', 'at', 'which', 'the', 'zeros', 'of', 'the', 'higgs', 'fields', 'accumulate', 'regarding', 'this', 'our', 'results', 'show', 'that', 'for', 'such', 'sequences', 'of', 'monopoles', 'the', 'zero', 'set', 'and', 'the', 'blowup', 'set', 'coincide', 'in', 'particular', 'proving', 'that', 'in', 'this', 'large', 'mass', 'limit', 'the', 'zero', 'set', 'is', 'a', 'finite', 'set', 'of', 'points', 'some', 'of', 'our', 'work', 'extends', 'for', 'sequences', 'of', 'finite', 'mass', 'critical', 'points', 'of', 'the', 'yangmillshiggs', 'functional', 'for', 'which', 'the', 'yangmillshiggs', 'energies', 'are', 'om_i', 'as', 'itoinfty', 'where', 'm_i', 'are', 'the', 'masses', 'of', 'the', 'configurations']]
|
[-0.1647974170485966, 0.16484942422574275, -0.04373595804648928, 0.07136355852931026, -0.03642675070577796, -0.058144803586723415, 0.04513254705716245, 0.30796564456730474, -0.22695949869497756, -0.2572679957998783, 0.11739637375737955, -0.3016859699780362, -0.11564375264079947, 0.17792582630656623, -0.0697463493700625, 0.020254164495512077, 0.03257533496370512, 0.11606070562822825, -0.052107883539300355, -0.24624370225887907, 0.41585701866226904, -0.05692699541778941, 0.24538729147000782, 0.06732305408450975, 0.11996195511892438, -0.01579679390103623, 0.03242970594655027, 0.04127868861569934, -0.14944074076834873, 0.11671053754326188, 0.2183542226710798, 0.0710002225500634, 0.20889596766196236, -0.3803919910332946, -0.16820713350968214, 0.1837917586284997, 0.14776536603747872, 0.08723806010327484, -0.044625005082106976, -0.2555153798824399, 0.15927175221782017, -0.11017434790665863, -0.15355430468114797, -0.06420803827826273, 0.011433570160035881, 0.06540403457616932, -0.2718300171615333, 0.00042695148987806976, 0.07715523511039886, 0.07612528393499589, -0.07525260350054228, -0.12414460041021046, -0.05844376598034749, 0.1006249964736295, 0.09344116620703836, 0.05588399671334506, 0.1010976382798591, -0.10067061211080536, -0.09901768061595313, 0.3402845834863136, -0.05352348997814661, -0.22923039389065686, 0.1699296819117437, -0.13895799980931092, -0.14498118312726394, 0.12368953344634953, 0.1265885936069574, 0.1686111831386979, -0.10154522572416794, 0.14680884897839233, -0.10679705699451232, 0.11878805128082134, 0.07918450892925191, 0.03583195842312355, 0.23462014959492325, 0.15668267097979177, 0.13712085146563763, 0.13074966431283458, -0.05218055160993568, -0.08011358755342128, -0.3904666506582827, -0.16067240856761675, -0.21049151197187246, 0.08656118025849506, -0.11568054861176601, -0.22178886866121236, 0.39309210006958634, 0.1197799587071958, 0.24688609244756438, 0.09537476951113799, 0.21443554208252988, 0.12763349917167507, 0.030101234835247247, 0.0850216904855623, 0.18329860523087418, 0.1085528611544181, 0.053528021856179935, -0.21443118649739862, -0.04843772279597712, 0.13284511498340437]
|
1,803.04118
|
Nonequilibrium dynamics of superconductivity in the attractive Hubbard
model
|
We present a framework of semiclassical superconductivity (SC) dynamics that
properly includes effects of spatial fluctuations for the attractive Hubbard
model. We consider both coherent and adiabatic limits. To model the coherent SC
dynamics, we develop a real-space von~Neumann equation based on the
time-dependent Hartree-Fock-Bogoliubov theory. Applying our method to
interaction quenches in the negative-$U$ Hubbard model, we show that the
relaxation of SC order at weak coupling is dominated by Landau-damping. At
strong coupling, we find a two-stage relaxation of the pairing field: a
collapse of the synchronized oscillation of Cooper pairs due to spatial
inhomogeneity, followed by a slow relaxation to a quasi-stationary state. SC
dynamics in adiabatic limit is described by a quantum Landau-Lifshitz equation
with Ginzburg-Landau relaxation. Numerical simulations of the pump-probe
process show that long time recovery of the pairing field is dominated by
defects dynamics. Our results demonstrate the important role of spatial
fluctuations in both limits.
|
cond-mat.str-el cond-mat.supr-con
|
we present a framework of semiclassical superconductivity sc dynamics that properly includes effects of spatial fluctuations for the attractive hubbard model we consider both coherent and adiabatic limits to model the coherent sc dynamics we develop a realspace vonneumann equation based on the timedependent hartreefockbogoliubov theory applying our method to interaction quenches in the negativeu hubbard model we show that the relaxation of sc order at weak coupling is dominated by landaudamping at strong coupling we find a twostage relaxation of the pairing field a collapse of the synchronized oscillation of cooper pairs due to spatial inhomogeneity followed by a slow relaxation to a quasistationary state sc dynamics in adiabatic limit is described by a quantum landaulifshitz equation with ginzburglandau relaxation numerical simulations of the pumpprobe process show that long time recovery of the pairing field is dominated by defects dynamics our results demonstrate the important role of spatial fluctuations in both limits
|
[['we', 'present', 'a', 'framework', 'of', 'semiclassical', 'superconductivity', 'sc', 'dynamics', 'that', 'properly', 'includes', 'effects', 'of', 'spatial', 'fluctuations', 'for', 'the', 'attractive', 'hubbard', 'model', 'we', 'consider', 'both', 'coherent', 'and', 'adiabatic', 'limits', 'to', 'model', 'the', 'coherent', 'sc', 'dynamics', 'we', 'develop', 'a', 'realspace', 'vonneumann', 'equation', 'based', 'on', 'the', 'timedependent', 'hartreefockbogoliubov', 'theory', 'applying', 'our', 'method', 'to', 'interaction', 'quenches', 'in', 'the', 'negativeu', 'hubbard', 'model', 'we', 'show', 'that', 'the', 'relaxation', 'of', 'sc', 'order', 'at', 'weak', 'coupling', 'is', 'dominated', 'by', 'landaudamping', 'at', 'strong', 'coupling', 'we', 'find', 'a', 'twostage', 'relaxation', 'of', 'the', 'pairing', 'field', 'a', 'collapse', 'of', 'the', 'synchronized', 'oscillation', 'of', 'cooper', 'pairs', 'due', 'to', 'spatial', 'inhomogeneity', 'followed', 'by', 'a', 'slow', 'relaxation', 'to', 'a', 'quasistationary', 'state', 'sc', 'dynamics', 'in', 'adiabatic', 'limit', 'is', 'described', 'by', 'a', 'quantum', 'landaulifshitz', 'equation', 'with', 'ginzburglandau', 'relaxation', 'numerical', 'simulations', 'of', 'the', 'pumpprobe', 'process', 'show', 'that', 'long', 'time', 'recovery', 'of', 'the', 'pairing', 'field', 'is', 'dominated', 'by', 'defects', 'dynamics', 'our', 'results', 'demonstrate', 'the', 'important', 'role', 'of', 'spatial', 'fluctuations', 'in', 'both', 'limits']]
|
[-0.18004064335262562, 0.16679188896128846, -0.10178458673599498, 0.1081264013241737, 0.007217755358593136, -0.12038371666925016, 0.028547699337222558, 0.33590967629372687, -0.2804702090501201, -0.2263712856729874, 0.010349759230164969, -0.23991675499911888, -0.12264575287577958, 0.1413443815781053, 0.06771972648239409, 0.013708165770296153, 0.02042963127514311, -0.04654837120933081, -0.08634337748315649, -0.2097008539199391, 0.32683361792523, 0.041718904606943184, 0.3116613226437491, 0.06770882359858042, 0.07530272849439795, 0.04463111741310046, 0.06732048585195265, 0.043629025483467414, -0.14762305992945923, 0.04766816095589033, 0.21184540892459658, -0.00798731480399451, 0.2713881489619905, -0.4756667062615842, -0.2728067898294992, 0.016687953518247048, 0.15763686006330258, 0.21192035145655858, -0.04725828839639457, -0.30734793129194454, 0.014592819112152154, -0.16914202581506735, -0.12242317076748103, -0.1091389886824128, 0.004524589137302018, 0.02291955951954317, -0.2951313011329986, 0.1512995436658255, 0.08373781108431323, 0.015456795736575147, -0.07404812667944949, -0.021202985191218604, -0.006462097912113748, 0.02414281682790032, 0.023034967635598435, 0.030742343989188715, 0.11298187053153669, -0.11895156288032535, -0.11580137179987932, 0.3519029842409628, -0.13376991371255142, -0.12227645928490591, 0.15953343852995316, -0.12578395199261946, -0.0724807573311956, 0.14682970497927633, 0.11763784607105396, 0.1075037162160513, -0.14526438538983366, 0.1128482893288605, 0.015927482530279875, 0.1743513059838876, -0.030326393499873042, 0.038717820981724396, 0.19608928634499023, 0.24622904366259676, 0.0362841814719871, 0.13444998561027247, -0.12059295523966498, -0.17610099266764093, -0.2955221990671228, -0.07561771751623418, -0.21037841287557207, 0.061305356724796436, -0.060325875975632146, -0.1504861735099671, 0.4025928188401451, 0.18145070506831984, 0.17040416763888466, 0.00030929435141920265, 0.26391725040047, 0.15742780213256433, 0.014338456569056884, 0.07428217485084448, 0.24261093487220456, 0.18371693626216618, 0.07552667582724122, -0.3842559975291925, 0.007684196753342167, 0.09540720174417776]
|
1,803.04119
|
A Deep Learning Based Behavioral Approach to Indoor Autonomous
Navigation
|
We present a semantically rich graph representation for indoor robotic
navigation. Our graph representation encodes: semantic locations such as
offices or corridors as nodes, and navigational behaviors such as enter office
or cross a corridor as edges. In particular, our navigational behaviors operate
directly from visual inputs to produce motor controls and are implemented with
deep learning architectures. This enables the robot to avoid explicit
computation of its precise location or the geometry of the environment, and
enables navigation at a higher level of semantic abstraction. We evaluate the
effectiveness of our representation by simulating navigation tasks in a large
number of virtual environments. Our results show that using a simple sets of
perceptual and navigational behaviors, the proposed approach can successfully
guide the way of the robot as it completes navigational missions such as going
to a specific office. Furthermore, our implementation shows to be effective to
control the selection and switching of behaviors.
|
cs.AI cs.RO
|
we present a semantically rich graph representation for indoor robotic navigation our graph representation encodes semantic locations such as offices or corridors as nodes and navigational behaviors such as enter office or cross a corridor as edges in particular our navigational behaviors operate directly from visual inputs to produce motor controls and are implemented with deep learning architectures this enables the robot to avoid explicit computation of its precise location or the geometry of the environment and enables navigation at a higher level of semantic abstraction we evaluate the effectiveness of our representation by simulating navigation tasks in a large number of virtual environments our results show that using a simple sets of perceptual and navigational behaviors the proposed approach can successfully guide the way of the robot as it completes navigational missions such as going to a specific office furthermore our implementation shows to be effective to control the selection and switching of behaviors
|
[['we', 'present', 'a', 'semantically', 'rich', 'graph', 'representation', 'for', 'indoor', 'robotic', 'navigation', 'our', 'graph', 'representation', 'encodes', 'semantic', 'locations', 'such', 'as', 'offices', 'or', 'corridors', 'as', 'nodes', 'and', 'navigational', 'behaviors', 'such', 'as', 'enter', 'office', 'or', 'cross', 'a', 'corridor', 'as', 'edges', 'in', 'particular', 'our', 'navigational', 'behaviors', 'operate', 'directly', 'from', 'visual', 'inputs', 'to', 'produce', 'motor', 'controls', 'and', 'are', 'implemented', 'with', 'deep', 'learning', 'architectures', 'this', 'enables', 'the', 'robot', 'to', 'avoid', 'explicit', 'computation', 'of', 'its', 'precise', 'location', 'or', 'the', 'geometry', 'of', 'the', 'environment', 'and', 'enables', 'navigation', 'at', 'a', 'higher', 'level', 'of', 'semantic', 'abstraction', 'we', 'evaluate', 'the', 'effectiveness', 'of', 'our', 'representation', 'by', 'simulating', 'navigation', 'tasks', 'in', 'a', 'large', 'number', 'of', 'virtual', 'environments', 'our', 'results', 'show', 'that', 'using', 'a', 'simple', 'sets', 'of', 'perceptual', 'and', 'navigational', 'behaviors', 'the', 'proposed', 'approach', 'can', 'successfully', 'guide', 'the', 'way', 'of', 'the', 'robot', 'as', 'it', 'completes', 'navigational', 'missions', 'such', 'as', 'going', 'to', 'a', 'specific', 'office', 'furthermore', 'our', 'implementation', 'shows', 'to', 'be', 'effective', 'to', 'control', 'the', 'selection', 'and', 'switching', 'of', 'behaviors']]
|
[-0.10002050834798044, 0.04431575069864911, -0.09088998288817464, 0.03005896423222317, -0.16586093804648808, -0.12235196093698182, 0.07749579597354657, 0.4296060451456616, -0.2521828854907184, -0.3834924527864543, 0.07487948919466186, -0.2500125046579107, -0.21549903322461872, 0.21630132668952068, -0.12426124072104182, 0.06116590793282094, 0.09400787804962978, 0.071124641879672, -0.006992229833286406, -0.1878197551243037, 0.257896319602526, 0.02782205362905628, 0.27413315136537647, 0.02590270994922086, 0.1398736925960909, 0.0229659769353607, 0.007818284450519469, 0.008467407387140538, -0.03882156809244583, 0.15069701112806796, 0.3694954004827812, 0.206816505977223, 0.2655123937724819, -0.42542878511932586, -0.21648764847477356, 0.045294053368871254, 0.1478830040492598, 0.08699334279724187, -0.028329183166516163, -0.3916526270129027, 0.08114369723705515, -0.19583023225967472, -0.08884671046548794, -0.12806134153037302, -0.013962838768718703, 0.03246511506412419, -0.2752426759249741, -0.06381717619970591, 0.03322924558794306, 0.08953486104465781, -0.03913928925345141, -0.042875980492681265, -0.022978294546145105, 0.27494847025391794, -0.02097228897074538, 0.03252030772160769, 0.21769548114990034, -0.17116661309222353, -0.1653727785691679, 0.406646690157152, -0.0002798379669266362, -0.19942478076104195, 0.2602459485297121, -0.064173000666403, -0.12476260891154169, 0.06578315862364346, 0.24517623102968378, 0.11208474304388097, -0.14007198293242723, 0.021095857710292144, -0.01845040057275084, 0.13737671198698903, 0.06535537497651192, 0.0074262145486089495, 0.19301174248328373, 0.2531142205645841, 0.08422634308977474, 0.15372971214969913, -0.07898468702070174, -0.07979877945035696, -0.24996164467846674, -0.13609937516551826, -0.15197704227551098, -0.03463851748515041, -0.11769526814694531, -0.15155881786148154, 0.38991171245373063, 0.23129324642424998, 0.22796076609933327, 0.11979939512638074, 0.3639994920141274, 0.032136481036732514, 0.10697693281897133, 0.09776029984857286, 0.12914924778104309, -0.031064801709726454, 0.1485594519293837, -0.18609436300823526, 0.10547029272532991, 0.04084770443038114]
|
1,803.0412
|
GPU Accelerated Self-join for the Distance Similarity Metric
|
The self-join finds all objects in a dataset within a threshold of each other
defined by a similarity metric. As such, the self-join is a building block for
the field of databases and data mining, and is employed in Big Data
applications. In this paper, we advance a GPU-efficient algorithm for the
similarity self-join that uses the Euclidean distance metric. The
search-and-refine strategy is an efficient approach for low dimensionality
datasets, as index searches degrade with increasing dimension (i.e., the curse
of dimensionality). Thus, we target the low dimensionality problem, and compare
our GPU self-join to a search-and-refine implementation, and a state-of-the-art
parallel algorithm. In low dimensionality, there are several unique challenges
associated with efficiently solving the self-join problem on the GPU. Low
dimensional data often results in higher data densities, causing a significant
number of distance calculations and a large result set. As dimensionality
increases, index searches become increasingly exhaustive, forming a performance
bottleneck. We advance several techniques to overcome these challenges using
the GPU. The techniques we propose include a GPU-efficient index that employs a
bounded search, a batching scheme to accommodate large result set sizes, and a
reduction in distance calculations through duplicate search removal. Our GPU
self-join outperforms both search-and-refine and state-of-the-art algorithms.
|
cs.DC cs.DB
|
the selfjoin finds all objects in a dataset within a threshold of each other defined by a similarity metric as such the selfjoin is a building block for the field of databases and data mining and is employed in big data applications in this paper we advance a gpuefficient algorithm for the similarity selfjoin that uses the euclidean distance metric the searchandrefine strategy is an efficient approach for low dimensionality datasets as index searches degrade with increasing dimension ie the curse of dimensionality thus we target the low dimensionality problem and compare our gpu selfjoin to a searchandrefine implementation and a stateoftheart parallel algorithm in low dimensionality there are several unique challenges associated with efficiently solving the selfjoin problem on the gpu low dimensional data often results in higher data densities causing a significant number of distance calculations and a large result set as dimensionality increases index searches become increasingly exhaustive forming a performance bottleneck we advance several techniques to overcome these challenges using the gpu the techniques we propose include a gpuefficient index that employs a bounded search a batching scheme to accommodate large result set sizes and a reduction in distance calculations through duplicate search removal our gpu selfjoin outperforms both searchandrefine and stateoftheart algorithms
|
[['the', 'selfjoin', 'finds', 'all', 'objects', 'in', 'a', 'dataset', 'within', 'a', 'threshold', 'of', 'each', 'other', 'defined', 'by', 'a', 'similarity', 'metric', 'as', 'such', 'the', 'selfjoin', 'is', 'a', 'building', 'block', 'for', 'the', 'field', 'of', 'databases', 'and', 'data', 'mining', 'and', 'is', 'employed', 'in', 'big', 'data', 'applications', 'in', 'this', 'paper', 'we', 'advance', 'a', 'gpuefficient', 'algorithm', 'for', 'the', 'similarity', 'selfjoin', 'that', 'uses', 'the', 'euclidean', 'distance', 'metric', 'the', 'searchandrefine', 'strategy', 'is', 'an', 'efficient', 'approach', 'for', 'low', 'dimensionality', 'datasets', 'as', 'index', 'searches', 'degrade', 'with', 'increasing', 'dimension', 'ie', 'the', 'curse', 'of', 'dimensionality', 'thus', 'we', 'target', 'the', 'low', 'dimensionality', 'problem', 'and', 'compare', 'our', 'gpu', 'selfjoin', 'to', 'a', 'searchandrefine', 'implementation', 'and', 'a', 'stateoftheart', 'parallel', 'algorithm', 'in', 'low', 'dimensionality', 'there', 'are', 'several', 'unique', 'challenges', 'associated', 'with', 'efficiently', 'solving', 'the', 'selfjoin', 'problem', 'on', 'the', 'gpu', 'low', 'dimensional', 'data', 'often', 'results', 'in', 'higher', 'data', 'densities', 'causing', 'a', 'significant', 'number', 'of', 'distance', 'calculations', 'and', 'a', 'large', 'result', 'set', 'as', 'dimensionality', 'increases', 'index', 'searches', 'become', 'increasingly', 'exhaustive', 'forming', 'a', 'performance', 'bottleneck', 'we', 'advance', 'several', 'techniques', 'to', 'overcome', 'these', 'challenges', 'using', 'the', 'gpu', 'the', 'techniques', 'we', 'propose', 'include', 'a', 'gpuefficient', 'index', 'that', 'employs', 'a', 'bounded', 'search', 'a', 'batching', 'scheme', 'to', 'accommodate', 'large', 'result', 'set', 'sizes', 'and', 'a', 'reduction', 'in', 'distance', 'calculations', 'through', 'duplicate', 'search', 'removal', 'our', 'gpu', 'selfjoin', 'outperforms', 'both', 'searchandrefine', 'and', 'stateoftheart', 'algorithms']]
|
[-0.11465096044700575, 0.02748393783733026, -0.050879072042515024, 0.05773751499864682, -0.09752981586759721, -0.14813788813777304, 0.07849508641762344, 0.38546962820101477, -0.2766952847809967, -0.36088339364435074, 0.1241013071134772, -0.29111254107710965, -0.1426478676713895, 0.22027116491580787, -0.08766492440282021, 0.08411707524840095, 0.1255632141787235, 0.016218452944964674, -0.09375763601698836, -0.2590709822409863, 0.2743402328679635, 0.07309230557386426, 0.3144361088727263, 0.035296129839998726, 0.09371406793288418, -0.010689374018946419, -0.049658193779942815, 0.05996866449308784, -0.06385864180397155, 0.16570034273900092, 0.2879360350082822, 0.20072324616173148, 0.31828662971763505, -0.3678038593849554, -0.19408126856517588, 0.11296254883695772, 0.14633688029882627, 0.12174112350036838, -0.09584565088321603, -0.24164319747905944, 0.09964095855329708, -0.16584772406402382, -0.07523792692806554, -0.104211808193547, 0.0032594387137200595, -0.013305825555859052, -0.2707280138381509, 0.03988397944997546, 0.02655795865561723, 0.02689038154494483, -0.03422005886238986, -0.13965201534438823, 0.06267189435156935, 0.09662890227923197, 0.02727737835639917, 0.08294877231319026, 0.09920005541933691, -0.12936016672858455, -0.17468286023119797, 0.3858920110790014, -0.05515637551771774, -0.20201561520335035, 0.21217975482245646, -0.031670389101381646, -0.16109504437499797, 0.12635404817481044, 0.23382297996825263, 0.13657972913073457, -0.1061912460167159, 0.10501535111168796, 0.002379189635703457, 0.1837134177353377, 0.06277514610704989, 0.02064682679714248, 0.11551157572387677, 0.24353489910076925, 0.08911884488348944, 0.13622643372661475, -0.13084683658983692, -0.06554871013248564, -0.20429560337508107, -0.1526556996840102, -0.21252951301141657, -0.0292210252477522, -0.16526314496701855, -0.16878721840085759, 0.33155706886529057, 0.195121916108551, 0.23715339989315917, 0.07585756675956618, 0.3702905602969121, 0.04608006194919451, 0.1338045354347658, 0.14414083412263523, 0.13068901767036406, 0.04085314337613093, 0.09854038532796329, -0.18368387000594774, 0.03139625736939662, 0.05498197650252043]
|
1,803.04121
|
The Singular Locus of an Almost Distance Function
|
The aim of this article is to generalize the notion of the cut locus and to
get the structure theorem for it. For this purpose, we first introduce a class
of 1-Lipschitz functions, each member of which is called an {\it almost
distance function}. Typical examples of an almost distance function are the
distance function from a point and the Busemann function on a complete
Riemannian manifold. The generalized notion of the cut locus in this paper is
called the {\it singular locus} of an almost distance function. The singular
locus consists of the upper one and the lower one. The upper singular locus
coincides with the cut locus of a point for the distance function from the
point, and the lower singular locus coincides with the set of all copoints of a
ray when the almost distance function is the Busman function of the ray.
Therefore, it is possible to treat the cut locus of a closed subset and the set
of copoints of a ray in a unified way by introducing the singular locus for the
almost distance function. In this article, we obtain the structure theorem
(Theorem B) for the singular locus of an almost distance function on a
2-dimensional Finsler manifold that contains both structure theorems ([S],
Theorem B) and [Sa,Theorem 2.13]) for the cut locus and the set of copoints of
a ray as a corollary.
|
math.DG
|
the aim of this article is to generalize the notion of the cut locus and to get the structure theorem for it for this purpose we first introduce a class of 1lipschitz functions each member of which is called an it almost distance function typical examples of an almost distance function are the distance function from a point and the busemann function on a complete riemannian manifold the generalized notion of the cut locus in this paper is called the it singular locus of an almost distance function the singular locus consists of the upper one and the lower one the upper singular locus coincides with the cut locus of a point for the distance function from the point and the lower singular locus coincides with the set of all copoints of a ray when the almost distance function is the busman function of the ray therefore it is possible to treat the cut locus of a closed subset and the set of copoints of a ray in a unified way by introducing the singular locus for the almost distance function in this article we obtain the structure theorem theorem b for the singular locus of an almost distance function on a 2dimensional finsler manifold that contains both structure theorems s theorem b and satheorem 213 for the cut locus and the set of copoints of a ray as a corollary
|
[['the', 'aim', 'of', 'this', 'article', 'is', 'to', 'generalize', 'the', 'notion', 'of', 'the', 'cut', 'locus', 'and', 'to', 'get', 'the', 'structure', 'theorem', 'for', 'it', 'for', 'this', 'purpose', 'we', 'first', 'introduce', 'a', 'class', 'of', '1lipschitz', 'functions', 'each', 'member', 'of', 'which', 'is', 'called', 'an', 'it', 'almost', 'distance', 'function', 'typical', 'examples', 'of', 'an', 'almost', 'distance', 'function', 'are', 'the', 'distance', 'function', 'from', 'a', 'point', 'and', 'the', 'busemann', 'function', 'on', 'a', 'complete', 'riemannian', 'manifold', 'the', 'generalized', 'notion', 'of', 'the', 'cut', 'locus', 'in', 'this', 'paper', 'is', 'called', 'the', 'it', 'singular', 'locus', 'of', 'an', 'almost', 'distance', 'function', 'the', 'singular', 'locus', 'consists', 'of', 'the', 'upper', 'one', 'and', 'the', 'lower', 'one', 'the', 'upper', 'singular', 'locus', 'coincides', 'with', 'the', 'cut', 'locus', 'of', 'a', 'point', 'for', 'the', 'distance', 'function', 'from', 'the', 'point', 'and', 'the', 'lower', 'singular', 'locus', 'coincides', 'with', 'the', 'set', 'of', 'all', 'copoints', 'of', 'a', 'ray', 'when', 'the', 'almost', 'distance', 'function', 'is', 'the', 'busman', 'function', 'of', 'the', 'ray', 'therefore', 'it', 'is', 'possible', 'to', 'treat', 'the', 'cut', 'locus', 'of', 'a', 'closed', 'subset', 'and', 'the', 'set', 'of', 'copoints', 'of', 'a', 'ray', 'in', 'a', 'unified', 'way', 'by', 'introducing', 'the', 'singular', 'locus', 'for', 'the', 'almost', 'distance', 'function', 'in', 'this', 'article', 'we', 'obtain', 'the', 'structure', 'theorem', 'theorem', 'b', 'for', 'the', 'singular', 'locus', 'of', 'an', 'almost', 'distance', 'function', 'on', 'a', '2dimensional', 'finsler', 'manifold', 'that', 'contains', 'both', 'structure', 'theorems', 's', 'theorem', 'b', 'and', 'satheorem', '213', 'for', 'the', 'cut', 'locus', 'and', 'the', 'set', 'of', 'copoints', 'of', 'a', 'ray', 'as', 'a', 'corollary']]
|
[-0.15220419010432137, 0.015436364353052848, -0.13206522127076592, 0.08271846231978029, -0.05454823875588296, -0.07337154508426004, 0.08736770157651431, 0.3012784203538858, -0.3206383599838706, -0.20745677179270566, 0.07296640597289941, -0.30390846338448435, -0.14301707506724776, 0.20754556294620102, -0.0889056251652734, -0.001998270512050156, 0.025418420867205447, 0.09315461597474511, -0.08885500082155429, -0.21666278545368528, 0.43173598781163, 0.018458921333681384, 0.22211547912501092, 0.05235310147849916, 0.14362852065518955, 0.042620508559454866, -0.0031433794098422257, 0.009438490474751163, -0.15369341150857127, 0.11762377359054364, 0.2117445040250189, 0.14518658114865618, 0.2532698891143921, -0.28762256557845783, -0.14123182688071087, 0.19464837536053106, 0.10163939673063146, 0.03216178548943219, 0.027503771767402516, -0.20107172091397982, 0.10811054000557771, -0.10056030530661475, -0.24336776435583643, 0.02210653223926974, 0.03665363921186029, 0.022315108359640862, -0.21695407106836964, 0.02466089894189845, 0.10026963680624701, 0.07531339197707318, -0.04794334881333024, -0.11931176944005437, -0.05172820017046771, 0.09894090829232574, 0.00089564493361161, 0.14222082517701548, 0.09087965747862078, -0.0894574006778182, -0.04712750579080012, 0.3330320964575497, -0.060346213395109476, -0.213517491233954, 0.14194522543066063, -0.1419961254110389, -0.11317328435437973, 0.12441438889765388, 0.12510642054079987, 0.18198422401305694, -0.15616049250699915, 0.15081525391692654, -0.08949843771078554, 0.0767590829056096, 0.08169834272464224, -0.0034700824602559924, 0.1681057025584917, 0.1519550432493772, 0.17357046815554517, 0.14967539724304166, -0.08538628612161007, -0.03560512481429146, -0.38867290742597727, -0.18302224484967744, -0.18765404549840123, 0.09081905684942242, -0.1340789499985055, -0.25714398957951623, 0.40499800400540037, 0.037967030300583904, 0.26541115864135295, 0.1105481778321316, 0.262504774511804, 0.10206580565708301, 0.049242011400033196, 0.08656491969069506, 0.19361364187501923, 0.1518940620651005, 0.0011268667124341928, -0.12999016654933904, 0.01866501674064187, 0.15819894726180744]
|
1,803.04122
|
Symmetry Transition Preserving Chirality in QCD: A Versatile Random
Matrix Model
|
We consider a random matrix model which interpolates between the chiral
Gaussian unitary ensemble and the Gaussian unitary ensemble while preserving
chiral symmetry. This ensemble describes flavor symmetry breaking for staggered
fermions in 3d QCD as well as in 4d QCD at high temperature or in 3d QCD at
finite isospin chemical potential. Our model is an Osborn-type two-matrix model
which is equivalent to the elliptic ensemble but we consider the singular value
statistics rather than the complex eigenvalue statistics. We report on exact
results for the partition function and the microscopic level density of the
Dirac operator in the $\varepsilon$-regime of QCD. We compare these analytical
results with Monte Carlo simulations of the matrix model.
|
hep-th hep-lat math-ph math.MP
|
we consider a random matrix model which interpolates between the chiral gaussian unitary ensemble and the gaussian unitary ensemble while preserving chiral symmetry this ensemble describes flavor symmetry breaking for staggered fermions in 3d qcd as well as in 4d qcd at high temperature or in 3d qcd at finite isospin chemical potential our model is an osborntype twomatrix model which is equivalent to the elliptic ensemble but we consider the singular value statistics rather than the complex eigenvalue statistics we report on exact results for the partition function and the microscopic level density of the dirac operator in the varepsilonregime of qcd we compare these analytical results with monte carlo simulations of the matrix model
|
[['we', 'consider', 'a', 'random', 'matrix', 'model', 'which', 'interpolates', 'between', 'the', 'chiral', 'gaussian', 'unitary', 'ensemble', 'and', 'the', 'gaussian', 'unitary', 'ensemble', 'while', 'preserving', 'chiral', 'symmetry', 'this', 'ensemble', 'describes', 'flavor', 'symmetry', 'breaking', 'for', 'staggered', 'fermions', 'in', '3d', 'qcd', 'as', 'well', 'as', 'in', '4d', 'qcd', 'at', 'high', 'temperature', 'or', 'in', '3d', 'qcd', 'at', 'finite', 'isospin', 'chemical', 'potential', 'our', 'model', 'is', 'an', 'osborntype', 'twomatrix', 'model', 'which', 'is', 'equivalent', 'to', 'the', 'elliptic', 'ensemble', 'but', 'we', 'consider', 'the', 'singular', 'value', 'statistics', 'rather', 'than', 'the', 'complex', 'eigenvalue', 'statistics', 'we', 'report', 'on', 'exact', 'results', 'for', 'the', 'partition', 'function', 'and', 'the', 'microscopic', 'level', 'density', 'of', 'the', 'dirac', 'operator', 'in', 'the', 'varepsilonregime', 'of', 'qcd', 'we', 'compare', 'these', 'analytical', 'results', 'with', 'monte', 'carlo', 'simulations', 'of', 'the', 'matrix', 'model']]
|
[-0.0674042858800181, 0.1953644660341588, -0.08584370742666356, 0.07387233275221661, -0.0004482489291643887, -0.1181511934969182, 0.02407197796396519, 0.3938332824853429, -0.19832367206956342, -0.2424080200828285, 0.03889732290337091, -0.3211024411414799, -0.12911727920525887, 0.052388895039544685, 0.05019160316799555, 0.14074263118795657, 0.014916994723311643, 0.06452645332932375, -0.15999696601443647, -0.1831188680350846, 0.327218076851415, 0.047226107932561844, 0.289345782119454, 0.06377718749194684, 0.0949685162856456, 0.03254460482531341, 0.0013312185346557382, -0.05602357038215064, -0.08482720275213451, 0.05092498229963607, 0.2057537687615606, -0.0027321369689480776, 0.14028665153391398, -0.42168061418883634, -0.2313756817245137, 0.125102453887577, 0.14653587535742604, 0.17181384260766208, -0.02880767212563864, -0.2840130381580246, 0.07125200230726286, -0.18342504925870648, -0.18848918076898707, -0.12353149981017371, -0.086385944888829, -0.055968335274660046, -0.33573770174233797, 0.12827587092556714, -0.0061991709037357125, 0.08113132858354795, -0.010922778150671277, -0.18155914348991295, -0.008378327860938091, 0.05905486318474766, 0.020361285003130895, 0.027422232221732356, 0.11282804367549129, -0.1855802668091073, -0.113748877305178, 0.42226741816072416, -0.05737072917116549, -0.22146809012057228, 0.12940050717933396, -0.1327027632985591, -0.14930946303923665, 0.07391983314760421, 0.15063780520045966, 0.09529039531276283, -0.11709912241387524, 0.15213658763483787, -0.08748988678021226, 0.13682524878490848, -0.0017523939655930327, -0.021570016009112198, 0.21740706978578186, 0.14345571320307882, 0.04776327198436647, 0.1273822373253081, -0.034165706315992826, -0.23346668763470166, -0.32942151291328564, -0.10850064168385998, -0.2431263491723752, 0.09903446813685853, -0.16483924668583522, -0.21890669105688862, 0.42423646165090695, 0.19283555155893656, 0.2163702852435802, 0.09324909243610148, 0.26763940648698625, 0.1569240531841244, 0.015192712240509297, 0.03312997912105761, 0.1694390049792434, 0.167184306318839, 0.06790961358459308, -0.2869625825581974, -0.06395850834649122, 0.16235842247975565]
|
1,803.04123
|
Characterization of quark gluon plasma as seen through the energy loss
of heavy quarks
|
The shear viscosity to entropy density ratio ({\eta}/s) of quark gluon plasma
produced in ultra- relativistic heavy-ion collisions has been studied from the
energy loss of heavy quarks in QGP medium. We have also studied the bulk
viscosity to entropy density ratio ({\zeta}/s) and fluidity measure(F) of the
medium using the obtained {\eta}/s values. In addition to that, we have
estimated the heavy quark bound state potential (V) inside this medium. Our
finding of {\eta}/s agrees well with the results obtained by Lattice QCD (LQCD)
and functional renormalization group technique.
|
hep-ph nucl-th
|
the shear viscosity to entropy density ratio etas of quark gluon plasma produced in ultra relativistic heavyion collisions has been studied from the energy loss of heavy quarks in qgp medium we have also studied the bulk viscosity to entropy density ratio zetas and fluidity measuref of the medium using the obtained etas values in addition to that we have estimated the heavy quark bound state potential v inside this medium our finding of etas agrees well with the results obtained by lattice qcd lqcd and functional renormalization group technique
|
[['the', 'shear', 'viscosity', 'to', 'entropy', 'density', 'ratio', 'etas', 'of', 'quark', 'gluon', 'plasma', 'produced', 'in', 'ultra', 'relativistic', 'heavyion', 'collisions', 'has', 'been', 'studied', 'from', 'the', 'energy', 'loss', 'of', 'heavy', 'quarks', 'in', 'qgp', 'medium', 'we', 'have', 'also', 'studied', 'the', 'bulk', 'viscosity', 'to', 'entropy', 'density', 'ratio', 'zetas', 'and', 'fluidity', 'measuref', 'of', 'the', 'medium', 'using', 'the', 'obtained', 'etas', 'values', 'in', 'addition', 'to', 'that', 'we', 'have', 'estimated', 'the', 'heavy', 'quark', 'bound', 'state', 'potential', 'v', 'inside', 'this', 'medium', 'our', 'finding', 'of', 'etas', 'agrees', 'well', 'with', 'the', 'results', 'obtained', 'by', 'lattice', 'qcd', 'lqcd', 'and', 'functional', 'renormalization', 'group', 'technique']]
|
[-0.09965071283291314, 0.25839681045957996, -0.2128770697621231, 0.04575917152871033, 0.019373648370919604, -0.050025989986914265, 0.027426744455450708, 0.3400262143002467, -0.19264436642942803, -0.2505639411216037, -0.030041759099884567, -0.3216685973149672, 0.055423412532179375, 0.08304749282202527, 0.0583342933776171, 0.16819106088313562, 0.05594477169032554, 0.04388869774601098, -0.07243156847230085, -0.24127544383152147, 0.3201244781003072, 0.07390795871510766, 0.2662962076065832, 0.21781388994076112, 0.027102190613997785, -0.018487591163014596, -0.017972534166628057, 0.09611616989995321, -0.19414581033083012, 0.02411684661539889, 0.2391153355089822, -0.006139816711081213, 0.14168736391721734, -0.3808411637300186, -0.2887401808252077, 0.04664138232075264, 0.1083230512488759, 0.07863532559255536, -0.08233258670216866, -0.2084410021165281, 0.08656125581624467, -0.27609063033014536, -0.16397991233892487, -0.08503807488870754, 0.00645410002659211, -0.021108577927846588, -0.30263587638861345, 0.2048403585582757, -0.11184636716733509, -0.0147992202703412, -0.05062283388747091, -0.24149064735373418, -0.08227614991450577, -0.011208697012887242, 0.16728625333543573, 0.1356220156650237, 0.2182127743687355, -0.2325993298403814, -0.01773161597528987, 0.4038226934087076, -0.1164798518496283, -0.12504193200363536, 0.18253970591435104, -0.18788029840529968, -0.09996236256438862, 0.13646244057558812, 0.19061145395710227, 0.10864451470041878, -0.16201918290174577, 0.07653279888072166, -0.0841849184192173, 0.15125242932542657, 0.11856141891539766, 0.06235900019515264, 0.181586561494329, 0.16130770787889703, -0.059307612546751, 0.12118325825372522, -0.045949831479386, -0.05586772063600548, -0.3200843691658438, -0.11218521302746441, -0.20118183819210847, 0.048317278127102285, -0.15451298613235973, -0.12119846065853083, 0.2995207862865724, 0.12305033478488246, 0.21504910198809432, -0.02047375906939001, 0.2736595499412983, 0.1525082177118911, 0.019176863434755904, 0.1582198358465279, 0.3112821042160974, 0.25816424645410246, 0.20201430626715836, -0.3231949949024894, 0.01236517890879696, 0.1717517913549385]
|
1,803.04124
|
Crossed modules of monoids II. Relative crossed modules
|
This is the second part of a series of three strongly related papers in which
three equivalent structures are studied:
- internal categories in categories of monoids; defined in terms of pullbacks
relative to a chosen class of spans
- crossed modules of monoids relative to this class of spans
- simplicial monoids of so-called Moore length 1 relative to this class of
spans.
The most important examples of monoids that are covered are small categories
(treated as monoids in categories of spans) and bimonoids in symmetric monoidal
categories (regarded as monoids in categories of comonoids). In this second
part we define relative crossed modules of monoids and prove their equivalence
with the relative categories of Part I.
|
math.CT math.QA
|
this is the second part of a series of three strongly related papers in which three equivalent structures are studied internal categories in categories of monoids defined in terms of pullbacks relative to a chosen class of spans crossed modules of monoids relative to this class of spans simplicial monoids of socalled moore length 1 relative to this class of spans the most important examples of monoids that are covered are small categories treated as monoids in categories of spans and bimonoids in symmetric monoidal categories regarded as monoids in categories of comonoids in this second part we define relative crossed modules of monoids and prove their equivalence with the relative categories of part i
|
[['this', 'is', 'the', 'second', 'part', 'of', 'a', 'series', 'of', 'three', 'strongly', 'related', 'papers', 'in', 'which', 'three', 'equivalent', 'structures', 'are', 'studied', 'internal', 'categories', 'in', 'categories', 'of', 'monoids', 'defined', 'in', 'terms', 'of', 'pullbacks', 'relative', 'to', 'a', 'chosen', 'class', 'of', 'spans', 'crossed', 'modules', 'of', 'monoids', 'relative', 'to', 'this', 'class', 'of', 'spans', 'simplicial', 'monoids', 'of', 'socalled', 'moore', 'length', '1', 'relative', 'to', 'this', 'class', 'of', 'spans', 'the', 'most', 'important', 'examples', 'of', 'monoids', 'that', 'are', 'covered', 'are', 'small', 'categories', 'treated', 'as', 'monoids', 'in', 'categories', 'of', 'spans', 'and', 'bimonoids', 'in', 'symmetric', 'monoidal', 'categories', 'regarded', 'as', 'monoids', 'in', 'categories', 'of', 'comonoids', 'in', 'this', 'second', 'part', 'we', 'define', 'relative', 'crossed', 'modules', 'of', 'monoids', 'and', 'prove', 'their', 'equivalence', 'with', 'the', 'relative', 'categories', 'of', 'part', 'i']]
|
[-0.1360169969337142, 0.07183151573104703, 0.031752315220301565, 0.09803950567223618, -0.03370151893924112, -0.06065806233648049, -0.07127467633184531, 0.3988204045302194, -0.4120772083138075, -0.22870518489457342, 0.05588830212515819, -0.2433486090892035, -0.06469472645093566, 0.18479452703310095, -0.19119120225634265, -0.13085380514334563, 0.051909147320396226, 0.08471266496521623, -0.07678157866770483, -0.2688933359540027, 0.486183010171289, -0.03457472066030554, 0.23684014512387955, -0.005624298269496016, 0.08402869889674627, -0.05501493323371624, -0.11105644762030115, 0.08871173234251531, -0.11720726919068156, 0.1649783965929047, 0.39985426549354325, 0.05240901595022043, 0.23801097139797134, -0.32054576451039835, -0.06568324928698333, 0.1259598150363435, 0.08623876589674341, 0.004161479039644094, 0.048472926399225125, -0.2921456724283812, 0.09295279660626599, -0.29664694841789163, -0.031215885394941207, -0.0022315076390362304, 0.13874571759901616, 0.08251133641106603, -0.2065729493032331, -0.026165741609166498, 0.12696132978137187, 0.12666586659362783, -0.0898260619673554, -0.11584239573541867, -0.04837506280240157, 0.16283024006077776, -0.006899720683450932, -0.09112784980755785, 0.13198254161068926, -0.14230629916647045, -0.1360049482839911, 0.41665200701226357, -0.044107917301437774, -0.16436970711321286, 0.1938101113287975, -0.14057284613828297, -0.1567995761440176, 0.16134970182876873, 0.04995596805668395, 0.20161058049163091, -0.04754769513788431, 0.12433268007640119, -0.16144641291998002, 0.05833770478366996, 0.1471079128794372, 0.06829244064005173, 0.14560437715490876, 0.1427063955075067, 0.019595377851763497, 0.20865636704408605, 0.05778753968441616, -0.04880298108834288, -0.36399677029770355, -0.1831209749509783, -0.04993521441584048, 0.07285758652926787, -0.010420957620447988, -0.22402667516194608, 0.4132776237376358, 0.13192193840994784, 0.16116109173441226, 0.11002284519313632, 0.1701529382424348, -0.01946722162361054, 0.12810342883002823, -0.02701465823971059, 0.15709956477436682, 0.2699710257968906, 0.007496466605073732, -0.019827711096782562, -0.0007821823672755904, 0.20896162695210913]
|
1,803.04125
|
Innovative Texture Database Collecting Approach and Feature Extraction
Method based on Combination of Gray Tone Difference Matrixes, Local Binary
Patterns,and K-means Clustering
|
Texture analysis and classification are some of the problems which have been
paid much attention by image processing scientists since late 80s. If texture
analysis is done accurately, it can be used in many cases such as object
tracking, visual pattern recognition, and face recognition.Since now, so many
methods are offered to solve this problem. Against their technical differences,
all of them used same popular databases to evaluate their performance such
asBrodatz or Outex, which may be made their performance biased on these
databases. In this paper, an approach is proposed to collect more efficient
databases of texture images. The proposed approach is included two stages. The
first one is developing feature representation based on gray tone difference
matrixes and local binary patterns features and the next one is consisted an
innovative algorithm which is based on K-means clustering to collect images
based on evaluated features. In order to evaluate the performance of the
proposed approach, a texture database is collected and fisher rate is computed
for collected one and well known databases. Also, texture classification is
evaluated based on offered feature extraction and the accuracy is compared by
some state of the art texture classification methods.
|
cs.CV
|
texture analysis and classification are some of the problems which have been paid much attention by image processing scientists since late 80s if texture analysis is done accurately it can be used in many cases such as object tracking visual pattern recognition and face recognitionsince now so many methods are offered to solve this problem against their technical differences all of them used same popular databases to evaluate their performance such asbrodatz or outex which may be made their performance biased on these databases in this paper an approach is proposed to collect more efficient databases of texture images the proposed approach is included two stages the first one is developing feature representation based on gray tone difference matrixes and local binary patterns features and the next one is consisted an innovative algorithm which is based on kmeans clustering to collect images based on evaluated features in order to evaluate the performance of the proposed approach a texture database is collected and fisher rate is computed for collected one and well known databases also texture classification is evaluated based on offered feature extraction and the accuracy is compared by some state of the art texture classification methods
|
[['texture', 'analysis', 'and', 'classification', 'are', 'some', 'of', 'the', 'problems', 'which', 'have', 'been', 'paid', 'much', 'attention', 'by', 'image', 'processing', 'scientists', 'since', 'late', '80s', 'if', 'texture', 'analysis', 'is', 'done', 'accurately', 'it', 'can', 'be', 'used', 'in', 'many', 'cases', 'such', 'as', 'object', 'tracking', 'visual', 'pattern', 'recognition', 'and', 'face', 'recognitionsince', 'now', 'so', 'many', 'methods', 'are', 'offered', 'to', 'solve', 'this', 'problem', 'against', 'their', 'technical', 'differences', 'all', 'of', 'them', 'used', 'same', 'popular', 'databases', 'to', 'evaluate', 'their', 'performance', 'such', 'asbrodatz', 'or', 'outex', 'which', 'may', 'be', 'made', 'their', 'performance', 'biased', 'on', 'these', 'databases', 'in', 'this', 'paper', 'an', 'approach', 'is', 'proposed', 'to', 'collect', 'more', 'efficient', 'databases', 'of', 'texture', 'images', 'the', 'proposed', 'approach', 'is', 'included', 'two', 'stages', 'the', 'first', 'one', 'is', 'developing', 'feature', 'representation', 'based', 'on', 'gray', 'tone', 'difference', 'matrixes', 'and', 'local', 'binary', 'patterns', 'features', 'and', 'the', 'next', 'one', 'is', 'consisted', 'an', 'innovative', 'algorithm', 'which', 'is', 'based', 'on', 'kmeans', 'clustering', 'to', 'collect', 'images', 'based', 'on', 'evaluated', 'features', 'in', 'order', 'to', 'evaluate', 'the', 'performance', 'of', 'the', 'proposed', 'approach', 'a', 'texture', 'database', 'is', 'collected', 'and', 'fisher', 'rate', 'is', 'computed', 'for', 'collected', 'one', 'and', 'well', 'known', 'databases', 'also', 'texture', 'classification', 'is', 'evaluated', 'based', 'on', 'offered', 'feature', 'extraction', 'and', 'the', 'accuracy', 'is', 'compared', 'by', 'some', 'state', 'of', 'the', 'art', 'texture', 'classification', 'methods']]
|
[-0.027185975083818613, -0.02979087100516503, -0.10603369871178307, 0.073365841479375, -0.10064257245558576, -0.14351538888011606, -0.02842002669050812, 0.4380850151193161, -0.24918498079985, -0.3483817515285829, 0.16956100347392167, -0.30458960078465636, -0.1664728211931502, 0.22163402294763962, -0.11005312789422579, 0.10202952609755672, 0.10615538218989969, 0.08013046449408508, -0.050007359846793595, -0.3415692227677657, 0.28967211710062263, 0.0426116915515218, 0.36483650672703216, 0.02413802087569657, 0.08577586281746148, -0.04180212748977236, -0.09004749846047698, -0.0009013859464922019, -0.03684254778334155, 0.16515978494217284, 0.3015323054937956, 0.19748660814231978, 0.2446483280008229, -0.38879531907299775, -0.2041758927110678, 0.09180233887581823, 0.13924726997143946, 0.10122293096620781, -0.07223144415385412, -0.3320097588414613, 0.11478451771470599, -0.14345245436610032, -0.0033411847117046515, -0.14685463596087617, 0.029170869678879777, -0.04013835915292685, -0.24894846346324834, 0.029247148004091846, 0.05072850555312844, 0.07443410036249612, -0.04195046126275347, -0.16465076588046473, 0.021458884045624963, 0.19344486395876187, 0.051447784828428086, 0.028695130101046882, 0.12976460137332863, -0.15668730318526894, -0.13788202093012678, 0.414039137481879, -0.01656221523701858, -0.2104131664424084, 0.21487093796977438, -0.03107818153877862, -0.11979508925802433, 0.10009347651607524, 0.19315410854342657, 0.15962101003298393, -0.18386618818801184, -0.008633158845194161, -0.015514071992574595, 0.19524625606524448, 0.08170307968319274, -0.004256944408496985, 0.19187810693103344, 0.2334158048678476, 0.01058451510153902, 0.13352172415739355, -0.13936536826256019, -0.05097537057665296, -0.1573785345714826, -0.09507752845827967, -0.2324414448890214, -0.06977639012396909, -0.04328878125935518, -0.14478446271700354, 0.4279586755216886, 0.21510580519321731, 0.19887824794516348, -0.008539830065236833, 0.35004291644272134, 0.050640221718006216, 0.1155313721120668, 0.05579162690884028, 0.19242341038263522, 0.03245454854928912, 0.1071076535142194, -0.1593242276292772, 0.10917266192846001, 0.08544625313310789]
|
1,803.04126
|
Laguerre-Gaussian mode sorter
|
Light's spatial properties represent an infinite state space, making it
attractive for applications requiring high dimensionality, such as quantum
mechanics and classical telecommunications, but also inherently spatial
applications such as imaging and sensing. However, there is no demultiplexing
device in the spatial domain comparable to a grating or calcite for the
wavelength and polarisation domains respectively. Specifically, a simple device
capable of splitting a finite beam into a large number of discrete spatially
separated spots each containing a single orthogonal spatial component. We
demonstrate a device capable of decomposing a beam into a Cartesian grid of
identical Gaussian spots each containing a single Laguerre-Gaussian component.
This is the first device capable of decomposing the azimuthal and radial
components simultaneously, and is based on a single spatial light modulator and
mirror. We demonstrate over 210 spatial components, meaning it is also the
highest dimensionality mode multiplexer of any kind.
|
physics.optics
|
lights spatial properties represent an infinite state space making it attractive for applications requiring high dimensionality such as quantum mechanics and classical telecommunications but also inherently spatial applications such as imaging and sensing however there is no demultiplexing device in the spatial domain comparable to a grating or calcite for the wavelength and polarisation domains respectively specifically a simple device capable of splitting a finite beam into a large number of discrete spatially separated spots each containing a single orthogonal spatial component we demonstrate a device capable of decomposing a beam into a cartesian grid of identical gaussian spots each containing a single laguerregaussian component this is the first device capable of decomposing the azimuthal and radial components simultaneously and is based on a single spatial light modulator and mirror we demonstrate over 210 spatial components meaning it is also the highest dimensionality mode multiplexer of any kind
|
[['lights', 'spatial', 'properties', 'represent', 'an', 'infinite', 'state', 'space', 'making', 'it', 'attractive', 'for', 'applications', 'requiring', 'high', 'dimensionality', 'such', 'as', 'quantum', 'mechanics', 'and', 'classical', 'telecommunications', 'but', 'also', 'inherently', 'spatial', 'applications', 'such', 'as', 'imaging', 'and', 'sensing', 'however', 'there', 'is', 'no', 'demultiplexing', 'device', 'in', 'the', 'spatial', 'domain', 'comparable', 'to', 'a', 'grating', 'or', 'calcite', 'for', 'the', 'wavelength', 'and', 'polarisation', 'domains', 'respectively', 'specifically', 'a', 'simple', 'device', 'capable', 'of', 'splitting', 'a', 'finite', 'beam', 'into', 'a', 'large', 'number', 'of', 'discrete', 'spatially', 'separated', 'spots', 'each', 'containing', 'a', 'single', 'orthogonal', 'spatial', 'component', 'we', 'demonstrate', 'a', 'device', 'capable', 'of', 'decomposing', 'a', 'beam', 'into', 'a', 'cartesian', 'grid', 'of', 'identical', 'gaussian', 'spots', 'each', 'containing', 'a', 'single', 'laguerregaussian', 'component', 'this', 'is', 'the', 'first', 'device', 'capable', 'of', 'decomposing', 'the', 'azimuthal', 'and', 'radial', 'components', 'simultaneously', 'and', 'is', 'based', 'on', 'a', 'single', 'spatial', 'light', 'modulator', 'and', 'mirror', 'we', 'demonstrate', 'over', '210', 'spatial', 'components', 'meaning', 'it', 'is', 'also', 'the', 'highest', 'dimensionality', 'mode', 'multiplexer', 'of', 'any', 'kind']]
|
[-0.13433989247061764, 0.14421914412564915, -0.08198188542312868, -0.004508852223217538, -0.0920162572921883, -0.1791211483005837, -0.007765697801447901, 0.44431584010001374, -0.2638780796346632, -0.27860545059917746, 0.08745927818597772, -0.23833308698030542, -0.0926519354216981, 0.21213955649314764, -0.03601917770464678, 0.053214720632043994, 0.04264623918444724, -0.008725115135815498, -0.018528508393698045, -0.14605694806999275, 0.2765661682461615, -0.0038845617964398116, 0.34416242502629757, 0.009759669985804657, 0.21035060414893403, 0.06794170986521184, -0.01826143410761614, 0.023746183224461304, 0.0012374800957135252, 0.11524896515569512, 0.22444417762154764, 0.07844372861389373, 0.26190083015181526, -0.4084924211272517, -0.2661728206455607, 0.09439943574771688, 0.17007790320880106, 0.09699669163170699, -0.05103480943688663, -0.25192585390224753, 0.056390049004442735, -0.11959128810967495, -0.1333852441780068, -0.05217301980844019, 0.02745867467082634, 0.009026511473977636, -0.2721656734104948, 0.010983488896493549, 0.05601269869539711, 0.08982882000556267, -0.025701521259474544, -0.0858009807951119, -0.010273138979902945, 0.0997386826312396, -0.08044961718464824, 7.124827400705701e-05, 0.10960290165668404, -0.11624377490984075, -0.0916967488159866, 0.39233152368231805, -0.0421458980999887, -0.23091782859803453, 0.17981633804644132, -0.13137437638235153, -0.07035108503564638, 0.14763844910870633, 0.16496852924418007, 0.11501420662436332, -0.09685497189796455, 0.019411540417963436, -0.017466140121246712, 0.2744627018975144, 0.12494134272423547, 0.12327439742197434, 0.25828890669839205, 0.19302154550127484, 0.0910212879809134, 0.15233322556092832, -0.1611151238455047, -0.05493531598256448, -0.2679763714015182, -0.17353509262839734, -0.2125410759210747, 0.01973052866240913, -0.11915326256220814, -0.16141421503915981, 0.43148481577156567, 0.06900215227388135, 0.1889305427714528, -0.030849655725162576, 0.3904247506571984, 0.0784249966696685, 0.10935189712452828, 0.05432667279288777, 0.16330230539362575, 0.12500428664183394, 0.1072479220511505, -0.18964379044199312, -0.006900747227985915, -0.028513483770783186]
|
1,803.04127
|
Magnesium isotopes: a tool to understand self-enrichment in Globular
Clusters
|
A critical issue in the asymptotic giant branch (AGB) self-enrichment
scenario for the formation of multiple populations in Globular Clusters (GCs)
is the inability to reproduce the magnesium isotopic ratios, despite the model
in principle can account for the depletion of magnesium. In this work we
analyze how the uncertainties on the various p-capture cross sections affect
the results related to the magnesium content of the ejecta of AGB stars. The
observed distribution of the magnesium isotopes and of the overall Mg-Al trend
in M13 and NGC 6752 are successfully reproduced when the proton-capture rate by
25Mg at the temperatures 100 MK, in particular the 25Mg(p, gamma)26Alm channel,
is enhanced by a factor 3 with respect to the most recent experimental
determinations. This assumption also allows to reproduce the full extent of the
Mg spread and the Mg-Si anticorrelation observed in NGC 2419. The uncertainties
in the rate of the 25Mg(p,gamma)26Alm reaction at the temperatures of interest
here leave space for our assumption and we suggest that new experimental
measurements are needed to settle this problem. We also discuss the competitive
model based on the super massive star nucleosynthesis.
|
astro-ph.SR astro-ph.GA
|
a critical issue in the asymptotic giant branch agb selfenrichment scenario for the formation of multiple populations in globular clusters gcs is the inability to reproduce the magnesium isotopic ratios despite the model in principle can account for the depletion of magnesium in this work we analyze how the uncertainties on the various pcapture cross sections affect the results related to the magnesium content of the ejecta of agb stars the observed distribution of the magnesium isotopes and of the overall mgal trend in m13 and ngc 6752 are successfully reproduced when the protoncapture rate by 25mg at the temperatures 100 mk in particular the 25mgp gamma26alm channel is enhanced by a factor 3 with respect to the most recent experimental determinations this assumption also allows to reproduce the full extent of the mg spread and the mgsi anticorrelation observed in ngc 2419 the uncertainties in the rate of the 25mgpgamma26alm reaction at the temperatures of interest here leave space for our assumption and we suggest that new experimental measurements are needed to settle this problem we also discuss the competitive model based on the super massive star nucleosynthesis
|
[['a', 'critical', 'issue', 'in', 'the', 'asymptotic', 'giant', 'branch', 'agb', 'selfenrichment', 'scenario', 'for', 'the', 'formation', 'of', 'multiple', 'populations', 'in', 'globular', 'clusters', 'gcs', 'is', 'the', 'inability', 'to', 'reproduce', 'the', 'magnesium', 'isotopic', 'ratios', 'despite', 'the', 'model', 'in', 'principle', 'can', 'account', 'for', 'the', 'depletion', 'of', 'magnesium', 'in', 'this', 'work', 'we', 'analyze', 'how', 'the', 'uncertainties', 'on', 'the', 'various', 'pcapture', 'cross', 'sections', 'affect', 'the', 'results', 'related', 'to', 'the', 'magnesium', 'content', 'of', 'the', 'ejecta', 'of', 'agb', 'stars', 'the', 'observed', 'distribution', 'of', 'the', 'magnesium', 'isotopes', 'and', 'of', 'the', 'overall', 'mgal', 'trend', 'in', 'm13', 'and', 'ngc', '6752', 'are', 'successfully', 'reproduced', 'when', 'the', 'protoncapture', 'rate', 'by', '25mg', 'at', 'the', 'temperatures', '100', 'mk', 'in', 'particular', 'the', '25mgp', 'gamma26alm', 'channel', 'is', 'enhanced', 'by', 'a', 'factor', '3', 'with', 'respect', 'to', 'the', 'most', 'recent', 'experimental', 'determinations', 'this', 'assumption', 'also', 'allows', 'to', 'reproduce', 'the', 'full', 'extent', 'of', 'the', 'mg', 'spread', 'and', 'the', 'mgsi', 'anticorrelation', 'observed', 'in', 'ngc', '2419', 'the', 'uncertainties', 'in', 'the', 'rate', 'of', 'the', '25mgpgamma26alm', 'reaction', 'at', 'the', 'temperatures', 'of', 'interest', 'here', 'leave', 'space', 'for', 'our', 'assumption', 'and', 'we', 'suggest', 'that', 'new', 'experimental', 'measurements', 'are', 'needed', 'to', 'settle', 'this', 'problem', 'we', 'also', 'discuss', 'the', 'competitive', 'model', 'based', 'on', 'the', 'super', 'massive', 'star', 'nucleosynthesis']]
|
[-0.038499423017585896, 0.10965147442159487, -0.0574374009425849, 0.0917384465926023, -0.001350811763571944, -0.04048748181654728, 0.07914035759846316, 0.4024856673045592, -0.17323255172045404, -0.33978935295154394, 0.02146194412069206, -0.2885472273198361, -0.05130820422793457, 0.16389911493814405, -0.07522912565021113, -0.0179485454327392, 0.09566723932400047, -0.009076805240574248, -0.04485146164206818, -0.28966167619959876, 0.3177134316168068, 0.07085482632233338, 0.23832514587002882, 0.0586285907824967, -0.0005628134392919069, -0.11546424317128837, -0.0043776253596904445, -0.04913622553769703, -0.16406260822286592, 0.09297268244874898, 0.22652978916717245, 0.12493378077064053, 0.16880025622748676, -0.39695957901683404, -0.20437371072404206, 0.08584732735370171, 0.21490739989791682, 0.0916254926512745, -0.0778939876628213, -0.2271683280366189, 0.0731659762042744, -0.17647021041216857, -0.18322665881574712, 0.03774545562358941, 0.016049806197935886, 0.023794276796699685, -0.24772857465248377, 0.11886996041048309, 0.025820516338721317, 0.06399881457262498, -0.10679840586517993, -0.1676261131925618, -0.04144815786026996, 0.108092285455659, 0.06484535481173166, -0.0058159011453178455, 0.1482764154829503, -0.09692470838544881, -0.01317531467455235, 0.4000728271981293, -0.10112488517079522, -0.04616222767916354, 0.18786251483600896, -0.20505553431171467, -0.21570990975811719, 0.10388526552790069, 0.14773857337142526, 0.11610676422042841, -0.1731365641108546, 0.038036855524107016, -0.011740592534947683, 0.1801694688576468, 0.046980486623693835, 0.04747535895187667, 0.22651563207544187, 0.17300769313422834, -0.01017993579265029, 0.06353621945322994, -0.17011180662744266, -0.08433314153356826, -0.24751748825718503, -0.13123435815416507, -0.06705162475971296, 0.02134248639773179, -0.13856967402974463, -0.10928673818623423, 0.3154110708174341, 0.15193361967035077, 0.23556125600433803, -0.004377048285827439, 0.2820718167001073, 0.07429772382104062, 0.08838115768185892, 0.06866354657147816, 0.3057962364497231, 0.20950363611025527, 0.08676568163499077, -0.3322506723427438, 0.17674955790227448, -0.021161950482516227]
|
1,803.04128
|
A Unified Framework for Oscillatory Integral Transform: When to use
NUFFT or Butterfly Factorization?
|
This paper concerns the fast evaluation of the matvec $g=Kf$ for $K\in
\mathbb{C}^{N\times N}$, which is the discretization of the oscillatory
integral transform $g(x) = \int K(x,\xi) f(\xi)d\xi$ with a kernel function
$K(x,\xi)=\alpha(x,\xi)e^{2\pi\i \Phi(x,\xi)}$, where $\alpha(x,\xi)$ is a
smooth amplitude function, and $\Phi(x,\xi)$ is a piecewise smooth phase
function with $O(1)$ discontinuous points in $x$ and $\xi$. A unified framework
is proposed to compute $Kf$ with $O(N\log N)$ time and memory complexity via
the non-uniform fast Fourier transform (NUFFT) or the butterfly factorization
(BF), together with an $O(N)$ fast algorithm to determine whether NUFFT or BF
is more suitable. This framework works for two cases: 1) explicit formulas for
the amplitude and phase functions are known, 2) only indirect access of the
amplitude and phase functions are available. Especially in the case of indirect
access, our main contributions are: 1) an $O(N\log N)$ algorithm for recovering
the amplitude and phase functions is proposed based on a new low-rank matrix
recovery algorithm, 2) a new stable and nearly optimal BF with amplitude and
phase functions in a form of a low-rank factorization (IBF-MAT) is proposed to
evaluate the matvec $Kf$. Numerical results are provided to demonstrate the
effectiveness of the proposed framework.
|
math.NA
|
this paper concerns the fast evaluation of the matvec gkf for kin mathbbcntimes n which is the discretization of the oscillatory integral transform gx int kxxi fxidxi with a kernel function kxxialphaxxie2pii phixxi where alphaxxi is a smooth amplitude function and phixxi is a piecewise smooth phase function with o1 discontinuous points in x and xi a unified framework is proposed to compute kf with onlog n time and memory complexity via the nonuniform fast fourier transform nufft or the butterfly factorization bf together with an on fast algorithm to determine whether nufft or bf is more suitable this framework works for two cases 1 explicit formulas for the amplitude and phase functions are known 2 only indirect access of the amplitude and phase functions are available especially in the case of indirect access our main contributions are 1 an onlog n algorithm for recovering the amplitude and phase functions is proposed based on a new lowrank matrix recovery algorithm 2 a new stable and nearly optimal bf with amplitude and phase functions in a form of a lowrank factorization ibfmat is proposed to evaluate the matvec kf numerical results are provided to demonstrate the effectiveness of the proposed framework
|
[['this', 'paper', 'concerns', 'the', 'fast', 'evaluation', 'of', 'the', 'matvec', 'gkf', 'for', 'kin', 'mathbbcntimes', 'n', 'which', 'is', 'the', 'discretization', 'of', 'the', 'oscillatory', 'integral', 'transform', 'gx', 'int', 'kxxi', 'fxidxi', 'with', 'a', 'kernel', 'function', 'kxxialphaxxie2pii', 'phixxi', 'where', 'alphaxxi', 'is', 'a', 'smooth', 'amplitude', 'function', 'and', 'phixxi', 'is', 'a', 'piecewise', 'smooth', 'phase', 'function', 'with', 'o1', 'discontinuous', 'points', 'in', 'x', 'and', 'xi', 'a', 'unified', 'framework', 'is', 'proposed', 'to', 'compute', 'kf', 'with', 'onlog', 'n', 'time', 'and', 'memory', 'complexity', 'via', 'the', 'nonuniform', 'fast', 'fourier', 'transform', 'nufft', 'or', 'the', 'butterfly', 'factorization', 'bf', 'together', 'with', 'an', 'on', 'fast', 'algorithm', 'to', 'determine', 'whether', 'nufft', 'or', 'bf', 'is', 'more', 'suitable', 'this', 'framework', 'works', 'for', 'two', 'cases', '1', 'explicit', 'formulas', 'for', 'the', 'amplitude', 'and', 'phase', 'functions', 'are', 'known', '2', 'only', 'indirect', 'access', 'of', 'the', 'amplitude', 'and', 'phase', 'functions', 'are', 'available', 'especially', 'in', 'the', 'case', 'of', 'indirect', 'access', 'our', 'main', 'contributions', 'are', '1', 'an', 'onlog', 'n', 'algorithm', 'for', 'recovering', 'the', 'amplitude', 'and', 'phase', 'functions', 'is', 'proposed', 'based', 'on', 'a', 'new', 'lowrank', 'matrix', 'recovery', 'algorithm', '2', 'a', 'new', 'stable', 'and', 'nearly', 'optimal', 'bf', 'with', 'amplitude', 'and', 'phase', 'functions', 'in', 'a', 'form', 'of', 'a', 'lowrank', 'factorization', 'ibfmat', 'is', 'proposed', 'to', 'evaluate', 'the', 'matvec', 'kf', 'numerical', 'results', 'are', 'provided', 'to', 'demonstrate', 'the', 'effectiveness', 'of', 'the', 'proposed', 'framework']]
|
[-0.14142385378229216, 0.0679684562192191, -0.0852107573658801, 0.03797111580064759, -0.07019782596602081, -0.13850759561054218, 0.031109548929051902, 0.3909332704467651, -0.2674015243489964, -0.23725177300855135, 0.1238177274288132, -0.23161718987931426, -0.20480614425077176, 0.19118387697933195, -0.03364698587855599, 0.08611995332325116, 0.014615127003680055, 0.0218584360793615, -0.10524293549645405, -0.23729682913861977, 0.2665684618437901, 0.01177569867995305, 0.24468642029051596, 0.01695313591701098, 0.10736240720949494, 0.012642508266398157, -0.04637560398580554, -0.0504737639763241, -0.08655730665016632, 0.07155376661879322, 0.24333078440947412, 0.13445249996983852, 0.24676832486755954, -0.38723352431104735, -0.15192831422626532, 0.11353116289366227, 0.14133330640884545, 0.042446780549242905, -0.031792918212177494, -0.2718334767334641, 0.1083699372716439, -0.12033058415907316, -0.08875852364058702, -0.12079673173646323, 0.0615390347985503, 0.017198401240584176, -0.38386793683927795, 0.05432782829858554, 0.04163029003315247, -0.004468344658231124, -0.039747667553810734, -0.15371794398300923, 0.0640043322629749, 0.062154825982183984, 0.008215424909184758, 0.12856379848761626, 0.053890299069910094, -0.09567892970841897, -0.08031467826296695, 0.32962410400311154, -0.05491715830822404, -0.226360817387318, 0.1399032135040332, -0.11912802991290124, -0.10293056990187137, 0.16856290485996467, 0.17165235960139677, 0.15390877029037653, -0.08711488338617178, 0.15079004507368574, -0.03312639302263657, 0.1900689204175694, 0.04107240825795974, 0.007404522180485611, 0.0720462433134134, 0.13367986380098723, 0.07715097458209269, 0.1247662591162878, -0.08586405374539587, -0.08167278566994728, -0.31751893070430903, -0.15753578360741718, -0.23254177324139538, -0.008058276779663105, -0.13190764166737118, -0.18533201821817039, 0.4004723425130718, 0.08042770178797536, 0.21296260946263104, 0.10359270024674538, 0.3270846399359214, 0.14253616539152483, 0.0027144935805923664, 0.13211352750181388, 0.1428722768598117, 0.12487053374807613, 0.08091471027329158, -0.19895392239619142, 0.04665045817502034, 0.12137169169309811]
|
1,803.04129
|
Are Donation Badges Appealing? A Case Study of Developer Responses to
Eclipse Bug Reports
|
Eclipse, an open source software project, acknowledges its donors by
presenting donation badges in its issue tracking system Bugzilla. However, the
rewarding effect of this strategy is currently unknown. We applied a framework
of causal inference to investigate relative promptness of developer response to
bug reports with donation badges compared with bug reports without the badges,
and estimated that donation badges decreases developer response time by a
median time of about two hours. The appearance of donation badges is appealing
for both donors and organizers because of its practical, rewarding and yet
inexpensive effect.
|
cs.SE cs.CY
|
eclipse an open source software project acknowledges its donors by presenting donation badges in its issue tracking system bugzilla however the rewarding effect of this strategy is currently unknown we applied a framework of causal inference to investigate relative promptness of developer response to bug reports with donation badges compared with bug reports without the badges and estimated that donation badges decreases developer response time by a median time of about two hours the appearance of donation badges is appealing for both donors and organizers because of its practical rewarding and yet inexpensive effect
|
[['eclipse', 'an', 'open', 'source', 'software', 'project', 'acknowledges', 'its', 'donors', 'by', 'presenting', 'donation', 'badges', 'in', 'its', 'issue', 'tracking', 'system', 'bugzilla', 'however', 'the', 'rewarding', 'effect', 'of', 'this', 'strategy', 'is', 'currently', 'unknown', 'we', 'applied', 'a', 'framework', 'of', 'causal', 'inference', 'to', 'investigate', 'relative', 'promptness', 'of', 'developer', 'response', 'to', 'bug', 'reports', 'with', 'donation', 'badges', 'compared', 'with', 'bug', 'reports', 'without', 'the', 'badges', 'and', 'estimated', 'that', 'donation', 'badges', 'decreases', 'developer', 'response', 'time', 'by', 'a', 'median', 'time', 'of', 'about', 'two', 'hours', 'the', 'appearance', 'of', 'donation', 'badges', 'is', 'appealing', 'for', 'both', 'donors', 'and', 'organizers', 'because', 'of', 'its', 'practical', 'rewarding', 'and', 'yet', 'inexpensive', 'effect']]
|
[-0.11439783970746113, 0.032652583692942376, -0.04252214546343257, 0.04968553795999391, -0.12478673929705265, -0.2136419308025073, 0.13394195459624555, 0.42414459316654407, -0.20251782652624745, -0.39929124880879324, 0.11479008068860647, -0.35330297545767686, -0.11088257790307832, 0.15061006033198632, -0.15080027768210053, 0.014011179971969389, 0.09912358684108612, 0.03534482503458461, -0.017387422206662992, -0.3058043848252558, 0.24586387974348792, 0.13166938117764732, 0.2552842184618868, 0.08394843446923063, 0.08328783154943363, 0.047074735434626806, -0.07639880753815809, -0.04274080600589514, -0.03159559172111566, 0.09736762833880618, 0.30242038609341104, 0.1908660580274374, 0.3822183725919495, -0.405423603476362, -0.10953518388634349, 0.0073737140417970875, 0.08850310120652331, 0.09414746437192043, -0.07490003462187311, -0.3232556979191747, 0.05507209987696657, -0.24051241305200977, -0.09886039215501675, -0.011992900917167836, 0.04880518787738649, -0.0534170284096964, -0.19038913794297804, 0.03193573182092068, 0.00837342240985426, 0.13173753690925685, -0.07984612256343021, -0.1312554333138557, -0.007287148921255102, 0.20859842847517512, 0.11492209028492266, 0.02968083924930939, 0.1917408053971272, -0.1397823192243603, -0.14335866862947635, 0.3532939179641928, -0.008388524099768318, -0.11084190966125498, 0.17767894125365197, -0.056034019786587105, -0.08675813073530159, 0.13198540759015273, 0.1768558402954442, 0.12127120436189022, -0.23601918437324979, -0.009838340597777093, 0.04186374077850834, 0.2394359799540364, 0.037797658020590846, 0.007969475643550779, 0.21665270384797392, 0.22334544933301972, 0.04055171156738033, 0.11511165899363288, -0.05906173080562594, -0.02877627965558241, -0.17229040563502845, -0.15992751082980095, -0.12271410802953896, 0.04477153423965532, -0.014172459952068821, -0.15806491827552624, 0.37076172267304774, 0.21671858049453574, 0.08104182713407468, 0.024161440389666784, 0.337987649155424, 0.023232914244835364, 0.06722289896966453, 0.060987686862217935, 0.15192024417697114, -0.020336724364476158, 0.13896657668172996, -0.26230226048922284, 0.2260952665460633, -0.0495097686318641]
|
1,803.0413
|
Derivation and analysis of the nonlinear boundary conditions at the
deformable interface between two fluids
|
The boundary conditions at the deformable interface between two contacting
fluids are derived for the general case of the large-amplitude perturbations.
The interface is modeled as perturbed free boundary that evolves in time, and
the non-linear description is performed and analyzed in a wide range of
physical situations. The differential equations of the interfacial motion thus
obtained may be useful in research of the non-linear development of the
classical hydrodynamic instabilities. They should play an important role in the
understanding of the hydrodynamic phenomena associated with the flows involving
complex interfacial evolution including parametric control of the boundaries in
continua (for example, with electromagnetic field or/and vibration).
|
physics.flu-dyn
|
the boundary conditions at the deformable interface between two contacting fluids are derived for the general case of the largeamplitude perturbations the interface is modeled as perturbed free boundary that evolves in time and the nonlinear description is performed and analyzed in a wide range of physical situations the differential equations of the interfacial motion thus obtained may be useful in research of the nonlinear development of the classical hydrodynamic instabilities they should play an important role in the understanding of the hydrodynamic phenomena associated with the flows involving complex interfacial evolution including parametric control of the boundaries in continua for example with electromagnetic field orand vibration
|
[['the', 'boundary', 'conditions', 'at', 'the', 'deformable', 'interface', 'between', 'two', 'contacting', 'fluids', 'are', 'derived', 'for', 'the', 'general', 'case', 'of', 'the', 'largeamplitude', 'perturbations', 'the', 'interface', 'is', 'modeled', 'as', 'perturbed', 'free', 'boundary', 'that', 'evolves', 'in', 'time', 'and', 'the', 'nonlinear', 'description', 'is', 'performed', 'and', 'analyzed', 'in', 'a', 'wide', 'range', 'of', 'physical', 'situations', 'the', 'differential', 'equations', 'of', 'the', 'interfacial', 'motion', 'thus', 'obtained', 'may', 'be', 'useful', 'in', 'research', 'of', 'the', 'nonlinear', 'development', 'of', 'the', 'classical', 'hydrodynamic', 'instabilities', 'they', 'should', 'play', 'an', 'important', 'role', 'in', 'the', 'understanding', 'of', 'the', 'hydrodynamic', 'phenomena', 'associated', 'with', 'the', 'flows', 'involving', 'complex', 'interfacial', 'evolution', 'including', 'parametric', 'control', 'of', 'the', 'boundaries', 'in', 'continua', 'for', 'example', 'with', 'electromagnetic', 'field', 'orand', 'vibration']]
|
[-0.18163838220986528, 0.15310807994071277, -0.07906100393553639, 0.045494463984532475, -0.04956224708487149, -0.11222324403281385, -0.09641940583622902, 0.3178804018230082, -0.28768643765997526, -0.3028229688616278, 0.10775154214526449, -0.21893319920555793, -0.15491015638146444, 0.23329205008519588, -0.006624643368837989, 0.0647123645312179, 0.04535631052322825, -0.008793051163100194, -0.027911893652956585, -0.12910666803842427, 0.33030087605040415, 0.03215433543147606, 0.2516155549647095, 0.04415562546106978, 0.06911396190837443, 0.015771828739790716, -0.02983955672080411, 0.05916753608138283, -0.15488880322888443, 0.08403505758321453, 0.2821104501935199, 0.0003049027601204743, 0.2605394394023814, -0.5010024404901767, -0.2746731250190011, 0.028965571285965285, 0.13237437231152832, 0.11807260191433619, -0.050126260207426325, -0.263408838368726, 0.018721910968213996, -0.09538905601078104, -0.1787013252674837, -0.021931717368103912, 0.021274136693791322, 0.050781502262210454, -0.2600828766100387, 0.11382963549058502, 0.07727536825826566, 0.07875412246908679, -0.12601093905673266, -0.05906369503496093, -0.08262554839444912, 0.1698990995717174, 0.046696406564997316, -0.033595389452606234, 0.1574521025242371, -0.2069457960271529, -0.053526265041850436, 0.4247317685300667, -0.05196831967229041, -0.22218955605765195, 0.24744590447353912, -0.1327765825787716, -0.07579817279964407, 0.15376219214767078, 0.21521839459000208, 0.11630015150495918, -0.16264563979946564, 0.05375052529722278, 0.017722814697195628, 0.10609157577975192, 0.05710027343811137, 0.013726028830256904, 0.23019774485309827, 0.1760446168395264, 0.018096582537569177, 0.15120950842898548, -0.04904952278484756, -0.14459292279669544, -0.3513252158588338, -0.14524182857005535, -0.10180799403689175, 0.019422687137788858, -0.09295446928832615, -0.1969474156639565, 0.36388925620502677, 0.11694562189535578, 0.1403566708910131, -0.05382667565457175, 0.2362299683616958, 0.14698583349829245, 0.02811603311875783, 0.04888445060160533, 0.2815695411447331, 0.15074060940418707, 0.13268683258896677, -0.263826500328484, 0.07071378301811691, 0.04536214616001697]
|
1,803.04131
|
S-matrix and productions amplitudes in high energy QCD
|
In this note we discuss a generalization of the Lipatov's effective action
approach, \cite{LipatovEff,LipatovEff1}, for the case of description of gluon
and quark production amplitudes in the quasi-multi-Regge kinematics. Following
to \cite{Faddeev}, we define the S-matrix elements of high energy QCD processes
in this kinematics and discuss applications of the obtained results.
|
hep-th hep-ph
|
in this note we discuss a generalization of the lipatovs effective action approach citelipatovefflipatoveff1 for the case of description of gluon and quark production amplitudes in the quasimultiregge kinematics following to citefaddeev we define the smatrix elements of high energy qcd processes in this kinematics and discuss applications of the obtained results
|
[['in', 'this', 'note', 'we', 'discuss', 'a', 'generalization', 'of', 'the', 'lipatovs', 'effective', 'action', 'approach', 'citelipatovefflipatoveff1', 'for', 'the', 'case', 'of', 'description', 'of', 'gluon', 'and', 'quark', 'production', 'amplitudes', 'in', 'the', 'quasimultiregge', 'kinematics', 'following', 'to', 'citefaddeev', 'we', 'define', 'the', 'smatrix', 'elements', 'of', 'high', 'energy', 'qcd', 'processes', 'in', 'this', 'kinematics', 'and', 'discuss', 'applications', 'of', 'the', 'obtained', 'results']]
|
[-0.08228758833836763, 0.1442027697432786, -0.14166529853828252, 0.11329251751769334, 0.0065642368979752065, 0.008480268237181008, 0.04462184932082892, 0.3520787450671196, -0.19059447520412504, -0.22075197091326118, -0.009792034297715873, -0.24659642025828363, -0.10667282655835152, 0.13399587066844107, -0.038931400272995235, 0.03737632254138589, 0.08796141929924488, 0.041557926014065744, -0.09899096734821797, -0.2058229134604335, 0.3604402079991996, 0.019657001933082938, 0.20761555882170796, 0.169388408344239, 0.1099233841150999, 0.06818093992304057, -0.09437889956287109, -0.046607477627694606, -0.14104660557582974, 0.15569057010114193, 0.2371814815455582, 0.09629301967099309, 0.10750300418585539, -0.3717127740383148, -0.15790575289633124, 0.05649142734706402, 0.1467334338556975, 0.13634212255477907, -0.02114206984639168, -0.2244616370042786, 0.07893915701657533, -0.22872568460181356, -0.226838444750756, -0.0830394174810499, 0.015845276406034826, -0.04279549699276686, -0.29633645377121864, 0.0362832015164895, 0.009111916031688452, 0.022186566504242364, -0.05355308586265892, -0.14162909458391368, 0.022783470209687948, 0.07251624549739062, 0.08394540280103684, 0.03329616104252636, 0.1296097625605762, -0.25068232079967856, -0.14450896123424173, 0.421735831531696, -0.06534776677377523, -0.17773475915193557, 0.1831220328528434, -0.20037430849391968, -0.20882306354120372, 0.05348502350971103, 0.2066112600872293, 0.13804762116633357, -0.19554897401481866, 0.13783282723044976, -0.008929392704740167, 0.06680808012082708, 0.09386637033894658, 0.08428790119476616, 0.16055031575262546, 0.1796577817760408, -0.055149495266377926, 0.13686802736017853, -0.041361633073538545, -0.08811205698177219, -0.4130744235217571, -0.1629080612398684, -0.07227362070232629, 0.05428573066368699, -0.10454934674256947, -0.13115008945576848, 0.4011399786826223, 0.19140405951067804, 0.23720744610298425, 0.04170668762177229, 0.30276695170905443, 0.16286277305334806, 0.025645088213495912, 0.049856472592800856, 0.24143947455100714, 0.201939502581954, 0.12490040354430676, -0.2714967888430692, -0.0521718168258667, 0.1423635412566364]
|
1,803.04132
|
Axial $U(1)$ anomaly in a gravitational field via the gradient flow
|
A regularization-independent universal formula for the energy--momentum
tensor in gauge theory in the flat spacetime can be written down by employing
the so-called Yang--Mills gradient flow. We examine a possible use of the
formula in the calculation of the axial $U(1)$ anomaly in a gravitational
field, the anomaly first obtained by Toshiei Kimura [Prog.\ Theor.\ Phys.\ {\bf
42}, 1191 (1969)]. As a general argument indicates, the formula reproduces the
correct non-local structure of the (axial $U(1)$ current)--(energy--momentum
tensor)--(energy--momentum tensor) triangle diagram in a way that is consistent
with the axial $U(1)$ anomaly. On the other hand, the formula does not
automatically reproduce the general coordinate (or translation) Ward--Takahashi
relation, requiring corrections by local counterterms. This analysis thus
illustrates the fact that the universal formula as it stands can be used only
in on-shell correlation functions, in which the energy--momentum tensor does
not coincide with other composite operators in coordinate space.
|
hep-th gr-qc hep-lat
|
a regularizationindependent universal formula for the energymomentum tensor in gauge theory in the flat spacetime can be written down by employing the socalled yangmills gradient flow we examine a possible use of the formula in the calculation of the axial u1 anomaly in a gravitational field the anomaly first obtained by toshiei kimura prog theor phys bf 42 1191 1969 as a general argument indicates the formula reproduces the correct nonlocal structure of the axial u1 currentenergymomentum tensorenergymomentum tensor triangle diagram in a way that is consistent with the axial u1 anomaly on the other hand the formula does not automatically reproduce the general coordinate or translation wardtakahashi relation requiring corrections by local counterterms this analysis thus illustrates the fact that the universal formula as it stands can be used only in onshell correlation functions in which the energymomentum tensor does not coincide with other composite operators in coordinate space
|
[['a', 'regularizationindependent', 'universal', 'formula', 'for', 'the', 'energymomentum', 'tensor', 'in', 'gauge', 'theory', 'in', 'the', 'flat', 'spacetime', 'can', 'be', 'written', 'down', 'by', 'employing', 'the', 'socalled', 'yangmills', 'gradient', 'flow', 'we', 'examine', 'a', 'possible', 'use', 'of', 'the', 'formula', 'in', 'the', 'calculation', 'of', 'the', 'axial', 'u1', 'anomaly', 'in', 'a', 'gravitational', 'field', 'the', 'anomaly', 'first', 'obtained', 'by', 'toshiei', 'kimura', 'prog', 'theor', 'phys', 'bf', '42', '1191', '1969', 'as', 'a', 'general', 'argument', 'indicates', 'the', 'formula', 'reproduces', 'the', 'correct', 'nonlocal', 'structure', 'of', 'the', 'axial', 'u1', 'currentenergymomentum', 'tensorenergymomentum', 'tensor', 'triangle', 'diagram', 'in', 'a', 'way', 'that', 'is', 'consistent', 'with', 'the', 'axial', 'u1', 'anomaly', 'on', 'the', 'other', 'hand', 'the', 'formula', 'does', 'not', 'automatically', 'reproduce', 'the', 'general', 'coordinate', 'or', 'translation', 'wardtakahashi', 'relation', 'requiring', 'corrections', 'by', 'local', 'counterterms', 'this', 'analysis', 'thus', 'illustrates', 'the', 'fact', 'that', 'the', 'universal', 'formula', 'as', 'it', 'stands', 'can', 'be', 'used', 'only', 'in', 'onshell', 'correlation', 'functions', 'in', 'which', 'the', 'energymomentum', 'tensor', 'does', 'not', 'coincide', 'with', 'other', 'composite', 'operators', 'in', 'coordinate', 'space']]
|
[-0.13410464220927382, 0.11403224465506924, -0.10799768302774969, 0.08056061631258653, -0.12702376250697134, -0.1374617094098001, 0.004239800736960658, 0.305021889273356, -0.19038673183646332, -0.2665420381604143, 0.04404292071909726, -0.2365594079565941, -0.17755678101098457, 0.12355226106453865, -0.04983988120442345, 0.011653051166763517, -0.02783317191266537, 0.05747929244495447, -0.14352881619477087, -0.18636308083877753, 0.2834629710465923, 0.014439756928176499, 0.2994774132270087, 0.07982017103658647, 0.10601342746949925, 0.044597858024545675, -0.05094113269009862, 0.02933884712888821, -0.08079730963849599, 0.05893718624221427, 0.2068035686547, 0.07856548413773681, 0.12973513292167715, -0.4032092143458371, -0.17831763761517191, 0.08708510046736115, 0.13679031562060118, 0.13684011269028165, 0.017600145144229692, -0.2709080170155788, 0.06408290592256655, -0.2153390533430185, -0.1709459485576431, -0.12533039226494477, 0.0153941344224284, -0.06450674886542822, -0.2580929147827971, 0.15622430261807377, 0.06321314738771948, 0.03940542416526702, -0.06546226671942808, -0.08918194924829667, -0.048575434995320986, 0.054594578860536674, 0.09316713469844236, 0.1167585621777998, 0.13301182729762276, -0.1516497976647145, -0.09649708259139578, 0.3922929798829414, -0.13455459533853625, -0.2492754191023988, 0.08049395428748712, -0.13929844906729438, -0.16131695812301977, 0.0783820440200772, 0.055294022896979635, 0.14172527703399562, -0.19198145073732412, 0.18118440250543003, -0.09141417120767086, 0.11237619683577292, 0.0861221548442279, -0.024460491172329454, 0.18916614473398244, 0.016007372026084637, 0.017525258076497588, 0.10955148963115122, -0.0003544806334867972, -0.10621803823017459, -0.4179029024529214, -0.19512689545383158, -0.18515470242571264, 0.08278371065282453, -0.10583374537780982, -0.14587378067433276, 0.3463163874428846, 0.1245615370508258, 0.17177765854582078, 0.053058643902170466, 0.2511436845980534, 0.13843872708578905, 0.16817690431438134, 0.09642006122652873, 0.26933006348633237, 0.18097816630057534, 0.11235747231664706, -0.24179975665016037, -0.003249569617839036, 0.17844403065031483]
|
1,803.04133
|
Type-I and type-II Nodal Lines Coexistence in the Antiferromagnetic
monolayer CrAs$_{2}$
|
Topological nodal line semimetals, hosting one-dimensional Fermi lines with
symmetry protection, has become a hot topic in topological quantum matter. Due
to the breaking of time reversal symmetry in magnetic system, nodal lines
require protection by additional symmetries. Here, we report the discovery of
antiferromagnetic type-I and type-II nodal lines coexist in the monolayer
CrAs$_{2}$ based on a systematic first-principles calculation. Remarkably, the
type-I nodal line in CrAs$_{2}$ form a concentric loop centered around the
$\Gamma$ point is filling-enforced by nonsymmorphic analogue symmetry and
robust against spin-orbital coupling. The type-II nodal lines, a kind of open
nodal lines appear around the Fermi level, are protected by the mirror symmetry
in the absence of spin-orbital coupling. The antiferromagnetic monolayer
CrAs$_{2}$ proposed here may provide a platform for the correlation between
magnetism and exotic topological phases.
|
cond-mat.mtrl-sci
|
topological nodal line semimetals hosting onedimensional fermi lines with symmetry protection has become a hot topic in topological quantum matter due to the breaking of time reversal symmetry in magnetic system nodal lines require protection by additional symmetries here we report the discovery of antiferromagnetic typei and typeii nodal lines coexist in the monolayer cras_2 based on a systematic firstprinciples calculation remarkably the typei nodal line in cras_2 form a concentric loop centered around the gamma point is fillingenforced by nonsymmorphic analogue symmetry and robust against spinorbital coupling the typeii nodal lines a kind of open nodal lines appear around the fermi level are protected by the mirror symmetry in the absence of spinorbital coupling the antiferromagnetic monolayer cras_2 proposed here may provide a platform for the correlation between magnetism and exotic topological phases
|
[['topological', 'nodal', 'line', 'semimetals', 'hosting', 'onedimensional', 'fermi', 'lines', 'with', 'symmetry', 'protection', 'has', 'become', 'a', 'hot', 'topic', 'in', 'topological', 'quantum', 'matter', 'due', 'to', 'the', 'breaking', 'of', 'time', 'reversal', 'symmetry', 'in', 'magnetic', 'system', 'nodal', 'lines', 'require', 'protection', 'by', 'additional', 'symmetries', 'here', 'we', 'report', 'the', 'discovery', 'of', 'antiferromagnetic', 'typei', 'and', 'typeii', 'nodal', 'lines', 'coexist', 'in', 'the', 'monolayer', 'cras_2', 'based', 'on', 'a', 'systematic', 'firstprinciples', 'calculation', 'remarkably', 'the', 'typei', 'nodal', 'line', 'in', 'cras_2', 'form', 'a', 'concentric', 'loop', 'centered', 'around', 'the', 'gamma', 'point', 'is', 'fillingenforced', 'by', 'nonsymmorphic', 'analogue', 'symmetry', 'and', 'robust', 'against', 'spinorbital', 'coupling', 'the', 'typeii', 'nodal', 'lines', 'a', 'kind', 'of', 'open', 'nodal', 'lines', 'appear', 'around', 'the', 'fermi', 'level', 'are', 'protected', 'by', 'the', 'mirror', 'symmetry', 'in', 'the', 'absence', 'of', 'spinorbital', 'coupling', 'the', 'antiferromagnetic', 'monolayer', 'cras_2', 'proposed', 'here', 'may', 'provide', 'a', 'platform', 'for', 'the', 'correlation', 'between', 'magnetism', 'and', 'exotic', 'topological', 'phases']]
|
[-0.2985684312949541, 0.1797861004762574, -0.004085857733917325, 0.04257622406554735, -0.10294559030140292, -0.22619428999596902, 0.15444769243077278, 0.3614696998187383, -0.208415465832535, -0.26455296500961284, 0.027281744967722125, -0.3393182119166951, -0.10348326254483145, 0.12225312927612729, 0.056759746717428096, 0.013181695193330298, -0.09258561827930441, -0.07367441079161414, -0.13640533815096342, -0.172630657438439, 0.3416373554978575, -0.02247205465326586, 0.3533371149478897, 0.0704510170938586, -0.05416602973214615, -0.052136371728839045, 0.1075022416849579, -0.010170092300595299, -0.10307937233583696, 0.08685043155747368, 0.23034674982165002, -0.1235121233117725, 0.15431700272958226, -0.434962586638754, -0.2091696770330057, 0.018759947329231384, 0.15824379679597497, 0.13223818986183172, -0.12642553200295417, -0.3660239166399436, 0.042105898499982294, -0.1314018119765974, -0.2028988672380419, -0.10112088551022001, -0.03906717042285782, -0.08010125470194798, -0.14104449464665872, 0.0906417068413723, 0.06404691153039127, 0.17248153828480628, -0.05110515846259225, -0.03181983288568653, -0.1571496563595233, -0.004799860348897194, 0.06534182047645158, -0.0020371914288261905, 0.07800992875040244, -0.09375688017332065, -0.19235455269409246, 0.4253634715577893, -0.04701025433553411, -0.09505533231005295, 0.12721987835430443, -0.1334752920345419, -0.16640491571986296, 0.19965369535832486, 0.1249488668217421, 0.05740594246021625, -0.06403936257363478, 0.12018083614417102, -0.049970739708089185, 0.12033504491790073, -0.00229360939285009, 0.10066952925946897, 0.3734293650390942, 0.1350456097740124, 0.06998080526714895, 0.12047521089188018, -0.18615929249833935, -0.10494411617705125, -0.2968974265812048, -0.17500581942262378, -0.21839332486739133, 0.06337529275072877, -0.01949449907477907, -0.2190461189055176, 0.4403516030296989, 0.08727775838698691, 0.1824290193617344, -0.11297635997318899, 0.20918881135937104, 0.08072373521889546, 0.09035462419043726, 0.07381370151762975, 0.25725596689674723, 0.11912458918731549, 0.04932354436752928, -0.2892225391036873, 0.044101586881173604, 0.07320109642903085]
|
1,803.04134
|
Diagnostics for generalized power-law torsion-matter coupling $f(T)$
model
|
The currently accelerated expansion of our Universe is unarguably one of the
most intriguing problems in today's physics research. Two realistic non-minimal
torsion-matter coupling $f(T)$ models have been established and studied in our
previous papers [Phys. Rev. D92, 104038(2015) and Eur. Phys. J. C77, 504(2017)]
aiming to explain this "dark energy" problem. In this paper, we study the
generalized power-law torsion-matter coupling $f(T)$ model. Dynamical system
analysis shows that the three expansion phases of the Universe, i.e. the
radiation dominated era, the matter dominated era and the dark energy dominated
era, can all be reproduced in this generalized model. By using the statefinder
and $Om$ diagnostics, we find that the different cases of the model can be
distinguished from each other and from other dark energy models such as the two
models in our previous papers, $\Lambda$CDM, quintessence and Chaplygin gas.
Furthermore, the analyses also show that all kinds of generalized power-law
torsion-matter coupling model are able to cross the $w=-1$ divide from below to
above, thus the decrease of the energy density resulting from the crossing of
$w$ will make the catastrophic fate of the Universe avoided and a de Sitter
expansion fate in the future will be approached.
|
gr-qc astro-ph.CO
|
the currently accelerated expansion of our universe is unarguably one of the most intriguing problems in todays physics research two realistic nonminimal torsionmatter coupling ft models have been established and studied in our previous papers phys rev d92 1040382015 and eur phys j c77 5042017 aiming to explain this dark energy problem in this paper we study the generalized powerlaw torsionmatter coupling ft model dynamical system analysis shows that the three expansion phases of the universe ie the radiation dominated era the matter dominated era and the dark energy dominated era can all be reproduced in this generalized model by using the statefinder and om diagnostics we find that the different cases of the model can be distinguished from each other and from other dark energy models such as the two models in our previous papers lambdacdm quintessence and chaplygin gas furthermore the analyses also show that all kinds of generalized powerlaw torsionmatter coupling model are able to cross the w1 divide from below to above thus the decrease of the energy density resulting from the crossing of w will make the catastrophic fate of the universe avoided and a de sitter expansion fate in the future will be approached
|
[['the', 'currently', 'accelerated', 'expansion', 'of', 'our', 'universe', 'is', 'unarguably', 'one', 'of', 'the', 'most', 'intriguing', 'problems', 'in', 'todays', 'physics', 'research', 'two', 'realistic', 'nonminimal', 'torsionmatter', 'coupling', 'ft', 'models', 'have', 'been', 'established', 'and', 'studied', 'in', 'our', 'previous', 'papers', 'phys', 'rev', 'd92', '1040382015', 'and', 'eur', 'phys', 'j', 'c77', '5042017', 'aiming', 'to', 'explain', 'this', 'dark', 'energy', 'problem', 'in', 'this', 'paper', 'we', 'study', 'the', 'generalized', 'powerlaw', 'torsionmatter', 'coupling', 'ft', 'model', 'dynamical', 'system', 'analysis', 'shows', 'that', 'the', 'three', 'expansion', 'phases', 'of', 'the', 'universe', 'ie', 'the', 'radiation', 'dominated', 'era', 'the', 'matter', 'dominated', 'era', 'and', 'the', 'dark', 'energy', 'dominated', 'era', 'can', 'all', 'be', 'reproduced', 'in', 'this', 'generalized', 'model', 'by', 'using', 'the', 'statefinder', 'and', 'om', 'diagnostics', 'we', 'find', 'that', 'the', 'different', 'cases', 'of', 'the', 'model', 'can', 'be', 'distinguished', 'from', 'each', 'other', 'and', 'from', 'other', 'dark', 'energy', 'models', 'such', 'as', 'the', 'two', 'models', 'in', 'our', 'previous', 'papers', 'lambdacdm', 'quintessence', 'and', 'chaplygin', 'gas', 'furthermore', 'the', 'analyses', 'also', 'show', 'that', 'all', 'kinds', 'of', 'generalized', 'powerlaw', 'torsionmatter', 'coupling', 'model', 'are', 'able', 'to', 'cross', 'the', 'w1', 'divide', 'from', 'below', 'to', 'above', 'thus', 'the', 'decrease', 'of', 'the', 'energy', 'density', 'resulting', 'from', 'the', 'crossing', 'of', 'w', 'will', 'make', 'the', 'catastrophic', 'fate', 'of', 'the', 'universe', 'avoided', 'and', 'a', 'de', 'sitter', 'expansion', 'fate', 'in', 'the', 'future', 'will', 'be', 'approached']]
|
[-0.08699351464277086, 0.129545227972546, -0.09800711417843522, 0.07469277796594219, -0.058675304132824145, -0.12767087962217347, -0.02428756662199951, 0.28140609372275494, -0.2338706778810416, -0.3389435599609796, 0.028716853437615993, -0.2782633322704997, -0.10284429728382766, 0.18651506074262086, 0.010638123531614176, -0.012221004006057752, 0.0067309912310612174, -0.009471012416973033, -0.02272295810381007, -0.2701252597934482, 0.3051162311205208, 0.08763058377356936, 0.2494862274793882, 0.03230589107995985, 0.0406318521150623, -0.07060713898461086, -0.04629822997399841, 0.020302861935839116, -0.20603623006632052, 0.038755584524055434, 0.2213417997060576, 0.12011970488020604, 0.2385888308124391, -0.4087504716495974, -0.273437879462209, 0.1692847217764762, 0.16219857887534256, 0.09477501302943424, -0.016408258635136817, -0.2852410775764535, 0.02340049341272779, -0.23006613916515212, -0.12319142092489685, -0.04819545948718006, -0.01433514495015102, -0.00944346208901455, -0.21435798273064346, 0.1545071759379664, 0.009307648985843043, -0.06213387946943362, -0.08110243932819088, -0.1074172134735772, -0.030723461804845642, 0.028428076896957602, 0.07768670692122683, 0.038691130220993526, 0.1041339054160441, -0.15310475654603745, -0.08364830125885253, 0.3877502667924596, -0.11384933919356571, -0.10220662313113647, 0.18988230577999293, -0.14352702473490464, -0.17306331356145405, 0.06721856575953125, 0.11535605879011329, 0.08409390645395645, -0.14802380603831614, 0.1556106134523012, 0.025082248354194252, 0.1344474297501335, 0.08959081399517906, -0.013558090455133957, 0.2728992403635398, 0.14252176469384759, -0.05138127567103095, 0.07905707037843049, -0.051283420316376394, -0.11797778316740548, -0.33289837438584957, -0.15264390863130115, -0.15490995391361378, 0.037484582104941246, -0.08784313603356361, -0.1114373973316767, 0.3932693662883883, 0.1665415060100842, 0.18480275382259578, -0.004839558036753324, 0.277727839280616, 0.08255877132431105, 0.013372147613383754, 0.10339006965725937, 0.32736427925357764, 0.07290487264334741, 0.1260409329317021, -0.21697486820160364, -0.0037019442781015778, 0.016991705002234965]
|
1,803.04135
|
Parametric Control of Nonlinear Longitudinal-Rotational Rod Oscillations
and Phenomenon of Reverse Rotational Vibrations
|
The article is devoted to the investigation of the nonlinear effects in a
system of the coupled longitudinal-torsional parametric vibrations of a
rotating rod. Constructed and investigated mathematical model, based on which
we calculated the resonance conditions of the nonlinear oscillations and found
the ratio of the parameters that require changing of the sign of the
coefficient in front of the term defining the possible reverse of torsional
vibrations. The latter is a new phenomenon, a special mode, where the
parametric action in the form of longitudinal vibrations at one end of the rod
(for example periodic strikes in the rod's end with a certain frequency) can
lead to torsional vibrations due to the nonlinear parametric interaction of
oscillations. In the context of this, the reverse leads to control not only the
rotation parameters, but also the direction of rotation, and there are possible
torsional oscillations, which can be used in precision mechanics devices.
|
physics.app-ph
|
the article is devoted to the investigation of the nonlinear effects in a system of the coupled longitudinaltorsional parametric vibrations of a rotating rod constructed and investigated mathematical model based on which we calculated the resonance conditions of the nonlinear oscillations and found the ratio of the parameters that require changing of the sign of the coefficient in front of the term defining the possible reverse of torsional vibrations the latter is a new phenomenon a special mode where the parametric action in the form of longitudinal vibrations at one end of the rod for example periodic strikes in the rods end with a certain frequency can lead to torsional vibrations due to the nonlinear parametric interaction of oscillations in the context of this the reverse leads to control not only the rotation parameters but also the direction of rotation and there are possible torsional oscillations which can be used in precision mechanics devices
|
[['the', 'article', 'is', 'devoted', 'to', 'the', 'investigation', 'of', 'the', 'nonlinear', 'effects', 'in', 'a', 'system', 'of', 'the', 'coupled', 'longitudinaltorsional', 'parametric', 'vibrations', 'of', 'a', 'rotating', 'rod', 'constructed', 'and', 'investigated', 'mathematical', 'model', 'based', 'on', 'which', 'we', 'calculated', 'the', 'resonance', 'conditions', 'of', 'the', 'nonlinear', 'oscillations', 'and', 'found', 'the', 'ratio', 'of', 'the', 'parameters', 'that', 'require', 'changing', 'of', 'the', 'sign', 'of', 'the', 'coefficient', 'in', 'front', 'of', 'the', 'term', 'defining', 'the', 'possible', 'reverse', 'of', 'torsional', 'vibrations', 'the', 'latter', 'is', 'a', 'new', 'phenomenon', 'a', 'special', 'mode', 'where', 'the', 'parametric', 'action', 'in', 'the', 'form', 'of', 'longitudinal', 'vibrations', 'at', 'one', 'end', 'of', 'the', 'rod', 'for', 'example', 'periodic', 'strikes', 'in', 'the', 'rods', 'end', 'with', 'a', 'certain', 'frequency', 'can', 'lead', 'to', 'torsional', 'vibrations', 'due', 'to', 'the', 'nonlinear', 'parametric', 'interaction', 'of', 'oscillations', 'in', 'the', 'context', 'of', 'this', 'the', 'reverse', 'leads', 'to', 'control', 'not', 'only', 'the', 'rotation', 'parameters', 'but', 'also', 'the', 'direction', 'of', 'rotation', 'and', 'there', 'are', 'possible', 'torsional', 'oscillations', 'which', 'can', 'be', 'used', 'in', 'precision', 'mechanics', 'devices']]
|
[-0.15387600764869622, 0.16054098596005073, -0.05398107377136601, 0.01618364046318639, -0.10557805898514108, -0.11135732816848783, 0.040974757517687976, 0.3208589137477033, -0.29403426205995037, -0.24778626682662885, 0.10014284821075016, -0.21860641856020427, -0.1482752706654662, 0.21770536845848207, -0.03789736710342707, 0.05333439785122774, 0.03408827524163511, 0.06853666864000747, -0.037691176296029166, -0.13186896963994585, 0.2884109695152885, 0.0584633786809932, 0.29371623858639034, 0.02389730214829149, 0.10262399752703465, -0.024819434369348137, 0.022813559400246423, 0.024590948179632036, -0.12939677675979575, 0.10347717372530134, 0.19348509389993862, 0.018869955944859126, 0.2539719631895423, -0.46416567604428804, -0.1980854279020789, 0.09010053571508406, 0.12485641773236197, 0.14681463946551815, -0.017625394812937265, -0.23541617027660405, -0.0030718753723050253, -0.13551263847187453, -0.17511273566715257, -0.020586013495678606, 0.020879555604682347, 0.04612545684296516, -0.26537825531490583, 0.10148974007518287, 0.09394792604010577, 0.04909112082118643, -0.05587543261032384, -0.0511265436934575, -0.02949031604015652, 0.10868335913355444, 0.102099796948084, 0.0020944862885193694, 0.12302580807248459, -0.12786082555296424, -0.0751332470940219, 0.41804765307784286, -0.0734725905942968, -0.22446647769148734, 0.1629180315108909, -0.16151968680103035, -0.09554487289069524, 0.13428751887294033, 0.18958542204395035, 0.10146814899129514, -0.14909386573271108, 0.0275383250459913, 0.006629239472566672, 0.17080391399118003, 0.103928990687968, 0.0031104686767398533, 0.20180415152724274, 0.17188133282306928, 0.031353950607012106, 0.15860502622044628, -0.10229207174639443, -0.06929354510936594, -0.31694595700775097, -0.10629044397615407, -0.12558392606948782, 0.01942285007100592, -0.035403931695755626, -0.1895492586871804, 0.45434637955584706, 0.1125758453582819, 0.17956616516145907, -0.02705723414763662, 0.25612161003868855, 0.1464614991701263, 0.09016721505744785, 0.008345258963945645, 0.34267690831801423, 0.1701551138049028, 0.08426068215843996, -0.2970750030237433, 0.04385383587841894, 0.011080829524039442]
|
1,803.04136
|
Malliavin Calculus for Non-colliding Particle Systems
|
In this paper, we use Malliavin calculus to show the existence and continuity
of density functions of $d$-dimensional non-colliding particle systems such as
hyperbolic particle systems and Dyson Brownian motion with smooth drift. For
this purpose, we apply results proved by Florit and Nualart (1995) and Naganuma
(2013) on locally non-degenerate Wiener functionals.
|
math.PR
|
in this paper we use malliavin calculus to show the existence and continuity of density functions of ddimensional noncolliding particle systems such as hyperbolic particle systems and dyson brownian motion with smooth drift for this purpose we apply results proved by florit and nualart 1995 and naganuma 2013 on locally nondegenerate wiener functionals
|
[['in', 'this', 'paper', 'we', 'use', 'malliavin', 'calculus', 'to', 'show', 'the', 'existence', 'and', 'continuity', 'of', 'density', 'functions', 'of', 'ddimensional', 'noncolliding', 'particle', 'systems', 'such', 'as', 'hyperbolic', 'particle', 'systems', 'and', 'dyson', 'brownian', 'motion', 'with', 'smooth', 'drift', 'for', 'this', 'purpose', 'we', 'apply', 'results', 'proved', 'by', 'florit', 'and', 'nualart', '1995', 'and', 'naganuma', '2013', 'on', 'locally', 'nondegenerate', 'wiener', 'functionals']]
|
[-0.04580740018102985, 0.10692364160114756, -0.10410312573926953, 0.0581872033698556, -0.05780292622959958, -0.07164338485409434, -0.013461733933162088, 0.35258086710774267, -0.2821935993762544, -0.23080672048784506, 0.09190134062709358, -0.26287287862326664, -0.21838098481440774, 0.16739033143340537, -0.18196542914777708, 0.12766451227407044, 0.0731184149447542, -0.05876166501548141, -0.0150379530297449, -0.2366915513904622, 0.3466198635377133, -0.03187634547849974, 0.16811526806738514, 0.01611950072961358, 0.18566245615679342, 0.09019072007280417, -0.08079567056847736, -0.006799244590533467, -0.21656537227905714, 0.11211210150325385, 0.18885900716010767, -0.00037042901385575533, 0.2888095045166735, -0.3832784133891647, -0.1861070582571511, 0.11891705207884885, 0.08499478919503207, 0.0153033005951259, -0.06157689089573418, -0.36049832274707466, 0.03978026713817739, -0.15284811560279474, -0.21883391711610153, -0.10420105532886317, 0.09896976509256862, 0.1442406229997197, -0.2839323779066595, 0.13521934845126593, 0.16217965278058097, 0.040090303080013164, -0.09037946589076175, -0.10259882957101442, -0.0065864344718507845, 0.017083697432938676, 0.005131812837834542, 0.012621149447603295, 0.12662313618840507, -0.005168364625065946, -0.19133671262086585, 0.31337338304505324, -0.1307124242795488, -0.31237363156217796, 0.24800520906081566, -0.19548384274373978, -0.17192379952981496, 0.07413843479186583, 0.18267012306918892, 0.15647886601688626, -0.195295607805467, 0.1949413757941399, -0.020048318124071766, 0.05077818136375684, 0.15825768449128821, -0.030653669230210092, 0.09723100191555344, 0.09835598913307947, 0.15291672599358627, 0.11219024241346723, -0.0650325308401639, -0.15336008111122423, -0.3294332909326141, -0.2275038306072999, -0.22293876897310838, 0.09866316387286553, -0.0710278251465822, -0.1922058743567994, 0.2891017696439611, 0.14235286945656228, 0.11063862072590452, 0.1236246200188851, 0.187190950785477, 0.18628530251198056, -0.09964358998247637, 0.12649085563876164, 0.13568649920993126, 0.22071409623514718, 0.1547190986949807, -0.1305885330747025, -0.03228261749833249, 0.18664867549579447]
|
1,803.04137
|
Deep Class-Wise Hashing: Semantics-Preserving Hashing via Class-wise
Loss
|
Deep supervised hashing has emerged as an influential solution to large-scale
semantic image retrieval problems in computer vision. In the light of recent
progress, convolutional neural network based hashing methods typically seek
pair-wise or triplet labels to conduct the similarity preserving learning.
However, complex semantic concepts of visual contents are hard to capture by
similar/dissimilar labels, which limits the retrieval performance. Generally,
pair-wise or triplet losses not only suffer from expensive training costs but
also lack in extracting sufficient semantic information. In this regard, we
propose a novel deep supervised hashing model to learn more compact class-level
similarity preserving binary codes. Our deep learning based model is motivated
by deep metric learning that directly takes semantic labels as supervised
information in training and generates corresponding discriminant hashing code.
Specifically, a novel cubic constraint loss function based on Gaussian
distribution is proposed, which preserves semantic variations while penalizes
the overlap part of different classes in the embedding space. To address the
discrete optimization problem introduced by binary codes, a two-step
optimization strategy is proposed to provide efficient training and avoid the
problem of gradient vanishing. Extensive experiments on four large-scale
benchmark databases show that our model can achieve the state-of-the-art
retrieval performance. Moreover, when training samples are limited, our method
surpasses other supervised deep hashing methods with non-negligible margins.
|
cs.CV
|
deep supervised hashing has emerged as an influential solution to largescale semantic image retrieval problems in computer vision in the light of recent progress convolutional neural network based hashing methods typically seek pairwise or triplet labels to conduct the similarity preserving learning however complex semantic concepts of visual contents are hard to capture by similardissimilar labels which limits the retrieval performance generally pairwise or triplet losses not only suffer from expensive training costs but also lack in extracting sufficient semantic information in this regard we propose a novel deep supervised hashing model to learn more compact classlevel similarity preserving binary codes our deep learning based model is motivated by deep metric learning that directly takes semantic labels as supervised information in training and generates corresponding discriminant hashing code specifically a novel cubic constraint loss function based on gaussian distribution is proposed which preserves semantic variations while penalizes the overlap part of different classes in the embedding space to address the discrete optimization problem introduced by binary codes a twostep optimization strategy is proposed to provide efficient training and avoid the problem of gradient vanishing extensive experiments on four largescale benchmark databases show that our model can achieve the stateoftheart retrieval performance moreover when training samples are limited our method surpasses other supervised deep hashing methods with nonnegligible margins
|
[['deep', 'supervised', 'hashing', 'has', 'emerged', 'as', 'an', 'influential', 'solution', 'to', 'largescale', 'semantic', 'image', 'retrieval', 'problems', 'in', 'computer', 'vision', 'in', 'the', 'light', 'of', 'recent', 'progress', 'convolutional', 'neural', 'network', 'based', 'hashing', 'methods', 'typically', 'seek', 'pairwise', 'or', 'triplet', 'labels', 'to', 'conduct', 'the', 'similarity', 'preserving', 'learning', 'however', 'complex', 'semantic', 'concepts', 'of', 'visual', 'contents', 'are', 'hard', 'to', 'capture', 'by', 'similardissimilar', 'labels', 'which', 'limits', 'the', 'retrieval', 'performance', 'generally', 'pairwise', 'or', 'triplet', 'losses', 'not', 'only', 'suffer', 'from', 'expensive', 'training', 'costs', 'but', 'also', 'lack', 'in', 'extracting', 'sufficient', 'semantic', 'information', 'in', 'this', 'regard', 'we', 'propose', 'a', 'novel', 'deep', 'supervised', 'hashing', 'model', 'to', 'learn', 'more', 'compact', 'classlevel', 'similarity', 'preserving', 'binary', 'codes', 'our', 'deep', 'learning', 'based', 'model', 'is', 'motivated', 'by', 'deep', 'metric', 'learning', 'that', 'directly', 'takes', 'semantic', 'labels', 'as', 'supervised', 'information', 'in', 'training', 'and', 'generates', 'corresponding', 'discriminant', 'hashing', 'code', 'specifically', 'a', 'novel', 'cubic', 'constraint', 'loss', 'function', 'based', 'on', 'gaussian', 'distribution', 'is', 'proposed', 'which', 'preserves', 'semantic', 'variations', 'while', 'penalizes', 'the', 'overlap', 'part', 'of', 'different', 'classes', 'in', 'the', 'embedding', 'space', 'to', 'address', 'the', 'discrete', 'optimization', 'problem', 'introduced', 'by', 'binary', 'codes', 'a', 'twostep', 'optimization', 'strategy', 'is', 'proposed', 'to', 'provide', 'efficient', 'training', 'and', 'avoid', 'the', 'problem', 'of', 'gradient', 'vanishing', 'extensive', 'experiments', 'on', 'four', 'largescale', 'benchmark', 'databases', 'show', 'that', 'our', 'model', 'can', 'achieve', 'the', 'stateoftheart', 'retrieval', 'performance', 'moreover', 'when', 'training', 'samples', 'are', 'limited', 'our', 'method', 'surpasses', 'other', 'supervised', 'deep', 'hashing', 'methods', 'with', 'nonnegligible', 'margins']]
|
[-0.030429372819857286, -0.023829449962731772, -0.058115805848233386, 0.11059110016081362, -0.16672491357921437, -0.22668146278305742, 0.029582906731142562, 0.48476251394998643, -0.3139754872327061, -0.3429634692190292, 0.04405824522796829, -0.2861533034136862, -0.17936414570230047, 0.136800803759131, -0.16552511331934294, 0.12517208340770913, 0.1651130754646549, 0.04646676312288774, -0.14855321379344102, -0.34941537724164085, 0.3429677023376394, 0.0464354661417522, 0.37620754760350983, 0.017021371698659343, 0.13486876308141182, -0.021671522293917937, -0.07008017057312592, -0.01823641495869821, -0.02243562307765907, 0.2193917021432179, 0.35561554818864793, 0.24931287743614702, 0.3443454027858301, -0.38303372615836734, -0.28372252948393334, 0.12875944257698832, 0.13660364240528114, 0.10480321097200573, -0.06706650379632358, -0.3437916574589822, 0.07130144403341832, -0.14876593109263184, 0.11558106431763293, -0.19172140412581956, -0.0378264248175847, -0.035148164065616966, -0.30747069311778874, 0.031435183856570834, 0.09537879993451313, 0.060460799156949956, -0.029385471042172664, -0.12054393810653535, 0.039355227532732184, 0.12369593193559814, 0.019272025660633147, 0.08998030849543619, 0.11855989918842362, -0.2062147828580786, -0.14644297966486797, 0.34771915284856675, -0.060088774005341676, -0.22148508722850976, 0.19562296125681616, 0.046528702458014826, -0.16786736923093964, 0.13095866662154, 0.25605595768252304, 0.15332354048979446, -0.17596154611415288, 0.030032044516399948, -0.053524933603038574, 0.20620089304560477, 0.03488374030118817, 0.029032217609065193, 0.16743672035059415, 0.264707097306221, 0.055473360782360426, 0.15050035750966578, -0.14041057028239035, -0.09117717710044664, -0.16131055211296416, -0.05762398732753153, -0.24039475318507939, -0.05516432116041765, -0.12129665345952992, -0.18013552038948866, 0.34068576287915975, 0.22182331995798216, 0.2265631956123953, 0.10526614617298825, 0.37326010548904504, -0.009347085211981809, 0.15121858697685023, 0.12261336716321138, 0.19281715358186874, 0.018894365590606487, 0.10902854609346095, -0.16727231884448177, 0.10818913834510706, 0.11067502517124406]
|
1,803.04138
|
Importance in systems with interval decisions
|
Given a system where the real-valued states of the agents are aggregated by a
function to a real-valued state of the entire system, we are interested in the
influence or importance of the different agents for that function. This
generalizes the notion of power indices for binary voting systems to decisions
over interval policy spaces and has applications in economics, engineering,
security analysis, and other disciplines. Here, we study the question of
importance in systems with interval decisions. Based on the classical
Shapley-Shubik and Penrose-Banzhaf index, from binary voting, we motivate and
analyze two importance measures. Additionally, we present some results for
parametric classes of aggregation functions.
|
cs.GT
|
given a system where the realvalued states of the agents are aggregated by a function to a realvalued state of the entire system we are interested in the influence or importance of the different agents for that function this generalizes the notion of power indices for binary voting systems to decisions over interval policy spaces and has applications in economics engineering security analysis and other disciplines here we study the question of importance in systems with interval decisions based on the classical shapleyshubik and penrosebanzhaf index from binary voting we motivate and analyze two importance measures additionally we present some results for parametric classes of aggregation functions
|
[['given', 'a', 'system', 'where', 'the', 'realvalued', 'states', 'of', 'the', 'agents', 'are', 'aggregated', 'by', 'a', 'function', 'to', 'a', 'realvalued', 'state', 'of', 'the', 'entire', 'system', 'we', 'are', 'interested', 'in', 'the', 'influence', 'or', 'importance', 'of', 'the', 'different', 'agents', 'for', 'that', 'function', 'this', 'generalizes', 'the', 'notion', 'of', 'power', 'indices', 'for', 'binary', 'voting', 'systems', 'to', 'decisions', 'over', 'interval', 'policy', 'spaces', 'and', 'has', 'applications', 'in', 'economics', 'engineering', 'security', 'analysis', 'and', 'other', 'disciplines', 'here', 'we', 'study', 'the', 'question', 'of', 'importance', 'in', 'systems', 'with', 'interval', 'decisions', 'based', 'on', 'the', 'classical', 'shapleyshubik', 'and', 'penrosebanzhaf', 'index', 'from', 'binary', 'voting', 'we', 'motivate', 'and', 'analyze', 'two', 'importance', 'measures', 'additionally', 'we', 'present', 'some', 'results', 'for', 'parametric', 'classes', 'of', 'aggregation', 'functions']]
|
[-0.11354982010828697, 0.06318345886576816, -0.07831049969672252, 0.07438020550354306, -0.05801632184596193, -0.10836507455297859, 0.12760012966545872, 0.4107163699221945, -0.27730218499951137, -0.255055945880154, 0.12008326410785944, -0.2858573723514782, -0.18883956757278364, 0.2087557755609774, -0.10831485619489974, 0.08460394372493377, 0.04947616913677933, 0.040427104295797156, -0.029477993494213046, -0.27221831513533945, 0.3949748617814523, -0.005232459895974286, 0.28123271644167674, 0.019912257533798987, 0.08892717756435414, 0.08820792945171489, -0.03483064537519746, 0.026060414779060913, -0.14352173836300394, 0.1573337134312203, 0.3105217794600491, 0.18636214583415853, 0.37290370911707943, -0.34634795217452763, -0.21479276612087667, 0.14774781630470235, 0.07835454676543997, 0.03654369429867958, -0.000396996415568359, -0.2527700840456359, 0.08596608845221106, -0.20406055789893476, -0.05646466826323733, -0.06609579974733223, 0.040572117113238465, 0.10678707003793636, -0.2820606897019337, 0.020615915272267377, 0.05391690172646717, 0.09061904731598273, -0.09695765001385986, -0.12467953393662295, 0.013231001661602999, 0.16388089140381001, 0.03579399995853968, -0.03571742215350479, 0.13973421431103042, -0.1500889000539433, -0.19510440230717727, 0.37472084657208576, -0.007588567669181345, -0.2139499580169915, 0.17304302879748432, -0.10025991715281923, -0.17925965818620035, 0.03093037019683936, 0.23288255990874546, 0.11006604167241081, -0.11266967428795924, 0.04914574743962246, -0.039948052308896434, 0.1769835632729614, 0.02981662161857168, 0.061449285883839445, 0.17972415107711454, 0.13737421773513345, 0.07644534153454702, 0.16606710581642045, -0.0017996545267404517, -0.15201913523781505, -0.23601718486295403, -0.13527165460356763, -0.16938009590920167, 0.017783520082838695, -0.09674004857400084, -0.15146466180090315, 0.42740462344383523, 0.15532734831871256, 0.16483056906253865, 0.08863126105742059, 0.2527870796969004, 0.12139881147881186, -0.01667693702103657, 0.05819640815188395, 0.18490960763764097, 0.07025441690892086, 0.11782475673946091, -0.14802141618810455, 0.1091440040487622, 0.04738504701581235]
|
1,803.04139
|
5G Control Channel Design for Ultra-Reliable Low-Latency Communications
|
The fifth generation (5G) of wireless systems holds the promise of supporting
a wide range of services with different communication requirements.
Ultra-reliable low-latency communications (URLLC) is a generic service that
enables mission-critical applications, such as industrial automation, augmented
reality, and vehicular communications. URLLC has stringent requirements for
reliability and latency of delivering both data and control information. In
order to meet these requirements, the Third Generation Partnership Project
(3GPP) has been introducing new features to the upcoming releases of the
cellular system standards, namely releases 15 and beyond. This article reviews
some of these features and introduces new enhancements for designing the
control channels to efficiently support the URLLC. In particular, a flexible
slot structure is presented as a solution to detect a failure in delivering the
control information at an early stage, thereby allowing timely retransmission
of the control information. Finally, some remaining challenges and envisioned
research directions are discussed for shaping the 5G new radio (NR) as a
unified wireless access technology for supporting different services.
|
eess.SP cs.NI
|
the fifth generation 5g of wireless systems holds the promise of supporting a wide range of services with different communication requirements ultrareliable lowlatency communications urllc is a generic service that enables missioncritical applications such as industrial automation augmented reality and vehicular communications urllc has stringent requirements for reliability and latency of delivering both data and control information in order to meet these requirements the third generation partnership project 3gpp has been introducing new features to the upcoming releases of the cellular system standards namely releases 15 and beyond this article reviews some of these features and introduces new enhancements for designing the control channels to efficiently support the urllc in particular a flexible slot structure is presented as a solution to detect a failure in delivering the control information at an early stage thereby allowing timely retransmission of the control information finally some remaining challenges and envisioned research directions are discussed for shaping the 5g new radio nr as a unified wireless access technology for supporting different services
|
[['the', 'fifth', 'generation', '5g', 'of', 'wireless', 'systems', 'holds', 'the', 'promise', 'of', 'supporting', 'a', 'wide', 'range', 'of', 'services', 'with', 'different', 'communication', 'requirements', 'ultrareliable', 'lowlatency', 'communications', 'urllc', 'is', 'a', 'generic', 'service', 'that', 'enables', 'missioncritical', 'applications', 'such', 'as', 'industrial', 'automation', 'augmented', 'reality', 'and', 'vehicular', 'communications', 'urllc', 'has', 'stringent', 'requirements', 'for', 'reliability', 'and', 'latency', 'of', 'delivering', 'both', 'data', 'and', 'control', 'information', 'in', 'order', 'to', 'meet', 'these', 'requirements', 'the', 'third', 'generation', 'partnership', 'project', '3gpp', 'has', 'been', 'introducing', 'new', 'features', 'to', 'the', 'upcoming', 'releases', 'of', 'the', 'cellular', 'system', 'standards', 'namely', 'releases', '15', 'and', 'beyond', 'this', 'article', 'reviews', 'some', 'of', 'these', 'features', 'and', 'introduces', 'new', 'enhancements', 'for', 'designing', 'the', 'control', 'channels', 'to', 'efficiently', 'support', 'the', 'urllc', 'in', 'particular', 'a', 'flexible', 'slot', 'structure', 'is', 'presented', 'as', 'a', 'solution', 'to', 'detect', 'a', 'failure', 'in', 'delivering', 'the', 'control', 'information', 'at', 'an', 'early', 'stage', 'thereby', 'allowing', 'timely', 'retransmission', 'of', 'the', 'control', 'information', 'finally', 'some', 'remaining', 'challenges', 'and', 'envisioned', 'research', 'directions', 'are', 'discussed', 'for', 'shaping', 'the', '5g', 'new', 'radio', 'nr', 'as', 'a', 'unified', 'wireless', 'access', 'technology', 'for', 'supporting', 'different', 'services']]
|
[-0.26887425543741084, 0.05390282293687744, 0.034127411123509296, 0.013726912858103225, -0.11220150623315324, -0.2127337280627606, 0.061071211660635616, 0.3534508070830877, -0.24505085893213704, -0.30444595377360073, 0.1495403264908375, -0.2530642076772416, -0.13494427876382056, 0.23016194715386346, -0.11035066686010742, 0.11705296523203808, 0.0384302364254836, -0.03965546819520006, -0.01784270677329741, -0.2433649454185451, 0.24710088291127855, 0.10808158367096136, 0.3932124476857661, 0.11603062762532361, 0.027041009264870637, -0.00408167977141039, -0.06227628145244948, -0.11050157228185396, -0.0884770564418345, 0.17885994801326888, 0.3870126224355772, 0.2492664082466425, 0.344648022145044, -0.45937111297444927, -0.28728494938418625, 0.03972582395155249, 0.16915491553455858, 0.03924627517699264, -0.11103825390593902, -0.28643414438036935, 0.13846092811408675, -0.2908590865554288, -0.12562175538013912, -0.04356916019848237, -0.009937876302588154, 0.08122315415779927, -0.31637979941227795, -0.08464492904299516, -0.021198704597606723, 0.043131038978961964, -0.05866988377307453, -0.017483707030242795, 0.017511386011305842, 0.2034984095094149, -0.0069061547432543845, 0.018053081260794506, 0.09921490367698771, -0.17972085018794, -0.14115617879100942, 0.4654971750541812, 0.027440370667872707, -0.12133564896482442, 0.18302780034164676, -0.021541727182921022, -0.1954608242986502, 0.07722170341626874, 0.26168525917178376, -0.017326317760827287, -0.2297329868511692, 0.014696046802176474, 0.10378708006603465, 0.13891188974264965, 0.0743326556763523, 0.17309369547902384, 0.23326319627951653, 0.26939804854642024, 0.15778593688515857, 0.06463420570140616, -0.0816659718125482, -0.0855781707061743, -0.2671962088553257, -0.16638082526073308, -0.13030534504824096, -0.010296450902907444, -0.0612095195096377, -0.07029199574927111, 0.3865516381088777, 0.18053527873832667, 0.06020660851694023, 0.07509128722622768, 0.3981614457221613, 0.05096371395449664, 0.13085424424415187, 0.10351028834009499, 0.19500766701024813, 0.026856675576363204, 0.251416848955809, -0.0926697440542436, 0.0695601308030919, -0.04348072490981957]
|
1,803.0414
|
From gated to continuous readout - the GEM upgrade of the ALICE TPC
|
The ALICE Collaboration is planning a major upgrade of its central barrel
detectors to be able to cope with the increased LHC luminosity beyond 2020. In
order to record at an increased interaction rate of up to 50$\,$kHz in Pb$-$Pb
collisions, the TPC will be operated in an ungated mode with continuous
readout. This demands for a replacement of the currently employed gated
Multi-Wire Proportional Chambers by GEM-based (Gas Electron Multiplier) readout
chambers, while retaining the performance in particular in terms of particle
identification capabilities via the measurement of the specific energy loss.
Prior to the beginning of the full mass production of the readout chambers
for the upgrade, a so-called pre-production was launched in order to
characterize and verify the performance of the first fully assembled readout
chambers of the final design. This phase was concluded in March 2017 with the
formal acceptance of the production readiness and hence the beginning of the
mass production.
|
physics.ins-det
|
the alice collaboration is planning a major upgrade of its central barrel detectors to be able to cope with the increased lhc luminosity beyond 2020 in order to record at an increased interaction rate of up to 50khz in pbpb collisions the tpc will be operated in an ungated mode with continuous readout this demands for a replacement of the currently employed gated multiwire proportional chambers by gembased gas electron multiplier readout chambers while retaining the performance in particular in terms of particle identification capabilities via the measurement of the specific energy loss prior to the beginning of the full mass production of the readout chambers for the upgrade a socalled preproduction was launched in order to characterize and verify the performance of the first fully assembled readout chambers of the final design this phase was concluded in march 2017 with the formal acceptance of the production readiness and hence the beginning of the mass production
|
[['the', 'alice', 'collaboration', 'is', 'planning', 'a', 'major', 'upgrade', 'of', 'its', 'central', 'barrel', 'detectors', 'to', 'be', 'able', 'to', 'cope', 'with', 'the', 'increased', 'lhc', 'luminosity', 'beyond', '2020', 'in', 'order', 'to', 'record', 'at', 'an', 'increased', 'interaction', 'rate', 'of', 'up', 'to', '50khz', 'in', 'pbpb', 'collisions', 'the', 'tpc', 'will', 'be', 'operated', 'in', 'an', 'ungated', 'mode', 'with', 'continuous', 'readout', 'this', 'demands', 'for', 'a', 'replacement', 'of', 'the', 'currently', 'employed', 'gated', 'multiwire', 'proportional', 'chambers', 'by', 'gembased', 'gas', 'electron', 'multiplier', 'readout', 'chambers', 'while', 'retaining', 'the', 'performance', 'in', 'particular', 'in', 'terms', 'of', 'particle', 'identification', 'capabilities', 'via', 'the', 'measurement', 'of', 'the', 'specific', 'energy', 'loss', 'prior', 'to', 'the', 'beginning', 'of', 'the', 'full', 'mass', 'production', 'of', 'the', 'readout', 'chambers', 'for', 'the', 'upgrade', 'a', 'socalled', 'preproduction', 'was', 'launched', 'in', 'order', 'to', 'characterize', 'and', 'verify', 'the', 'performance', 'of', 'the', 'first', 'fully', 'assembled', 'readout', 'chambers', 'of', 'the', 'final', 'design', 'this', 'phase', 'was', 'concluded', 'in', 'march', '2017', 'with', 'the', 'formal', 'acceptance', 'of', 'the', 'production', 'readiness', 'and', 'hence', 'the', 'beginning', 'of', 'the', 'mass', 'production']]
|
[-0.05949176442010913, 0.15246227656611247, -0.04264012743563702, -0.019258460057571005, -0.0031651799993899963, -0.11080129966080093, -0.02526697685989814, 0.3252688232892885, -0.2060239915874076, -0.3367364800129181, 0.12285131016128267, -0.3058574816498619, 0.04135278652971371, 0.17860331061931972, -0.08966983642835075, 0.11280914076017395, 0.09343122174733509, 0.023612836702690963, -0.09677459861044414, -0.26722430896897537, 0.2109665000655999, 0.21063867762971383, 0.2928703926781264, 0.07750652867775315, 0.15689800965945977, -0.0037345522910189363, -0.050374008791643575, -0.04801513985372507, -0.09211930779864093, 0.06357424178937575, 0.30758932238080516, 0.09553779099279872, 0.23464626398009175, -0.43469438691122025, -0.08914350452594078, 0.09336614854132327, 0.10447602147439447, -0.009820815050401367, -0.07360936705476771, -0.28540074218136186, 0.0814944693299297, -0.28071336448192596, -0.14684953872198, 0.03486568343718178, -0.015053008924811505, 0.020274363857774567, -0.25520146060406634, -0.0030681439466440142, 0.012377284604530686, -0.004582551584089509, -0.032683789796488456, -0.058427092515511245, -0.001585617883112998, 0.10634538203250998, 0.0027969513601139905, 0.07234844891354442, 0.17436611153430137, -0.15856746296496846, -0.1528896914827876, 0.3041816032312524, -0.01669427991295472, -0.13220359572770599, 0.18812947996589058, -0.2243554684190223, -0.07254891620649663, 0.18300500136758321, 0.21932678803120956, 0.03205574034020687, -0.2192662884720052, 0.033230224480249516, 0.08145025450712404, 0.1881730645396508, 0.08793121714962837, 0.030534226939870186, 0.20042680509280986, 0.28045692375879017, 0.08031984904366067, 0.13280226326344582, -0.15319840082277855, -0.057765104910896085, -0.35192892785954216, -0.20941274153450742, -0.13723148529784224, -0.008921728499281483, 0.0175564663414918, -0.08678480605848539, 0.4147667527461472, 0.12025457890922553, 0.18464739282782644, -0.03481653736134131, 0.3254462873849731, 0.06367940615074566, 0.155464846903506, 0.027289387559554037, 0.3188410617279796, 0.12444903400505726, 0.21014910555617788, -0.2537172636291824, 0.06663869549997915, 0.04593494569417089]
|
1,803.04141
|
A Modular Design for Geo-Distributed Querying
|
Most distributed storage systems provide limited abilities for querying data
by attributes other than their primary keys. Supporting efficient search on
secondary attributes is challenging as applications pose varying requirements
to query processing systems, and no single system design can be suitable for
all needs. In this paper, we show how to overcome these challenges in order to
extend distributed data stores to support queries on secondary attributes. We
propose a modular architecture that is flexible and allows query processing
systems to make trade-offs according to different use case requirements. We
describe adap-tive mechanisms that make use of this flexibility to enable query
processing systems to dynamically adjust to query and write operation
workloads.
|
cs.DC cs.DB cs.IR
|
most distributed storage systems provide limited abilities for querying data by attributes other than their primary keys supporting efficient search on secondary attributes is challenging as applications pose varying requirements to query processing systems and no single system design can be suitable for all needs in this paper we show how to overcome these challenges in order to extend distributed data stores to support queries on secondary attributes we propose a modular architecture that is flexible and allows query processing systems to make tradeoffs according to different use case requirements we describe adaptive mechanisms that make use of this flexibility to enable query processing systems to dynamically adjust to query and write operation workloads
|
[['most', 'distributed', 'storage', 'systems', 'provide', 'limited', 'abilities', 'for', 'querying', 'data', 'by', 'attributes', 'other', 'than', 'their', 'primary', 'keys', 'supporting', 'efficient', 'search', 'on', 'secondary', 'attributes', 'is', 'challenging', 'as', 'applications', 'pose', 'varying', 'requirements', 'to', 'query', 'processing', 'systems', 'and', 'no', 'single', 'system', 'design', 'can', 'be', 'suitable', 'for', 'all', 'needs', 'in', 'this', 'paper', 'we', 'show', 'how', 'to', 'overcome', 'these', 'challenges', 'in', 'order', 'to', 'extend', 'distributed', 'data', 'stores', 'to', 'support', 'queries', 'on', 'secondary', 'attributes', 'we', 'propose', 'a', 'modular', 'architecture', 'that', 'is', 'flexible', 'and', 'allows', 'query', 'processing', 'systems', 'to', 'make', 'tradeoffs', 'according', 'to', 'different', 'use', 'case', 'requirements', 'we', 'describe', 'adaptive', 'mechanisms', 'that', 'make', 'use', 'of', 'this', 'flexibility', 'to', 'enable', 'query', 'processing', 'systems', 'to', 'dynamically', 'adjust', 'to', 'query', 'and', 'write', 'operation', 'workloads']]
|
[-0.15527789466279118, 0.012377205439598152, -0.04568233349965068, 0.05677452456336795, -0.18447315729051633, -0.23002201070796632, 0.0900121239440826, 0.4505177518514214, -0.32300529994679156, -0.3716345648853141, 0.09318009780499299, -0.25826151052445456, -0.12249562021737036, 0.20555963868626573, -0.16741005386013472, 0.10255166141238685, 0.08004097601709266, 0.005920119310183891, -0.03336603921764579, -0.29973669840317024, 0.2903924093259041, 0.07781933884651057, 0.3049566896240178, 0.0031480708715032066, 0.039381688842631615, 0.032086528325044925, -0.022476247957041652, -0.05784432668645566, -0.07649447147700253, 0.20053202031474365, 0.36399477994755697, 0.26057307847791855, 0.281233242500508, -0.47803008971376376, -0.1806800595194657, 0.07181325041496996, 0.1645057334711677, 0.0647260874485303, -0.04357640868616536, -0.22505315675465554, 0.151703522344561, -0.18060338766755243, -0.042189186598223294, -0.19860092292768522, 0.04340145530704033, 0.026732633176276034, -0.2993392433170556, -0.06365762063988338, 0.004712444489102876, 0.011691479053217591, -0.03901532173346679, -0.03289553904068542, 0.06669535067773898, 0.18631552268849, -0.023139801350209797, -0.005297334548167623, 0.1676074628383248, -0.09287738305794303, -0.18075568460973732, 0.44287943935609964, 0.041249680457807254, -0.22108935904198965, 0.23072289200009485, -0.025045147941758234, -0.199613643826492, 0.07343734322440516, 0.2597763665840479, 0.06993767201263261, -0.2159276759546054, 0.025352118292255654, 0.07966886104182586, 0.24623641580866093, 0.05433029376313483, 0.09855388749795231, 0.21177481729210468, 0.21545609223591, 0.09613688820319478, 0.17897027719453418, -0.02390145211023066, -0.05798632868467585, -0.1820740161888432, -0.16061733671455858, -0.15131816593828007, -0.04618197555751785, -0.08219005306327426, -0.11992271434875172, 0.33127651490238413, 0.30867049109043654, 0.19497139243768496, 0.08609203167278585, 0.3648416294405858, 0.03068290754086583, 0.12005304465715758, 0.11129639090218565, 0.08969801703566, -0.014790449256747308, 0.17965278394618317, -0.14237191715163358, 0.1013323913000038, -0.04587445128709078]
|
1,803.04142
|
Partially Linear Spatial Probit Models
|
A partially linear probit model for spatially dependent data is considered. A
triangular array setting is used to cover various patterns of spatial data.
Conditional spatial heteroscedasticity and non-identically distributed
observations and a linear process for disturbances are assumed, allowing
various spatial dependencies. The estimation procedure is a combination of a
weighted likelihood and a generalized method of moments. The procedure first
fixes the parametric components of the model and then estimates the
non-parametric part using weighted likelihood; the obtained estimate is then
used to construct a GMM parametric component estimate. The consistency and
asymptotic distribution of the estimators are established under sufficient
conditions. Some simulation experiments are provided to investigate the finite
sample performance of the estimators.
|
stat.ME
|
a partially linear probit model for spatially dependent data is considered a triangular array setting is used to cover various patterns of spatial data conditional spatial heteroscedasticity and nonidentically distributed observations and a linear process for disturbances are assumed allowing various spatial dependencies the estimation procedure is a combination of a weighted likelihood and a generalized method of moments the procedure first fixes the parametric components of the model and then estimates the nonparametric part using weighted likelihood the obtained estimate is then used to construct a gmm parametric component estimate the consistency and asymptotic distribution of the estimators are established under sufficient conditions some simulation experiments are provided to investigate the finite sample performance of the estimators
|
[['a', 'partially', 'linear', 'probit', 'model', 'for', 'spatially', 'dependent', 'data', 'is', 'considered', 'a', 'triangular', 'array', 'setting', 'is', 'used', 'to', 'cover', 'various', 'patterns', 'of', 'spatial', 'data', 'conditional', 'spatial', 'heteroscedasticity', 'and', 'nonidentically', 'distributed', 'observations', 'and', 'a', 'linear', 'process', 'for', 'disturbances', 'are', 'assumed', 'allowing', 'various', 'spatial', 'dependencies', 'the', 'estimation', 'procedure', 'is', 'a', 'combination', 'of', 'a', 'weighted', 'likelihood', 'and', 'a', 'generalized', 'method', 'of', 'moments', 'the', 'procedure', 'first', 'fixes', 'the', 'parametric', 'components', 'of', 'the', 'model', 'and', 'then', 'estimates', 'the', 'nonparametric', 'part', 'using', 'weighted', 'likelihood', 'the', 'obtained', 'estimate', 'is', 'then', 'used', 'to', 'construct', 'a', 'gmm', 'parametric', 'component', 'estimate', 'the', 'consistency', 'and', 'asymptotic', 'distribution', 'of', 'the', 'estimators', 'are', 'established', 'under', 'sufficient', 'conditions', 'some', 'simulation', 'experiments', 'are', 'provided', 'to', 'investigate', 'the', 'finite', 'sample', 'performance', 'of', 'the', 'estimators']]
|
[-0.0732011073471197, 0.04052766016881787, -0.11893714971493109, 0.12369180152001132, -0.08761760820358423, -0.13201309350256066, 0.02550151970008609, 0.40445550468008395, -0.2677601893763926, -0.27575602280607414, 0.1772796721316053, -0.23866156156380045, -0.10385774813643736, 0.1727600780777412, -0.051827382477852756, 0.1332761374893164, 0.04831337113075464, -0.0030159991771235304, -0.07401291411212188, -0.26092477381955514, 0.28336386036194894, 0.05483450920427597, 0.3440854958282247, -0.05190310078935492, 0.1550174451736986, 0.01919651302998349, -0.0984740108705394, 0.02132045129566627, -0.12785586813204305, 0.1272441338357058, 0.22551612160365903, 0.14945645041673017, 0.298171631652483, -0.36345342436963957, -0.2286675170940047, 0.14269778819881002, 0.10976006951719774, 0.06770370385246509, 0.015173933744998806, -0.27398489390389397, 0.06240073927693953, -0.15000950549808095, -0.11163520808252743, -0.08804160363230286, -0.07348646798913004, 0.06794431526213884, -0.43113313643735346, 0.1033125036155363, 0.06787749343172853, 0.05841535104486018, -0.054044576109213344, -0.11712382634375561, -0.005311685924070998, 0.08519151668662157, 0.0337987602508323, -0.06098308826607289, 0.09226902905393834, -0.06848994901224228, -0.07741059654123955, 0.30538231592873993, -0.08378397906988354, -0.26728915461927055, 0.1419498968901018, -0.1007357212730636, -0.129854414600216, 0.0890758558989392, 0.21397464984428075, 0.11876984871923923, -0.22035117557082892, 0.06325354485652189, -0.04505183729658819, 0.15820764869419954, 0.004447087241036786, -0.02117991433242115, 0.16017839637924364, 0.15121992844772542, 0.08676996688752868, 0.16758610870910146, -0.17104628818085954, -0.07215852751712298, -0.3248704299015009, -0.07220959326378622, -0.2121580540384087, -0.07487102522380587, -0.1650969994453451, -0.20924583339463856, 0.39639833864708574, 0.144905052431938, 0.20855157387095613, 0.11633817312481293, 0.29223609570476966, 0.14082892204909112, 0.008898469211999327, 0.05790795650041141, 0.1548389778997832, 0.21137241092589448, 0.03145531436894089, -0.16042329198720282, 0.1337299933361079, 0.02771691662275185]
|
1,803.04143
|
Precision neutrino data confronts $\mu\leftrightarrow\tau$ symmetry
|
Neutrino oscillation data indicate that $\theta_{23}$ is close to $\pi/4$ and
$\theta_{13}$ is very small. A simple $\mu\leftrightarrow\tau$ exchange
symmetry of the neutrino mass matrix predicts $\theta_{23}=-\pi/4$ and
$\theta_{13}=0$. Since the experimental measurements differ from these
predictions, this symmetry is obviously broken. This breaking is given by two
parameters: $\varepsilon_1$ parametrizing the inequality bewteen $12$ and $13$
elements and $\varepsilon_2$ parametrizing the inequality bewteen $22$ and $33$
elements. We show that the magnitude of $\theta_{13}$ is essentially controlled
by $\varepsilon_1$ whereas the deviation of $\theta_{23}$ from maximality is
controlled by $\varepsilon_2$. The measured value of $\theta_{13}$ requires
$\mu\leftrightarrow\tau$ symmetry to be badly broken for both normal hierarchy
and inverted hierarchy, though the level of breaking depends sensitively on the
hierarchy. In this paper we obtain constraints on the parameters of neutrino
mass matrix, including the symmetry breaking parameters, using the precision
oscillation data. We find that this precision data constrains all elements of
neutrino mass matrix to be in very narrow ranges. We also consider
$\mu\leftrightarrow -\tau$ exchange symmetry in the case of inverted hierarchy
and find that it provides an explanation of neutrino mixing angles with some
fine-tuning.
|
hep-ph
|
neutrino oscillation data indicate that theta_23 is close to pi4 and theta_13 is very small a simple muleftrightarrowtau exchange symmetry of the neutrino mass matrix predicts theta_23pi4 and theta_130 since the experimental measurements differ from these predictions this symmetry is obviously broken this breaking is given by two parameters varepsilon_1 parametrizing the inequality bewteen 12 and 13 elements and varepsilon_2 parametrizing the inequality bewteen 22 and 33 elements we show that the magnitude of theta_13 is essentially controlled by varepsilon_1 whereas the deviation of theta_23 from maximality is controlled by varepsilon_2 the measured value of theta_13 requires muleftrightarrowtau symmetry to be badly broken for both normal hierarchy and inverted hierarchy though the level of breaking depends sensitively on the hierarchy in this paper we obtain constraints on the parameters of neutrino mass matrix including the symmetry breaking parameters using the precision oscillation data we find that this precision data constrains all elements of neutrino mass matrix to be in very narrow ranges we also consider muleftrightarrow tau exchange symmetry in the case of inverted hierarchy and find that it provides an explanation of neutrino mixing angles with some finetuning
|
[['neutrino', 'oscillation', 'data', 'indicate', 'that', 'theta_23', 'is', 'close', 'to', 'pi4', 'and', 'theta_13', 'is', 'very', 'small', 'a', 'simple', 'muleftrightarrowtau', 'exchange', 'symmetry', 'of', 'the', 'neutrino', 'mass', 'matrix', 'predicts', 'theta_23pi4', 'and', 'theta_130', 'since', 'the', 'experimental', 'measurements', 'differ', 'from', 'these', 'predictions', 'this', 'symmetry', 'is', 'obviously', 'broken', 'this', 'breaking', 'is', 'given', 'by', 'two', 'parameters', 'varepsilon_1', 'parametrizing', 'the', 'inequality', 'bewteen', '12', 'and', '13', 'elements', 'and', 'varepsilon_2', 'parametrizing', 'the', 'inequality', 'bewteen', '22', 'and', '33', 'elements', 'we', 'show', 'that', 'the', 'magnitude', 'of', 'theta_13', 'is', 'essentially', 'controlled', 'by', 'varepsilon_1', 'whereas', 'the', 'deviation', 'of', 'theta_23', 'from', 'maximality', 'is', 'controlled', 'by', 'varepsilon_2', 'the', 'measured', 'value', 'of', 'theta_13', 'requires', 'muleftrightarrowtau', 'symmetry', 'to', 'be', 'badly', 'broken', 'for', 'both', 'normal', 'hierarchy', 'and', 'inverted', 'hierarchy', 'though', 'the', 'level', 'of', 'breaking', 'depends', 'sensitively', 'on', 'the', 'hierarchy', 'in', 'this', 'paper', 'we', 'obtain', 'constraints', 'on', 'the', 'parameters', 'of', 'neutrino', 'mass', 'matrix', 'including', 'the', 'symmetry', 'breaking', 'parameters', 'using', 'the', 'precision', 'oscillation', 'data', 'we', 'find', 'that', 'this', 'precision', 'data', 'constrains', 'all', 'elements', 'of', 'neutrino', 'mass', 'matrix', 'to', 'be', 'in', 'very', 'narrow', 'ranges', 'we', 'also', 'consider', 'muleftrightarrow', 'tau', 'exchange', 'symmetry', 'in', 'the', 'case', 'of', 'inverted', 'hierarchy', 'and', 'find', 'that', 'it', 'provides', 'an', 'explanation', 'of', 'neutrino', 'mixing', 'angles', 'with', 'some', 'finetuning']]
|
[-0.14683425359358576, 0.2547644183190293, 0.00015892349480790027, 0.1101092041799541, -0.06919583194007344, -0.15567512423087387, 0.07056598745576265, 0.3063283657650166, -0.27804757799814517, -0.3419071706259584, 0.10147320067242502, -0.27852939558710826, -0.0717446354609181, 0.1691878159936676, -0.00197749359017991, 0.014630248368856437, 0.05838443233477982, -0.028580235200160075, -0.1682388615792003, -0.18187813338900402, 0.32149784212704113, 0.031591031868803375, 0.24575789207889837, 0.05553177449535802, 0.09516680556005164, -0.05155382905294128, 0.003783628225643584, -0.07561327742432501, -0.12299017152241852, 0.028662322538637337, 0.18608362367995915, 0.10519273075190907, 0.07993444402087876, -0.32991921743922964, -0.09451968369366442, 0.16217093105289213, 0.11946861359830747, 0.08552994259306171, -0.05922936533325094, -0.28481261692619186, 0.04918673160322447, -0.17109105059446053, -0.1654071190835353, -0.07550149286002357, -0.0219591329012938, -0.06428797478648893, -0.34944930689488635, 0.15839686748392737, -0.020868710878780707, 0.058972542610098704, 0.00907094294992969, -0.18061463182118345, -0.056443754155089725, 0.06979718769187147, 0.14767119611868576, -0.028891816968562706, 0.0750049104630152, -0.10927175952429025, -0.032221837519133024, 0.427271788959649, -0.04654607245515279, -0.18436145130049517, 0.05509364282950125, -0.20513925978547318, -0.15303678306790583, 0.08327717616401137, 0.09939447948535746, 0.0237904170978854, -0.11254910584737329, 0.11559434670817474, -0.11141060435205717, 0.21797114118259955, 0.08395128543092374, -0.017757011394194784, 0.19983038012968732, 0.1755651060554962, 0.12463741626422059, -0.037383570689386, -0.08308890130153505, -0.0496032241449513, -0.337377156844323, -0.0654691368752615, -0.1505884052572544, 0.08080765158136158, -0.12640289833685298, -0.09302447186138957, 0.4310772824646073, 0.1458514976325108, 0.2513765092552739, 0.062352782629301495, 0.22974792510974518, 0.1046148992900271, 0.08814054110305423, 0.012788005261137051, 0.3212079753799852, 0.1394592679459899, 0.07945491662471892, -0.26335587243777403, 0.0813543816404219, 0.05031744794092795]
|
1,803.04144
|
Solving Markov decision processes for network-level post-hazard recovery
via simulation optimization and rollout
|
Computation of optimal recovery decisions for community resilience assurance
post-hazard is a combinatorial decision-making problem under uncertainty. It
involves solving a large-scale optimization problem, which is significantly
aggravated by the introduction of uncertainty. In this paper, we draw upon
established tools from multiple research communities to provide an effective
solution to this challenging problem. We provide a stochastic model of damage
to the water network (WN) within a testbed community following a severe
earthquake and compute near-optimal recovery actions for restoration of the
water network. We formulate this stochastic decision-making problem as a Markov
Decision Process (MDP), and solve it using a popular class of heuristic
algorithms known as rollout. A simulation-based representation of MDPs is
utilized in conjunction with rollout and the Optimal Computing Budget
Allocation (OCBA) algorithm to address the resulting stochastic simulation
optimization problem. Our method employs non-myopic planning with efficient use
of simulation budget. We show, through simulation results, that rollout fused
with OCBA performs competitively with respect to rollout with total equal
allocation (TEA) at a meagre simulation budget of 5-10% of rollout with TEA,
which is a crucial step towards addressing large-scale community recovery
problems following natural disasters.
|
math.OC cs.CE cs.SY
|
computation of optimal recovery decisions for community resilience assurance posthazard is a combinatorial decisionmaking problem under uncertainty it involves solving a largescale optimization problem which is significantly aggravated by the introduction of uncertainty in this paper we draw upon established tools from multiple research communities to provide an effective solution to this challenging problem we provide a stochastic model of damage to the water network wn within a testbed community following a severe earthquake and compute nearoptimal recovery actions for restoration of the water network we formulate this stochastic decisionmaking problem as a markov decision process mdp and solve it using a popular class of heuristic algorithms known as rollout a simulationbased representation of mdps is utilized in conjunction with rollout and the optimal computing budget allocation ocba algorithm to address the resulting stochastic simulation optimization problem our method employs nonmyopic planning with efficient use of simulation budget we show through simulation results that rollout fused with ocba performs competitively with respect to rollout with total equal allocation tea at a meagre simulation budget of 510 of rollout with tea which is a crucial step towards addressing largescale community recovery problems following natural disasters
|
[['computation', 'of', 'optimal', 'recovery', 'decisions', 'for', 'community', 'resilience', 'assurance', 'posthazard', 'is', 'a', 'combinatorial', 'decisionmaking', 'problem', 'under', 'uncertainty', 'it', 'involves', 'solving', 'a', 'largescale', 'optimization', 'problem', 'which', 'is', 'significantly', 'aggravated', 'by', 'the', 'introduction', 'of', 'uncertainty', 'in', 'this', 'paper', 'we', 'draw', 'upon', 'established', 'tools', 'from', 'multiple', 'research', 'communities', 'to', 'provide', 'an', 'effective', 'solution', 'to', 'this', 'challenging', 'problem', 'we', 'provide', 'a', 'stochastic', 'model', 'of', 'damage', 'to', 'the', 'water', 'network', 'wn', 'within', 'a', 'testbed', 'community', 'following', 'a', 'severe', 'earthquake', 'and', 'compute', 'nearoptimal', 'recovery', 'actions', 'for', 'restoration', 'of', 'the', 'water', 'network', 'we', 'formulate', 'this', 'stochastic', 'decisionmaking', 'problem', 'as', 'a', 'markov', 'decision', 'process', 'mdp', 'and', 'solve', 'it', 'using', 'a', 'popular', 'class', 'of', 'heuristic', 'algorithms', 'known', 'as', 'rollout', 'a', 'simulationbased', 'representation', 'of', 'mdps', 'is', 'utilized', 'in', 'conjunction', 'with', 'rollout', 'and', 'the', 'optimal', 'computing', 'budget', 'allocation', 'ocba', 'algorithm', 'to', 'address', 'the', 'resulting', 'stochastic', 'simulation', 'optimization', 'problem', 'our', 'method', 'employs', 'nonmyopic', 'planning', 'with', 'efficient', 'use', 'of', 'simulation', 'budget', 'we', 'show', 'through', 'simulation', 'results', 'that', 'rollout', 'fused', 'with', 'ocba', 'performs', 'competitively', 'with', 'respect', 'to', 'rollout', 'with', 'total', 'equal', 'allocation', 'tea', 'at', 'a', 'meagre', 'simulation', 'budget', 'of', '510', 'of', 'rollout', 'with', 'tea', 'which', 'is', 'a', 'crucial', 'step', 'towards', 'addressing', 'largescale', 'community', 'recovery', 'problems', 'following', 'natural', 'disasters']]
|
[-0.08574665296755578, -0.019633415964619285, -0.07116678390248689, 0.061799294276620315, -0.103490114826517, -0.1478616648899558, 0.09680415223743863, 0.416410769878397, -0.28825326678319113, -0.33866421594050444, 0.15395992349823648, -0.2265183891778207, -0.1765793910305275, 0.1638554236383571, -0.12425933442553981, 0.1210421589029156, 0.14887812713967616, 0.008591348471266419, -0.007711923645757386, -0.2531331346379881, 0.25058955778895886, 0.12872519834715987, 0.30207254120254334, 0.011625388082412081, 0.14233760476549223, 0.01725336017096703, -0.0291626591795873, 0.021409012865726405, -0.10266917727224693, 0.14917736790399788, 0.35674698005031946, 0.22464405950254848, 0.401928638885777, -0.42942233807071273, -0.21251580081748075, 0.11498789864498642, 0.11551587030452978, 0.09497884796697109, -0.056428765145984966, -0.24680690707389227, 0.08839924017581896, -0.199119245071809, -0.052208001694171544, -0.06156294257140037, -0.054737733749039084, -0.01724174684189625, -0.33373365988840886, 0.031107897936701344, 0.0040376118993981905, 0.019134673323559084, -0.07108078743574166, -0.13605782374758849, 0.06828812994338937, 0.12319747375362773, 0.04835045712531338, 0.026045382346900313, 0.16820453727118595, -0.12135873186958897, -0.19853904000339434, 0.41561610009713273, -0.004631684257735296, -0.19468043585423112, 0.15685487161576508, 0.02210764093300539, -0.19731130998356017, 0.15172685521712392, 0.23523146728504948, 0.13414867113814832, -0.1775463923101419, 0.014049355988690783, -0.06685131222499323, 0.14098314993376315, 0.018784534254533806, -0.043985573625307264, 0.1337415840952014, 0.2900302140414235, 0.19445029372282172, 0.16986637591917222, -0.024624334379416152, -0.14214314871765288, -0.2137799443867293, -0.11586685809690851, -0.15003906975058628, 0.01780945762329418, -0.09011722144110611, -0.16234836769386282, 0.3442609831162719, 0.20638256919325434, 0.11810077054512486, 0.1341957413464228, 0.3476160129570623, 0.09917944246382793, -0.005601198279860516, 0.13330057689670435, 0.14297356890615306, 0.0586928992397776, 0.11746644183090821, -0.2182735081242407, 0.12653632067652784, 0.04880790042177265]
|
1,803.04145
|
Nonlinear stability at the Eckhaus boundary
|
The real Ginzburg-Landau equation possesses a family of spatially periodic
equilibria. If the wave number of an equilibrium is strictly below the so
called Eckhaus boundary the equilibrium is known to be spectrally and
diffusively stable, i.e., stable w.r.t. small spatially localized
perturbations. If the wave number is above the Eckhaus boundary the equilibrium
is unstable. Exactly at the boundary spectral stability holds. The purpose of
the present paper is to establish the diffusive stability of these equilibria.
The limit profile is determined by a nonlinear equation since a nonlinear term
turns out to be marginal w.r.t. the linearized dynamics.
|
math.AP math-ph math.MP
|
the real ginzburglandau equation possesses a family of spatially periodic equilibria if the wave number of an equilibrium is strictly below the so called eckhaus boundary the equilibrium is known to be spectrally and diffusively stable ie stable wrt small spatially localized perturbations if the wave number is above the eckhaus boundary the equilibrium is unstable exactly at the boundary spectral stability holds the purpose of the present paper is to establish the diffusive stability of these equilibria the limit profile is determined by a nonlinear equation since a nonlinear term turns out to be marginal wrt the linearized dynamics
|
[['the', 'real', 'ginzburglandau', 'equation', 'possesses', 'a', 'family', 'of', 'spatially', 'periodic', 'equilibria', 'if', 'the', 'wave', 'number', 'of', 'an', 'equilibrium', 'is', 'strictly', 'below', 'the', 'so', 'called', 'eckhaus', 'boundary', 'the', 'equilibrium', 'is', 'known', 'to', 'be', 'spectrally', 'and', 'diffusively', 'stable', 'ie', 'stable', 'wrt', 'small', 'spatially', 'localized', 'perturbations', 'if', 'the', 'wave', 'number', 'is', 'above', 'the', 'eckhaus', 'boundary', 'the', 'equilibrium', 'is', 'unstable', 'exactly', 'at', 'the', 'boundary', 'spectral', 'stability', 'holds', 'the', 'purpose', 'of', 'the', 'present', 'paper', 'is', 'to', 'establish', 'the', 'diffusive', 'stability', 'of', 'these', 'equilibria', 'the', 'limit', 'profile', 'is', 'determined', 'by', 'a', 'nonlinear', 'equation', 'since', 'a', 'nonlinear', 'term', 'turns', 'out', 'to', 'be', 'marginal', 'wrt', 'the', 'linearized', 'dynamics']]
|
[-0.20282363189384342, 0.16194277720191166, -0.10282224070746451, 0.05462585982168093, -0.0457218686491251, -0.15168513087090105, -0.01618443988612853, 0.29131521604955196, -0.3315365185495466, -0.18979869727045298, 0.14304236145922913, -0.2681208428181708, -0.12392453361302615, 0.10667611492797732, -0.0033691139740403744, 0.06485488458536565, 0.04161851450800896, 0.0760825833119452, -0.013306041102623567, -0.1941454922221601, 0.37503485087305305, 0.030831555584445596, 0.25147869346663354, 0.009418683843687176, 0.07495165176689625, -0.07260036677587778, 0.07081867814064026, 0.07362899074330925, -0.1536412257514894, 0.0194338364462601, 0.2078148383605003, 0.03998634548857808, 0.2930335357040167, -0.38628010424319653, -0.2243591099139303, 0.1420267355639953, 0.14990191399119795, 0.09850611011497676, 0.03386567347537493, -0.2557996160257608, 0.12725330526009201, -0.06618164846673608, -0.2562730186106637, -0.06536643451545388, 0.030366946605499833, 0.052295649498701094, -0.2917106581106782, 0.10974296892527491, 0.08137441243510693, 0.0026864533871412276, -0.11284125313162803, -0.031159474169835447, -0.13010643699672073, 0.06015760344918817, 0.03843675119569525, -0.014537265261169522, 0.08998599736019969, -0.09984659200534224, -0.006285405103117227, 0.3794039230718045, -0.0877804958820343, -0.255547202337475, 0.16098804489709437, -0.1360009604250081, -0.05378666983917355, 0.20665003885049374, 0.07532164325937629, 0.17167225869372488, -0.14960983401804698, 0.12321467357629444, -0.06565998702397337, 0.19386137304827572, 0.10051768483011983, -0.00947033756878227, 0.21276760736480355, 0.14935434881597756, 0.19208091442473232, 0.16958308743080125, -0.060788764965254816, -0.17926690521650016, -0.3121911307051778, -0.0902878675237298, -0.15891278421506286, 0.09102698229340604, -0.0643046677413804, -0.2555250152572989, 0.3837821662425995, 0.09366345676593482, 0.1381918961601332, 0.06930566350463778, 0.25134505462367085, 0.22564575813710688, -0.054057505121454595, 0.13017173744738103, 0.28326586350100114, 0.16095265058800579, 0.09805361290462315, -0.24848620116710662, 0.060763106578961015, 0.07871063970029354]
|
1,803.04146
|
The space of cubic surfaces equipped with a line
|
The Cayley--Salmon theorem implies the existence of a 27-sheeted covering
space specifying lines contained in smooth cubic surfaces over $\mathbb{C}$. In
this paper we compute the rational cohomology of the total space of this cover,
using the spectral sequence in the method of simplicial resolution developed by
Vassiliev. The covering map is an isomorphism in cohomology (in fact of mixed
Hodge structures) and the cohomology ring is isomorphic to that of
$PGL(4,\mathbb{C})$. We derive as a consequence of our theorem that over the
finite field $\mathbb{F}_q$ the average number of lines on a cubic surface
equals 1 (away from finitely many characteristics); this average is $1 +
O(q^{-1/2})$ by a standard application of the Weil conjectures.
|
math.AG math.GT math.NT
|
the cayleysalmon theorem implies the existence of a 27sheeted covering space specifying lines contained in smooth cubic surfaces over mathbbc in this paper we compute the rational cohomology of the total space of this cover using the spectral sequence in the method of simplicial resolution developed by vassiliev the covering map is an isomorphism in cohomology in fact of mixed hodge structures and the cohomology ring is isomorphic to that of pgl4mathbbc we derive as a consequence of our theorem that over the finite field mathbbf_q the average number of lines on a cubic surface equals 1 away from finitely many characteristics this average is 1 oq12 by a standard application of the weil conjectures
|
[['the', 'cayleysalmon', 'theorem', 'implies', 'the', 'existence', 'of', 'a', '27sheeted', 'covering', 'space', 'specifying', 'lines', 'contained', 'in', 'smooth', 'cubic', 'surfaces', 'over', 'mathbbc', 'in', 'this', 'paper', 'we', 'compute', 'the', 'rational', 'cohomology', 'of', 'the', 'total', 'space', 'of', 'this', 'cover', 'using', 'the', 'spectral', 'sequence', 'in', 'the', 'method', 'of', 'simplicial', 'resolution', 'developed', 'by', 'vassiliev', 'the', 'covering', 'map', 'is', 'an', 'isomorphism', 'in', 'cohomology', 'in', 'fact', 'of', 'mixed', 'hodge', 'structures', 'and', 'the', 'cohomology', 'ring', 'is', 'isomorphic', 'to', 'that', 'of', 'pgl4mathbbc', 'we', 'derive', 'as', 'a', 'consequence', 'of', 'our', 'theorem', 'that', 'over', 'the', 'finite', 'field', 'mathbbf_q', 'the', 'average', 'number', 'of', 'lines', 'on', 'a', 'cubic', 'surface', 'equals', '1', 'away', 'from', 'finitely', 'many', 'characteristics', 'this', 'average', 'is', '1', 'oq12', 'by', 'a', 'standard', 'application', 'of', 'the', 'weil', 'conjectures']]
|
[-0.17306909539703547, 0.042263265980961605, -0.10661304277683874, 0.026650451346670576, -0.03760624845433215, -0.055675896300402074, 0.0014106116494596271, 0.32015004499615834, -0.33975484657691724, -0.263972863521693, 0.09426191624515923, -0.21617391855189844, -0.12320399706784103, 0.20702707378950436, -0.1516636796545104, -0.05261925300562455, 0.011786286159934076, 0.08161924041425143, -0.08499430319144656, -0.3053614279987024, 0.39684385320703897, -0.05780455865897238, 0.20622208513252968, 0.06356236855832062, 0.10756061109298441, 0.01863376232462802, -0.01829429263099363, -0.009116039284500792, -0.1638746322305451, 0.16610115047244886, 0.2906986062111433, 0.08679045506869443, 0.21836289131585676, -0.3468507173654091, -0.1658106959491436, 0.1814182836512503, 0.13579827738132216, 0.017899356291828945, 0.004591066401709603, -0.21502586126527085, 0.12387586104783363, -0.14821128577438816, -0.1587209028990141, -0.020105606036460295, 0.049355107714031225, 0.04418555832151989, -0.1945450754886094, 0.0051595953409560025, 0.08124335905137871, 0.1640651803131082, -0.07393238542551574, -0.08005487681033888, -0.0734377796366711, 0.07921869856155743, -0.02813002456969116, 0.061675423049434484, 0.07166886283916288, -0.11406519403889044, -0.11311773676425219, 0.37784934158636524, -0.10929729753739334, -0.1722661126654462, 0.09479586647025176, -0.16446244176976116, -0.16316048373950512, 0.21700498963972287, 0.08829270138604832, 0.18683211887504772, 0.00934455035686759, 0.1991518214381358, -0.15479549513630836, 0.1154467315666677, 0.12604818659435427, -0.018527610705599988, 0.15537217576430912, 0.0983595435058565, 0.10156548767840182, 0.14694529741557613, -0.06089075836644042, -0.0639700416424083, -0.37568553098078283, -0.19915319142663584, -0.1920544280770368, 0.1283065043140336, -0.11782793390102597, -0.17901011901455735, 0.42669171129819006, 0.09424138136507411, 0.18732094259238302, 0.1120854173454323, 0.2613450485514477, 0.05961811389092223, 0.0816336451430938, 0.03767282744021421, 0.12840406084848968, 0.21781392561388202, 0.001191605329430396, -0.13365635625502495, -0.025422848869181638, 0.17757803534082736]
|
1,803.04147
|
Biaxial strain tuned electronic structures and power factor in Janus
Transition Metal Dichalchogenide monolayers
|
Tuning physical properties of transition metal dichalcogenide (TMD)
monolayers by strain engineering have most widely studied, and recently Janus
TMD monolayer MoSSe has been synthesized. In this work, we systematically study
biaxial strain dependence of electronic structures and transport properties of
Janus TMD MXY (M = Mo or W, X/Y = S, Se, or Te) monolayer by using generalized
gradient approximation (GGA) plus spin-orbit coupling (SOC). It is found that
SOC has a noteworthy detrimental influence on power factor in p-type MoSSe,
WSSe, n-type WSTe, p-type MoSeTe and WSeTe, and has a negligible influence on
one in n-type MoSSe, MoSTe, p-type WSTe and n-type MoSeTe. These can be
understood by considering SOC effects on their valence and conduction bands.
For all six monolayers, the energy band gap firstly increases, and then
decreases, when strain changes from compressive one to tensile one. It is found
that strain can tune strength of bands convergence of both valence and
conduction bands by changing the numbers and relative position of valence band
extrema (VBE) or conduction band extrema (CBE), which can produce very
important effects on their electronic transport properties. By applying
appropriate compressive or tensile strain, both n- or p-type Seebeck
coefficient can be enhanced by strain-induced band convergence, and then the
power factor can be improved. Our works further enrich studies on strain
dependence of electronic structures and transport properties of new-style TMD
monolayers, and motivate farther experimental works.
|
cond-mat.mtrl-sci
|
tuning physical properties of transition metal dichalcogenide tmd monolayers by strain engineering have most widely studied and recently janus tmd monolayer mosse has been synthesized in this work we systematically study biaxial strain dependence of electronic structures and transport properties of janus tmd mxy m mo or w xy s se or te monolayer by using generalized gradient approximation gga plus spinorbit coupling soc it is found that soc has a noteworthy detrimental influence on power factor in ptype mosse wsse ntype wste ptype mosete and wsete and has a negligible influence on one in ntype mosse moste ptype wste and ntype mosete these can be understood by considering soc effects on their valence and conduction bands for all six monolayers the energy band gap firstly increases and then decreases when strain changes from compressive one to tensile one it is found that strain can tune strength of bands convergence of both valence and conduction bands by changing the numbers and relative position of valence band extrema vbe or conduction band extrema cbe which can produce very important effects on their electronic transport properties by applying appropriate compressive or tensile strain both n or ptype seebeck coefficient can be enhanced by straininduced band convergence and then the power factor can be improved our works further enrich studies on strain dependence of electronic structures and transport properties of newstyle tmd monolayers and motivate farther experimental works
|
[['tuning', 'physical', 'properties', 'of', 'transition', 'metal', 'dichalcogenide', 'tmd', 'monolayers', 'by', 'strain', 'engineering', 'have', 'most', 'widely', 'studied', 'and', 'recently', 'janus', 'tmd', 'monolayer', 'mosse', 'has', 'been', 'synthesized', 'in', 'this', 'work', 'we', 'systematically', 'study', 'biaxial', 'strain', 'dependence', 'of', 'electronic', 'structures', 'and', 'transport', 'properties', 'of', 'janus', 'tmd', 'mxy', 'm', 'mo', 'or', 'w', 'xy', 's', 'se', 'or', 'te', 'monolayer', 'by', 'using', 'generalized', 'gradient', 'approximation', 'gga', 'plus', 'spinorbit', 'coupling', 'soc', 'it', 'is', 'found', 'that', 'soc', 'has', 'a', 'noteworthy', 'detrimental', 'influence', 'on', 'power', 'factor', 'in', 'ptype', 'mosse', 'wsse', 'ntype', 'wste', 'ptype', 'mosete', 'and', 'wsete', 'and', 'has', 'a', 'negligible', 'influence', 'on', 'one', 'in', 'ntype', 'mosse', 'moste', 'ptype', 'wste', 'and', 'ntype', 'mosete', 'these', 'can', 'be', 'understood', 'by', 'considering', 'soc', 'effects', 'on', 'their', 'valence', 'and', 'conduction', 'bands', 'for', 'all', 'six', 'monolayers', 'the', 'energy', 'band', 'gap', 'firstly', 'increases', 'and', 'then', 'decreases', 'when', 'strain', 'changes', 'from', 'compressive', 'one', 'to', 'tensile', 'one', 'it', 'is', 'found', 'that', 'strain', 'can', 'tune', 'strength', 'of', 'bands', 'convergence', 'of', 'both', 'valence', 'and', 'conduction', 'bands', 'by', 'changing', 'the', 'numbers', 'and', 'relative', 'position', 'of', 'valence', 'band', 'extrema', 'vbe', 'or', 'conduction', 'band', 'extrema', 'cbe', 'which', 'can', 'produce', 'very', 'important', 'effects', 'on', 'their', 'electronic', 'transport', 'properties', 'by', 'applying', 'appropriate', 'compressive', 'or', 'tensile', 'strain', 'both', 'n', 'or', 'ptype', 'seebeck', 'coefficient', 'can', 'be', 'enhanced', 'by', 'straininduced', 'band', 'convergence', 'and', 'then', 'the', 'power', 'factor', 'can', 'be', 'improved', 'our', 'works', 'further', 'enrich', 'studies', 'on', 'strain', 'dependence', 'of', 'electronic', 'structures', 'and', 'transport', 'properties', 'of', 'newstyle', 'tmd', 'monolayers', 'and', 'motivate', 'farther', 'experimental', 'works']]
|
[-0.12118357671996612, 0.16837709238385096, -0.021616737812700307, -0.013091547240548064, -0.02494007829993375, -0.18128373667091263, 0.11473334174329546, 0.4702976129197499, -0.2957888387450989, -0.3028251681080611, -0.024432889066877562, -0.3046640787771985, -0.17519580890841194, 0.15716810398576822, 0.03984708174003141, 0.007554147317454121, -0.006880611797034936, -0.16022526030020232, -0.1362254626991783, -0.22637121829616821, 0.25784105207084823, 0.0615037202507282, 0.35827284848946556, 0.1259621175296049, -0.028696710691101066, 0.022735893949988838, 0.1268026931925545, 0.07476964873657971, -0.14591779450800682, 0.059668782238396376, 0.2465369531980781, -0.14471263803290257, 0.2373527359531931, -0.43290106881932733, -0.21723928826191186, -0.049334125708698766, 0.12365636022418346, 0.09438909064894624, -0.05414804060976103, -0.25205370424143775, 0.08680538408477508, -0.15699636465420522, -0.04734940555767695, -0.11334551494362306, 0.02772224768577552, 0.010834311044227593, -0.2297043015244989, 0.09642081891121179, 0.045943296689234046, 0.062077593340195324, -0.08189576378872357, -0.23060431756618383, -0.17458767095976918, 0.04745624546360392, 0.09807008682860453, 0.03190325635889741, 0.2399838623435547, -0.08704687191863757, -0.099745821741332, 0.4131714801238686, -0.039316290687246805, -0.12745928044100047, 0.16437465572942114, -0.159582811948974, -0.05734650042225104, 0.1460632734052253, 0.15879682717812166, 0.09108803323020734, -0.12558344026994045, 0.11728070303695604, 0.03748146442925198, 0.14683195585670897, 0.10035791709659654, 0.10008739742242094, 0.21141240346090248, 0.16733486758082444, 0.04449202551551392, 0.08008915188838728, -0.10098439041911134, 0.04288021383607038, -0.12854579553465573, -0.18909046423964596, -0.251872693101177, 0.1317706743006088, -0.11180097483973664, -0.1565086814087791, 0.440123041577049, 0.09226910916377644, 0.12048441790076986, -0.07072776291629691, 0.19352297717092656, 0.13060703749509053, 0.08499687955420661, 0.052601988653629646, 0.30950262574805765, 0.15406709279060332, 0.08316836749783538, -0.23764181374102472, 0.11908123986754697, -0.012172178089569666]
|
1,803.04148
|
Gradient estimates for the perfect conductivity problem in anisotropic
media
|
We study the perfect conductivity problem when two perfectly conducting
inclusions are closely located to each other in an anisotropic background
medium. We establish optimal upper and lower gradient bounds for the solution
in any dimension which characterize the singular behavior of the electric field
as the distance between the inclusions goes to zero.
|
math.AP
|
we study the perfect conductivity problem when two perfectly conducting inclusions are closely located to each other in an anisotropic background medium we establish optimal upper and lower gradient bounds for the solution in any dimension which characterize the singular behavior of the electric field as the distance between the inclusions goes to zero
|
[['we', 'study', 'the', 'perfect', 'conductivity', 'problem', 'when', 'two', 'perfectly', 'conducting', 'inclusions', 'are', 'closely', 'located', 'to', 'each', 'other', 'in', 'an', 'anisotropic', 'background', 'medium', 'we', 'establish', 'optimal', 'upper', 'and', 'lower', 'gradient', 'bounds', 'for', 'the', 'solution', 'in', 'any', 'dimension', 'which', 'characterize', 'the', 'singular', 'behavior', 'of', 'the', 'electric', 'field', 'as', 'the', 'distance', 'between', 'the', 'inclusions', 'goes', 'to', 'zero']]
|
[-0.15013679391187099, 0.12718626349130688, -0.046933136235532365, 0.04304131419027086, -0.06708336625834582, -0.13921538640365558, 0.016737422854122188, 0.36016469988627015, -0.31555629345691866, -0.264270529806338, 0.12049388886791551, -0.3345508360890327, -0.12015461171890988, 0.15965911670139543, -0.03459723747369868, 0.01630352597890629, -0.05093455731898926, 0.07353427611222421, -0.07075469873638617, -0.22734722077708552, 0.32298919365361883, 0.004760864656418562, 0.31364361281265263, 0.06038113835233229, 0.05169193816578223, -0.0050728220699561965, 0.051509891688409776, 0.09609279286599269, -0.18191361404455234, 0.09973103887427391, 0.25733007004277575, 0.0072652672512318805, 0.218689673597476, -0.4298881675220198, -0.15598250827234653, 0.13478376652562507, 0.11867232725058717, 0.10281295609375876, -0.021832679743292154, -0.2331330241738922, 0.09378761025490584, -0.06708121151853076, -0.20393582724069279, 0.0352534030917687, -0.012052504076294738, 0.025293213375671593, -0.2894962631786863, 0.0747353316595157, 0.06287636021497073, 0.017309157690356694, -0.1469586216499684, -0.1352037164831051, 0.037120322334683604, 0.17282516245904844, 0.06897117763205811, -0.016667647964183102, 0.1123728308636971, -0.13944402969597527, -0.05452421603344933, 0.30457499681506306, -0.1166126355442598, -0.21185984956617984, 0.1889388408270423, -0.17652230479547548, -0.011109436111938622, 0.12166578362316445, 0.17608335755627463, 0.1418723565681527, -0.1638973173483262, 0.09236564412087857, -0.06745926801253248, 0.1363651653281758, 0.07741685495366929, 0.033894299132818426, 0.1733168358742087, 0.0933011736229269, 0.1980760389663003, 0.21549462223602286, -0.044450294976640076, -0.06794400468330693, -0.3052187345542566, -0.16507889739134246, -0.184186024815534, 0.03193363295523105, -0.15433321898362246, -0.25301991154534603, 0.2785171153653344, 0.12958488709948682, 0.23762819441725258, 0.032689092148319575, 0.31259863930581894, 0.12091121682681626, -0.013640836191674074, 0.15747615720869768, 0.2968993746434097, 0.19713884377765847, 0.06853387996347414, -0.22286517980198065, 0.038181271550625014, 0.08454032204355355]
|
1,803.04149
|
Quantum correlations for a simple kicked system with mixed phase space
|
We investigate both the classical and quantum dynamics for a simple kicked
system (the standard map) that classically has mixed phase space. For initial
conditions in a portion of the chaotic region that is close enough to the
regular region, the phenomenon of sticking leads to a power-law decay with time
of the classical correlation function of a simple observable. Quantum
mechanically, we find the same behavior, but with a smaller exponent. We
consider various possible explanations of this phenomenon, and settle on a
modification of the Meiss--Ott Markov tree model that takes into account
quantum limitations on the flux through a turnstile between regions
corresponding to states on the tree. Further work is needed to better
understand the quantum behavior.
|
nlin.CD quant-ph
|
we investigate both the classical and quantum dynamics for a simple kicked system the standard map that classically has mixed phase space for initial conditions in a portion of the chaotic region that is close enough to the regular region the phenomenon of sticking leads to a powerlaw decay with time of the classical correlation function of a simple observable quantum mechanically we find the same behavior but with a smaller exponent we consider various possible explanations of this phenomenon and settle on a modification of the meissott markov tree model that takes into account quantum limitations on the flux through a turnstile between regions corresponding to states on the tree further work is needed to better understand the quantum behavior
|
[['we', 'investigate', 'both', 'the', 'classical', 'and', 'quantum', 'dynamics', 'for', 'a', 'simple', 'kicked', 'system', 'the', 'standard', 'map', 'that', 'classically', 'has', 'mixed', 'phase', 'space', 'for', 'initial', 'conditions', 'in', 'a', 'portion', 'of', 'the', 'chaotic', 'region', 'that', 'is', 'close', 'enough', 'to', 'the', 'regular', 'region', 'the', 'phenomenon', 'of', 'sticking', 'leads', 'to', 'a', 'powerlaw', 'decay', 'with', 'time', 'of', 'the', 'classical', 'correlation', 'function', 'of', 'a', 'simple', 'observable', 'quantum', 'mechanically', 'we', 'find', 'the', 'same', 'behavior', 'but', 'with', 'a', 'smaller', 'exponent', 'we', 'consider', 'various', 'possible', 'explanations', 'of', 'this', 'phenomenon', 'and', 'settle', 'on', 'a', 'modification', 'of', 'the', 'meissott', 'markov', 'tree', 'model', 'that', 'takes', 'into', 'account', 'quantum', 'limitations', 'on', 'the', 'flux', 'through', 'a', 'turnstile', 'between', 'regions', 'corresponding', 'to', 'states', 'on', 'the', 'tree', 'further', 'work', 'is', 'needed', 'to', 'better', 'understand', 'the', 'quantum', 'behavior']]
|
[-0.10859209466687103, 0.1574237817727137, -0.13630178781641908, 0.10798078440302937, -0.03921692933327295, -0.14075124816784312, 0.08042728682173693, 0.3301854074493913, -0.2756550825770544, -0.25492591945038845, 0.057379118125493185, -0.24631660492428817, -0.14680672506224518, 0.19464995226945944, -0.02535404628652633, 0.05015427704654203, 0.044869861419289565, 0.05128960198076242, -0.05762553796381882, -0.19024914256220082, 0.3184625483445115, 0.06457742999648398, 0.25551843464620844, 0.03857760251430441, 0.0952249548247869, -0.01909091258383056, 0.04750174723088372, 0.022943299532866043, -0.15166520881402829, 0.059034413130365095, 0.16477891745830864, 0.08618306868501809, 0.2571281856156824, -0.42715200652514607, -0.23377655077752588, 0.13803438377789845, 0.1404396115344264, 0.12606653900555342, -0.026624524222171195, -0.26456788352744515, 0.08486004890912513, -0.14648668816667204, -0.11833989969647128, -0.0435266558250243, 0.028582386199138627, -0.05105255065151021, -0.2570382702849374, 0.06725091879710185, 0.08213057357448438, -0.0005459058798911158, -0.0273477485083998, -0.03045604924367325, 0.018892390440864687, 0.1375648736653557, 0.0011771779626700257, 0.015345370793361063, 0.1186892689563611, -0.13172738475548026, -0.11396354222852999, 0.37485822002318775, -0.06004993497270875, -0.1900552943633188, 0.20425214428331487, -0.19323942265357852, -0.10721033992445912, 0.12170505001736913, 0.15262206329017386, 0.08586139481299179, -0.12161948907185223, 0.08578711067622696, -0.036563734570133295, 0.17611195828788723, 0.022440184192531857, 0.045253506488328384, 0.2231904562266374, 0.16864874710382755, 0.07255247670171922, 0.20690517387476035, -0.08008415185969539, -0.2062182295418052, -0.30762704472588603, -0.15474957505564305, -0.14995277474426533, 0.053625736043072685, -0.08379329958221536, -0.1978870998329121, 0.41639195626201336, 0.13718873299639056, 0.25948254319200337, 0.06980066580220687, 0.26809530114093105, 0.13216053840727354, 0.04144871756742316, 0.05311702543961977, 0.2192688592755782, 0.1194038250741418, 0.0763867545010876, -0.24303360837550203, 0.08723927445109349, 0.04448965906496506]
|
1,803.0415
|
Model-independent constraint on the pion scalar form factor and light
quark masses
|
We investigate the pion scalar form factor in the Meiman-Okubo framework,
implementing the phase below the inelastic $K\bar K$ threshold, where it is
known from the $\pi\pi$ scalar isoscalar phase shift $\delta_0^0$ by Watson
theorem. State-of-the-art knowledge of the perturbative QCD expansion of the
scalar correlator and the phase shift $\delta_0^0$ is used as input. No
assumptions about the phase above the inelastic threshold or the possible zeros
of the form factor in the complex plane are necessary. We obtain a
model-independent constraint relating the sum of the light quark masses to the
slope and the curvature of the pion scalar form factor at the origin. The
recent lattice results for the light quark masses and the pion scalar radius
are found to satisfy this constraint. We obtain also a strong correlation
between the pion scalar radius and the curvature of the form factor, with
rather high values predicted for the curvature.
|
hep-ph
|
we investigate the pion scalar form factor in the meimanokubo framework implementing the phase below the inelastic kbar k threshold where it is known from the pipi scalar isoscalar phase shift delta_00 by watson theorem stateoftheart knowledge of the perturbative qcd expansion of the scalar correlator and the phase shift delta_00 is used as input no assumptions about the phase above the inelastic threshold or the possible zeros of the form factor in the complex plane are necessary we obtain a modelindependent constraint relating the sum of the light quark masses to the slope and the curvature of the pion scalar form factor at the origin the recent lattice results for the light quark masses and the pion scalar radius are found to satisfy this constraint we obtain also a strong correlation between the pion scalar radius and the curvature of the form factor with rather high values predicted for the curvature
|
[['we', 'investigate', 'the', 'pion', 'scalar', 'form', 'factor', 'in', 'the', 'meimanokubo', 'framework', 'implementing', 'the', 'phase', 'below', 'the', 'inelastic', 'kbar', 'k', 'threshold', 'where', 'it', 'is', 'known', 'from', 'the', 'pipi', 'scalar', 'isoscalar', 'phase', 'shift', 'delta_00', 'by', 'watson', 'theorem', 'stateoftheart', 'knowledge', 'of', 'the', 'perturbative', 'qcd', 'expansion', 'of', 'the', 'scalar', 'correlator', 'and', 'the', 'phase', 'shift', 'delta_00', 'is', 'used', 'as', 'input', 'no', 'assumptions', 'about', 'the', 'phase', 'above', 'the', 'inelastic', 'threshold', 'or', 'the', 'possible', 'zeros', 'of', 'the', 'form', 'factor', 'in', 'the', 'complex', 'plane', 'are', 'necessary', 'we', 'obtain', 'a', 'modelindependent', 'constraint', 'relating', 'the', 'sum', 'of', 'the', 'light', 'quark', 'masses', 'to', 'the', 'slope', 'and', 'the', 'curvature', 'of', 'the', 'pion', 'scalar', 'form', 'factor', 'at', 'the', 'origin', 'the', 'recent', 'lattice', 'results', 'for', 'the', 'light', 'quark', 'masses', 'and', 'the', 'pion', 'scalar', 'radius', 'are', 'found', 'to', 'satisfy', 'this', 'constraint', 'we', 'obtain', 'also', 'a', 'strong', 'correlation', 'between', 'the', 'pion', 'scalar', 'radius', 'and', 'the', 'curvature', 'of', 'the', 'form', 'factor', 'with', 'rather', 'high', 'values', 'predicted', 'for', 'the', 'curvature']]
|
[-0.14270506580884487, 0.1954256033012952, -0.08742904416686356, 0.10491195768472547, -0.08418439467752117, -0.08526114059846528, 0.08562452698377769, 0.31625908039608935, -0.19296585017235468, -0.2643139485689188, 0.01895931128270628, -0.29626542999600336, -0.09088832454058952, 0.11771872444910966, 0.0898629491655341, 0.0808428453046571, -0.0068698506247227556, 0.10919231328487224, -0.11293003420747928, -0.19863501341785272, 0.382854963746847, 0.014931906759430538, 0.2152927505493855, 0.16370051000760683, 0.039480945002904395, 0.002924372807502845, -0.005403694527112687, -0.0661956217904754, -0.16335610624723482, 0.05213649866374715, 0.16517852301885133, 0.06124490476675973, 0.14117952083416332, -0.331291174614765, -0.17353071875882564, 0.13739424818950946, 0.10948551728063269, 0.07873479810401501, -0.004134870993146142, -0.27700703575072305, 0.09408376244396366, -0.12864874456916622, -0.17355180092908393, -0.0899635645197026, -0.02217499027992383, -0.04126714998301094, -0.3142732623779517, 0.1270478601235548, 0.023171211691536256, 0.009606428820615178, -0.04263734440504271, -0.21406602172415382, 0.0004498868107499666, 0.079775687109753, 0.11553606114331756, 0.10113418847630849, 0.15485889859041138, -0.17938381968843226, -0.04761761751770665, 0.3962057696297666, -0.09389195270490962, -0.14740245633400878, 0.05896059708941161, -0.1739654549588727, -0.07774293530633711, 0.15370839271102324, 0.15825785975286502, 0.0764673212419776, -0.15153350972798685, 0.0987094486893975, -0.02999484722675225, 0.20817361855941102, 0.1459382907410356, 0.044950012784506756, 0.22194389430250946, 0.1273684608349145, 0.008893974587962723, 0.10234234334796125, -0.06559714990119074, -0.11817839243703689, -0.36608711398200483, -0.1055165856131445, -0.12809300334393262, 0.07343122376505261, -0.16051496098408574, -0.12777550025096793, 0.354339359978843, 0.06908862196550464, 0.2424820397659791, 0.05688151546340707, 0.31534364759391603, 0.15558704784038224, 0.09425561804793134, 0.09992511906901634, 0.30397869824949925, 0.2281647116417645, 0.13475325748028344, -0.24846274559756137, -0.01925502504940632, 0.06581992523386976]
|
1,803.04151
|
Mittag-Leffler Euler integrator for a stochastic fractional order
equation with additive noise
|
Motivated by fractional derivative models in viscoelasticity, a class of
semilinear stochastic Volterra integro-differential equations, and their
deterministic counterparts, are considered. A generalized exponential Euler
method, named here as the Mittag-Leffler Euler integrator, is used for the
temporal discretization, while the spatial discretization is performed by the
spectral Galerkin method. The temporal rate of strong convergence is found to
be (almost) twice compared to when the backward Euler method is used together
with a convolution quadrature for time discretization. Numerical experiments
that validate the theory are presented.
|
math.NA cs.NA
|
motivated by fractional derivative models in viscoelasticity a class of semilinear stochastic volterra integrodifferential equations and their deterministic counterparts are considered a generalized exponential euler method named here as the mittagleffler euler integrator is used for the temporal discretization while the spatial discretization is performed by the spectral galerkin method the temporal rate of strong convergence is found to be almost twice compared to when the backward euler method is used together with a convolution quadrature for time discretization numerical experiments that validate the theory are presented
|
[['motivated', 'by', 'fractional', 'derivative', 'models', 'in', 'viscoelasticity', 'a', 'class', 'of', 'semilinear', 'stochastic', 'volterra', 'integrodifferential', 'equations', 'and', 'their', 'deterministic', 'counterparts', 'are', 'considered', 'a', 'generalized', 'exponential', 'euler', 'method', 'named', 'here', 'as', 'the', 'mittagleffler', 'euler', 'integrator', 'is', 'used', 'for', 'the', 'temporal', 'discretization', 'while', 'the', 'spatial', 'discretization', 'is', 'performed', 'by', 'the', 'spectral', 'galerkin', 'method', 'the', 'temporal', 'rate', 'of', 'strong', 'convergence', 'is', 'found', 'to', 'be', 'almost', 'twice', 'compared', 'to', 'when', 'the', 'backward', 'euler', 'method', 'is', 'used', 'together', 'with', 'a', 'convolution', 'quadrature', 'for', 'time', 'discretization', 'numerical', 'experiments', 'that', 'validate', 'the', 'theory', 'are', 'presented']]
|
[-0.08656039521975935, 0.04332819767296314, -0.10977513082298697, 0.11317978758129409, -0.10300300281023843, -0.15706409501639762, -0.05218261633812311, 0.3817255046732467, -0.32453314568205127, -0.23950838550240144, 0.15347088262272848, -0.22880187453220374, -0.13262044717611252, 0.2162407555927833, -0.0508667529003973, 0.1706255755993409, 0.08242268138832745, -0.014079791761335286, -0.08397788932043845, -0.23682779706104648, 0.2909695323711882, 0.025187996113084084, 0.24327978420595842, -0.04620969656857544, 0.17873840791911916, -0.10402536512641557, -0.11759941285240581, 0.025734508268256812, -0.09083862907038105, 0.06763654437729683, 0.23862680761952618, 0.004729343667872593, 0.3473639414998992, -0.4104937796224037, -0.23947903296599785, 0.05480909000161564, 0.15802133699106963, 0.06466673283259673, -0.019159972108365304, -0.32819499250972406, 0.09742934798993085, -0.15851592544423437, -0.17321844326583777, -0.11497892669519816, -0.012886035191858637, 0.14010955721351329, -0.2988984938710928, 0.13021615944834875, 0.054974285120294356, 0.025174352506325506, -0.059723005700326556, -0.0962062226876017, -0.016265709520499598, 0.0017449756667430073, 0.039486375779191826, -0.017248335867135346, -0.006349756965820475, -0.07696669307890637, -0.1422293095919036, 0.38330675799656533, -0.12599282653402838, -0.3454232218343465, 0.13211397595446686, -0.09946117579037773, -0.07750194964009798, 0.17519998246503726, 0.16531648930033732, 0.204070628893658, -0.1518484163240211, 0.07461981928101795, 0.0010909621721540373, 0.17287183246821508, 0.08160917442452548, -0.007937422123919615, 0.025394758594961, 0.196722259298074, 0.09908994297957284, 0.1149643467345821, -0.07257001956218276, -0.18902947459284258, -0.3210802412238614, -0.15641485951605372, -0.19536763792536382, 0.01965502260424111, -0.11841951500629101, -0.1682470647950025, 0.3686876479086691, 0.13020520991292492, 0.08409250407725916, 0.1493936786642191, 0.2891341720161767, 0.25599896840231984, 0.020183179891486276, 0.05117548730158469, 0.17474800285926068, 0.19711308088688845, 0.17473015366068603, -0.2561384626241379, 0.0821163584745821, 0.24851692345892562]
|
1,803.04152
|
Imaging linear and circular polarization features in leaves with
complete Mueller matrix polarimetry
|
Spectropolarimetry of intact plant leaves allows to probe the molecular
architecture of vegetation photosynthesis in a non-invasive and non-destructive
way and, as such, can offer a wealth of physiological information. In addition
to the molecular signals due to the photosynthetic machinery, the cell
structure and its arrangement within a leaf can create and modify polarization
signals. Using Mueller matrix polarimetry with rotating retarder modulation, we
have visualized spatial variations in polarization in transmission around the
chlorophyll a absorbance band from 650 nm to 710 nm. We show linear and
circular polarization measurements of maple leaves and cultivated maize leaves
and discuss the corresponding Mueller matrices and the Mueller matrix
decompositions, which show distinct features in diattenuation, polarizance,
retardance and depolarization. Importantly, while normal leaf tissue shows a
typical split signal with both a negative and a positive peak in the induced
fractional circular polarization and circular dichroism, the signals close to
the veins only display a negative band. The results are similar to the negative
band as reported earlier for single macrodomains. We discuss the possible role
of the chloroplast orientation around the veins as a cause of this phenomenon.
Systematic artefacts are ruled out as three independent measurements by
different instruments gave similar results. These results provide better
insight into circular polarization measurements on whole leaves and options for
vegetation remote sensing using circular polarization.
|
q-bio.BM physics.bio-ph
|
spectropolarimetry of intact plant leaves allows to probe the molecular architecture of vegetation photosynthesis in a noninvasive and nondestructive way and as such can offer a wealth of physiological information in addition to the molecular signals due to the photosynthetic machinery the cell structure and its arrangement within a leaf can create and modify polarization signals using mueller matrix polarimetry with rotating retarder modulation we have visualized spatial variations in polarization in transmission around the chlorophyll a absorbance band from 650 nm to 710 nm we show linear and circular polarization measurements of maple leaves and cultivated maize leaves and discuss the corresponding mueller matrices and the mueller matrix decompositions which show distinct features in diattenuation polarizance retardance and depolarization importantly while normal leaf tissue shows a typical split signal with both a negative and a positive peak in the induced fractional circular polarization and circular dichroism the signals close to the veins only display a negative band the results are similar to the negative band as reported earlier for single macrodomains we discuss the possible role of the chloroplast orientation around the veins as a cause of this phenomenon systematic artefacts are ruled out as three independent measurements by different instruments gave similar results these results provide better insight into circular polarization measurements on whole leaves and options for vegetation remote sensing using circular polarization
|
[['spectropolarimetry', 'of', 'intact', 'plant', 'leaves', 'allows', 'to', 'probe', 'the', 'molecular', 'architecture', 'of', 'vegetation', 'photosynthesis', 'in', 'a', 'noninvasive', 'and', 'nondestructive', 'way', 'and', 'as', 'such', 'can', 'offer', 'a', 'wealth', 'of', 'physiological', 'information', 'in', 'addition', 'to', 'the', 'molecular', 'signals', 'due', 'to', 'the', 'photosynthetic', 'machinery', 'the', 'cell', 'structure', 'and', 'its', 'arrangement', 'within', 'a', 'leaf', 'can', 'create', 'and', 'modify', 'polarization', 'signals', 'using', 'mueller', 'matrix', 'polarimetry', 'with', 'rotating', 'retarder', 'modulation', 'we', 'have', 'visualized', 'spatial', 'variations', 'in', 'polarization', 'in', 'transmission', 'around', 'the', 'chlorophyll', 'a', 'absorbance', 'band', 'from', '650', 'nm', 'to', '710', 'nm', 'we', 'show', 'linear', 'and', 'circular', 'polarization', 'measurements', 'of', 'maple', 'leaves', 'and', 'cultivated', 'maize', 'leaves', 'and', 'discuss', 'the', 'corresponding', 'mueller', 'matrices', 'and', 'the', 'mueller', 'matrix', 'decompositions', 'which', 'show', 'distinct', 'features', 'in', 'diattenuation', 'polarizance', 'retardance', 'and', 'depolarization', 'importantly', 'while', 'normal', 'leaf', 'tissue', 'shows', 'a', 'typical', 'split', 'signal', 'with', 'both', 'a', 'negative', 'and', 'a', 'positive', 'peak', 'in', 'the', 'induced', 'fractional', 'circular', 'polarization', 'and', 'circular', 'dichroism', 'the', 'signals', 'close', 'to', 'the', 'veins', 'only', 'display', 'a', 'negative', 'band', 'the', 'results', 'are', 'similar', 'to', 'the', 'negative', 'band', 'as', 'reported', 'earlier', 'for', 'single', 'macrodomains', 'we', 'discuss', 'the', 'possible', 'role', 'of', 'the', 'chloroplast', 'orientation', 'around', 'the', 'veins', 'as', 'a', 'cause', 'of', 'this', 'phenomenon', 'systematic', 'artefacts', 'are', 'ruled', 'out', 'as', 'three', 'independent', 'measurements', 'by', 'different', 'instruments', 'gave', 'similar', 'results', 'these', 'results', 'provide', 'better', 'insight', 'into', 'circular', 'polarization', 'measurements', 'on', 'whole', 'leaves', 'and', 'options', 'for', 'vegetation', 'remote', 'sensing', 'using', 'circular', 'polarization']]
|
[-0.09582406971541818, 0.11884249291775245, -0.06094267654342915, 0.010400805829929402, -0.06356654604855694, -0.1424188739105037, 0.03623003435869231, 0.4235348024990706, -0.27041598497833275, -0.3079711206615861, 0.09030564948483741, -0.2947633829003481, -0.17305326085142067, 0.1911221401275556, -0.04893913865250389, 0.03944572728782464, 0.04771771914103126, -0.030590484824224242, -0.03577126680066669, -0.13062410420569204, 0.23073040009620477, 0.07205969402816381, 0.27385776735269424, 0.06210389506253126, 0.11452457170204086, 0.027971212632657415, -0.044927179623823775, 0.005814614387917275, -0.07729179787115231, 0.09576918439840716, 0.2716136044200378, 0.08796309443834971, 0.17325696332248308, -0.4189606619817493, -0.20260592310666725, 0.06359611126769608, 0.1254705822495002, 0.11213972786929771, -0.05422776330322176, -0.25482717301311236, 0.059315699509105986, -0.07937868241842969, -0.14312366631285872, -0.06634995493774129, 0.01876762066349651, -0.01173238341147451, -0.2390160807843662, 0.08588773261269439, 0.02814681175684111, 0.10125770668326094, -0.06899300383159734, -0.14853228379115133, -0.09189082509003563, 0.1211909622343389, -0.01321021677200905, -0.00865073995850156, 0.17816289604177382, -0.07493205625971829, -0.11517994260246478, 0.357419748399077, -0.07377761008683592, -0.14469728172174398, 0.14574870548367633, -0.21771831789457824, -0.08906198424530273, 0.15421649738239634, 0.1779533168074337, 0.09125971454927137, -0.12220808129733948, -0.011322892567558024, -0.034793889030517465, 0.17080506784542654, 0.15167620736359727, 0.05930065369620853, 0.2615908489735649, 0.14565527836783929, 0.04019079380977767, 0.1250104100780306, -0.16698168779298894, -0.001920894564354001, -0.20562043169846106, -0.13805646982983547, -0.11910952684939304, 0.04908362628667475, -0.0938584255623792, -0.14943840108766526, 0.4473643180362023, 0.09637118982866126, 0.21294208692306388, -0.008010127900510334, 0.28956906974935837, 0.028940923941070295, 0.09475219700757447, 0.015872777961977485, 0.25163382479294605, 0.1770180438874924, 0.12136058268174364, -0.23738692110235415, 0.09136600152020698, -0.06584117452271974]
|
1,803.04153
|
Local Limit Theorems for Poisson's Binomial in the Case of Infinite
Expectation
|
Let $ V_{n} = X_{1,n} + X_{2,n} + \cdots + X_{n,n}$ where $X_{i,n}$ are
Bernoulli random variables which take the value $1$ with probability $b(i;n)$.
Let $\lambda_{n} = \sum\limits_{i=1}^{n} b(i;n) $, $\lambda = \lim\limits_{n
\to \infty} \lambda_n,$ and $m_n = \max\limits_{1 \leq i \leq n} b(i;n)$. We
derive asymptotic results for $P(V_{n}=k)$ that hold without assuming that
$\lambda < +\infty$ or $m_n \to 0$. Also, we do not assume $k$ to be fixed, but
instead, our results hold uniformly for all $k$ which satisfy particular growth
conditions with respect to $n$. These results extend known Poisson local limit
theorems to the case when $\lambda = +\infty$. While our results apply to
triangular arrays, without the assumption that \(m_n \to 0\) they continue to
hold for sums of Bernoulli random variables. In this setting, our growth
conditions cover a range of values for $k$ not centered at $\lambda_n$, thus
complementing known local limit theorems based on approximation by the normal
distribution. In addition, we show that our local limit theorems apply to a
scheme of dependent random variables introduced in the work of Sevast'yanov.
|
math.PR
|
let v_n x_1n x_2n cdots x_nn where x_in are bernoulli random variables which take the value 1 with probability bin let lambda_n sumlimits_i1n bin lambda limlimits_n to infty lambda_n and m_n maxlimits_1 leq i leq n bin we derive asymptotic results for pv_nk that hold without assuming that lambda infty or m_n to 0 also we do not assume k to be fixed but instead our results hold uniformly for all k which satisfy particular growth conditions with respect to n these results extend known poisson local limit theorems to the case when lambda infty while our results apply to triangular arrays without the assumption that m_n to 0 they continue to hold for sums of bernoulli random variables in this setting our growth conditions cover a range of values for k not centered at lambda_n thus complementing known local limit theorems based on approximation by the normal distribution in addition we show that our local limit theorems apply to a scheme of dependent random variables introduced in the work of sevastyanov
|
[['let', 'v_n', 'x_1n', 'x_2n', 'cdots', 'x_nn', 'where', 'x_in', 'are', 'bernoulli', 'random', 'variables', 'which', 'take', 'the', 'value', '1', 'with', 'probability', 'bin', 'let', 'lambda_n', 'sumlimits_i1n', 'bin', 'lambda', 'limlimits_n', 'to', 'infty', 'lambda_n', 'and', 'm_n', 'maxlimits_1', 'leq', 'i', 'leq', 'n', 'bin', 'we', 'derive', 'asymptotic', 'results', 'for', 'pv_nk', 'that', 'hold', 'without', 'assuming', 'that', 'lambda', 'infty', 'or', 'm_n', 'to', '0', 'also', 'we', 'do', 'not', 'assume', 'k', 'to', 'be', 'fixed', 'but', 'instead', 'our', 'results', 'hold', 'uniformly', 'for', 'all', 'k', 'which', 'satisfy', 'particular', 'growth', 'conditions', 'with', 'respect', 'to', 'n', 'these', 'results', 'extend', 'known', 'poisson', 'local', 'limit', 'theorems', 'to', 'the', 'case', 'when', 'lambda', 'infty', 'while', 'our', 'results', 'apply', 'to', 'triangular', 'arrays', 'without', 'the', 'assumption', 'that', 'm_n', 'to', '0', 'they', 'continue', 'to', 'hold', 'for', 'sums', 'of', 'bernoulli', 'random', 'variables', 'in', 'this', 'setting', 'our', 'growth', 'conditions', 'cover', 'a', 'range', 'of', 'values', 'for', 'k', 'not', 'centered', 'at', 'lambda_n', 'thus', 'complementing', 'known', 'local', 'limit', 'theorems', 'based', 'on', 'approximation', 'by', 'the', 'normal', 'distribution', 'in', 'addition', 'we', 'show', 'that', 'our', 'local', 'limit', 'theorems', 'apply', 'to', 'a', 'scheme', 'of', 'dependent', 'random', 'variables', 'introduced', 'in', 'the', 'work', 'of', 'sevastyanov']]
|
[-0.09185023533372098, 0.16074643869172126, -0.07444696278270224, 0.018706062523072914, -0.03161156264489845, -0.17933184783357908, 0.07535609533352887, 0.36169120138511063, -0.2582064321552239, -0.21132042239700882, 0.08357939552327426, -0.27989081163370216, -0.05455886273891391, 0.16632721286938143, -0.060748179511660165, 0.014825840384497389, 0.025285130188636044, 0.07531228472533472, -0.05097249326474198, -0.3087472364991246, 0.29127971589674845, -0.0585067004951484, 0.21098869697683875, -0.011333350007257917, 0.05468770767945577, 0.048770970478653905, 0.03884241665330003, 0.0004689250552259824, -0.25020914632255237, 0.026503840017283117, 0.25426206938265, 0.07250874907545307, 0.26796447301064347, -0.35830744421657396, -0.15420560873497058, 0.23216407575288459, 0.19940192919388852, -0.024531952204073178, 0.03830207186436062, -0.23082511919167112, 0.21473440802245236, -0.09022121131146217, -0.18982425510938114, -0.06219740357414326, 0.04370370827724829, 0.08789538448190262, -0.40118337602025883, 0.06491750423806747, 0.16329834045677938, -0.0009705667664735195, -0.019439532984431615, -0.22702124628293163, 0.018813957830014473, 0.10509360010567916, 0.035259240668486146, 0.042370383929022974, 0.07038515992377035, -0.049092059312662216, -0.05857101504636161, 0.35180472797330686, -0.0719185960259946, -0.21998612815925084, 0.09421452156315996, -0.228432651053128, -0.22113449369447635, 0.06949045459794648, 0.12013861851985841, 0.15659766387235483, -0.05900663783241351, 0.17036414229386376, -0.09379980688407907, 0.1552958506022525, 0.1094648451968918, 0.03388951673884602, 0.09096991880522931, 0.019839532352874382, 0.11414646094456068, 0.08012766517520718, -0.024244095715146293, -0.05928245890912983, -0.34539376021746326, -0.09544598287765813, -0.21713500563808552, 0.15895861338238534, -0.1573227782267221, -0.12642596627530805, 0.22635600695646324, 0.1658394423806492, 0.24204213393181015, 0.2042837141040603, 0.17624264217721408, 0.11975426431745291, 0.0005076235776548, 0.09498462034663295, 0.0882346153656459, 0.1760081272038138, 0.07290796374436467, -0.11490787958781071, 0.019775832076009144, 0.08617506727767998]
|
1,803.04154
|
Algorithmic Differentiation for Domain Specific Languages
|
Algorithmic Differentiation (AD) can be used to automate the generation of
derivatives in arbitrary software projects. This will generate maintainable
derivatives, that are always consistent with the computation of the software.
If a domain specific language (DSL) is used in a software the state of the art
approach is to differentiate the DSL library with the same AD tool. The
drawback of this solution is the reduced performance since the compiler is no
longer able to optimize the e.g. SIMD operations. The new approach in this
paper integrates the types and operations of the DSL into the AD tool. It will
be an operator overloading tool that is generated from an abstract definition
of a DSL. This approach enables the compiler to optimize again e.g. for SIMD
operation since all calculations are still performed with the original data
types. This will also reduce the required memory for AD since the statements
inside the DLS implementation are no longer seen by the AD tool. The
implementation is presented in the paper and first results for the performance
of the solution are presented.
|
cs.MS
|
algorithmic differentiation ad can be used to automate the generation of derivatives in arbitrary software projects this will generate maintainable derivatives that are always consistent with the computation of the software if a domain specific language dsl is used in a software the state of the art approach is to differentiate the dsl library with the same ad tool the drawback of this solution is the reduced performance since the compiler is no longer able to optimize the eg simd operations the new approach in this paper integrates the types and operations of the dsl into the ad tool it will be an operator overloading tool that is generated from an abstract definition of a dsl this approach enables the compiler to optimize again eg for simd operation since all calculations are still performed with the original data types this will also reduce the required memory for ad since the statements inside the dls implementation are no longer seen by the ad tool the implementation is presented in the paper and first results for the performance of the solution are presented
|
[['algorithmic', 'differentiation', 'ad', 'can', 'be', 'used', 'to', 'automate', 'the', 'generation', 'of', 'derivatives', 'in', 'arbitrary', 'software', 'projects', 'this', 'will', 'generate', 'maintainable', 'derivatives', 'that', 'are', 'always', 'consistent', 'with', 'the', 'computation', 'of', 'the', 'software', 'if', 'a', 'domain', 'specific', 'language', 'dsl', 'is', 'used', 'in', 'a', 'software', 'the', 'state', 'of', 'the', 'art', 'approach', 'is', 'to', 'differentiate', 'the', 'dsl', 'library', 'with', 'the', 'same', 'ad', 'tool', 'the', 'drawback', 'of', 'this', 'solution', 'is', 'the', 'reduced', 'performance', 'since', 'the', 'compiler', 'is', 'no', 'longer', 'able', 'to', 'optimize', 'the', 'eg', 'simd', 'operations', 'the', 'new', 'approach', 'in', 'this', 'paper', 'integrates', 'the', 'types', 'and', 'operations', 'of', 'the', 'dsl', 'into', 'the', 'ad', 'tool', 'it', 'will', 'be', 'an', 'operator', 'overloading', 'tool', 'that', 'is', 'generated', 'from', 'an', 'abstract', 'definition', 'of', 'a', 'dsl', 'this', 'approach', 'enables', 'the', 'compiler', 'to', 'optimize', 'again', 'eg', 'for', 'simd', 'operation', 'since', 'all', 'calculations', 'are', 'still', 'performed', 'with', 'the', 'original', 'data', 'types', 'this', 'will', 'also', 'reduce', 'the', 'required', 'memory', 'for', 'ad', 'since', 'the', 'statements', 'inside', 'the', 'dls', 'implementation', 'are', 'no', 'longer', 'seen', 'by', 'the', 'ad', 'tool', 'the', 'implementation', 'is', 'presented', 'in', 'the', 'paper', 'and', 'first', 'results', 'for', 'the', 'performance', 'of', 'the', 'solution', 'are', 'presented']]
|
[-0.0863733231939005, 0.024567930438351246, -0.08056945872920158, 0.061746531074161726, -0.12420016886069547, -0.13352142933251862, 0.021022723325224625, 0.3976799955396033, -0.26900037462457765, -0.32116923671092285, 0.13631945286519845, -0.20803216955166579, -0.13313275381397888, 0.24404202255893767, -0.09146446267445829, 0.054333330865290776, 0.10854870324005059, 0.04808351514830115, -0.06321453015083313, -0.2467034355124963, 0.2804934291994889, 0.06311759937719251, 0.2862179114519315, 0.045610152231272086, 0.04090102332662174, -0.013451772685373686, -0.057851167040676374, -0.04393340011245638, -0.063263987420395, 0.15550305604971998, 0.31569314440609425, 0.22568279251620915, 0.29053785446105085, -0.4482358419928103, -0.1463361993298264, 0.06336221496191247, 0.12418637234117522, 0.09171648903940265, -0.014538329138384504, -0.2416048486773645, 0.13579253461829371, -0.2140894736425735, -0.09910764585079326, -0.09225436365064645, -0.01603677181928362, -0.0021111671352959677, -0.27109866263537835, -0.05117713774117713, 0.07311502568428893, 0.02729708758578861, -0.031546135065120065, -0.07085375204034026, -0.014888456358847038, 0.14984148884068618, 0.01579331240271995, 0.0624954081487775, 0.1079532083594086, -0.0955795142642037, -0.1453476397755417, 0.3976142704178121, -0.029774410485480372, -0.2393004635853168, 0.17285840003879854, -0.0261113613185303, -0.1450801733347397, 0.11575114585392342, 0.14298699801087955, 0.09753731469165801, -0.20235688940143387, 0.09308375678223285, 0.047303517868752636, 0.21517098123897177, 0.04150237383073947, 0.00835339210346053, 0.16244268426362898, 0.19252000808894623, 0.04599028394058429, 0.1490725164728764, -0.02413066381907595, -0.08129270651470355, -0.30398858515468546, -0.21154746876834013, -0.14816267165620373, -0.028651210785591307, -0.041634187444328015, -0.17527133427130687, 0.40894113044712427, 0.1981778335089452, 0.09621439147637693, 0.058124825833056594, 0.37352268258881505, 0.10107917634986383, 0.1620597158895049, 0.1218310013099558, 0.1666938794869415, 0.020823452484058164, 0.17840577238007804, -0.18082893418549503, 0.10561836097461495, 0.02920182564669515]
|
1,803.04155
|
Dimension-independent statistics of $Gl_n(F_q)$ via character
polynomials
|
Picking permutations at random, the expected number of k-cycles is known to
be 1/k and is, in particular, independent of the size of the permuted set. This
short note gives similar size-independent statistics of finite general linear
groups: ones that depend only on small minors. The proof technique uses
combinatorics of categories, motivated by representation stability, and applies
simultaneously to symmetric groups, finite linear groups and many other
settings.
|
math.CO math.GR
|
picking permutations at random the expected number of kcycles is known to be 1k and is in particular independent of the size of the permuted set this short note gives similar sizeindependent statistics of finite general linear groups ones that depend only on small minors the proof technique uses combinatorics of categories motivated by representation stability and applies simultaneously to symmetric groups finite linear groups and many other settings
|
[['picking', 'permutations', 'at', 'random', 'the', 'expected', 'number', 'of', 'kcycles', 'is', 'known', 'to', 'be', '1k', 'and', 'is', 'in', 'particular', 'independent', 'of', 'the', 'size', 'of', 'the', 'permuted', 'set', 'this', 'short', 'note', 'gives', 'similar', 'sizeindependent', 'statistics', 'of', 'finite', 'general', 'linear', 'groups', 'ones', 'that', 'depend', 'only', 'on', 'small', 'minors', 'the', 'proof', 'technique', 'uses', 'combinatorics', 'of', 'categories', 'motivated', 'by', 'representation', 'stability', 'and', 'applies', 'simultaneously', 'to', 'symmetric', 'groups', 'finite', 'linear', 'groups', 'and', 'many', 'other', 'settings']]
|
[-0.13105061625643377, 0.1603365221425243, -0.073774032169899, 0.05362558225338496, -0.1007714881291748, -0.15258431839554207, 0.042324331433822714, 0.3155010677334191, -0.3085079882023991, -0.2856161744482275, 0.101884846479389, -0.2566420472888411, -0.10975986820362184, 0.21672964208097995, -0.14922545784139546, -0.003363312694473543, 0.021261201881250177, 0.09730480786790882, -0.053604332504092134, -0.3485941274388545, 0.3195273673964961, -0.01431079829732577, 0.28394431171371887, -0.01650286220230054, 0.08672086123809003, 0.05879456615345417, -0.08144363644195424, 0.051820413170692824, -0.07070262687320002, 0.09682633634656668, 0.2811013504160919, 0.08533918554968441, 0.25028660099791444, -0.3615615676710571, -0.11002701506072628, 0.1657306603240389, 0.1292210825064314, 0.11873140032875582, -0.021063077838861965, -0.22915414605033246, 0.12498220440297239, -0.13856178918259515, -0.09990312150962975, -0.05246032982308795, 0.05457532337691257, 0.065861731801398, -0.2612876792647538, 0.04774149057819792, 0.1077709202789634, 0.06439679294345442, 0.02069286661276567, -0.1687681416734594, 0.03946134296205381, 0.1436544889786645, 0.026638398061681917, -0.026674147661559393, 0.1100626822318072, -0.05211610871618546, -0.10261805188180743, 0.3753767745920282, -0.00017598647273321083, -0.20473344667234283, 0.20511753367179114, -0.16214846682809023, -0.1891853523987305, 0.15161923184127046, 0.15521511079851483, 0.15665379985897004, -0.06874197442084551, 0.12249061795697291, -0.1505112808899603, 0.14030768898268486, 0.12078797490592452, 0.018657234650057995, 0.12515729835823827, 0.12026709263833861, 0.10758045226068952, 0.15336544148580078, 0.037193281592909196, -0.05138497516188933, -0.32212532695004903, -0.06951712472094358, -0.21839590264025374, 0.03107558835999689, -0.15301557036350394, -0.19763141196470815, 0.394304356119339, 0.10478733484194601, 0.17721219425278623, 0.14542902328505897, 0.2183803039724412, 0.06656202080552433, 0.07817103309502853, 0.052247516891878586, 0.1082756890024504, 0.20645924288091128, -0.02447749345657834, -0.14520544225377016, 0.07433373171606682, 0.14160340387741968]
|
1,803.04156
|
Adiabatic flux insertion and growing of Laughlin states of cavity
Rydberg polaritons
|
Recently, the creation of photonic Landau levels in a twisted cavity has been
demonstrated in Nature \textbf{534}, 671 (2016). Here we propose a scheme to
adiabatically transfer flux quanta in multiples of $3\hbar$ simultaneously to
all cavity photons by coupling the photons through flux-threaded cones present
in such cavity setup. The flux transfer is achieved using external light fields
with orbital angular momentum and a near-resonant dense atomic medium as
mediator. Furthermore, coupling the cavity fields to a Rydberg state in a
configuration supporting electromagnetically induced transparency, fractional
quantum Hall states can be prepared. To this end a growing protocol is used
consisting of a sequence of flux insertion and subsequent single-photon
insertion steps. We discuss specifically the growing of the $\nu=1/2$ bosonic
Laughlin state, where we first repeat the flux insertion twice creating a
double quasi-hole excitation. Then, the hole is refilled using a coherent pump
and the Rydberg blockade.
|
quant-ph
|
recently the creation of photonic landau levels in a twisted cavity has been demonstrated in nature textbf534 671 2016 here we propose a scheme to adiabatically transfer flux quanta in multiples of 3hbar simultaneously to all cavity photons by coupling the photons through fluxthreaded cones present in such cavity setup the flux transfer is achieved using external light fields with orbital angular momentum and a nearresonant dense atomic medium as mediator furthermore coupling the cavity fields to a rydberg state in a configuration supporting electromagnetically induced transparency fractional quantum hall states can be prepared to this end a growing protocol is used consisting of a sequence of flux insertion and subsequent singlephoton insertion steps we discuss specifically the growing of the nu12 bosonic laughlin state where we first repeat the flux insertion twice creating a double quasihole excitation then the hole is refilled using a coherent pump and the rydberg blockade
|
[['recently', 'the', 'creation', 'of', 'photonic', 'landau', 'levels', 'in', 'a', 'twisted', 'cavity', 'has', 'been', 'demonstrated', 'in', 'nature', 'textbf534', '671', '2016', 'here', 'we', 'propose', 'a', 'scheme', 'to', 'adiabatically', 'transfer', 'flux', 'quanta', 'in', 'multiples', 'of', '3hbar', 'simultaneously', 'to', 'all', 'cavity', 'photons', 'by', 'coupling', 'the', 'photons', 'through', 'fluxthreaded', 'cones', 'present', 'in', 'such', 'cavity', 'setup', 'the', 'flux', 'transfer', 'is', 'achieved', 'using', 'external', 'light', 'fields', 'with', 'orbital', 'angular', 'momentum', 'and', 'a', 'nearresonant', 'dense', 'atomic', 'medium', 'as', 'mediator', 'furthermore', 'coupling', 'the', 'cavity', 'fields', 'to', 'a', 'rydberg', 'state', 'in', 'a', 'configuration', 'supporting', 'electromagnetically', 'induced', 'transparency', 'fractional', 'quantum', 'hall', 'states', 'can', 'be', 'prepared', 'to', 'this', 'end', 'a', 'growing', 'protocol', 'is', 'used', 'consisting', 'of', 'a', 'sequence', 'of', 'flux', 'insertion', 'and', 'subsequent', 'singlephoton', 'insertion', 'steps', 'we', 'discuss', 'specifically', 'the', 'growing', 'of', 'the', 'nu12', 'bosonic', 'laughlin', 'state', 'where', 'we', 'first', 'repeat', 'the', 'flux', 'insertion', 'twice', 'creating', 'a', 'double', 'quasihole', 'excitation', 'then', 'the', 'hole', 'is', 'refilled', 'using', 'a', 'coherent', 'pump', 'and', 'the', 'rydberg', 'blockade']]
|
[-0.20040844443564615, 0.2776575707861533, -0.053887879791436714, 0.007215446092498799, -0.005319495351868681, -0.14804082482742767, 0.10354852261254564, 0.4173415617547774, -0.21763946857613822, -0.31422165378307304, -0.007406420084492614, -0.24496746174370249, -0.05258544742944651, 0.16305896940330664, -0.0068519440541664756, 0.06328037223390615, 0.04622348781830321, -0.04530694355567296, -0.004555236045271158, -0.1726464618812315, 0.30457932375371455, 0.042622323707522204, 0.2787906306888908, 0.04544964906914781, 0.1267169759546717, 0.004694785674413045, 0.073041168449757, -0.06222012127749622, -0.07069582939768831, 0.07795263319237468, 0.20698423551085093, -0.003955714151573678, 0.25203206432362396, -0.44826137312998376, -0.19354812157029908, 0.04577169080575307, 0.18354124087432866, 0.179763424906414, -0.08283439761648576, -0.2940997535487016, -0.029187014169680576, -0.20432812933732444, -0.1111945666341732, -0.049343634999046725, 0.01692805519521547, -0.017707029674202204, -0.2668333234808718, 0.03550452532246709, 0.022388025598290066, 0.015363917692253986, -0.027973319919935118, -0.034452793008337416, -0.03871941660065204, 0.04777871898220231, -0.05312507208203897, 0.04164199082568909, 0.18502255127454798, -0.1436371387153243, -0.1723408765058654, 0.32150439023971555, -0.0971310485775272, -0.14400203088686492, 0.14287518696549037, -0.151365255707254, -0.03199891320196912, 0.16274619083230693, 0.11646998741353552, 0.1028858492259557, -0.10954301591807356, 0.0434874041522077, -0.031043995251723876, 0.21050777875663093, 0.133091561285158, 0.11707609952427447, 0.25419309867468354, 0.1472017600449423, 0.016089779067163665, 0.22327527098260666, -0.12906321285602948, -0.07028470638363311, -0.2709182706599434, -0.18388595224338738, -0.20781264869108176, 0.11301675474426398, 0.009771882920200975, -0.14399289154758055, 0.4004832639258772, 0.0957462993497029, 0.1945075181964785, -0.08080687524129947, 0.32002239894121887, 0.16507860114380796, 0.071616926228938, 0.06166525414523979, 0.2792949288687669, 0.1785960414322714, 0.09431442577702304, -0.27570823774983483, -0.07007804683409631, 0.02597411937545985]
|
1,803.04157
|
Scaled penalization of Brownian motion with drift and the Brownian
ascent
|
We study a scaled version of a two-parameter Brownian penalization model
introduced by Roynette-Vallois-Yor in arXiv:math/0511102. The original model
penalizes Brownian motion with drift $h\in\mathbb{R}$ by the weight process
${\big(\exp(\nu S_t):t\geq 0\big)}$ where $\nu\in\mathbb{R}$ and
$\big(S_t:t\geq 0\big)$ is the running maximum of the Brownian motion. It was
shown there that the resulting penalized process exhibits three distinct phases
corresponding to different regions of the $(\nu,h)$-plane. In this paper, we
investigate the effect of penalizing the Brownian motion concurrently with
scaling and identify the limit process. This extends a result of Roynette-Yor
for the ${\nu<0,~h=0}$ case to the whole parameter plane and reveals two
additional "critical" phases occurring at the boundaries between the parameter
regions. One of these novel phases is Brownian motion conditioned to end at its
maximum, a process we call the Brownian ascent. We then relate the Brownian
ascent to some well-known Brownian path fragments and to a random scaling
transformation of Brownian motion recently studied by Rosenbaum-Yor.
|
math.PR
|
we study a scaled version of a twoparameter brownian penalization model introduced by roynettevalloisyor in arxivmath0511102 the original model penalizes brownian motion with drift hinmathbbr by the weight process bigexpnu s_ttgeq 0big where nuinmathbbr and bigs_ttgeq 0big is the running maximum of the brownian motion it was shown there that the resulting penalized process exhibits three distinct phases corresponding to different regions of the nuhplane in this paper we investigate the effect of penalizing the brownian motion concurrently with scaling and identify the limit process this extends a result of roynetteyor for the nu0h0 case to the whole parameter plane and reveals two additional critical phases occurring at the boundaries between the parameter regions one of these novel phases is brownian motion conditioned to end at its maximum a process we call the brownian ascent we then relate the brownian ascent to some wellknown brownian path fragments and to a random scaling transformation of brownian motion recently studied by rosenbaumyor
|
[['we', 'study', 'a', 'scaled', 'version', 'of', 'a', 'twoparameter', 'brownian', 'penalization', 'model', 'introduced', 'by', 'roynettevalloisyor', 'in', 'arxivmath0511102', 'the', 'original', 'model', 'penalizes', 'brownian', 'motion', 'with', 'drift', 'hinmathbbr', 'by', 'the', 'weight', 'process', 'bigexpnu', 's_ttgeq', '0big', 'where', 'nuinmathbbr', 'and', 'bigs_ttgeq', '0big', 'is', 'the', 'running', 'maximum', 'of', 'the', 'brownian', 'motion', 'it', 'was', 'shown', 'there', 'that', 'the', 'resulting', 'penalized', 'process', 'exhibits', 'three', 'distinct', 'phases', 'corresponding', 'to', 'different', 'regions', 'of', 'the', 'nuhplane', 'in', 'this', 'paper', 'we', 'investigate', 'the', 'effect', 'of', 'penalizing', 'the', 'brownian', 'motion', 'concurrently', 'with', 'scaling', 'and', 'identify', 'the', 'limit', 'process', 'this', 'extends', 'a', 'result', 'of', 'roynetteyor', 'for', 'the', 'nu0h0', 'case', 'to', 'the', 'whole', 'parameter', 'plane', 'and', 'reveals', 'two', 'additional', 'critical', 'phases', 'occurring', 'at', 'the', 'boundaries', 'between', 'the', 'parameter', 'regions', 'one', 'of', 'these', 'novel', 'phases', 'is', 'brownian', 'motion', 'conditioned', 'to', 'end', 'at', 'its', 'maximum', 'a', 'process', 'we', 'call', 'the', 'brownian', 'ascent', 'we', 'then', 'relate', 'the', 'brownian', 'ascent', 'to', 'some', 'wellknown', 'brownian', 'path', 'fragments', 'and', 'to', 'a', 'random', 'scaling', 'transformation', 'of', 'brownian', 'motion', 'recently', 'studied', 'by', 'rosenbaumyor']]
|
[-0.09773336360153431, 0.1680102121667005, -0.1147314430726692, -0.0013375146234466228, -0.055254028011113406, -0.09930741196498274, 0.062254876724909994, 0.3726110616698861, -0.33684971113999684, -0.2784229568516215, 0.08300974340333293, -0.27179980038354795, -0.17463162592922649, 0.12714524400420488, -0.10125265539623797, 0.0682430663772781, 0.02799414658298095, 0.005934171999494235, 0.0004231825176005562, -0.19128112241625786, 0.2593621217117955, 0.010413706519951422, 0.22730585405758272, -0.05061612284742296, 0.17906680739484726, 0.00808681281749159, -0.03302010583380858, 0.035418197568506005, -0.1909247096242325, 0.08277363076495628, 0.1238952492379273, 0.02161455500870943, 0.2920126486693819, -0.36836250448599456, -0.18845143881936868, 0.12774327685125172, 0.1360214876368021, 0.059768994332601626, 0.00023824957975496848, -0.2961420526712512, 0.03887351632739107, -0.12019503624023249, -0.13472230187617243, -0.009920987306783596, 0.04074014066408078, 0.03273450269984702, -0.26690052637209494, 0.11217532453289701, 0.10469773373877009, 0.004017578616427878, -0.03149312651483342, -0.08592951921125253, -0.008317038627962271, 0.10467752472187082, 0.09379287532453115, 0.013024724167771638, 0.16401038186003764, -0.11784987783292308, -0.1376689414695526, 0.3663337828777731, -0.058610472584453725, -0.22817841278389095, 0.20387807785591577, -0.1859652967521106, -0.12906701986988386, 0.13499586982652545, 0.13273263696270685, 0.11255442168563605, -0.20082913502429922, 0.07809437565350284, 0.0001965550046103696, 0.0890722952162226, 0.07588160874477277, -0.050271350738282004, 0.16449849636434616, 0.17989654242953595, 0.10416724283248185, 0.23281255983747542, -0.13642000352342923, -0.18555379694948593, -0.3061228451156057, -0.1787526536732912, -0.18035289138167476, 0.0022753478664283952, -0.1341669488539143, -0.16555187999639506, 0.37487557070950667, 0.15946897802175955, 0.26404230632508796, 0.06896769817297657, 0.21633976973127575, 0.1631941659686466, 0.007649880108656362, 0.06373767369892448, 0.1807017803636457, 0.11348372430695841, 0.0824179472712179, -0.22258196393959223, 0.04915788645176993, 0.11709235941680769]
|
1,803.04158
|
Probing ultrafast spin-relaxation and precession dynamics in a cuprate
Mott insulator with 7-fs optical pulses
|
A charge excitation in a two-dimensional Mott insulator is strongly coupled
with the surrounding spins, which is observed as magnetic-polaron formations of
doped carriers and a magnon sideband in the Mott-gap transition spectrum.
However, the dynamics related to the spin sector are difficult to measure.
Here, we show that pump-probe reflection spectroscopy with 7-fs laser pulses
can detect the optically induced spin dynamics in Nd$_2$CuO$_4$, a cuprate Mott
insulator. The bleaching signal at the Mott-gap transition is enhanced at
$\sim$18 fs, which corresponds to the spin-relaxation time in magnetic-polaron
formations and is characterized by the exchange interaction. More importantly,
ultrafast coherent oscillations appear in the time evolutions of the
reflectivity changes, and their frequencies (1400-2700 cm$^{-1}$) are equal to
the probe energy measured from the Mott-gap transition peak. These oscillations
originate from interferences between charge excitations with two magnons and
provide direct evidence for charge-spin coupling.
|
cond-mat.str-el
|
a charge excitation in a twodimensional mott insulator is strongly coupled with the surrounding spins which is observed as magneticpolaron formations of doped carriers and a magnon sideband in the mottgap transition spectrum however the dynamics related to the spin sector are difficult to measure here we show that pumpprobe reflection spectroscopy with 7fs laser pulses can detect the optically induced spin dynamics in nd_2cuo_4 a cuprate mott insulator the bleaching signal at the mottgap transition is enhanced at sim18 fs which corresponds to the spinrelaxation time in magneticpolaron formations and is characterized by the exchange interaction more importantly ultrafast coherent oscillations appear in the time evolutions of the reflectivity changes and their frequencies 14002700 cm1 are equal to the probe energy measured from the mottgap transition peak these oscillations originate from interferences between charge excitations with two magnons and provide direct evidence for chargespin coupling
|
[['a', 'charge', 'excitation', 'in', 'a', 'twodimensional', 'mott', 'insulator', 'is', 'strongly', 'coupled', 'with', 'the', 'surrounding', 'spins', 'which', 'is', 'observed', 'as', 'magneticpolaron', 'formations', 'of', 'doped', 'carriers', 'and', 'a', 'magnon', 'sideband', 'in', 'the', 'mottgap', 'transition', 'spectrum', 'however', 'the', 'dynamics', 'related', 'to', 'the', 'spin', 'sector', 'are', 'difficult', 'to', 'measure', 'here', 'we', 'show', 'that', 'pumpprobe', 'reflection', 'spectroscopy', 'with', '7fs', 'laser', 'pulses', 'can', 'detect', 'the', 'optically', 'induced', 'spin', 'dynamics', 'in', 'nd_2cuo_4', 'a', 'cuprate', 'mott', 'insulator', 'the', 'bleaching', 'signal', 'at', 'the', 'mottgap', 'transition', 'is', 'enhanced', 'at', 'sim18', 'fs', 'which', 'corresponds', 'to', 'the', 'spinrelaxation', 'time', 'in', 'magneticpolaron', 'formations', 'and', 'is', 'characterized', 'by', 'the', 'exchange', 'interaction', 'more', 'importantly', 'ultrafast', 'coherent', 'oscillations', 'appear', 'in', 'the', 'time', 'evolutions', 'of', 'the', 'reflectivity', 'changes', 'and', 'their', 'frequencies', '14002700', 'cm1', 'are', 'equal', 'to', 'the', 'probe', 'energy', 'measured', 'from', 'the', 'mottgap', 'transition', 'peak', 'these', 'oscillations', 'originate', 'from', 'interferences', 'between', 'charge', 'excitations', 'with', 'two', 'magnons', 'and', 'provide', 'direct', 'evidence', 'for', 'chargespin', 'coupling']]
|
[-0.16668830541148943, 0.2845087595266889, -0.05208612998647915, 0.05510673477555384, -0.02338831951203463, -0.14924412187501476, 0.0626676585199637, 0.41635606847573203, -0.2661419529923713, -0.2770933227652645, 0.013170569824947083, -0.36263233446678916, -0.08306162208448965, 0.1677304129474438, 0.07198866512756665, -0.046015655263685264, -0.04941949740188991, -0.03836970372671763, -0.06809129796342572, -0.09924751745375733, 0.2558678643080085, 0.014406368091427297, 0.3042384876049013, 0.08756041929933366, 0.03746138560956904, -0.021912647500777475, 0.11786018403481457, -0.061602160614635144, -0.1258891549688895, 0.02575116591505467, 0.3134233673413323, -0.10088336930961928, 0.1504124316119856, -0.43326397599665434, -0.20332012918917788, 0.014995635563663982, 0.15408040822131097, 0.15726155722416105, -0.07173131413033665, -0.30729528137489215, -0.018834116500704646, -0.13432774160031255, -0.09575877118842689, -0.0627502622506158, -0.006648902296108174, -0.014635177154152596, -0.25595577033171496, 0.15263877881339172, 0.03127747769076768, 0.03228286914592544, -0.07562735518505731, -0.006416127480113866, -0.10652340498062542, 0.05644380431003556, 0.05134359906733661, 0.05264527942998322, 0.17132003883785613, -0.10349351378488257, -0.134895027038752, 0.35939576864320705, -0.10290282460619936, -0.050961188335375454, 0.1880116634139257, -0.24030323319749294, -0.022162593338619006, 0.23881735912543703, 0.09080748733497791, 0.1123900295762749, -0.106581734949267, 0.013727732867302073, 0.024012846958504377, 0.2206224200968676, 0.06976125383801707, 0.15538742185824297, 0.29063147573464815, 0.17937529205191569, 0.03266482231031348, 0.12254930811794149, -0.14382056746032687, -0.052483899457179906, -0.20451997519614032, -0.10141628669653009, -0.2184726022463943, 0.08073090086528263, -0.0028891165016652117, -0.12454900676970715, 0.43315610212886096, 0.1370793583304654, 0.1837305806388336, -0.0678578434362226, 0.26143439714568895, 0.17030787443777975, 0.062036990479507545, 0.015393957521333327, 0.28499292350094113, 0.18823788925464804, 0.11075846883435767, -0.3449737132409705, 0.032954206269713106, -0.023143733241855837]
|
1,803.04159
|
Ultracold rare-earth magnetic atoms with an electric dipole moment
|
We propose a new method to produce an electric and magnetic dipolar gas of
ultracold dysprosium atoms. The pair of nearly degenerate energy levels of
opposite parity, at 17513.33 cm$^{-1}$ with electronic angular momentum $J=10$,
and at 17514.50 cm$^{-1}$ with $J=9$, can be mixed with an external electric
field, thus inducing an electric dipole moment in the laboratory frame. For
field amplitudes relevant to current-day experiments, we predict a magnetic
dipole moment up to 13 Bohr magnetons, and an electric dipole moment up to 0.22
Debye, which is similar to the values obtained for alkali-metal diatomics. When
a magnetic field is present, we show that the electric dipole moment is
strongly dependent on the angle between the fields. The lifetime of the
field-mixed levels is found in the millisecond range, thus allowing for
suitable experimental detection and manipulation.
|
physics.atom-ph cond-mat.quant-gas quant-ph
|
we propose a new method to produce an electric and magnetic dipolar gas of ultracold dysprosium atoms the pair of nearly degenerate energy levels of opposite parity at 1751333 cm1 with electronic angular momentum j10 and at 1751450 cm1 with j9 can be mixed with an external electric field thus inducing an electric dipole moment in the laboratory frame for field amplitudes relevant to currentday experiments we predict a magnetic dipole moment up to 13 bohr magnetons and an electric dipole moment up to 022 debye which is similar to the values obtained for alkalimetal diatomics when a magnetic field is present we show that the electric dipole moment is strongly dependent on the angle between the fields the lifetime of the fieldmixed levels is found in the millisecond range thus allowing for suitable experimental detection and manipulation
|
[['we', 'propose', 'a', 'new', 'method', 'to', 'produce', 'an', 'electric', 'and', 'magnetic', 'dipolar', 'gas', 'of', 'ultracold', 'dysprosium', 'atoms', 'the', 'pair', 'of', 'nearly', 'degenerate', 'energy', 'levels', 'of', 'opposite', 'parity', 'at', '1751333', 'cm1', 'with', 'electronic', 'angular', 'momentum', 'j10', 'and', 'at', '1751450', 'cm1', 'with', 'j9', 'can', 'be', 'mixed', 'with', 'an', 'external', 'electric', 'field', 'thus', 'inducing', 'an', 'electric', 'dipole', 'moment', 'in', 'the', 'laboratory', 'frame', 'for', 'field', 'amplitudes', 'relevant', 'to', 'currentday', 'experiments', 'we', 'predict', 'a', 'magnetic', 'dipole', 'moment', 'up', 'to', '13', 'bohr', 'magnetons', 'and', 'an', 'electric', 'dipole', 'moment', 'up', 'to', '022', 'debye', 'which', 'is', 'similar', 'to', 'the', 'values', 'obtained', 'for', 'alkalimetal', 'diatomics', 'when', 'a', 'magnetic', 'field', 'is', 'present', 'we', 'show', 'that', 'the', 'electric', 'dipole', 'moment', 'is', 'strongly', 'dependent', 'on', 'the', 'angle', 'between', 'the', 'fields', 'the', 'lifetime', 'of', 'the', 'fieldmixed', 'levels', 'is', 'found', 'in', 'the', 'millisecond', 'range', 'thus', 'allowing', 'for', 'suitable', 'experimental', 'detection', 'and', 'manipulation']]
|
[-0.1398157247587935, 0.2363344148530073, 0.018983840092550962, 0.016603282352702486, -0.03497063631226343, -0.0780348146972419, 0.02413278798469239, 0.420966274070519, -0.22745249421439237, -0.34862360952732463, -0.04461251379473618, -0.26223144602306464, 0.007878105066440724, 0.19950064477441765, 0.06986965660902637, -0.03399933110135694, -0.006767152232566366, 0.0687440667025469, -0.053141910147301304, -0.1771372439891652, 0.2614195147874179, 0.08637501564980657, 0.2856955517290367, 0.1204319540100793, 0.0874258470411102, -0.030254661790267735, 0.11798836047312727, -0.0018409713895784483, -0.08480929771327216, 0.12729666831178799, 0.20363050941377878, -0.04008084627006341, 0.17981327750064707, -0.4416216640284768, -0.09442211051333557, 0.06493802535502861, 0.0988088678844549, 0.16027306962534096, -0.05169109042595934, -0.307617143003477, 0.029578651289490086, -0.1377201849784426, -0.15997456372888, -0.17168687523377163, 0.06388643239366097, 0.04165399140781827, -0.36354892357356017, 0.07721085979051336, 0.016480999896130354, 0.11552007859917703, -0.15327336698494576, -0.17375304194046529, 0.026940448402806565, 0.03522804465416508, 0.07813634163596564, 0.1144606955125238, 0.16504259299900798, -0.12215220475897055, -0.08351240119448415, 0.37384230487428055, -0.11126179444707102, -0.11767712811835938, 0.12995458349792494, -0.21354161419526294, -0.07863662273243621, 0.18158761384138078, 0.14045638719409773, 0.1368241304014292, -0.12712683860369942, 0.0466831404198375, -0.0019832855573406927, 0.2076292049303582, 0.08525620504903296, 0.023847561530958586, 0.3128727215859625, 0.10786388053696741, 0.07492506505438574, 0.12885605725545987, -0.19163204628318825, -0.04247069519220127, -0.23936382236856002, -0.12801291047836896, -0.1711444485656641, 0.07496470460254286, -0.044383686701163515, -0.13874786654142318, 0.3668149157496238, 0.13029649333545454, 0.176475155299219, -0.05456052613703327, 0.2994240800194718, 0.1490117825464242, 0.07528944186245402, 0.04073277418760376, 0.2975717125322532, 0.19273317246525376, 0.11639222718163014, -0.29490275275031175, -0.005795858051903822, 0.004489900878872032]
|
1,803.0416
|
Chiral skyrmions in an anisotropy gradient driven by spin-Hall effect
|
A strategy to drive skyrmion motion by a combination of an anisotropy
gradient and spin Hall effect has recently been demonstrated. Here, we study
the fundamental properties of this type of motion by combining micromagnetic
simulations and a generalized Thiele equation. We find that the anisotropy
gradient drives the skyrmion mainly along the direction perpendicular to the
gradient, due to the conservative part of the torque. There is some slower
motion along the direction parallel to the anisotropy gradient due to damping
torque. When an appropriate spin Hall torque is added, the skyrmion velocity in
the direction of the anisotropy gradient can be enhanced. This motion gives
rise to acceleration of the skyrmion as this moves to regions of varying
anisotropy. This phenomenon should be taken into account in experiments for the
correct evaluation of the skyrmion velocity. We employ a Thiele like formalism
and derive expressions for the velocity and the acceleration of the skyrmion
that match very well with micromagnetic simulation results.
|
cond-mat.mes-hall cond-mat.mtrl-sci
|
a strategy to drive skyrmion motion by a combination of an anisotropy gradient and spin hall effect has recently been demonstrated here we study the fundamental properties of this type of motion by combining micromagnetic simulations and a generalized thiele equation we find that the anisotropy gradient drives the skyrmion mainly along the direction perpendicular to the gradient due to the conservative part of the torque there is some slower motion along the direction parallel to the anisotropy gradient due to damping torque when an appropriate spin hall torque is added the skyrmion velocity in the direction of the anisotropy gradient can be enhanced this motion gives rise to acceleration of the skyrmion as this moves to regions of varying anisotropy this phenomenon should be taken into account in experiments for the correct evaluation of the skyrmion velocity we employ a thiele like formalism and derive expressions for the velocity and the acceleration of the skyrmion that match very well with micromagnetic simulation results
|
[['a', 'strategy', 'to', 'drive', 'skyrmion', 'motion', 'by', 'a', 'combination', 'of', 'an', 'anisotropy', 'gradient', 'and', 'spin', 'hall', 'effect', 'has', 'recently', 'been', 'demonstrated', 'here', 'we', 'study', 'the', 'fundamental', 'properties', 'of', 'this', 'type', 'of', 'motion', 'by', 'combining', 'micromagnetic', 'simulations', 'and', 'a', 'generalized', 'thiele', 'equation', 'we', 'find', 'that', 'the', 'anisotropy', 'gradient', 'drives', 'the', 'skyrmion', 'mainly', 'along', 'the', 'direction', 'perpendicular', 'to', 'the', 'gradient', 'due', 'to', 'the', 'conservative', 'part', 'of', 'the', 'torque', 'there', 'is', 'some', 'slower', 'motion', 'along', 'the', 'direction', 'parallel', 'to', 'the', 'anisotropy', 'gradient', 'due', 'to', 'damping', 'torque', 'when', 'an', 'appropriate', 'spin', 'hall', 'torque', 'is', 'added', 'the', 'skyrmion', 'velocity', 'in', 'the', 'direction', 'of', 'the', 'anisotropy', 'gradient', 'can', 'be', 'enhanced', 'this', 'motion', 'gives', 'rise', 'to', 'acceleration', 'of', 'the', 'skyrmion', 'as', 'this', 'moves', 'to', 'regions', 'of', 'varying', 'anisotropy', 'this', 'phenomenon', 'should', 'be', 'taken', 'into', 'account', 'in', 'experiments', 'for', 'the', 'correct', 'evaluation', 'of', 'the', 'skyrmion', 'velocity', 'we', 'employ', 'a', 'thiele', 'like', 'formalism', 'and', 'derive', 'expressions', 'for', 'the', 'velocity', 'and', 'the', 'acceleration', 'of', 'the', 'skyrmion', 'that', 'match', 'very', 'well', 'with', 'micromagnetic', 'simulation', 'results']]
|
[-0.1643933578051496, 0.15204824909738907, -0.11516905237534424, -0.0063562229653343376, -0.15213098878994946, -0.060321561992168427, -0.015373173856926037, 0.39037195468185154, -0.3325143694783924, -0.29403713978145546, 0.045354316596342134, -0.21186765683701309, -0.09709584854952083, 0.22698519859468655, -0.0029846781086767227, -0.007775285621968712, 0.013272454228149953, -0.004935458495576934, -0.03637046290550199, -0.18909661270530395, 0.24686724155085024, 0.04625806653827412, 0.29331607582819896, 0.05834966236100782, 0.12461051399955844, -0.015669640863495992, 0.04798959708409157, 0.09354312666805416, -0.17353943716381498, 0.07612209607103113, 0.1241487858436502, -0.05829639269021999, 0.2259118140266254, -0.4481646718639063, -0.19546061045193489, 0.013665049950160631, 0.18933447294232503, 0.2017928561985084, -0.08283084705642356, -0.27644650298511475, 0.06436838438484545, -0.16063340146821448, -0.1740857348635384, -0.103682096695482, 0.05554475105032552, 0.039169077700424215, -0.2540216081571288, 0.11427065122321747, 0.1078570502641236, 0.04155421959486131, -0.10925014857089192, -0.10529886116433418, -0.04633198757570737, 0.078052400693861, 0.1093702510924919, 0.11661595747118997, 0.15377854208728844, -0.14079334595944823, -0.1273111909309902, 0.3680449458628484, -0.07426641382370712, -0.22958273614397223, 0.12045271855654059, -0.1485422348217448, -0.07366295956166052, 0.11745961617803337, 0.16893597517912162, 0.08203704003102669, -0.12127510295489095, 0.039232661023383915, 0.008840595054008612, 0.13162187223390834, 0.04102128016529605, -0.03367087195014081, 0.23948244003738026, 0.13425110192634393, 0.08506767737974481, 0.15864284063452322, -0.1573097915665485, -0.10248864521187298, -0.24915154982449078, -0.17591419241591388, -0.18618661974465883, 0.034804214916487296, -0.09298395677632937, -0.13633709715497566, 0.3853633524282131, 0.19138377833907017, 0.19198540211428047, -0.018480996175373837, 0.32764729914232726, 0.14909410554413094, 0.09015134492145124, 0.08100477423200883, 0.29186948330695994, 0.18621018114386173, 0.15759016375807, -0.34039013538361956, 0.07570661479896842, 0.04295638335368982]
|
1,803.04161
|
Evolution of the electric fields induced in high intensity laser-matter
interactions
|
Multi MeV protons \cite{snavely2000intense} and heavier ions are emitted by
thin foils irradiated by high-intensity lasers, due to the huge accelerating
fields, up to several teraelectronvolt per meter, at sub-picosecond timescale
\cite{dubois2014target}. The evolution of these huge fields is not well
understood till today. Here we report, for the first time, direct and
temporally resolved measurements of the electric fields produced by the
interaction of a short-pulse high-intensity laser with solid targets. The
results, obtained with a sub-$100$ fs temporal diagnostics, show that such
fields build-up in few hundreds of femtoseconds and lasts after several
picoseconds.
|
physics.plasm-ph
|
multi mev protons citesnavely2000intense and heavier ions are emitted by thin foils irradiated by highintensity lasers due to the huge accelerating fields up to several teraelectronvolt per meter at subpicosecond timescale citedubois2014target the evolution of these huge fields is not well understood till today here we report for the first time direct and temporally resolved measurements of the electric fields produced by the interaction of a shortpulse highintensity laser with solid targets the results obtained with a sub100 fs temporal diagnostics show that such fields buildup in few hundreds of femtoseconds and lasts after several picoseconds
|
[['multi', 'mev', 'protons', 'citesnavely2000intense', 'and', 'heavier', 'ions', 'are', 'emitted', 'by', 'thin', 'foils', 'irradiated', 'by', 'highintensity', 'lasers', 'due', 'to', 'the', 'huge', 'accelerating', 'fields', 'up', 'to', 'several', 'teraelectronvolt', 'per', 'meter', 'at', 'subpicosecond', 'timescale', 'citedubois2014target', 'the', 'evolution', 'of', 'these', 'huge', 'fields', 'is', 'not', 'well', 'understood', 'till', 'today', 'here', 'we', 'report', 'for', 'the', 'first', 'time', 'direct', 'and', 'temporally', 'resolved', 'measurements', 'of', 'the', 'electric', 'fields', 'produced', 'by', 'the', 'interaction', 'of', 'a', 'shortpulse', 'highintensity', 'laser', 'with', 'solid', 'targets', 'the', 'results', 'obtained', 'with', 'a', 'sub100', 'fs', 'temporal', 'diagnostics', 'show', 'that', 'such', 'fields', 'buildup', 'in', 'few', 'hundreds', 'of', 'femtoseconds', 'and', 'lasts', 'after', 'several', 'picoseconds']]
|
[-0.0877907795898438, 0.3127310316009011, 0.01536782163670881, 0.0315690965368784, 0.020244938971293952, -0.10287883122355003, 0.000871604450908985, 0.476384930708941, -0.2761536561190448, -0.37505519453515396, 0.06272886967796713, -0.27695542130064454, 0.03710849951219527, 0.29747686167792514, 0.05922659653972121, 0.02603408794334911, 0.06603049519570901, -0.059186719615567235, -0.027441189403923108, -0.21452046806448477, 0.2424440737912788, 0.10767808195916896, 0.2156631824798248, 0.0893252166582549, 0.147303042358699, -0.03956431080091824, 0.00792376806543387, -0.0763416657462082, -0.08696602004064072, 0.06109028724220363, 0.22055675775033146, 0.026993721036210734, 0.30904176189722693, -0.5371194310050379, -0.2461978716359652, 0.021408290758312857, 0.12853693329491356, 0.1134341286465605, -0.1227009396980259, -0.2731817750993403, 0.051202836976525314, -0.12824588305158344, -0.13704327116918533, -0.05049922256829574, 0.03186221520584869, 0.10510893109096016, -0.2232584285771504, 0.058627598780266785, -0.0008584717740651537, 0.051718540866165716, -0.07291943548207587, -0.03996489355043369, 0.02479845731509255, 0.036499101113765794, 0.09127329831615963, 0.048040037449607824, 0.19426089015472284, -0.12902984957389058, -0.10939853421432223, 0.3611815742395343, -0.09162477565761482, 0.01616752622252766, 0.1628746763664357, -0.230626224446051, -0.05417786739231582, 0.2627761746964794, 0.130551045106605, 0.21458951539875187, -0.14544664621551304, -0.02658669289109852, 0.03739543666845148, 0.23552882748636159, 0.15048745075894637, 0.0798920696809333, 0.2322219354992217, 0.23053176330521385, -0.020335642219659812, 0.08634635880081716, -0.13436780423124103, -0.02280276826275711, -0.2746124456220485, -0.0761217556279549, -0.14492854520064244, 0.10042124167917559, -0.018385738246310058, -0.0737789355198595, 0.41089214459606543, 0.1203379509772392, 0.13910200427028727, -0.06490057940654298, 0.31619626600691614, 0.06673451189689854, 0.10801177233348581, 0.02719957105805503, 0.2878285935544904, 0.1508352271395121, 0.16022516144801827, -0.17717730295051762, -0.005083116653196989, -0.05542359574688004]
|
1,803.04162
|
Connecting Majorana phases to the Geometric Parameters of Majorana
Unitarity Triangle in a model of Neutrino Mass Matrix
|
We have investigated a possible connection between the Majorana phases and
geometric parameters of leptonic unitarity triangle(LUT) in two-texture zero
neutrino mass matrix. Such analytical relations can, also, be obtained for
other theoretical models viz. hybrid textures, neutrino mass matrix with
vanishing minors and have profound implications for geometric description of
$CP$ violation. As an example, we have considered two-texture zero neutrino
mass model to obtain relation between Majorana phases and LUT parameters. In
particular, we find that Majorana phases depend on only one of the three
interior angles of LUT in each class of two-texture zero neutrino mass matrix.
We have, also, constructed LUT for class $A$, $B$ and $C$ neutrino mass
matrices. Non-vanishing areas and nontrivial orientations of these Majorana
unitarity triangles indicate non-zero $CP$ violation as a generic feature of
this class of mass models.
|
hep-ph
|
we have investigated a possible connection between the majorana phases and geometric parameters of leptonic unitarity trianglelut in twotexture zero neutrino mass matrix such analytical relations can also be obtained for other theoretical models viz hybrid textures neutrino mass matrix with vanishing minors and have profound implications for geometric description of cp violation as an example we have considered twotexture zero neutrino mass model to obtain relation between majorana phases and lut parameters in particular we find that majorana phases depend on only one of the three interior angles of lut in each class of twotexture zero neutrino mass matrix we have also constructed lut for class a b and c neutrino mass matrices nonvanishing areas and nontrivial orientations of these majorana unitarity triangles indicate nonzero cp violation as a generic feature of this class of mass models
|
[['we', 'have', 'investigated', 'a', 'possible', 'connection', 'between', 'the', 'majorana', 'phases', 'and', 'geometric', 'parameters', 'of', 'leptonic', 'unitarity', 'trianglelut', 'in', 'twotexture', 'zero', 'neutrino', 'mass', 'matrix', 'such', 'analytical', 'relations', 'can', 'also', 'be', 'obtained', 'for', 'other', 'theoretical', 'models', 'viz', 'hybrid', 'textures', 'neutrino', 'mass', 'matrix', 'with', 'vanishing', 'minors', 'and', 'have', 'profound', 'implications', 'for', 'geometric', 'description', 'of', 'cp', 'violation', 'as', 'an', 'example', 'we', 'have', 'considered', 'twotexture', 'zero', 'neutrino', 'mass', 'model', 'to', 'obtain', 'relation', 'between', 'majorana', 'phases', 'and', 'lut', 'parameters', 'in', 'particular', 'we', 'find', 'that', 'majorana', 'phases', 'depend', 'on', 'only', 'one', 'of', 'the', 'three', 'interior', 'angles', 'of', 'lut', 'in', 'each', 'class', 'of', 'twotexture', 'zero', 'neutrino', 'mass', 'matrix', 'we', 'have', 'also', 'constructed', 'lut', 'for', 'class', 'a', 'b', 'and', 'c', 'neutrino', 'mass', 'matrices', 'nonvanishing', 'areas', 'and', 'nontrivial', 'orientations', 'of', 'these', 'majorana', 'unitarity', 'triangles', 'indicate', 'nonzero', 'cp', 'violation', 'as', 'a', 'generic', 'feature', 'of', 'this', 'class', 'of', 'mass', 'models']]
|
[-0.15494220791534133, 0.2401345735391386, -0.005264356875125944, 0.11826171005254332, -0.06600919553506983, -0.1975194569235246, 0.07868489209412985, 0.32648406523776097, -0.20810621426556342, -0.31091317925670175, 0.07561695847888035, -0.2516047997794447, -0.1207392491352656, 0.1625158124090084, 0.03112707811876805, 0.07187316476972434, 0.042935642808077545, 0.004982288002315229, -0.2134419781734562, -0.1933683224946913, 0.33855253272098457, -0.021625169498478845, 0.2273510416126708, 0.08734578428701599, 0.07976745211104624, -0.059892930350449944, -0.01638966404669748, -0.03883946826341596, -0.13352696159303257, -0.001424395385789719, 0.20041976699140984, 0.1178308574068122, 0.05909972790846207, -0.39187626671861775, -0.16463689646772006, 0.19345554963678774, 0.12547132771897274, 0.07362479817829211, -0.09885906264012558, -0.2775696344524078, 0.06449449086480223, -0.21977071856644792, -0.15257240096650962, -0.08085703532157099, 0.02251329961280427, -0.07074772152560253, -0.2899421069849228, 0.09208242969381807, -0.01163096373125802, 0.023523882075627573, 0.0034712317916326713, -0.22427610197804704, -0.03750634390561685, 0.1140305515834178, 0.11192748592197758, -0.08435930947630402, 0.05907718360213304, -0.12139016778860921, -0.09287751420489411, 0.36726500901026504, -0.045137442959418156, -0.2074307455497719, 0.13886454687487795, -0.13942723848589741, -0.17072900880236913, 0.0646693099725203, 0.15794896560782282, 0.05609895882407462, -0.14589361647606222, 0.11558492416915328, -0.13116657171384805, 0.1169766979869863, 0.06750898980909456, 0.08139450370204927, 0.3216600127885268, 0.13925664648447647, 0.09503150403407831, 0.006418733558036306, -0.09583723794050297, -0.048606199634271624, -0.3442237388655326, -0.15370455665010824, -0.1742346292076102, 0.04510748900309967, -0.13066424905901594, -0.1717133818289442, 0.43971494368335273, 0.1120888682194462, 0.21733073232845015, 0.044036060863983456, 0.23019810140228075, 0.08324311633363203, 0.07365292217539977, 0.01979980014101432, 0.29188279452883253, 0.20255260334017067, 0.05703931003740995, -0.2537545767926312, 0.020341318882457965, 0.11312629112525142]
|
1,803.04163
|
On Overcoming the Impact of Doppler Spectrum in Millimeter-Wave V2I
Communications
|
With the advent of 5G cellular systems there is an increased interest in
exploring higher frequency bands above 6 GHz. At these frequencies, beamforming
appears as a straightforward solution to overcome higher path loss thereby
altering the Doppler characteristics of the received waves. Higher frequencies
can suffer from strong Doppler impairments because of the linear dependency of
Doppler shift with carrier frequency, which makes them challenging to use in
high-mobility scenarios, particularly Vehicular-to-Infrastructure (V2I)
communications. Therefore, the impact of beamforming on the Doppler
characteristics of the received signals is of utter importance for future V2I
systems. This paper presents a theoretical analysis of the Doppler power
spectrum in the presence of beamforming at the transmit and/or the receive
sides. Further approximations are made for the resulting Doppler spread and
Doppler shift when the receive beam width is sufficiently small, and a possible
design solution is presented to control the Doppler spread in V2I systems. The
results can be of key importance in waveform and air interface design for V2I
systems.
|
cs.IT math.IT
|
with the advent of 5g cellular systems there is an increased interest in exploring higher frequency bands above 6 ghz at these frequencies beamforming appears as a straightforward solution to overcome higher path loss thereby altering the doppler characteristics of the received waves higher frequencies can suffer from strong doppler impairments because of the linear dependency of doppler shift with carrier frequency which makes them challenging to use in highmobility scenarios particularly vehiculartoinfrastructure v2i communications therefore the impact of beamforming on the doppler characteristics of the received signals is of utter importance for future v2i systems this paper presents a theoretical analysis of the doppler power spectrum in the presence of beamforming at the transmit andor the receive sides further approximations are made for the resulting doppler spread and doppler shift when the receive beam width is sufficiently small and a possible design solution is presented to control the doppler spread in v2i systems the results can be of key importance in waveform and air interface design for v2i systems
|
[['with', 'the', 'advent', 'of', '5g', 'cellular', 'systems', 'there', 'is', 'an', 'increased', 'interest', 'in', 'exploring', 'higher', 'frequency', 'bands', 'above', '6', 'ghz', 'at', 'these', 'frequencies', 'beamforming', 'appears', 'as', 'a', 'straightforward', 'solution', 'to', 'overcome', 'higher', 'path', 'loss', 'thereby', 'altering', 'the', 'doppler', 'characteristics', 'of', 'the', 'received', 'waves', 'higher', 'frequencies', 'can', 'suffer', 'from', 'strong', 'doppler', 'impairments', 'because', 'of', 'the', 'linear', 'dependency', 'of', 'doppler', 'shift', 'with', 'carrier', 'frequency', 'which', 'makes', 'them', 'challenging', 'to', 'use', 'in', 'highmobility', 'scenarios', 'particularly', 'vehiculartoinfrastructure', 'v2i', 'communications', 'therefore', 'the', 'impact', 'of', 'beamforming', 'on', 'the', 'doppler', 'characteristics', 'of', 'the', 'received', 'signals', 'is', 'of', 'utter', 'importance', 'for', 'future', 'v2i', 'systems', 'this', 'paper', 'presents', 'a', 'theoretical', 'analysis', 'of', 'the', 'doppler', 'power', 'spectrum', 'in', 'the', 'presence', 'of', 'beamforming', 'at', 'the', 'transmit', 'andor', 'the', 'receive', 'sides', 'further', 'approximations', 'are', 'made', 'for', 'the', 'resulting', 'doppler', 'spread', 'and', 'doppler', 'shift', 'when', 'the', 'receive', 'beam', 'width', 'is', 'sufficiently', 'small', 'and', 'a', 'possible', 'design', 'solution', 'is', 'presented', 'to', 'control', 'the', 'doppler', 'spread', 'in', 'v2i', 'systems', 'the', 'results', 'can', 'be', 'of', 'key', 'importance', 'in', 'waveform', 'and', 'air', 'interface', 'design', 'for', 'v2i', 'systems']]
|
[-0.2243427466820268, 0.12485689710669891, 0.00905818526961786, 0.009878048676696113, -0.11065685442265343, -0.1800121183753671, 0.06229219110477168, 0.40324723595643747, -0.25097388097030277, -0.2680711654316196, 0.10924069168635041, -0.26191538492601146, -0.15554594850331982, 0.23685184393954628, -0.091110229440143, 0.04991206177921199, 0.06476150968057268, -0.01761322861592121, -0.06352393442922381, -0.1550839939949048, 0.2755851321141509, 0.14359759247659787, 0.34152847802649966, 0.05621477909495726, 0.05966547569807838, 0.009996095559943248, -0.038634235028396635, -0.01265557539950618, -0.0442891358231838, 0.09670081874081755, 0.3349586781497826, 0.14275901714230285, 0.30117334144683006, -0.3624216434600599, -0.27874628713162725, 0.0638826755591093, 0.1614766367012635, 0.1106830269420136, -0.065573123120018, -0.2706021675244248, 0.0838868265023099, -0.19051511773620458, -0.0965421407154816, 0.020074360526889316, -0.004732156312093139, 0.03526627813630244, -0.28280079496257443, 0.05019031785948969, -0.005009002238512039, 0.07939763658625239, -0.038848081825520187, -0.12731404959032422, -0.0004219381193466046, 0.172451434425003, 0.04104299219941501, -0.015501665066489402, 0.10439304859541795, -0.1285843835938174, -0.08735879416951374, 0.44183552017818917, -0.020492194025941633, -0.1745524096857373, 0.1707153188996017, -0.15477827489923904, -0.07066820315222311, 0.1989039874608245, 0.2628309513366891, 0.03505371898987933, -0.11871019553381142, -0.00980784555671134, 0.08023702171357239, 0.1723195703854264, 0.11554066657965235, 0.12890216980184263, 0.2343705552204269, 0.14033683992045767, 0.12997967522721462, 0.0950786289820612, -0.16493131237614708, -0.029226983122541295, -0.19267864464884898, -0.08798520855797345, -0.1712076041053104, 0.022321119214928544, -0.06115582675702171, -0.09361862024182782, 0.3764207956408534, 0.18157013204797884, 0.14146757113802083, 0.05466514311470639, 0.41072658857001976, 0.1750220552114222, 0.07952649773591582, 0.05158400519696229, 0.2662806600852705, 0.13901997626457802, 0.17687354853705448, -0.2376529418740093, 0.05163289426469847, -0.03762496957582805]
|
1,803.04164
|
Sub 20 meV Schottky barriers in metal/MoTe2 junctions
|
The newly emerging class of atomically-thin materials has shown a high
potential for the realisation of novel electronic and optoelectronic
components. Amongst this family, semiconducting transition metal
dichalcogenides (TMDCs) are of particular interest. While their band gaps are
compatible with those of conventional solid state devices, they present a wide
range of exciting new properties that is bound to become a crucial ingredient
in the future of electronics. To utilise these properties for the prospect of
electronics in general, and long-wavelength-based photodetectors in particular,
the Schottky barriers formed upon contact with a metal and the contact
resistance that arises at these interfaces have to be measured and controlled.
We present experimental evidence for the formation of Schottky barriers as low
as 10 meV between MoTe2 and metal electrodes. By varying the electrode work
functions, we demonstrate that Fermi level pinning due to metal induced gap
states at the interfaces occurs at 0.14 eV above the valence band maximum. In
this configuration, thermionic emission is observed for the first time at
temperatures between 40 K and 75 K. Finally, we discuss the ability to tune the
barrier height using a gate electrode.
|
cond-mat.mes-hall
|
the newly emerging class of atomicallythin materials has shown a high potential for the realisation of novel electronic and optoelectronic components amongst this family semiconducting transition metal dichalcogenides tmdcs are of particular interest while their band gaps are compatible with those of conventional solid state devices they present a wide range of exciting new properties that is bound to become a crucial ingredient in the future of electronics to utilise these properties for the prospect of electronics in general and longwavelengthbased photodetectors in particular the schottky barriers formed upon contact with a metal and the contact resistance that arises at these interfaces have to be measured and controlled we present experimental evidence for the formation of schottky barriers as low as 10 mev between mote2 and metal electrodes by varying the electrode work functions we demonstrate that fermi level pinning due to metal induced gap states at the interfaces occurs at 014 ev above the valence band maximum in this configuration thermionic emission is observed for the first time at temperatures between 40 k and 75 k finally we discuss the ability to tune the barrier height using a gate electrode
|
[['the', 'newly', 'emerging', 'class', 'of', 'atomicallythin', 'materials', 'has', 'shown', 'a', 'high', 'potential', 'for', 'the', 'realisation', 'of', 'novel', 'electronic', 'and', 'optoelectronic', 'components', 'amongst', 'this', 'family', 'semiconducting', 'transition', 'metal', 'dichalcogenides', 'tmdcs', 'are', 'of', 'particular', 'interest', 'while', 'their', 'band', 'gaps', 'are', 'compatible', 'with', 'those', 'of', 'conventional', 'solid', 'state', 'devices', 'they', 'present', 'a', 'wide', 'range', 'of', 'exciting', 'new', 'properties', 'that', 'is', 'bound', 'to', 'become', 'a', 'crucial', 'ingredient', 'in', 'the', 'future', 'of', 'electronics', 'to', 'utilise', 'these', 'properties', 'for', 'the', 'prospect', 'of', 'electronics', 'in', 'general', 'and', 'longwavelengthbased', 'photodetectors', 'in', 'particular', 'the', 'schottky', 'barriers', 'formed', 'upon', 'contact', 'with', 'a', 'metal', 'and', 'the', 'contact', 'resistance', 'that', 'arises', 'at', 'these', 'interfaces', 'have', 'to', 'be', 'measured', 'and', 'controlled', 'we', 'present', 'experimental', 'evidence', 'for', 'the', 'formation', 'of', 'schottky', 'barriers', 'as', 'low', 'as', '10', 'mev', 'between', 'mote2', 'and', 'metal', 'electrodes', 'by', 'varying', 'the', 'electrode', 'work', 'functions', 'we', 'demonstrate', 'that', 'fermi', 'level', 'pinning', 'due', 'to', 'metal', 'induced', 'gap', 'states', 'at', 'the', 'interfaces', 'occurs', 'at', '014', 'ev', 'above', 'the', 'valence', 'band', 'maximum', 'in', 'this', 'configuration', 'thermionic', 'emission', 'is', 'observed', 'for', 'the', 'first', 'time', 'at', 'temperatures', 'between', '40', 'k', 'and', '75', 'k', 'finally', 'we', 'discuss', 'the', 'ability', 'to', 'tune', 'the', 'barrier', 'height', 'using', 'a', 'gate', 'electrode']]
|
[-0.12009149774553646, 0.1717921531177126, 0.002350798875436579, 0.00573991563808369, -0.009799389612989647, -0.1803463072718219, 0.12181072182536713, 0.43999217062404283, -0.25472153666870373, -0.356200149510742, 0.002120584887942593, -0.31520090689392466, -0.12671720890426322, 0.23009669031996868, 0.0070972302781516, 0.034110254818254984, -0.006753744673915207, -0.09037538550114015, -0.10020033671018226, -0.1444702234480677, 0.29386599818244574, 0.05335921611832945, 0.31113081544049476, 0.15319598540908805, 0.05034351510632979, -0.06400520653512917, 0.11081532976394029, -0.01563727435606875, -0.15495308480929357, 0.11212216304756063, 0.308532134427591, -0.07962401110531861, 0.2374389871660816, -0.43654407912767246, -0.21142076893746362, 0.024309919922808676, 0.0975723251032545, 0.11008578696484236, -0.12665097286532584, -0.2555174401740691, 0.11818569166138523, -0.1536055179704961, -0.13574383960980124, -0.0302938496203799, 0.015750484797172247, 0.017705325041836324, -0.18860424470040016, 0.03635668781414432, 0.024938518905056346, 0.042358141068038285, -0.057270609445051954, -0.1577904790523462, -0.05830416305382785, 0.09733409566167546, -0.0023646852859344923, 0.021889821011236085, 0.18653463421046343, -0.14001939406857433, -0.09418781284782055, 0.35574436667712256, -0.05130521954239444, -0.06761035538817707, 0.21690048627972014, -0.17605241202308158, -0.05836394819136905, 0.15114508061608495, 0.14427785045516334, 0.09224723295406684, -0.13848875152976498, 0.07724323572673664, 0.058058441288181044, 0.12456825858864345, 0.06525695197970459, 0.0966060530483159, 0.282658677031041, 0.21739535285527573, 0.06432903694371099, 0.11197850206793335, -0.1263554624594307, -0.026728339618267982, -0.2476258070747319, -0.22056854927428313, -0.18878973261698295, 0.062483956204041055, -0.03999019089770675, -0.18968116568300358, 0.4025146376978802, 0.12741397044155747, 0.1881389044690877, -0.01017683844057549, 0.22692441139860373, 0.10554071303187429, 0.10595347164566384, 0.019622139441535662, 0.26396808670098454, 0.14143218496250676, 0.11131641993323635, -0.19514744320614755, 0.09719973161179377, -0.03871943323358305]
|
1,803.04165
|
HEP Software Foundation Community White Paper Working Group - Detector
Simulation
|
A working group on detector simulation was formed as part of the high-energy
physics (HEP) Software Foundation's initiative to prepare a Community White
Paper that describes the main software challenges and opportunities to be faced
in the HEP field over the next decade. The working group met over a period of
several months in order to review the current status of the Full and Fast
simulation applications of HEP experiments and the improvements that will need
to be made in order to meet the goals of future HEP experimental programmes.
The scope of the topics covered includes the main components of a HEP
simulation application, such as MC truth handling, geometry modeling, particle
propagation in materials and fields, physics modeling of the interactions of
particles with matter, the treatment of pileup and other backgrounds, as well
as signal processing and digitisation. The resulting work programme described
in this document focuses on the need to improve both the software performance
and the physics of detector simulation. The goals are to increase the accuracy
of the physics models and expand their applicability to future physics
programmes, while achieving large factors in computing performance gains
consistent with projections on available computing resources.
|
physics.comp-ph hep-ex
|
a working group on detector simulation was formed as part of the highenergy physics hep software foundations initiative to prepare a community white paper that describes the main software challenges and opportunities to be faced in the hep field over the next decade the working group met over a period of several months in order to review the current status of the full and fast simulation applications of hep experiments and the improvements that will need to be made in order to meet the goals of future hep experimental programmes the scope of the topics covered includes the main components of a hep simulation application such as mc truth handling geometry modeling particle propagation in materials and fields physics modeling of the interactions of particles with matter the treatment of pileup and other backgrounds as well as signal processing and digitisation the resulting work programme described in this document focuses on the need to improve both the software performance and the physics of detector simulation the goals are to increase the accuracy of the physics models and expand their applicability to future physics programmes while achieving large factors in computing performance gains consistent with projections on available computing resources
|
[['a', 'working', 'group', 'on', 'detector', 'simulation', 'was', 'formed', 'as', 'part', 'of', 'the', 'highenergy', 'physics', 'hep', 'software', 'foundations', 'initiative', 'to', 'prepare', 'a', 'community', 'white', 'paper', 'that', 'describes', 'the', 'main', 'software', 'challenges', 'and', 'opportunities', 'to', 'be', 'faced', 'in', 'the', 'hep', 'field', 'over', 'the', 'next', 'decade', 'the', 'working', 'group', 'met', 'over', 'a', 'period', 'of', 'several', 'months', 'in', 'order', 'to', 'review', 'the', 'current', 'status', 'of', 'the', 'full', 'and', 'fast', 'simulation', 'applications', 'of', 'hep', 'experiments', 'and', 'the', 'improvements', 'that', 'will', 'need', 'to', 'be', 'made', 'in', 'order', 'to', 'meet', 'the', 'goals', 'of', 'future', 'hep', 'experimental', 'programmes', 'the', 'scope', 'of', 'the', 'topics', 'covered', 'includes', 'the', 'main', 'components', 'of', 'a', 'hep', 'simulation', 'application', 'such', 'as', 'mc', 'truth', 'handling', 'geometry', 'modeling', 'particle', 'propagation', 'in', 'materials', 'and', 'fields', 'physics', 'modeling', 'of', 'the', 'interactions', 'of', 'particles', 'with', 'matter', 'the', 'treatment', 'of', 'pileup', 'and', 'other', 'backgrounds', 'as', 'well', 'as', 'signal', 'processing', 'and', 'digitisation', 'the', 'resulting', 'work', 'programme', 'described', 'in', 'this', 'document', 'focuses', 'on', 'the', 'need', 'to', 'improve', 'both', 'the', 'software', 'performance', 'and', 'the', 'physics', 'of', 'detector', 'simulation', 'the', 'goals', 'are', 'to', 'increase', 'the', 'accuracy', 'of', 'the', 'physics', 'models', 'and', 'expand', 'their', 'applicability', 'to', 'future', 'physics', 'programmes', 'while', 'achieving', 'large', 'factors', 'in', 'computing', 'performance', 'gains', 'consistent', 'with', 'projections', 'on', 'available', 'computing', 'resources']]
|
[-0.07779308670930489, 0.08779732988276823, -0.05795971413602791, 0.038172917266788155, -0.09267055600104694, -0.0675289029133829, 0.0015082031718909217, 0.34637894646156975, -0.2464421430354629, -0.39511390772634114, 0.13652329221157236, -0.282019690107367, -0.07318090873503655, 0.24402998713132967, -0.05588076680655306, 0.08975986195213381, 0.13270390668799678, -0.006736599676715837, -0.062388729806006626, -0.2961718935950018, 0.24678599788110012, 0.15575184697172975, 0.3072362151581925, 0.07670800603373941, 0.0560475654160632, 0.01093008641525635, -0.09483810395880453, -0.0030041647110901886, -0.08515925529149967, 0.1392096379612708, 0.3495822783764348, 0.18889628552209267, 0.29920928965757915, -0.43807617327386755, -0.20567136782750337, 0.06420888096777413, 0.1202562804820587, 0.05838093489300853, -0.08076742534577172, -0.2903887248134718, 0.03032390382222775, -0.2200451357051468, -0.14143200148243326, -0.04615713326080852, -0.0216238390479995, 0.04186661997148954, -0.21116814759077887, -0.019397694543799637, 0.02189592032697129, 0.06807634088412003, -0.026439934252906385, -0.15572209239015403, 0.0522669535001562, 0.17446968422257272, 0.06807092543990917, 0.02807326639192787, 0.14943239045587964, -0.20459091370274785, -0.18085732447081737, 0.4200466861787496, -0.019748644845972035, -0.13184379833579607, 0.21686796119422583, -0.14914403789739322, -0.14173338035982683, 0.09376673980021671, 0.25714703454125915, 0.033560900585070705, -0.15235940266831136, 0.10738623085617931, 0.07957587305727841, 0.15124353230696863, 0.0037208079376805517, 0.02659542737651532, 0.23682008023097662, 0.25886352030424653, 0.032431773894287155, 0.0796822930780361, -0.07965588577363135, -0.09938919531583935, -0.3332110641257435, -0.16468745924008252, -0.15150716890529473, -0.020822996667927907, 0.030617525664172206, -0.12262870686774577, 0.43973860995441527, 0.2174386230809848, 0.10292516007139604, -0.0016699322384089493, 0.3198468753735736, -0.003832639777686578, 0.07744388625907055, 0.047747211184483676, 0.21910326690155657, 0.09182121082742573, 0.1622720147862132, -0.1692193218240112, 0.04218717449433615, -0.027154968335438314]
|
1,803.04166
|
Spatial networks with wireless applications
|
Many networks have nodes located in physical space, with links more common
between closely spaced pairs of nodes. For example, the nodes could be wireless
devices and links communication channels in a wireless mesh network. We
describe recent work involving such networks, considering effects due to the
geometry (convex,non-convex, and fractal), node distribution,
distance-dependent link probability, mobility, directivity and interference.
|
cs.NI cond-mat.dis-nn cond-mat.stat-mech
|
many networks have nodes located in physical space with links more common between closely spaced pairs of nodes for example the nodes could be wireless devices and links communication channels in a wireless mesh network we describe recent work involving such networks considering effects due to the geometry convexnonconvex and fractal node distribution distancedependent link probability mobility directivity and interference
|
[['many', 'networks', 'have', 'nodes', 'located', 'in', 'physical', 'space', 'with', 'links', 'more', 'common', 'between', 'closely', 'spaced', 'pairs', 'of', 'nodes', 'for', 'example', 'the', 'nodes', 'could', 'be', 'wireless', 'devices', 'and', 'links', 'communication', 'channels', 'in', 'a', 'wireless', 'mesh', 'network', 'we', 'describe', 'recent', 'work', 'involving', 'such', 'networks', 'considering', 'effects', 'due', 'to', 'the', 'geometry', 'convexnonconvex', 'and', 'fractal', 'node', 'distribution', 'distancedependent', 'link', 'probability', 'mobility', 'directivity', 'and', 'interference']]
|
[-0.3130628593634659, 0.06056502009741962, 0.02676601057391963, 0.044318011154731114, -0.057390781181554, -0.24516781111403058, 0.09218094190582633, 0.41802813187241555, -0.27376849428595357, -0.3129194312573721, -0.0017176939601389071, -0.3071059245383367, -0.264895837319394, 0.11740814224661639, -0.1078489265171811, 0.04653352430323139, 0.06900706282564593, 0.017598937110354502, 0.0513918205552424, -0.19589387533875804, 0.36644040752823154, 0.09803848243318498, 0.35572282746434214, 0.07415017557019989, 0.01752459447986136, 0.022584390993142734, -0.05279728519575049, 0.018698945732224578, -0.09025738545072576, 0.11178327583086987, 0.32233482850715517, 0.08224681657738983, 0.215997653392454, -0.48823666386306286, -0.3124903969001025, 0.14459048641535144, 0.17068117507733405, 0.07017173580049227, 0.027827326979362018, -0.30802490605662264, 0.07716377937079717, -0.20263147260217618, -0.07407280841119548, 0.04334656170879801, -0.01023683928263684, 0.10288051234868666, -0.2573828971789529, 0.022586126315097012, -0.0771153236584117, 0.032868032638604446, 0.052839914457824, -0.04916593434754759, -0.005231164822665353, 0.21531407037594666, -0.00666495431214571, -0.023178480301673212, 0.11705866119203469, -0.10669225762442996, -0.15653512221761048, 0.3606256453320384, 0.10343695391590396, -0.22257896342004338, 0.21790042964663978, -0.0785652816373234, -0.10804429605292777, 0.10975344847732534, 0.27056078230962155, 0.010333448275923729, -0.18126418377117565, -0.027042573413928038, 0.016655827620221924, 0.08072323402545105, 0.12930955451835568, 0.16613762935933968, 0.21785076004453002, 0.18835970172658562, 0.1062999432469951, 0.09067818429903127, -0.1288848301085333, -0.12450552737961212, -0.1756972498105218, -0.12606387302900354, -0.26669317317428065, 0.02906034190673381, -0.14484350982359803, -0.11276704922008017, 0.373473249305971, 0.09147939506607751, 0.21756705152026068, 0.06527717147643368, 0.32386531520945333, 0.03192885468403498, 0.10659295252989978, 0.16909674220563223, 0.1288559403968975, 0.15724287340417503, 0.13862449867495646, -0.09794011758640409, 0.09445767851429991, -0.023142630451669297]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.