id float64 706 1.8k | title stringlengths 1 343 | abstract stringlengths 6 6.09k | categories stringlengths 5 125 | processed_abstract stringlengths 2 5.96k | tokenized_abstract stringlengths 8 8.74k | centroid stringlengths 2.1k 2.17k |
|---|---|---|---|---|---|---|
1,802.0976 | Kac polynomials and Lie algebras associated to quivers and curves | A survey of the theory of Kac polynomials for quivers and for curves. In
particular, we describe the representation-theoretic meaning of Kac polynomials
in terms of Hall algebras, and the geometric meaning of Kac polynomials in
relation to the geometry of moduli spaces of representations of quivers or
vector bundles on smooth projective curves. We end with some heuristics
concerning a family of infinite-dimensional $\mathbb{Z}^2$-graded Lie algebras
attached to curves of a fixed genus (over a finite field), whose 'Cartan datum'
encodes the dimension of the spaces of absolutely cuspidal functions.
| math.RT math.AG | a survey of the theory of kac polynomials for quivers and for curves in particular we describe the representationtheoretic meaning of kac polynomials in terms of hall algebras and the geometric meaning of kac polynomials in relation to the geometry of moduli spaces of representations of quivers or vector bundles on smooth projective curves we end with some heuristics concerning a family of infinitedimensional mathbbz2graded lie algebras attached to curves of a fixed genus over a finite field whose cartan datum encodes the dimension of the spaces of absolutely cuspidal functions | [['a', 'survey', 'of', 'the', 'theory', 'of', 'kac', 'polynomials', 'for', 'quivers', 'and', 'for', 'curves', 'in', 'particular', 'we', 'describe', 'the', 'representationtheoretic', 'meaning', 'of', 'kac', 'polynomials', 'in', 'terms', 'of', 'hall', 'algebras', 'and', 'the', 'geometric', 'meaning', 'of', 'kac', 'polynomials', 'in', 'relation', 'to', 'the', 'geometry', 'of', 'moduli', 'spaces', 'of', 'representations', 'of', 'quivers', 'or', 'vector', 'bundles', 'on', 'smooth', 'projective', 'curves', 'we', 'end', 'with', 'some', 'heuristics', 'concerning', 'a', 'family', 'of', 'infinitedimensional', 'mathbbz2graded', 'lie', 'algebras', 'attached', 'to', 'curves', 'of', 'a', 'fixed', 'genus', 'over', 'a', 'finite', 'field', 'whose', 'cartan', 'datum', 'encodes', 'the', 'dimension', 'of', 'the', 'spaces', 'of', 'absolutely', 'cuspidal', 'functions']] | [-0.19574382309008717, 0.08786749620448572, -0.1523826461065315, 0.059506086873115746, -0.14969572604756679, -0.13446154001240546, -0.018561431083951023, 0.3247753429114, -0.3497737039412771, -0.15780397909846935, 0.07856534959896785, -0.21530419959594588, -0.16203571025251443, 0.21508932175309203, -0.20533007354690477, 0.016558713057068186, 0.03611227890807921, 0.12795793550641654, -0.16180744935543492, -0.3492139917235453, 0.4704206531079343, -0.06420136125410324, 0.1795988272629924, 0.014113007590512407, 0.18567499311661328, 0.05403596571912723, -0.016271594231231853, -0.07010253688453563, -0.14584558997507935, 0.1937266527041844, 0.33700458238740544, 0.04231413992398142, 0.16171747376210988, -0.33962597352053436, -0.1213311621532929, 0.25044424242370733, 0.1609118837085399, 0.028548300522123718, 0.0374794345807059, -0.28016812042179673, 0.03932388097170617, -0.15077846429750816, -0.23255207264734493, -0.05878097377717495, 0.092105219919736, 0.0668440471700096, -0.18740176125992458, -0.007435349317697378, 0.07732520311825224, 0.22601273793031226, -0.15045454307039688, -0.12116607133258175, -0.08830458098244699, 0.03382189251139637, -0.05097211768420843, 0.020462775725748512, 0.053365379643554874, -0.18340050824661994, -0.1734107491652389, 0.3351749006964543, -0.012231179431162692, -0.24543962079090076, 0.11218147813905399, -0.1919838710442431, -0.15740550251084043, 0.11223368492658035, 0.1182308489006463, 0.13977576094771643, -0.006410861490191994, 0.20843651328762933, -0.11736865009559871, -0.008011869048689502, 0.12301541229065222, 0.0012451541395141529, 0.16904878675692028, 0.03269650108324221, -0.0046824248620196355, 0.138659313212374, 0.04746479873934372, -0.06928091065748339, -0.40439591284043025, -0.2137665090632144, -0.11818092268287808, 0.12175244252596583, -0.1729836013998995, -0.24150990776891645, 0.4587565182124848, 0.05471779362063159, 0.23087883368390358, 0.17628393124707126, 0.13472850492817687, 0.03303773100692574, 0.08707542443177202, 0.01721296428221759, 0.09194366144340045, 0.31201468749933847, -0.003254821822098405, -0.12353840504854835, -0.052418731626348344, 0.2588486005807971] |
1,802.09761 | Universal Freezeout Condition for Charged Hadrons in a Hybrid Approach | Hadronic freezeout during the evolution of the medium created in heavy-ion
collisions is an important phenomena. It is quite useful to find a universal
freezeout condition for each and every nuclear collisions. In this article, we
have constructed a hybrid model to calculate the ratio of transverse energy to
total mean multiplicity $E_{T} /N_{ch}$, since this ratio can possibly act as a
freezeout condition in heavy-ion collision experiments. Present hybrid model
blends two approaches : Tsallis statistics and wounded quark approach.
Recently, Tsallis statistics has been reliably used to obtain the transverse
momentum distribution of charged hadrons produced in relativistic ion
collisions. On the other side it has been shown that the pseudorapidity
distribution of charged hadrons can be calculated satisfactorily using the
wounded quark model (WQM). We have used this hybrid model to calculate the
transverse energy density distributions, $dE_{T}/d\eta$ at midrapidity using
charged particle pseudorapidity distributions, $dN_{ch}/d\eta$ and mean
transverse momentum $\langle p_{T} \rangle$ in various type of nuclear
collisions. We found that present hybrid model satisfactorily explains the
experimental data whether other models fail to reproduce the data at central
and at peripheral collisions simultaneously. Finally, ratio of transverse
energy to total mean multiplicity, $E_{T} /N_{ch}$ has been computed within
hybrid model and compared with the available experimental data at RHIC and LHC
energies. We observed no explicit dependence of $E_{T} /N_{ch}$ on energy as
well as centrality and thus it can definitely act as a freezeout criteria.
| hep-ph | hadronic freezeout during the evolution of the medium created in heavyion collisions is an important phenomena it is quite useful to find a universal freezeout condition for each and every nuclear collisions in this article we have constructed a hybrid model to calculate the ratio of transverse energy to total mean multiplicity e_t n_ch since this ratio can possibly act as a freezeout condition in heavyion collision experiments present hybrid model blends two approaches tsallis statistics and wounded quark approach recently tsallis statistics has been reliably used to obtain the transverse momentum distribution of charged hadrons produced in relativistic ion collisions on the other side it has been shown that the pseudorapidity distribution of charged hadrons can be calculated satisfactorily using the wounded quark model wqm we have used this hybrid model to calculate the transverse energy density distributions de_tdeta at midrapidity using charged particle pseudorapidity distributions dn_chdeta and mean transverse momentum langle p_t rangle in various type of nuclear collisions we found that present hybrid model satisfactorily explains the experimental data whether other models fail to reproduce the data at central and at peripheral collisions simultaneously finally ratio of transverse energy to total mean multiplicity e_t n_ch has been computed within hybrid model and compared with the available experimental data at rhic and lhc energies we observed no explicit dependence of e_t n_ch on energy as well as centrality and thus it can definitely act as a freezeout criteria | [['hadronic', 'freezeout', 'during', 'the', 'evolution', 'of', 'the', 'medium', 'created', 'in', 'heavyion', 'collisions', 'is', 'an', 'important', 'phenomena', 'it', 'is', 'quite', 'useful', 'to', 'find', 'a', 'universal', 'freezeout', 'condition', 'for', 'each', 'and', 'every', 'nuclear', 'collisions', 'in', 'this', 'article', 'we', 'have', 'constructed', 'a', 'hybrid', 'model', 'to', 'calculate', 'the', 'ratio', 'of', 'transverse', 'energy', 'to', 'total', 'mean', 'multiplicity', 'e_t', 'n_ch', 'since', 'this', 'ratio', 'can', 'possibly', 'act', 'as', 'a', 'freezeout', 'condition', 'in', 'heavyion', 'collision', 'experiments', 'present', 'hybrid', 'model', 'blends', 'two', 'approaches', 'tsallis', 'statistics', 'and', 'wounded', 'quark', 'approach', 'recently', 'tsallis', 'statistics', 'has', 'been', 'reliably', 'used', 'to', 'obtain', 'the', 'transverse', 'momentum', 'distribution', 'of', 'charged', 'hadrons', 'produced', 'in', 'relativistic', 'ion', 'collisions', 'on', 'the', 'other', 'side', 'it', 'has', 'been', 'shown', 'that', 'the', 'pseudorapidity', 'distribution', 'of', 'charged', 'hadrons', 'can', 'be', 'calculated', 'satisfactorily', 'using', 'the', 'wounded', 'quark', 'model', 'wqm', 'we', 'have', 'used', 'this', 'hybrid', 'model', 'to', 'calculate', 'the', 'transverse', 'energy', 'density', 'distributions', 'de_tdeta', 'at', 'midrapidity', 'using', 'charged', 'particle', 'pseudorapidity', 'distributions', 'dn_chdeta', 'and', 'mean', 'transverse', 'momentum', 'langle', 'p_t', 'rangle', 'in', 'various', 'type', 'of', 'nuclear', 'collisions', 'we', 'found', 'that', 'present', 'hybrid', 'model', 'satisfactorily', 'explains', 'the', 'experimental', 'data', 'whether', 'other', 'models', 'fail', 'to', 'reproduce', 'the', 'data', 'at', 'central', 'and', 'at', 'peripheral', 'collisions', 'simultaneously', 'finally', 'ratio', 'of', 'transverse', 'energy', 'to', 'total', 'mean', 'multiplicity', 'e_t', 'n_ch', 'has', 'been', 'computed', 'within', 'hybrid', 'model', 'and', 'compared', 'with', 'the', 'available', 'experimental', 'data', 'at', 'rhic', 'and', 'lhc', 'energies', 'we', 'observed', 'no', 'explicit', 'dependence', 'of', 'e_t', 'n_ch', 'on', 'energy', 'as', 'well', 'as', 'centrality', 'and', 'thus', 'it', 'can', 'definitely', 'act', 'as', 'a', 'freezeout', 'criteria']] | [-0.04333104726053231, 0.21282086906194309, -0.21333980574757636, 0.16272799338682187, 0.013612771472738434, -0.13424015556035254, -0.09749398314694796, 0.37637109561668086, -0.19615037002173874, -0.3291836339747533, -0.0750974731524669, -0.32645416728725346, 0.07830500010177274, 0.11987571852563027, 0.026109015613716716, 0.1172430208690154, 0.10950800330222894, 0.05748036461494242, -0.034659136193416394, -0.1758981779955017, 0.26277912844379897, 0.13568162218531749, 0.26306184319158393, 0.17395421658147825, 0.0878472740543657, 0.043615078704897316, 0.005601547576952725, 0.05214696278271731, -0.17780776572017204, 0.022923895946223637, 0.2633828958576032, 0.05206170580155837, 0.15102211528574117, -0.35637070245126473, -0.19784946461052944, 0.16830421370880988, 0.18123385841123915, 0.07988363993354142, -0.0609319178047978, -0.19467276815945903, 0.09147416076545294, -0.2747662775790862, -0.13358770825579996, -0.07598841382811466, 0.013050279909900079, 0.0666859383461997, -0.28667585970057796, 0.16151112888377003, -0.03484565977366098, 0.04451320740142061, -0.03291244039622446, -0.21319982817027874, -0.10624664939241484, 0.004236619421377933, 0.09190203653318653, 0.07470206561362526, 0.19041064244593145, -0.12472668806682728, -0.13215222899743823, 0.37613323368520163, -0.009197994301454552, -0.1825509293676684, 0.162557987375961, -0.169153732653164, -0.14977630333742126, 0.13115362339885905, 0.25552597843828456, 0.10634995189029724, -0.21140867004481453, 0.032009305574320024, -0.04052848118832723, 0.1461514491625015, 0.06348018686597547, 0.05094121365449003, 0.19142369944408225, 0.15446048837232715, -0.04851502382468122, 0.09130246397695979, -0.14301219111926003, -0.1071250271469277, -0.35603967298132677, -0.09438754431321286, -0.1738200082235077, 0.023959895845716044, -0.05254608415956075, -0.07257983471924187, 0.381225889234338, 0.11980405730040124, 0.29938311150375135, -0.023993475789029616, 0.3107353085884824, 0.10389679834673492, 0.060389198093480444, 0.12590935638387843, 0.24705666983888175, 0.15155495923633377, 0.219308420313367, -0.22525627454573016, 0.0756018757034326, 0.05498821140960596] |
1,802.09762 | Quantized electron transport through graphene nanoconstrictions | We study the quantization of Dirac fermions in lithographically defined
graphene nanoconstrictions. We observe quantized conductance in single
nanoconstrictions fabricated on top of a thin hexamethyldisilazane layer over a
Si/SiO_2 wafer. This nanofabrication method allows us to obtain well defined
edges in the nanoconstrictions, thus reducing the effects of edge roughness on
the conductance. We prove the occurrence of ballistic transport and identify
several size quantization plateaus in the conductance at low temperature.
Experimental data and numerical simulations show good agreement, demonstrating
that the smoothing of the plateaus is not related to edge roughness but to
quantum interference effects.
| cond-mat.mes-hall | we study the quantization of dirac fermions in lithographically defined graphene nanoconstrictions we observe quantized conductance in single nanoconstrictions fabricated on top of a thin hexamethyldisilazane layer over a sisio_2 wafer this nanofabrication method allows us to obtain well defined edges in the nanoconstrictions thus reducing the effects of edge roughness on the conductance we prove the occurrence of ballistic transport and identify several size quantization plateaus in the conductance at low temperature experimental data and numerical simulations show good agreement demonstrating that the smoothing of the plateaus is not related to edge roughness but to quantum interference effects | [['we', 'study', 'the', 'quantization', 'of', 'dirac', 'fermions', 'in', 'lithographically', 'defined', 'graphene', 'nanoconstrictions', 'we', 'observe', 'quantized', 'conductance', 'in', 'single', 'nanoconstrictions', 'fabricated', 'on', 'top', 'of', 'a', 'thin', 'hexamethyldisilazane', 'layer', 'over', 'a', 'sisio_2', 'wafer', 'this', 'nanofabrication', 'method', 'allows', 'us', 'to', 'obtain', 'well', 'defined', 'edges', 'in', 'the', 'nanoconstrictions', 'thus', 'reducing', 'the', 'effects', 'of', 'edge', 'roughness', 'on', 'the', 'conductance', 'we', 'prove', 'the', 'occurrence', 'of', 'ballistic', 'transport', 'and', 'identify', 'several', 'size', 'quantization', 'plateaus', 'in', 'the', 'conductance', 'at', 'low', 'temperature', 'experimental', 'data', 'and', 'numerical', 'simulations', 'show', 'good', 'agreement', 'demonstrating', 'that', 'the', 'smoothing', 'of', 'the', 'plateaus', 'is', 'not', 'related', 'to', 'edge', 'roughness', 'but', 'to', 'quantum', 'interference', 'effects']] | [-0.1801508354949718, 0.13210663136395842, -0.07082813701150242, -0.01239021069304359, -0.010006206178322735, -0.18853822769126807, 0.09231673389899009, 0.40412577520115206, -0.2862534992622607, -0.31290746284554705, -0.014423614640654338, -0.2994651311487865, -0.1577295389995355, 0.19977116027865746, -0.07070865997611875, 0.10206093949576218, 0.04673834070281097, -0.08272720493300996, -0.06285782875916497, -0.22583332194974928, 0.24232116584064006, 0.05737696966565581, 0.33469672811528045, 0.13827450800160265, 0.05468826860335251, 0.0008318543909211653, 0.039203631842151435, 0.06850939409600364, -0.1963837964468632, 0.03559411094157082, 0.22715313105157228, -0.16412263692149687, 0.1973108138155305, -0.4846810680635349, -0.19879019654101945, -0.02808372009395048, 0.15146526659490786, 0.13615012311404853, -0.053136302529824805, -0.2561981793271961, 0.10904720499923434, -0.09018015741803354, -0.07455724086424317, -0.044487785397454946, -0.06311373953999143, -0.05961427282814802, -0.21842797558032673, 0.08230196130509028, 0.008104882171292875, 0.05011062669294952, -0.025777869164647364, -0.1183842115123013, -0.06937051685574004, 0.09384213369739515, -0.020303353208653403, -0.03330293024250428, 0.20477547494205411, -0.1260428133060817, -0.1491407931340162, 0.3090576355467842, -0.06243632251227444, -0.15829463599889418, 0.14576590868333975, -0.2132776446565233, -0.03336932095275684, 0.11362014358835013, 0.13991903470396394, 0.08557631709904533, -0.09726972295667487, 0.06376972985647929, -0.025773215145248957, 0.1339580305249929, 0.11125143599517719, 0.08566851570026073, 0.23303327786576267, 0.21246492512749904, 0.07340068069070277, 0.14606182676072071, -0.17291186113061027, -0.041007971696819016, -0.2817408966860085, -0.2013164770206192, -0.2215100780218802, 0.10295699473551, -0.06905962586505197, -0.25622234775712993, 0.43428097476223204, 0.18746659694935638, 0.24826298214758585, 0.03588389036142164, 0.2869134752663097, 0.13048047554030112, 0.1115396611928714, 0.025218276358726952, 0.19791255432717275, 0.1604247222739187, 0.08694226440230991, -0.2828435818288438, 0.05341796807220413, -0.00872680027922145] |
1,802.09763 | An explicit Lyapunov function for reflection symmetric parabolic partial
differential equations on the circle | We construct an explicit Lyapunov function for scalar parabolic
reaction-advection-diffusion equations under periodic boundary conditions. We
assume the nonlinearity is even in the advection term. We follow a method
originally suggested by Matano and Zelenyak for, and limited to, separated
boundary conditions.
| math.DS | we construct an explicit lyapunov function for scalar parabolic reactionadvectiondiffusion equations under periodic boundary conditions we assume the nonlinearity is even in the advection term we follow a method originally suggested by matano and zelenyak for and limited to separated boundary conditions | [['we', 'construct', 'an', 'explicit', 'lyapunov', 'function', 'for', 'scalar', 'parabolic', 'reactionadvectiondiffusion', 'equations', 'under', 'periodic', 'boundary', 'conditions', 'we', 'assume', 'the', 'nonlinearity', 'is', 'even', 'in', 'the', 'advection', 'term', 'we', 'follow', 'a', 'method', 'originally', 'suggested', 'by', 'matano', 'and', 'zelenyak', 'for', 'and', 'limited', 'to', 'separated', 'boundary', 'conditions']] | [-0.19108592723274515, 0.09114853515867642, -0.08725607290952689, 0.08596353387249456, -0.11443783390513133, -0.18998166576160916, -0.032559987254596, 0.333411501676199, -0.2781907551522766, -0.2076039712964779, 0.1422348098047743, -0.20107305614233373, -0.17226206014553705, 0.19804256977069945, -0.09615410810857568, 0.10783087749898966, 0.014037046736727158, -0.01834659036692409, -0.0557883941357778, -0.21572944273551306, 0.40056659017379087, -0.050863688839377745, 0.1977935184480711, 0.04362248233935263, 0.1499893955575923, -0.024028674655017398, -0.01556822152010032, 0.00418318983810466, -0.21307416262459897, 0.0009937301233765624, 0.16172986504777023, -0.0047686901830491565, 0.2762295538116069, -0.4485393915591495, -0.25297117911811384, 0.09735669587583591, 0.10332929042522751, 0.11683572436283741, -0.041620045537932866, -0.28613812618312384, 0.10585945509817629, -0.1226548245176673, -0.22911790276079305, -0.04064791811452735, 0.025781036842437016, 0.015442123303988151, -0.40563831516053706, 0.12233902895379634, 0.057620234928825606, 0.07638770698880155, -0.1796467452964169, -0.03228094646086296, -0.0216793046732034, 0.05203096376776341, 0.03564076157774599, -0.04083438745389382, 0.04398972405830309, -0.08093789235378306, -0.013426449729151847, 0.2950446875322433, -0.12098290837768998, -0.32273049532834974, 0.18342101879950082, -0.07928783895580896, -0.08775045720505573, 0.11754925553465173, 0.1315062271439404, 0.15137601821195512, -0.19022637140005827, 0.12046643735430691, -0.03039532214114886, 0.12383673464258511, 0.13362517057075388, -0.06156126032805159, 0.08320853216130109, 0.09100988629229721, 0.14613739605106058, 0.16227225737557524, 0.0006112462974020413, -0.1200914689827533, -0.3301889344473325, -0.1252993415941351, -0.148300087412021, 0.06985147015768148, -0.06502363875084224, -0.20879582386641277, 0.3519853729355548, 0.10435501948952497, 0.14261118786054708, 0.051376124644385915, 0.2086235849696788, 0.20879861657019883, 0.03437347665783905, 0.12383577594231437, 0.2196831598578553, 0.1367394252114796, 0.12237769052098017, -0.23507815600550247, 0.022619711235165596, 0.14627726553451448] |
1,802.09764 | Few Islands Approximation of Hamiltonian System with divided Phase Space | It is well known that typical Hamiltonian systems have divided phase space
consisting of regions with regular dynamics on KAM tori and region(s) with
chaotic dynamics called chaotic sea(s). This complex structure makes rigorous
analysis of such systems virtually impossible and significantly complicates
numerical exploration of their dynamical properties. In this paper we outline a
new approach for the analysis of Hamiltonian systems with divided phase space.
These systems are approximated by a sequence of Hamiltonian systems having an
increasing (but finite) number of KAM islands. The islands in the approximating
systems are sub-islands of the islands in the initial system with an infinite
number of KAM-islands. We apply this approach to two-dimensional billiards and
demonstrate that it works. In particular the statistical characteristics of the
approximating systems tend to the ones for the whole system when the number of
islands in the approximating systems grows. Therefore our approach opens up a
new way for numerical and analytical studies of the dynamics of Hamiltonian
systems with divided phase space.
| nlin.CD | it is well known that typical hamiltonian systems have divided phase space consisting of regions with regular dynamics on kam tori and regions with chaotic dynamics called chaotic seas this complex structure makes rigorous analysis of such systems virtually impossible and significantly complicates numerical exploration of their dynamical properties in this paper we outline a new approach for the analysis of hamiltonian systems with divided phase space these systems are approximated by a sequence of hamiltonian systems having an increasing but finite number of kam islands the islands in the approximating systems are subislands of the islands in the initial system with an infinite number of kamislands we apply this approach to twodimensional billiards and demonstrate that it works in particular the statistical characteristics of the approximating systems tend to the ones for the whole system when the number of islands in the approximating systems grows therefore our approach opens up a new way for numerical and analytical studies of the dynamics of hamiltonian systems with divided phase space | [['it', 'is', 'well', 'known', 'that', 'typical', 'hamiltonian', 'systems', 'have', 'divided', 'phase', 'space', 'consisting', 'of', 'regions', 'with', 'regular', 'dynamics', 'on', 'kam', 'tori', 'and', 'regions', 'with', 'chaotic', 'dynamics', 'called', 'chaotic', 'seas', 'this', 'complex', 'structure', 'makes', 'rigorous', 'analysis', 'of', 'such', 'systems', 'virtually', 'impossible', 'and', 'significantly', 'complicates', 'numerical', 'exploration', 'of', 'their', 'dynamical', 'properties', 'in', 'this', 'paper', 'we', 'outline', 'a', 'new', 'approach', 'for', 'the', 'analysis', 'of', 'hamiltonian', 'systems', 'with', 'divided', 'phase', 'space', 'these', 'systems', 'are', 'approximated', 'by', 'a', 'sequence', 'of', 'hamiltonian', 'systems', 'having', 'an', 'increasing', 'but', 'finite', 'number', 'of', 'kam', 'islands', 'the', 'islands', 'in', 'the', 'approximating', 'systems', 'are', 'subislands', 'of', 'the', 'islands', 'in', 'the', 'initial', 'system', 'with', 'an', 'infinite', 'number', 'of', 'kamislands', 'we', 'apply', 'this', 'approach', 'to', 'twodimensional', 'billiards', 'and', 'demonstrate', 'that', 'it', 'works', 'in', 'particular', 'the', 'statistical', 'characteristics', 'of', 'the', 'approximating', 'systems', 'tend', 'to', 'the', 'ones', 'for', 'the', 'whole', 'system', 'when', 'the', 'number', 'of', 'islands', 'in', 'the', 'approximating', 'systems', 'grows', 'therefore', 'our', 'approach', 'opens', 'up', 'a', 'new', 'way', 'for', 'numerical', 'and', 'analytical', 'studies', 'of', 'the', 'dynamics', 'of', 'hamiltonian', 'systems', 'with', 'divided', 'phase', 'space']] | [-0.1898663554711457, 0.1267458843752187, -0.0906368024148114, 0.04271918579986218, 0.019936058023375666, -0.08855554343878799, 0.025720924642327392, 0.31946692180200786, -0.26662892735183996, -0.30826203858000256, 0.11138994991151939, -0.27855932701122527, -0.18750385648757778, 0.2506500320832529, -0.04775183439578214, 0.0729988403820494, 0.07472913799121485, -0.015334372994250165, -0.08046130502518423, -0.23470667005561202, 0.35975505851633, 0.013386668419900412, 0.23218396127580881, -0.05038505693446931, 0.0718376450881942, -0.0057187478119384745, 0.018226853548130858, 0.04502913726909884, -0.1200886186450883, 0.12441256184487821, 0.20573300542031042, 0.08436514505793057, 0.26392518136856663, -0.41201165127763134, -0.23472803261711034, 0.09000088920339964, 0.19832238239587513, 0.12072584490029666, -0.03419379699587666, -0.29594917192742853, 0.05819699389045824, -0.15268414033908664, -0.17170117487350178, -0.1161361525984046, 0.02267040185976082, 0.042237925220526266, -0.21235590871921212, 0.0453793649132291, 0.09089680748533675, 0.07133595873099824, -0.06796035897349213, -0.06363023795929185, -0.010406944945365369, 0.1404941381831182, 0.008784384887754739, -0.013354247698036139, 0.09585407639652892, -0.07782946439448767, -0.07974242057698684, 0.38808765939386664, -0.011907167425295505, -0.21579528569165773, 0.2580515928120313, -0.16598482767655376, -0.1415425442873004, 0.15064041244289922, 0.185865798184347, 0.13309919514587362, -0.12137629582888577, 0.09471670159384117, -0.02005151824044164, 0.1656720385646927, -0.014988731944230858, 0.03314038099369737, 0.20130850074667775, 0.22735405421375246, 0.10084961864032119, 0.15531939766118805, -0.029942332651231907, -0.17564758952305523, -0.24874468626242555, -0.14665239399109414, -0.1752295967492604, 0.0034398657623901517, -0.060144774041007536, -0.2177543142346197, 0.398799934781374, 0.14452586088240324, 0.2044224054468963, 0.05055297363945423, 0.2729394867079344, 0.1207787696373911, 0.03917421780465293, 0.072847078880574, 0.1972467107795915, 0.10885427044537253, 0.088267466626381, -0.20998185177606915, 0.01009558277862693, 0.05123773016715924] |
1,802.09765 | Rheology and microstructure of unsaturated granular materials:
Experiments and simulations | When dealing with unsaturated wet granular materials, a fundamental question
is: what is the effect of capillary cohesion on the bulk flow and yield
behavior? We inwestigate the dense flow rheology of unsaturated granular
materials through experiments and discrete element simulations of homogeneous,
simple annular shear flows of frictional, cohesive, spherical particles.
| cond-mat.soft | when dealing with unsaturated wet granular materials a fundamental question is what is the effect of capillary cohesion on the bulk flow and yield behavior we inwestigate the dense flow rheology of unsaturated granular materials through experiments and discrete element simulations of homogeneous simple annular shear flows of frictional cohesive spherical particles | [['when', 'dealing', 'with', 'unsaturated', 'wet', 'granular', 'materials', 'a', 'fundamental', 'question', 'is', 'what', 'is', 'the', 'effect', 'of', 'capillary', 'cohesion', 'on', 'the', 'bulk', 'flow', 'and', 'yield', 'behavior', 'we', 'inwestigate', 'the', 'dense', 'flow', 'rheology', 'of', 'unsaturated', 'granular', 'materials', 'through', 'experiments', 'and', 'discrete', 'element', 'simulations', 'of', 'homogeneous', 'simple', 'annular', 'shear', 'flows', 'of', 'frictional', 'cohesive', 'spherical', 'particles']] | [-0.15784998344001816, 0.28980576606723024, -0.13277215835656606, -0.0490276637971036, -0.09237491905543149, -0.11642945589789865, -0.018252175867411437, 0.35609427496206525, -0.3148079500442334, -0.2502859998859611, 0.060999579681996624, -0.2971265448586029, -0.18460321523632636, 0.1449506031166689, -0.0138378049733172, 0.13857864077184714, 0.06899018907307775, -0.06242777517193234, 0.014612082076971145, -0.17264667589801783, 0.27971793854536087, 0.028054032431385826, 0.3443149594845725, 0.08812105524189331, 0.09170062440064024, -0.03569860267909426, -0.00723277324554967, 0.16991984439721586, -0.2658870180557464, 0.07197284409958943, 0.24908123095976373, -0.11846149750236495, 0.19423854473850452, -0.4935098529300269, -0.3261946988675524, 0.03518987921815293, 0.05011782411705045, 0.04766143694081727, -0.054448969417945574, -0.1829379199657078, 0.05409434005188957, -0.13795324833150588, -0.10278057617445786, -0.029871236815975578, 0.03375158371294246, 0.05571982481370808, -0.22664723169131606, 0.17157570215617762, 0.08208505769360665, 0.15948811127785958, -0.09317399009916127, -0.013740667050667838, -0.028409243506543776, 0.10679489220823526, 0.059814197970006394, -0.11647451667608145, 0.27963509802323055, -0.2083039133645156, 0.0465567463497613, 0.5516301482623699, -0.0198847756894561, -0.19733093711821473, 0.28573798222065555, -0.10884206416998424, -0.04365847694377104, 0.19932782931216791, 0.22309124173925204, 0.0829980709845675, -0.09926516675606013, -0.018482268096276504, -0.16123449488203928, 0.12462069370382119, 0.07932234907468014, -0.1338669603288758, 0.22935655176201286, 0.2925615909408924, 0.02957696051282041, 0.17350288270516137, -0.06501626987329812, -0.08313697499825674, -0.23541452012517872, -0.20165478712970428, -0.17653057374078415, 0.015568126814768594, -0.1337946686413203, -0.2242467054257206, 0.2744991671220929, 0.010222156860810868, 0.12310762314226333, 0.011523305511503828, 0.29862488875640375, -0.016899574748879553, 0.006017943570280776, 0.06490209592761946, 0.284236689956457, 0.20961164639276617, 0.15101451600226118, -0.2505881723710427, 0.0982039244434632, 0.08012948081116467] |
1,802.09766 | Learning Representations for Neural Network-Based Classification Using
the Information Bottleneck Principle | In this theory paper, we investigate training deep neural networks (DNNs) for
classification via minimizing the information bottleneck (IB) functional. We
show that the resulting optimization problem suffers from two severe issues:
First, for deterministic DNNs, either the IB functional is infinite for almost
all values of network parameters, making the optimization problem ill-posed, or
it is piecewise constant, hence not admitting gradient-based optimization
methods. Second, the invariance of the IB functional under bijections prevents
it from capturing properties of the learned representation that are desirable
for classification, such as robustness and simplicity. We argue that these
issues are partly resolved for stochastic DNNs, DNNs that include a (hard or
soft) decision rule, or by replacing the IB functional with related, but more
well-behaved cost functions. We conclude that recent successes reported about
training DNNs using the IB framework must be attributed to such solutions. As a
side effect, our results indicate limitations of the IB framework for the
analysis of DNNs. We also note that rather than trying to repair the inherent
problems in the IB functional, a better approach may be to design regularizers
on latent representation enforcing the desired properties directly.
| cs.LG cs.CV cs.IT math.IT | in this theory paper we investigate training deep neural networks dnns for classification via minimizing the information bottleneck ib functional we show that the resulting optimization problem suffers from two severe issues first for deterministic dnns either the ib functional is infinite for almost all values of network parameters making the optimization problem illposed or it is piecewise constant hence not admitting gradientbased optimization methods second the invariance of the ib functional under bijections prevents it from capturing properties of the learned representation that are desirable for classification such as robustness and simplicity we argue that these issues are partly resolved for stochastic dnns dnns that include a hard or soft decision rule or by replacing the ib functional with related but more wellbehaved cost functions we conclude that recent successes reported about training dnns using the ib framework must be attributed to such solutions as a side effect our results indicate limitations of the ib framework for the analysis of dnns we also note that rather than trying to repair the inherent problems in the ib functional a better approach may be to design regularizers on latent representation enforcing the desired properties directly | [['in', 'this', 'theory', 'paper', 'we', 'investigate', 'training', 'deep', 'neural', 'networks', 'dnns', 'for', 'classification', 'via', 'minimizing', 'the', 'information', 'bottleneck', 'ib', 'functional', 'we', 'show', 'that', 'the', 'resulting', 'optimization', 'problem', 'suffers', 'from', 'two', 'severe', 'issues', 'first', 'for', 'deterministic', 'dnns', 'either', 'the', 'ib', 'functional', 'is', 'infinite', 'for', 'almost', 'all', 'values', 'of', 'network', 'parameters', 'making', 'the', 'optimization', 'problem', 'illposed', 'or', 'it', 'is', 'piecewise', 'constant', 'hence', 'not', 'admitting', 'gradientbased', 'optimization', 'methods', 'second', 'the', 'invariance', 'of', 'the', 'ib', 'functional', 'under', 'bijections', 'prevents', 'it', 'from', 'capturing', 'properties', 'of', 'the', 'learned', 'representation', 'that', 'are', 'desirable', 'for', 'classification', 'such', 'as', 'robustness', 'and', 'simplicity', 'we', 'argue', 'that', 'these', 'issues', 'are', 'partly', 'resolved', 'for', 'stochastic', 'dnns', 'dnns', 'that', 'include', 'a', 'hard', 'or', 'soft', 'decision', 'rule', 'or', 'by', 'replacing', 'the', 'ib', 'functional', 'with', 'related', 'but', 'more', 'wellbehaved', 'cost', 'functions', 'we', 'conclude', 'that', 'recent', 'successes', 'reported', 'about', 'training', 'dnns', 'using', 'the', 'ib', 'framework', 'must', 'be', 'attributed', 'to', 'such', 'solutions', 'as', 'a', 'side', 'effect', 'our', 'results', 'indicate', 'limitations', 'of', 'the', 'ib', 'framework', 'for', 'the', 'analysis', 'of', 'dnns', 'we', 'also', 'note', 'that', 'rather', 'than', 'trying', 'to', 'repair', 'the', 'inherent', 'problems', 'in', 'the', 'ib', 'functional', 'a', 'better', 'approach', 'may', 'be', 'to', 'design', 'regularizers', 'on', 'latent', 'representation', 'enforcing', 'the', 'desired', 'properties', 'directly']] | [-0.05373595428434633, -0.011615133601884098, -0.07275182305782381, 0.11805074136600993, -0.13343224576770416, -0.18365820693380208, 0.07036653235458683, 0.43836637016520213, -0.33014773107949913, -0.29731436225480024, 0.1239478517738987, -0.25949115968626185, -0.2208747914164164, 0.17093180327888666, -0.14091083999920023, 0.10042454504125005, 0.13441516139746174, -0.005328878246670224, -0.12412950833305265, -0.25775532230744425, 0.3335538581355725, 0.014088752438145037, 0.2915361328002488, 0.037314726963588854, 0.09924908192377038, -0.02693138543443488, 0.009536634600174027, 0.037343839140244056, -0.051173356631647716, 0.16383538044600257, 0.28718903496232573, 0.1801093361447277, 0.3437487890934284, -0.4557420093753404, -0.27534659615400986, 0.13130223154469595, 0.13684259627729092, 0.09948120699216102, -0.018471343303354308, -0.264305850030067, 0.1328947045408266, -0.1387426641160027, -0.04626594348174529, -0.1295829757906439, -0.05365996035271967, -0.0011370497474869348, -0.2461730229353878, 0.07988170275783296, 0.08468309532342114, 0.018232269419030736, -0.08088917264921264, -0.13891734053457597, 0.004538633302574228, 0.08469397058475225, 0.08144775188777634, 0.030071401046276976, 0.10378463208896213, -0.19490158036423214, -0.10534174938940626, 0.3684877538237452, 0.005595638227907667, -0.21488586631027462, 0.2051748933136156, -0.005364488954319782, -0.17932270856852614, 0.11231241834448344, 0.14964385698645463, 0.12841409769331671, -0.17583306876404844, 0.037352023387301383, 0.0042845056843511834, 0.1467424357290735, 0.04076053477588503, 0.04488992498534703, 0.13260704510216362, 0.1927673396973669, 0.07564151007202022, 0.12808605177764848, -0.0684157726582927, -0.0865135706802734, -0.2674521039739328, -0.09608962726731275, -0.17624919235612718, 0.04869580866486019, -0.10425998189133416, -0.17603368144938433, 0.34582749729707224, 0.1752067613757465, 0.19276167871190486, 0.11481787262666855, 0.3101669536308222, 0.10876442314804886, 0.12324266790378761, 0.10346439747456654, 0.2246427476098857, 0.08747479015332407, 0.08261987964920316, -0.19750620197272528, 0.11618206422768783, 0.06359883699057259] |
1,802.09767 | On multi-step prediction models for receding horizon control | The derivation of multi-step-ahead prediction models from sampled data of a
linear system is considered. A dedicated prediction model is built for each
future time step of interest. In addition to a nominal model, the set of all
models consistent with data and prior information is derived as well, making
the approach suitable for robust control design within a Model Predictive
Control framework. The resulting parameter identification problem is solved
through a sequence of convex programs, overcoming the non-convexity arising
when identifying 1-step prediction models with an output-error criterion. At
the same time, the derived models guarantee a worst-case error which is always
smaller than the one obtained by iterating models identified with a 1-step
prediction error criterion.
| cs.SY math.DS math.OC | the derivation of multistepahead prediction models from sampled data of a linear system is considered a dedicated prediction model is built for each future time step of interest in addition to a nominal model the set of all models consistent with data and prior information is derived as well making the approach suitable for robust control design within a model predictive control framework the resulting parameter identification problem is solved through a sequence of convex programs overcoming the nonconvexity arising when identifying 1step prediction models with an outputerror criterion at the same time the derived models guarantee a worstcase error which is always smaller than the one obtained by iterating models identified with a 1step prediction error criterion | [['the', 'derivation', 'of', 'multistepahead', 'prediction', 'models', 'from', 'sampled', 'data', 'of', 'a', 'linear', 'system', 'is', 'considered', 'a', 'dedicated', 'prediction', 'model', 'is', 'built', 'for', 'each', 'future', 'time', 'step', 'of', 'interest', 'in', 'addition', 'to', 'a', 'nominal', 'model', 'the', 'set', 'of', 'all', 'models', 'consistent', 'with', 'data', 'and', 'prior', 'information', 'is', 'derived', 'as', 'well', 'making', 'the', 'approach', 'suitable', 'for', 'robust', 'control', 'design', 'within', 'a', 'model', 'predictive', 'control', 'framework', 'the', 'resulting', 'parameter', 'identification', 'problem', 'is', 'solved', 'through', 'a', 'sequence', 'of', 'convex', 'programs', 'overcoming', 'the', 'nonconvexity', 'arising', 'when', 'identifying', '1step', 'prediction', 'models', 'with', 'an', 'outputerror', 'criterion', 'at', 'the', 'same', 'time', 'the', 'derived', 'models', 'guarantee', 'a', 'worstcase', 'error', 'which', 'is', 'always', 'smaller', 'than', 'the', 'one', 'obtained', 'by', 'iterating', 'models', 'identified', 'with', 'a', '1step', 'prediction', 'error', 'criterion']] | [-0.07756139027575652, 0.008628315639679128, -0.07088904870916794, 0.07217044067772058, -0.04516881798656705, -0.21148994766000626, 0.07928731509794791, 0.3303386491810919, -0.292104961653041, -0.33232166441794264, 0.15712154169457976, -0.22744327537619916, -0.09881702422673821, 0.21238447856118217, -0.05816323633512689, 0.11331333350250895, 0.09573544015805437, 0.057706762672378085, -0.08555990086597764, -0.2170940960685794, 0.2428499218235668, 0.08874074579813541, 0.2957458760684881, -0.0429025604429408, 0.1331277760639976, 0.009346539385489419, -0.049749132719400346, 0.029356941608134974, -0.10367621090357654, 0.13115312464626777, 0.2586005114359519, 0.16276076416540733, 0.3453773537426953, -0.3695473293972831, -0.25498878355555904, 0.11564181508639684, 0.09127300818506469, 0.12290523077349345, -0.019620658450712185, -0.28272370392313373, 0.08735816733280802, -0.157883148199608, -0.10454128502716875, -0.0417042463285546, -0.04111822604989776, -0.038395192593527146, -0.3618727098258897, 0.06657038387468356, 0.06175849309815969, 0.03706140307566294, -0.10843950055109766, -0.12116187293396896, -0.03575892119994785, 0.12150235098321986, 0.052746452601093195, 0.05115528372972089, 0.0950026761354385, -0.1192100488453403, -0.13344819273831499, 0.40012135772177804, -0.04364304290549595, -0.21929283131264213, 0.1268086481628478, -0.05780648853645748, -0.1134627172544312, 0.1305991972848359, 0.17740936953033137, 0.12174061917835194, -0.20195165414098973, 0.04693709693512776, -0.025268569461300842, 0.17557102836803812, -0.027961103930177852, -0.009901352358074525, 0.18417913724596685, 0.2579997082869721, 0.06232399904591023, 0.10533023960132183, -0.055116339025493614, -0.12804787369190246, -0.31043349941953635, -0.07882265192575943, -0.17161396224326333, -0.04069898829150658, -0.1082359033269344, -0.1464108085562276, 0.39177919386161697, 0.15485217881132873, 0.21367378801537248, 0.13907312467379862, 0.32312936959668803, 0.15344475504047234, 0.07338571236827053, 0.05475343558857711, 0.19557303638380563, 0.06928272018303376, 0.027839781081654195, -0.16578515753563908, 0.14165968984031144, 0.0694431663554512] |
1,802.09768 | Indecomposable Decompositions of Torsion-free Abelian Groups | An indecomposable decomposition of a torsion-free abelian group $G$ of rank
$n$ is a decomposition $G=A_1\oplus\cdots\oplus A_t$ where $A_i$ is
indecomposable of rank $r_i$ so that $\sum_i r_i=n$ is a partition of $n$. The
group $G$ may have decompositions that result in different partitions of $n$.
We address the problem of characterising those sets of partitions of $n$ which
can arise from indecomposable decompositions of a torsion-free abelian group.
| math.GR | an indecomposable decomposition of a torsionfree abelian group g of rank n is a decomposition ga_1opluscdotsoplus a_t where a_i is indecomposable of rank r_i so that sum_i r_in is a partition of n the group g may have decompositions that result in different partitions of n we address the problem of characterising those sets of partitions of n which can arise from indecomposable decompositions of a torsionfree abelian group | [['an', 'indecomposable', 'decomposition', 'of', 'a', 'torsionfree', 'abelian', 'group', 'g', 'of', 'rank', 'n', 'is', 'a', 'decomposition', 'ga_1opluscdotsoplus', 'a_t', 'where', 'a_i', 'is', 'indecomposable', 'of', 'rank', 'r_i', 'so', 'that', 'sum_i', 'r_in', 'is', 'a', 'partition', 'of', 'n', 'the', 'group', 'g', 'may', 'have', 'decompositions', 'that', 'result', 'in', 'different', 'partitions', 'of', 'n', 'we', 'address', 'the', 'problem', 'of', 'characterising', 'those', 'sets', 'of', 'partitions', 'of', 'n', 'which', 'can', 'arise', 'from', 'indecomposable', 'decompositions', 'of', 'a', 'torsionfree', 'abelian', 'group']] | [-0.23848730292828643, 0.1939262766376059, -0.10151864325298983, -0.005598280197077924, -0.09607624866561416, -0.1361594838775037, -0.03024857389904997, 0.3466235107249197, -0.34914763252634334, -0.2206324759309235, 0.10447079071823015, -0.2742248564849005, -0.09149526260187164, 0.09209974774378626, -0.10860712963211186, -0.0775239162338788, 0.02284755086635842, 0.12555445612901273, -0.05330931580187205, -0.28534131101332605, 0.3754851528279045, -0.11585188421475537, 0.21354723387562177, 0.007515261894749368, 0.11120281702674487, -0.026506036835010436, -0.03511711509268293, 0.01814512475667631, -0.09377180860717678, 0.09952050604795873, 0.36601658620159416, 0.14519594103673145, 0.2567529981298482, -0.3372135115787387, -0.07858633592396098, 0.29465808759799555, 0.2096243783530286, -0.04820978553342523, 0.0368284416549346, -0.18272386896697915, 0.1158222524476621, -0.2185072864077109, -0.12517820515752057, -0.005799586093738018, 0.16380662526524462, -0.04660638290293077, -0.3263190720394692, -0.011362102731843205, 0.08157923630685271, 0.04180990073912065, -0.03758703813175945, -0.22636525741750924, -0.060839737423093, 0.12377544348675977, -0.019391660986002535, 0.026356083560077584, 0.07166549598332494, -0.09164633138981812, -0.12293850084054558, 0.40928310720140443, 0.0035720376489574417, -0.22653366318520377, 0.07861067035906565, -0.15236211421570794, -0.2033558234175229, 0.14265374770826278, 0.08911596676882576, 0.19020458198963966, 0.024737380869577035, 0.2365845630000181, -0.2670886725981665, 0.10762792464126558, 0.10760703193955123, -0.0017518950763213284, 0.12382362643256783, 0.09082257427165613, 0.09187649896108162, 0.14065872938783072, 0.07064216271700229, 0.1291780625401503, -0.34980198505389337, -0.13466038963045268, -0.19056220837485263, 0.1955418477574473, -0.17303968141512835, -0.18209438021842608, 0.36206068640903516, 0.056086330895435396, 0.20072152671020696, 0.14062468494761132, 0.19822055714971878, 0.00498594221768572, 0.06354851876933347, 0.06345023315482061, 0.040145905578837675, 0.249810712535263, -0.18280110146631212, -0.14130157320280834, -0.032721881350666726, 0.24879542120513232] |
1,802.09769 | L1-Norm Batch Normalization for Efficient Training of Deep Neural
Networks | Batch Normalization (BN) has been proven to be quite effective at
accelerating and improving the training of deep neural networks (DNNs).
However, BN brings additional computation, consumes more memory and generally
slows down the training process by a large margin, which aggravates the
training effort. Furthermore, the nonlinear square and root operations in BN
also impede the low bit-width quantization techniques, which draws much
attention in deep learning hardware community. In this work, we propose an
L1-norm BN (L1BN) with only linear operations in both the forward and the
backward propagations during training. L1BN is shown to be approximately
equivalent to the original L2-norm BN (L2BN) by multiplying a scaling factor.
Experiments on various convolutional neural networks (CNNs) and generative
adversarial networks (GANs) reveal that L1BN maintains almost the same
accuracies and convergence rates compared to L2BN but with higher computational
efficiency. On FPGA platform, the proposed signum and absolute operations in
L1BN can achieve 1.5$\times$ speedup and save 50\% power consumption, compared
with the original costly square and root operations, respectively. This
hardware-friendly normalization method not only surpasses L2BN in speed, but
also simplify the hardware design of ASIC accelerators with higher energy
efficiency. Last but not the least, L1BN promises a fully quantized training of
DNNs, which is crucial to future adaptive terminal devices.
| cs.LG | batch normalization bn has been proven to be quite effective at accelerating and improving the training of deep neural networks dnns however bn brings additional computation consumes more memory and generally slows down the training process by a large margin which aggravates the training effort furthermore the nonlinear square and root operations in bn also impede the low bitwidth quantization techniques which draws much attention in deep learning hardware community in this work we propose an l1norm bn l1bn with only linear operations in both the forward and the backward propagations during training l1bn is shown to be approximately equivalent to the original l2norm bn l2bn by multiplying a scaling factor experiments on various convolutional neural networks cnns and generative adversarial networks gans reveal that l1bn maintains almost the same accuracies and convergence rates compared to l2bn but with higher computational efficiency on fpga platform the proposed signum and absolute operations in l1bn can achieve 15times speedup and save 50 power consumption compared with the original costly square and root operations respectively this hardwarefriendly normalization method not only surpasses l2bn in speed but also simplify the hardware design of asic accelerators with higher energy efficiency last but not the least l1bn promises a fully quantized training of dnns which is crucial to future adaptive terminal devices | [['batch', 'normalization', 'bn', 'has', 'been', 'proven', 'to', 'be', 'quite', 'effective', 'at', 'accelerating', 'and', 'improving', 'the', 'training', 'of', 'deep', 'neural', 'networks', 'dnns', 'however', 'bn', 'brings', 'additional', 'computation', 'consumes', 'more', 'memory', 'and', 'generally', 'slows', 'down', 'the', 'training', 'process', 'by', 'a', 'large', 'margin', 'which', 'aggravates', 'the', 'training', 'effort', 'furthermore', 'the', 'nonlinear', 'square', 'and', 'root', 'operations', 'in', 'bn', 'also', 'impede', 'the', 'low', 'bitwidth', 'quantization', 'techniques', 'which', 'draws', 'much', 'attention', 'in', 'deep', 'learning', 'hardware', 'community', 'in', 'this', 'work', 'we', 'propose', 'an', 'l1norm', 'bn', 'l1bn', 'with', 'only', 'linear', 'operations', 'in', 'both', 'the', 'forward', 'and', 'the', 'backward', 'propagations', 'during', 'training', 'l1bn', 'is', 'shown', 'to', 'be', 'approximately', 'equivalent', 'to', 'the', 'original', 'l2norm', 'bn', 'l2bn', 'by', 'multiplying', 'a', 'scaling', 'factor', 'experiments', 'on', 'various', 'convolutional', 'neural', 'networks', 'cnns', 'and', 'generative', 'adversarial', 'networks', 'gans', 'reveal', 'that', 'l1bn', 'maintains', 'almost', 'the', 'same', 'accuracies', 'and', 'convergence', 'rates', 'compared', 'to', 'l2bn', 'but', 'with', 'higher', 'computational', 'efficiency', 'on', 'fpga', 'platform', 'the', 'proposed', 'signum', 'and', 'absolute', 'operations', 'in', 'l1bn', 'can', 'achieve', '15times', 'speedup', 'and', 'save', '50', 'power', 'consumption', 'compared', 'with', 'the', 'original', 'costly', 'square', 'and', 'root', 'operations', 'respectively', 'this', 'hardwarefriendly', 'normalization', 'method', 'not', 'only', 'surpasses', 'l2bn', 'in', 'speed', 'but', 'also', 'simplify', 'the', 'hardware', 'design', 'of', 'asic', 'accelerators', 'with', 'higher', 'energy', 'efficiency', 'last', 'but', 'not', 'the', 'least', 'l1bn', 'promises', 'a', 'fully', 'quantized', 'training', 'of', 'dnns', 'which', 'is', 'crucial', 'to', 'future', 'adaptive', 'terminal', 'devices']] | [-0.07389331212902174, 0.0351289937012485, -0.022993270146091364, 0.03684360761856085, -0.07446977396224004, -0.22496946653161473, 0.06341450626496226, 0.45154016836615346, -0.28167406397794065, -0.3293121245827664, 0.09465768855793781, -0.22706618751571686, -0.16180290094214594, 0.2019223967541216, -0.13970499609462828, 0.11820388578861538, 0.1359176909598453, 0.030259205677322352, -0.10555638705005145, -0.3587377666161518, 0.189747995426943, 0.14201320923139402, 0.36362860086201515, 0.009325003324192949, 0.13152284339432502, -0.07803175177347536, 0.015436534937988553, -0.04129759255900151, -0.021928860313353112, 0.15246076735935207, 0.26543141802054987, 0.13250998316949267, 0.352769708795542, -0.46675913204671815, -0.19728997618464442, 0.10043074460851063, 0.16945014550367854, 0.08193730333166765, -0.01752159595135136, -0.25071773862280816, 0.13054546876621856, -0.17576245637610555, 0.004694130468999868, -0.13965364606055017, -0.01795248307624004, 0.0022232845480579678, -0.2558745089996524, 0.023402811314924662, 0.09223819883859337, 0.02582519738212728, 0.003021511102175551, -0.16471295563193658, -0.003700835044448333, 0.08174493399834588, 0.026278873926963167, 0.0818511121302705, 0.13777960544339968, -0.18257142762713893, -0.10714993423122603, 0.315938086990543, -0.030214443226954987, -0.1965374985097528, 0.14763919519949317, -0.06387627282054853, -0.11313383692026104, 0.148679285173313, 0.22065379836432705, 0.06431626443992611, -0.13299662115362784, 0.050388136396914314, 0.061810134333899, 0.1951412682775063, 0.09649097690136707, 0.03580092217048837, 0.10081712169469231, 0.25253683358055745, 0.0835476852845642, 0.12358480758417432, -0.10902475944668469, -0.07982808156305475, -0.19884315207471243, -0.12392875380357038, -0.1990151584107446, 0.06727173059836652, -0.11872287318631909, -0.11056172572271963, 0.3590843819676795, 0.16886433667753376, 0.18787952185030682, 0.14799340671042618, 0.3589150651985417, 0.09499007075188544, 0.20067234491310687, 0.16394151201260415, 0.22944645713249445, 0.06613543448124633, 0.1600418659142667, -0.16959662798143216, 0.07840021178816203, 0.015391922446993974] |
1,802.0977 | Magnetic and transport properties of Sb2Te3 doped with high
concentration of Cr | We report on molecular beam epitaxy and properties of a magnetic topological
insulator, Cr doped Sb2Te3. The composition analysis reveals that Cr replaces
Sb site, and x-ray diffraction confirms that single phase textured crystal
structure can be obtained for (CrxSb1-x)2Te3 with x up to 0.44. Further
increase in x results in phase separation or precipitates in the material. The
Curie temperature TC increases with x up to 0.44, and reaches to 250 K, which
is the highest TC observed till now in magnetically doped topological
insulators.
| cond-mat.mtrl-sci | we report on molecular beam epitaxy and properties of a magnetic topological insulator cr doped sb2te3 the composition analysis reveals that cr replaces sb site and xray diffraction confirms that single phase textured crystal structure can be obtained for crxsb1x2te3 with x up to 044 further increase in x results in phase separation or precipitates in the material the curie temperature tc increases with x up to 044 and reaches to 250 k which is the highest tc observed till now in magnetically doped topological insulators | [['we', 'report', 'on', 'molecular', 'beam', 'epitaxy', 'and', 'properties', 'of', 'a', 'magnetic', 'topological', 'insulator', 'cr', 'doped', 'sb2te3', 'the', 'composition', 'analysis', 'reveals', 'that', 'cr', 'replaces', 'sb', 'site', 'and', 'xray', 'diffraction', 'confirms', 'that', 'single', 'phase', 'textured', 'crystal', 'structure', 'can', 'be', 'obtained', 'for', 'crxsb1x2te3', 'with', 'x', 'up', 'to', '044', 'further', 'increase', 'in', 'x', 'results', 'in', 'phase', 'separation', 'or', 'precipitates', 'in', 'the', 'material', 'the', 'curie', 'temperature', 'tc', 'increases', 'with', 'x', 'up', 'to', '044', 'and', 'reaches', 'to', '250', 'k', 'which', 'is', 'the', 'highest', 'tc', 'observed', 'till', 'now', 'in', 'magnetically', 'doped', 'topological', 'insulators']] | [-0.13073892276186277, 0.23948809965787565, -0.008471666484632913, -0.055135410118793304, -0.003258756559123011, -0.15459555161240346, 0.16934075700666976, 0.45723632405347686, -0.26857752030277077, -0.32461015358567236, -0.016852773375370923, -0.3975897561320487, -0.05166648002067471, 0.18367012015763012, 0.04305782556972083, 0.007796164054204436, -0.07918474214315853, -0.05525361843516721, -0.1994895301101839, -0.24533452209468712, 0.24060555619790275, 0.05378147811793229, 0.32349823451436616, 0.08299632595222005, 0.035838979751090794, -0.04815973566523205, 0.1596298348656359, 0.03492350456140497, -0.16227632623032312, -0.00029102790662470984, 0.2708005052005105, -0.0960158958538052, 0.11754087678923765, -0.3755687380976537, -0.23818329884396755, -0.04514620553373414, 0.11688606466221459, 0.032946607934804084, -0.10808683744193438, -0.2564956697032732, 0.15578531613025595, -0.07972606750314727, -0.11694428964572794, -0.07701712536680348, -0.03791637713199153, -0.033638528230435706, -0.22627569917822257, 0.09148962085737902, 0.05922004124697517, 0.12130959520034273, -0.11997146678211934, -0.1448294327731299, -0.14010795699432493, -0.010648933340630986, 0.022029223334153785, 0.15921860153732054, 0.19008423825178075, -0.05253417002146735, -0.05570427481742466, 0.36418362798936227, -0.05380576701615663, 0.016683824842467027, 0.1584777156548465, -0.25234876539119905, -0.12869040176772292, 0.26355394903460844, 0.0877038791001884, 0.08366791507749653, -0.0877318946103675, 0.07092804509721806, 0.016678744269644514, 0.2931197890902267, 0.05159531986231313, 0.05540747622794965, 0.24035071807310862, 0.22596311554011395, 0.04061634641907671, 0.16625297947868925, -0.1700857218930169, 0.02047757762758171, -0.15450087526594014, -0.23628404005978476, -0.20081063943969854, 0.09943815875278018, -0.08045602273692459, -0.17284964869784958, 0.332818359131103, 0.11685195941587581, 0.18725803617168876, -0.09719905393225524, 0.1803180969594156, 0.057416492700576784, 0.0434980935362332, 0.037024598103016615, 0.24095444004325306, 0.19752905099269222, 0.17120193943162174, -0.21585939382476843, 0.09738757579094347, 0.01783461332156816] |
1,802.09771 | Vector-valued Schr\"odinger operators on $L^p$-spaces | In this paper we consider vector-valued Schr\"odinger operators of the form
$\mathrm{div}(Q\nabla u)-Vu$, where $V=(v_{ij})$ is a nonnegative locally
bounded matrix-valued function and $Q$ is a symmetric, strictly elliptic matrix
whose entries are bounded and continuously differentiable with bounded
derivatives. Concerning the potential $V$, we assume an that it is pointwise
accretive and that its entries are in $L^\infty_{\mathrm{loc}}(\mathbb{R}^d)$.
Under these assumptions, we prove that a realization of the vector-valued
Schr\"odinger operator generates a $C_0$-semigroup of contractions in
$L^p(\mathbb{R}^d; \mathbb{C}^m)$. Further properties are also investigated.
| math.AP | in this paper we consider vectorvalued schrodinger operators of the form mathrmdivqnabla uvu where vv_ij is a nonnegative locally bounded matrixvalued function and q is a symmetric strictly elliptic matrix whose entries are bounded and continuously differentiable with bounded derivatives concerning the potential v we assume an that it is pointwise accretive and that its entries are in linfty_mathrmlocmathbbrd under these assumptions we prove that a realization of the vectorvalued schrodinger operator generates a c_0semigroup of contractions in lpmathbbrd mathbbcm further properties are also investigated | [['in', 'this', 'paper', 'we', 'consider', 'vectorvalued', 'schrodinger', 'operators', 'of', 'the', 'form', 'mathrmdivqnabla', 'uvu', 'where', 'vv_ij', 'is', 'a', 'nonnegative', 'locally', 'bounded', 'matrixvalued', 'function', 'and', 'q', 'is', 'a', 'symmetric', 'strictly', 'elliptic', 'matrix', 'whose', 'entries', 'are', 'bounded', 'and', 'continuously', 'differentiable', 'with', 'bounded', 'derivatives', 'concerning', 'the', 'potential', 'v', 'we', 'assume', 'an', 'that', 'it', 'is', 'pointwise', 'accretive', 'and', 'that', 'its', 'entries', 'are', 'in', 'linfty_mathrmlocmathbbrd', 'under', 'these', 'assumptions', 'we', 'prove', 'that', 'a', 'realization', 'of', 'the', 'vectorvalued', 'schrodinger', 'operator', 'generates', 'a', 'c_0semigroup', 'of', 'contractions', 'in', 'lpmathbbrd', 'mathbbcm', 'further', 'properties', 'are', 'also', 'investigated']] | [-0.161616350342406, 0.13677431162174866, -0.019680053725407074, 0.017497889802609457, -0.10257087511339838, -0.1370924404402059, -0.06453949856719501, 0.41154114134246256, -0.3413290961577398, -0.07849864959262493, 0.16559657521074547, -0.3345964245694099, -0.21282966021539235, 0.15552936700490735, -0.09413775551791598, 0.08210547933874583, 0.024708524616094442, 0.10394769090954668, -0.13226372468364767, -0.2465480437258077, 0.4424389840626135, -0.11309958576429181, 0.12295449369234919, 0.06769672721814614, 0.11690606559320103, -0.026537616430531916, 0.004867302821721972, -0.04121208610013127, -0.11455385459481565, 0.12561572796278975, 0.23047551564963126, 0.09830607956547927, 0.32208106789465357, -0.39281641221718816, -0.16050590993836522, 0.227149306410333, 0.09961790731744613, -0.04621447996440821, -0.0794915833606998, -0.2994587818705818, 0.1236916607296912, -0.1331276226158413, -0.17145575893043383, -0.09230075715245997, 0.06091738693279827, 0.07579563599556866, -0.3950433949258451, 0.08007496157228072, 0.13429445200940457, 0.019103346242024224, -0.13118086225018133, -0.11228212471142775, -0.047285940208495025, 0.005582720597797051, -0.01533282131507493, 0.07686313533042444, 0.06814784991055182, -0.05324225126845172, -0.05637825256293049, 0.3048703374977155, -0.09262295129777091, -0.3404957673444254, 0.06588169205479505, -0.19530982679187706, -0.11660411403650736, 0.03421634870933414, 0.1400095017672312, 0.16972307363388742, -0.14112255769986204, 0.24721737069478145, -0.11914385289589806, 0.1385236628248538, 0.07832752859855933, 0.048608904278541844, 0.059328795297116765, 0.041752137970633624, 0.16531502007415927, 0.1303353690564996, 0.0778623112511435, -0.0745176593773067, -0.39191349722990176, -0.1335665508962759, -0.19701342461006036, 0.12535191146179853, -0.0895225036963494, -0.2203680867408743, 0.39556822340606096, 0.0814544343185134, 0.22307125171192171, 0.14066370860559912, 0.19215741617287077, 0.20445146691054106, 0.023356494022442435, 0.09932072957546063, 0.11358278057049596, 0.17296838748166565, 0.07333707720859022, -0.11906558952703164, 0.03448836370115736, 0.12461322683023954] |
1,802.09772 | Valley Topological Phases in Bilayer Sonic Crystals | Recently, the topological physics in artificial crystals for classical waves
has become an emerging research area. In this Letter, we propose a unique
bilayer design of sonic crystals that are constructed by two layers of coupled
hexagonal array of triangular scatterers. Assisted by the additional layer
degree of freedom, a rich topological phase diagram is achieved by simply
rotating scatterers in both layers. Under a unified theoretical framework, two
kinds of valley-projected topological acoustic insulators are distinguished
analytically, i.e., the layer-mixed and layer-polarized topological valley Hall
phases, respectively. The theory is evidently confirmed by our numerical and
experimental observations of the nontrivial edge states that propagate along
the interfaces separating different topological phases. Various applications
such as sound communications in integrated devices, can be anticipated by the
intriguing acoustic edge states enriched by the layer information.
| cond-mat.mes-hall | recently the topological physics in artificial crystals for classical waves has become an emerging research area in this letter we propose a unique bilayer design of sonic crystals that are constructed by two layers of coupled hexagonal array of triangular scatterers assisted by the additional layer degree of freedom a rich topological phase diagram is achieved by simply rotating scatterers in both layers under a unified theoretical framework two kinds of valleyprojected topological acoustic insulators are distinguished analytically ie the layermixed and layerpolarized topological valley hall phases respectively the theory is evidently confirmed by our numerical and experimental observations of the nontrivial edge states that propagate along the interfaces separating different topological phases various applications such as sound communications in integrated devices can be anticipated by the intriguing acoustic edge states enriched by the layer information | [['recently', 'the', 'topological', 'physics', 'in', 'artificial', 'crystals', 'for', 'classical', 'waves', 'has', 'become', 'an', 'emerging', 'research', 'area', 'in', 'this', 'letter', 'we', 'propose', 'a', 'unique', 'bilayer', 'design', 'of', 'sonic', 'crystals', 'that', 'are', 'constructed', 'by', 'two', 'layers', 'of', 'coupled', 'hexagonal', 'array', 'of', 'triangular', 'scatterers', 'assisted', 'by', 'the', 'additional', 'layer', 'degree', 'of', 'freedom', 'a', 'rich', 'topological', 'phase', 'diagram', 'is', 'achieved', 'by', 'simply', 'rotating', 'scatterers', 'in', 'both', 'layers', 'under', 'a', 'unified', 'theoretical', 'framework', 'two', 'kinds', 'of', 'valleyprojected', 'topological', 'acoustic', 'insulators', 'are', 'distinguished', 'analytically', 'ie', 'the', 'layermixed', 'and', 'layerpolarized', 'topological', 'valley', 'hall', 'phases', 'respectively', 'the', 'theory', 'is', 'evidently', 'confirmed', 'by', 'our', 'numerical', 'and', 'experimental', 'observations', 'of', 'the', 'nontrivial', 'edge', 'states', 'that', 'propagate', 'along', 'the', 'interfaces', 'separating', 'different', 'topological', 'phases', 'various', 'applications', 'such', 'as', 'sound', 'communications', 'in', 'integrated', 'devices', 'can', 'be', 'anticipated', 'by', 'the', 'intriguing', 'acoustic', 'edge', 'states', 'enriched', 'by', 'the', 'layer', 'information']] | [-0.21262718712979997, 0.23843331461593387, -0.049117980812055366, -0.011808033959284701, -0.0525849708532742, -0.17094030427505022, 0.05221048709160338, 0.36777867907313283, -0.2854270178272768, -0.28790961606772963, 0.07012930981926965, -0.310508885002626, -0.20332801480674081, 0.1677801947350855, 0.003224055542334638, 0.0679502639160664, -0.0073362681229978246, -0.07042512152068041, -0.05321731758131473, -0.1789762241075988, 0.29802365409106846, -0.02410434623145395, 0.3640377826160855, 0.030994596442259433, 0.05277958799808941, -0.024289739207813032, 0.05442298126613928, 0.07391956502192275, -0.1351812122636518, 0.11126776185421342, 0.29486817373997637, -0.024231103962908188, 0.17571903113620702, -0.5088579853099805, -0.2890970830633133, -0.028979288296843018, 0.1616541714804178, 0.11864555496894927, -0.12384246590512771, -0.33612617900664055, 0.0890135327078126, -0.15059088353914882, -0.1117423751545613, -0.06625314442854789, -0.009630337595525715, -0.0385498749846765, -0.18262018246955616, 0.03981041887568103, 0.05757915792572829, 0.08665451690106205, -0.022393092224740906, -0.09509824915892548, -0.0889171358982653, 0.09153872923580585, -0.02247192705714648, 0.0019315578750576134, 0.09767607819219983, -0.16575365874881823, -0.1714950736888029, 0.34217342089999603, -0.015078149134017251, -0.1567450761484603, 0.20166045270549754, -0.0896252881095279, -0.07738859285083081, 0.126879899814311, 0.1490029432638376, 0.08202734268097966, -0.1254539987617776, 0.07830915675860727, -0.04776090576692864, 0.1431882382405025, 0.059136946111296614, 0.10904697908985395, 0.3149744843305261, 0.1703848381138717, 0.04693886525928974, 0.19445750500782635, -0.08690490042963238, -0.06510572465895503, -0.2496946718129847, -0.1803199181229704, -0.2328196057152969, 0.001677985470397053, -0.0718423953519151, -0.16600665003061293, 0.43823886527507394, 0.10714843215084531, 0.15082076055653118, -0.07965393737562139, 0.2679400035076671, 0.08752002461847884, 0.06425551816959071, 0.03517058935292341, 0.2707706216032858, 0.1413646747082196, 0.08040645822399745, -0.17002101180497212, 0.03315264814429813, 0.03586713827594563] |
1,802.09773 | Rates of convergence for a class of generalized quasi contractive
mappings in Kohlenbach hyperbolic spaces | This paper is a continuation to the study of generalized quasi contractive
operators, essentially due to Akhtar et al. [A multi-step implicit iterative
process for common fixed points of generalized C^{q}-operators in convex metric
spaces, Sci. Int., 25(4) (2013), 887-891], in spaces of nonpositive sectional
curvature. We aim to establish results concerning convergence characteristics
of the classical iterative algorithms such as Picard, Mann, Ishikawa and
Xu-Noor iterative algorithms associated with the proposed class of generalized
quasi contractive operators. Moreover, we adopt the concept introduced by
Berinde [Comparing Krasnosel'skii and Mann iterative methods for Lipschitzian
generalized pseudo-contractions, Int. Conference on Fixed Point Theory Appl.,
15-26, Yokohama Publ., Yokohama, 2004.] for a comparison of the corresponding
rates of convergence of these iterative algorithms in such setting of spaces.
The results presented in this paper improve and extend some recent
corresponding results in the literature.
| math.FA | this paper is a continuation to the study of generalized quasi contractive operators essentially due to akhtar et al a multistep implicit iterative process for common fixed points of generalized cqoperators in convex metric spaces sci int 254 2013 887891 in spaces of nonpositive sectional curvature we aim to establish results concerning convergence characteristics of the classical iterative algorithms such as picard mann ishikawa and xunoor iterative algorithms associated with the proposed class of generalized quasi contractive operators moreover we adopt the concept introduced by berinde comparing krasnoselskii and mann iterative methods for lipschitzian generalized pseudocontractions int conference on fixed point theory appl 1526 yokohama publ yokohama 2004 for a comparison of the corresponding rates of convergence of these iterative algorithms in such setting of spaces the results presented in this paper improve and extend some recent corresponding results in the literature | [['this', 'paper', 'is', 'a', 'continuation', 'to', 'the', 'study', 'of', 'generalized', 'quasi', 'contractive', 'operators', 'essentially', 'due', 'to', 'akhtar', 'et', 'al', 'a', 'multistep', 'implicit', 'iterative', 'process', 'for', 'common', 'fixed', 'points', 'of', 'generalized', 'cqoperators', 'in', 'convex', 'metric', 'spaces', 'sci', 'int', '254', '2013', '887891', 'in', 'spaces', 'of', 'nonpositive', 'sectional', 'curvature', 'we', 'aim', 'to', 'establish', 'results', 'concerning', 'convergence', 'characteristics', 'of', 'the', 'classical', 'iterative', 'algorithms', 'such', 'as', 'picard', 'mann', 'ishikawa', 'and', 'xunoor', 'iterative', 'algorithms', 'associated', 'with', 'the', 'proposed', 'class', 'of', 'generalized', 'quasi', 'contractive', 'operators', 'moreover', 'we', 'adopt', 'the', 'concept', 'introduced', 'by', 'berinde', 'comparing', 'krasnoselskii', 'and', 'mann', 'iterative', 'methods', 'for', 'lipschitzian', 'generalized', 'pseudocontractions', 'int', 'conference', 'on', 'fixed', 'point', 'theory', 'appl', '1526', 'yokohama', 'publ', 'yokohama', '2004', 'for', 'a', 'comparison', 'of', 'the', 'corresponding', 'rates', 'of', 'convergence', 'of', 'these', 'iterative', 'algorithms', 'in', 'such', 'setting', 'of', 'spaces', 'the', 'results', 'presented', 'in', 'this', 'paper', 'improve', 'and', 'extend', 'some', 'recent', 'corresponding', 'results', 'in', 'the', 'literature']] | [-0.06934551750515204, -0.013417426873381962, -0.08784267837387126, 0.07627225738592107, -0.061700293674435025, -0.11473326567519347, 0.05356321141709272, 0.34771164106752944, -0.25998826963554805, -0.2339414319345344, 0.11725225979770425, -0.25507465549333785, -0.22082432914484182, 0.20373310366138705, -0.1759940338362118, 0.12142302587573581, 0.04831702432677369, -0.025751028867328867, -0.14981272959523587, -0.30762069255647745, 0.36643793847863837, 0.07056001328301671, 0.2687159718856599, 0.014462199609945802, 0.12611362836597598, 0.04163991207101122, -0.10949036422158208, 0.007599784883067888, -0.1878094458952546, 0.1444680447851116, 0.27401836884810643, 0.09954911385669701, 0.32633902512059326, -0.34267123279449363, -0.1635043052408625, 0.14465303430402213, 0.097409641930854, 0.012000643374288784, -0.02339563073548882, -0.3063502340211177, 0.10914327934647992, -0.1324191147577949, -0.11672863418660949, -0.10209290186193197, 0.0009983456933268292, 0.0777715776605285, -0.31169190588544177, 0.06048465231715989, 0.13254452903193475, 0.07348288468304365, -0.07797815900994465, -0.1616555877844803, 0.0334424037616426, 0.004349921795758693, 0.0005900684471485232, 0.06915686950806584, 0.05263772486325573, -0.013407956682118204, -0.18982430977399312, 0.29187062671681974, -0.06057628266759874, -0.19041297315690078, 0.18117711525273456, -0.040007443252012734, -0.18594515421564745, 0.09753947850549594, 0.1834331076739438, 0.1908006208763896, -0.11425272699628242, 0.1808014863743344, -0.05766466481145471, 0.03961613886456368, 0.12235869527520503, -0.018455337116713908, 0.02684462703216602, 0.07755952648585662, 0.10068848339484676, 0.1073277723232476, -0.002752830918539343, -0.13453449950098087, -0.29978656236712325, -0.16684763275107423, -0.1590739979125347, 0.0396833293917178, -0.07185885412175541, -0.16001862914109713, 0.34478001890238374, 0.13365434911718374, 0.17389191933976048, 0.10259869996704818, 0.21840281465419514, 0.09369793069730376, -0.04062779944556764, 0.13774343485163307, 0.21636986098040806, 0.19313241420347957, 0.13916554920519153, -0.17454605454729652, -0.017847641784636138, 0.23288417822743] |
1,802.09774 | On Probabilistic Term Rewriting | We study the termination problem for probabilistic term rewrite systems. We
prove that the interpretation method is sound and complete for a strengthening
of positive almost sure termination, when abstract reduction systems and term
rewrite systems are considered. Two instances of the interpretation method -
polynomial and matrix interpretations - are analyzed and shown to capture
interesting and nontrivial examples when automated. We capture probabilistic
computation in a novel way by way of multidistribution reduction sequences,
this way accounting for both the nondeterminism in the choice of the redex and
the probabilism intrinsic in firing each rule.
| cs.SC | we study the termination problem for probabilistic term rewrite systems we prove that the interpretation method is sound and complete for a strengthening of positive almost sure termination when abstract reduction systems and term rewrite systems are considered two instances of the interpretation method polynomial and matrix interpretations are analyzed and shown to capture interesting and nontrivial examples when automated we capture probabilistic computation in a novel way by way of multidistribution reduction sequences this way accounting for both the nondeterminism in the choice of the redex and the probabilism intrinsic in firing each rule | [['we', 'study', 'the', 'termination', 'problem', 'for', 'probabilistic', 'term', 'rewrite', 'systems', 'we', 'prove', 'that', 'the', 'interpretation', 'method', 'is', 'sound', 'and', 'complete', 'for', 'a', 'strengthening', 'of', 'positive', 'almost', 'sure', 'termination', 'when', 'abstract', 'reduction', 'systems', 'and', 'term', 'rewrite', 'systems', 'are', 'considered', 'two', 'instances', 'of', 'the', 'interpretation', 'method', 'polynomial', 'and', 'matrix', 'interpretations', 'are', 'analyzed', 'and', 'shown', 'to', 'capture', 'interesting', 'and', 'nontrivial', 'examples', 'when', 'automated', 'we', 'capture', 'probabilistic', 'computation', 'in', 'a', 'novel', 'way', 'by', 'way', 'of', 'multidistribution', 'reduction', 'sequences', 'this', 'way', 'accounting', 'for', 'both', 'the', 'nondeterminism', 'in', 'the', 'choice', 'of', 'the', 'redex', 'and', 'the', 'probabilism', 'intrinsic', 'in', 'firing', 'each', 'rule']] | [-0.12120501927320698, 0.02653314753582603, -0.07826813678992423, 0.1443572249067457, -0.08034194374555036, -0.1608324887966247, 0.06180145428761056, 0.3564085677658257, -0.306091455252547, -0.29619624902445235, 0.09800799747463315, -0.23624884546979477, -0.18869027831150512, 0.18700131546019724, -0.08552093497495854, 0.06396420990165912, 0.09071287741198351, 0.025046124289694584, -0.05157744474463949, -0.24382599173603872, 0.3012384493014236, -0.009863071290678099, 0.250290669481221, 0.05052868400847441, 0.1205005087791697, 0.058438264358004456, -0.06291289383202399, 0.04351979574482692, -0.08971466731416416, 0.1427590780683156, 0.25530258625941843, 0.16484305684356707, 0.2711690627087496, -0.3991558469390791, -0.18563370130171902, 0.1016664546130127, 0.131176461348016, 0.1407414740861369, -0.005614192997056402, -0.24722845499452792, 0.10087154047857774, -0.17250111537348284, -0.1049700232761863, -0.14346679923198136, 0.06022889267310108, 0.004410813975540039, -0.2671867083880658, 0.033847565169593224, 0.17074046411404484, 0.05956319642106169, -0.08138465305888339, -0.0719175244828588, 0.0367016002437786, 0.1008768683183007, 0.027259266896075322, -0.029959963754701772, 0.05686819029383754, -0.11383274060330893, -0.15431050001888683, 0.36211528131542237, -0.05850793985944045, -0.20372266085132174, 0.1859407080239371, -0.0709613592118809, -0.18294912124738882, 0.09711297502937286, 0.13018781107507255, 0.10785179529339076, -0.16946329045458697, 0.07471595171863507, -0.023259448881971796, 0.15118338642151732, 0.0903136042289828, 0.06585714692053826, 0.18160319128318836, 0.15259597949242512, 0.07846215120761803, 0.14797985530213306, 0.020539886482354056, -0.10193465884382788, -0.3264684487330286, -0.17831605236585202, -0.10319345551297852, -0.003370467367533006, -0.08867603315340698, -0.17793670202648315, 0.35767394183693746, 0.1598214763755861, 0.1646445305674876, 0.11313629334939546, 0.29626353414435136, 0.15766093323656702, 0.03598403927355417, 0.05198138675309325, 0.15795390581846924, 0.12394818632808317, 0.07721429322110979, -0.2120282867163616, 0.13461896342372423, 0.12612002171379955] |
1,802.09775 | Electromagnetic transition form factors of baryons in a relativistic
Faddeev approach | The covariant Faddeev approach which describes baryons as relativistic
three-quark bound states and is based on the Dyson-Schwinger and Bethe-Salpeter
equations of QCD is briefly reviewed. All elements, including especially the
baryons' three-body-wave-functions, the quark propagators and the dressed
quark-photon vertex, are calculated from a well-established approximation for
the quark-gluon interaction. Selected previous results of this approach for the
spectrum and elastic electromagnetic form factors of ground-state baryons and
resonances are reported. The main focus of this talk is a presentation and
discussion of results from a recent investigation of the electromagnetic
transition form factors between ground-state octet and decuplet baryons as well
as the octet-only $\Sigma^0$ to $\Lambda$ transition.
| hep-ph | the covariant faddeev approach which describes baryons as relativistic threequark bound states and is based on the dysonschwinger and bethesalpeter equations of qcd is briefly reviewed all elements including especially the baryons threebodywavefunctions the quark propagators and the dressed quarkphoton vertex are calculated from a wellestablished approximation for the quarkgluon interaction selected previous results of this approach for the spectrum and elastic electromagnetic form factors of groundstate baryons and resonances are reported the main focus of this talk is a presentation and discussion of results from a recent investigation of the electromagnetic transition form factors between groundstate octet and decuplet baryons as well as the octetonly sigma0 to lambda transition | [['the', 'covariant', 'faddeev', 'approach', 'which', 'describes', 'baryons', 'as', 'relativistic', 'threequark', 'bound', 'states', 'and', 'is', 'based', 'on', 'the', 'dysonschwinger', 'and', 'bethesalpeter', 'equations', 'of', 'qcd', 'is', 'briefly', 'reviewed', 'all', 'elements', 'including', 'especially', 'the', 'baryons', 'threebodywavefunctions', 'the', 'quark', 'propagators', 'and', 'the', 'dressed', 'quarkphoton', 'vertex', 'are', 'calculated', 'from', 'a', 'wellestablished', 'approximation', 'for', 'the', 'quarkgluon', 'interaction', 'selected', 'previous', 'results', 'of', 'this', 'approach', 'for', 'the', 'spectrum', 'and', 'elastic', 'electromagnetic', 'form', 'factors', 'of', 'groundstate', 'baryons', 'and', 'resonances', 'are', 'reported', 'the', 'main', 'focus', 'of', 'this', 'talk', 'is', 'a', 'presentation', 'and', 'discussion', 'of', 'results', 'from', 'a', 'recent', 'investigation', 'of', 'the', 'electromagnetic', 'transition', 'form', 'factors', 'between', 'groundstate', 'octet', 'and', 'decuplet', 'baryons', 'as', 'well', 'as', 'the', 'octetonly', 'sigma0', 'to', 'lambda', 'transition']] | [-0.09243362732404084, 0.2062040342759617, -0.09624329414994766, 0.11648336340591346, -0.09206990042865207, -0.057300823124091106, 0.03977695688674295, 0.3293544919471498, -0.1258664692674453, -0.2563177975179214, -0.04771565935677952, -0.34998915201328973, -0.08421776483387307, 0.06695405668923976, 0.13732677919324487, 0.08159634698165098, 0.05609242183035584, 0.06883950127478412, -0.07399471694076999, -0.1699927557115357, 0.4097914857858861, -0.011311265941778267, 0.21305434507559295, 0.15226260038023745, 0.031014375871530286, 0.017373883681742613, -0.04038916097057087, -0.04536019148374045, -0.11256733577896806, 0.09229482921418147, 0.22807542048179097, 0.06917912402207514, 0.17115530297073914, -0.38479622955330545, -0.1502606127372322, 0.017217973997402523, 0.16556977094323547, 0.1895167360425047, -0.03993887991183093, -0.3456186820425231, 0.043636675665362015, -0.20142997515870742, -0.15240274321452793, -0.1382943839352164, 0.008746388756359616, 0.032552078271422674, -0.24596254537916845, 0.0931351952927394, -0.00591535438003053, -0.011005129785863337, -0.08935387786456246, -0.28590817137673086, -0.008042847138346621, 0.06489690327671943, 0.06570012909705164, 0.1032437456467758, 0.13011261386607118, -0.21174932642908836, -0.1150171512056625, 0.4834610875178542, -0.038700665424888335, -0.1428573781589943, 0.09334532926247145, -0.1476443956069286, -0.12250776754485236, 0.09442505182663875, 0.16551252944757128, 0.10822162220116567, -0.20532945086489673, 0.11845542384037765, -0.05005570380577679, 0.10621216743796442, 0.0656358111925699, 0.10185595619906154, 0.1610701263330325, 0.16373352294235868, -0.1101598095804177, 0.09012856585818722, 0.030772993623503244, -0.13203297935305508, -0.38450984349819245, -0.0764899081275669, -0.15488512817170919, 0.025897673145798897, -0.04688392910355577, -0.1526648451798354, 0.38610867570861485, 0.06430385048777142, 0.19140879558054386, 0.012358070886909479, 0.33213909264412467, 0.12370358360176734, 0.03746604391684135, 0.09438770746001629, 0.28736843899996195, 0.26234984018460467, 0.09236443403966, -0.29896332877170706, -0.045450303210937244, 0.12114392339113962] |
1,802.09776 | Large Deviation Principles for countable Markov shifts | We establish the large deviation principle for a topological Markov shift
over infinite alphabet which satisfies strong combinatorial assumptions
called ``finite irreducibility'' or ``finite primitiveness''. More precisely,
we assume the existence of a Gibbs state for a potential $\phi$ in the sense of
Bowen, and prove the level-2 Large Deviation Principles for the distribution of
empirical means under the Gibbs state, as well as that of weighted periodic
points and iterated pre-images. The rate function is written with the pressure
and the free energy associated with the potential $\phi$.
| math.DS math.PR | we establish the large deviation principle for a topological markov shift over infinite alphabet which satisfies strong combinatorial assumptions called finite irreducibility or finite primitiveness more precisely we assume the existence of a gibbs state for a potential phi in the sense of bowen and prove the level2 large deviation principles for the distribution of empirical means under the gibbs state as well as that of weighted periodic points and iterated preimages the rate function is written with the pressure and the free energy associated with the potential phi | [['we', 'establish', 'the', 'large', 'deviation', 'principle', 'for', 'a', 'topological', 'markov', 'shift', 'over', 'infinite', 'alphabet', 'which', 'satisfies', 'strong', 'combinatorial', 'assumptions', 'called', 'finite', 'irreducibility', 'or', 'finite', 'primitiveness', 'more', 'precisely', 'we', 'assume', 'the', 'existence', 'of', 'a', 'gibbs', 'state', 'for', 'a', 'potential', 'phi', 'in', 'the', 'sense', 'of', 'bowen', 'and', 'prove', 'the', 'level2', 'large', 'deviation', 'principles', 'for', 'the', 'distribution', 'of', 'empirical', 'means', 'under', 'the', 'gibbs', 'state', 'as', 'well', 'as', 'that', 'of', 'weighted', 'periodic', 'points', 'and', 'iterated', 'preimages', 'the', 'rate', 'function', 'is', 'written', 'with', 'the', 'pressure', 'and', 'the', 'free', 'energy', 'associated', 'with', 'the', 'potential', 'phi']] | [-0.13063643393616076, 0.16283374484522606, -0.12233320223590867, 0.11688023186500439, -0.04303696805039759, -0.1009615035542414, 0.09011261866015213, 0.3121357770631386, -0.3462025062604384, -0.22193126022731038, 0.10002715841785009, -0.2562522508034652, -0.09602756088398481, 0.1764501560325946, -0.0487480686490678, 0.09534188299651512, 0.06704687447795137, 0.11615823578639803, -0.08308970715329038, -0.18846410706861538, 0.35841214700220997, -0.0043983229869891975, 0.26565291367428884, 0.06665136733036806, 0.17049074239647863, 0.05383499116314025, 0.03647198352370073, 0.03855234074448659, -0.16420717680582378, 0.08721921653275123, 0.19174230535281822, 0.11111507523243992, 0.28679096819409594, -0.3399249566613104, -0.19397991672369905, 0.2151290422665294, 0.06009649523184635, 0.04214533076182389, -0.05893372817693241, -0.265235335693102, 0.13511743963251568, -0.1630147922392511, -0.17917139384768566, -0.06978772680370392, 0.01760743356796659, 0.08981744262432172, -0.3107004262274131, 0.06827948436098681, 0.09038673531904351, 0.1252694370076907, -0.07365480024071241, -0.12110568621640348, -0.02153776783168062, 0.08027037061401643, 0.053682993560373274, 0.023022503158162264, 0.08973090135788714, -0.08168923946901817, -0.08445566581080625, 0.3496701014228165, -0.1347468195969916, -0.2226574637673118, 0.15101932001892815, -0.12420613940974529, -0.13761094263331455, 0.11216046000746163, 0.09962639065501704, 0.09638795430179346, -0.10524393964177844, 0.15887583024728388, -0.06012123290830376, 0.13544385903514922, 0.08585066180041229, 0.05181043135764247, 0.14208411118438977, 0.08444309388604862, 0.15575830364435783, 0.18934279143683275, -0.06004341045164355, -0.1388085579330271, -0.3816939491185952, -0.18284841713400304, -0.20982132757886907, 0.1204573508690704, -0.1110938695526949, -0.25299141062846914, 0.34568135129732336, 0.07378477860369127, 0.17270871714307842, 0.1535706472786842, 0.21192426735598763, 0.1548074504006019, 0.024679647970267317, 0.06732589586913078, 0.14965390354998157, 0.15377081128959122, 0.05313726752038664, -0.18707645631564612, 0.08897651740434495, 0.12257218461441384] |
1,802.09777 | Gaussian meta-embeddings for efficient scoring of a heavy-tailed PLDA
model | Embeddings in machine learning are low-dimensional representations of complex
input patterns, with the property that simple geometric operations like
Euclidean distances and dot products can be used for classification and
comparison tasks. The proposed meta-embeddings are special embeddings that live
in more general inner product spaces. They are designed to propagate
uncertainty to the final output in speaker recognition and similar
applications. The familiar Gaussian PLDA model (GPLDA) can be re-formulated as
an extractor for Gaussian meta-embeddings (GMEs), such that likelihood ratio
scores are given by Hilbert space inner products between Gaussian likelihood
functions. GMEs extracted by the GPLDA model have fixed precisions and do not
propagate uncertainty. We show that a generalization to heavy-tailed PLDA gives
GMEs with variable precisions, which do propagate uncertainty. Experiments on
NIST SRE 2010 and 2016 show that the proposed method applied to i-vectors
without length normalization is up to 20% more accurate than GPLDA applied to
length-normalized ivectors.
| stat.ML cs.CL cs.LG | embeddings in machine learning are lowdimensional representations of complex input patterns with the property that simple geometric operations like euclidean distances and dot products can be used for classification and comparison tasks the proposed metaembeddings are special embeddings that live in more general inner product spaces they are designed to propagate uncertainty to the final output in speaker recognition and similar applications the familiar gaussian plda model gplda can be reformulated as an extractor for gaussian metaembeddings gmes such that likelihood ratio scores are given by hilbert space inner products between gaussian likelihood functions gmes extracted by the gplda model have fixed precisions and do not propagate uncertainty we show that a generalization to heavytailed plda gives gmes with variable precisions which do propagate uncertainty experiments on nist sre 2010 and 2016 show that the proposed method applied to ivectors without length normalization is up to 20 more accurate than gplda applied to lengthnormalized ivectors | [['embeddings', 'in', 'machine', 'learning', 'are', 'lowdimensional', 'representations', 'of', 'complex', 'input', 'patterns', 'with', 'the', 'property', 'that', 'simple', 'geometric', 'operations', 'like', 'euclidean', 'distances', 'and', 'dot', 'products', 'can', 'be', 'used', 'for', 'classification', 'and', 'comparison', 'tasks', 'the', 'proposed', 'metaembeddings', 'are', 'special', 'embeddings', 'that', 'live', 'in', 'more', 'general', 'inner', 'product', 'spaces', 'they', 'are', 'designed', 'to', 'propagate', 'uncertainty', 'to', 'the', 'final', 'output', 'in', 'speaker', 'recognition', 'and', 'similar', 'applications', 'the', 'familiar', 'gaussian', 'plda', 'model', 'gplda', 'can', 'be', 'reformulated', 'as', 'an', 'extractor', 'for', 'gaussian', 'metaembeddings', 'gmes', 'such', 'that', 'likelihood', 'ratio', 'scores', 'are', 'given', 'by', 'hilbert', 'space', 'inner', 'products', 'between', 'gaussian', 'likelihood', 'functions', 'gmes', 'extracted', 'by', 'the', 'gplda', 'model', 'have', 'fixed', 'precisions', 'and', 'do', 'not', 'propagate', 'uncertainty', 'we', 'show', 'that', 'a', 'generalization', 'to', 'heavytailed', 'plda', 'gives', 'gmes', 'with', 'variable', 'precisions', 'which', 'do', 'propagate', 'uncertainty', 'experiments', 'on', 'nist', 'sre', '2010', 'and', '2016', 'show', 'that', 'the', 'proposed', 'method', 'applied', 'to', 'ivectors', 'without', 'length', 'normalization', 'is', 'up', 'to', '20', 'more', 'accurate', 'than', 'gplda', 'applied', 'to', 'lengthnormalized', 'ivectors']] | [-0.010388241570082403, 0.07039431475615504, -0.09022015104550989, 0.11762551531691344, -0.09634781285309263, -0.1852751936493141, -0.014906297941061278, 0.443074359888992, -0.2805115919680365, -0.31030372835154973, 0.07824518083399462, -0.27210081595356667, -0.13064185204134593, 0.25082716923357257, -0.1391599071752881, 0.10328946324110391, 0.1264563321135938, 0.06695174563285564, -0.12351581197637584, -0.3023585382383317, 0.27255903641663254, 0.04108262783096683, 0.3238036878106575, -0.06412558927456097, 0.0893980454082691, 0.02293814079002327, -0.01321793373433813, -0.01851015194007496, -0.053306290930589556, 0.14888514744778794, 0.305271020076508, 0.1660575027126939, 0.24273415666764542, -0.35677965303372233, -0.2282376760917325, 0.12635863200430908, 0.13750650107319798, 0.06068487592161663, 0.03987981807571956, -0.34699399912309264, 0.06822349846648473, -0.18421765798101983, 0.014309832285488806, -0.1727273758170345, -0.01747779365508787, -0.002282307549349723, -0.30624436471431005, 0.07950938256915599, 0.09691332125315262, 0.04352898709522936, -0.03182513534782394, -0.154895210409567, -0.011264602925568338, 0.13534967202633139, -0.004210970280391555, 0.07520711904451732, 0.14201743787815493, -0.08416089046626321, -0.13170271413701196, 0.3387704736222663, -0.09447731229546104, -0.2786965826015559, 0.18480790523932344, -0.06472748659791484, -0.12913805858622635, 0.08570802705784913, 0.2418286638995332, 0.06597504267439006, -0.13067282250811976, 0.010153164998102452, -0.04766205881511973, 0.20348981536789648, 0.1082371891791662, 0.0003613438461005928, 0.14660831753525042, 0.10923033936790401, 0.013907577982547903, 0.10754599274256296, -0.09312507797674757, -0.08367312463158141, -0.2517561336738929, -0.10744743445998944, -0.1624786410338035, 0.001991945876262992, -0.12798101912476048, -0.14532974113620098, 0.33781524470316304, 0.1605945251281223, 0.2072978794364439, 0.116311401704837, 0.2816301165689384, 0.08266262056290984, 0.11024773212209825, 0.11483723308830973, 0.19800270515448984, 0.09662022194149153, 0.04650178470859124, -0.07933028510155817, 0.0864605004959289, 0.05256761677202679] |
1,802.09778 | Mixed Supervised Object Detection with Robust Objectness Transfer | In this paper, we consider the problem of leveraging existing fully labeled
categories to improve the weakly supervised detection (WSD) of new object
categories, which we refer to as mixed supervised detection (MSD). Different
from previous MSD methods that directly transfer the pre-trained object
detectors from existing categories to new categories, we propose a more
reasonable and robust objectness transfer approach for MSD. In our framework,
we first learn domain-invariant objectness knowledge from the existing fully
labeled categories. The knowledge is modeled based on invariant features that
are robust to the distribution discrepancy between the existing categories and
new categories; therefore the resulting knowledge would generalize well to new
categories and could assist detection models to reject distractors (e.g.,
object parts) in weakly labeled images of new categories. Under the guidance of
learned objectness knowledge, we utilize multiple instance learning (MIL) to
model the concepts of both objects and distractors and to further improve the
ability of rejecting distractors in weakly labeled images. Our robust
objectness transfer approach outperforms the existing MSD methods, and achieves
state-of-the-art results on the challenging ILSVRC2013 detection dataset and
the PASCAL VOC datasets.
| cs.CV | in this paper we consider the problem of leveraging existing fully labeled categories to improve the weakly supervised detection wsd of new object categories which we refer to as mixed supervised detection msd different from previous msd methods that directly transfer the pretrained object detectors from existing categories to new categories we propose a more reasonable and robust objectness transfer approach for msd in our framework we first learn domaininvariant objectness knowledge from the existing fully labeled categories the knowledge is modeled based on invariant features that are robust to the distribution discrepancy between the existing categories and new categories therefore the resulting knowledge would generalize well to new categories and could assist detection models to reject distractors eg object parts in weakly labeled images of new categories under the guidance of learned objectness knowledge we utilize multiple instance learning mil to model the concepts of both objects and distractors and to further improve the ability of rejecting distractors in weakly labeled images our robust objectness transfer approach outperforms the existing msd methods and achieves stateoftheart results on the challenging ilsvrc2013 detection dataset and the pascal voc datasets | [['in', 'this', 'paper', 'we', 'consider', 'the', 'problem', 'of', 'leveraging', 'existing', 'fully', 'labeled', 'categories', 'to', 'improve', 'the', 'weakly', 'supervised', 'detection', 'wsd', 'of', 'new', 'object', 'categories', 'which', 'we', 'refer', 'to', 'as', 'mixed', 'supervised', 'detection', 'msd', 'different', 'from', 'previous', 'msd', 'methods', 'that', 'directly', 'transfer', 'the', 'pretrained', 'object', 'detectors', 'from', 'existing', 'categories', 'to', 'new', 'categories', 'we', 'propose', 'a', 'more', 'reasonable', 'and', 'robust', 'objectness', 'transfer', 'approach', 'for', 'msd', 'in', 'our', 'framework', 'we', 'first', 'learn', 'domaininvariant', 'objectness', 'knowledge', 'from', 'the', 'existing', 'fully', 'labeled', 'categories', 'the', 'knowledge', 'is', 'modeled', 'based', 'on', 'invariant', 'features', 'that', 'are', 'robust', 'to', 'the', 'distribution', 'discrepancy', 'between', 'the', 'existing', 'categories', 'and', 'new', 'categories', 'therefore', 'the', 'resulting', 'knowledge', 'would', 'generalize', 'well', 'to', 'new', 'categories', 'and', 'could', 'assist', 'detection', 'models', 'to', 'reject', 'distractors', 'eg', 'object', 'parts', 'in', 'weakly', 'labeled', 'images', 'of', 'new', 'categories', 'under', 'the', 'guidance', 'of', 'learned', 'objectness', 'knowledge', 'we', 'utilize', 'multiple', 'instance', 'learning', 'mil', 'to', 'model', 'the', 'concepts', 'of', 'both', 'objects', 'and', 'distractors', 'and', 'to', 'further', 'improve', 'the', 'ability', 'of', 'rejecting', 'distractors', 'in', 'weakly', 'labeled', 'images', 'our', 'robust', 'objectness', 'transfer', 'approach', 'outperforms', 'the', 'existing', 'msd', 'methods', 'and', 'achieves', 'stateoftheart', 'results', 'on', 'the', 'challenging', 'ilsvrc2013', 'detection', 'dataset', 'and', 'the', 'pascal', 'voc', 'datasets']] | [0.019136353104221734, -0.02634587875775438, -0.048585584961829034, 0.07142188948606379, -0.14707135165139953, -0.18110464033522108, 0.010416054316087962, 0.4548842972441715, -0.2919609563083368, -0.36519117764335995, 0.034199026159377414, -0.28833665323513064, -0.1447798972692405, 0.17390934033988123, -0.2133590621190106, 0.05484312884212333, 0.17326775088626395, 0.06106023211032152, -0.06912992195414498, -0.2755806960321547, 0.37445622508072274, 0.02483447106366858, 0.35731062853827755, 0.009249591777296836, 0.1264564512109265, -0.04516696333117347, -0.07387706370679958, 0.0011727994362367912, -0.04202717224278728, 0.21626467826996654, 0.3218861803064469, 0.2050540381547143, 0.23793285120120075, -0.3584351078062219, -0.2196758103648577, 0.09562281119399407, 0.12142578229836641, 0.11334202804441992, -0.006504251784908194, -0.4479484243239177, 0.08122824503609197, -0.19888016303872413, 0.06746358721160349, -0.15047365658857087, -0.036265809100091535, -0.026977424963719233, -0.2940192239933667, 0.06880877796867664, 0.10985060757647784, 0.019716667597172187, -0.09927495210208594, -0.13055314594741038, 0.05996725985042236, 0.2161582206980266, 0.018907262995700412, 0.017495512385218542, 0.15765259328962086, -0.24025399475284118, -0.1571739755652627, 0.3191689988300997, -0.0860021100651988, -0.24242039877881713, 0.2841930134194665, -0.02425888088591238, -0.1415140372453297, 0.11658998922335896, 0.21102394719925174, 0.19564711284561162, -0.15296368713569927, -0.029936548250298848, -0.06702649047935104, 0.19579155392389982, 0.04236541781141026, -0.022269155396683577, 0.1812924729323292, 0.25674146609603765, 0.019258466182633282, 0.14296568154439113, -0.19257829622910458, -0.03585828355751298, -0.23852526897625215, -0.10100356406690751, -0.16859332912978023, -0.03699477380785616, -0.044882216373848004, -0.13627655985197015, 0.3842392540029052, 0.3165255569880135, 0.201357997661615, 0.1496359603448543, 0.3637832134238821, -0.049202639376125394, 0.11604761177218183, 0.06934759417670144, 0.19787533869322865, 0.013846826115424963, 0.08902786514861757, -0.1270078827349588, 0.06070356059973029, 0.07414577255629876] |
1,802.09779 | Finite difference/element method for time-fractional Navier-Stokes
equations | We apply a composite idea of semi-discrete finite difference approximation in
time and Galerkin finite element method in space to solve the Navier-Stokes
equations with Caputo derivative of order 0 < {\alpha} < 1. The stability
properties and convergence error estimates for both the semi-discrete and fully
discrete schemes are obtained. Numerical example is provided to illustrate the
validity of theoretical results.
| math.NA | we apply a composite idea of semidiscrete finite difference approximation in time and galerkin finite element method in space to solve the navierstokes equations with caputo derivative of order 0 alpha 1 the stability properties and convergence error estimates for both the semidiscrete and fully discrete schemes are obtained numerical example is provided to illustrate the validity of theoretical results | [['we', 'apply', 'a', 'composite', 'idea', 'of', 'semidiscrete', 'finite', 'difference', 'approximation', 'in', 'time', 'and', 'galerkin', 'finite', 'element', 'method', 'in', 'space', 'to', 'solve', 'the', 'navierstokes', 'equations', 'with', 'caputo', 'derivative', 'of', 'order', '0', 'alpha', '1', 'the', 'stability', 'properties', 'and', 'convergence', 'error', 'estimates', 'for', 'both', 'the', 'semidiscrete', 'and', 'fully', 'discrete', 'schemes', 'are', 'obtained', 'numerical', 'example', 'is', 'provided', 'to', 'illustrate', 'the', 'validity', 'of', 'theoretical', 'results']] | [-0.07640368809031012, 0.01807345203900089, -0.10741053963041243, 0.08086713820424242, -0.06001591735209028, -0.11460129901921998, 0.01668386054225266, 0.3744770105772962, -0.30881785418217383, -0.23115939433531216, 0.17426470569722977, -0.2636733531951904, -0.0670037974913915, 0.16785526631089548, -0.057484241854399445, 0.15726506229645262, 0.045595674822106955, -0.055732121629019575, -0.15008301190876713, -0.2771712602737049, 0.27408699359123906, -0.05037647921902438, 0.24665887644514442, 0.028966303759564955, 0.14999120981277278, -0.11875818398160239, -0.06243109186179936, 0.01952270260808291, -0.1782645766623318, 0.08050147128912309, 0.25794749121802546, 0.004116042346383134, 0.34767266996204854, -0.3991124735989918, -0.22588444204690555, 0.055039279131839675, 0.15915805181333173, 0.0661918024532497, -0.07606665841303765, -0.29157030482310803, 0.1515971150714904, -0.1611407341125111, -0.19285044839295248, -0.1282873335760087, -0.03585840824525803, 0.11246820827946066, -0.3285537024649481, 0.13271100437268615, 0.04630628818801294, 0.03973334579107662, -0.14661640376628687, -0.11065725816879421, 0.011679366913934548, 0.06826468095338593, 0.03652757118300845, -0.06598134135516981, -0.036798396660014984, -0.03438991216632227, -0.10170243486451606, 0.3959851217456162, -0.11461684659783107, -0.34080233753969275, 0.13735540974885224, -0.14872808228246867, -0.08287328321021051, 0.13371033609688918, 0.1541641366512825, 0.17712314022549738, -0.07579517313279212, 0.15466362439425818, 0.026221633058351776, 0.17615747110297283, 0.009070145920850337, -0.01691949343464027, -0.018375448028867442, 0.17898516299513478, 0.10595289156772196, 0.07064057059663659, -0.0446048428323896, -0.1813429191708565, -0.40362354715665183, -0.17783207519290348, -0.19624316757544874, -0.02964322522748262, -0.15508971696957208, -0.17160486720191936, 0.3608461119797236, 0.16906059770844878, 0.06048018384414414, 0.13480923182020585, 0.28945237564621495, 0.19214150075179834, -0.07711031629684537, 0.07272669809559981, 0.20500661112988988, 0.23419379877547422, 0.09559853407554328, -0.2727533948995794, 0.003090673390155037, 0.2723609331374367] |
1,802.0978 | Breakdown of topological Thouless pumping in the strongly interacting
regime | We elucidate the mechanism for instability of topological Thouless pumping in
strongly interacting systems from a viewpoint of symmetry-protected topological
phases. If the protecting symmetries of the underlying topological phases
change between noninteracting fermions and a bosonic system in the strong
coupling limit, the symmetry protection argument enforces a gap closing and
thereby predicts a breakdown of the topological pumping. We also demonstrate
that, even in the weakly interacting regime where the bulk topological pumping
is still robust, the interaction effects manifest themselves in the edge
density profiles, leading to a unique feature of the pumping in open boundary
conditions. Furthermore, an extension of the above results indicates that an
analog of an interaction-induced phase of Weyl semimetals can be realized in
the setup of the topological pumping. Our results provide a systematic
understanding for the stability of topological pumping against strong
interactions, to which the conventional perturbative argument cannot be
applied.
| cond-mat.str-el cond-mat.mes-hall cond-mat.quant-gas | we elucidate the mechanism for instability of topological thouless pumping in strongly interacting systems from a viewpoint of symmetryprotected topological phases if the protecting symmetries of the underlying topological phases change between noninteracting fermions and a bosonic system in the strong coupling limit the symmetry protection argument enforces a gap closing and thereby predicts a breakdown of the topological pumping we also demonstrate that even in the weakly interacting regime where the bulk topological pumping is still robust the interaction effects manifest themselves in the edge density profiles leading to a unique feature of the pumping in open boundary conditions furthermore an extension of the above results indicates that an analog of an interactioninduced phase of weyl semimetals can be realized in the setup of the topological pumping our results provide a systematic understanding for the stability of topological pumping against strong interactions to which the conventional perturbative argument cannot be applied | [['we', 'elucidate', 'the', 'mechanism', 'for', 'instability', 'of', 'topological', 'thouless', 'pumping', 'in', 'strongly', 'interacting', 'systems', 'from', 'a', 'viewpoint', 'of', 'symmetryprotected', 'topological', 'phases', 'if', 'the', 'protecting', 'symmetries', 'of', 'the', 'underlying', 'topological', 'phases', 'change', 'between', 'noninteracting', 'fermions', 'and', 'a', 'bosonic', 'system', 'in', 'the', 'strong', 'coupling', 'limit', 'the', 'symmetry', 'protection', 'argument', 'enforces', 'a', 'gap', 'closing', 'and', 'thereby', 'predicts', 'a', 'breakdown', 'of', 'the', 'topological', 'pumping', 'we', 'also', 'demonstrate', 'that', 'even', 'in', 'the', 'weakly', 'interacting', 'regime', 'where', 'the', 'bulk', 'topological', 'pumping', 'is', 'still', 'robust', 'the', 'interaction', 'effects', 'manifest', 'themselves', 'in', 'the', 'edge', 'density', 'profiles', 'leading', 'to', 'a', 'unique', 'feature', 'of', 'the', 'pumping', 'in', 'open', 'boundary', 'conditions', 'furthermore', 'an', 'extension', 'of', 'the', 'above', 'results', 'indicates', 'that', 'an', 'analog', 'of', 'an', 'interactioninduced', 'phase', 'of', 'weyl', 'semimetals', 'can', 'be', 'realized', 'in', 'the', 'setup', 'of', 'the', 'topological', 'pumping', 'our', 'results', 'provide', 'a', 'systematic', 'understanding', 'for', 'the', 'stability', 'of', 'topological', 'pumping', 'against', 'strong', 'interactions', 'to', 'which', 'the', 'conventional', 'perturbative', 'argument', 'can', 'not', 'be', 'applied']] | [-0.23226482975844512, 0.21184614840679988, -0.12110441625673701, 0.053818002523507415, -0.03315560608110056, -0.16003985528596767, 0.08917681199157598, 0.2979015143926018, -0.2841733537577823, -0.26359898327953285, 0.05444970862518424, -0.2619690854266724, -0.1578631283566234, 0.15785164488144707, -0.021987309758520982, 0.0213501878406889, -0.034628593081340586, -0.03276952312254115, -0.09052444441895323, -0.17334396788375636, 0.31890349609022534, -0.006642442190520514, 0.3475635691296334, 0.11444798639969402, 0.0022966527331352623, -0.021125236429499303, 0.07972629721355594, 0.02293786829264433, -0.10014838583547138, 0.054045425203333615, 0.2186485906028846, -0.04939261385623146, 0.19228455423091362, -0.44642226696866594, -0.2370404680594315, 0.0436584269323575, 0.14750833213527145, 0.1572467584818833, -0.09617719536394587, -0.3383401023144864, 0.04806705969051014, -0.17735096389196472, -0.15404509155390164, -0.10223022792366596, -0.0127894838304058, -0.06173477724218875, -0.258724377708193, 0.0707520660592374, 0.12516313557226966, 0.07214009617850964, -0.07429688397545392, 0.016196150464322295, -0.1015850115716579, 0.11088788268016347, 0.041208596941193235, -0.007980003184486741, 0.1138157699404747, -0.20955653764989252, -0.15567871681688464, 0.3866255310869295, -0.08800753070120669, -0.1637616489536062, 0.22680260855521933, -0.12270656857183782, -0.11711813702120208, 0.14207079984077248, 0.10356839613538552, 0.07453557995895192, -0.08611872281842664, 0.08005098397752233, -0.03943569585376608, 0.16321921381137633, -0.0161708950679871, 0.11660239117195696, 0.2811011736847314, 0.17064721628207885, 0.10878742519717395, 0.1670094723067569, -0.059675004930171534, -0.09704760958446688, -0.32929837987971267, -0.17199407594911512, -0.20753281611912683, 0.06226030261922716, -0.03972356231389354, -0.16990358084805457, 0.45195212290056197, 0.19892246013635076, 0.1831245859795755, -0.02608431152941574, 0.253059661405441, 0.15424297045569355, 0.06588475499910856, 0.035557013915036045, 0.30044743615382175, 0.13690500899090194, 0.03716451680786859, -0.29045799746652884, 0.021485265912001138, 0.06198167686161944] |
1,802.09781 | Fast and accurate quantum Monte Carlo for molecular crystals | Computer simulation plays a central role in modern day materials science. The
utility of a given computational approach depends largely on the balance it
provides between accuracy and computational cost. Molecular crystals are a
class of materials of great technological importance which are challenging for
even the most sophisticated \emph{ab initio} electronic structure theories to
accurately describe. This is partly because they are held together by a balance
of weak intermolecular forces but also because the primitive cells of molecular
crystals are often substantially larger than those of atomic solids. Here, we
demonstrate that diffusion quantum Monte Carlo (DMC) delivers sub-chemical
accuracy for a diverse set of molecular crystals at a surprisingly moderate
computational cost. As such, we anticipate that DMC can play an important role
in understanding and predicting the properties of a large number of molecular
crystals, including those built from relatively large molecules which are far
beyond reach of other high accuracy methods.
| physics.chem-ph cond-mat.mtrl-sci physics.comp-ph quant-ph | computer simulation plays a central role in modern day materials science the utility of a given computational approach depends largely on the balance it provides between accuracy and computational cost molecular crystals are a class of materials of great technological importance which are challenging for even the most sophisticated emphab initio electronic structure theories to accurately describe this is partly because they are held together by a balance of weak intermolecular forces but also because the primitive cells of molecular crystals are often substantially larger than those of atomic solids here we demonstrate that diffusion quantum monte carlo dmc delivers subchemical accuracy for a diverse set of molecular crystals at a surprisingly moderate computational cost as such we anticipate that dmc can play an important role in understanding and predicting the properties of a large number of molecular crystals including those built from relatively large molecules which are far beyond reach of other high accuracy methods | [['computer', 'simulation', 'plays', 'a', 'central', 'role', 'in', 'modern', 'day', 'materials', 'science', 'the', 'utility', 'of', 'a', 'given', 'computational', 'approach', 'depends', 'largely', 'on', 'the', 'balance', 'it', 'provides', 'between', 'accuracy', 'and', 'computational', 'cost', 'molecular', 'crystals', 'are', 'a', 'class', 'of', 'materials', 'of', 'great', 'technological', 'importance', 'which', 'are', 'challenging', 'for', 'even', 'the', 'most', 'sophisticated', 'emphab', 'initio', 'electronic', 'structure', 'theories', 'to', 'accurately', 'describe', 'this', 'is', 'partly', 'because', 'they', 'are', 'held', 'together', 'by', 'a', 'balance', 'of', 'weak', 'intermolecular', 'forces', 'but', 'also', 'because', 'the', 'primitive', 'cells', 'of', 'molecular', 'crystals', 'are', 'often', 'substantially', 'larger', 'than', 'those', 'of', 'atomic', 'solids', 'here', 'we', 'demonstrate', 'that', 'diffusion', 'quantum', 'monte', 'carlo', 'dmc', 'delivers', 'subchemical', 'accuracy', 'for', 'a', 'diverse', 'set', 'of', 'molecular', 'crystals', 'at', 'a', 'surprisingly', 'moderate', 'computational', 'cost', 'as', 'such', 'we', 'anticipate', 'that', 'dmc', 'can', 'play', 'an', 'important', 'role', 'in', 'understanding', 'and', 'predicting', 'the', 'properties', 'of', 'a', 'large', 'number', 'of', 'molecular', 'crystals', 'including', 'those', 'built', 'from', 'relatively', 'large', 'molecules', 'which', 'are', 'far', 'beyond', 'reach', 'of', 'other', 'high', 'accuracy', 'methods']] | [-0.0875926335867975, 0.12149304943243718, -0.05020660551925821, 0.063607496360407, -0.041095053777098656, -0.12161798674853579, 0.05351746603696337, 0.40103641166802373, -0.26131032790440406, -0.3697481199077541, 0.04867368735177743, -0.2769741911681429, -0.1505900162121942, 0.251580706851617, -0.01161245950047047, 0.0570870041734569, 0.10300589196023441, -0.039520202324755734, -0.052267600283507375, -0.22318887719208555, 0.223357268760822, 0.11724105336958723, 0.2744582864095367, 0.08828665899984058, 0.08604436121306443, -0.03633645516970465, 0.014126520048105908, 0.039576276565992066, -0.10372488699569893, 0.19040332086564551, 0.3143947108183056, 0.035388814522734575, 0.3287811758770277, -0.4902867675188088, -0.24525000067998565, 0.060886732167414116, 0.12409931935309883, 0.16030568852870455, -0.0879079858945202, -0.18507022080762733, 0.06444610806197049, -0.15669526971816536, -0.10215577081206345, -0.1411399213807477, -0.0036443027096890635, 0.06009477250458252, -0.19534809492535948, 0.07466336896083497, 0.003598681687107009, 0.12868184367375027, -0.017026738630187128, -0.1759235151262293, -0.022897586708648072, 0.1359990729349515, -0.01735481299242125, 0.03800749440316952, 0.2020409423978098, -0.1998201404743257, -0.07876090291294179, 0.484383437782526, 0.01670748619165557, -0.17157987494335225, 0.2669337656829626, -0.1319855870949405, -0.17208180060129494, 0.17470052849441287, 0.15583814825532177, 0.09550480796925483, -0.12769529587596715, 0.06885371606481532, -0.006646467144450834, 0.18524492482744878, 0.025580411610163507, 0.09641484026947329, 0.22316879767083353, 0.20911403320909988, 0.01545105207290861, 0.08510627245507954, -0.06414997198153287, -0.15910120013079818, -0.20909085080267922, -0.18188381270775872, -0.22139699798407814, 0.05590591475296195, -0.07294304387384816, -0.16043427904406862, 0.32382028462185014, 0.169270388021945, 0.11735546179115772, 0.02198528310494317, 0.25695673723840307, 0.051588144273621094, 0.07050994419522824, 0.02247810966425365, 0.2513789749674259, 0.08168798969728092, 0.06267465285115666, -0.21657456737762737, 0.13273878100012698, 0.013070935270779075] |
1,802.09782 | Potential energy surface, dipole moment surface and the intensity
calculations for the 10 micron, 5 micron, and 3 micron bands of ozone | Monitoring ozone concentrations in the Earth's atmosphere using spectroscopic
methods is a major activity which undertaken both from the ground and from
space. However there are long-running issues of consistency between
measurements made at infrared (IR) and ultraviolet (UV) wavelengths. In
addition, key O$_3$ IR bands at 10 \muu, 5 \muu\ and 3 \muu\ also yield results
which differ by a few percent when used for retrievals. These problems stem
from the underlying laboratory measurements of the line intensities. Here we
use quantum chemical techniques, first principles electronic structure and
variational nuclear-motion calculations, to address this problem. A new
high-accuracy \ai\ dipole moment surface (DMS) is computed. Several
spectroscopically-determined potential energy surfaces (PESs) are constructed
by fitting to empirical energy levels in the region below 7000 \cm\ starting
from an \ai\ PES. Nuclear motion calculations using these new surfaces allow
the unambiguous determination of the intensities of 10 \muu\ band transitions,
and the computation of the intensities of 10 \muu\ and 5 \muu\ bands within
their experimental error. A decrease in intensities within the 3 \muu\ is
predicted which appears consistent with atmospheric retrievals. The PES and DMS
form a suitable starting point both for the computation of comprehensive ozone
line lists and for future calculations of electronic transition intensities
| physics.ao-ph physics.chem-ph | monitoring ozone concentrations in the earths atmosphere using spectroscopic methods is a major activity which undertaken both from the ground and from space however there are longrunning issues of consistency between measurements made at infrared ir and ultraviolet uv wavelengths in addition key o_3 ir bands at 10 muu 5 muu and 3 muu also yield results which differ by a few percent when used for retrievals these problems stem from the underlying laboratory measurements of the line intensities here we use quantum chemical techniques first principles electronic structure and variational nuclearmotion calculations to address this problem a new highaccuracy ai dipole moment surface dms is computed several spectroscopicallydetermined potential energy surfaces pess are constructed by fitting to empirical energy levels in the region below 7000 cm starting from an ai pes nuclear motion calculations using these new surfaces allow the unambiguous determination of the intensities of 10 muu band transitions and the computation of the intensities of 10 muu and 5 muu bands within their experimental error a decrease in intensities within the 3 muu is predicted which appears consistent with atmospheric retrievals the pes and dms form a suitable starting point both for the computation of comprehensive ozone line lists and for future calculations of electronic transition intensities | [['monitoring', 'ozone', 'concentrations', 'in', 'the', 'earths', 'atmosphere', 'using', 'spectroscopic', 'methods', 'is', 'a', 'major', 'activity', 'which', 'undertaken', 'both', 'from', 'the', 'ground', 'and', 'from', 'space', 'however', 'there', 'are', 'longrunning', 'issues', 'of', 'consistency', 'between', 'measurements', 'made', 'at', 'infrared', 'ir', 'and', 'ultraviolet', 'uv', 'wavelengths', 'in', 'addition', 'key', 'o_3', 'ir', 'bands', 'at', '10', 'muu', '5', 'muu', 'and', '3', 'muu', 'also', 'yield', 'results', 'which', 'differ', 'by', 'a', 'few', 'percent', 'when', 'used', 'for', 'retrievals', 'these', 'problems', 'stem', 'from', 'the', 'underlying', 'laboratory', 'measurements', 'of', 'the', 'line', 'intensities', 'here', 'we', 'use', 'quantum', 'chemical', 'techniques', 'first', 'principles', 'electronic', 'structure', 'and', 'variational', 'nuclearmotion', 'calculations', 'to', 'address', 'this', 'problem', 'a', 'new', 'highaccuracy', 'ai', 'dipole', 'moment', 'surface', 'dms', 'is', 'computed', 'several', 'spectroscopicallydetermined', 'potential', 'energy', 'surfaces', 'pess', 'are', 'constructed', 'by', 'fitting', 'to', 'empirical', 'energy', 'levels', 'in', 'the', 'region', 'below', '7000', 'cm', 'starting', 'from', 'an', 'ai', 'pes', 'nuclear', 'motion', 'calculations', 'using', 'these', 'new', 'surfaces', 'allow', 'the', 'unambiguous', 'determination', 'of', 'the', 'intensities', 'of', '10', 'muu', 'band', 'transitions', 'and', 'the', 'computation', 'of', 'the', 'intensities', 'of', '10', 'muu', 'and', '5', 'muu', 'bands', 'within', 'their', 'experimental', 'error', 'a', 'decrease', 'in', 'intensities', 'within', 'the', '3', 'muu', 'is', 'predicted', 'which', 'appears', 'consistent', 'with', 'atmospheric', 'retrievals', 'the', 'pes', 'and', 'dms', 'form', 'a', 'suitable', 'starting', 'point', 'both', 'for', 'the', 'computation', 'of', 'comprehensive', 'ozone', 'line', 'lists', 'and', 'for', 'future', 'calculations', 'of', 'electronic', 'transition', 'intensities']] | [-0.036254297329911166, 0.11872408116143474, -0.012014497945173865, 0.07964206881754632, 0.026018746809235643, -0.09971066278050698, 0.10372480508633003, 0.4244867515201414, -0.21343079845509713, -0.3731456116130132, 0.0773302140911775, -0.3160119175689206, -0.07511763809958384, 0.1908747085414472, 0.021190100423908526, 0.05493829692104122, 0.045610139949158544, -0.042202526077051605, -0.08941396050421255, -0.17169017683648105, 0.2683208046658408, 0.07495462777081965, 0.22607963517463456, 0.08335495409112247, 0.025944238750352747, -0.042028340701723385, -0.00918388428898262, -0.008404272449773825, -0.1444073158791677, 0.15080148680759262, 0.2905887083128272, 0.07621540540075374, 0.21956526434459236, -0.4315850653863024, -0.20609532542349326, 0.030662970545346894, 0.08379069239405605, 0.08884529636485414, -0.036460762568527746, -0.2517128955888828, 0.03665633883321702, -0.11866022410492102, -0.11864168788860774, -0.062287680790108255, 0.010570925366621287, 0.006378869427966752, -0.2561238088326285, 0.04031193291954142, -0.04720429410448387, 0.17078008828812882, -0.13209273482428951, -0.19283984326535747, -0.06551837792586801, 0.13686609708085945, 0.01057182300968894, 0.05125748422329447, 0.15615647426429427, -0.09203248004584262, -0.0859547589262504, 0.3961488285223909, -0.0848893596857254, -0.05375469672892775, 0.1806441656846021, -0.15471995328497584, -0.14984419067345914, 0.2253954094790277, 0.11679152770500098, 0.11118923069000067, -0.1405776953763312, 0.06258654795320971, 0.0398745117154682, 0.19618448362466767, 0.08279485196828665, 0.03643311492078716, 0.23004570892967638, 0.11020890797288822, 0.023846664226480893, 0.021624581371655776, -0.20667058190197818, -0.043354192277460936, -0.27018601748249715, -0.12637799460706967, -0.1505563045896235, 0.05112117194082765, -0.06669653016392009, -0.12149233297705428, 0.3788968102219293, 0.13761317214396382, 0.17332078035854334, 0.005888602587150498, 0.27769047272435965, 0.09791306999312448, 0.05305276171004932, 0.05074078023733039, 0.2708298455641073, 0.12415905050889012, 0.10592874392113161, -0.18767711723173436, 0.02869424918622133, 0.008690477851113038] |
1,802.09783 | Chemically non-perturbing SERS detection of catalytic reaction with
black silicon | All-dielectric resonant micro- and nano-structures made of the high-index
dielectrics recently emerge as a promising SERS platform which can complement
or potentially replace the metal-based counterparts in routine sensing
measurements. These unique structures combine the highly-tunable optical
response and high field enhancement with the non-invasiveness, i.e., chemically
non-perturbing the analyte, simple chemical modification and recyclability.
Meanwhile, the commercially competitive fabrication technologies for mass
production of such structures are still missing. Here, we attest a chemically
inert black silicon (b-Si) substrate consisting of randomly-arranged spiky Mie
resonators for a true non-invasive SERS identification of the molecular
fingerprints at low concentrations. Based on comparative in-situ SERS tracking
of the para-aminothiophenol -to-4,4` dimercaptoazobenzene catalytic conversion
on the bare and metal-coated b-Si, we justify applicability of the metal-free
b-Si for the ultra-sensitive non-invasive SERS detection at concentration level
as low as 10^-6 M. We perform finite-difference time-domain calculations to
reveal the electromagnetic enhancement provided by an isolated spiky Si
resonator in the visible spectral range. Additional comparative SERS studies of
the PATP-to-DMAB conversion performed with a chemically active bare black
copper oxide as well as SERS detection of the slow daylight-driven PATP-to-DAMP
catalytic conversion in the aqueous methanol solution loaded with colloidal
silver nanoparticles confirm the non-invasive SERS performance of the
all-dielectric crystalline b-Si substrate. Proposed SERS substrate can be
fabricated using simple scalable technology of plasma etching amenable on large
substrate areas making such inexpensive all-dielectric substrates promising for
routine SERS applications, where the non-invasiveness is of mandatory
importance.
| physics.optics physics.app-ph | alldielectric resonant micro and nanostructures made of the highindex dielectrics recently emerge as a promising sers platform which can complement or potentially replace the metalbased counterparts in routine sensing measurements these unique structures combine the highlytunable optical response and high field enhancement with the noninvasiveness ie chemically nonperturbing the analyte simple chemical modification and recyclability meanwhile the commercially competitive fabrication technologies for mass production of such structures are still missing here we attest a chemically inert black silicon bsi substrate consisting of randomlyarranged spiky mie resonators for a true noninvasive sers identification of the molecular fingerprints at low concentrations based on comparative insitu sers tracking of the paraaminothiophenol to44 dimercaptoazobenzene catalytic conversion on the bare and metalcoated bsi we justify applicability of the metalfree bsi for the ultrasensitive noninvasive sers detection at concentration level as low as 106 m we perform finitedifference timedomain calculations to reveal the electromagnetic enhancement provided by an isolated spiky si resonator in the visible spectral range additional comparative sers studies of the patptodmab conversion performed with a chemically active bare black copper oxide as well as sers detection of the slow daylightdriven patptodamp catalytic conversion in the aqueous methanol solution loaded with colloidal silver nanoparticles confirm the noninvasive sers performance of the alldielectric crystalline bsi substrate proposed sers substrate can be fabricated using simple scalable technology of plasma etching amenable on large substrate areas making such inexpensive alldielectric substrates promising for routine sers applications where the noninvasiveness is of mandatory importance | [['alldielectric', 'resonant', 'micro', 'and', 'nanostructures', 'made', 'of', 'the', 'highindex', 'dielectrics', 'recently', 'emerge', 'as', 'a', 'promising', 'sers', 'platform', 'which', 'can', 'complement', 'or', 'potentially', 'replace', 'the', 'metalbased', 'counterparts', 'in', 'routine', 'sensing', 'measurements', 'these', 'unique', 'structures', 'combine', 'the', 'highlytunable', 'optical', 'response', 'and', 'high', 'field', 'enhancement', 'with', 'the', 'noninvasiveness', 'ie', 'chemically', 'nonperturbing', 'the', 'analyte', 'simple', 'chemical', 'modification', 'and', 'recyclability', 'meanwhile', 'the', 'commercially', 'competitive', 'fabrication', 'technologies', 'for', 'mass', 'production', 'of', 'such', 'structures', 'are', 'still', 'missing', 'here', 'we', 'attest', 'a', 'chemically', 'inert', 'black', 'silicon', 'bsi', 'substrate', 'consisting', 'of', 'randomlyarranged', 'spiky', 'mie', 'resonators', 'for', 'a', 'true', 'noninvasive', 'sers', 'identification', 'of', 'the', 'molecular', 'fingerprints', 'at', 'low', 'concentrations', 'based', 'on', 'comparative', 'insitu', 'sers', 'tracking', 'of', 'the', 'paraaminothiophenol', 'to44', 'dimercaptoazobenzene', 'catalytic', 'conversion', 'on', 'the', 'bare', 'and', 'metalcoated', 'bsi', 'we', 'justify', 'applicability', 'of', 'the', 'metalfree', 'bsi', 'for', 'the', 'ultrasensitive', 'noninvasive', 'sers', 'detection', 'at', 'concentration', 'level', 'as', 'low', 'as', '106', 'm', 'we', 'perform', 'finitedifference', 'timedomain', 'calculations', 'to', 'reveal', 'the', 'electromagnetic', 'enhancement', 'provided', 'by', 'an', 'isolated', 'spiky', 'si', 'resonator', 'in', 'the', 'visible', 'spectral', 'range', 'additional', 'comparative', 'sers', 'studies', 'of', 'the', 'patptodmab', 'conversion', 'performed', 'with', 'a', 'chemically', 'active', 'bare', 'black', 'copper', 'oxide', 'as', 'well', 'as', 'sers', 'detection', 'of', 'the', 'slow', 'daylightdriven', 'patptodamp', 'catalytic', 'conversion', 'in', 'the', 'aqueous', 'methanol', 'solution', 'loaded', 'with', 'colloidal', 'silver', 'nanoparticles', 'confirm', 'the', 'noninvasive', 'sers', 'performance', 'of', 'the', 'alldielectric', 'crystalline', 'bsi', 'substrate', 'proposed', 'sers', 'substrate', 'can', 'be', 'fabricated', 'using', 'simple', 'scalable', 'technology', 'of', 'plasma', 'etching', 'amenable', 'on', 'large', 'substrate', 'areas', 'making', 'such', 'inexpensive', 'alldielectric', 'substrates', 'promising', 'for', 'routine', 'sers', 'applications', 'where', 'the', 'noninvasiveness', 'is', 'of', 'mandatory', 'importance']] | [-0.07498128134289671, 0.10422892226876787, -0.003222622951516048, -0.051678196378987455, -0.04055123121933583, -0.19604061040286924, 0.055093372361948834, 0.4764107389172937, -0.18495804624667073, -0.31433407406646086, 0.037586792694866485, -0.288857287651188, -0.1754932260512429, 0.24213948339968142, -0.021580908051984204, 0.07941735923586406, 0.029536606382021376, -0.10127106727545138, 0.007156554993366721, -0.141345873917934, 0.1665936725157621, 0.10678591004038955, 0.3589692185593917, 0.11104693834837448, 0.07109338529291076, -0.012274163664088712, 0.06325766627962222, -0.04441298532814068, -0.09560974844395052, 0.13736122164794412, 0.30525143815070066, -0.02666481151211438, 0.2042798709389062, -0.4962106620830534, -0.23774034529583427, -0.005719968220063146, 0.1675622082173154, 0.10684749786790741, -0.20523687709019633, -0.26976099604873227, 0.07303218430280296, -0.11474714182009414, -0.11253019879868247, -0.09755518995556653, -0.04805456675252016, 0.003605998210827177, -0.2269082018466487, 0.03160309998384798, -0.014684978381060376, 0.09664934619290781, -0.08155659243861939, -0.1170492965877095, -0.017893366990065412, 0.0643568117995688, -0.03273082834426859, -0.05561472606495954, 0.32682809887344805, -0.10831065569560056, -0.08535374518265659, 0.37349263806466915, -0.09562838193181139, -0.11782761155866343, 0.254788665387343, -0.12021693627001273, -0.06595302945164629, 0.20835838332152673, 0.1576548062993611, 0.1704912649893307, -0.1684561147019423, 0.028499821334673974, 0.04601554053925196, 0.22228344277455375, 0.1516702724761957, 0.1133735956951477, 0.26256842605933295, 0.29112007423346886, -0.018020556312225853, 0.1166064891546271, -0.12469410415734924, 0.07909704822361095, -0.18891877460948125, -0.22805528665325803, -0.20127168264060777, 0.09738046265593009, -0.10727830987956295, -0.23447778261808297, 0.31659790443618896, 0.07564542576023786, 0.09915061795180001, -0.06169834671148477, 0.33176570440248965, 0.012014605764447708, 0.09966774840467067, -0.07515255514596623, 0.3202096640685706, 0.1847457759200194, 0.11204568403186062, -0.2517463674395692, 0.0739180176912429, -0.04937005714938594] |
1,802.09784 | Stability of neutrino parameters and self-complementarity relation with
varying SUSY breaking scale | The scale at which supersymmetry (SUSY) breaks ($m_{s}$) is still unknown.
The present article, following a top-down approach, endeavors to study the
effect of varying $m_s$ on the radiative stability of the observational
parameters associated with the neutrino mixing. These parameters get additional
contributions in the minimal supersymmetric model,(MSSM). A variation in $m_s$
will influence the bounds for which the Standard Model,(SM) and MSSM work and
hence will account for the different radiative contributions received from both
sectors respectively, while running the renormalization group equations,(RGE).
The present work establishes the invariance of the self complementarity
relation among the three mixing angles,
$\theta_{13}+\theta_{12}\approx\theta_{23}$ against the radiative evolution. A
similar result concerning the mass ratio, $m_2: m_1$ is also found to be valid.
In addition to varying $m_s$, the work incorporates a range of different
seesaw\,(SS) scales and tries to see how the latter affects the parameters.
| hep-ph | the scale at which supersymmetry susy breaks m_s is still unknown the present article following a topdown approach endeavors to study the effect of varying m_s on the radiative stability of the observational parameters associated with the neutrino mixing these parameters get additional contributions in the minimal supersymmetric modelmssm a variation in m_s will influence the bounds for which the standard modelsm and mssm work and hence will account for the different radiative contributions received from both sectors respectively while running the renormalization group equationsrge the present work establishes the invariance of the self complementarity relation among the three mixing angles theta_13theta_12approxtheta_23 against the radiative evolution a similar result concerning the mass ratio m_2 m_1 is also found to be valid in addition to varying m_s the work incorporates a range of different seesawss scales and tries to see how the latter affects the parameters | [['the', 'scale', 'at', 'which', 'supersymmetry', 'susy', 'breaks', 'm_s', 'is', 'still', 'unknown', 'the', 'present', 'article', 'following', 'a', 'topdown', 'approach', 'endeavors', 'to', 'study', 'the', 'effect', 'of', 'varying', 'm_s', 'on', 'the', 'radiative', 'stability', 'of', 'the', 'observational', 'parameters', 'associated', 'with', 'the', 'neutrino', 'mixing', 'these', 'parameters', 'get', 'additional', 'contributions', 'in', 'the', 'minimal', 'supersymmetric', 'modelmssm', 'a', 'variation', 'in', 'm_s', 'will', 'influence', 'the', 'bounds', 'for', 'which', 'the', 'standard', 'modelsm', 'and', 'mssm', 'work', 'and', 'hence', 'will', 'account', 'for', 'the', 'different', 'radiative', 'contributions', 'received', 'from', 'both', 'sectors', 'respectively', 'while', 'running', 'the', 'renormalization', 'group', 'equationsrge', 'the', 'present', 'work', 'establishes', 'the', 'invariance', 'of', 'the', 'self', 'complementarity', 'relation', 'among', 'the', 'three', 'mixing', 'angles', 'theta_13theta_12approxtheta_23', 'against', 'the', 'radiative', 'evolution', 'a', 'similar', 'result', 'concerning', 'the', 'mass', 'ratio', 'm_2', 'm_1', 'is', 'also', 'found', 'to', 'be', 'valid', 'in', 'addition', 'to', 'varying', 'm_s', 'the', 'work', 'incorporates', 'a', 'range', 'of', 'different', 'seesawss', 'scales', 'and', 'tries', 'to', 'see', 'how', 'the', 'latter', 'affects', 'the', 'parameters']] | [-0.11980799354061904, 0.20429391104196737, -0.03752835972962613, 0.1314904574078547, -0.08341049206849764, -0.11152433243770363, 0.05654112177796032, 0.3048247874642289, -0.23746680161705844, -0.36470060063604737, 0.08835018745502195, -0.2510688702582421, -0.07508151556207786, 0.1497139025145066, -0.012852634860753593, 0.022649437713790948, 0.01909898378571469, -0.014661548088606395, -0.11440410664383795, -0.19942460965338937, 0.32689230402433117, 0.06676355602455811, 0.2338549370494586, 0.09675118039873704, 0.05993410636192109, -0.03728188699911493, -0.060928576960372675, -0.0388424990265827, -0.16598260519094765, 0.09087412496807355, 0.16578327968034526, 0.08089299389475983, 0.1740947066097927, -0.3580591785655895, -0.18842352163964804, 0.11381109912787944, 0.14177051160983006, 0.08892106071022719, -0.025677447088397254, -0.23719416619737593, 0.05647414762028296, -0.1629333570566763, -0.11722805283465226, -0.028374513617756083, -0.009999940129206844, -0.08259373519308931, -0.3072576181484308, 0.0802808737324495, 0.022921437063110128, -0.006738391934408688, -0.010281031393826428, -0.1523752823212958, -0.06174073585400909, 0.1326806304359835, 0.17491010783410724, -0.012092976261940325, 0.13220125841776983, -0.13019056654204025, -0.07607527048996007, 0.42643125203083937, -0.07218546080107892, -0.19266216260131816, 0.15516837455437216, -0.13704873533578407, -0.17139499032833863, 0.07996645238919473, 0.1630297851483141, 0.09248520253909896, -0.14329219310426375, 0.15552200563128998, -0.026084773124418627, 0.18024273346912797, 0.04761715110679957, 0.042385960840554515, 0.21599709321613567, 0.1651142736286922, 0.04349260842821128, 0.07656526366088041, -0.060912455804728, -0.10186865514236122, -0.3592675189343347, -0.09469730491605653, -0.09147129951513858, 0.036344600631527495, -0.10258568021680743, -0.07452738873945863, 0.4220691365452195, 0.19355903145476755, 0.23372656590318386, 0.09797041047148039, 0.3038244800179751, 0.07008079217064758, 0.06750822700822437, 0.034376488008182236, 0.2985418372964618, 0.1304624093947342, 0.10510130013949172, -0.287515678441375, 0.03279127506211295, 0.042315590579036465] |
1,802.09785 | An implementation of Milstein's method for general bounded diffusions | Despite its generality and powerful convergence properties, Milstein's method
for functionals of spatially bounded stochastic differential equations is
widely regarded as difficult to implement. This has likely prevented it from
being utilised in applications. In this paper, we design and analyse in detail
one such implementation. The presented method turns out to be on par with
other, popular schemes in terms of computational cost---but with a (nearly)
linear weak convergence rate under the usual smoothness requirements on
coefficients and boundary. Two byproducts of theoretical interest are a new,
non-standard rank-one update formula, and a connection between numerics of
bounded diffusions and Eikonal equations. Three examples are worked out,
confirming the accuracy and robustness of the method.
| math.NA | despite its generality and powerful convergence properties milsteins method for functionals of spatially bounded stochastic differential equations is widely regarded as difficult to implement this has likely prevented it from being utilised in applications in this paper we design and analyse in detail one such implementation the presented method turns out to be on par with other popular schemes in terms of computational costbut with a nearly linear weak convergence rate under the usual smoothness requirements on coefficients and boundary two byproducts of theoretical interest are a new nonstandard rankone update formula and a connection between numerics of bounded diffusions and eikonal equations three examples are worked out confirming the accuracy and robustness of the method | [['despite', 'its', 'generality', 'and', 'powerful', 'convergence', 'properties', 'milsteins', 'method', 'for', 'functionals', 'of', 'spatially', 'bounded', 'stochastic', 'differential', 'equations', 'is', 'widely', 'regarded', 'as', 'difficult', 'to', 'implement', 'this', 'has', 'likely', 'prevented', 'it', 'from', 'being', 'utilised', 'in', 'applications', 'in', 'this', 'paper', 'we', 'design', 'and', 'analyse', 'in', 'detail', 'one', 'such', 'implementation', 'the', 'presented', 'method', 'turns', 'out', 'to', 'be', 'on', 'par', 'with', 'other', 'popular', 'schemes', 'in', 'terms', 'of', 'computational', 'costbut', 'with', 'a', 'nearly', 'linear', 'weak', 'convergence', 'rate', 'under', 'the', 'usual', 'smoothness', 'requirements', 'on', 'coefficients', 'and', 'boundary', 'two', 'byproducts', 'of', 'theoretical', 'interest', 'are', 'a', 'new', 'nonstandard', 'rankone', 'update', 'formula', 'and', 'a', 'connection', 'between', 'numerics', 'of', 'bounded', 'diffusions', 'and', 'eikonal', 'equations', 'three', 'examples', 'are', 'worked', 'out', 'confirming', 'the', 'accuracy', 'and', 'robustness', 'of', 'the', 'method']] | [-0.07965020577058844, 0.0004147177967040435, -0.06860459840896985, 0.07260787684126231, -0.08288085499535436, -0.1556038309050643, 0.021669202426488957, 0.3684734002403591, -0.2708502994931262, -0.25461265453258936, 0.14155649281228366, -0.2393541115295628, -0.1709866643761811, 0.2489413598957269, -0.08706477687329701, 0.11020069095943852, 0.0560504966719157, 0.019702304527163504, -0.09103310109804506, -0.2907072965055704, 0.2813171877849685, 0.049749511674694394, 0.27349958498354837, 0.05385630042646485, 0.13202823305745487, -0.04397227091552771, -0.06221913264953005, 0.030657406369953052, -0.1156761414826969, 0.1035982195166466, 0.2625564098358154, 0.10270390282992435, 0.3028293010657248, -0.4077132462969293, -0.1747806181827479, 0.09118087728021909, 0.14114486658110525, 0.08001431808806955, -0.059051707097450674, -0.27130640984877297, 0.09011941526247108, -0.16293516732428384, -0.1616832951893625, -0.15299552206921838, -0.02741712196122693, 0.04631263430675735, -0.2581989533065454, 0.08637795425222619, 0.06062525378783112, 0.04876420997569095, -0.018170438236152026, -0.12931881531587114, 0.001773204413526084, 0.066121406144584, 0.07914978003574778, -0.021069007176581934, 0.06702371033961359, -0.08940994042255308, -0.10937862948555013, 0.3900331318135495, -0.07109024102556641, -0.2834948392989843, 0.24130221762815895, -0.08386756817445806, -0.16071921840674527, 0.11302688497968989, 0.16322031364492748, 0.16253638039140597, -0.16866734733238167, 0.11803182004444787, 0.013471629892718856, 0.1151401179852774, 0.06572548691790712, 0.046313861271609434, 0.12816271859666575, 0.15319271701509538, 0.09237120810329266, 0.1372149052660224, -0.016876681709824048, -0.1541371665571047, -0.30619027164319285, -0.1232030579005368, -0.14208855893989297, 0.030575886805055907, -0.10003628984584635, -0.15473752372047822, 0.3574563950968339, 0.1482718505613182, 0.15362263183392907, 0.05794242427724859, 0.30160097452285495, 0.12769533760906399, 0.021052394726354142, 0.05386821465242816, 0.2372822785102155, 0.19398243083092181, 0.10473068470575685, -0.17736295790249562, 0.0838085084343734, 0.09021990208673979] |
1,802.09786 | Preferential attachment mechanism of complex network growth:
"rich-gets-richer" or "fit-gets-richer"? | We analyze the growth models for complex networks including preferential
attachment (A.-L. Barabasi and R. Albert, Science 286, 509 (1999)) and fitness
model (Caldarelli et al., Phys. Rev. Lett. 89, 258702 (2002)) and demonstrate
that, under very general conditions, these two models yield the same dynamic
equation of network growth, $\frac{dK}{dt}=A(t)(K+K_{0})$, where $A(t)$ is the
aging constant, $K$ is the node's degree, and $K_{0}$ is the initial
attractivity. Basing on this result, we show that the fitness model provides an
underlying microscopic basis for the preferential attachment mechanism. This
approach yields long-sought explanation for the initial attractivity, an
elusive parameter which was left unexplained within the framework of the
preferential attachment model. We show that $K_{0}$ is mainly determined by the
width of the fitness distribution. The measurements of $K_{0}$ in many complex
networks usually yield the same $K_{0}\sim 1$. This empirical universality can
be traced to frequently occurring lognormal fitness distribution with the width
$\sigma\approx 1$.
| physics.soc-ph cond-mat.stat-mech cs.SI | we analyze the growth models for complex networks including preferential attachment al barabasi and r albert science 286 509 1999 and fitness model caldarelli et al phys rev lett 89 258702 2002 and demonstrate that under very general conditions these two models yield the same dynamic equation of network growth fracdkdtatkk_0 where at is the aging constant k is the nodes degree and k_0 is the initial attractivity basing on this result we show that the fitness model provides an underlying microscopic basis for the preferential attachment mechanism this approach yields longsought explanation for the initial attractivity an elusive parameter which was left unexplained within the framework of the preferential attachment model we show that k_0 is mainly determined by the width of the fitness distribution the measurements of k_0 in many complex networks usually yield the same k_0sim 1 this empirical universality can be traced to frequently occurring lognormal fitness distribution with the width sigmaapprox 1 | [['we', 'analyze', 'the', 'growth', 'models', 'for', 'complex', 'networks', 'including', 'preferential', 'attachment', 'al', 'barabasi', 'and', 'r', 'albert', 'science', '286', '509', '1999', 'and', 'fitness', 'model', 'caldarelli', 'et', 'al', 'phys', 'rev', 'lett', '89', '258702', '2002', 'and', 'demonstrate', 'that', 'under', 'very', 'general', 'conditions', 'these', 'two', 'models', 'yield', 'the', 'same', 'dynamic', 'equation', 'of', 'network', 'growth', 'fracdkdtatkk_0', 'where', 'at', 'is', 'the', 'aging', 'constant', 'k', 'is', 'the', 'nodes', 'degree', 'and', 'k_0', 'is', 'the', 'initial', 'attractivity', 'basing', 'on', 'this', 'result', 'we', 'show', 'that', 'the', 'fitness', 'model', 'provides', 'an', 'underlying', 'microscopic', 'basis', 'for', 'the', 'preferential', 'attachment', 'mechanism', 'this', 'approach', 'yields', 'longsought', 'explanation', 'for', 'the', 'initial', 'attractivity', 'an', 'elusive', 'parameter', 'which', 'was', 'left', 'unexplained', 'within', 'the', 'framework', 'of', 'the', 'preferential', 'attachment', 'model', 'we', 'show', 'that', 'k_0', 'is', 'mainly', 'determined', 'by', 'the', 'width', 'of', 'the', 'fitness', 'distribution', 'the', 'measurements', 'of', 'k_0', 'in', 'many', 'complex', 'networks', 'usually', 'yield', 'the', 'same', 'k_0sim', '1', 'this', 'empirical', 'universality', 'can', 'be', 'traced', 'to', 'frequently', 'occurring', 'lognormal', 'fitness', 'distribution', 'with', 'the', 'width', 'sigmaapprox', '1']] | [-0.08480281647984181, 0.1014128331982836, -0.08239108661882119, 0.03423088694266467, -0.05391879106400075, -0.13857598786617253, 0.026139537658687536, 0.36723196612332354, -0.25849759717949655, -0.3315367770272416, -0.015385428223571461, -0.2324579908548818, -0.19505068560602604, 0.12917780343521773, -0.06472207329314589, 0.014534482091374985, 0.007329447073226964, -0.01100374678113534, 0.0482061969077777, -0.27060902106058604, 0.252034047636651, 0.11518990496391213, 0.31527136809301454, 0.06318023576599231, 0.07738655718654248, 0.008374510456916767, 0.001286589168616897, 0.006478954142098641, -0.20801511727338287, 0.07188795367255807, 0.16667241546199332, 0.15194292602963844, 0.2815913843813461, -0.36453595114629955, -0.2508284218674344, 0.12089289887203508, 0.08781259882493646, 0.11733717132018057, 0.004832421389390267, -0.26965049536620544, 0.07690330988019947, -0.1682728767349096, -0.12974754019410578, -0.02864902133315608, 0.09485961780762421, 0.0372332422487595, -0.30080187938164, 0.1547987744901571, 0.09036242548533559, 0.06758640981702642, -0.057528341024231114, -0.13791974987940525, -0.04917706777160237, 0.04899270326963493, 0.0009375477834096687, 0.03239318142212661, 0.11677421214869367, -0.09524298147389108, -0.12898514474222025, 0.3533036366661454, -0.026244672925465486, -0.13052972060285792, 0.20401019634763626, -0.13442070168358358, -0.14356962851756674, 0.099319954922834, 0.15197380656276696, 0.10520689568313008, -0.147692389315952, 0.09844444413796406, -0.09056889240980728, 0.15190125272500438, 0.06692258970261636, -0.03765391000030961, 0.13760186261316013, 0.15793031892835996, 0.016595013684203075, 0.05216875360816016, -0.06718144925498681, -0.14328755637972507, -0.27751436446454714, -0.11295476331460205, -0.18815184443850408, 0.09499297846054247, -0.09769281910924398, -0.13467870917558283, 0.40860313276288573, 0.1323336051631864, 0.28136614476657146, 0.06764418482493198, 0.20121325373758453, 0.09995922277448699, 0.002480755337852646, 0.1078409486837298, 0.22858745702421412, 0.13338856138561114, 0.07630761538317742, -0.19070841931109014, 0.15700304604062884, 0.03434862967356798] |
1,802.09787 | Relational Reasoning for Markov Chains in a Probabilistic Guarded Lambda
Calculus | We extend the simply-typed guarded $\lambda$-calculus with discrete
probabilities and endow it with a program logic for reasoning about relational
properties of guarded probabilistic computations. This provides a framework for
programming and reasoning about infinite stochastic processes like Markov
chains. We demonstrate the logic sound by interpreting its judgements in the
topos of trees and by using probabilistic couplings for the semantics of
relational assertions over distributions on discrete types.
The program logic is designed to support syntax-directed proofs in the style
of relational refinement types, but retains the expressiveness of higher-order
logic extended with discrete distributions, and the ability to reason
relationally about expressions that have different types or syntactic
structure. In addition, our proof system leverages a well-known theorem from
the coupling literature to justify better proof rules for relational reasoning
about probabilistic expressions. We illustrate these benefits with a broad
range of examples that were beyond the scope of previous systems, including
shift couplings and lump couplings between random walks.
| cs.PL | we extend the simplytyped guarded lambdacalculus with discrete probabilities and endow it with a program logic for reasoning about relational properties of guarded probabilistic computations this provides a framework for programming and reasoning about infinite stochastic processes like markov chains we demonstrate the logic sound by interpreting its judgements in the topos of trees and by using probabilistic couplings for the semantics of relational assertions over distributions on discrete types the program logic is designed to support syntaxdirected proofs in the style of relational refinement types but retains the expressiveness of higherorder logic extended with discrete distributions and the ability to reason relationally about expressions that have different types or syntactic structure in addition our proof system leverages a wellknown theorem from the coupling literature to justify better proof rules for relational reasoning about probabilistic expressions we illustrate these benefits with a broad range of examples that were beyond the scope of previous systems including shift couplings and lump couplings between random walks | [['we', 'extend', 'the', 'simplytyped', 'guarded', 'lambdacalculus', 'with', 'discrete', 'probabilities', 'and', 'endow', 'it', 'with', 'a', 'program', 'logic', 'for', 'reasoning', 'about', 'relational', 'properties', 'of', 'guarded', 'probabilistic', 'computations', 'this', 'provides', 'a', 'framework', 'for', 'programming', 'and', 'reasoning', 'about', 'infinite', 'stochastic', 'processes', 'like', 'markov', 'chains', 'we', 'demonstrate', 'the', 'logic', 'sound', 'by', 'interpreting', 'its', 'judgements', 'in', 'the', 'topos', 'of', 'trees', 'and', 'by', 'using', 'probabilistic', 'couplings', 'for', 'the', 'semantics', 'of', 'relational', 'assertions', 'over', 'distributions', 'on', 'discrete', 'types', 'the', 'program', 'logic', 'is', 'designed', 'to', 'support', 'syntaxdirected', 'proofs', 'in', 'the', 'style', 'of', 'relational', 'refinement', 'types', 'but', 'retains', 'the', 'expressiveness', 'of', 'higherorder', 'logic', 'extended', 'with', 'discrete', 'distributions', 'and', 'the', 'ability', 'to', 'reason', 'relationally', 'about', 'expressions', 'that', 'have', 'different', 'types', 'or', 'syntactic', 'structure', 'in', 'addition', 'our', 'proof', 'system', 'leverages', 'a', 'wellknown', 'theorem', 'from', 'the', 'coupling', 'literature', 'to', 'justify', 'better', 'proof', 'rules', 'for', 'relational', 'reasoning', 'about', 'probabilistic', 'expressions', 'we', 'illustrate', 'these', 'benefits', 'with', 'a', 'broad', 'range', 'of', 'examples', 'that', 'were', 'beyond', 'the', 'scope', 'of', 'previous', 'systems', 'including', 'shift', 'couplings', 'and', 'lump', 'couplings', 'between', 'random', 'walks']] | [-0.06118032323093685, 0.029562207293108198, -0.08892619245874187, 0.13859779657610333, -0.1906333288143566, -0.15785103789216445, 0.09931836558357338, 0.38098055327688257, -0.30899945117013267, -0.3133515417747245, 0.05973994577992022, -0.24092184947060843, -0.09822507529623772, 0.17821821587108808, -0.09599324225510922, 0.061861307674124726, 0.03435971633034067, 0.04005274331579956, -0.05687894547455287, -0.19905244563549093, 0.31295241122533984, -0.016078744726426945, 0.23589965336716112, 0.034705754079530304, 0.11459314438158738, 0.086513093159894, -0.02164039232316741, 0.02723006684721613, -0.09727077385415309, 0.16725067679193215, 0.32519515285959777, 0.2402466099246468, 0.27964407512261047, -0.434373556367733, -0.1770075779762462, 0.039114976073243865, 0.07753744988221578, 0.12370134561831143, 0.05063116601796855, -0.35924723676400133, 0.07471156473402962, -0.20958247459550713, -0.044165531016223454, -0.1596655793876553, 0.023422205135043412, 0.05759116433535137, -0.2233321409250404, -0.03387464327520571, 0.21973321646554794, 0.13098089998599394, -0.036039607755788405, -0.10397655142476908, 0.004764547044457011, 0.05876267662391844, -0.014918761588234892, -0.06536059246964158, 0.10449467096877701, -0.07137528339406601, -0.2507885138545631, 0.33976641302482663, -0.029581613440146568, -0.20148180222333026, 0.20178688744060191, -0.07579410305258139, -0.20198684654261437, 0.08767123646359959, 0.12456828115245133, 0.10424989434330513, -0.14610531601656307, 0.13897794020537893, -0.025443531461402866, 0.21998679029978127, 0.10313625410884801, 0.08309917399899726, 0.21160023648326107, 0.19575197798159957, -0.009884261481529617, 0.15341445895917485, 0.05518851112617191, -0.19620845354579253, -0.31822240313849315, -0.14311899436406356, -0.06930567612414437, -0.03960268257151535, -0.1352347877169238, -0.18572934774647645, 0.3483484459760959, 0.21959631197280222, 0.12792908829980404, 0.21862314973009372, 0.2764292355495408, 0.09779779401970627, 0.09897969442025467, 0.03750791562866831, 0.10776663318339255, 0.18197431993396507, 0.13810842651573862, -0.12504656622157734, 0.12768596932406256, 0.0802103766283746] |
1,802.09788 | Time-sensitive Customer Churn Prediction based on PU Learning | With the fast development of Internet companies throughout the world,
customer churn has become a serious concern. To better help the companies
retain their customers, it is important to build a customer churn prediction
model to identify the customers who are most likely to churn ahead of time. In
this paper, we propose a Time-sensitive Customer Churn Prediction (TCCP)
framework based on Positive and Unlabeled (PU) learning technique.
Specifically, we obtain the recent data by shortening the observation period,
and start to train model as long as enough positive samples are collected,
ignoring the absence of the negative examples. We conduct thoroughly
experiments on real industry data from Alipay.com. The experimental results
demonstrate that TCCP outperforms the rule-based models and the traditional
supervised learning models.
| cs.LG | with the fast development of internet companies throughout the world customer churn has become a serious concern to better help the companies retain their customers it is important to build a customer churn prediction model to identify the customers who are most likely to churn ahead of time in this paper we propose a timesensitive customer churn prediction tccp framework based on positive and unlabeled pu learning technique specifically we obtain the recent data by shortening the observation period and start to train model as long as enough positive samples are collected ignoring the absence of the negative examples we conduct thoroughly experiments on real industry data from alipaycom the experimental results demonstrate that tccp outperforms the rulebased models and the traditional supervised learning models | [['with', 'the', 'fast', 'development', 'of', 'internet', 'companies', 'throughout', 'the', 'world', 'customer', 'churn', 'has', 'become', 'a', 'serious', 'concern', 'to', 'better', 'help', 'the', 'companies', 'retain', 'their', 'customers', 'it', 'is', 'important', 'to', 'build', 'a', 'customer', 'churn', 'prediction', 'model', 'to', 'identify', 'the', 'customers', 'who', 'are', 'most', 'likely', 'to', 'churn', 'ahead', 'of', 'time', 'in', 'this', 'paper', 'we', 'propose', 'a', 'timesensitive', 'customer', 'churn', 'prediction', 'tccp', 'framework', 'based', 'on', 'positive', 'and', 'unlabeled', 'pu', 'learning', 'technique', 'specifically', 'we', 'obtain', 'the', 'recent', 'data', 'by', 'shortening', 'the', 'observation', 'period', 'and', 'start', 'to', 'train', 'model', 'as', 'long', 'as', 'enough', 'positive', 'samples', 'are', 'collected', 'ignoring', 'the', 'absence', 'of', 'the', 'negative', 'examples', 'we', 'conduct', 'thoroughly', 'experiments', 'on', 'real', 'industry', 'data', 'from', 'alipaycom', 'the', 'experimental', 'results', 'demonstrate', 'that', 'tccp', 'outperforms', 'the', 'rulebased', 'models', 'and', 'the', 'traditional', 'supervised', 'learning', 'models']] | [-0.060329078580252826, 0.029384540345129228, -0.05136110340320175, 0.0944095371974512, -0.15382796184219902, -0.2027344823582098, 0.11599394401268763, 0.44039786336643083, -0.23804530680213393, -0.32107802858996776, 0.12358369722477941, -0.35375607240524504, -0.14134238707652735, 0.17197010742365232, -0.13439121172057406, 0.07687496381620276, 0.13574017438616964, 0.08679638934441872, 0.015580882308929558, -0.3436358841999824, 0.2832846793687842, 0.07192459784921319, 0.34963334357035497, 0.050592124554133346, 0.06357155432793192, -0.034712788593512206, -0.06421133966655508, -0.060429460572777316, -0.0704284016068883, 0.15380753763254748, 0.3525886541153722, 0.20830891831804277, 0.3880620380082438, -0.43873832153997594, -0.21057662613419514, 0.11873515513950898, 0.08816054240695291, 0.08179905099208437, -0.040812055176619684, -0.33305315686870485, 0.11268329034529385, -0.24546281878851475, -0.07438997479696427, -0.1308340933624535, 0.005195568563536771, -0.0005077402484828546, -0.28265844420680114, 0.003953043943188424, 0.028599431899736724, 0.035412244344761055, -0.05326031276396656, -0.06991125021370188, 0.0270456837287413, 0.20965018468878924, 0.15068658756002062, -0.011298096609196716, 0.1307354131075103, -0.13043246774618783, -0.16150667981879274, 0.37582511273813585, -0.05597453694339962, -0.10956095370103515, 0.19391926360924938, -0.05359067805787368, -0.1512844177496229, 0.05916725557049616, 0.28293081433812695, 0.08382960476522003, -0.16046663676388562, 0.0009025709892270125, -0.02799354570226804, 0.1657449441601432, 0.02277759772597722, -0.06206351496474517, 0.1896829752424251, 0.2788979451682779, 0.054352679997757676, 0.0741866260519131, -0.04426474186531719, -0.10597793000840372, -0.19869251092595439, -0.10789842330221643, -0.13949856437712668, 0.023664612683557695, -0.0688520506285591, -0.1481608490970346, 0.3840912883019736, 0.22625606737640355, 0.20004438104543595, 0.12561700865626335, 0.3443090884585775, 0.0359956385406305, 0.08697074781805221, 0.11731919826894638, 0.14586715268031245, -0.0296731878789292, 0.21141136675742606, -0.16599640037841915, 0.1706093777949366, -0.02261763466371884] |
1,802.09789 | Effective theory of monolayer TMDC double quantum dots | Monolayer Transition Metal Dichalcogenides (TMDCs) are promising candidates
for quantum technologies, such as quantum dots, because they are truly
two-dimensional semiconductors with a direct band gap. In this work, we analyse
theoretically the behaviour of a double quantum dot (DQD) system created in the
conduction band of these materials, with two electrons in the (1,1) charge
configuration. Motivated by recent experimental progress, we consider several
scenarios, including different spin-orbit splittings in the two dots and
including the case when the valley degeneracy is lifted due to an insulating
ferromagnetic substrate. Finally, we discuss in which cases it is possible to
reduce the low energy subspace to the lowest Kramers pairs. We find that in
this case the low energy model is formally identical to the Heisenberg exchange
Hamiltonian.
| cond-mat.mes-hall | monolayer transition metal dichalcogenides tmdcs are promising candidates for quantum technologies such as quantum dots because they are truly twodimensional semiconductors with a direct band gap in this work we analyse theoretically the behaviour of a double quantum dot dqd system created in the conduction band of these materials with two electrons in the 11 charge configuration motivated by recent experimental progress we consider several scenarios including different spinorbit splittings in the two dots and including the case when the valley degeneracy is lifted due to an insulating ferromagnetic substrate finally we discuss in which cases it is possible to reduce the low energy subspace to the lowest kramers pairs we find that in this case the low energy model is formally identical to the heisenberg exchange hamiltonian | [['monolayer', 'transition', 'metal', 'dichalcogenides', 'tmdcs', 'are', 'promising', 'candidates', 'for', 'quantum', 'technologies', 'such', 'as', 'quantum', 'dots', 'because', 'they', 'are', 'truly', 'twodimensional', 'semiconductors', 'with', 'a', 'direct', 'band', 'gap', 'in', 'this', 'work', 'we', 'analyse', 'theoretically', 'the', 'behaviour', 'of', 'a', 'double', 'quantum', 'dot', 'dqd', 'system', 'created', 'in', 'the', 'conduction', 'band', 'of', 'these', 'materials', 'with', 'two', 'electrons', 'in', 'the', '11', 'charge', 'configuration', 'motivated', 'by', 'recent', 'experimental', 'progress', 'we', 'consider', 'several', 'scenarios', 'including', 'different', 'spinorbit', 'splittings', 'in', 'the', 'two', 'dots', 'and', 'including', 'the', 'case', 'when', 'the', 'valley', 'degeneracy', 'is', 'lifted', 'due', 'to', 'an', 'insulating', 'ferromagnetic', 'substrate', 'finally', 'we', 'discuss', 'in', 'which', 'cases', 'it', 'is', 'possible', 'to', 'reduce', 'the', 'low', 'energy', 'subspace', 'to', 'the', 'lowest', 'kramers', 'pairs', 'we', 'find', 'that', 'in', 'this', 'case', 'the', 'low', 'energy', 'model', 'is', 'formally', 'identical', 'to', 'the', 'heisenberg', 'exchange', 'hamiltonian']] | [-0.15521126268504304, 0.172718791696866, 0.04105451744089805, 0.05927766338436413, 0.008926387174142292, -0.18763689370825887, 0.06753005781865795, 0.4207665978174191, -0.27568268696268206, -0.30552328572957776, 0.0018170270741393324, -0.32348307935899356, -0.15483115300594363, 0.19432097119715763, 0.006884925265694619, 0.026682163239456713, 0.027194892853003694, -0.0880696039475879, -0.09037222407323497, -0.2173022890719949, 0.30464196440880187, 0.0010863129909921554, 0.29604537269551656, 0.0892812865859014, 0.02470937433645304, -0.011023277734693693, 0.14689398162954603, -0.03184459059401945, -0.15937431700280058, 0.07479590004732017, 0.2830368477589218, -0.09311654326120333, 0.23281512314497377, -0.44546340226224856, -0.18266427864000434, 0.06630597154617135, 0.14190427293942776, 0.19883525110344635, -0.0879649849521229, -0.2745340900692099, 0.06175290755891183, -0.1966999491560273, -0.07871470811005565, -0.060585911272937665, -0.011257938283961266, -0.027101165207568556, -0.20814655310459784, 0.05453411764756311, 0.048346094277803786, 0.004027117051009554, -0.044149278115583, -0.10918334102007066, -0.04984156504906423, 0.09174928035940866, 0.052980337455664994, 0.0058436206163605675, 0.11646070916685858, -0.13299765996998758, -0.16202596014773007, 0.4036830504774116, -0.04021003882962759, -0.15345584725764638, 0.20123429429804673, -0.17127468317448802, -0.10205140936159296, 0.08787110877165105, 0.0945734845709012, 0.09985407107524225, -0.13216444320153187, 0.12970683338789968, -0.0042558379282127135, 0.11507455319951987, -0.005170135431399103, 0.12145971545032808, 0.26424823972047307, 0.15890705321180576, 0.06408513375117764, 0.1412560559947451, -0.10417682846357934, -0.11589753022826699, -0.21804855581285665, -0.21842787849527667, -0.25114449633838376, 0.09814213167555863, -0.029712471414882202, -0.1769248172058724, 0.41140229225857183, 0.12813487723542494, 0.18341313153359806, -0.07086837341103092, 0.26067548724313383, 0.14298225882066617, 0.04920085673802532, 0.020676865315181203, 0.28884936469876266, 0.1526689852198615, 0.06819644523056922, -0.23705938752027578, -0.018841018972125312, -0.013362464393139817] |
1,802.0979 | Quantifying Acoustophoretic Separation of Microparticle Populations by
Mean-and-Covariance Dynamics for Gaussians in Mixture Models | A method for the quantification of acoustophoretic separation and dispersion
for microparticle populations featuring continuously distributed physical
parameters is presented. The derivation of the method starts by (i)~considering
the equation of motion for a particle ensemble in the coordinate+parameter
space, (ii)~performing moment analysis on the transport equation for the
probability density function (PDF), and (iii)~expanding up to the first-order
the drift (and the diffusion coefficient) around the mean of the PDF. Following
these steps, a system of ordinary differential equations for the evolution of
the mean and the covariance in the coordinate+parameter space is derived. These
differential equations enable for the approximation of the acoustophoretic
separation dynamics of particle ensembles by using a gaussian mixture for which
the mean and the covariance of each gaussian evolve according to the
mean-and-covariance dynamics. The approximation property of this method is
shown by comparison with direct numerical simulations of particle ensembles in
the cases of prototypical models of acoustophoretic and free-flow
acoustophoretic separations for which the particle populations are distributed
according to the radius. Furthermore, the indicators for quantifying free-flow
acoustophoretic separation performance are introduced, and a method for the
inference of particle-histogram parameters is illustrated.
| physics.data-an | a method for the quantification of acoustophoretic separation and dispersion for microparticle populations featuring continuously distributed physical parameters is presented the derivation of the method starts by iconsidering the equation of motion for a particle ensemble in the coordinateparameter space iiperforming moment analysis on the transport equation for the probability density function pdf and iiiexpanding up to the firstorder the drift and the diffusion coefficient around the mean of the pdf following these steps a system of ordinary differential equations for the evolution of the mean and the covariance in the coordinateparameter space is derived these differential equations enable for the approximation of the acoustophoretic separation dynamics of particle ensembles by using a gaussian mixture for which the mean and the covariance of each gaussian evolve according to the meanandcovariance dynamics the approximation property of this method is shown by comparison with direct numerical simulations of particle ensembles in the cases of prototypical models of acoustophoretic and freeflow acoustophoretic separations for which the particle populations are distributed according to the radius furthermore the indicators for quantifying freeflow acoustophoretic separation performance are introduced and a method for the inference of particlehistogram parameters is illustrated | [['a', 'method', 'for', 'the', 'quantification', 'of', 'acoustophoretic', 'separation', 'and', 'dispersion', 'for', 'microparticle', 'populations', 'featuring', 'continuously', 'distributed', 'physical', 'parameters', 'is', 'presented', 'the', 'derivation', 'of', 'the', 'method', 'starts', 'by', 'iconsidering', 'the', 'equation', 'of', 'motion', 'for', 'a', 'particle', 'ensemble', 'in', 'the', 'coordinateparameter', 'space', 'iiperforming', 'moment', 'analysis', 'on', 'the', 'transport', 'equation', 'for', 'the', 'probability', 'density', 'function', 'pdf', 'and', 'iiiexpanding', 'up', 'to', 'the', 'firstorder', 'the', 'drift', 'and', 'the', 'diffusion', 'coefficient', 'around', 'the', 'mean', 'of', 'the', 'pdf', 'following', 'these', 'steps', 'a', 'system', 'of', 'ordinary', 'differential', 'equations', 'for', 'the', 'evolution', 'of', 'the', 'mean', 'and', 'the', 'covariance', 'in', 'the', 'coordinateparameter', 'space', 'is', 'derived', 'these', 'differential', 'equations', 'enable', 'for', 'the', 'approximation', 'of', 'the', 'acoustophoretic', 'separation', 'dynamics', 'of', 'particle', 'ensembles', 'by', 'using', 'a', 'gaussian', 'mixture', 'for', 'which', 'the', 'mean', 'and', 'the', 'covariance', 'of', 'each', 'gaussian', 'evolve', 'according', 'to', 'the', 'meanandcovariance', 'dynamics', 'the', 'approximation', 'property', 'of', 'this', 'method', 'is', 'shown', 'by', 'comparison', 'with', 'direct', 'numerical', 'simulations', 'of', 'particle', 'ensembles', 'in', 'the', 'cases', 'of', 'prototypical', 'models', 'of', 'acoustophoretic', 'and', 'freeflow', 'acoustophoretic', 'separations', 'for', 'which', 'the', 'particle', 'populations', 'are', 'distributed', 'according', 'to', 'the', 'radius', 'furthermore', 'the', 'indicators', 'for', 'quantifying', 'freeflow', 'acoustophoretic', 'separation', 'performance', 'are', 'introduced', 'and', 'a', 'method', 'for', 'the', 'inference', 'of', 'particlehistogram', 'parameters', 'is', 'illustrated']] | [-0.07950819015411284, 0.1070156896467063, -0.11250661247399972, 0.037273504769434515, 0.028403419889806908, -0.08023345508325369, 0.010011992291881742, 0.3229306101343258, -0.27020884773624626, -0.3104541033674824, 0.07531802792738668, -0.2647588987478075, -0.10680184645536157, 0.18693667272987596, 0.013837231773922735, 0.10369911827791006, 0.04882731598162865, 0.029670647775229226, -0.0786901840870764, -0.1849874760101034, 0.32395807216860395, 0.04960105701057399, 0.26608202381535095, -0.023980540849461638, 0.16008045274437346, 0.01796595998971594, -0.04599243700207072, 0.03521766612816754, -0.14029975177997606, 0.11581884788478071, 0.16392065998764124, 0.08336381353883747, 0.2644373753920515, -0.3582331676907996, -0.23307331412178564, 0.044191421921107366, 0.144017159250228, 0.09660790644046117, -0.032617583140815073, -0.2923042164778614, 0.047457739429057955, -0.14246139525772727, -0.1502164035460892, -0.05518197020060046, 0.03898482090060381, 0.10646882623017943, -0.3067393650231447, 0.14390062221029942, 0.050525918682204914, 0.03336223000363308, -0.06608135670552308, -0.12840378017627951, 0.010825116657949191, 0.11779119878663047, 0.011898796626445936, -0.023981219529114823, 0.13216369009596554, -0.12831897323113925, -0.0678250485432998, 0.38270811464617704, -0.07162839313349785, -0.2523122251732275, 0.16111356749551053, -0.13034066747121037, -0.08612784962516595, 0.14345209108061216, 0.1891926587745052, 0.12705279822817983, -0.17630784380363618, 0.051525008728779714, 0.005758143058591621, 0.1537991271829827, 0.028774910343890178, -0.02655129733574676, 0.18042134681092378, 0.18323003484352313, 0.0612448566696022, 0.10634887001249305, -0.12712480289182884, -0.17546235043010575, -0.30171053614368304, -0.18839088072638063, -0.18435246220968188, -0.007229796974260875, -0.1261772229942274, -0.18200657384930194, 0.39549416752948247, 0.13960521684233793, 0.17236868530125457, 0.08510288047886631, 0.27511815530461003, 0.15845916047196915, 0.010376479610444066, 0.04995792013830803, 0.21681778819022818, 0.18210162156994672, 0.09340454538184356, -0.2584851757986124, 0.0744239319056431, 0.0650593737707513] |
1,802.09791 | Bioinformatics and Medicine in the Era of Deep Learning | Many of the current scientific advances in the life sciences have their
origin in the intensive use of data for knowledge discovery. In no area this is
so clear as in bioinformatics, led by technological breakthroughs in data
acquisition technologies. It has been argued that bioinformatics could quickly
become the field of research generating the largest data repositories, beating
other data-intensive areas such as high-energy physics or astroinformatics.
Over the last decade, deep learning has become a disruptive advance in machine
learning, giving new live to the long-standing connectionist paradigm in
artificial intelligence. Deep learning methods are ideally suited to
large-scale data and, therefore, they should be ideally suited to knowledge
discovery in bioinformatics and biomedicine at large. In this brief paper, we
review key aspects of the application of deep learning in bioinformatics and
medicine, drawing from the themes covered by the contributions to an ESANN 2018
special session devoted to this topic.
| cs.LG q-bio.QM stat.ML | many of the current scientific advances in the life sciences have their origin in the intensive use of data for knowledge discovery in no area this is so clear as in bioinformatics led by technological breakthroughs in data acquisition technologies it has been argued that bioinformatics could quickly become the field of research generating the largest data repositories beating other dataintensive areas such as highenergy physics or astroinformatics over the last decade deep learning has become a disruptive advance in machine learning giving new live to the longstanding connectionist paradigm in artificial intelligence deep learning methods are ideally suited to largescale data and therefore they should be ideally suited to knowledge discovery in bioinformatics and biomedicine at large in this brief paper we review key aspects of the application of deep learning in bioinformatics and medicine drawing from the themes covered by the contributions to an esann 2018 special session devoted to this topic | [['many', 'of', 'the', 'current', 'scientific', 'advances', 'in', 'the', 'life', 'sciences', 'have', 'their', 'origin', 'in', 'the', 'intensive', 'use', 'of', 'data', 'for', 'knowledge', 'discovery', 'in', 'no', 'area', 'this', 'is', 'so', 'clear', 'as', 'in', 'bioinformatics', 'led', 'by', 'technological', 'breakthroughs', 'in', 'data', 'acquisition', 'technologies', 'it', 'has', 'been', 'argued', 'that', 'bioinformatics', 'could', 'quickly', 'become', 'the', 'field', 'of', 'research', 'generating', 'the', 'largest', 'data', 'repositories', 'beating', 'other', 'dataintensive', 'areas', 'such', 'as', 'highenergy', 'physics', 'or', 'astroinformatics', 'over', 'the', 'last', 'decade', 'deep', 'learning', 'has', 'become', 'a', 'disruptive', 'advance', 'in', 'machine', 'learning', 'giving', 'new', 'live', 'to', 'the', 'longstanding', 'connectionist', 'paradigm', 'in', 'artificial', 'intelligence', 'deep', 'learning', 'methods', 'are', 'ideally', 'suited', 'to', 'largescale', 'data', 'and', 'therefore', 'they', 'should', 'be', 'ideally', 'suited', 'to', 'knowledge', 'discovery', 'in', 'bioinformatics', 'and', 'biomedicine', 'at', 'large', 'in', 'this', 'brief', 'paper', 'we', 'review', 'key', 'aspects', 'of', 'the', 'application', 'of', 'deep', 'learning', 'in', 'bioinformatics', 'and', 'medicine', 'drawing', 'from', 'the', 'themes', 'covered', 'by', 'the', 'contributions', 'to', 'an', 'esann', '2018', 'special', 'session', 'devoted', 'to', 'this', 'topic']] | [-0.03704282659367701, 0.06710385471923669, -0.06157899022199749, 0.059998776165622415, -0.15758865867784017, -0.09856462339548017, -0.01482041786330466, 0.3740868241422706, -0.2970746367805701, -0.3668546615095407, 0.14119075026570094, -0.2819795189756334, -0.2003074881325482, 0.2598959397679816, -0.13285836683634936, 0.08083072706139753, 0.09753736850479922, 0.03467013973900988, 0.005924312418381519, -0.2841800614747103, 0.260064077213577, 0.08962728238601414, 0.3578193528528989, 0.07048992287927593, 0.025720808082838463, -0.0005620143185736797, -0.09143890132610169, -0.04731690657197261, -0.10789150494978089, 0.18888610020109448, 0.44749997485599485, 0.2656037584845025, 0.4146580762576823, -0.4623696305758618, -0.2531438462034452, 0.10895775297954922, 0.18336370613523365, 0.11389474535750505, -0.10447242549541437, -0.26531429864539235, 0.011312055326176478, -0.16355609733670695, -0.08211531977053561, -0.11314790939693065, 0.07386940710164387, -0.022077936824834207, -0.1592669059192226, -0.021738975212964064, 0.04527344169350816, 0.13199356547100285, -0.007466410024980314, -0.14588018434329164, 0.10208280623458277, 0.1803017607174838, 0.09977314352617885, 0.10039375771257077, 0.10688510437928189, -0.22650916620729844, -0.18033259079389857, 0.385258583778065, -0.02250519307829391, -0.07372018620310948, 0.21812251433227942, -0.07030048905232665, -0.25514849871275275, 0.07965893408335331, 0.25027629499037574, 0.07968289404479768, -0.19058070889692388, 0.09942248328992172, 0.03894064555346381, 0.10759103399841419, 0.040467552254828655, 0.014702038467006477, 0.2986269143784382, 0.27934552916003014, 0.017348472784909426, 0.060233933509105296, -0.07354752726098096, -0.10896328240450398, -0.18684085773066708, -0.14201491930159843, -0.2005168274318909, 0.02630574918151194, 0.017306136816806234, -0.15512781245694832, 0.35178336405554433, 0.20496162660785167, 0.13458084989205196, -0.06058929924810537, 0.31695848161634665, -0.02482835488740866, 0.15997909037305005, 0.06091777128441369, 0.24941368551096982, 0.06603401236759585, 0.2506027118526582, -0.08888109410151206, 0.08580884186161403, -0.05860729885038013] |
1,802.09792 | Constructing Representative Scenarios to Approximate Robust
Combinatorial Optimization Problems | In robust combinatorial optimization with discrete uncertainty, two general
approximation algorithms are frequently used, which are both based on
constructing a single scenario representing the whole uncertainty set. In the
midpoint method, one optimizes for the average case scenario. In the
element-wise worst-case approach, one constructs a scenario by taking the worst
case in each component over all scenarios. Both methods are known to be
$N$-approximations, where $N$ is the number of scenarios.
In this paper, these results are refined by reconsidering their respective
proofs as optimization problems. We present a linear program to construct a
representative scenario for the uncertainty set, which guarantees an
approximation guarantee that is at least as good as for the previous methods.
Incidentally, we show that the element-wise worst-case approach can have an
advantage over the midpoint approach if the number of scenarios is large. In
numerical experiments on the selection problem we demonstrate that our approach
can improve the approximation guarantee of the midpoint approach by around 20%.
| math.OC | in robust combinatorial optimization with discrete uncertainty two general approximation algorithms are frequently used which are both based on constructing a single scenario representing the whole uncertainty set in the midpoint method one optimizes for the average case scenario in the elementwise worstcase approach one constructs a scenario by taking the worst case in each component over all scenarios both methods are known to be napproximations where n is the number of scenarios in this paper these results are refined by reconsidering their respective proofs as optimization problems we present a linear program to construct a representative scenario for the uncertainty set which guarantees an approximation guarantee that is at least as good as for the previous methods incidentally we show that the elementwise worstcase approach can have an advantage over the midpoint approach if the number of scenarios is large in numerical experiments on the selection problem we demonstrate that our approach can improve the approximation guarantee of the midpoint approach by around 20 | [['in', 'robust', 'combinatorial', 'optimization', 'with', 'discrete', 'uncertainty', 'two', 'general', 'approximation', 'algorithms', 'are', 'frequently', 'used', 'which', 'are', 'both', 'based', 'on', 'constructing', 'a', 'single', 'scenario', 'representing', 'the', 'whole', 'uncertainty', 'set', 'in', 'the', 'midpoint', 'method', 'one', 'optimizes', 'for', 'the', 'average', 'case', 'scenario', 'in', 'the', 'elementwise', 'worstcase', 'approach', 'one', 'constructs', 'a', 'scenario', 'by', 'taking', 'the', 'worst', 'case', 'in', 'each', 'component', 'over', 'all', 'scenarios', 'both', 'methods', 'are', 'known', 'to', 'be', 'napproximations', 'where', 'n', 'is', 'the', 'number', 'of', 'scenarios', 'in', 'this', 'paper', 'these', 'results', 'are', 'refined', 'by', 'reconsidering', 'their', 'respective', 'proofs', 'as', 'optimization', 'problems', 'we', 'present', 'a', 'linear', 'program', 'to', 'construct', 'a', 'representative', 'scenario', 'for', 'the', 'uncertainty', 'set', 'which', 'guarantees', 'an', 'approximation', 'guarantee', 'that', 'is', 'at', 'least', 'as', 'good', 'as', 'for', 'the', 'previous', 'methods', 'incidentally', 'we', 'show', 'that', 'the', 'elementwise', 'worstcase', 'approach', 'can', 'have', 'an', 'advantage', 'over', 'the', 'midpoint', 'approach', 'if', 'the', 'number', 'of', 'scenarios', 'is', 'large', 'in', 'numerical', 'experiments', 'on', 'the', 'selection', 'problem', 'we', 'demonstrate', 'that', 'our', 'approach', 'can', 'improve', 'the', 'approximation', 'guarantee', 'of', 'the', 'midpoint', 'approach', 'by', 'around', '20']] | [-0.09298101169529907, 0.0008147899599421318, -0.08094819292397887, 0.06844260274771262, -0.04484572058374232, -0.12984576611356302, 0.06356461261413202, 0.3889410769792669, -0.25847439417671975, -0.3379192481099656, 0.13247838825354297, -0.24212324540271904, -0.15923953265671364, 0.22986296204793633, -0.08247011997031443, 0.06378656027443481, 0.07008241311026116, 0.042846347531303765, -0.06780908901000106, -0.3018268965071801, 0.2858324488681374, 0.020462947609749708, 0.2524847875828996, 0.021579860032282093, 0.07865073673398883, 0.006250481517759688, 0.006344996686234619, 0.04174445399548858, -0.06711559391674889, 0.10112177290685588, 0.2528967455572759, 0.16943375445676573, 0.3365737537825198, -0.39545504083913385, -0.21129333055860391, 0.11676636636327727, 0.14277634407873407, 0.11726449029661264, -0.009905033853525917, -0.23037781300248975, 0.11958831285380504, -0.15985047250693296, -0.07763772385307785, -0.08398323881468087, -0.053809385433454406, -6.71472739089619e-05, -0.31798877797343517, 0.03832613276176606, 0.0481606187016675, -0.000916772781673706, -0.05704021800422307, -0.13964185956936104, 0.042369498342106286, 0.09370451633620894, 0.0404030900914222, 0.012744570702709483, 0.0754492493515665, -0.06309742076802209, -0.15139220655740548, 0.40047439578356164, -0.04416497646068985, -0.24153172486094815, 0.14881234267641874, -0.08032078047593434, -0.15324240938591008, 0.11441398274407467, 0.1815042767052849, 0.17317593256858263, -0.13166505059961117, 0.07003311870450324, -0.08913908006454056, 0.134916257302305, 0.027378455028784547, 0.013254642372626359, 0.14627307295291261, 0.18303547112666296, 0.11651792129586366, 0.12455895035457092, -0.06867433269719847, -0.12797320137703508, -0.33047678877006875, -0.10856620740342998, -0.1705145087213058, -0.04543726123361425, -0.1320797215441637, -0.12423689724369483, 0.3712322047036706, 0.1587618521781582, 0.21500700281537843, 0.11405247913983961, 0.3644006086344069, 0.12620179108502766, 0.03515594534604161, 0.09773769917418108, 0.23377936036382435, 0.05289815489174516, 0.015781674927777864, -0.1798429102862649, 0.10365796482585596, 0.0987628741316836] |
1,802.09793 | Optimal subspace codes in ${\rm PG}(4,q)$ | We investigate subspace codes whose codewords are subspaces of ${\rm
PG}(4,q)$ having non-constant dimension. In particular, examples of optimal
mixed-dimension subspace codes are provided, showing that ${\cal A}_q(5,3) =
2(q^3+1)$.
| math.CO cs.IT math.IT | we investigate subspace codes whose codewords are subspaces of rm pg4q having nonconstant dimension in particular examples of optimal mixeddimension subspace codes are provided showing that cal a_q53 2q31 | [['we', 'investigate', 'subspace', 'codes', 'whose', 'codewords', 'are', 'subspaces', 'of', 'rm', 'pg4q', 'having', 'nonconstant', 'dimension', 'in', 'particular', 'examples', 'of', 'optimal', 'mixeddimension', 'subspace', 'codes', 'are', 'provided', 'showing', 'that', 'cal', 'a_q53', '2q31']] | [-0.23865172187625258, 0.10389094659196282, 0.06873951034827365, 0.0712454572526945, 0.043277192395180464, -0.24934031141714919, -0.06376485107035411, 0.4185942578370924, -0.31183066591620445, -0.12256010621786118, 0.17564784778126827, -0.31843807624170073, -0.1519481252051062, 0.17930404117537868, -0.13893046147293514, 0.10844101839595371, 0.08273957749069841, 0.049083010052089336, -0.16584184875332372, -0.3801379060993592, 0.4094027381528307, 0.07090809648097665, 0.16896631220286643, -0.09463398736315193, 0.15506650245300047, -0.09161900823797893, -0.029586397482220222, -0.007498418532863811, -0.23313791071268497, 0.11782818487672894, 0.34504139464762473, 0.23754987821707296, 0.15802457790683816, -0.2838593010135271, -0.2001848909314032, 0.2094775434859373, 0.20309598005756183, 0.1632215962227848, -0.012208671274560469, -0.17237063590437174, 0.18767292335353516, -0.14004815845853752, -0.050270690487835695, -0.10326269136189863, 0.03403914076517577, 0.006317405651013057, -0.33670465979311204, -0.03682010594477308, 0.08089311451961596, 0.13220943206990207, -0.04126344076185315, -0.18956171914383216, -0.04966295082811956, 0.01826424365087102, -0.006549268512538186, 0.0602566999969659, 0.0507106214278826, 0.021789737252725497, -0.1275415557126204, 0.3258600596304017, 0.03479114364556692, -0.2840874579355673, 0.1338646090934398, -0.1626003745391413, -0.09777679356435935, 0.12082655686471197, 0.21174706808394855, 0.08673225494998472, -0.0037343649676552524, 0.2427900461135087, -0.1600388347481688, 0.12313140363053039, 0.09653426399799409, 0.2063918099393723, 0.06232600933354762, 0.0014453753052900236, 0.08950420053399823, 0.14577285572886467, 0.029376108268344844, -0.019115299607316654, -0.32389295749642233, -0.0933365674034037, -0.19242248063286146, 0.04950643841315199, -0.16024548888068507, -0.16392747136867708, 0.37993466826500716, 0.0073249718967687205, 0.1904309734840084, 0.10891493220158198, 0.14257598616596726, 0.007696739294462734, 0.013280613278901135, 0.2666464396407483, 0.13255830826582732, 0.1684971850503374, -0.20116501018680907, -0.1733696803588558, -0.018924886326271075, 0.19389512369202244] |
1,802.09794 | Identification of LTV Dynamical Models with Smooth or Discontinuous Time
Evolution by means of Convex Optimization | We establish a connection between trend filtering and system identification
which results in a family of new identification methods for linear,
time-varying (LTV) dynamical models based on convex optimization. We
demonstrate how the design of the cost function promotes a model with either a
continuous change in dynamics over time, or causes discontinuous changes in
model coefficients occurring at a finite (sparse) set of time instances. We
further discuss the introduction of priors on the model parameters for
situations where excitation is insufficient for identification. The
identification problems are cast as convex optimization problems and are
applicable to, e.g., ARX models and state-space models with time-varying
parameters. We illustrate usage of the methods in simulations of jump-linear
systems, a nonlinear robot arm with non-smooth friction and stiff contacts as
well as in model-based, trajectory centric reinforcement learning on a smooth
nonlinear system.
| cs.SY stat.ML | we establish a connection between trend filtering and system identification which results in a family of new identification methods for linear timevarying ltv dynamical models based on convex optimization we demonstrate how the design of the cost function promotes a model with either a continuous change in dynamics over time or causes discontinuous changes in model coefficients occurring at a finite sparse set of time instances we further discuss the introduction of priors on the model parameters for situations where excitation is insufficient for identification the identification problems are cast as convex optimization problems and are applicable to eg arx models and statespace models with timevarying parameters we illustrate usage of the methods in simulations of jumplinear systems a nonlinear robot arm with nonsmooth friction and stiff contacts as well as in modelbased trajectory centric reinforcement learning on a smooth nonlinear system | [['we', 'establish', 'a', 'connection', 'between', 'trend', 'filtering', 'and', 'system', 'identification', 'which', 'results', 'in', 'a', 'family', 'of', 'new', 'identification', 'methods', 'for', 'linear', 'timevarying', 'ltv', 'dynamical', 'models', 'based', 'on', 'convex', 'optimization', 'we', 'demonstrate', 'how', 'the', 'design', 'of', 'the', 'cost', 'function', 'promotes', 'a', 'model', 'with', 'either', 'a', 'continuous', 'change', 'in', 'dynamics', 'over', 'time', 'or', 'causes', 'discontinuous', 'changes', 'in', 'model', 'coefficients', 'occurring', 'at', 'a', 'finite', 'sparse', 'set', 'of', 'time', 'instances', 'we', 'further', 'discuss', 'the', 'introduction', 'of', 'priors', 'on', 'the', 'model', 'parameters', 'for', 'situations', 'where', 'excitation', 'is', 'insufficient', 'for', 'identification', 'the', 'identification', 'problems', 'are', 'cast', 'as', 'convex', 'optimization', 'problems', 'and', 'are', 'applicable', 'to', 'eg', 'arx', 'models', 'and', 'statespace', 'models', 'with', 'timevarying', 'parameters', 'we', 'illustrate', 'usage', 'of', 'the', 'methods', 'in', 'simulations', 'of', 'jumplinear', 'systems', 'a', 'nonlinear', 'robot', 'arm', 'with', 'nonsmooth', 'friction', 'and', 'stiff', 'contacts', 'as', 'well', 'as', 'in', 'modelbased', 'trajectory', 'centric', 'reinforcement', 'learning', 'on', 'a', 'smooth', 'nonlinear', 'system']] | [-0.10170569286589891, 0.02340329433528995, -0.07286428974311747, 0.023866849304603175, -0.09847815912938349, -0.1905068807626917, 0.016881021964494924, 0.4055007636861902, -0.3189289970848132, -0.2996070241476868, 0.14140293934352985, -0.2336206991310743, -0.20650694298420205, 0.21102197477462845, -0.09408059138411158, 0.11172976822290621, 0.07185697797718654, 0.008247076828872234, -0.10631551972219826, -0.19101716461263493, 0.29314366244451917, 0.0020258121084238234, 0.22969356658671733, 0.000988754755358251, 0.14664216155947093, 0.031105445822517216, -0.005251526504650082, 0.033160099956456204, -0.08844886242057866, 0.08887130169909731, 0.289309593209599, 0.13078009234544571, 0.3385842085920904, -0.4077380910437082, -0.2702860297425322, 0.10933669290216771, 0.1106748116176213, 0.08709997050447757, -0.049917735680806596, -0.26480670632715797, 0.022844442140153597, -0.1614810084583054, -0.07638070520184094, -0.08632371459372709, -0.01079529455148051, 0.07614526494970204, -0.3397426715146908, 0.09481370425127236, 0.040595941484740175, 0.06236347546604213, -0.11465700978719019, -0.09198755690086843, 0.013650273323767411, 0.07815494964761711, 0.026871240232139826, -0.016704627483243674, 0.14686571089813197, -0.1511156440115678, -0.16484438540728788, 0.3803963863801598, -0.04816426502944062, -0.2628945497136799, 0.23395256264443495, -0.039378039460157006, -0.14369646760612123, 0.09441107443310845, 0.30168022735792044, 0.1482794563217141, -0.13735815817752564, 0.06812103631624192, -0.000269496649451239, 0.16984749506686775, -0.008579688063088122, -0.019062545034103096, 0.17245082388973046, 0.24807951819728796, 0.10699071195370084, 0.13660988404618865, -0.04213256348321267, -0.14548081289698095, -0.28994226896181097, -0.09045886643834307, -0.14558959245996575, -0.027569247314601506, -0.11235639798040108, -0.19162460003772908, 0.3967116043811113, 0.14535886474924398, 0.2158486599260023, 0.09786429994946189, 0.2946047192229561, 0.12055742861401753, 0.035938445640593425, 0.05917825096968929, 0.17647908679144064, 0.09539197121491053, 0.09281064390162216, -0.23172629459984076, 0.11667836048889538, 0.03837914123777038] |
1,802.09795 | Polar codes for empirical coordination over noisy channels with strictly
causal encoding | In this paper, we propose a coding scheme based on polar codes for empirical
coordination of autonomous devices. We consider a two-node network with a noisy
link in which the input and output signals have to be coordinated with the
source and the reconstruction. In the case of strictly causal encoding, we show
that polar codes achieve the empirical coordination region, provided that a
vanishing rate of common randomness is available.
| cs.IT math.IT | in this paper we propose a coding scheme based on polar codes for empirical coordination of autonomous devices we consider a twonode network with a noisy link in which the input and output signals have to be coordinated with the source and the reconstruction in the case of strictly causal encoding we show that polar codes achieve the empirical coordination region provided that a vanishing rate of common randomness is available | [['in', 'this', 'paper', 'we', 'propose', 'a', 'coding', 'scheme', 'based', 'on', 'polar', 'codes', 'for', 'empirical', 'coordination', 'of', 'autonomous', 'devices', 'we', 'consider', 'a', 'twonode', 'network', 'with', 'a', 'noisy', 'link', 'in', 'which', 'the', 'input', 'and', 'output', 'signals', 'have', 'to', 'be', 'coordinated', 'with', 'the', 'source', 'and', 'the', 'reconstruction', 'in', 'the', 'case', 'of', 'strictly', 'causal', 'encoding', 'we', 'show', 'that', 'polar', 'codes', 'achieve', 'the', 'empirical', 'coordination', 'region', 'provided', 'that', 'a', 'vanishing', 'rate', 'of', 'common', 'randomness', 'is', 'available']] | [-0.20738526412718733, 0.030975329440454363, -0.038745164904008866, 0.02960132492679945, -0.007158754019617615, -0.20027773934875576, 0.10596686845783039, 0.4234098563836494, -0.2841329167426472, -0.2402317632501289, 0.1199358115579382, -0.2263564897215807, -0.21115673677077595, 0.15868206191020953, -0.11765637979752541, 0.039813737739139876, 0.08131883318312991, 0.06855231413329152, -0.06364434815182442, -0.2610889234101321, 0.3223695676039222, 0.10458828674130877, 0.3135914332954816, 0.0018389751137772076, 0.11607299276142263, 0.0038656941483872875, -0.022284022886568392, 0.0075059094200645325, -0.10375239816268834, 0.18733401017748869, 0.2947539669317259, 0.16757534687656542, 0.24583292777427065, -0.4136468643506228, -0.2771496492844652, 0.08846292474215299, 0.11626270625897696, 0.1447678095362687, -0.0972351802358876, -0.22224411543812866, 0.113456162214148, -0.19402054988477432, 0.0030012619913257267, -0.018374025270762578, -0.050867150039215325, 0.05827522976323962, -0.34934862642745734, 0.032331083848757644, 0.06066726505572737, 0.08468143614402539, -0.04841209868970163, -0.05446151620380475, 0.05289705384942427, 0.16239807203175946, 0.006785970405859112, 0.05994309692210715, 0.050972461516798385, -0.08259928442741102, -0.1384468896209564, 0.3507783026237723, -0.027128510019728835, -0.23189305981070224, 0.1618395544470511, -0.09871213177455143, -0.13593335591361555, 0.10322015349503974, 0.24838737181787918, 0.10395041430815005, -0.12788870500426897, 0.0339744063897688, -0.07249107242653698, 0.20669535714083573, 0.031541856015625765, 0.09426595088960209, 0.14848802571880146, 0.1629145823838845, 0.08499428639385168, 0.2056152381324275, -0.12872624441835387, -0.0926903592222567, -0.2760027973153497, -0.13918808257390916, -0.20333402202477757, 0.011157610863578362, -0.08358776517512448, -0.15580111802358862, 0.35904791616541815, 0.14430103773697162, 0.16983045705161254, 0.10409752510547061, 0.33970758560257897, 0.04290394991321463, 0.07318791823173074, 0.15060516921016323, 0.22358505401602932, 0.08198335323758213, 0.0773801198425952, -0.19640602444915076, 0.10525556904932773, 0.04605703130626763] |
1,802.09796 | A dynamical system of temperature-dependent sex linked inheritance | Recently, R.Varro introduced a gonosomal algebra of the temperature-dependent
sex determination system which is controlled by three temperature ranges. In
this paper we study dynamical systems which are given by quadratic evolution
operators of the gonosomal algebras of sex-liked populations. We show that this
evolution operator can be reduced to an evolution operator of free population.
Then using behavior of the free population we describe the set of limit points
for trajectories of several evolution operators of the sex-linked populations.
| math.DS | recently rvarro introduced a gonosomal algebra of the temperaturedependent sex determination system which is controlled by three temperature ranges in this paper we study dynamical systems which are given by quadratic evolution operators of the gonosomal algebras of sexliked populations we show that this evolution operator can be reduced to an evolution operator of free population then using behavior of the free population we describe the set of limit points for trajectories of several evolution operators of the sexlinked populations | [['recently', 'rvarro', 'introduced', 'a', 'gonosomal', 'algebra', 'of', 'the', 'temperaturedependent', 'sex', 'determination', 'system', 'which', 'is', 'controlled', 'by', 'three', 'temperature', 'ranges', 'in', 'this', 'paper', 'we', 'study', 'dynamical', 'systems', 'which', 'are', 'given', 'by', 'quadratic', 'evolution', 'operators', 'of', 'the', 'gonosomal', 'algebras', 'of', 'sexliked', 'populations', 'we', 'show', 'that', 'this', 'evolution', 'operator', 'can', 'be', 'reduced', 'to', 'an', 'evolution', 'operator', 'of', 'free', 'population', 'then', 'using', 'behavior', 'of', 'the', 'free', 'population', 'we', 'describe', 'the', 'set', 'of', 'limit', 'points', 'for', 'trajectories', 'of', 'several', 'evolution', 'operators', 'of', 'the', 'sexlinked', 'populations']] | [-0.13859665642988372, 0.1494434898337062, -0.10680249851051864, 0.044696715048078886, -0.010639567551045837, -0.05127538625882672, 0.012503239230930129, 0.3250900835476138, -0.3152903506604882, -0.2793568258185859, 0.1170404069171009, -0.2586607443434851, -0.15971698428733977, 0.1844856824072731, -0.058165790676441675, 0.01521859596205222, 0.0640950162181413, 0.008262436108228254, -0.0765416588265352, -0.23652880972057774, 0.4455800022923859, 0.022110198814929885, 0.18337889048331357, -0.0053403964232163524, 0.10640361196325197, 0.012703152902593667, 0.007154321975328706, 0.03398693685552904, -0.13791410423947162, 0.10488990800721305, 0.2129773158525637, 0.11925629739250455, 0.2686423042474629, -0.3778241572587134, -0.20546998172490435, 0.14206681278376998, 0.2025032465757391, 0.0969743242263552, -0.03709931029369692, -0.23873223901375548, 0.04931940556376834, -0.2185218370604244, -0.16694524739687513, -0.05380056996817713, 0.04956450561883968, 0.028935014687526923, -0.25726934749778213, 0.07414919586682861, 0.028658291571032765, 0.1111399650259258, -0.14164901124736803, -0.07835316980203202, -0.06271030396743157, 0.14913852135469388, -0.005280384736425885, -0.04031869619419532, 0.13858275108837656, -0.08072690464943261, -0.13672382218231047, 0.3156149534436015, -0.08148538106115075, -0.1810899983801238, 0.15572417996727028, -0.21289078389330732, -0.1314955420441345, 0.05162727661043793, 0.15439713953135462, 0.15837839320785813, -0.24112594237720425, 0.11326729015193203, -0.04201383768526426, 0.12795530090277846, 0.0104513307095977, 0.03139026024584453, 0.1667137902665448, 0.15889249526738347, 0.04420843863763012, 0.12440853550056503, 0.006291885219224087, -0.10591315094369476, -0.2809331204693813, -0.13609507324343378, -0.11493221983349845, 0.062126504165096234, -0.06911265762377676, -0.1864474216149515, 0.4501293730716427, 0.15801611477992944, 0.20089090639701138, 0.06825153879192355, 0.18624668774291775, 0.21124616715102304, 0.07091183193608538, 0.04598743824723672, 0.16342642659006953, 0.1509975178421221, 0.05361811658246564, -0.288503165247959, 0.025270479513549958, 0.10307793949379937] |
1,802.09797 | Truncated-Unity Parquet Equations: Application to the Repulsive Hubbard
Model | The parquet equations are a self-consistent set of equations for the
effective two-particle vertex of an interacting many-fermion system. The
application of these equations to bulk models is, however, demanding due to the
complex emergent momentum and frequency structure of the vertex. Here, we show
how a channel-decomposition by means of truncated unities, which was developed
in the context of the functional renormalization group to efficiently treat the
momentum dependence, can be transferred to the parquet equations. This leads to
a significantly reduced numerical effort scaling only linearly with the number
of discrete momenta. We apply this technique to the half-filled repulsive
Hubbard model on the square lattice and present approximate solutions for the
channel-projected vertices and the full reducible vertex.
| cond-mat.str-el | the parquet equations are a selfconsistent set of equations for the effective twoparticle vertex of an interacting manyfermion system the application of these equations to bulk models is however demanding due to the complex emergent momentum and frequency structure of the vertex here we show how a channeldecomposition by means of truncated unities which was developed in the context of the functional renormalization group to efficiently treat the momentum dependence can be transferred to the parquet equations this leads to a significantly reduced numerical effort scaling only linearly with the number of discrete momenta we apply this technique to the halffilled repulsive hubbard model on the square lattice and present approximate solutions for the channelprojected vertices and the full reducible vertex | [['the', 'parquet', 'equations', 'are', 'a', 'selfconsistent', 'set', 'of', 'equations', 'for', 'the', 'effective', 'twoparticle', 'vertex', 'of', 'an', 'interacting', 'manyfermion', 'system', 'the', 'application', 'of', 'these', 'equations', 'to', 'bulk', 'models', 'is', 'however', 'demanding', 'due', 'to', 'the', 'complex', 'emergent', 'momentum', 'and', 'frequency', 'structure', 'of', 'the', 'vertex', 'here', 'we', 'show', 'how', 'a', 'channeldecomposition', 'by', 'means', 'of', 'truncated', 'unities', 'which', 'was', 'developed', 'in', 'the', 'context', 'of', 'the', 'functional', 'renormalization', 'group', 'to', 'efficiently', 'treat', 'the', 'momentum', 'dependence', 'can', 'be', 'transferred', 'to', 'the', 'parquet', 'equations', 'this', 'leads', 'to', 'a', 'significantly', 'reduced', 'numerical', 'effort', 'scaling', 'only', 'linearly', 'with', 'the', 'number', 'of', 'discrete', 'momenta', 'we', 'apply', 'this', 'technique', 'to', 'the', 'halffilled', 'repulsive', 'hubbard', 'model', 'on', 'the', 'square', 'lattice', 'and', 'present', 'approximate', 'solutions', 'for', 'the', 'channelprojected', 'vertices', 'and', 'the', 'full', 'reducible', 'vertex']] | [-0.1188988536354174, 0.12779787141047594, -0.08594201472313966, 0.059821310596924054, -0.09581222785480258, -0.09593716602255943, 0.03231383711706158, 0.32395922591001924, -0.29244411127845277, -0.2857064048391806, 0.0440725019043155, -0.28227642721676527, -0.13788559690250882, 0.12199603920966826, 0.01819926844675, 0.07099484858893547, 0.05153101155957004, 0.030793163641708112, -0.10797299739724699, -0.25650932370027635, 0.3292019477881053, 0.027628950985978132, 0.23030141206113858, 0.0571482177303337, 0.1169449718348181, 0.045838005067937136, 0.007162845615266251, 0.055506049491026825, -0.113828175669896, 0.11202480197109345, 0.24769017309725833, 0.007805318685107622, 0.25193050377336995, -0.45060167688594643, -0.1847238076631637, 0.05280971518490745, 0.16874612566717595, 0.1656686028792374, 0.0010116732935616824, -0.25531777118121374, 0.04094787237445722, -0.22484089444320993, -0.18708283085466026, -0.11720216615094232, -0.005696754902601242, 0.014919829071585495, -0.2614369745774218, 0.08281919662131411, 0.017338972059352434, -5.925730841249979e-05, -0.050984547790452965, -0.09039211249421154, -0.058607482071574624, 0.09424761531702361, 0.013801133662203969, 0.03450988843731832, 0.07404696624804319, -0.14215384856132524, -0.0842549774674464, 0.4009668645175064, -0.023063338709459053, -0.2602886630636992, 0.1957512891796582, -0.13411490759663597, -0.09556146828113359, 0.1514515560276869, 0.16170094047571307, 0.1319153321272999, -0.18218910747291833, 0.14854826437193946, -0.055793435375417484, 0.1643856444607387, -0.002279172694514028, 7.309259831154046e-05, 0.14268785397553457, 0.13495298782598322, 0.06706958032455765, 0.14969667928399003, -0.03378696871839244, -0.1250809815872711, -0.2900682038181469, -0.1045699285953736, -0.19107024373580553, 0.0578484972214968, -0.08800753616366414, -0.18208721313359483, 0.4453555506442775, 0.17602303088642657, 0.16850749537141138, 0.042106442594658115, 0.2581865054187404, 0.1972289645229711, 0.09006124178432867, 0.07964281632932795, 0.1933217234635616, 0.14743869297965548, 0.047225747394430286, -0.3018775388535832, -0.027344036254515293, 0.15232092548286966] |
1,802.09798 | How to generate all possible rational Wilf-Zeilberger pairs? | A Wilf--Zeilberger pair $(F, G)$ in the discrete case satisfies the equation
$ F(n+1, k) - F(n, k) = G(n, k+1) - G(n, k)$. We present a structural
description of all possible rational Wilf--Zeilberger pairs and their
continuous and mixed analogues.
| math.CO cs.SC | a wilfzeilberger pair f g in the discrete case satisfies the equation fn1 k fn k gn k1 gn k we present a structural description of all possible rational wilfzeilberger pairs and their continuous and mixed analogues | [['a', 'wilfzeilberger', 'pair', 'f', 'g', 'in', 'the', 'discrete', 'case', 'satisfies', 'the', 'equation', 'fn1', 'k', 'fn', 'k', 'gn', 'k1', 'gn', 'k', 'we', 'present', 'a', 'structural', 'description', 'of', 'all', 'possible', 'rational', 'wilfzeilberger', 'pairs', 'and', 'their', 'continuous', 'and', 'mixed', 'analogues']] | [-0.2856205240540156, 0.09270807871645367, -0.08507399903484494, 0.033611721585731245, -0.0812159201218369, -0.1882712276954506, 0.09997547364390984, 0.3199547000317457, -0.31002838045006265, -0.22363753425511154, -0.0373016170484039, -0.31533034619044614, -0.13064789122624978, 0.11744440037354424, 0.03439839511505655, 0.02317608953327746, -0.033788967172841765, 0.14262460226293755, -0.0669132333163902, -0.29339853526923704, 0.22519488637713161, -0.1639628074308102, 0.15821171200809045, -0.02516327888981716, 0.06322738387294717, 0.04437164914467045, 0.041019476056602354, -0.034086963375778614, -0.2393686208320228, 0.05464576315638181, 0.2644904450941327, 0.09335768741328974, 0.24628759779640147, -0.32968035803453344, -0.18695561612981396, 0.2428562268866478, 0.07038375332548812, -0.04827611023132261, -0.0046408810980013895, -0.19016241729637054, 0.16755080902697267, -0.08345639861717417, -0.1609412839988599, -0.037506333225079486, 0.12162973490115758, 0.02045494343179303, -0.3170552907033345, 0.04689274397615746, 0.1864649915715327, 0.06013616917000429, -0.010608931927866227, -0.2137244823011192, -0.09871396392181113, 0.0471091835784751, -0.09892623438625722, 0.06056490108823857, 0.014206507784389966, -0.061389342604859454, -0.06505776428290315, 0.4079009556287044, -0.12788364457318913, -0.1328023637116358, 0.13973650557769313, -0.1276785047548647, -0.1623332388195637, 0.13195896294672746, 0.07129600412539534, 0.216730479050327, -0.06438757660421165, 0.22586292696399363, -0.14503404412519288, 0.1133978861648388, 0.12169889972318669, -0.01881365442799555, 0.08980894079306037, 0.019039103125750616, 0.05913275052365419, 0.15049403805185008, 0.043781285120702874, 0.03468172980717862, -0.39925092921869176, -0.1945968547433212, -0.15720486256130342, 0.14342056849115603, -0.10008531705573881, -0.123883084545063, 0.32230823688410426, 0.01621699081482114, 0.19277196218939247, 0.12455406284110772, 0.18010970929675307, 0.09299635549856199, -0.04413890316956551, 0.07537269929574954, -0.011802535202052142, 0.23582703741015615, -0.04517768844458703, -0.1980414579723131, -0.015758643115593773, 0.16418893013552233] |
1,802.09799 | Equatorial magnetohydrodynamic shallow water waves in the solar
tachocline | The influence of a toroidal magnetic field on the dynamics of shallow water
waves in the solar tachocline is studied. A sub-adiabatic temperature gradient
in the upper overshoot layer of the tachocline causes significant reduction of
surface gravity speed, which leads to trapping of the waves near the equator
and to an increase of the Rossby wave period up to the timescale of solar
cycles. Dispersion relations of all equatorial magnetohydrodynamic (MHD)
shallow water waves are obtained in the upper tachocline conditions and solved
analytically and numerically. It is found that the toroidal magnetic field
splits equatorial Rossby and Rossby-gravity waves into fast and slow modes. For
a reasonable value of reduced gravity, global equatorial fast magneto-Rossby
waves (with the spatial scale of equatorial extent) have a periodicity of 11
years, matching the timescale of activity cycles. The solutions are confined
around the equator between latitudes 20-40, coinciding with sunspot activity
belts. Equatorial slow magneto-Rossby waves have a periodicity of 90-100 yr,
resembling the observed long-term modulation of cycle strength, i.e., the
Gleissberg cycle. Equatorial magneto-Kelvin and slow magneto-Rossby-gravity
waves have the periodicity of 1-2 years and may correspond to observed annual
and quasi-biennial oscillations. Equatorial fast magneto-Rossby-gravity and
magneto-inertia-gravity waves have periods of hundreds of days and might be
responsible for observed Rieger-type periodicity. Consequently, the equatorial
MHD shallow water waves in the upper overshoot tachocline may capture all
timescales of observed variations in solar activity, but detailed analytical
and numerical studies are necessary to make a firm conclusion toward the
connection of the waves to the solar dynamo.
| astro-ph.SR | the influence of a toroidal magnetic field on the dynamics of shallow water waves in the solar tachocline is studied a subadiabatic temperature gradient in the upper overshoot layer of the tachocline causes significant reduction of surface gravity speed which leads to trapping of the waves near the equator and to an increase of the rossby wave period up to the timescale of solar cycles dispersion relations of all equatorial magnetohydrodynamic mhd shallow water waves are obtained in the upper tachocline conditions and solved analytically and numerically it is found that the toroidal magnetic field splits equatorial rossby and rossbygravity waves into fast and slow modes for a reasonable value of reduced gravity global equatorial fast magnetorossby waves with the spatial scale of equatorial extent have a periodicity of 11 years matching the timescale of activity cycles the solutions are confined around the equator between latitudes 2040 coinciding with sunspot activity belts equatorial slow magnetorossby waves have a periodicity of 90100 yr resembling the observed longterm modulation of cycle strength ie the gleissberg cycle equatorial magnetokelvin and slow magnetorossbygravity waves have the periodicity of 12 years and may correspond to observed annual and quasibiennial oscillations equatorial fast magnetorossbygravity and magnetoinertiagravity waves have periods of hundreds of days and might be responsible for observed riegertype periodicity consequently the equatorial mhd shallow water waves in the upper overshoot tachocline may capture all timescales of observed variations in solar activity but detailed analytical and numerical studies are necessary to make a firm conclusion toward the connection of the waves to the solar dynamo | [['the', 'influence', 'of', 'a', 'toroidal', 'magnetic', 'field', 'on', 'the', 'dynamics', 'of', 'shallow', 'water', 'waves', 'in', 'the', 'solar', 'tachocline', 'is', 'studied', 'a', 'subadiabatic', 'temperature', 'gradient', 'in', 'the', 'upper', 'overshoot', 'layer', 'of', 'the', 'tachocline', 'causes', 'significant', 'reduction', 'of', 'surface', 'gravity', 'speed', 'which', 'leads', 'to', 'trapping', 'of', 'the', 'waves', 'near', 'the', 'equator', 'and', 'to', 'an', 'increase', 'of', 'the', 'rossby', 'wave', 'period', 'up', 'to', 'the', 'timescale', 'of', 'solar', 'cycles', 'dispersion', 'relations', 'of', 'all', 'equatorial', 'magnetohydrodynamic', 'mhd', 'shallow', 'water', 'waves', 'are', 'obtained', 'in', 'the', 'upper', 'tachocline', 'conditions', 'and', 'solved', 'analytically', 'and', 'numerically', 'it', 'is', 'found', 'that', 'the', 'toroidal', 'magnetic', 'field', 'splits', 'equatorial', 'rossby', 'and', 'rossbygravity', 'waves', 'into', 'fast', 'and', 'slow', 'modes', 'for', 'a', 'reasonable', 'value', 'of', 'reduced', 'gravity', 'global', 'equatorial', 'fast', 'magnetorossby', 'waves', 'with', 'the', 'spatial', 'scale', 'of', 'equatorial', 'extent', 'have', 'a', 'periodicity', 'of', '11', 'years', 'matching', 'the', 'timescale', 'of', 'activity', 'cycles', 'the', 'solutions', 'are', 'confined', 'around', 'the', 'equator', 'between', 'latitudes', '2040', 'coinciding', 'with', 'sunspot', 'activity', 'belts', 'equatorial', 'slow', 'magnetorossby', 'waves', 'have', 'a', 'periodicity', 'of', '90100', 'yr', 'resembling', 'the', 'observed', 'longterm', 'modulation', 'of', 'cycle', 'strength', 'ie', 'the', 'gleissberg', 'cycle', 'equatorial', 'magnetokelvin', 'and', 'slow', 'magnetorossbygravity', 'waves', 'have', 'the', 'periodicity', 'of', '12', 'years', 'and', 'may', 'correspond', 'to', 'observed', 'annual', 'and', 'quasibiennial', 'oscillations', 'equatorial', 'fast', 'magnetorossbygravity', 'and', 'magnetoinertiagravity', 'waves', 'have', 'periods', 'of', 'hundreds', 'of', 'days', 'and', 'might', 'be', 'responsible', 'for', 'observed', 'riegertype', 'periodicity', 'consequently', 'the', 'equatorial', 'mhd', 'shallow', 'water', 'waves', 'in', 'the', 'upper', 'overshoot', 'tachocline', 'may', 'capture', 'all', 'timescales', 'of', 'observed', 'variations', 'in', 'solar', 'activity', 'but', 'detailed', 'analytical', 'and', 'numerical', 'studies', 'are', 'necessary', 'to', 'make', 'a', 'firm', 'conclusion', 'toward', 'the', 'connection', 'of', 'the', 'waves', 'to', 'the', 'solar', 'dynamo']] | [-0.23474263837903409, 0.21767551067573995, -0.02103340109335441, 0.10831106801279912, -0.0741005148729492, -0.03997872728197013, 0.028900370134643333, 0.32097265105694534, -0.2227971423554289, -0.3325557204036444, 0.12720019641816252, -0.2189675562687483, -0.1122579688681107, 0.2357660572902829, -0.026487050051618295, 0.003938764296061195, 0.07495275522655277, -0.006126875158709784, -0.011700490211118377, -0.16412469419632472, 0.1895699902090664, 0.09423229329415835, 0.21101282078626693, 0.009974208563639253, 0.05832228062522607, -0.1324424542767434, 0.00702799299090425, -0.009934878436958089, -0.13952053535758752, 0.0451993394013056, 0.2059466005576884, 0.0688576048217239, 0.19316924256523707, -0.532390416285717, -0.2608626556235786, 0.019769736570214816, 0.1644026209216784, 0.08138329828450201, 0.0035630773072697075, -0.21065090866576808, 0.025740334393420057, -0.11312643781843065, -0.19540151525562738, 0.04145158220758187, 0.12421114754716994, 0.04510349816113126, -0.2402081241137257, 0.14402386311843407, 0.08261387643824313, 0.15314587164435114, -0.14454998756101464, -0.0586481191437034, -0.13309898302689488, 0.06901485905708636, 0.15431779290727218, 0.062139498152057916, 0.1522412458836448, -0.09473172499565408, -0.03453984682165159, 0.35591654498495306, -0.11191776635161801, -0.08671777807906562, 0.1887794555183135, -0.25470631039317915, -0.0499014995133906, 0.2493503822050258, 0.20774528920540916, 0.08603312340291107, -0.07506502937689861, -0.019129672745817942, -0.06440829481951225, 0.16193459609559938, 0.1755111439537038, 0.004673027774483403, 0.3389108345716023, 0.1484542950366934, 0.08303020203066076, 0.06602859558062811, -0.2339286710548799, -0.08570042552663854, -0.22574255097949622, -0.08059312437670123, -0.041132817463036264, 0.018669867800610303, -0.1042842934175746, -0.17628338853919914, 0.43953932931957146, 0.12215622005545917, 0.13286756406008612, 0.01174370024727621, 0.25849646770340556, 0.14074859483277097, 0.078534723238337, 0.16454658911873896, 0.37775471743913003, 0.2137331543198111, 0.1704269231749041, -0.26251190745947406, 0.05136142551131985, 0.05224434884411155] |
1,802.098 | A Silicon Cluster Based Single Electron Transistor with Potential
Room-Temperature Switching | We demonstrate the fabrication of a single electron transistor device based
on a single ultra-small silicon quantum dot connected to a gold break junction
with a nanometer scale separation. The gold break junction is created through a
controllable electromigration process and the individual silicon quantum dot in
the junction is determined to be a Si_170 cluster. Differential conductance as
a function of the bias and gate voltage clearly shows the Coulomb diamond which
confirms that the transport is dominated by a single silicon quantum dot. It is
found that the charging energy can be as large as 300meV, which is a result of
the large capacitance of a small silicon quantum dot (1.8 nm). This large
Coulomb interaction can potentially enable a single electron transistor to work
at room temperature. The level spacing of the excited state can be as large as
10 meV, which enables us to manipulate individual spin via an external magnetic
field. The resulting Zeeman splitting is measured and the lande factor of 2.3
is obtained, suggesting relatively weak electron-electron interaction in the
silicon quantum dot which is beneficial for spin coherence time.
| cond-mat.mes-hall physics.app-ph | we demonstrate the fabrication of a single electron transistor device based on a single ultrasmall silicon quantum dot connected to a gold break junction with a nanometer scale separation the gold break junction is created through a controllable electromigration process and the individual silicon quantum dot in the junction is determined to be a si_170 cluster differential conductance as a function of the bias and gate voltage clearly shows the coulomb diamond which confirms that the transport is dominated by a single silicon quantum dot it is found that the charging energy can be as large as 300mev which is a result of the large capacitance of a small silicon quantum dot 18 nm this large coulomb interaction can potentially enable a single electron transistor to work at room temperature the level spacing of the excited state can be as large as 10 mev which enables us to manipulate individual spin via an external magnetic field the resulting zeeman splitting is measured and the lande factor of 23 is obtained suggesting relatively weak electronelectron interaction in the silicon quantum dot which is beneficial for spin coherence time | [['we', 'demonstrate', 'the', 'fabrication', 'of', 'a', 'single', 'electron', 'transistor', 'device', 'based', 'on', 'a', 'single', 'ultrasmall', 'silicon', 'quantum', 'dot', 'connected', 'to', 'a', 'gold', 'break', 'junction', 'with', 'a', 'nanometer', 'scale', 'separation', 'the', 'gold', 'break', 'junction', 'is', 'created', 'through', 'a', 'controllable', 'electromigration', 'process', 'and', 'the', 'individual', 'silicon', 'quantum', 'dot', 'in', 'the', 'junction', 'is', 'determined', 'to', 'be', 'a', 'si_170', 'cluster', 'differential', 'conductance', 'as', 'a', 'function', 'of', 'the', 'bias', 'and', 'gate', 'voltage', 'clearly', 'shows', 'the', 'coulomb', 'diamond', 'which', 'confirms', 'that', 'the', 'transport', 'is', 'dominated', 'by', 'a', 'single', 'silicon', 'quantum', 'dot', 'it', 'is', 'found', 'that', 'the', 'charging', 'energy', 'can', 'be', 'as', 'large', 'as', '300mev', 'which', 'is', 'a', 'result', 'of', 'the', 'large', 'capacitance', 'of', 'a', 'small', 'silicon', 'quantum', 'dot', '18', 'nm', 'this', 'large', 'coulomb', 'interaction', 'can', 'potentially', 'enable', 'a', 'single', 'electron', 'transistor', 'to', 'work', 'at', 'room', 'temperature', 'the', 'level', 'spacing', 'of', 'the', 'excited', 'state', 'can', 'be', 'as', 'large', 'as', '10', 'mev', 'which', 'enables', 'us', 'to', 'manipulate', 'individual', 'spin', 'via', 'an', 'external', 'magnetic', 'field', 'the', 'resulting', 'zeeman', 'splitting', 'is', 'measured', 'and', 'the', 'lande', 'factor', 'of', '23', 'is', 'obtained', 'suggesting', 'relatively', 'weak', 'electronelectron', 'interaction', 'in', 'the', 'silicon', 'quantum', 'dot', 'which', 'is', 'beneficial', 'for', 'spin', 'coherence', 'time']] | [-0.15652937289347413, 0.19578101751790444, -0.036175568288903164, 0.005092756483209478, 0.009931036158964308, -0.22316378418491373, 0.05744086468957805, 0.3980356420350251, -0.27527511353048706, -0.3595333286756349, -0.011947164741364778, -0.2739424387453705, -0.05042374764959658, 0.2366314787137252, 0.01058968024638792, 0.01608742950534228, 0.05042237803209773, -0.030294771098421627, -0.03044230547503278, -0.16245958738852673, 0.25071937584828946, 0.06882527825780593, 0.3082460291127885, 0.14221127865765926, 0.10556983274047173, -0.015344006235971647, 0.13465466241177637, 0.04370754172084152, -0.06630381853271199, 0.0756370541639626, 0.23957778240105898, -0.1011288396648622, 0.25452269802510896, -0.444240613369852, -0.15188915660149188, 0.002371516506192625, 0.14620425552755634, 0.17913333813519647, -0.0497381501894955, -0.2827758890731881, 0.07206399333463, -0.17211993440349777, -0.08266969619979782, -0.01863178287843062, -0.01023847769923328, -0.005584002928107336, -0.26253439044962906, 0.05373205277588098, 0.023862702953529054, 0.008448678644634383, 0.022647268216436107, -0.042865752824895104, -0.0354194594296797, 0.09904961184719302, -0.06786760892133824, 0.061863590981492085, 0.27723358798601855, -0.08538437752999485, -0.11951598329144099, 0.32992720051908925, -0.07963776701976175, -0.1131843095124256, 0.13318174373939312, -0.1834817494250714, -0.0066951108565654165, 0.13217191163185102, 0.10509555716998875, 0.1127751696459268, -0.1900321050116452, 0.08307792314594882, 0.015179730854147384, 0.22993025349287857, 0.0707644728783478, 0.07942821249686262, 0.25807353139163985, 0.2409803741192195, 0.07408419560881392, 0.14166951946343384, -0.18584423095474262, -0.052353468405643616, -0.24822064999851487, -0.19047266209838531, -0.23615133182661388, 0.18431948952411892, -0.0854927140025338, -0.2098038918338716, 0.40172744526994736, 0.10536013854015368, 0.1908084691867673, -0.058803130804951635, 0.2841561871270339, 0.18789320575231086, 0.14958643215403, -0.025508936614759507, 0.24877945837684937, 0.16742471757004418, 0.07597947059579754, -0.30483532468512936, 0.0401114710013292, -0.06161118896993538] |
1,802.09801 | Empirical Evaluation of Approximation Algorithms for Generalized Graph
Coloring and Uniform Quasi-Wideness | The notions of bounded expansion and nowhere denseness not only offer robust
and general definitions of uniform sparseness of graphs, they also describe the
tractability boundary for several important algorithmic questions. In this
paper we study two structural properties of these graph classes that are of
particular importance in this context, namely the property of having bounded
generalized coloring numbers and the property of being uniformly quasi-wide. We
provide experimental evaluations of several algorithms that approximate these
parameters on real-world graphs. On the theoretical side, we provide a new
algorithm for uniform quasi-wideness with polynomial size guarantees in graph
classes of bounded expansion and show a lower bound indicating that the
guarantees of this algorithm are close to optimal in graph classes with fixed
excluded minor.
| cs.DM | the notions of bounded expansion and nowhere denseness not only offer robust and general definitions of uniform sparseness of graphs they also describe the tractability boundary for several important algorithmic questions in this paper we study two structural properties of these graph classes that are of particular importance in this context namely the property of having bounded generalized coloring numbers and the property of being uniformly quasiwide we provide experimental evaluations of several algorithms that approximate these parameters on realworld graphs on the theoretical side we provide a new algorithm for uniform quasiwideness with polynomial size guarantees in graph classes of bounded expansion and show a lower bound indicating that the guarantees of this algorithm are close to optimal in graph classes with fixed excluded minor | [['the', 'notions', 'of', 'bounded', 'expansion', 'and', 'nowhere', 'denseness', 'not', 'only', 'offer', 'robust', 'and', 'general', 'definitions', 'of', 'uniform', 'sparseness', 'of', 'graphs', 'they', 'also', 'describe', 'the', 'tractability', 'boundary', 'for', 'several', 'important', 'algorithmic', 'questions', 'in', 'this', 'paper', 'we', 'study', 'two', 'structural', 'properties', 'of', 'these', 'graph', 'classes', 'that', 'are', 'of', 'particular', 'importance', 'in', 'this', 'context', 'namely', 'the', 'property', 'of', 'having', 'bounded', 'generalized', 'coloring', 'numbers', 'and', 'the', 'property', 'of', 'being', 'uniformly', 'quasiwide', 'we', 'provide', 'experimental', 'evaluations', 'of', 'several', 'algorithms', 'that', 'approximate', 'these', 'parameters', 'on', 'realworld', 'graphs', 'on', 'the', 'theoretical', 'side', 'we', 'provide', 'a', 'new', 'algorithm', 'for', 'uniform', 'quasiwideness', 'with', 'polynomial', 'size', 'guarantees', 'in', 'graph', 'classes', 'of', 'bounded', 'expansion', 'and', 'show', 'a', 'lower', 'bound', 'indicating', 'that', 'the', 'guarantees', 'of', 'this', 'algorithm', 'are', 'close', 'to', 'optimal', 'in', 'graph', 'classes', 'with', 'fixed', 'excluded', 'minor']] | [-0.13778729895351544, 0.07629459269256109, -0.07465843148233872, 0.07159611122176376, -0.09811028971388522, -0.12291863568807168, 0.05816439051450866, 0.410582720789881, -0.2871548100448554, -0.29594965573281995, 0.1212912381124047, -0.23325973600592642, -0.15837952806355637, 0.20241290106925935, -0.10518358753521055, 0.077319334024593, 0.09323299768942571, 0.054876188104990724, -0.06894613581336295, -0.2885398836730192, 0.3271329578126189, -0.03517877374542877, 0.2198927778203691, 0.1262207486064336, 0.07573711899079619, -0.046618766607790595, -0.018395765117713295, 0.08915875913676462, -0.1888840263847438, 0.16146382905675896, 0.24634210237612328, 0.17039545708232456, 0.2881789273685879, -0.3935491756077797, -0.16018223572551968, 0.18066188894093982, 0.11197725795061579, 0.056062862735300784, -0.057123503020857384, -0.24194706875335661, 0.15241167435999073, -0.10869501241009742, -0.09705801203566057, -0.09401820524871009, 0.0013446722600963853, 0.07747144364966227, -0.2612400018214618, 0.025157197188015006, 0.16192941559803864, 0.07037287061324432, -0.028485385808236306, -0.1469876112126272, 0.034180487786966654, 0.1107070022595248, 0.01450586421156509, -0.004516753126009707, 0.049744538072171426, -0.11875625345153763, -0.15018961974234868, 0.34793693547151866, -0.0062473430150439815, -0.20288037597423508, 0.18756998317789228, -0.12577218484754363, -0.2327213968401627, 0.08490579792239245, 0.1801545645391184, 0.13175285072805035, -0.11144955811415991, 0.11886964278436074, -0.11728508973638305, 0.11894747309316511, 0.0986900490039723, 0.09841898643080929, 0.10550098854028397, 0.12422966838274742, 0.14307317765991365, 0.184045061188203, 0.03826003247273287, -0.09496122778907033, -0.32305175416348947, -0.09770938303803892, -0.1828964153870142, -0.010107388629255603, -0.19264853236381896, -0.23757873211676875, 0.41267187513470177, 0.15968479172489236, 0.19695478465615046, 0.1347605553159993, 0.2723563449440657, 0.06165302350067548, 0.0013493217586997956, 0.1423314207322186, 0.19140384180216297, 0.1500573555406715, 0.01820260321810132, -0.13351061055806304, 0.10987712718760742, 0.0995652454486902] |
1,802.09802 | Matching Convolutional Neural Networks without Priors about Data | We propose an extension of Convolutional Neural Networks (CNNs) to
graph-structured data, including strided convolutions and data augmentation on
graphs.
Our method matches the accuracy of state-of-the-art CNNs when applied on
images, without any prior about their 2D regular structure.
On fMRI data, we obtain a significant gain in accuracy compared with existing
graph-based alternatives.
| cs.LG stat.ML | we propose an extension of convolutional neural networks cnns to graphstructured data including strided convolutions and data augmentation on graphs our method matches the accuracy of stateoftheart cnns when applied on images without any prior about their 2d regular structure on fmri data we obtain a significant gain in accuracy compared with existing graphbased alternatives | [['we', 'propose', 'an', 'extension', 'of', 'convolutional', 'neural', 'networks', 'cnns', 'to', 'graphstructured', 'data', 'including', 'strided', 'convolutions', 'and', 'data', 'augmentation', 'on', 'graphs', 'our', 'method', 'matches', 'the', 'accuracy', 'of', 'stateoftheart', 'cnns', 'when', 'applied', 'on', 'images', 'without', 'any', 'prior', 'about', 'their', '2d', 'regular', 'structure', 'on', 'fmri', 'data', 'we', 'obtain', 'a', 'significant', 'gain', 'in', 'accuracy', 'compared', 'with', 'existing', 'graphbased', 'alternatives']] | [-0.01638253732499751, -0.1314586168385259, -0.03194882028143514, 0.07436239089478146, -0.11233240514993667, -0.14602548789910294, 0.01076674239540642, 0.5262651618231426, -0.2328927453268658, -0.33496085991236296, 0.07764171884945509, -0.3125586046583273, -0.18433442491699348, 0.2087070067751814, -0.1541766722305593, 0.14429000671952963, 0.2235709026794542, 0.08752249371768399, -0.11903846890411594, -0.33021995347543537, 0.3058010001116517, 0.05196006142280318, 0.40105358590795237, -0.027276104417714206, 0.12153499063570053, -0.0338468368969519, -0.03207291710846634, -0.023681579225442628, -0.0703070573085411, 0.21124004023996265, 0.2651007446714423, 0.1876877705566585, 0.2763284622310576, -0.4911966305395419, -0.2846155781468207, 0.10019466463815083, 0.13059349418194457, 0.11879460943693465, -0.020532890294932507, -0.3812512302940542, 0.10434005024250258, -0.15169055736200376, 0.07608120978217234, -0.20161646926267582, -0.08191393480678512, -0.008122427609156479, -0.3076746698606505, 0.06437769933519039, 0.08543371784246781, 0.0990660140121525, -0.05430262577296658, -0.1514202047478069, 0.04243159073785963, 0.12414032569504344, -0.02808670106936585, 0.08819358534264293, 0.07054306046867913, -0.22207249825481665, -0.19418309120969338, 0.3086727120659568, -0.07148980622772466, -0.24170015969059683, 0.192435664514249, -0.017172193561087956, -0.14466702140529047, 0.10037844611162489, 0.2835052569142797, 0.1028758132068271, -0.09073780322770207, 0.0439964493302713, -0.04897688722068613, 0.21525505323978988, 0.07812593687664379, -0.014818709309805523, 0.09053890891373158, 0.2923169339033352, 0.03353890555656769, 0.13907474811104212, -0.170779983331026, -0.010318985382433641, -0.1378270118751309, -0.022001414593647826, -0.20616681257432157, 0.0005962125781066292, -0.2180143651973181, -0.16307153220881115, 0.4329678518020294, 0.24923243121328678, 0.23076651455326513, 0.17125882404771717, 0.3740189221094955, -0.016881344067356127, 0.2202997087373991, 0.12994669526815414, 0.12478353916244074, 0.05170385461639274, 0.11435321411117912, -0.10869636850600893, 0.06151181760836731, 0.02099226914684881] |
1,802.09803 | Photon statistics and bunching of a chaotic semiconductor laser | The photon statistics and bunching of a semiconductor laser with external
optical feedback are investigated experimentally and theoretically. In a
chaotic regime, the photon number distribution is measured and undergoes a
transition from Bose-Einstein distribution to Poisson distribution with
increasing the mean photon number. The second order degree of coherence
decreases gradually from 2 to 1. Based on Hanbury Brown-Twiss scheme,
pronounced photon bunching is observed experimentally for various injection
currents and feedback strengths, which indicates the randomness of the
associated emission light. Near-threshold injection currents and strong
feedback strengths modify exactly the laser performance to be more bunched. The
macroscopic chaotic dynamics is confirmed simultaneously by high-speed analog
detection. The theoretical results qualitatively agree with the experimental
results. It is potentially useful to extract randomness and achieve desired
entropy source for random number generator and imaging science by quantifying
the control parameters.
| quant-ph physics.optics | the photon statistics and bunching of a semiconductor laser with external optical feedback are investigated experimentally and theoretically in a chaotic regime the photon number distribution is measured and undergoes a transition from boseeinstein distribution to poisson distribution with increasing the mean photon number the second order degree of coherence decreases gradually from 2 to 1 based on hanbury browntwiss scheme pronounced photon bunching is observed experimentally for various injection currents and feedback strengths which indicates the randomness of the associated emission light nearthreshold injection currents and strong feedback strengths modify exactly the laser performance to be more bunched the macroscopic chaotic dynamics is confirmed simultaneously by highspeed analog detection the theoretical results qualitatively agree with the experimental results it is potentially useful to extract randomness and achieve desired entropy source for random number generator and imaging science by quantifying the control parameters | [['the', 'photon', 'statistics', 'and', 'bunching', 'of', 'a', 'semiconductor', 'laser', 'with', 'external', 'optical', 'feedback', 'are', 'investigated', 'experimentally', 'and', 'theoretically', 'in', 'a', 'chaotic', 'regime', 'the', 'photon', 'number', 'distribution', 'is', 'measured', 'and', 'undergoes', 'a', 'transition', 'from', 'boseeinstein', 'distribution', 'to', 'poisson', 'distribution', 'with', 'increasing', 'the', 'mean', 'photon', 'number', 'the', 'second', 'order', 'degree', 'of', 'coherence', 'decreases', 'gradually', 'from', '2', 'to', '1', 'based', 'on', 'hanbury', 'browntwiss', 'scheme', 'pronounced', 'photon', 'bunching', 'is', 'observed', 'experimentally', 'for', 'various', 'injection', 'currents', 'and', 'feedback', 'strengths', 'which', 'indicates', 'the', 'randomness', 'of', 'the', 'associated', 'emission', 'light', 'nearthreshold', 'injection', 'currents', 'and', 'strong', 'feedback', 'strengths', 'modify', 'exactly', 'the', 'laser', 'performance', 'to', 'be', 'more', 'bunched', 'the', 'macroscopic', 'chaotic', 'dynamics', 'is', 'confirmed', 'simultaneously', 'by', 'highspeed', 'analog', 'detection', 'the', 'theoretical', 'results', 'qualitatively', 'agree', 'with', 'the', 'experimental', 'results', 'it', 'is', 'potentially', 'useful', 'to', 'extract', 'randomness', 'and', 'achieve', 'desired', 'entropy', 'source', 'for', 'random', 'number', 'generator', 'and', 'imaging', 'science', 'by', 'quantifying', 'the', 'control', 'parameters']] | [-0.11673914428744986, 0.23416721625123305, -0.07361516947825472, 0.08339298338062696, -0.013472803699797923, -0.20418980721566643, 0.02486071239674946, 0.3936812485310972, -0.2555746859414959, -0.33108077043589285, -0.0021063190212447223, -0.3028293476062273, -0.08132692309539322, 0.24848806733994946, -0.008733471897854046, 0.08976819377288327, 0.0217790044909278, -0.004412668384285969, 0.011547752035703589, -0.16787993960518885, 0.2746549147389621, 0.0974273494920218, 0.3385972479241086, 0.05207242993426255, 0.11336297849258342, 0.0023278785248020814, 0.0017476531325259826, -0.014740429926090516, -0.09624999443352404, 0.0481405922267065, 0.19487993555286756, 0.04945689406884196, 0.2324669981290671, -0.37551976099506124, -0.23053616631883556, 0.08679856511542795, 0.12368400001383902, 0.13350272182801778, -0.0858641064631585, -0.3005043049733695, 0.04759598507422146, -0.15415953490095477, -0.1213017282942375, -0.05386183316448143, 0.007796937250125163, 0.07390979076891116, -0.2910048396756443, 0.06910517296942693, 0.031004620372835495, 0.06309105784117759, 0.005945799973226719, -0.022746064384318105, -0.04810222662688995, 0.0989701034781243, -0.016220558617081677, 0.0494982786248666, 0.19673673795874824, -0.14853722811839382, -0.13283456347465933, 0.31615598330443556, -0.07017626534981354, -0.1467765235322547, 0.16263393548942476, -0.2012032508260694, -0.05780429420080948, 0.19882341157123967, 0.1387154741548132, 0.060384067469862635, -0.10663642363062689, -0.030737322292345985, 0.02604253452688039, 0.216211923026851, 0.07217085787577072, 0.11421700493901499, 0.20130002861875076, 0.15250369008887768, 0.011290633862095696, 0.1718909643395882, -0.13942379254189977, -0.11098774316740202, -0.26983675883327435, -0.08357921149907308, -0.2075564204291864, 0.06801370387063264, -0.07659299123856822, -0.08614088649294906, 0.3917693260632945, 0.17390741329067028, 0.18676278067889487, 0.022759462627777633, 0.35125881551041993, 0.16718363034509617, 0.024807296745427004, 0.01915076877303109, 0.2788626744535628, 0.19449759889361481, 0.10942450044285897, -0.27547400935338906, 0.08733253453864709, -0.013895338140688576] |
1,802.09804 | Evolving ONe WD+He star systems to intermediate-mass binary pulsars | It has been suggested that accretion-induced collapse (AIC) is a
non-negligible path for the formation of the observed neutron stars (NSs). An
ONe white dwarf (WD) that accretes material from a He star may experience AIC
process and eventually produce intermediate-mass binary pulsars (IMBPs), named
as the ONe WD+He star scenario. Note that previous studies can only account for
part of the observed IMBPs with short orbital periods. In this work, we
investigate the evolution of about 900 ONe WD+He star binaries to explore the
distribution of IMBPs. We found that the ONe WD+He star scenario could form
IMBPs including pulsars with 5-340 ms spin periods and 0.75-1.38 Msun WD
companions, in which the orbital periods range from 0.04 to 900 d. Compared
with the 20 observed IMBPs, this scenario can cover the parameters of 13
sources in the final orbital period-WD mass plane and the Corbet diagram, most
of which has short orbital periods. We found that the ONe WD+He star scenario
can explain almost all the observed IMBPs with short orbital periods. This work
can well match the observed parameters of PSR J1802-2124 (one of the two
precisely observed IMBPs), providing a possible evolutional path for its
formation. We also speculate that the compact companion of HD 49798 (a hydrogen
depleted sdO6 star) may be not a NS based on the present work.
| astro-ph.SR astro-ph.HE | it has been suggested that accretioninduced collapse aic is a nonnegligible path for the formation of the observed neutron stars nss an one white dwarf wd that accretes material from a he star may experience aic process and eventually produce intermediatemass binary pulsars imbps named as the one wdhe star scenario note that previous studies can only account for part of the observed imbps with short orbital periods in this work we investigate the evolution of about 900 one wdhe star binaries to explore the distribution of imbps we found that the one wdhe star scenario could form imbps including pulsars with 5340 ms spin periods and 075138 msun wd companions in which the orbital periods range from 004 to 900 d compared with the 20 observed imbps this scenario can cover the parameters of 13 sources in the final orbital periodwd mass plane and the corbet diagram most of which has short orbital periods we found that the one wdhe star scenario can explain almost all the observed imbps with short orbital periods this work can well match the observed parameters of psr j18022124 one of the two precisely observed imbps providing a possible evolutional path for its formation we also speculate that the compact companion of hd 49798 a hydrogen depleted sdo6 star may be not a ns based on the present work | [['it', 'has', 'been', 'suggested', 'that', 'accretioninduced', 'collapse', 'aic', 'is', 'a', 'nonnegligible', 'path', 'for', 'the', 'formation', 'of', 'the', 'observed', 'neutron', 'stars', 'nss', 'an', 'one', 'white', 'dwarf', 'wd', 'that', 'accretes', 'material', 'from', 'a', 'he', 'star', 'may', 'experience', 'aic', 'process', 'and', 'eventually', 'produce', 'intermediatemass', 'binary', 'pulsars', 'imbps', 'named', 'as', 'the', 'one', 'wdhe', 'star', 'scenario', 'note', 'that', 'previous', 'studies', 'can', 'only', 'account', 'for', 'part', 'of', 'the', 'observed', 'imbps', 'with', 'short', 'orbital', 'periods', 'in', 'this', 'work', 'we', 'investigate', 'the', 'evolution', 'of', 'about', '900', 'one', 'wdhe', 'star', 'binaries', 'to', 'explore', 'the', 'distribution', 'of', 'imbps', 'we', 'found', 'that', 'the', 'one', 'wdhe', 'star', 'scenario', 'could', 'form', 'imbps', 'including', 'pulsars', 'with', '5340', 'ms', 'spin', 'periods', 'and', '075138', 'msun', 'wd', 'companions', 'in', 'which', 'the', 'orbital', 'periods', 'range', 'from', '004', 'to', '900', 'd', 'compared', 'with', 'the', '20', 'observed', 'imbps', 'this', 'scenario', 'can', 'cover', 'the', 'parameters', 'of', '13', 'sources', 'in', 'the', 'final', 'orbital', 'periodwd', 'mass', 'plane', 'and', 'the', 'corbet', 'diagram', 'most', 'of', 'which', 'has', 'short', 'orbital', 'periods', 'we', 'found', 'that', 'the', 'one', 'wdhe', 'star', 'scenario', 'can', 'explain', 'almost', 'all', 'the', 'observed', 'imbps', 'with', 'short', 'orbital', 'periods', 'this', 'work', 'can', 'well', 'match', 'the', 'observed', 'parameters', 'of', 'psr', 'j18022124', 'one', 'of', 'the', 'two', 'precisely', 'observed', 'imbps', 'providing', 'a', 'possible', 'evolutional', 'path', 'for', 'its', 'formation', 'we', 'also', 'speculate', 'that', 'the', 'compact', 'companion', 'of', 'hd', '49798', 'a', 'hydrogen', 'depleted', 'sdo6', 'star', 'may', 'be', 'not', 'a', 'ns', 'based', 'on', 'the', 'present', 'work']] | [-0.1449047021215429, 0.16899135652757805, -0.09654642437030939, 0.12935872046256902, -0.13956841717994362, -0.08548813774502156, 0.06797135937518466, 0.3691606581680947, -0.175994434358808, -0.33945555407354644, 0.07259691345583026, -0.26314277054130014, -0.05579435721308262, 0.22707056057815617, -0.06089232912756973, -0.057046410319057654, 0.15877041090877625, 0.027674715959431335, -0.07711615364580113, -0.29016491189192106, 0.28924033646933267, 0.030221281654981745, 0.0758450065502427, -0.04743143010004591, 0.05041896986045145, -0.06630794917598266, 0.018311226570576027, -0.10789515039472429, -0.1729130377333694, 0.0010369705069843713, 0.21811333058301258, 0.14070809056650982, 0.1734096740376674, -0.3528636663476727, -0.25375066366600424, 0.07010882932415886, 0.1924278942138158, 0.05422021913853986, -0.0668255372428092, -0.21956566636930933, 0.11174370173830539, -0.29183792419781956, -0.15227603998354022, 0.07172590984149022, 0.0948708879329822, 0.03502792183431453, -0.23009844917619415, 0.09195951958171716, 0.1141212542965035, -0.002629541306911657, -0.13129120801946753, -0.13244154788608775, -0.059137560755459104, 0.051477470359689484, 0.06609366846631118, 0.10243339187713121, 0.07811640861637152, -0.048959800195334864, -0.07035533677910345, 0.3887973866902128, -0.08083482788506526, -0.008471577997248082, 0.22073609336082162, -0.21455934806307358, -0.1682066047849419, 0.1390589877904334, 0.12323110005692453, 0.16909010644985345, -0.19033884885930666, -0.07118060956955552, 0.0015694968012237066, 0.21993581268323903, 0.07535477245812774, 0.06362643989740645, 0.3837329847127884, 0.16730256147078565, -0.014793110667383886, 0.0730739269161236, -0.2387338872964343, -0.08342627122571382, -0.17620811244967888, -0.09511468377643945, -0.12380299453208274, 0.11018319047788454, -0.0793245718744295, -0.08240579531044565, 0.34950072341283933, 0.09672229184385238, 0.21277892165649515, 0.003127244586410286, 0.25772902738042847, 0.1013927484116819, 0.08620111597282393, 0.1105591840077158, 0.29721375324486476, 0.17257286746239475, 0.0972210005343145, -0.2476002586636323, 0.13186711220381162, -0.03300318902522024] |
1,802.09805 | Atoms for signed permutations | There is a natural analogue of weak Bruhat order on the involutions in any Coxeter group. The saturated chains of intervals in this order correspond to reduced words for a certain set of group elements called atoms. Brion gives a general formula for the cohomology class of a $K$-orbit closure in an arbitrary flag variety, where $K$ is a symmetric subgroup of a complex algebraic group. In type A, the terms in this formula are indexed by atoms for permutations. We study the combinatorics of atoms for involutions in the group of signed permutations. In particular, we give a compact description of the atom set for any signed involution and endow it with the structure of a graded poset. Our main result, as an application, is to identify explicitly the terms in Brion's cohomology formula in types B and C. These descriptions apply to all $K$-orbits in these types and are the first of their kind outside of type A. | math.CO math.RT | there is a natural analogue of weak bruhat order on the involutions in any coxeter group the saturated chains of intervals in this order correspond to reduced words for a certain set of group elements called atoms brion gives a general formula for the cohomology class of a korbit closure in an arbitrary flag variety where k is a symmetric subgroup of a complex algebraic group in type a the terms in this formula are indexed by atoms for permutations we study the combinatorics of atoms for involutions in the group of signed permutations in particular we give a compact description of the atom set for any signed involution and endow it with the structure of a graded poset our main result as an application is to identify explicitly the terms in brions cohomology formula in types b and c these descriptions apply to all korbits in these types and are the first of their kind outside of type a | [['there', 'is', 'a', 'natural', 'analogue', 'of', 'weak', 'bruhat', 'order', 'on', 'the', 'involutions', 'in', 'any', 'coxeter', 'group', 'the', 'saturated', 'chains', 'of', 'intervals', 'in', 'this', 'order', 'correspond', 'to', 'reduced', 'words', 'for', 'a', 'certain', 'set', 'of', 'group', 'elements', 'called', 'atoms', 'brion', 'gives', 'a', 'general', 'formula', 'for', 'the', 'cohomology', 'class', 'of', 'a', 'korbit', 'closure', 'in', 'an', 'arbitrary', 'flag', 'variety', 'where', 'k', 'is', 'a', 'symmetric', 'subgroup', 'of', 'a', 'complex', 'algebraic', 'group', 'in', 'type', 'a', 'the', 'terms', 'in', 'this', 'formula', 'are', 'indexed', 'by', 'atoms', 'for', 'permutations', 'we', 'study', 'the', 'combinatorics', 'of', 'atoms', 'for', 'involutions', 'in', 'the', 'group', 'of', 'signed', 'permutations', 'in', 'particular', 'we', 'give', 'a', 'compact', 'description', 'of', 'the', 'atom', 'set', 'for', 'any', 'signed', 'involution', 'and', 'endow', 'it', 'with', 'the', 'structure', 'of', 'a', 'graded', 'poset', 'our', 'main', 'result', 'as', 'an', 'application', 'is', 'to', 'identify', 'explicitly', 'the', 'terms', 'in', 'brions', 'cohomology', 'formula', 'in', 'types', 'b', 'and', 'c', 'these', 'descriptions', 'apply', 'to', 'all', 'korbits', 'in', 'these', 'types', 'and', 'are', 'the', 'first', 'of', 'their', 'kind', 'outside', 'of', 'type', 'a']] | [-0.17191111472056947, 0.0957630073202381, -0.04514840886695311, 0.047488055440044266, -0.08788172038184712, -0.08064393168315291, 0.04937992094783113, 0.32323669107281605, -0.3135574846091913, -0.23872237782925368, 0.07404889372119214, -0.2520608508901205, -0.13148868742282502, 0.19349202876073832, -0.1302614528569393, -0.05679517571406904, 0.030641630514583084, 0.12922155861888313, -0.09055900778621435, -0.25402194909838727, 0.3817626166390255, -0.07051085121929646, 0.21649594351773657, 0.0160963138245279, 0.08335974612564315, 0.008645663195784437, -0.01107900167698972, 0.014709140359627781, -0.12466448131308425, 0.14373203301729517, 0.30889692545169967, 0.07227084279584232, 0.18821669903845759, -0.37530354187183546, -0.11582468390406575, 0.18588972687430214, 0.11731590347771999, 0.07797909276123391, -0.03432491989005939, -0.26694521837634966, 0.11541879609212628, -0.2096825573244132, -0.15738926790945698, -0.05549690468760673, 0.1079337781353388, 0.050758179328124695, -0.2663525664484041, -0.031019733482389712, 0.1125308563990984, 0.13901481636567042, -0.035063395198085344, -0.08598358470917447, -0.0013977977156173437, 0.09961127518690774, -0.04255596324946964, 0.013198018718685488, 0.04931547220621724, -0.06961235486087389, -0.14174118215196357, 0.42989968657493594, -0.039146924229862635, -0.24729484959389084, 0.13206541035615374, -0.1627098895580275, -0.1924356385541614, 0.12091979780816473, 0.11795460851208191, 0.15514584222692065, -0.05825623099553923, 0.14984605116187594, -0.15143328209524043, 0.06878679970068333, 0.10854571910458617, 0.007976643712390796, 0.14174178986431799, 0.10454002656479133, 0.06076085563399829, 0.1536309581162641, 0.019318996426591184, -0.03343243324343348, -0.3702557590324432, -0.2408573751541553, -0.12167360948878922, 0.08702486521651735, -0.12156704427006844, -0.21481936888885683, 0.4213122565764934, 0.07377690129214898, 0.18462048262299505, 0.07107054043735843, 0.18766525978571735, 0.06497013701027754, 0.07567221896424599, -2.7123934705741705e-05, 0.08199507481767795, 0.2168525332934223, -0.047460778574168215, -0.15621168591314927, 0.031755710722063665, 0.1996658303833101] |
1,802.09806 | Universal constraint for efficiency and power of a low-dissipation heat
engine | The constraint relation for efficiency and power is crucial to design optimal
heat engines operating within finite time. We find a universal constraint
between efficiency and output power for heat engines operating in the
low-dissipation regime. Such constraint is validated with an example of
Carnot-like engine. Its microscopic dynamics is governed by the master
equation. Based on the master equation, we connect the microscopic coupling
strengths to the generic parameters in the phenomenological model. We find the
usual assumption of low-dissipation is achieved when the coupling to thermal
environments is stronger than the driving speed. Additionally, such connection
allows the design of practical cycle to optimize the engine performance.
| quant-ph cond-mat.stat-mech | the constraint relation for efficiency and power is crucial to design optimal heat engines operating within finite time we find a universal constraint between efficiency and output power for heat engines operating in the lowdissipation regime such constraint is validated with an example of carnotlike engine its microscopic dynamics is governed by the master equation based on the master equation we connect the microscopic coupling strengths to the generic parameters in the phenomenological model we find the usual assumption of lowdissipation is achieved when the coupling to thermal environments is stronger than the driving speed additionally such connection allows the design of practical cycle to optimize the engine performance | [['the', 'constraint', 'relation', 'for', 'efficiency', 'and', 'power', 'is', 'crucial', 'to', 'design', 'optimal', 'heat', 'engines', 'operating', 'within', 'finite', 'time', 'we', 'find', 'a', 'universal', 'constraint', 'between', 'efficiency', 'and', 'output', 'power', 'for', 'heat', 'engines', 'operating', 'in', 'the', 'lowdissipation', 'regime', 'such', 'constraint', 'is', 'validated', 'with', 'an', 'example', 'of', 'carnotlike', 'engine', 'its', 'microscopic', 'dynamics', 'is', 'governed', 'by', 'the', 'master', 'equation', 'based', 'on', 'the', 'master', 'equation', 'we', 'connect', 'the', 'microscopic', 'coupling', 'strengths', 'to', 'the', 'generic', 'parameters', 'in', 'the', 'phenomenological', 'model', 'we', 'find', 'the', 'usual', 'assumption', 'of', 'lowdissipation', 'is', 'achieved', 'when', 'the', 'coupling', 'to', 'thermal', 'environments', 'is', 'stronger', 'than', 'the', 'driving', 'speed', 'additionally', 'such', 'connection', 'allows', 'the', 'design', 'of', 'practical', 'cycle', 'to', 'optimize', 'the', 'engine', 'performance']] | [-0.16618794652659002, 0.06243118558011184, -0.042011394196963196, 0.03950674015571526, -0.12712253865982415, -0.16278579751661884, 0.10143089442249012, 0.34692214512257674, -0.28657857699473516, -0.32994484318710793, 0.06494207758191597, -0.2578875281990328, -0.09267789018639458, 0.30147247673268646, -0.004635757486840044, 0.07203918223540563, 0.015441023496859664, 0.05820372646862487, -0.04449801579322837, -0.15508556037867835, 0.2739809449193914, 0.12737488822686835, 0.34592231058669404, 0.07386581721895058, 0.13219637325494935, -0.04285782501272379, 0.0403989659143834, -0.006143697255521739, -0.12288350379094481, 0.04332535012001428, 0.2180202859838348, 0.09432348221489185, 0.25304250965971464, -0.4509001258555629, -0.2289319488330992, 0.10397971623124333, 0.0781140280588436, 0.059595579065707165, -0.03842656494336152, -0.18067301455201631, 0.05700758480629243, -0.15590425506405053, -0.09197385610431569, -0.052401775767633677, 0.022192631301324848, 0.05062295852758742, -0.30190892617160525, 0.06564373839561136, 0.0684018934470251, -0.005345038257949396, -0.040396844811733265, -0.040421444337404924, -0.0031352872456159066, 0.13244006125210495, -0.012593669136516203, -0.02861371970897831, 0.20193268865808298, -0.15834822506566934, -0.08515162258024472, 0.3847657812400422, -0.08510677438988158, -0.20614817328409318, 0.18005836848383172, -0.07938230901939469, -0.10212698787314083, 0.08146803481760648, 0.15423708955688967, 0.09362461645617534, -0.20695470069033636, 0.07602820223210158, 0.04265464279360625, 0.17563012743650705, -0.004052091537282691, 0.03196160974613297, 0.18698343269979803, 0.2585453263189165, 0.03781992687476338, 0.18843364348173688, -0.03641150923367854, -0.17456634767212556, -0.28938988456075343, -0.13842309285980572, -0.1809785920558412, 0.07518573798273408, -0.14168813791304374, -0.07470010953886998, 0.3801237477348485, 0.2109116618222463, 0.11921668086182796, 0.06990155620380827, 0.32383905065784213, 0.22092038497046798, 0.05128266844458434, 0.12352398672320564, 0.29630872479921905, 0.11096249496213956, 0.11654837054003953, -0.30430446266102684, 0.05848786421547379, 0.05972838903127939] |
1,802.09807 | Boyer-Lindquist space-times and beyond: Meta-material analogues | Analogue space-times (and in particular metamaterial analogue space-times)
have a long varied and complex history. Much of the previous related work has
focused on spherically symmetric models; however, axial symmetry is much more
relevant for mimicking rotating systems. It is well known that physically
reasonable stationary axisymmetric space-times can, under very mild technical
conditions, be put into Boyer--Lindquist form. Unfortunately, a metric
presented in Boyer--Lindquist form is not well adapted to the "quasi-Cartesian"
analysis that we developed in our previous articles on "bespoke analogue
space-times". Herein, we shall first focus specifically on various space-time
metrics presented in Boyer--Lindquist form, and subsequently determine a
suitable set of equivalent metamaterial susceptibility tensors in a laboratory
setting. We shall then turn to analyzing generic space-times, not even
necessarily stationary, again determining a suitable set of equivalent
metamaterial susceptibility tensors. Perhaps surprisingly, we find that the
well-known ADM formalism proves to be not particularly useful, and that instead
the dual "threaded" (Kaluza--Klein--inspired) formalism provides much more
tractable results. While the background laboratory metric is (for mathematical
simplicity and physical plausibility) always taken to be Riemann flat, we
{will} allow for arbitrary curvilinear coordinate systems on the flat
background space-time. Finally, for completeness, we shall reconsider
spherically symmetric space-times, but now in general spherical polar
coordinates rather than quasi-Cartesian coordinates. In summary, this article
provides a set of general-purpose calculational tools that can readily be
adapted for mimicking various interesting (curved) space-times by using
nontrivial susceptibility tensors in general (background-flat) laboratory
settings.
| gr-qc | analogue spacetimes and in particular metamaterial analogue spacetimes have a long varied and complex history much of the previous related work has focused on spherically symmetric models however axial symmetry is much more relevant for mimicking rotating systems it is well known that physically reasonable stationary axisymmetric spacetimes can under very mild technical conditions be put into boyerlindquist form unfortunately a metric presented in boyerlindquist form is not well adapted to the quasicartesian analysis that we developed in our previous articles on bespoke analogue spacetimes herein we shall first focus specifically on various spacetime metrics presented in boyerlindquist form and subsequently determine a suitable set of equivalent metamaterial susceptibility tensors in a laboratory setting we shall then turn to analyzing generic spacetimes not even necessarily stationary again determining a suitable set of equivalent metamaterial susceptibility tensors perhaps surprisingly we find that the wellknown adm formalism proves to be not particularly useful and that instead the dual threaded kaluzakleininspired formalism provides much more tractable results while the background laboratory metric is for mathematical simplicity and physical plausibility always taken to be riemann flat we will allow for arbitrary curvilinear coordinate systems on the flat background spacetime finally for completeness we shall reconsider spherically symmetric spacetimes but now in general spherical polar coordinates rather than quasicartesian coordinates in summary this article provides a set of generalpurpose calculational tools that can readily be adapted for mimicking various interesting curved spacetimes by using nontrivial susceptibility tensors in general backgroundflat laboratory settings | [['analogue', 'spacetimes', 'and', 'in', 'particular', 'metamaterial', 'analogue', 'spacetimes', 'have', 'a', 'long', 'varied', 'and', 'complex', 'history', 'much', 'of', 'the', 'previous', 'related', 'work', 'has', 'focused', 'on', 'spherically', 'symmetric', 'models', 'however', 'axial', 'symmetry', 'is', 'much', 'more', 'relevant', 'for', 'mimicking', 'rotating', 'systems', 'it', 'is', 'well', 'known', 'that', 'physically', 'reasonable', 'stationary', 'axisymmetric', 'spacetimes', 'can', 'under', 'very', 'mild', 'technical', 'conditions', 'be', 'put', 'into', 'boyerlindquist', 'form', 'unfortunately', 'a', 'metric', 'presented', 'in', 'boyerlindquist', 'form', 'is', 'not', 'well', 'adapted', 'to', 'the', 'quasicartesian', 'analysis', 'that', 'we', 'developed', 'in', 'our', 'previous', 'articles', 'on', 'bespoke', 'analogue', 'spacetimes', 'herein', 'we', 'shall', 'first', 'focus', 'specifically', 'on', 'various', 'spacetime', 'metrics', 'presented', 'in', 'boyerlindquist', 'form', 'and', 'subsequently', 'determine', 'a', 'suitable', 'set', 'of', 'equivalent', 'metamaterial', 'susceptibility', 'tensors', 'in', 'a', 'laboratory', 'setting', 'we', 'shall', 'then', 'turn', 'to', 'analyzing', 'generic', 'spacetimes', 'not', 'even', 'necessarily', 'stationary', 'again', 'determining', 'a', 'suitable', 'set', 'of', 'equivalent', 'metamaterial', 'susceptibility', 'tensors', 'perhaps', 'surprisingly', 'we', 'find', 'that', 'the', 'wellknown', 'adm', 'formalism', 'proves', 'to', 'be', 'not', 'particularly', 'useful', 'and', 'that', 'instead', 'the', 'dual', 'threaded', 'kaluzakleininspired', 'formalism', 'provides', 'much', 'more', 'tractable', 'results', 'while', 'the', 'background', 'laboratory', 'metric', 'is', 'for', 'mathematical', 'simplicity', 'and', 'physical', 'plausibility', 'always', 'taken', 'to', 'be', 'riemann', 'flat', 'we', 'will', 'allow', 'for', 'arbitrary', 'curvilinear', 'coordinate', 'systems', 'on', 'the', 'flat', 'background', 'spacetime', 'finally', 'for', 'completeness', 'we', 'shall', 'reconsider', 'spherically', 'symmetric', 'spacetimes', 'but', 'now', 'in', 'general', 'spherical', 'polar', 'coordinates', 'rather', 'than', 'quasicartesian', 'coordinates', 'in', 'summary', 'this', 'article', 'provides', 'a', 'set', 'of', 'generalpurpose', 'calculational', 'tools', 'that', 'can', 'readily', 'be', 'adapted', 'for', 'mimicking', 'various', 'interesting', 'curved', 'spacetimes', 'by', 'using', 'nontrivial', 'susceptibility', 'tensors', 'in', 'general', 'backgroundflat', 'laboratory', 'settings']] | [-0.12859517250552166, 0.07722683602906004, -0.09966597370993421, 0.129798148587175, -0.15558709004912905, -0.18263373855045256, -0.049363262782215464, 0.40085165451223753, -0.15377356355097524, -0.2276996881178371, 0.10183419012559616, -0.2092663420373764, -0.16439252393415235, 0.21808656081937405, -0.0848641176206744, 0.04215162881716553, 0.0240475418184954, 0.02143041690032245, -0.11195178832668735, -0.2244973669322778, 0.35655995971067067, 0.09531999008768068, 0.29052571612885414, 0.01224682954025968, 0.08015750820121291, 0.005494563081966979, -0.017567232353802847, 0.11084679184785606, -0.1358373485532012, 0.06774410695711873, 0.26889521825118096, 0.13536424742897554, 0.18355433335527777, -0.436988238427712, -0.2213664796735559, 0.09284488806567553, 0.16118036752794773, 0.14784991945643738, -0.053304166794037065, -0.2909375156332948, 0.06044710462874904, -0.16331985469774477, -0.17425269011636169, -0.14263554144251558, 0.05134502876055788, -0.05437890296417042, -0.21439899826156242, 0.04432139130147668, 0.0899801821445533, 0.03832537738976962, -0.10694042467607223, -0.09643973415356358, 0.027355053615091104, 0.04432685504078257, 0.04385754726423255, 0.027346009369559433, 0.1199797431686513, -0.04894916149930154, -0.05057322301056084, 0.4126137271095828, -0.041608178386600136, -0.31532534273455337, 0.17043406772332229, -0.16013189025071203, -0.1517349427071761, 0.0748305843620352, 0.1771379262056886, 0.19605779129897757, -0.18394274935126304, 0.11398498049082784, -0.06920671648255607, 0.1362843911496124, 0.12600874061487158, 0.025581691222626487, 0.2362315097728706, 0.08614767174882701, 0.04077144110366246, 0.15804056595839863, 0.035057168469137076, -0.11819321674850712, -0.3375614425290984, -0.1493021530638822, -0.1375254943434681, 0.10307229231177041, -0.11003201656317937, -0.17714444388141284, 0.34773775882049635, 0.1358716115374498, 0.11183518012795521, 0.03177842765723412, 0.2608276017238291, 0.05897453795965257, 0.04137924223347111, 0.09613522292703998, 0.2563893677683414, 0.13179774573262856, 0.11828430409125071, -0.1121681480174314, 0.016789092948394164, 0.05241003195394059] |
1,802.09808 | #DebateNight: The Role and Influence of Socialbots on Twitter During the
1st 2016 U.S. Presidential Debate | Serious concerns have been raised about the role of 'socialbots' in
manipulating public opinion and influencing the outcome of elections by
retweeting partisan content to increase its reach. Here we analyze the role and
influence of socialbots on Twitter by determining how they contribute to
retweet diffusions. We collect a large dataset of tweets during the 1st U.S.
Presidential Debate in 2016 (#DebateNight) and we analyze its 1.5 million users
from three perspectives: user influence, political behavior (partisanship and
engagement) and botness. First, we define a measure of user influence based on
the user's active contributions to information diffusions, i.e. their tweets
and retweets. Given that Twitter does not expose the retweet structure - it
associates all retweets with the original tweet - we model the latent diffusion
structure using only tweet time and user features, and we implement a scalable
novel approach to estimate influence over all possible unfoldings. Next, we use
partisan hashtag analysis to quantify user political polarization and
engagement. Finally, we use the BotOrNot API to measure user botness (the
likelihood of being a bot). We build a two-dimensional "polarization map" that
allows for a nuanced analysis of the interplay between botness, partisanship
and influence. We find that not only social bots are more active on Twitter -
starting more retweet cascades and retweeting more -- but they are 2.5 times
more influential than humans, and more politically engaged. Moreover,
pro-Republican bots are both more influential and more politically engaged than
their pro-Democrat counterparts. However we caution against blanket statements
that software designed to appear human dominates political debates. We find
that many highly influential Twitter users are in fact pro-Democrat and that
most pro-Republican users are mid-influential and likely to be human (low
botness).
| cs.SI | serious concerns have been raised about the role of socialbots in manipulating public opinion and influencing the outcome of elections by retweeting partisan content to increase its reach here we analyze the role and influence of socialbots on twitter by determining how they contribute to retweet diffusions we collect a large dataset of tweets during the 1st us presidential debate in 2016 debatenight and we analyze its 15 million users from three perspectives user influence political behavior partisanship and engagement and botness first we define a measure of user influence based on the users active contributions to information diffusions ie their tweets and retweets given that twitter does not expose the retweet structure it associates all retweets with the original tweet we model the latent diffusion structure using only tweet time and user features and we implement a scalable novel approach to estimate influence over all possible unfoldings next we use partisan hashtag analysis to quantify user political polarization and engagement finally we use the botornot api to measure user botness the likelihood of being a bot we build a twodimensional polarization map that allows for a nuanced analysis of the interplay between botness partisanship and influence we find that not only social bots are more active on twitter starting more retweet cascades and retweeting more but they are 25 times more influential than humans and more politically engaged moreover prorepublican bots are both more influential and more politically engaged than their prodemocrat counterparts however we caution against blanket statements that software designed to appear human dominates political debates we find that many highly influential twitter users are in fact prodemocrat and that most prorepublican users are midinfluential and likely to be human low botness | [['serious', 'concerns', 'have', 'been', 'raised', 'about', 'the', 'role', 'of', 'socialbots', 'in', 'manipulating', 'public', 'opinion', 'and', 'influencing', 'the', 'outcome', 'of', 'elections', 'by', 'retweeting', 'partisan', 'content', 'to', 'increase', 'its', 'reach', 'here', 'we', 'analyze', 'the', 'role', 'and', 'influence', 'of', 'socialbots', 'on', 'twitter', 'by', 'determining', 'how', 'they', 'contribute', 'to', 'retweet', 'diffusions', 'we', 'collect', 'a', 'large', 'dataset', 'of', 'tweets', 'during', 'the', '1st', 'us', 'presidential', 'debate', 'in', '2016', 'debatenight', 'and', 'we', 'analyze', 'its', '15', 'million', 'users', 'from', 'three', 'perspectives', 'user', 'influence', 'political', 'behavior', 'partisanship', 'and', 'engagement', 'and', 'botness', 'first', 'we', 'define', 'a', 'measure', 'of', 'user', 'influence', 'based', 'on', 'the', 'users', 'active', 'contributions', 'to', 'information', 'diffusions', 'ie', 'their', 'tweets', 'and', 'retweets', 'given', 'that', 'twitter', 'does', 'not', 'expose', 'the', 'retweet', 'structure', 'it', 'associates', 'all', 'retweets', 'with', 'the', 'original', 'tweet', 'we', 'model', 'the', 'latent', 'diffusion', 'structure', 'using', 'only', 'tweet', 'time', 'and', 'user', 'features', 'and', 'we', 'implement', 'a', 'scalable', 'novel', 'approach', 'to', 'estimate', 'influence', 'over', 'all', 'possible', 'unfoldings', 'next', 'we', 'use', 'partisan', 'hashtag', 'analysis', 'to', 'quantify', 'user', 'political', 'polarization', 'and', 'engagement', 'finally', 'we', 'use', 'the', 'botornot', 'api', 'to', 'measure', 'user', 'botness', 'the', 'likelihood', 'of', 'being', 'a', 'bot', 'we', 'build', 'a', 'twodimensional', 'polarization', 'map', 'that', 'allows', 'for', 'a', 'nuanced', 'analysis', 'of', 'the', 'interplay', 'between', 'botness', 'partisanship', 'and', 'influence', 'we', 'find', 'that', 'not', 'only', 'social', 'bots', 'are', 'more', 'active', 'on', 'twitter', 'starting', 'more', 'retweet', 'cascades', 'and', 'retweeting', 'more', 'but', 'they', 'are', '25', 'times', 'more', 'influential', 'than', 'humans', 'and', 'more', 'politically', 'engaged', 'moreover', 'prorepublican', 'bots', 'are', 'both', 'more', 'influential', 'and', 'more', 'politically', 'engaged', 'than', 'their', 'prodemocrat', 'counterparts', 'however', 'we', 'caution', 'against', 'blanket', 'statements', 'that', 'software', 'designed', 'to', 'appear', 'human', 'dominates', 'political', 'debates', 'we', 'find', 'that', 'many', 'highly', 'influential', 'twitter', 'users', 'are', 'in', 'fact', 'prodemocrat', 'and', 'that', 'most', 'prorepublican', 'users', 'are', 'midinfluential', 'and', 'likely', 'to', 'be', 'human', 'low', 'botness']] | [-0.09408514550428063, 0.08135238610538503, -0.07805874324854344, 0.14914604221423922, -0.20565965755735807, -0.16857103693322362, 0.12849880552159682, 0.44492629998260075, -0.1935438032359666, -0.33574260427452973, 0.051193089939163175, -0.4018225208164037, -0.21518435818685627, 0.15616126115299098, -0.06524418880136543, -0.04758097164710069, 0.03937508099000535, 0.06315814294788893, 0.02734782689607345, -0.3394677889780358, 0.30978904539839397, 0.0690058622188786, 0.29719930027000685, 0.07278860557997953, 0.047457870403071034, 0.002409310937995979, -0.11473431541041161, -0.002806606196371111, -0.1001553898382019, 0.14499699536295388, 0.3239889667347728, 0.2228959207948778, 0.37724661271798837, -0.40936417933753744, -0.15892351154691964, 0.08864345490276533, 0.12163647407028276, 0.09130785050430572, -0.005485691136159387, -0.3530274339013576, 0.09544513163976305, -0.22952115221623345, -0.03352454694749046, -0.10397277152588037, 0.041071344918060686, -0.0034200172186211607, -0.18671344585698366, 0.053520769319800814, 0.030036968053869344, 0.10718443155078815, -0.015257990446090232, -0.05463410798133948, -0.03679670313186276, 0.24194264728041853, 0.11122605506302355, -0.038962679037634, 0.2127402802903412, -0.15555989882144342, -0.14208207064054532, 0.3862890788090272, -0.014353820385547408, -0.14780471970971445, 0.19114957210577785, -0.11348402407270686, -0.15077275510770552, 0.061735704387654966, 0.2830306797498657, 0.10519753100601272, -0.16464788564706162, -0.09427131455123348, -0.058664713074923845, 0.21893415721442122, 0.08450551196185065, 0.0023399576103301403, 0.18787775446049948, 0.15481356198638244, 0.06595438874600368, 0.06691971642514323, -0.04361672252066113, -0.09352734120830553, -0.1647639835627222, -0.11878751865654891, -0.10676654325180611, 0.05434474359881083, -0.08086751626999956, -0.10551682758682464, 0.41243767686268334, 0.22125157001712042, 0.14913520245148557, 0.04026317754660242, 0.229778745886369, -0.013751286734563155, 0.034387368875544014, 0.1205736464673927, 0.166983298873896, -6.811553111640356e-06, 0.17977278050340673, -0.14539978704014692, 0.17349590965330527, -0.0398826579823898] |
1,802.09809 | Optimal Impulse Control of Dynamical Systems | Using the tools of the Markov Decision Processes, we justify the dynamic
programming approach to the optimal impulse control of deterministic dynamical
systems. We prove the equivalence of the integral and differential forms of the
optimality equation. The theory is illustrated by an example from mathematical
epidemiology. The developed methods can be also useful for the study of
piecewise deterministic Markov processes.
| math.OC | using the tools of the markov decision processes we justify the dynamic programming approach to the optimal impulse control of deterministic dynamical systems we prove the equivalence of the integral and differential forms of the optimality equation the theory is illustrated by an example from mathematical epidemiology the developed methods can be also useful for the study of piecewise deterministic markov processes | [['using', 'the', 'tools', 'of', 'the', 'markov', 'decision', 'processes', 'we', 'justify', 'the', 'dynamic', 'programming', 'approach', 'to', 'the', 'optimal', 'impulse', 'control', 'of', 'deterministic', 'dynamical', 'systems', 'we', 'prove', 'the', 'equivalence', 'of', 'the', 'integral', 'and', 'differential', 'forms', 'of', 'the', 'optimality', 'equation', 'the', 'theory', 'is', 'illustrated', 'by', 'an', 'example', 'from', 'mathematical', 'epidemiology', 'the', 'developed', 'methods', 'can', 'be', 'also', 'useful', 'for', 'the', 'study', 'of', 'piecewise', 'deterministic', 'markov', 'processes']] | [-0.07453267177146289, 0.030039328024882236, -0.12358130271276159, 0.14450095380814146, -0.08537225223957531, -0.11418084246895066, 0.06846572939989969, 0.3454948355323605, -0.36908808389994047, -0.22689933293769438, 0.16952387964533222, -0.20456739004340865, -0.22576655970225412, 0.2281722427916623, -0.054970201916031296, 0.15613775769428861, 0.02030604212514816, 0.011771616045265429, -0.03426536056213081, -0.21038454242290988, 0.33422315251758145, 0.021843120801232515, 0.24300292314540956, -0.00195577371144487, 0.19052350917650807, 0.05357632683139415, -0.03984872121814518, 0.004033877204487761, -0.1647630765388209, 0.12582237587400502, 0.31764211422658617, 0.18125503517371871, 0.32515499610904486, -0.4299960755292446, -0.2197929509434729, 0.06910770922718991, 0.09374920780500097, 0.13141575628410904, -0.0033730268215520246, -0.3294964132289733, 0.036860354259730346, -0.1424311066587125, -0.14302638987635052, -0.08263568974460565, -0.048728411326244954, 0.0686667037249032, -0.313222452847948, 0.02499318239607683, 0.08276975460607754, 0.09150099413349264, -0.08424419609289016, -0.08591318553343656, 0.004597358811166017, 0.11819480667867127, 0.011105256181420577, -0.06707302008890698, 0.12469831350890379, -0.0761669764911095, -0.24104928819748062, 0.33744282984445173, -0.06317216368775154, -0.23186032864595613, 0.1841786955858791, -0.06618747982617107, -0.16208009864203632, 0.14213752970399876, 0.21321786038817897, 0.15640942521032788, -0.24576192041258177, 0.14984755899903604, -0.016172048170119524, 0.1260919815470134, -0.006281930157133649, -0.037133966842966694, 0.10024820569331848, 0.1980912711230978, 0.07342642113085716, 0.17363250181041356, 0.029557351233257402, -0.1937585336366488, -0.3010337413438866, -0.16707809972426585, -0.12187226948087974, 0.025826696066125747, -0.13520850262190628, -0.16672119354048082, 0.3313922155498257, 0.1908465683565385, 0.07520512954121636, 0.1203875383474834, 0.28971135165662537, 0.23639078996700025, -0.036484541341422067, 0.06464797298183604, 0.17691356643673875, 0.20143522603452327, 0.0978343929539645, -0.2349618695067963, 0.12008519976159497, 0.10111282603634943] |
1,802.0981 | Human-in-the-Loop Synthesis for Partially Observable Markov Decision
Processes | We study planning problems where autonomous agents operate inside
environments that are subject to uncertainties and not fully observable.
Partially observable Markov decision processes (POMDPs) are a natural formal
model to capture such problems. Because of the potentially huge or even
infinite belief space in POMDPs, synthesis with safety guarantees is, in
general, computationally intractable. We propose an approach that aims to
circumvent this difficulty: in scenarios that can be partially or fully
simulated in a virtual environment, we actively integrate a human user to
control an agent. While the user repeatedly tries to safely guide the agent in
the simulation, we collect data from the human input. Via behavior cloning, we
translate the data into a strategy for the POMDP. The strategy resolves all
nondeterminism and non-observability of the POMDP, resulting in a discrete-time
Markov chain (MC). The efficient verification of this MC gives quantitative
insights into the quality of the inferred human strategy by proving or
disproving given system specifications. For the case that the quality of the
strategy is not sufficient, we propose a refinement method using
counterexamples presented to the human. Experiments show that by including
humans into the POMDP verification loop we improve the state of the art by
orders of magnitude in terms of scalability.
| cs.AI | we study planning problems where autonomous agents operate inside environments that are subject to uncertainties and not fully observable partially observable markov decision processes pomdps are a natural formal model to capture such problems because of the potentially huge or even infinite belief space in pomdps synthesis with safety guarantees is in general computationally intractable we propose an approach that aims to circumvent this difficulty in scenarios that can be partially or fully simulated in a virtual environment we actively integrate a human user to control an agent while the user repeatedly tries to safely guide the agent in the simulation we collect data from the human input via behavior cloning we translate the data into a strategy for the pomdp the strategy resolves all nondeterminism and nonobservability of the pomdp resulting in a discretetime markov chain mc the efficient verification of this mc gives quantitative insights into the quality of the inferred human strategy by proving or disproving given system specifications for the case that the quality of the strategy is not sufficient we propose a refinement method using counterexamples presented to the human experiments show that by including humans into the pomdp verification loop we improve the state of the art by orders of magnitude in terms of scalability | [['we', 'study', 'planning', 'problems', 'where', 'autonomous', 'agents', 'operate', 'inside', 'environments', 'that', 'are', 'subject', 'to', 'uncertainties', 'and', 'not', 'fully', 'observable', 'partially', 'observable', 'markov', 'decision', 'processes', 'pomdps', 'are', 'a', 'natural', 'formal', 'model', 'to', 'capture', 'such', 'problems', 'because', 'of', 'the', 'potentially', 'huge', 'or', 'even', 'infinite', 'belief', 'space', 'in', 'pomdps', 'synthesis', 'with', 'safety', 'guarantees', 'is', 'in', 'general', 'computationally', 'intractable', 'we', 'propose', 'an', 'approach', 'that', 'aims', 'to', 'circumvent', 'this', 'difficulty', 'in', 'scenarios', 'that', 'can', 'be', 'partially', 'or', 'fully', 'simulated', 'in', 'a', 'virtual', 'environment', 'we', 'actively', 'integrate', 'a', 'human', 'user', 'to', 'control', 'an', 'agent', 'while', 'the', 'user', 'repeatedly', 'tries', 'to', 'safely', 'guide', 'the', 'agent', 'in', 'the', 'simulation', 'we', 'collect', 'data', 'from', 'the', 'human', 'input', 'via', 'behavior', 'cloning', 'we', 'translate', 'the', 'data', 'into', 'a', 'strategy', 'for', 'the', 'pomdp', 'the', 'strategy', 'resolves', 'all', 'nondeterminism', 'and', 'nonobservability', 'of', 'the', 'pomdp', 'resulting', 'in', 'a', 'discretetime', 'markov', 'chain', 'mc', 'the', 'efficient', 'verification', 'of', 'this', 'mc', 'gives', 'quantitative', 'insights', 'into', 'the', 'quality', 'of', 'the', 'inferred', 'human', 'strategy', 'by', 'proving', 'or', 'disproving', 'given', 'system', 'specifications', 'for', 'the', 'case', 'that', 'the', 'quality', 'of', 'the', 'strategy', 'is', 'not', 'sufficient', 'we', 'propose', 'a', 'refinement', 'method', 'using', 'counterexamples', 'presented', 'to', 'the', 'human', 'experiments', 'show', 'that', 'by', 'including', 'humans', 'into', 'the', 'pomdp', 'verification', 'loop', 'we', 'improve', 'the', 'state', 'of', 'the', 'art', 'by', 'orders', 'of', 'magnitude', 'in', 'terms', 'of', 'scalability']] | [-0.07465335986493112, 0.07649911202226051, -0.07824063791023894, 0.08867522915429035, -0.11984959465530988, -0.13249808461162574, 0.08862364838662297, 0.4218580827108139, -0.2933541896236593, -0.32420184048360556, 0.11420522682794693, -0.20883880869233848, -0.13278317836971767, 0.18090685197042955, -0.1377369327453005, 0.09273988344006999, 0.10064732615827136, 0.014310246819003499, 0.012289750570170935, -0.25107998963968464, 0.2932292953137997, 0.04082175493637603, 0.26676666991392334, 0.008790127885576461, 0.1337321820609289, 0.0273382841947078, 0.004385007363280626, 0.01986068854165281, -0.08593959021424104, 0.12522524048549993, 0.3430140292905359, 0.22564841479380832, 0.3334362118337215, -0.4472073559071074, -0.1927373789392094, 0.11321360991349923, 0.13175830243555917, 0.12272444382415847, -0.011856827946706406, -0.344854078885671, 0.0850646563207563, -0.17904115820930327, -0.07057154500168435, -0.09679933045041787, -0.06854633527026639, -0.04025341333325961, -0.30107282044010686, -0.02873107013336749, 0.08436833149356264, 0.02875311558368788, -0.06694489061143867, -0.06372554616790742, 0.02564155951228381, 0.17076669953061682, 0.02384834325380217, -0.007091087471225886, 0.13408171509776565, -0.1584574515706202, -0.19337782210568893, 0.3766239572093509, -0.01236060637014066, -0.2277846481911485, 0.1979608480803121, -0.08894200298396684, -0.16364050577107764, 0.15267959487805435, 0.20691326440486316, 0.11815932095359781, -0.2005366679905556, 0.06885285870121324, -0.03221083321648328, 0.19002756901235449, -0.017505052522645812, -0.01550500519365134, 0.18145285092373664, 0.21030113039321985, 0.09342456278964983, 0.16117956343833004, 0.003160235987340599, -0.13829989765519143, -0.24769834125352697, -0.14575766797176942, -0.12662441102331018, 0.010372314479100513, -0.060629904837214046, -0.1432893527097894, 0.32560289163700795, 0.24698625800409343, 0.17735828116637659, 0.10215474052963805, 0.3651906926520345, 0.10381843439293408, 0.03282240039108418, 0.08078748753991737, 0.17840295219220115, 0.014174276864668134, 0.08706929989631389, -0.2264251541335277, 0.16702309656630035, 0.038418596635392745] |
1,802.09811 | Four-manifolds up to connected sum with complex projective planes | We show that closed, connected 4-manifolds up to connected sum with copies of
the complex projective plane are classified in terms of the fundamental group,
the orientation character and an extension class involving the second homotopy
group. For fundamental groups that are torsion free or have one end, we reduce
this further to a classification in terms of the homotopy 2-type.
| math.GT math.AT | we show that closed connected 4manifolds up to connected sum with copies of the complex projective plane are classified in terms of the fundamental group the orientation character and an extension class involving the second homotopy group for fundamental groups that are torsion free or have one end we reduce this further to a classification in terms of the homotopy 2type | [['we', 'show', 'that', 'closed', 'connected', '4manifolds', 'up', 'to', 'connected', 'sum', 'with', 'copies', 'of', 'the', 'complex', 'projective', 'plane', 'are', 'classified', 'in', 'terms', 'of', 'the', 'fundamental', 'group', 'the', 'orientation', 'character', 'and', 'an', 'extension', 'class', 'involving', 'the', 'second', 'homotopy', 'group', 'for', 'fundamental', 'groups', 'that', 'are', 'torsion', 'free', 'or', 'have', 'one', 'end', 'we', 'reduce', 'this', 'further', 'to', 'a', 'classification', 'in', 'terms', 'of', 'the', 'homotopy', '2type']] | [-0.18566659740248664, 0.09022729165425532, -0.02519159413660403, 0.00466124191078678, -0.11024478166440471, -0.08573188847999592, 0.003953786276769442, 0.3783751072545276, -0.32349001518527015, -0.2657319691154312, 0.10059688350979666, -0.24029760036739659, -0.1406306798424816, 0.2017374466761153, -0.13343275870868296, -0.07442795726485917, 0.02562404565558937, 0.15347324713270682, -0.06501180206837713, -0.3018919755323011, 0.4088145776911349, -0.10044346474966065, 0.23432880274144663, 0.030670350562536815, 0.08581116818441231, 0.0009634753109001722, -0.022659292291910924, 0.047879459916568196, -0.09869822489644485, 0.17320202959731953, 0.28786210914249305, 0.0243131836845738, 0.17730147863326015, -0.36931477618388464, -0.18110323588928726, 0.20456407730635562, 0.1645163485902499, 0.007716691976443666, -0.016788121274687717, -0.28331826883749883, 0.14489169795157725, -0.17248310876979692, -0.12481626959853485, -0.087425277308851, 0.004691169246054086, 0.021628062691173105, -0.15273003148861597, 0.004150943597778678, 0.05099565635786438, 0.07391916560467149, -0.055601131052664315, -0.05899023658550177, -0.023974105944765397, 0.18935865354266201, 0.023985195355337174, 0.052145108679828585, 0.0760381895835038, -0.10903757649901338, -0.1476161286509672, 0.41713153654862134, -0.039658940672019465, -0.2505224314212921, 0.18106288798764103, -0.13168000397043395, -0.2193245956460472, 0.15777292864427703, 0.12827385464286217, 0.14184399291140135, -0.0612675363625415, 0.12291881251129795, -0.0753329662132825, 0.0995238476173311, 0.08167021417776581, -0.026033785331566802, 0.157773652373523, 0.11575702108351178, 0.09495265979212938, 0.1451168405960818, 0.012275439763411146, -0.05301567736524539, -0.35841186265232133, -0.2419437718898302, -0.10199621471874111, 0.11205712758523763, -0.0993082167914225, -0.18252589386032864, 0.43165627915839677, 0.036520854157746814, 0.1625057406738767, 0.11718060964810066, 0.24304232850182253, 0.06975959332995728, 0.08872607362563492, 0.05049034892047038, 0.16457930569475915, 0.2056833189515183, -0.10716285558081552, -0.13882618530731664, -0.04496758486159512, 0.1719916619390982] |
1,802.09812 | Aldebaran b's temperate past uncovered in planet search data | The nearby red giant Aldebaran is known to host a gas giant planetary
companion from decades of ground-based spectroscopic radial velocity
measurements. Using Gaussian Process-based Continuous Auto-Regressive Moving
Average (CARMA) models, we show that these historic data also contain evidence
of acoustic oscillations in the star itself, and verify this result with
further dedicated ground-based spectroscopy and space-based photometry with the
Kepler Space Telescope. From the frequency of these oscillations we determine
the mass of Aldebaran to be $1.16 \pm 0.07 \, M_\odot$, and note that this
implies its planet will have been subject to insolation comparable to the Earth
for some of the star's main sequence lifetime. Our approach to sparse,
irregularly sampled time series astronomical observations has the potential to
unlock asteroseismic measurements for thousands of stars in archival data, and
push to lower-mass planets around red giant stars.
| astro-ph.SR astro-ph.EP | the nearby red giant aldebaran is known to host a gas giant planetary companion from decades of groundbased spectroscopic radial velocity measurements using gaussian processbased continuous autoregressive moving average carma models we show that these historic data also contain evidence of acoustic oscillations in the star itself and verify this result with further dedicated groundbased spectroscopy and spacebased photometry with the kepler space telescope from the frequency of these oscillations we determine the mass of aldebaran to be 116 pm 007 m_odot and note that this implies its planet will have been subject to insolation comparable to the earth for some of the stars main sequence lifetime our approach to sparse irregularly sampled time series astronomical observations has the potential to unlock asteroseismic measurements for thousands of stars in archival data and push to lowermass planets around red giant stars | [['the', 'nearby', 'red', 'giant', 'aldebaran', 'is', 'known', 'to', 'host', 'a', 'gas', 'giant', 'planetary', 'companion', 'from', 'decades', 'of', 'groundbased', 'spectroscopic', 'radial', 'velocity', 'measurements', 'using', 'gaussian', 'processbased', 'continuous', 'autoregressive', 'moving', 'average', 'carma', 'models', 'we', 'show', 'that', 'these', 'historic', 'data', 'also', 'contain', 'evidence', 'of', 'acoustic', 'oscillations', 'in', 'the', 'star', 'itself', 'and', 'verify', 'this', 'result', 'with', 'further', 'dedicated', 'groundbased', 'spectroscopy', 'and', 'spacebased', 'photometry', 'with', 'the', 'kepler', 'space', 'telescope', 'from', 'the', 'frequency', 'of', 'these', 'oscillations', 'we', 'determine', 'the', 'mass', 'of', 'aldebaran', 'to', 'be', '116', 'pm', '007', 'm_odot', 'and', 'note', 'that', 'this', 'implies', 'its', 'planet', 'will', 'have', 'been', 'subject', 'to', 'insolation', 'comparable', 'to', 'the', 'earth', 'for', 'some', 'of', 'the', 'stars', 'main', 'sequence', 'lifetime', 'our', 'approach', 'to', 'sparse', 'irregularly', 'sampled', 'time', 'series', 'astronomical', 'observations', 'has', 'the', 'potential', 'to', 'unlock', 'asteroseismic', 'measurements', 'for', 'thousands', 'of', 'stars', 'in', 'archival', 'data', 'and', 'push', 'to', 'lowermass', 'planets', 'around', 'red', 'giant', 'stars']] | [-0.0587736109708203, 0.14042443125841342, -0.09295879027007946, 0.02654855771439283, -0.15791373755450228, -0.046076562721282244, 0.08409809592724611, 0.4041250833576279, -0.16677215613557825, -0.3637978682693626, 0.1050346332801772, -0.33565071042227956, -0.07835326056395259, 0.24662070224128133, -0.09704858385292547, 0.04638319968154454, 0.17899365990555713, -0.03756172438152135, -0.013417842126052295, -0.2734829666824745, 0.22961859102360904, 0.05135469165564115, 0.10403349133640794, -0.08477518548523741, 0.021270773447966868, -0.11375091750773468, -0.09193462313352418, -0.09640445042937894, -0.17697135546591847, 0.03751079854888043, 0.2441109781572647, 0.16767216903390364, 0.24332727203145624, -0.3714882626464324, -0.2221927554213575, 0.0922469154497646, 0.19055494015337898, 0.02279566022168313, -0.04537993165098929, -0.326376038151128, 0.06841419627391068, -0.16961621044985284, -0.21810575322514134, 0.004616714960762432, 0.07499654958623328, 0.05898218871027763, -0.25181025713682176, 0.10160980483113755, -0.0006540217569896153, 0.15198651031990137, -0.16100899569573812, -0.13344493541933064, -0.05195786283002235, 0.10425074207097558, 0.05054535313476143, 0.07674627245869488, 0.09250961572730115, -0.04224779864972723, -0.008394667317458828, 0.3588983685493336, -0.13884717007832867, -0.001832828451214092, 0.22017125376234098, -0.2482044649809333, -0.19543180872819255, 0.1121805530407333, 0.20194563161182616, 0.1244966078582885, -0.1834238771374138, -0.02665651117318443, 0.0034476142659384226, 0.19411877001901823, 0.07421490776219539, 0.07633250836682107, 0.3601212510173874, 0.14452823465690018, 0.04102060063908409, 0.050877146255723864, -0.3012277565098235, -0.01943306338507682, -0.17302763177348035, -0.09734687131297376, -0.18550681214047862, 0.07618084200657904, -0.10338347426981533, -0.12612508671092135, 0.33302895860813025, 0.173392141304378, 0.17420064884770128, 0.05453495078420799, 0.34295069825436386, 0.06341542255915036, 0.14237669161188282, 0.07496138307365723, 0.3125869772640207, 0.17825589006466283, 0.12634748898313514, -0.2305378872635109, 0.027308956683347266, -0.04622068126918748] |
1,802.09813 | Correlators between Wilson loop and chiral operators in N=2 conformal
gauge theories | We consider conformal N=2 super Yang-Mills theories with gauge group SU(N)
and Nf=2N fundamental hypermultiplets in presence of a circular 1/2-BPS Wilson
loop. It is natural to conjecture that the matrix model which describes the
expectation value of this system also encodes the one-point functions of chiral
scalar operators in presence of the Wilson loop. We obtain evidence of this
conjecture by successfully comparing, at finite N and at the two-loop order,
the one-point functions computed in field theory with the vacuum expectation
values of the corresponding normal-ordered operators in the matrix model. For
the part of these expressions with transcendentality zeta(3), we also obtain
results in the large-N limit that are exact in the 't Hooft coupling lambda.
| hep-th | we consider conformal n2 super yangmills theories with gauge group sun and nf2n fundamental hypermultiplets in presence of a circular 12bps wilson loop it is natural to conjecture that the matrix model which describes the expectation value of this system also encodes the onepoint functions of chiral scalar operators in presence of the wilson loop we obtain evidence of this conjecture by successfully comparing at finite n and at the twoloop order the onepoint functions computed in field theory with the vacuum expectation values of the corresponding normalordered operators in the matrix model for the part of these expressions with transcendentality zeta3 we also obtain results in the largen limit that are exact in the t hooft coupling lambda | [['we', 'consider', 'conformal', 'n2', 'super', 'yangmills', 'theories', 'with', 'gauge', 'group', 'sun', 'and', 'nf2n', 'fundamental', 'hypermultiplets', 'in', 'presence', 'of', 'a', 'circular', '12bps', 'wilson', 'loop', 'it', 'is', 'natural', 'to', 'conjecture', 'that', 'the', 'matrix', 'model', 'which', 'describes', 'the', 'expectation', 'value', 'of', 'this', 'system', 'also', 'encodes', 'the', 'onepoint', 'functions', 'of', 'chiral', 'scalar', 'operators', 'in', 'presence', 'of', 'the', 'wilson', 'loop', 'we', 'obtain', 'evidence', 'of', 'this', 'conjecture', 'by', 'successfully', 'comparing', 'at', 'finite', 'n', 'and', 'at', 'the', 'twoloop', 'order', 'the', 'onepoint', 'functions', 'computed', 'in', 'field', 'theory', 'with', 'the', 'vacuum', 'expectation', 'values', 'of', 'the', 'corresponding', 'normalordered', 'operators', 'in', 'the', 'matrix', 'model', 'for', 'the', 'part', 'of', 'these', 'expressions', 'with', 'transcendentality', 'zeta3', 'we', 'also', 'obtain', 'results', 'in', 'the', 'largen', 'limit', 'that', 'are', 'exact', 'in', 'the', 't', 'hooft', 'coupling', 'lambda']] | [-0.1433385337875107, 0.18001779441099552, -0.050146540959131854, 0.07352958965025247, 2.1221507497194434e-05, -0.11073762575602707, 0.0007063380350601397, 0.30784210329484035, -0.15567318532623725, -0.25520497499456424, 0.07097620182639348, -0.28951846519798163, -0.1773878089915335, 0.09355167803910225, 0.005739435463548959, 0.06648423594235298, 0.004021560187019142, 0.10889200859374422, -0.11542049267509279, -0.2568542153570613, 0.3437736772016442, -5.545945321561909e-05, 0.22502112954056688, 0.10734242927517836, 0.08105396030924651, 0.014067456351217478, -0.005810433530107829, -0.020688929293742952, -0.08259871166980602, 0.11902528378120505, 0.21385781774140833, 0.05082659075279258, 0.13977115201771634, -0.40663979044418874, -0.1596652615165823, 0.1016280673328834, 0.1520583166099083, 0.11064141930742268, 0.03782124826175889, -0.25038043074231564, 0.0885487017163052, -0.16556513010712043, -0.21571066175849654, -0.08725117037010167, 0.013907609778425084, -0.10861296777245628, -0.3166301092680763, 0.07941053844274201, -0.02372050199250714, 0.04348432772769397, -0.04294267347465981, -0.1263737829055778, -0.038141966621321036, 0.12350024767767857, 0.11630656187395182, 0.05171414566355437, 0.08048142132372792, -0.21355806790808796, -0.13609373981637896, 0.34507507783118163, -0.13933884294042284, -0.20325397736903578, 0.08723440432154081, -0.2437867222377295, -0.19106901351346814, 0.07612154542646046, 0.08461717075957846, 0.16541110955867447, -0.09994413873509449, 0.2409909251312326, -0.11189877449734402, 0.09381804069868062, 0.0939677193439996, 0.022317340331418172, 0.20587866313505074, 0.02991485775706648, 0.024686099538783066, 0.15837969299319724, 0.01655964755273166, -0.13001417013926103, -0.42006653293716806, -0.12785326659839852, -0.12934838166898666, 0.07121242800171823, -0.18936330002919427, -0.20533102044068716, 0.364217908270344, 0.1761846425408691, 0.18722301721181564, 0.1277756898521109, 0.21261556994389086, 0.1897986851996515, 0.10496055995341108, 0.07532890377754048, 0.21526965459793054, 0.2179020382170448, 0.07680926408849563, -0.27306932761889546, -0.08639900023978547, 0.23062687067064544] |
1,802.09814 | Trimmed L\'evy Processes and their Extremal Components | We analyse a trimmed stochastic process of the form ${}^{(r)}X_t= X_t -
\sum_{i=1}^r \Delta_t^{(i)}$, where $(X_t)_{t \geq 0}$ is a driftless
subordinator on $\mathbb{R}$ with its jumps on $[0,t]$ ordered as $
\Delta_t^{(1)}\ge \Delta_t^{(2)} \cdots$. When $r\to\infty$, both ${}^{(r)}X_t
\to 0$ and $\Delta_t^{(r)} \to 0$ a.s. for each $t>0$, and it is interesting to
study the weak limiting behaviour of $\bigl({}^{(r)}X_t, \Delta_t^{(r)}\bigr)$
in this case. We term this "large-trimming" behaviour. Concentrating on the
case $t=1$, we study joint convergence of $\bigl({}^{(r)}X_1,
\Delta_1^{(r)}\bigr)$ under linear normalization, assuming extreme
value-related conditions on the L\'evy measure of $X$ which guarantee that
$\Delta_1^{(r)}$ has a limit distribution with linear normalization. Allowing
${}^{(r)}X_1$ to have random centering and scaling in a natural way, we show
that $\bigl({}^{(r)}X_1, \Delta_1^{(r)}\bigr)$ has a bivariate normal limiting
distribution, as $r\to\infty$; but replacing the random normalizations with
natural deterministic ones produces non-normal limits which we can specify.
| math.PR | we analyse a trimmed stochastic process of the form rx_t x_t sum_i1r delta_ti where x_t_t geq 0 is a driftless subordinator on mathbbr with its jumps on 0t ordered as delta_t1ge delta_t2 cdots when rtoinfty both rx_t to 0 and delta_tr to 0 as for each t0 and it is interesting to study the weak limiting behaviour of biglrx_t delta_trbigr in this case we term this largetrimming behaviour concentrating on the case t1 we study joint convergence of biglrx_1 delta_1rbigr under linear normalization assuming extreme valuerelated conditions on the levy measure of x which guarantee that delta_1r has a limit distribution with linear normalization allowing rx_1 to have random centering and scaling in a natural way we show that biglrx_1 delta_1rbigr has a bivariate normal limiting distribution as rtoinfty but replacing the random normalizations with natural deterministic ones produces nonnormal limits which we can specify | [['we', 'analyse', 'a', 'trimmed', 'stochastic', 'process', 'of', 'the', 'form', 'rx_t', 'x_t', 'sum_i1r', 'delta_ti', 'where', 'x_t_t', 'geq', '0', 'is', 'a', 'driftless', 'subordinator', 'on', 'mathbbr', 'with', 'its', 'jumps', 'on', '0t', 'ordered', 'as', 'delta_t1ge', 'delta_t2', 'cdots', 'when', 'rtoinfty', 'both', 'rx_t', 'to', '0', 'and', 'delta_tr', 'to', '0', 'as', 'for', 'each', 't0', 'and', 'it', 'is', 'interesting', 'to', 'study', 'the', 'weak', 'limiting', 'behaviour', 'of', 'biglrx_t', 'delta_trbigr', 'in', 'this', 'case', 'we', 'term', 'this', 'largetrimming', 'behaviour', 'concentrating', 'on', 'the', 'case', 't1', 'we', 'study', 'joint', 'convergence', 'of', 'biglrx_1', 'delta_1rbigr', 'under', 'linear', 'normalization', 'assuming', 'extreme', 'valuerelated', 'conditions', 'on', 'the', 'levy', 'measure', 'of', 'x', 'which', 'guarantee', 'that', 'delta_1r', 'has', 'a', 'limit', 'distribution', 'with', 'linear', 'normalization', 'allowing', 'rx_1', 'to', 'have', 'random', 'centering', 'and', 'scaling', 'in', 'a', 'natural', 'way', 'we', 'show', 'that', 'biglrx_1', 'delta_1rbigr', 'has', 'a', 'bivariate', 'normal', 'limiting', 'distribution', 'as', 'rtoinfty', 'but', 'replacing', 'the', 'random', 'normalizations', 'with', 'natural', 'deterministic', 'ones', 'produces', 'nonnormal', 'limits', 'which', 'we', 'can', 'specify']] | [-0.10084880955160168, 0.1113827024985637, -0.10896178888843248, 0.04461502872240965, -0.05122151291102899, -0.16360433391974608, 0.046436444338046966, 0.39358451602546346, -0.2802200099607383, -0.1704731484020787, 0.13718593487677103, -0.2886696606314272, -0.10988322046543367, 0.1492693991211236, -0.08124294594504443, 0.05603635728427496, -0.0020283943101679696, 0.07185281434663593, -0.06520734139704111, -0.21403121940014339, 0.3035996965766373, -0.027211481817346766, 0.23646244131504818, -0.02895107025261338, 0.1462196553777203, 0.01588559499066463, 0.0372694516742665, -0.013820569335983688, -0.1734678131197553, 0.01002101656889781, 0.18894011351451473, 0.07543931122435103, 0.2899593556881007, -0.3489911047500187, -0.16483937850733169, 0.19906556065005243, 0.16111681369440525, 0.00872604038979494, 0.013265570811227076, -0.26486418687185287, 0.12021972409176424, -0.11054231710311838, -0.1416137968128743, -0.08604410211765733, 0.08034018050052953, 0.0914184099668987, -0.35937119087666497, 0.08087404278068475, 0.1515370381477856, 0.023501282382784483, -0.01959695202505034, -0.13629270632772295, -0.001676195036773955, 0.08964497935577449, 0.08960241344875544, 0.02052583635777683, 0.09854282489763327, -0.0937395909296951, -0.045423127453480115, 0.34385070594769895, -0.13575909616201556, -0.2304517508316365, 0.15330311219747128, -0.2085112998808237, -0.17805053357076936, 0.06701953440232385, 0.14436013654882746, 0.1294758699771325, -0.12093535688746444, 0.16032367030069358, -0.055489818971688136, 0.10428894718730808, 0.10305944462551882, 0.0027377818311963764, 0.10277889745968177, 0.16603776867850684, 0.12113094180857384, 0.1421862836013359, -0.06849411437357951, -0.09741950601766489, -0.3386624643677159, -0.1330680429193198, -0.17261942359443783, 0.17131203421587615, -0.12805610851008756, -0.19910501466654382, 0.31570419762808744, 0.1225775297935982, 0.25117104391994555, 0.15170417686301121, 0.20652562373534852, 0.18920693044897338, -0.03132337815551914, 0.06438138630045087, 0.10226631621108916, 0.11548517104518369, 0.0801637859146734, -0.15426091488391244, 0.1112584924324034, 0.04082564645467844] |
1,802.09815 | Elmo: Source-Routed Multicast for Cloud Services | We present Elmo, a system that addresses the multicast scalability problem in
multi-tenant data centers. Modern cloud applications frequently exhibit
one-to-many communication patterns and, at the same time, require
sub-millisecond latencies and high throughput. IP multicast can achieve these
requirements but has control- and data-plane scalability limitations that make
it challenging to offer it as a service for hundreds of thousands of tenants,
typical of cloud environments. Tenants, therefore, must rely on unicast-based
approaches (e.g., application-layer or overlay-based) to support multicast in
their applications, imposing overhead on throughput and end host CPU
utilization, with higher and unpredictable latencies.
Elmo scales network multicast by taking advantage of emerging programmable
switches and the unique characteristics of data-center networks; specifically,
the symmetric topology and short paths in a data center. Elmo encodes multicast
group information inside packets themselves, reducing the need to store the
same information in network switches. In a three-tier data-center topology with
27K hosts, Elmo supports a million multicast groups using a 325-byte packet
header, requiring as few as 1.1K multicast group-table entries on average in
leaf switches, with a traffic overhead as low as 5% over ideal multicast.
| cs.NI | we present elmo a system that addresses the multicast scalability problem in multitenant data centers modern cloud applications frequently exhibit onetomany communication patterns and at the same time require submillisecond latencies and high throughput ip multicast can achieve these requirements but has control and dataplane scalability limitations that make it challenging to offer it as a service for hundreds of thousands of tenants typical of cloud environments tenants therefore must rely on unicastbased approaches eg applicationlayer or overlaybased to support multicast in their applications imposing overhead on throughput and end host cpu utilization with higher and unpredictable latencies elmo scales network multicast by taking advantage of emerging programmable switches and the unique characteristics of datacenter networks specifically the symmetric topology and short paths in a data center elmo encodes multicast group information inside packets themselves reducing the need to store the same information in network switches in a threetier datacenter topology with 27k hosts elmo supports a million multicast groups using a 325byte packet header requiring as few as 11k multicast grouptable entries on average in leaf switches with a traffic overhead as low as 5 over ideal multicast | [['we', 'present', 'elmo', 'a', 'system', 'that', 'addresses', 'the', 'multicast', 'scalability', 'problem', 'in', 'multitenant', 'data', 'centers', 'modern', 'cloud', 'applications', 'frequently', 'exhibit', 'onetomany', 'communication', 'patterns', 'and', 'at', 'the', 'same', 'time', 'require', 'submillisecond', 'latencies', 'and', 'high', 'throughput', 'ip', 'multicast', 'can', 'achieve', 'these', 'requirements', 'but', 'has', 'control', 'and', 'dataplane', 'scalability', 'limitations', 'that', 'make', 'it', 'challenging', 'to', 'offer', 'it', 'as', 'a', 'service', 'for', 'hundreds', 'of', 'thousands', 'of', 'tenants', 'typical', 'of', 'cloud', 'environments', 'tenants', 'therefore', 'must', 'rely', 'on', 'unicastbased', 'approaches', 'eg', 'applicationlayer', 'or', 'overlaybased', 'to', 'support', 'multicast', 'in', 'their', 'applications', 'imposing', 'overhead', 'on', 'throughput', 'and', 'end', 'host', 'cpu', 'utilization', 'with', 'higher', 'and', 'unpredictable', 'latencies', 'elmo', 'scales', 'network', 'multicast', 'by', 'taking', 'advantage', 'of', 'emerging', 'programmable', 'switches', 'and', 'the', 'unique', 'characteristics', 'of', 'datacenter', 'networks', 'specifically', 'the', 'symmetric', 'topology', 'and', 'short', 'paths', 'in', 'a', 'data', 'center', 'elmo', 'encodes', 'multicast', 'group', 'information', 'inside', 'packets', 'themselves', 'reducing', 'the', 'need', 'to', 'store', 'the', 'same', 'information', 'in', 'network', 'switches', 'in', 'a', 'threetier', 'datacenter', 'topology', 'with', '27k', 'hosts', 'elmo', 'supports', 'a', 'million', 'multicast', 'groups', 'using', 'a', '325byte', 'packet', 'header', 'requiring', 'as', 'few', 'as', '11k', 'multicast', 'grouptable', 'entries', 'on', 'average', 'in', 'leaf', 'switches', 'with', 'a', 'traffic', 'overhead', 'as', 'low', 'as', '5', 'over', 'ideal', 'multicast']] | [-0.27756154348314926, 0.04264378320067165, 0.0030548842524223147, 0.0061144655555446835, -0.1094534025305912, -0.21933141064874948, 0.1606883835533066, 0.43716289956660515, -0.2931687431658972, -0.3556843177156453, 0.13476024883304957, -0.2647939351845513, -0.1022581199599918, 0.16509007518976568, -0.12739271642192002, 0.06344669289827187, 0.08360077264232506, 0.045453684582539344, -0.025513763123635142, -0.28284911012506103, 0.24496735990447283, 0.06605858114712379, 0.3662704786330581, 0.04660779424260724, 0.09230342249427723, -0.0019365087597267353, -0.010999878614463589, -0.044175912204004304, -0.007025684159448904, 0.1099113239651486, 0.33818938846097274, 0.21457870703509307, 0.2920637306692527, -0.4987005740404129, -0.25049298334702413, 0.057334957569638356, 0.18402740407265403, 0.034162613874510486, -0.04648685609650385, -0.24350916600741326, 0.1677884981135793, -0.24500891634258118, -0.048172590668925784, -0.014714488199349235, -0.014915759087525269, 0.07448817376186823, -0.21740174041513136, -0.020065615993904516, -0.05004256689562438, 0.035349383661996595, -0.012275512654422708, -0.04383277046969808, -0.014544955594216119, 0.1919247711010098, -0.02263386148640657, 0.006956940586554175, 0.15806529853981047, -0.13064791401213982, -0.15339649683001505, 0.43510292747361773, 0.016118273697419958, -0.13734961504597257, 0.17815115085845304, 0.003939382302983201, -0.17204632807054862, 0.1314272863926107, 0.25538282792636735, 0.037762643590247016, -0.15548913852675236, 0.015590642820290454, 0.0031432512510109712, 0.1894017434772353, 0.10429208946319665, 0.16630771941876407, 0.16082064837421525, 0.2434939247441483, 0.1559912063191361, 0.10910577591593293, -0.06311001208297072, -0.09308161673243133, -0.15612693890969065, -0.1235407500049687, -0.1591774532250048, 0.05025101334533908, -0.12653946775993155, -0.1085422576970376, 0.35330258445306256, 0.14094679727204104, 0.1669498547478355, 0.13122649288507188, 0.4005181632318439, -0.0009043259654482976, 0.19442771855408056, 0.20725706658565146, 0.0891323549907037, 0.009588738101569409, 0.21043725827158513, -0.14848331593781372, 0.09741117839606847, -0.04032062817698614] |
1,802.09816 | Coarse to fine non-rigid registration: a chain of scale-specific neural
networks for multimodal image alignment with application to remote sensing | We tackle here the problem of multimodal image non-rigid registration, which
is of prime importance in remote sensing and medical imaging. The difficulties
encountered by classical registration approaches include feature design and
slow optimization by gradient descent. By analyzing these methods, we note the
significance of the notion of scale. We design easy-to-train,
fully-convolutional neural networks able to learn scale-specific features. Once
chained appropriately, they perform global registration in linear time, getting
rid of gradient descent schemes by predicting directly the deformation.We show
their performance in terms of quality and speed through various tasks of remote
sensing multimodal image alignment. In particular, we are able to register
correctly cadastral maps of buildings as well as road polylines onto RGB
images, and outperform current keypoint matching methods.
| cs.CV cs.AI cs.LG cs.NE stat.ML | we tackle here the problem of multimodal image nonrigid registration which is of prime importance in remote sensing and medical imaging the difficulties encountered by classical registration approaches include feature design and slow optimization by gradient descent by analyzing these methods we note the significance of the notion of scale we design easytotrain fullyconvolutional neural networks able to learn scalespecific features once chained appropriately they perform global registration in linear time getting rid of gradient descent schemes by predicting directly the deformationwe show their performance in terms of quality and speed through various tasks of remote sensing multimodal image alignment in particular we are able to register correctly cadastral maps of buildings as well as road polylines onto rgb images and outperform current keypoint matching methods | [['we', 'tackle', 'here', 'the', 'problem', 'of', 'multimodal', 'image', 'nonrigid', 'registration', 'which', 'is', 'of', 'prime', 'importance', 'in', 'remote', 'sensing', 'and', 'medical', 'imaging', 'the', 'difficulties', 'encountered', 'by', 'classical', 'registration', 'approaches', 'include', 'feature', 'design', 'and', 'slow', 'optimization', 'by', 'gradient', 'descent', 'by', 'analyzing', 'these', 'methods', 'we', 'note', 'the', 'significance', 'of', 'the', 'notion', 'of', 'scale', 'we', 'design', 'easytotrain', 'fullyconvolutional', 'neural', 'networks', 'able', 'to', 'learn', 'scalespecific', 'features', 'once', 'chained', 'appropriately', 'they', 'perform', 'global', 'registration', 'in', 'linear', 'time', 'getting', 'rid', 'of', 'gradient', 'descent', 'schemes', 'by', 'predicting', 'directly', 'the', 'deformationwe', 'show', 'their', 'performance', 'in', 'terms', 'of', 'quality', 'and', 'speed', 'through', 'various', 'tasks', 'of', 'remote', 'sensing', 'multimodal', 'image', 'alignment', 'in', 'particular', 'we', 'are', 'able', 'to', 'register', 'correctly', 'cadastral', 'maps', 'of', 'buildings', 'as', 'well', 'as', 'road', 'polylines', 'onto', 'rgb', 'images', 'and', 'outperform', 'current', 'keypoint', 'matching', 'methods']] | [-0.03484906278730881, -0.006105573723963913, -0.07129814541868625, 0.07664913407033085, -0.06297373304128527, -0.178013626463531, -0.005414610739887481, 0.482935473105059, -0.32754604598026604, -0.33926331202289267, 0.12303204293599382, -0.22753504581839568, -0.20169118875938077, 0.18277854858071454, -0.1984846651546597, 0.14311474836018356, 0.1334496186276327, 0.005667196121066809, -0.08243264913682886, -0.2616037061154437, 0.2788291719466102, 0.0431136206372626, 0.3472435474733732, -0.015324892469629224, 0.14265853774193074, 0.02447611703891814, -0.05572878989210773, 0.0018568212249045891, -0.029241164231808076, 0.19187077197092284, 0.35929975700714895, 0.21561912221518614, 0.30141113087865373, -0.47088401162275867, -0.21827608259815362, 0.1077561266269655, 0.16570642663563992, 0.09730217660187683, -0.04840982751920819, -0.3333476369209107, 0.07491897664693815, -0.10467221822604657, -0.026307763899826715, -0.1529181709272727, -0.06527185559764714, 0.031207664921361532, -0.24387376075385198, 0.0701837882760071, 0.053668168816535224, 0.0714740184315991, -0.04339746145846983, -0.08371469969936315, 0.023602941609551047, 0.18984933485907893, 0.01982977782233408, 0.04190842546297297, 0.2000079887220636, -0.210215877644406, -0.13560574135983422, 0.3818046621858112, -0.038818034658869426, -0.2181393141039617, 0.17988213871966205, -0.02433694697796337, -0.13908206331430964, 0.09755852276031228, 0.22277943368235062, 0.14445583840020962, -0.1459083402258975, 0.0024588716858547303, 0.0016600068268035689, 0.12544681510189548, 0.08603294502433029, -0.0003527441144650502, 0.17114976560321427, 0.17998458383296947, 0.09954774801078584, 0.13122500002294057, -0.1874387146414055, -0.05504391500501022, -0.20615508848418213, -0.1092659751255621, -0.185428673074761, -0.05482674648444499, -0.09685827390198791, -0.12317674451156974, 0.38963813635130085, 0.22767658089428405, 0.23551090736122382, 0.06436503744372467, 0.3956818925367007, 0.022146852126048368, 0.11339705806758796, 0.04840346685077454, 0.17475929787953295, 0.04878855688730255, 0.1280931694613349, -0.19724313733017734, 0.06212081359427107, 0.11185384803684428] |
1,802.09817 | Information-theoretic signatures of biodiversity in the barcoding gene | The COI mitochondrial gene is present in all animal phyla and in a few
others, and is the leading candidate for species identification through DNA
barcoding. Calculating a generalized form of total correlation on publicly
available data on the gene yields distinctive information-theoretic descriptors
of the phyla represented in the data. Moreover, performing principal component
analysis on standardized versions of these descriptors reveals a strong
correlation between the first principal component and the natural logarithm of
the number of known living species. The descriptors thus constitute clear
information-theoretic signatures of the processes whereby evolution has given
rise to current biodiversity.
| q-bio.PE | the coi mitochondrial gene is present in all animal phyla and in a few others and is the leading candidate for species identification through dna barcoding calculating a generalized form of total correlation on publicly available data on the gene yields distinctive informationtheoretic descriptors of the phyla represented in the data moreover performing principal component analysis on standardized versions of these descriptors reveals a strong correlation between the first principal component and the natural logarithm of the number of known living species the descriptors thus constitute clear informationtheoretic signatures of the processes whereby evolution has given rise to current biodiversity | [['the', 'coi', 'mitochondrial', 'gene', 'is', 'present', 'in', 'all', 'animal', 'phyla', 'and', 'in', 'a', 'few', 'others', 'and', 'is', 'the', 'leading', 'candidate', 'for', 'species', 'identification', 'through', 'dna', 'barcoding', 'calculating', 'a', 'generalized', 'form', 'of', 'total', 'correlation', 'on', 'publicly', 'available', 'data', 'on', 'the', 'gene', 'yields', 'distinctive', 'informationtheoretic', 'descriptors', 'of', 'the', 'phyla', 'represented', 'in', 'the', 'data', 'moreover', 'performing', 'principal', 'component', 'analysis', 'on', 'standardized', 'versions', 'of', 'these', 'descriptors', 'reveals', 'a', 'strong', 'correlation', 'between', 'the', 'first', 'principal', 'component', 'and', 'the', 'natural', 'logarithm', 'of', 'the', 'number', 'of', 'known', 'living', 'species', 'the', 'descriptors', 'thus', 'constitute', 'clear', 'informationtheoretic', 'signatures', 'of', 'the', 'processes', 'whereby', 'evolution', 'has', 'given', 'rise', 'to', 'current', 'biodiversity']] | [-0.12133124075247906, 0.049848893345333635, -0.08755940853152425, 0.07470135594485328, -0.020604924750514328, -0.10611768425209447, 0.02994351944886148, 0.31774593753740193, -0.2390197741703014, -0.27714391477406025, 0.058665584308328106, -0.3205984394904226, -0.16507812377996742, 0.1747486406005919, -0.020647112741135062, 0.008277490930631758, 0.0669761090609245, 0.06623660928569734, 0.01356079701334238, -0.18339860650943593, 0.29110646300017834, 0.06533479024539701, 0.3132033415883779, 0.036386215770617125, 0.1251097765774466, -0.01380489901639521, -0.13523282033391296, -0.006913739023730159, -0.0948356955545023, 0.1834837478492409, 0.2727796482667327, 0.2074302998231724, 0.2316337310243398, -0.4038121773302555, -0.19600293425843118, 0.11019627678324469, 0.16275597296829802, 0.09363746239803732, -0.043078232302796095, -0.26105188943445684, 0.03189548653550446, -0.12642742714611813, -0.055942900623194874, -0.10195019431877882, 0.05292895429767668, 0.0268994407216087, -0.24381053151097148, 0.15508685412816703, 0.022555728228762745, 0.14005653741769492, -0.06261086022481323, -0.1553027806058526, -0.06828171597328037, 0.19015234877821058, 0.06579804683104157, -0.0035355893149971963, 0.14790479673072696, -0.11171450017020107, -0.11744575656834058, 0.35929760395083576, -0.07120674104662612, -0.16229307221248745, 0.2196301819756627, -0.08912146288901568, -0.19915952163748443, 0.1208182280883193, 0.15372010548599063, 0.0796784240793204, -0.19335201115347445, 0.01596654379100073, -0.043602953823283316, 0.17488986803451553, 0.06558641292154789, 0.043883022679947314, 0.22239121388178318, 0.1962417760724202, 0.0273340307129547, 0.12776099264621735, -0.1216549977962859, -0.11614835968008265, -0.2430270481109619, -0.15991637860424818, -0.17791812883340755, 0.018552645316231065, -0.11313854002350127, -0.20395527441985906, 0.42535684428876264, 0.10404456433025189, 0.19608876965008676, 0.04439573668234516, 0.27863181742373855, 0.02599607373122126, 0.12185775604099035, 0.013612011643126608, 0.16951322874054311, 0.10566080003976822, 0.051950474057812245, -0.1984067210322246, 0.16919568638317287, 0.04118097811471671] |
1,802.09818 | Direct Covalent Chemical Functionalization of Unmodified Two-Dimensional
Molybdenum Disulfide | Two-dimensional semiconducting transition metal dichalcogenides (TMDCs) like
molybdenum disulfide (MoS2) are generating significant excitement due to their
unique electronic, chemical, and optical properties. Covalent chemical
functionalization represents a critical tool for tuning the properties of TMDCs
for use in many applications. However, the chemical inertness of semiconducting
TMDCs has thus far hindered the robust chemical functionalization of these
materials. Previous reports have required harsh chemical treatments or
converting TMDCs into metallic phases prior to covalent attachment. Here, we
demonstrate the direct covalent functionalization of the basal planes of
unmodified semiconducting MoS2 using aryl diazonium salts without any
pretreatments. Our approach preserves the semiconducting properties of MoS2,
results in covalent C-S bonds, is applicable to MoS2 derived from a range of
different synthesis methods, and enables a range of different functional groups
to be tethered directly to the MoS2 surface. Using density functional theory
calculations including van der Waals interactions and atomic-scale scanning
probe microscopy studies, we demonstrate a novel reaction mechanism in which
cooperative interactions enable the functionalization to propagate along the
MoS2 basal plane. The flexibility of this covalent chemistry employing the
diverse aryl diazonium salt family is further exploited to tether active
proteins to MoS2, suggesting future biological applications and demonstrating
its use as a versatile and powerful chemical platform for enhancing the utility
of semiconducting TMDCs
| cond-mat.mes-hall physics.chem-ph | twodimensional semiconducting transition metal dichalcogenides tmdcs like molybdenum disulfide mos2 are generating significant excitement due to their unique electronic chemical and optical properties covalent chemical functionalization represents a critical tool for tuning the properties of tmdcs for use in many applications however the chemical inertness of semiconducting tmdcs has thus far hindered the robust chemical functionalization of these materials previous reports have required harsh chemical treatments or converting tmdcs into metallic phases prior to covalent attachment here we demonstrate the direct covalent functionalization of the basal planes of unmodified semiconducting mos2 using aryl diazonium salts without any pretreatments our approach preserves the semiconducting properties of mos2 results in covalent cs bonds is applicable to mos2 derived from a range of different synthesis methods and enables a range of different functional groups to be tethered directly to the mos2 surface using density functional theory calculations including van der waals interactions and atomicscale scanning probe microscopy studies we demonstrate a novel reaction mechanism in which cooperative interactions enable the functionalization to propagate along the mos2 basal plane the flexibility of this covalent chemistry employing the diverse aryl diazonium salt family is further exploited to tether active proteins to mos2 suggesting future biological applications and demonstrating its use as a versatile and powerful chemical platform for enhancing the utility of semiconducting tmdcs | [['twodimensional', 'semiconducting', 'transition', 'metal', 'dichalcogenides', 'tmdcs', 'like', 'molybdenum', 'disulfide', 'mos2', 'are', 'generating', 'significant', 'excitement', 'due', 'to', 'their', 'unique', 'electronic', 'chemical', 'and', 'optical', 'properties', 'covalent', 'chemical', 'functionalization', 'represents', 'a', 'critical', 'tool', 'for', 'tuning', 'the', 'properties', 'of', 'tmdcs', 'for', 'use', 'in', 'many', 'applications', 'however', 'the', 'chemical', 'inertness', 'of', 'semiconducting', 'tmdcs', 'has', 'thus', 'far', 'hindered', 'the', 'robust', 'chemical', 'functionalization', 'of', 'these', 'materials', 'previous', 'reports', 'have', 'required', 'harsh', 'chemical', 'treatments', 'or', 'converting', 'tmdcs', 'into', 'metallic', 'phases', 'prior', 'to', 'covalent', 'attachment', 'here', 'we', 'demonstrate', 'the', 'direct', 'covalent', 'functionalization', 'of', 'the', 'basal', 'planes', 'of', 'unmodified', 'semiconducting', 'mos2', 'using', 'aryl', 'diazonium', 'salts', 'without', 'any', 'pretreatments', 'our', 'approach', 'preserves', 'the', 'semiconducting', 'properties', 'of', 'mos2', 'results', 'in', 'covalent', 'cs', 'bonds', 'is', 'applicable', 'to', 'mos2', 'derived', 'from', 'a', 'range', 'of', 'different', 'synthesis', 'methods', 'and', 'enables', 'a', 'range', 'of', 'different', 'functional', 'groups', 'to', 'be', 'tethered', 'directly', 'to', 'the', 'mos2', 'surface', 'using', 'density', 'functional', 'theory', 'calculations', 'including', 'van', 'der', 'waals', 'interactions', 'and', 'atomicscale', 'scanning', 'probe', 'microscopy', 'studies', 'we', 'demonstrate', 'a', 'novel', 'reaction', 'mechanism', 'in', 'which', 'cooperative', 'interactions', 'enable', 'the', 'functionalization', 'to', 'propagate', 'along', 'the', 'mos2', 'basal', 'plane', 'the', 'flexibility', 'of', 'this', 'covalent', 'chemistry', 'employing', 'the', 'diverse', 'aryl', 'diazonium', 'salt', 'family', 'is', 'further', 'exploited', 'to', 'tether', 'active', 'proteins', 'to', 'mos2', 'suggesting', 'future', 'biological', 'applications', 'and', 'demonstrating', 'its', 'use', 'as', 'a', 'versatile', 'and', 'powerful', 'chemical', 'platform', 'for', 'enhancing', 'the', 'utility', 'of', 'semiconducting', 'tmdcs']] | [-0.09859450871697328, 0.09864731760345263, -0.01675782114475081, -0.05714936926480332, -0.04752799837290386, -0.2123472163445154, 0.14112422924297605, 0.4754480019066517, -0.2865453799588418, -0.2586052806197811, -0.088978457959089, -0.3160685952987795, -0.2180407295279085, 0.196383660554527, 0.027935028680677123, 0.06705647756612178, 0.011538885654497106, -0.19830061799479187, -0.07531196115978507, -0.16894507954065868, 0.2043244342059068, 0.049362351280560185, 0.34479157660271836, 0.15469938520995746, -0.0021018639373499045, -0.01568794058776811, 0.11441143905239846, -0.013603402754514042, -0.193072411157869, 0.1613592165116426, 0.29676833350869286, -0.09973198826822084, 0.26641010180107155, -0.5129829264254472, -0.30646978968908206, 0.012168507678583776, 0.12332434029480734, 0.1888540570358233, -0.15714039847707598, -0.26877486813864715, 0.08108537932703007, -0.1535949287220511, -0.0772915662334668, -0.1279267156534025, -0.012294565871093047, 0.0626421456594755, -0.19873618352688302, 0.052818086782231106, 0.0025900054280859753, 0.09655783654810993, -0.1048024908127904, -0.17038939396184313, -0.14102457486490352, 0.12212055272832854, -0.010625455306347358, 0.002841372767686545, 0.31453230873459453, -0.13736295542538748, -0.08166680914572004, 0.4509340288219525, -0.007518781631556981, -0.08560471996255678, 0.2759999046262371, -0.09213731769444859, -0.11162037192843854, 0.1562503203899181, 0.09644986625222507, 0.12847133594166718, -0.18525941681048466, 0.07787320557677341, 0.06484102887483827, 0.14290429171977923, 0.09024142648879473, 0.1092354300423363, 0.2441139413933526, 0.24261865610205527, 0.026597085209011204, 0.1064186288793347, -0.05666267592673523, -0.001967978534510855, -0.09123467161200531, -0.2850347663993614, -0.21503971064187705, 0.10149164454063075, -0.10731262289455701, -0.23764520685333723, 0.3861621984989818, 0.12812356211388176, 0.10520561527324106, -0.06274722395368655, 0.24982261228900607, -0.014635913426466628, 0.13217053721112054, -0.09693506298749067, 0.2513299720899048, 0.18563343730430468, 0.09413125838148792, -0.21402337680540875, 0.1469173199868838, -0.001620159355214361] |
1,802.09819 | K-theory of non-archimedean rings I | We introduce a variant of homotopy K-theory for Tate rings, which we call
analytic K-theory. It is homotopy invariant with respect to the analytic affine
line viewed as an ind-object of closed disks of increasing radii. Under a
certain regularity assumption we prove an analytic analog of the Bass
fundamental theorem and we compare analytic K-theory with continuous K-theory,
which is defined in terms models. Along the way we also prove some results
about the algebraic K-theory of Tate rings.
| math.KT math.AG | we introduce a variant of homotopy ktheory for tate rings which we call analytic ktheory it is homotopy invariant with respect to the analytic affine line viewed as an indobject of closed disks of increasing radii under a certain regularity assumption we prove an analytic analog of the bass fundamental theorem and we compare analytic ktheory with continuous ktheory which is defined in terms models along the way we also prove some results about the algebraic ktheory of tate rings | [['we', 'introduce', 'a', 'variant', 'of', 'homotopy', 'ktheory', 'for', 'tate', 'rings', 'which', 'we', 'call', 'analytic', 'ktheory', 'it', 'is', 'homotopy', 'invariant', 'with', 'respect', 'to', 'the', 'analytic', 'affine', 'line', 'viewed', 'as', 'an', 'indobject', 'of', 'closed', 'disks', 'of', 'increasing', 'radii', 'under', 'a', 'certain', 'regularity', 'assumption', 'we', 'prove', 'an', 'analytic', 'analog', 'of', 'the', 'bass', 'fundamental', 'theorem', 'and', 'we', 'compare', 'analytic', 'ktheory', 'with', 'continuous', 'ktheory', 'which', 'is', 'defined', 'in', 'terms', 'models', 'along', 'the', 'way', 'we', 'also', 'prove', 'some', 'results', 'about', 'the', 'algebraic', 'ktheory', 'of', 'tate', 'rings']] | [-0.21429928548168392, 0.0005493122593179578, -0.14756238277768716, 0.14532654210051987, -0.08885970732662826, -0.12555756309302524, -0.036932439124211666, 0.3638071140710963, -0.3584758192766458, -0.1560022074590961, 0.11485021081607556, -0.17806453797165886, -0.1624370005854871, 0.22978446958586574, -0.2363517495803535, -0.004321499518118799, -0.0008204150421079248, 0.08548068765667267, -0.10376005510333926, -0.2485256874089828, 0.427825224539265, -0.010743659746367484, 0.17415679625528355, 0.07017712482702336, 0.08268042928539217, 0.014539884170517325, -0.03492177699226886, -0.016783364594448357, -0.197535130236065, 0.16151994913816453, 0.329711272942086, 0.034756812656996774, 0.18046839903108775, -0.38342877570539713, -0.09903306458436419, 0.17599022149806842, 0.13302639201574493, 0.03575408312026411, -0.04594740965985693, -0.27738317074254154, 0.14362464691512286, -0.21544300640234723, -0.19028163848270196, -0.11744785433402286, 0.047399505181238054, 0.05380431240919279, -0.23641932002501562, -0.04183015465132485, 0.0924759125104174, 0.19158207518048584, -0.1799107873463072, -0.03942358886561124, -0.057516049779951575, 0.062428844399983065, 0.01825747689581476, 0.028855122509412467, 0.13364057263243012, -0.05198000799573492, -0.14119487460702657, 0.35988820139318706, -0.07279007998295128, -0.1854802514659241, 0.11421082144370302, -0.13771422100544442, -0.1931904207682237, 0.12206103071803227, -0.007822524954099208, 0.16815944480476902, 0.0228243263612967, 0.19140265220412403, -0.16936485885235014, 0.07462044499407057, 0.0885275007574819, 0.0352834911813261, 0.14304267116822303, 0.04196130847558379, 0.09509427957964363, 0.18296200938348192, 0.018955469341744902, -0.10411230160389096, -0.3204642766038887, -0.2276129860430956, -0.06716300737170969, 0.19424995962763206, -0.1203258695311888, -0.21128452729899436, 0.4074404384708032, 0.11593747842707672, 0.20463654375635087, 0.22191915931471157, 0.29319439807441083, 0.10167285831703339, 0.018088711600285023, 0.05002048767055385, 0.09979050165457011, 0.264938253024593, 0.004629226739052683, -0.08180098701268435, -0.03372300508781336, 0.2520182164036669] |
1,802.0982 | Cooperative MIMO Precoding with Distributed CSI: A Hierarchical Approach | The problem of network multiple-input multiple-output precoding under
distributed channel state information is a notoriously challenging question,
for which optimal solutions with reasonable complexity remain elusive. In this
context, we assess the value of hierarchical information exchange, whereby an
order is established among the transmitters (TXs) in such a way that a given TX
has access not only to its local channel estimate but also to the estimates
available at the less informed TXs. Assuming regularized zero forcing (RZF)
precoding at the TXs, we propose naive, locally robust, and globally robust
suboptimal strategies for the joint precoding design. Numerical results show
that hierarchical information exchange brings significant performance gains,
with the locally and globally robust algorithms performing remarkably close to
the optimal RZF strategy. Lastly, the cost of hierarchical information exchange
relative to the cooperation gain is examined and the optimal tradeoff is
numerically evaluated.
| cs.IT math.IT | the problem of network multipleinput multipleoutput precoding under distributed channel state information is a notoriously challenging question for which optimal solutions with reasonable complexity remain elusive in this context we assess the value of hierarchical information exchange whereby an order is established among the transmitters txs in such a way that a given tx has access not only to its local channel estimate but also to the estimates available at the less informed txs assuming regularized zero forcing rzf precoding at the txs we propose naive locally robust and globally robust suboptimal strategies for the joint precoding design numerical results show that hierarchical information exchange brings significant performance gains with the locally and globally robust algorithms performing remarkably close to the optimal rzf strategy lastly the cost of hierarchical information exchange relative to the cooperation gain is examined and the optimal tradeoff is numerically evaluated | [['the', 'problem', 'of', 'network', 'multipleinput', 'multipleoutput', 'precoding', 'under', 'distributed', 'channel', 'state', 'information', 'is', 'a', 'notoriously', 'challenging', 'question', 'for', 'which', 'optimal', 'solutions', 'with', 'reasonable', 'complexity', 'remain', 'elusive', 'in', 'this', 'context', 'we', 'assess', 'the', 'value', 'of', 'hierarchical', 'information', 'exchange', 'whereby', 'an', 'order', 'is', 'established', 'among', 'the', 'transmitters', 'txs', 'in', 'such', 'a', 'way', 'that', 'a', 'given', 'tx', 'has', 'access', 'not', 'only', 'to', 'its', 'local', 'channel', 'estimate', 'but', 'also', 'to', 'the', 'estimates', 'available', 'at', 'the', 'less', 'informed', 'txs', 'assuming', 'regularized', 'zero', 'forcing', 'rzf', 'precoding', 'at', 'the', 'txs', 'we', 'propose', 'naive', 'locally', 'robust', 'and', 'globally', 'robust', 'suboptimal', 'strategies', 'for', 'the', 'joint', 'precoding', 'design', 'numerical', 'results', 'show', 'that', 'hierarchical', 'information', 'exchange', 'brings', 'significant', 'performance', 'gains', 'with', 'the', 'locally', 'and', 'globally', 'robust', 'algorithms', 'performing', 'remarkably', 'close', 'to', 'the', 'optimal', 'rzf', 'strategy', 'lastly', 'the', 'cost', 'of', 'hierarchical', 'information', 'exchange', 'relative', 'to', 'the', 'cooperation', 'gain', 'is', 'examined', 'and', 'the', 'optimal', 'tradeoff', 'is', 'numerically', 'evaluated']] | [-0.21351764858379188, -0.0018775622576178083, -0.058154501913693445, 0.0783149024913216, -0.11350016692203695, -0.24186936957954333, 0.1305648321639104, 0.4104765453022616, -0.3059531730374899, -0.26392213445285273, 0.13313073459530955, -0.23564520866513766, -0.1718805251374102, 0.1125436513459888, -0.09921271534765075, 0.06610186796209871, 0.061934479525120094, 0.03137981929527275, -0.0650045807043829, -0.3013966173527698, 0.30658752846788484, 0.14949019955599616, 0.3781835309149505, -0.018626234576844706, 0.15286302435822013, 0.001168319677677134, -0.023116408522915223, -0.026774787710947465, -0.1308528007510929, 0.0783735522606956, 0.35430216650510654, 0.15294587212004537, 0.32810521823000804, -0.3646905916775095, -0.20119614166785674, 0.12215900726231008, 0.1705869756831691, 0.0945349676365932, -0.050571658341856354, -0.2420389890092714, 0.14386092543959264, -0.18763559460800527, -0.04167666795567192, -0.05225961379514172, -0.07876110202151126, -0.03447953538712242, -0.3903448284667885, 0.07194706764019994, -0.00334863556716551, -0.0005714613012969494, -0.057061166697631366, -0.13736765389170114, 0.006861279808498662, 0.1585776572276292, 0.039701705731066135, 0.024429399773863884, 0.06693782148368914, -0.10780042326077818, -0.10627255952306862, 0.32984254459111856, -0.003749285841457032, -0.2637999124327225, 0.16370842400165517, -0.08882837653930845, -0.10048471280084602, 0.15856934401110329, 0.1959949513222894, 0.07947182199949848, -0.2027847753066955, 0.025757420623819503, -0.029248004368153113, 0.20537183244937451, 0.015442974443129939, 0.11953998420002132, 0.14623462130347717, 0.20037819314105756, 0.19255441214953517, 0.10638511858575432, -0.08252273197044972, -0.1428112637508532, -0.20036470310056004, -0.0620224485430738, -0.20179911851240642, 0.001487604994427188, -0.11036832088189087, -0.08555826054051005, 0.3275395638020388, 0.16194658312175808, 0.12078390464122439, 0.10678138303618621, 0.37640961839753234, 0.09767972602155701, 0.00938980974064305, 0.182355063948138, 0.25296794477818085, 0.10521949369396115, 0.10530319231851347, -0.23623558074428602, 0.09530079576893356, -0.035418819436996145] |
1,802.09821 | Computational study on microstructure evolution and magnetic property of
laser additively manufactured magnetic materials | Additive manufacturing (AM) offers an unprecedented opportunity for the quick
production of complex shaped parts directly from a powder precursor. But its
application to functional materials in general and magnetic materials in
particular is still at the very beginning. Here we present the first attempt to
computationally study the microstructure evolution and magnetic properties of
magnetic materials (e.g. Fe-Ni alloys) processed by selective laser melting
(SLM). SLM process induced thermal history and thus the residual stress
distribution in Fe-Ni alloys are calculated by finite element analysis (FEA).
The evolution and distribution of the $\gamma$-Fe-Ni and FeNi$_3$ phase
fractions were predicted by using the temperature information from FEA and the
output from CALculation of PHAse Diagrams (CALPHAD). Based on the relation
between residual stress and magnetoelastic energy, magnetic properties of SLM
processed Fe-Ni alloys (magnetic coercivity, remanent magnetization, and
magnetic domain structure) are examined by micromagnetic simulations. The
calculated coercivity is found to be in line with the experimentally measured
values of SLM-processed Fe-Ni alloys. This computation study demonstrates a
feasible approach for the simulation of additively manufactured magnetic
materials by integrating FEA, CALPHAD, and micromagnetics.
| cond-mat.mtrl-sci | additive manufacturing am offers an unprecedented opportunity for the quick production of complex shaped parts directly from a powder precursor but its application to functional materials in general and magnetic materials in particular is still at the very beginning here we present the first attempt to computationally study the microstructure evolution and magnetic properties of magnetic materials eg feni alloys processed by selective laser melting slm slm process induced thermal history and thus the residual stress distribution in feni alloys are calculated by finite element analysis fea the evolution and distribution of the gammafeni and feni_3 phase fractions were predicted by using the temperature information from fea and the output from calculation of phase diagrams calphad based on the relation between residual stress and magnetoelastic energy magnetic properties of slm processed feni alloys magnetic coercivity remanent magnetization and magnetic domain structure are examined by micromagnetic simulations the calculated coercivity is found to be in line with the experimentally measured values of slmprocessed feni alloys this computation study demonstrates a feasible approach for the simulation of additively manufactured magnetic materials by integrating fea calphad and micromagnetics | [['additive', 'manufacturing', 'am', 'offers', 'an', 'unprecedented', 'opportunity', 'for', 'the', 'quick', 'production', 'of', 'complex', 'shaped', 'parts', 'directly', 'from', 'a', 'powder', 'precursor', 'but', 'its', 'application', 'to', 'functional', 'materials', 'in', 'general', 'and', 'magnetic', 'materials', 'in', 'particular', 'is', 'still', 'at', 'the', 'very', 'beginning', 'here', 'we', 'present', 'the', 'first', 'attempt', 'to', 'computationally', 'study', 'the', 'microstructure', 'evolution', 'and', 'magnetic', 'properties', 'of', 'magnetic', 'materials', 'eg', 'feni', 'alloys', 'processed', 'by', 'selective', 'laser', 'melting', 'slm', 'slm', 'process', 'induced', 'thermal', 'history', 'and', 'thus', 'the', 'residual', 'stress', 'distribution', 'in', 'feni', 'alloys', 'are', 'calculated', 'by', 'finite', 'element', 'analysis', 'fea', 'the', 'evolution', 'and', 'distribution', 'of', 'the', 'gammafeni', 'and', 'feni_3', 'phase', 'fractions', 'were', 'predicted', 'by', 'using', 'the', 'temperature', 'information', 'from', 'fea', 'and', 'the', 'output', 'from', 'calculation', 'of', 'phase', 'diagrams', 'calphad', 'based', 'on', 'the', 'relation', 'between', 'residual', 'stress', 'and', 'magnetoelastic', 'energy', 'magnetic', 'properties', 'of', 'slm', 'processed', 'feni', 'alloys', 'magnetic', 'coercivity', 'remanent', 'magnetization', 'and', 'magnetic', 'domain', 'structure', 'are', 'examined', 'by', 'micromagnetic', 'simulations', 'the', 'calculated', 'coercivity', 'is', 'found', 'to', 'be', 'in', 'line', 'with', 'the', 'experimentally', 'measured', 'values', 'of', 'slmprocessed', 'feni', 'alloys', 'this', 'computation', 'study', 'demonstrates', 'a', 'feasible', 'approach', 'for', 'the', 'simulation', 'of', 'additively', 'manufactured', 'magnetic', 'materials', 'by', 'integrating', 'fea', 'calphad', 'and', 'micromagnetics']] | [-0.08056466864258215, 0.1758061711719435, -0.07574390781695371, 0.005578091064617783, -0.04690966190217615, -0.0690834368655847, 0.05992190494749933, 0.46259508695412466, -0.29489827741469654, -0.3193670563236043, 0.07343906312694794, -0.26204474035977987, -0.12059596045822887, 0.1992712504112745, 0.027833523382439156, 0.06720623768686002, 0.021816898559816285, -0.06387318930957098, -0.09431828655159244, -0.20896209796998078, 0.24299117377038104, 0.0635167687496805, 0.3158513718159296, 0.03824114376022787, 0.054406553510689064, -0.02930408627802895, 0.021515080033978038, 0.06993332748035234, -0.1524127834491882, 0.07439627401833934, 0.23200106603774026, -0.02758276805148593, 0.16959617181379183, -0.4825597670297701, -0.22307985818402454, 0.004995489702815865, 0.07998055785248033, 0.07345241642362632, -0.10134813997889408, -0.2324325733173352, 0.10163341463635583, -0.12910841328122621, -0.09580390677521271, -0.1375475495511277, -0.00477310484735766, 0.04024539490493915, -0.27307554973439047, 0.06286830014989271, 0.02974609150520077, 0.14811023589412958, -0.13158093833244294, -0.14818798705288158, -0.07548392746484951, 0.05713012889807962, 0.028107466112027857, 0.0238857677904889, 0.19936075547753557, -0.10438582167837891, -0.07263286476622202, 0.3720962811302353, -0.02353000249534559, -0.09182682232214855, 0.1196293685557116, -0.17098367166485393, -0.07387351991537099, 0.19550295356804362, 0.13741256522685086, 0.10228863329201895, -0.19858258381865887, 0.060466733416683134, 0.08247636960164367, 0.1983305819762441, 0.03461811228419889, -0.009314504749804305, 0.22833555417549847, 0.2099319768085779, -0.07104145454314466, 0.20392889110243542, -0.10074547675273837, -0.04819836405650866, -0.21147141293660932, -0.1990608953215837, -0.21093215422377318, 0.038243689867898126, -0.10970086173164328, -0.1943148041238681, 0.36239896278577644, 0.14264977598373502, 0.12477468244605416, -0.050185470711337506, 0.30821402308244544, 0.07069652620702982, 0.062114878091961145, 0.004374330555687526, 0.22295871063245584, 0.21796465179227947, 0.17740135847918362, -0.2723290059001666, 0.1521343700997122, 0.03329572571277782] |
1,802.09822 | Lepton-flavour-violating gluonic operators: constraints from the LHC and
low energy experiments | Effective operators provide a model-independent description of physics beyond
the stan- dard model that is particularly useful given the absence of any signs
of new physics at the Large Hadron Collider (LHC). We recast previous LHC
analyses to set limits on lepton-flavour-violating gluonic effective operators
of dimension 8 and compare our results to existing limits from low-energy
precision experiments. Current LHC data constrains the scale $\Lambda$ of the
effective operators to be larger than $\Lambda\gtrsim 0.5 - 1.6$ TeV depending
on the flavour and thus provides the most stringent limit for all operators
apart from parity-conserving operators of the form $GG\bar\mu P_{L,R} e$, where
$\mu - e$ conversion in nuclei poses the most stringent constraint.
| hep-ph | effective operators provide a modelindependent description of physics beyond the stan dard model that is particularly useful given the absence of any signs of new physics at the large hadron collider lhc we recast previous lhc analyses to set limits on leptonflavourviolating gluonic effective operators of dimension 8 and compare our results to existing limits from lowenergy precision experiments current lhc data constrains the scale lambda of the effective operators to be larger than lambdagtrsim 05 16 tev depending on the flavour and thus provides the most stringent limit for all operators apart from parityconserving operators of the form ggbarmu p_lr e where mu e conversion in nuclei poses the most stringent constraint | [['effective', 'operators', 'provide', 'a', 'modelindependent', 'description', 'of', 'physics', 'beyond', 'the', 'stan', 'dard', 'model', 'that', 'is', 'particularly', 'useful', 'given', 'the', 'absence', 'of', 'any', 'signs', 'of', 'new', 'physics', 'at', 'the', 'large', 'hadron', 'collider', 'lhc', 'we', 'recast', 'previous', 'lhc', 'analyses', 'to', 'set', 'limits', 'on', 'leptonflavourviolating', 'gluonic', 'effective', 'operators', 'of', 'dimension', '8', 'and', 'compare', 'our', 'results', 'to', 'existing', 'limits', 'from', 'lowenergy', 'precision', 'experiments', 'current', 'lhc', 'data', 'constrains', 'the', 'scale', 'lambda', 'of', 'the', 'effective', 'operators', 'to', 'be', 'larger', 'than', 'lambdagtrsim', '05', '16', 'tev', 'depending', 'on', 'the', 'flavour', 'and', 'thus', 'provides', 'the', 'most', 'stringent', 'limit', 'for', 'all', 'operators', 'apart', 'from', 'parityconserving', 'operators', 'of', 'the', 'form', 'ggbarmu', 'p_lr', 'e', 'where', 'mu', 'e', 'conversion', 'in', 'nuclei', 'poses', 'the', 'most', 'stringent', 'constraint']] | [-0.05816354634173747, 0.16666043802147865, -0.04976545454701409, 0.13311971812280327, -0.10598456395382527, -0.15313535404649364, 0.05729247509901013, 0.22825626940175425, -0.17991076800431724, -0.32495190921638695, 0.06479566338670598, -0.3356482177083048, 0.022301275324675122, 0.22599915510467586, 0.059116527442321445, 0.07053378294429942, 0.07381175033307434, 0.0056089434315903675, -0.08206710674650301, -0.20408152286628528, 0.28669611974120407, 0.09185551504820719, 0.22690186511525617, 0.13148005259323067, 0.05032083721952014, 0.009899616070989785, -0.049730475705083724, -0.055191796065108586, -0.12462290951257923, 0.13522366736651747, 0.24870792683837603, 0.12496512944718623, 0.12722781992384366, -0.41745132093949777, -0.13058127461616614, 0.15835422984881525, 0.13915628549875692, 0.07692497388260174, 0.005902020352160824, -0.29915348563476335, 0.10241634118470497, -0.18853772505411012, -0.11038133473318469, -0.076536493716828, 0.03610841047234966, -0.08194137048641485, -0.33595980871801395, 0.05796848019677522, -0.004811764395916336, 0.06215698765091864, -0.02534464974139285, -0.23478152456560306, -0.013582293384908033, 0.026888407453952823, 0.05762445580928345, 0.05290879904558616, 0.17867420526869995, -0.18112194205917018, -0.15809702931853412, 0.3997216482073002, -0.08308180568630112, -0.17275214399809816, 0.20898645047730366, -0.2101651129196398, -0.18892035324824974, 0.09250997350526242, 0.20917269131833954, 0.08230247287636823, -0.1830399872435789, 0.21081699399240147, -0.03057670885807186, 0.164432351801744, 0.03465190893829068, 0.12336404106463306, 0.18832393661640318, 0.21716775429168983, 0.10630918143267211, 0.009920550112188462, -0.05952004552818835, -0.03307849958946463, -0.40580836148001254, -0.03471134626514478, -0.09298419972869201, 0.061730713193745554, -0.12060787423537736, -0.03886413055754799, 0.3728179794914987, 0.19422131873475987, 0.256200615133691, 0.030799433248051043, 0.2593525755718084, 0.11219610758221929, 0.11823232340897707, 0.049098982656947295, 0.3052777180231975, 0.09071133265803967, 0.10127944482623466, -0.17236934498941991, -0.01592921995325014, 0.07038556941967856] |
1,802.09823 | Integrable modules for twisted toroidal extended affine Lie algebras | In this paper we classify the irreducible integrable modules for the twisted
toroidal extended affine Lie algebras with center acting non-trivially.
| math.RT | in this paper we classify the irreducible integrable modules for the twisted toroidal extended affine lie algebras with center acting nontrivially | [['in', 'this', 'paper', 'we', 'classify', 'the', 'irreducible', 'integrable', 'modules', 'for', 'the', 'twisted', 'toroidal', 'extended', 'affine', 'lie', 'algebras', 'with', 'center', 'acting', 'nontrivially']] | [-0.20353461589132035, 0.15265627218676464, -0.015153041175965751, 0.03478842447622724, -0.19046365629349435, -0.15897992173475878, -0.15442689724953934, 0.41089393979027156, -0.369539431872822, -0.0993026580129351, 0.15528400161946637, -0.13546679284246194, -0.17569498362995328, 0.1630407247603649, -0.15387915194566762, -0.1446951406874827, 0.05038572195917368, 0.1532493709542212, -0.17218771364007676, -0.31883868974234375, 0.5025138548530993, -0.038720805696876984, 0.24596363306045532, -0.04214951289551599, 0.16230923731234811, 0.08515232553084691, -0.03429676791919129, -0.05426041914948395, -0.130261946957381, 0.1791218492601599, 0.3881687241650763, -0.10234193184546062, 0.0660778574113335, -0.36425423799526124, -0.06131442073023036, 0.27162569153699134, 0.2494019777292297, 0.009147177139918009, -0.014222449844791776, -0.2837974177229972, 0.0010129561026891072, -0.29324284337815787, -0.23613642621785402, 0.026162048136549338, 0.05200287105426902, 0.00446263248366969, -0.1681839164701246, 0.009776536730073747, 0.11653135468562444, 0.15988005444939649, -0.23932014773821547, -0.0612482623684974, -0.12809790905919813, 0.07702085672922078, -0.17361806084712347, 0.030350603118893645, 0.21122795551837908, -0.023552640307960764, -0.191581349398586, 0.2844978417491629, 0.015478848967523802, -0.31375177435222124, 0.13614948927646592, -0.1984725920926957, -0.26079148142820313, 0.09065536249961172, 0.09594949228422982, 0.06131196128470557, -0.015118045821076348, 0.23884899856611377, -0.15873862780807985, -0.09007674912434249, 0.05236795282967034, -0.04765363605249496, 0.1943490696804864, 0.07405855098650568, 0.055457774948860915, 0.20222613215446472, 0.05104972785782246, 0.007258153032688867, -0.4132477165687652, -0.1654467790642576, 0.022371022784638973, 0.16666126073825926, -0.020457790787553505, -0.1874895000032016, 0.4697355173882984, 0.10433214800875812, 0.16247948751385724, 0.10416384773062808, 0.14685024815567194, 0.04731047242170289, 0.2070395475519555, 0.09715973834196727, 0.14220442084063376, 0.3028914813129675, -0.06885160718645368, -0.1679540647282487, -0.24441815646631376, 0.263125319344302] |
1,802.09824 | PHoToNs--A Parallel Heterogeneous & Threads oriented code for
cosmological N-body simulation | We introduce a new code for cosmological simulations, PHoToNs, which has
features on performing massive cosmological simulations on heterogeneous high
performance Computer (HPC) and threads oriented programming. PHoToNs adopts a
hybrid scheme to compute gravity force, with the conventional PM to compute the
long-range force, the Tree algorithm to compute the short range force, and the
direct summation PP to compute the gravity from very close particles. A
self-similar space filling Peano-Hilbert curve is used to decompose computing
domain. Threads programming is highly used to more flexibly manage the domain
communication, PM calculation and synchronization, as well as Dual Tree
Traversal on the CPU+MIC platform. The scalability of the PHoToNs performs well
and the efficiency of PP kernel achieves 68.6% of peak performance on MIC and
74.4% on CPU platforms. We also test the accuracy of the code against the much
used Gadget-2 in the community and found excellent agreement.
| astro-ph.CO physics.comp-ph | we introduce a new code for cosmological simulations photons which has features on performing massive cosmological simulations on heterogeneous high performance computer hpc and threads oriented programming photons adopts a hybrid scheme to compute gravity force with the conventional pm to compute the longrange force the tree algorithm to compute the short range force and the direct summation pp to compute the gravity from very close particles a selfsimilar space filling peanohilbert curve is used to decompose computing domain threads programming is highly used to more flexibly manage the domain communication pm calculation and synchronization as well as dual tree traversal on the cpumic platform the scalability of the photons performs well and the efficiency of pp kernel achieves 686 of peak performance on mic and 744 on cpu platforms we also test the accuracy of the code against the much used gadget2 in the community and found excellent agreement | [['we', 'introduce', 'a', 'new', 'code', 'for', 'cosmological', 'simulations', 'photons', 'which', 'has', 'features', 'on', 'performing', 'massive', 'cosmological', 'simulations', 'on', 'heterogeneous', 'high', 'performance', 'computer', 'hpc', 'and', 'threads', 'oriented', 'programming', 'photons', 'adopts', 'a', 'hybrid', 'scheme', 'to', 'compute', 'gravity', 'force', 'with', 'the', 'conventional', 'pm', 'to', 'compute', 'the', 'longrange', 'force', 'the', 'tree', 'algorithm', 'to', 'compute', 'the', 'short', 'range', 'force', 'and', 'the', 'direct', 'summation', 'pp', 'to', 'compute', 'the', 'gravity', 'from', 'very', 'close', 'particles', 'a', 'selfsimilar', 'space', 'filling', 'peanohilbert', 'curve', 'is', 'used', 'to', 'decompose', 'computing', 'domain', 'threads', 'programming', 'is', 'highly', 'used', 'to', 'more', 'flexibly', 'manage', 'the', 'domain', 'communication', 'pm', 'calculation', 'and', 'synchronization', 'as', 'well', 'as', 'dual', 'tree', 'traversal', 'on', 'the', 'cpumic', 'platform', 'the', 'scalability', 'of', 'the', 'photons', 'performs', 'well', 'and', 'the', 'efficiency', 'of', 'pp', 'kernel', 'achieves', '686', 'of', 'peak', 'performance', 'on', 'mic', 'and', '744', 'on', 'cpu', 'platforms', 'we', 'also', 'test', 'the', 'accuracy', 'of', 'the', 'code', 'against', 'the', 'much', 'used', 'gadget2', 'in', 'the', 'community', 'and', 'found', 'excellent', 'agreement']] | [-0.13487293798360825, 0.027820232780197098, -0.1015389379888973, 0.08091348769465904, -0.08755737385906329, -0.15638632472642017, 0.05300707585059557, 0.3969778835167171, -0.23656174137363298, -0.3692070940796961, 0.05098543995788209, -0.26453139966091255, -0.07300854108808874, 0.22222494455241917, -0.01741616947938932, 0.07862634510551923, 0.10537352312618754, 0.001566771305347449, -0.037053131034297734, -0.2399570811086728, 0.21624459318454134, 0.13985257091363204, 0.2934203582422045, 0.04319502587036399, 0.11321627469373954, -0.006548569262677791, -0.03447463604677844, -0.012107086977522958, -0.1273192302698907, 0.10048853868662361, 0.23208410218170525, 0.1168239573610559, 0.22858873514721056, -0.4156090530938775, -0.15856640422857374, 0.05915358760737933, 0.14910756848477477, 0.08276284219237708, -0.01708854290302421, -0.25676331010915887, 0.09840572581801489, -0.19555694783643987, -0.05575367537070841, -0.09026389839065155, -0.0024087289160730054, -0.007988155250681327, -0.2555054363313337, 0.042801819382127584, -0.059219247778727606, 0.033765135489204186, -0.012452521270778555, -0.10730480485839532, 0.0014174758494150319, 0.09469433259937737, -0.010421185626104574, 0.1034330310293742, 0.17487675951318754, -0.10352105063842547, -0.16639839671434983, 0.44700877923493415, -0.07766989224759124, -0.17729384988083835, 0.2518435998854146, -0.0720727813411379, -0.09728240103292085, 0.10824789640637453, 0.23310755108695652, 0.10008985226998893, -0.10786794603570996, 0.058112852392568186, 0.01878466798248857, 0.20578589491333638, 0.07455875546727704, 0.005736045665511996, 0.18400710876468543, 0.18835144138726212, 0.03435120777845783, 0.14980212008993096, -0.10271624725824925, -0.11906885651359023, -0.22433775334678366, -0.16675364284857408, -0.19676636750716092, -0.011074781417065369, -0.14669403550840115, -0.17347296466738385, 0.3631716599437084, 0.17660348919914073, 0.12720616013686728, 0.12234287395301406, 0.35520469699830015, 0.06547513383990716, 0.11185647045955963, 0.16039511539829557, 0.19420249163854442, 0.11249654499451386, 0.13798532629699678, -0.24341879448315892, 0.025472316750319014, 0.033848493463116004] |
1,802.09825 | A new efficient hyperelastic finite element model for graphene and its
application to carbon nanotubes and nanocones | A new hyperelastic material model is proposed for graphene-based structures,
such as graphene, carbon nanotubes (CNTs) and carbon nanocones (CNC). The
proposed model is based on a set of invariants obtained from the right surface
Cauchy-Green strain tensor and a structural tensor. The model is fully
nonlinear and can simulate buckling and postbuckling behavior. It is calibrated
from existing quantum data. It is implemented within a rotation-free
isogeometric shell formulation. The speedup of the model is 1.5 relative to the
finite element model of Ghaffari et al. [1], which is based on the logarithmic
strain formulation of Kumar and Parks [2]. The material behavior is verified by
testing uniaxial tension and pure shear. The performance of the material model
is illustrated by several numerical examples. The examples include bending,
twisting, and wall contact of CNTs and CNCs. The wall contact is modeled with a
coarse grained contact model based on the Lennard-Jones potential. The buckling
and post-buckling behavior is captured in the examples. The results are
compared with reference results from the literature and there is good
agreement.
| cs.CE physics.comp-ph | a new hyperelastic material model is proposed for graphenebased structures such as graphene carbon nanotubes cnts and carbon nanocones cnc the proposed model is based on a set of invariants obtained from the right surface cauchygreen strain tensor and a structural tensor the model is fully nonlinear and can simulate buckling and postbuckling behavior it is calibrated from existing quantum data it is implemented within a rotationfree isogeometric shell formulation the speedup of the model is 15 relative to the finite element model of ghaffari et al 1 which is based on the logarithmic strain formulation of kumar and parks 2 the material behavior is verified by testing uniaxial tension and pure shear the performance of the material model is illustrated by several numerical examples the examples include bending twisting and wall contact of cnts and cncs the wall contact is modeled with a coarse grained contact model based on the lennardjones potential the buckling and postbuckling behavior is captured in the examples the results are compared with reference results from the literature and there is good agreement | [['a', 'new', 'hyperelastic', 'material', 'model', 'is', 'proposed', 'for', 'graphenebased', 'structures', 'such', 'as', 'graphene', 'carbon', 'nanotubes', 'cnts', 'and', 'carbon', 'nanocones', 'cnc', 'the', 'proposed', 'model', 'is', 'based', 'on', 'a', 'set', 'of', 'invariants', 'obtained', 'from', 'the', 'right', 'surface', 'cauchygreen', 'strain', 'tensor', 'and', 'a', 'structural', 'tensor', 'the', 'model', 'is', 'fully', 'nonlinear', 'and', 'can', 'simulate', 'buckling', 'and', 'postbuckling', 'behavior', 'it', 'is', 'calibrated', 'from', 'existing', 'quantum', 'data', 'it', 'is', 'implemented', 'within', 'a', 'rotationfree', 'isogeometric', 'shell', 'formulation', 'the', 'speedup', 'of', 'the', 'model', 'is', '15', 'relative', 'to', 'the', 'finite', 'element', 'model', 'of', 'ghaffari', 'et', 'al', '1', 'which', 'is', 'based', 'on', 'the', 'logarithmic', 'strain', 'formulation', 'of', 'kumar', 'and', 'parks', '2', 'the', 'material', 'behavior', 'is', 'verified', 'by', 'testing', 'uniaxial', 'tension', 'and', 'pure', 'shear', 'the', 'performance', 'of', 'the', 'material', 'model', 'is', 'illustrated', 'by', 'several', 'numerical', 'examples', 'the', 'examples', 'include', 'bending', 'twisting', 'and', 'wall', 'contact', 'of', 'cnts', 'and', 'cncs', 'the', 'wall', 'contact', 'is', 'modeled', 'with', 'a', 'coarse', 'grained', 'contact', 'model', 'based', 'on', 'the', 'lennardjones', 'potential', 'the', 'buckling', 'and', 'postbuckling', 'behavior', 'is', 'captured', 'in', 'the', 'examples', 'the', 'results', 'are', 'compared', 'with', 'reference', 'results', 'from', 'the', 'literature', 'and', 'there', 'is', 'good', 'agreement']] | [-0.09614870287321006, 0.06696762069091829, -0.07325330696832598, -0.021433264473610127, -0.0494255682903478, -0.16357463241157152, -0.004136552359729618, 0.4058894794434309, -0.2655064708741612, -0.29769036338109983, 0.08872383876423759, -0.28928065650541795, -0.19764453729776812, 0.19392308932755226, -0.044042877799287186, 0.08327814049788573, 0.07656106807937678, -0.0318434046597084, -0.04518749085833774, -0.20660545405398092, 0.2651071184722895, 0.07384047890278207, 0.318695769446452, 0.08154012254057347, 0.07336250939105605, -0.05480996329923359, 0.018555515856492552, 0.08636088924236554, -0.15777780571455408, 0.09434789733103152, 0.17444655373483225, -0.00823494587669128, 0.1995067989893174, -0.4330784926881616, -0.23451867232065166, -0.004356337951893887, 0.0624877032065199, 0.12465243903708152, -0.02187360084309567, -0.28159874271904906, 0.10067794272111039, -0.18369315960182903, -0.09554374010009126, -0.06542906401616135, 0.006346064439210831, 0.026960430866934025, -0.25619138778825656, 0.08745528191715228, 0.041175887819447914, 0.07376831859870803, -0.10852431610823096, -0.1309630266715134, -0.07339612049641862, 0.06445090408604383, 0.04445272718351517, 0.02217886125763062, 0.1865442239606146, -0.10557560599670651, -0.07151451364965335, 0.445986738586746, -0.04894947094759077, -0.20139272654889506, 0.18496663491843332, -0.04685758757457305, -0.0329276959168505, 0.12901094825048878, 0.11246043999072457, 0.10540603910405398, -0.14391283915911832, 0.09410693038587217, -0.034876868976384735, 0.14617080657266793, 0.05742669240388433, -0.08216427814440568, 0.1703825596042417, 0.25254764632855575, -0.0004994870775661776, 0.14066042710263071, -0.08992332509415371, -0.0832758219588909, -0.290624538470541, -0.17100383692128018, -0.2068692494440154, 0.020501017584965767, -0.12485230251217361, -0.18974795286658774, 0.3869276446698422, 0.08078248880468727, 0.1540160143821176, 0.0433798238453246, 0.2678198192832374, 0.059434368954059076, 0.06487711916515457, 0.040186869595304466, 0.266895828559325, 0.17750257806423422, 0.07191063669311364, -0.21052318170085926, 0.07172276895346769, 0.061340726310324466] |
1,802.09826 | Evidence for hot clumpy accretion flow in the transitional millisecond
pulsar PSR J1023+0038 | We present simultaneous optical and near-infrared (IR) photometry of the
millisecond pulsar PSR J1023+0038 during its low-mass X-ray binary phase. The
r'- and K_s-band light curves show rectangular, flat-bottomed dips, similar to
the X-ray mode-switching (active-passive state transitions) behaviour observed
previously. The cross-correlation function (CCF) of the optical and near-IR
data reveals a strong, broad negative anti-correlation at negative lags, a
broad positive correlation at positive lags, with a strong, positive narrow
correlation superimposed. The shape of the CCF resembles the CCF of black hole
X-ray binaries but the time-scales are different. The features can be explained
by reprocessing and a hot accretion flow close to the neutron star's
magnetospheric radius. The optical emission is dominated by the reprocessed
component, whereas the near-IR emission contains the emission from plasmoids in
the hot accretion flow and a reprocessed component. The rapid active-passive
state transition occurs when the hot accretion flow material is channelled onto
the neutron star and is expelled from its magnetosphere. During the transition
the optical reprocessing component decreases resulting in the removal of a blue
spectral component. The accretion of clumpy material through the magnetic
barrier of the neutron star produces the observed near-IR/optical CCF and
variability. The dip at negative lags corresponds to the suppression of the
near-IR synchrotron component in the hot flow, whereas the broad positive
correlation at positive lags is driven by the increased synchrotron emission of
the outflowing plasmoids. The narrow peak in the CCF is due to the delayed
reprocessed component, enhanced by the increased X-ray emission.
| astro-ph.HE astro-ph.SR | we present simultaneous optical and nearinfrared ir photometry of the millisecond pulsar psr j10230038 during its lowmass xray binary phase the r and k_sband light curves show rectangular flatbottomed dips similar to the xray modeswitching activepassive state transitions behaviour observed previously the crosscorrelation function ccf of the optical and nearir data reveals a strong broad negative anticorrelation at negative lags a broad positive correlation at positive lags with a strong positive narrow correlation superimposed the shape of the ccf resembles the ccf of black hole xray binaries but the timescales are different the features can be explained by reprocessing and a hot accretion flow close to the neutron stars magnetospheric radius the optical emission is dominated by the reprocessed component whereas the nearir emission contains the emission from plasmoids in the hot accretion flow and a reprocessed component the rapid activepassive state transition occurs when the hot accretion flow material is channelled onto the neutron star and is expelled from its magnetosphere during the transition the optical reprocessing component decreases resulting in the removal of a blue spectral component the accretion of clumpy material through the magnetic barrier of the neutron star produces the observed neariroptical ccf and variability the dip at negative lags corresponds to the suppression of the nearir synchrotron component in the hot flow whereas the broad positive correlation at positive lags is driven by the increased synchrotron emission of the outflowing plasmoids the narrow peak in the ccf is due to the delayed reprocessed component enhanced by the increased xray emission | [['we', 'present', 'simultaneous', 'optical', 'and', 'nearinfrared', 'ir', 'photometry', 'of', 'the', 'millisecond', 'pulsar', 'psr', 'j10230038', 'during', 'its', 'lowmass', 'xray', 'binary', 'phase', 'the', 'r', 'and', 'k_sband', 'light', 'curves', 'show', 'rectangular', 'flatbottomed', 'dips', 'similar', 'to', 'the', 'xray', 'modeswitching', 'activepassive', 'state', 'transitions', 'behaviour', 'observed', 'previously', 'the', 'crosscorrelation', 'function', 'ccf', 'of', 'the', 'optical', 'and', 'nearir', 'data', 'reveals', 'a', 'strong', 'broad', 'negative', 'anticorrelation', 'at', 'negative', 'lags', 'a', 'broad', 'positive', 'correlation', 'at', 'positive', 'lags', 'with', 'a', 'strong', 'positive', 'narrow', 'correlation', 'superimposed', 'the', 'shape', 'of', 'the', 'ccf', 'resembles', 'the', 'ccf', 'of', 'black', 'hole', 'xray', 'binaries', 'but', 'the', 'timescales', 'are', 'different', 'the', 'features', 'can', 'be', 'explained', 'by', 'reprocessing', 'and', 'a', 'hot', 'accretion', 'flow', 'close', 'to', 'the', 'neutron', 'stars', 'magnetospheric', 'radius', 'the', 'optical', 'emission', 'is', 'dominated', 'by', 'the', 'reprocessed', 'component', 'whereas', 'the', 'nearir', 'emission', 'contains', 'the', 'emission', 'from', 'plasmoids', 'in', 'the', 'hot', 'accretion', 'flow', 'and', 'a', 'reprocessed', 'component', 'the', 'rapid', 'activepassive', 'state', 'transition', 'occurs', 'when', 'the', 'hot', 'accretion', 'flow', 'material', 'is', 'channelled', 'onto', 'the', 'neutron', 'star', 'and', 'is', 'expelled', 'from', 'its', 'magnetosphere', 'during', 'the', 'transition', 'the', 'optical', 'reprocessing', 'component', 'decreases', 'resulting', 'in', 'the', 'removal', 'of', 'a', 'blue', 'spectral', 'component', 'the', 'accretion', 'of', 'clumpy', 'material', 'through', 'the', 'magnetic', 'barrier', 'of', 'the', 'neutron', 'star', 'produces', 'the', 'observed', 'neariroptical', 'ccf', 'and', 'variability', 'the', 'dip', 'at', 'negative', 'lags', 'corresponds', 'to', 'the', 'suppression', 'of', 'the', 'nearir', 'synchrotron', 'component', 'in', 'the', 'hot', 'flow', 'whereas', 'the', 'broad', 'positive', 'correlation', 'at', 'positive', 'lags', 'is', 'driven', 'by', 'the', 'increased', 'synchrotron', 'emission', 'of', 'the', 'outflowing', 'plasmoids', 'the', 'narrow', 'peak', 'in', 'the', 'ccf', 'is', 'due', 'to', 'the', 'delayed', 'reprocessed', 'component', 'enhanced', 'by', 'the', 'increased', 'xray', 'emission']] | [-0.08412703259336744, 0.16922250297514027, -0.07871671460714995, 0.11041795642653882, -0.11030974229615109, -0.10704812682690282, 0.029308518408523762, 0.44901158123404955, -0.24910403961520047, -0.27428646819008623, 0.055911516946028264, -0.370396681228543, -0.01974435911796914, 0.2036383488617253, 0.004973664909016852, -0.030112665070348658, 0.0473985910096078, -0.10195947501297091, -0.04791497137105348, -0.1464276522762649, 0.3059139830699446, 0.06888342296576822, 0.1754267523028687, 0.036312495830341004, 0.05397135550749726, -0.0555050444643141, -0.0667437055440364, -0.033709336985267846, -0.060401163255572134, 0.01757776494293163, 0.21233714177254953, 0.07795806976729164, 0.17395231454706223, -0.3337804573752424, -0.26448223012746036, 0.05040185129927362, 0.1672446531225361, -0.023930490164853196, -0.05940676720666827, -0.23275029511948792, -0.0011933605424037166, -0.19539443614216997, -0.12715605253207626, 0.09145654529497466, 0.06915175834780231, 0.021018363177484158, -0.23178941054890553, 0.15125702522905068, 0.07843548949093412, 0.07047958569144648, -0.1517832099350498, -0.02211802685815914, -0.07474333168390919, 0.03219472981918622, 0.07401401810256727, 0.0787386888254653, 0.20895267528682654, -0.12439730996869484, -0.037156293469517696, 0.35153939349065516, -0.11605083154897917, 0.08438568004845258, 0.1797614337693827, -0.26196284232770695, -0.08907194242210073, 0.29057352024258354, 0.12483808487361553, 0.12070498974610339, -0.07415441796120813, -0.05203254680656006, -0.013517926945168452, 0.25037978046537174, 0.0466650427914882, 0.05764899484119287, 0.3892076764840121, 0.08575618248569834, -0.02970227609918106, 0.20403846893733477, -0.27084658989573224, -0.030653009360984845, -0.20521425132128393, -0.026188760674467272, -0.15602600028117497, 0.0942253507564173, -0.1402804087058244, -0.16320154439000523, 0.3887986749008882, 0.023627351123072644, 0.21624468216562973, -0.010118298204707018, 0.3554004359917313, 0.17319533729779663, 0.08718271831452262, 0.13973265018830003, 0.3572929302011343, 0.18653418618920897, 0.19045048591808653, -0.33151930411455827, 0.11845274714059105, -0.023906276834325172] |
1,802.09827 | Quantum Critical Points in Ferroelectric Relaxors: Stuffed Tungsten
Bronze K3Li2Ta5O15 and Lead Pyrochlore (Pb2Nb2O7) | We have synthesised ceramic specimens of the tetragonal tungsten bronze
K3Li2Ta5O15 (KLT) and characterized its phase transition via X-ray, dielectric
permittivity, ultrasonic spectroscopy and heat capacity measurements. The space
group of KLT is reported as both P4/mbm or Cmmm with the orthorhombic
distortion occurring when there are higher partial pressures of volatile K and
Li used within the closed crucibles for the solid state synthesis. The data
show strong relaxor behaviour, with the temperature at which the two dielectric
relative permittivity peaks decreasing with 104 K $\geqslant$ Tm1 $\geqslant$
69 K and 69 K $\geqslant$ Tm2 $\geqslant$ 46 K as probe frequency f is reduced
from 1 MHz to 316 Hz. The data satisfy a Vogel-Fulcher model with an
extrapolated freezing temperature for {\epsilon}' and {\epsilon}" of Tf1 = +
15.8 and - 11.8 K and Tf2 = - 5.0 and - 15.0 K for f $\rightarrow$ 0 (tending
to dc). Therefore by tuning frequency, the transition could be shifted to
absolute zero suggesting KLT has a relaxor-type quantum critical point. In
addition, we have reanalysed the conflicting literature for Pb2Nb2O7 pyrochlore
which suggests that this is also a relaxor-type quantum critical point as the
freezing temperature from Vogel-Fulcher fitting is below absolute zero. Since
the transition temperature evidenced in the dielectric data at ca. 100 kHz
shifts below zero Kelvin for very low frequencies, heat capacity data collected
in the zero-frequency (dc) limit, should not indicate a transition. Both of
these materials show promise as possible new relaxor-type quantum critical
points within non-perovskite based structures as multiple compounds are
reported with low-temperature transitions.
| cond-mat.mtrl-sci | we have synthesised ceramic specimens of the tetragonal tungsten bronze k3li2ta5o15 klt and characterized its phase transition via xray dielectric permittivity ultrasonic spectroscopy and heat capacity measurements the space group of klt is reported as both p4mbm or cmmm with the orthorhombic distortion occurring when there are higher partial pressures of volatile k and li used within the closed crucibles for the solid state synthesis the data show strong relaxor behaviour with the temperature at which the two dielectric relative permittivity peaks decreasing with 104 k geqslant tm1 geqslant 69 k and 69 k geqslant tm2 geqslant 46 k as probe frequency f is reduced from 1 mhz to 316 hz the data satisfy a vogelfulcher model with an extrapolated freezing temperature for epsilon and epsilon of tf1 158 and 118 k and tf2 50 and 150 k for f rightarrow 0 tending to dc therefore by tuning frequency the transition could be shifted to absolute zero suggesting klt has a relaxortype quantum critical point in addition we have reanalysed the conflicting literature for pb2nb2o7 pyrochlore which suggests that this is also a relaxortype quantum critical point as the freezing temperature from vogelfulcher fitting is below absolute zero since the transition temperature evidenced in the dielectric data at ca 100 khz shifts below zero kelvin for very low frequencies heat capacity data collected in the zerofrequency dc limit should not indicate a transition both of these materials show promise as possible new relaxortype quantum critical points within nonperovskite based structures as multiple compounds are reported with lowtemperature transitions | [['we', 'have', 'synthesised', 'ceramic', 'specimens', 'of', 'the', 'tetragonal', 'tungsten', 'bronze', 'k3li2ta5o15', 'klt', 'and', 'characterized', 'its', 'phase', 'transition', 'via', 'xray', 'dielectric', 'permittivity', 'ultrasonic', 'spectroscopy', 'and', 'heat', 'capacity', 'measurements', 'the', 'space', 'group', 'of', 'klt', 'is', 'reported', 'as', 'both', 'p4mbm', 'or', 'cmmm', 'with', 'the', 'orthorhombic', 'distortion', 'occurring', 'when', 'there', 'are', 'higher', 'partial', 'pressures', 'of', 'volatile', 'k', 'and', 'li', 'used', 'within', 'the', 'closed', 'crucibles', 'for', 'the', 'solid', 'state', 'synthesis', 'the', 'data', 'show', 'strong', 'relaxor', 'behaviour', 'with', 'the', 'temperature', 'at', 'which', 'the', 'two', 'dielectric', 'relative', 'permittivity', 'peaks', 'decreasing', 'with', '104', 'k', 'geqslant', 'tm1', 'geqslant', '69', 'k', 'and', '69', 'k', 'geqslant', 'tm2', 'geqslant', '46', 'k', 'as', 'probe', 'frequency', 'f', 'is', 'reduced', 'from', '1', 'mhz', 'to', '316', 'hz', 'the', 'data', 'satisfy', 'a', 'vogelfulcher', 'model', 'with', 'an', 'extrapolated', 'freezing', 'temperature', 'for', 'epsilon', 'and', 'epsilon', 'of', 'tf1', '158', 'and', '118', 'k', 'and', 'tf2', '50', 'and', '150', 'k', 'for', 'f', 'rightarrow', '0', 'tending', 'to', 'dc', 'therefore', 'by', 'tuning', 'frequency', 'the', 'transition', 'could', 'be', 'shifted', 'to', 'absolute', 'zero', 'suggesting', 'klt', 'has', 'a', 'relaxortype', 'quantum', 'critical', 'point', 'in', 'addition', 'we', 'have', 'reanalysed', 'the', 'conflicting', 'literature', 'for', 'pb2nb2o7', 'pyrochlore', 'which', 'suggests', 'that', 'this', 'is', 'also', 'a', 'relaxortype', 'quantum', 'critical', 'point', 'as', 'the', 'freezing', 'temperature', 'from', 'vogelfulcher', 'fitting', 'is', 'below', 'absolute', 'zero', 'since', 'the', 'transition', 'temperature', 'evidenced', 'in', 'the', 'dielectric', 'data', 'at', 'ca', '100', 'khz', 'shifts', 'below', 'zero', 'kelvin', 'for', 'very', 'low', 'frequencies', 'heat', 'capacity', 'data', 'collected', 'in', 'the', 'zerofrequency', 'dc', 'limit', 'should', 'not', 'indicate', 'a', 'transition', 'both', 'of', 'these', 'materials', 'show', 'promise', 'as', 'possible', 'new', 'relaxortype', 'quantum', 'critical', 'points', 'within', 'nonperovskite', 'based', 'structures', 'as', 'multiple', 'compounds', 'are', 'reported', 'with', 'lowtemperature', 'transitions']] | [-0.12107098256888094, 0.22394988748197875, -0.01189821163097804, -0.0199311890505669, -0.043201456903261715, -0.181637757073986, 0.14154291169506905, 0.38415860777604394, -0.22691804422584028, -0.29403064382859156, 0.06890202452314043, -0.35451665145592415, -0.05989385893826693, 0.19497270550687062, 0.03653984832135393, 0.03612620668332056, -0.0690954675633293, 0.03939939129418235, -0.09788636650341687, -0.16955650533145672, 0.2255201243629017, 0.02721844985570243, 0.28582629422544414, 0.06948091217782348, 0.06801729636356413, -0.08498064729069199, 0.1136720213225999, 0.005922790260115107, -0.16598910604912476, -0.014099870559675765, 0.32657139271032065, -0.0026688873667808366, 0.19233984760467138, -0.3298924592018011, -0.2102767583237437, 0.08040243631285193, 0.11011883214086993, 0.032263854150642146, -0.03365575887255545, -0.2387604126097358, 0.09986788368951238, -0.08810360150346241, -0.12749291446198185, -0.07977737811597763, 0.029338032501982525, -0.00936445718724599, -0.2644707677409315, 0.11881733529560279, 0.053062711189483025, 0.14979381935427227, -0.10901179723941823, -0.21341853807825828, -0.04660675163540873, 0.042032309238152266, 0.014023615949099622, 0.09843145443028334, 0.14981757200075663, -0.05502611484280351, -0.056257821146573406, 0.3641031356573876, -0.10668410701509856, -0.014932559002772905, 0.17484447991046181, -0.2254070770668477, -0.08051653076427101, 0.22503613849767135, 0.08465864329127726, 0.09486749805000727, -0.12748576949917378, 0.07696488020712877, 0.032654948166054965, 0.20203808493647557, 0.128444707399467, 0.019397292399844446, 0.2093416368952603, 0.14503571894965717, -0.008814428094410687, 0.12831270062224576, -0.13354555525984324, 0.004721908712099321, -0.25451531715521014, -0.1590870375839586, -0.18831249223603663, 0.1004337311574659, -0.14070634998108744, -0.14661209387304552, 0.27839042007690296, 0.12400197400529578, 0.2262964568235475, 0.026811917751729197, 0.22318643686594442, 0.10563663690300018, 0.07103601211929345, 0.06392611555656913, 0.23860936818800838, 0.17380964353560557, 0.14012979367225853, -0.23111487738651704, 0.049745946414986975, -0.02843537515764183] |
1,802.09828 | A unified framework for designing EPTAS's for load balancing on parallel
machines | We consider a general load balancing problem on parallel machines. Our
machine environment in particular generalizes the standard models of identical
machines, and the model of uniformly related machines, as well as machines with
a constant number of types, and machines with activation costs. The objective
functions that we consider contain in particular the makespan objective and the
minimization of the $\ell_p$-norm of the vector of loads of the machines both
with possibly job rejection.
We consider this general model and design an efficient polynomial time
approximation scheme (EPTAS) that applies for all its previously studied
special cases. This EPTAS improves the current best approximation scheme for
some of these cases where only a polynomial time approximation scheme (PTAS)
was known into an EPTAS.
| cs.DS | we consider a general load balancing problem on parallel machines our machine environment in particular generalizes the standard models of identical machines and the model of uniformly related machines as well as machines with a constant number of types and machines with activation costs the objective functions that we consider contain in particular the makespan objective and the minimization of the ell_pnorm of the vector of loads of the machines both with possibly job rejection we consider this general model and design an efficient polynomial time approximation scheme eptas that applies for all its previously studied special cases this eptas improves the current best approximation scheme for some of these cases where only a polynomial time approximation scheme ptas was known into an eptas | [['we', 'consider', 'a', 'general', 'load', 'balancing', 'problem', 'on', 'parallel', 'machines', 'our', 'machine', 'environment', 'in', 'particular', 'generalizes', 'the', 'standard', 'models', 'of', 'identical', 'machines', 'and', 'the', 'model', 'of', 'uniformly', 'related', 'machines', 'as', 'well', 'as', 'machines', 'with', 'a', 'constant', 'number', 'of', 'types', 'and', 'machines', 'with', 'activation', 'costs', 'the', 'objective', 'functions', 'that', 'we', 'consider', 'contain', 'in', 'particular', 'the', 'makespan', 'objective', 'and', 'the', 'minimization', 'of', 'the', 'ell_pnorm', 'of', 'the', 'vector', 'of', 'loads', 'of', 'the', 'machines', 'both', 'with', 'possibly', 'job', 'rejection', 'we', 'consider', 'this', 'general', 'model', 'and', 'design', 'an', 'efficient', 'polynomial', 'time', 'approximation', 'scheme', 'eptas', 'that', 'applies', 'for', 'all', 'its', 'previously', 'studied', 'special', 'cases', 'this', 'eptas', 'improves', 'the', 'current', 'best', 'approximation', 'scheme', 'for', 'some', 'of', 'these', 'cases', 'where', 'only', 'a', 'polynomial', 'time', 'approximation', 'scheme', 'ptas', 'was', 'known', 'into', 'an', 'eptas']] | [-0.13763291274587955, 0.06265125365297858, -0.02030597328989496, 0.06310241770904301, -0.056323751168806224, -0.20270804505074216, 0.09671269460100561, 0.37736142709130244, -0.28980320609820587, -0.2901832809776909, 0.0907821654916681, -0.201753641289073, -0.1281528770998721, 0.1934746382748633, -0.0648836656473577, 0.11586176310318537, 0.06720480273267435, 0.06143005175286934, -0.0139731643233268, -0.3432412902099801, 0.29937756320296394, 0.04541902571180535, 0.279722924083246, 0.015286478431775205, 0.11308876829383324, 0.031203027660658043, 0.004959834498285707, 0.03165026314599668, -0.07416057418677449, 0.07588614600864539, 0.24588874571022204, 0.17457534560948731, 0.3076355007792553, -0.4263569605086119, -0.19611076964065433, 0.1741965740643096, 0.09676470752475003, 0.06631661145647447, 0.004719841995299043, -0.16702742957990738, 0.054899208991217516, -0.14334757594511874, -0.09578452263057473, -0.07745186273654502, -0.026695293716094907, 0.08537798015130384, -0.30551712181899815, 0.03910110658785749, 0.10482238149063872, -0.009667157961596404, -0.12532759012162475, -0.16135831540938647, 0.1255337563118026, 0.06569018817671965, 0.017033467864459983, 0.0616393520669531, 0.06441488892831389, -0.1466705170422492, -0.19285722753603854, 0.4248826892430624, -0.05264777161421314, -0.2447739545567592, 0.17407600360456854, -0.03381361693872379, -0.1549736561681775, 0.07430601617670618, 0.2397286249625106, 0.1646770201097693, -0.12475910468117124, 0.10424383961588084, -0.08588137536219531, 0.11771646985453704, 0.052186974570260294, -0.0024282438483374615, 0.06579959260359887, 0.18513514149949076, 0.10055369187349213, 0.1732510334827126, -0.020410121183827398, -0.12633252620036084, -0.3069972216842636, -0.160190629209542, -0.17528752057396266, -0.001786018408189017, -0.09406747190505191, -0.19338607954071654, 0.37626616747404057, 0.10896009534987952, 0.18786427061375785, 0.17858735103471834, 0.37323479286785566, 0.12312146759453049, 0.06248362348677831, 0.17311136978828617, 0.1839497777956797, 0.07670672475961188, 0.08109936763667652, -0.20020867104176432, 0.09530764882407722, 0.05310704284385147] |
1,802.09829 | Effective Resistance Preserving Directed Graph Symmetrization | This work presents a new method for symmetrization of directed graphs that
constructs an undirected graph with equivalent pairwise effective resistances
as a given directed graph. Consequently a graph metric, square root of
effective resistance, is preserved between the directed graph and its
symmetrized version. It is shown that the preservation of this metric allows
for interpretation of algebraic and spectral properties of the symmetrized
graph in the context of the directed graph, due to the relationship between
effective resistance and the Laplacian spectrum. Additionally, Lyapunov theory
is used to demonstrate that the Laplacian matrix of a directed graph can be
decomposed into the product of a projection matrix, a skew symmetric matrix,
and the Laplacian matrix of the symmetrized graph. The application of effective
resistance preserving graph symmetrization is discussed in the context of
spectral graph partitioning and Kron reduction of directed graphs.
| cs.SI cs.DM | this work presents a new method for symmetrization of directed graphs that constructs an undirected graph with equivalent pairwise effective resistances as a given directed graph consequently a graph metric square root of effective resistance is preserved between the directed graph and its symmetrized version it is shown that the preservation of this metric allows for interpretation of algebraic and spectral properties of the symmetrized graph in the context of the directed graph due to the relationship between effective resistance and the laplacian spectrum additionally lyapunov theory is used to demonstrate that the laplacian matrix of a directed graph can be decomposed into the product of a projection matrix a skew symmetric matrix and the laplacian matrix of the symmetrized graph the application of effective resistance preserving graph symmetrization is discussed in the context of spectral graph partitioning and kron reduction of directed graphs | [['this', 'work', 'presents', 'a', 'new', 'method', 'for', 'symmetrization', 'of', 'directed', 'graphs', 'that', 'constructs', 'an', 'undirected', 'graph', 'with', 'equivalent', 'pairwise', 'effective', 'resistances', 'as', 'a', 'given', 'directed', 'graph', 'consequently', 'a', 'graph', 'metric', 'square', 'root', 'of', 'effective', 'resistance', 'is', 'preserved', 'between', 'the', 'directed', 'graph', 'and', 'its', 'symmetrized', 'version', 'it', 'is', 'shown', 'that', 'the', 'preservation', 'of', 'this', 'metric', 'allows', 'for', 'interpretation', 'of', 'algebraic', 'and', 'spectral', 'properties', 'of', 'the', 'symmetrized', 'graph', 'in', 'the', 'context', 'of', 'the', 'directed', 'graph', 'due', 'to', 'the', 'relationship', 'between', 'effective', 'resistance', 'and', 'the', 'laplacian', 'spectrum', 'additionally', 'lyapunov', 'theory', 'is', 'used', 'to', 'demonstrate', 'that', 'the', 'laplacian', 'matrix', 'of', 'a', 'directed', 'graph', 'can', 'be', 'decomposed', 'into', 'the', 'product', 'of', 'a', 'projection', 'matrix', 'a', 'skew', 'symmetric', 'matrix', 'and', 'the', 'laplacian', 'matrix', 'of', 'the', 'symmetrized', 'graph', 'the', 'application', 'of', 'effective', 'resistance', 'preserving', 'graph', 'symmetrization', 'is', 'discussed', 'in', 'the', 'context', 'of', 'spectral', 'graph', 'partitioning', 'and', 'kron', 'reduction', 'of', 'directed', 'graphs']] | [-0.12145327322246481, 0.08533409519774675, -0.08834727613591692, 0.04000010490320468, -0.12309227109653875, -0.1052906427228461, 0.006252626722723815, 0.3860283804565875, -0.31934665169036536, -0.2741573534084536, 0.0811288048522935, -0.2751066243234972, -0.23301654636290753, 0.08732798410346732, -0.09055342864788447, 0.04896805562465387, 0.13306884719834974, 0.10785158839684704, -0.05687622780452431, -0.1687023965823755, 0.33286498802933945, 0.03799545312196844, 0.2524015536198729, 0.1313578680257908, 0.10709376869464096, 0.06685701811673223, -0.05241775719979261, 0.13601301203986318, -0.10506239957284277, 0.16708749180219862, 0.24439332193125868, 0.14312364329170021, 0.1974974156409088, -0.3974595752855142, -0.18684639158729827, 0.19936590635916218, 0.11794769218088025, 0.042438006507129304, 0.031577536362520836, -0.254047730510744, 0.11468965062198953, -0.15890817340954932, -0.06185721609573294, -0.01780418408129157, 0.06928283810460319, -0.012930383713359738, -0.2714973965565959, 0.045844406723012474, 0.12763329981276506, 0.046134092366426356, 0.03429867437686577, -0.14146274773277887, -0.026948975916537974, 0.10643473660133572, -0.062634158490659, 0.03597776170095636, 0.0861005333200511, -0.09007855018070485, -0.1612661010132999, 0.3585835530086317, -0.03207189626603698, -0.2095213652961926, 0.07570606097579002, -0.0549271558993496, -0.12655470974924457, 0.06875226570668423, 0.14750906749395654, 0.09197417952883472, -0.1551045534838017, 0.12709954052560432, -0.05746818667588135, 0.09953003808024935, 0.057409058402602874, -0.0029801177402583156, 0.09855519626580644, 0.14816105843702745, 0.18825892602106048, 0.22309065827398122, 0.0038947431409421065, -0.06809529914203773, -0.26018305130613345, -0.15698924284596513, -0.26907992601465797, 0.0775001145278414, -0.2440555099257027, -0.25980978629599527, 0.49935452305039185, 0.08399644937405053, 0.19009147094200468, 0.0949590283659442, 0.25169124075263327, 0.12819723776596625, 0.06810620314920218, 0.11499217215330443, 0.12854658648009515, 0.2957242751856231, 0.05587043504783651, -0.19129215834093177, 0.06659422479505236, 0.1622761663311394] |
1,802.0983 | Equilibrium finite-frequency noise of an interacting mesoscopic
capacitor studied in time-dependent density functional theory | We calculate the frequency-dependent equilibrium noise of a mesoscopic
capacitor in time-dependent density functional theory (TDDFT). The capacitor is
modeled as a single-level quantum dot with on-site Coulomb interaction and
tunnel coupling to a nearby reservoir. The noise spectra are derived from
linear-response conductances via the fluctuation-dissipation theorem. Thereby,
we analyze the performance of a recently derived exchange-correlation potential
with time-nonlocal density dependence in the finite-frequency linear-response
regime. We compare our TDDFT noise spectra with real-time perturbation theory
and find excellent agreement for noise frequencies below the reservoir
temperature.
| cond-mat.mes-hall | we calculate the frequencydependent equilibrium noise of a mesoscopic capacitor in timedependent density functional theory tddft the capacitor is modeled as a singlelevel quantum dot with onsite coulomb interaction and tunnel coupling to a nearby reservoir the noise spectra are derived from linearresponse conductances via the fluctuationdissipation theorem thereby we analyze the performance of a recently derived exchangecorrelation potential with timenonlocal density dependence in the finitefrequency linearresponse regime we compare our tddft noise spectra with realtime perturbation theory and find excellent agreement for noise frequencies below the reservoir temperature | [['we', 'calculate', 'the', 'frequencydependent', 'equilibrium', 'noise', 'of', 'a', 'mesoscopic', 'capacitor', 'in', 'timedependent', 'density', 'functional', 'theory', 'tddft', 'the', 'capacitor', 'is', 'modeled', 'as', 'a', 'singlelevel', 'quantum', 'dot', 'with', 'onsite', 'coulomb', 'interaction', 'and', 'tunnel', 'coupling', 'to', 'a', 'nearby', 'reservoir', 'the', 'noise', 'spectra', 'are', 'derived', 'from', 'linearresponse', 'conductances', 'via', 'the', 'fluctuationdissipation', 'theorem', 'thereby', 'we', 'analyze', 'the', 'performance', 'of', 'a', 'recently', 'derived', 'exchangecorrelation', 'potential', 'with', 'timenonlocal', 'density', 'dependence', 'in', 'the', 'finitefrequency', 'linearresponse', 'regime', 'we', 'compare', 'our', 'tddft', 'noise', 'spectra', 'with', 'realtime', 'perturbation', 'theory', 'and', 'find', 'excellent', 'agreement', 'for', 'noise', 'frequencies', 'below', 'the', 'reservoir', 'temperature']] | [-0.14758646367850264, 0.060676852513230246, -0.109546640730892, 0.09682189190911987, 0.06765502507097265, -0.2034522793935926, 0.07496746091088385, 0.3483092954193943, -0.23482983294623286, -0.28381906633966425, -0.060884476155356575, -0.33571611403414375, -0.14723540976476135, 0.17853421596496294, 0.0008650381494773908, 0.035621747709392165, 0.01793570053146294, -0.04637725823925117, -0.053408817220688534, -0.12489817780180928, 0.24797757933690642, 0.07380573955244187, 0.2910087176630001, 0.06242926543829649, 0.047470793834353764, 0.013145192541977328, 0.07329403074311741, 0.06300826503612687, -0.14117767797845804, 0.04082879162487689, 0.2723722551547755, -0.12878093804661814, 0.25633827778981644, -0.5019008083624786, -0.24528665982940223, -0.00625259599261237, 0.05424755032199142, 0.17883047777531522, -0.03753939449912711, -0.30119218142556675, -0.018340831026016326, -0.22333277192678344, -0.12439056124742237, -0.13739083135589497, 0.0015671932651253229, 0.091817316170154, -0.2963527840447058, 0.18232850126105915, -0.044175095196938914, 0.017258844139535774, -0.07436179556998979, -0.1091836906257975, -0.01080805424789197, 0.07926952149823643, -0.0480941798658309, -0.014043525274675549, 0.2708363899846007, -0.12295852683149697, -0.042073536789819094, 0.2916088325463319, -0.19472683614559388, -0.13270459535500306, 0.1508709479364033, -0.17205680197816384, -0.06921442028846633, 0.10864217044475614, 0.06741263177455141, 0.04353311970788107, -0.2354888018388092, 0.16889348635423845, 0.05222855404207713, 0.17765291642104641, 0.03027255649500516, 0.08078932532381065, 0.18746473455246998, 0.15349836055492835, 0.023060006905723823, 0.14221677589073276, -0.1278505257299442, -0.14390326893019878, -0.2839350957590877, -0.05649863871526015, -0.2561783013928137, 0.10947042656015982, -0.10114298609649146, -0.19904274405555777, 0.38015527424063755, 0.1936263779356155, 0.12020625633689878, 0.0841654801552885, 0.33908615395259323, 0.27437467914430447, -0.015151681420340967, 0.038323883118965986, 0.24179869310294666, 0.28942873145798953, 0.10109789144205913, -0.35434876076531796, -0.041073405738459544, 0.01108813390209015] |
1,802.09831 | Effect of edge defects on band structure of zigzag graphene nanoribbons | In this article, we report band structure studies of zigzag graphene
nanoribbons (ZGNRs) on introducing defects (sp_3 hybridized carbon atoms) in
different concentrations at edges by varying the ratio of sp_3 to sp_2
hybridized carbon atoms. On the basis of theoretical analyses, band gap values
of ZGNRs are found to be strongly dependent on relative arrangement of sp3 to
sp2 hybridized carbon atoms at the edges for a defect concentration; so the
findings would greatly help in understanding band gap of nanoribbons for their
electronic applications.
| cond-mat.mes-hall | in this article we report band structure studies of zigzag graphene nanoribbons zgnrs on introducing defects sp_3 hybridized carbon atoms in different concentrations at edges by varying the ratio of sp_3 to sp_2 hybridized carbon atoms on the basis of theoretical analyses band gap values of zgnrs are found to be strongly dependent on relative arrangement of sp3 to sp2 hybridized carbon atoms at the edges for a defect concentration so the findings would greatly help in understanding band gap of nanoribbons for their electronic applications | [['in', 'this', 'article', 'we', 'report', 'band', 'structure', 'studies', 'of', 'zigzag', 'graphene', 'nanoribbons', 'zgnrs', 'on', 'introducing', 'defects', 'sp_3', 'hybridized', 'carbon', 'atoms', 'in', 'different', 'concentrations', 'at', 'edges', 'by', 'varying', 'the', 'ratio', 'of', 'sp_3', 'to', 'sp_2', 'hybridized', 'carbon', 'atoms', 'on', 'the', 'basis', 'of', 'theoretical', 'analyses', 'band', 'gap', 'values', 'of', 'zgnrs', 'are', 'found', 'to', 'be', 'strongly', 'dependent', 'on', 'relative', 'arrangement', 'of', 'sp3', 'to', 'sp2', 'hybridized', 'carbon', 'atoms', 'at', 'the', 'edges', 'for', 'a', 'defect', 'concentration', 'so', 'the', 'findings', 'would', 'greatly', 'help', 'in', 'understanding', 'band', 'gap', 'of', 'nanoribbons', 'for', 'their', 'electronic', 'applications']] | [-0.132707697906004, 0.14583943253775766, 0.038420281639457286, -0.04244666281352605, 0.01629260124944442, -0.1517943738264043, 0.1748363410560302, 0.5311225501943874, -0.2685870854520654, -0.30704327239598855, -0.056866973771781, -0.33651633075359894, -0.11354187251971923, 0.06793598920465951, 0.015289033953863454, -0.033272436995119566, 0.1187837174139827, -0.14759429122871123, -0.09415819332654397, -0.2066915116458009, 0.2739494598767978, 0.06300416571952133, 0.3390166868556695, 0.161192821967135, -0.11527256047106292, -0.005129588128303189, 0.10198233671576144, 0.03733118796294712, -0.18207684784274863, 0.20144310663734755, 0.2869270389383457, -0.1560925318612661, 0.2131615570179714, -0.533558206969356, -0.14877208636467715, -0.05407077874090657, 0.18885667283222618, 0.1775094020595572, -0.01891600017587329, -0.27294299182066895, 0.07088109901376877, -0.08443414474871144, -0.12322941611812685, -0.0027544133095856174, 0.01000508677259267, 0.019979347138951747, -0.1657437862672686, 0.037229707520679535, 0.0017019487018535666, 0.08328699097261731, -0.08623018835570259, -0.23156991377697292, -0.16315039332552128, 0.0028812942447152034, 0.02695793426786381, -0.05579457395511584, 0.24518393823899418, -0.08002273284224232, -0.10566892372219856, 0.4088807087952653, -0.06640408181372177, -0.10540334704186184, 0.21054803256607468, -0.13341930145622197, -0.14066668953858766, 0.17118341002209359, 0.11859345548864768, 0.08202627898160234, -0.09796047695500058, 0.083430944288329, 0.008052832581641444, 0.17110208398943028, 0.10859433017917965, 0.13211452926744718, 0.2665053169545998, 0.1854817920773997, 0.11731070940977478, 0.08677925847061203, -0.05963280039042773, 0.02171044047158885, -0.14174186480960932, -0.22436686986720705, -0.24416317728331247, 0.024848621832319052, -0.046069140641400254, -0.24027501940951648, 0.47279306201556004, 0.07190417201000165, 0.1643914811380477, -0.07635814485039158, 0.12856528820492416, 0.08488060968243573, 0.09241932271194296, -0.04029902267123921, 0.23122183072481708, 0.19467293322703474, 0.05625590908127916, -0.26349181003015804, 0.06973191782697497, -0.00453174259816577] |
1,802.09832 | Estimates of Potential functions of random walks on $Z$ with zero mean
and infinite variance and their applications | Let $S_n =X_1+\cdots +X_n$ be an irreducible random walk (r.w.) on the one
dimensional integer lattice with zero mean, infinite variance and i.i.d.
increments $X_n$. We obtain an upper and lower bounds of the potential
function, $a(x)$, of $S_n$ in the form $a(x)\asymp x/m(x)$ under a reasonable
condition on the distribution of $X_n$; we especially show that as $x\to\infty$
$$a(x) \asymp \frac{x}{m_-(x)} \quad\mbox{and}\quad \frac{a(-x)}{a(x)} \to 0
\quad\;\;\mbox{if}\quad \lim_{x\to +\infty} \frac{m_+(x)}{m_-(x)} =0,$$ where
$m_\pm(x) = \int_0^xdy\int_y^\infty P[\pm X_1>u]du$ and $m=m_++m_-$. Under
certain conditions on the tails of the distribution of $X$ we derive precise
asymptotic forms of $a(x)$ as $x\to +\infty$ or/and $-\infty$. The results are
applied to derive a sufficient condition for the relative stability of the
ladder height and estimates of some escape probabilities from the origin; we
show among others that under the above condition on $m_+/m-$, $P[S_n>0] \to
1/\alpha$ if and only if the probability of exiting a long interval $[-Q,R]$
through the upper boundary converges to $\lambda^{\alpha-1}$ as $Q/(Q+R) \to
\lambda$ for any $0<\lambda<1$.
| math.PR | let s_n x_1cdots x_n be an irreducible random walk rw on the one dimensional integer lattice with zero mean infinite variance and iid increments x_n we obtain an upper and lower bounds of the potential function ax of s_n in the form axasymp xmx under a reasonable condition on the distribution of x_n we especially show that as xtoinfty ax asymp fracxm_x quadmboxandquad fracaxax to 0 quadmboxifquad lim_xto infty fracm_xm_x 0 where m_pmx int_0xdyint_yinfty ppm x_1udu and mm_m_ under certain conditions on the tails of the distribution of x we derive precise asymptotic forms of ax as xto infty orand infty the results are applied to derive a sufficient condition for the relative stability of the ladder height and estimates of some escape probabilities from the origin we show among others that under the above condition on m_m ps_n0 to 1alpha if and only if the probability of exiting a long interval qr through the upper boundary converges to lambdaalpha1 as qqr to lambda for any 0lambda1 | [['let', 's_n', 'x_1cdots', 'x_n', 'be', 'an', 'irreducible', 'random', 'walk', 'rw', 'on', 'the', 'one', 'dimensional', 'integer', 'lattice', 'with', 'zero', 'mean', 'infinite', 'variance', 'and', 'iid', 'increments', 'x_n', 'we', 'obtain', 'an', 'upper', 'and', 'lower', 'bounds', 'of', 'the', 'potential', 'function', 'ax', 'of', 's_n', 'in', 'the', 'form', 'axasymp', 'xmx', 'under', 'a', 'reasonable', 'condition', 'on', 'the', 'distribution', 'of', 'x_n', 'we', 'especially', 'show', 'that', 'as', 'xtoinfty', 'ax', 'asymp', 'fracxm_x', 'quadmboxandquad', 'fracaxax', 'to', '0', 'quadmboxifquad', 'lim_xto', 'infty', 'fracm_xm_x', '0', 'where', 'm_pmx', 'int_0xdyint_yinfty', 'ppm', 'x_1udu', 'and', 'mm_m_', 'under', 'certain', 'conditions', 'on', 'the', 'tails', 'of', 'the', 'distribution', 'of', 'x', 'we', 'derive', 'precise', 'asymptotic', 'forms', 'of', 'ax', 'as', 'xto', 'infty', 'orand', 'infty', 'the', 'results', 'are', 'applied', 'to', 'derive', 'a', 'sufficient', 'condition', 'for', 'the', 'relative', 'stability', 'of', 'the', 'ladder', 'height', 'and', 'estimates', 'of', 'some', 'escape', 'probabilities', 'from', 'the', 'origin', 'we', 'show', 'among', 'others', 'that', 'under', 'the', 'above', 'condition', 'on', 'm_m', 'ps_n0', 'to', '1alpha', 'if', 'and', 'only', 'if', 'the', 'probability', 'of', 'exiting', 'a', 'long', 'interval', 'qr', 'through', 'the', 'upper', 'boundary', 'converges', 'to', 'lambdaalpha1', 'as', 'qqr', 'to', 'lambda', 'for', 'any', '0lambda1']] | [-0.1536849421599219, 0.13559066726123883, -0.09189096697335762, 0.05012412832809552, -0.013627316526347591, -0.1711777667575065, 0.07736788602290495, 0.37151442260271117, -0.2869207851108043, -0.15910919197504558, 0.1400124720650755, -0.28615304114477286, -0.0722189165208669, 0.16694135253557996, -0.0663714695962206, 0.045881838988392584, 0.00983237408612284, 0.14036878546279286, -0.07290754817846802, -0.25081443472975684, 0.2606641398262112, -0.034919152724286244, 0.20162910346182122, 0.026534540145733063, 0.11376898229692972, 0.009548129012147265, 0.08131368087093917, -0.0662576480453173, -0.23499613353548826, 0.018722155088964368, 0.17709529130520568, 0.09952633739599297, 0.26132603885545846, -0.3609512703962654, -0.11681744593285745, 0.20092971732900028, 0.18231649604595956, -0.04380088393245974, 0.01432483435398148, -0.2884975184356013, 0.15361185744404793, -0.09810869560366677, -0.18915047601725335, -0.022302573135182743, 0.07252562909777607, 0.10278707776338823, -0.39185580354664595, 0.0653582476327316, 0.11022255565964564, 0.03560119746816194, -0.06556479133169858, -0.20209546905431536, -0.030612534606048177, 0.10215757336587675, 0.07063845835866467, 0.04372284537361514, 0.06144499299266646, -0.09605128632378651, -0.01413190372874059, 0.32532236607474907, -0.1351099373292058, -0.23529414423335823, 0.10303855134294398, -0.22660687460954632, -0.15472686570743285, 0.111144254709624, 0.1227300333880609, 0.15478823854618015, -0.0760802936349665, 0.17264723176729954, -0.08200316375361816, 0.12880537940429584, 0.11241253741355914, 0.04055526902065462, 0.12013319668570353, 0.04382878822845317, 0.14458851968614203, 0.1397621841748215, -0.08358486086400527, -0.0395243734001152, -0.37286183942229517, -0.12935218747945562, -0.1923699504755918, 0.1857697603322806, -0.1694957550339994, -0.19082330239320835, 0.2730345443356782, 0.14301282779891944, 0.24930471435166715, 0.15125401662775284, 0.20730558935432664, 0.16638368488206798, -0.055469280652581686, 0.087104182735446, 0.08195585611280085, 0.1914369985776683, -0.002709291409701109, -0.17119498677822131, 0.09640081088028608, 0.10578136843809437] |
1,802.09833 | Parabolicity, Brownian escape rate and properness of self-similar
solutions of the direct and inverse Mean Curvature Flow | We study some potential theoretic properties of homothetic solitons
$\Sigma^n$ of the MCF and the IMCF. Using the analysis of the extrinsic
distance function defined on these submanifolds in $\mathbb{R}^{n+m}$, we
observe similarities and differences in the geometry of solitons in both flows.
In particular, we show that parabolic MCF-solitons $\Sigma^n$ with $n>2$ are
self-shrinkers and that parabolic IMCF-solitons of any dimension are
self-expanders. We have studied too the geometric behavior of parabolic MCF and
IMCF-solitons confined in a ball, the behavior of the Mean Exit Time function
for the Brownian motion defined on $\Sigma$ as well as a classification of
properly immersed MCF-self-shrinkers with bounded second fundamental form,
following the lines of \cite{CaoLi}.
| math.DG | we study some potential theoretic properties of homothetic solitons sigman of the mcf and the imcf using the analysis of the extrinsic distance function defined on these submanifolds in mathbbrnm we observe similarities and differences in the geometry of solitons in both flows in particular we show that parabolic mcfsolitons sigman with n2 are selfshrinkers and that parabolic imcfsolitons of any dimension are selfexpanders we have studied too the geometric behavior of parabolic mcf and imcfsolitons confined in a ball the behavior of the mean exit time function for the brownian motion defined on sigma as well as a classification of properly immersed mcfselfshrinkers with bounded second fundamental form following the lines of citecaoli | [['we', 'study', 'some', 'potential', 'theoretic', 'properties', 'of', 'homothetic', 'solitons', 'sigman', 'of', 'the', 'mcf', 'and', 'the', 'imcf', 'using', 'the', 'analysis', 'of', 'the', 'extrinsic', 'distance', 'function', 'defined', 'on', 'these', 'submanifolds', 'in', 'mathbbrnm', 'we', 'observe', 'similarities', 'and', 'differences', 'in', 'the', 'geometry', 'of', 'solitons', 'in', 'both', 'flows', 'in', 'particular', 'we', 'show', 'that', 'parabolic', 'mcfsolitons', 'sigman', 'with', 'n2', 'are', 'selfshrinkers', 'and', 'that', 'parabolic', 'imcfsolitons', 'of', 'any', 'dimension', 'are', 'selfexpanders', 'we', 'have', 'studied', 'too', 'the', 'geometric', 'behavior', 'of', 'parabolic', 'mcf', 'and', 'imcfsolitons', 'confined', 'in', 'a', 'ball', 'the', 'behavior', 'of', 'the', 'mean', 'exit', 'time', 'function', 'for', 'the', 'brownian', 'motion', 'defined', 'on', 'sigma', 'as', 'well', 'as', 'a', 'classification', 'of', 'properly', 'immersed', 'mcfselfshrinkers', 'with', 'bounded', 'second', 'fundamental', 'form', 'following', 'the', 'lines', 'of', 'citecaoli']] | [-0.14594914365149692, 0.08993210597390976, -0.0885018979139421, 0.06353559937123038, -0.01529968609828331, -0.1102005657697216, -0.04515387155243768, 0.3968897180016571, -0.2541729334160822, -0.2254555772033033, 0.11538712047958968, -0.31032857599608393, -0.17366626771559956, 0.17248807037078323, -0.09314890240037113, 0.0697097334660453, 0.023318114058208574, 0.08781533338420025, -0.061996875866957075, -0.22707560853263653, 0.3598233176685801, -0.08264242640670834, 0.21062634857115123, 0.07927131745964289, 0.09144533910775779, 0.0083125085108529, 0.008634020181355673, 0.09844819914150146, -0.20489331113172957, 0.12588284780707107, 0.18447373764495442, 0.03884777331237741, 0.24546842680338327, -0.39430667634267325, -0.2273973984507109, 0.1396449284816007, 0.14849570249164595, 0.02259730045265014, -0.05367899909316468, -0.27984275064781444, 0.07781464996141031, -0.05416402979561666, -0.17971251996387855, -0.035515518961559744, 0.03222250798289929, 0.11469900207551316, -0.17431762021615965, 0.09008545169623894, 0.1213733122839994, 0.07712577778948557, -0.08020207465737375, -0.09189538524802261, -0.0627059989989043, 0.13831357560825422, 0.05870713211527658, 0.005615702695683192, 0.09951360466881493, -0.12829779351179257, -0.09488372589299164, 0.39445591413356157, -0.14045573813721127, -0.2778037163864719, 0.14382025957910702, -0.1617763050182492, -0.08039757674410426, 0.0850688805504608, 0.21752038964395062, 0.15316007496498593, -0.08450692440938512, 0.12136899736932043, -0.06648999724725108, 0.08720015378352768, 0.11608214033853023, 0.023740245480039113, 0.13651212851234942, 0.13755651452117215, 0.06827759149125479, 0.1451890116943038, -0.0734318409397036, -0.11286190501627845, -0.3852956380455866, -0.1903931298592222, -0.15854717582600927, 0.0838539013414806, -0.11737332585718431, -0.19457700694783017, 0.37180290746058275, 0.03429820906336701, 0.25025148396252084, 0.07794441201365254, 0.2210258148576415, 0.09928202599398109, 0.026223587671106836, 0.10075048326088518, 0.2245017190887315, 0.15598159541862958, 0.057350835713788594, -0.21073118597509366, -0.021689114966130723, 0.10723159364421976] |
1,802.09834 | Spatio-Temporal Graph Convolution for Skeleton Based Action Recognition | Variations of human body skeletons may be considered as dynamic graphs, which
are generic data representation for numerous real-world applications. In this
paper, we propose a spatio-temporal graph convolution (STGC) approach for
assembling the successes of local convolutional filtering and sequence learning
ability of autoregressive moving average. To encode dynamic graphs, the
constructed multi-scale local graph convolution filters, consisting of matrices
of local receptive fields and signal mappings, are recursively performed on
structured graph data of temporal and spatial domain. The proposed model is
generic and principled as it can be generalized into other dynamic models. We
theoretically prove the stability of STGC and provide an upper-bound of the
signal transformation to be learnt. Further, the proposed recursive model can
be stacked into a multi-layer architecture. To evaluate our model, we conduct
extensive experiments on four benchmark skeleton-based action datasets,
including the large-scale challenging NTU RGB+D. The experimental results
demonstrate the effectiveness of our proposed model and the improvement over
the state-of-the-art.
| cs.CV | variations of human body skeletons may be considered as dynamic graphs which are generic data representation for numerous realworld applications in this paper we propose a spatiotemporal graph convolution stgc approach for assembling the successes of local convolutional filtering and sequence learning ability of autoregressive moving average to encode dynamic graphs the constructed multiscale local graph convolution filters consisting of matrices of local receptive fields and signal mappings are recursively performed on structured graph data of temporal and spatial domain the proposed model is generic and principled as it can be generalized into other dynamic models we theoretically prove the stability of stgc and provide an upperbound of the signal transformation to be learnt further the proposed recursive model can be stacked into a multilayer architecture to evaluate our model we conduct extensive experiments on four benchmark skeletonbased action datasets including the largescale challenging ntu rgbd the experimental results demonstrate the effectiveness of our proposed model and the improvement over the stateoftheart | [['variations', 'of', 'human', 'body', 'skeletons', 'may', 'be', 'considered', 'as', 'dynamic', 'graphs', 'which', 'are', 'generic', 'data', 'representation', 'for', 'numerous', 'realworld', 'applications', 'in', 'this', 'paper', 'we', 'propose', 'a', 'spatiotemporal', 'graph', 'convolution', 'stgc', 'approach', 'for', 'assembling', 'the', 'successes', 'of', 'local', 'convolutional', 'filtering', 'and', 'sequence', 'learning', 'ability', 'of', 'autoregressive', 'moving', 'average', 'to', 'encode', 'dynamic', 'graphs', 'the', 'constructed', 'multiscale', 'local', 'graph', 'convolution', 'filters', 'consisting', 'of', 'matrices', 'of', 'local', 'receptive', 'fields', 'and', 'signal', 'mappings', 'are', 'recursively', 'performed', 'on', 'structured', 'graph', 'data', 'of', 'temporal', 'and', 'spatial', 'domain', 'the', 'proposed', 'model', 'is', 'generic', 'and', 'principled', 'as', 'it', 'can', 'be', 'generalized', 'into', 'other', 'dynamic', 'models', 'we', 'theoretically', 'prove', 'the', 'stability', 'of', 'stgc', 'and', 'provide', 'an', 'upperbound', 'of', 'the', 'signal', 'transformation', 'to', 'be', 'learnt', 'further', 'the', 'proposed', 'recursive', 'model', 'can', 'be', 'stacked', 'into', 'a', 'multilayer', 'architecture', 'to', 'evaluate', 'our', 'model', 'we', 'conduct', 'extensive', 'experiments', 'on', 'four', 'benchmark', 'skeletonbased', 'action', 'datasets', 'including', 'the', 'largescale', 'challenging', 'ntu', 'rgbd', 'the', 'experimental', 'results', 'demonstrate', 'the', 'effectiveness', 'of', 'our', 'proposed', 'model', 'and', 'the', 'improvement', 'over', 'the', 'stateoftheart']] | [-0.05656219539117574, -0.005863362175098442, -0.07547426667139163, 0.03682201365181417, -0.10125156755007252, -0.11706548858502949, -0.031049158105973074, 0.4584024717203445, -0.3036833632375217, -0.33155321162826396, 0.09800912178032399, -0.243319987321925, -0.23414586935146356, 0.1863415148080453, -0.08618465981181757, 0.11243132782926105, 0.1333321209445044, 0.03035065439406834, -0.04501845654859035, -0.2723507680015762, 0.27935479422686277, 0.023377459453861518, 0.3271877123847788, 0.027361695812785147, 0.14739868266329767, -0.011090101251654603, -0.051477656311665974, 0.0373002118833455, -0.0489515587558142, 0.17103193784822468, 0.26525074481651245, 0.18472562886035807, 0.2663869146648564, -0.4532444851335, -0.25252408725295766, 0.09626486970479657, 0.1393938029711681, 0.07187124855399928, -0.02482703006984436, -0.377644029158501, 0.11916055222815132, -0.16387858382285353, 0.0017016963533091325, -0.15885129307661158, -0.027920583596476065, 0.015713947003040418, -0.3331258424592239, 0.03132231727559648, 0.0846196716934454, 0.06282188619607715, -0.04968946701617061, -0.11098694204306805, 0.01309460974988286, 0.16824705201419599, -0.021024025185464847, 0.020280341223963064, 0.1403517872267575, -0.13133613361051288, -0.17225207475784385, 0.340155592435442, -0.07052628654572698, -0.226961860891696, 0.17983972641673904, -0.03192346833249623, -0.1383826258868255, 0.07062437938077858, 0.2687499210839217, 0.12788652860197341, -0.16712586474777372, 0.043525069980037016, -0.09904553581971998, 0.16654929567565335, 0.040288158323052395, 0.00357662525349929, 0.16829417613737377, 0.2673050758348387, 0.03195547350009696, 0.18965009559861407, -0.13057013265903533, -0.08233229176897303, -0.22820528335064466, -0.0781469961921512, -0.17855859664268792, -0.04707479397018934, -0.1668690776728729, -0.16131906863301992, 0.4668074748306363, 0.227710735182893, 0.19568481379947453, 0.10984648656700795, 0.33042158267064087, 0.050872710373908, 0.1006655414102967, 0.062243242328411635, 0.1474405917034335, 0.06927145500149992, 0.06910571413629193, -0.16753974003483035, 0.041727381986910825, 0.07732460841415795] |
1,802.09835 | Slowdown of the surface diffusion during early stages of bacterial
colonization | We study the surface diffusion of the model cyanobacterium Synechocystis sp.
PCC $6803$ during the incipient stages of cell contact with a glass surface in
the dilute regime. We observe a twitching motility with alternating immobile
"tumble" and mobile "run" periods, resulting in a normal diffusion described by
a continuous time random walk with a coefficient of diffusion $D$.
Surprisingly, $D$ is found to decrease with time down to a plateau. This is
observed only when the cyanobacterial cells are able to produce released
extracellular polysaccharides, as shown by a comparative study between the
wild-type strain and various polysaccharides-depleted mutants. The analysis of
the trajectories taken by the bacterial cells shows that the temporal
characteristics of their intermittent motion depend on the instantaneous
fraction of visited sites during diffusion. This describes quantitatively the
time dependence of $D$, related to the progressive surface coverage by the
polysaccharides. The observed slowdown of the surface diffusion may constitute
a basic precursor mechanism for microcolony formation and provides clues for
controlling biofilm formation.
| physics.bio-ph | we study the surface diffusion of the model cyanobacterium synechocystis sp pcc 6803 during the incipient stages of cell contact with a glass surface in the dilute regime we observe a twitching motility with alternating immobile tumble and mobile run periods resulting in a normal diffusion described by a continuous time random walk with a coefficient of diffusion d surprisingly d is found to decrease with time down to a plateau this is observed only when the cyanobacterial cells are able to produce released extracellular polysaccharides as shown by a comparative study between the wildtype strain and various polysaccharidesdepleted mutants the analysis of the trajectories taken by the bacterial cells shows that the temporal characteristics of their intermittent motion depend on the instantaneous fraction of visited sites during diffusion this describes quantitatively the time dependence of d related to the progressive surface coverage by the polysaccharides the observed slowdown of the surface diffusion may constitute a basic precursor mechanism for microcolony formation and provides clues for controlling biofilm formation | [['we', 'study', 'the', 'surface', 'diffusion', 'of', 'the', 'model', 'cyanobacterium', 'synechocystis', 'sp', 'pcc', '6803', 'during', 'the', 'incipient', 'stages', 'of', 'cell', 'contact', 'with', 'a', 'glass', 'surface', 'in', 'the', 'dilute', 'regime', 'we', 'observe', 'a', 'twitching', 'motility', 'with', 'alternating', 'immobile', 'tumble', 'and', 'mobile', 'run', 'periods', 'resulting', 'in', 'a', 'normal', 'diffusion', 'described', 'by', 'a', 'continuous', 'time', 'random', 'walk', 'with', 'a', 'coefficient', 'of', 'diffusion', 'd', 'surprisingly', 'd', 'is', 'found', 'to', 'decrease', 'with', 'time', 'down', 'to', 'a', 'plateau', 'this', 'is', 'observed', 'only', 'when', 'the', 'cyanobacterial', 'cells', 'are', 'able', 'to', 'produce', 'released', 'extracellular', 'polysaccharides', 'as', 'shown', 'by', 'a', 'comparative', 'study', 'between', 'the', 'wildtype', 'strain', 'and', 'various', 'polysaccharidesdepleted', 'mutants', 'the', 'analysis', 'of', 'the', 'trajectories', 'taken', 'by', 'the', 'bacterial', 'cells', 'shows', 'that', 'the', 'temporal', 'characteristics', 'of', 'their', 'intermittent', 'motion', 'depend', 'on', 'the', 'instantaneous', 'fraction', 'of', 'visited', 'sites', 'during', 'diffusion', 'this', 'describes', 'quantitatively', 'the', 'time', 'dependence', 'of', 'd', 'related', 'to', 'the', 'progressive', 'surface', 'coverage', 'by', 'the', 'polysaccharides', 'the', 'observed', 'slowdown', 'of', 'the', 'surface', 'diffusion', 'may', 'constitute', 'a', 'basic', 'precursor', 'mechanism', 'for', 'microcolony', 'formation', 'and', 'provides', 'clues', 'for', 'controlling', 'biofilm', 'formation']] | [-0.11919631962207079, 0.21178948275268167, -0.05432855555028211, 0.013735400237021082, 0.00018115594450916563, -0.14150408784016258, 0.05919633569733594, 0.36334451080654706, -0.27041515206829425, -0.26891743171879734, 0.05939184164855674, -0.23721440031191118, -0.18071160097384736, 0.14448739822200013, -0.034934551133552476, -0.030631295491253867, 0.05046579893609132, 0.012732491577653923, 0.031026794760864937, -0.22757691655438284, 0.1993084728823132, 0.05518814632835399, 0.2995597977479476, 0.04082162403834185, 0.10480464077305182, -0.021738532984662533, -0.019422212478405396, 0.013828949282123219, -0.17392157631465602, 0.08050674693497838, 0.19375401208665044, 0.03314631586960916, 0.2482722066564574, -0.4767360829393424, -0.2505953107195507, 0.0709436076677299, 0.15108820581337482, 0.1025147906986517, -0.03720761215039862, -0.24784004380039515, 0.04922976922465577, -0.11546812151070862, -0.14478871932217208, -0.00857722576862822, 0.07562770674667263, 0.06899383924402562, -0.2410868424811356, 0.14273232389504778, 0.04846804075142635, 0.051570223001319734, -0.0942746172686817, -0.07846677763986268, -0.08550528359081086, 0.14995488487797307, 0.07338410085607652, 0.015869538679475055, 0.20150665044448465, -0.11016625899702333, -0.09506645315282401, 0.3605581345036626, -0.06949393281961204, -0.14424337785957114, 0.22430892159519272, -0.18732066145942858, -0.06280708643940411, 0.20163875319606936, 0.17944927438760974, 0.08244325397702466, -0.15104717335435408, -0.0030797724455710737, 0.0052244833267260605, 0.15350556878616944, 0.06472042442709651, -0.04117152678857868, 0.18841180502966468, 0.25074846775082515, 0.021724856944361125, 0.12281424917801771, -0.13269143816571505, -0.09947313774665374, -0.21936827797617298, -0.17003365621868788, -0.1421751337294977, 0.07123631930014762, -0.08953849608163485, -0.17686145030598882, 0.3889114969531961, 0.06335988904521357, 0.2309748108714952, 0.055389091899130674, 0.19563677104486574, 0.0467577263216732, 0.06442943178643916, 0.03961193857997257, 0.1722187402206362, 0.08714198505566899, 0.1443128634009987, -0.2986459919983255, 0.17754345913445355, 0.04299055351692091] |
1,802.09836 | Spinorial representation of submanifolds in $SL_n(\mathbb{C})/SU(n)$ | We give a spinorial representation of a submanifold of any dimension and
co-dimension in a symmetric space $G/H,$ where $G$ is a complex semi-simple Lie
group and $H$ is a compact real form of $G.$ This in particular includes
$SL_n(\mathbb{C})/SU(n),$ and extends the previously known spinorial
representation of a surface in $\mathbb{H}^3$ if $n=2.$ We also recover the
Bryant representation of a surface with constant mean curvature 1 in
$\mathbb{H}^3$ and its generalization for a surface with holomorphic right
Gauss map in $SL_n(\mathbb{C})/SU(n).$ As a new application, we obtain a
fundamental theorem for the submanifold theory in that spaces.
| math.DG | we give a spinorial representation of a submanifold of any dimension and codimension in a symmetric space gh where g is a complex semisimple lie group and h is a compact real form of g this in particular includes sl_nmathbbcsun and extends the previously known spinorial representation of a surface in mathbbh3 if n2 we also recover the bryant representation of a surface with constant mean curvature 1 in mathbbh3 and its generalization for a surface with holomorphic right gauss map in sl_nmathbbcsun as a new application we obtain a fundamental theorem for the submanifold theory in that spaces | [['we', 'give', 'a', 'spinorial', 'representation', 'of', 'a', 'submanifold', 'of', 'any', 'dimension', 'and', 'codimension', 'in', 'a', 'symmetric', 'space', 'gh', 'where', 'g', 'is', 'a', 'complex', 'semisimple', 'lie', 'group', 'and', 'h', 'is', 'a', 'compact', 'real', 'form', 'of', 'g', 'this', 'in', 'particular', 'includes', 'sl_nmathbbcsun', 'and', 'extends', 'the', 'previously', 'known', 'spinorial', 'representation', 'of', 'a', 'surface', 'in', 'mathbbh3', 'if', 'n2', 'we', 'also', 'recover', 'the', 'bryant', 'representation', 'of', 'a', 'surface', 'with', 'constant', 'mean', 'curvature', '1', 'in', 'mathbbh3', 'and', 'its', 'generalization', 'for', 'a', 'surface', 'with', 'holomorphic', 'right', 'gauss', 'map', 'in', 'sl_nmathbbcsun', 'as', 'a', 'new', 'application', 'we', 'obtain', 'a', 'fundamental', 'theorem', 'for', 'the', 'submanifold', 'theory', 'in', 'that', 'spaces']] | [-0.15293675081650773, 0.08022697558914571, -0.1022317870184011, 0.045564130242654724, -0.13115495355972617, -0.10977282818195593, -0.028001788519946953, 0.3508346371698318, -0.24251696035342732, -0.20852339875490702, 0.10469656606377631, -0.23069436996983192, -0.22043530447120518, 0.18714335208912333, -0.1399946569263474, -0.05699549723937435, 0.02253781446524579, 0.15871010967002241, -0.1233682783570179, -0.23029792938650268, 0.38780928640290324, -0.0785237487751184, 0.16002385787060963, 0.06118966022520758, 0.14328938887272144, -0.0020825179154533393, 0.018532596115675783, 0.005167172568521376, -0.1586720686260828, 0.14854722763363695, 0.24756759775264822, 0.05247172207533161, 0.2116040274039986, -0.3387026136414599, -0.2370086287378727, 0.17362997180076567, 0.13327488753843822, 0.021330464304876083, -0.05675561127334487, -0.28336028346177383, 0.08441142978377103, -0.12277263214754075, -0.19287291694355688, -0.06507456318004844, 0.10169646603333735, -0.05585312879807556, -0.24057935744754433, 0.04777713082508741, 0.11617711582941186, 0.08530461854501219, -0.09152075020505172, -0.0700287033621337, -0.0716382124912493, 0.09449370589332905, -0.04913166999221616, 0.12153838373259786, 0.06734163021865618, -0.10487992114617883, -0.07169493476466574, 0.410924727418796, -0.13284464185270145, -0.29701261009214464, 0.12351843231290426, -0.19144370517280607, -0.1710583683938633, 0.12110647285529941, 0.1504540991076489, 0.18099922481348218, -0.03143165299918541, 0.22931730837714812, -0.12554922587593498, 0.07236756219591024, 0.09982153484309764, -0.033971896275071446, 0.12547719682393998, 0.14637740652710585, 0.14019309902160437, 0.12654415842568137, -0.0285969005235154, 0.01931858390927334, -0.377061807118433, -0.27761749554540693, -0.16687976173365238, 0.14259227982391579, -0.13997605942206495, -0.19329276589734345, 0.38982866322573695, 0.006047614326834986, 0.21448655309186787, 0.10937625310892604, 0.226362807416962, 0.058581166810682525, 0.0427045143598249, 0.12363789546466672, 0.13945106126982526, 0.24086344822012273, -0.035595150184385554, -0.09270102515475843, -0.10539641413002361, 0.16543796713243134] |
1,802.09837 | 3D Anisotropy of Solar Wind Turbulence, Tubes, or Ribbons? | We study the anisotropy with respect to the local magnetic field of turbulent
magnetic fluctuations at magnetofluid scales in the solar wind. Previous
measurements in the fast solar wind obtained axisymmetric anisotropy, despite
that the analysis method allows nonaxisymmetric structures. These results are
probably contaminated by the wind expansion that introduces another symmetry
axis, namely, the radial direction, as indicated by recent numerical
simulations. These simulations also show that while the expansion is strong,
the principal fluctuations are in the plane perpendicular to the radial
direction. Using this property, we separate 11 yr of Wind spacecraft data into
two subsets characterized by strong and weak expansion and determine the
corresponding turbulence anisotropy. Under strong expansion, the small-scale
anisotropy is consistent with the Goldreich & Sridhar critical balance. As in
previous works, when the radial symmetry axis is not eliminated, the turbulent
structures are field-aligned tubes. Under weak expansion, we find 3D anisotropy
predicted by the Boldyrev model, that is, turbulent structures are ribbons and
not tubes. However, the very basis of the Boldyrev phenomenology, namely, a
cross-helicity increasing at small scales, is not observed in the solar wind:
the origin of the ribbon formation is unknown.
| astro-ph.SR physics.flu-dyn physics.plasm-ph | we study the anisotropy with respect to the local magnetic field of turbulent magnetic fluctuations at magnetofluid scales in the solar wind previous measurements in the fast solar wind obtained axisymmetric anisotropy despite that the analysis method allows nonaxisymmetric structures these results are probably contaminated by the wind expansion that introduces another symmetry axis namely the radial direction as indicated by recent numerical simulations these simulations also show that while the expansion is strong the principal fluctuations are in the plane perpendicular to the radial direction using this property we separate 11 yr of wind spacecraft data into two subsets characterized by strong and weak expansion and determine the corresponding turbulence anisotropy under strong expansion the smallscale anisotropy is consistent with the goldreich sridhar critical balance as in previous works when the radial symmetry axis is not eliminated the turbulent structures are fieldaligned tubes under weak expansion we find 3d anisotropy predicted by the boldyrev model that is turbulent structures are ribbons and not tubes however the very basis of the boldyrev phenomenology namely a crosshelicity increasing at small scales is not observed in the solar wind the origin of the ribbon formation is unknown | [['we', 'study', 'the', 'anisotropy', 'with', 'respect', 'to', 'the', 'local', 'magnetic', 'field', 'of', 'turbulent', 'magnetic', 'fluctuations', 'at', 'magnetofluid', 'scales', 'in', 'the', 'solar', 'wind', 'previous', 'measurements', 'in', 'the', 'fast', 'solar', 'wind', 'obtained', 'axisymmetric', 'anisotropy', 'despite', 'that', 'the', 'analysis', 'method', 'allows', 'nonaxisymmetric', 'structures', 'these', 'results', 'are', 'probably', 'contaminated', 'by', 'the', 'wind', 'expansion', 'that', 'introduces', 'another', 'symmetry', 'axis', 'namely', 'the', 'radial', 'direction', 'as', 'indicated', 'by', 'recent', 'numerical', 'simulations', 'these', 'simulations', 'also', 'show', 'that', 'while', 'the', 'expansion', 'is', 'strong', 'the', 'principal', 'fluctuations', 'are', 'in', 'the', 'plane', 'perpendicular', 'to', 'the', 'radial', 'direction', 'using', 'this', 'property', 'we', 'separate', '11', 'yr', 'of', 'wind', 'spacecraft', 'data', 'into', 'two', 'subsets', 'characterized', 'by', 'strong', 'and', 'weak', 'expansion', 'and', 'determine', 'the', 'corresponding', 'turbulence', 'anisotropy', 'under', 'strong', 'expansion', 'the', 'smallscale', 'anisotropy', 'is', 'consistent', 'with', 'the', 'goldreich', 'sridhar', 'critical', 'balance', 'as', 'in', 'previous', 'works', 'when', 'the', 'radial', 'symmetry', 'axis', 'is', 'not', 'eliminated', 'the', 'turbulent', 'structures', 'are', 'fieldaligned', 'tubes', 'under', 'weak', 'expansion', 'we', 'find', '3d', 'anisotropy', 'predicted', 'by', 'the', 'boldyrev', 'model', 'that', 'is', 'turbulent', 'structures', 'are', 'ribbons', 'and', 'not', 'tubes', 'however', 'the', 'very', 'basis', 'of', 'the', 'boldyrev', 'phenomenology', 'namely', 'a', 'crosshelicity', 'increasing', 'at', 'small', 'scales', 'is', 'not', 'observed', 'in', 'the', 'solar', 'wind', 'the', 'origin', 'of', 'the', 'ribbon', 'formation', 'is', 'unknown']] | [-0.19520046391452733, 0.1951150649245112, -0.039400564515007994, 0.06797120256456905, -0.06658246655685779, -0.04207617760731433, -0.06599965318918037, 0.3845387210830664, -0.26708149477266346, -0.3020580113402759, 0.06241673866274934, -0.24380116069410296, -0.07796837610120956, 0.212918516037126, 0.026101184557550228, 0.009308757111191368, 0.06013894538180186, -0.05616821018644633, -0.04414037432975303, -0.17789745371526058, 0.2886596230001977, 0.11252448859696206, 0.2870630400112042, 0.012630675320859807, 0.04674283907426378, -0.098460294406276, -0.02345479212175959, 0.07763706426948118, -0.1423824515439964, 0.05347282665913017, 0.12985691624359252, 0.026798369330712234, 0.22765593878351725, -0.4560667190557489, -0.2312213542823417, 0.007758523091578331, 0.1780770162275682, 0.0863743766813945, -0.030421166662843183, -0.23730174904593673, 0.09587360137404921, -0.12348396606170214, -0.17322967544389076, -0.0518641115190127, 0.020248886179298355, 0.05683477530046963, -0.27572919288650155, 0.14641984585681572, 0.07344372721078495, 0.10951088548948368, -0.10298735799166397, -0.06141482200951148, -0.08465454394045549, 0.04657718019562965, 0.14760514206838055, 0.06478339839631166, 0.1531606458258839, -0.11276994933947347, -0.04739963193841947, 0.3833097324061852, -0.07180428927979217, -0.14308439844813292, 0.17780509325078664, -0.24030565006706195, -0.14227433283932697, 0.16544272400534304, 0.11597531099254504, 0.062046986885177784, -0.10506018795325266, 0.06410106239655318, -0.06303257039772012, 0.13266138937324284, 0.051489789080686674, -0.03817629388008171, 0.2442248922892106, 0.1005723377295698, 0.051398124096867365, 0.09975170127880306, -0.15354897116478056, -0.06800578488275791, -0.26190030410026127, -0.07841458684520032, -0.1533862644693074, 0.026544127297119045, -0.12784060496957794, -0.1704363708790296, 0.371346648546079, 0.17281155818118116, 0.19172997698187827, -0.026731012324587657, 0.31635357125017505, 0.09398145488379762, 0.06635690917237065, 0.14893422976183968, 0.32814613504526324, 0.18603348938796, 0.14744864914160316, -0.24777840693505146, 0.103464339626356, 0.0519889413474653] |
1,802.09838 | High-quality GeV-scale electron bunches with the Resonant Multi-Pulse
Ionization Injection | Recently a new injection scheme for Laser Wake Field Acceleration, employing
a single 100-TW-class laser system, has been proposed. In the Resonant
Multi-Pulse Ionization injection (ReMPI) a resonant train of pulses drives a
large amplitude plasma wave that traps electrons extracted from the plasma by
further ionization of a high-Z dopant (Argon in the present paper). While the
pulses of the driver train have intensity below the threshold for the dopant's
ionization, the properly delayed and frequency doubled (or more) ionization
pulse possesses an electric field large enough to extract electrons, though its
normalized amplitude is well below unity. In this paper we will report on
numerical simulations results aimed at the generation of GeV-scale bunches with
normalized emittance and {\it rms} energy below $80\, nm \times rad $ and
$0.5\, \%$, respectively. Analytical consideration of the FEL performance for a
$1.3\, GeV$ bunch will be also reported.
| physics.acc-ph physics.plasm-ph | recently a new injection scheme for laser wake field acceleration employing a single 100twclass laser system has been proposed in the resonant multipulse ionization injection rempi a resonant train of pulses drives a large amplitude plasma wave that traps electrons extracted from the plasma by further ionization of a highz dopant argon in the present paper while the pulses of the driver train have intensity below the threshold for the dopants ionization the properly delayed and frequency doubled or more ionization pulse possesses an electric field large enough to extract electrons though its normalized amplitude is well below unity in this paper we will report on numerical simulations results aimed at the generation of gevscale bunches with normalized emittance and it rms energy below 80 nm times rad and 05 respectively analytical consideration of the fel performance for a 13 gev bunch will be also reported | [['recently', 'a', 'new', 'injection', 'scheme', 'for', 'laser', 'wake', 'field', 'acceleration', 'employing', 'a', 'single', '100twclass', 'laser', 'system', 'has', 'been', 'proposed', 'in', 'the', 'resonant', 'multipulse', 'ionization', 'injection', 'rempi', 'a', 'resonant', 'train', 'of', 'pulses', 'drives', 'a', 'large', 'amplitude', 'plasma', 'wave', 'that', 'traps', 'electrons', 'extracted', 'from', 'the', 'plasma', 'by', 'further', 'ionization', 'of', 'a', 'highz', 'dopant', 'argon', 'in', 'the', 'present', 'paper', 'while', 'the', 'pulses', 'of', 'the', 'driver', 'train', 'have', 'intensity', 'below', 'the', 'threshold', 'for', 'the', 'dopants', 'ionization', 'the', 'properly', 'delayed', 'and', 'frequency', 'doubled', 'or', 'more', 'ionization', 'pulse', 'possesses', 'an', 'electric', 'field', 'large', 'enough', 'to', 'extract', 'electrons', 'though', 'its', 'normalized', 'amplitude', 'is', 'well', 'below', 'unity', 'in', 'this', 'paper', 'we', 'will', 'report', 'on', 'numerical', 'simulations', 'results', 'aimed', 'at', 'the', 'generation', 'of', 'gevscale', 'bunches', 'with', 'normalized', 'emittance', 'and', 'it', 'rms', 'energy', 'below', '80', 'nm', 'times', 'rad', 'and', '05', 'respectively', 'analytical', 'consideration', 'of', 'the', 'fel', 'performance', 'for', 'a', '13', 'gev', 'bunch', 'will', 'be', 'also', 'reported']] | [-0.0994121800870507, 0.22753969551957523, -0.03882241908027089, 0.06288647143910192, 0.034148554780125004, -0.14332438226189617, 0.03479268328503591, 0.4415205220423945, -0.1876393970515107, -0.33170052726229987, 0.009778868251524814, -0.2749042317128903, 0.008982781864613397, 0.253300684764152, 0.008497469503534576, 0.042989317066600696, 0.05083078608771607, -0.02664517071767876, -0.01537282784845782, -0.16494083586978178, 0.2417894993320248, 0.1561108074367863, 0.2747351128356021, 0.08579285281761358, 0.13674517259422742, -0.033279954704570854, 0.04939712728182339, -0.060718584212487284, -0.121110568617278, 0.029209119365040264, 0.2172012410241447, 0.030242279331416707, 0.2824449720409737, -0.43908177629473605, -0.2255671469260275, 0.036524707078295825, 0.17552110318202935, 0.12369525571567427, -0.11512856478517802, -0.2522011204711991, 0.06133570996023817, -0.1802560740584278, -0.1463931046445433, -0.013660807436816904, 0.018865600906070066, 0.0947362066510497, -0.28939695357766054, 0.04054913993694417, 0.02717534995921696, 0.03260488403093529, -0.03655333181425342, -0.07100938378804529, -0.008165074794231085, 0.007991291527566181, 0.02560359692322218, 0.10071065889237678, 0.21784178311386376, -0.11682007482039347, -0.08413210351734537, 0.34138624848038823, -0.08089052942224255, -0.07990174924903741, 0.11475083393950576, -0.22186590971948247, -0.0322722313919245, 0.2719501329502984, 0.15831647650179237, 0.08671411585257299, -0.12101991005060071, 0.0006912860356363762, 0.023004220983700044, 0.2520164539144464, 0.1547836456511629, 0.04116078791342523, 0.21608908119298875, 0.20061720043982137, 0.045269698575968305, 0.10654112596418835, -0.1913550675333133, 0.025725715334386858, -0.2764908625514642, -0.0798847388702585, -0.14672097815392054, 0.06274360573756084, -0.02669046912312409, -0.09906540012420857, 0.4559222158318023, 0.15976811465424523, 0.11363524313990588, -0.018322769330801722, 0.35000650754377044, 0.1663181632023611, 0.03171754469584725, 0.04260912449864594, 0.2894727543557752, 0.14952150647359427, 0.1484045909993966, -0.24631384994407274, 0.0009185199798021006, -0.012999999971601041] |
1,802.09839 | Isomorphism classification of infinite Sierpinski carpet graphs | For each infinite word over a given finite alphabet, we define an increasing
sequence of rooted finite graphs, that can be thought as approximations of the
famous Sierpinski carpet. These sequences naturally converge to an infinite
rooted limit graph. We show that there are uncountably many classes of
isomorphism of such limit graphs, regarded as unrooted graphs.
| math.CO | for each infinite word over a given finite alphabet we define an increasing sequence of rooted finite graphs that can be thought as approximations of the famous sierpinski carpet these sequences naturally converge to an infinite rooted limit graph we show that there are uncountably many classes of isomorphism of such limit graphs regarded as unrooted graphs | [['for', 'each', 'infinite', 'word', 'over', 'a', 'given', 'finite', 'alphabet', 'we', 'define', 'an', 'increasing', 'sequence', 'of', 'rooted', 'finite', 'graphs', 'that', 'can', 'be', 'thought', 'as', 'approximations', 'of', 'the', 'famous', 'sierpinski', 'carpet', 'these', 'sequences', 'naturally', 'converge', 'to', 'an', 'infinite', 'rooted', 'limit', 'graph', 'we', 'show', 'that', 'there', 'are', 'uncountably', 'many', 'classes', 'of', 'isomorphism', 'of', 'such', 'limit', 'graphs', 'regarded', 'as', 'unrooted', 'graphs']] | [-0.14884098733595588, 0.2091396296638873, -0.05127941683065473, 0.14299289137125015, -0.07759967438055594, -0.09446442775885787, 0.025214476316856842, 0.40890327467289017, -0.3603947023419957, -0.2505606261588502, 0.10512219219399094, -0.307063595179403, -0.16626368527169944, 0.20381945923885755, -0.1340353055857122, 0.03777532077909104, 0.12806217184519036, 0.1422301341795869, 0.017600879669516234, -0.2506369693442697, 0.32163037493694246, -0.07515175598101657, 0.20062955133943705, 0.0353539530678015, 0.15829663790697068, -0.03383641809086201, 0.03815988118743949, 0.10627642113780766, -0.11949753477120682, 0.04773580809042119, 0.3719896260452898, 0.15261911104122797, 0.21842387514679054, -0.3608990575824129, -0.21438894023824678, 0.2892907188333195, 0.2341150024726072, 0.08801104076075972, 0.013442066220337884, -0.23711457435172378, 0.12009574660802619, -0.1831814468360359, -0.08543815672920461, -0.029455824632589753, 0.07589948094008785, 0.07198069169463818, -0.21824979571739964, -0.08059815254078753, 0.19079608094404665, 0.08710131359597047, 0.011048334315745976, -0.1429952325854908, -0.010017309435888341, 0.19628588818503837, -0.029548890235131246, 0.04087507141459929, 0.011368437163662492, -0.028377907383337356, -0.24870084500626513, 0.3752139853476955, -0.06332233459933807, -0.2108410557633952, 0.16597906174955138, -0.10197523128437369, -0.23297467869461366, 0.11112444524310137, 0.11206862407229971, 0.13016037639687983, -0.05839202458267672, 0.13016504840108387, -0.18987362429891763, 0.13009580922427408, 0.19196183068612427, 0.020631857890341627, 0.16076499949160375, 0.13737041375338377, 0.1389178297831677, 0.23626488896307388, 0.08310582294341243, -0.08065464908845331, -0.2827810989856197, -0.082814736651224, -0.21683095143944547, 0.11917276954964588, -0.23557810950207345, -0.3856032376357338, 0.30725705211884097, 0.14256025173521616, 0.19894552967723525, 0.17712572226791004, 0.15099774815321884, 0.1149608312918102, 0.07332653945450786, 0.124832653587586, 0.016580084788106512, 0.19385883632001646, -0.09291625822886106, -0.0750514340153977, 0.030776935127122623, 0.20273104349249288] |
1,802.0984 | Computing the Wiener index in Sierpinski carpet graphs | We describe an algorithm to compute the Wiener index of a sequence of finite
graphs approximating the Sierpinski carpet.
| math.CO | we describe an algorithm to compute the wiener index of a sequence of finite graphs approximating the sierpinski carpet | [['we', 'describe', 'an', 'algorithm', 'to', 'compute', 'the', 'wiener', 'index', 'of', 'a', 'sequence', 'of', 'finite', 'graphs', 'approximating', 'the', 'sierpinski', 'carpet']] | [-0.12057842147585593, 0.10117350208134954, -0.15015746064876256, 0.09994772370708616, -0.10358839384035061, -0.03900502002062766, -0.009638749350989727, 0.4409940078070289, -0.32449722113577945, -0.24247891348051398, 0.07952033059279386, -0.2791077157384471, -0.2097131496197299, 0.18843967678319468, -0.12262137376360203, 0.09127590028985746, 0.0087349155280543, 0.07481391276968152, 0.011249185588799025, -0.2149078204835716, 0.2685043964731066, 0.018057039301646382, 0.21224010127939677, -0.010481230620490877, 0.14484024675268875, -0.05698861228302121, -0.09158352115436603, 0.009151947929670936, -0.23471298808918187, 0.1294772483800587, 0.1645166661198202, 0.12166649946256687, 0.2311517333513812, -0.32599305243868576, -0.14778366155530276, 0.2498167443432306, 0.11806667115735381, 0.03579114495139373, 0.006524405197093361, -0.22693191993197329, 0.163414197973907, -0.13004246659846486, -0.19633330640039945, 0.002785285836771915, 0.028557040054645193, 0.019815088935980673, -0.29116703491461904, -0.0968261712083691, 0.1538851863067401, 0.04061302606408533, -0.027003070045458644, -0.07298226713349945, 0.043799882926242914, 0.14372343371475213, -0.15100507212704734, -0.05164016052884491, 0.06883322646057136, -0.022242425695845957, -0.2573740886230218, 0.3721081091973342, -0.09336462599764529, -0.2072330818168427, 0.04348322533463177, -0.13793108259376727, -0.13555988277259626, 0.13958015714428926, 0.22078441965736842, 0.13958908570930362, -0.10948547916977029, 0.16671448240154668, -0.11031235862327249, 0.16113992153029694, 0.1475367325872771, -0.08913043229595612, 0.01972949828364347, 0.1608904815818134, 0.18899741445324922, 0.3064239964281258, -0.04514886997640133, -0.09016911626646393, -0.2764598561548873, -0.18669002542370244, -0.32025387445709813, 0.03309862494566723, -0.26873781345784664, -0.45353250950574875, 0.42392383417800855, 0.13359681232587287, 0.16682740075415686, 0.15947981119940155, 0.21989253785853324, 0.15937182915053869, -0.04905560465627595, 0.15976763732339205, 0.0361632345072729, 0.20231320454101814, 0.006926398430215685, -0.15989715233445168, -0.046426901201668536, 0.2835247920531976] |
1,802.09841 | Adversarial Active Learning for Deep Networks: a Margin Based Approach | We propose a new active learning strategy designed for deep neural networks.
The goal is to minimize the number of data annotation queried from an oracle
during training. Previous active learning strategies scalable for deep networks
were mostly based on uncertain sample selection. In this work, we focus on
examples lying close to the decision boundary. Based on theoretical works on
margin theory for active learning, we know that such examples may help to
considerably decrease the number of annotations. While measuring the exact
distance to the decision boundaries is intractable, we propose to rely on
adversarial examples. We do not consider anymore them as a threat instead we
exploit the information they provide on the distribution of the input space in
order to approximate the distance to decision boundaries. We demonstrate
empirically that adversarial active queries yield faster convergence of CNNs
trained on MNIST, the Shoe-Bag and the Quick-Draw datasets.
| cs.LG cs.CV stat.ML | we propose a new active learning strategy designed for deep neural networks the goal is to minimize the number of data annotation queried from an oracle during training previous active learning strategies scalable for deep networks were mostly based on uncertain sample selection in this work we focus on examples lying close to the decision boundary based on theoretical works on margin theory for active learning we know that such examples may help to considerably decrease the number of annotations while measuring the exact distance to the decision boundaries is intractable we propose to rely on adversarial examples we do not consider anymore them as a threat instead we exploit the information they provide on the distribution of the input space in order to approximate the distance to decision boundaries we demonstrate empirically that adversarial active queries yield faster convergence of cnns trained on mnist the shoebag and the quickdraw datasets | [['we', 'propose', 'a', 'new', 'active', 'learning', 'strategy', 'designed', 'for', 'deep', 'neural', 'networks', 'the', 'goal', 'is', 'to', 'minimize', 'the', 'number', 'of', 'data', 'annotation', 'queried', 'from', 'an', 'oracle', 'during', 'training', 'previous', 'active', 'learning', 'strategies', 'scalable', 'for', 'deep', 'networks', 'were', 'mostly', 'based', 'on', 'uncertain', 'sample', 'selection', 'in', 'this', 'work', 'we', 'focus', 'on', 'examples', 'lying', 'close', 'to', 'the', 'decision', 'boundary', 'based', 'on', 'theoretical', 'works', 'on', 'margin', 'theory', 'for', 'active', 'learning', 'we', 'know', 'that', 'such', 'examples', 'may', 'help', 'to', 'considerably', 'decrease', 'the', 'number', 'of', 'annotations', 'while', 'measuring', 'the', 'exact', 'distance', 'to', 'the', 'decision', 'boundaries', 'is', 'intractable', 'we', 'propose', 'to', 'rely', 'on', 'adversarial', 'examples', 'we', 'do', 'not', 'consider', 'anymore', 'them', 'as', 'a', 'threat', 'instead', 'we', 'exploit', 'the', 'information', 'they', 'provide', 'on', 'the', 'distribution', 'of', 'the', 'input', 'space', 'in', 'order', 'to', 'approximate', 'the', 'distance', 'to', 'decision', 'boundaries', 'we', 'demonstrate', 'empirically', 'that', 'adversarial', 'active', 'queries', 'yield', 'faster', 'convergence', 'of', 'cnns', 'trained', 'on', 'mnist', 'the', 'shoebag', 'and', 'the', 'quickdraw', 'datasets']] | [-0.05875859842260662, 0.02117639946707934, -0.0353966999874019, 0.11845263821657297, -0.1567366551451585, -0.1570172960598072, 0.12991831183742933, 0.484586642255019, -0.23808412036652232, -0.34326015123409914, 0.10459185749973676, -0.2815109272956248, -0.17527862030961208, 0.18669961880183084, -0.17354759702540234, 0.10720536957851193, 0.08827846384007208, 0.07287548433215008, -0.042632263904631186, -0.32210339004042615, 0.33702822902471125, 0.05102527208724716, 0.31886375706717873, -0.009972336692673047, 0.09927252936880135, -0.0136673973698244, -0.024202718415091303, -0.010522078080673158, -0.12121538863247401, 0.17647300857813067, 0.30874340765603236, 0.20774133711578263, 0.35715116900485633, -0.4429429412923262, -0.19536421200473036, 0.12699501584252756, 0.15347213471142712, 0.1319042354902829, -0.03748427283553244, -0.31277088453405655, 0.0744838498301504, -0.114422948881179, -0.004793897433668975, -0.13702214322124776, -0.043509968190810225, -0.00794187738230427, -0.27599925105303724, -0.011924003204018277, 0.058768463402286475, 0.04204012002583418, -0.045553840440541706, -0.11329510443587631, 0.03424408198053005, 0.1551380358173843, 0.03313040031954621, 0.03257654491583848, 0.1536002137054433, -0.15691746445528962, -0.14083988904552971, 0.2911885380807439, -0.02470380128455042, -0.2142010731216295, 0.21517883339621777, -0.018250396275180297, -0.16284476450000634, 0.10690295968779781, 0.3085364166275292, 0.14735411726025827, -0.1412912665822562, 0.021018403875657152, -0.041656834278849496, 0.1814720217769828, 0.011086458855952393, -0.01056546422546642, 0.1469046874760944, 0.23404971602679098, 0.07246549385826372, 0.15477880579263173, -0.13152542761734048, -0.10545682847412341, -0.254868723089563, -0.0780524295315634, -0.22815520906408363, 0.001608950998606754, -0.09017036088276263, -0.17317068767921387, 0.32847480909998883, 0.2524347679741093, 0.22067854436264442, 0.14755846471869505, 0.3248349658819853, 0.017927146678471676, 0.11374906638649686, 0.13077771886183112, 0.2557962156032156, 0.020242525984989417, 0.10128156844707793, -0.1767259379645697, 0.1357696239192714, 0.05370966528211064] |
1,802.09842 | Group theory approach to unification of gravity with internal symmetry
gauge interactions: II. Relativity of charges and masses | The variant of electrogravitational unification has been studied on base of
principle of relativity of charges and masses.
| gr-qc hep-th | the variant of electrogravitational unification has been studied on base of principle of relativity of charges and masses | [['the', 'variant', 'of', 'electrogravitational', 'unification', 'has', 'been', 'studied', 'on', 'base', 'of', 'principle', 'of', 'relativity', 'of', 'charges', 'and', 'masses']] | [-0.1799790399769942, 0.08623302195014225, -0.07505066462585495, 0.10358735960390833, -0.07365822843793365, -0.11928271098683278, 0.022887451988127496, 0.31547609672674704, -0.12175865285098553, -0.3391657102232178, 0.05090466998000112, -0.1646019952992598, 0.0020259025817116103, 0.16641624147693315, -0.05876598610646195, 0.017512112235029537, -0.05602392789700793, 0.08940678793523046, -0.06811112005056606, -0.202149400073621, 0.3296510633081198, 0.09281150272323026, 0.25305287332998383, 0.08928691709621085, 0.18426728372772536, -0.012289202021848824, 0.019653906528320577, 0.07429377838141388, -0.07632392106784715, 0.12005652487277985, 0.14077559051414332, 0.13824270038296366, 0.25093330732650226, -0.3896956745431655, -0.23608078270788407, 0.0756041842719747, 0.07110754219401214, 0.12401205487549305, -0.08684396800688571, -0.2688598607977231, 0.1334319400290648, -0.23191575581828752, -0.14981747206507456, -0.013321783704062303, 0.03357385450767146, 0.005760860525899463, -0.21923656140764555, 0.04989054881864124, 0.043986715376377106, 0.05340897700645857, -0.038955851975414485, -0.17331442329385835, -0.04281517904665735, 0.07429143062068357, 0.22338654556208187, -0.03730785005932881, 0.09518279466364118, -0.08020699562297927, -0.2034834504334463, 0.47732206628036994, -0.03368560716302858, -0.15762989942191374, 0.17987473738483256, -0.13816897183035812, -0.17123160304294693, 0.04488230455252859, 0.18318373135601482, 0.20289836368627018, -0.15902656435759532, 0.2375954441279949, -0.09119441649980015, 0.14823935615519682, 0.14860736019909382, 0.0480976388272312, 0.28405172750353813, 0.19376894428084293, 0.006381813281526168, 0.01924380815277497, -0.05449586419854313, -0.160877567405502, -0.29885171327946913, -0.12713409398889375, -0.17287118348758668, 0.07649133235423101, -0.06169607228932566, -0.06264396619776057, 0.34200447683946955, 0.04506243335910969, 0.09654370384911697, 0.04271208784646458, 0.2124906476173136, 0.05252165000678764, 0.14893638252073693, -0.05348485718584723, 0.37804048342837226, 0.26308666738784975, 0.0702029118159165, -0.20406397783921826, -0.011192924265439311, 0.20437600432584682] |
1,802.09843 | Graph Laplacian for Image Anomaly Detection | Reed-Xiaoli detector (RXD) is recognized as the benchmark algorithm for image
anomaly detection; however, it presents known limitations, namely the
dependence over the image following a multivariate Gaussian model, the
estimation and inversion of a high-dimensional covariance matrix, and the
inability to effectively include spatial awareness in its evaluation. In this
work, a novel graph-based solution to the image anomaly detection problem is
proposed; leveraging the graph Fourier transform, we are able to overcome some
of RXD's limitations while reducing computational cost at the same time. Tests
over both hyperspectral and medical images, using both synthetic and real
anomalies, prove the proposed technique is able to obtain significant gains
over performance by other algorithms in the state of the art.
| eess.IV cs.CV eess.SP | reedxiaoli detector rxd is recognized as the benchmark algorithm for image anomaly detection however it presents known limitations namely the dependence over the image following a multivariate gaussian model the estimation and inversion of a highdimensional covariance matrix and the inability to effectively include spatial awareness in its evaluation in this work a novel graphbased solution to the image anomaly detection problem is proposed leveraging the graph fourier transform we are able to overcome some of rxds limitations while reducing computational cost at the same time tests over both hyperspectral and medical images using both synthetic and real anomalies prove the proposed technique is able to obtain significant gains over performance by other algorithms in the state of the art | [['reedxiaoli', 'detector', 'rxd', 'is', 'recognized', 'as', 'the', 'benchmark', 'algorithm', 'for', 'image', 'anomaly', 'detection', 'however', 'it', 'presents', 'known', 'limitations', 'namely', 'the', 'dependence', 'over', 'the', 'image', 'following', 'a', 'multivariate', 'gaussian', 'model', 'the', 'estimation', 'and', 'inversion', 'of', 'a', 'highdimensional', 'covariance', 'matrix', 'and', 'the', 'inability', 'to', 'effectively', 'include', 'spatial', 'awareness', 'in', 'its', 'evaluation', 'in', 'this', 'work', 'a', 'novel', 'graphbased', 'solution', 'to', 'the', 'image', 'anomaly', 'detection', 'problem', 'is', 'proposed', 'leveraging', 'the', 'graph', 'fourier', 'transform', 'we', 'are', 'able', 'to', 'overcome', 'some', 'of', 'rxds', 'limitations', 'while', 'reducing', 'computational', 'cost', 'at', 'the', 'same', 'time', 'tests', 'over', 'both', 'hyperspectral', 'and', 'medical', 'images', 'using', 'both', 'synthetic', 'and', 'real', 'anomalies', 'prove', 'the', 'proposed', 'technique', 'is', 'able', 'to', 'obtain', 'significant', 'gains', 'over', 'performance', 'by', 'other', 'algorithms', 'in', 'the', 'state', 'of', 'the', 'art']] | [-0.04349215878805114, -0.0486801864216262, -0.07508590489614092, 0.05623034054464739, -0.09357195937122076, -0.13665283199841693, 0.019455818333110567, 0.39560343773435735, -0.2778620031086128, -0.344958774181146, 0.15388405130154026, -0.2720235747450931, -0.18144075506193152, 0.1972902805418155, -0.13224277968944634, 0.13922699347485679, 0.08115720952726838, 0.040361693681422936, -0.0904951778667687, -0.27509227916484863, 0.25532342078089243, 0.06024493801139169, 0.35662138936607074, 0.060119206531731, 0.13835056042061897, 0.004329863908085025, -0.07592805797605127, 0.00159634882189586, -0.017008850603538045, 0.12200425995091545, 0.31167596512892426, 0.2033443600077466, 0.28592609920759954, -0.392234489116502, -0.2502897941957275, 0.131184442176965, 0.1513890015213924, 0.080791518911009, -0.06652168559612927, -0.3300453879775764, 0.09115761685406126, -0.12702617136824687, -0.020883542914693323, -0.12489367346476637, -0.041205919544030994, -0.043349363333525896, -0.2885519152317764, 0.067059733301117, 0.048466054030094234, 0.045303550146330716, -0.06454718145798355, -0.12608911988909466, 0.06783436947123353, 0.13344904766181262, 0.05185811032967295, 0.019398524299642797, 0.10018725683360155, -0.16530401693949065, -0.14700613252944866, 0.37928709255184156, -0.0706662380248032, -0.22111879570026866, 0.1808889022578438, -0.08913794745122856, -0.1282528246618744, 0.14930559876295973, 0.19368835817825175, 0.08772697686454502, -0.136568237064501, 0.0771503148430769, -0.010238411007606881, 0.150931180963861, 0.05312283912878799, 0.00771730938547496, 0.12623455980200698, 0.20803342617543066, 0.08249430557302499, 0.15144931610281012, -0.1815315709899227, -0.054744030719907105, -0.2286141355427266, -0.15277669560637766, -0.23376725160248452, -0.052646049148387324, -0.10505521680638825, -0.1417106779576358, 0.43222097089608846, 0.23693823528286637, 0.186192749697573, 0.08011688964472989, 0.38737099481967546, 0.07352623224980592, 0.09327293052022362, 0.07025636002121462, 0.1571492103939201, 0.09711504709449108, 0.10572641677819035, -0.22661770630422665, 0.07585046875440532, 0.028150220969109796] |
1,802.09844 | Constructing graphs with limited resources | We discuss the amount of physical resources required to construct a given
graph, where vertices are added sequentially. We naturally identify information
-- distinct into instructions and memory -- and randomness as resources. Not
surprisingly, we show that, in this framework, threshold graphs are the
simplest possible graphs, since the construction of threshold graphs requires a
single bit of instructions for each vertex and no use of memory. Large
instructions without memory do not bring any advantage. With one bit of
instructions and one bit of memory for each vertex, we can construct a family
of perfect graphs that strictly includes threshold graphs. We consider the case
in which memory lasts for a single time step, and show that as well as the
standard threshold graphs, linear forests are also producible. We show further
that the number of random bits (with no memory or instructions) needed to
construct any graph is asymptotically the same as required for the
Erd\H{o}s-R\'enyi random graph. We also briefly consider constructing trees in
this scheme. The problem of defining a hierarchy of graphs in the proposed
framework is fully open.
| cs.DM math.CO | we discuss the amount of physical resources required to construct a given graph where vertices are added sequentially we naturally identify information distinct into instructions and memory and randomness as resources not surprisingly we show that in this framework threshold graphs are the simplest possible graphs since the construction of threshold graphs requires a single bit of instructions for each vertex and no use of memory large instructions without memory do not bring any advantage with one bit of instructions and one bit of memory for each vertex we can construct a family of perfect graphs that strictly includes threshold graphs we consider the case in which memory lasts for a single time step and show that as well as the standard threshold graphs linear forests are also producible we show further that the number of random bits with no memory or instructions needed to construct any graph is asymptotically the same as required for the erdhosrenyi random graph we also briefly consider constructing trees in this scheme the problem of defining a hierarchy of graphs in the proposed framework is fully open | [['we', 'discuss', 'the', 'amount', 'of', 'physical', 'resources', 'required', 'to', 'construct', 'a', 'given', 'graph', 'where', 'vertices', 'are', 'added', 'sequentially', 'we', 'naturally', 'identify', 'information', 'distinct', 'into', 'instructions', 'and', 'memory', 'and', 'randomness', 'as', 'resources', 'not', 'surprisingly', 'we', 'show', 'that', 'in', 'this', 'framework', 'threshold', 'graphs', 'are', 'the', 'simplest', 'possible', 'graphs', 'since', 'the', 'construction', 'of', 'threshold', 'graphs', 'requires', 'a', 'single', 'bit', 'of', 'instructions', 'for', 'each', 'vertex', 'and', 'no', 'use', 'of', 'memory', 'large', 'instructions', 'without', 'memory', 'do', 'not', 'bring', 'any', 'advantage', 'with', 'one', 'bit', 'of', 'instructions', 'and', 'one', 'bit', 'of', 'memory', 'for', 'each', 'vertex', 'we', 'can', 'construct', 'a', 'family', 'of', 'perfect', 'graphs', 'that', 'strictly', 'includes', 'threshold', 'graphs', 'we', 'consider', 'the', 'case', 'in', 'which', 'memory', 'lasts', 'for', 'a', 'single', 'time', 'step', 'and', 'show', 'that', 'as', 'well', 'as', 'the', 'standard', 'threshold', 'graphs', 'linear', 'forests', 'are', 'also', 'producible', 'we', 'show', 'further', 'that', 'the', 'number', 'of', 'random', 'bits', 'with', 'no', 'memory', 'or', 'instructions', 'needed', 'to', 'construct', 'any', 'graph', 'is', 'asymptotically', 'the', 'same', 'as', 'required', 'for', 'the', 'erdhosrenyi', 'random', 'graph', 'we', 'also', 'briefly', 'consider', 'constructing', 'trees', 'in', 'this', 'scheme', 'the', 'problem', 'of', 'defining', 'a', 'hierarchy', 'of', 'graphs', 'in', 'the', 'proposed', 'framework', 'is', 'fully', 'open']] | [-0.1446442317492405, 0.13352671147787262, -0.007258693061646868, 0.08095396219407935, -0.10702134164233433, -0.1881439705135026, 0.09731609240438932, 0.4030004416610231, -0.26848845465790705, -0.32759084337762473, 0.11213724348119007, -0.2370621742161571, -0.14594972294073327, 0.15240317755035263, -0.10905610851414217, 0.04375981218359672, 0.11253946029474257, 0.11973001329543811, 0.009699059323003119, -0.28429329474542486, 0.30507325263480184, 0.012371040216540216, 0.20653463352491946, 0.0370267577942644, 0.12955761573638747, 0.016241322581966717, -0.009683643264156548, 0.03295679388140313, -0.11348572241405122, 0.05654951675395517, 0.2543415856532386, 0.17927555779575324, 0.28274789588943205, -0.4618928271238921, -0.1947172879445929, 0.17191333564436012, 0.11928217610995707, 0.1671467418394362, -0.025054592097208638, -0.18677070216133254, 0.12824092819380875, -0.1572941738623576, -0.0469575148493133, -0.06536118882896552, 0.021838656621552557, 0.016705166548490524, -0.2896675097735731, -0.021786178035033063, 0.117642779163431, -0.008554724209224348, 0.05303392119647151, -0.11201064962870823, -0.016897267480050035, 0.14412688147505653, -0.06194938670798037, 0.027252720323482863, 0.07303655051621176, -0.12671892760229891, -0.20922255613764779, 0.382104106869261, -0.014512568680427032, -0.2104254635076339, 0.11055054323483116, -0.11051430696713142, -0.18966752377878163, 0.07544896417409386, 0.15449480158645823, 0.09207507385236155, -0.14592371164513193, 0.07743518935265833, -0.044434233437562004, 0.1995916402678621, 0.08035103679772039, 0.08477444605408185, 0.13545271877423337, 0.17043620104713192, 0.09646316546605788, 0.22361668406939897, -0.03178187439096023, -0.09446935293098016, -0.3181460949521044, -0.14875934417935247, -0.20042191799017575, 0.02948870325904426, -0.139865456909419, -0.19845373777906752, 0.4014410281273283, 0.1616134423497922, 0.2077143021523342, 0.15534547831458573, 0.28795539092048594, 0.07020192838380815, 0.1150542714536353, 0.1753939663726694, 0.10069116308796601, 0.07671909718748814, 0.054676819429860087, -0.12942890111926963, 0.07904563677151143, 0.06568963774301805] |
1,802.09845 | Less is More: Exploiting the Standard Compiler Optimization Levels for
Better Performance and Energy Consumption | This paper presents the interesting observation that by performing fewer of
the optimizations available in a standard compiler optimization level such as
-O2, while preserving their original ordering, significant savings can be
achieved in both execution time and energy consumption. This observation has
been validated on two embedded processors, namely the ARM Cortex-M0 and the ARM
Cortex-M3, using two different versions of the LLVM compilation framework; v3.8
and v5.0. Experimental evaluation with 71 embedded benchmarks demonstrated
performance gains for at least half of the benchmarks for both processors. An
average execution time reduction of 2.4% and 5.3% was achieved across all the
benchmarks for the Cortex-M0 and Cortex-M3 processors, respectively, with
execution time improvements ranging from 1% up to 90% over the -O2. The savings
that can be achieved are in the same range as what can be achieved by the
state-of-the-art compilation approaches that use iterative compilation or
machine learning to select flags or to determine phase orderings that result in
more efficient code. In contrast to these time consuming and expensive to apply
techniques, our approach only needs to test a limited number of optimization
configurations, less than 64, to obtain similar or even better savings.
Furthermore, our approach can support multi-criteria optimization as it targets
execution time, energy consumption and code size at the same time.
| cs.PF | this paper presents the interesting observation that by performing fewer of the optimizations available in a standard compiler optimization level such as o2 while preserving their original ordering significant savings can be achieved in both execution time and energy consumption this observation has been validated on two embedded processors namely the arm cortexm0 and the arm cortexm3 using two different versions of the llvm compilation framework v38 and v50 experimental evaluation with 71 embedded benchmarks demonstrated performance gains for at least half of the benchmarks for both processors an average execution time reduction of 24 and 53 was achieved across all the benchmarks for the cortexm0 and cortexm3 processors respectively with execution time improvements ranging from 1 up to 90 over the o2 the savings that can be achieved are in the same range as what can be achieved by the stateoftheart compilation approaches that use iterative compilation or machine learning to select flags or to determine phase orderings that result in more efficient code in contrast to these time consuming and expensive to apply techniques our approach only needs to test a limited number of optimization configurations less than 64 to obtain similar or even better savings furthermore our approach can support multicriteria optimization as it targets execution time energy consumption and code size at the same time | [['this', 'paper', 'presents', 'the', 'interesting', 'observation', 'that', 'by', 'performing', 'fewer', 'of', 'the', 'optimizations', 'available', 'in', 'a', 'standard', 'compiler', 'optimization', 'level', 'such', 'as', 'o2', 'while', 'preserving', 'their', 'original', 'ordering', 'significant', 'savings', 'can', 'be', 'achieved', 'in', 'both', 'execution', 'time', 'and', 'energy', 'consumption', 'this', 'observation', 'has', 'been', 'validated', 'on', 'two', 'embedded', 'processors', 'namely', 'the', 'arm', 'cortexm0', 'and', 'the', 'arm', 'cortexm3', 'using', 'two', 'different', 'versions', 'of', 'the', 'llvm', 'compilation', 'framework', 'v38', 'and', 'v50', 'experimental', 'evaluation', 'with', '71', 'embedded', 'benchmarks', 'demonstrated', 'performance', 'gains', 'for', 'at', 'least', 'half', 'of', 'the', 'benchmarks', 'for', 'both', 'processors', 'an', 'average', 'execution', 'time', 'reduction', 'of', '24', 'and', '53', 'was', 'achieved', 'across', 'all', 'the', 'benchmarks', 'for', 'the', 'cortexm0', 'and', 'cortexm3', 'processors', 'respectively', 'with', 'execution', 'time', 'improvements', 'ranging', 'from', '1', 'up', 'to', '90', 'over', 'the', 'o2', 'the', 'savings', 'that', 'can', 'be', 'achieved', 'are', 'in', 'the', 'same', 'range', 'as', 'what', 'can', 'be', 'achieved', 'by', 'the', 'stateoftheart', 'compilation', 'approaches', 'that', 'use', 'iterative', 'compilation', 'or', 'machine', 'learning', 'to', 'select', 'flags', 'or', 'to', 'determine', 'phase', 'orderings', 'that', 'result', 'in', 'more', 'efficient', 'code', 'in', 'contrast', 'to', 'these', 'time', 'consuming', 'and', 'expensive', 'to', 'apply', 'techniques', 'our', 'approach', 'only', 'needs', 'to', 'test', 'a', 'limited', 'number', 'of', 'optimization', 'configurations', 'less', 'than', '64', 'to', 'obtain', 'similar', 'or', 'even', 'better', 'savings', 'furthermore', 'our', 'approach', 'can', 'support', 'multicriteria', 'optimization', 'as', 'it', 'targets', 'execution', 'time', 'energy', 'consumption', 'and', 'code', 'size', 'at', 'the', 'same', 'time']] | [-0.09360944434254086, 0.0132391694854104, -0.05098583272708257, 0.028641627801658763, -0.046650447544629034, -0.1572284238991332, 0.08824908836972241, 0.42698016133771777, -0.2346128911028731, -0.4318752933982505, 0.12740207424750935, -0.2421648780279474, -0.040567854601149894, 0.25659002674228965, -0.05367548425323606, 0.07852697293550524, 0.10737189028378083, 0.0035725261029451406, -0.09738043075550738, -0.328919509506559, 0.18149067139355082, 0.08098003351805758, 0.2765491309120707, 0.016243782145349675, 0.07999139129328775, -0.04923596999131687, 0.0017827753717564556, 0.010319427722112433, -0.032731168458613534, 0.12240783308502967, 0.2904292794516455, 0.18142143781530803, 0.28680942911807805, -0.43182259547996193, -0.18485189758594145, 0.08622688091816923, 0.15851249875469967, 0.0648097125515682, -0.0056358111146375, -0.2471282727321074, 0.12040938741844318, -0.18633270878546773, -0.02439957748902919, -0.10342828482580818, 0.007158447186713485, -0.009503181527005126, -0.2488247398531583, 0.019251569332108413, 0.01930743211574138, 0.062492610928155994, -0.031103083896014804, -0.16285914256020564, 0.0022125109428429305, 0.12387679396175937, 0.021919521977316978, 0.07622016040402567, 0.14355202236523232, -0.0944403864158377, -0.1850028656312524, 0.3972377686348816, -0.05923984140577911, -0.15920419901445695, 0.21398462186520706, -0.05085653453729366, -0.13291557069408566, 0.1498004240895511, 0.1985077909999272, 0.10453487938635697, -0.13835602940260072, 0.032812548712263793, 0.027588513750502135, 0.22541592905051225, 0.09894860928801641, 0.017562543382213268, 0.12374730173872622, 0.2020620741489658, 0.07030618921364551, 0.13367170492053185, -0.08102710500729512, -0.10333016407612251, -0.24376411457039995, -0.15450058396337937, -0.15506433150529028, 0.0059553193423863005, -0.10315111510783326, -0.07420310515699882, 0.37387334091427255, 0.18787172562591561, 0.16205902902258468, 0.11912099719906043, 0.34771421419873355, 0.06546211619191637, 0.1315979325671289, 0.14224332241026777, 0.1908325339528226, -0.01377648644395955, 0.09696828829152213, -0.20639585989014964, 0.06089575031716972, -0.02457165247420504] |
1,802.09846 | Dissipative quantum mechanics beyond Bloch-Redfield: A consistent
weak-coupling expansion of the ohmic spin boson model at arbitrary bias | We study the time dynamics of the ohmic spin boson model at arbitrary bias
$\epsilon$ and small coupling $\alpha$ to the bosonic bath. Using perturbation
theory and the real-time renormalization group (RG) method we present a
consistent zero-temperature weak-coupling expansion for the time evolution of
the reduced density matrix one order beyond the Bloch-Redfield solution. We
develop a renormalized perturbation theory and present an analytical solution
covering the whole range from small to large times, including further results
for exponentially small or large times. Resumming all secular terms in all
orders of perturbation theory we find exponential decay for all terms of the
time evolution. We determine the preexponential functions and find slowly
varying logarithmic terms with the renormalized Rabi frequency $\Omega$ as
energy scale together with strongly varying parts falling off asymptocially as
$1/t$ in leading order, in contrast to the unbiased case. Resumming all
logarithmic terms in all orders of perturbation theory via real-time RG we find
the correct renormalized tunneling and a power-law behaviour for the
oscillating modes with exponent crossing over from $2\alpha$ for exponentially
small times to a bias-dependent value $2\alpha \epsilon^2/\Omega^2$ for
exponentially large times. Furthermore, we present a degenerate perturbation
theory to calculate consistently the purely decaying mode one order beyond
Bloch-Redfield.
| cond-mat.stat-mech cond-mat.mes-hall | we study the time dynamics of the ohmic spin boson model at arbitrary bias epsilon and small coupling alpha to the bosonic bath using perturbation theory and the realtime renormalization group rg method we present a consistent zerotemperature weakcoupling expansion for the time evolution of the reduced density matrix one order beyond the blochredfield solution we develop a renormalized perturbation theory and present an analytical solution covering the whole range from small to large times including further results for exponentially small or large times resumming all secular terms in all orders of perturbation theory we find exponential decay for all terms of the time evolution we determine the preexponential functions and find slowly varying logarithmic terms with the renormalized rabi frequency omega as energy scale together with strongly varying parts falling off asymptocially as 1t in leading order in contrast to the unbiased case resumming all logarithmic terms in all orders of perturbation theory via realtime rg we find the correct renormalized tunneling and a powerlaw behaviour for the oscillating modes with exponent crossing over from 2alpha for exponentially small times to a biasdependent value 2alpha epsilon2omega2 for exponentially large times furthermore we present a degenerate perturbation theory to calculate consistently the purely decaying mode one order beyond blochredfield | [['we', 'study', 'the', 'time', 'dynamics', 'of', 'the', 'ohmic', 'spin', 'boson', 'model', 'at', 'arbitrary', 'bias', 'epsilon', 'and', 'small', 'coupling', 'alpha', 'to', 'the', 'bosonic', 'bath', 'using', 'perturbation', 'theory', 'and', 'the', 'realtime', 'renormalization', 'group', 'rg', 'method', 'we', 'present', 'a', 'consistent', 'zerotemperature', 'weakcoupling', 'expansion', 'for', 'the', 'time', 'evolution', 'of', 'the', 'reduced', 'density', 'matrix', 'one', 'order', 'beyond', 'the', 'blochredfield', 'solution', 'we', 'develop', 'a', 'renormalized', 'perturbation', 'theory', 'and', 'present', 'an', 'analytical', 'solution', 'covering', 'the', 'whole', 'range', 'from', 'small', 'to', 'large', 'times', 'including', 'further', 'results', 'for', 'exponentially', 'small', 'or', 'large', 'times', 'resumming', 'all', 'secular', 'terms', 'in', 'all', 'orders', 'of', 'perturbation', 'theory', 'we', 'find', 'exponential', 'decay', 'for', 'all', 'terms', 'of', 'the', 'time', 'evolution', 'we', 'determine', 'the', 'preexponential', 'functions', 'and', 'find', 'slowly', 'varying', 'logarithmic', 'terms', 'with', 'the', 'renormalized', 'rabi', 'frequency', 'omega', 'as', 'energy', 'scale', 'together', 'with', 'strongly', 'varying', 'parts', 'falling', 'off', 'asymptocially', 'as', '1t', 'in', 'leading', 'order', 'in', 'contrast', 'to', 'the', 'unbiased', 'case', 'resumming', 'all', 'logarithmic', 'terms', 'in', 'all', 'orders', 'of', 'perturbation', 'theory', 'via', 'realtime', 'rg', 'we', 'find', 'the', 'correct', 'renormalized', 'tunneling', 'and', 'a', 'powerlaw', 'behaviour', 'for', 'the', 'oscillating', 'modes', 'with', 'exponent', 'crossing', 'over', 'from', '2alpha', 'for', 'exponentially', 'small', 'times', 'to', 'a', 'biasdependent', 'value', '2alpha', 'epsilon2omega2', 'for', 'exponentially', 'large', 'times', 'furthermore', 'we', 'present', 'a', 'degenerate', 'perturbation', 'theory', 'to', 'calculate', 'consistently', 'the', 'purely', 'decaying', 'mode', 'one', 'order', 'beyond', 'blochredfield']] | [-0.15159095343031384, 0.17810065963296814, -0.0650775004144542, 0.07466518686106316, 0.004851210272729235, -0.10842402586331006, 0.05166655007028808, 0.29556753635316513, -0.25127233587799297, -0.265885875267899, 0.0753026094370868, -0.30622681247853284, -0.09151840570904675, 0.15436763275169502, 0.06577233981300631, 0.055650281701866845, 0.006280221751382673, 0.04893706922288894, -0.09626624174753501, -0.20922806800358842, 0.2810656079293593, 0.014929107725530287, 0.21611119396894593, 0.03149679688520837, 0.058243413041863173, 0.027677648096763784, 0.0009909066200652272, 0.033948639997141664, -0.1785824161072392, 0.04418723712729263, 0.22167050866252666, -0.02334703849673559, 0.26724894689216055, -0.4313572229601551, -0.1762574180546734, 0.06839323868291174, 0.19623222571329757, 0.14885152907083757, 0.012966888103013238, -0.25122933392188, 0.07384700137797905, -0.22937399126557803, -0.20049292145854825, -0.13589490995099004, 0.0353564733300799, -0.014451551780887488, -0.2983869130842406, 0.150856112404434, -0.02019899200135167, -0.011846536921184276, -0.048930061828673495, -0.07634386831021683, 0.03440531063037542, 0.10942524084303942, 0.10696359550139466, 0.04985979310200878, 0.13873212267802174, -0.13051651564881134, -0.0576272368642551, 0.3387728763996187, -0.1794255734888099, -0.1447716507844735, 0.14593224570937996, -0.20957493390618026, -0.08846102189413241, 0.16000218012770592, 0.1333468769820956, 0.13947929512874724, -0.1078558295559147, 0.146732122942992, 0.04216676216363313, 0.1887948521129463, 0.07225766740199449, 0.05846564504115478, 0.13528147065373147, 0.11969628887687436, 0.058963470201453434, 0.10819666719194591, -0.041205697065300265, -0.15627809446012592, -0.35643948807160636, -0.08439862744990682, -0.13723954192915558, 0.08828051212347215, -0.17788055411489076, -0.19478338158235026, 0.4138329484756442, 0.1360551602980977, 0.20506102322704262, 0.1339400132852584, 0.27264643361980934, 0.21038306162440654, 0.06778545977529768, 0.09379906170440648, 0.2169018648137397, 0.10958804227276772, 0.06408005086468883, -0.28478164757840374, -0.022025371404535674, 0.08645118621362437] |
1,802.09847 | On-chip transverse-mode entangled photon pair source | Integrated entangled photon pair source is an essential resource for both
fundamental investigations and practical applications of quantum information
science. Currently there have been several types of entanglement, among which
the transverse-mode entanglement is becoming attractive because of its unique
advantages. Here, we report an on-chip transverse-mode entangled photon pair
source via the spontaneous four-wave mixing processes in a multimode silicon
waveguide. Transverse-mode photon pairs are verified over multiple frequency
channels within a bandwidth of $\sim$2~THz, and a maximally entangled Bell
state is also produced with a net fidelity of $0.96\pm0.01$. Our entangled
photon pair source is the key element for quantum photonics based on
transverse-mode, and also has the possibility to extend to higher-dimensional
Hilbert space. Furthermore, the transverse-mode entanglement can be converted
coherently to path and polarization entanglement, which paves the way to
realizing highly complex quantum photonic circuits with multiple degrees of
freedom.
| quant-ph physics.optics | integrated entangled photon pair source is an essential resource for both fundamental investigations and practical applications of quantum information science currently there have been several types of entanglement among which the transversemode entanglement is becoming attractive because of its unique advantages here we report an onchip transversemode entangled photon pair source via the spontaneous fourwave mixing processes in a multimode silicon waveguide transversemode photon pairs are verified over multiple frequency channels within a bandwidth of sim2thz and a maximally entangled bell state is also produced with a net fidelity of 096pm001 our entangled photon pair source is the key element for quantum photonics based on transversemode and also has the possibility to extend to higherdimensional hilbert space furthermore the transversemode entanglement can be converted coherently to path and polarization entanglement which paves the way to realizing highly complex quantum photonic circuits with multiple degrees of freedom | [['integrated', 'entangled', 'photon', 'pair', 'source', 'is', 'an', 'essential', 'resource', 'for', 'both', 'fundamental', 'investigations', 'and', 'practical', 'applications', 'of', 'quantum', 'information', 'science', 'currently', 'there', 'have', 'been', 'several', 'types', 'of', 'entanglement', 'among', 'which', 'the', 'transversemode', 'entanglement', 'is', 'becoming', 'attractive', 'because', 'of', 'its', 'unique', 'advantages', 'here', 'we', 'report', 'an', 'onchip', 'transversemode', 'entangled', 'photon', 'pair', 'source', 'via', 'the', 'spontaneous', 'fourwave', 'mixing', 'processes', 'in', 'a', 'multimode', 'silicon', 'waveguide', 'transversemode', 'photon', 'pairs', 'are', 'verified', 'over', 'multiple', 'frequency', 'channels', 'within', 'a', 'bandwidth', 'of', 'sim2thz', 'and', 'a', 'maximally', 'entangled', 'bell', 'state', 'is', 'also', 'produced', 'with', 'a', 'net', 'fidelity', 'of', '096pm001', 'our', 'entangled', 'photon', 'pair', 'source', 'is', 'the', 'key', 'element', 'for', 'quantum', 'photonics', 'based', 'on', 'transversemode', 'and', 'also', 'has', 'the', 'possibility', 'to', 'extend', 'to', 'higherdimensional', 'hilbert', 'space', 'furthermore', 'the', 'transversemode', 'entanglement', 'can', 'be', 'converted', 'coherently', 'to', 'path', 'and', 'polarization', 'entanglement', 'which', 'paves', 'the', 'way', 'to', 'realizing', 'highly', 'complex', 'quantum', 'photonic', 'circuits', 'with', 'multiple', 'degrees', 'of', 'freedom']] | [-0.14630520630938312, 0.22880738894895736, -0.05266133079486382, -0.00103923664169593, -0.02607051256442598, -0.20727499502633387, 0.029740653107486043, 0.4425482381031745, -0.25336726996278636, -0.2478105777926329, 0.03795395396890752, -0.2891952205229447, -0.06153861745648707, 0.2684850082991438, 0.0038205929142552325, 0.12485182041766368, 0.0710125427512038, -0.021013435985272128, 0.011726220580587525, -0.20448554954620907, 0.2975607710799927, 0.04000242782300726, 0.3360627674701391, 0.08675915267020981, 0.15001050311386482, 0.024019730193281755, 0.006416033513637053, -0.08613290595389521, -0.03525859366507373, 0.1611804156243074, 0.29577227952379165, 0.10240053845821724, 0.2478784987858186, -0.39099425495886764, -0.23023023882948715, 0.13444977102982295, 0.14932428607749493, 0.16666474286143462, -0.07116438589825218, -0.32007064069491914, -0.003230081361834891, -0.18315365782473236, -0.0987806642434508, -0.09701775947663312, 0.01938944849340866, -0.061368095378081, -0.24813227213841552, 0.04031504544279111, 0.016417330619636534, 0.0006857058453735792, 0.08835830897361222, -0.011387700266722176, -0.03730451808304577, 0.08328394970804867, -0.09844908560626209, -0.0017777254640047129, 0.11645179772878894, -0.13146083333089742, -0.21257662083048168, 0.34985425300611595, -0.011895064715241056, -0.19283363772653198, 0.17590001895668037, -0.08553821811559222, -0.06716367415275373, 0.10621982861387853, 0.14540390448059448, 0.09557744263697208, -0.1618814721748802, 0.02348333580205993, -0.00912495259480137, 0.23567695933161303, 0.095280035352011, 0.26369290210358387, 0.26485371096982313, 0.1324662716021218, 0.06508795903048142, 0.2202687172450371, -0.07253365774360848, -0.14000603087091198, -0.30866842444083886, -0.24200054560787976, -0.2275150188328957, 0.08443826576452314, -0.06938652400074513, -0.10958308826148924, 0.4077168130897917, 0.09322614988761618, 0.09235767959115845, -0.05362464218988963, 0.2971707905590948, 0.09989297533643872, 0.08578679944912437, 0.05380240246368986, 0.26934516151797855, 0.17419388224273766, 0.050966342431719464, -0.22382609341810975, -0.008117353605080603, -0.047379889299109995] |
1,802.09848 | Generalized Langevin Equation and non-Markovian fluctuation-dissipation
theorem for particle-bath systems in external oscillating fields | The Generalized Langevin Equation (GLE) can be derived from a particle-bath
Hamiltonian, in both classical and quantum dynamics, and provides a route to
the (both Markovian and non-Markovian) fluctuation-dissipation theorem (FDT).
All previous studies have focused either on particle-bath systems with
time-independent external forces only, or on the simplified case where only the
tagged particle is subject to the external time-dependent oscillatory field.
Here we extend the GLE and the corresponding FDT for the more general case
where both the tagged particle and the bath oscillators respond to an external
oscillatory field. This is the example of a charged or polarisable particle
immersed in a bath of other particles that are also charged or polarizable,
under an external AC electric field. For this Hamiltonian, we find that the
ensemble average of the stochastic force is not zero, but proportional to the
AC field. The associated FDT reads as $\langle
F_P(t)F_P(t')\rangle=mk_BT\nu(t-t')+(\gamma e)^2E(t)E(t')$, where $F_{p}$ is
the random force, $\nu(t-t')$ is the friction memory function, and $\gamma$ is
a numerical prefactor.
| cond-mat.stat-mech cond-mat.soft physics.chem-ph | the generalized langevin equation gle can be derived from a particlebath hamiltonian in both classical and quantum dynamics and provides a route to the both markovian and nonmarkovian fluctuationdissipation theorem fdt all previous studies have focused either on particlebath systems with timeindependent external forces only or on the simplified case where only the tagged particle is subject to the external timedependent oscillatory field here we extend the gle and the corresponding fdt for the more general case where both the tagged particle and the bath oscillators respond to an external oscillatory field this is the example of a charged or polarisable particle immersed in a bath of other particles that are also charged or polarizable under an external ac electric field for this hamiltonian we find that the ensemble average of the stochastic force is not zero but proportional to the ac field the associated fdt reads as langle f_ptf_ptranglemk_btnuttgamma e2etet where f_p is the random force nutt is the friction memory function and gamma is a numerical prefactor | [['the', 'generalized', 'langevin', 'equation', 'gle', 'can', 'be', 'derived', 'from', 'a', 'particlebath', 'hamiltonian', 'in', 'both', 'classical', 'and', 'quantum', 'dynamics', 'and', 'provides', 'a', 'route', 'to', 'the', 'both', 'markovian', 'and', 'nonmarkovian', 'fluctuationdissipation', 'theorem', 'fdt', 'all', 'previous', 'studies', 'have', 'focused', 'either', 'on', 'particlebath', 'systems', 'with', 'timeindependent', 'external', 'forces', 'only', 'or', 'on', 'the', 'simplified', 'case', 'where', 'only', 'the', 'tagged', 'particle', 'is', 'subject', 'to', 'the', 'external', 'timedependent', 'oscillatory', 'field', 'here', 'we', 'extend', 'the', 'gle', 'and', 'the', 'corresponding', 'fdt', 'for', 'the', 'more', 'general', 'case', 'where', 'both', 'the', 'tagged', 'particle', 'and', 'the', 'bath', 'oscillators', 'respond', 'to', 'an', 'external', 'oscillatory', 'field', 'this', 'is', 'the', 'example', 'of', 'a', 'charged', 'or', 'polarisable', 'particle', 'immersed', 'in', 'a', 'bath', 'of', 'other', 'particles', 'that', 'are', 'also', 'charged', 'or', 'polarizable', 'under', 'an', 'external', 'ac', 'electric', 'field', 'for', 'this', 'hamiltonian', 'we', 'find', 'that', 'the', 'ensemble', 'average', 'of', 'the', 'stochastic', 'force', 'is', 'not', 'zero', 'but', 'proportional', 'to', 'the', 'ac', 'field', 'the', 'associated', 'fdt', 'reads', 'as', 'langle', 'f_ptf_ptranglemk_btnuttgamma', 'e2etet', 'where', 'f_p', 'is', 'the', 'random', 'force', 'nutt', 'is', 'the', 'friction', 'memory', 'function', 'and', 'gamma', 'is', 'a', 'numerical', 'prefactor']] | [-0.14965125930520806, 0.2171876228392385, -0.08318342286981194, 0.05442471336853881, -0.036182822516547086, -0.17805919982212404, -4.050649102238646e-05, 0.3298510693978653, -0.2616379706256361, -0.25745986088975725, 0.02413471223974421, -0.29354188811729653, -0.12217444856791387, 0.21415961056411917, -0.013331524269299087, 0.025560409318745494, 0.040606413007130374, 0.11231817523051188, 0.016290900788370925, -0.182759481038988, 0.27310358962122666, 0.04141682774215622, 0.23824640164847474, 0.03762476945805072, 0.11159900895106685, 0.03531042093983346, 0.037284983961607315, 0.05847199842213171, -0.08994766830016805, 0.018845083612769126, 0.1523391895363646, 0.00206193061691361, 0.24389651229223572, -0.46216352073004446, -0.2153101366809962, 0.12811980212769325, 0.12457793775131695, 0.14447317727987308, -0.040268252974432886, -0.28376765470076576, 0.013328069585364267, -0.16418081171058838, -0.1275936393684382, -0.08532735446176257, 0.045571172954963456, 0.07216028055366892, -0.2986008765271315, 0.13609682020983035, 0.10010543176118868, 0.055033435434922125, -0.08222276952919966, -0.058429366288319545, 0.015238679176847259, 0.09961840387360832, 0.05812549361880554, 0.07744691865687, 0.23242440887485596, -0.1628066968447697, -0.07229316975018121, 0.38008707017267507, -0.09025281591408224, -0.2885007908517293, 0.20224911275920066, -0.13546041577089443, -0.08672504918930311, 0.1080026266007987, 0.1370066824644041, 0.11783859117169786, -0.21607138656910105, 0.11468629271187539, -0.030978803444339568, 0.14878368485965823, 0.03838146344410727, -0.04048322083488814, 0.15780548311220147, 0.09799061577587602, 0.06181350666384426, 0.1635773535092019, -0.06403766036088332, -0.1557176071303302, -0.3045928361769541, -0.1543974953209869, -0.1979107885089905, 0.12654056245082757, -0.07528878920252227, -0.16486031592385955, 0.3538950069257653, 0.13855049832189648, 0.11611215153664171, 0.0384766054564122, 0.29656439716366667, 0.19104533133599122, 0.011893187402691468, 0.07857021698391581, 0.2344582829040935, 0.16260675980614117, 0.11286190791610988, -0.2683740380452946, 0.0030434852387441927, 0.03105669625731836] |
1,802.09849 | Stratification and averaging for exponential sums: bilinear forms with
generalized Kloosterman sums | We prove non-trivial bounds for bilinear forms with hyper-Kloosterman sums
with characters modulo a prime $q$ which, for both variables of length $M$, are
non-trivial as soon as $M\geq q^{3/8+\delta}$ for any $\delta>0$. This range,
which matches Burgess's range, is identical with the best results previously
known only for simpler exponentials of monomials. The proof combines
refinements of the analytic tools from our previous paper and new geometric
methods. The key geometric idea is a comparison statement that shows that even
when the "sum-product" sheaves that appear in the analysis fail to be
irreducible, their decomposition reflects that of the "input" sheaves, except
for parameters in a high-codimension subset. This property is proved by a
subtle interplay between \'etale cohomology in its algebraic and diophantine
incarnations. We prove a first application concerning the first moment of a
family of $L$-functions of degree $3$.
| math.NT math.AG | we prove nontrivial bounds for bilinear forms with hyperkloosterman sums with characters modulo a prime q which for both variables of length m are nontrivial as soon as mgeq q38delta for any delta0 this range which matches burgesss range is identical with the best results previously known only for simpler exponentials of monomials the proof combines refinements of the analytic tools from our previous paper and new geometric methods the key geometric idea is a comparison statement that shows that even when the sumproduct sheaves that appear in the analysis fail to be irreducible their decomposition reflects that of the input sheaves except for parameters in a highcodimension subset this property is proved by a subtle interplay between etale cohomology in its algebraic and diophantine incarnations we prove a first application concerning the first moment of a family of lfunctions of degree 3 | [['we', 'prove', 'nontrivial', 'bounds', 'for', 'bilinear', 'forms', 'with', 'hyperkloosterman', 'sums', 'with', 'characters', 'modulo', 'a', 'prime', 'q', 'which', 'for', 'both', 'variables', 'of', 'length', 'm', 'are', 'nontrivial', 'as', 'soon', 'as', 'mgeq', 'q38delta', 'for', 'any', 'delta0', 'this', 'range', 'which', 'matches', 'burgesss', 'range', 'is', 'identical', 'with', 'the', 'best', 'results', 'previously', 'known', 'only', 'for', 'simpler', 'exponentials', 'of', 'monomials', 'the', 'proof', 'combines', 'refinements', 'of', 'the', 'analytic', 'tools', 'from', 'our', 'previous', 'paper', 'and', 'new', 'geometric', 'methods', 'the', 'key', 'geometric', 'idea', 'is', 'a', 'comparison', 'statement', 'that', 'shows', 'that', 'even', 'when', 'the', 'sumproduct', 'sheaves', 'that', 'appear', 'in', 'the', 'analysis', 'fail', 'to', 'be', 'irreducible', 'their', 'decomposition', 'reflects', 'that', 'of', 'the', 'input', 'sheaves', 'except', 'for', 'parameters', 'in', 'a', 'highcodimension', 'subset', 'this', 'property', 'is', 'proved', 'by', 'a', 'subtle', 'interplay', 'between', 'etale', 'cohomology', 'in', 'its', 'algebraic', 'and', 'diophantine', 'incarnations', 'we', 'prove', 'a', 'first', 'application', 'concerning', 'the', 'first', 'moment', 'of', 'a', 'family', 'of', 'lfunctions', 'of', 'degree', '3']] | [-0.17158358615446598, 0.050008334957888013, -0.11588087054101605, 0.07735655518621867, -0.09645667211119588, -0.14272927355470386, 0.026996362504816834, 0.29606899667319886, -0.30525390040261524, -0.266679538242149, 0.10394857420027917, -0.23567027865466497, -0.1597893848562785, 0.2501739365269978, -0.11022900198156951, 0.015662191876173945, 0.048346932315274226, 0.07177975810800039, -0.09707558653581597, -0.27960259584934577, 0.370779551611883, -0.0512115996040351, 0.20475304546990558, 0.0442554514858449, 0.0877323750743365, 0.017118632610547125, -0.0036142750920608955, -0.03705767783210844, -0.1244953726065355, 0.13414156391344806, 0.3072670314143947, 0.0752200710666465, 0.22544244034480013, -0.35852701038597745, -0.14968625495395232, 0.15581718300954697, 0.14189241993313667, 0.07229537792100921, -0.012364564242224532, -0.23287118358392242, 0.13092593502101377, -0.14019747292682783, -0.14963410018302553, -0.11254799696914058, 0.05790214271925337, 0.06705431491863115, -0.2982203877441823, 0.02263410256866775, 0.1469363376848294, 0.10794038371453789, -0.0682086331170409, -0.18022247340791472, 0.019311394487756983, 0.08319601189639875, 0.04170374410616644, 0.043735683043586444, 0.028146434882457588, -0.10085063716000382, -0.12668625743983722, 0.3536297418916076, -0.04309402904985142, -0.19096002159375988, 0.13798241079157442, -0.14304502488358328, -0.19532490997898874, 0.11160515111719146, 0.0682195332677414, 0.13881142116118725, -0.0388170206620637, 0.1436917460548315, -0.13391007846947892, 0.16160120663120814, 0.10849884725406977, 0.04697983106268002, 0.1361676515203881, 0.08769648070513199, 0.07896401730187713, 0.12733393028487472, 0.00011209957962129132, -0.05557244186494367, -0.35039580700562356, -0.1750603331655845, -0.1795192671038131, 0.09659614739691878, -0.13799535168862426, -0.1630732535594308, 0.38689036420975803, 0.10982156594792473, 0.1965087588813737, 0.15349199647803838, 0.26531855681422334, 0.07273694309026188, 0.05537392142400516, 0.07150760143070567, 0.16731982328103367, 0.176472913849511, -0.004877564436194639, -0.10636076572721044, 0.06363630379304118, 0.16065185278957933] |
1,802.0985 | Solving Inverse Computational Imaging Problems using Deep Pixel-level
Prior | Signal reconstruction is a challenging aspect of computational imaging as it
often involves solving ill-posed inverse problems. Recently, deep feed-forward
neural networks have led to state-of-the-art results in solving various inverse
imaging problems. However, being task specific, these networks have to be
learned for each inverse problem. On the other hand, a more flexible approach
would be to learn a deep generative model once and then use it as a signal
prior for solving various inverse problems. We show that among the various
state of the art deep generative models, autoregressive models are especially
suitable for our purpose for the following reasons. First, they explicitly
model the pixel level dependencies and hence are capable of reconstructing
low-level details such as texture patterns and edges better. Second, they
provide an explicit expression for the image prior which can then be used for
MAP based inference along with the forward model. Third, they can model long
range dependencies in images which make them ideal for handling global
multiplexing as encountered in various compressive imaging systems. We
demonstrate the efficacy of our proposed approach in solving three
computational imaging problems: Single Pixel Camera (SPC), LiSens and FlatCam.
For both real and simulated cases, we obtain better reconstructions than the
state-of-the-art methods in terms of perceptual and quantitative metrics.
| cs.CV cs.LG | signal reconstruction is a challenging aspect of computational imaging as it often involves solving illposed inverse problems recently deep feedforward neural networks have led to stateoftheart results in solving various inverse imaging problems however being task specific these networks have to be learned for each inverse problem on the other hand a more flexible approach would be to learn a deep generative model once and then use it as a signal prior for solving various inverse problems we show that among the various state of the art deep generative models autoregressive models are especially suitable for our purpose for the following reasons first they explicitly model the pixel level dependencies and hence are capable of reconstructing lowlevel details such as texture patterns and edges better second they provide an explicit expression for the image prior which can then be used for map based inference along with the forward model third they can model long range dependencies in images which make them ideal for handling global multiplexing as encountered in various compressive imaging systems we demonstrate the efficacy of our proposed approach in solving three computational imaging problems single pixel camera spc lisens and flatcam for both real and simulated cases we obtain better reconstructions than the stateoftheart methods in terms of perceptual and quantitative metrics | [['signal', 'reconstruction', 'is', 'a', 'challenging', 'aspect', 'of', 'computational', 'imaging', 'as', 'it', 'often', 'involves', 'solving', 'illposed', 'inverse', 'problems', 'recently', 'deep', 'feedforward', 'neural', 'networks', 'have', 'led', 'to', 'stateoftheart', 'results', 'in', 'solving', 'various', 'inverse', 'imaging', 'problems', 'however', 'being', 'task', 'specific', 'these', 'networks', 'have', 'to', 'be', 'learned', 'for', 'each', 'inverse', 'problem', 'on', 'the', 'other', 'hand', 'a', 'more', 'flexible', 'approach', 'would', 'be', 'to', 'learn', 'a', 'deep', 'generative', 'model', 'once', 'and', 'then', 'use', 'it', 'as', 'a', 'signal', 'prior', 'for', 'solving', 'various', 'inverse', 'problems', 'we', 'show', 'that', 'among', 'the', 'various', 'state', 'of', 'the', 'art', 'deep', 'generative', 'models', 'autoregressive', 'models', 'are', 'especially', 'suitable', 'for', 'our', 'purpose', 'for', 'the', 'following', 'reasons', 'first', 'they', 'explicitly', 'model', 'the', 'pixel', 'level', 'dependencies', 'and', 'hence', 'are', 'capable', 'of', 'reconstructing', 'lowlevel', 'details', 'such', 'as', 'texture', 'patterns', 'and', 'edges', 'better', 'second', 'they', 'provide', 'an', 'explicit', 'expression', 'for', 'the', 'image', 'prior', 'which', 'can', 'then', 'be', 'used', 'for', 'map', 'based', 'inference', 'along', 'with', 'the', 'forward', 'model', 'third', 'they', 'can', 'model', 'long', 'range', 'dependencies', 'in', 'images', 'which', 'make', 'them', 'ideal', 'for', 'handling', 'global', 'multiplexing', 'as', 'encountered', 'in', 'various', 'compressive', 'imaging', 'systems', 'we', 'demonstrate', 'the', 'efficacy', 'of', 'our', 'proposed', 'approach', 'in', 'solving', 'three', 'computational', 'imaging', 'problems', 'single', 'pixel', 'camera', 'spc', 'lisens', 'and', 'flatcam', 'for', 'both', 'real', 'and', 'simulated', 'cases', 'we', 'obtain', 'better', 'reconstructions', 'than', 'the', 'stateoftheart', 'methods', 'in', 'terms', 'of', 'perceptual', 'and', 'quantitative', 'metrics']] | [-0.005026652293041522, -0.0006953034543860054, -0.0650858357299639, 0.10736938943100963, -0.1127620454715175, -0.19031767371776623, -0.046774901497329394, 0.4538160802796483, -0.30083388514426906, -0.3599203150026327, 0.14507372758925222, -0.25112857003804556, -0.2099134358988945, 0.2389033652996363, -0.0762130574258261, 0.13659050285946145, 0.11697840346889787, 0.008824979016952606, -0.08227236925943776, -0.24618362081778605, 0.2777211439579205, 0.042487496931002976, 0.31948232563689005, 0.01157327825041098, 0.1507120780062017, -0.009514881902764184, -0.02225753759212662, 0.01790134255661119, -0.0432585139890529, 0.14929237079503405, 0.3296293434420625, 0.18127143091144315, 0.2875185873077879, -0.45535224434421506, -0.27676124134382535, 0.11183685617911261, 0.1548041545685792, 0.11122005266343178, -0.04049453426153821, -0.29111922370313215, 0.1007352250454904, -0.1264485874364889, -0.0028367035980282223, -0.13242923245700292, -0.011781002114916783, -0.0025077856066144347, -0.298922037349494, 0.0555503660504338, 0.05514147738536257, 0.04697053240568832, -0.08404969932879647, -0.14544801536384364, 0.04858489839446752, 0.1506370265521434, 0.006942348053332332, 0.02060069418796555, 0.10260507463109354, -0.22598551450768312, -0.1316532901469293, 0.356636150692438, -0.02074880899873638, -0.25006669022056255, 0.1973424518058553, -0.04404001993527853, -0.15151172770663748, 0.09956030426330345, 0.21310192464937477, 0.1431141114492527, -0.16830964732352038, 0.02104397714192178, -0.02162879666443481, 0.16389563763568307, 0.03826400574383348, -0.0021966524487144726, 0.174539081659168, 0.23655490082103844, 0.05511511873269757, 0.1286548585059706, -0.13915518783073505, -0.07113465531837455, -0.21154968307548483, -0.11429805716088172, -0.15836270755633367, -0.03265373146074802, -0.11014920129443433, -0.14242804982532953, 0.39132719742957245, 0.23804291396971716, 0.20037289994963725, 0.07125634084845525, 0.36664188014300064, 0.10362788575571463, 0.09472727314893936, 0.040844577807272506, 0.20037570462973658, 0.07000630194711131, 0.11700450633544215, -0.1461967747416185, 0.0818370337998711, 0.036697916643894386] |
1,802.09851 | Searching for Lepton Flavour Violation with the Mu3e Experiment | The upcoming Mu3e experiment searches for the lepton flavour violating decay
$\mu^+\,\rightarrow\,e^+ e^- e^+$ with the aim of a final sensitivity of one
signal decay in $10^{16}$ observed muon decays, an improvement over the
preceding SINDRUM experiment by four orders of magnitude. In the first phase,
the experiment will be operated at an existing intense muon beam line at the
Paul Scherrer Institute. With muon stopping rates of about
$10^{8}\text{s}^{-1}$, a single-event sensitivity of $2\cdot 10^{-15}$ can be
achieved. For the ultimate sensitivity, a new high intensity muon beam line is
required. In order to suppress background, the tracking detector is designed to
measure low momentum electron and positron tracks with excellent precision by
making use of very thin silicon pixel sensors. In addition, scintillating
fibres and tiles provide precise timing information. Currently, the
collaboration is finalizing the detector design and preparing for construction
and commissioning.
| physics.ins-det hep-ex | the upcoming mu3e experiment searches for the lepton flavour violating decay murightarrowe e e with the aim of a final sensitivity of one signal decay in 1016 observed muon decays an improvement over the preceding sindrum experiment by four orders of magnitude in the first phase the experiment will be operated at an existing intense muon beam line at the paul scherrer institute with muon stopping rates of about 108texts1 a singleevent sensitivity of 2cdot 1015 can be achieved for the ultimate sensitivity a new high intensity muon beam line is required in order to suppress background the tracking detector is designed to measure low momentum electron and positron tracks with excellent precision by making use of very thin silicon pixel sensors in addition scintillating fibres and tiles provide precise timing information currently the collaboration is finalizing the detector design and preparing for construction and commissioning | [['the', 'upcoming', 'mu3e', 'experiment', 'searches', 'for', 'the', 'lepton', 'flavour', 'violating', 'decay', 'murightarrowe', 'e', 'e', 'with', 'the', 'aim', 'of', 'a', 'final', 'sensitivity', 'of', 'one', 'signal', 'decay', 'in', '1016', 'observed', 'muon', 'decays', 'an', 'improvement', 'over', 'the', 'preceding', 'sindrum', 'experiment', 'by', 'four', 'orders', 'of', 'magnitude', 'in', 'the', 'first', 'phase', 'the', 'experiment', 'will', 'be', 'operated', 'at', 'an', 'existing', 'intense', 'muon', 'beam', 'line', 'at', 'the', 'paul', 'scherrer', 'institute', 'with', 'muon', 'stopping', 'rates', 'of', 'about', '108texts1', 'a', 'singleevent', 'sensitivity', 'of', '2cdot', '1015', 'can', 'be', 'achieved', 'for', 'the', 'ultimate', 'sensitivity', 'a', 'new', 'high', 'intensity', 'muon', 'beam', 'line', 'is', 'required', 'in', 'order', 'to', 'suppress', 'background', 'the', 'tracking', 'detector', 'is', 'designed', 'to', 'measure', 'low', 'momentum', 'electron', 'and', 'positron', 'tracks', 'with', 'excellent', 'precision', 'by', 'making', 'use', 'of', 'very', 'thin', 'silicon', 'pixel', 'sensors', 'in', 'addition', 'scintillating', 'fibres', 'and', 'tiles', 'provide', 'precise', 'timing', 'information', 'currently', 'the', 'collaboration', 'is', 'finalizing', 'the', 'detector', 'design', 'and', 'preparing', 'for', 'construction', 'and', 'commissioning']] | [-0.058980495385993786, 0.2275021255661866, -0.017728818939455476, 0.04815209456379913, -0.02129697565073406, -0.14833663293069954, 0.007289034999202058, 0.354799607092395, -0.16248142219329667, -0.3779019363121026, 0.09381063625510756, -0.3416089231031947, 0.06607422234568124, 0.2102243629633449, -0.0071941739814873375, 0.1231338555032077, 0.09379487984956035, -0.004307578442118635, -0.06312103952869721, -0.2281046811193745, 0.17199679881903446, 0.22296790611774972, 0.29564161769748254, 0.05845994064455024, 0.13918899075522656, -0.0118685622615481, -0.0570113080385555, -0.06958444268093444, -0.10288251224361981, 0.0611096810154979, 0.2891037771072054, 0.12044051028270689, 0.13105554799807984, -0.42281334832983297, -0.08687856678099909, 0.1434579069286378, 0.08996556181227788, 0.033140392230254494, -0.09317998439008887, -0.3160617467963473, 0.08540527084793818, -0.16707602844689973, -0.13963866570419567, -0.022539055380750343, -0.027129679155122075, 0.006003715634708189, -0.3014989999861023, -0.01923840278808105, -0.018259960365766246, 0.06230469936013429, -0.0010519139792045786, -0.1499119243429353, 0.08130410296143964, 0.05081402381377605, 0.0345932132994575, 0.12356710511489331, 0.1855997483039068, -0.1342164562067612, -0.15601271313304702, 0.31562364891093847, -0.08262831731230512, -0.10716460791364726, 0.12237139108159074, -0.25410968498262165, -0.0850941737040153, 0.21996616709576403, 0.18719559572895783, 0.06006602114131157, -0.18889635258690557, 0.04466917422400406, 0.05590530419956647, 0.21174813780493829, 0.10937886523121658, 0.0383896655451584, 0.2405569911093658, 0.28316012780285543, 0.12001721046181046, 0.06868406489795437, -0.19726542843919662, 0.04491248155439583, -0.3473520484872602, -0.1557981595770899, -0.10192368120058543, 0.056468287733474024, -0.00912386428576105, -0.020866153564485204, 0.39749259677935495, 0.09055073285061452, 0.17371076788145323, -0.04158566638296987, 0.33448849799525404, 0.04610111424699426, 0.0668299043932671, -0.039487899968258314, 0.325721691802351, 0.13272369376459714, 0.1486216545333971, -0.24344426256397533, 0.052850533651912376, 0.016412692944868468] |
1,802.09852 | Molecular line emission in NGC 4945, imaged with ALMA | NGC 4945 is one of the nearest (~3.8 Mpc; 1" ~ 19 pc) starburst galaxies.
ALMA band 3 (3--4\,mm) observations of HCN, HCO+, CS, C3H2, SiO, HCO, and
CH3C2H were carried out with ~2" resolution. The lines reveal a rotating
nuclear disk of projected size 10" x 2" with position angle ~45 deg,
inclination ~75 deg and an unresolved bright central core of size <2.5". The
continuum source (mostly free-free radiation) is more compact than the nuclear
disk by a linear factor of two but shows the same position angle and is
centered 0.39" +_ 0.14" northeast of the nuclear accretion disk defined by H2O
maser emission. Outside the nuclear disk, both HCN and CS delineate molecular
arms on opposite sides of the dynamical center. These are connected by a
(deprojected) 0.6 kpc sized molecular bridge, likely a dense gaseous bar seen
almost ends-on, shifting gas from the front and back side into the nuclear
disk. Modeling this nuclear disk located farther inside <100 pc) with tilted
rings indicates a coplanar outflow reaching a characteristic deprojectd
velocity of ~50 km/s. All our molecular lines, with the notable exception of
CH3C2H, show significant absorption near the systemic velocity (~571 km/s),
within a range of ~500-660 km/s. Apparently, only molecular transitions with
low critical H2-density do not show absorption. The velocity field of the
nuclear disk, derived from CH3C2H, provides evidence for rigid rotation in the
inner few arcseconds and a dynamical mass of M = (2.1+_0.2) x 10^8 Mo inside a
galactocentric radius of 2.45", with a significantly flattened rotation curve
farther out. Velocity integrated line intensity maps with most pronounced
absorption show molecular peak positions up to 1.5" southwest of the continuum
peak, presumably due to absorption, which appears to be most severe slightly
northeast of the nuclear maser disk.
| astro-ph.GA | ngc 4945 is one of the nearest 38 mpc 1 19 pc starburst galaxies alma band 3 34mm observations of hcn hco cs c3h2 sio hco and ch3c2h were carried out with 2 resolution the lines reveal a rotating nuclear disk of projected size 10 x 2 with position angle 45 deg inclination 75 deg and an unresolved bright central core of size 25 the continuum source mostly freefree radiation is more compact than the nuclear disk by a linear factor of two but shows the same position angle and is centered 039 _ 014 northeast of the nuclear accretion disk defined by h2o maser emission outside the nuclear disk both hcn and cs delineate molecular arms on opposite sides of the dynamical center these are connected by a deprojected 06 kpc sized molecular bridge likely a dense gaseous bar seen almost endson shifting gas from the front and back side into the nuclear disk modeling this nuclear disk located farther inside 100 pc with tilted rings indicates a coplanar outflow reaching a characteristic deprojectd velocity of 50 kms all our molecular lines with the notable exception of ch3c2h show significant absorption near the systemic velocity 571 kms within a range of 500660 kms apparently only molecular transitions with low critical h2density do not show absorption the velocity field of the nuclear disk derived from ch3c2h provides evidence for rigid rotation in the inner few arcseconds and a dynamical mass of m 21_02 x 108 mo inside a galactocentric radius of 245 with a significantly flattened rotation curve farther out velocity integrated line intensity maps with most pronounced absorption show molecular peak positions up to 15 southwest of the continuum peak presumably due to absorption which appears to be most severe slightly northeast of the nuclear maser disk | [['ngc', '4945', 'is', 'one', 'of', 'the', 'nearest', '38', 'mpc', '1', '19', 'pc', 'starburst', 'galaxies', 'alma', 'band', '3', '34mm', 'observations', 'of', 'hcn', 'hco', 'cs', 'c3h2', 'sio', 'hco', 'and', 'ch3c2h', 'were', 'carried', 'out', 'with', '2', 'resolution', 'the', 'lines', 'reveal', 'a', 'rotating', 'nuclear', 'disk', 'of', 'projected', 'size', '10', 'x', '2', 'with', 'position', 'angle', '45', 'deg', 'inclination', '75', 'deg', 'and', 'an', 'unresolved', 'bright', 'central', 'core', 'of', 'size', '25', 'the', 'continuum', 'source', 'mostly', 'freefree', 'radiation', 'is', 'more', 'compact', 'than', 'the', 'nuclear', 'disk', 'by', 'a', 'linear', 'factor', 'of', 'two', 'but', 'shows', 'the', 'same', 'position', 'angle', 'and', 'is', 'centered', '039', '_', '014', 'northeast', 'of', 'the', 'nuclear', 'accretion', 'disk', 'defined', 'by', 'h2o', 'maser', 'emission', 'outside', 'the', 'nuclear', 'disk', 'both', 'hcn', 'and', 'cs', 'delineate', 'molecular', 'arms', 'on', 'opposite', 'sides', 'of', 'the', 'dynamical', 'center', 'these', 'are', 'connected', 'by', 'a', 'deprojected', '06', 'kpc', 'sized', 'molecular', 'bridge', 'likely', 'a', 'dense', 'gaseous', 'bar', 'seen', 'almost', 'endson', 'shifting', 'gas', 'from', 'the', 'front', 'and', 'back', 'side', 'into', 'the', 'nuclear', 'disk', 'modeling', 'this', 'nuclear', 'disk', 'located', 'farther', 'inside', '100', 'pc', 'with', 'tilted', 'rings', 'indicates', 'a', 'coplanar', 'outflow', 'reaching', 'a', 'characteristic', 'deprojectd', 'velocity', 'of', '50', 'kms', 'all', 'our', 'molecular', 'lines', 'with', 'the', 'notable', 'exception', 'of', 'ch3c2h', 'show', 'significant', 'absorption', 'near', 'the', 'systemic', 'velocity', '571', 'kms', 'within', 'a', 'range', 'of', '500660', 'kms', 'apparently', 'only', 'molecular', 'transitions', 'with', 'low', 'critical', 'h2density', 'do', 'not', 'show', 'absorption', 'the', 'velocity', 'field', 'of', 'the', 'nuclear', 'disk', 'derived', 'from', 'ch3c2h', 'provides', 'evidence', 'for', 'rigid', 'rotation', 'in', 'the', 'inner', 'few', 'arcseconds', 'and', 'a', 'dynamical', 'mass', 'of', 'm', '21_02', 'x', '108', 'mo', 'inside', 'a', 'galactocentric', 'radius', 'of', '245', 'with', 'a', 'significantly', 'flattened', 'rotation', 'curve', 'farther', 'out', 'velocity', 'integrated', 'line', 'intensity', 'maps', 'with', 'most', 'pronounced', 'absorption', 'show', 'molecular', 'peak', 'positions', 'up', 'to', '15', 'southwest', 'of', 'the', 'continuum', 'peak', 'presumably', 'due', 'to', 'absorption', 'which', 'appears', 'to', 'be', 'most', 'severe', 'slightly', 'northeast', 'of', 'the', 'nuclear', 'maser', 'disk']] | [-0.08531108586917832, 0.06667163994473385, -0.005089706247004938, 0.01123966245296961, -0.03684480463110114, -0.11638877352143585, 0.025453121943316667, 0.4512528352591975, -0.21147689189993912, -0.3024614853657299, 0.051778467379608936, -0.2677296384717672, 0.04013500654586804, 0.13929870495661686, 0.015951605041673464, -0.07378488633886565, 0.013108489509876945, -0.08977782054416479, -0.08099162083916976, -0.14230748118552894, 0.2399087025872956, 0.07034538941038296, 0.12665852758582083, 0.015900154319931928, 0.04908490333064068, -0.1314606056294369, -0.039882602271128845, -0.024902230227181733, -0.13059701958000533, 0.07734972184028083, 0.237344480465713, 0.0581624035599543, 0.22618160417792943, -0.3470959394380336, -0.1773616500689931, 0.0013889328158641736, 0.195712625581466, 0.011185089268867854, 0.0009546600197860653, -0.28931249139723986, 0.054370512400750616, -0.18148330950022182, -0.24388827567080945, 0.13297633366847417, 0.11104200579438683, 0.014861328417670502, -0.16719984594349505, 0.16368743409116596, 0.03362317617609938, 0.16065895353974743, -0.08060055661721253, -0.1861931062096876, -0.09802719575842467, 0.01648307608086107, -0.02844623786654743, 0.15990122259831305, 0.32668226542834944, -0.08631142150887221, 0.004024704964354685, 0.41664189483363295, -0.07792067505625266, 0.0061569780702527875, 0.22573178157698262, -0.2912746671290827, -0.13576279447649195, 0.2809488844903625, 0.099659989656302, 0.09177385516458353, -0.08742460942073843, -0.02884487125856894, -0.07779604589519705, 0.2821879141311218, 0.13047495212981242, 0.023498459604692743, 0.3317601709051889, 0.052744676573154334, 0.08461700393873944, 0.08368030250940231, -0.3230517741519983, -0.09474496354043814, -0.2200114923480059, -0.07006948256909644, -0.07785043649219689, 0.11481144990850083, -0.16943184292206537, -0.0585205163409355, 0.29515297524313167, 0.041936997997390944, 0.27157317894374244, -0.005532360784693561, 0.30126442262464215, 0.039705216167844296, 0.11930550346166888, 0.194919848454633, 0.31555210018956414, 0.22886704482812015, 0.07663008672226564, -0.23498273240370554, 0.03239508580460941, -0.056776713143633646] |
1,802.09853 | Fractional Laplacians and Levy flights in bounded domains | We address L\'{e}vy-stable stochastic processes in bounded domains, with a
focus on a discrimination between inequivalent proposals for what a boundary
data-respecting fractional Laplacian (and thence the induced random process)
should actually be. Versions considered are: restricted Dirichlet, spectral
Dirichlet and regional (censored) fractional Laplacians. The affiliated random
processes comprise: killed, reflected and conditioned L\'{e}vy flights, in
particular those with an infinite life-time. The related concept of
quasi-stationary distributions is briefly mentioned.
| cond-mat.stat-mech math-ph math.AP math.MP math.SP | we address levystable stochastic processes in bounded domains with a focus on a discrimination between inequivalent proposals for what a boundary datarespecting fractional laplacian and thence the induced random process should actually be versions considered are restricted dirichlet spectral dirichlet and regional censored fractional laplacians the affiliated random processes comprise killed reflected and conditioned levy flights in particular those with an infinite lifetime the related concept of quasistationary distributions is briefly mentioned | [['we', 'address', 'levystable', 'stochastic', 'processes', 'in', 'bounded', 'domains', 'with', 'a', 'focus', 'on', 'a', 'discrimination', 'between', 'inequivalent', 'proposals', 'for', 'what', 'a', 'boundary', 'datarespecting', 'fractional', 'laplacian', 'and', 'thence', 'the', 'induced', 'random', 'process', 'should', 'actually', 'be', 'versions', 'considered', 'are', 'restricted', 'dirichlet', 'spectral', 'dirichlet', 'and', 'regional', 'censored', 'fractional', 'laplacians', 'the', 'affiliated', 'random', 'processes', 'comprise', 'killed', 'reflected', 'and', 'conditioned', 'levy', 'flights', 'in', 'particular', 'those', 'with', 'an', 'infinite', 'lifetime', 'the', 'related', 'concept', 'of', 'quasistationary', 'distributions', 'is', 'briefly', 'mentioned']] | [-0.0669538103516253, 0.2266363597650845, -0.05408262763119919, 0.12872887735881103, -0.1060485576974674, -0.14819459086546385, 0.0015354053261624255, 0.3880668805361214, -0.30116852729673116, -0.1765423750662258, 0.16480234382398637, -0.3024789589181752, -0.09526800204225828, 0.13936032728016587, -0.14070417200097105, 0.10831247011206152, 0.06107498238414106, 0.051318998327216425, -0.00662114764366981, -0.1973812255719808, 0.36456436360858274, -0.0028797760605812073, 0.2528802536978898, -0.0017925562258337584, 0.06433017593874059, -0.02326145546484581, -0.11996469655218468, -0.0056207370518011526, -0.16490548652347545, 0.09727971438108615, 0.2413536432120477, 0.01735991316283463, 0.32424890607411805, -0.45232565965975674, -0.22435626257735658, 0.191807003783613, 0.09551641358346284, -0.024138412244854048, 0.013817006923769876, -0.3715019332454868, 0.0072067762629955375, -0.1232807993049353, -0.1405183036588657, 0.011019466862961335, 0.01589733709558241, 0.07457081857137382, -0.2932634884425977, 0.12565696929437173, 0.12720970292641243, -0.0014638750367915966, -0.09968692632752772, -0.16534105919196573, -0.009834232258046386, 0.07869668219658271, 0.018208892336754705, -0.08124232723075948, 0.10882380095139986, -0.0747559916057532, -0.23110477472852234, 0.29851447295030237, -0.04205697565011575, -0.29805198380015263, 0.1602019647818426, -0.18998444687680038, -0.15874140465002454, 0.06441147141584891, 0.16377312493261317, 0.14212862425811693, -0.19439524778125572, 0.12295469308262166, -0.005179251214607395, 0.05665561123947862, 0.13886567995503124, 0.01927635202210554, 0.1778816866637601, 0.1651098832691377, 0.14113437304187987, 0.16830715803186816, -0.03813128526204489, -0.18531922940951837, -0.3354729732472292, -0.10482542419438841, -0.20373701795109245, 0.09490581158496125, -0.0903401717038999, -0.2537542005449953, 0.3527928227558732, 0.13430713939900235, 0.20597214495736949, 0.04946782457327444, 0.160749265976565, 0.19885470687647835, -0.03896697612584267, 0.07924311482806651, 0.039177198330281486, 0.15942733240982807, 0.1297819155504481, -0.13362405895465382, 0.10181171853016589, 0.06717826056840967] |
1,802.09854 | Study of two-photon decays of pseudoscalar mesons via $J/\psi$ radiative
decays | Using a sample of $4.48\times10^{8}$ $\psi(3686)$ events collected with the
BESIII detector at the BEPCII collider, we study the two-photon decays of the
pseudoscalar mesons $\pi^0$, $\eta$, $\eta^\prime$, $\eta(1405)$, $\eta(1475)$,
$\eta(1760)$, and $X(1835)$ in $J/\psi$ radiative decays using
$\psi(3686)\to\pi^{+}\pi^{-}J/\psi$ events. The $\pi^0$, $\eta$ and
$\eta^\prime$ mesons are clearly observed in the two-photon mass spectra, and
the branching fractions are determined to be
$B(J/\psi\to\gamma\pi^{0}\to3\gamma)=(3.57\pm0.12\pm0.16)\times10^{-5}$,
$B(J/\psi\to\gamma\eta\to3\gamma)=(4.42\pm0.04\pm0.18)\times10^{-4}$, and
$B(J/\psi\to\gamma\eta'\to3\gamma)=(1.26\pm0.02\pm0.05)\times10^{-4}$, where
the first errors are statistical and the second systematic. No clear signal for
$\eta(1405)$, $\eta(1475)$, $\eta(1760)$ or $X(1835)$ is observed in the
two-photon mass spectra, and upper limits at the $90\%$ confidence level on the
product branching fractions are obtained.
| hep-ex | using a sample of 448times108 psi3686 events collected with the besiii detector at the bepcii collider we study the twophoton decays of the pseudoscalar mesons pi0 eta etaprime eta1405 eta1475 eta1760 and x1835 in jpsi radiative decays using psi3686topipijpsi events the pi0 eta and etaprime mesons are clearly observed in the twophoton mass spectra and the branching fractions are determined to be bjpsitogammapi0to3gamma357pm012pm016times105 bjpsitogammaetato3gamma442pm004pm018times104 and bjpsitogammaetato3gamma126pm002pm005times104 where the first errors are statistical and the second systematic no clear signal for eta1405 eta1475 eta1760 or x1835 is observed in the twophoton mass spectra and upper limits at the 90 confidence level on the product branching fractions are obtained | [['using', 'a', 'sample', 'of', '448times108', 'psi3686', 'events', 'collected', 'with', 'the', 'besiii', 'detector', 'at', 'the', 'bepcii', 'collider', 'we', 'study', 'the', 'twophoton', 'decays', 'of', 'the', 'pseudoscalar', 'mesons', 'pi0', 'eta', 'etaprime', 'eta1405', 'eta1475', 'eta1760', 'and', 'x1835', 'in', 'jpsi', 'radiative', 'decays', 'using', 'psi3686topipijpsi', 'events', 'the', 'pi0', 'eta', 'and', 'etaprime', 'mesons', 'are', 'clearly', 'observed', 'in', 'the', 'twophoton', 'mass', 'spectra', 'and', 'the', 'branching', 'fractions', 'are', 'determined', 'to', 'be', 'bjpsitogammapi0to3gamma357pm012pm016times105', 'bjpsitogammaetato3gamma442pm004pm018times104', 'and', 'bjpsitogammaetato3gamma126pm002pm005times104', 'where', 'the', 'first', 'errors', 'are', 'statistical', 'and', 'the', 'second', 'systematic', 'no', 'clear', 'signal', 'for', 'eta1405', 'eta1475', 'eta1760', 'or', 'x1835', 'is', 'observed', 'in', 'the', 'twophoton', 'mass', 'spectra', 'and', 'upper', 'limits', 'at', 'the', '90', 'confidence', 'level', 'on', 'the', 'product', 'branching', 'fractions', 'are', 'obtained']] | [-0.06501311246036351, 0.26464602488376127, -0.08739890286918073, 0.16271454806316316, -0.02433459443843686, -0.08620925079209402, 0.12021761856215331, 0.31363796294831175, -0.11067335412799902, -0.2122005197749126, -0.07924794737482443, -0.4406977759710714, 0.06887170083263852, 0.152711586159307, 0.12845003029660268, 0.16842308352865717, 0.12458115503735219, 0.028829899520668036, 0.0021004661844641554, -0.1443584155948723, 0.24446708120533503, 0.01937793186801833, 0.17424677891255008, 0.11155678350569717, -0.030869898404560836, -0.03347875488757649, -0.049290931445783844, -0.13540596251978593, -0.15617568126203968, -0.010186087093589938, 0.2683587803131006, 0.12762058371513643, 0.07642340572441325, -0.2744533734702974, 0.014716683987381995, 0.19448217848206267, 0.18186881136623959, 0.019172384036709463, -0.015752102251794627, -0.4565863032989642, 0.14334646353096353, -0.1782292962421243, -0.00011975529110606979, -0.049120625531227854, 0.031619260233699105, -0.11058604371432654, -0.35606407842544074, 0.13215116506405905, -0.11812341750106391, 0.07183870650096294, -0.03255073364148391, -0.2845973287362094, -0.045784187338808006, -0.024535544365005314, 0.10891778914910723, 0.07349856588538672, 0.21630888078453056, -0.10702979362423659, -0.21585869874951302, 0.3887658797241017, -0.05597723881695785, -0.1345525933575118, 0.10866188265408352, -0.2958511853106685, -0.16450613893239813, 0.2581839156611001, 0.2509437841819782, 0.021074211590138135, -0.20003353239164925, 0.05083612355919482, -0.027120142175322947, 0.21671866238409399, 0.12257177910000525, 0.13329365235803575, 0.1571094529548039, 0.1875987344457969, -0.12686882143401923, 0.03522354984249664, -0.14108020794696594, -0.0005933648230982761, -0.368838575839832, -0.12884974409369568, -0.048272389626386115, 0.08277736942046414, -0.008018356372714135, -0.010172947419478613, 0.3239783761913286, -0.022994041488524162, 0.34883131463920664, 0.023801877994236408, 0.3233990532291286, 0.1671007825837781, 0.004723848363295581, 0.056668164062869564, 0.3672847110988097, 0.23654473529142492, 0.14309368710325776, -0.28758912631476014, 0.07814337769249345, -0.03612292807220536] |
1,802.09855 | Resonant states in double and triple quantum wells | The full set of resonant states in double and triple quantum well/barrier
structures is investigated. This includes bound, anti-bound and normal resonant
states which are all eigensolutions of Schrodinger's equation with generalized
outgoing wave boundary conditions. The transformation of resonant states and
their transitions between different subgroups as well as the role of each
subgroup in observables, such as the quantum transmission, is analyzed. The
quantum well potentials are modeled by Dirac delta functions; therefore, as
part of this study, the well-known problem of bound states in delta-like
potentials is also revisited.
| quant-ph | the full set of resonant states in double and triple quantum wellbarrier structures is investigated this includes bound antibound and normal resonant states which are all eigensolutions of schrodingers equation with generalized outgoing wave boundary conditions the transformation of resonant states and their transitions between different subgroups as well as the role of each subgroup in observables such as the quantum transmission is analyzed the quantum well potentials are modeled by dirac delta functions therefore as part of this study the wellknown problem of bound states in deltalike potentials is also revisited | [['the', 'full', 'set', 'of', 'resonant', 'states', 'in', 'double', 'and', 'triple', 'quantum', 'wellbarrier', 'structures', 'is', 'investigated', 'this', 'includes', 'bound', 'antibound', 'and', 'normal', 'resonant', 'states', 'which', 'are', 'all', 'eigensolutions', 'of', 'schrodingers', 'equation', 'with', 'generalized', 'outgoing', 'wave', 'boundary', 'conditions', 'the', 'transformation', 'of', 'resonant', 'states', 'and', 'their', 'transitions', 'between', 'different', 'subgroups', 'as', 'well', 'as', 'the', 'role', 'of', 'each', 'subgroup', 'in', 'observables', 'such', 'as', 'the', 'quantum', 'transmission', 'is', 'analyzed', 'the', 'quantum', 'well', 'potentials', 'are', 'modeled', 'by', 'dirac', 'delta', 'functions', 'therefore', 'as', 'part', 'of', 'this', 'study', 'the', 'wellknown', 'problem', 'of', 'bound', 'states', 'in', 'deltalike', 'potentials', 'is', 'also', 'revisited']] | [-0.16442164280654295, 0.1810565473076523, -0.04562027173359757, 0.09243117082160493, -0.004949857503600904, -0.15551313719428753, 0.02564890631828862, 0.31489110061817843, -0.27729472926939314, -0.2825377769768238, 0.04095109368537796, -0.3065032804809997, -0.1584050498659844, 0.1622031740894865, 0.03877362279403631, 0.11392025360027733, 0.04036025862897868, 0.06383632706559222, -0.06312502268954868, -0.1462999690607514, 0.3844967913287489, -0.0006284498984156096, 0.256503241108199, 0.07472647240122213, 0.030874135410514376, 0.038801500761663825, 0.059281094242697174, -0.0576145416530578, -0.10029180102688058, 0.02555761630672192, 0.25105447608106973, 0.06842861873725348, 0.20101032208185643, -0.4161168843629244, -0.19960163107506282, 0.07846145604170211, 0.155926790351615, 0.1083090833638815, -0.00880963565862697, -0.33353787490531156, 0.025032131224060835, -0.12833888850772104, -0.1978885146951222, -0.053220441959717354, 0.036981797508854906, 0.03128669390444765, -0.22284979324625886, 0.11232504162047047, 0.03302794857122733, 0.013224643179336968, -0.08318693654449738, -0.12698695481420777, -0.06942976411664858, 0.11471035196850805, -0.014628136497618549, -0.04129356660363872, 0.08693426994337326, -0.12089121875697342, -0.15310129382313512, 0.38953962115160917, -0.044354525617445295, -0.22416434291264284, 0.1516875565841632, -0.1395213956610583, -0.08881359376296726, 0.06793829841721478, 0.11219635526852115, 0.1383152505605603, -0.1492679502673285, 0.11993011936315072, -0.04424803928613192, 0.06527085548251584, 0.1199541224176874, 0.11565014967978325, 0.17022262808218921, 0.08704875367086219, 0.046995562815066914, 0.1738372070552862, -0.026853924741178915, -0.1216101686181703, -0.35837153813411965, -0.1518567048845833, -0.19340003691942673, 0.052403571540154466, -0.023109674012907224, -0.21830445661148784, 0.4119816926186499, -0.006766583841375034, 0.20147496369242182, -0.03987899377977516, 0.2506161898617511, 0.2051643043917505, 0.039146118202631405, 0.04280437116065751, 0.23335468570661286, 0.20123239147284513, 0.011545047239886353, -0.24530246423597893, -0.0032606164965292683, 0.0470911700622705] |
1,802.09856 | On (shape-)Wilf-equivalence for words | Stankova and West showed that for any non-negative integer $s$ and any
permutation $\gamma$ of $\{4,5,\dots,s+3\}$ there are as many permutations that
avoid $231\gamma$ as there are that avoid $312\gamma$. We extend this result to
the setting of words.
| math.CO | stankova and west showed that for any nonnegative integer s and any permutation gamma of 45dotss3 there are as many permutations that avoid 231gamma as there are that avoid 312gamma we extend this result to the setting of words | [['stankova', 'and', 'west', 'showed', 'that', 'for', 'any', 'nonnegative', 'integer', 's', 'and', 'any', 'permutation', 'gamma', 'of', '45dotss3', 'there', 'are', 'as', 'many', 'permutations', 'that', 'avoid', '231gamma', 'as', 'there', 'are', 'that', 'avoid', '312gamma', 'we', 'extend', 'this', 'result', 'to', 'the', 'setting', 'of', 'words']] | [-0.10530367530882359, 0.175099980432008, -0.04412855245172977, 0.06266044507002724, -0.07249754837581089, -0.17947134881147317, 0.06205876219485487, 0.3842634554420199, -0.27461116824831283, -0.2638719455122815, 0.1242043798656336, -0.29100937428218976, -0.18207697048783303, 0.20096851261498938, -0.12237252454672541, -0.005297249821679933, 0.0752624620284353, 0.057970947000597205, -0.02692721050365695, -0.2573772658726999, 0.3303208511854921, -0.06608581697302206, 0.12324473506637983, 0.05026438640696662, 0.07155013414365904, 0.01613644290981548, -0.04810818822256156, 0.0423524659126997, -0.09368266258035354, 0.030356827078919325, 0.34495251678994726, 0.2025917114423854, 0.27911208953176225, -0.37409293289695467, -0.22507294629301344, 0.2576805873773992, 0.1271565449291042, 0.06276905238628387, -0.06450471170246601, -0.19587196023868664, 0.2209374866847481, -0.14353805940066064, -0.10567355137318372, -0.0657814832670348, 0.09896536389631884, 0.032238494418561456, -0.2834230786122914, 0.004004721290298871, 0.16913900755878006, 0.020522011603627887, 0.04475489293358156, -0.18171798468434386, 0.007066025212407112, 0.128258712004338, 0.1144910399668983, 0.11084167399842824, 0.014438493616346802, -0.03451729762101812, -0.20070877373218537, 0.3773422581010631, 0.010859639091151101, -0.21094805129936764, 0.1695725211075374, -0.12919698783329556, -0.19712015903953994, 0.09064123215419906, 0.08185540937951633, 0.08100828531065157, -0.044387979113629884, 0.1182335900691604, -0.187536529983793, 0.1384500438613551, 0.2149117734549301, 0.006768007935690028, 0.1107335879866566, -0.0004608309295560632, 0.13399108861007594, 0.11448258092360837, -0.024434144901377814, 0.009105491784534283, -0.340958993775504, -0.17116595432162285, -0.179402099629598, 0.044392357553754536, -0.08837996812986343, -0.19155156670936516, 0.28952456914952823, 0.18314637294305222, 0.22748034217927074, 0.12397116548381745, 0.19156832950455802, 0.07696940318149115, 0.06641066633164883, 0.10576137163277183, 0.08234203102599297, 0.10270809323659964, -0.0029303492179938726, -0.16874748564192227, 0.09230611929669977, 0.045639276078769137] |
1,802.09857 | Simultaneous Orientational and Conformational Molecular Dynamics in
Solid (1,1,2)-Trichloroethane | The molecular dynamics in the ambient-pressure solid phase of
(1,1,2)-trichloroethane is studied by means of broadband dielectric
spectroscopy and molecular dynamics simulations. The dielectric spectra of
polycrystalline samples obtained by crystallization from the liquid phase
exhibit, besides a space-charge relaxation associated with accumulation of
charges at crystalline domain boundaries, two loss features arising from
dipolar molecular relaxations. The most prominent and slower of the two loss
features is identified as a configurational leap of the molecules which
involves a simultaneous change in spatial orientation and structural
conformation, namely between two isomeric forms (gauche$^+$ and gauche$^-$) of
opposite chirality. In this peculiar dynamic process, the positions of the
three chlorine atoms in the crystal lattice remain unchanged, while those of
the carbon and hydrogen atoms are modified. This dynamic process is responsible
for the disorder observed in an earlier x-ray diffraction study and confirmed
by our simulation, which is present only at temperatures relatively close to
the melting point, starting 40 K below. The onset of the disorder is visible as
an anomaly in the temperature dependence of the dc conductivity of the sample
at exactly the same temperature. While the slower relaxation dynamics (combined
isomerization/reorientation) becomes increasingly more intense on approaching
the melting point, the faster dynamics exhibits significantly lower but
constant dielectric strength. Based on our molecular dynamics simulations, we
assign the faster relaxation to large fluctuations of the molecular dipole
moments, partly due to large-angle librations of the chloroethane species.
| physics.chem-ph | the molecular dynamics in the ambientpressure solid phase of 112trichloroethane is studied by means of broadband dielectric spectroscopy and molecular dynamics simulations the dielectric spectra of polycrystalline samples obtained by crystallization from the liquid phase exhibit besides a spacecharge relaxation associated with accumulation of charges at crystalline domain boundaries two loss features arising from dipolar molecular relaxations the most prominent and slower of the two loss features is identified as a configurational leap of the molecules which involves a simultaneous change in spatial orientation and structural conformation namely between two isomeric forms gauche and gauche of opposite chirality in this peculiar dynamic process the positions of the three chlorine atoms in the crystal lattice remain unchanged while those of the carbon and hydrogen atoms are modified this dynamic process is responsible for the disorder observed in an earlier xray diffraction study and confirmed by our simulation which is present only at temperatures relatively close to the melting point starting 40 k below the onset of the disorder is visible as an anomaly in the temperature dependence of the dc conductivity of the sample at exactly the same temperature while the slower relaxation dynamics combined isomerizationreorientation becomes increasingly more intense on approaching the melting point the faster dynamics exhibits significantly lower but constant dielectric strength based on our molecular dynamics simulations we assign the faster relaxation to large fluctuations of the molecular dipole moments partly due to largeangle librations of the chloroethane species | [['the', 'molecular', 'dynamics', 'in', 'the', 'ambientpressure', 'solid', 'phase', 'of', '112trichloroethane', 'is', 'studied', 'by', 'means', 'of', 'broadband', 'dielectric', 'spectroscopy', 'and', 'molecular', 'dynamics', 'simulations', 'the', 'dielectric', 'spectra', 'of', 'polycrystalline', 'samples', 'obtained', 'by', 'crystallization', 'from', 'the', 'liquid', 'phase', 'exhibit', 'besides', 'a', 'spacecharge', 'relaxation', 'associated', 'with', 'accumulation', 'of', 'charges', 'at', 'crystalline', 'domain', 'boundaries', 'two', 'loss', 'features', 'arising', 'from', 'dipolar', 'molecular', 'relaxations', 'the', 'most', 'prominent', 'and', 'slower', 'of', 'the', 'two', 'loss', 'features', 'is', 'identified', 'as', 'a', 'configurational', 'leap', 'of', 'the', 'molecules', 'which', 'involves', 'a', 'simultaneous', 'change', 'in', 'spatial', 'orientation', 'and', 'structural', 'conformation', 'namely', 'between', 'two', 'isomeric', 'forms', 'gauche', 'and', 'gauche', 'of', 'opposite', 'chirality', 'in', 'this', 'peculiar', 'dynamic', 'process', 'the', 'positions', 'of', 'the', 'three', 'chlorine', 'atoms', 'in', 'the', 'crystal', 'lattice', 'remain', 'unchanged', 'while', 'those', 'of', 'the', 'carbon', 'and', 'hydrogen', 'atoms', 'are', 'modified', 'this', 'dynamic', 'process', 'is', 'responsible', 'for', 'the', 'disorder', 'observed', 'in', 'an', 'earlier', 'xray', 'diffraction', 'study', 'and', 'confirmed', 'by', 'our', 'simulation', 'which', 'is', 'present', 'only', 'at', 'temperatures', 'relatively', 'close', 'to', 'the', 'melting', 'point', 'starting', '40', 'k', 'below', 'the', 'onset', 'of', 'the', 'disorder', 'is', 'visible', 'as', 'an', 'anomaly', 'in', 'the', 'temperature', 'dependence', 'of', 'the', 'dc', 'conductivity', 'of', 'the', 'sample', 'at', 'exactly', 'the', 'same', 'temperature', 'while', 'the', 'slower', 'relaxation', 'dynamics', 'combined', 'isomerizationreorientation', 'becomes', 'increasingly', 'more', 'intense', 'on', 'approaching', 'the', 'melting', 'point', 'the', 'faster', 'dynamics', 'exhibits', 'significantly', 'lower', 'but', 'constant', 'dielectric', 'strength', 'based', 'on', 'our', 'molecular', 'dynamics', 'simulations', 'we', 'assign', 'the', 'faster', 'relaxation', 'to', 'large', 'fluctuations', 'of', 'the', 'molecular', 'dipole', 'moments', 'partly', 'due', 'to', 'largeangle', 'librations', 'of', 'the', 'chloroethane', 'species']] | [-0.11895271921815316, 0.19520783259362376, -0.06602249886995477, 0.008743265568779584, 0.012326770427025013, -0.10290022059022273, 0.06530628820674719, 0.4002020398318518, -0.2680230477584183, -0.2822918080565009, 0.04624690026216303, -0.29870569334213454, -0.09124340999201253, 0.14097451953661616, 0.0610373595994449, 0.002907950177576362, -0.011160073266072377, -0.01200516066327886, -0.07279299245319217, -0.1784686530515489, 0.2553192913263381, 0.08095919294087957, 0.29265178072511777, 0.07358852024170644, 0.061183311610198174, -0.023420253275624754, 0.04579482821135871, 0.007567201495544681, -0.12416337637589255, 0.07759591180657789, 0.20805878799299565, -0.031285166119373396, 0.20910952815306338, -0.46069714808860324, -0.22562925633779535, 0.029502721006541697, 0.12919566696451268, 0.13529064514956518, -0.04659090838320777, -0.23781719283204697, 0.019796376270495325, -0.07367936255425901, -0.14790241728258166, -0.04954628215783186, 0.012782424629888026, 0.019148707915283544, -0.20791797982879512, 0.13431917242126182, 0.0583413373229579, 0.1170705698340913, -0.09779131655370871, -0.1503911737951004, -0.06753322489902565, 0.07858619184591749, 0.0569769305166804, 0.03191803479625621, 0.208708628564469, -0.13633698710677833, -0.08317396910198688, 0.4043037521411279, -0.06421317258473704, -0.08221338575542222, 0.22781088188432827, -0.20038608003190472, -0.1036234489753141, 0.2584523099219372, 0.10983004659841959, 0.12324824760069829, -0.14912590589841915, 0.013816534985289383, 0.017478692869433675, 0.18656620416896433, 0.09044825335648923, 0.03474110595309117, 0.23519318021257177, 0.18825919491727933, 0.021266697535766717, 0.1732693284771417, -0.1358892877956864, -0.12227271829983102, -0.21220272734944384, -0.1300469751929607, -0.21266901997798687, 0.04015782477809545, -0.09717866007706723, -0.16147568291364917, 0.3640987780756146, 0.10399287643223304, 0.20279405043152585, -0.007553677259706678, 0.27362723013719303, 0.06976700969752524, 0.07000321935118024, 0.028156795392833868, 0.25387498821135784, 0.15197034065112877, 0.11270735022479426, -0.32454418718169936, 0.11523565872393111, 0.008774686461045683] |
1,802.09858 | A Short and Unified Proof of Kummer's Test | Kummer's test from 1835 states that the positive series $\sum_{n=1}^\infty
a_n$ is convergent if and only if there is a sequence $\{ B_n\}_1^\infty$ of
positive numbers such that
$B_n\cdot \frac{a_n }{a_{n+1}} -B_{n+1}\geq 1 ,$ for all sufficiently large
$n$. We present an exact analysis and a short and unified proof of Kummer's
test. The test has been applied to differential equations and studied in
mathematical philosophy.
| math.HO math.CA | kummers test from 1835 states that the positive series sum_n1infty a_n is convergent if and only if there is a sequence b_n_1infty of positive numbers such that b_ncdot fraca_n a_n1 b_n1geq 1 for all sufficiently large n we present an exact analysis and a short and unified proof of kummers test the test has been applied to differential equations and studied in mathematical philosophy | [['kummers', 'test', 'from', '1835', 'states', 'that', 'the', 'positive', 'series', 'sum_n1infty', 'a_n', 'is', 'convergent', 'if', 'and', 'only', 'if', 'there', 'is', 'a', 'sequence', 'b_n_1infty', 'of', 'positive', 'numbers', 'such', 'that', 'b_ncdot', 'fraca_n', 'a_n1', 'b_n1geq', '1', 'for', 'all', 'sufficiently', 'large', 'n', 'we', 'present', 'an', 'exact', 'analysis', 'and', 'a', 'short', 'and', 'unified', 'proof', 'of', 'kummers', 'test', 'the', 'test', 'has', 'been', 'applied', 'to', 'differential', 'equations', 'and', 'studied', 'in', 'mathematical', 'philosophy']] | [-0.13494930202141403, 0.06891256908638752, -0.12618247615173458, 0.09722196014675623, -0.05625896794566264, -0.181391700465853, -0.03151804161461769, 0.3002477057278156, -0.24266984385127824, -0.23211182247226436, 0.12336383095437971, -0.2859581136377528, -0.143535494870351, 0.22532774172723294, -0.03859891653216133, 0.049796168888375784, 0.06477735105436296, 0.05455308382709821, -0.039920709833192326, -0.2764104317873716, 0.29487727967789396, -0.06747499839402735, 0.22204287660618624, 0.027106676002343497, 0.16320350559738775, -0.014583271780672173, -0.009568280191160738, 0.010267939309900005, -0.15062044508255593, 0.04416092470734535, 0.2799702984280884, 0.16739884660443446, 0.3297689250980814, -0.4037754189843933, -0.08075136092181007, 0.1156051974898825, 0.18830986909257869, 0.043439716946644086, -0.10600384006587167, -0.22333577681177605, 0.17030781145828466, -0.17180499413322348, -0.12577849122074744, -0.10525656674678127, 0.1452289861937364, 0.06511525522607069, -0.31455327722554405, 0.06617862586863339, 0.09690135467487077, 0.10159258418716491, -0.01452253923440973, -0.15759616770471135, 0.030167261604219675, 0.12531937890065212, 0.08042888803950822, 0.03417572967785721, -0.01576981444377452, -0.06632261058936516, -0.08781394008547068, 0.3321092669386417, -0.07504555798756579, -0.20270273030425112, 0.16013647153352698, -0.1950963018151621, -0.2012085054613029, 0.09598231433580319, 0.09660362888438007, 0.18766370272884766, -0.10147895105183125, 0.12589770500781014, -0.10277006343627969, 0.18784145779597264, 0.10852341293357312, -0.07935759923420846, 0.1496272720086078, 0.10024461761737863, 0.010910877926896016, 0.08644664927075306, -0.030318952755381663, -0.05486399195312212, -0.36492875634382166, -0.18734885245212354, -0.21354331734473816, 0.14892640714727653, -0.076130553597856, -0.1803746518213302, 0.3578561898243303, 0.08413776167047521, 0.1611848315068831, 0.1064065697680538, 0.20499502581854662, 0.13237134704055886, 0.03150079012072335, 0.042476772253091134, 0.12237589411282292, 0.1724685258232057, 0.04902034650246302, -0.14308814568212255, 0.012100497830154685, 0.09973664828576148] |
1,802.09859 | The Tutte polynomial via lattice point counting | We recover the Tutte polynomial of a matroid, up to change of coordinates,
from an Ehrhart-style polynomial counting lattice points in the Minkowski sum
of its base polytope and scalings of simplices. Our polynomial has coefficients
of alternating sign with a combinatorial interpretation closely tied to the
Dawson partition. Our definition extends in a straightforward way to
polymatroids, and in this setting our polynomial has K\'alm\'an's internal and
external activity polynomials as its univariate specialisations.
| math.CO | we recover the tutte polynomial of a matroid up to change of coordinates from an ehrhartstyle polynomial counting lattice points in the minkowski sum of its base polytope and scalings of simplices our polynomial has coefficients of alternating sign with a combinatorial interpretation closely tied to the dawson partition our definition extends in a straightforward way to polymatroids and in this setting our polynomial has kalmans internal and external activity polynomials as its univariate specialisations | [['we', 'recover', 'the', 'tutte', 'polynomial', 'of', 'a', 'matroid', 'up', 'to', 'change', 'of', 'coordinates', 'from', 'an', 'ehrhartstyle', 'polynomial', 'counting', 'lattice', 'points', 'in', 'the', 'minkowski', 'sum', 'of', 'its', 'base', 'polytope', 'and', 'scalings', 'of', 'simplices', 'our', 'polynomial', 'has', 'coefficients', 'of', 'alternating', 'sign', 'with', 'a', 'combinatorial', 'interpretation', 'closely', 'tied', 'to', 'the', 'dawson', 'partition', 'our', 'definition', 'extends', 'in', 'a', 'straightforward', 'way', 'to', 'polymatroids', 'and', 'in', 'this', 'setting', 'our', 'polynomial', 'has', 'kalmans', 'internal', 'and', 'external', 'activity', 'polynomials', 'as', 'its', 'univariate', 'specialisations']] | [-0.13899670223504104, 0.017851983195656874, -0.11959365781886673, 0.01132060747713203, -0.15709471211743517, -0.08520725052929609, 0.059003425082443536, 0.31344513286760933, -0.3843490144590268, -0.24865687692638588, 0.06512699335399776, -0.22395157089104523, -0.1879562472521856, 0.1444777611303269, -0.13607847281555469, 0.04278558338960834, -0.00060645752976573, 0.04859601426869631, -0.11063771796358884, -0.3447319233941065, 0.26050905417021664, 0.04367130734907413, 0.1899928122544913, 0.03592498260676055, 0.12928010332649825, 0.02174543942217841, -0.057221123105468785, 0.01335368086772694, -0.11366723278361196, 0.127668071311672, 0.2869777287658606, 0.12750545459346393, 0.17153787608510135, -0.3770453293770048, -0.10156400265751055, 0.16585014682464502, 0.1567931491000628, 0.03481939878012683, 0.046667068240207596, -0.1980643864670718, 0.044310697769695845, -0.1595495978773043, -0.18209301529615815, -0.06649174278828542, 0.04309208529711877, 0.04019078257418162, -0.30205485027132406, 0.021211901520743866, 0.09506530318459547, 0.1284398442587337, -0.004330695978038617, -0.1470692977136177, 0.008391362674710518, 0.05004290549864841, 0.01170094425922159, 0.12261264243893125, 0.08315358555724693, -0.09824695978691247, -0.20956459654042045, 0.3958813557338372, -0.0003766036290373351, -0.27719944554406245, 0.15558521004041304, -0.17720541720454758, -0.17250557682426595, 0.12226167717646505, 0.0992540996710493, 0.126940019114094, -0.06546760313967998, 0.13389379598870496, -0.18138799953551307, 0.07412125944235437, 0.15369488891667207, -0.012996124493813998, 0.16102775110787637, 0.0368129152087243, 0.10254602342831425, 0.23180851868882374, 0.04396683112340602, -0.1129695173931887, -0.2880657991344059, -0.14655707082459452, -0.22715947458621216, 0.07161903034618779, -0.20347539474499393, -0.20461103673772635, 0.4233826354989228, 0.08404764716161063, 0.20832989219500608, 0.14593756614202583, 0.2468506027315114, 0.10461231680725373, 0.06336705976895787, 0.043830474184171575, 0.12483479858162133, 0.20893708607685324, 0.06705833624142248, -0.18655985373235937, 0.0789547866852199, 0.19025381257430324] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.