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.0666 | Linear Equations with Ordered Data | Following a recently considered generalization of linear equations to
unordered data vectors, we perform a further generalization to ordered data
vectors. These generalized equations naturally appear in the analysis of vector
addition systems (or Petri nets) extended with ordered data. We show that
nonnegative-integer solvability of linear equations is computationally
equivalent (up to an exponential blowup) with the reachability problem for
(plain) vector addition systems. This high complexity is surprising, and
contrasts with NP-completeness for unordered data vectors. Also surprisingly,
we achieve polynomial time complexity of the solvability problem when the
nonnegative-integer restriction on solutions is dropped.
| cs.LO | following a recently considered generalization of linear equations to unordered data vectors we perform a further generalization to ordered data vectors these generalized equations naturally appear in the analysis of vector addition systems or petri nets extended with ordered data we show that nonnegativeinteger solvability of linear equations is computationally equivalent up to an exponential blowup with the reachability problem for plain vector addition systems this high complexity is surprising and contrasts with npcompleteness for unordered data vectors also surprisingly we achieve polynomial time complexity of the solvability problem when the nonnegativeinteger restriction on solutions is dropped | [['following', 'a', 'recently', 'considered', 'generalization', 'of', 'linear', 'equations', 'to', 'unordered', 'data', 'vectors', 'we', 'perform', 'a', 'further', 'generalization', 'to', 'ordered', 'data', 'vectors', 'these', 'generalized', 'equations', 'naturally', 'appear', 'in', 'the', 'analysis', 'of', 'vector', 'addition', 'systems', 'or', 'petri', 'nets', 'extended', 'with', 'ordered', 'data', 'we', 'show', 'that', 'nonnegativeinteger', 'solvability', 'of', 'linear', 'equations', 'is', 'computationally', 'equivalent', 'up', 'to', 'an', 'exponential', 'blowup', 'with', 'the', 'reachability', 'problem', 'for', 'plain', 'vector', 'addition', 'systems', 'this', 'high', 'complexity', 'is', 'surprising', 'and', 'contrasts', 'with', 'npcompleteness', 'for', 'unordered', 'data', 'vectors', 'also', 'surprisingly', 'we', 'achieve', 'polynomial', 'time', 'complexity', 'of', 'the', 'solvability', 'problem', 'when', 'the', 'nonnegativeinteger', 'restriction', 'on', 'solutions', 'is', 'dropped']] | [-0.1399314888998082, 0.06006248282210436, -0.040525369885328566, 0.10615738419031626, -0.12529339399188757, -0.14353484963005606, 0.051073752029945976, 0.3177809283063796, -0.3501679679280833, -0.254547240369414, 0.1276598064216638, -0.2954097733391743, -0.1503862862646776, 0.1617732223981109, -0.09703308250264901, 0.1247076530107542, 0.10617614147302351, 0.04535959421804077, -0.11450312408912731, -0.32655419977871997, 0.3228354396886731, -0.013600406762653668, 0.27407885412440486, -0.02551813056496413, 0.1335142832445471, 0.014597666890997636, 0.023449636941873714, 0.06791562345369082, -0.10017196204257504, 0.1117239822462005, 0.3231857972611722, 0.15162979880053745, 0.22541762140616284, -0.42068974695315486, -0.15731737428393802, 0.1508681488272391, 0.1544164947185077, 0.12030004209985859, 0.0005885765924559612, -0.26068209280308924, 0.13706340177082701, -0.10602802820503712, -0.12051111768539015, -0.106756697310821, 0.04121557331006778, 0.024241179021957673, -0.2998172151414972, 0.06478038690708529, 0.14528100615073192, 0.07239878415528342, -0.1164791856549288, -0.0837559091906051, 0.013109025971865968, 0.00864619478540446, 0.027788483493618274, 0.037544431408107475, -0.020880444176299008, -0.09582537204566363, -0.17578434038319085, 0.3653273971261162, -0.0640205175811915, -0.28272554344056466, 0.18352844920009376, -0.06951575277275161, -0.17157395285505214, 0.13668472737098405, 0.1925248464299856, 0.12265576924638528, -0.10192202507888923, 0.10842085831590291, -0.12049571958027389, 0.17349182400656374, 0.08405589925027207, 0.02706941838229173, 0.10253728164948131, 0.16346689105082893, 0.11554471679816121, 0.19762169250630235, 0.013210320676137742, -0.11862450426346377, -0.2622023902441326, -0.13287977881018856, -0.12954786665933696, 0.03087546020182536, -0.1228377367074197, -0.18201285459983504, 0.32720286399126053, 0.15881775272519966, 0.2040202527257957, 0.15099408515287857, 0.27410590521697153, 0.1687249339528774, 0.05235559056071858, 0.08439058311870261, 0.13652383863288714, 0.15451841412248446, 0.11699306467842115, -0.15776192830679447, 0.055291294006900374, 0.09582098490852667] |
1,802.06661 | On the Abel-Jacobi map of an elliptic surface and the topology of
cubic-line arrangements | Let $S$ be an elliptic surface over a smooth curve $C$ with a section $O$. We
denote its generic fiber by $E_S$. For a divisor $D$ on $S$, we canonically
associate a $C(C)$-rational point $P_D$. In this note, we give a description of
$P_D$ of $E_S$, when the rank of the group of $C(C)$-rational points is one. We
apply our description to refine our result on a Zariski pair for a cubic-line
arrangement.
| math.AG math.GT | let s be an elliptic surface over a smooth curve c with a section o we denote its generic fiber by e_s for a divisor d on s we canonically associate a ccrational point p_d in this note we give a description of p_d of e_s when the rank of the group of ccrational points is one we apply our description to refine our result on a zariski pair for a cubicline arrangement | [['let', 's', 'be', 'an', 'elliptic', 'surface', 'over', 'a', 'smooth', 'curve', 'c', 'with', 'a', 'section', 'o', 'we', 'denote', 'its', 'generic', 'fiber', 'by', 'e_s', 'for', 'a', 'divisor', 'd', 'on', 's', 'we', 'canonically', 'associate', 'a', 'ccrational', 'point', 'p_d', 'in', 'this', 'note', 'we', 'give', 'a', 'description', 'of', 'p_d', 'of', 'e_s', 'when', 'the', 'rank', 'of', 'the', 'group', 'of', 'ccrational', 'points', 'is', 'one', 'we', 'apply', 'our', 'description', 'to', 'refine', 'our', 'result', 'on', 'a', 'zariski', 'pair', 'for', 'a', 'cubicline', 'arrangement']] | [-0.20457653558946082, 0.04247196584994006, -0.15468440337904862, -0.03196952798004661, -0.037660481005774016, -0.13937405356305785, 0.0722664666628199, 0.3344853533831026, -0.2868840589188039, -0.16516345933778212, 0.03548572508318882, -0.29447810268029573, -0.106060294407819, 0.21475183342450432, -0.12613473042313542, -0.089318065239682, 0.057706847760294167, 0.1307541978811579, -0.09209863437073572, -0.2694664534979633, 0.37014875579292755, -0.06116186207426446, 0.14254957447161098, 0.060695915230150735, 0.08461927085050515, 0.048632171138056686, 0.03726589425600001, 0.0006574469485453197, -0.19098858080272163, 0.1746954070537218, 0.2786543559216495, 0.1017772055763219, 0.18475023915192912, -0.3270681472229106, -0.15021694324511503, 0.1949837532892291, 0.09529952089568335, 0.030238399039288717, 0.021218506137042174, -0.20824394868686796, 0.16723320317188545, -0.16641386345561063, -0.21567963636480272, -0.03933552504583661, 0.1132662215619348, -0.0002920784062423211, -0.28143046938681177, -0.054372645196105754, 0.09352527103785957, 0.1254430011446987, -0.016186912578996272, -0.08487797268400235, -0.055578454124874305, -0.01675996562324664, -0.03979850579385779, 0.1481711733055168, 0.05029834460999284, -0.06857693771099937, -0.0635599021134632, 0.38235359362193516, -0.09817574533101703, -0.21533997359552554, 0.10630835458370191, -0.14617066346774144, -0.08229389623073595, 0.15769844274701816, 0.15818344419822097, 0.17999052390431253, -0.023701041927935356, 0.17285984231691276, -0.12842511360400488, 0.13969356361984475, 0.061372361438614985, -0.057813042322439806, 0.17362583679246849, 0.1323936497958909, 0.102658373623022, 0.11726813413302548, -0.07027311774103769, 0.03167043096119804, -0.4280188552503075, -0.22929254651867917, -0.1622772073449921, 0.16338240157014558, -0.09140062446572951, -0.15245723971830946, 0.43060767384512083, 0.039393187899674685, 0.3276101983019284, 0.07268537298909256, 0.20538717032011067, 0.08041168897346194, -0.015960818786905813, 0.08577131375537388, 0.10312844063820584, 0.16503151063474694, -0.04195401882919084, -0.18072065086702682, -0.013220360861825091, 0.17523088291553515] |
1,802.06662 | Bogoliubov excitation spectrum for Bose-Einstein condensates | We consider interacting Bose gases trapped in a box $\Lambda = [0;1]^3$ in
the Gross-Pitaevskii limit. Assuming the potential to be weak enough, we
establish the validity of Bogoliubov's prediction for the ground state energy
and the low-energy excitation spectrum. These notes are based on \cite{BBCS3},
a joint work with C. Boccato, C. Brennecke and S. Cenatiempo.
| math-ph math.MP | we consider interacting bose gases trapped in a box lambda 013 in the grosspitaevskii limit assuming the potential to be weak enough we establish the validity of bogoliubovs prediction for the ground state energy and the lowenergy excitation spectrum these notes are based on citebbcs3 a joint work with c boccato c brennecke and s cenatiempo | [['we', 'consider', 'interacting', 'bose', 'gases', 'trapped', 'in', 'a', 'box', 'lambda', '013', 'in', 'the', 'grosspitaevskii', 'limit', 'assuming', 'the', 'potential', 'to', 'be', 'weak', 'enough', 'we', 'establish', 'the', 'validity', 'of', 'bogoliubovs', 'prediction', 'for', 'the', 'ground', 'state', 'energy', 'and', 'the', 'lowenergy', 'excitation', 'spectrum', 'these', 'notes', 'are', 'based', 'on', 'citebbcs3', 'a', 'joint', 'work', 'with', 'c', 'boccato', 'c', 'brennecke', 'and', 's', 'cenatiempo']] | [-0.135229048761108, 0.13203583447331632, -0.05164839229460254, 0.061950935878687434, 0.019697761128622072, -0.18137531937962328, 0.07411012576065129, 0.31808129889476633, -0.18225806703170142, -0.248847552937352, 0.044544916871624686, -0.301341128639049, -0.007259438952638043, 0.13770837286763168, 0.0359009722553849, 0.06400551621940125, 0.051202368366325066, 0.04143816546571476, -0.03269564939007439, -0.19645435836045416, 0.32909786796706075, 0.03698460145474032, 0.2619384401995275, 0.1054903625228218, 0.041349411804091046, 0.01932752597645891, 0.07476798810616687, -0.023534751083287928, -0.20764376830171655, 0.117375012608978, 0.22125509477875852, 0.029751957558026468, 0.22732671301949908, -0.41968842899357833, -0.18162114343269625, 0.10987010476593342, 0.13781812543014962, 0.13737100341219316, -0.0107975279477412, -0.3372339566272718, 0.012897448325357228, -0.18739089166262635, -0.1682027372277204, -0.09599826002441761, 0.03259693708753696, 0.051128068949630553, -0.2759777836380871, 0.10138574383583748, 0.060749064729962915, 0.06635787253509517, -0.0982510376876841, -0.0785345733769376, 0.007221194665396103, 0.033942703209403485, -0.01126029697910848, 0.035249065737136535, 0.0844083222888272, -0.13467456467656624, -0.03557981346319947, 0.3863822761233206, -0.1781044007382459, -0.16747862098876526, 0.203353954362683, -0.16163486444943206, -0.10631608051739426, 0.10192889325251733, 0.126956659538943, 0.09432393071000222, -0.11413756462193474, 0.16589012471053544, -0.055597682898762824, 0.1768954895971412, 0.042108320243035756, 0.038005619309842587, 0.25081340597804497, 0.13846134628962586, -0.005676037442215063, 0.10235021880254391, -0.12260874750144365, -0.09026145904014508, -0.3234052879528867, -0.14483501889777403, -0.2042531559795693, 0.07658765928957749, 0.0014076468936831657, -0.12035362705312393, 0.3441937017142428, 0.1501456265234285, 0.202845080755651, 0.04890607481529177, 0.2113119221132904, 0.15584587935289299, -0.04787935765408394, 0.0760930763467008, 0.25468545139732734, 0.14614105685958984, 0.06385001054689012, -0.22692849052449068, -0.06356309936381876, 0.0857370468546395] |
1,802.06663 | Precise Ages of Field Stars from White Dwarf Companions | Observational tests of stellar and Galactic chemical evolution call for the
joint knowledge of a star's physical parameters, detailed element abundances,
and precise age. For cool main-sequence (MS) stars the abundances of many
elements can be measured from spectroscopy, but ages are very hard to
determine. The situation is different if the MS star has a white dwarf (WD)
companion and a known distance, as the age of such a binary system can then be
determined precisely from the photometric properties of the cooling WD. As a
pilot study for obtaining precise age determinations of field MS stars, we
identify nearly one hundred candidates for such wide binary systems: a faint WD
whose GPS1 proper motion matches that of a brighter MS star in Gaia/TGAS with a
good parallax ($\sigma_\varpi/\varpi\le 0.05$). We model the WD's multi-band
photometry with the BASE-9 code using this precise distance (assumed to be
common for the pair) and infer ages for each binary system. The resulting age
estimates are precise to $\le 10\%$ ($\le 20\%$) for $42$ ($67$) MS-WD systems.
Our analysis more than doubles the number of MS-WD systems with precise
distances known to date, and it boosts the number of such systems with precise
age determination by an order of magnitude. With the advent of the Gaia DR2
data, this approach will be applicable to a far larger sample, providing ages
for many MS stars (that can yield detailed abundances for over 20 elements),
especially in the age range 2 to 8\,\Gyr, where there are only few known star
clusters.
| astro-ph.SR | observational tests of stellar and galactic chemical evolution call for the joint knowledge of a stars physical parameters detailed element abundances and precise age for cool mainsequence ms stars the abundances of many elements can be measured from spectroscopy but ages are very hard to determine the situation is different if the ms star has a white dwarf wd companion and a known distance as the age of such a binary system can then be determined precisely from the photometric properties of the cooling wd as a pilot study for obtaining precise age determinations of field ms stars we identify nearly one hundred candidates for such wide binary systems a faint wd whose gps1 proper motion matches that of a brighter ms star in gaiatgas with a good parallax sigma_varpivarpile 005 we model the wds multiband photometry with the base9 code using this precise distance assumed to be common for the pair and infer ages for each binary system the resulting age estimates are precise to le 10 le 20 for 42 67 mswd systems our analysis more than doubles the number of mswd systems with precise distances known to date and it boosts the number of such systems with precise age determination by an order of magnitude with the advent of the gaia dr2 data this approach will be applicable to a far larger sample providing ages for many ms stars that can yield detailed abundances for over 20 elements especially in the age range 2 to 8gyr where there are only few known star clusters | [['observational', 'tests', 'of', 'stellar', 'and', 'galactic', 'chemical', 'evolution', 'call', 'for', 'the', 'joint', 'knowledge', 'of', 'a', 'stars', 'physical', 'parameters', 'detailed', 'element', 'abundances', 'and', 'precise', 'age', 'for', 'cool', 'mainsequence', 'ms', 'stars', 'the', 'abundances', 'of', 'many', 'elements', 'can', 'be', 'measured', 'from', 'spectroscopy', 'but', 'ages', 'are', 'very', 'hard', 'to', 'determine', 'the', 'situation', 'is', 'different', 'if', 'the', 'ms', 'star', 'has', 'a', 'white', 'dwarf', 'wd', 'companion', 'and', 'a', 'known', 'distance', 'as', 'the', 'age', 'of', 'such', 'a', 'binary', 'system', 'can', 'then', 'be', 'determined', 'precisely', 'from', 'the', 'photometric', 'properties', 'of', 'the', 'cooling', 'wd', 'as', 'a', 'pilot', 'study', 'for', 'obtaining', 'precise', 'age', 'determinations', 'of', 'field', 'ms', 'stars', 'we', 'identify', 'nearly', 'one', 'hundred', 'candidates', 'for', 'such', 'wide', 'binary', 'systems', 'a', 'faint', 'wd', 'whose', 'gps1', 'proper', 'motion', 'matches', 'that', 'of', 'a', 'brighter', 'ms', 'star', 'in', 'gaiatgas', 'with', 'a', 'good', 'parallax', 'sigma_varpivarpile', '005', 'we', 'model', 'the', 'wds', 'multiband', 'photometry', 'with', 'the', 'base9', 'code', 'using', 'this', 'precise', 'distance', 'assumed', 'to', 'be', 'common', 'for', 'the', 'pair', 'and', 'infer', 'ages', 'for', 'each', 'binary', 'system', 'the', 'resulting', 'age', 'estimates', 'are', 'precise', 'to', 'le', '10', 'le', '20', 'for', '42', '67', 'mswd', 'systems', 'our', 'analysis', 'more', 'than', 'doubles', 'the', 'number', 'of', 'mswd', 'systems', 'with', 'precise', 'distances', 'known', 'to', 'date', 'and', 'it', 'boosts', 'the', 'number', 'of', 'such', 'systems', 'with', 'precise', 'age', 'determination', 'by', 'an', 'order', 'of', 'magnitude', 'with', 'the', 'advent', 'of', 'the', 'gaia', 'dr2', 'data', 'this', 'approach', 'will', 'be', 'applicable', 'to', 'a', 'far', 'larger', 'sample', 'providing', 'ages', 'for', 'many', 'ms', 'stars', 'that', 'can', 'yield', 'detailed', 'abundances', 'for', 'over', '20', 'elements', 'especially', 'in', 'the', 'age', 'range', '2', 'to', '8gyr', 'where', 'there', 'are', 'only', 'few', 'known', 'star', 'clusters']] | [-0.04872803294665573, 0.13401231814947323, -0.06350938776904513, 0.08095781431575233, -0.11709398422590311, -0.08548083037067045, 0.09285498385588653, 0.3918438452601549, -0.19602133189255255, -0.3966421799013915, 0.08373336826207378, -0.29158919011752005, 0.014475459091045195, 0.2701084178979727, -0.08171020536246942, -0.002951167423816514, 0.1648378503650747, 0.03658242194546801, -0.08575521864077018, -0.27741443149761835, 0.27449395115218067, 0.023314929318416944, 0.11243672291152507, -0.07335960702584998, 0.04854155608381916, -0.06899267719745694, -0.055740164607414044, -0.02725305019703228, -0.16818239906416466, 0.04609436701798586, 0.25082823309207924, 0.15483830322375525, 0.20633308927608596, -0.3007465631015691, -0.2176157223948394, 0.07125634162230199, 0.1903991477611271, 0.0713064138751065, -0.07051812598666629, -0.24719086948744007, 0.13142223423710675, -0.20004399828030728, -0.1654063103316048, 0.019763340109420824, 0.08958430930897521, 0.04403771864508599, -0.2683903918186843, 0.09911529981764033, 0.00335580783757905, 0.12948542926096707, -0.10141771727421656, -0.16848721841324732, -0.014567848266779038, 0.15827155420356576, -0.016939177351105172, 0.07939010152449555, 0.10440692191696144, -0.09346421626105439, 0.000314164908559178, 0.4139283363385857, -0.07094451365361465, -0.042749566631627545, 0.23263621891965158, -0.15999043319243356, -0.15072863553905336, 0.09904612756872666, 0.14431457759565092, 0.16651126648503123, -0.22612581231260265, -0.03543947303319328, 0.018269178119226126, 0.2382089687307598, 0.046270696957435575, 0.07564934190577333, 0.28576943130246946, 0.15455382717891553, 0.046481378849648536, 0.009294869066707179, -0.19946987380899373, -0.053284531972167315, -0.20019786308330367, -0.126905371370583, -0.1223889774591953, 0.09933618465083782, -0.1536755830576908, -0.13682791937026195, 0.3430702342800487, 0.13363632403343217, 0.19326502917192556, 0.055366718760524236, 0.28590052200161153, 0.06967973415021333, 0.11985111470130505, 0.0887211660592584, 0.2791912122302165, 0.20187650957723235, 0.05011538984172148, -0.19439721224807727, 0.09837070720459451, -0.010692028753055638] |
1,802.06664 | Multi-task, multi-label and multi-domain learning with residual
convolutional networks for emotion recognition | Automated emotion recognition in the wild from facial images remains a
challenging problem. Although recent advances in Deep Learning have supposed a
significant breakthrough in this topic, strong changes in pose, orientation and
point of view severely harm current approaches. In addition, the acquisition of
labeled datasets is costly, and current state-of-the-art deep learning
algorithms cannot model all the aforementioned difficulties. In this paper, we
propose to apply a multi-task learning loss function to share a common feature
representation with other related tasks. Particularly we show that emotion
recognition benefits from jointly learning a model with a detector of facial
Action Units (collective muscle movements). The proposed loss function
addresses the problem of learning multiple tasks with heterogeneously labeled
data, improving previous multi-task approaches. We validate the proposal using
two datasets acquired in non controlled environments, and an application to
predict compound facial emotion expressions.
| cs.CV | automated emotion recognition in the wild from facial images remains a challenging problem although recent advances in deep learning have supposed a significant breakthrough in this topic strong changes in pose orientation and point of view severely harm current approaches in addition the acquisition of labeled datasets is costly and current stateoftheart deep learning algorithms cannot model all the aforementioned difficulties in this paper we propose to apply a multitask learning loss function to share a common feature representation with other related tasks particularly we show that emotion recognition benefits from jointly learning a model with a detector of facial action units collective muscle movements the proposed loss function addresses the problem of learning multiple tasks with heterogeneously labeled data improving previous multitask approaches we validate the proposal using two datasets acquired in non controlled environments and an application to predict compound facial emotion expressions | [['automated', 'emotion', 'recognition', 'in', 'the', 'wild', 'from', 'facial', 'images', 'remains', 'a', 'challenging', 'problem', 'although', 'recent', 'advances', 'in', 'deep', 'learning', 'have', 'supposed', 'a', 'significant', 'breakthrough', 'in', 'this', 'topic', 'strong', 'changes', 'in', 'pose', 'orientation', 'and', 'point', 'of', 'view', 'severely', 'harm', 'current', 'approaches', 'in', 'addition', 'the', 'acquisition', 'of', 'labeled', 'datasets', 'is', 'costly', 'and', 'current', 'stateoftheart', 'deep', 'learning', 'algorithms', 'can', 'not', 'model', 'all', 'the', 'aforementioned', 'difficulties', 'in', 'this', 'paper', 'we', 'propose', 'to', 'apply', 'a', 'multitask', 'learning', 'loss', 'function', 'to', 'share', 'a', 'common', 'feature', 'representation', 'with', 'other', 'related', 'tasks', 'particularly', 'we', 'show', 'that', 'emotion', 'recognition', 'benefits', 'from', 'jointly', 'learning', 'a', 'model', 'with', 'a', 'detector', 'of', 'facial', 'action', 'units', 'collective', 'muscle', 'movements', 'the', 'proposed', 'loss', 'function', 'addresses', 'the', 'problem', 'of', 'learning', 'multiple', 'tasks', 'with', 'heterogeneously', 'labeled', 'data', 'improving', 'previous', 'multitask', 'approaches', 'we', 'validate', 'the', 'proposal', 'using', 'two', 'datasets', 'acquired', 'in', 'non', 'controlled', 'environments', 'and', 'an', 'application', 'to', 'predict', 'compound', 'facial', 'emotion', 'expressions']] | [-0.042072404332280364, -0.022458770858464372, -0.038725147014228654, 0.02818421451996833, -0.11012971239508934, -0.18783441162668169, 0.01855983020823883, 0.46803958831380493, -0.2715192449547044, -0.3282238674216125, 0.05137821342493089, -0.2890758172270829, -0.2462993854950246, 0.17348417289051138, -0.24251214459487427, 0.09574826692600977, 0.16827126656186908, 0.06728498155748701, -0.07091821669636786, -0.27920913562810123, 0.2910872231156259, -0.0017804097310856802, 0.37942440210752293, 0.04872850889391075, 0.14978038778684855, -0.018143835024627512, -0.03687287488161293, -0.03133203235314521, -0.010408468348580517, 0.21373190567634356, 0.39421196850112394, 0.21325504277794533, 0.3424912467208206, -0.41709010533937446, -0.2569002359228413, 0.10304707191782454, 0.15943032432959914, 0.12263399757917696, -0.06220782005342923, -0.3582341235867791, 0.02806832169322935, -0.19102497004635938, 0.022787237523940122, -0.13366645630863686, -0.01799923334867145, -0.05985522760741719, -0.284538633562465, 0.0518333274131156, 0.07569805485170895, 0.12441780604422092, -0.09067224614379596, -0.11939151526495738, 0.08450909625618856, 0.20375618298397694, 0.09658902848764539, 0.07173545892375892, 0.1754479729283397, -0.2602009522913611, -0.18014523952925093, 0.3400415202526197, -0.04460302735870219, -0.23211602643387366, 0.22070015832934886, -0.052983927805206346, -0.1924496411476667, 0.09967098551585454, 0.25951039821407057, 0.13875291256667815, -0.19143741661746513, 0.015179963191183386, -0.04641328222590358, 0.1619433917861499, 0.027975056799645345, -0.04900467313813326, 0.2024670214255098, 0.2504415860685061, -0.0049436903137662636, 0.1361391828766201, -0.14589367948204585, -0.043162692845352506, -0.16760592411745862, -0.05751578375052865, -0.18023427392193436, -0.04123554295652517, -0.07149516956369178, -0.12732712608404867, 0.3835789937245315, 0.2582764703978159, 0.2235649934002439, 0.09296152541056683, 0.35936649417989464, 0.020177613838961706, 0.1203659212452755, 0.07716805685298798, 0.18012738326079633, -0.026284217936535403, 0.1522791657966804, -0.20464486398172807, 0.09649645058280304, 0.01835477787822689] |
1,802.06665 | On the iterated estimation of dynamic discrete choice games | We study the asymptotic properties of a class of estimators of the structural
parameters in dynamic discrete choice games. We consider K-stage policy
iteration (PI) estimators, where K denotes the number of policy iterations
employed in the estimation. This class nests several estimators proposed in the
literature such as those in Aguirregabiria and Mira (2002, 2007), Pesendorfer
and Schmidt-Dengler (2008), and Pakes et al. (2007). First, we establish that
the K-PML estimator is consistent and asymptotically normal for all K. This
complements findings in Aguirregabiria and Mira (2007), who focus on K=1 and K
large enough to induce convergence of the estimator. Furthermore, we show under
certain conditions that the asymptotic variance of the K-PML estimator can
exhibit arbitrary patterns as a function of K. Second, we establish that the
K-MD estimator is consistent and asymptotically normal for all K. For a
specific weight matrix, the K-MD estimator has the same asymptotic distribution
as the K-PML estimator. Our main result provides an optimal sequence of weight
matrices for the K-MD estimator and shows that the optimally weighted K-MD
estimator has an asymptotic distribution that is invariant to K. The invariance
result is especially unexpected given the findings in Aguirregabiria and Mira
(2007) for K-PML estimators. Our main result implies two new corollaries about
the optimal 1-MD estimator (derived by Pesendorfer and Schmidt-Dengler (2008)).
First, the optimal 1-MD estimator is optimal in the class of K-MD estimators.
In other words, additional policy iterations do not provide asymptotic
efficiency gains relative to the optimal 1-MD estimator. Second, the optimal
1-MD estimator is more or equally asymptotically efficient than any K-PML
estimator for all K. Finally, the appendix provides appropriate conditions
under which the optimal 1-MD estimator is asymptotically efficient.
| econ.EM | we study the asymptotic properties of a class of estimators of the structural parameters in dynamic discrete choice games we consider kstage policy iteration pi estimators where k denotes the number of policy iterations employed in the estimation this class nests several estimators proposed in the literature such as those in aguirregabiria and mira 2002 2007 pesendorfer and schmidtdengler 2008 and pakes et al 2007 first we establish that the kpml estimator is consistent and asymptotically normal for all k this complements findings in aguirregabiria and mira 2007 who focus on k1 and k large enough to induce convergence of the estimator furthermore we show under certain conditions that the asymptotic variance of the kpml estimator can exhibit arbitrary patterns as a function of k second we establish that the kmd estimator is consistent and asymptotically normal for all k for a specific weight matrix the kmd estimator has the same asymptotic distribution as the kpml estimator our main result provides an optimal sequence of weight matrices for the kmd estimator and shows that the optimally weighted kmd estimator has an asymptotic distribution that is invariant to k the invariance result is especially unexpected given the findings in aguirregabiria and mira 2007 for kpml estimators our main result implies two new corollaries about the optimal 1md estimator derived by pesendorfer and schmidtdengler 2008 first the optimal 1md estimator is optimal in the class of kmd estimators in other words additional policy iterations do not provide asymptotic efficiency gains relative to the optimal 1md estimator second the optimal 1md estimator is more or equally asymptotically efficient than any kpml estimator for all k finally the appendix provides appropriate conditions under which the optimal 1md estimator is asymptotically efficient | [['we', 'study', 'the', 'asymptotic', 'properties', 'of', 'a', 'class', 'of', 'estimators', 'of', 'the', 'structural', 'parameters', 'in', 'dynamic', 'discrete', 'choice', 'games', 'we', 'consider', 'kstage', 'policy', 'iteration', 'pi', 'estimators', 'where', 'k', 'denotes', 'the', 'number', 'of', 'policy', 'iterations', 'employed', 'in', 'the', 'estimation', 'this', 'class', 'nests', 'several', 'estimators', 'proposed', 'in', 'the', 'literature', 'such', 'as', 'those', 'in', 'aguirregabiria', 'and', 'mira', '2002', '2007', 'pesendorfer', 'and', 'schmidtdengler', '2008', 'and', 'pakes', 'et', 'al', '2007', 'first', 'we', 'establish', 'that', 'the', 'kpml', 'estimator', 'is', 'consistent', 'and', 'asymptotically', 'normal', 'for', 'all', 'k', 'this', 'complements', 'findings', 'in', 'aguirregabiria', 'and', 'mira', '2007', 'who', 'focus', 'on', 'k1', 'and', 'k', 'large', 'enough', 'to', 'induce', 'convergence', 'of', 'the', 'estimator', 'furthermore', 'we', 'show', 'under', 'certain', 'conditions', 'that', 'the', 'asymptotic', 'variance', 'of', 'the', 'kpml', 'estimator', 'can', 'exhibit', 'arbitrary', 'patterns', 'as', 'a', 'function', 'of', 'k', 'second', 'we', 'establish', 'that', 'the', 'kmd', 'estimator', 'is', 'consistent', 'and', 'asymptotically', 'normal', 'for', 'all', 'k', 'for', 'a', 'specific', 'weight', 'matrix', 'the', 'kmd', 'estimator', 'has', 'the', 'same', 'asymptotic', 'distribution', 'as', 'the', 'kpml', 'estimator', 'our', 'main', 'result', 'provides', 'an', 'optimal', 'sequence', 'of', 'weight', 'matrices', 'for', 'the', 'kmd', 'estimator', 'and', 'shows', 'that', 'the', 'optimally', 'weighted', 'kmd', 'estimator', 'has', 'an', 'asymptotic', 'distribution', 'that', 'is', 'invariant', 'to', 'k', 'the', 'invariance', 'result', 'is', 'especially', 'unexpected', 'given', 'the', 'findings', 'in', 'aguirregabiria', 'and', 'mira', '2007', 'for', 'kpml', 'estimators', 'our', 'main', 'result', 'implies', 'two', 'new', 'corollaries', 'about', 'the', 'optimal', '1md', 'estimator', 'derived', 'by', 'pesendorfer', 'and', 'schmidtdengler', '2008', 'first', 'the', 'optimal', '1md', 'estimator', 'is', 'optimal', 'in', 'the', 'class', 'of', 'kmd', 'estimators', 'in', 'other', 'words', 'additional', 'policy', 'iterations', 'do', 'not', 'provide', 'asymptotic', 'efficiency', 'gains', 'relative', 'to', 'the', 'optimal', '1md', 'estimator', 'second', 'the', 'optimal', '1md', 'estimator', 'is', 'more', 'or', 'equally', 'asymptotically', 'efficient', 'than', 'any', 'kpml', 'estimator', 'for', 'all', 'k', 'finally', 'the', 'appendix', 'provides', 'appropriate', 'conditions', 'under', 'which', 'the', 'optimal', '1md', 'estimator', 'is', 'asymptotically', 'efficient']] | [-0.09923972873924176, 0.04146024758673195, -0.1359883538262354, 0.0797084701954929, -0.05467808011348135, -0.15620781518746077, 0.08848142317408625, 0.38139391318612603, -0.20637101341989736, -0.2868781500830208, 0.1341623430998626, -0.2512366838221039, -0.19006144540515835, 0.1860384223185632, -0.15045273624188574, 0.08722505500038781, 0.047397723867645555, 0.013230461794465216, -0.057830295897858014, -0.317409177058464, 0.24159670794344765, 0.08170262510800663, 0.2906733300027402, -0.05698851438909315, 0.11955694523591301, 0.022740514489792883, -0.021642630442288195, -0.0050591897715908515, -0.1899750952620089, 0.0814309066976015, 0.26291172460811896, 0.13599908224693158, 0.31125934139049843, -0.268488073345105, -0.14152849735351417, 0.12875151174233818, 0.1202918327874293, 0.043455202810268344, 0.008631086054991018, -0.21420565889401927, 0.13021185043274397, -0.15313368078235226, -0.1149425552477484, -0.059375655550172206, -0.0037287213670849175, 0.029464917521492193, -0.3859764716501968, 0.08983628914646077, 0.11847307021419444, 0.03501608129428498, -0.04891598217014081, -0.2036287895029002, 0.0038777204795873593, 0.07606964722966925, 0.062352169112412696, -0.0036263365520793904, 0.06805006865345474, -0.04777402862848046, -0.08469033839330337, 0.25496536560148936, -0.08334487478395004, -0.1567328632208892, 0.13350423241686402, -0.13677383771244087, -0.14412293008785007, 0.10190198386415761, 0.14022721762889395, 0.14013224830753607, -0.14659579491846342, 0.1072151164967609, -0.11201898967632246, 0.10368802692442614, 0.057728815012536815, 0.030209476026002227, 0.0781977484384, 0.08669421322418025, 0.17902554340177063, 0.15693804097807243, -0.06582317648813264, -0.06866321854479124, -0.3182967678393896, -0.14594057227325877, -0.20281912270610508, 0.009665859686308103, -0.17703359602909544, -0.16430159219141519, 0.3415310823712303, 0.14695040417194427, 0.17992718186949863, 0.11714764292804583, 0.2329090869793253, 0.11180052637383796, -0.02307430236804776, 0.1963057378939765, 0.20344747996074553, 0.15798162697661888, 0.038872910534597134, -0.20969069381475688, 0.1364019362668455, 0.09035474214401057] |
1,802.06666 | Emergence of Jack ground states from two-body pseudopotentials in
fractional quantum Hall systems | The family of "Jack states" related to antisymmetric Jack polynomials are the
exact zero-energy ground states of particular model short-range {\em many-body}
repulsive interactions, defined by a few non-vanishing leading
pseudopotentials. Some Jack states are known or anticipated to accurately
describe many-electron incompressible ground states emergent from the {\em
two-body} Coulomb repulsion in fractional quantum Hall effect. By extensive
numerical diagonalization we demonstrate emergence of Jack states from suitable
pair interactions. We find empirically a simple formula for the optimal
two-body pseudopotentials for the series of most prominent Jack states
generated by {\em contact} many-body repulsion. Furthermore, we seek
realization of arbitrary Jack states in realistic quantum Hall systems with
Coulomb interaction, i.e., in partially filled lowest and excited Landau levels
in quasi-two-dimensional layers of conventional semiconductors like GaAs or in
graphene.
| cond-mat.str-el | the family of jack states related to antisymmetric jack polynomials are the exact zeroenergy ground states of particular model shortrange em manybody repulsive interactions defined by a few nonvanishing leading pseudopotentials some jack states are known or anticipated to accurately describe manyelectron incompressible ground states emergent from the em twobody coulomb repulsion in fractional quantum hall effect by extensive numerical diagonalization we demonstrate emergence of jack states from suitable pair interactions we find empirically a simple formula for the optimal twobody pseudopotentials for the series of most prominent jack states generated by em contact manybody repulsion furthermore we seek realization of arbitrary jack states in realistic quantum hall systems with coulomb interaction ie in partially filled lowest and excited landau levels in quasitwodimensional layers of conventional semiconductors like gaas or in graphene | [['the', 'family', 'of', 'jack', 'states', 'related', 'to', 'antisymmetric', 'jack', 'polynomials', 'are', 'the', 'exact', 'zeroenergy', 'ground', 'states', 'of', 'particular', 'model', 'shortrange', 'em', 'manybody', 'repulsive', 'interactions', 'defined', 'by', 'a', 'few', 'nonvanishing', 'leading', 'pseudopotentials', 'some', 'jack', 'states', 'are', 'known', 'or', 'anticipated', 'to', 'accurately', 'describe', 'manyelectron', 'incompressible', 'ground', 'states', 'emergent', 'from', 'the', 'em', 'twobody', 'coulomb', 'repulsion', 'in', 'fractional', 'quantum', 'hall', 'effect', 'by', 'extensive', 'numerical', 'diagonalization', 'we', 'demonstrate', 'emergence', 'of', 'jack', 'states', 'from', 'suitable', 'pair', 'interactions', 'we', 'find', 'empirically', 'a', 'simple', 'formula', 'for', 'the', 'optimal', 'twobody', 'pseudopotentials', 'for', 'the', 'series', 'of', 'most', 'prominent', 'jack', 'states', 'generated', 'by', 'em', 'contact', 'manybody', 'repulsion', 'furthermore', 'we', 'seek', 'realization', 'of', 'arbitrary', 'jack', 'states', 'in', 'realistic', 'quantum', 'hall', 'systems', 'with', 'coulomb', 'interaction', 'ie', 'in', 'partially', 'filled', 'lowest', 'and', 'excited', 'landau', 'levels', 'in', 'quasitwodimensional', 'layers', 'of', 'conventional', 'semiconductors', 'like', 'gaas', 'or', 'in', 'graphene']] | [-0.20711816797230506, 0.23113322957016696, -0.02213566398484435, 0.11651397367699468, -0.010196574697285101, -0.20676699916260655, 0.037439002613113684, 0.32760061595278483, -0.2338319463367842, -0.2483646866343351, -0.04106356506676865, -0.3311123563484712, -0.18481062972833487, 0.09617588952162558, 0.06782870921112287, 0.1170380832865538, 0.04372910146820218, -0.033528041143047936, -0.0868061662106563, -0.2176846430185392, 0.3374639803042748, 0.004361394127816752, 0.2405687128052567, 0.07868436357944808, 0.007071447112442304, 0.04062688650182364, 0.1059042853232699, -0.030960389829212516, -0.12527662468368583, 0.08695930672260918, 0.3006953573119862, -0.0821642082481765, 0.23898324993382575, -0.4779373923824592, -0.12990921565726626, 0.017436259910358454, 0.1707438970704309, 0.20043826753195995, -0.035890958857525024, -0.3865249182845494, -0.0615251767554913, -0.2689284829168834, -0.16237836170440653, -0.17449284643710902, 0.030926999576022907, -0.002569827448689576, -0.2616210533235448, 0.131009070675425, 0.03196097454620582, 0.043518911593833545, -0.10632351929653493, -0.17497310156679965, -0.03254294999924517, 0.055600292663174594, -0.03472421604303897, -0.0155056198674367, 0.09233840723931225, -0.17827852050223472, -0.1908330526820271, 0.38382878082682675, -0.02034574270532396, -0.20129369641654193, 0.17759391491894017, -0.16128901540562793, -0.0783863963531048, 0.13678200233897025, 0.08903936681930315, 0.061345160993038335, -0.08225551275818636, 0.12860032209771982, -0.06561409926154849, 0.09456870022889537, 0.06554957033508937, 0.09326728613285179, 0.2177444955150625, 0.037504918229498085, 0.03023372932732331, 0.19016941388624467, -0.04475891701594898, -0.16400013172780303, -0.25996916531585157, -0.1054084761320458, -0.31523152687551564, 0.07893296981329155, -0.014146734556341085, -0.23861164874820548, 0.40192147600332234, 0.09185436989906576, 0.12355947602875196, -0.014524038530053627, 0.18753230317044212, 0.11188961996936775, 0.033967827474980644, 0.03581995461100825, 0.22781700988509163, 0.16862560290610418, -0.013923557651596087, -0.26863706363082834, 0.008034796555434834, 0.11273095599432109] |
1,802.06667 | The infinite two-sided loop-erased random walk | The loop-erased random walk (LERW) in $ \Z^d, d \geq 2$, is obtained by
erasing loops chronologically from simple random walk. In this paper we show
the existence of the two-sided LERW which can be considered as the distribution
of the LERW as seen by a point in the "middle" of the path.
| math.PR | the looperased random walk lerw in zd d geq 2 is obtained by erasing loops chronologically from simple random walk in this paper we show the existence of the twosided lerw which can be considered as the distribution of the lerw as seen by a point in the middle of the path | [['the', 'looperased', 'random', 'walk', 'lerw', 'in', 'zd', 'd', 'geq', '2', 'is', 'obtained', 'by', 'erasing', 'loops', 'chronologically', 'from', 'simple', 'random', 'walk', 'in', 'this', 'paper', 'we', 'show', 'the', 'existence', 'of', 'the', 'twosided', 'lerw', 'which', 'can', 'be', 'considered', 'as', 'the', 'distribution', 'of', 'the', 'lerw', 'as', 'seen', 'by', 'a', 'point', 'in', 'the', 'middle', 'of', 'the', 'path']] | [-0.11112113324746203, 0.2391655194089533, -0.1013250144628378, 0.015991718221742373, 0.029006308911798093, -0.13435149514295447, 0.09374656884308653, 0.39513476425781846, -0.2776687079682373, -0.17747304309159517, 0.14964162373172046, -0.2579461521683977, -0.17540590654915342, 0.1331857283725045, -0.07356148680600409, 0.01458363152610568, 0.013592259474815084, 0.10038809074859063, 0.03067095806965461, -0.2533854259034762, 0.26042161659839064, -0.005666537846152026, 0.1762728601013525, 0.006911976316657204, 0.07848101046581107, 0.05841777082801295, -0.018792807267835505, 0.044740936503960535, -0.1492186261770817, 0.056759902114908285, 0.13120857617244697, 0.04722783179917874, 0.25794729139082706, -0.38524432154372334, -0.23209508390237504, 0.1315031948212821, 0.2157309243025688, 0.08355338166494711, -0.0004728717657809074, -0.32545111081204736, 0.09271827589971228, -0.10709946144085664, -0.18454031637296653, 0.08134331136534456, 0.03565243431904282, 0.04822587035596371, -0.2661824256826479, 0.0639196836317961, 0.1444533822628168, 0.033059398643672466, 0.07249087574354444, -0.09907301326389782, -0.03441289097715456, 0.1590638676067241, -0.03391707740061415, 0.09074903061935821, 0.10308023275306019, -0.08618114210324936, -0.23808212329346973, 0.3724292078986764, -0.09391103786989473, -0.17858651844569698, 0.11669841463802956, -0.23106267111590847, -0.1575066415646758, 0.08692155828556189, 0.13443918169762653, 0.13507665858532375, -0.17565208329604223, 0.12912238018515593, -0.10937009547622158, 0.02930707825054504, 0.0893413748842879, -0.03808286481608565, 0.1584613419339663, 0.13463479251815721, 0.10183915886311577, 0.20990469645878945, -0.06922905075435455, -0.12165341775219601, -0.3396927858120762, -0.12255163342118837, -0.28569423056279236, 0.1527624866172958, -0.21653601104536882, -0.2067308613600639, 0.35470599222641724, 0.1633089297504809, 0.29420350122158057, 0.15829285329360013, 0.19419462359152162, 0.15588414639037532, 0.0004364636798317616, 0.13779546994751748, 0.09691789774940564, 0.1303945223424727, 0.054798518925403744, -0.1027759845332744, 0.10880677796936092, 0.16656146725066578] |
1,802.06668 | Sequentializing cellular automata | We study the problem of sequentializing a cellular automaton without
introducing any intermediate states, and only performing reversible
permutations on the tape. We give a decidable characterization of cellular
automata which can be written as a single left-to-right sweep of a bijective
rule from left to right over an infinite tape.
| math.DS cs.FL | we study the problem of sequentializing a cellular automaton without introducing any intermediate states and only performing reversible permutations on the tape we give a decidable characterization of cellular automata which can be written as a single lefttoright sweep of a bijective rule from left to right over an infinite tape | [['we', 'study', 'the', 'problem', 'of', 'sequentializing', 'a', 'cellular', 'automaton', 'without', 'introducing', 'any', 'intermediate', 'states', 'and', 'only', 'performing', 'reversible', 'permutations', 'on', 'the', 'tape', 'we', 'give', 'a', 'decidable', 'characterization', 'of', 'cellular', 'automata', 'which', 'can', 'be', 'written', 'as', 'a', 'single', 'lefttoright', 'sweep', 'of', 'a', 'bijective', 'rule', 'from', 'left', 'to', 'right', 'over', 'an', 'infinite', 'tape']] | [-0.16822070036607328, 0.1808787074990687, -0.02484086025506258, 0.04126252133399248, -0.08671489050611854, -0.2245594371855259, 0.217015333045274, 0.3718932268768549, -0.3821318446099758, -0.19578913416713475, 0.10150599410757423, -0.2003121483884752, -0.08063770884647965, 0.19035747113637627, -0.08438100712373853, 0.015917841419577597, 0.06454173527657986, 0.09843588031828404, -0.0626368832308799, -0.2214483352424577, 0.21198103243485092, -0.006293274271301925, 0.222803325150162, -0.023221555538475512, 0.15635422345250846, 0.023997095059603454, -0.004421824365854263, 0.03875693965703249, -0.08908986059483141, 0.04749929792364128, 0.2814919948577881, 0.1750113465730101, 0.24013337248936295, -0.47892190627753733, -0.15247694327495992, 0.18913851549848915, 0.18288676817901434, 0.12811678171856328, -0.010567394879180937, -0.2679968654736877, 0.10734005097299815, -0.19461928045377136, -0.011295628789812327, -0.02452696899417788, 0.006314445682801306, 0.020944617087952793, -0.24954927841201424, -0.03225905943661928, 0.1768680289015174, 0.1380903348326683, -0.0287583358772099, -0.055162541754543784, 0.0034666894003748893, 0.13599987594410778, -0.08415461456403137, 0.02641082230489701, 0.10247380945831537, -0.09845025368034839, -0.20167410830967128, 0.33910098663996907, -0.05023999348282814, -0.23554188054054975, 0.129583741677925, -0.06673826972022652, -0.13149688898585737, 0.10583959180861711, 0.09812779268715531, 0.13205578412860633, -0.12085984764620662, 0.11983923461171798, -0.16881652757525445, 0.21300770645961165, 0.1676822998188436, -0.027698684427887203, 0.1898891630023718, 0.20113536164164544, 0.08177733846008778, 0.21730148112168535, 0.02200576385948807, -0.04513431955128908, -0.3161111181974411, -0.21277680560480802, -0.11658938589505852, 0.11197148823674069, -0.0026006245144526473, -0.2556331960298121, 0.3978904621116817, 0.07624503399245441, 0.19025532157626002, 0.18115056038135663, 0.24537560135126113, 0.1126890480867587, 0.09871669922955334, -0.0019156823027879, 0.017078213393688202, 0.14140954868867994, 0.06142173819011077, -0.18170002086553722, 0.07826428756583483, 0.1531619657203555] |
1,802.06669 | (Arc-disjoint) cycle packing in tournament: classical and parameterized
complexity | Given a tournament $T$, the problem MaxCT consists of finding a maximum
(arc-disjoint) cycle packing of $T$. In the same way, MaxTT corresponds to the
specific case where the collection of cycles are triangles (i.e. directed
3-cycles). Although MaxCT can be seen as the LP dual of minimum feedback arc
set in tournaments which have been widely studied, surprisingly no algorithmic
results seem to exist concerning the former.
In this paper, we prove the NP-hardness of both MaxCT and MaxTT. We also show
that deciding if a tournament has a cycle packing and a feedback arc set with
the same size is an NP-complete problem. In light of this, we show that MaxTT
admits a vertex linear-kernel when parameterized with the size of the solution.
Finally, we provide polynomial algorithms for MaxTT and MaxCT when the
tournament is sparse, that is when it admits a FAS which is a matching.
| cs.DM math.CO | given a tournament t the problem maxct consists of finding a maximum arcdisjoint cycle packing of t in the same way maxtt corresponds to the specific case where the collection of cycles are triangles ie directed 3cycles although maxct can be seen as the lp dual of minimum feedback arc set in tournaments which have been widely studied surprisingly no algorithmic results seem to exist concerning the former in this paper we prove the nphardness of both maxct and maxtt we also show that deciding if a tournament has a cycle packing and a feedback arc set with the same size is an npcomplete problem in light of this we show that maxtt admits a vertex linearkernel when parameterized with the size of the solution finally we provide polynomial algorithms for maxtt and maxct when the tournament is sparse that is when it admits a fas which is a matching | [['given', 'a', 'tournament', 't', 'the', 'problem', 'maxct', 'consists', 'of', 'finding', 'a', 'maximum', 'arcdisjoint', 'cycle', 'packing', 'of', 't', 'in', 'the', 'same', 'way', 'maxtt', 'corresponds', 'to', 'the', 'specific', 'case', 'where', 'the', 'collection', 'of', 'cycles', 'are', 'triangles', 'ie', 'directed', '3cycles', 'although', 'maxct', 'can', 'be', 'seen', 'as', 'the', 'lp', 'dual', 'of', 'minimum', 'feedback', 'arc', 'set', 'in', 'tournaments', 'which', 'have', 'been', 'widely', 'studied', 'surprisingly', 'no', 'algorithmic', 'results', 'seem', 'to', 'exist', 'concerning', 'the', 'former', 'in', 'this', 'paper', 'we', 'prove', 'the', 'nphardness', 'of', 'both', 'maxct', 'and', 'maxtt', 'we', 'also', 'show', 'that', 'deciding', 'if', 'a', 'tournament', 'has', 'a', 'cycle', 'packing', 'and', 'a', 'feedback', 'arc', 'set', 'with', 'the', 'same', 'size', 'is', 'an', 'npcomplete', 'problem', 'in', 'light', 'of', 'this', 'we', 'show', 'that', 'maxtt', 'admits', 'a', 'vertex', 'linearkernel', 'when', 'parameterized', 'with', 'the', 'size', 'of', 'the', 'solution', 'finally', 'we', 'provide', 'polynomial', 'algorithms', 'for', 'maxtt', 'and', 'maxct', 'when', 'the', 'tournament', 'is', 'sparse', 'that', 'is', 'when', 'it', 'admits', 'a', 'fas', 'which', 'is', 'a', 'matching']] | [-0.14311706008789624, 0.09560631990720653, -0.06612085825419867, 0.03189207790825741, -0.08894289467146232, -0.1444064417975836, 0.0675207230726557, 0.3795363669074297, -0.2781718691448437, -0.2815756958896832, 0.14128982848269028, -0.28628232376649976, -0.16203608651389212, 0.14801685857092775, -0.10823326824848609, 0.008293817993315975, 0.10469318325037524, 0.11606771238136493, 0.006640352572833232, -0.2936177046964845, 0.27570698254322945, -0.02089831806038, 0.18417305561820133, 0.08375811490274016, 0.1136395784138683, 0.013918475105720978, 0.0293452344122249, 0.13890963649195961, -0.1421775451240473, 0.04166488505309235, 0.2645009100287153, 0.18644017685554773, 0.27249883126229946, -0.36682410538196564, -0.1506193434482053, 0.20208829073485413, 0.13010642510579412, 0.09846239420585334, -0.027368339455230224, -0.14339302522567846, 0.14056525367855927, -0.10479214021798548, -0.07956362870403084, 0.01335460161665242, 0.08634800949890241, 0.013022404433164204, -0.2904854536419047, 0.002157034656937678, 0.1139223740042356, 0.018040939549846736, -0.013316194472403575, -0.12863706105276193, -0.02256026873740074, 0.0934115902443757, -0.014542286703050536, 0.09110913708518516, 0.017393784828784082, -0.13484470885803285, -0.17476875581872342, 0.3918583202082039, -0.0054324933272261395, -0.1556638808274054, 0.1475609361769119, -0.1298260444559582, -0.17742764135047592, 0.10750427221154306, 0.1016858933468493, 0.14986226913025416, -0.10946740897287592, 0.11682197914947912, -0.18775328771279962, 0.1513451549268309, 0.1215050377908019, -0.018663933882708567, 0.1356565857731156, 0.18696110188373483, 0.17898870008097548, 0.20741707259779735, -0.012191624761927847, -0.04367922005187345, -0.27460530864531113, -0.1098412283064935, -0.16074631456441976, 0.043764219406817184, -0.12730891807538053, -0.20689781209541447, 0.38711457516398007, 0.08662642713102134, 0.19256260651695048, 0.10918045929170545, 0.2257422494620785, 0.12297755261768287, 0.03721336461447379, 0.1590979741468257, 0.1923832969674403, 0.10033810697339675, 0.02057764716696419, -0.2081288164399483, 0.08030415178845393, 0.09529887666088223] |
1,802.0667 | Frequency-Selective Hybrid Beamforming Based on Implicit CSI for
Millimeter Wave Systems | Hybrid beamforming is a promising concept to achieve high data rate
transmission at millimeter waves. To implement it in a transceiver, many
references optimally adapt to a high-dimensional multi-antenna channel but more
or less ignore the complexity of the channel estimation. Realizing that
received coupling coefficients of the channel and pairs of possible analog
beamforming vectors can be used for analog beam selection, we further propose a
low-complexity scheme that exploits the coupling coefficients to implement
hybrid beamforming. Essentially, the coupling coefficients can be regarded as
implicit channel state information (CSI), and the estimates of these coupling
coefficients yield alternatives of effective channel matrices of much lower
dimension. After calculating the Frobenius norm of these effective channel
matrices, it turns out that the effective channel having the largest value of
the Frobenius norm provides the solution to hybrid beamforming problem.
| cs.IT math.IT | hybrid beamforming is a promising concept to achieve high data rate transmission at millimeter waves to implement it in a transceiver many references optimally adapt to a highdimensional multiantenna channel but more or less ignore the complexity of the channel estimation realizing that received coupling coefficients of the channel and pairs of possible analog beamforming vectors can be used for analog beam selection we further propose a lowcomplexity scheme that exploits the coupling coefficients to implement hybrid beamforming essentially the coupling coefficients can be regarded as implicit channel state information csi and the estimates of these coupling coefficients yield alternatives of effective channel matrices of much lower dimension after calculating the frobenius norm of these effective channel matrices it turns out that the effective channel having the largest value of the frobenius norm provides the solution to hybrid beamforming problem | [['hybrid', 'beamforming', 'is', 'a', 'promising', 'concept', 'to', 'achieve', 'high', 'data', 'rate', 'transmission', 'at', 'millimeter', 'waves', 'to', 'implement', 'it', 'in', 'a', 'transceiver', 'many', 'references', 'optimally', 'adapt', 'to', 'a', 'highdimensional', 'multiantenna', 'channel', 'but', 'more', 'or', 'less', 'ignore', 'the', 'complexity', 'of', 'the', 'channel', 'estimation', 'realizing', 'that', 'received', 'coupling', 'coefficients', 'of', 'the', 'channel', 'and', 'pairs', 'of', 'possible', 'analog', 'beamforming', 'vectors', 'can', 'be', 'used', 'for', 'analog', 'beam', 'selection', 'we', 'further', 'propose', 'a', 'lowcomplexity', 'scheme', 'that', 'exploits', 'the', 'coupling', 'coefficients', 'to', 'implement', 'hybrid', 'beamforming', 'essentially', 'the', 'coupling', 'coefficients', 'can', 'be', 'regarded', 'as', 'implicit', 'channel', 'state', 'information', 'csi', 'and', 'the', 'estimates', 'of', 'these', 'coupling', 'coefficients', 'yield', 'alternatives', 'of', 'effective', 'channel', 'matrices', 'of', 'much', 'lower', 'dimension', 'after', 'calculating', 'the', 'frobenius', 'norm', 'of', 'these', 'effective', 'channel', 'matrices', 'it', 'turns', 'out', 'that', 'the', 'effective', 'channel', 'having', 'the', 'largest', 'value', 'of', 'the', 'frobenius', 'norm', 'provides', 'the', 'solution', 'to', 'hybrid', 'beamforming', 'problem']] | [-0.23492918395786547, 0.05005968142234321, -0.06622401242452075, 0.05234501418495451, -0.1251277170942298, -0.26149556431628296, 0.06811471156210505, 0.3722603135575939, -0.30642357828494693, -0.2504207872885412, 0.11947188199680697, -0.22851230407333267, -0.15195468312262425, 0.13970707300218888, -0.060611228668130936, 0.089053383911648, 0.055584772588086445, 0.02353533338090139, -0.09740778135310393, -0.23695189419335552, 0.27655618343103144, 0.14484133975181196, 0.35247794149576556, -0.011369121217701053, 0.14214175096297238, 0.006455131922848523, -0.006465136943318482, -0.0661837344124381, -0.09628238576608834, 0.10104825675371103, 0.35141032458216487, 0.13043190569650115, 0.24990457234837646, -0.39217705203752434, -0.22442762876993844, 0.11298419620309558, 0.17620599342377058, 0.12860074770370764, -0.05290046977430133, -0.22628253947810403, 0.11397568035338607, -0.1927558031118159, -0.039420524133103235, -0.05312485582544468, -0.07699650247980441, -0.03230955318015601, -0.3973028417352387, 0.07163318118400638, -0.004630355189354824, -0.025579081499017775, -0.025089292432780245, -0.19769181021090065, 0.027447267365641893, 0.11705113730942165, 0.020401074677439672, 0.007820846831392763, 0.09238394734108754, -0.09758132230490446, -0.07471243836251752, 0.3473645606044946, -0.038273705811505875, -0.29116174751626595, 0.13780296382485954, -0.08114402864594013, -0.03220856873584645, 0.1656933539347457, 0.2382272590284369, 0.08176114957979215, -0.15730718242536698, 0.01823839105449484, -0.017866606318524905, 0.1814877919187503, 0.06884887306285756, 0.15552856443848992, 0.13412572868567493, 0.14589722511425082, 0.14681500652763393, 0.11936335966290373, -0.09741429587510149, -0.07684414479257871, -0.22451859662043197, -0.14400074708308758, -0.23912696246656456, 0.03929000398077603, -0.11769925733076109, -0.09619971037276888, 0.35431408103746176, 0.15718639904433596, 0.1473088960196557, 0.06746628840586968, 0.34870481441861817, 0.1278097393515054, 0.10244349213649652, 0.0891323939481351, 0.24500872183125466, 0.1948604213190265, 0.0912123489143726, -0.21506084677197837, 0.046693931353677595, 0.03533799058183961] |
1,802.06671 | On a new Sheffer class of polynomials related to normal product
distribution | Consider a generic random element $F_\infty= \sum_{\text{finite}} \lambda_k
(N^2_k -1)$ in the second Wiener chaos with a finite number of non-zero
coefficients in the spectral representation where $(N_k)_{k \ge 1}$ is a
sequence of i.i.d $\mathscr{N}(0,1)$. Using the recently discovered (see Arras
et al. \cite{a-a-p-s-stein}) stein operator $\RR_\infty$ associated to
$F_\infty$, we introduce a new class of polynomials $$\PP_\infty:= \{ P_n =
\RR^n_\infty \textbf{1} \, : \, n \ge 1 \}.$$ We analysis in details the case
where $F_\infty$ is distributed as the normal product distribution $N_1 \times
N_2$, and relate the associated polynomials class to Rota's {\it Umbral
calculus} by showing that it is a \textit{Sheffer family} and enjoys many
interesting properties. Lastly, we study the connection between the polynomial
class $\PP_\infty$ and the non-central probabilistic limit theorems within the
second Wiener chaos.
| math.PR | consider a generic random element f_infty sum_textfinite lambda_k n2_k 1 in the second wiener chaos with a finite number of nonzero coefficients in the spectral representation where n_k_k ge 1 is a sequence of iid mathscrn01 using the recently discovered see arras et al citeaapsstein stein operator rr_infty associated to f_infty we introduce a new class of polynomials pp_infty p_n rrn_infty textbf1 n ge 1 we analysis in details the case where f_infty is distributed as the normal product distribution n_1 times n_2 and relate the associated polynomials class to rotas it umbral calculus by showing that it is a textitsheffer family and enjoys many interesting properties lastly we study the connection between the polynomial class pp_infty and the noncentral probabilistic limit theorems within the second wiener chaos | [['consider', 'a', 'generic', 'random', 'element', 'f_infty', 'sum_textfinite', 'lambda_k', 'n2_k', '1', 'in', 'the', 'second', 'wiener', 'chaos', 'with', 'a', 'finite', 'number', 'of', 'nonzero', 'coefficients', 'in', 'the', 'spectral', 'representation', 'where', 'n_k_k', 'ge', '1', 'is', 'a', 'sequence', 'of', 'iid', 'mathscrn01', 'using', 'the', 'recently', 'discovered', 'see', 'arras', 'et', 'al', 'citeaapsstein', 'stein', 'operator', 'rr_infty', 'associated', 'to', 'f_infty', 'we', 'introduce', 'a', 'new', 'class', 'of', 'polynomials', 'pp_infty', 'p_n', 'rrn_infty', 'textbf1', 'n', 'ge', '1', 'we', 'analysis', 'in', 'details', 'the', 'case', 'where', 'f_infty', 'is', 'distributed', 'as', 'the', 'normal', 'product', 'distribution', 'n_1', 'times', 'n_2', 'and', 'relate', 'the', 'associated', 'polynomials', 'class', 'to', 'rotas', 'it', 'umbral', 'calculus', 'by', 'showing', 'that', 'it', 'is', 'a', 'textitsheffer', 'family', 'and', 'enjoys', 'many', 'interesting', 'properties', 'lastly', 'we', 'study', 'the', 'connection', 'between', 'the', 'polynomial', 'class', 'pp_infty', 'and', 'the', 'noncentral', 'probabilistic', 'limit', 'theorems', 'within', 'the', 'second', 'wiener', 'chaos']] | [-0.13218895094752892, 0.13075265192090213, -0.06721495148264059, 0.049102342400911166, -0.053449140924240364, -0.13627145194963106, 0.001338115448186941, 0.3216275935679549, -0.315389560433809, -0.21848712050348146, 0.09023183629507621, -0.27446048223108305, -0.19321666255558081, 0.1696521189736844, -0.09307997876253887, 0.017161790842088645, 0.0021361450898508003, 0.06870900405993481, -0.04974258516351653, -0.23841870832061315, 0.3085020158210957, -0.03886605962766569, 0.18240218673159658, -0.041728334978786336, 0.08140651805780265, -0.02109720105180094, -0.042427699332039395, -0.04969820084476828, -0.17569457071848232, 0.07702093979171595, 0.24306587499816815, 0.07738377790929389, 0.30356903691549136, -0.3261817599482396, -0.15836130552572988, 0.20372443840283305, 0.13935652183869682, -0.024079677533405293, -0.0370449409546221, -0.2578471756927638, 0.12783309907902876, -0.18728546958178, -0.1681488925227191, -0.01604609311159168, 0.08144637966966804, 0.05108616844636574, -0.3285151780856883, 0.0644839177350318, 0.16084046691593504, 0.0563679983361992, 0.042918515943397746, -0.16160015603762215, 0.021394305584654837, 0.040578798735279496, -0.015850774414579095, 0.016317849119874734, 0.04122003239746785, -0.058203042426123085, -0.10859564675346893, 0.3242997677400982, -0.0872945974760947, -0.199624279510042, 0.1388338539913735, -0.18580078488771468, -0.233217386020144, 0.09499222129004217, 0.09400973568607841, 0.13696865478780965, -0.0732162506436976, 0.19842366030793873, -0.1115987377178644, 0.11271252565109367, 0.11644372352430236, 0.016322294747096903, 0.07019186313381466, 0.07743193642353687, 0.08442167720919819, 0.13701004365913005, -0.0558318812233795, -0.09540578304103207, -0.33660824317485094, -0.20604277000676433, -0.22455518162112778, 0.100300092446743, -0.16206117094254235, -0.17767238541371227, 0.37535488206361023, 0.09367033305476193, 0.18962592081785076, 0.10481665373443305, 0.169163526450636, 0.15296375010252594, -0.025078764420096614, 0.10118548541932422, 0.09545201297405277, 0.2384762282526324, 0.059922647826811844, -0.12830087723368935, 0.02783060957239393, 0.16105189676466986] |
1,802.06672 | Martingale representation for degenerate diffusions | Let $(W,H,\mu)$ be the classical Wiener space on $\R^d$. Assume that
$X=(X_t)$ is a diffusion process satisfying the stochastic differential
equation $dX_t=\sigma(t,X)dB_t+b(t,X)dt$, where $\sigma:[0,1]\times
C([0,1],\R^n)\to \R^n\otimes \R^d$, $b:[0,1]\times C([0,1],\R^n)\to \R^n$, $B$
is an $\R^d$-valued Brownian motion. We suppose that the weak uniqueness of
this equation holds for any initial condition. We prove that any square
integrable martingale $M$ w.r.t. to the filtration $(\calF_t(X),t\in [0,1])$
can be represented as $$ M_t=E[M_0]+\int_0^t P_s(X)\alpha_s(X).dB_s $$ where
$\alpha(X)$ is an $\R^d$-valued process adapted to $(\calF_t(X),t\in [0,1])$,
satisfying $E\int_0^t(a(X_s)\alpha_s(X),\alpha_s(X))ds<\infty$,
$a=\sigma^\star\sigma$ and $P_s(X)$ denotes a measurable version of the
orthogonal projection from $\R^d$ to $\sigma(X_s)^\star(\R^n)$. In particular,
for any $h\in H$, we have \begin{equation} \label{wick} E[\rho(\delta
h)|\calF_1(X)]=\exp\left(\int_0^1(P_s(X)\dot{h}_s,dB_s)-\half\int_0^1|P_s(X)\dot{h}_s|^2ds\right)\,,
\end{equation} where $\rho(\delta h)=\exp(\int_0^1(\dot{h}_s,dB_s)-\half
|H|_H^2)$. This result gives a new development as an infinite series of the
$L^2$-functionals of the degenerate diffusions. We also give an adequate notion
of "innovation process" associated to a degenerate diffusion which corresponds
to the strong solution when the Brownian motion is replaced by an adapted
perturbation of identity. This latter result gives the solution of the causal
Monge-Amp\`ere equation.}
| math.PR math-ph math.MP | let whmu be the classical wiener space on rd assume that xx_t is a diffusion process satisfying the stochastic differential equation dx_tsigmatxdb_tbtxdt where sigma01times c01rnto rnotimes rd b01times c01rnto rn b is an rdvalued brownian motion we suppose that the weak uniqueness of this equation holds for any initial condition we prove that any square integrable martingale m wrt to the filtration calf_txtin 01 can be represented as m_tem_0int_0t p_sxalpha_sxdb_s where alphax is an rdvalued process adapted to calf_txtin 01 satisfying eint_0tax_salpha_sxalpha_sxdsinfty asigmastarsigma and p_sx denotes a measurable version of the orthogonal projection from rd to sigmax_sstarrn in particular for any hin h we have beginequation labelwick erhodelta hcalf_1xexpleftint_01p_sxdoth_sdb_shalfint_01p_sxdoth_s2dsright endequation where rhodelta hexpint_01doth_sdb_shalf h_h2 this result gives a new development as an infinite series of the l2functionals of the degenerate diffusions we also give an adequate notion of innovation process associated to a degenerate diffusion which corresponds to the strong solution when the brownian motion is replaced by an adapted perturbation of identity this latter result gives the solution of the causal mongeampere equation | [['let', 'whmu', 'be', 'the', 'classical', 'wiener', 'space', 'on', 'rd', 'assume', 'that', 'xx_t', 'is', 'a', 'diffusion', 'process', 'satisfying', 'the', 'stochastic', 'differential', 'equation', 'dx_tsigmatxdb_tbtxdt', 'where', 'sigma01times', 'c01rnto', 'rnotimes', 'rd', 'b01times', 'c01rnto', 'rn', 'b', 'is', 'an', 'rdvalued', 'brownian', 'motion', 'we', 'suppose', 'that', 'the', 'weak', 'uniqueness', 'of', 'this', 'equation', 'holds', 'for', 'any', 'initial', 'condition', 'we', 'prove', 'that', 'any', 'square', 'integrable', 'martingale', 'm', 'wrt', 'to', 'the', 'filtration', 'calf_txtin', '01', 'can', 'be', 'represented', 'as', 'm_tem_0int_0t', 'p_sxalpha_sxdb_s', 'where', 'alphax', 'is', 'an', 'rdvalued', 'process', 'adapted', 'to', 'calf_txtin', '01', 'satisfying', 'eint_0tax_salpha_sxalpha_sxdsinfty', 'asigmastarsigma', 'and', 'p_sx', 'denotes', 'a', 'measurable', 'version', 'of', 'the', 'orthogonal', 'projection', 'from', 'rd', 'to', 'sigmax_sstarrn', 'in', 'particular', 'for', 'any', 'hin', 'h', 'we', 'have', 'beginequation', 'labelwick', 'erhodelta', 'hcalf_1xexpleftint_01p_sxdoth_sdb_shalfint_01p_sxdoth_s2dsright', 'endequation', 'where', 'rhodelta', 'hexpint_01doth_sdb_shalf', 'h_h2', 'this', 'result', 'gives', 'a', 'new', 'development', 'as', 'an', 'infinite', 'series', 'of', 'the', 'l2functionals', 'of', 'the', 'degenerate', 'diffusions', 'we', 'also', 'give', 'an', 'adequate', 'notion', 'of', 'innovation', 'process', 'associated', 'to', 'a', 'degenerate', 'diffusion', 'which', 'corresponds', 'to', 'the', 'strong', 'solution', 'when', 'the', 'brownian', 'motion', 'is', 'replaced', 'by', 'an', 'adapted', 'perturbation', 'of', 'identity', 'this', 'latter', 'result', 'gives', 'the', 'solution', 'of', 'the', 'causal', 'mongeampere', 'equation']] | [-0.12953921655270087, 0.10680585701708536, -0.07764186102757527, 0.018761930215141605, -0.09083725354236782, -0.1501786088701456, -0.03494969771427524, 0.3130290922916429, -0.3480194064901228, -0.14113647803800644, 0.12284426579168838, -0.2807580009162141, -0.10549764282657367, 0.162788687266445, -0.11622931027879856, 0.021533599675033883, 0.03804911441128155, 0.07509745578400222, -0.026386094708173612, -0.21068949162719808, 0.3314667915788948, -0.04494700487109886, 0.17163403606884609, 0.0045451451712851506, 0.17546513528936797, 0.008605761291862577, 0.02383152463111528, -0.014709274812674174, -0.21515820172661138, 0.0668336571254293, 0.21060203705101635, 0.08819749967341911, 0.31026421688555644, -0.3637529858299027, -0.1550605356616152, 0.20345155197154186, 0.148999694352013, -0.005043879926210614, -0.020600199544428592, -0.3118709269911051, 0.0949820805501169, -0.11206518376103727, -0.19587836511563628, -0.03521681823738062, 0.06016772315884899, 0.0385553492974656, -0.40408723638244687, 0.0832329782993595, 0.15316016429881002, 0.0064217674532596756, -0.07286875791088411, -0.09739086584775311, -0.007956018330303917, 0.053589873973340994, 0.0006654059900353502, 0.11627499473571873, 0.061049446531802797, -0.0517981932305725, -0.11229050556823587, 0.3771952667279513, -0.13449119630634523, -0.31828603468343, 0.10861694607676071, -0.1907841970544949, -0.14176615260268569, 0.11267791234941524, 0.12561264410607553, 0.12469450832540348, -0.17225674395703422, 0.19469058362486813, -0.08191091921417766, 0.11439870649082645, 0.06586088202775094, -0.016761543821309142, 0.07774500124841249, 0.13283490328337688, 0.1845760588151563, 0.11303391213718636, -0.011522933940483246, -0.09196749813024216, -0.3752449476842288, -0.21383477190018566, -0.1776863241473296, 0.19450957507375558, -0.12608524847315597, -0.20572419785508875, 0.26162505019782406, 0.11028640327647411, 0.1855853420272944, 0.07045554667548128, 0.1766559559731206, 0.2204576052034238, -0.03446014898356086, 0.05294964111678504, 0.09635762924886053, 0.16123399379437753, 0.09582882461725337, -0.1655828392023375, 0.0749558029239582, 0.12422463154586352] |
1,802.06673 | Systems of Differential Algebraic Equations in Computational
Electromagnetics | Starting from space-discretisation of Maxwell's equations, various classical
formulations are proposed for the simulation of electromagnetic fields. They
differ in the phenomena considered as well as in the variables chosen for
discretisation. This contribution presents a literature survey of the most
common approximations and formulations with a focus on their structural
properties. The differential-algebraic character is discussed and quantified by
the differential index concept.
| math.NA physics.comp-ph | starting from spacediscretisation of maxwells equations various classical formulations are proposed for the simulation of electromagnetic fields they differ in the phenomena considered as well as in the variables chosen for discretisation this contribution presents a literature survey of the most common approximations and formulations with a focus on their structural properties the differentialalgebraic character is discussed and quantified by the differential index concept | [['starting', 'from', 'spacediscretisation', 'of', 'maxwells', 'equations', 'various', 'classical', 'formulations', 'are', 'proposed', 'for', 'the', 'simulation', 'of', 'electromagnetic', 'fields', 'they', 'differ', 'in', 'the', 'phenomena', 'considered', 'as', 'well', 'as', 'in', 'the', 'variables', 'chosen', 'for', 'discretisation', 'this', 'contribution', 'presents', 'a', 'literature', 'survey', 'of', 'the', 'most', 'common', 'approximations', 'and', 'formulations', 'with', 'a', 'focus', 'on', 'their', 'structural', 'properties', 'the', 'differentialalgebraic', 'character', 'is', 'discussed', 'and', 'quantified', 'by', 'the', 'differential', 'index', 'concept']] | [-0.10991859641517439, 0.060145444421481994, -0.0896858750059018, 0.07569321706920626, -0.08281409193480772, -0.06513454442814229, -0.019426283263970934, 0.32528608697392636, -0.28449318051848205, -0.32589906165819793, 0.12170608966086532, -0.2770084562371411, -0.15861944289552787, 0.23494385638170773, -0.057511197809603, 0.07003044189390031, 0.008469581929227662, 0.0068126810965911735, -0.08631316413696383, -0.19714052438558566, 0.3224158314248872, 0.015631848901865027, 0.2592756114900112, -0.019872462524781153, 0.11685509803808397, -0.004432703974464583, -0.09761794419988754, 0.07009941850981069, -0.1336260096776107, 0.09757865345962936, 0.2762019635429458, 0.11431390737804274, 0.26219855265189257, -0.41714015263058835, -0.24793597128951833, 0.019342612535212307, 0.0869631841593969, 0.11128259997164446, -0.06528813052841181, -0.2731588526614129, 0.04981377551568642, -0.12977291724925477, -0.14124024080644762, -0.04832775203607208, 0.0005125385147356797, 0.10124368591618443, -0.20379162163081918, 0.06440874679561054, 0.06672493560195324, 0.08277790659358578, -0.08285629878278881, -0.19446320743078277, 0.00043260829619294595, 0.11784230993084964, 0.07590543807646821, -0.04447587622359159, 0.09313481496203513, -0.16108740273020453, -0.13275108926944315, 0.4494591180294279, -0.04187371392571737, -0.2747739506497358, 0.19589692011239038, -0.07187070720459497, -0.1344922172304775, 0.08625095787953349, 0.1681401709626828, 0.1594990198722198, -0.18475264019613702, 0.08176314921140493, -0.01673078964213057, 0.11406718286138678, 0.028147431644832806, 0.07297461370508822, 0.15279032142152862, 0.13251343141827318, 0.0026762885085883596, 0.14525246134560024, -0.01267236244258663, -0.162031869899245, -0.3392826461839297, -0.10949600973565664, -0.16489419966403926, 0.009432206373839151, -0.06809331008925154, -0.17742534953775624, 0.38458889651866185, 0.16269271887583836, 0.14124888611499162, 0.02104891315546064, 0.2751221594397008, 0.16330373756095973, 0.05083606938003666, 0.024491865261797866, 0.27341206072430524, 0.19335290463271712, 0.1456751018126924, -0.1875109909220584, 0.07177174929159856, 0.09529020613251579] |
1,802.06674 | On a notion of anticanonical class for families of convex polytopes | The purpose of this note is to give a generalization of the statement that
the anticanonical class of a (smooth) projective toric variety is the sum of
invariant prime divisors, corresponding to the rays in its fan (or facets in
its polytope), to some other classes of varieties with algebraic group actions.
To this end, we suggest an analogue of the notion of anticanonical class (of a
compact complex manifold) for linear families of convex polytopes. This is
inspired by the Serre duality for smooth projective varieties as well as the
Ehrhart-Macdonald reciprocity for rational polytopes. The main examples we have
in mind are: (1) The family of polytopes normal to a given fan (which
corresponds to the case of toric varieties). (2) The family of Gelfand-Zetlin
polytopes (which corresponds to the case of the flag variety). (3) The family
of Newton-Okounkov polytopes for a (smooth) group compactification.
| math.AG | the purpose of this note is to give a generalization of the statement that the anticanonical class of a smooth projective toric variety is the sum of invariant prime divisors corresponding to the rays in its fan or facets in its polytope to some other classes of varieties with algebraic group actions to this end we suggest an analogue of the notion of anticanonical class of a compact complex manifold for linear families of convex polytopes this is inspired by the serre duality for smooth projective varieties as well as the ehrhartmacdonald reciprocity for rational polytopes the main examples we have in mind are 1 the family of polytopes normal to a given fan which corresponds to the case of toric varieties 2 the family of gelfandzetlin polytopes which corresponds to the case of the flag variety 3 the family of newtonokounkov polytopes for a smooth group compactification | [['the', 'purpose', 'of', 'this', 'note', 'is', 'to', 'give', 'a', 'generalization', 'of', 'the', 'statement', 'that', 'the', 'anticanonical', 'class', 'of', 'a', 'smooth', 'projective', 'toric', 'variety', 'is', 'the', 'sum', 'of', 'invariant', 'prime', 'divisors', 'corresponding', 'to', 'the', 'rays', 'in', 'its', 'fan', 'or', 'facets', 'in', 'its', 'polytope', 'to', 'some', 'other', 'classes', 'of', 'varieties', 'with', 'algebraic', 'group', 'actions', 'to', 'this', 'end', 'we', 'suggest', 'an', 'analogue', 'of', 'the', 'notion', 'of', 'anticanonical', 'class', 'of', 'a', 'compact', 'complex', 'manifold', 'for', 'linear', 'families', 'of', 'convex', 'polytopes', 'this', 'is', 'inspired', 'by', 'the', 'serre', 'duality', 'for', 'smooth', 'projective', 'varieties', 'as', 'well', 'as', 'the', 'ehrhartmacdonald', 'reciprocity', 'for', 'rational', 'polytopes', 'the', 'main', 'examples', 'we', 'have', 'in', 'mind', 'are', '1', 'the', 'family', 'of', 'polytopes', 'normal', 'to', 'a', 'given', 'fan', 'which', 'corresponds', 'to', 'the', 'case', 'of', 'toric', 'varieties', '2', 'the', 'family', 'of', 'gelfandzetlin', 'polytopes', 'which', 'corresponds', 'to', 'the', 'case', 'of', 'the', 'flag', 'variety', '3', 'the', 'family', 'of', 'newtonokounkov', 'polytopes', 'for', 'a', 'smooth', 'group', 'compactification']] | [-0.15570639207883663, 0.01381313094149133, -0.07753025382958553, 0.07525411452091224, -0.11958607514955204, -0.1148573352948989, -0.02072158270056133, 0.29824054355707924, -0.3537871215895221, -0.2075057963026936, 0.11026812954160788, -0.2530187794032532, -0.17466573748026495, 0.19975121743265992, -0.2330474782470815, 0.005876140646177117, -0.002374271141692392, 0.06186191858944005, -0.1256924906062793, -0.34307080317867567, 0.4743048551656004, -0.0478731309302856, 0.23259006215674752, 0.0596576097131883, 0.1331740770382001, -0.008371968225047394, 0.04726004757528269, 0.005711653411413568, -0.1296117035501477, 0.18945100119123487, 0.3360738769878407, 0.11819419578170857, 0.16881203558295965, -0.3379873540567083, -0.13290769711917116, 0.23075847984354542, 0.08745131988276576, 0.062250648817122986, -0.002767099662230828, -0.20774118283234938, 0.08844346381099329, -0.1509909225829147, -0.24664683573300372, -0.05343667781483885, 0.05070298043240139, 0.03639250579667655, -0.23533887720691996, -0.0654026782832335, 0.12186275584590968, 0.16771051143596932, -0.013730874373199971, -0.11162774211874962, -0.06178378902778432, 0.022674861220907217, 0.009416954971006693, 0.07333675429313066, 0.06365904310852685, -0.0964975464173492, -0.15492043290224328, 0.40457859551384606, 0.0028588562335416273, -0.2483512418992767, 0.14053070509564006, -0.17385510899397116, -0.1520060117032404, 0.18133031934377034, 0.1466361204837921, 0.1925479034842873, -0.020615026990354463, 0.11833608418552054, -0.1714576604930256, -0.014031431645570273, 0.0857306038363006, -0.003395347881156045, 0.16299684539537979, 0.11986485442045976, 0.0821930293632495, 0.169573907806881, -0.010295892263309576, -0.061792008187055485, -0.37790862219156446, -0.20482194879583107, -0.14034249759719683, 0.1771363285370171, -0.12054653346343469, -0.1752836578273894, 0.4093645326415631, -0.01536854640329005, 0.21117501970493813, 0.15216140596454056, 0.19633661669905525, -0.011422408288470595, 0.03337583032033935, 0.018823150187460204, 0.1480075665292404, 0.2121967293756284, -0.045098014839773846, -0.12074743735059668, -0.016446425251086947, 0.20089601254015155] |
1,802.06675 | Multi-Valley Superconductivity In Ion-Gated MoS2 Layers | Layers of transition metal dichalcogenides (TMDs) combine the enhanced
effects of correlations associated with the two-dimensional limit with
electrostatic control over their phase transitions by means of an electric
field. Several semiconducting TMDs, such as MoS$_2$, develop superconductivity
(SC) at their surface when doped with an electrostatic field, but the mechanism
is still debated. It is often assumed that Cooper pairs reside only in the two
electron pockets at the K/K' points of the Brillouin Zone. However,
experimental and theoretical results suggest that a multi-valley Fermi surface
(FS) is associated with the SC state, involving 6 electron pockets at the Q/Q'
points. Here, we perform low-temperature transport measurements in ion-gated
MoS$_2$ flakes. We show that a fully multi-valley FS is associated with the SC
onset. The Q/Q' valleys fill for doping$\gtrsim2\cdot10^{13}$cm$^{-2}$, and the
SC transition does not appear until the Fermi level crosses both spin-orbit
split sub-bands Q$_1$ and Q$_2$. The SC state is associated with the FS
connectivity and promoted by a Lifshitz transition due to the simultaneous
population of multiple electron pockets. This FS topology will serve as a
guideline in the quest for new superconductors.
| cond-mat.supr-con cond-mat.mes-hall cond-mat.mtrl-sci | layers of transition metal dichalcogenides tmds combine the enhanced effects of correlations associated with the twodimensional limit with electrostatic control over their phase transitions by means of an electric field several semiconducting tmds such as mos_2 develop superconductivity sc at their surface when doped with an electrostatic field but the mechanism is still debated it is often assumed that cooper pairs reside only in the two electron pockets at the kk points of the brillouin zone however experimental and theoretical results suggest that a multivalley fermi surface fs is associated with the sc state involving 6 electron pockets at the qq points here we perform lowtemperature transport measurements in iongated mos_2 flakes we show that a fully multivalley fs is associated with the sc onset the qq valleys fill for dopinggtrsim2cdot1013cm2 and the sc transition does not appear until the fermi level crosses both spinorbit split subbands q_1 and q_2 the sc state is associated with the fs connectivity and promoted by a lifshitz transition due to the simultaneous population of multiple electron pockets this fs topology will serve as a guideline in the quest for new superconductors | [['layers', 'of', 'transition', 'metal', 'dichalcogenides', 'tmds', 'combine', 'the', 'enhanced', 'effects', 'of', 'correlations', 'associated', 'with', 'the', 'twodimensional', 'limit', 'with', 'electrostatic', 'control', 'over', 'their', 'phase', 'transitions', 'by', 'means', 'of', 'an', 'electric', 'field', 'several', 'semiconducting', 'tmds', 'such', 'as', 'mos_2', 'develop', 'superconductivity', 'sc', 'at', 'their', 'surface', 'when', 'doped', 'with', 'an', 'electrostatic', 'field', 'but', 'the', 'mechanism', 'is', 'still', 'debated', 'it', 'is', 'often', 'assumed', 'that', 'cooper', 'pairs', 'reside', 'only', 'in', 'the', 'two', 'electron', 'pockets', 'at', 'the', 'kk', 'points', 'of', 'the', 'brillouin', 'zone', 'however', 'experimental', 'and', 'theoretical', 'results', 'suggest', 'that', 'a', 'multivalley', 'fermi', 'surface', 'fs', 'is', 'associated', 'with', 'the', 'sc', 'state', 'involving', '6', 'electron', 'pockets', 'at', 'the', 'qq', 'points', 'here', 'we', 'perform', 'lowtemperature', 'transport', 'measurements', 'in', 'iongated', 'mos_2', 'flakes', 'we', 'show', 'that', 'a', 'fully', 'multivalley', 'fs', 'is', 'associated', 'with', 'the', 'sc', 'onset', 'the', 'qq', 'valleys', 'fill', 'for', 'dopinggtrsim2cdot1013cm2', 'and', 'the', 'sc', 'transition', 'does', 'not', 'appear', 'until', 'the', 'fermi', 'level', 'crosses', 'both', 'spinorbit', 'split', 'subbands', 'q_1', 'and', 'q_2', 'the', 'sc', 'state', 'is', 'associated', 'with', 'the', 'fs', 'connectivity', 'and', 'promoted', 'by', 'a', 'lifshitz', 'transition', 'due', 'to', 'the', 'simultaneous', 'population', 'of', 'multiple', 'electron', 'pockets', 'this', 'fs', 'topology', 'will', 'serve', 'as', 'a', 'guideline', 'in', 'the', 'quest', 'for', 'new', 'superconductors']] | [-0.18308925716393817, 0.21051150871042965, -0.02522210239178755, 0.05926441339736077, -0.016917517971506413, -0.1765464502063027, 0.114573456277264, 0.39533831952587967, -0.24453609455675684, -0.26122403808466016, -0.031442139945789815, -0.3511320787860469, -0.1248224503647058, 0.1652612946504219, 0.045387804336387685, -0.002190631719674656, -0.013520418697118978, -0.062343458072307276, -0.14119071450039625, -0.20266831683070913, 0.35119751611734457, 0.02888813779694352, 0.31888884888902147, 0.09913227282574072, 0.014555853358245788, -0.007435142503364042, 0.11996949385642447, -0.003520106707505364, -0.1361814271913512, 0.03043600159509227, 0.30938604951432763, -0.1096538458614645, 0.23874760143219786, -0.44713515268867826, -0.21488825757838387, -0.020200276698787663, 0.1657452886764777, 0.11379261811968576, -0.08499901514717646, -0.266928229988976, 0.05791617878482373, -0.1389518184313441, -0.10577637520693442, -0.06399609748632672, -0.031622567433206475, -0.024425309923985464, -0.23778667041339618, 0.06610335245165715, 0.05999432692169162, 0.04492804798438278, -0.06288915038492311, -0.11040836722555167, -0.10375744662680887, 0.057157512166055496, 0.06172153032584026, 0.09082192591255167, 0.13349643523959234, -0.11817478578781117, -0.10890902590036472, 0.370720887957589, -0.01570914541047445, -0.08376709444020043, 0.19462020424092538, -0.20334435373116383, -0.03846398017737755, 0.20579118337880642, 0.09078729233858898, 0.08685903202861867, -0.10293842815424573, 0.09460056177838481, -0.010475586101233482, 0.1363818905419635, 0.02537185709953388, 0.09850652090567637, 0.28793220248143064, 0.19029337992856807, 0.04735654135194811, 0.05112133228548748, -0.16009626789690856, -0.018126659832376848, -0.2408206896177234, -0.1778555141418256, -0.2105279037838473, 0.040061704247998806, -0.009449988582736768, -0.19288138544216832, 0.4162301676158599, 0.09889200813869103, 0.2289920262693562, -0.06352452725485803, 0.21546378345004616, 0.10806986993803758, 0.08207073545501752, 0.07957601678550846, 0.2341752373015777, 0.1312101024880328, 0.07844154122920538, -0.27464873265763895, 0.046224824526100695, 0.015795537506548916] |
1,802.06676 | A Simple Parallel and Distributed Sampling Technique: Local Glauber
Dynamics | \emph{Sampling} constitutes an important tool in a variety of areas: from
machine learning and combinatorial optimization to computational physics and
biology. A central class of sampling algorithms is the \emph{Markov Chain Monte
Carlo} method, based on the construction of a Markov chain with the desired
sampling distribution as its stationary distribution. Many of the traditional
Markov chains, such as the \emph{Glauber dynamics}, do not scale well with
increasing dimension. To address this shortcoming, we propose a simple local
update rule based on the Glauber dynamics that leads to efficient parallel and
distributed algorithms for sampling from Gibbs distributions.
Concretely, we present a Markov chain that mixes in $O(\log n)$ rounds when
Dobrushin's condition for the Gibbs distribution is satisfied. This improves
over the \emph{LubyGlauber} algorithm by Feng, Sun, and Yin [PODC'17], which
needs $O(\Delta \log n)$ rounds, and their \emph{LocalMetropolis} algorithm,
which converges in $O(\log n)$ rounds but requires a considerably stronger
mixing condition. Here, $n$ denotes the number of nodes in the graphical model
inducing the Gibbs distribution, and $\Delta$ its maximum degree. In
particular, our method can sample a uniform proper coloring with $\alpha
\Delta$ colors in $O(\log n)$ rounds for any $\alpha>2$, which almost matches
the threshold of the sequential Glauber dynamics and improves on the $\alpha>2
+\sqrt{2}$ threshold of Feng et al.
| cs.DS | emphsampling constitutes an important tool in a variety of areas from machine learning and combinatorial optimization to computational physics and biology a central class of sampling algorithms is the emphmarkov chain monte carlo method based on the construction of a markov chain with the desired sampling distribution as its stationary distribution many of the traditional markov chains such as the emphglauber dynamics do not scale well with increasing dimension to address this shortcoming we propose a simple local update rule based on the glauber dynamics that leads to efficient parallel and distributed algorithms for sampling from gibbs distributions concretely we present a markov chain that mixes in olog n rounds when dobrushins condition for the gibbs distribution is satisfied this improves over the emphlubyglauber algorithm by feng sun and yin podc17 which needs odelta log n rounds and their emphlocalmetropolis algorithm which converges in olog n rounds but requires a considerably stronger mixing condition here n denotes the number of nodes in the graphical model inducing the gibbs distribution and delta its maximum degree in particular our method can sample a uniform proper coloring with alpha delta colors in olog n rounds for any alpha2 which almost matches the threshold of the sequential glauber dynamics and improves on the alpha2 sqrt2 threshold of feng et al | [['emphsampling', 'constitutes', 'an', 'important', 'tool', 'in', 'a', 'variety', 'of', 'areas', 'from', 'machine', 'learning', 'and', 'combinatorial', 'optimization', 'to', 'computational', 'physics', 'and', 'biology', 'a', 'central', 'class', 'of', 'sampling', 'algorithms', 'is', 'the', 'emphmarkov', 'chain', 'monte', 'carlo', 'method', 'based', 'on', 'the', 'construction', 'of', 'a', 'markov', 'chain', 'with', 'the', 'desired', 'sampling', 'distribution', 'as', 'its', 'stationary', 'distribution', 'many', 'of', 'the', 'traditional', 'markov', 'chains', 'such', 'as', 'the', 'emphglauber', 'dynamics', 'do', 'not', 'scale', 'well', 'with', 'increasing', 'dimension', 'to', 'address', 'this', 'shortcoming', 'we', 'propose', 'a', 'simple', 'local', 'update', 'rule', 'based', 'on', 'the', 'glauber', 'dynamics', 'that', 'leads', 'to', 'efficient', 'parallel', 'and', 'distributed', 'algorithms', 'for', 'sampling', 'from', 'gibbs', 'distributions', 'concretely', 'we', 'present', 'a', 'markov', 'chain', 'that', 'mixes', 'in', 'olog', 'n', 'rounds', 'when', 'dobrushins', 'condition', 'for', 'the', 'gibbs', 'distribution', 'is', 'satisfied', 'this', 'improves', 'over', 'the', 'emphlubyglauber', 'algorithm', 'by', 'feng', 'sun', 'and', 'yin', 'podc17', 'which', 'needs', 'odelta', 'log', 'n', 'rounds', 'and', 'their', 'emphlocalmetropolis', 'algorithm', 'which', 'converges', 'in', 'olog', 'n', 'rounds', 'but', 'requires', 'a', 'considerably', 'stronger', 'mixing', 'condition', 'here', 'n', 'denotes', 'the', 'number', 'of', 'nodes', 'in', 'the', 'graphical', 'model', 'inducing', 'the', 'gibbs', 'distribution', 'and', 'delta', 'its', 'maximum', 'degree', 'in', 'particular', 'our', 'method', 'can', 'sample', 'a', 'uniform', 'proper', 'coloring', 'with', 'alpha', 'delta', 'colors', 'in', 'olog', 'n', 'rounds', 'for', 'any', 'alpha2', 'which', 'almost', 'matches', 'the', 'threshold', 'of', 'the', 'sequential', 'glauber', 'dynamics', 'and', 'improves', 'on', 'the', 'alpha2', 'sqrt2', 'threshold', 'of', 'feng', 'et', 'al']] | [-0.10703415365533833, 0.15701740632282035, -0.07532601985941204, 0.0585043860515931, -0.045583348973865075, -0.1817368856633416, 0.11058707674251395, 0.38251267083621815, -0.28011295859227486, -0.349661876580388, 0.05669613676541046, -0.24005751105306564, -0.11026616667217207, 0.13997336931774867, -0.07558443226284822, 0.0848533807641976, 0.0749925613218813, 0.036933824494656806, -0.02040206537334735, -0.271196117132621, 0.2310276584120968, 0.07360781501003383, 0.26625664530537213, -0.011442567582048898, 0.10501053079716721, 0.06709522248830872, 0.007505248417695632, -0.01660186787715779, -0.15749995980692097, 0.07276090779253896, 0.20684770220793994, 0.1650322784498369, 0.296236213962196, -0.3749773613777369, -0.18032577279216572, 0.16969451824102094, 0.1930290680649945, 0.1088730910367921, -0.0001346387066834448, -0.21842540255286466, 0.06997531847281487, -0.13903169295887016, -0.09150481450630633, -0.05119562415704834, 0.005297359914896694, 0.03568910030463605, -0.34346431727907706, 0.04265732074239871, 0.09604673638098592, 0.04053280171982171, 0.055882260161627714, -0.15898908409597529, 0.015275605920183842, 0.07161783301180892, -0.0024968952166777598, 0.088107136589967, 0.09516580335967208, -0.10080739754946234, -0.15642545549506498, 0.3259214815081818, -0.05960773029320715, -0.18441992302376883, 0.15511118170691607, -0.08504500159145913, -0.21321221481007085, 0.12342472061408323, 0.13918494609764442, 0.17516800746945488, -0.10329936738577639, 0.16283490950321858, -0.05757528495148949, 0.1633600916935599, 0.046471368921217775, -0.002435929681183243, 0.06627495518450643, 0.17602897330652922, 0.13556828799318163, 0.12587282955339002, -0.054929302264013734, -0.1743650633684153, -0.2774202374759007, -0.14072063863115442, -0.24191759431840115, 0.056221720816434104, -0.16565709746667054, -0.18025544515529754, 0.33562193412491875, 0.15319125252826007, 0.21355632343425587, 0.14814675862204618, 0.2804030172157822, 0.09088386559171409, -0.0011936086872460778, 0.16249669765842692, 0.11043711779814847, 0.13276820652349414, 0.059656017824001435, -0.20977811000907337, 0.12545285559435626, 0.11565635096993437] |
1,802.06677 | Degeneration in VAE: in the Light of Fisher Information Loss | While enormous progress has been made to Variational Autoencoder (VAE) in
recent years, similar to other deep networks, VAE with deep networks suffers
from the problem of degeneration, which seriously weakens the correlation
between the input and the corresponding latent codes, deviating from the goal
of the representation learning. To investigate how degeneration affects VAE
from a theoretical perspective, we illustrate the information transmission in
VAE and analyze the intermediate layers of the encoders/decoders. Specifically,
we propose a Fisher Information measure for the layer-wise analysis. With such
measure, we demonstrate that information loss is ineluctable in feed-forward
networks and causes the degeneration in VAE. We show that skip connections in
VAE enable the preservation of information without changing the model
architecture. We call this class of VAE equipped with skip connections as SCVAE
and perform a range of experiments to show its advantages in information
preservation and degeneration mitigation.
| stat.ML cs.LG | while enormous progress has been made to variational autoencoder vae in recent years similar to other deep networks vae with deep networks suffers from the problem of degeneration which seriously weakens the correlation between the input and the corresponding latent codes deviating from the goal of the representation learning to investigate how degeneration affects vae from a theoretical perspective we illustrate the information transmission in vae and analyze the intermediate layers of the encodersdecoders specifically we propose a fisher information measure for the layerwise analysis with such measure we demonstrate that information loss is ineluctable in feedforward networks and causes the degeneration in vae we show that skip connections in vae enable the preservation of information without changing the model architecture we call this class of vae equipped with skip connections as scvae and perform a range of experiments to show its advantages in information preservation and degeneration mitigation | [['while', 'enormous', 'progress', 'has', 'been', 'made', 'to', 'variational', 'autoencoder', 'vae', 'in', 'recent', 'years', 'similar', 'to', 'other', 'deep', 'networks', 'vae', 'with', 'deep', 'networks', 'suffers', 'from', 'the', 'problem', 'of', 'degeneration', 'which', 'seriously', 'weakens', 'the', 'correlation', 'between', 'the', 'input', 'and', 'the', 'corresponding', 'latent', 'codes', 'deviating', 'from', 'the', 'goal', 'of', 'the', 'representation', 'learning', 'to', 'investigate', 'how', 'degeneration', 'affects', 'vae', 'from', 'a', 'theoretical', 'perspective', 'we', 'illustrate', 'the', 'information', 'transmission', 'in', 'vae', 'and', 'analyze', 'the', 'intermediate', 'layers', 'of', 'the', 'encodersdecoders', 'specifically', 'we', 'propose', 'a', 'fisher', 'information', 'measure', 'for', 'the', 'layerwise', 'analysis', 'with', 'such', 'measure', 'we', 'demonstrate', 'that', 'information', 'loss', 'is', 'ineluctable', 'in', 'feedforward', 'networks', 'and', 'causes', 'the', 'degeneration', 'in', 'vae', 'we', 'show', 'that', 'skip', 'connections', 'in', 'vae', 'enable', 'the', 'preservation', 'of', 'information', 'without', 'changing', 'the', 'model', 'architecture', 'we', 'call', 'this', 'class', 'of', 'vae', 'equipped', 'with', 'skip', 'connections', 'as', 'scvae', 'and', 'perform', 'a', 'range', 'of', 'experiments', 'to', 'show', 'its', 'advantages', 'in', 'information', 'preservation', 'and', 'degeneration', 'mitigation']] | [-0.04920624178752454, 0.008179940398927225, -0.09144378787636556, 0.09107043435388068, -0.10775669045884766, -0.16274249865799337, 0.06318361585255007, 0.4377767092538872, -0.3426484583209999, -0.2994293359901152, 0.056769638742332824, -0.30989936035680204, -0.2622185833059956, 0.12475195983456247, -0.15476444740213352, 0.06106271173740498, 0.11678061859266883, 0.05594338588668285, -0.14835318487579618, -0.22501298720551957, 0.3590831419427854, 0.06453563292735773, 0.3642381059613104, 0.04568477724417273, 0.1530129926049503, -0.00598131915604746, -0.028596228734288062, -0.0509689259366447, -0.09894402050367962, 0.19495859288380835, 0.2386260170602032, 0.2082906906552789, 0.31307789684600523, -0.44558119995997764, -0.3127472569750672, 0.1038997894738222, 0.12164191449237233, 0.11411786243725391, -0.005013989375879032, -0.3128296559349307, 0.06338175804656301, -0.18019903070494733, -0.011463318931763186, -0.13509425786842993, -0.06946402366864621, -0.006416233360682413, -0.2555253324602303, 0.03000849491532741, 0.0738065361605353, 0.02551805369423803, -0.0395235336382521, -0.08233145483442254, -0.03710975319011817, 0.13669714001573724, 0.058043499644751334, 0.06429598876511099, 0.06442969665875205, -0.2025615970110143, -0.11337908324699006, 0.28683989532795306, -0.0849828473779977, -0.18030748736094432, 0.15395444450503518, -0.06724384304991848, -0.1535648929857416, 0.07152556653788968, 0.22438300653310442, 0.06921836167473246, -0.11998361202485457, 0.024038375663253276, -0.010292849528628427, 0.13640565478645666, 0.04240798712645129, 0.07243443258119293, 0.13388099774051257, 0.24801450183401136, 0.033533942769281566, 0.1812237465877646, -0.16536990945806374, -0.10938543644639336, -0.20763318025274202, -0.14785133490993366, -0.16441340445591188, 0.03458113529219141, -0.086476032613801, -0.11181643397493816, 0.4016182587821842, 0.2228479436378473, 0.24649199902558247, 0.1081761298237079, 0.3012815102859325, 0.020275656768668292, 0.11613218264647986, 0.09470044661036416, 0.2234974563746348, 0.12444563281118266, 0.097968280392485, -0.16059875951897404, 0.0993885190369297, 0.014990778027945576] |
1,802.06678 | Large Scale Automated Forecasting for Monitoring Network Safety and
Security | Real time large scale streaming data pose major challenges to forecasting, in
particular defying the presence of human experts to perform the corresponding
analysis. We present here a class of models and methods used to develop an
automated, scalable and versatile system for large scale forecasting oriented
towards safety and security monitoring. Our system provides short and long term
forecasts and uses them to detect safety and security issues in relation with
multiple internet connected devices well in advance they might take place.
| stat.AP stat.CO stat.ML | real time large scale streaming data pose major challenges to forecasting in particular defying the presence of human experts to perform the corresponding analysis we present here a class of models and methods used to develop an automated scalable and versatile system for large scale forecasting oriented towards safety and security monitoring our system provides short and long term forecasts and uses them to detect safety and security issues in relation with multiple internet connected devices well in advance they might take place | [['real', 'time', 'large', 'scale', 'streaming', 'data', 'pose', 'major', 'challenges', 'to', 'forecasting', 'in', 'particular', 'defying', 'the', 'presence', 'of', 'human', 'experts', 'to', 'perform', 'the', 'corresponding', 'analysis', 'we', 'present', 'here', 'a', 'class', 'of', 'models', 'and', 'methods', 'used', 'to', 'develop', 'an', 'automated', 'scalable', 'and', 'versatile', 'system', 'for', 'large', 'scale', 'forecasting', 'oriented', 'towards', 'safety', 'and', 'security', 'monitoring', 'our', 'system', 'provides', 'short', 'and', 'long', 'term', 'forecasts', 'and', 'uses', 'them', 'to', 'detect', 'safety', 'and', 'security', 'issues', 'in', 'relation', 'with', 'multiple', 'internet', 'connected', 'devices', 'well', 'in', 'advance', 'they', 'might', 'take', 'place']] | [-0.14137717951313558, 0.02785323586063151, -0.048372763040733624, 0.08074530083910529, -0.10181900417342422, -0.18731584416769714, 0.03857336207629597, 0.38810894158051673, -0.2567140898072576, -0.3698878492486764, 0.16802590423830258, -0.26000497695226893, -0.1252395000627141, 0.23541626226471132, -0.1426827632028973, 0.1128714820875012, 0.08153367050255772, -0.01814792460638536, 0.013205757638136575, -0.23453102071197277, 0.257106829311205, 0.05603580229567835, 0.31965793352237487, 0.07597321667427938, 0.0821946158020544, 0.005365741984772843, -0.061669698736843574, -0.003928031505882202, -0.06942151674260218, 0.16463073996086436, 0.3419798198680717, 0.1794499957664724, 0.3485684564943055, -0.4885075728756836, -0.2147586876526475, 0.08973959226340773, 0.14363341531029017, 0.08181080456082541, -0.04258014703820269, -0.3215989793190755, 0.059057644512279926, -0.19899510333583836, -0.14431307826970327, -0.16517328171912266, 0.027186904753367585, -0.0005847534041358046, -0.2440025787127305, 0.027987579376077706, 0.004381385493002473, 0.079907925025257, -0.03976171721472175, -0.027082245435049557, 0.0652027141123292, 0.24744460097211132, 0.07028823464839573, 0.006934049780514226, 0.12963487552086184, -0.13952825417046447, -0.1387754276125546, 0.3840732987975724, -0.061229331368378485, -0.13974607057717955, 0.2349214557171182, -0.060304469384073495, -0.21879540198112288, 0.058708901808832786, 0.2948125738156847, 0.08964931236647339, -0.15784104894397846, -0.013493412262647895, 0.05313436801444335, 0.1999701324019985, -0.0357366989125464, 0.02393285457762968, 0.2344548018896077, 0.25365731321241575, 0.0829246899797525, 0.08672909997964659, -0.1052452737598046, -0.09070382871474307, -0.24707344499296027, -0.13787444919370204, -0.10527790268232305, 0.014324285506540123, -0.07515547145613896, -0.1847060834427914, 0.3593619278216936, 0.263855812465211, 0.14936904108757715, 0.08162471807999425, 0.3625542832516044, 0.054344254306023826, 0.11663616957502013, 0.10632222390408258, 0.17907817210126892, -0.0009727352354899947, 0.18974416328212582, -0.12865216589072742, 0.09836197129439518, -0.012104259989033622] |
1,802.06679 | Further results on random cubic planar graphs | We provide precise asymptotic estimates for the number of several classes of
labelled cubic planar graphs, and we analyze properties of such random graphs
under the uniform distribution. This model was first analyzed by Bodirsky et
al. (Random Structures Algorithms 2007). We revisit their work and obtain new
results on the enumeration of cubic planar graphs and on random cubic planar
graphs. In particular, we determine the exact probability of a random cubic
planar graph being connected, and we show that the distribution of the number
of triangles in random cubic planar graphs is asymptotically normal with linear
expectation and variance. To the best of our knowledge, this is the first time
one is able to determine the asymptotic distribution for the number of copies
of a fixed graph containing a cycle in classes of random planar graphs arising
from planar maps.
| math.CO | we provide precise asymptotic estimates for the number of several classes of labelled cubic planar graphs and we analyze properties of such random graphs under the uniform distribution this model was first analyzed by bodirsky et al random structures algorithms 2007 we revisit their work and obtain new results on the enumeration of cubic planar graphs and on random cubic planar graphs in particular we determine the exact probability of a random cubic planar graph being connected and we show that the distribution of the number of triangles in random cubic planar graphs is asymptotically normal with linear expectation and variance to the best of our knowledge this is the first time one is able to determine the asymptotic distribution for the number of copies of a fixed graph containing a cycle in classes of random planar graphs arising from planar maps | [['we', 'provide', 'precise', 'asymptotic', 'estimates', 'for', 'the', 'number', 'of', 'several', 'classes', 'of', 'labelled', 'cubic', 'planar', 'graphs', 'and', 'we', 'analyze', 'properties', 'of', 'such', 'random', 'graphs', 'under', 'the', 'uniform', 'distribution', 'this', 'model', 'was', 'first', 'analyzed', 'by', 'bodirsky', 'et', 'al', 'random', 'structures', 'algorithms', '2007', 'we', 'revisit', 'their', 'work', 'and', 'obtain', 'new', 'results', 'on', 'the', 'enumeration', 'of', 'cubic', 'planar', 'graphs', 'and', 'on', 'random', 'cubic', 'planar', 'graphs', 'in', 'particular', 'we', 'determine', 'the', 'exact', 'probability', 'of', 'a', 'random', 'cubic', 'planar', 'graph', 'being', 'connected', 'and', 'we', 'show', 'that', 'the', 'distribution', 'of', 'the', 'number', 'of', 'triangles', 'in', 'random', 'cubic', 'planar', 'graphs', 'is', 'asymptotically', 'normal', 'with', 'linear', 'expectation', 'and', 'variance', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'this', 'is', 'the', 'first', 'time', 'one', 'is', 'able', 'to', 'determine', 'the', 'asymptotic', 'distribution', 'for', 'the', 'number', 'of', 'copies', 'of', 'a', 'fixed', 'graph', 'containing', 'a', 'cycle', 'in', 'classes', 'of', 'random', 'planar', 'graphs', 'arising', 'from', 'planar', 'maps']] | [-0.13160200246517928, 0.1107809909071747, -0.020651729577417736, 0.01801360567497142, -0.08809345762874983, -0.05950966378687028, 0.05451948129044006, 0.3968856161014295, -0.22302174298043534, -0.3266252290382063, 0.10338809388824148, -0.2848825050439213, -0.18716902426168533, 0.16522139302802494, -0.08140718852642032, 0.09130918713365223, 0.05344885321658656, 0.07452347578704652, -0.016596709963419592, -0.30137698647433325, 0.29768431730876665, -0.026960562763761887, 0.24979691829165102, 0.012436918103919876, 0.0881542535334773, 0.06121993415438059, -0.026059225943139558, 0.08977013795872704, -0.19118315396154287, 0.12543083799176546, 0.17717264490148782, 0.09712966047161796, 0.17827943838915736, -0.4058648380254146, -0.17816194567278448, 0.18609965010218218, 0.06612966709416097, 0.1391844658974663, -0.01504952111732359, -0.22350307361183452, 0.1103251792497041, -0.08356257199972186, -0.14378850657532227, -0.019419728830771546, 0.02446562056364098, 0.07781042689851052, -0.2810202092129055, 0.013041526256260318, 0.13222024395642146, 0.03440338916892947, 0.04272171275847605, -0.12720182344225617, -0.013686883458408567, 0.141880922249033, -0.052581265849933605, -0.006903216497346261, 0.004649361278033737, -0.11386104575751847, -0.17838168747618166, 0.351684069972564, -0.036756906664969634, -0.17196340778757307, 0.15063816969427216, -0.15403661490614776, -0.2075296774732841, 0.11292835516186142, 0.20528701528854354, 0.16524623941079203, -0.14095213273408966, 0.15044424051056537, -0.10766981225329596, 0.1035493946294825, 0.12258834836506088, -0.030283346162243208, 0.11769051492397845, 0.13633415383503208, 0.09953790086544526, 0.2455970296442745, -0.043081056088878134, -0.08233668552063943, -0.275137988168379, -0.09821931297257937, -0.24872386773792424, 0.05540925183523656, -0.21581626631937262, -0.263501146575436, 0.44518251512461987, 0.10261124360676803, 0.2084928979887299, 0.13898721245497886, 0.22003659619097138, 0.0817672587827858, -0.0023958740147604594, 0.13266239399221583, 0.1683336934091156, 0.19178644955505839, 0.013116061074239477, -0.14055307347386498, 0.06784963441855262, 0.11761077969584247] |
1,802.0668 | Extension of Maschke's theorem | In the present article, we examine linear representations of finite
gyrogroups, following their group-counterparts. In particular, we prove the
celebrated theorem of Maschke for gyrogroups, along with its converse. This
suggests studying the left regular action of a gyrogroup $(G, \oplus)$ on the
function space $$ L^{\mathrm{gyr}}(G) = \{f\in L(G)\colon \forall a, x, y, z\in
G, f(a\oplus\mathrm{gyr}[x, y]z) = f(a\oplus z)\} $$ in a natural way, where
$L(G)$ is the space of all functions from $G$ into a field.
| math.RT | in the present article we examine linear representations of finite gyrogroups following their groupcounterparts in particular we prove the celebrated theorem of maschke for gyrogroups along with its converse this suggests studying the left regular action of a gyrogroup g oplus on the function space lmathrmgyrg fin lgcolon forall a x y zin g faoplusmathrmgyrx yz faoplus z in a natural way where lg is the space of all functions from g into a field | [['in', 'the', 'present', 'article', 'we', 'examine', 'linear', 'representations', 'of', 'finite', 'gyrogroups', 'following', 'their', 'groupcounterparts', 'in', 'particular', 'we', 'prove', 'the', 'celebrated', 'theorem', 'of', 'maschke', 'for', 'gyrogroups', 'along', 'with', 'its', 'converse', 'this', 'suggests', 'studying', 'the', 'left', 'regular', 'action', 'of', 'a', 'gyrogroup', 'g', 'oplus', 'on', 'the', 'function', 'space', 'lmathrmgyrg', 'fin', 'lgcolon', 'forall', 'a', 'x', 'y', 'zin', 'g', 'faoplusmathrmgyrx', 'yz', 'faoplus', 'z', 'in', 'a', 'natural', 'way', 'where', 'lg', 'is', 'the', 'space', 'of', 'all', 'functions', 'from', 'g', 'into', 'a', 'field']] | [-0.18143559373649104, 0.07042752465432776, -0.09530383743944444, 0.025748430258993593, -0.07636666263320617, -0.0876543234168951, 0.029449774853752126, 0.3647297813956227, -0.3304571286908218, -0.1343556453873004, 0.05451616019709036, -0.2618523821234703, -0.12683830077626876, 0.1937819667160511, -0.10124107154884508, -0.04799446255450935, 0.0025057910276310782, 0.10601142099393265, -0.10784452978654631, -0.23154286952423198, 0.32798089015164544, -0.10897901110750224, 0.175112587536153, 0.015503098017403058, 0.1598130006010511, 0.07598076980960156, -0.0004461266233452729, -0.03234929462445767, -0.20411639234849385, 0.08635167021836554, 0.2421310355753771, 0.11580027300930981, 0.30334308386580755, -0.3349973047418254, -0.15880304088017771, 0.1697296019244407, 0.13345048412281488, -0.03348148463160864, -0.039601625327486546, -0.27496275743469595, 0.1138840106582003, -0.13329084472996847, -0.1023833886454148, 0.011699215715218867, 0.11282800217990631, 0.02427420825032251, -0.28331630003438996, 0.031252264524144785, 0.14888948943199856, 0.0795072913435953, -0.020973858092578925, -0.11969927097005503, -0.07827302284671792, 0.06538719957960504, -0.007497471748917762, 0.15804550565912256, 0.02585484748040991, -0.09263382517466588, -0.06222934231295117, 0.4023200722544321, -0.11852628064474889, -0.18383246114743607, 0.10126061580543007, -0.2382801666722766, -0.1983059769396537, 0.02326131115800568, 0.11924620533827693, 0.18972932922520808, -0.05484275379151638, 0.2623633981615837, -0.15081080403178931, 0.08284414248773828, 0.06267495632969908, 0.020029772744913188, 0.15382253252235906, 0.11639731038428311, 0.09419988447002002, 0.13690061986978566, 0.018138968482214426, 0.06431918645144573, -0.37137027462678296, -0.2120501335710287, -0.124852604397373, 0.1366494934041319, -0.08377422068401107, -0.13534082317990917, 0.3722722157702914, 0.08552000259847513, 0.21529164451182753, 0.09422108641426478, 0.18907408615840332, 0.09191436457580754, 0.010431646020151675, 0.08387653111214084, 0.10263006104422467, 0.18809537929150144, 0.0002893977731998478, -0.15340858462732285, -0.025708971731364726, 0.16836649872628706] |
1,802.06681 | Maximum number of points on intersection of a cubic surface and a
non-degenerate Hermitian surface | In 1991 S{\o}rensen proposed a conjecture for the maximum number of points on
the intersection of a surface of degree $d$ and a non-degenerate Hermitian
surface in $\PP^3(\Fqt)$. The conjecture was proven to be true by Edoukou in
the case when $d=2$. In this paper, we prove that the conjecture is true for
$d=3$ and $q \ge 8$. We further determine the second highest number of rational
points on the intersection of a cubic surface and a non-degenerate Hermitian
surface. Finally, we classify all the cubic surfaces that admit the highest and
second highest number of points in common with a non-degenerate Hermitian
surface. This classifications disproves one of the conjectures proposed by
Edoukou, Ling and Xing.
| math.AG | in 1991 sorensen proposed a conjecture for the maximum number of points on the intersection of a surface of degree d and a nondegenerate hermitian surface in pp3fqt the conjecture was proven to be true by edoukou in the case when d2 in this paper we prove that the conjecture is true for d3 and q ge 8 we further determine the second highest number of rational points on the intersection of a cubic surface and a nondegenerate hermitian surface finally we classify all the cubic surfaces that admit the highest and second highest number of points in common with a nondegenerate hermitian surface this classifications disproves one of the conjectures proposed by edoukou ling and xing | [['in', '1991', 'sorensen', 'proposed', 'a', 'conjecture', 'for', 'the', 'maximum', 'number', 'of', 'points', 'on', 'the', 'intersection', 'of', 'a', 'surface', 'of', 'degree', 'd', 'and', 'a', 'nondegenerate', 'hermitian', 'surface', 'in', 'pp3fqt', 'the', 'conjecture', 'was', 'proven', 'to', 'be', 'true', 'by', 'edoukou', 'in', 'the', 'case', 'when', 'd2', 'in', 'this', 'paper', 'we', 'prove', 'that', 'the', 'conjecture', 'is', 'true', 'for', 'd3', 'and', 'q', 'ge', '8', 'we', 'further', 'determine', 'the', 'second', 'highest', 'number', 'of', 'rational', 'points', 'on', 'the', 'intersection', 'of', 'a', 'cubic', 'surface', 'and', 'a', 'nondegenerate', 'hermitian', 'surface', 'finally', 'we', 'classify', 'all', 'the', 'cubic', 'surfaces', 'that', 'admit', 'the', 'highest', 'and', 'second', 'highest', 'number', 'of', 'points', 'in', 'common', 'with', 'a', 'nondegenerate', 'hermitian', 'surface', 'this', 'classifications', 'disproves', 'one', 'of', 'the', 'conjectures', 'proposed', 'by', 'edoukou', 'ling', 'and', 'xing']] | [-0.1598241038849218, 0.07272855097656711, -0.04965014790037745, 0.017406841447952678, -0.01758993387205951, -0.16701607139813796, 0.05480961084239218, 0.30129786775235023, -0.21537005166082004, -0.26793157160608916, 0.08851513226022291, -0.2719774185046717, -0.1982634148781041, 0.19596296879707983, -0.10557942101609354, 0.03073501725795499, 0.02457804722188596, 0.07309698939258069, -0.09297105560095556, -0.38342284349103767, 0.37109451107027236, -0.020909081556295093, 0.2346614913099952, 0.11325917748648576, 0.08307064985938109, 0.03259570596805006, 0.023912004767018453, 0.00598797376120561, -0.14949249320629301, 0.1566883986448183, 0.22813690437428785, 0.08299150886300036, 0.21943827976652405, -0.3397989419958832, -0.17728532689190551, 0.16706574796453902, 0.0683273477246219, 0.07549497965731446, 0.0006555208421655392, -0.19282254713726343, 0.1669111769695423, -0.11242099551868466, -0.21679553492484907, -0.01176580815298254, 0.07038158957290937, 0.0007675936927594114, -0.22270754846874952, 0.02351105686996067, 0.12469718867112278, 0.10201150691545192, -0.05115846436666815, -0.12591296759752654, -0.09308395238354263, 0.06419923036331679, -0.017048316478745586, 0.054344890026473684, -0.033077502995933684, -0.100519657715044, -0.11064033851583015, 0.34805425473799306, -0.067007281913998, -0.18180261228821779, 0.15759057354329056, -0.18580852427699587, -0.144578893070534, 0.1549923476321917, 0.13596856378410993, 0.1636646512483263, -0.04848604268466404, 0.1406864015556047, -0.12666865461097473, 0.09290330615221408, 0.1520779407031736, -0.06495773671154063, 0.16749622305168918, 0.07166124046412542, 0.08623501309602145, 0.12449048086490254, -0.08651533534570613, -0.012671710159466193, -0.314557859853825, -0.23093458054088906, -0.24260605286843584, 0.08525967722750481, -0.10200636466623492, -0.15564855436484018, 0.39303407666126366, 0.06672124862834289, 0.22218338523076422, 0.06864318489342143, 0.19377571881928465, 0.07580805743897431, 0.0003465957951879031, 0.12472961419425382, 0.21427249080877295, 0.17028046603183866, -0.024541493807510847, -0.16066985816762194, -0.0019196966997952316, 0.12781383066944646] |
1,802.06682 | A Comment on the Scale Length Validity of the Position Dependent
Diffusion Coefficient Representation of Structural Heterogeneity | Experimental studies of the variation of the mean square displacement (MSD)
of a particle in a confined colloid suspension that exhibits density variations
on the scale length of the particle diameter are not in agreement with the
prediction that the spatial variation in MSD should mimic the spatial variation
in density. The predicted behavior is derived from the expectation that the MSD
of a particle depends on the system density and the assumption that the force
acting on a particle is a point function of position. The experimental data
come from studies of the MSDs of particles in narrow ribbon channels and
between narrowly spaced parallel plates, and from new data, reported herein, of
the radial and azimuthal MSDs of a colloid particle in a dense colloid
suspension confined to a small circular cavity. In each of these geometries a
dense colloid suspension exhibits pronounced density oscillations with spacing
of a particle diameter. We remove the discrepancy between prediction and
experiment using the Fisher-Methfessel interpretation of how local equilibrium
in an inhomogeneous system is maintained to argue that the force acting on a
particle is delocalized over a volume with radius equal to a particle diameter.
Our interpretation has relevance to the relationship between the scale of
inhomogeneity and the utility of translation of the particle MSD into a
position dependent diffusion coefficient, and to the use of a spatially
dependent diffusion coefficient to describe mass transport in a heterogeneous
system.
| cond-mat.soft | experimental studies of the variation of the mean square displacement msd of a particle in a confined colloid suspension that exhibits density variations on the scale length of the particle diameter are not in agreement with the prediction that the spatial variation in msd should mimic the spatial variation in density the predicted behavior is derived from the expectation that the msd of a particle depends on the system density and the assumption that the force acting on a particle is a point function of position the experimental data come from studies of the msds of particles in narrow ribbon channels and between narrowly spaced parallel plates and from new data reported herein of the radial and azimuthal msds of a colloid particle in a dense colloid suspension confined to a small circular cavity in each of these geometries a dense colloid suspension exhibits pronounced density oscillations with spacing of a particle diameter we remove the discrepancy between prediction and experiment using the fishermethfessel interpretation of how local equilibrium in an inhomogeneous system is maintained to argue that the force acting on a particle is delocalized over a volume with radius equal to a particle diameter our interpretation has relevance to the relationship between the scale of inhomogeneity and the utility of translation of the particle msd into a position dependent diffusion coefficient and to the use of a spatially dependent diffusion coefficient to describe mass transport in a heterogeneous system | [['experimental', 'studies', 'of', 'the', 'variation', 'of', 'the', 'mean', 'square', 'displacement', 'msd', 'of', 'a', 'particle', 'in', 'a', 'confined', 'colloid', 'suspension', 'that', 'exhibits', 'density', 'variations', 'on', 'the', 'scale', 'length', 'of', 'the', 'particle', 'diameter', 'are', 'not', 'in', 'agreement', 'with', 'the', 'prediction', 'that', 'the', 'spatial', 'variation', 'in', 'msd', 'should', 'mimic', 'the', 'spatial', 'variation', 'in', 'density', 'the', 'predicted', 'behavior', 'is', 'derived', 'from', 'the', 'expectation', 'that', 'the', 'msd', 'of', 'a', 'particle', 'depends', 'on', 'the', 'system', 'density', 'and', 'the', 'assumption', 'that', 'the', 'force', 'acting', 'on', 'a', 'particle', 'is', 'a', 'point', 'function', 'of', 'position', 'the', 'experimental', 'data', 'come', 'from', 'studies', 'of', 'the', 'msds', 'of', 'particles', 'in', 'narrow', 'ribbon', 'channels', 'and', 'between', 'narrowly', 'spaced', 'parallel', 'plates', 'and', 'from', 'new', 'data', 'reported', 'herein', 'of', 'the', 'radial', 'and', 'azimuthal', 'msds', 'of', 'a', 'colloid', 'particle', 'in', 'a', 'dense', 'colloid', 'suspension', 'confined', 'to', 'a', 'small', 'circular', 'cavity', 'in', 'each', 'of', 'these', 'geometries', 'a', 'dense', 'colloid', 'suspension', 'exhibits', 'pronounced', 'density', 'oscillations', 'with', 'spacing', 'of', 'a', 'particle', 'diameter', 'we', 'remove', 'the', 'discrepancy', 'between', 'prediction', 'and', 'experiment', 'using', 'the', 'fishermethfessel', 'interpretation', 'of', 'how', 'local', 'equilibrium', 'in', 'an', 'inhomogeneous', 'system', 'is', 'maintained', 'to', 'argue', 'that', 'the', 'force', 'acting', 'on', 'a', 'particle', 'is', 'delocalized', 'over', 'a', 'volume', 'with', 'radius', 'equal', 'to', 'a', 'particle', 'diameter', 'our', 'interpretation', 'has', 'relevance', 'to', 'the', 'relationship', 'between', 'the', 'scale', 'of', 'inhomogeneity', 'and', 'the', 'utility', 'of', 'translation', 'of', 'the', 'particle', 'msd', 'into', 'a', 'position', 'dependent', 'diffusion', 'coefficient', 'and', 'to', 'the', 'use', 'of', 'a', 'spatially', 'dependent', 'diffusion', 'coefficient', 'to', 'describe', 'mass', 'transport', 'in', 'a', 'heterogeneous', 'system']] | [-0.1205572090713152, 0.1939116903828714, -0.12300913234163696, 0.00679338217790549, 0.012076005793642253, -0.10408916411882577, -0.0025969746139404984, 0.37560373873760305, -0.2603094404645769, -0.28936972181933623, 0.04296984171911997, -0.2891206995739291, -0.11327086397601913, 0.15041132910264424, -0.03061147863821437, 0.03634759148165661, 0.0452152176265372, 0.0493199065492566, -0.05460387784114573, -0.15041066720732488, 0.26739195676345845, 0.07888980645608777, 0.27983319184277206, 0.07769613835116615, 0.13242105996080986, 0.017505489103435443, -0.015017130932149788, 0.10457925478112884, -0.15500639182801024, 0.10572658444677169, 0.133246385565144, 0.01658161989277384, 0.23479834458169838, -0.3924741370836273, -0.20304764427322272, 0.07853005033296843, 0.14219176121114288, 0.07765012083303494, -0.05523018832997574, -0.247762694361154, 0.019247627914107095, -0.11511517942417412, -0.1549586967060653, 0.01917489615540641, 0.07130757919706715, 0.07675584367728637, -0.25863182758718417, 0.16089185525343055, 0.019721003564579103, 0.068859499921867, -0.07928786234503302, -0.08079955895615663, -0.010495523958040091, 0.1201647558050657, 0.07174120437800108, 0.019683626658661524, 0.2262884241596718, -0.13240717270793995, -0.05979835350396267, 0.3899858901820456, -0.10335459935304243, -0.23574634930021907, 0.20326362972361192, -0.18940722826325024, -0.048349201820868375, 0.1618610376957804, 0.19115534005104565, 0.07642161475572114, -0.1177521670043158, 0.054826482622350646, -0.07197081891693718, 0.2330253113067253, 0.06917567783093545, -0.0008823924875287048, 0.22190109189444532, 0.19758175288297936, 0.07789318858607051, 0.11863737929161289, -0.16113771070182945, -0.14211283912785197, -0.29776552204663553, -0.1709483254797912, -0.238644664066184, 0.025965231729848406, -0.11179588524931508, -0.20157089525115832, 0.38212510930219046, 0.12565819747639276, 0.24212713887682186, 0.03738520095357671, 0.2550217900832649, 0.07259373219809882, 0.07941333006989831, 0.03680292513454333, 0.24880534140393137, 0.14163434390957264, 0.12526679077758066, -0.273451535544397, 0.043185243454839414, 0.02253236535761971] |
1,802.06683 | Unboundedness problems for languages of vector addition systems | A vector addition system (VAS) with an initial and a final marking and
transition labels induces a language. In part because the reachability problem
in VAS remains far from being well-understood, it is difficult to devise
decision procedures for such languages. This is especially true for checking
properties that state the existence of infinitely many words of a particular
shape. Informally, we call these \emph{unboundedness properties}. We present a
simple set of axioms for predicates that can express unboundedness properties.
Our main result is that such a predicate is decidable for VAS languages as soon
as it is decidable for regular languages. Among other results, this allows us
to show decidability of (i)~separability by bounded regular languages,
(ii)~unboundedness of occurring factors from a language $K$ with mild
conditions on $K$, and (iii)~universality of the set of factors.
| cs.FL | a vector addition system vas with an initial and a final marking and transition labels induces a language in part because the reachability problem in vas remains far from being wellunderstood it is difficult to devise decision procedures for such languages this is especially true for checking properties that state the existence of infinitely many words of a particular shape informally we call these emphunboundedness properties we present a simple set of axioms for predicates that can express unboundedness properties our main result is that such a predicate is decidable for vas languages as soon as it is decidable for regular languages among other results this allows us to show decidability of iseparability by bounded regular languages iiunboundedness of occurring factors from a language k with mild conditions on k and iiiuniversality of the set of factors | [['a', 'vector', 'addition', 'system', 'vas', 'with', 'an', 'initial', 'and', 'a', 'final', 'marking', 'and', 'transition', 'labels', 'induces', 'a', 'language', 'in', 'part', 'because', 'the', 'reachability', 'problem', 'in', 'vas', 'remains', 'far', 'from', 'being', 'wellunderstood', 'it', 'is', 'difficult', 'to', 'devise', 'decision', 'procedures', 'for', 'such', 'languages', 'this', 'is', 'especially', 'true', 'for', 'checking', 'properties', 'that', 'state', 'the', 'existence', 'of', 'infinitely', 'many', 'words', 'of', 'a', 'particular', 'shape', 'informally', 'we', 'call', 'these', 'emphunboundedness', 'properties', 'we', 'present', 'a', 'simple', 'set', 'of', 'axioms', 'for', 'predicates', 'that', 'can', 'express', 'unboundedness', 'properties', 'our', 'main', 'result', 'is', 'that', 'such', 'a', 'predicate', 'is', 'decidable', 'for', 'vas', 'languages', 'as', 'soon', 'as', 'it', 'is', 'decidable', 'for', 'regular', 'languages', 'among', 'other', 'results', 'this', 'allows', 'us', 'to', 'show', 'decidability', 'of', 'iseparability', 'by', 'bounded', 'regular', 'languages', 'iiunboundedness', 'of', 'occurring', 'factors', 'from', 'a', 'language', 'k', 'with', 'mild', 'conditions', 'on', 'k', 'and', 'iiiuniversality', 'of', 'the', 'set', 'of', 'factors']] | [-0.11703947312163568, 0.08883730136656773, -0.05643268952258211, 0.10670759719428852, -0.12973992417993627, -0.13261129107340275, 0.0846751358769694, 0.38080830879761535, -0.3220340621034454, -0.2676086904572085, 0.11817184244492616, -0.2490491914875583, -0.12499856138671923, 0.20207546448336802, -0.12190305540352163, 0.04851266272590125, 0.09466132346218578, 0.1035026200483308, -0.033413610465761585, -0.22771555064876275, 0.36064667125841726, -0.05721000081306338, 0.19887395893552698, 0.054354809963361436, 0.08128928202309442, -0.001304369873220199, 0.06327191800626583, 0.0558013027092736, -0.09819267089105574, 0.09753708741575115, 0.346504679811012, 0.25205604758295685, 0.29797287198497835, -0.3632892910251044, -0.141620561378987, 0.10651298019775939, 0.08873760837123246, 0.11621915669131436, 0.0042403425095266754, -0.27822048483850587, 0.13464391526689096, -0.14803919020367967, -0.08380696543381214, -0.09986080031813983, 0.08708145369642548, 0.006185098447927967, -0.2811480017932118, -0.007509384286778986, 0.17143953048590838, 0.06799555357538611, -0.05177020278095821, -0.08488319764849012, 0.0036466714376373623, 0.13566486206416853, 0.03904164632733323, 0.02837832804237093, 0.07795144577993822, -0.14705003823566817, -0.14774137575711524, 0.40029627826989145, -0.02085819796140873, -0.1958179894442621, 0.2572380649065949, -0.08590790430518021, -0.20158255084057136, 0.10018792701885104, 0.11519727206533369, 0.12666692761914397, -0.14844777859411293, 0.11887817051527756, -0.11966545173996374, 0.22733139020961507, 0.1187128974903809, 0.05582152851297051, 0.17896295460711295, 0.19317279740138665, 0.08994123092248574, 0.17788398497137486, 0.023395947452032363, -0.03433655690807933, -0.29956956858277545, -0.15517766597239593, -0.11395838956831765, 0.007955465710868961, -0.047095030365547665, -0.23041619228801333, 0.3616296062027139, 0.16125651892218598, 0.16129047056674062, 0.15051696240845927, 0.26061094162593545, 0.10350889032045764, 0.06983598937189445, 0.0710784988722911, 0.12683727635995, 0.0880467139860209, 0.0537640092989843, -0.13885008255930098, 0.16606083772096195, 0.07258258204365804] |
1,802.06684 | Quantum criticality of two-dimensional quantum magnets with long-range
interactions | We study the critical breakdown of two-dimensional quantum magnets in the
presence of algebraically decaying long-range interactions by investigating the
transverse-field Ising model on the square and triangular lattice. This is
achieved technically by combining perturbative continuous unitary
transformations with classical Monte Carlo simulations to extract high-order
series for the one-particle excitations in the high-field quantum paramagnet.
We find that the unfrustrated systems change from mean-field to
nearest-neighbor universality with continuously varying critical exponents,
while the system remains in the universality class of the nearest-neighbor
model in the frustrated cases independent of the long-range nature of the
interaction.
| cond-mat.str-el | we study the critical breakdown of twodimensional quantum magnets in the presence of algebraically decaying longrange interactions by investigating the transversefield ising model on the square and triangular lattice this is achieved technically by combining perturbative continuous unitary transformations with classical monte carlo simulations to extract highorder series for the oneparticle excitations in the highfield quantum paramagnet we find that the unfrustrated systems change from meanfield to nearestneighbor universality with continuously varying critical exponents while the system remains in the universality class of the nearestneighbor model in the frustrated cases independent of the longrange nature of the interaction | [['we', 'study', 'the', 'critical', 'breakdown', 'of', 'twodimensional', 'quantum', 'magnets', 'in', 'the', 'presence', 'of', 'algebraically', 'decaying', 'longrange', 'interactions', 'by', 'investigating', 'the', 'transversefield', 'ising', 'model', 'on', 'the', 'square', 'and', 'triangular', 'lattice', 'this', 'is', 'achieved', 'technically', 'by', 'combining', 'perturbative', 'continuous', 'unitary', 'transformations', 'with', 'classical', 'monte', 'carlo', 'simulations', 'to', 'extract', 'highorder', 'series', 'for', 'the', 'oneparticle', 'excitations', 'in', 'the', 'highfield', 'quantum', 'paramagnet', 'we', 'find', 'that', 'the', 'unfrustrated', 'systems', 'change', 'from', 'meanfield', 'to', 'nearestneighbor', 'universality', 'with', 'continuously', 'varying', 'critical', 'exponents', 'while', 'the', 'system', 'remains', 'in', 'the', 'universality', 'class', 'of', 'the', 'nearestneighbor', 'model', 'in', 'the', 'frustrated', 'cases', 'independent', 'of', 'the', 'longrange', 'nature', 'of', 'the', 'interaction']] | [-0.17448922179221193, 0.23331381009929641, -0.02602557275902803, 0.0567867550048597, 0.01206707796652098, -0.19010865085815287, 0.04247784030110556, 0.3334832079958038, -0.2776804380546495, -0.23166770440032136, 0.017762276133740967, -0.32727873869411345, -0.1166374547435541, 0.15647143892924853, 0.12053857549872933, 0.08348141852006012, -0.008021810277346142, -0.011119198697923246, -0.13582037570553698, -0.2372804671877577, 0.29334568542105205, 0.022556110572697102, 0.2821689106105846, 0.02608111452986011, 0.04087340359918165, 0.080565935057797, 0.09411227248837145, -0.005396596081092346, -0.15295260536702104, 0.046987600163651666, 0.20065004669417322, -0.09992448495689374, 0.1755882436029461, -0.40795932681660874, -0.24147644831456852, 0.10597812690729351, 0.1752298361662186, 0.16045793941082928, 0.00015499716748160368, -0.35015201220783043, 0.028393455847565616, -0.18089558186522703, -0.13975008530542254, -0.13344023633292135, -0.04120505967994734, 0.0400869146848278, -0.2619998132030727, 0.14683413611991064, 0.10305855885072022, 0.13684322091997886, -0.013241343140811185, -0.05800246515154497, 0.01588933606993179, 0.11172151670206756, 0.039401166917927256, 0.05615520675200969, 0.09987686780680503, -0.17171220543879864, -0.17930404549198492, 0.35869449483971966, -0.031000086892757336, -0.15862201212439686, 0.20346572436392307, -0.19929407464758475, -0.14587009634005324, 0.1343894116342904, 0.14030592437009137, 0.04509661502646738, -0.15365342106860208, 0.15810375072344737, -0.010847883042404237, 0.15923781135554274, -0.09828171279395417, -0.001170984825727587, 0.22243845904939713, 0.16132772296229947, 0.011946797533654513, 0.21960941920703164, -0.05659416316543962, -0.2607033928162513, -0.2863365123523589, -0.09780530054692407, -0.2744730543345213, 0.07292534687974471, -0.11445004757649944, -0.22031782326117463, 0.41159914422552196, 0.21052378514598655, 0.14431177102485482, 0.03312422328733136, 0.1897486841486653, 0.10278172164262102, 0.036845942073007475, 0.046785731429272163, 0.23083459547891907, 0.16331776500945644, 0.07931795233280911, -0.2951355183340267, 0.02994829574504829, 0.12317167842114458] |
1,802.06685 | New class of compact stars: Pion stars | We investigate the viability of a new type of compact star whose main
constituent is a Bose-Einstein condensate of charged pions. Several different
setups are considered, where a gas of charged leptons and neutrinos is also
present. The pionic equation of state is obtained from lattice QCD simulations
in the presence of an isospin chemical potential, and requires no modeling of
the nuclear force. The gravitationally bound configurations of these systems
are found by solving the Tolman-Oppenheimer-Volkov equations. We discuss weak
decays within the pion condensed phase and elaborate on the generation
mechanism of such objects.
| hep-ph astro-ph.HE hep-lat nucl-th | we investigate the viability of a new type of compact star whose main constituent is a boseeinstein condensate of charged pions several different setups are considered where a gas of charged leptons and neutrinos is also present the pionic equation of state is obtained from lattice qcd simulations in the presence of an isospin chemical potential and requires no modeling of the nuclear force the gravitationally bound configurations of these systems are found by solving the tolmanoppenheimervolkov equations we discuss weak decays within the pion condensed phase and elaborate on the generation mechanism of such objects | [['we', 'investigate', 'the', 'viability', 'of', 'a', 'new', 'type', 'of', 'compact', 'star', 'whose', 'main', 'constituent', 'is', 'a', 'boseeinstein', 'condensate', 'of', 'charged', 'pions', 'several', 'different', 'setups', 'are', 'considered', 'where', 'a', 'gas', 'of', 'charged', 'leptons', 'and', 'neutrinos', 'is', 'also', 'present', 'the', 'pionic', 'equation', 'of', 'state', 'is', 'obtained', 'from', 'lattice', 'qcd', 'simulations', 'in', 'the', 'presence', 'of', 'an', 'isospin', 'chemical', 'potential', 'and', 'requires', 'no', 'modeling', 'of', 'the', 'nuclear', 'force', 'the', 'gravitationally', 'bound', 'configurations', 'of', 'these', 'systems', 'are', 'found', 'by', 'solving', 'the', 'tolmanoppenheimervolkov', 'equations', 'we', 'discuss', 'weak', 'decays', 'within', 'the', 'pion', 'condensed', 'phase', 'and', 'elaborate', 'on', 'the', 'generation', 'mechanism', 'of', 'such', 'objects']] | [-0.13511784740512667, 0.22716831990828723, -0.06544774489157135, 0.09143045317008121, -0.02228150343580637, -0.10079033942990161, 0.0083539208668905, 0.30735926779501216, -0.18149486250088862, -0.2524610835146935, 0.018703214308819344, -0.29110511639737524, -0.044092722086740345, 0.12946556842750093, 0.0621008984768802, 0.04368653836233231, 0.0434444205990682, 0.022788758338720072, -0.06236944736641211, -0.20800862315809354, 0.40985554849127465, -0.0013535503070064199, 0.19494831915775043, 0.11174400804641967, 0.08020546297484543, -0.042305197867487244, -0.031033583407406695, -0.03356959040199096, -0.12200544304505456, 0.0657503589730671, 0.15036395011702552, 0.06981369564891793, 0.17395459003698002, -0.4361611149700669, -0.21597886569603966, 0.14087314801387643, 0.15961051126942039, 0.1697606106851405, -0.13192099051108622, -0.31881781469564885, 0.05538791947280212, -0.17983695352935078, -0.16319926238793414, -0.09802919407957233, 0.0025405625686592734, 0.0612431629706407, -0.2637653324927669, 0.09540957356239232, 0.003677835321771757, 0.008274426475206079, -0.10223747296064782, -0.17848803232967234, -0.008054633285307014, 0.05197773714341262, 0.052514310974705346, 0.01855549642884095, 0.15655812103007824, -0.20727628478683377, -0.10646026672717805, 0.4716106585304563, -0.045507332077249885, -0.17655863964561527, 0.2002287544455612, -0.12840310414261089, -0.11545222548011225, 0.12209976105562721, 0.17571706503986206, 0.14654241932051568, -0.20169871681719087, 0.07573073727265485, -0.07106373134593014, 0.17761489580152556, 0.03877983873996982, 0.060835203940465966, 0.27474686987504054, 0.21812595285397643, -0.008835359010845423, 0.1377080735352744, -0.08115420795850999, -0.13011252944609927, -0.33555610506543115, -0.1356355540513808, -0.13970304067091396, 0.06276754046363446, -0.06874634133373547, -0.12347187720782433, 0.3592068074697939, 0.08948202623772279, 0.17175215582634942, -0.046155122227598135, 0.29828319954685867, 0.10281882871398314, 0.028952992249590654, 0.04272124393416258, 0.29345564837179455, 0.19159643604507437, 0.1036410656646088, -0.291335596004501, -0.02389521729007053, 0.08666629606644467] |
1,802.06686 | On Local Distributed Sampling and Counting | In classic distributed graph problems, each instance on a graph specifies a
space of feasible solutions (e.g. all proper ($\Delta+1$)-list-colorings of the
graph), and the task of distributed algorithm is to construct a feasible
solution using local information.
We study distributed sampling and counting problems, in which each instance
specifies a joint distribution of feasible solutions. The task of distributed
algorithm is to sample from this joint distribution, or to locally measure the
volume of the probability space via the marginal probabilities. The latter task
is also known as inference, which is a local counterpart of counting.
For self-reducible classes of instances, the following equivalences are
established in the LOCAL model up to polylogarithmic factors:
$\bullet$ For all joint distributions, approximate inference and approximate
sampling are computationally equivalent.
$\bullet$ For all joint distributions defined by local constraints, exact
sampling is reducible to either one of the above tasks.
$\bullet$ If further, sequentially constructing a feasible solution is
trivial locally, then all above tasks are easy if and only if the joint
distribution exhibits strong spatial mixing.
Combining with the state of the arts of strong spatial mixing, we obtain
efficient sampling algorithms in the LOCAL model for various important sampling
problems, including: an $O(\sqrt{\Delta}\log^3n)$-round algorithm for exact
sampling matchings in graphs with maximum degree $\Delta$, and an
$O(\log^3n)$-round algorithm for sampling according to the hardcore model
(weighted independent sets) in the uniqueness regime, which along with the
$\Omega(\mathrm{diam})$ lower bound in arXiv:1702.00142 for sampling according
to the hardcore model in the non-uniqueness regime, gives the first
computational phase transition for distributed sampling.
| cs.DS cs.DC | in classic distributed graph problems each instance on a graph specifies a space of feasible solutions eg all proper delta1listcolorings of the graph and the task of distributed algorithm is to construct a feasible solution using local information we study distributed sampling and counting problems in which each instance specifies a joint distribution of feasible solutions the task of distributed algorithm is to sample from this joint distribution or to locally measure the volume of the probability space via the marginal probabilities the latter task is also known as inference which is a local counterpart of counting for selfreducible classes of instances the following equivalences are established in the local model up to polylogarithmic factors bullet for all joint distributions approximate inference and approximate sampling are computationally equivalent bullet for all joint distributions defined by local constraints exact sampling is reducible to either one of the above tasks bullet if further sequentially constructing a feasible solution is trivial locally then all above tasks are easy if and only if the joint distribution exhibits strong spatial mixing combining with the state of the arts of strong spatial mixing we obtain efficient sampling algorithms in the local model for various important sampling problems including an osqrtdeltalog3nround algorithm for exact sampling matchings in graphs with maximum degree delta and an olog3nround algorithm for sampling according to the hardcore model weighted independent sets in the uniqueness regime which along with the omegamathrmdiam lower bound in arxiv170200142 for sampling according to the hardcore model in the nonuniqueness regime gives the first computational phase transition for distributed sampling | [['in', 'classic', 'distributed', 'graph', 'problems', 'each', 'instance', 'on', 'a', 'graph', 'specifies', 'a', 'space', 'of', 'feasible', 'solutions', 'eg', 'all', 'proper', 'delta1listcolorings', 'of', 'the', 'graph', 'and', 'the', 'task', 'of', 'distributed', 'algorithm', 'is', 'to', 'construct', 'a', 'feasible', 'solution', 'using', 'local', 'information', 'we', 'study', 'distributed', 'sampling', 'and', 'counting', 'problems', 'in', 'which', 'each', 'instance', 'specifies', 'a', 'joint', 'distribution', 'of', 'feasible', 'solutions', 'the', 'task', 'of', 'distributed', 'algorithm', 'is', 'to', 'sample', 'from', 'this', 'joint', 'distribution', 'or', 'to', 'locally', 'measure', 'the', 'volume', 'of', 'the', 'probability', 'space', 'via', 'the', 'marginal', 'probabilities', 'the', 'latter', 'task', 'is', 'also', 'known', 'as', 'inference', 'which', 'is', 'a', 'local', 'counterpart', 'of', 'counting', 'for', 'selfreducible', 'classes', 'of', 'instances', 'the', 'following', 'equivalences', 'are', 'established', 'in', 'the', 'local', 'model', 'up', 'to', 'polylogarithmic', 'factors', 'bullet', 'for', 'all', 'joint', 'distributions', 'approximate', 'inference', 'and', 'approximate', 'sampling', 'are', 'computationally', 'equivalent', 'bullet', 'for', 'all', 'joint', 'distributions', 'defined', 'by', 'local', 'constraints', 'exact', 'sampling', 'is', 'reducible', 'to', 'either', 'one', 'of', 'the', 'above', 'tasks', 'bullet', 'if', 'further', 'sequentially', 'constructing', 'a', 'feasible', 'solution', 'is', 'trivial', 'locally', 'then', 'all', 'above', 'tasks', 'are', 'easy', 'if', 'and', 'only', 'if', 'the', 'joint', 'distribution', 'exhibits', 'strong', 'spatial', 'mixing', 'combining', 'with', 'the', 'state', 'of', 'the', 'arts', 'of', 'strong', 'spatial', 'mixing', 'we', 'obtain', 'efficient', 'sampling', 'algorithms', 'in', 'the', 'local', 'model', 'for', 'various', 'important', 'sampling', 'problems', 'including', 'an', 'osqrtdeltalog3nround', 'algorithm', 'for', 'exact', 'sampling', 'matchings', 'in', 'graphs', 'with', 'maximum', 'degree', 'delta', 'and', 'an', 'olog3nround', 'algorithm', 'for', 'sampling', 'according', 'to', 'the', 'hardcore', 'model', 'weighted', 'independent', 'sets', 'in', 'the', 'uniqueness', 'regime', 'which', 'along', 'with', 'the', 'omegamathrmdiam', 'lower', 'bound', 'in', 'arxiv170200142', 'for', 'sampling', 'according', 'to', 'the', 'hardcore', 'model', 'in', 'the', 'nonuniqueness', 'regime', 'gives', 'the', 'first', 'computational', 'phase', 'transition', 'for', 'distributed', 'sampling']] | [-0.09281027715848868, 0.07669689619185761, -0.0771532495685487, 0.07661144931008858, -0.07618946875065043, -0.1551839727636586, 0.08760836370042906, 0.401866140929395, -0.3148703672651361, -0.31502501955726964, 0.10982433350209567, -0.22571050820343108, -0.09008665271338931, 0.1661373687036524, -0.06924622490683187, 0.09269494604698024, 0.06563294282661396, 0.05484392446672348, -0.06038950910567078, -0.2450536278945961, 0.29060212927752677, 0.026719220712824437, 0.2949202826703221, -0.018622577895232792, 0.13722848397560042, 0.04167150755699159, -0.016796430819287375, 0.03113406397709632, -0.13591672307612368, 0.11285214944006984, 0.24187886860160018, 0.18227214762301286, 0.28162143363867403, -0.3517324784732954, -0.16890127956142453, 0.17483331951818243, 0.1479677141710082, 0.10334954442001575, -0.0051254140958733535, -0.2688222156424467, 0.10318430672410571, -0.11874406836010336, -0.061137032506675806, -0.07628063424780299, 0.019413349095456563, 0.0543422948800984, -0.3356988246512784, 0.07355399709817743, 0.06339319320196278, -0.008923560757813287, -0.044025172322720345, -0.1036238693396637, 0.018389738010376664, 0.12067129997924289, 0.002492067237395489, 0.04426195396242685, 0.0747451949411648, -0.13805175413457307, -0.14577274007182786, 0.3682059194686087, -0.0038257893872472677, -0.21583241875580575, 0.16050594492275486, -0.09908187489572493, -0.19222499046416713, 0.1529401286092047, 0.15351959147693495, 0.14257311521746682, -0.14580328771047266, 0.10107875593502169, -0.07777795604256195, 0.12828236691842168, 0.04707232526465453, 0.015074505912799548, 0.1433563751625151, 0.1657370593569129, 0.17869822561182808, 0.1548654820553955, -0.060619476916275714, -0.11788099154771997, -0.28402890501985983, -0.12030964830083091, -0.23647864390860387, -0.021026491903217967, -0.15405638100449603, -0.1954403879675391, 0.37661952064426957, 0.1481659787214191, 0.19754369509431755, 0.11519628783628157, 0.2935756867378225, 0.115201603814666, -0.004901385286746815, 0.13615316001663041, 0.15772338783828693, 0.11685757193957176, 0.015657718045136923, -0.15838705298693756, 0.08829563672850017, 0.0781798238090533] |
1,802.06687 | The role of intrinsic distances in the relaxation of
$L^\infty$-functionals | We consider a supremal functional of the form $$F(u)=\mathop{\rm ess\: sup
}_{x \in \Omega} f(x,Du(x))$$ where $\Omega\subseteq \mathbf {R}^N$ is a
regular bounded open set, $u\in W^{1,\infty}(\Omega)$ and $f$ is a Borel
function. Assuming that the intrinsic distances $d^{\lambda}_F(x,y):= \sup
\Big\{ u(x) - u(y): \, F(u)\leq \lambda \Big\}$ are locally equivalent to the
euclidean one for every $\lambda>\inf_{W^{1,\infty}(\Omega)} F$, we give a
description of the sublevel sets of the weak$^*$-lower semicontinuous envelope
of $F$ in terms of the sub-level sets of the difference quotient functionals
$R_{d^\lambda_F}(u):=\sup_{x\not =y} \frac{u(x)-u(y)}{d^\lambda_F(x,y)}. $ As a
consequence we prove that the relaxed functional of positive $1$-homogeneous
supremal functionals coincides with $R_{d^1_F}$. Moreover, for a more general
supremal functional $F$ (a priori non coercive), we prove that the sublevel
sets of its relaxed functionals with respect to the weak$^*$ topology, the
weak$^*$ convergence and the uniform convergence are convex. The proof of these
results relies both on a deep analysis of the intrinsic distances associated to
$F$ and on a careful use of variational tools such as $\Gamma$-convergence.
| math.OC math.FA | we consider a supremal functional of the form fumathoprm ess sup _x in omega fxdux where omegasubseteq mathbf rn is a regular bounded open set uin w1inftyomega and f is a borel function assuming that the intrinsic distances dlambda_fxy sup big ux uy fuleq lambda big are locally equivalent to the euclidean one for every lambdainf_w1inftyomega f we give a description of the sublevel sets of the weaklower semicontinuous envelope of f in terms of the sublevel sets of the difference quotient functionals r_dlambda_fusup_xnot y fracuxuydlambda_fxy as a consequence we prove that the relaxed functional of positive 1homogeneous supremal functionals coincides with r_d1_f moreover for a more general supremal functional f a priori non coercive we prove that the sublevel sets of its relaxed functionals with respect to the weak topology the weak convergence and the uniform convergence are convex the proof of these results relies both on a deep analysis of the intrinsic distances associated to f and on a careful use of variational tools such as gammaconvergence | [['we', 'consider', 'a', 'supremal', 'functional', 'of', 'the', 'form', 'fumathoprm', 'ess', 'sup', '_x', 'in', 'omega', 'fxdux', 'where', 'omegasubseteq', 'mathbf', 'rn', 'is', 'a', 'regular', 'bounded', 'open', 'set', 'uin', 'w1inftyomega', 'and', 'f', 'is', 'a', 'borel', 'function', 'assuming', 'that', 'the', 'intrinsic', 'distances', 'dlambda_fxy', 'sup', 'big', 'ux', 'uy', 'fuleq', 'lambda', 'big', 'are', 'locally', 'equivalent', 'to', 'the', 'euclidean', 'one', 'for', 'every', 'lambdainf_w1inftyomega', 'f', 'we', 'give', 'a', 'description', 'of', 'the', 'sublevel', 'sets', 'of', 'the', 'weaklower', 'semicontinuous', 'envelope', 'of', 'f', 'in', 'terms', 'of', 'the', 'sublevel', 'sets', 'of', 'the', 'difference', 'quotient', 'functionals', 'r_dlambda_fusup_xnot', 'y', 'fracuxuydlambda_fxy', 'as', 'a', 'consequence', 'we', 'prove', 'that', 'the', 'relaxed', 'functional', 'of', 'positive', '1homogeneous', 'supremal', 'functionals', 'coincides', 'with', 'r_d1_f', 'moreover', 'for', 'a', 'more', 'general', 'supremal', 'functional', 'f', 'a', 'priori', 'non', 'coercive', 'we', 'prove', 'that', 'the', 'sublevel', 'sets', 'of', 'its', 'relaxed', 'functionals', 'with', 'respect', 'to', 'the', 'weak', 'topology', 'the', 'weak', 'convergence', 'and', 'the', 'uniform', 'convergence', 'are', 'convex', 'the', 'proof', 'of', 'these', 'results', 'relies', 'both', 'on', 'a', 'deep', 'analysis', 'of', 'the', 'intrinsic', 'distances', 'associated', 'to', 'f', 'and', 'on', 'a', 'careful', 'use', 'of', 'variational', 'tools', 'such', 'as', 'gammaconvergence']] | [-0.1770450807956007, 0.03152819651884738, -0.07509709888583292, 0.113502268877563, -0.05401268661288278, -0.0895237523645903, 0.046902169745346035, 0.3462793545114883, -0.3347610620729718, -0.15294134006611368, 0.09197214544426811, -0.2953655620377441, -0.07781109707834928, 0.18817549184332052, -0.08880545340893466, 0.06178446814543655, 0.06653554882617053, 0.07593153006113741, -0.10340239721790002, -0.21065893098683044, 0.38815758629522706, -0.09853687119125736, 0.20396662280917954, 0.051453668010993776, 0.10701486128903, -0.030378721438215246, 0.05239574184282596, 0.053112584795305354, -0.20446742418498165, 0.17869597969045978, 0.24107424690393928, 0.14313152685229266, 0.35579769754701335, -0.37508298704521414, -0.14201125026078928, 0.16786410445520966, 0.07515928826601424, -0.046610319952231756, -0.011313863266827047, -0.2823442761549113, 0.142476949263769, -0.08000485435336457, -0.14056791062032956, -0.08325591319246414, 0.06867529495810129, 0.11186954186020291, -0.34126697290654046, 0.06985721147405158, 0.11362422173206481, 0.05643081766848238, -0.10979899165425912, -0.1344387730408564, -0.07544528375313218, 0.03273428703502098, 0.0051807816052138345, 0.14996134973585212, 0.06958674720231073, -0.038897928550422935, -0.023794363215218606, 0.32399578383828725, -0.1255360894275378, -0.2556671871317793, 0.18053858446952256, -0.16430266950024952, -0.14540466514520162, 0.0676503360433423, 0.10736618943328778, 0.17217545948274757, -0.11595171189907452, 0.2729382597720569, -0.05757764513641943, 0.13251429956669555, 0.08106301964972146, 0.06257289821269013, 0.0807367788138944, 0.1319901607814968, 0.20031795125477803, 0.119984582681151, -0.006942281285835928, -0.028352169334448826, -0.3871319662773785, -0.14235126216149663, -0.17607156500098822, 0.1286978809537528, -0.11275806175430973, -0.2594997286463955, 0.3042128689960224, 0.025426846492156294, 0.18392147039936751, 0.11868614853816743, 0.21787614573096215, 0.14237826730940645, -0.0022431812972200584, 0.07868524311943362, 0.14467524139569227, 0.17273294863938962, 0.010446745789499941, -0.17468402838704655, 0.05211112808482432, 0.12101198603304736] |
1,802.06688 | On the freeness of rational cuspidal plane curves | We bring additional support to the conjecture saying that a rational cuspidal
plane curve is either free or nearly free. This conjecture was confirmed for
curves of even degree, and in this note we prove it for many odd degrees. In
particular, we show that this conjecture holds for the curves of degree at most
34.
| math.AG math.AC | we bring additional support to the conjecture saying that a rational cuspidal plane curve is either free or nearly free this conjecture was confirmed for curves of even degree and in this note we prove it for many odd degrees in particular we show that this conjecture holds for the curves of degree at most 34 | [['we', 'bring', 'additional', 'support', 'to', 'the', 'conjecture', 'saying', 'that', 'a', 'rational', 'cuspidal', 'plane', 'curve', 'is', 'either', 'free', 'or', 'nearly', 'free', 'this', 'conjecture', 'was', 'confirmed', 'for', 'curves', 'of', 'even', 'degree', 'and', 'in', 'this', 'note', 'we', 'prove', 'it', 'for', 'many', 'odd', 'degrees', 'in', 'particular', 'we', 'show', 'that', 'this', 'conjecture', 'holds', 'for', 'the', 'curves', 'of', 'degree', 'at', 'most', '34']] | [-0.23087547152369683, 0.09714470145991072, -0.1422113722739076, 0.06128934745460616, -0.03939271595196, -0.16470604101362238, 0.02742319041863084, 0.35322006871657713, -0.2757460147279614, -0.27667266273471924, 0.06365088848230828, -0.26169360727154917, -0.1782530003235609, 0.2575828571363153, -0.11613164906988718, -0.025865128968559605, 0.07158385428400445, 0.06088655192538032, -0.01043893672509252, -0.3839828603169216, 0.3296928033232689, -0.0692790187895298, 0.1909338332313512, 0.132399571028405, 0.07749955563174028, 0.09180276647176859, 0.030390816208507334, -0.014342129845837397, -0.13586350955431822, 0.1405495929450678, 0.26020033767313827, 0.11149925324051375, 0.19146874969426012, -0.3439597105773698, -0.2040611764075168, 0.22559184003953955, 0.1326017974975652, 0.09947189866631691, -0.025129528429325938, -0.12656590137963317, 0.1681987303142835, -0.11069913805165145, -0.310480108334949, -0.03703906305599958, 0.040897130367479155, -0.03445902619776981, -0.22884094189586385, 0.04901276735056724, 0.15999494012378687, 0.18162413617912015, -0.05852162046773758, -0.10168939743224266, -0.04642127026038777, 0.050044627531730966, 0.04545473727713605, 0.06773072574287653, -0.04310218849319166, -0.12518718300270848, -0.0797038492414036, 0.35044887907237615, -0.038880279969557056, -0.15047165541909635, 0.14294623335756892, -0.21455436391157232, -0.21728904175272742, 0.12136303600189942, 0.08446617818637085, 0.1254367517207616, -0.024395036261661777, 0.09100001039145614, -0.13455860735017008, 0.16155636503078444, 0.17315524217805692, -0.041049882603277056, 0.1856926960005824, 0.028668356157140806, 0.08818693819817522, 0.13896653671898612, -0.035901045493249385, 0.0007566216933940138, -0.32989625454813776, -0.24091629978335863, -0.15824390315226214, 0.1164053767778179, -0.06492841513136227, -0.13004251479703402, 0.3650566785529788, 0.12307472797276985, 0.16187292029748537, 0.12993781055722917, 0.2049003679504884, 0.10122791873956365, 0.025317831480476474, 0.13067244622860535, 0.23303627682616934, 0.10821811721793242, -0.033183388819452375, -0.10341706210913669, 0.027841460866121843, 0.052315457624250224] |
1,802.06689 | Free energy landscape of sodium solvation into graphite | Na is known to deliver very low energy capacity for sodium intercalation
compared to Lithium. In this study, we use quantum mechanics based metadynamics
simulations to obtain the free energy landscape for sodium ion intercalation
from Dimethyl sulfoxide (DMSO) solvent into graphite. We find that the lowest
free energy minima from the metadynamics are associated with sodium solvated by
3 or 4 DMSO. The free energy minima of these states are activated by a free
energy of solvation computed to be 0.17 eV, which in turn are the most
thermodynamically stable. We observe weak interactions of sodium with graphite
sheets during the unbiased and biased molecular dynamics simulations. Our
simulations results indicate that solvent plays an important role in
stabilizing the sodium intercalation into graphite through shielding of the
sodium while modulating the interaction of the solvent with the graphite
sheets. In order to facilitate this intercalation, we propose solvents with
negatively charged groups and aromatic cores (e.g., cyclic ethers) that could
allow a greater rate of anion exchange to increase Na+ mobility.
| physics.chem-ph cond-mat.mtrl-sci | na is known to deliver very low energy capacity for sodium intercalation compared to lithium in this study we use quantum mechanics based metadynamics simulations to obtain the free energy landscape for sodium ion intercalation from dimethyl sulfoxide dmso solvent into graphite we find that the lowest free energy minima from the metadynamics are associated with sodium solvated by 3 or 4 dmso the free energy minima of these states are activated by a free energy of solvation computed to be 017 ev which in turn are the most thermodynamically stable we observe weak interactions of sodium with graphite sheets during the unbiased and biased molecular dynamics simulations our simulations results indicate that solvent plays an important role in stabilizing the sodium intercalation into graphite through shielding of the sodium while modulating the interaction of the solvent with the graphite sheets in order to facilitate this intercalation we propose solvents with negatively charged groups and aromatic cores eg cyclic ethers that could allow a greater rate of anion exchange to increase na mobility | [['na', 'is', 'known', 'to', 'deliver', 'very', 'low', 'energy', 'capacity', 'for', 'sodium', 'intercalation', 'compared', 'to', 'lithium', 'in', 'this', 'study', 'we', 'use', 'quantum', 'mechanics', 'based', 'metadynamics', 'simulations', 'to', 'obtain', 'the', 'free', 'energy', 'landscape', 'for', 'sodium', 'ion', 'intercalation', 'from', 'dimethyl', 'sulfoxide', 'dmso', 'solvent', 'into', 'graphite', 'we', 'find', 'that', 'the', 'lowest', 'free', 'energy', 'minima', 'from', 'the', 'metadynamics', 'are', 'associated', 'with', 'sodium', 'solvated', 'by', '3', 'or', '4', 'dmso', 'the', 'free', 'energy', 'minima', 'of', 'these', 'states', 'are', 'activated', 'by', 'a', 'free', 'energy', 'of', 'solvation', 'computed', 'to', 'be', '017', 'ev', 'which', 'in', 'turn', 'are', 'the', 'most', 'thermodynamically', 'stable', 'we', 'observe', 'weak', 'interactions', 'of', 'sodium', 'with', 'graphite', 'sheets', 'during', 'the', 'unbiased', 'and', 'biased', 'molecular', 'dynamics', 'simulations', 'our', 'simulations', 'results', 'indicate', 'that', 'solvent', 'plays', 'an', 'important', 'role', 'in', 'stabilizing', 'the', 'sodium', 'intercalation', 'into', 'graphite', 'through', 'shielding', 'of', 'the', 'sodium', 'while', 'modulating', 'the', 'interaction', 'of', 'the', 'solvent', 'with', 'the', 'graphite', 'sheets', 'in', 'order', 'to', 'facilitate', 'this', 'intercalation', 'we', 'propose', 'solvents', 'with', 'negatively', 'charged', 'groups', 'and', 'aromatic', 'cores', 'eg', 'cyclic', 'ethers', 'that', 'could', 'allow', 'a', 'greater', 'rate', 'of', 'anion', 'exchange', 'to', 'increase', 'na', 'mobility']] | [-0.08682296966536326, 0.2092415895966599, -0.018672127135682077, 0.01100401791294423, 0.07121092989647794, -0.16938763603869544, 0.05966355382179508, 0.424064203655358, -0.24238856548761056, -0.3108927133961478, -0.01745680349238346, -0.30783054807742877, -0.08588609718206215, 0.1093880587171311, 0.007496816421067611, -0.048739331033527636, 0.05872403059055157, -0.03500987834437088, -0.022757608431386033, -0.21213035291798327, 0.2110339624318025, 0.1410167653381426, 0.2790030766368677, 0.13343074111162948, 0.03045048243016263, -0.05662103227845722, 0.0758757208988092, 0.008458436166630745, -0.20501274832404412, 0.13083017299677155, 0.27634229307026587, -0.05897791913005313, 0.22342105087221228, -0.4939106454200655, -0.24801970282946365, 0.06156822270108118, 0.13731939418702668, 0.15058213485353708, -0.12145033360370085, -0.22454809813055, 0.0713077591667544, -0.1264387277369468, -0.10698512966362382, -0.0819832029243705, -0.033279411093671024, 0.0720830165974209, -0.23390483253264013, 0.1324210061228732, -0.027624683508466433, 0.07189618937558134, -0.17260109668602963, -0.17997675894818813, -0.10378617164678872, 0.076630489093876, 0.053983304336094405, -0.017653164622034728, 0.25741914591100606, -0.09559697204880481, -0.02655145549753713, 0.4251993556393881, -0.10178334791700469, -0.12073996779374305, 0.2244144558524336, -0.1099091253480255, -0.09578156738267468, 0.2500231955631103, 0.07409802943231225, 0.10091411487490068, -0.15154890303171611, -0.0003692660623060464, 0.00015914736105656694, 0.20759490957578952, 0.11989934760484995, 0.006826553308937263, 0.20691577015670737, 0.1822965798059726, 0.028573555080489272, 0.13550772031742575, -0.11351360389565769, -0.09146222237846141, -0.1716328065878055, -0.2528117357973935, -0.11274147427753906, 0.05674639416352517, -0.07739315351529849, -0.18853639456025606, 0.30802769179326733, 0.10492674573028536, 0.13578841166107813, -0.04429711209209044, 0.22179612836590565, 0.026052191003624114, 0.0545888144840524, 0.0255666706156567, 0.23195945669094778, 0.12089022355977812, 0.07347676201422047, -0.3045828957864315, 0.10187176171006537, 0.043454428687907026] |
1,802.0669 | A Laplace Transform Method for Molecular Mass Distribution Calculation
from Rheometric Data | Polydisperse linear polymer melts can be microscopically described by the
tube model and fractal reptation dynamics, while on the macroscopic side the
generalized Maxwell model is capable of correctly displaying most of the
rheological behavior. In this paper, a Laplace transform method is derived and
different macroscopic starting points for molecular mass distribution
calculation are compared to a classical light scattering evaluation. The
underlying assumptions comprise the modern understanding on polymer dynamics in
entangled systems but can be stated in a mathematically generalized way. The
resulting method is very easy to use due to its mathematical structure and it
is capable of calculating multimodal molecular mass distributions of linear
polymer melts.
| physics.flu-dyn physics.comp-ph | polydisperse linear polymer melts can be microscopically described by the tube model and fractal reptation dynamics while on the macroscopic side the generalized maxwell model is capable of correctly displaying most of the rheological behavior in this paper a laplace transform method is derived and different macroscopic starting points for molecular mass distribution calculation are compared to a classical light scattering evaluation the underlying assumptions comprise the modern understanding on polymer dynamics in entangled systems but can be stated in a mathematically generalized way the resulting method is very easy to use due to its mathematical structure and it is capable of calculating multimodal molecular mass distributions of linear polymer melts | [['polydisperse', 'linear', 'polymer', 'melts', 'can', 'be', 'microscopically', 'described', 'by', 'the', 'tube', 'model', 'and', 'fractal', 'reptation', 'dynamics', 'while', 'on', 'the', 'macroscopic', 'side', 'the', 'generalized', 'maxwell', 'model', 'is', 'capable', 'of', 'correctly', 'displaying', 'most', 'of', 'the', 'rheological', 'behavior', 'in', 'this', 'paper', 'a', 'laplace', 'transform', 'method', 'is', 'derived', 'and', 'different', 'macroscopic', 'starting', 'points', 'for', 'molecular', 'mass', 'distribution', 'calculation', 'are', 'compared', 'to', 'a', 'classical', 'light', 'scattering', 'evaluation', 'the', 'underlying', 'assumptions', 'comprise', 'the', 'modern', 'understanding', 'on', 'polymer', 'dynamics', 'in', 'entangled', 'systems', 'but', 'can', 'be', 'stated', 'in', 'a', 'mathematically', 'generalized', 'way', 'the', 'resulting', 'method', 'is', 'very', 'easy', 'to', 'use', 'due', 'to', 'its', 'mathematical', 'structure', 'and', 'it', 'is', 'capable', 'of', 'calculating', 'multimodal', 'molecular', 'mass', 'distributions', 'of', 'linear', 'polymer', 'melts']] | [-0.059454446833639464, 0.1397774520074227, -0.14812933458938254, 0.07923805558747771, -0.057876725609808624, -0.16224794277736732, -0.03638005866312531, 0.35779313713748445, -0.2835454968620209, -0.2727014932378724, 0.06664593950824325, -0.23781282990868832, -0.17070916269880695, 0.19346717097754548, -0.019948298656927037, 0.09960984113586328, 0.04061365257403268, -0.017327569546765304, -0.04370224291274139, -0.18040466995968543, 0.2520339820882188, 0.04073986041292481, 0.29640493718361866, 0.04115443502611539, 0.10947486136380273, 0.017649659085683188, 0.015373814028796848, 0.04433089401572943, -0.11899308471831384, 0.12451031055041328, 0.23514615978861042, 0.05579730132510802, 0.20042459033891089, -0.45285875487837707, -0.23720078899416033, 0.0407282558420824, 0.14453738823801549, 0.13219672248296038, 0.011830385671592914, -0.24248395567373918, 0.04627543370667342, -0.13842183549108134, -0.17998063993044533, -0.11508511453484152, 0.013787810694896154, 0.03633283160213666, -0.2197360799774771, 0.10978684281334616, 0.050078960051676176, 0.035603372982141, -0.046844456024962976, -0.08519017337276055, -0.015116681974079157, 0.07997399721470838, 0.0220641992264637, -0.0013062655757944863, 0.21163030262398827, -0.12318231873969371, -0.03863151510338391, 0.4373722610206486, -0.026005003915948642, -0.2484982260712632, 0.21269940666074083, -0.11517204948793258, -0.10331774194649346, 0.18825342487711627, 0.1377703587730155, 0.10743608444442486, -0.21716659736813274, 0.06084453345436093, -0.05685477242343598, 0.17493407288985746, 0.05005724168055364, -0.001472137394877201, 0.23105958412896405, 0.22896274998742114, -0.023743306529951526, 0.15140102972666658, -0.05829510912676719, -0.19511091672219671, -0.24041003003917835, -0.1551376294579592, -0.24334101941067357, 0.0575825803082537, -0.10131643364284092, -0.17577830283390777, 0.3676653319785187, 0.11988653262882065, 0.16119666589499526, 0.09258876854830698, 0.2665654031878656, 0.10358935885282385, 0.038904518942004654, 0.04434630347348682, 0.20865177681149394, 0.1759266684037373, 0.11550258805027215, -0.22729921555733895, 0.11491061366993834, 0.07517398324132234] |
1,802.06691 | Sponge-Based Control-Flow Protection for IoT Devices | Embedded devices in the Internet of Things (IoT) face a wide variety of
security challenges. For example, software attackers perform code injection and
code-reuse attacks on their remote interfaces, and physical access to IoT
devices allows to tamper with code in memory, steal confidential Intellectual
Property (IP), or mount fault attacks to manipulate a CPU's control flow.
In this work, we present Sponge-based Control Flow Protection (SCFP). SCFP is
a stateful, sponge-based scheme to ensure the confidentiality of software IP
and its authentic execution on IoT devices. At compile time, SCFP encrypts and
authenticates software with instruction-level granularity. During execution, an
SCFP hardware extension between the CPU's fetch and decode stage continuously
decrypts and authenticates instructions. Sponge-based authenticated encryption
in SCFP yields fine-grained control-flow integrity and thus prevents
code-reuse, code-injection, and fault attacks on the code and the control flow.
In addition, SCFP withstands any modification of software in memory. For
evaluation, we extended a RISC-V core with SCFP and fabricated a real System on
Chip (SoC). The average overhead in code size and execution time of SCFP on
this design is 19.8% and 9.1%, respectively, and thus meets the requirements of
embedded IoT devices.
| cs.CR | embedded devices in the internet of things iot face a wide variety of security challenges for example software attackers perform code injection and codereuse attacks on their remote interfaces and physical access to iot devices allows to tamper with code in memory steal confidential intellectual property ip or mount fault attacks to manipulate a cpus control flow in this work we present spongebased control flow protection scfp scfp is a stateful spongebased scheme to ensure the confidentiality of software ip and its authentic execution on iot devices at compile time scfp encrypts and authenticates software with instructionlevel granularity during execution an scfp hardware extension between the cpus fetch and decode stage continuously decrypts and authenticates instructions spongebased authenticated encryption in scfp yields finegrained controlflow integrity and thus prevents codereuse codeinjection and fault attacks on the code and the control flow in addition scfp withstands any modification of software in memory for evaluation we extended a riscv core with scfp and fabricated a real system on chip soc the average overhead in code size and execution time of scfp on this design is 198 and 91 respectively and thus meets the requirements of embedded iot devices | [['embedded', 'devices', 'in', 'the', 'internet', 'of', 'things', 'iot', 'face', 'a', 'wide', 'variety', 'of', 'security', 'challenges', 'for', 'example', 'software', 'attackers', 'perform', 'code', 'injection', 'and', 'codereuse', 'attacks', 'on', 'their', 'remote', 'interfaces', 'and', 'physical', 'access', 'to', 'iot', 'devices', 'allows', 'to', 'tamper', 'with', 'code', 'in', 'memory', 'steal', 'confidential', 'intellectual', 'property', 'ip', 'or', 'mount', 'fault', 'attacks', 'to', 'manipulate', 'a', 'cpus', 'control', 'flow', 'in', 'this', 'work', 'we', 'present', 'spongebased', 'control', 'flow', 'protection', 'scfp', 'scfp', 'is', 'a', 'stateful', 'spongebased', 'scheme', 'to', 'ensure', 'the', 'confidentiality', 'of', 'software', 'ip', 'and', 'its', 'authentic', 'execution', 'on', 'iot', 'devices', 'at', 'compile', 'time', 'scfp', 'encrypts', 'and', 'authenticates', 'software', 'with', 'instructionlevel', 'granularity', 'during', 'execution', 'an', 'scfp', 'hardware', 'extension', 'between', 'the', 'cpus', 'fetch', 'and', 'decode', 'stage', 'continuously', 'decrypts', 'and', 'authenticates', 'instructions', 'spongebased', 'authenticated', 'encryption', 'in', 'scfp', 'yields', 'finegrained', 'controlflow', 'integrity', 'and', 'thus', 'prevents', 'codereuse', 'codeinjection', 'and', 'fault', 'attacks', 'on', 'the', 'code', 'and', 'the', 'control', 'flow', 'in', 'addition', 'scfp', 'withstands', 'any', 'modification', 'of', 'software', 'in', 'memory', 'for', 'evaluation', 'we', 'extended', 'a', 'riscv', 'core', 'with', 'scfp', 'and', 'fabricated', 'a', 'real', 'system', 'on', 'chip', 'soc', 'the', 'average', 'overhead', 'in', 'code', 'size', 'and', 'execution', 'time', 'of', 'scfp', 'on', 'this', 'design', 'is', '198', 'and', '91', 'respectively', 'and', 'thus', 'meets', 'the', 'requirements', 'of', 'embedded', 'iot', 'devices']] | [-0.25184119618378387, -0.024955736341190714, -0.03599892830213484, -0.016035231914466774, -0.0885793354959251, -0.2822575857003148, 0.0900519613078079, 0.3866734334267676, -0.2599105060745317, -0.3490964606690865, 0.15043324760388202, -0.26795811940541264, -0.04920292346594998, 0.21663719055195077, -0.16197576799776214, 0.1305935210079695, 0.037702926833821364, -0.03884595930576325, 0.004574388205909576, -0.27192143632385596, 0.24003367049929997, 0.0763607076011025, 0.33400909037281495, 0.08340529635345612, 0.06273715244367337, 0.016556318218891437, -0.009592379612746673, -0.10409147706933511, -0.03135259070863517, 0.10306109137570438, 0.32931414282618043, 0.2365108071730878, 0.30045370519973147, -0.48119433714697757, -0.12684345589473078, 0.0033149468855789076, 0.11459490135789682, 0.06608414986194708, -0.057675147228366815, -0.3187096357596322, 0.18222819005545132, -0.30081173179384607, -0.038972609931638896, -0.05168260511679527, 0.0031258951442746014, 0.00785337664330235, -0.2062527767358682, -0.09156217753815536, 0.0021235488241729446, 0.11397481436620299, -0.014732085207763772, 0.012802580393588123, -0.0430520749794176, 0.16595220645435918, -0.04916702255917092, 0.01593842857863563, 0.23305092775382294, -0.09964778701750895, -0.16276870232839616, 0.3618564818532039, 0.05988514524741242, -0.1356611177405844, 0.1563358716881619, 0.04664193776746591, -0.1277781217573927, 0.08245834882060686, 0.26956788510179674, 0.030823501081277543, -0.15314579034606235, 0.062290690608549484, 0.07499999969911117, 0.2565878412686288, 0.05968846595034194, 0.08718097085992878, 0.1564538026562868, 0.19253987329892622, 0.07695738173161562, 0.1364701398433401, -0.049477815194031556, -0.07467128122822406, -0.2179522991556531, -0.2096048127244919, -0.1305560998618603, 0.01808634938982626, -0.0688783307944108, -0.15503501928566646, 0.36370095830738697, 0.22461177684271183, 0.07153934482485055, 0.07632916291745809, 0.46014919594551124, -0.06428477440793545, 0.1802132994808161, 0.22200148795277644, 0.0843034468495693, -0.013975424576813403, 0.21519519560850967, -0.19063690789521504, 0.17271261274671326, -0.03105348502524579] |
1,802.06692 | Complexity-weighted doses reduce biological uncertainty in proton
radiotherapy planning | Purpose: Variations in proton Relative Biological Effectiveness (RBE) with
Linear Energy Transfer (LET) remain one of the largest sources of uncertainty
in proton radiotherapy. This work seeks to identify physics-based metrics which
can be applied to reduce this biological uncertainty.
Materials and Methods: Three different physical metrics - dose, dose $\times$
LET and a complexity-weighted dose (CWD, Dose $\times$ (1+$\kappa LET_D$) )
were compared with in vitro experimental studies of proton RBE and clinical
treatment plans analysed using RBE models. The biological effects of protons in
each system were plotted against these metrics to quantify the degree of
biological uncertainty introduced by RBE variations in each case.
Results: When the biological effects of protons were plotted against dose
alone, significant biological uncertainty was introduced as the LET-dependence
of RBE was neglected. Plotting biological effects against dose $\times$ LET
significantly over-estimated the impact of LET on cell survival, leading to
similar or greater levels of biological uncertainty. CWD, by contrast,
significantly reduced biological uncertainties in both experiments and clinical
plans. For prostate and medulloblastoma treatment plans, biological
uncertainties were reduced from $\pm$ 5% to less than 1%.
Conclusions: While not a replacement for full RBE models, physics-based
metrics such as CWD have the potential to significantly reduce the
uncertainties in proton planning which result from variations in RBE. These
metrics may be used to identify regions in normal tissues which may see
unexpectedly high effects due to end-of-range elevations of RBE, or as a tool
in optimisation to deliver uniform biological effects.
| physics.med-ph | purpose variations in proton relative biological effectiveness rbe with linear energy transfer let remain one of the largest sources of uncertainty in proton radiotherapy this work seeks to identify physicsbased metrics which can be applied to reduce this biological uncertainty materials and methods three different physical metrics dose dose times let and a complexityweighted dose cwd dose times 1kappa let_d were compared with in vitro experimental studies of proton rbe and clinical treatment plans analysed using rbe models the biological effects of protons in each system were plotted against these metrics to quantify the degree of biological uncertainty introduced by rbe variations in each case results when the biological effects of protons were plotted against dose alone significant biological uncertainty was introduced as the letdependence of rbe was neglected plotting biological effects against dose times let significantly overestimated the impact of let on cell survival leading to similar or greater levels of biological uncertainty cwd by contrast significantly reduced biological uncertainties in both experiments and clinical plans for prostate and medulloblastoma treatment plans biological uncertainties were reduced from pm 5 to less than 1 conclusions while not a replacement for full rbe models physicsbased metrics such as cwd have the potential to significantly reduce the uncertainties in proton planning which result from variations in rbe these metrics may be used to identify regions in normal tissues which may see unexpectedly high effects due to endofrange elevations of rbe or as a tool in optimisation to deliver uniform biological effects | [['purpose', 'variations', 'in', 'proton', 'relative', 'biological', 'effectiveness', 'rbe', 'with', 'linear', 'energy', 'transfer', 'let', 'remain', 'one', 'of', 'the', 'largest', 'sources', 'of', 'uncertainty', 'in', 'proton', 'radiotherapy', 'this', 'work', 'seeks', 'to', 'identify', 'physicsbased', 'metrics', 'which', 'can', 'be', 'applied', 'to', 'reduce', 'this', 'biological', 'uncertainty', 'materials', 'and', 'methods', 'three', 'different', 'physical', 'metrics', 'dose', 'dose', 'times', 'let', 'and', 'a', 'complexityweighted', 'dose', 'cwd', 'dose', 'times', '1kappa', 'let_d', 'were', 'compared', 'with', 'in', 'vitro', 'experimental', 'studies', 'of', 'proton', 'rbe', 'and', 'clinical', 'treatment', 'plans', 'analysed', 'using', 'rbe', 'models', 'the', 'biological', 'effects', 'of', 'protons', 'in', 'each', 'system', 'were', 'plotted', 'against', 'these', 'metrics', 'to', 'quantify', 'the', 'degree', 'of', 'biological', 'uncertainty', 'introduced', 'by', 'rbe', 'variations', 'in', 'each', 'case', 'results', 'when', 'the', 'biological', 'effects', 'of', 'protons', 'were', 'plotted', 'against', 'dose', 'alone', 'significant', 'biological', 'uncertainty', 'was', 'introduced', 'as', 'the', 'letdependence', 'of', 'rbe', 'was', 'neglected', 'plotting', 'biological', 'effects', 'against', 'dose', 'times', 'let', 'significantly', 'overestimated', 'the', 'impact', 'of', 'let', 'on', 'cell', 'survival', 'leading', 'to', 'similar', 'or', 'greater', 'levels', 'of', 'biological', 'uncertainty', 'cwd', 'by', 'contrast', 'significantly', 'reduced', 'biological', 'uncertainties', 'in', 'both', 'experiments', 'and', 'clinical', 'plans', 'for', 'prostate', 'and', 'medulloblastoma', 'treatment', 'plans', 'biological', 'uncertainties', 'were', 'reduced', 'from', 'pm', '5', 'to', 'less', 'than', '1', 'conclusions', 'while', 'not', 'a', 'replacement', 'for', 'full', 'rbe', 'models', 'physicsbased', 'metrics', 'such', 'as', 'cwd', 'have', 'the', 'potential', 'to', 'significantly', 'reduce', 'the', 'uncertainties', 'in', 'proton', 'planning', 'which', 'result', 'from', 'variations', 'in', 'rbe', 'these', 'metrics', 'may', 'be', 'used', 'to', 'identify', 'regions', 'in', 'normal', 'tissues', 'which', 'may', 'see', 'unexpectedly', 'high', 'effects', 'due', 'to', 'endofrange', 'elevations', 'of', 'rbe', 'or', 'as', 'a', 'tool', 'in', 'optimisation', 'to', 'deliver', 'uniform', 'biological', 'effects']] | [0.03787559197318354, 0.1388581767394321, -0.028181928586653943, 0.1043900234304838, 0.0022733494813546415, -0.10111120682894971, 0.01760051664290571, 0.4086903770476943, -0.18241335260227504, -0.3468699736863269, 0.046871956395235184, -0.2980417922627544, -0.09648592397949196, 0.22455992460122134, -0.1592988700329561, 0.06771475642076476, 0.08438381917274944, -0.022564201181322883, -0.021765996324848685, -0.24099136895038248, 0.22622036028036288, 0.11315884223216467, 0.29485548972492903, 0.07197360382926446, 0.06813894892873326, -0.006610117318880994, -0.04711797233856457, 0.06544537957742567, -0.11169995109709661, 0.11038470775933891, 0.33546078441385013, 0.1447663110268219, 0.27464154709463684, -0.4509972772992602, -0.29724924030100425, 0.14395466653774, 0.11739733141120069, 0.05898790967194515, 0.01577952717112877, -0.25615982396804493, 0.0643006382875402, -0.13984514596429323, -0.11328234021529192, -0.048892815782862704, 0.028606344576133792, 0.05622492304258238, -0.2709944215943901, 0.09530872279944701, -0.022124840341156065, 0.10009951007408582, -0.12434404971062894, -0.20194220423984258, -0.03420606259695762, 0.13805404589930265, 0.09426611290707033, 0.06981526889338545, 0.22078322328670175, -0.10642708512188723, -0.14315285073447503, 0.42264836969808106, 0.026870166647853234, -0.2334361082724697, 0.15061287795679976, -0.15414764296842692, -0.0769504112507618, 0.16676421515450518, 0.22102702494968124, 0.08459200747893192, -0.18497043684612613, -0.04285458764898954, 0.1132557145906688, 0.17420115865714, 0.09775931670091956, -0.032550756454210336, 0.11986731690907382, 0.17595787295348547, -0.019580107249463415, 0.09803956687569663, -0.10328020194802827, -0.04427686592704064, -0.22643988217204447, -0.12726956889472477, -0.05986568285152316, 0.07749824027813132, -0.11132593740626547, -0.1298752471071581, 0.35989071410508994, 0.1814621253633811, 0.1334415992979354, 0.03100181201508844, 0.27576958289657666, 0.05441626396107798, 0.09244761901256454, -0.0169857254467632, 0.20242554347818278, 0.0978131962237819, 0.07246034818690089, -0.24758080315844314, 0.17226325038335916, -0.03568202871602119] |
1,802.06693 | Quench Dynamics of Finite Bosonic Ensembles in Optical Lattices with
Spatially Modulated Interactions | The nonequilibrium quantum dynamics of few boson ensembles which experience a
spatially modulated interaction strength and are confined in finite optical
lattices is investigated. We utilize a cosinusoidal spatially modulated
effective interaction strength which is characterized by its wavevector,
inhomogeneity amplitude, interaction offset and a phase. Performing quenches
either on the wavevector or the phase of the interaction profile an enhanced
imbalance of the interatomic repulsion between distinct spatial regions of the
lattice is induced. Following both quench protocols triggers various tunneling
channels and a rich excitation dynamics consisting of a breathing and a cradle
mode. All modes are shown to be amplified for increasing inhomogeneity
amplitude of the interaction strength. Especially the phase quench induces a
directional transport enabling us to discern energetically, otherwise,
degenerate tunneling pathways. Moreover, a periodic population transfer between
distinct momenta for quenches of increasing wavevector is observed, while a
directed occupation of higher momenta can be achieved following a phase quench.
Finally, during the evolution regions of partial coherence are revealed between
the predominantly occupied wells.
| cond-mat.quant-gas physics.atom-ph quant-ph | the nonequilibrium quantum dynamics of few boson ensembles which experience a spatially modulated interaction strength and are confined in finite optical lattices is investigated we utilize a cosinusoidal spatially modulated effective interaction strength which is characterized by its wavevector inhomogeneity amplitude interaction offset and a phase performing quenches either on the wavevector or the phase of the interaction profile an enhanced imbalance of the interatomic repulsion between distinct spatial regions of the lattice is induced following both quench protocols triggers various tunneling channels and a rich excitation dynamics consisting of a breathing and a cradle mode all modes are shown to be amplified for increasing inhomogeneity amplitude of the interaction strength especially the phase quench induces a directional transport enabling us to discern energetically otherwise degenerate tunneling pathways moreover a periodic population transfer between distinct momenta for quenches of increasing wavevector is observed while a directed occupation of higher momenta can be achieved following a phase quench finally during the evolution regions of partial coherence are revealed between the predominantly occupied wells | [['the', 'nonequilibrium', 'quantum', 'dynamics', 'of', 'few', 'boson', 'ensembles', 'which', 'experience', 'a', 'spatially', 'modulated', 'interaction', 'strength', 'and', 'are', 'confined', 'in', 'finite', 'optical', 'lattices', 'is', 'investigated', 'we', 'utilize', 'a', 'cosinusoidal', 'spatially', 'modulated', 'effective', 'interaction', 'strength', 'which', 'is', 'characterized', 'by', 'its', 'wavevector', 'inhomogeneity', 'amplitude', 'interaction', 'offset', 'and', 'a', 'phase', 'performing', 'quenches', 'either', 'on', 'the', 'wavevector', 'or', 'the', 'phase', 'of', 'the', 'interaction', 'profile', 'an', 'enhanced', 'imbalance', 'of', 'the', 'interatomic', 'repulsion', 'between', 'distinct', 'spatial', 'regions', 'of', 'the', 'lattice', 'is', 'induced', 'following', 'both', 'quench', 'protocols', 'triggers', 'various', 'tunneling', 'channels', 'and', 'a', 'rich', 'excitation', 'dynamics', 'consisting', 'of', 'a', 'breathing', 'and', 'a', 'cradle', 'mode', 'all', 'modes', 'are', 'shown', 'to', 'be', 'amplified', 'for', 'increasing', 'inhomogeneity', 'amplitude', 'of', 'the', 'interaction', 'strength', 'especially', 'the', 'phase', 'quench', 'induces', 'a', 'directional', 'transport', 'enabling', 'us', 'to', 'discern', 'energetically', 'otherwise', 'degenerate', 'tunneling', 'pathways', 'moreover', 'a', 'periodic', 'population', 'transfer', 'between', 'distinct', 'momenta', 'for', 'quenches', 'of', 'increasing', 'wavevector', 'is', 'observed', 'while', 'a', 'directed', 'occupation', 'of', 'higher', 'momenta', 'can', 'be', 'achieved', 'following', 'a', 'phase', 'quench', 'finally', 'during', 'the', 'evolution', 'regions', 'of', 'partial', 'coherence', 'are', 'revealed', 'between', 'the', 'predominantly', 'occupied', 'wells']] | [-0.24895241802496035, 0.2893650985823242, -0.0677368527976796, 0.0657356844776375, -0.010466245518791554, -0.17794302923788943, 0.05044272189640418, 0.41486812666664985, -0.29239766066893935, -0.254007677485365, 0.001731691433273819, -0.2728522514361282, -0.1027357904524759, 0.13628277809191278, 0.0963936999161338, -0.04005896578797377, 0.03129988862336938, -0.02510056418615805, -0.07270642694256399, -0.169134248933365, 0.30668648606610244, 0.027858021266374, 0.30403186852615977, 0.05084714879076062, 0.058004792514365425, 0.026768558433950814, 0.04659783120570315, 0.022068315796110086, -0.12260934105684418, 0.03770031648969581, 0.19503925228660635, -0.032478381250172765, 0.24583021599214272, -0.4174252394803388, -0.2385014892057624, 0.09704670047409139, 0.20549092950234407, 0.16188645502823124, -0.0498813918858041, -0.3059980138692312, -0.038644460324322547, -0.15798582453388982, -0.12547292852477132, -0.04882168961921707, 0.052068239107706346, 0.04495278972188866, -0.30338357424710033, 0.141714853688575, 0.028393947097018014, 0.0766513853639819, -0.06631782982663555, -0.0024822554645821627, -0.08267777772189855, 0.1121056608024573, 0.002469596989062983, 0.061168448750449474, 0.16556622317266587, -0.13923696909393563, -0.0772423113068176, 0.32556849091887735, -0.045963029414049866, -0.1321740732419976, 0.21568023195208677, -0.16084074848169072, -0.02095190868618205, 0.1992704361639267, 0.13042637948109226, 0.07678241899838065, -0.11487317742065115, 0.031227820341713553, 0.07550834235735238, 0.20280655322672236, 0.07918359500018955, 0.08128462668757366, 0.27497653926040455, 0.16489085333616754, 0.03892092916540542, 0.1547613309081752, -0.10650742348408067, -0.14888052604172033, -0.22068341218779775, -0.0713898938874779, -0.19959208377224777, 0.03434025558106991, -0.05809806614723679, -0.16086282807068633, 0.43030367390967383, 0.09813493529204713, 0.21239592041549554, -0.04572607122556588, 0.24625815005788884, 0.1304666356692567, 0.049199036552657394, 0.016822243047753607, 0.2620916116541403, 0.17366297050314242, 0.07339487949773388, -0.30525766710512514, 0.04473620016929195, 5.889296813239885e-05] |
1,802.06694 | Atiyah-Hirzebruch Spectral Sequence in Band Topology: General Formalism
and Topological Invariants for 230 Space Groups | We study the Atiyah-Hirzebruch spectral sequence (AHSS) for equivariant
K-theory in the context of band theory. Various notions in the band theory such
as irreducible representations at high-symmetric points, the compatibility
relation, topological gapless and singular points naturally fits into the AHSS.
As an application of the AHSS, we get the complete list of topological
invariants for 230 space groups without time-reversal or particle-hole
invariance. We find that a lot of torsion topological invariants appear even
for symmorphic space groups.
| cond-mat.str-el cond-mat.mtrl-sci cond-mat.supr-con hep-th | we study the atiyahhirzebruch spectral sequence ahss for equivariant ktheory in the context of band theory various notions in the band theory such as irreducible representations at highsymmetric points the compatibility relation topological gapless and singular points naturally fits into the ahss as an application of the ahss we get the complete list of topological invariants for 230 space groups without timereversal or particlehole invariance we find that a lot of torsion topological invariants appear even for symmorphic space groups | [['we', 'study', 'the', 'atiyahhirzebruch', 'spectral', 'sequence', 'ahss', 'for', 'equivariant', 'ktheory', 'in', 'the', 'context', 'of', 'band', 'theory', 'various', 'notions', 'in', 'the', 'band', 'theory', 'such', 'as', 'irreducible', 'representations', 'at', 'highsymmetric', 'points', 'the', 'compatibility', 'relation', 'topological', 'gapless', 'and', 'singular', 'points', 'naturally', 'fits', 'into', 'the', 'ahss', 'as', 'an', 'application', 'of', 'the', 'ahss', 'we', 'get', 'the', 'complete', 'list', 'of', 'topological', 'invariants', 'for', '230', 'space', 'groups', 'without', 'timereversal', 'or', 'particlehole', 'invariance', 'we', 'find', 'that', 'a', 'lot', 'of', 'torsion', 'topological', 'invariants', 'appear', 'even', 'for', 'symmorphic', 'space', 'groups']] | [-0.1994600462361793, 0.10449431447147928, -0.10233619896683228, 0.12038301858060722, -0.08258725412755827, -0.1109391474872356, 0.04182577141283575, 0.35369166669648, -0.3130916587984826, -0.2751230020429703, 0.07841386724723197, -0.2650098101349394, -0.16646110151210636, 0.153051488782291, -0.10051282722491157, 0.01939435050486811, 0.005086690293554264, 0.027911165654010882, -0.1655550427392974, -0.19927868351474393, 0.4010034503085138, -0.05886368714037198, 0.27912607931685224, 0.034379137638673375, 0.021833499410201476, 0.04793519511394485, 0.012011640993996134, -0.034795559377592246, -0.13460269547703077, 0.07879298951335345, 0.3179667529095955, -0.009668386853712647, 0.1366611255562711, -0.376318918517496, -0.19133981965376134, 0.14365805501908158, 0.11952191744223709, 0.07723898728248439, -0.021880498692346147, -0.32324169826092597, 0.13415723040558492, -0.1938311464279961, -0.14460201777187706, -0.12894217852102238, 0.002032957440595838, -0.06116530627212664, -0.15452672225788613, -0.0037300363330382714, 0.07812788231958505, 0.15594975192901456, -0.11724651404479637, -0.06699237570496677, -0.1295671213574448, 0.12654244003499138, 0.029884538589682007, -0.0022976688916877476, 0.0726857958420451, -0.13092974752564973, -0.16100050646611314, 0.4186369493703912, -0.04209623621375878, -0.15660173487201146, 0.14633132187248785, -0.10576513259306172, -0.23429627055184374, 0.14418501303165773, 0.07649503549254394, 0.0861251177502018, 0.0016573068061018293, 0.15911041954576474, -0.07350633483191457, 0.07885983623004271, 0.06304651220576672, 0.11181308965116174, 0.2275524747622777, 0.04022445661734931, 0.10267270102955495, 0.1307855935861604, -0.004990861591989104, -0.030263734568806388, -0.36543807044295196, -0.23087249153965636, -0.1411130991558061, 0.08847486218319664, -0.1150073452343902, -0.20963882044830087, 0.4654860696460627, 0.05253695783830142, 0.1833882690702058, 0.09155330084311435, 0.20799452123008197, 0.09579154869977714, 0.04738437629281248, 0.022682217244483247, 0.13725605170254276, 0.1851714634678409, 0.02008600281905147, -0.1595547637913989, -0.07771880931848707, 0.17626586509279057] |
1,802.06695 | Structural diradical character | A reliable first-principles description of singlet diradical character is
essential for predicting nonlinear optical and magnetic properties of
molecules. Since diradical and closed-shell electronic structures differ in
their distribution of single, double, triple and aromatic bonds, modeling
electronic diradical character requires accurate bond-length patterns, in
addition to accurate absolute bond lengths. We therefore introduce structural
diradical character, which we suggest as an additional measure for comparing
first-principles calculations with experimental data. We employ this measure to
identify suitable exchange-correlation functionals for predicting the bond
length patterns and electronic diradical character of a biscobaltocene with the
potential for photoswitchable nonlinear optical activity. Out of four popular
approximate exchange-correlation functionals with different exact-exchange
admixtures (BP86, TPSS, B3LYP, TPSSh), the two hybrid functionals TPSSh and
B3LYP perform best for diradical bond length patterns, with TPSSh being best
for the organometallic validation systems and B3LYP for the organic ones.
Still, none of the functionals is suitable for correctly describing relative
bond lengths across the range of molecules studied, so that none can be
recommended for predictive studies of (potential) diradicals without
reservation.
| physics.comp-ph physics.chem-ph | a reliable firstprinciples description of singlet diradical character is essential for predicting nonlinear optical and magnetic properties of molecules since diradical and closedshell electronic structures differ in their distribution of single double triple and aromatic bonds modeling electronic diradical character requires accurate bondlength patterns in addition to accurate absolute bond lengths we therefore introduce structural diradical character which we suggest as an additional measure for comparing firstprinciples calculations with experimental data we employ this measure to identify suitable exchangecorrelation functionals for predicting the bond length patterns and electronic diradical character of a biscobaltocene with the potential for photoswitchable nonlinear optical activity out of four popular approximate exchangecorrelation functionals with different exactexchange admixtures bp86 tpss b3lyp tpssh the two hybrid functionals tpssh and b3lyp perform best for diradical bond length patterns with tpssh being best for the organometallic validation systems and b3lyp for the organic ones still none of the functionals is suitable for correctly describing relative bond lengths across the range of molecules studied so that none can be recommended for predictive studies of potential diradicals without reservation | [['a', 'reliable', 'firstprinciples', 'description', 'of', 'singlet', 'diradical', 'character', 'is', 'essential', 'for', 'predicting', 'nonlinear', 'optical', 'and', 'magnetic', 'properties', 'of', 'molecules', 'since', 'diradical', 'and', 'closedshell', 'electronic', 'structures', 'differ', 'in', 'their', 'distribution', 'of', 'single', 'double', 'triple', 'and', 'aromatic', 'bonds', 'modeling', 'electronic', 'diradical', 'character', 'requires', 'accurate', 'bondlength', 'patterns', 'in', 'addition', 'to', 'accurate', 'absolute', 'bond', 'lengths', 'we', 'therefore', 'introduce', 'structural', 'diradical', 'character', 'which', 'we', 'suggest', 'as', 'an', 'additional', 'measure', 'for', 'comparing', 'firstprinciples', 'calculations', 'with', 'experimental', 'data', 'we', 'employ', 'this', 'measure', 'to', 'identify', 'suitable', 'exchangecorrelation', 'functionals', 'for', 'predicting', 'the', 'bond', 'length', 'patterns', 'and', 'electronic', 'diradical', 'character', 'of', 'a', 'biscobaltocene', 'with', 'the', 'potential', 'for', 'photoswitchable', 'nonlinear', 'optical', 'activity', 'out', 'of', 'four', 'popular', 'approximate', 'exchangecorrelation', 'functionals', 'with', 'different', 'exactexchange', 'admixtures', 'bp86', 'tpss', 'b3lyp', 'tpssh', 'the', 'two', 'hybrid', 'functionals', 'tpssh', 'and', 'b3lyp', 'perform', 'best', 'for', 'diradical', 'bond', 'length', 'patterns', 'with', 'tpssh', 'being', 'best', 'for', 'the', 'organometallic', 'validation', 'systems', 'and', 'b3lyp', 'for', 'the', 'organic', 'ones', 'still', 'none', 'of', 'the', 'functionals', 'is', 'suitable', 'for', 'correctly', 'describing', 'relative', 'bond', 'lengths', 'across', 'the', 'range', 'of', 'molecules', 'studied', 'so', 'that', 'none', 'can', 'be', 'recommended', 'for', 'predictive', 'studies', 'of', 'potential', 'diradicals', 'without', 'reservation']] | [-0.09315288692481269, 0.0840700386352028, -0.05560369703834508, 0.12101655346910353, 0.004987161961715605, -0.16515860266162682, 0.07818014596820425, 0.4433134515469862, -0.22546138613889952, -0.2777346165398252, -0.03983229401185622, -0.3333542401676124, -0.1248760895835141, 0.161074577076992, 0.05862742351988951, 0.07160610101569843, 0.05039812515931741, -0.039870873746057016, -0.09814841823526106, -0.1618159186084476, 0.23285125862638661, 0.06546395928151695, 0.2861691329123105, 0.08187441374333101, 0.015686908742744414, 0.045404013088446556, 0.04810724335053073, -0.03494410573157592, -0.14376633525004717, 0.19565335865327194, 0.29812875579474335, -0.02435926326134868, 0.2336859309488097, -0.47717620913297104, -0.23284242701608857, 0.05140472592382776, 0.07703614485842086, 0.14675134795620554, -0.005589199149165576, -0.2277787611398867, 0.07517015545643435, -0.18505112470606458, -0.11440734151687662, -0.2030564832979929, 0.0376232911301198, 0.09434937799907168, -0.2562478229240383, 0.12410920450600696, -0.049154562757034476, 0.08717393685712861, -0.14157587884120265, -0.21979983474948775, -0.06591709559562348, 0.09629936252673299, 0.0050648789679221175, 0.008887344835810152, 0.15483118342446153, -0.10986948461208682, -0.10302035359002776, 0.41617565479992474, -0.08216863885353513, -0.1526963819761492, 0.17093333264676022, -0.06408194324993502, -0.17749129075262338, 0.13011483810473717, 0.07518937008318591, 0.10826227519303391, -0.16781419200433345, 0.04094658397587995, 0.03270748768516127, 0.20482925261768098, 0.0700638794924243, 0.10539760443481938, 0.17207797639608635, 0.15974371140496543, 0.02446936776777361, 0.07244298732010805, -0.09802204878779791, -0.1146330816190628, -0.18937767586949686, -0.15646665958713313, -0.16533245829244456, -0.004408568917315895, -0.0832274574360555, -0.2598457188880871, 0.400509679968874, 0.11375473501518538, 0.09480027173807593, 0.008436850501496692, 0.21598181409575834, 0.05949070099359747, 0.08347167560073027, 0.00680920342772694, 0.19149331273945144, 0.11312731540772411, -0.008756896593058113, -0.2298951083689002, 0.12521535070681428, 0.03892271086378918] |
1,802.06696 | Inducibility of Topological Trees | Trees without vertices of degree $2$ are sometimes named topological trees.
In this work, we bring forward the study of the inducibility of (rooted)
topological trees with a given number of leaves. The inducibility of a
topological tree $S$ is the limit superior of the proportion of all subsets of
leaves of $T$ that induce a copy of $S$ as the size of $T$ grows to infinity.
In particular, this relaxes the degree-restriction for the existing notion of
the inducibility in $d$-ary trees. We discuss some of the properties of this
generalised concept and investigate its connection with the degree-restricted
inducibility. In addition, we prove that stars and binary caterpillars are the
only topological trees that have an inducibility of $1$. We also find an
explicit lower bound on the limit inferior of the proportion of all subsets of
leaves of $T$ that induce either a star or a binary caterpillar as the size of
$T$ tends to infinity.
| math.CO | trees without vertices of degree 2 are sometimes named topological trees in this work we bring forward the study of the inducibility of rooted topological trees with a given number of leaves the inducibility of a topological tree s is the limit superior of the proportion of all subsets of leaves of t that induce a copy of s as the size of t grows to infinity in particular this relaxes the degreerestriction for the existing notion of the inducibility in dary trees we discuss some of the properties of this generalised concept and investigate its connection with the degreerestricted inducibility in addition we prove that stars and binary caterpillars are the only topological trees that have an inducibility of 1 we also find an explicit lower bound on the limit inferior of the proportion of all subsets of leaves of t that induce either a star or a binary caterpillar as the size of t tends to infinity | [['trees', 'without', 'vertices', 'of', 'degree', '2', 'are', 'sometimes', 'named', 'topological', 'trees', 'in', 'this', 'work', 'we', 'bring', 'forward', 'the', 'study', 'of', 'the', 'inducibility', 'of', 'rooted', 'topological', 'trees', 'with', 'a', 'given', 'number', 'of', 'leaves', 'the', 'inducibility', 'of', 'a', 'topological', 'tree', 's', 'is', 'the', 'limit', 'superior', 'of', 'the', 'proportion', 'of', 'all', 'subsets', 'of', 'leaves', 'of', 't', 'that', 'induce', 'a', 'copy', 'of', 's', 'as', 'the', 'size', 'of', 't', 'grows', 'to', 'infinity', 'in', 'particular', 'this', 'relaxes', 'the', 'degreerestriction', 'for', 'the', 'existing', 'notion', 'of', 'the', 'inducibility', 'in', 'dary', 'trees', 'we', 'discuss', 'some', 'of', 'the', 'properties', 'of', 'this', 'generalised', 'concept', 'and', 'investigate', 'its', 'connection', 'with', 'the', 'degreerestricted', 'inducibility', 'in', 'addition', 'we', 'prove', 'that', 'stars', 'and', 'binary', 'caterpillars', 'are', 'the', 'only', 'topological', 'trees', 'that', 'have', 'an', 'inducibility', 'of', '1', 'we', 'also', 'find', 'an', 'explicit', 'lower', 'bound', 'on', 'the', 'limit', 'inferior', 'of', 'the', 'proportion', 'of', 'all', 'subsets', 'of', 'leaves', 'of', 't', 'that', 'induce', 'either', 'a', 'star', 'or', 'a', 'binary', 'caterpillar', 'as', 'the', 'size', 'of', 't', 'tends', 'to', 'infinity']] | [-0.17126472762939107, 0.19232488139934065, -0.05713420688422232, 0.03675276834276045, -0.07220027485532285, -0.08186394312489731, 0.12173440553177195, 0.3145257244564451, -0.27221378122008394, -0.2655204830479755, 0.08746889133236217, -0.31406384959074235, -0.1342937664815543, 0.1335833289290637, -0.0857465083510438, -0.003290793033614401, 0.07128653048738083, 0.1448545072764111, -0.034918239426760804, -0.28246326697548213, 0.34999079823411433, 0.017719756069156944, 0.19476166183182003, 0.03609112371901298, 0.09631643821912687, 0.002543377468975473, -0.006594204844883348, 0.06385319317467039, -0.16998197377716115, 0.07971658890910706, 0.20142986305953958, 0.17336748898341733, 0.22931259016423852, -0.3683035419310761, -0.1661873587607583, 0.18062628536997952, 0.1276452548513071, 0.0791311640516395, -0.00883381352155717, -0.19148068580388894, 0.16448853378879685, -0.1496232581949134, -0.1365830024610026, -0.0016990161708650426, 0.07128609375824822, 0.04615344961698438, -0.2028900752760635, -0.006733375640705381, 0.1804407749006737, 0.032707833838236486, 0.007475378052950424, -0.14380352014286704, -0.07962793187397427, 0.12533455201913898, 0.018934289563765538, 0.05654417009747151, 0.026000856262737813, -0.14712250988217235, -0.15503927326136374, 0.32090926538162595, -0.06762184676584564, -0.16487377365944977, 0.20848882435879942, -0.16333346664198214, -0.19797067969000037, 0.08110256515785202, 0.16208268290303082, 0.17496930465950997, -0.08011374970945188, 0.14047633562033665, -0.08357202934832135, 0.12218713805468494, 0.14226919450337375, 0.055112320980605305, 0.1746064365098748, 0.17595821440874163, 0.12937855650523467, 0.22300484983097243, -0.08179656185262801, -0.01269492650068589, -0.28682300410693207, -0.1844314964244266, -0.16268724125450407, 0.06672479723608916, -0.15481540658257023, -0.2504598554105887, 0.3615179914049804, 0.13996582227181406, 0.2858372687751168, 0.12922654963906005, 0.20363545111863862, 0.07399890383505085, 0.04055322204787237, 0.09517216694222976, 0.14903135489929567, 0.16416925275654096, -0.006482231975945679, -0.1970176970699649, 0.08172900541508689, 0.0946069788541409] |
1,802.06697 | Twistor lines on algebraic surfaces | We give quantitative and qualitative results on the family of surfaces in
$\mathbb{CP}^3$ containing finitely many twistor lines. We start by analyzing
the ideal sheaf of a finite set of disjoint lines $E$. We prove that its
general element is a smooth surface containing $E$ and no other line.
Afterwards we prove that twistor lines are Zariski dense in the Grassmannian
$Gr(2,4)$. Then, for any degree $d\ge 4$, we give lower bounds on the maximum
number of twistor lines contained in a degree $d$ surface. The smooth and
singular cases are studied as well as the $j$-invariant one.
| math.AG math.DG | we give quantitative and qualitative results on the family of surfaces in mathbbcp3 containing finitely many twistor lines we start by analyzing the ideal sheaf of a finite set of disjoint lines e we prove that its general element is a smooth surface containing e and no other line afterwards we prove that twistor lines are zariski dense in the grassmannian gr24 then for any degree dge 4 we give lower bounds on the maximum number of twistor lines contained in a degree d surface the smooth and singular cases are studied as well as the jinvariant one | [['we', 'give', 'quantitative', 'and', 'qualitative', 'results', 'on', 'the', 'family', 'of', 'surfaces', 'in', 'mathbbcp3', 'containing', 'finitely', 'many', 'twistor', 'lines', 'we', 'start', 'by', 'analyzing', 'the', 'ideal', 'sheaf', 'of', 'a', 'finite', 'set', 'of', 'disjoint', 'lines', 'e', 'we', 'prove', 'that', 'its', 'general', 'element', 'is', 'a', 'smooth', 'surface', 'containing', 'e', 'and', 'no', 'other', 'line', 'afterwards', 'we', 'prove', 'that', 'twistor', 'lines', 'are', 'zariski', 'dense', 'in', 'the', 'grassmannian', 'gr24', 'then', 'for', 'any', 'degree', 'dge', '4', 'we', 'give', 'lower', 'bounds', 'on', 'the', 'maximum', 'number', 'of', 'twistor', 'lines', 'contained', 'in', 'a', 'degree', 'd', 'surface', 'the', 'smooth', 'and', 'singular', 'cases', 'are', 'studied', 'as', 'well', 'as', 'the', 'jinvariant', 'one']] | [-0.1881937637202898, 0.07852891956370477, -0.033382682300799965, 0.05578996066350908, -0.06833157631834703, -0.13594291370946496, -0.0015123849307015842, 0.3685862558456708, -0.23855468835586643, -0.19624462135478246, 0.06841355331398889, -0.29652422641841125, -0.129919745778779, 0.21958292954914957, -0.10154375582173163, 0.003971202531235521, 0.057197526201833875, 0.08376825665484885, -0.0664286753400324, -0.2923504448096667, 0.386769041167192, -0.09093835221708049, 0.1995798999607582, 0.10388719242978461, 0.07823349454687262, -0.0020665141031602206, -0.007383065279193071, 0.05245589397323709, -0.16508055013222547, 0.1397577225330419, 0.29433359502225503, 0.15402990868980332, 0.14590732231546116, -0.4184259765648416, -0.20197790586484635, 0.1870260122232139, 0.14003523219227126, 0.039075054071501504, -0.004953643333223857, -0.19992005924827286, 0.10020688235075498, -0.072261922776863, -0.19813077182185893, -0.06863850379856873, 0.08816064284088052, 0.03451842993345796, -0.2050721235478259, -0.011942409701189217, 0.10681015175021234, 0.1696766769389945, -0.023909503447927763, -0.14237662881722066, -0.10898513668121732, 0.04587206988576419, -0.03955972680527413, 0.06937130424669202, 0.06490615092465007, -0.09231274410112932, -0.08487692395016094, 0.3449148151266854, -0.09651165914588741, -0.22758142681488272, 0.15681255987028078, -0.1715876016403817, -0.16167703410610557, 0.17923228467377472, 0.11917990418531153, 0.19158275817920054, -0.023623898729910046, 0.18061354093560095, -0.13967082997705615, 0.0706237786810617, 0.1401188125054599, 0.01239177126767665, 0.1604992526830459, 0.06544223105135773, 0.09702590296379937, 0.11363382802442268, -0.08244848714153073, -0.035239155722629964, -0.40613106204843036, -0.21100134605883944, -0.12402218906281726, 0.11821489371549414, -0.11690170865708473, -0.19171256672624232, 0.3872455200560543, 0.016794702218731448, 0.25680278203621204, 0.0701657852766161, 0.2373808137692359, 0.04969476014319261, -0.014009689322995896, 0.1033369254520429, 0.1609882114654673, 0.1560767196636761, -0.027803048947635963, -0.11268030537045276, -0.033446265142220925, 0.1774115011628185] |
1,802.06698 | Analysis of cause-effect inference by comparing regression errors | We address the problem of inferring the causal direction between two
variables by comparing the least-squares errors of the predictions in both
possible directions. Under the assumption of an independence between the
function relating cause and effect, the conditional noise distribution, and the
distribution of the cause, we show that the errors are smaller in causal
direction if both variables are equally scaled and the causal relation is close
to deterministic. Based on this, we provide an easily applicable algorithm that
only requires a regression in both possible causal directions and a comparison
of the errors. The performance of the algorithm is compared with various
related causal inference methods in different artificial and real-world data
sets.
| cs.AI | we address the problem of inferring the causal direction between two variables by comparing the leastsquares errors of the predictions in both possible directions under the assumption of an independence between the function relating cause and effect the conditional noise distribution and the distribution of the cause we show that the errors are smaller in causal direction if both variables are equally scaled and the causal relation is close to deterministic based on this we provide an easily applicable algorithm that only requires a regression in both possible causal directions and a comparison of the errors the performance of the algorithm is compared with various related causal inference methods in different artificial and realworld data sets | [['we', 'address', 'the', 'problem', 'of', 'inferring', 'the', 'causal', 'direction', 'between', 'two', 'variables', 'by', 'comparing', 'the', 'leastsquares', 'errors', 'of', 'the', 'predictions', 'in', 'both', 'possible', 'directions', 'under', 'the', 'assumption', 'of', 'an', 'independence', 'between', 'the', 'function', 'relating', 'cause', 'and', 'effect', 'the', 'conditional', 'noise', 'distribution', 'and', 'the', 'distribution', 'of', 'the', 'cause', 'we', 'show', 'that', 'the', 'errors', 'are', 'smaller', 'in', 'causal', 'direction', 'if', 'both', 'variables', 'are', 'equally', 'scaled', 'and', 'the', 'causal', 'relation', 'is', 'close', 'to', 'deterministic', 'based', 'on', 'this', 'we', 'provide', 'an', 'easily', 'applicable', 'algorithm', 'that', 'only', 'requires', 'a', 'regression', 'in', 'both', 'possible', 'causal', 'directions', 'and', 'a', 'comparison', 'of', 'the', 'errors', 'the', 'performance', 'of', 'the', 'algorithm', 'is', 'compared', 'with', 'various', 'related', 'causal', 'inference', 'methods', 'in', 'different', 'artificial', 'and', 'realworld', 'data', 'sets']] | [-0.10834965534540343, 0.06311825964954111, -0.0850440477912218, 0.1264367009772004, -0.0712318814455949, -0.11437017766855143, 0.060668851168633534, 0.4060258263208229, -0.29027781495824456, -0.30778174502935646, 0.10110239429873061, -0.26260508768710084, -0.15664687478043748, 0.2185742584326112, -0.08847980292770884, 0.06752775962753542, 0.06291729538573017, 0.029515469795271577, -0.08201765263922801, -0.2556532876212792, 0.32802444781530005, 0.048518478621503915, 0.3213334984932866, -0.003873665217442663, 0.1124221177516778, 0.03753698425586255, -0.06814272331419112, 0.07930112397900366, -0.07644925229033106, 0.11361500111725663, 0.2069339381916256, 0.174766226033359, 0.29257816873522924, -0.43005363649592315, -0.18135901352547207, 0.13309817015723294, 0.08776042034953897, 0.11629883490968496, 0.006489265873699032, -0.265729561795336, 0.06176035137594164, -0.09150109974394456, -0.05826164523173718, -0.05374481126762413, -0.024978323472294443, 0.01807190474887491, -0.29130732051321656, 0.1222730190518256, 0.07111451050651998, 0.060259428003738666, -0.04966633116569499, -0.13566525897878254, 0.016114149426294747, 0.1410182956084288, 0.1113642107831828, 0.021705590742479623, 0.07673431587293102, -0.10183313650135271, -0.15083829245273153, 0.3525646778128656, -0.02647678370001437, -0.27762692888791207, 0.17768723891188937, -0.10370387557235643, -0.12945000749434635, 0.07120884948506437, 0.1852123448625207, 0.0996569265563298, -0.17556181790082362, 0.041635659542878095, -0.02268798355462736, 0.14307041805044846, 0.030009693144981205, 0.009989205747842789, 0.18913450231574924, 0.1466028014005258, 0.06315735391549894, 0.1289658891518825, -0.1454064924699447, -0.10088054259440155, -0.30849177685791046, -0.12474597838846765, -0.17086278419170914, -0.055620841210274476, -0.17073500873699105, -0.15838410633873065, 0.3720231513364305, 0.24925814918242395, 0.23021059948549574, 0.07819825733594339, 0.30206334611786334, 0.09844539442966724, 0.02300825012157318, 0.11127173667773604, 0.22923284915982392, 0.14250588371691392, 0.01845959017197762, -0.2280828786897473, 0.17697174568130666, -0.03775758465655662] |
1,802.06699 | The Complexity of Drawing a Graph in a Polygonal Region | We prove that the following problem is complete for the existential theory of
the reals: Given a planar graph and a polygonal region, with some vertices of
the graph assigned to points on the boundary of the region, place the remaining
vertices to create a planar straight-line drawing of the graph inside the
region. This strengthens an NP-hardness result by Patrignani on extending
partial planar graph drawings. Our result is one of the first showing that a
problem of drawing planar graphs with straight-line edges is hard for the
existential theory of the reals. The complexity of the problem is open in the
case of a simply connected region.
We also show that, even for integer input coordinates, it is possible that
drawing a graph in a polygonal region requires some vertices to be placed at
irrational coordinates. By contrast, the coordinates are known to be bounded in
the special case of a convex region, or for drawing a path in any polygonal
region.
| cs.CC cs.CG cs.DM | we prove that the following problem is complete for the existential theory of the reals given a planar graph and a polygonal region with some vertices of the graph assigned to points on the boundary of the region place the remaining vertices to create a planar straightline drawing of the graph inside the region this strengthens an nphardness result by patrignani on extending partial planar graph drawings our result is one of the first showing that a problem of drawing planar graphs with straightline edges is hard for the existential theory of the reals the complexity of the problem is open in the case of a simply connected region we also show that even for integer input coordinates it is possible that drawing a graph in a polygonal region requires some vertices to be placed at irrational coordinates by contrast the coordinates are known to be bounded in the special case of a convex region or for drawing a path in any polygonal region | [['we', 'prove', 'that', 'the', 'following', 'problem', 'is', 'complete', 'for', 'the', 'existential', 'theory', 'of', 'the', 'reals', 'given', 'a', 'planar', 'graph', 'and', 'a', 'polygonal', 'region', 'with', 'some', 'vertices', 'of', 'the', 'graph', 'assigned', 'to', 'points', 'on', 'the', 'boundary', 'of', 'the', 'region', 'place', 'the', 'remaining', 'vertices', 'to', 'create', 'a', 'planar', 'straightline', 'drawing', 'of', 'the', 'graph', 'inside', 'the', 'region', 'this', 'strengthens', 'an', 'nphardness', 'result', 'by', 'patrignani', 'on', 'extending', 'partial', 'planar', 'graph', 'drawings', 'our', 'result', 'is', 'one', 'of', 'the', 'first', 'showing', 'that', 'a', 'problem', 'of', 'drawing', 'planar', 'graphs', 'with', 'straightline', 'edges', 'is', 'hard', 'for', 'the', 'existential', 'theory', 'of', 'the', 'reals', 'the', 'complexity', 'of', 'the', 'problem', 'is', 'open', 'in', 'the', 'case', 'of', 'a', 'simply', 'connected', 'region', 'we', 'also', 'show', 'that', 'even', 'for', 'integer', 'input', 'coordinates', 'it', 'is', 'possible', 'that', 'drawing', 'a', 'graph', 'in', 'a', 'polygonal', 'region', 'requires', 'some', 'vertices', 'to', 'be', 'placed', 'at', 'irrational', 'coordinates', 'by', 'contrast', 'the', 'coordinates', 'are', 'known', 'to', 'be', 'bounded', 'in', 'the', 'special', 'case', 'of', 'a', 'convex', 'region', 'or', 'for', 'drawing', 'a', 'path', 'in', 'any', 'polygonal', 'region']] | [-0.15120290271206502, 0.07734905465363534, -0.03845703545557849, 0.0070332443324471906, -0.12590228624504768, -0.09929507015204411, 0.0865686550333616, 0.37774126501925337, -0.27853543131377984, -0.2822131135263852, 0.09513546545001353, -0.3119221755254877, -0.13934395744670983, 0.14035159402721178, -0.1285012920836681, 0.04477774026729395, 0.09383144081810181, 0.08636053437309946, 0.00973478064870896, -0.22490486274262678, 0.3266172509446192, -0.0644090704768439, 0.161413984041821, 0.09459021926337591, 0.08278490495125254, 0.03914683065919971, 0.03619850110662587, 0.12844476838270488, -0.12836241761191772, 0.10478122556436395, 0.27789868044158433, 0.15136696453537632, 0.2300218260315664, -0.42911426025939864, -0.19571683164457418, 0.1463208497834729, 0.12125395234114279, 0.07663672670230635, -0.007478018885512659, -0.23998405578391957, 0.0867005734607303, -0.05495070150704837, -0.13774650901601723, 0.07686429228233688, 0.06950371647882132, -0.030056985269409198, -0.27657316850806857, -0.046701989858161284, 0.13345647460432505, 0.029194142325192782, 0.0241631609901923, -0.08552785268613348, -0.014650950445422183, 0.11902290817772958, -0.03683542038394035, 0.1341311547053875, 0.04801401821039389, -0.13052543026875088, -0.15555725016979718, 0.37813958654500135, 0.0428181199208359, -0.21384841529081114, 0.11494806322606246, -0.17468765548264686, -0.16228550847654052, 0.15040920547743905, 0.12806954962041434, 0.17670744026731128, -0.07357882393489769, 0.1411751395407807, -0.1379111876269871, 0.13430182466874802, 0.14099922230284365, -0.0403930380757601, 0.17409962276411936, 0.1432060501852467, 0.1403910433516432, 0.23030690301032566, -0.0009433469560820083, -0.07951683651097405, -0.33641407345678725, -0.11266399247491835, -0.21042929238359803, -0.012666631827096632, -0.16931402282955402, -0.23879785256951683, 0.3826682702381095, 0.08088342778661797, 0.23355980676547425, 0.1027512289755092, 0.27010997603904524, 0.09504640968073662, 0.03833185400288164, 0.14924030864976942, 0.19931972098066844, 0.11786341020106081, -0.0018947810717384142, -0.14695744088170992, 0.05326412501459244, 0.12912445866809572] |
1,802.067 | Cellular switches orchestrate rhythmic circuits | Small inhibitory neuronal circuits have long been identified as key neuronal
motifs to generate and modulate the coexisting rhythms of various motor
functions. Our paper highlights the role of a cellular switching mechanism to
orchestrate such circuits. The cellular switch makes the circuits
reconfigurable, robust, adaptable, and externally controllable. Without this
cellular mechanism, the circuits rhythms entirely rely on specific tunings of
the synaptic connectivity, which makes them rigid, fragile, and difficult to
control externally. We illustrate those properties on the much studied
architecture of a small network controlling both the pyloric and gastric
rhythms of crabs. The cellular switch is provided by a slow negative
conductance often neglected in mathematical modeling of central pattern
generators. We propose that this conductance is simple to model and key to
computational studies of rhythmic circuit neuromodulation.
| q-bio.NC math.OC | small inhibitory neuronal circuits have long been identified as key neuronal motifs to generate and modulate the coexisting rhythms of various motor functions our paper highlights the role of a cellular switching mechanism to orchestrate such circuits the cellular switch makes the circuits reconfigurable robust adaptable and externally controllable without this cellular mechanism the circuits rhythms entirely rely on specific tunings of the synaptic connectivity which makes them rigid fragile and difficult to control externally we illustrate those properties on the much studied architecture of a small network controlling both the pyloric and gastric rhythms of crabs the cellular switch is provided by a slow negative conductance often neglected in mathematical modeling of central pattern generators we propose that this conductance is simple to model and key to computational studies of rhythmic circuit neuromodulation | [['small', 'inhibitory', 'neuronal', 'circuits', 'have', 'long', 'been', 'identified', 'as', 'key', 'neuronal', 'motifs', 'to', 'generate', 'and', 'modulate', 'the', 'coexisting', 'rhythms', 'of', 'various', 'motor', 'functions', 'our', 'paper', 'highlights', 'the', 'role', 'of', 'a', 'cellular', 'switching', 'mechanism', 'to', 'orchestrate', 'such', 'circuits', 'the', 'cellular', 'switch', 'makes', 'the', 'circuits', 'reconfigurable', 'robust', 'adaptable', 'and', 'externally', 'controllable', 'without', 'this', 'cellular', 'mechanism', 'the', 'circuits', 'rhythms', 'entirely', 'rely', 'on', 'specific', 'tunings', 'of', 'the', 'synaptic', 'connectivity', 'which', 'makes', 'them', 'rigid', 'fragile', 'and', 'difficult', 'to', 'control', 'externally', 'we', 'illustrate', 'those', 'properties', 'on', 'the', 'much', 'studied', 'architecture', 'of', 'a', 'small', 'network', 'controlling', 'both', 'the', 'pyloric', 'and', 'gastric', 'rhythms', 'of', 'crabs', 'the', 'cellular', 'switch', 'is', 'provided', 'by', 'a', 'slow', 'negative', 'conductance', 'often', 'neglected', 'in', 'mathematical', 'modeling', 'of', 'central', 'pattern', 'generators', 'we', 'propose', 'that', 'this', 'conductance', 'is', 'simple', 'to', 'model', 'and', 'key', 'to', 'computational', 'studies', 'of', 'rhythmic', 'circuit', 'neuromodulation']] | [-0.20182303096682055, 0.1472758049312145, 0.015784890905245028, 0.0633092702422013, -0.07962943500936476, -0.22425941379615733, 0.07066778938282531, 0.41348071419286414, -0.29196273085814134, -0.2642876073829274, 0.048739084451799905, -0.18724275009234004, -0.33114227899801985, 0.2215911678252255, -0.11655126116238534, 0.05232151541441901, 0.011192091104727405, -0.02833859454979425, 0.0817558899080492, -0.1539652923976919, 0.22839769067889107, 0.06572180196517773, 0.3384418014242356, -0.0013496160416849958, 0.10669217452253979, -0.07623121355323177, -0.00997466773642644, -0.037165308812521954, -0.07929442025710864, 0.158457820546994, 0.28817495110500324, 0.10091885157909466, 0.27875561381815306, -0.550558310391298, -0.249249501577787, 0.11210308793529089, 0.14362881629929336, 0.13257094520168491, -0.007348518222639921, -0.2611707922404827, 0.12331361744775256, -0.155490109891589, -0.07177126970608656, -0.1176817558719707, 0.023381048217050927, 0.07812810360771993, -0.2300498852221323, 0.013781919198826566, 0.07653509701060048, 0.10559793105418447, -0.031727630554684506, -0.04623857094669965, -0.02816315611681915, 0.19463986853735327, -0.027675459488927485, -0.005959173329105017, 0.2446204014643749, -0.15083522610705166, -0.14085478744636387, 0.310864371966932, 0.04329656530171633, -0.19877284283944363, 0.22280601557055765, -0.07142913768957578, -0.12759072517058742, 0.09365593101273277, 0.18453127837308975, 0.03254809688582127, -0.20024530074573052, -0.014913031129851076, 0.032304947507748406, 0.21239305487416907, 0.05730497613966243, 0.04907493678672211, 0.1840733292359692, 0.25051897073359186, 0.03603696174495645, 0.13352702847515135, -0.029478536081481238, -0.09829520110263308, -0.21788219134705558, -0.07152775110791562, -0.13624967694449336, 0.06600885585110301, -0.05995679083017462, -0.18981509935805824, 0.45387975444301354, 0.13555513265894104, 0.1718060258748149, 0.07097357460871033, 0.3026276390804951, 0.07791254439029786, 0.15139558922270063, 0.0016865521172450772, 0.16897895658056863, 0.138928835441831, 0.11939210596897487, -0.2776732187641701, 0.15329952716980297, -0.03054107457343767] |
1,802.06701 | An Adaptive Version of Brandes' Algorithm for Betweenness Centrality | Betweenness centrality---measuring how many shortest paths pass through a
vertex---is one of the most important network analysis concepts for assessing
the relative importance of a vertex. The well-known algorithm of Brandes [J.
Math. Sociol.~'01] computes, on an $n$-vertex and $m$-edge graph, the
betweenness centrality of all vertices in $O(nm)$ worst-case time. In later
work, significant empirical speedups were achieved by preprocessing degree-one
vertices and by graph partitioning based on cut vertices. We contribute an
algorithmic treatment of degree-two vertices, which turns out to be much richer
in mathematical structure than the case of degree-one vertices. Based on these
three algorithmic ingredients, we provide a strengthened worst-case running
time analysis for betweenness centrality algorithms. More specifically, we
prove an adaptive running time bound $O(kn)$, where $k < m$ is the size of a
minimum feedback edge set of the input graph.
| cs.DS cs.SI | betweenness centralitymeasuring how many shortest paths pass through a vertexis one of the most important network analysis concepts for assessing the relative importance of a vertex the wellknown algorithm of brandes j math sociol01 computes on an nvertex and medge graph the betweenness centrality of all vertices in onm worstcase time in later work significant empirical speedups were achieved by preprocessing degreeone vertices and by graph partitioning based on cut vertices we contribute an algorithmic treatment of degreetwo vertices which turns out to be much richer in mathematical structure than the case of degreeone vertices based on these three algorithmic ingredients we provide a strengthened worstcase running time analysis for betweenness centrality algorithms more specifically we prove an adaptive running time bound okn where k m is the size of a minimum feedback edge set of the input graph | [['betweenness', 'centralitymeasuring', 'how', 'many', 'shortest', 'paths', 'pass', 'through', 'a', 'vertexis', 'one', 'of', 'the', 'most', 'important', 'network', 'analysis', 'concepts', 'for', 'assessing', 'the', 'relative', 'importance', 'of', 'a', 'vertex', 'the', 'wellknown', 'algorithm', 'of', 'brandes', 'j', 'math', 'sociol01', 'computes', 'on', 'an', 'nvertex', 'and', 'medge', 'graph', 'the', 'betweenness', 'centrality', 'of', 'all', 'vertices', 'in', 'onm', 'worstcase', 'time', 'in', 'later', 'work', 'significant', 'empirical', 'speedups', 'were', 'achieved', 'by', 'preprocessing', 'degreeone', 'vertices', 'and', 'by', 'graph', 'partitioning', 'based', 'on', 'cut', 'vertices', 'we', 'contribute', 'an', 'algorithmic', 'treatment', 'of', 'degreetwo', 'vertices', 'which', 'turns', 'out', 'to', 'be', 'much', 'richer', 'in', 'mathematical', 'structure', 'than', 'the', 'case', 'of', 'degreeone', 'vertices', 'based', 'on', 'these', 'three', 'algorithmic', 'ingredients', 'we', 'provide', 'a', 'strengthened', 'worstcase', 'running', 'time', 'analysis', 'for', 'betweenness', 'centrality', 'algorithms', 'more', 'specifically', 'we', 'prove', 'an', 'adaptive', 'running', 'time', 'bound', 'okn', 'where', 'k', 'm', 'is', 'the', 'size', 'of', 'a', 'minimum', 'feedback', 'edge', 'set', 'of', 'the', 'input', 'graph']] | [-0.1489007322157062, 0.05297263664429278, -0.10044708692550879, 0.044836377029081206, -0.10542001875514603, -0.15381946532494006, 0.1018475198721075, 0.4034394797824515, -0.23985738272398627, -0.3597801193348406, 0.048551317352308505, -0.30879103857681484, -0.15521408192751765, 0.13474180794026538, -0.06790689469541095, 0.0656818790226038, 0.13800596531055978, 0.07346703434000922, 0.021805764323182625, -0.32050053056082106, 0.25782712852940354, 0.06443686156040605, 0.21133293518184526, 0.0730895097106387, 0.06279064577778198, 0.06040356853661839, -0.07118566823191941, 0.08506905814454727, -0.14869123637446832, 0.09019521717666923, 0.2687602460214026, 0.1975932438423008, 0.31084811483571473, -0.42204843397142694, -0.14406125726835692, 0.1665361058240866, 0.14456118646023028, 0.03458984843575094, 0.0308548203058094, -0.2092831415562507, 0.09325291586462887, -0.09243865578387425, -0.02513374624130152, -0.01019956572803066, 0.09525792948518168, -0.04018103319540119, -0.25471933148946846, -0.016776986605049494, 0.09137847973402934, 0.06310336079663745, 0.06496171471885379, -0.2110440624631284, -0.039846465342527476, 0.11673838780980612, -0.04479561685344807, 0.07561367345453404, 0.09112401795487933, -0.09165016136317075, -0.22038694960236385, 0.34846243916955943, -0.0012628634359476993, -0.1422572969869875, 0.11977519566254854, -0.05061495743746705, -0.19238004077787457, 0.11772434213472639, 0.210992058588411, 0.1682470508180011, -0.1214621507546433, 0.06818314504669294, -0.06265338391034782, 0.14343684285653152, 0.13240326610256864, 0.029579774791593936, 0.06718728655901299, 0.18804139455588645, 0.18672572529612808, 0.15791422228571986, 3.0074790736441227e-05, -0.08416010676677722, -0.2657882426000844, -0.12664122964291463, -0.23463913403290515, 0.0312031613994965, -0.2605762239303765, -0.15879337304710028, 0.4480242910520995, 0.14406618619036368, 0.22444985812077956, 0.11040807978732868, 0.2766868381158394, 0.066529127285642, 0.04317415021154482, 0.2267813850673573, 0.14441188631462865, 0.10358071634340484, 0.02186910618740298, -0.1932606342871783, 0.10867203824968516, 0.15858027792316587] |
1,802.06702 | Dielectric Properties of Metal-Organic Frameworks Probed via Synchrotron
Infrared Reflectivity | We present the frequency-dependant (dynamic) dielectric response of a group
of topical polycrystalline zeolitic imidazolate-based metal-organic framework
(MOF) materials in the extended infrared spectral region. Using
synchrotron-based FTIR spectroscopy in specular reflectance, in conjunction
with density functional theory (DFT) calculations, we have revealed detailed
structure-property trends linking the THz region dielectric response to
framework porosity and structural density. The work demonstrates that MOFs are
promising candidate materials not only for low-\k{appa} electronics
applications but could also be pioneering for terahertz (THz) applications,
such as next-generation broadband communications technologies.
| cond-mat.mtrl-sci | we present the frequencydependant dynamic dielectric response of a group of topical polycrystalline zeolitic imidazolatebased metalorganic framework mof materials in the extended infrared spectral region using synchrotronbased ftir spectroscopy in specular reflectance in conjunction with density functional theory dft calculations we have revealed detailed structureproperty trends linking the thz region dielectric response to framework porosity and structural density the work demonstrates that mofs are promising candidate materials not only for lowkappa electronics applications but could also be pioneering for terahertz thz applications such as nextgeneration broadband communications technologies | [['we', 'present', 'the', 'frequencydependant', 'dynamic', 'dielectric', 'response', 'of', 'a', 'group', 'of', 'topical', 'polycrystalline', 'zeolitic', 'imidazolatebased', 'metalorganic', 'framework', 'mof', 'materials', 'in', 'the', 'extended', 'infrared', 'spectral', 'region', 'using', 'synchrotronbased', 'ftir', 'spectroscopy', 'in', 'specular', 'reflectance', 'in', 'conjunction', 'with', 'density', 'functional', 'theory', 'dft', 'calculations', 'we', 'have', 'revealed', 'detailed', 'structureproperty', 'trends', 'linking', 'the', 'thz', 'region', 'dielectric', 'response', 'to', 'framework', 'porosity', 'and', 'structural', 'density', 'the', 'work', 'demonstrates', 'that', 'mofs', 'are', 'promising', 'candidate', 'materials', 'not', 'only', 'for', 'lowkappa', 'electronics', 'applications', 'but', 'could', 'also', 'be', 'pioneering', 'for', 'terahertz', 'thz', 'applications', 'such', 'as', 'nextgeneration', 'broadband', 'communications', 'technologies']] | [-0.07714141024030402, 0.09134993117688031, -0.09048043545228483, -0.028435961148653436, -0.08177982832722623, -0.1174077239669003, 0.04836510139619182, 0.5122434111718817, -0.2293620747514069, -0.2867050366797324, 0.018555530512855314, -0.3152166098227789, -0.24644530147324775, 0.21026968891229267, -0.007692737933703238, 0.1217678745502028, -0.056918065300500344, -0.1520920884260244, -0.044010901465027154, -0.11303527500673101, 0.171561013880432, 0.08492828878418852, 0.35720228394172315, 0.11979790345027015, -0.011730848410134685, 0.012125594616364473, 0.030642099566115386, 0.02687774577188766, -0.15400594490857583, 0.15275257583921667, 0.405037467691769, -0.028194840419395215, 0.23113366651975004, -0.4725623507609313, -0.3701560316907092, -0.033949332846992315, 0.08492178151962058, 0.03587739174130464, -0.14429029207890745, -0.25176555528466044, 0.04907080813193287, -0.1536159603695931, -0.1097351211904623, -0.137427043608636, -0.038924212385525646, 0.043427670508323385, -0.2160160172029516, 0.06211393826136676, -0.0830587068754623, 0.11958056744166326, -0.1558738284203727, -0.15097268414282208, -0.012214859958267075, 0.045412741048494354, -0.02923353433063061, -0.015258588201912313, 0.22575927956361624, -0.11879153058318229, -0.07757750381555023, 0.36850748680018147, -0.05172770420067954, -0.025474209167148876, 0.17994927810692368, -0.16701556060960965, -0.14697773466100808, 0.15771528582848693, 0.14138396245951967, 0.14239992725063416, -0.21914809560082082, 0.09422667353111587, 0.010811252945006407, 0.2336722395125905, 0.08260610094829195, 0.158981911492823, 0.26685194042778904, 0.2587226065646472, -0.03075192473432713, 0.11541266150467483, -0.1215309033427259, 0.029669614583682054, -0.21314057689588303, -0.21501122716808926, -0.20765042955847993, 0.017818204473320064, -0.05088006328218001, -0.18472849494167443, 0.36834249952700976, 0.1185803440474402, 0.031325737453312026, -0.04817333937376395, 0.2812033152868757, 0.052283145130033896, 0.11614059774344251, -0.026224302888002204, 0.26324054414684744, 0.18183840417313848, 0.18493909166119565, -0.19705612077003068, 0.043940941162538535, -0.02769849743244463] |
1,802.06703 | Searching for new physics with three-particle correlations in $pp$
collisions at the LHC | New phenomena involving pseudorapidity and azimuthal correlations among final
state particles in $pp$ collisions at the LHC can hint at the existence of
hidden sectors beyond the Standard Model. In this paper we rely on a
correlated-cluster picture of multiparticle production, which was shown to
account for the ridge effect, to assess the effect of a hidden sector on
three-particle correlations concluding that there is a potential signature of
new physics that can be directly tested by experiments using well-known
techniques.
| hep-ph hep-ex | new phenomena involving pseudorapidity and azimuthal correlations among final state particles in pp collisions at the lhc can hint at the existence of hidden sectors beyond the standard model in this paper we rely on a correlatedcluster picture of multiparticle production which was shown to account for the ridge effect to assess the effect of a hidden sector on threeparticle correlations concluding that there is a potential signature of new physics that can be directly tested by experiments using wellknown techniques | [['new', 'phenomena', 'involving', 'pseudorapidity', 'and', 'azimuthal', 'correlations', 'among', 'final', 'state', 'particles', 'in', 'pp', 'collisions', 'at', 'the', 'lhc', 'can', 'hint', 'at', 'the', 'existence', 'of', 'hidden', 'sectors', 'beyond', 'the', 'standard', 'model', 'in', 'this', 'paper', 'we', 'rely', 'on', 'a', 'correlatedcluster', 'picture', 'of', 'multiparticle', 'production', 'which', 'was', 'shown', 'to', 'account', 'for', 'the', 'ridge', 'effect', 'to', 'assess', 'the', 'effect', 'of', 'a', 'hidden', 'sector', 'on', 'threeparticle', 'correlations', 'concluding', 'that', 'there', 'is', 'a', 'potential', 'signature', 'of', 'new', 'physics', 'that', 'can', 'be', 'directly', 'tested', 'by', 'experiments', 'using', 'wellknown', 'techniques']] | [-0.06026805551518919, 0.17434424947059596, -0.17349995353724806, 0.147015757416375, -0.038912100868765266, -0.11646514091989957, -0.007725234828831163, 0.2944815802708035, -0.23468356631929055, -0.30722250770777465, 0.019867686441284605, -0.3089877347811125, -0.07620314708910883, 0.17462605547334534, 0.054161814448889345, 0.059175461169797924, 0.08398824400501326, -0.00625908772344701, -0.0269945265550632, -0.20515953982248902, 0.3370137670834083, 0.06723173090722412, 0.24795447421493008, 0.17102067298983456, 0.08124557205592282, 0.04451762777171098, -0.017220643805194412, 0.028130665054777636, -0.08314871921993472, 0.06809723720980401, 0.2251690782693913, 0.08315415744436905, 0.1980200816411525, -0.40971442335285246, -0.20566475053783506, 0.15301217625383287, 0.15862673424417154, 0.1113795008204761, -0.07460042426246219, -0.31679035985143855, 0.0577779219369404, -0.18718962590501179, -0.13557204813114368, -0.08000180222879863, -0.013349712395574897, -0.03772788653877797, -0.2967957871500403, 0.13261728695069905, 0.019984249011031352, 0.04334306714881677, 0.013279917943873443, -0.13096554028161336, -0.028275267186108975, 0.05601621838868596, 0.06318183413313819, 0.01682475627749227, 0.12736034038534855, -0.15818365685845492, -0.22746639943798072, 0.35718930619186723, -0.05401868470944464, -0.18776837387122214, 0.2309587516821921, -0.184759414952714, -0.165480704291258, 0.10015434632077813, 0.25625534118153154, 0.04670493495650589, -0.19416424367809668, 0.05486974350569653, -0.05215543889207765, 0.1964799550914904, 0.03281831491913181, 0.06071675891726045, 0.22587667908519507, 0.1830567644094117, -0.0033200187142938377, 0.12682692193047843, -0.1182616335718194, -0.13050774550792993, -0.3867774397978792, -0.1272671338694636, -0.1346765541471541, -0.013257143044029362, -0.0010209557598500397, -0.07328059962419502, 0.41216202348005027, 0.15911266226321458, 0.22507052985019982, -0.04413010596617824, 0.2562908570864238, 0.068529472744558, 0.1052115340367891, 0.04090955757419579, 0.31899831176997395, 0.11416034653375391, 0.12584446055116133, -0.19483703595324187, 0.10798657131381333, 0.05557527075288817] |
1,802.06704 | Quantum simulation of lattice gauge theories using Wilson fermions | Quantum simulators have the exciting prospect of giving access to real-time
dynamics of lattice gauge theories, in particular in regimes that are difficult
to compute on classical computers. Future progress towards scalable quantum
simulation of lattice gauge theories, however, hinges crucially on the
efficient use of experimental resources. As we argue in this work, due to the
fundamental non-uniqueness of discretizing the relativistic Dirac Hamiltonian,
the lattice representation of gauge theories allows for an optimization that up
to now has been left unexplored. We exemplify our discussion with lattice
quantum electrodynamics in two-dimensional space-time, where we show that the
formulation through Wilson fermions provides several advantages over the
previously considered staggered fermions. Notably, it enables a strongly
simplified optical lattice setup and it reduces the number of degrees of
freedom required to simulate dynamical gauge fields. Exploiting the optimal
representation, we propose an experiment based on a mixture of ultracold atoms
trapped in a tilted optical lattice. Using numerical benchmark simulations, we
demonstrate that a state-of-the-art quantum simulator may access the Schwinger
mechanism and map out its non-perturbative onset.
| cond-mat.quant-gas hep-lat hep-ph quant-ph | quantum simulators have the exciting prospect of giving access to realtime dynamics of lattice gauge theories in particular in regimes that are difficult to compute on classical computers future progress towards scalable quantum simulation of lattice gauge theories however hinges crucially on the efficient use of experimental resources as we argue in this work due to the fundamental nonuniqueness of discretizing the relativistic dirac hamiltonian the lattice representation of gauge theories allows for an optimization that up to now has been left unexplored we exemplify our discussion with lattice quantum electrodynamics in twodimensional spacetime where we show that the formulation through wilson fermions provides several advantages over the previously considered staggered fermions notably it enables a strongly simplified optical lattice setup and it reduces the number of degrees of freedom required to simulate dynamical gauge fields exploiting the optimal representation we propose an experiment based on a mixture of ultracold atoms trapped in a tilted optical lattice using numerical benchmark simulations we demonstrate that a stateoftheart quantum simulator may access the schwinger mechanism and map out its nonperturbative onset | [['quantum', 'simulators', 'have', 'the', 'exciting', 'prospect', 'of', 'giving', 'access', 'to', 'realtime', 'dynamics', 'of', 'lattice', 'gauge', 'theories', 'in', 'particular', 'in', 'regimes', 'that', 'are', 'difficult', 'to', 'compute', 'on', 'classical', 'computers', 'future', 'progress', 'towards', 'scalable', 'quantum', 'simulation', 'of', 'lattice', 'gauge', 'theories', 'however', 'hinges', 'crucially', 'on', 'the', 'efficient', 'use', 'of', 'experimental', 'resources', 'as', 'we', 'argue', 'in', 'this', 'work', 'due', 'to', 'the', 'fundamental', 'nonuniqueness', 'of', 'discretizing', 'the', 'relativistic', 'dirac', 'hamiltonian', 'the', 'lattice', 'representation', 'of', 'gauge', 'theories', 'allows', 'for', 'an', 'optimization', 'that', 'up', 'to', 'now', 'has', 'been', 'left', 'unexplored', 'we', 'exemplify', 'our', 'discussion', 'with', 'lattice', 'quantum', 'electrodynamics', 'in', 'twodimensional', 'spacetime', 'where', 'we', 'show', 'that', 'the', 'formulation', 'through', 'wilson', 'fermions', 'provides', 'several', 'advantages', 'over', 'the', 'previously', 'considered', 'staggered', 'fermions', 'notably', 'it', 'enables', 'a', 'strongly', 'simplified', 'optical', 'lattice', 'setup', 'and', 'it', 'reduces', 'the', 'number', 'of', 'degrees', 'of', 'freedom', 'required', 'to', 'simulate', 'dynamical', 'gauge', 'fields', 'exploiting', 'the', 'optimal', 'representation', 'we', 'propose', 'an', 'experiment', 'based', 'on', 'a', 'mixture', 'of', 'ultracold', 'atoms', 'trapped', 'in', 'a', 'tilted', 'optical', 'lattice', 'using', 'numerical', 'benchmark', 'simulations', 'we', 'demonstrate', 'that', 'a', 'stateoftheart', 'quantum', 'simulator', 'may', 'access', 'the', 'schwinger', 'mechanism', 'and', 'map', 'out', 'its', 'nonperturbative', 'onset']] | [-0.14361023387543898, 0.16934430488666868, -0.09335416748042755, 0.013331341486314947, -0.08771168907542386, -0.16751412974017563, 0.0598930321001661, 0.39381323127315365, -0.2238866724334033, -0.25936513035376063, 0.04485258455817489, -0.23595595542042627, -0.16655532863380013, 0.20297241203653413, -0.01965047908695384, 0.09827950325704768, 0.06219766294198662, -0.013140193467657992, -0.08173242292767546, -0.2779578494243636, 0.26228700006281824, 0.07435388095395941, 0.30117139446174507, 0.08072716017206871, 0.11050500692773672, 0.022633426537211756, -0.002299240994522109, -0.020961179388082174, -0.10996914198348955, 0.1370846877842309, 0.19823505535758199, 0.04271479582221523, 0.23442877412841306, -0.46629916515992176, -0.258473712623161, 0.04989249719821916, 0.18650620710364849, 0.18310427520028705, -0.06506930294010252, -0.29000282615901873, 0.010128687792418618, -0.183651591003053, -0.14321889161449655, -0.1620609757058614, -0.029379177353391683, -0.06732731827407264, -0.244088660587437, 0.025332015928651034, -0.010923336757062127, 0.07887981233301485, -0.009853581719389238, -0.0714309201419728, 0.029290970452598104, 0.08584452539945135, 0.005712664978807615, 0.04296931430083497, 0.1018039401810533, -0.17763874311307082, -0.19963670997911617, 0.4557273276670519, -0.04933265452312212, -0.2074003004346709, 0.21881632378660454, -0.1145011402260741, -0.1365263745723313, 0.08999480942260785, 0.16559715536370997, 0.11313218775585128, -0.1337276480197074, 0.14922851469568055, -0.07760161458509428, 0.1422447370990913, 0.014892224924815766, 0.07509120976208974, 0.25020434188542046, 0.16976072443727216, 0.05707712136482165, 0.15812423257105176, -0.033885027685166234, -0.2021802257259985, -0.2910399023306803, -0.14312436720148228, -0.1862734414626683, 0.09112068197388182, -0.05738891069318803, -0.15095307951137507, 0.3795974346036456, 0.24957733545497882, 0.12990707728762033, 0.0014612024842485703, 0.26653227323468504, 0.08357773385109515, 0.07186645924831694, 0.049259448915657554, 0.22974656563442117, 0.1373607158640077, 0.06835361414227385, -0.2742550067275804, -0.07454132746421217, 0.08563734887638676] |
1,802.06705 | Microdosimetry in ion-beam therapy: studying and comparing outcomes from
different detectors | Experimental studies of microdosimetry in therapeutic ion beams have been
performed using several detectors. The differences among them lie on the
shapes, the site sizes, and the material. Coin-shaped solid-state detectors
made of silicon or diamond with thickness varying from 0.3 to 10 microns, as
well as proportional counters with spherical and cylindrical sensitive volumes
filled with tissue-equivalent gas are the microdosimeters used in therapeutic
proton and carbon-ion beams. One goal of microdosimetry in the clinical
environment is providing repeatable specification of the radiation quality of
the radiation field. A methodology should be developed to provide,
independently from the heterogeneous information collected with the different
detectors, a detector-independent specification of the radiation quality.
Historically the specification of the radiation quality is provided either, in
terms of Linear Energy Transfer (LET) or in terms of lineal energy, y. First
this study focuses on identifying the correlation between the distributions of
LET and the lineal energy spectra as well as the correspondence between their
mean values calculated in frequency and in dose. The evaluation is based on the
method of LET analysis described by Kellerer making the adaptation to the
peculiarities of the therapeutic ion-beam where the pristine irradiation is
unidirectional and made of a single type of mono-energetic ions. The second
objective of this study is to interpret the spectrum collected by a slab and
estimate what the spectrum would be if it was collected by a detector different
in shape, material, or size. An example confirms the method starting from the
simulated lineal energy spectrum obtained for carbon ions in a slab detector of
graphite and converting it to the spectruma that would be obtained in the same
radiation field for spherical, cylindrical, and slab detector made of water.
| physics.ins-det physics.med-ph | experimental studies of microdosimetry in therapeutic ion beams have been performed using several detectors the differences among them lie on the shapes the site sizes and the material coinshaped solidstate detectors made of silicon or diamond with thickness varying from 03 to 10 microns as well as proportional counters with spherical and cylindrical sensitive volumes filled with tissueequivalent gas are the microdosimeters used in therapeutic proton and carbonion beams one goal of microdosimetry in the clinical environment is providing repeatable specification of the radiation quality of the radiation field a methodology should be developed to provide independently from the heterogeneous information collected with the different detectors a detectorindependent specification of the radiation quality historically the specification of the radiation quality is provided either in terms of linear energy transfer let or in terms of lineal energy y first this study focuses on identifying the correlation between the distributions of let and the lineal energy spectra as well as the correspondence between their mean values calculated in frequency and in dose the evaluation is based on the method of let analysis described by kellerer making the adaptation to the peculiarities of the therapeutic ionbeam where the pristine irradiation is unidirectional and made of a single type of monoenergetic ions the second objective of this study is to interpret the spectrum collected by a slab and estimate what the spectrum would be if it was collected by a detector different in shape material or size an example confirms the method starting from the simulated lineal energy spectrum obtained for carbon ions in a slab detector of graphite and converting it to the spectruma that would be obtained in the same radiation field for spherical cylindrical and slab detector made of water | [['experimental', 'studies', 'of', 'microdosimetry', 'in', 'therapeutic', 'ion', 'beams', 'have', 'been', 'performed', 'using', 'several', 'detectors', 'the', 'differences', 'among', 'them', 'lie', 'on', 'the', 'shapes', 'the', 'site', 'sizes', 'and', 'the', 'material', 'coinshaped', 'solidstate', 'detectors', 'made', 'of', 'silicon', 'or', 'diamond', 'with', 'thickness', 'varying', 'from', '03', 'to', '10', 'microns', 'as', 'well', 'as', 'proportional', 'counters', 'with', 'spherical', 'and', 'cylindrical', 'sensitive', 'volumes', 'filled', 'with', 'tissueequivalent', 'gas', 'are', 'the', 'microdosimeters', 'used', 'in', 'therapeutic', 'proton', 'and', 'carbonion', 'beams', 'one', 'goal', 'of', 'microdosimetry', 'in', 'the', 'clinical', 'environment', 'is', 'providing', 'repeatable', 'specification', 'of', 'the', 'radiation', 'quality', 'of', 'the', 'radiation', 'field', 'a', 'methodology', 'should', 'be', 'developed', 'to', 'provide', 'independently', 'from', 'the', 'heterogeneous', 'information', 'collected', 'with', 'the', 'different', 'detectors', 'a', 'detectorindependent', 'specification', 'of', 'the', 'radiation', 'quality', 'historically', 'the', 'specification', 'of', 'the', 'radiation', 'quality', 'is', 'provided', 'either', 'in', 'terms', 'of', 'linear', 'energy', 'transfer', 'let', 'or', 'in', 'terms', 'of', 'lineal', 'energy', 'y', 'first', 'this', 'study', 'focuses', 'on', 'identifying', 'the', 'correlation', 'between', 'the', 'distributions', 'of', 'let', 'and', 'the', 'lineal', 'energy', 'spectra', 'as', 'well', 'as', 'the', 'correspondence', 'between', 'their', 'mean', 'values', 'calculated', 'in', 'frequency', 'and', 'in', 'dose', 'the', 'evaluation', 'is', 'based', 'on', 'the', 'method', 'of', 'let', 'analysis', 'described', 'by', 'kellerer', 'making', 'the', 'adaptation', 'to', 'the', 'peculiarities', 'of', 'the', 'therapeutic', 'ionbeam', 'where', 'the', 'pristine', 'irradiation', 'is', 'unidirectional', 'and', 'made', 'of', 'a', 'single', 'type', 'of', 'monoenergetic', 'ions', 'the', 'second', 'objective', 'of', 'this', 'study', 'is', 'to', 'interpret', 'the', 'spectrum', 'collected', 'by', 'a', 'slab', 'and', 'estimate', 'what', 'the', 'spectrum', 'would', 'be', 'if', 'it', 'was', 'collected', 'by', 'a', 'detector', 'different', 'in', 'shape', 'material', 'or', 'size', 'an', 'example', 'confirms', 'the', 'method', 'starting', 'from', 'the', 'simulated', 'lineal', 'energy', 'spectrum', 'obtained', 'for', 'carbon', 'ions', 'in', 'a', 'slab', 'detector', 'of', 'graphite', 'and', 'converting', 'it', 'to', 'the', 'spectruma', 'that', 'would', 'be', 'obtained', 'in', 'the', 'same', 'radiation', 'field', 'for', 'spherical', 'cylindrical', 'and', 'slab', 'detector', 'made', 'of', 'water']] | [-0.039352315999867674, 0.12465749929610596, -0.06584803659374784, 0.021253731068489806, -0.012153284681006902, -0.11674014028897574, -0.007188558871354843, 0.41044441993163333, -0.20855248124599912, -0.3533772317536876, 0.07479351610375264, -0.3053560053916706, -0.025687307155470424, 0.2027853698427513, -0.031244629020932477, 0.04473267191862209, 0.04298658209661418, 0.02149223203404534, -0.04390974361563056, -0.1758191065135889, 0.27635572975150957, 0.1254546717985595, 0.29932095484892457, 0.05290448884901555, 0.08254133714062814, 0.01585823357209096, -0.026001005490287776, 0.017680947551218216, -0.10019174261552137, 0.10982688684065142, 0.26389579769493265, 0.10237726249946248, 0.2359527332906186, -0.44425904249142895, -0.21449362787120743, 0.08492760607349696, 0.1014232919263436, 0.05389961057816363, -0.06134618672165851, -0.2664714464260661, 0.05477340155052352, -0.14919132433664573, -0.12961508640175756, 0.00859533604851012, -0.007056804154821078, 0.05757899406018832, -0.25645628419480826, 0.023515705888902685, -0.002793748084235067, 0.06595765983358104, -0.09391709657885679, -0.13644099995033096, -0.03635394580107351, 0.10510102544508823, 0.038033152378378406, 0.03221453278153512, 0.17519891586881586, -0.10696554937130587, -0.06314308191580659, 0.38961488455339277, -0.04786891193950114, -0.1760782474191139, 0.17122263201181404, -0.16873901015965315, -0.033847548407486244, 0.16736716062125817, 0.16339200391849495, 0.109658703918022, -0.17148640571536905, 0.026683911679375255, 0.006313390938974008, 0.18163877035289014, 0.10807520366121304, 0.004823763968377579, 0.21693861701944356, 0.195045419904981, -0.01490845844938131, 0.1602900400303993, -0.1215336382558824, -0.005156445501936853, -0.2750703129456589, -0.16282139336998583, -0.1895667282363095, 0.05504756273810495, -0.050724656200586034, -0.16561024797308008, 0.38520926843277253, 0.10117800726850586, 0.16753051860277454, -0.01804323739758352, 0.29867343613894115, 0.06512651820456161, 0.07223780291440543, 0.009774720414707158, 0.2486205732446644, 0.11772019141807971, 0.1106802494628582, -0.21140482472363317, 0.07193459989016272, -0.0007190072247012151] |
1,802.06706 | Integration of Carrier Aggregation and Dual Connectivity for the ns-3
mmWave Module | Thanks to the wide availability of bandwidth, the millimeter wave (mmWave)
frequencies will provide very high data rates to mobile users in next
generation 5G cellular networks. However, mmWave links suffer from high
isotropic pathloss and blockage from common materials, and are subject to an
intermittent channel quality. Therefore, protocols and solutions at different
layers in the cellular network and the TCP/IP protocol stack have been proposed
and studied. A valuable tool for the end-to-end performance analysis of mmWave
cellular networks is the ns-3 mmWave module, which already models in detail the
channel, Physical (PHY) and Medium Access Control (MAC) layers, and extends the
Long Term Evolution (LTE) stack for the higher layers. In this paper we present
an implementation for the ns-3 mmWave module of multi connectivity techniques
for 3GPP New Radio (NR) at mmWave frequencies, namely Carrier Aggregation (CA)
and Dual Connectivity (DC), and discuss how they can be integrated to increase
the functionalities offered by the ns-3 mmWave module.
| cs.NI | thanks to the wide availability of bandwidth the millimeter wave mmwave frequencies will provide very high data rates to mobile users in next generation 5g cellular networks however mmwave links suffer from high isotropic pathloss and blockage from common materials and are subject to an intermittent channel quality therefore protocols and solutions at different layers in the cellular network and the tcpip protocol stack have been proposed and studied a valuable tool for the endtoend performance analysis of mmwave cellular networks is the ns3 mmwave module which already models in detail the channel physical phy and medium access control mac layers and extends the long term evolution lte stack for the higher layers in this paper we present an implementation for the ns3 mmwave module of multi connectivity techniques for 3gpp new radio nr at mmwave frequencies namely carrier aggregation ca and dual connectivity dc and discuss how they can be integrated to increase the functionalities offered by the ns3 mmwave module | [['thanks', 'to', 'the', 'wide', 'availability', 'of', 'bandwidth', 'the', 'millimeter', 'wave', 'mmwave', 'frequencies', 'will', 'provide', 'very', 'high', 'data', 'rates', 'to', 'mobile', 'users', 'in', 'next', 'generation', '5g', 'cellular', 'networks', 'however', 'mmwave', 'links', 'suffer', 'from', 'high', 'isotropic', 'pathloss', 'and', 'blockage', 'from', 'common', 'materials', 'and', 'are', 'subject', 'to', 'an', 'intermittent', 'channel', 'quality', 'therefore', 'protocols', 'and', 'solutions', 'at', 'different', 'layers', 'in', 'the', 'cellular', 'network', 'and', 'the', 'tcpip', 'protocol', 'stack', 'have', 'been', 'proposed', 'and', 'studied', 'a', 'valuable', 'tool', 'for', 'the', 'endtoend', 'performance', 'analysis', 'of', 'mmwave', 'cellular', 'networks', 'is', 'the', 'ns3', 'mmwave', 'module', 'which', 'already', 'models', 'in', 'detail', 'the', 'channel', 'physical', 'phy', 'and', 'medium', 'access', 'control', 'mac', 'layers', 'and', 'extends', 'the', 'long', 'term', 'evolution', 'lte', 'stack', 'for', 'the', 'higher', 'layers', 'in', 'this', 'paper', 'we', 'present', 'an', 'implementation', 'for', 'the', 'ns3', 'mmwave', 'module', 'of', 'multi', 'connectivity', 'techniques', 'for', '3gpp', 'new', 'radio', 'nr', 'at', 'mmwave', 'frequencies', 'namely', 'carrier', 'aggregation', 'ca', 'and', 'dual', 'connectivity', 'dc', 'and', 'discuss', 'how', 'they', 'can', 'be', 'integrated', 'to', 'increase', 'the', 'functionalities', 'offered', 'by', 'the', 'ns3', 'mmwave', 'module']] | [-0.24938369706204092, 0.0229970590489195, 0.0624448860662035, 0.010870198658839971, -0.05601890023832244, -0.22641604084142106, 0.07112243585863415, 0.4505440754425011, -0.2765612825061436, -0.23094854521116726, 0.10845529117023596, -0.2084950354254954, -0.1984125554093079, 0.16766266112595243, -0.05043176657025829, 0.08067207548042966, 0.0741848206480988, -0.07411534938926055, 0.01292792584295787, -0.20425392766655595, 0.27904946703814476, 0.17909661451797287, 0.414128658539949, 0.07074815777624831, 0.042596429886072186, -0.041426595110722164, -0.049186589995422116, -0.07955144689904158, -0.0967219900842871, 0.10985605638577706, 0.36755917444466313, 0.14978896355719765, 0.2468778217257357, -0.4866359404713651, -0.33083257560882673, 0.00581159897401561, 0.18405310467839886, 0.05055701101908782, -0.010939071136727974, -0.2827583629203914, 0.18141876274926794, -0.3042047463679387, -0.06509877404163557, 0.030198816302013987, -0.04580750656141727, 0.09030671680941144, -0.2970912400920542, -0.04979774706930865, -0.04873843932305865, 0.07168714987993655, -0.05615588312359228, -0.087836296406839, -0.006232739250854026, 0.1887247457764008, -0.022597147403342396, -0.00842050947809454, 0.09815402430687732, -0.1605546443455818, -0.09016235576896572, 0.3793179819210904, -0.007980712534238895, -0.19910913324098528, 0.23196427448563578, -0.05358418828899754, -0.11752295245367597, 0.1505315602429349, 0.2533712308698644, -0.019724664933703565, -0.202457082181893, 0.025863450641074093, 0.02370409269101794, 0.16838728350782653, 0.07484631067613301, 0.17546833132934056, 0.1750017136240516, 0.24857485025868187, 0.09341905188867478, 0.07375892957623612, -0.15479906657595693, -0.054478206737886795, -0.18216622386840575, -0.1275670248468947, -0.17410869443685645, 0.0401251832689597, -0.1010557532267908, -0.0900706345959923, 0.4169719951733211, 0.19143893014651114, 0.08858408981267317, 0.11273230801632536, 0.3760746452313514, 0.07476658687386432, 0.12883709900851512, 0.11760822082524774, 0.20064864446549896, 0.09926948919576122, 0.26948464399686567, -0.12985867309674368, 0.05326681083102745, -0.03239972450925658] |
1,802.06707 | Formal deformation theory in left-proper model categories | We develop the notion of deformation of a morphism in a left-proper model
category. As an application we provide a geometric/homotopic description of
deformations of commutative (non-positively) graded differential algebras over
a local DG-Artin ring.
| math.CT math.AG | we develop the notion of deformation of a morphism in a leftproper model category as an application we provide a geometrichomotopic description of deformations of commutative nonpositively graded differential algebras over a local dgartin ring | [['we', 'develop', 'the', 'notion', 'of', 'deformation', 'of', 'a', 'morphism', 'in', 'a', 'leftproper', 'model', 'category', 'as', 'an', 'application', 'we', 'provide', 'a', 'geometrichomotopic', 'description', 'of', 'deformations', 'of', 'commutative', 'nonpositively', 'graded', 'differential', 'algebras', 'over', 'a', 'local', 'dgartin', 'ring']] | [-0.21040563154383563, -0.050658607225614105, -0.14305506602977403, 0.05331144749652594, -0.0942038121575024, -0.09672285473789088, -0.10163859697058797, 0.3585599723737687, -0.44419459633354563, -0.17730792736983858, 0.06364583699541981, -0.1838354467181489, -0.17670571629423648, 0.16406964410998626, -0.22862566882395186, -0.1293957480811514, 0.042215171619318426, 0.13058950036884198, -0.1288463989039883, -0.2081170615274459, 0.4216881823667791, 0.016758936479163822, 0.2187283197999932, 0.0103591202350799, 0.16151006933068857, 0.06378794896590989, -0.023236109875142574, 0.09107359882909805, -0.22556595097921672, 0.17423273096210323, 0.3353380765183829, 0.02928028389578685, 0.23839311852134415, -0.3792114406824112, -0.0924993462394923, 0.14965567644685507, 0.1242741709575057, 0.08747253858018667, -0.08056519198726164, -0.2504700622521341, 0.0736714935337659, -0.3450543924700469, -0.1415213615691755, -0.1083309228415601, 0.08304267202038318, -0.006060278974473476, -0.26270419741922524, -0.033207969536306337, 0.1318071724672336, 0.21141244424507022, -0.15834557637572289, 0.04908767840242945, -0.04920758118532831, 0.016652514823363163, -0.14663319150349707, -0.015010927963885479, 0.1828790583240334, -0.114804747121525, -0.16578975625452586, 0.36648321186657995, -0.08175271755317226, -0.2635148671179195, 0.07387069810647517, -0.135890838020714, -0.12167589311138727, 0.13279283605515957, 0.09271407884079963, 0.19167604873655364, -0.046785042621195316, 0.21544999376055785, -0.16396637074649334, 0.05177093340898864, 0.05008879827801138, 0.03180323264678009, 0.1835728533405927, 0.21666017870302312, 0.08572388235279504, 0.15592476872552652, 0.01511184757691808, -0.041478091618046165, -0.43215088080614805, -0.2234122366644442, 0.0031400026637129486, 0.19892592483665794, -0.10176232867524959, -0.2608043772634119, 0.44593076466117054, 0.07935201399959624, 0.24374750806600787, 0.13354222517227754, 0.20353677129605785, 0.004257331220287597, 0.10884131805505604, -0.05615832388866693, 0.10319488841923885, 0.304496648197528, 0.005939344275248004, -0.045117870322428644, -0.05659612762974575, 0.22734863255755045] |
1,802.06708 | Deep Echo State Networks for Diagnosis of Parkinson's Disease | In this paper, we introduce a novel approach for diagnosis of Parkinson's
Disease (PD) based on deep Echo State Networks (ESNs). The identification of PD
is performed by analyzing the whole time-series collected from a tablet device
during the sketching of spiral tests, without the need for feature extraction
and data preprocessing. We evaluated the proposed approach on a public dataset
of spiral tests. The results of experimental analysis show that DeepESNs
perform significantly better than shallow ESN model. Overall, the proposed
approach obtains state-of-the-art results in the identification of PD on this
kind of temporal data.
| cs.LG | in this paper we introduce a novel approach for diagnosis of parkinsons disease pd based on deep echo state networks esns the identification of pd is performed by analyzing the whole timeseries collected from a tablet device during the sketching of spiral tests without the need for feature extraction and data preprocessing we evaluated the proposed approach on a public dataset of spiral tests the results of experimental analysis show that deepesns perform significantly better than shallow esn model overall the proposed approach obtains stateoftheart results in the identification of pd on this kind of temporal data | [['in', 'this', 'paper', 'we', 'introduce', 'a', 'novel', 'approach', 'for', 'diagnosis', 'of', 'parkinsons', 'disease', 'pd', 'based', 'on', 'deep', 'echo', 'state', 'networks', 'esns', 'the', 'identification', 'of', 'pd', 'is', 'performed', 'by', 'analyzing', 'the', 'whole', 'timeseries', 'collected', 'from', 'a', 'tablet', 'device', 'during', 'the', 'sketching', 'of', 'spiral', 'tests', 'without', 'the', 'need', 'for', 'feature', 'extraction', 'and', 'data', 'preprocessing', 'we', 'evaluated', 'the', 'proposed', 'approach', 'on', 'a', 'public', 'dataset', 'of', 'spiral', 'tests', 'the', 'results', 'of', 'experimental', 'analysis', 'show', 'that', 'deepesns', 'perform', 'significantly', 'better', 'than', 'shallow', 'esn', 'model', 'overall', 'the', 'proposed', 'approach', 'obtains', 'stateoftheart', 'results', 'in', 'the', 'identification', 'of', 'pd', 'on', 'this', 'kind', 'of', 'temporal', 'data']] | [-0.04421175372565991, -0.04596475539632987, -0.11077562954094376, 0.03897982574495266, -0.04544833133515624, -0.1478552257056473, 0.06429360979404684, 0.37146240710904915, -0.19905363488942385, -0.3217610806111515, 0.09379599210518152, -0.2897496035552977, -0.20352215435087068, 0.24194136437403096, -0.05609920220065516, 0.07632931805763048, 0.1797950323287052, 0.04280294539387693, -0.06249983440460541, -0.2629228171594825, 0.3028040605059527, 0.050118708788338066, 0.3789706589634885, -0.0013253248690329876, 0.09736367200078808, 0.03532609845674837, -0.07798567069598387, -0.013539536971330028, -0.06815301216264152, 0.1565620640326368, 0.26308947886081085, 0.22042631654107234, 0.3013073066489521, -0.4384811437621559, -0.24374851095730188, 0.04249495078723148, 0.13231551333224958, 0.10849230167859224, -0.05762500679672494, -0.3610620856592336, 0.1004480467857217, -0.14969986215108985, -0.05386240036015581, -0.11232179879527732, -0.04585846392053765, -0.0351032409540944, -0.29293150392351386, 0.096362500936369, 0.05580315026262602, 0.11944230415464677, -0.08819748612466394, -0.1265382415941465, 0.01203230682030781, 0.11668179761714388, 0.019206892767412224, 0.03702849320606472, 0.14098273216357896, -0.1552156264288831, -0.15185281281004248, 0.30894414631208195, -0.07665971724617117, -0.14664042727138424, 0.16598935251618668, -0.07903380871068724, -0.13119732316333763, 0.08888435695493191, 0.24372362827440514, 0.13215361345444143, -0.16105901296298528, -0.042995733180750624, -0.04577306224052439, 0.21321799010806478, 0.00015397223922395214, -0.032255009375392586, 0.1010676026152274, 0.32741054132119896, -0.019430282621730847, 0.1297715506516397, -0.1943962457085739, -0.06513359474459875, -0.22334691336301646, -0.13451983599165052, -0.18178097721304476, -0.0007885772454043486, -0.10329115850663115, -0.1142695728574217, 0.44070598299701497, 0.22417260122667884, 0.176572918210217, 0.056095427555060876, 0.33824354479300606, 0.002746991361923439, 0.12307064937302824, 0.034486908038367625, 0.20828990278208687, 0.007816328438174114, 0.15554408939824121, -0.24001596501509936, 0.1323602462389036, 0.034996437525722325] |
1,802.06709 | Cavity-enhanced spectroscopy of a few-ion ensemble in Eu3+:Y2O3 | We report on the coupling of the emission from a single europium-doped
nanocrystal to a fiber-based microcavity under cryogenic conditions. As a first
step, we study the sample properties and observe a strong correlation between
emission lifetime and brightness, as well as a lifetime reduction for
nanocrystals embedded in a polymer film. This is explained by differences in
the local density of states. We furthermore quantify the scattering loss of a
nanocrystal inside the cavity and use this to deduce the crystal size. Finally,
by resonantly coupling the cavity to a selected transition, we perform
cavity-enhanced spectroscopy to measure the inhomogeneous linewidth, and detect
the fluorescence from an ensemble of few ions in the regime of power
broadening. We observe an increased fluorescence rate consistent with Purcell
enhancement. The results represent an important step towards the efficient
readout of single rare-earth ions with excellent optical and spin coherence
properties, which is promising for applications in quantum communication and
distributed quantum computation.
| physics.optics quant-ph | we report on the coupling of the emission from a single europiumdoped nanocrystal to a fiberbased microcavity under cryogenic conditions as a first step we study the sample properties and observe a strong correlation between emission lifetime and brightness as well as a lifetime reduction for nanocrystals embedded in a polymer film this is explained by differences in the local density of states we furthermore quantify the scattering loss of a nanocrystal inside the cavity and use this to deduce the crystal size finally by resonantly coupling the cavity to a selected transition we perform cavityenhanced spectroscopy to measure the inhomogeneous linewidth and detect the fluorescence from an ensemble of few ions in the regime of power broadening we observe an increased fluorescence rate consistent with purcell enhancement the results represent an important step towards the efficient readout of single rareearth ions with excellent optical and spin coherence properties which is promising for applications in quantum communication and distributed quantum computation | [['we', 'report', 'on', 'the', 'coupling', 'of', 'the', 'emission', 'from', 'a', 'single', 'europiumdoped', 'nanocrystal', 'to', 'a', 'fiberbased', 'microcavity', 'under', 'cryogenic', 'conditions', 'as', 'a', 'first', 'step', 'we', 'study', 'the', 'sample', 'properties', 'and', 'observe', 'a', 'strong', 'correlation', 'between', 'emission', 'lifetime', 'and', 'brightness', 'as', 'well', 'as', 'a', 'lifetime', 'reduction', 'for', 'nanocrystals', 'embedded', 'in', 'a', 'polymer', 'film', 'this', 'is', 'explained', 'by', 'differences', 'in', 'the', 'local', 'density', 'of', 'states', 'we', 'furthermore', 'quantify', 'the', 'scattering', 'loss', 'of', 'a', 'nanocrystal', 'inside', 'the', 'cavity', 'and', 'use', 'this', 'to', 'deduce', 'the', 'crystal', 'size', 'finally', 'by', 'resonantly', 'coupling', 'the', 'cavity', 'to', 'a', 'selected', 'transition', 'we', 'perform', 'cavityenhanced', 'spectroscopy', 'to', 'measure', 'the', 'inhomogeneous', 'linewidth', 'and', 'detect', 'the', 'fluorescence', 'from', 'an', 'ensemble', 'of', 'few', 'ions', 'in', 'the', 'regime', 'of', 'power', 'broadening', 'we', 'observe', 'an', 'increased', 'fluorescence', 'rate', 'consistent', 'with', 'purcell', 'enhancement', 'the', 'results', 'represent', 'an', 'important', 'step', 'towards', 'the', 'efficient', 'readout', 'of', 'single', 'rareearth', 'ions', 'with', 'excellent', 'optical', 'and', 'spin', 'coherence', 'properties', 'which', 'is', 'promising', 'for', 'applications', 'in', 'quantum', 'communication', 'and', 'distributed', 'quantum', 'computation']] | [-0.09011119107953677, 0.14804194831990375, -0.03704915492454116, -0.006657918544395057, 0.0332870706467548, -0.11910402650441627, 0.07248632154667531, 0.4649375360806166, -0.2490832637055482, -0.2979123721171101, 0.03497571615004762, -0.29579620877778307, -0.07615236528159947, 0.2068703715886157, 0.0045473595612561465, 0.04543840330707268, 0.024458240520972643, -0.024196454318043608, -0.04206878776656267, -0.13145251462947555, 0.2487193852075902, 0.08964200913819328, 0.3192029355602883, 0.08905046459060359, 0.09444674863610185, -0.007973172051126357, 0.06026811494856425, -0.02137445253450192, -0.1237016223249552, 0.1216491432929186, 0.23964295644451927, 0.017981996097434196, 0.2489937849947315, -0.42319300370152585, -0.2070158285823483, 0.05140493927026017, 0.17055950725670926, 0.16027156146089921, -0.11487849952919865, -0.2746295217809308, 0.004868862893062164, -0.1412900376968051, -0.13008022594109456, -0.044872218980135756, -0.00021124097246746099, 0.0073667701394499645, -0.267067886692304, 0.06506657090778492, 0.039962155489187384, 0.06374668011005089, -0.031214435220412586, -0.020954976083930606, 0.01665230944459124, 0.08897347365916701, -0.028299327925287235, -0.0012064575736833194, 0.2141540341183358, -0.1257475841897453, -0.11211490237135266, 0.3578862225208779, -0.12897487627580959, -0.08041589288764073, 0.1555744844766461, -0.1576849405960359, -0.07541384631247254, 0.169916316444598, 0.17734349540959732, 0.11640887379195101, -0.12554390531218385, -0.0007329531894672824, 0.0010176095612613218, 0.2452535406680581, 0.05718253165344644, 0.14237643527850416, 0.20662869358007213, 0.20527148283858962, 0.043166047355495625, 0.2127881945105073, -0.1581222702942858, -0.0476081992430115, -0.25024595280519185, -0.20655669509404287, -0.21388157790306933, 0.09709433240306951, -0.0751088179732161, -0.15338809576944118, 0.38254816592699903, 0.13223934665276027, 0.20552956393590163, 0.0084320447871878, 0.2916955950797206, 0.1113136301015255, 0.08985934337175897, -0.0006908741692856231, 0.29634610632353503, 0.199086459512643, 0.07363675852011171, -0.32394386791791885, 0.02318159356909972, -0.04230980737921521] |
1,802.0671 | Discovering Effect Modification and Randomization Inference in Air
Pollution Studies | Studies have shown that exposure to air pollution, even at low levels,
significantly increases mortality. As regulatory actions are becoming
prohibitively expensive, robust evidence to guide the development of targeted
interventions to reduce air pollution exposure is needed. In this paper, we
introduce a novel statistical method that splits the data into two subsamples:
(a) Using the first subsample, we consider a data-driven search for $\textit{de
novo}$ discovery of subgroups that could have exposure effects that differ from
the population mean; and then (b) using the second subsample, we quantify
evidence of effect modification among the subgroups with nonparametric
randomization-based tests. We also develop a sensitivity analysis method to
assess the robustness of the conclusions to unmeasured confounding bias. Via
simulation studies and theoretical arguments, we demonstrate that since we
discover the subgroups in the first subsample, hypothesis testing on the second
subsample can focus on theses subgroups only, thus substantially increasing the
statistical power of the test. We apply our method to the data of 1,612,414
Medicare beneficiaries in New England region in the United States for the
period 2000 to 2006. We find that seniors aged between 81-85 with low income
and seniors aged above 85 have statistically significant higher causal effects
of exposure to PM$_{2.5}$ on 5-year mortality rate compared to the population
mean.
| stat.AP stat.ME | studies have shown that exposure to air pollution even at low levels significantly increases mortality as regulatory actions are becoming prohibitively expensive robust evidence to guide the development of targeted interventions to reduce air pollution exposure is needed in this paper we introduce a novel statistical method that splits the data into two subsamples a using the first subsample we consider a datadriven search for textitde novo discovery of subgroups that could have exposure effects that differ from the population mean and then b using the second subsample we quantify evidence of effect modification among the subgroups with nonparametric randomizationbased tests we also develop a sensitivity analysis method to assess the robustness of the conclusions to unmeasured confounding bias via simulation studies and theoretical arguments we demonstrate that since we discover the subgroups in the first subsample hypothesis testing on the second subsample can focus on theses subgroups only thus substantially increasing the statistical power of the test we apply our method to the data of 1612414 medicare beneficiaries in new england region in the united states for the period 2000 to 2006 we find that seniors aged between 8185 with low income and seniors aged above 85 have statistically significant higher causal effects of exposure to pm_25 on 5year mortality rate compared to the population mean | [['studies', 'have', 'shown', 'that', 'exposure', 'to', 'air', 'pollution', 'even', 'at', 'low', 'levels', 'significantly', 'increases', 'mortality', 'as', 'regulatory', 'actions', 'are', 'becoming', 'prohibitively', 'expensive', 'robust', 'evidence', 'to', 'guide', 'the', 'development', 'of', 'targeted', 'interventions', 'to', 'reduce', 'air', 'pollution', 'exposure', 'is', 'needed', 'in', 'this', 'paper', 'we', 'introduce', 'a', 'novel', 'statistical', 'method', 'that', 'splits', 'the', 'data', 'into', 'two', 'subsamples', 'a', 'using', 'the', 'first', 'subsample', 'we', 'consider', 'a', 'datadriven', 'search', 'for', 'textitde', 'novo', 'discovery', 'of', 'subgroups', 'that', 'could', 'have', 'exposure', 'effects', 'that', 'differ', 'from', 'the', 'population', 'mean', 'and', 'then', 'b', 'using', 'the', 'second', 'subsample', 'we', 'quantify', 'evidence', 'of', 'effect', 'modification', 'among', 'the', 'subgroups', 'with', 'nonparametric', 'randomizationbased', 'tests', 'we', 'also', 'develop', 'a', 'sensitivity', 'analysis', 'method', 'to', 'assess', 'the', 'robustness', 'of', 'the', 'conclusions', 'to', 'unmeasured', 'confounding', 'bias', 'via', 'simulation', 'studies', 'and', 'theoretical', 'arguments', 'we', 'demonstrate', 'that', 'since', 'we', 'discover', 'the', 'subgroups', 'in', 'the', 'first', 'subsample', 'hypothesis', 'testing', 'on', 'the', 'second', 'subsample', 'can', 'focus', 'on', 'theses', 'subgroups', 'only', 'thus', 'substantially', 'increasing', 'the', 'statistical', 'power', 'of', 'the', 'test', 'we', 'apply', 'our', 'method', 'to', 'the', 'data', 'of', '1612414', 'medicare', 'beneficiaries', 'in', 'new', 'england', 'region', 'in', 'the', 'united', 'states', 'for', 'the', 'period', '2000', 'to', '2006', 'we', 'find', 'that', 'seniors', 'aged', 'between', '8185', 'with', 'low', 'income', 'and', 'seniors', 'aged', 'above', '85', 'have', 'statistically', 'significant', 'higher', 'causal', 'effects', 'of', 'exposure', 'to', 'pm_25', 'on', '5year', 'mortality', 'rate', 'compared', 'to', 'the', 'population', 'mean']] | [-0.03414479819211583, 0.08934749474024607, -0.09406184939520985, 0.11001988555155415, -0.07211091516203144, -0.0892725848308247, 0.14239035457366198, 0.38800852225890764, -0.1857330880922274, -0.37376821611542255, 0.10805924015693125, -0.3070531956618652, -0.10919493756739905, 0.19584768124062707, -0.11052584741601432, -0.004257919987948198, 0.09295743421049944, -0.028172222254970285, -0.021891956764092255, -0.28298742877086625, 0.27550500691695895, 0.0798851349218576, 0.3295137215517806, 0.01897471620489981, 0.06214803077185665, -0.01400823891809624, -0.0880695389977417, 0.011738746461492998, -0.11006260779140575, 0.09871858495144234, 0.26841764357070336, 0.16123314131767041, 0.3544993834759764, -0.3962471254506252, -0.20826077326287137, 0.14058996572512789, 0.1109581283246236, 0.09211847444250318, -0.0688349278659896, -0.2784470216828157, 0.07899785907270766, -0.204041079024103, -0.09408792622357227, -0.07554848299413505, 0.00349990638723183, -0.02535105108108837, -0.2614526240234867, 0.13158599787951702, -0.01083190296345425, 0.11391321979721801, -0.0781254085280428, -0.1520513922398634, -0.02271943125136507, 0.13757223645397634, 0.10455488769124106, -0.018195499436438292, 0.137794572303796, -0.0915849123126396, -0.09368082869332284, 0.3269306722968058, -0.07061531608390699, -0.12864218213966255, 0.19969284267238066, -0.16560823938602376, -0.1989057985177809, 0.10541492146795564, 0.25868717488332615, 0.07525295400302168, -0.17638038779033297, -0.027240387296101457, 0.006875577973443325, 0.1985707235850256, 0.031737154778696736, -0.034781045380643465, 0.147681847825475, 0.17662272976357835, 0.06025838289254656, 0.12662692149428445, -0.1607220613233814, -0.024362058378756046, -0.24992887503726202, -0.1396811941112564, -0.08903473777657685, 0.02566538482346072, -0.07078620841268814, -0.1278782032328578, 0.38898193428327366, 0.21834971338156955, 0.1274814786070406, 0.10345311960015723, 0.26027260684511727, 0.0419734662357735, 0.07001677737470244, 0.06648220156569516, 0.23953809786622446, 0.086449213038577, 0.02897870770646949, -0.20675688482313287, 0.1269330491421796, -0.042252578748890234] |
1,802.06711 | Sensitivity analyses for average treatment effects when outcome is
censored by death in instrumental variable models | Two problems that arise in making causal inferences for non-mortality
outcomes such as bronchopulmonary dysplasia (BPD) are unmeasured confounding
and censoring by death, i.e., the outcome is only observed when subjects
survive. In randomized experiments with noncompliance, instrumental variable
methods can be used to control for the unmeasured confounding without censoring
by death. But when there is censoring by death, the average causal treatment
effect cannot be identified under usual assumptions, but can be studied for a
specific subpopulation by using sensitivity analysis with additional
assumptions. However, in observational studies, evaluation of the local average
treatment effect (LATE) in censoring by death problems with unmeasured
confounding is not well studied. We develop a novel sensitivity analysis method
based on instrumental variable models for studying the LATE. Specifically, we
present the identification results under an additional assumption, and propose
a three-step procedure for the LATE estimation. Also, we propose an improved
two-step procedure by simultaneously estimating the instrument propensity score
(i.e., the probability of instrument given covariates) and the parameters
induced by the assumption. We have shown with simulation studies that the
two-step procedure can be more robust and efficient than the three-step
procedure. Finally, we apply our sensitivity analysis methods to a study of the
effect of delivery at high-level neonatal intensive care units on the risk of
BPD.
| stat.ME stat.AP | two problems that arise in making causal inferences for nonmortality outcomes such as bronchopulmonary dysplasia bpd are unmeasured confounding and censoring by death ie the outcome is only observed when subjects survive in randomized experiments with noncompliance instrumental variable methods can be used to control for the unmeasured confounding without censoring by death but when there is censoring by death the average causal treatment effect cannot be identified under usual assumptions but can be studied for a specific subpopulation by using sensitivity analysis with additional assumptions however in observational studies evaluation of the local average treatment effect late in censoring by death problems with unmeasured confounding is not well studied we develop a novel sensitivity analysis method based on instrumental variable models for studying the late specifically we present the identification results under an additional assumption and propose a threestep procedure for the late estimation also we propose an improved twostep procedure by simultaneously estimating the instrument propensity score ie the probability of instrument given covariates and the parameters induced by the assumption we have shown with simulation studies that the twostep procedure can be more robust and efficient than the threestep procedure finally we apply our sensitivity analysis methods to a study of the effect of delivery at highlevel neonatal intensive care units on the risk of bpd | [['two', 'problems', 'that', 'arise', 'in', 'making', 'causal', 'inferences', 'for', 'nonmortality', 'outcomes', 'such', 'as', 'bronchopulmonary', 'dysplasia', 'bpd', 'are', 'unmeasured', 'confounding', 'and', 'censoring', 'by', 'death', 'ie', 'the', 'outcome', 'is', 'only', 'observed', 'when', 'subjects', 'survive', 'in', 'randomized', 'experiments', 'with', 'noncompliance', 'instrumental', 'variable', 'methods', 'can', 'be', 'used', 'to', 'control', 'for', 'the', 'unmeasured', 'confounding', 'without', 'censoring', 'by', 'death', 'but', 'when', 'there', 'is', 'censoring', 'by', 'death', 'the', 'average', 'causal', 'treatment', 'effect', 'can', 'not', 'be', 'identified', 'under', 'usual', 'assumptions', 'but', 'can', 'be', 'studied', 'for', 'a', 'specific', 'subpopulation', 'by', 'using', 'sensitivity', 'analysis', 'with', 'additional', 'assumptions', 'however', 'in', 'observational', 'studies', 'evaluation', 'of', 'the', 'local', 'average', 'treatment', 'effect', 'late', 'in', 'censoring', 'by', 'death', 'problems', 'with', 'unmeasured', 'confounding', 'is', 'not', 'well', 'studied', 'we', 'develop', 'a', 'novel', 'sensitivity', 'analysis', 'method', 'based', 'on', 'instrumental', 'variable', 'models', 'for', 'studying', 'the', 'late', 'specifically', 'we', 'present', 'the', 'identification', 'results', 'under', 'an', 'additional', 'assumption', 'and', 'propose', 'a', 'threestep', 'procedure', 'for', 'the', 'late', 'estimation', 'also', 'we', 'propose', 'an', 'improved', 'twostep', 'procedure', 'by', 'simultaneously', 'estimating', 'the', 'instrument', 'propensity', 'score', 'ie', 'the', 'probability', 'of', 'instrument', 'given', 'covariates', 'and', 'the', 'parameters', 'induced', 'by', 'the', 'assumption', 'we', 'have', 'shown', 'with', 'simulation', 'studies', 'that', 'the', 'twostep', 'procedure', 'can', 'be', 'more', 'robust', 'and', 'efficient', 'than', 'the', 'threestep', 'procedure', 'finally', 'we', 'apply', 'our', 'sensitivity', 'analysis', 'methods', 'to', 'a', 'study', 'of', 'the', 'effect', 'of', 'delivery', 'at', 'highlevel', 'neonatal', 'intensive', 'care', 'units', 'on', 'the', 'risk', 'of', 'bpd']] | [-0.04026987593740635, 0.10065549914631672, -0.09315510369717665, 0.11890791939815011, -0.08957528381463174, -0.18832660893217548, 0.10713674471000158, 0.4365488788403502, -0.19252467052071193, -0.31712139345953294, 0.14909879222871103, -0.20528617255825446, -0.15882928765148197, 0.18447502339344232, -0.13033000375742282, 0.05088697892929846, 0.10458856831740486, 0.020040193919750322, -0.03801071111736563, -0.28424051632664654, 0.28520333584757956, 0.08756015804882478, 0.29529467432085776, -0.002985296337843932, 0.08827685308963094, 0.04740540835891056, -0.08258673674512415, 0.05338921177055721, -0.09046983993175672, 0.04677219525910914, 0.2561561208377506, 0.18284646760022968, 0.3770811976608607, -0.41162099594083706, -0.2674885383943831, 0.14425827844769035, 0.10049623104213916, 0.10816426782274978, -0.032400351939757606, -0.2966378188965449, 0.05106173769876344, -0.15508678670835876, -0.07041505751746852, -0.10133245967460984, -0.028484554655867023, -0.020900684190431285, -0.3598953910084407, 0.14658702030089585, 0.043310519850945285, 0.0958215820756869, -0.04978406556653406, -0.12724635360330994, 0.03833969672415576, 0.09148915762369042, 0.11967263328137918, -0.02071720626380897, 0.14608325782112366, -0.10078978688678268, -0.14172727479481934, 0.3266820267757076, -0.04114224162405846, -0.2234586660564373, 0.15867076898442256, -0.1291216765551768, -0.16103178480642188, 0.08590725102299533, 0.18423458862058614, 0.10955404695828334, -0.22238777280390506, 0.0007049084262956584, 0.030478780101258478, 0.1393997507002162, 0.021483605262426094, -0.007278554210142412, 0.13843587918822234, 0.18651071749841197, 0.04718838592696457, 0.10119916370070171, -0.12900740938547384, -0.046332849871176036, -0.2922679200766335, -0.09967212821356952, -0.11647222882217872, 0.02139079906305388, -0.09016280641128872, -0.13633922785304278, 0.3632836820463727, 0.19014853811423654, 0.16745834810223534, 0.028242664748627626, 0.3018262114529626, 0.11121434839485093, 0.08105738328795435, 0.03316025473091991, 0.21304818434499787, 0.07249401510509432, -0.007797523572562484, -0.25528837391388937, 0.21952464185877268, -0.014338859225572044] |
1,802.06712 | Multithreading for the expression-dag-based number type Real_algebraic | Many algorithms, especially in the field of computational geometry, are based
on the premise that arithmetic operations are performed exactly. Real machines
are based on inexact floating-point arithmetic. Various number types have been
developed to close this gap by providing exact computation or ensuring exact
decisions. In this report we describe the implementation of an extension to the
exact-decisions number type Real_algebraic that enables us to take advantage of
multiple processing units.
| cs.DC cs.CG | many algorithms especially in the field of computational geometry are based on the premise that arithmetic operations are performed exactly real machines are based on inexact floatingpoint arithmetic various number types have been developed to close this gap by providing exact computation or ensuring exact decisions in this report we describe the implementation of an extension to the exactdecisions number type real_algebraic that enables us to take advantage of multiple processing units | [['many', 'algorithms', 'especially', 'in', 'the', 'field', 'of', 'computational', 'geometry', 'are', 'based', 'on', 'the', 'premise', 'that', 'arithmetic', 'operations', 'are', 'performed', 'exactly', 'real', 'machines', 'are', 'based', 'on', 'inexact', 'floatingpoint', 'arithmetic', 'various', 'number', 'types', 'have', 'been', 'developed', 'to', 'close', 'this', 'gap', 'by', 'providing', 'exact', 'computation', 'or', 'ensuring', 'exact', 'decisions', 'in', 'this', 'report', 'we', 'describe', 'the', 'implementation', 'of', 'an', 'extension', 'to', 'the', 'exactdecisions', 'number', 'type', 'real_algebraic', 'that', 'enables', 'us', 'to', 'take', 'advantage', 'of', 'multiple', 'processing', 'units']] | [-0.17161770351231098, 0.010295921644978029, -0.09247457678101852, 0.05604814573742029, -0.11136185189276199, -0.13180916541269128, 0.054152662182082485, 0.4031743290768543, -0.2580809545585177, -0.360176191416005, 0.1377851547784841, -0.20283355369416237, -0.14456004016166946, 0.26046705770660455, -0.0919465797286789, 0.09822864587825368, 0.06226838360422514, 0.05667933884640815, -0.05343103151060116, -0.31149431708937797, 0.26809879149388993, 0.029499494955993036, 0.277501331996435, -0.000534007568437029, 0.07330237809096424, 0.026061304228406558, -0.034530327458616714, -0.0006662820741324358, -0.037595988501520815, 0.1818132047298771, 0.26832427123797614, 0.15471606197583318, 0.33405679595512405, -0.5346479277769235, -0.14495053687985515, 0.11825720994392226, 0.1398994320000089, 0.1019465819552121, -0.02485810122846193, -0.22548071302893297, 0.12241062483894573, -0.13873218987661767, -0.05470130267318561, -0.14840032459354738, -0.021065284561982353, 0.04289224733349303, -0.22695345686696156, -0.039949893295555046, 0.009149479037019568, 0.11515998559623537, -0.00758481021760635, -0.1409843556425521, 0.10826061494668132, 0.13769956131491967, 0.019542560112518325, -0.02483644392866064, 0.12447044201536288, -0.0704729902872842, -0.15951192098289307, 0.35255799051636544, 0.03635007195489507, -0.22008762793274414, 0.206618868488438, -0.07018451804203361, -0.19212913000956178, 0.12891341303147272, 0.18310179535797994, 0.07031186629073616, -0.11184723305181456, 0.1244640418813682, -0.02132339000990483, 0.1750365560218482, 0.062715986212322, 0.06341736560398845, 0.16991716320298508, 0.14607407729810393, 0.018474042552529872, 0.13843638064916913, -0.046287023172136656, -0.14078502710515134, -0.25883340583146797, -0.1632749023880075, -0.17473072124133543, 0.011991031008811904, -0.06014423321565272, -0.19497519338005026, 0.35845464226645485, 0.20383382392850455, 0.16901311729575547, 0.10470997534272536, 0.3357846568876379, 0.10351003601517476, 0.0878469145063206, 0.10817902943145641, 0.18106531477402107, 0.1101744104944117, 0.06687151939726212, -0.19574015183229995, 0.05062478797798845, 0.10185579716844458] |
1,802.06713 | Disentangling 3D Pose in A Dendritic CNN for Unconstrained 2D Face
Alignment | Heatmap regression has been used for landmark localization for quite a while
now. Most of the methods use a very deep stack of bottleneck modules for
heatmap classification stage, followed by heatmap regression to extract the
keypoints. In this paper, we present a single dendritic CNN, termed as Pose
Conditioned Dendritic Convolution Neural Network (PCD-CNN), where a
classification network is followed by a second and modular classification
network, trained in an end to end fashion to obtain accurate landmark points.
Following a Bayesian formulation, we disentangle the 3D pose of a face image
explicitly by conditioning the landmark estimation on pose, making it different
from multi-tasking approaches. Extensive experimentation shows that
conditioning on pose reduces the localization error by making it agnostic to
face pose. The proposed model can be extended to yield variable number of
landmark points and hence broadening its applicability to other datasets.
Instead of increasing depth or width of the network, we train the CNN
efficiently with Mask-Softmax Loss and hard sample mining to achieve upto
$15\%$ reduction in error compared to state-of-the-art methods for extreme and
medium pose face images from challenging datasets including AFLW, AFW, COFW and
IBUG.
| cs.CV | heatmap regression has been used for landmark localization for quite a while now most of the methods use a very deep stack of bottleneck modules for heatmap classification stage followed by heatmap regression to extract the keypoints in this paper we present a single dendritic cnn termed as pose conditioned dendritic convolution neural network pcdcnn where a classification network is followed by a second and modular classification network trained in an end to end fashion to obtain accurate landmark points following a bayesian formulation we disentangle the 3d pose of a face image explicitly by conditioning the landmark estimation on pose making it different from multitasking approaches extensive experimentation shows that conditioning on pose reduces the localization error by making it agnostic to face pose the proposed model can be extended to yield variable number of landmark points and hence broadening its applicability to other datasets instead of increasing depth or width of the network we train the cnn efficiently with masksoftmax loss and hard sample mining to achieve upto 15 reduction in error compared to stateoftheart methods for extreme and medium pose face images from challenging datasets including aflw afw cofw and ibug | [['heatmap', 'regression', 'has', 'been', 'used', 'for', 'landmark', 'localization', 'for', 'quite', 'a', 'while', 'now', 'most', 'of', 'the', 'methods', 'use', 'a', 'very', 'deep', 'stack', 'of', 'bottleneck', 'modules', 'for', 'heatmap', 'classification', 'stage', 'followed', 'by', 'heatmap', 'regression', 'to', 'extract', 'the', 'keypoints', 'in', 'this', 'paper', 'we', 'present', 'a', 'single', 'dendritic', 'cnn', 'termed', 'as', 'pose', 'conditioned', 'dendritic', 'convolution', 'neural', 'network', 'pcdcnn', 'where', 'a', 'classification', 'network', 'is', 'followed', 'by', 'a', 'second', 'and', 'modular', 'classification', 'network', 'trained', 'in', 'an', 'end', 'to', 'end', 'fashion', 'to', 'obtain', 'accurate', 'landmark', 'points', 'following', 'a', 'bayesian', 'formulation', 'we', 'disentangle', 'the', '3d', 'pose', 'of', 'a', 'face', 'image', 'explicitly', 'by', 'conditioning', 'the', 'landmark', 'estimation', 'on', 'pose', 'making', 'it', 'different', 'from', 'multitasking', 'approaches', 'extensive', 'experimentation', 'shows', 'that', 'conditioning', 'on', 'pose', 'reduces', 'the', 'localization', 'error', 'by', 'making', 'it', 'agnostic', 'to', 'face', 'pose', 'the', 'proposed', 'model', 'can', 'be', 'extended', 'to', 'yield', 'variable', 'number', 'of', 'landmark', 'points', 'and', 'hence', 'broadening', 'its', 'applicability', 'to', 'other', 'datasets', 'instead', 'of', 'increasing', 'depth', 'or', 'width', 'of', 'the', 'network', 'we', 'train', 'the', 'cnn', 'efficiently', 'with', 'masksoftmax', 'loss', 'and', 'hard', 'sample', 'mining', 'to', 'achieve', 'upto', '15', 'reduction', 'in', 'error', 'compared', 'to', 'stateoftheart', 'methods', 'for', 'extreme', 'and', 'medium', 'pose', 'face', 'images', 'from', 'challenging', 'datasets', 'including', 'aflw', 'afw', 'cofw', 'and', 'ibug']] | [-0.006343199202395529, -0.059170047135845984, -0.06104347335106771, 0.04443819719684446, -0.08016502232446025, -0.2178525567530111, 0.031352298265725644, 0.45970696049334947, -0.2807965468655311, -0.33067250123713166, 0.11966765287130936, -0.257950595075575, -0.1869721580624173, 0.196051617252427, -0.18576822049120287, 0.13491245024761156, 0.15789651971742083, 0.03698132996638984, -0.06279427962363116, -0.29518673198435863, 0.2878179046153188, 0.048659463038196314, 0.31348166342286277, 0.002004371584916953, 0.1408395698502621, -0.0006481778157952552, -0.048326878323374935, 0.01148147388569972, -0.02008724872473522, 0.18665484819151365, 0.29801918112692266, 0.16381659339701096, 0.28518537683019457, -0.4031735455996189, -0.23551350815978367, 0.06631324900808977, 0.14888648649988076, 0.1055424976731653, -0.010940494103124365, -0.34794000142331544, 0.09089528525510104, -0.15566692996071652, 0.0026882138275444354, -0.12776777716499055, -0.0017838912966302207, -0.05919223410728591, -0.2984286332599974, 0.06950297670543175, 0.03452921548523591, 0.0642713024232459, -0.03526276418718529, -0.11004468127278717, 0.011963995508267544, 0.17095256520284843, 0.027599760537365608, 0.0857098381772327, 0.14813602660190858, -0.24065384860659833, -0.12518711876358188, 0.3516424549501001, -0.04127467356283887, -0.19702225965253697, 0.19964517664872497, -0.02208021804593348, -0.13702501399287334, 0.1557064170774538, 0.24051572245783367, 0.10107276472081139, -0.13925046072593736, -0.020311186918661406, -0.03254795364531068, 0.1844281373002256, 0.07559511860987793, -0.06190918665500552, 0.16775880886234518, 0.2651764299662318, 0.0534943503056032, 0.15427913567115561, -0.22797425009533376, -0.011661426173911119, -0.18842138514082762, -0.09168354081695422, -0.20409567906002243, -0.023752890090690926, -0.1044023078935273, -0.1825543462546193, 0.4241033595171757, 0.24524022005546917, 0.280055607232498, 0.12889920171922617, 0.3395001661677573, 0.03356108982249376, 0.12184590945010616, 0.05868179594714699, 0.1838602906112404, 0.034362534837176405, 0.08979493477697058, -0.14457873137219698, 0.08499280302930856, 0.1054312884164877] |
1,802.06714 | Identification and tunable optical coherent control of transition-metal
spins in silicon carbide | Color centers in wide-bandgap semiconductors are attractive systems for
quantum technologies since they can combine long-coherent electronic spin and
bright optical properties. Several suitable centers have been identified, most
famously the nitrogen-vacancy defect in diamond. However, integration in
communication technology is hindered by the fact that their optical transitions
lie outside telecom wavelength bands. Several transition-metal impurities in
silicon carbide do emit at and near telecom wavelengths, but knowledge about
their spin and optical properties is incomplete. We present all-optical
identification and coherent control of molybdenum-impurity spins in silicon
carbide with transitions at near-infrared wavelengths. Our results identify
spin $S=1/2$ for both the electronic ground and excited state, with highly
anisotropic spin properties that we apply for implementing optical control of
ground-state spin coherence. Our results show optical lifetimes of $\sim$60 ns
and inhomogeneous spin dephasing times of $\sim$0.3 $\mu$s, establishing
relevance for quantum spin-photon interfacing.
| cond-mat.mtrl-sci cond-mat.mes-hall quant-ph | color centers in widebandgap semiconductors are attractive systems for quantum technologies since they can combine longcoherent electronic spin and bright optical properties several suitable centers have been identified most famously the nitrogenvacancy defect in diamond however integration in communication technology is hindered by the fact that their optical transitions lie outside telecom wavelength bands several transitionmetal impurities in silicon carbide do emit at and near telecom wavelengths but knowledge about their spin and optical properties is incomplete we present alloptical identification and coherent control of molybdenumimpurity spins in silicon carbide with transitions at nearinfrared wavelengths our results identify spin s12 for both the electronic ground and excited state with highly anisotropic spin properties that we apply for implementing optical control of groundstate spin coherence our results show optical lifetimes of sim60 ns and inhomogeneous spin dephasing times of sim03 mus establishing relevance for quantum spinphoton interfacing | [['color', 'centers', 'in', 'widebandgap', 'semiconductors', 'are', 'attractive', 'systems', 'for', 'quantum', 'technologies', 'since', 'they', 'can', 'combine', 'longcoherent', 'electronic', 'spin', 'and', 'bright', 'optical', 'properties', 'several', 'suitable', 'centers', 'have', 'been', 'identified', 'most', 'famously', 'the', 'nitrogenvacancy', 'defect', 'in', 'diamond', 'however', 'integration', 'in', 'communication', 'technology', 'is', 'hindered', 'by', 'the', 'fact', 'that', 'their', 'optical', 'transitions', 'lie', 'outside', 'telecom', 'wavelength', 'bands', 'several', 'transitionmetal', 'impurities', 'in', 'silicon', 'carbide', 'do', 'emit', 'at', 'and', 'near', 'telecom', 'wavelengths', 'but', 'knowledge', 'about', 'their', 'spin', 'and', 'optical', 'properties', 'is', 'incomplete', 'we', 'present', 'alloptical', 'identification', 'and', 'coherent', 'control', 'of', 'molybdenumimpurity', 'spins', 'in', 'silicon', 'carbide', 'with', 'transitions', 'at', 'nearinfrared', 'wavelengths', 'our', 'results', 'identify', 'spin', 's12', 'for', 'both', 'the', 'electronic', 'ground', 'and', 'excited', 'state', 'with', 'highly', 'anisotropic', 'spin', 'properties', 'that', 'we', 'apply', 'for', 'implementing', 'optical', 'control', 'of', 'groundstate', 'spin', 'coherence', 'our', 'results', 'show', 'optical', 'lifetimes', 'of', 'sim60', 'ns', 'and', 'inhomogeneous', 'spin', 'dephasing', 'times', 'of', 'sim03', 'mus', 'establishing', 'relevance', 'for', 'quantum', 'spinphoton', 'interfacing']] | [-0.11465669018858722, 0.20335517393601737, 0.01572637812330805, 0.002966583476819355, 0.005818291644340959, -0.19590085829319112, 0.03569331801303759, 0.5612070658597453, -0.20994056644126902, -0.26749115642481325, 0.08909975588241399, -0.3290006108710478, -0.04632805689751845, 0.23634952087806346, 0.03364255878881647, 0.033230779173077436, 0.024650087737446202, -0.09405554750741556, -0.06898373784095949, -0.16604084319210258, 0.2112830382642328, -0.010815481483486706, 0.33925343888073134, 0.08766694913200777, 0.06256697813113188, 0.028095522031573388, 0.07898046728223562, -0.09352878759984441, -0.08739434862238403, 0.1426601589304106, 0.33853796690959354, -0.04208770166472371, 0.19721017980883862, -0.4586442297838371, -0.20561175007886928, 0.05391155310167835, 0.1539553287023566, 0.19963220182549338, -0.09726958867997446, -0.30482651890287626, 0.03720109719253177, -0.1415414287772929, -0.14978466063480952, -0.08032019317615777, 0.02914486164227128, 0.0018489241752580835, -0.15780614918611688, 0.05626632341761784, 0.030132172372722036, 0.06846382669654899, -0.0983122084924052, -0.09516944422804076, -0.06552005850485172, 0.0776979322127741, -0.08979253607384603, -0.009024190647399117, 0.21262033851496104, -0.1228860769180003, -0.1950432734005956, 0.35311116644277657, -0.012473660514786326, -0.04185392287206547, 0.19921075342672653, -0.16476968750678775, -0.10197179080147682, 0.13597037299247136, 0.1090190215598278, 0.12537383500422383, -0.16068934555775646, 0.04104362355689679, 0.06833844269979103, 0.18885696489917886, 0.0727214066536519, 0.277195491895465, 0.2980634802695492, 0.18412588086091625, 0.0315056756692778, 0.10139486317940313, -0.13733015164154871, -0.08716720191818052, -0.16619609212823983, -0.15874336417483423, -0.23693020092002276, 0.1265250424501197, -0.06941458734398676, -0.12340434929034834, 0.36596451408133424, 0.16615289648480971, 0.10084320499465384, -0.05879824193804686, 0.25062408699686156, 0.056303556062730735, 0.1083003033402151, 0.04698085606595951, 0.31983335889747433, 0.18949360335727447, 0.11645304527904453, -0.28223247015688185, 0.019422848211151773, -0.0477431227453053] |
1,802.06715 | Univariate and Bivariate Geometric Discrete Generalized Exponential
Distributions | Marshall and Olkin (1997, Biometrika, 84, 641 - 652) introduced a very
powerful method to introduce an additional parameter to a class of continuous
distribution functions and hence it brings more flexibility to the model. They
have demonstrated their method for the exponential and Weibull classes. In the
same paper they have briefly indicated regarding its bivariate extension. The
main aim of this paper is to introduce the same method, for the first time, to
the class of discrete generalized exponential distributions both for the
univariate and bivariate cases. We investigate several properties of the
proposed univariate and bivariate classes. The univariate class has three
parameters, whereas the bivariate class has five parameters. It is observed
that depending on the parameter values the univariate class can be both zero
inflated as well as heavy tailed. We propose to use EM algorithm to estimate
the unknown parameters. Small simulation experiments have been performed to see
the effectiveness of the proposed EM algorithm, and a bivariate data set has
been analyzed and it is observed that the proposed models and the EM algorithm
work quite well in practice.
| stat.ME math.ST stat.AP stat.TH | marshall and olkin 1997 biometrika 84 641 652 introduced a very powerful method to introduce an additional parameter to a class of continuous distribution functions and hence it brings more flexibility to the model they have demonstrated their method for the exponential and weibull classes in the same paper they have briefly indicated regarding its bivariate extension the main aim of this paper is to introduce the same method for the first time to the class of discrete generalized exponential distributions both for the univariate and bivariate cases we investigate several properties of the proposed univariate and bivariate classes the univariate class has three parameters whereas the bivariate class has five parameters it is observed that depending on the parameter values the univariate class can be both zero inflated as well as heavy tailed we propose to use em algorithm to estimate the unknown parameters small simulation experiments have been performed to see the effectiveness of the proposed em algorithm and a bivariate data set has been analyzed and it is observed that the proposed models and the em algorithm work quite well in practice | [['marshall', 'and', 'olkin', '1997', 'biometrika', '84', '641', '652', 'introduced', 'a', 'very', 'powerful', 'method', 'to', 'introduce', 'an', 'additional', 'parameter', 'to', 'a', 'class', 'of', 'continuous', 'distribution', 'functions', 'and', 'hence', 'it', 'brings', 'more', 'flexibility', 'to', 'the', 'model', 'they', 'have', 'demonstrated', 'their', 'method', 'for', 'the', 'exponential', 'and', 'weibull', 'classes', 'in', 'the', 'same', 'paper', 'they', 'have', 'briefly', 'indicated', 'regarding', 'its', 'bivariate', 'extension', 'the', 'main', 'aim', 'of', 'this', 'paper', 'is', 'to', 'introduce', 'the', 'same', 'method', 'for', 'the', 'first', 'time', 'to', 'the', 'class', 'of', 'discrete', 'generalized', 'exponential', 'distributions', 'both', 'for', 'the', 'univariate', 'and', 'bivariate', 'cases', 'we', 'investigate', 'several', 'properties', 'of', 'the', 'proposed', 'univariate', 'and', 'bivariate', 'classes', 'the', 'univariate', 'class', 'has', 'three', 'parameters', 'whereas', 'the', 'bivariate', 'class', 'has', 'five', 'parameters', 'it', 'is', 'observed', 'that', 'depending', 'on', 'the', 'parameter', 'values', 'the', 'univariate', 'class', 'can', 'be', 'both', 'zero', 'inflated', 'as', 'well', 'as', 'heavy', 'tailed', 'we', 'propose', 'to', 'use', 'em', 'algorithm', 'to', 'estimate', 'the', 'unknown', 'parameters', 'small', 'simulation', 'experiments', 'have', 'been', 'performed', 'to', 'see', 'the', 'effectiveness', 'of', 'the', 'proposed', 'em', 'algorithm', 'and', 'a', 'bivariate', 'data', 'set', 'has', 'been', 'analyzed', 'and', 'it', 'is', 'observed', 'that', 'the', 'proposed', 'models', 'and', 'the', 'em', 'algorithm', 'work', 'quite', 'well', 'in', 'practice']] | [-0.03197671273358267, 0.03865010489503589, -0.11006296354320806, 0.09941193666183264, -0.08617450306915703, -0.14060388687570152, 0.025113131457033592, 0.39494707459533535, -0.24018785478295507, -0.3330323209935749, 0.11646875481347779, -0.21233121914084296, -0.1683290026896331, 0.21184964769368841, -0.07005296873960745, 0.106053343155135, 0.003099964146275778, -0.0059057205764425766, -0.04945654381393782, -0.2960983704599376, 0.27688002328992495, 0.06932769565452897, 0.27230019369162617, -0.0040661496462652815, 0.11842220858607844, -0.009729068351255076, -0.07672865141334163, 0.010573364949753316, -0.12352546422492172, 0.08693351588287467, 0.22075233525760563, 0.14739887211975214, 0.3059247261945259, -0.3247921497284158, -0.2146978580216701, 0.1790031960661951, 0.11346331472961685, 0.061701174941215964, -0.022392660414413047, -0.26419635306842426, 0.09330689323612967, -0.20870168683547022, -0.13465348947793246, -0.10284650825794686, 0.032265097927302124, 0.052418000180576296, -0.30507740973419434, 0.05213241795757534, 0.07800066277913346, 0.028427458816283457, -0.018541383758388662, -0.17308002670572417, 0.023773226616400724, 0.06559729626200891, 0.08765361295270456, 0.003625167488447718, 0.050732630325128904, -0.07542882298522101, -0.11684810924469619, 0.34284712425558955, -0.04709924239463903, -0.2175258118256524, 0.20949804554819254, -0.13936067947966826, -0.17278483815843593, 0.08924401878832361, 0.18438514824956656, 0.1347306097882825, -0.1646483272666464, 0.08904322445191241, -0.08032960166047151, 0.10984318933726565, 0.0386559522723326, -0.006244680593797081, 0.11619930082579723, 0.1252481443530603, 0.016293469406790224, 0.15927503407945404, -0.13710885639239506, -0.09212873034632287, -0.2512479202570142, -0.14449753978264493, -0.2065131885364551, -0.03900875295638233, -0.07859702635543873, -0.17734161884196706, 0.45464406475626135, 0.15688304768598363, 0.20305108400816854, 0.08946051919908338, 0.24970775093077807, 0.12906760357743494, 0.03323381411515781, 0.09048128110455739, 0.19961301888263708, 0.12136650392911523, 0.09248901210674966, -0.15684574815488697, 0.13722471370663797, 0.044831514222597756] |
1,802.06716 | Two Algorithms to Compute Symmetry Groups for Landau-Ginzburg Models | Landau-Ginzburg mirror symmetry studies isomorphisms between graded Frobenius
algebras, known as A- and B-models. Fundamental to constructing these models is
the computation of the finite, Abelian $\textit{maximal symmetry group}$
$G_{W}^{\max}$ of a given polynomial $W$. For $\textit{invertible}$
polynomials, which have the same number of monomials as variables, a generating
set for this group can be computed efficiently by inverting the
$\textit{polynomial exponent matrix}$. However, this method does not work for
$\textit{noninvertible}$ polynomials with more monomials than variables since
the resulting exponent matrix is no longer square.
A previously conjectured algorithm to address this problem relies on
intersecting groups generated from $\textit{submatrices}$ of the exponent
matrix. We prove that this method is correct, but intractable in general. We
overcome intractability by presenting a group isomorphism based on the Smith
normal form of the exponent matrix. We demonstrate an algorithm to compute
$G_{W}^{\max}$ via this isomorphism, and show its efficiency in all cases.
| math.AG cs.CC cs.DS | landauginzburg mirror symmetry studies isomorphisms between graded frobenius algebras known as a and bmodels fundamental to constructing these models is the computation of the finite abelian textitmaximal symmetry group g_wmax of a given polynomial w for textitinvertible polynomials which have the same number of monomials as variables a generating set for this group can be computed efficiently by inverting the textitpolynomial exponent matrix however this method does not work for textitnoninvertible polynomials with more monomials than variables since the resulting exponent matrix is no longer square a previously conjectured algorithm to address this problem relies on intersecting groups generated from textitsubmatrices of the exponent matrix we prove that this method is correct but intractable in general we overcome intractability by presenting a group isomorphism based on the smith normal form of the exponent matrix we demonstrate an algorithm to compute g_wmax via this isomorphism and show its efficiency in all cases | [['landauginzburg', 'mirror', 'symmetry', 'studies', 'isomorphisms', 'between', 'graded', 'frobenius', 'algebras', 'known', 'as', 'a', 'and', 'bmodels', 'fundamental', 'to', 'constructing', 'these', 'models', 'is', 'the', 'computation', 'of', 'the', 'finite', 'abelian', 'textitmaximal', 'symmetry', 'group', 'g_wmax', 'of', 'a', 'given', 'polynomial', 'w', 'for', 'textitinvertible', 'polynomials', 'which', 'have', 'the', 'same', 'number', 'of', 'monomials', 'as', 'variables', 'a', 'generating', 'set', 'for', 'this', 'group', 'can', 'be', 'computed', 'efficiently', 'by', 'inverting', 'the', 'textitpolynomial', 'exponent', 'matrix', 'however', 'this', 'method', 'does', 'not', 'work', 'for', 'textitnoninvertible', 'polynomials', 'with', 'more', 'monomials', 'than', 'variables', 'since', 'the', 'resulting', 'exponent', 'matrix', 'is', 'no', 'longer', 'square', 'a', 'previously', 'conjectured', 'algorithm', 'to', 'address', 'this', 'problem', 'relies', 'on', 'intersecting', 'groups', 'generated', 'from', 'textitsubmatrices', 'of', 'the', 'exponent', 'matrix', 'we', 'prove', 'that', 'this', 'method', 'is', 'correct', 'but', 'intractable', 'in', 'general', 'we', 'overcome', 'intractability', 'by', 'presenting', 'a', 'group', 'isomorphism', 'based', 'on', 'the', 'smith', 'normal', 'form', 'of', 'the', 'exponent', 'matrix', 'we', 'demonstrate', 'an', 'algorithm', 'to', 'compute', 'g_wmax', 'via', 'this', 'isomorphism', 'and', 'show', 'its', 'efficiency', 'in', 'all', 'cases']] | [-0.13299420546207655, 0.08507602682669267, -0.08440873571926702, 0.06764343802415294, -0.10383924811740393, -0.15269571650543645, 0.042271417916484484, 0.34846219861854427, -0.3292163712776279, -0.2777003969403928, 0.11063844546490693, -0.2012229196867612, -0.1919686580714706, 0.19945224560797215, -0.0953170767479356, 0.034655477053865354, 0.024377680847689202, 0.05036586612520408, -0.12948878889597237, -0.3060615773261716, 0.3390548638329675, -0.003051780001579286, 0.2448967121021618, 0.0064716814548313, 0.11208601068858415, 0.0023868794151109783, -0.038473952350315116, -0.011370969184249027, -0.09356129723817329, 0.12022538865638947, 0.27404357102007965, 0.10747531498941809, 0.22777930561019338, -0.37573379740016916, -0.1488197105043657, 0.2136952701440936, 0.16787368857161436, 0.08588632035678355, -0.03789698693166529, -0.24172672180918187, 0.12379874500815999, -0.1634096352332463, -0.14411703635275058, -0.07518802997847535, 0.04665994245163484, -0.011136703299237287, -0.2965887465342012, 0.04919526516140936, 0.06255259225782875, 0.08939945193849606, 0.0012262957513472703, -0.12071297823512059, 0.006866877287792119, 0.06396867007603996, 0.01376443526433296, 0.01589714532418253, 0.06913133954995293, -0.11616452725457461, -0.13858033685421903, 0.3657713512720999, 0.005487323503710859, -0.2205140917587464, 0.1075692521691265, -0.1342464209604396, -0.16760964299016312, 0.11284185661328319, 0.09393653274220351, 0.14472590970538862, -0.09318167569549525, 0.1453200862798776, -0.13253650584175214, 0.15189466610461574, 0.07689792005830023, -0.029839289172517443, 0.1021637791426444, 0.07976339304698504, 0.07714789320654172, 0.14629199213192046, 0.03732369360609669, -0.053676636108158995, -0.29249146856584474, -0.16760863092000763, -0.21830479271330372, 0.08827585709284853, -0.11575642246924411, -0.17446251200314306, 0.39061052510227806, 0.13115403608399864, 0.1940616281026949, 0.13360308169479776, 0.2365308360209408, 0.12548026610383117, 0.09383435506207792, 0.09131062580336345, 0.15558977958376277, 0.19105036683980223, -0.03359540418581399, -0.1872833396119946, 0.05706200883915163, 0.20444306252167038] |
1,802.06717 | Emission of autoresonant trajectories and thresholds of resonant pumping | We study an autoresonant asymptotic behaviour for nonlinear oscillators under
slowly changing frequency and amplitude of external driver. As a result we
obtain formulas for threshold values of amplitude and frequency of the driver
when autoresonant behaviour for the nonlinear oscillator is observed. Also we
study a capture into resonance and emission out of the resonance for
trajectories of the oscillator. A measure of autoresonant asymptotic behaviours
for nonlinear oscillator is obtained.
| nlin.CD math-ph math.DS math.MP | we study an autoresonant asymptotic behaviour for nonlinear oscillators under slowly changing frequency and amplitude of external driver as a result we obtain formulas for threshold values of amplitude and frequency of the driver when autoresonant behaviour for the nonlinear oscillator is observed also we study a capture into resonance and emission out of the resonance for trajectories of the oscillator a measure of autoresonant asymptotic behaviours for nonlinear oscillator is obtained | [['we', 'study', 'an', 'autoresonant', 'asymptotic', 'behaviour', 'for', 'nonlinear', 'oscillators', 'under', 'slowly', 'changing', 'frequency', 'and', 'amplitude', 'of', 'external', 'driver', 'as', 'a', 'result', 'we', 'obtain', 'formulas', 'for', 'threshold', 'values', 'of', 'amplitude', 'and', 'frequency', 'of', 'the', 'driver', 'when', 'autoresonant', 'behaviour', 'for', 'the', 'nonlinear', 'oscillator', 'is', 'observed', 'also', 'we', 'study', 'a', 'capture', 'into', 'resonance', 'and', 'emission', 'out', 'of', 'the', 'resonance', 'for', 'trajectories', 'of', 'the', 'oscillator', 'a', 'measure', 'of', 'autoresonant', 'asymptotic', 'behaviours', 'for', 'nonlinear', 'oscillator', 'is', 'obtained']] | [-0.16306452640694463, 0.15046754653566394, -0.08958629632575645, 0.06405925874908765, -0.054302290030237704, -0.14251657229356673, 0.043522554708437786, 0.3662798488512635, -0.19841541432672077, -0.2351470252033323, 0.07672376899022816, -0.23997164295805204, -0.1860635899938643, 0.2841240482327218, 0.020032323180000984, 0.06568271796620845, 0.0418391418707971, 0.07984794200294548, 0.02178909907039876, -0.06970114747269286, 0.29999360881952775, 0.03991002374742594, 0.24915806775809163, -0.030812855904514436, 0.12098452818786933, 0.006363802744696538, 0.0588944491205944, -0.032940759116576776, -0.1655817408140542, 0.024537738011632528, 0.20543746386344233, 0.06622131199886401, 0.27066059526987374, -0.36915832080153954, -0.1912293410471951, 0.09364767594120672, 0.1660034096502285, 0.14528734780227145, 0.002660413397178571, -0.2870789436338883, 0.0450509284532422, -0.13763141337161264, -0.24260488843234876, -0.0858051460236311, 0.09015303989872336, 0.10335071311823817, -0.3444213392989089, 0.07271228329328652, 0.10956678129958972, 0.09980412498892595, -0.11011718490853026, -0.02791698440624815, -0.005930606637977892, 0.11877321354768355, 0.06984392982364322, -0.062493213588216655, 0.15977102481216812, -0.15761109360028058, -0.05056948121394574, 0.31134926517390543, -0.13987712822078416, -0.17352544107577866, 0.12607163951745154, -0.1915789971438547, -0.0728564695843185, 0.1329216335563817, 0.2044558350656492, 0.09034700985972045, -0.1442520956958712, 0.05003137159332659, 0.07802503201593128, 0.18705531152793103, 0.12006246497751111, 0.0584910211360289, 0.14969664827610055, 0.17393448592176558, 0.05047446991213494, 0.22190077983153364, -0.06926556460611108, -0.0854134382874084, -0.28999527968052363, -0.0827882343178822, -0.12636513080603132, 0.06465059344352792, -0.060399790591367894, -0.17209416904693675, 0.4670321775483899, 0.08350294730108646, 0.20081840791843003, 0.07643254862826628, 0.25950438663777375, 0.2782012473180657, -0.0237148616757218, -0.0036162100991027225, 0.2992521488211221, 0.18042725221150452, 0.10553047242056993, -0.3306514443959006, 0.007255575050496393, 0.031050608163544286] |
1,802.06718 | Lifting Problems in Grothendieck Fibrations | Many interesting classes of maps from homotopical algebra can be
characterised as those maps with the right lifting property against certain
sets of maps (such classes are sometimes referred to as cofibrantly generated).
In a more sophisticated notion due to Garner (referred to as algebraically
cofibrantly generated) the set of maps is replaced with a diagram over a small
category.
We give a yet more general definition where the set or diagram of maps is
replaced with a vertical map in a Grothendieck fibration. In addition to an
interesting new view of the existing examples above, we get new notions, such
as computable lifting problems in presheaf assemblies, and internal lifting
problems in a topos.
We show that under reasonable conditions one can define a notion of universal
lifting problem and carry out step-one of Garner's small object argument. We
give explicit descriptions of what the general construction looks like in some
examples.
| math.CT math.AT math.LO | many interesting classes of maps from homotopical algebra can be characterised as those maps with the right lifting property against certain sets of maps such classes are sometimes referred to as cofibrantly generated in a more sophisticated notion due to garner referred to as algebraically cofibrantly generated the set of maps is replaced with a diagram over a small category we give a yet more general definition where the set or diagram of maps is replaced with a vertical map in a grothendieck fibration in addition to an interesting new view of the existing examples above we get new notions such as computable lifting problems in presheaf assemblies and internal lifting problems in a topos we show that under reasonable conditions one can define a notion of universal lifting problem and carry out stepone of garners small object argument we give explicit descriptions of what the general construction looks like in some examples | [['many', 'interesting', 'classes', 'of', 'maps', 'from', 'homotopical', 'algebra', 'can', 'be', 'characterised', 'as', 'those', 'maps', 'with', 'the', 'right', 'lifting', 'property', 'against', 'certain', 'sets', 'of', 'maps', 'such', 'classes', 'are', 'sometimes', 'referred', 'to', 'as', 'cofibrantly', 'generated', 'in', 'a', 'more', 'sophisticated', 'notion', 'due', 'to', 'garner', 'referred', 'to', 'as', 'algebraically', 'cofibrantly', 'generated', 'the', 'set', 'of', 'maps', 'is', 'replaced', 'with', 'a', 'diagram', 'over', 'a', 'small', 'category', 'we', 'give', 'a', 'yet', 'more', 'general', 'definition', 'where', 'the', 'set', 'or', 'diagram', 'of', 'maps', 'is', 'replaced', 'with', 'a', 'vertical', 'map', 'in', 'a', 'grothendieck', 'fibration', 'in', 'addition', 'to', 'an', 'interesting', 'new', 'view', 'of', 'the', 'existing', 'examples', 'above', 'we', 'get', 'new', 'notions', 'such', 'as', 'computable', 'lifting', 'problems', 'in', 'presheaf', 'assemblies', 'and', 'internal', 'lifting', 'problems', 'in', 'a', 'topos', 'we', 'show', 'that', 'under', 'reasonable', 'conditions', 'one', 'can', 'define', 'a', 'notion', 'of', 'universal', 'lifting', 'problem', 'and', 'carry', 'out', 'stepone', 'of', 'garners', 'small', 'object', 'argument', 'we', 'give', 'explicit', 'descriptions', 'of', 'what', 'the', 'general', 'construction', 'looks', 'like', 'in', 'some', 'examples']] | [-0.11550412485896806, 0.07488505723114558, -0.09586834184531319, 0.14335652010279437, -0.11182235898970823, -0.15002510030018656, 0.005209148319217523, 0.35055616877875045, -0.3766816251173671, -0.262416959464501, 0.10356834775455737, -0.22839231359600826, -0.16269332450649113, 0.23694177057538918, -0.17698702511475667, -0.027751715565835566, 0.036683698357687956, 0.060848877520153395, -0.09662304046890456, -0.20443749404895292, 0.38608697420721383, 0.008176375535855951, 0.20553231417618104, 0.013876145988577167, 0.11442940375816665, -0.031253704232145345, -0.024088921310306575, 0.08465109091852546, -0.14429522955149304, 0.11015418328660369, 0.28066593977181536, 0.14783102094110004, 0.23782726965529086, -0.38169497122841056, -0.14708770892263456, 0.1718618038208469, 0.11148004755255227, 0.1124092033194182, -0.029017365177040982, -0.3003903816968791, 0.11285491467998854, -0.18982272014315976, -0.10547545006633491, -0.13062217737866663, 0.009796699653011992, 0.0031104021748576904, -0.2523534860688654, -0.05217397386226558, 0.10039087331326875, 0.13610024207522847, -0.049062669954238164, -0.06021699788490016, -0.03928413080039287, 0.09424430618252556, -0.013753435024562733, 0.051725362623600585, 0.12292443919240643, -0.1257218637436285, -0.10885836479122334, 0.4033623638342282, -0.04679799924212459, -0.23123426285057672, 0.20169662326531435, -0.08880314381033379, -0.17544984669841238, 0.11541332605319392, 0.06333753108475848, 0.1230808753431407, -0.07975089701358229, 0.10600923905133784, -0.14381723857705334, 0.09668971620205986, 0.11496777772155933, 0.07162677291183316, 0.1796651623015733, 0.11915421188735452, 0.11343367090165357, 0.21184149730298055, 0.02558241649775913, -0.08612818741484692, -0.3330887194943467, -0.12295174335782863, -0.08081873041718561, 0.10697853504107595, -0.06464051891491276, -0.22313066029700598, 0.3902584968355337, 0.1344097956990529, 0.24575410085411645, 0.07426798581390788, 0.24547884103958495, 0.06198073222817344, 0.08228384546543423, 0.01951335574573788, 0.12684910306281955, 0.14798417556908375, 0.01909150522107283, -0.039089414356950375, 0.03491389073468255, 0.1521589380113016] |
1,802.06719 | Causal Perturbative QFT and Space-time Geometry | This work is devoted to the causal perturbative Quantum Field Theory (QFT)
due to Bogoliubov, including QED and other realistic QFT. It is given the white
noise formulation of this theory. The white noise analysis and the Hida
operators as the creation and annihilation operators for free fields are used.
The whole Bogoliubov method is unchanged. Causal axioms of such QFT make sense
on any globally causal space-times. Perturbative QFT with Hida operators is
analysed on the flat Minkowski space-time and on the static Einstein Universe
(EU). On the flat Minkowski space-time this allowed us to go a step further in
the analysis of the adiabatic limit problem, the existence of which has a much
wider scope than in the theory based on Wightman's operator valued
distributions. The natural condition of existence of the adiabatic limit (as
generalized integral kernel operators of white noise calculus) for higher-order
contributions to the interacting fields, together with the remaining
assumptions of causal QFT (including the natural invariance conditions, e.g.
gauge invariance), allowed us to reduce the freedom in choice of
renormalization and imposed nontrivial conditions on the masses of elementary
particles. Obtained results on the flat space-time are confirmed by the
analogous results obtained for QFT on UE, where, moreover, the operators of the
interacting fields are much more regular, so, e.g. a consequent treatment of
the bound state problem becomes possible on EU. Our approach also enables the
analysis of the infrared asymptotics of QED on flat Minkowski spacetime, which
we also present.
| math-ph math.MP | this work is devoted to the causal perturbative quantum field theory qft due to bogoliubov including qed and other realistic qft it is given the white noise formulation of this theory the white noise analysis and the hida operators as the creation and annihilation operators for free fields are used the whole bogoliubov method is unchanged causal axioms of such qft make sense on any globally causal spacetimes perturbative qft with hida operators is analysed on the flat minkowski spacetime and on the static einstein universe eu on the flat minkowski spacetime this allowed us to go a step further in the analysis of the adiabatic limit problem the existence of which has a much wider scope than in the theory based on wightmans operator valued distributions the natural condition of existence of the adiabatic limit as generalized integral kernel operators of white noise calculus for higherorder contributions to the interacting fields together with the remaining assumptions of causal qft including the natural invariance conditions eg gauge invariance allowed us to reduce the freedom in choice of renormalization and imposed nontrivial conditions on the masses of elementary particles obtained results on the flat spacetime are confirmed by the analogous results obtained for qft on ue where moreover the operators of the interacting fields are much more regular so eg a consequent treatment of the bound state problem becomes possible on eu our approach also enables the analysis of the infrared asymptotics of qed on flat minkowski spacetime which we also present | [['this', 'work', 'is', 'devoted', 'to', 'the', 'causal', 'perturbative', 'quantum', 'field', 'theory', 'qft', 'due', 'to', 'bogoliubov', 'including', 'qed', 'and', 'other', 'realistic', 'qft', 'it', 'is', 'given', 'the', 'white', 'noise', 'formulation', 'of', 'this', 'theory', 'the', 'white', 'noise', 'analysis', 'and', 'the', 'hida', 'operators', 'as', 'the', 'creation', 'and', 'annihilation', 'operators', 'for', 'free', 'fields', 'are', 'used', 'the', 'whole', 'bogoliubov', 'method', 'is', 'unchanged', 'causal', 'axioms', 'of', 'such', 'qft', 'make', 'sense', 'on', 'any', 'globally', 'causal', 'spacetimes', 'perturbative', 'qft', 'with', 'hida', 'operators', 'is', 'analysed', 'on', 'the', 'flat', 'minkowski', 'spacetime', 'and', 'on', 'the', 'static', 'einstein', 'universe', 'eu', 'on', 'the', 'flat', 'minkowski', 'spacetime', 'this', 'allowed', 'us', 'to', 'go', 'a', 'step', 'further', 'in', 'the', 'analysis', 'of', 'the', 'adiabatic', 'limit', 'problem', 'the', 'existence', 'of', 'which', 'has', 'a', 'much', 'wider', 'scope', 'than', 'in', 'the', 'theory', 'based', 'on', 'wightmans', 'operator', 'valued', 'distributions', 'the', 'natural', 'condition', 'of', 'existence', 'of', 'the', 'adiabatic', 'limit', 'as', 'generalized', 'integral', 'kernel', 'operators', 'of', 'white', 'noise', 'calculus', 'for', 'higherorder', 'contributions', 'to', 'the', 'interacting', 'fields', 'together', 'with', 'the', 'remaining', 'assumptions', 'of', 'causal', 'qft', 'including', 'the', 'natural', 'invariance', 'conditions', 'eg', 'gauge', 'invariance', 'allowed', 'us', 'to', 'reduce', 'the', 'freedom', 'in', 'choice', 'of', 'renormalization', 'and', 'imposed', 'nontrivial', 'conditions', 'on', 'the', 'masses', 'of', 'elementary', 'particles', 'obtained', 'results', 'on', 'the', 'flat', 'spacetime', 'are', 'confirmed', 'by', 'the', 'analogous', 'results', 'obtained', 'for', 'qft', 'on', 'ue', 'where', 'moreover', 'the', 'operators', 'of', 'the', 'interacting', 'fields', 'are', 'much', 'more', 'regular', 'so', 'eg', 'a', 'consequent', 'treatment', 'of', 'the', 'bound', 'state', 'problem', 'becomes', 'possible', 'on', 'eu', 'our', 'approach', 'also', 'enables', 'the', 'analysis', 'of', 'the', 'infrared', 'asymptotics', 'of', 'qed', 'on', 'flat', 'minkowski', 'spacetime', 'which', 'we', 'also', 'present']] | [-0.0983364237087456, 0.1382135371733234, -0.11502646123786342, 0.11889723919385829, -0.10448381313367698, -0.11166686262096838, 0.03294833597265169, 0.3003507481064217, -0.18979208890638088, -0.24207480025080688, 0.0744675790470843, -0.258111729509238, -0.12078495156618235, 0.1830715467899192, -0.06634617935814172, 0.05903436150494592, 0.020296145933661684, 0.0782115470325348, -0.09072634606669468, -0.25391999900107276, 0.38552259004385436, 0.06843265778555783, 0.2933801095895618, 0.019214581110073157, 0.08431476649765178, 0.05176589767489419, -0.06890608409542101, 0.0035852292010864887, -0.12446331382502776, 0.11233092317602549, 0.20765983167315918, 0.08451433189443323, 0.2308055206227016, -0.4471220153446988, -0.22976856796716552, 0.07843221226554972, 0.10768733582906036, 0.10989827965015167, 0.0026732033451502416, -0.34479002670136344, 0.03580704630645682, -0.12312441072853438, -0.1562837884706664, -0.088037945545349, -0.01634373407452868, -0.07708898502442822, -0.24953266341087085, 0.08230895464437497, 0.0723813150808089, 0.02561620651072715, -0.09155479226580476, -0.06756967623380432, -0.011400975824048023, 0.07861092711142097, 0.07506725243088674, 0.016074388492963762, 0.12493384692565616, -0.11567638844596705, -0.10141873808134258, 0.37362092483554044, -0.06542423361499815, -0.24083509594359737, 0.17177975207587623, -0.1646223963197484, -0.1286133857521848, 0.08237981701462689, 0.12179370306221679, 0.15397286390808254, -0.1496763563347587, 0.21033944269207183, -0.021372232636004553, 0.10890249136730516, 0.09453640932558602, 0.09648658722579717, 0.17358056914462036, 0.09012361392341703, 0.07706588230826762, 0.10585343686189407, -0.01949921559794728, -0.15356171819700515, -0.3847467686936437, -0.15394853759604318, -0.14492115298234134, 0.08445519743073523, -0.13447727629769013, -0.22082853807039945, 0.3809348555134268, 0.1631341485308476, 0.12314383404893407, 0.03809748887663254, 0.25876850250410843, 0.14721131098198806, 0.07291903106339899, 0.05302523765564558, 0.23418805105389054, 0.18535526501538002, 0.09880571681597972, -0.20577423788321417, -0.03878655503095829, 0.09159049737189277] |
1,802.0672 | Integrable Minisuperspace Models with Liouville Field: Energy Density
Self-Adjointness and Semiclassical Wave Packets | The homogeneous cosmological models with a Liouville scalar field are
investigated in classical and quantum context of Wheeler-DeWitt
geometrodynamics. In the quantum case of quintessence field with potential
unbounded from below and phantom field, the energy density operators are not
essentially self-adjoint and self-adjoint extensions contain ambiguities.
Therefore the same classical actions correspond to a family of distinct quantum
models. For the phantom field the energy spectrum happens to be discrete. The
probability conservation and appropriate classical limit can be achieved with a
certain restriction of the functional class. The appropriately localized wave
packets are studied numerically using the Schrodinger's norm and a conserved
Mostafazadeh's norm introduced from techniques of pseudo-Hermitian quantum
mechanics. These norms give a similar packet evolution that is confronted with
analytical classical solutions.
| hep-th gr-qc | the homogeneous cosmological models with a liouville scalar field are investigated in classical and quantum context of wheelerdewitt geometrodynamics in the quantum case of quintessence field with potential unbounded from below and phantom field the energy density operators are not essentially selfadjoint and selfadjoint extensions contain ambiguities therefore the same classical actions correspond to a family of distinct quantum models for the phantom field the energy spectrum happens to be discrete the probability conservation and appropriate classical limit can be achieved with a certain restriction of the functional class the appropriately localized wave packets are studied numerically using the schrodingers norm and a conserved mostafazadehs norm introduced from techniques of pseudohermitian quantum mechanics these norms give a similar packet evolution that is confronted with analytical classical solutions | [['the', 'homogeneous', 'cosmological', 'models', 'with', 'a', 'liouville', 'scalar', 'field', 'are', 'investigated', 'in', 'classical', 'and', 'quantum', 'context', 'of', 'wheelerdewitt', 'geometrodynamics', 'in', 'the', 'quantum', 'case', 'of', 'quintessence', 'field', 'with', 'potential', 'unbounded', 'from', 'below', 'and', 'phantom', 'field', 'the', 'energy', 'density', 'operators', 'are', 'not', 'essentially', 'selfadjoint', 'and', 'selfadjoint', 'extensions', 'contain', 'ambiguities', 'therefore', 'the', 'same', 'classical', 'actions', 'correspond', 'to', 'a', 'family', 'of', 'distinct', 'quantum', 'models', 'for', 'the', 'phantom', 'field', 'the', 'energy', 'spectrum', 'happens', 'to', 'be', 'discrete', 'the', 'probability', 'conservation', 'and', 'appropriate', 'classical', 'limit', 'can', 'be', 'achieved', 'with', 'a', 'certain', 'restriction', 'of', 'the', 'functional', 'class', 'the', 'appropriately', 'localized', 'wave', 'packets', 'are', 'studied', 'numerically', 'using', 'the', 'schrodingers', 'norm', 'and', 'a', 'conserved', 'mostafazadehs', 'norm', 'introduced', 'from', 'techniques', 'of', 'pseudohermitian', 'quantum', 'mechanics', 'these', 'norms', 'give', 'a', 'similar', 'packet', 'evolution', 'that', 'is', 'confronted', 'with', 'analytical', 'classical', 'solutions']] | [-0.12499285775369831, 0.15741245644462723, -0.09452498186470217, 0.12297960613680531, -0.06991260529991003, -0.18537612208017398, -0.06170965712295756, 0.31230529951345587, -0.2688571576191674, -0.25482824463249437, 0.0761702918033633, -0.2659335760104041, -0.12019595366326116, 0.15486533682985557, -0.054194157355509344, 0.12157978675520373, 0.05709280258613742, 0.11475382804397553, -0.08155311591043654, -0.22295548723241876, 0.38509597614525803, 0.0217569322650513, 0.23450452058773769, -0.0029729442441806435, 0.07262567838835013, -0.025735760576993463, 0.03399627270280487, 0.03699599413038601, -0.1468129664078463, 0.08009969486692359, 0.2567238268183867, 0.10048871425290902, 0.2538339014253801, -0.46234020055641256, -0.2755644185531382, 0.15653642388947664, 0.12317236665902394, 0.12842677682564255, -0.03892129108989759, -0.3359872800915221, 0.04601639227956415, -0.15256752997695927, -0.15843979313614823, -0.06158835012170057, -0.02986519711206682, 0.0335568811241833, -0.23519389911199964, 0.13345125133988434, 0.018313365448857585, 0.026293034500364836, -0.1287289355282805, -0.07085891463793814, -0.019091880817468914, 0.06223434879858461, 0.03934263777808242, 0.02440536046578061, 0.11427453938975102, -0.11448098225371232, -0.12576990639365884, 0.36356009453644106, -0.06451672836325116, -0.2737829073347033, 0.13031749928366423, -0.12691770558659402, -0.07664637289394344, 0.10172362649390133, 0.07343839363209785, 0.11152032295626307, -0.12504945523687638, 0.20477942869368393, 0.0039188797718019315, 0.12104326213843056, 0.08522304179634721, 0.07305436579894925, 0.2037855792968046, 0.03257494096437262, 0.05200133629379764, 0.0878497222124318, 0.01782540803579318, -0.21074942385201298, -0.3642399422972212, -0.16218096398127577, -0.1887452669574746, 0.1215507580833103, -0.10016403678887328, -0.18867112114094198, 0.38960171742216937, 0.10457379712043183, 0.1528169102929828, 0.062303822997602676, 0.22965300032344188, 0.20121258174970982, 0.04560013654612241, 0.07198798439894168, 0.2205114085014747, 0.18504899118505863, 0.1090396922765418, -0.20555517568145804, -0.06359525048173964, 0.09157289333626746] |
1,802.06721 | Segregation in Religion Networks | Religious beliefs could facilitate human cooperation [1-6], promote civic
engagement [7-10], improve life satisfaction [11-13] and even boom economic
development [14-16]. On the other side, some aspects of religion may lead to
regional violence, intergroup conflict and moral prejudice against atheists
[17-23]. Analogous to the separation of races [24], the religious segregation
is a major ingredient resulting in increasing alienation, misunderstanding,
cultural conflict and even violence among believers of different faiths
[18,19,25]. Thus far, quantitative understanding of religious segregation is
rare. Here we analyze a directed social network extracted from weibo.com (the
largest directed social network in China, similar to twitter.com), which is
consisted of 6875 believers in Christianism, Buddhism, Islam and Taoism. This
religion network is highly segregative, with only 1.6% of links connecting
individuals in different religions. Comparative analysis shows that the extent
of segregation for different religions is much higher than that for different
races and slightly higher than that for different political parties. The few
cross-religion links play a critical role in maintaining network connectivity,
being remarkably more important than links with highest betweennesses [26] or
bridgenesses [27]. Further content analysis shows that 46.7% of these
cross-religion links are probably related to charitable issues. Our findings
provide quantitative insights into religious segregation and valuable clues to
encourage cross-religion communications.
| physics.soc-ph cs.SI | religious beliefs could facilitate human cooperation 16 promote civic engagement 710 improve life satisfaction 1113 and even boom economic development 1416 on the other side some aspects of religion may lead to regional violence intergroup conflict and moral prejudice against atheists 1723 analogous to the separation of races 24 the religious segregation is a major ingredient resulting in increasing alienation misunderstanding cultural conflict and even violence among believers of different faiths 181925 thus far quantitative understanding of religious segregation is rare here we analyze a directed social network extracted from weibocom the largest directed social network in china similar to twittercom which is consisted of 6875 believers in christianism buddhism islam and taoism this religion network is highly segregative with only 16 of links connecting individuals in different religions comparative analysis shows that the extent of segregation for different religions is much higher than that for different races and slightly higher than that for different political parties the few crossreligion links play a critical role in maintaining network connectivity being remarkably more important than links with highest betweennesses 26 or bridgenesses 27 further content analysis shows that 467 of these crossreligion links are probably related to charitable issues our findings provide quantitative insights into religious segregation and valuable clues to encourage crossreligion communications | [['religious', 'beliefs', 'could', 'facilitate', 'human', 'cooperation', '16', 'promote', 'civic', 'engagement', '710', 'improve', 'life', 'satisfaction', '1113', 'and', 'even', 'boom', 'economic', 'development', '1416', 'on', 'the', 'other', 'side', 'some', 'aspects', 'of', 'religion', 'may', 'lead', 'to', 'regional', 'violence', 'intergroup', 'conflict', 'and', 'moral', 'prejudice', 'against', 'atheists', '1723', 'analogous', 'to', 'the', 'separation', 'of', 'races', '24', 'the', 'religious', 'segregation', 'is', 'a', 'major', 'ingredient', 'resulting', 'in', 'increasing', 'alienation', 'misunderstanding', 'cultural', 'conflict', 'and', 'even', 'violence', 'among', 'believers', 'of', 'different', 'faiths', '181925', 'thus', 'far', 'quantitative', 'understanding', 'of', 'religious', 'segregation', 'is', 'rare', 'here', 'we', 'analyze', 'a', 'directed', 'social', 'network', 'extracted', 'from', 'weibocom', 'the', 'largest', 'directed', 'social', 'network', 'in', 'china', 'similar', 'to', 'twittercom', 'which', 'is', 'consisted', 'of', '6875', 'believers', 'in', 'christianism', 'buddhism', 'islam', 'and', 'taoism', 'this', 'religion', 'network', 'is', 'highly', 'segregative', 'with', 'only', '16', 'of', 'links', 'connecting', 'individuals', 'in', 'different', 'religions', 'comparative', 'analysis', 'shows', 'that', 'the', 'extent', 'of', 'segregation', 'for', 'different', 'religions', 'is', 'much', 'higher', 'than', 'that', 'for', 'different', 'races', 'and', 'slightly', 'higher', 'than', 'that', 'for', 'different', 'political', 'parties', 'the', 'few', 'crossreligion', 'links', 'play', 'a', 'critical', 'role', 'in', 'maintaining', 'network', 'connectivity', 'being', 'remarkably', 'more', 'important', 'than', 'links', 'with', 'highest', 'betweennesses', '26', 'or', 'bridgenesses', '27', 'further', 'content', 'analysis', 'shows', 'that', '467', 'of', 'these', 'crossreligion', 'links', 'are', 'probably', 'related', 'to', 'charitable', 'issues', 'our', 'findings', 'provide', 'quantitative', 'insights', 'into', 'religious', 'segregation', 'and', 'valuable', 'clues', 'to', 'encourage', 'crossreligion', 'communications']] | [-0.11169563704430244, 0.12434231155117956, -0.07135746808489785, 0.1365662447165006, -0.12496954248992057, -0.15932321635264796, 0.08454971338929698, 0.3518159197896574, -0.18098792684201187, -0.35684615673578696, 0.07888131931614022, -0.3271292299936408, -0.18014182796638495, 0.14438616367649215, -0.12447959021071776, -0.08278113932175578, 0.06600518457679692, 0.006755582194405752, 0.031196867429438835, -0.2521698845627275, 0.28929052136056305, 0.06312260157722546, 0.3380701799574082, 0.10309110894783409, 0.0037514224074310758, -0.01884031849144732, -0.09310573661610602, -0.005809461501273282, -0.09067019590985333, 0.13835336185666253, 0.3195404910450819, 0.19819349209886514, 0.3670029482912742, -0.44261177317793166, -0.1846973097892207, 0.0913962525040986, 0.15647182007855961, 0.05105174980657537, -0.004547258090576523, -0.3180638028860309, 0.07218052375071582, -0.20520125611716863, -0.06169964270485402, -0.0029618561813761525, 0.0328049733409024, -0.005610041460898271, -0.1801113560208056, 0.097567512129334, 0.029176654152852456, 0.17655942800852642, -0.041259329710653034, -0.16426465970925191, -0.05263975824204554, 0.22828886056309272, 0.08334401642872039, 0.03447999493080503, 0.14198195303731498, -0.15218825337987898, -0.13859490219512682, 0.3861980187973387, 0.035306215698300135, -0.09289065220063208, 0.24160434323751812, -0.1235643455649057, -0.1793475005802816, 0.07495816099543341, 0.18246877499747552, 0.011235755190108587, -0.13071065747011815, -0.1136112082178831, -0.022941943761006504, 0.17983423107421226, 0.10922114374522951, 0.03093179794439811, 0.212009354788376, 0.1746089464648021, 0.08689335536254679, 0.05710660878911352, -0.0025539054417783773, -0.14673154172798375, -0.15362921865991525, -0.14011465348484156, -0.05259109895735147, 0.057450921289556096, -0.1398955851481624, -0.08881839637608421, 0.3553599795525514, 0.17200241580512826, 0.12107998655331366, 0.02076682334288828, 0.19572567375313527, -0.04429701848342128, 0.0844437688073704, 0.05635744208488071, 0.2116064224763744, 0.04535456493867616, 0.16493883014891694, -0.15653883732145527, 0.18276881435106157, -0.04049786540693197] |
1,802.06722 | Unified Classical and `Quantum Mechanical' Gravity! | It is shown that a unified description of classical and `quantum mechanical'
gravity in its linearized form is possible.
| physics.gen-ph | it is shown that a unified description of classical and quantum mechanical gravity in its linearized form is possible | [['it', 'is', 'shown', 'that', 'a', 'unified', 'description', 'of', 'classical', 'and', 'quantum', 'mechanical', 'gravity', 'in', 'its', 'linearized', 'form', 'is', 'possible']] | [-0.14019283024275578, 0.10894061213261202, -0.1869589114855779, 0.07785231361508761, -0.09843015131589614, -0.16947754761694292, -0.05644855958311573, 0.266755805595925, -0.2852578443769169, -0.2145162696312917, 0.020510599997482802, -0.22380922479849114, -0.2639819599295917, 0.20257654903750671, -0.06973644439131021, 0.08638846981768056, 0.022291906361811255, 0.1337236613035202, -0.044642363469680084, -0.19849561115628794, 0.2253577991535789, 0.08549255271760844, 0.280957623789283, 0.030084090822033192, 0.1373643420244518, -0.05340738155830063, 0.04880807896781909, 0.07175847054704239, -0.11892515922303765, 0.09673644190556124, 0.23528879942176373, 0.13297106396700992, 0.24666850131593251, -0.4225529549937499, -0.2537783540687279, 0.016655821402214076, 0.08690577490549338, 0.1735650051728283, -0.040156209792353605, -0.2139924969524145, 0.10903510907174725, -0.1857507722207198, -0.15214165952056646, -0.14281301587623985, 0.05269696151739672, -0.11222105365442603, -0.19895494815060183, 0.08482391593095504, 0.1329651728860642, -0.01961909322754333, -0.059156037873196364, -0.010110419635709963, 0.004887147365432037, 0.06412966409698129, -0.001901633902697971, 0.06798676867038012, 0.109528402356725, -0.16134382960827728, -0.0763843679114392, 0.4989066923919477, -0.040644865581079534, -0.24326910098132334, 0.22377820097302137, -0.10356330900992218, -0.07499112595656984, 0.07079339968530755, 0.044727699929162076, 0.11633773834297531, -0.21791575148113465, 0.192305215729376, -0.05367127404009041, 0.12377752344075002, 0.039334082828932686, 0.08072289042664986, 0.2570828973854843, 0.1567414628439828, 0.028543570569079173, 0.14133846269626366, 0.017328509766804546, -0.2278646318958827, -0.36631193835484355, -0.22162391652206057, -0.19088529697374293, 0.1355331415604604, -0.05282837988143958, -0.19431531292502768, 0.3593167351240194, 0.10339146191683157, 0.07818469209106345, 0.023872368429836473, 0.2777918863453363, 0.15641433765229426, 0.05417618956907015, 0.05628658492902392, 0.3394956631880057, 0.21040919697598406, 0.028881348510223784, -0.25028369031650455, -0.03234054219271792, 0.07652117405086756] |
1,802.06723 | On Learning the $c\mu$ Rule in Single and Parallel Server Networks | We consider learning-based variants of the $c \mu$ rule for scheduling in
single and parallel server settings of multi-class queueing systems.
In the single server setting, the $c \mu$ rule is known to minimize the
expected holding-cost (weighted queue-lengths summed over classes and a fixed
time horizon). We focus on the problem where the service rates $\mu$ are
unknown with the holding-cost regret (regret against the $c \mu$ rule with
known $\mu$) as our objective. We show that the greedy algorithm that uses
empirically learned service rates results in a constant holding-cost regret
(the regret is independent of the time horizon). This free exploration can be
explained in the single server setting by the fact that any work-conserving
policy obtains the same number of samples in a busy cycle.
In the parallel server setting, we show that the $c \mu$ rule may result in
unstable queues, even for arrival rates within the capacity region. We then
present sufficient conditions for geometric ergodicity under the $c \mu$ rule.
Using these results, we propose an almost greedy algorithm that explores only
when the number of samples falls below a threshold. We show that this algorithm
delivers constant holding-cost regret because a free exploration condition is
eventually satisfied.
| cs.PF math.OC | we consider learningbased variants of the c mu rule for scheduling in single and parallel server settings of multiclass queueing systems in the single server setting the c mu rule is known to minimize the expected holdingcost weighted queuelengths summed over classes and a fixed time horizon we focus on the problem where the service rates mu are unknown with the holdingcost regret regret against the c mu rule with known mu as our objective we show that the greedy algorithm that uses empirically learned service rates results in a constant holdingcost regret the regret is independent of the time horizon this free exploration can be explained in the single server setting by the fact that any workconserving policy obtains the same number of samples in a busy cycle in the parallel server setting we show that the c mu rule may result in unstable queues even for arrival rates within the capacity region we then present sufficient conditions for geometric ergodicity under the c mu rule using these results we propose an almost greedy algorithm that explores only when the number of samples falls below a threshold we show that this algorithm delivers constant holdingcost regret because a free exploration condition is eventually satisfied | [['we', 'consider', 'learningbased', 'variants', 'of', 'the', 'c', 'mu', 'rule', 'for', 'scheduling', 'in', 'single', 'and', 'parallel', 'server', 'settings', 'of', 'multiclass', 'queueing', 'systems', 'in', 'the', 'single', 'server', 'setting', 'the', 'c', 'mu', 'rule', 'is', 'known', 'to', 'minimize', 'the', 'expected', 'holdingcost', 'weighted', 'queuelengths', 'summed', 'over', 'classes', 'and', 'a', 'fixed', 'time', 'horizon', 'we', 'focus', 'on', 'the', 'problem', 'where', 'the', 'service', 'rates', 'mu', 'are', 'unknown', 'with', 'the', 'holdingcost', 'regret', 'regret', 'against', 'the', 'c', 'mu', 'rule', 'with', 'known', 'mu', 'as', 'our', 'objective', 'we', 'show', 'that', 'the', 'greedy', 'algorithm', 'that', 'uses', 'empirically', 'learned', 'service', 'rates', 'results', 'in', 'a', 'constant', 'holdingcost', 'regret', 'the', 'regret', 'is', 'independent', 'of', 'the', 'time', 'horizon', 'this', 'free', 'exploration', 'can', 'be', 'explained', 'in', 'the', 'single', 'server', 'setting', 'by', 'the', 'fact', 'that', 'any', 'workconserving', 'policy', 'obtains', 'the', 'same', 'number', 'of', 'samples', 'in', 'a', 'busy', 'cycle', 'in', 'the', 'parallel', 'server', 'setting', 'we', 'show', 'that', 'the', 'c', 'mu', 'rule', 'may', 'result', 'in', 'unstable', 'queues', 'even', 'for', 'arrival', 'rates', 'within', 'the', 'capacity', 'region', 'we', 'then', 'present', 'sufficient', 'conditions', 'for', 'geometric', 'ergodicity', 'under', 'the', 'c', 'mu', 'rule', 'using', 'these', 'results', 'we', 'propose', 'an', 'almost', 'greedy', 'algorithm', 'that', 'explores', 'only', 'when', 'the', 'number', 'of', 'samples', 'falls', 'below', 'a', 'threshold', 'we', 'show', 'that', 'this', 'algorithm', 'delivers', 'constant', 'holdingcost', 'regret', 'because', 'a', 'free', 'exploration', 'condition', 'is', 'eventually', 'satisfied']] | [-0.17865887500073124, 0.08463158894893884, -0.0676045254077308, 0.07107715733042669, -0.05146684283504217, -0.19765526841440034, 0.1937757549228192, 0.4144471347877165, -0.2924183864509914, -0.2763750434336366, 0.09044103707675254, -0.223163573984511, -0.09801860589693051, 0.17574580874430334, -0.12911030958170958, 0.062469928769993514, 0.08243963866290159, 0.09664530750454926, 0.0005913310144778068, -0.3058757662670914, 0.2756596457576606, 0.052247168829028565, 0.28325844860930993, 0.026346393451151414, 0.08981873234506788, 0.026741136983036994, 0.021507634818781075, 0.013901438034230435, -0.15719694992202254, 0.010635445591221314, 0.25592744543398843, 0.19252219544180596, 0.298297816405936, -0.3431553864601727, -0.14103321307225197, 0.15114727196647082, 0.11379158200877833, 0.046015199955564176, -0.018565814376087494, -0.2341374273514148, 0.11910413446063857, -0.1423655489595925, -0.056125327279200644, -0.04888893870250663, -0.011423754763630469, 0.025164284457157297, -0.35373267976385425, 0.04488341590253318, 0.061410478091367134, -0.016887178619551222, -0.0702806405231879, -0.13738246424941392, 0.04793658382940765, 0.09390996151629313, 0.08038593108890714, 0.043818423844783044, 0.1473355574601489, -0.08422157768296396, -0.15789921850465782, 0.3613837320584713, -0.1030097918244215, -0.1772810293770418, 0.14466819695719496, -0.11129180721529737, -0.1567883309408477, 0.12459218370864486, 0.1879935760806292, 0.15707700442204753, -0.1557167421496138, 0.11636341670016963, -0.07858043744685923, 0.14882024587472764, 0.06697726780207965, 0.01713326183352165, 0.10569422046040616, 0.17541607310314003, 0.1581395160179676, 0.1554876603146379, -0.05981928625189495, -0.12204920329017246, -0.31891118582201805, -0.13908080950651955, -0.18828032889357973, 0.028099928816167137, -0.12696623558436929, -0.10539746960034457, 0.2897072437242037, 0.12601566863552918, 0.21083819618584906, 0.18998867785842044, 0.31552613263086576, 0.1095934119947232, 0.05321937083357536, 0.1775026462813158, 0.17378299039584108, 0.007423753583258609, 0.10804990375948298, -0.20233892804329714, 0.12194565800359336, 0.04905444344551098] |
1,802.06724 | Learning Representative Temporal Features for Action Recognition | In this paper, a novel video classification method is presented that aims to
recognize different categories of third-person videos efficiently. Our
motivation is to achieve a light model that could be trained with insufficient
training data. With this intuition, the processing of the 3-dimensional video
input is broken to 1D in temporal dimension on top of the 2D in spatial. The
processes related to 2D spatial frames are being done by utilizing pre-trained
networks with no training phase. The only step which involves training is to
classify the 1D time series resulted from the description of the 2D signals. As
a matter of fact, optical flow images are first calculated from consecutive
frames and described by pre-trained CNN networks. Their dimension is then
reduced using PCA. By stacking the description vectors beside each other, a
multi-channel time series is created for each video. Each channel of the time
series represents a specific feature and follows it over time. The main focus
of the proposed method is to classify the obtained time series effectively.
Towards this, the idea is to let the machine learn temporal features. This is
done by training a multi-channel one dimensional Convolutional Neural Network
(1D-CNN). The 1D-CNN learns the features along the only temporal dimension.
Hence, the number of training parameters decreases significantly which would
result in the trainability of the method on even smaller datasets. It is
illustrated that the proposed method could reach the state-of-the-art results
on two public datasets UCF11, jHMDB and competitive results on HMDB51.
| cs.CV | in this paper a novel video classification method is presented that aims to recognize different categories of thirdperson videos efficiently our motivation is to achieve a light model that could be trained with insufficient training data with this intuition the processing of the 3dimensional video input is broken to 1d in temporal dimension on top of the 2d in spatial the processes related to 2d spatial frames are being done by utilizing pretrained networks with no training phase the only step which involves training is to classify the 1d time series resulted from the description of the 2d signals as a matter of fact optical flow images are first calculated from consecutive frames and described by pretrained cnn networks their dimension is then reduced using pca by stacking the description vectors beside each other a multichannel time series is created for each video each channel of the time series represents a specific feature and follows it over time the main focus of the proposed method is to classify the obtained time series effectively towards this the idea is to let the machine learn temporal features this is done by training a multichannel one dimensional convolutional neural network 1dcnn the 1dcnn learns the features along the only temporal dimension hence the number of training parameters decreases significantly which would result in the trainability of the method on even smaller datasets it is illustrated that the proposed method could reach the stateoftheart results on two public datasets ucf11 jhmdb and competitive results on hmdb51 | [['in', 'this', 'paper', 'a', 'novel', 'video', 'classification', 'method', 'is', 'presented', 'that', 'aims', 'to', 'recognize', 'different', 'categories', 'of', 'thirdperson', 'videos', 'efficiently', 'our', 'motivation', 'is', 'to', 'achieve', 'a', 'light', 'model', 'that', 'could', 'be', 'trained', 'with', 'insufficient', 'training', 'data', 'with', 'this', 'intuition', 'the', 'processing', 'of', 'the', '3dimensional', 'video', 'input', 'is', 'broken', 'to', '1d', 'in', 'temporal', 'dimension', 'on', 'top', 'of', 'the', '2d', 'in', 'spatial', 'the', 'processes', 'related', 'to', '2d', 'spatial', 'frames', 'are', 'being', 'done', 'by', 'utilizing', 'pretrained', 'networks', 'with', 'no', 'training', 'phase', 'the', 'only', 'step', 'which', 'involves', 'training', 'is', 'to', 'classify', 'the', '1d', 'time', 'series', 'resulted', 'from', 'the', 'description', 'of', 'the', '2d', 'signals', 'as', 'a', 'matter', 'of', 'fact', 'optical', 'flow', 'images', 'are', 'first', 'calculated', 'from', 'consecutive', 'frames', 'and', 'described', 'by', 'pretrained', 'cnn', 'networks', 'their', 'dimension', 'is', 'then', 'reduced', 'using', 'pca', 'by', 'stacking', 'the', 'description', 'vectors', 'beside', 'each', 'other', 'a', 'multichannel', 'time', 'series', 'is', 'created', 'for', 'each', 'video', 'each', 'channel', 'of', 'the', 'time', 'series', 'represents', 'a', 'specific', 'feature', 'and', 'follows', 'it', 'over', 'time', 'the', 'main', 'focus', 'of', 'the', 'proposed', 'method', 'is', 'to', 'classify', 'the', 'obtained', 'time', 'series', 'effectively', 'towards', 'this', 'the', 'idea', 'is', 'to', 'let', 'the', 'machine', 'learn', 'temporal', 'features', 'this', 'is', 'done', 'by', 'training', 'a', 'multichannel', 'one', 'dimensional', 'convolutional', 'neural', 'network', '1dcnn', 'the', '1dcnn', 'learns', 'the', 'features', 'along', 'the', 'only', 'temporal', 'dimension', 'hence', 'the', 'number', 'of', 'training', 'parameters', 'decreases', 'significantly', 'which', 'would', 'result', 'in', 'the', 'trainability', 'of', 'the', 'method', 'on', 'even', 'smaller', 'datasets', 'it', 'is', 'illustrated', 'that', 'the', 'proposed', 'method', 'could', 'reach', 'the', 'stateoftheart', 'results', 'on', 'two', 'public', 'datasets', 'ucf11', 'jhmdb', 'and', 'competitive', 'results', 'on', 'hmdb51']] | [-0.07415644304701201, 0.05036403840252509, -0.07094867514734644, 0.02840339546720128, -0.07189607294553536, -0.17534321544545015, -0.017190331245295794, 0.4222056153599942, -0.2881412233285133, -0.2995207897786583, 0.07748321997230902, -0.2610485835910021, -0.15763871124917864, 0.19943271094419446, -0.10067654931051745, 0.04879638143225632, 0.12780561189754822, 0.07834282744535437, -0.05206316783802495, -0.3131960807571424, 0.3133542361444727, 0.03787158356539698, 0.3314919366560403, -0.014949319407432562, 0.12407695886582905, -0.030084276156100844, -0.07327259096916625, -0.009660562938300981, -0.03295311506138075, 0.15451580070380477, 0.27772402380212463, 0.1477302011261354, 0.2818958193972884, -0.4122552663560898, -0.24869274795896168, 0.07779558705321203, 0.13259126004644683, 0.12298832763744508, -0.0017397604394881498, -0.3435496084303373, 0.10185970114969042, -0.1095050874994033, -0.019285316987421423, -0.1048689985440837, -0.014253485433679694, -0.025359446138498328, -0.28274269115423695, 0.048604389449344976, 0.07131681301157981, 0.04144820047261578, -0.054689500284092946, -0.08170019384540085, -0.029636230298487973, 0.1658743930835506, 0.0423006436340363, 0.06926893986048295, 0.09684952334288345, -0.14148570553230197, -0.12671484763453167, 0.38337534295195447, -0.06977608416318185, -0.19010785395383006, 0.19971300091521468, -0.0749531358633826, -0.11423088206229584, 0.13462050004108322, 0.20405051358125453, 0.11519458152848991, -0.1555438298281164, 0.009204264511503251, -0.06727751440715991, 0.21005256971970776, 0.053525868437385986, -0.01838406042190313, 0.16346488961449174, 0.2587724300415536, -0.0010880168697368058, 0.14593745880397146, -0.1477352627837299, -0.048470859254141234, -0.24041782624604704, -0.11270202646338721, -0.2451143724075149, -0.018978671377731696, -0.11008124161930431, -0.10573136481662726, 0.44016524095139986, 0.18926659609462063, 0.23283369372698612, 0.10464680977332007, 0.34831082672278013, 0.054783381869099916, 0.13158594195764245, 0.07260022644463572, 0.1640982189010607, 0.028328022500592475, 0.14030661938493952, -0.16181014142865832, 0.048824461768769346, 0.10969199224316056] |
1,802.06725 | Regularization methods for finding the relaxation time spectra of linear
polydisperse polymer melts | The calculation of discrete or continuous relaxation time spectra from
rheometric measurables of polydisperse polymers is an ill-posed problem. In
this paper, a curve fitting method for solving this problem is presented and
compared to selected models from the literature. It is shown that the new
method is capable of correctly predicting the molecular mass distributions of
linear polydisperse polymer melts as well as their relaxation time spectra.
| cond-mat.soft | the calculation of discrete or continuous relaxation time spectra from rheometric measurables of polydisperse polymers is an illposed problem in this paper a curve fitting method for solving this problem is presented and compared to selected models from the literature it is shown that the new method is capable of correctly predicting the molecular mass distributions of linear polydisperse polymer melts as well as their relaxation time spectra | [['the', 'calculation', 'of', 'discrete', 'or', 'continuous', 'relaxation', 'time', 'spectra', 'from', 'rheometric', 'measurables', 'of', 'polydisperse', 'polymers', 'is', 'an', 'illposed', 'problem', 'in', 'this', 'paper', 'a', 'curve', 'fitting', 'method', 'for', 'solving', 'this', 'problem', 'is', 'presented', 'and', 'compared', 'to', 'selected', 'models', 'from', 'the', 'literature', 'it', 'is', 'shown', 'that', 'the', 'new', 'method', 'is', 'capable', 'of', 'correctly', 'predicting', 'the', 'molecular', 'mass', 'distributions', 'of', 'linear', 'polydisperse', 'polymer', 'melts', 'as', 'well', 'as', 'their', 'relaxation', 'time', 'spectra']] | [-0.00172009488725213, 0.08742096911459264, -0.12427710423328202, 0.05395345294998739, -0.019555015393587595, -0.14071445236229063, -0.0337055541749578, 0.39969381124383824, -0.3090220203020555, -0.29469716836534005, 0.09615263266673804, -0.2701255657764919, -0.1345110252561212, 0.2077019334435189, -0.01889346439993995, 0.15577983960290165, 0.05839321866412373, -0.050955722848063004, -0.05083586558740696, -0.2073453560108593, 0.23021318452597103, 0.05781255529590828, 0.23519010407685795, 0.028716211166123256, 0.10730644512702436, 0.02387760699425331, -0.004791476869928267, 0.04771827166790471, -0.13063075654741518, 0.0828059441923602, 0.26955573893091617, 0.084312720787506, 0.22651706788661508, -0.3694750005927156, -0.2517123688423239, 0.10311398082686697, 0.15900656109785333, 0.13449739470482147, -0.02161583268111024, -0.20622756034957573, 0.05052946232642759, -0.13248772770577275, -0.10972825288498665, -0.07110534661435797, 0.0430715536178254, 0.03873818796401953, -0.25540240640368533, 0.15514554667478317, 0.05092912775580771, 0.03811995530336657, -0.12824471842716723, -0.11991397248964537, -0.005753507786293459, 0.07697029720978155, 0.09013517047552501, 0.016142383144196013, 0.13774720730725676, -0.10439790906521547, -0.07760467151563395, 0.4570625238120556, -0.0325793457484585, -0.18067424415665514, 0.1958095163709539, -0.06905675664379754, -0.11983383082962759, 0.21562403744524894, 0.1725410355001633, 0.22363521827740923, -0.1960337804219521, 0.04670767001174253, -0.08172446108587525, 0.19764762185513973, -0.0028265247340588007, -0.04355378102456384, 0.17286650935078368, 0.2306809817057322, 0.010624458684640773, 0.16371435848722124, -0.07876808190314263, -0.0991864746217342, -0.23414551420137286, -0.15182083860204063, -0.26271263964693337, 0.0012303032152190367, -0.06660577123415458, -0.17057466542695798, 0.3688111579703057, 0.10358693167526166, 0.20813061889117201, 0.1397697954876896, 0.2876921736580484, 0.1391394249512814, 0.014380920264075565, 0.03475955143735251, 0.1896859496448408, 0.14235890006153462, 0.1272380424608641, -0.26313354370102066, 0.08361525619950365, 0.06496357880121864] |
1,802.06726 | On quasi-invariant curves | Quasi-invariant curves are used in the study of hedgehog dynamics.
Denjoy-Yoccoz lemma is the preliminary step for Yoccoz's complex
renormalization techniques for the study of linearization of analytic circle
diffeomorphisms. We give a geometric interpretation of Denjoy-Yoccoz lemma
using the hyperbolic metric that gives a direct construction of quasi-invariant
curves without renormalization.
| math.DS math.CV | quasiinvariant curves are used in the study of hedgehog dynamics denjoyyoccoz lemma is the preliminary step for yoccozs complex renormalization techniques for the study of linearization of analytic circle diffeomorphisms we give a geometric interpretation of denjoyyoccoz lemma using the hyperbolic metric that gives a direct construction of quasiinvariant curves without renormalization | [['quasiinvariant', 'curves', 'are', 'used', 'in', 'the', 'study', 'of', 'hedgehog', 'dynamics', 'denjoyyoccoz', 'lemma', 'is', 'the', 'preliminary', 'step', 'for', 'yoccozs', 'complex', 'renormalization', 'techniques', 'for', 'the', 'study', 'of', 'linearization', 'of', 'analytic', 'circle', 'diffeomorphisms', 'we', 'give', 'a', 'geometric', 'interpretation', 'of', 'denjoyyoccoz', 'lemma', 'using', 'the', 'hyperbolic', 'metric', 'that', 'gives', 'a', 'direct', 'construction', 'of', 'quasiinvariant', 'curves', 'without', 'renormalization']] | [-0.2151420516334474, 0.0435727447969839, -0.19637579075992107, 0.10823304665507749, -0.13592273661866783, -0.09576063761487603, 0.04782801054418087, 0.3404121125489473, -0.23306932780891657, -0.19809845320880412, 0.1139255337859504, -0.22237054330296815, -0.17931482087355108, 0.27136744488030673, -0.10246856644749641, 0.07412804717198014, 0.07557026200927794, 0.03356492467224598, -0.12612052631098777, -0.18237362929154188, 0.3804459419846535, -0.01750417205505073, 0.23165054984390734, 0.06535907652461902, 0.1142507948167622, 0.07721914567053317, -0.09656042213318869, -0.03240001086145639, -0.19892715433219565, 0.14736405898816884, 0.2268349271034822, 0.08763029204681516, 0.20563151223119347, -0.3644290078803897, -0.21276660226692912, 0.09693290308117866, 0.09415698502212763, 0.10908809078857302, -0.08460796872153878, -0.3045201850309968, 0.09051394179463386, -0.09340890917927026, -0.25947742151096465, -0.16003579316660763, -0.01116760928183794, 0.005818500379100442, -0.19623789351433515, 0.08847309995442629, 0.12089643637649715, 0.15846807846799493, -0.04590355093590915, -0.04182494645938277, -0.04013321192935109, 0.1019115439755842, 0.0364637894066982, 0.04942042876034975, 0.14667915035970508, -0.03809550607576966, -0.1436874026339501, 0.38312363021075724, -0.10480436971411108, -0.249943152051419, 0.09902811802923679, -0.10373463923111557, -0.18471050216816365, 0.14050862349569798, 0.15990810485556722, 0.1495957888662815, -0.11889921857975423, 0.1477795223146677, -0.10900826787576079, 0.07822339264675975, 0.07566249362193048, -0.016120328260585667, 0.0828289444744587, 0.09648715805262327, 0.13339826814830302, 0.14999588374514133, -0.012019541370682419, -0.12240267183631659, -0.369954107478261, -0.19881010219978634, -0.12229292747098952, 0.13717475529760123, -0.15981647146574687, -0.224490803591907, 0.40261916222050786, 0.06939533535391092, 0.18405551256611943, 0.10259408821817488, 0.23522474952042102, 0.10974872114718892, 0.027709553316235543, -0.009340409403666854, 0.17536858714418485, 0.1961025732383132, -0.007336507812142372, -0.1918079789611511, -0.04097739025019109, 0.2625551285035908] |
1,802.06727 | Photonic mid-infrared nulling for exoplanet detection on a planar
chalcogenide platform | The future of exoplanet detection lies in the mid-infrared (MIR). The MIR
region contains the blackbody peak of both hot and habitable zone exoplanets,
making the contrast between starlight and planet light less extreme. It is also
the region where prominent chemical signatures indicative of life exist, such
as ozone at 9.7 microns. At a wavelength of 4 microns the difference in
emission between an Earth-like planet and a star like our own is 80 dB. However
a jovian planet, at the same separation exhibits 60 dB of contrast, or only 20
dB if it is hot due to its formation energy or being close to its host star. A
two dimensional nulling interferometer, made with chalcogenide glass, has been
measured to produce a null of 20 dB, limited by scattered light. Measures to
increase the null depth to the theoretical limit of 60 dB are discussed.
| astro-ph.IM astro-ph.GA physics.optics | the future of exoplanet detection lies in the midinfrared mir the mir region contains the blackbody peak of both hot and habitable zone exoplanets making the contrast between starlight and planet light less extreme it is also the region where prominent chemical signatures indicative of life exist such as ozone at 97 microns at a wavelength of 4 microns the difference in emission between an earthlike planet and a star like our own is 80 db however a jovian planet at the same separation exhibits 60 db of contrast or only 20 db if it is hot due to its formation energy or being close to its host star a two dimensional nulling interferometer made with chalcogenide glass has been measured to produce a null of 20 db limited by scattered light measures to increase the null depth to the theoretical limit of 60 db are discussed | [['the', 'future', 'of', 'exoplanet', 'detection', 'lies', 'in', 'the', 'midinfrared', 'mir', 'the', 'mir', 'region', 'contains', 'the', 'blackbody', 'peak', 'of', 'both', 'hot', 'and', 'habitable', 'zone', 'exoplanets', 'making', 'the', 'contrast', 'between', 'starlight', 'and', 'planet', 'light', 'less', 'extreme', 'it', 'is', 'also', 'the', 'region', 'where', 'prominent', 'chemical', 'signatures', 'indicative', 'of', 'life', 'exist', 'such', 'as', 'ozone', 'at', '97', 'microns', 'at', 'a', 'wavelength', 'of', '4', 'microns', 'the', 'difference', 'in', 'emission', 'between', 'an', 'earthlike', 'planet', 'and', 'a', 'star', 'like', 'our', 'own', 'is', '80', 'db', 'however', 'a', 'jovian', 'planet', 'at', 'the', 'same', 'separation', 'exhibits', '60', 'db', 'of', 'contrast', 'or', 'only', '20', 'db', 'if', 'it', 'is', 'hot', 'due', 'to', 'its', 'formation', 'energy', 'or', 'being', 'close', 'to', 'its', 'host', 'star', 'a', 'two', 'dimensional', 'nulling', 'interferometer', 'made', 'with', 'chalcogenide', 'glass', 'has', 'been', 'measured', 'to', 'produce', 'a', 'null', 'of', '20', 'db', 'limited', 'by', 'scattered', 'light', 'measures', 'to', 'increase', 'the', 'null', 'depth', 'to', 'the', 'theoretical', 'limit', 'of', '60', 'db', 'are', 'discussed']] | [-0.06421008728900734, 0.15392597570714817, -0.035028148604062746, 0.04898267322881971, -0.05918240495545625, -0.11236736994730878, 0.10388610289007628, 0.40550632393431096, -0.17460243484056015, -0.3481762293555147, 0.10185704554975995, -0.3380396895579436, -0.06351729847655511, 0.17003136312075873, -0.09224029223087757, 0.003003274533283092, 0.06395842159344327, -0.009914737755470738, -0.01752761559130079, -0.236433599122046, 0.22291355771582802, 0.10206334160476112, 0.1684237031898062, 0.06910939183288893, 0.0669985413076166, -0.06640748294912988, -0.022332123937291174, -0.07251441148173089, -0.1016068497914615, 0.03949024915365743, 0.2638835811189243, 0.09056421110032722, 0.2253876270054757, -0.31617546233674826, -0.2436245829318365, 0.08907998632481258, 0.12881780497818476, 0.020533903289687672, -0.014047273267599037, -0.22991630644933478, 0.09712712589428019, -0.1664594931933446, -0.1646669177674264, 0.07324246759368043, 0.06666379697544843, -0.03625302982031919, -0.2411323753296442, 0.0732315138699471, 0.0596959539174362, 0.1574546153489643, -0.07503599531118613, -0.14073441671777745, -0.08660564576212292, 0.04753492288940846, -0.026548998365432126, 0.07454449080839931, 0.18969436987702334, -0.10888157884292755, -0.028073549731539523, 0.42300987867068274, -0.1041020640444492, -0.007924322704119342, 0.2719882103791904, -0.24286113542086463, 0.0003349367009640551, 0.2196416926687444, 0.10675623194040527, 0.12074394322310884, -0.11857982436638503, -0.014532256174157848, 0.019612823825228175, 0.22385049776449722, 0.1718377756433194, 0.13648226267981287, 0.37030692782481106, 0.19780175367823238, 0.05300022113029243, 0.11685205992789571, -0.25946260072595, -0.060543113261410576, -0.1969538311074887, -0.13221884810296045, -0.16470589634461874, 0.04516590465189648, -0.10621357290678084, -0.1293659970943569, 0.3639991795390743, 0.13459532555579967, 0.17104702836479105, 0.001550988718664565, 0.3475242135286027, 0.09186239852383891, 0.111527070162349, 0.09159547508675225, 0.3648323265987696, 0.14209439330670956, 0.10940135112602492, -0.2023678721379343, 0.04736891248877965, -0.09748274208439299] |
1,802.06728 | Modulation of kinetic Alfv\'en waves in an intermediate low-beta
magnetoplasma | We study the amplitude modulation of nonlinear kinetic Alfv{\'e}n waves
(KAWs) in an intermediate low-beta magnetoplasma. Starting from a set of fluid
equations coupled to the Maxwell's equations, we derive a coupled set of
nonlinear partial differential equations (PDEs) which govern the evolution of
KAW envelopes in the plasma. The modulational instability (MI) of such KAW
envelopes is then studied by a nonlinear Schr{\"o}dinger (NLS) equation derived
from the coupled PDEs. It is shown that the KAWs can evolve into bright
envelope solitons, or can undergo damping depending on whether the
characteristic ratio $(\alpha)$ of the Alfv{\'e}n to ion-acoustic (IA) speeds
remains above or below a critical value. The parameter $\alpha$ is also found
to shift the MI domains around the $k_xk_z$ plane, where $k_x~(k_z)$ is the KAW
number perpendicular (parallel) to the external magnetic field. The growth rate
of MI, as well as the frequency shift and the energy transfer rate, are
obtained and analyzed. The results can be useful for understanding the
existence and formation of bright and dark envelope solitons, or damping of KAW
envelopes in space plasmas, e.g., interplanetary space, solar winds etc.
| physics.plasm-ph | we study the amplitude modulation of nonlinear kinetic alfven waves kaws in an intermediate lowbeta magnetoplasma starting from a set of fluid equations coupled to the maxwells equations we derive a coupled set of nonlinear partial differential equations pdes which govern the evolution of kaw envelopes in the plasma the modulational instability mi of such kaw envelopes is then studied by a nonlinear schrodinger nls equation derived from the coupled pdes it is shown that the kaws can evolve into bright envelope solitons or can undergo damping depending on whether the characteristic ratio alpha of the alfven to ionacoustic ia speeds remains above or below a critical value the parameter alpha is also found to shift the mi domains around the k_xk_z plane where k_xk_z is the kaw number perpendicular parallel to the external magnetic field the growth rate of mi as well as the frequency shift and the energy transfer rate are obtained and analyzed the results can be useful for understanding the existence and formation of bright and dark envelope solitons or damping of kaw envelopes in space plasmas eg interplanetary space solar winds etc | [['we', 'study', 'the', 'amplitude', 'modulation', 'of', 'nonlinear', 'kinetic', 'alfven', 'waves', 'kaws', 'in', 'an', 'intermediate', 'lowbeta', 'magnetoplasma', 'starting', 'from', 'a', 'set', 'of', 'fluid', 'equations', 'coupled', 'to', 'the', 'maxwells', 'equations', 'we', 'derive', 'a', 'coupled', 'set', 'of', 'nonlinear', 'partial', 'differential', 'equations', 'pdes', 'which', 'govern', 'the', 'evolution', 'of', 'kaw', 'envelopes', 'in', 'the', 'plasma', 'the', 'modulational', 'instability', 'mi', 'of', 'such', 'kaw', 'envelopes', 'is', 'then', 'studied', 'by', 'a', 'nonlinear', 'schrodinger', 'nls', 'equation', 'derived', 'from', 'the', 'coupled', 'pdes', 'it', 'is', 'shown', 'that', 'the', 'kaws', 'can', 'evolve', 'into', 'bright', 'envelope', 'solitons', 'or', 'can', 'undergo', 'damping', 'depending', 'on', 'whether', 'the', 'characteristic', 'ratio', 'alpha', 'of', 'the', 'alfven', 'to', 'ionacoustic', 'ia', 'speeds', 'remains', 'above', 'or', 'below', 'a', 'critical', 'value', 'the', 'parameter', 'alpha', 'is', 'also', 'found', 'to', 'shift', 'the', 'mi', 'domains', 'around', 'the', 'k_xk_z', 'plane', 'where', 'k_xk_z', 'is', 'the', 'kaw', 'number', 'perpendicular', 'parallel', 'to', 'the', 'external', 'magnetic', 'field', 'the', 'growth', 'rate', 'of', 'mi', 'as', 'well', 'as', 'the', 'frequency', 'shift', 'and', 'the', 'energy', 'transfer', 'rate', 'are', 'obtained', 'and', 'analyzed', 'the', 'results', 'can', 'be', 'useful', 'for', 'understanding', 'the', 'existence', 'and', 'formation', 'of', 'bright', 'and', 'dark', 'envelope', 'solitons', 'or', 'damping', 'of', 'kaw', 'envelopes', 'in', 'space', 'plasmas', 'eg', 'interplanetary', 'space', 'solar', 'winds', 'etc']] | [-0.19218965395467003, 0.2048758324444124, -0.023633911948953125, 0.0769415613993801, -0.11002222067091262, -0.07791967745366934, -0.05601954887545592, 0.3136360239464085, -0.29118297678871535, -0.24533575015595635, 0.08405631673270585, -0.24855082502991363, -0.1033837385261683, 0.2240369947375478, 0.05513614711628572, 0.02516837622718634, 0.022954293935735885, -0.008041010308708694, -0.017524524493382085, -0.165507662920533, 0.33309171193002446, 0.030478686894718054, 0.24099243019984382, -0.02422677032221612, 0.08868999686092138, -0.09814015996290018, 0.02881620097779543, -0.01414935013210099, -0.18231249190406792, 0.0036022691307841122, 0.2195511494435974, 0.05863913560563044, 0.2604157933298297, -0.4392486914388231, -0.2689819894731045, 0.03399323942894871, 0.22345201699841907, 0.11364301592803787, -0.003925956051318428, -0.2722295539831189, 0.033908589770765725, -0.11376385395415127, -0.15640319980227868, 0.01707629826473626, 0.0327066996216623, 0.11297873826728932, -0.3021589307970292, 0.1291812635428033, 0.08928820991548836, 0.012897510223745091, -0.1298051284500272, -0.06507449495744565, -0.12488086184964993, 0.009627293403940024, 0.0570575908065547, 0.03346956826721293, 0.1294298957857127, -0.15764245344829317, -0.0036517164330124047, 0.3968810765928513, -0.10726493644855313, -0.19065108043519227, 0.20027389550657088, -0.1763041910514034, -0.015569219637561488, 0.20550026330920693, 0.21613634305729254, 0.10646649749471328, -0.07425116884736092, 0.037002460697565125, 0.006793063454883727, 0.18658360126680015, 0.1375092537444387, 0.03448322838474367, 0.22527025593696415, 0.1461247258140026, 0.040758240055544556, 0.09695021184538868, -0.07249125348454391, -0.08426073190529604, -0.28663765793364193, -0.1104273125579631, -0.11238754874699422, 0.07476080342925884, -0.0674554961348091, -0.18445762443227215, 0.36505603479926246, 0.11144471785959763, 0.1390583408744754, -0.030322722853413104, 0.26789764252466125, 0.24192691686251705, -0.003815305474642161, 0.11821168439613806, 0.31111179774476067, 0.22750536036879027, 0.15847020728412914, -0.28341359015101114, 0.0032580788347970793, 0.08653947128285025] |
1,802.06729 | Analytical model of a 3D beam dynamics in a wakefield device | In this paper we suggest an analytic model, and derive simple formulas, for
the beam dynamics in a wakefield structure of arbitrary cross-section. The
results could be applied to estimate an upper limit of the projected beam size
in devices such as the dechirper and the wakefield streaking device. The
suggested formalism is also applicable to the case when slices of the beam are
distributed along an arbitrary line in 3D.
| physics.acc-ph | in this paper we suggest an analytic model and derive simple formulas for the beam dynamics in a wakefield structure of arbitrary crosssection the results could be applied to estimate an upper limit of the projected beam size in devices such as the dechirper and the wakefield streaking device the suggested formalism is also applicable to the case when slices of the beam are distributed along an arbitrary line in 3d | [['in', 'this', 'paper', 'we', 'suggest', 'an', 'analytic', 'model', 'and', 'derive', 'simple', 'formulas', 'for', 'the', 'beam', 'dynamics', 'in', 'a', 'wakefield', 'structure', 'of', 'arbitrary', 'crosssection', 'the', 'results', 'could', 'be', 'applied', 'to', 'estimate', 'an', 'upper', 'limit', 'of', 'the', 'projected', 'beam', 'size', 'in', 'devices', 'such', 'as', 'the', 'dechirper', 'and', 'the', 'wakefield', 'streaking', 'device', 'the', 'suggested', 'formalism', 'is', 'also', 'applicable', 'to', 'the', 'case', 'when', 'slices', 'of', 'the', 'beam', 'are', 'distributed', 'along', 'an', 'arbitrary', 'line', 'in', '3d']] | [-0.09702353832692327, 0.10162992206706278, -0.08185200014768142, 0.049290617954143336, -0.008763969747979246, -0.10595413965737106, -0.027355275534972235, 0.42814304219217786, -0.24349684902781646, -0.2751380012855983, 0.06089360315457616, -0.21025662743289705, -0.07852179423043452, 0.2653706465309984, -0.05181605788501157, 0.07682415185837259, 0.02465362165903699, -0.013817691211391923, -0.05131198696687188, -0.16653832359301765, 0.2773168154280554, 0.10405262086120709, 0.2834129571442453, 0.09783515357740329, 0.08372391872501499, 0.02557279144636762, 0.018114432410507555, 0.004389406352395743, -0.11816723892648875, 0.10248711810145579, 0.21843970224628567, 0.08241809371360381, 0.19650728098431627, -0.4676779536136859, -0.19759048996362047, 0.031161799436618745, 0.2083477488666458, 0.17416318625369123, -0.04874066805178431, -0.2691096819963464, 0.05921217868298056, -0.1856246765466853, -0.20381984223827268, -0.016152531380804493, 0.017319849131523932, 0.05629393581668256, -0.29805911569544574, -0.0044027300404784805, 0.05079584527091766, 0.019976176534251402, -0.07320455276726213, -0.07349861829056287, 0.027397263381944995, 0.07928471154292298, 0.011939164285521798, 0.049177981427752634, 0.13151930654290275, -0.10973932054615251, -0.09135199201778627, 0.3862381070642404, -0.033892580129298, -0.22936879392241089, 0.10437340012253066, -0.1658208330512755, -0.07405381479864599, 0.1182555777060104, 0.21997770615918955, 0.14693394264790008, -0.1346344337653136, 0.07027424397898024, -0.041934120432722946, 0.15499197946153057, 0.06797955143855701, -0.003144291826379551, 0.17684960560741977, 0.15263533215431996, 0.09535692070781344, 0.17094498790938303, -0.14053042843596827, -0.03522661599842176, -0.34033268611405937, -0.16174823797967253, -0.16765564156722434, 0.023704573446491236, -0.0823807404175709, -0.15490011060216896, 0.38662374570546015, 0.1690154699215167, 0.21083977872925536, 0.02348930107980547, 0.3392504435557295, 0.17410679889390324, 0.04169420829751122, 0.05217452076408015, 0.22297375331777083, 0.14627891597928297, 0.08486444245971425, -0.20889859806260908, 0.04076280436334266, 0.012896589436371562] |
1,802.0673 | Helicity amplitudes for QCD with massive quarks | The novel massive spinor-helicity formalism of Arkani-Hamed, Huang and Huang
provides an elegant way to calculate scattering amplitudes in quantum
chromodynamics for arbitrary quark spin projections. In this note we compute
two families of tree-level QCD amplitudes with one massive quark pair and n-2
gluons. The two cases include all gluons with identical helicity and one
opposite-helicity gluon being color-adjacent to one of the quarks. Our results
naturally incorporate the previously known amplitudes for both quark spins
quantized along one of the gluonic momenta. In the all-multiplicity formulae
presented here the spin quantization axes can be tuned at will, which includes
the case of the definite-helicity quark states.
| hep-ph hep-th | the novel massive spinorhelicity formalism of arkanihamed huang and huang provides an elegant way to calculate scattering amplitudes in quantum chromodynamics for arbitrary quark spin projections in this note we compute two families of treelevel qcd amplitudes with one massive quark pair and n2 gluons the two cases include all gluons with identical helicity and one oppositehelicity gluon being coloradjacent to one of the quarks our results naturally incorporate the previously known amplitudes for both quark spins quantized along one of the gluonic momenta in the allmultiplicity formulae presented here the spin quantization axes can be tuned at will which includes the case of the definitehelicity quark states | [['the', 'novel', 'massive', 'spinorhelicity', 'formalism', 'of', 'arkanihamed', 'huang', 'and', 'huang', 'provides', 'an', 'elegant', 'way', 'to', 'calculate', 'scattering', 'amplitudes', 'in', 'quantum', 'chromodynamics', 'for', 'arbitrary', 'quark', 'spin', 'projections', 'in', 'this', 'note', 'we', 'compute', 'two', 'families', 'of', 'treelevel', 'qcd', 'amplitudes', 'with', 'one', 'massive', 'quark', 'pair', 'and', 'n2', 'gluons', 'the', 'two', 'cases', 'include', 'all', 'gluons', 'with', 'identical', 'helicity', 'and', 'one', 'oppositehelicity', 'gluon', 'being', 'coloradjacent', 'to', 'one', 'of', 'the', 'quarks', 'our', 'results', 'naturally', 'incorporate', 'the', 'previously', 'known', 'amplitudes', 'for', 'both', 'quark', 'spins', 'quantized', 'along', 'one', 'of', 'the', 'gluonic', 'momenta', 'in', 'the', 'allmultiplicity', 'formulae', 'presented', 'here', 'the', 'spin', 'quantization', 'axes', 'can', 'be', 'tuned', 'at', 'will', 'which', 'includes', 'the', 'case', 'of', 'the', 'definitehelicity', 'quark', 'states']] | [-0.10146401308582358, 0.3095153547533901, -0.09307068626326069, 0.12507701006537866, -0.057570013356008476, -0.11132386240686448, -0.003863162323744651, 0.3273097189112549, -0.15561276630779622, -0.2353525672389089, -0.04385599030845113, -0.26993433588166843, -0.057093724744605286, 0.12613559360528048, 0.021128193831141544, 0.04390026466428952, 0.03026139914532596, 0.008930606597305258, -0.09193327648231303, -0.29357318535341687, 0.3384885698827895, -0.06170240155517844, 0.19706253239551103, 0.09939098452604464, 0.0914506773938829, 0.10116422367677584, -0.06111334206784619, -0.0909259454840208, -0.06575102463171308, 0.0759901377028689, 0.22603445699359379, 0.00943032323540944, 0.07073277989094902, -0.39538064151826613, -0.13167353128610215, 0.040730405055241274, 0.18180263751485157, 0.1881832274672013, 0.012700350208313397, -0.23543395870584855, 0.059621226578458864, -0.22842890316761047, -0.2035204367843931, -0.12371870212889505, -0.00043498915795869424, -0.10340147835799968, -0.32204265164141105, 0.035231201145095085, 0.007634244701069481, -0.05603233998079064, 0.02019669326408854, -0.21688856483208682, -0.06959289770116503, 0.06915917942291652, 0.08836345100459063, 0.09558104073084048, 0.08659070365148473, -0.17400099524134277, -0.2136612469066848, 0.35315275203902274, -0.016896776923083893, -0.2384270577217048, 0.1704517963544448, -0.1855670522968724, -0.1688985510395383, 0.09535877789669442, 0.1280694129955867, 0.13363580685987506, -0.20126821649401397, 0.12080927278224889, -0.04462404311019576, 0.09687190852237795, 0.1450112525742712, 0.09898123928820188, 0.268945945180812, 0.08368282049964622, -0.03362795077637717, 0.13351062018938256, -0.05415128230310555, -0.13618182584660937, -0.35661479774511085, -0.13061962444926223, -0.12429696080859153, 0.04110733510592496, -0.12467227814203449, -0.13234176271032752, 0.3957400953502588, 0.11714063605451781, 0.19861132795439224, 0.04145395285164375, 0.312016011444184, 0.13298858059592158, 0.08257979340412004, 0.10347249642462593, 0.2617633033824979, 0.24808450777716232, 0.11291690503468381, -0.25266556302964127, -0.08111914066116782, 0.12844016086661592] |
1,802.06731 | SN 2015as: A low luminosity Type IIb supernova without an early light
curve peak | We present results of the photometric (from 3 to 509 days past explosion) and
spectroscopic (up to 230 days past explosion) monitoring campaign of the
He-rich Type IIb supernova (SN) 2015as. The {\it (B-V)} colour evolution of SN
2015as closely resemble those of SN 2008ax, suggesting that SN 2015as belongs
to the SN IIb subgroup that does not show the early, short-duration photometric
peak. The light curve of SN 2015as reaches the $B$-band maximum about 22 days
after the explosion, at an absolute magnitude of -16.82 $\pm$ 0.18 mag. At
$\sim$ 75 days after the explosion, its spectrum transitions from that of a SN
II to a SN Ib. P~Cygni features due to He I lines appear at around 30 days
after explosion, indicating that the progenitor of SN 2015as was partially
stripped. For SN~2015as, we estimate a $^{56}$Ni mass of $\sim$ 0.08
M$_{\odot}$ and ejecta mass of 1.1--2.2 M$_{\odot}$, which are similar to the
values inferred for SN 2008ax. The quasi bolometric analytical light curve
modelling suggests that the progenitor of SN 2015as has a modest mass ($\sim$
0.1 M$_{\odot}$), a nearly-compact ($\sim$ 0.05$\times$10$^{13}$ cm) H envelope
on top of a dense, compact ($\sim$ 2$\times$10$^{11}$ cm) and a more massive
($\sim$ 1.2 M$_{\odot}$) He core. The analysis of the nebular phase spectra
indicates that $\sim$ 0.44 M$_{\odot}$ of O is ejected in the explosion. The
intensity ratio of the [Ca II]/[O I] nebular lines favours either a main
sequence progenitor mass of $\sim$ 15 M$_{\odot}$ or a Wolf Rayet star of 20
M$_{\odot}$.
| astro-ph.HE astro-ph.SR | we present results of the photometric from 3 to 509 days past explosion and spectroscopic up to 230 days past explosion monitoring campaign of the herich type iib supernova sn 2015as the it bv colour evolution of sn 2015as closely resemble those of sn 2008ax suggesting that sn 2015as belongs to the sn iib subgroup that does not show the early shortduration photometric peak the light curve of sn 2015as reaches the bband maximum about 22 days after the explosion at an absolute magnitude of 1682 pm 018 mag at sim 75 days after the explosion its spectrum transitions from that of a sn ii to a sn ib pcygni features due to he i lines appear at around 30 days after explosion indicating that the progenitor of sn 2015as was partially stripped for sn2015as we estimate a 56ni mass of sim 008 m_odot and ejecta mass of 1122 m_odot which are similar to the values inferred for sn 2008ax the quasi bolometric analytical light curve modelling suggests that the progenitor of sn 2015as has a modest mass sim 01 m_odot a nearlycompact sim 005times1013 cm h envelope on top of a dense compact sim 2times1011 cm and a more massive sim 12 m_odot he core the analysis of the nebular phase spectra indicates that sim 044 m_odot of o is ejected in the explosion the intensity ratio of the ca iio i nebular lines favours either a main sequence progenitor mass of sim 15 m_odot or a wolf rayet star of 20 m_odot | [['we', 'present', 'results', 'of', 'the', 'photometric', 'from', '3', 'to', '509', 'days', 'past', 'explosion', 'and', 'spectroscopic', 'up', 'to', '230', 'days', 'past', 'explosion', 'monitoring', 'campaign', 'of', 'the', 'herich', 'type', 'iib', 'supernova', 'sn', '2015as', 'the', 'it', 'bv', 'colour', 'evolution', 'of', 'sn', '2015as', 'closely', 'resemble', 'those', 'of', 'sn', '2008ax', 'suggesting', 'that', 'sn', '2015as', 'belongs', 'to', 'the', 'sn', 'iib', 'subgroup', 'that', 'does', 'not', 'show', 'the', 'early', 'shortduration', 'photometric', 'peak', 'the', 'light', 'curve', 'of', 'sn', '2015as', 'reaches', 'the', 'bband', 'maximum', 'about', '22', 'days', 'after', 'the', 'explosion', 'at', 'an', 'absolute', 'magnitude', 'of', '1682', 'pm', '018', 'mag', 'at', 'sim', '75', 'days', 'after', 'the', 'explosion', 'its', 'spectrum', 'transitions', 'from', 'that', 'of', 'a', 'sn', 'ii', 'to', 'a', 'sn', 'ib', 'pcygni', 'features', 'due', 'to', 'he', 'i', 'lines', 'appear', 'at', 'around', '30', 'days', 'after', 'explosion', 'indicating', 'that', 'the', 'progenitor', 'of', 'sn', '2015as', 'was', 'partially', 'stripped', 'for', 'sn2015as', 'we', 'estimate', 'a', '56ni', 'mass', 'of', 'sim', '008', 'm_odot', 'and', 'ejecta', 'mass', 'of', '1122', 'm_odot', 'which', 'are', 'similar', 'to', 'the', 'values', 'inferred', 'for', 'sn', '2008ax', 'the', 'quasi', 'bolometric', 'analytical', 'light', 'curve', 'modelling', 'suggests', 'that', 'the', 'progenitor', 'of', 'sn', '2015as', 'has', 'a', 'modest', 'mass', 'sim', '01', 'm_odot', 'a', 'nearlycompact', 'sim', '005times1013', 'cm', 'h', 'envelope', 'on', 'top', 'of', 'a', 'dense', 'compact', 'sim', '2times1011', 'cm', 'and', 'a', 'more', 'massive', 'sim', '12', 'm_odot', 'he', 'core', 'the', 'analysis', 'of', 'the', 'nebular', 'phase', 'spectra', 'indicates', 'that', 'sim', '044', 'm_odot', 'of', 'o', 'is', 'ejected', 'in', 'the', 'explosion', 'the', 'intensity', 'ratio', 'of', 'the', 'ca', 'iio', 'i', 'nebular', 'lines', 'favours', 'either', 'a', 'main', 'sequence', 'progenitor', 'mass', 'of', 'sim', '15', 'm_odot', 'or', 'a', 'wolf', 'rayet', 'star', 'of', '20', 'm_odot']] | [-0.027049726108552895, 0.0976997772559261, -0.026055782739723757, 0.08590975217938616, -0.08087145616866248, -0.13337690919912254, 0.09791395328595745, 0.43809381925846, -0.11155994433494085, -0.33149276984358333, 0.07728565362721786, -0.3396330346238328, 0.04532099748563682, 0.17749406187053013, -0.07434395345324925, -0.1173390041921632, 0.15815104549171854, -0.05567720444015862, -0.18855976286451834, -0.30564804071842494, 0.24533610239595294, 0.02631718883350254, 0.14371820591646153, -0.0415406169173163, 0.04055033001918401, -0.12892081705478586, 0.002022205262010791, -0.13090379811467165, -0.17505534055359398, -0.009824882536028248, 0.13457286983536626, 0.20325758185912948, 0.18362976903785985, -0.306112081207617, -0.22065920740935535, 0.09003643923123929, 0.21878729415505538, -0.0035248559948791603, -0.023559260098423636, -0.24707370386432553, 0.1171383192295216, -0.24262577496548796, -0.18981176855940504, 0.19796271520769743, 0.12601476197179215, -0.00024999467845249223, -0.23205680791724592, 0.18908293247575392, -0.007999695898720112, 0.1113595020998106, -0.1000517284338997, -0.11657520681313532, -0.12143462452391883, -0.061406288482434304, 0.04730123432401375, 0.10150544744623134, 0.09748314822137177, -0.08485641229927421, 0.08979979586561185, 0.44342794912251315, -0.07995315877195686, 0.19810325178907687, 0.1698535864215448, -0.16335566569026003, -0.13704633181107664, 0.2566458740479413, 0.10176499973042438, 0.1006143214445435, -0.12619974419281657, -0.06360024870795372, 0.02526981279762291, 0.24575750869457644, 0.04552007832683148, 0.0529532277138509, 0.32041473326781594, 0.13209188375547826, -0.03918713749575603, -0.028774540320843964, -0.2765923353919455, 0.03784569345629844, -0.25645097649787957, -0.10433464519776019, -0.11455242532403746, 0.24288492853549426, -0.23257849159339986, -0.08967671649664107, 0.34309663827553305, 0.06616635354925912, 0.24917859288926916, 0.012209722448040201, 0.18404688471668507, 0.06221144720568763, 0.09537213770821097, 0.1341984442071581, 0.3314272855516093, 0.22982686284217108, 0.14951331344566704, -0.22318891090047788, 0.057088652170294886, 0.04671363467285669] |
1,802.06732 | Congestion analysis of unsignalized intersections: The impact of
impatience and Markov platooning | This paper considers an unsignalized intersection used by two traffic
streams. A stream of cars is using a primary road, and has priority over the
other stream. Cars belonging to the latter stream cross the primary road if the
gaps between two subsequent cars on the primary road are larger than their
critical headways. A question that naturally arises relates to the capacity of
the secondary road: given the arrival pattern of cars on the primary road, what
is the maximum arrival rate of low-priority cars that can be sustained? This
paper addresses this issue by considering a compact model that sheds light on
the dynamics of the considered unsignalized intersection. The model, which is
of a queueing-theoretic nature, reveals interesting insights into the impact of
the user behavior on stability.
The contributions of this paper are threefold. First, we obtain new results
for the aforementioned model that includes driver impatience. Secondly, we
reveal some surprising aspects that have remained unobserved in the existing
literature so far, many of which are caused by the fact that the capacity of
the minor road cannot be expressed in terms of the \emph{mean} gap size;
instead more detailed characteristics of the critical headway distribution play
a crucial role. The third contribution is the introduction of a new form of
bunching on the main road, called Markov platooning. The tractability of this
model allows us to study the impact of various platoon formations on the main
road on the capacity of the minor road.
| math.OC math.PR physics.soc-ph | this paper considers an unsignalized intersection used by two traffic streams a stream of cars is using a primary road and has priority over the other stream cars belonging to the latter stream cross the primary road if the gaps between two subsequent cars on the primary road are larger than their critical headways a question that naturally arises relates to the capacity of the secondary road given the arrival pattern of cars on the primary road what is the maximum arrival rate of lowpriority cars that can be sustained this paper addresses this issue by considering a compact model that sheds light on the dynamics of the considered unsignalized intersection the model which is of a queueingtheoretic nature reveals interesting insights into the impact of the user behavior on stability the contributions of this paper are threefold first we obtain new results for the aforementioned model that includes driver impatience secondly we reveal some surprising aspects that have remained unobserved in the existing literature so far many of which are caused by the fact that the capacity of the minor road cannot be expressed in terms of the emphmean gap size instead more detailed characteristics of the critical headway distribution play a crucial role the third contribution is the introduction of a new form of bunching on the main road called markov platooning the tractability of this model allows us to study the impact of various platoon formations on the main road on the capacity of the minor road | [['this', 'paper', 'considers', 'an', 'unsignalized', 'intersection', 'used', 'by', 'two', 'traffic', 'streams', 'a', 'stream', 'of', 'cars', 'is', 'using', 'a', 'primary', 'road', 'and', 'has', 'priority', 'over', 'the', 'other', 'stream', 'cars', 'belonging', 'to', 'the', 'latter', 'stream', 'cross', 'the', 'primary', 'road', 'if', 'the', 'gaps', 'between', 'two', 'subsequent', 'cars', 'on', 'the', 'primary', 'road', 'are', 'larger', 'than', 'their', 'critical', 'headways', 'a', 'question', 'that', 'naturally', 'arises', 'relates', 'to', 'the', 'capacity', 'of', 'the', 'secondary', 'road', 'given', 'the', 'arrival', 'pattern', 'of', 'cars', 'on', 'the', 'primary', 'road', 'what', 'is', 'the', 'maximum', 'arrival', 'rate', 'of', 'lowpriority', 'cars', 'that', 'can', 'be', 'sustained', 'this', 'paper', 'addresses', 'this', 'issue', 'by', 'considering', 'a', 'compact', 'model', 'that', 'sheds', 'light', 'on', 'the', 'dynamics', 'of', 'the', 'considered', 'unsignalized', 'intersection', 'the', 'model', 'which', 'is', 'of', 'a', 'queueingtheoretic', 'nature', 'reveals', 'interesting', 'insights', 'into', 'the', 'impact', 'of', 'the', 'user', 'behavior', 'on', 'stability', 'the', 'contributions', 'of', 'this', 'paper', 'are', 'threefold', 'first', 'we', 'obtain', 'new', 'results', 'for', 'the', 'aforementioned', 'model', 'that', 'includes', 'driver', 'impatience', 'secondly', 'we', 'reveal', 'some', 'surprising', 'aspects', 'that', 'have', 'remained', 'unobserved', 'in', 'the', 'existing', 'literature', 'so', 'far', 'many', 'of', 'which', 'are', 'caused', 'by', 'the', 'fact', 'that', 'the', 'capacity', 'of', 'the', 'minor', 'road', 'can', 'not', 'be', 'expressed', 'in', 'terms', 'of', 'the', 'emphmean', 'gap', 'size', 'instead', 'more', 'detailed', 'characteristics', 'of', 'the', 'critical', 'headway', 'distribution', 'play', 'a', 'crucial', 'role', 'the', 'third', 'contribution', 'is', 'the', 'introduction', 'of', 'a', 'new', 'form', 'of', 'bunching', 'on', 'the', 'main', 'road', 'called', 'markov', 'platooning', 'the', 'tractability', 'of', 'this', 'model', 'allows', 'us', 'to', 'study', 'the', 'impact', 'of', 'various', 'platoon', 'formations', 'on', 'the', 'main', 'road', 'on', 'the', 'capacity', 'of', 'the', 'minor', 'road']] | [-0.17644012014732224, 0.09247558725821792, -0.08754515487967852, 0.047787992552245605, -0.07764710487326629, -0.08622658236575613, 0.07250343411335299, 0.3386559217428024, -0.27384589220289574, -0.29529123498958004, 0.09120324723848301, -0.27663011324367687, -0.16891552365303367, 0.2087275453071403, -0.11792612737749678, 0.03630562643501982, 0.06777118786750176, 0.07032406530009055, 0.020020173609338374, -0.2359570477347006, 0.3539504424652152, 0.045553866901854236, 0.2886288839566755, 0.11383824722852513, 0.05973876627956135, 0.012235018217832266, -0.046947111509206045, 9.143396802023944e-05, -0.10227160685433889, 0.15242367176954966, 0.20918725031535643, 0.1365785174427992, 0.27281123048540545, -0.428396466065688, -0.23128561053700575, 0.1026452438260217, 0.14439129166627873, 0.06190428179800065, -0.017779573130588776, -0.2699542044934657, 0.09286827857530049, -0.16444245094722842, -0.11962811923789907, 0.024156132062704144, 0.001945413879129991, 0.0441612051772065, -0.20804334045095607, 0.018145377666084653, 0.09194151815991715, 0.04480897653773724, -0.024623433748919673, -0.08938713994366952, -0.014194114905952725, 0.21221933997165693, 0.0874537270088528, 0.005704175034330126, 0.11035490347873939, -0.14071321908006096, -0.09565971774954453, 0.42075725333891306, -0.025661899628262853, -0.15959613803269498, 0.16596000922836393, -0.11388276608482716, -0.13531098719055493, 0.1259390048272685, 0.21363812030118656, 0.09186156842865947, -0.1666098078935448, 0.0005443642744738832, -0.07690884924282235, 0.13365432124715243, 0.07161083584651351, 0.010528713656288843, 0.21611676183696168, 0.2112569628047768, 0.1191341879458048, 0.13514813400950632, -0.10324025116313576, -0.12720402985054302, -0.2877519189146351, -0.1482908725181958, -0.1391255035467698, 0.025717540185115174, -0.07733043258358303, -0.11871387019003946, 0.4225109245292323, 0.179377254145962, 0.22710227302323835, 0.028514445020049156, 0.32674970892647587, 0.1074391754955866, 0.04613070465430461, 0.07090705848554987, 0.21144615869379632, 0.06124431608092648, 0.10280940536014453, -0.21047002478526808, 0.15994669872649622, 0.04134503358592877] |
1,802.06733 | Gravitational Wave Emission from Collisions of Compact Scalar Solitons | We numerically investigate the gravitational waves generated by the head-on
collision of equal-mass, self-gravitating, real scalar field solitons
(oscillatons) as a function of their compactness $\mathcal{C}$. We show that
there exist three different possible outcomes for such collisions: (1) an
excited stable oscillaton for low $\mathcal{C}$, (2) a merger and formation of
a black-hole for intermediate $\mathcal{C}$, and (3) a pre-merger collapse of
both oscillatons into individual black-holes for large $\mathcal{C}$. For (1),
the excited, aspherical oscillaton continues to emit gravitational waves. For
(2), the total energy in gravitational waves emitted increases with
compactness, and possesses a maximum which is greater than that from the merger
of a pair of equivalent mass black-holes. The initial amplitudes of the
quasi-normal modes in the post-merger ring-down in this case are larger than
that of corresponding mass black-holes -- potentially a key observable to
distinguish black-hole mergers with their scalar mimics. For (3), the
gravitational wave output is indistinguishable from a similar mass,
black-hole--black-hole merger.
| gr-qc astro-ph.CO hep-ph hep-th | we numerically investigate the gravitational waves generated by the headon collision of equalmass selfgravitating real scalar field solitons oscillatons as a function of their compactness mathcalc we show that there exist three different possible outcomes for such collisions 1 an excited stable oscillaton for low mathcalc 2 a merger and formation of a blackhole for intermediate mathcalc and 3 a premerger collapse of both oscillatons into individual blackholes for large mathcalc for 1 the excited aspherical oscillaton continues to emit gravitational waves for 2 the total energy in gravitational waves emitted increases with compactness and possesses a maximum which is greater than that from the merger of a pair of equivalent mass blackholes the initial amplitudes of the quasinormal modes in the postmerger ringdown in this case are larger than that of corresponding mass blackholes potentially a key observable to distinguish blackhole mergers with their scalar mimics for 3 the gravitational wave output is indistinguishable from a similar mass blackholeblackhole merger | [['we', 'numerically', 'investigate', 'the', 'gravitational', 'waves', 'generated', 'by', 'the', 'headon', 'collision', 'of', 'equalmass', 'selfgravitating', 'real', 'scalar', 'field', 'solitons', 'oscillatons', 'as', 'a', 'function', 'of', 'their', 'compactness', 'mathcalc', 'we', 'show', 'that', 'there', 'exist', 'three', 'different', 'possible', 'outcomes', 'for', 'such', 'collisions', '1', 'an', 'excited', 'stable', 'oscillaton', 'for', 'low', 'mathcalc', '2', 'a', 'merger', 'and', 'formation', 'of', 'a', 'blackhole', 'for', 'intermediate', 'mathcalc', 'and', '3', 'a', 'premerger', 'collapse', 'of', 'both', 'oscillatons', 'into', 'individual', 'blackholes', 'for', 'large', 'mathcalc', 'for', '1', 'the', 'excited', 'aspherical', 'oscillaton', 'continues', 'to', 'emit', 'gravitational', 'waves', 'for', '2', 'the', 'total', 'energy', 'in', 'gravitational', 'waves', 'emitted', 'increases', 'with', 'compactness', 'and', 'possesses', 'a', 'maximum', 'which', 'is', 'greater', 'than', 'that', 'from', 'the', 'merger', 'of', 'a', 'pair', 'of', 'equivalent', 'mass', 'blackholes', 'the', 'initial', 'amplitudes', 'of', 'the', 'quasinormal', 'modes', 'in', 'the', 'postmerger', 'ringdown', 'in', 'this', 'case', 'are', 'larger', 'than', 'that', 'of', 'corresponding', 'mass', 'blackholes', 'potentially', 'a', 'key', 'observable', 'to', 'distinguish', 'blackhole', 'mergers', 'with', 'their', 'scalar', 'mimics', 'for', '3', 'the', 'gravitational', 'wave', 'output', 'is', 'indistinguishable', 'from', 'a', 'similar', 'mass', 'blackholeblackhole', 'merger']] | [-0.17891920414631782, 0.21693143621096111, -0.06095382700506482, 0.1563992990722796, -0.04358136435241803, -0.08209778155310091, -0.06347203447038065, 0.3224614731944311, -0.15668707124032774, -0.25989994058755705, 0.047598140996082554, -0.28360676694869624, -0.050231999520975984, 0.19944532316102884, 0.04265274378465292, 0.0089771847894288, 0.095038249562292, 0.052681116959924654, -0.08954565251869387, -0.1810929781094957, 0.405939390639896, 0.022300456731539707, 0.14401500845640341, -0.026228725216033297, 0.10252858948552553, -0.004161049622712622, 0.004718069481715467, -0.023601232515937237, -0.14845188864956355, 0.027357780304628928, 0.23624737694807443, 0.1754449100135276, 0.23151580143984918, -0.3748554325899722, -0.1939556678838056, 0.13711288550533124, 0.18520067529738388, 0.15341327356258466, -0.09683564871619021, -0.2618451087738486, 0.127460512235726, -0.25268201767293424, -0.1462424687537949, 0.04450382508615159, 0.12216816174794821, 0.036863244410534825, -0.2507365578727693, 0.1190318950041203, 0.05694154156617797, -0.05979191281641862, -0.11058696496780522, -0.04760867552773923, -0.10734144879956238, 0.06020132405972629, 0.08045175083282387, 0.06835680217511073, 0.1546225334425104, -0.13628645667803374, -0.07944965662526167, 0.39252262223390455, -0.07592451324348731, -0.14618644939723963, 0.22393601904160443, -0.19936935682433965, -0.09518496685691022, 0.20453755189057277, 0.18448603787222265, 0.1669417121679007, -0.06454576126754252, -0.010827839929322706, 0.0162680609418717, 0.18215313084388834, 0.1793901375263513, 0.045934448286931474, 0.3545025535136091, 0.1446436337102783, 0.005958558939489889, 0.12637373232369467, -0.0687697916333231, -0.022247223531674038, -0.29608192503660546, -0.11598097132403196, -0.16320969710294272, 0.13510982201733665, -0.1417772701608996, -0.15064038720086032, 0.3493639523545222, 0.08707834328221076, 0.1675304286818234, 0.078164773619002, 0.2602311708264469, 0.09575924441227053, 0.033552522418199116, 0.109378806008778, 0.3472396770480627, 0.16389689576285688, 0.04906137475038167, -0.22194788199003426, -0.03265556055902046, 0.0055370002707339225] |
1,802.06734 | Spin-orbit coupling effects in zinc-blende InSb and wurtzite InAs
nanowires: Realistic calculations with multiband $\vec{k} \cdot \vec{p}$
method | A systematic numerical investigation of spin-orbit fields in the conduction
bands of III-V semiconductor nanowires is performed. Zinc-blende InSb nanowires
are considered along [001], [011], and [111] directions, while wurtzite InAs
nanowires are studied along [0001] and [10$\overline{1}$0] or
[11$\overline{2}$0] directions. Realistic multiband $\vec{k} \cdot \vec{p}\,$
Hamiltonians are solved by using plane-wave expansions of real-space
parameters. In all cases the linear and cubic spin-orbit coupling parameters
are extracted for nanowire widths from 30 to 100 nm. Typical spin-orbit
energies are on the $\mu$eV scale, except for InAs wurtzite nanowires grown
along [10$\overline{1}$0] or [11$\overline{2}$0], in which the spin-orbit
energy is about meV, largely independent of the wire diameter. Significant
spin-orbit coupling is obtained by applying a transverse electric field,
causing the Rashba effect. For an electric field of about 4 mV/nm the obtained
spin-orbit energies are about 1 meV for both materials in all investigated
growth directions. The most favorable system, in which the spin-orbit effects
are maximal, are InAs WZ nanowires grown along [1010] or [11$\overline{2}$0],
since here spin-orbit energies are giant (meV) already in the absence of
electric field. The least favorable are InAs WZ nanowires grown along [0001],
since here even the electric field does not increase the spin-orbit energies
beyond 0.1 meV. The presented results should be useful for investigations of
optical orientation, spin transport, weak localization, and superconducting
proximity effects in semiconductor nanowires.
| cond-mat.mes-hall | a systematic numerical investigation of spinorbit fields in the conduction bands of iiiv semiconductor nanowires is performed zincblende insb nanowires are considered along 001 011 and 111 directions while wurtzite inas nanowires are studied along 0001 and 10overline10 or 11overline20 directions realistic multiband veck cdot vecp hamiltonians are solved by using planewave expansions of realspace parameters in all cases the linear and cubic spinorbit coupling parameters are extracted for nanowire widths from 30 to 100 nm typical spinorbit energies are on the muev scale except for inas wurtzite nanowires grown along 10overline10 or 11overline20 in which the spinorbit energy is about mev largely independent of the wire diameter significant spinorbit coupling is obtained by applying a transverse electric field causing the rashba effect for an electric field of about 4 mvnm the obtained spinorbit energies are about 1 mev for both materials in all investigated growth directions the most favorable system in which the spinorbit effects are maximal are inas wz nanowires grown along 1010 or 11overline20 since here spinorbit energies are giant mev already in the absence of electric field the least favorable are inas wz nanowires grown along 0001 since here even the electric field does not increase the spinorbit energies beyond 01 mev the presented results should be useful for investigations of optical orientation spin transport weak localization and superconducting proximity effects in semiconductor nanowires | [['a', 'systematic', 'numerical', 'investigation', 'of', 'spinorbit', 'fields', 'in', 'the', 'conduction', 'bands', 'of', 'iiiv', 'semiconductor', 'nanowires', 'is', 'performed', 'zincblende', 'insb', 'nanowires', 'are', 'considered', 'along', '001', '011', 'and', '111', 'directions', 'while', 'wurtzite', 'inas', 'nanowires', 'are', 'studied', 'along', '0001', 'and', '10overline10', 'or', '11overline20', 'directions', 'realistic', 'multiband', 'veck', 'cdot', 'vecp', 'hamiltonians', 'are', 'solved', 'by', 'using', 'planewave', 'expansions', 'of', 'realspace', 'parameters', 'in', 'all', 'cases', 'the', 'linear', 'and', 'cubic', 'spinorbit', 'coupling', 'parameters', 'are', 'extracted', 'for', 'nanowire', 'widths', 'from', '30', 'to', '100', 'nm', 'typical', 'spinorbit', 'energies', 'are', 'on', 'the', 'muev', 'scale', 'except', 'for', 'inas', 'wurtzite', 'nanowires', 'grown', 'along', '10overline10', 'or', '11overline20', 'in', 'which', 'the', 'spinorbit', 'energy', 'is', 'about', 'mev', 'largely', 'independent', 'of', 'the', 'wire', 'diameter', 'significant', 'spinorbit', 'coupling', 'is', 'obtained', 'by', 'applying', 'a', 'transverse', 'electric', 'field', 'causing', 'the', 'rashba', 'effect', 'for', 'an', 'electric', 'field', 'of', 'about', '4', 'mvnm', 'the', 'obtained', 'spinorbit', 'energies', 'are', 'about', '1', 'mev', 'for', 'both', 'materials', 'in', 'all', 'investigated', 'growth', 'directions', 'the', 'most', 'favorable', 'system', 'in', 'which', 'the', 'spinorbit', 'effects', 'are', 'maximal', 'are', 'inas', 'wz', 'nanowires', 'grown', 'along', '1010', 'or', '11overline20', 'since', 'here', 'spinorbit', 'energies', 'are', 'giant', 'mev', 'already', 'in', 'the', 'absence', 'of', 'electric', 'field', 'the', 'least', 'favorable', 'are', 'inas', 'wz', 'nanowires', 'grown', 'along', '0001', 'since', 'here', 'even', 'the', 'electric', 'field', 'does', 'not', 'increase', 'the', 'spinorbit', 'energies', 'beyond', '01', 'mev', 'the', 'presented', 'results', 'should', 'be', 'useful', 'for', 'investigations', 'of', 'optical', 'orientation', 'spin', 'transport', 'weak', 'localization', 'and', 'superconducting', 'proximity', 'effects', 'in', 'semiconductor', 'nanowires']] | [-0.21570848995868705, 0.22501956614194155, 0.06698478947663189, 0.02342341399676036, -0.017749082456647188, -0.19174159681853398, 0.0036514701235941366, 0.49605986728994667, -0.19415857849219864, -0.3513731348385479, -0.015904889116778544, -0.3035277046524642, -0.009368922111063608, 0.2420447870533456, 0.08805251009190422, 0.03247203551163374, 0.03482829202620084, -0.11278429685932535, -0.12958951740578764, -0.21800709489667625, 0.23239748584200515, 0.01825278022391885, 0.29427584271475654, 0.1169232005465841, 0.00047930399478788964, 0.0033019805028871225, 0.15994527720511287, -0.0139602324735885, -0.1749475698305009, 0.04745007634254873, 0.22072605644209767, -0.20426064735351757, 0.19279934125421405, -0.4671781811242302, -0.1738090897019822, -0.041439327057001686, 0.1750819214268408, 0.15158810431603342, -0.07357269330583349, -0.2995524872441596, 0.09482738429084604, -0.08639231638223639, -0.10472319975164474, -0.009793380604701508, -0.00908568134866328, -0.0050698629031039515, -0.22724046693142635, 0.09634843257893073, 0.012315780476599588, 0.10124495515207711, -0.08193811831848793, -0.2099290774505087, -0.10767402113701233, -0.005824920185228908, 0.07776998600533452, 0.08583555357498035, 0.21120092843602037, -0.06714827381891378, -0.124242625918174, 0.388101541755819, -0.055408866731899285, -0.1215529471693005, 0.0790254988139822, -0.1814490441588293, -0.04445562197667498, 0.17025931573497424, 0.13983092566565591, 0.10521535788613715, -0.16146595702861974, 0.14001903992673187, 0.05885327856358664, 0.1517687672422382, 0.08676751683825594, 0.112073558300995, 0.2574080754022457, 0.1539846857409238, -0.0015049551010107326, 0.03358148899911739, -0.15220418573957623, -0.022561062564419813, -0.2095399908318078, -0.14677259604969436, -0.23154771149162562, 0.11633973044406862, -0.10148841150926034, -0.15850517891853916, 0.3863367230892835, 0.10440931455518135, 0.13491630161450685, -0.05140339923520131, 0.2280026202114593, 0.07854175497062929, 0.10933239035524853, 0.023290789691249335, 0.3317367128317863, 0.22820755110730892, 0.06434698819832288, -0.23836755324481873, 0.05509491637349129, -0.07559337447450512] |
1,802.06735 | When are permutation invariants Cohen-Macaulay over all fields? | We prove that the polynomial invariants of a permutation group are
Cohen-Macaulay for any choice of coefficient field if and only if the group is
generated by transpositions, double transpositions, and 3-cycles. This unites
and generalizes several previously known results. The "if" direction of the
argument uses Stanley-Reisner theory and a recent result of Christian Lange in
orbifold theory. The "only-if" direction uses a local-global result based on a
theorem of Raynaud to reduce the problem to an analysis of inertia groups, and
a combinatorial argument to identify inertia groups that obstruct
Cohen-Macaulayness.
| math.AC math.CO | we prove that the polynomial invariants of a permutation group are cohenmacaulay for any choice of coefficient field if and only if the group is generated by transpositions double transpositions and 3cycles this unites and generalizes several previously known results the if direction of the argument uses stanleyreisner theory and a recent result of christian lange in orbifold theory the onlyif direction uses a localglobal result based on a theorem of raynaud to reduce the problem to an analysis of inertia groups and a combinatorial argument to identify inertia groups that obstruct cohenmacaulayness | [['we', 'prove', 'that', 'the', 'polynomial', 'invariants', 'of', 'a', 'permutation', 'group', 'are', 'cohenmacaulay', 'for', 'any', 'choice', 'of', 'coefficient', 'field', 'if', 'and', 'only', 'if', 'the', 'group', 'is', 'generated', 'by', 'transpositions', 'double', 'transpositions', 'and', '3cycles', 'this', 'unites', 'and', 'generalizes', 'several', 'previously', 'known', 'results', 'the', 'if', 'direction', 'of', 'the', 'argument', 'uses', 'stanleyreisner', 'theory', 'and', 'a', 'recent', 'result', 'of', 'christian', 'lange', 'in', 'orbifold', 'theory', 'the', 'onlyif', 'direction', 'uses', 'a', 'localglobal', 'result', 'based', 'on', 'a', 'theorem', 'of', 'raynaud', 'to', 'reduce', 'the', 'problem', 'to', 'an', 'analysis', 'of', 'inertia', 'groups', 'and', 'a', 'combinatorial', 'argument', 'to', 'identify', 'inertia', 'groups', 'that', 'obstruct', 'cohenmacaulayness']] | [-0.16496300869899858, 0.06986978723337718, -0.14364497572864576, 0.040159370650046614, -0.13007932963470617, -0.1387119711757267, 0.029310165731717023, 0.28660249778179714, -0.3302542316046373, -0.261749295823236, 0.10239235383848991, -0.22387410898602778, -0.18346568374263664, 0.21413302790343522, -0.16703412619729838, -0.051026052034269735, 0.05002297010392912, 0.06287981243303387, -0.04535977185510727, -0.29758908377299387, 0.34038520647933884, -0.001397442353028123, 0.24012618103334982, 0.0786673595067314, 0.11442837809082321, 0.05029783707352415, -0.051958266926068135, 0.023983595522260794, -0.13501186665195736, 0.12160011040051819, 0.23452430572961608, 0.10656171751468974, 0.22148551579604867, -0.3858783210437464, -0.13280369570073222, 0.1550675944427669, 0.10439286008977922, 0.07287536730228733, -0.020132136790292156, -0.26077974803986087, 0.15780043152351214, -0.1680024210213413, -0.16632336552344984, -0.04611347136037645, 0.04950843870224211, 0.019537690926783827, -0.2639452777101949, 0.02744372365295246, 0.13685927887056623, 0.09138668503772507, -0.003738554149505592, -0.09898838355776764, -0.026870011382045283, 0.07893738511609294, 0.07144918669045212, 0.04204565218539648, 0.10969106619176204, -0.06936710921456657, -0.2017399872783371, 0.3569697128703958, -0.014551079839528087, -0.201111867102564, 0.10992249282908136, -0.13021219288429586, -0.22553033169899736, 0.09204272280937882, 0.04987587395840154, 0.19352695115551513, -0.021801062979765477, 0.12557990519237275, -0.1729048158897097, 0.11656706738135507, 0.11702282622116067, -0.04276373698025621, 0.09503776878268728, 0.057808384121525835, 0.1143459824855209, 0.1153947371784197, 0.00877384875740816, -0.00575289451667378, -0.3138946538130122, -0.18948686413306703, -0.174287206172863, 0.09236959406169712, -0.11347259033733594, -0.1481607618619017, 0.39353148563094037, 0.10316965857680926, 0.1425235193443074, 0.11562720311665407, 0.23942394821994728, 0.028823580622913375, 0.06473815442133014, 0.06531076789683392, 0.14533892378050794, 0.2605145087751049, -0.023664291963101394, -0.15479559333173817, 0.03594988238151556, 0.2446136173682027] |
1,802.06736 | Maurer-Cartan elements and homotopical perturbation theory | Let L be a (pro-nilpotent) curved L-infinity algebra, and let h be a homotopy
between L and a subcomplex M. Using homotopical perturbation theory, Fukaya
constructed from this data a curved L-infinity structure on M. We prove that
projection from L to M induces a bijection between the set of Maurer-Cartan
elements x of L such that hx=0 and the set of Maurer-Cartan elements of M.
| math.KT math.SG | let l be a pronilpotent curved linfinity algebra and let h be a homotopy between l and a subcomplex m using homotopical perturbation theory fukaya constructed from this data a curved linfinity structure on m we prove that projection from l to m induces a bijection between the set of maurercartan elements x of l such that hx0 and the set of maurercartan elements of m | [['let', 'l', 'be', 'a', 'pronilpotent', 'curved', 'linfinity', 'algebra', 'and', 'let', 'h', 'be', 'a', 'homotopy', 'between', 'l', 'and', 'a', 'subcomplex', 'm', 'using', 'homotopical', 'perturbation', 'theory', 'fukaya', 'constructed', 'from', 'this', 'data', 'a', 'curved', 'linfinity', 'structure', 'on', 'm', 'we', 'prove', 'that', 'projection', 'from', 'l', 'to', 'm', 'induces', 'a', 'bijection', 'between', 'the', 'set', 'of', 'maurercartan', 'elements', 'x', 'of', 'l', 'such', 'that', 'hx0', 'and', 'the', 'set', 'of', 'maurercartan', 'elements', 'of', 'm']] | [-0.1986157750978953, 0.09653517194656712, -0.0899875801705727, 0.00030199880535347444, -0.130596285375456, -0.14095305379790565, 0.012948026744804034, 0.3340121325895642, -0.40736247266106534, -0.25771216365198296, 0.008599141506816853, -0.2394019580925956, -0.13762859942278627, 0.12047380722607627, -0.13584428323630357, -0.10966187221647213, 0.08148061683062803, 0.0842630191720232, -0.12576224084125098, -0.15516054514216993, 0.40888718352653086, -0.04461464947653991, 0.14523593901007684, -0.06596051506472356, 0.1499886480036587, -0.028184631546592398, -0.021984122065601474, 0.03997679362708533, -0.1890621122661149, 0.16286837820415245, 0.30997779345577303, 0.06932698693620323, 0.17338910110816924, -0.35770606845052855, -0.09347643711688844, 0.16315955651754682, 0.11931469223716042, -0.07327593563505533, 0.010154574504474911, -0.3232762636899045, 0.1445170540757703, -0.15011288400626543, -0.11396314907875477, -0.035042670386081394, 0.181426722993792, -0.011611525519666347, -0.29315908370049193, -0.08774058689066971, 0.10304626249567125, 0.11659702182761535, -0.007177471225573258, -0.12288689767857167, -0.17333074395939935, 0.051132168867766406, -0.0922568192049353, 0.13151375570503826, 0.11885849212183419, 0.03697887874758718, -0.062051811050905875, 0.3797162387124968, -0.13203509995770274, -0.23682468709056126, 0.0962735120009518, -0.17996587087823587, -0.11403525334246682, 0.11824935348704457, 0.0590920007477204, 0.16883060008738981, -0.02530866215811605, 0.31041550792658446, -0.1453863172580234, 0.07613955302671953, 0.12384600070954273, -0.015437682173355963, 0.15667062002290605, 0.10420190460740053, 0.11089096864628972, 0.05320520015348765, 0.013695313761038988, 0.04719213220629503, -0.4157663124867461, -0.17585230172809327, -0.1263736123748293, 0.259921225422824, -0.1392622649042151, -0.17336520259127472, 0.276930627695313, 0.04900770335260666, 0.2455409086083598, 0.10213506206249197, 0.14862937175414778, -0.006961779121686986, 0.05857020997526971, 0.06497718582889347, 0.020022904941332385, 0.3205001252054265, -0.02032919808742449, -0.15684354804177542, -0.09878139131504929, 0.29153393163825525] |
1,802.06737 | Measurement of optical constants of TiN and TiN/Ti/TiN multilayer films
for microwave kinetic inductance photon-number-resolving detectors | We deposit thin titanium-nitride (TiN) and TiN/Ti/TiN multilayer films on
sapphire substrates and measure the reflectance and transmittance in the
wavelength range from 400 nm to 2000 nm using a spectrophotometer. The optical
constants (complex refractive indices), including the refractive index n and
the extinction coefficient k, have been derived. With the extracted refractive
indices, we propose an optical stack structure using low-loss amorphous Si
(a-Si) anti-reflective coating and a backside aluminum (Al) reflecting mirror,
which can in theory achieve 100% photon absorption at 1550 nm. The proposed
optical design shows great promise in enhancing the optical efficiency of
TiN-based microwave kinetic inductance photon-number-resolving detectors.
| physics.optics physics.app-ph | we deposit thin titaniumnitride tin and tintitin multilayer films on sapphire substrates and measure the reflectance and transmittance in the wavelength range from 400 nm to 2000 nm using a spectrophotometer the optical constants complex refractive indices including the refractive index n and the extinction coefficient k have been derived with the extracted refractive indices we propose an optical stack structure using lowloss amorphous si asi antireflective coating and a backside aluminum al reflecting mirror which can in theory achieve 100 photon absorption at 1550 nm the proposed optical design shows great promise in enhancing the optical efficiency of tinbased microwave kinetic inductance photonnumberresolving detectors | [['we', 'deposit', 'thin', 'titaniumnitride', 'tin', 'and', 'tintitin', 'multilayer', 'films', 'on', 'sapphire', 'substrates', 'and', 'measure', 'the', 'reflectance', 'and', 'transmittance', 'in', 'the', 'wavelength', 'range', 'from', '400', 'nm', 'to', '2000', 'nm', 'using', 'a', 'spectrophotometer', 'the', 'optical', 'constants', 'complex', 'refractive', 'indices', 'including', 'the', 'refractive', 'index', 'n', 'and', 'the', 'extinction', 'coefficient', 'k', 'have', 'been', 'derived', 'with', 'the', 'extracted', 'refractive', 'indices', 'we', 'propose', 'an', 'optical', 'stack', 'structure', 'using', 'lowloss', 'amorphous', 'si', 'asi', 'antireflective', 'coating', 'and', 'a', 'backside', 'aluminum', 'al', 'reflecting', 'mirror', 'which', 'can', 'in', 'theory', 'achieve', '100', 'photon', 'absorption', 'at', '1550', 'nm', 'the', 'proposed', 'optical', 'design', 'shows', 'great', 'promise', 'in', 'enhancing', 'the', 'optical', 'efficiency', 'of', 'tinbased', 'microwave', 'kinetic', 'inductance', 'photonnumberresolving', 'detectors']] | [-0.04346125146728896, 0.1573784954636635, -0.023006132728464548, -0.1223410381625096, -0.008038094559950488, -0.17990315292651454, 0.012530348178309699, 0.5661502801059257, -0.20096972169842395, -0.36903183909931353, 0.02692225913827618, -0.33842324727170525, -0.09112594151603325, 0.22219860003706776, -0.041782258054064145, 0.09356363418046384, -0.06240508734425973, -0.16490409623033234, -0.0012932717201433012, -0.14485724383543822, 0.1791749875005778, 0.10302820072420651, 0.40541252774142084, 0.09902581816893957, 0.10062868687146831, 0.0022927977937451075, 0.04513344581105879, -0.04199600978809897, -0.1614571949710981, 0.11527715975507384, 0.27042828591185664, -0.08122518825167346, 0.15198169513605536, -0.40897000329125494, -0.2535856270630445, 0.0041533369687385855, 0.06642166314912694, 0.013821847491808946, -0.061828926894148546, -0.2340382031342458, 0.06677350988168092, -0.10672379864069323, -0.11629387101468941, 0.02616177358265434, -0.0007101036297778289, -0.00706240948112238, -0.2448177015819099, -0.034683975698204625, -0.027108919963661937, 0.10065032004883202, -0.05533524487566735, -0.14282701924814664, -0.07636983976034181, 0.011942940085594144, -0.10570913780303229, -0.0637635303328612, 0.23865747540036128, -0.07553555551650269, -0.043770169688477405, 0.3225054351346833, -0.1264030700145841, -0.009597762221736568, 0.10869354506111925, -0.1404867753475195, 0.07733586128978502, 0.22859900109913378, 0.15406905634084805, 0.11381668328595836, -0.09699651449974182, 0.056874572332128, 0.023831215376655262, 0.33072142489254475, 0.22882486919517672, 0.13627866129834382, 0.1823915090323204, 0.2044844246025951, -0.04430213363264643, 0.13020359938853376, -0.2092221622399631, 0.10236608890450692, -0.18114999849349261, -0.196050968340465, -0.17109489895270338, 0.11127770885913854, -0.1970521241319754, -0.17558772500848308, 0.36899703934433914, 0.12410658507031344, 0.13181584590070305, -0.028119867846059302, 0.2892963046828906, 0.07831560786636103, 0.09115066961163566, -0.017100215029148828, 0.3581223523332959, 0.18834292207445416, 0.1983788580213773, -0.18299503772342135, 0.022026832510406772, -0.007301773592120125] |
1,802.06738 | Exploration of Reduced Scaling Formulation of Equation of Motion
Coupled-Cluster Singles and Doubles Based on State-Averaged Pair Natural
Orbitals | A reduced-complexity variant of equation-of-motion coupled-cluster singles
and doubles (EOM-CCSD) method is formulated in terms of state-averaged excited
state pair natural orbitals (PNO) designed to describe manifolds of excited
states. State-averaged excited state PNOs for the {\em target} manifold are
determined by averaging CIS(D) pair densities over the computational manifold.
To assess the performance of PNO-EOM-CCSD approach on extended systems the new
massively parallel canonical EOM-CCSD program has been developed in the
Massively Parallel Quantum Chemistry program that allows treatment of systems
with 50+ atoms using realistic basis sets with 1000+ functions. The use of
state-averaged PNOs offers several potential advantages relative to the
recently proposed state-specific PNOs: our approach is robust with respect to
root flipping and state degeneracies, it is more economical when computing
large manifolds of states, and it simplifies evaluation of transition-specific
observables such as dipole moments. With the PNO truncation threshold of
$10^{-7}$, the errors in excitation energies are on average below 0.02 eV for
the first six singlet states of 28 organic molecules included in the standard
test set of Thiel and co-workers (J. Chem. Phys. 2008, 128, 134110) with 50-70
state-averaged PNOs per pair.
| physics.chem-ph | a reducedcomplexity variant of equationofmotion coupledcluster singles and doubles eomccsd method is formulated in terms of stateaveraged excited state pair natural orbitals pno designed to describe manifolds of excited states stateaveraged excited state pnos for the em target manifold are determined by averaging cisd pair densities over the computational manifold to assess the performance of pnoeomccsd approach on extended systems the new massively parallel canonical eomccsd program has been developed in the massively parallel quantum chemistry program that allows treatment of systems with 50 atoms using realistic basis sets with 1000 functions the use of stateaveraged pnos offers several potential advantages relative to the recently proposed statespecific pnos our approach is robust with respect to root flipping and state degeneracies it is more economical when computing large manifolds of states and it simplifies evaluation of transitionspecific observables such as dipole moments with the pno truncation threshold of 107 the errors in excitation energies are on average below 002 ev for the first six singlet states of 28 organic molecules included in the standard test set of thiel and coworkers j chem phys 2008 128 134110 with 5070 stateaveraged pnos per pair | [['a', 'reducedcomplexity', 'variant', 'of', 'equationofmotion', 'coupledcluster', 'singles', 'and', 'doubles', 'eomccsd', 'method', 'is', 'formulated', 'in', 'terms', 'of', 'stateaveraged', 'excited', 'state', 'pair', 'natural', 'orbitals', 'pno', 'designed', 'to', 'describe', 'manifolds', 'of', 'excited', 'states', 'stateaveraged', 'excited', 'state', 'pnos', 'for', 'the', 'em', 'target', 'manifold', 'are', 'determined', 'by', 'averaging', 'cisd', 'pair', 'densities', 'over', 'the', 'computational', 'manifold', 'to', 'assess', 'the', 'performance', 'of', 'pnoeomccsd', 'approach', 'on', 'extended', 'systems', 'the', 'new', 'massively', 'parallel', 'canonical', 'eomccsd', 'program', 'has', 'been', 'developed', 'in', 'the', 'massively', 'parallel', 'quantum', 'chemistry', 'program', 'that', 'allows', 'treatment', 'of', 'systems', 'with', '50', 'atoms', 'using', 'realistic', 'basis', 'sets', 'with', '1000', 'functions', 'the', 'use', 'of', 'stateaveraged', 'pnos', 'offers', 'several', 'potential', 'advantages', 'relative', 'to', 'the', 'recently', 'proposed', 'statespecific', 'pnos', 'our', 'approach', 'is', 'robust', 'with', 'respect', 'to', 'root', 'flipping', 'and', 'state', 'degeneracies', 'it', 'is', 'more', 'economical', 'when', 'computing', 'large', 'manifolds', 'of', 'states', 'and', 'it', 'simplifies', 'evaluation', 'of', 'transitionspecific', 'observables', 'such', 'as', 'dipole', 'moments', 'with', 'the', 'pno', 'truncation', 'threshold', 'of', '107', 'the', 'errors', 'in', 'excitation', 'energies', 'are', 'on', 'average', 'below', '002', 'ev', 'for', 'the', 'first', 'six', 'singlet', 'states', 'of', '28', 'organic', 'molecules', 'included', 'in', 'the', 'standard', 'test', 'set', 'of', 'thiel', 'and', 'coworkers', 'j', 'chem', 'phys', '2008', '128', '134110', 'with', '5070', 'stateaveraged', 'pnos', 'per', 'pair']] | [-0.08934550752777508, 0.1008082893235903, -0.026615620375071702, 0.04483100728095068, 0.008077178767416626, -0.12976096073214552, 0.057843088725042575, 0.34578590336941967, -0.16578045031545977, -0.35400933374460836, -0.014141583653460991, -0.2787771588792614, -0.05617656269582528, 0.17238264557121225, -0.011778634279280116, 0.06505684944384388, 0.09676079014683829, -0.010602419889581046, -0.07711766574311217, -0.25134649313251045, 0.25407582460657546, 0.09459150458232647, 0.27848408464296404, 0.029630952369495245, 0.0909056932481594, 0.023281302419491112, 0.031515069425988355, -0.03188935016821089, -0.07610694675504898, 0.13509006646100286, 0.2505536959249232, 0.10062739194346297, 0.2701307245775273, -0.3965870940985808, -0.1357120868063679, 0.04196193883269045, 0.09895551693319392, 0.12449977857820493, 0.012638513179799223, -0.3150781125393941, 0.04388538642754276, -0.21670479803272572, -0.12345953798656793, -0.1542502541977324, 0.03925120722177732, 0.010203118844104834, -0.264093392521241, 0.08333778403895466, -0.03550710877948165, 0.049994993248439736, -0.0479445920868066, -0.20921879915618583, -0.040988735864429096, 0.016342271006157573, -0.03382795441184977, 0.09129623997417327, 0.13964649892326347, -0.04066147926955876, -0.15104792453348637, 0.3851349399425089, -0.06543178889949462, -0.1876033251104864, 0.17282754266144415, -0.082267351904547, -0.12446234954557822, 0.1757357589018188, 0.1205655359295442, 0.15963788818273889, -0.12938815504228268, 0.09866880454049495, 0.009822643401199265, 0.1561735297700292, 0.06387806660128072, 0.04245012623601054, 0.13120168654958864, 0.1285579560287787, 0.03463291731742701, 0.10588970245597394, -0.12147458133679864, -0.17578481550475483, -0.2348101645462999, -0.16207901979735317, -0.18233653193486757, 0.030912611427055182, -0.0209454974818264, -0.14231120047257526, 0.39101950159590493, 0.09799160522678377, 0.13344624790019896, 0.01760186896120247, 0.2513005070633402, 0.0814939007231212, 0.06040134000542917, 0.08572243780746296, 0.22822739704953213, 0.19420797435481002, 0.018620790910637498, -0.23601217004960698, -0.013393239929389797, 0.059978290485512266] |
1,802.06739 | Differentially Private Generative Adversarial Network | Generative Adversarial Network (GAN) and its variants have recently attracted
intensive research interests due to their elegant theoretical foundation and
excellent empirical performance as generative models. These tools provide a
promising direction in the studies where data availability is limited. One
common issue in GANs is that the density of the learned generative distribution
could concentrate on the training data points, meaning that they can easily
remember training samples due to the high model complexity of deep networks.
This becomes a major concern when GANs are applied to private or sensitive data
such as patient medical records, and the concentration of distribution may
divulge critical patient information. To address this issue, in this paper we
propose a differentially private GAN (DPGAN) model, in which we achieve
differential privacy in GANs by adding carefully designed noise to gradients
during the learning procedure. We provide rigorous proof for the privacy
guarantee, as well as comprehensive empirical evidence to support our analysis,
where we demonstrate that our method can generate high quality data points at a
reasonable privacy level.
| cs.LG cs.CR stat.ML | generative adversarial network gan and its variants have recently attracted intensive research interests due to their elegant theoretical foundation and excellent empirical performance as generative models these tools provide a promising direction in the studies where data availability is limited one common issue in gans is that the density of the learned generative distribution could concentrate on the training data points meaning that they can easily remember training samples due to the high model complexity of deep networks this becomes a major concern when gans are applied to private or sensitive data such as patient medical records and the concentration of distribution may divulge critical patient information to address this issue in this paper we propose a differentially private gan dpgan model in which we achieve differential privacy in gans by adding carefully designed noise to gradients during the learning procedure we provide rigorous proof for the privacy guarantee as well as comprehensive empirical evidence to support our analysis where we demonstrate that our method can generate high quality data points at a reasonable privacy level | [['generative', 'adversarial', 'network', 'gan', 'and', 'its', 'variants', 'have', 'recently', 'attracted', 'intensive', 'research', 'interests', 'due', 'to', 'their', 'elegant', 'theoretical', 'foundation', 'and', 'excellent', 'empirical', 'performance', 'as', 'generative', 'models', 'these', 'tools', 'provide', 'a', 'promising', 'direction', 'in', 'the', 'studies', 'where', 'data', 'availability', 'is', 'limited', 'one', 'common', 'issue', 'in', 'gans', 'is', 'that', 'the', 'density', 'of', 'the', 'learned', 'generative', 'distribution', 'could', 'concentrate', 'on', 'the', 'training', 'data', 'points', 'meaning', 'that', 'they', 'can', 'easily', 'remember', 'training', 'samples', 'due', 'to', 'the', 'high', 'model', 'complexity', 'of', 'deep', 'networks', 'this', 'becomes', 'a', 'major', 'concern', 'when', 'gans', 'are', 'applied', 'to', 'private', 'or', 'sensitive', 'data', 'such', 'as', 'patient', 'medical', 'records', 'and', 'the', 'concentration', 'of', 'distribution', 'may', 'divulge', 'critical', 'patient', 'information', 'to', 'address', 'this', 'issue', 'in', 'this', 'paper', 'we', 'propose', 'a', 'differentially', 'private', 'gan', 'dpgan', 'model', 'in', 'which', 'we', 'achieve', 'differential', 'privacy', 'in', 'gans', 'by', 'adding', 'carefully', 'designed', 'noise', 'to', 'gradients', 'during', 'the', 'learning', 'procedure', 'we', 'provide', 'rigorous', 'proof', 'for', 'the', 'privacy', 'guarantee', 'as', 'well', 'as', 'comprehensive', 'empirical', 'evidence', 'to', 'support', 'our', 'analysis', 'where', 'we', 'demonstrate', 'that', 'our', 'method', 'can', 'generate', 'high', 'quality', 'data', 'points', 'at', 'a', 'reasonable', 'privacy', 'level']] | [-0.029484238937253725, -0.010395699275250081, -0.08213633039056069, 0.13541216305119716, -0.11807454424508085, -0.16933902736954307, 0.0880248313181007, 0.43599925514056603, -0.26331757877381856, -0.3559132442830808, 0.09065052704152715, -0.2900864483407614, -0.16797018125362229, 0.16594303953024792, -0.19751757875730452, 0.12952236694631705, 0.10527908040206636, 0.01616346863242639, -0.009541949875690327, -0.30567167442429555, 0.29569656086096074, 0.07939590757599614, 0.39495951727969275, 0.044595739357067614, 0.08596899603038434, -0.04751624172521671, 0.002466202660633082, -0.004994965209003898, -0.08390651594258584, 0.1791743237038397, 0.3427010840343469, 0.21004366942691954, 0.39780317787715996, -0.4599852343936535, -0.2330079114696921, 0.09979218090037731, 0.15069670366938226, 0.13061713166627503, -0.12246212819842515, -0.30251727023542946, 0.10662742338238539, -0.14083387692914007, -0.04027216728586196, -0.1806101207885976, -0.05361596834435742, -0.0034859948768412737, -0.301224854494318, 0.035501559656536716, 0.0584210138615824, 0.08950240636477247, -0.01867185890031661, -0.10587357311636549, -0.02057193107082805, 0.14718438661210795, 0.08751819783356041, 0.058261960136488516, 0.1125532467267476, -0.14842346941606427, -0.1092733683868904, 0.32778156928675756, -0.038038574675738346, -0.18980970642488418, 0.1634009133254453, -0.06127891997245818, -0.1668707457720302, 0.07582649107048796, 0.26421454128913785, 0.09196494524605275, -0.17861096147589706, 0.01957208024429168, -0.01625866733957082, 0.14289489086315205, 0.0006209731324237179, 0.04462010971904171, 0.19010016061392063, 0.21369976926441517, 0.03679210785677159, 0.1350414205252574, -0.1018403142926135, -0.07997420938177542, -0.22265921404786324, -0.11180097572452558, -0.19672637612199073, 0.03857587124498836, -0.06364865367149006, -0.14592665654146747, 0.377230609444351, 0.23482795520381347, 0.22996177925431932, 0.05528107950720534, 0.36968418017072097, 0.04032309043660379, 0.09659709461398465, 0.08808680987832221, 0.20523825922546993, 0.041758053929449736, 0.1451225282005246, -0.11814304623773998, 0.1684861300851811, -0.039697805820403366] |
1,802.0674 | Complexity Growth with Lifshitz Scaling and Hyperscaling Violation | Using complexity=action proposal we study the growth rate of holographic
complexity for Lifshitz and hyperscaling violating geometries. We will consider
both one and two sided black branes in an Einstein-Maxwell-Dilaton
gravitational theory. We find that in either case Lloyd's bound is violated and
the rate of growth of complexity saturates to a value which is greater than
twice the mass of the corresponding black brane. This value reduces to the mass
of the black brane in the isotropic case. We show that in two sided black brane
the saturation happens from above while for one sided black brane it happens
from below.
| hep-th gr-qc quant-ph | using complexityaction proposal we study the growth rate of holographic complexity for lifshitz and hyperscaling violating geometries we will consider both one and two sided black branes in an einsteinmaxwelldilaton gravitational theory we find that in either case lloyds bound is violated and the rate of growth of complexity saturates to a value which is greater than twice the mass of the corresponding black brane this value reduces to the mass of the black brane in the isotropic case we show that in two sided black brane the saturation happens from above while for one sided black brane it happens from below | [['using', 'complexityaction', 'proposal', 'we', 'study', 'the', 'growth', 'rate', 'of', 'holographic', 'complexity', 'for', 'lifshitz', 'and', 'hyperscaling', 'violating', 'geometries', 'we', 'will', 'consider', 'both', 'one', 'and', 'two', 'sided', 'black', 'branes', 'in', 'an', 'einsteinmaxwelldilaton', 'gravitational', 'theory', 'we', 'find', 'that', 'in', 'either', 'case', 'lloyds', 'bound', 'is', 'violated', 'and', 'the', 'rate', 'of', 'growth', 'of', 'complexity', 'saturates', 'to', 'a', 'value', 'which', 'is', 'greater', 'than', 'twice', 'the', 'mass', 'of', 'the', 'corresponding', 'black', 'brane', 'this', 'value', 'reduces', 'to', 'the', 'mass', 'of', 'the', 'black', 'brane', 'in', 'the', 'isotropic', 'case', 'we', 'show', 'that', 'in', 'two', 'sided', 'black', 'brane', 'the', 'saturation', 'happens', 'from', 'above', 'while', 'for', 'one', 'sided', 'black', 'brane', 'it', 'happens', 'from', 'below']] | [-0.1190580666823057, 0.12697009429094203, -0.028661016310912137, 0.12133992956974086, -0.0634919983270925, -0.20067770575063631, 0.027009622357082645, 0.2619848539778853, -0.15565665134493553, -0.25483723556367205, 0.10345329358881596, -0.3418081277506609, -0.09250611411955427, 0.20669630893013058, -0.06808028267879113, 0.0310733328532318, -0.08093027113571617, 0.06898561315428392, -0.11169020218464236, -0.2760209516535385, 0.3919197286652657, 0.0554580508603477, 0.29241675248953936, 0.029427449045447158, 0.06973239658263457, -0.02044599664890591, 0.07757649205478967, 0.07151369525430103, -0.21615053147294983, 0.05458076639721791, 0.1642388447858941, 0.1301069853955186, 0.17574993188620783, -0.4210817852587092, -0.17802950825688302, 0.12038716042012561, 0.1710423441128988, 0.1758504860461507, -0.07711842052602008, -0.1983191591696631, 0.09379455652864029, -0.18464184722717047, -0.1593590131139054, 0.04712410875043704, 0.03541546953869436, -0.11210699494204521, -0.24549404864528163, 0.1489333894067243, 0.053897924150577654, -0.089971441040546, -0.08991641238504135, -0.05263720500492947, -0.06907986855481331, 0.050896129958952464, 0.1655006216982763, 0.015246267003628114, 0.16525828122964822, -0.16688448982998072, -0.1329431371904873, 0.3227227005340597, -0.09130754611097099, -0.1806242524591439, 0.1757611105328097, -0.2578998937810242, -0.08630103854389459, 0.07669982164824272, 0.12627204016362334, 0.1968846947283429, -0.09349730779763822, 0.15564688241997204, -0.0005100320513341941, 0.19928464251479097, 0.15880821632477, 0.03409690989236183, 0.28578063876678544, 0.15272376052327638, 0.1024035300977309, 0.2186694893365105, -0.049516041831606454, -0.11235101880761338, -0.3464407450976033, -0.18319603519379526, -0.16110322696120277, 0.12067853105163165, -0.18583043578823266, -0.13422455182116405, 0.2989508412577504, 0.11171180679115887, 0.20914391194488488, 0.061501477875828964, 0.21546518724119545, 0.10149219058632084, 0.03459341522744473, 0.10966284502315901, 0.34952641583467814, 0.06666642849963597, 0.11474840490229647, -0.24257368174856345, -0.06954560039437138, 0.12949189453330986] |
1,802.06741 | Static properties and current-induced dynamics of pinned $90$ degree
magnetic domain walls under applied fields: an analytic approach | Magnetic domain walls are pinned strongly by abrupt changes in magnetic
anisotropy. When driven into oscillation by a spin-polarized current, locally
pinned domain walls can be exploited as tunable sources of short-wavelength
spin waves. Here, we develop an analytical framework and discrete Heisenberg
model to describe the static and dynamic properties of pinned domain walls with
a head-to-tail magnetic structure. We focus on magnetic domain walls that are
pinned by 90$^\circ$ rotations of uniaxial magnetic anisotropy. Our model
captures the domain wall response to a spin-transfer torque that is exerted by
an electric current. Model predictions of the domain wall resonance frequency
and its evolution with magnetic anisotropy strength and external magnetic field
are compared to micromagnetic simulations.
| cond-mat.mes-hall cond-mat.other | magnetic domain walls are pinned strongly by abrupt changes in magnetic anisotropy when driven into oscillation by a spinpolarized current locally pinned domain walls can be exploited as tunable sources of shortwavelength spin waves here we develop an analytical framework and discrete heisenberg model to describe the static and dynamic properties of pinned domain walls with a headtotail magnetic structure we focus on magnetic domain walls that are pinned by 90circ rotations of uniaxial magnetic anisotropy our model captures the domain wall response to a spintransfer torque that is exerted by an electric current model predictions of the domain wall resonance frequency and its evolution with magnetic anisotropy strength and external magnetic field are compared to micromagnetic simulations | [['magnetic', 'domain', 'walls', 'are', 'pinned', 'strongly', 'by', 'abrupt', 'changes', 'in', 'magnetic', 'anisotropy', 'when', 'driven', 'into', 'oscillation', 'by', 'a', 'spinpolarized', 'current', 'locally', 'pinned', 'domain', 'walls', 'can', 'be', 'exploited', 'as', 'tunable', 'sources', 'of', 'shortwavelength', 'spin', 'waves', 'here', 'we', 'develop', 'an', 'analytical', 'framework', 'and', 'discrete', 'heisenberg', 'model', 'to', 'describe', 'the', 'static', 'and', 'dynamic', 'properties', 'of', 'pinned', 'domain', 'walls', 'with', 'a', 'headtotail', 'magnetic', 'structure', 'we', 'focus', 'on', 'magnetic', 'domain', 'walls', 'that', 'are', 'pinned', 'by', '90circ', 'rotations', 'of', 'uniaxial', 'magnetic', 'anisotropy', 'our', 'model', 'captures', 'the', 'domain', 'wall', 'response', 'to', 'a', 'spintransfer', 'torque', 'that', 'is', 'exerted', 'by', 'an', 'electric', 'current', 'model', 'predictions', 'of', 'the', 'domain', 'wall', 'resonance', 'frequency', 'and', 'its', 'evolution', 'with', 'magnetic', 'anisotropy', 'strength', 'and', 'external', 'magnetic', 'field', 'are', 'compared', 'to', 'micromagnetic', 'simulations']] | [-0.21106275699843288, 0.23826149686351142, -0.01183797188608323, -0.006306754303819863, -0.17115437345168852, -0.07631959468205222, 0.005815248085990927, 0.4813188486180063, -0.3217237436259955, -0.300067737643307, 0.05423336149039441, -0.22023743561516373, -0.0849380457568598, 0.18342444896737461, 0.06958586110149399, -0.029770195382051327, -0.027256156854584056, -0.02933107983021034, 0.005681403261467309, -0.10107828983129397, 0.26289127280509444, -0.03482635110869246, 0.3522129450683971, 0.0721070659568857, 0.016284136261427933, -0.020366803478544294, 0.11976792375651836, 0.0996441713581651, -0.16241236082813407, 0.040722727753437556, 0.16415962981754692, -0.1234457058224322, 0.1838102094864599, -0.5608786351631506, -0.2163684366767145, 0.004478226309263353, 0.16924231974368567, 0.154641815875578, -0.047376352661265594, -0.35831807335933386, 0.05733073821243972, -0.11745657737493136, -0.15531503417829085, -0.12379437795311402, 0.005134833152840009, 0.05832915180520612, -0.2825959091162569, 0.14385296905144923, 0.12275121671195, 0.10527332526458016, -0.16595161254655855, -0.028984715226816678, -0.07099592515812019, 0.05761875246549854, 0.08870695073106247, 0.1522801227165165, 0.2485847876375636, -0.15947536807665127, -0.15792305658618777, 0.3090528862203582, -0.05583617684305093, -0.24583331725986327, 0.145486853389322, -0.20556492315037017, 0.01969112758524716, 0.12894665894011761, 0.16397315390029196, 0.08456984878975456, -0.14312668756586283, 0.09012358500306511, 0.034483314886436627, 0.18382646984191833, 0.05145632107229114, -0.05107236256175753, 0.30917269432664674, 0.2105196793662321, 0.05757791998054264, 0.1959608686225631, -0.1418491848547138, -0.054592000855275005, -0.2402075681740702, -0.04291513788719046, -0.23071989973896515, 0.020581874451836794, -0.0861276380704929, -0.19237014419997064, 0.39808155583233523, 0.16507199108284915, 0.1314924069743414, -0.07069032531926188, 0.3119046607496754, 0.06840297101673244, 0.04028446455012565, 0.0751588820771835, 0.24143142609904378, 0.18625450032857893, 0.14273355184201847, -0.2992480176429943, 0.023798756222477405, -0.025320931724509447] |
1,802.06742 | Distributed Recoloring | Given two colorings of a graph, we consider the following problem: can we
recolor the graph from one coloring to the other through a series of elementary
changes, such that the graph is properly colored after each step?
We introduce the notion of distributed recoloring: The input graph represents
a network of computers that needs to be recolored. Initially, each node is
aware of its own input color and target color. The nodes can exchange messages
with each other, and eventually each node has to stop and output its own
recoloring schedule, indicating when and how the node changes its color. The
recoloring schedules have to be globally consistent so that the graph remains
properly colored at each point, and we require that adjacent nodes do not
change their colors simultaneously.
We are interested in the following questions: How many communication rounds
are needed (in the LOCAL model of distributed computing) to find a recoloring
schedule? What is the length of the recoloring schedule? And how does the
picture change if we can use extra colors to make recoloring easier?
The main contributions of this work are related to distributed recoloring
with one extra color in the following graph classes: trees, $3$-regular graphs,
and toroidal grids.
| cs.DC cs.DS | given two colorings of a graph we consider the following problem can we recolor the graph from one coloring to the other through a series of elementary changes such that the graph is properly colored after each step we introduce the notion of distributed recoloring the input graph represents a network of computers that needs to be recolored initially each node is aware of its own input color and target color the nodes can exchange messages with each other and eventually each node has to stop and output its own recoloring schedule indicating when and how the node changes its color the recoloring schedules have to be globally consistent so that the graph remains properly colored at each point and we require that adjacent nodes do not change their colors simultaneously we are interested in the following questions how many communication rounds are needed in the local model of distributed computing to find a recoloring schedule what is the length of the recoloring schedule and how does the picture change if we can use extra colors to make recoloring easier the main contributions of this work are related to distributed recoloring with one extra color in the following graph classes trees 3regular graphs and toroidal grids | [['given', 'two', 'colorings', 'of', 'a', 'graph', 'we', 'consider', 'the', 'following', 'problem', 'can', 'we', 'recolor', 'the', 'graph', 'from', 'one', 'coloring', 'to', 'the', 'other', 'through', 'a', 'series', 'of', 'elementary', 'changes', 'such', 'that', 'the', 'graph', 'is', 'properly', 'colored', 'after', 'each', 'step', 'we', 'introduce', 'the', 'notion', 'of', 'distributed', 'recoloring', 'the', 'input', 'graph', 'represents', 'a', 'network', 'of', 'computers', 'that', 'needs', 'to', 'be', 'recolored', 'initially', 'each', 'node', 'is', 'aware', 'of', 'its', 'own', 'input', 'color', 'and', 'target', 'color', 'the', 'nodes', 'can', 'exchange', 'messages', 'with', 'each', 'other', 'and', 'eventually', 'each', 'node', 'has', 'to', 'stop', 'and', 'output', 'its', 'own', 'recoloring', 'schedule', 'indicating', 'when', 'and', 'how', 'the', 'node', 'changes', 'its', 'color', 'the', 'recoloring', 'schedules', 'have', 'to', 'be', 'globally', 'consistent', 'so', 'that', 'the', 'graph', 'remains', 'properly', 'colored', 'at', 'each', 'point', 'and', 'we', 'require', 'that', 'adjacent', 'nodes', 'do', 'not', 'change', 'their', 'colors', 'simultaneously', 'we', 'are', 'interested', 'in', 'the', 'following', 'questions', 'how', 'many', 'communication', 'rounds', 'are', 'needed', 'in', 'the', 'local', 'model', 'of', 'distributed', 'computing', 'to', 'find', 'a', 'recoloring', 'schedule', 'what', 'is', 'the', 'length', 'of', 'the', 'recoloring', 'schedule', 'and', 'how', 'does', 'the', 'picture', 'change', 'if', 'we', 'can', 'use', 'extra', 'colors', 'to', 'make', 'recoloring', 'easier', 'the', 'main', 'contributions', 'of', 'this', 'work', 'are', 'related', 'to', 'distributed', 'recoloring', 'with', 'one', 'extra', 'color', 'in', 'the', 'following', 'graph', 'classes', 'trees', '3regular', 'graphs', 'and', 'toroidal', 'grids']] | [-0.12538356392969857, 0.14875123881649008, -0.0844985981883246, 0.0348234145294025, -0.13119275383741677, -0.19847320137066243, 0.08741867001557234, 0.45354606571055733, -0.327567356875962, -0.3286433242836705, 0.08762267866291702, -0.29725434150980806, -0.14077272847011116, 0.06434095929347394, -0.16239687747737955, 0.016108803580191837, 0.09908049801382625, 0.11284223874325602, 0.03725212033458271, -0.3086997283330454, 0.29600652065116784, 0.0011249834816288021, 0.2049382140586442, 0.03496146115680108, 0.060853096927760295, 0.04990043798551976, -0.04814846151354678, 0.04677939595308751, -0.0824269548944905, 0.08577311595624089, 0.24965959303171456, 0.18983680402263275, 0.28036906718484406, -0.44396363154451535, -0.16496746849666521, 0.18917582715291856, 0.1510558627948201, 0.11721370287705213, 0.019892470536468712, -0.18737526029434273, 0.14693886744597637, -0.12075882009456604, -0.06243063849555238, 0.005257299177527193, 0.04104955685415387, 0.03816352749256942, -0.2553131111396829, -0.05378877884681219, 0.0612338317662152, -0.026600387867413533, 0.028444771623822127, -0.09560028540458783, -0.060614753623031876, 0.20650632504231942, -0.01081516447666924, 0.06829991830214496, 0.13463466889134526, -0.12578941013062717, -0.15704444702262582, 0.3887832652160319, 0.007950679627382785, -0.18182014572791286, 0.15106255244079397, -0.08138677579219661, -0.1855828599129505, 0.07743726113954677, 0.14733624100138082, 0.1017058948463211, -0.13782065592061116, 0.03963605206243884, -0.046661232408244636, 0.15829941750579238, 0.06312372856230918, 0.04135771770283435, 0.18935804189526412, 0.12995191490689056, 0.1360998784180039, 0.15292556123532247, -0.03329609463189715, -0.054663657784367034, -0.28393337548794045, -0.11522389849019463, -0.21720510001127039, -0.013401236440418447, -0.13816863855916964, -0.16370257381259382, 0.46128884945697723, 0.19219610859748446, 0.2149520043478103, 0.0686415217486798, 0.32321302788965045, 0.0833340219676368, 0.0950112008745104, 0.16731100925357414, 0.13627883033302512, 0.0650375630978938, 0.06720526568089766, -0.1882086198526046, 0.09342282118944867, 0.06733341041773792] |
1,802.06743 | Spectral/hp element methods: recent developments, applications, and
perspectives | The spectral/hp element method combines the geometric flexibility of the
classical h-type finite element technique with the desirable numerical
properties of spectral methods, employing high-degree piecewise polynomial
basis functions on coarse finite element-type meshes. The spatial approximation
is based upon orthogonal polynomials, such as Legendre or Chebychev
polynomials, modified to accommodate C0-continuous expansions. Computationally
and theoretically, by increasing the polynomial order p, high-precision
solutions and fast convergence can be obtained and, in particular, under
certain regularity assumptions an exponential reduction in approximation error
between numerical and exact solutions can be achieved. This method has now been
applied in many simulation studies of both fundamental and practical
engineering flows. This paper briefly describes the formulation of the
spectral/hp element method and provides an overview of its application to
computational fluid dynamics. In particular, it focuses on the use the
spectral/hp element method in transitional flows and ocean engineering.
Finally, some of the major challenges to be overcome in order to use the
spectral/hp element method in more complex science and engineering applications
are discussed.
| physics.flu-dyn physics.comp-ph | the spectralhp element method combines the geometric flexibility of the classical htype finite element technique with the desirable numerical properties of spectral methods employing highdegree piecewise polynomial basis functions on coarse finite elementtype meshes the spatial approximation is based upon orthogonal polynomials such as legendre or chebychev polynomials modified to accommodate c0continuous expansions computationally and theoretically by increasing the polynomial order p highprecision solutions and fast convergence can be obtained and in particular under certain regularity assumptions an exponential reduction in approximation error between numerical and exact solutions can be achieved this method has now been applied in many simulation studies of both fundamental and practical engineering flows this paper briefly describes the formulation of the spectralhp element method and provides an overview of its application to computational fluid dynamics in particular it focuses on the use the spectralhp element method in transitional flows and ocean engineering finally some of the major challenges to be overcome in order to use the spectralhp element method in more complex science and engineering applications are discussed | [['the', 'spectralhp', 'element', 'method', 'combines', 'the', 'geometric', 'flexibility', 'of', 'the', 'classical', 'htype', 'finite', 'element', 'technique', 'with', 'the', 'desirable', 'numerical', 'properties', 'of', 'spectral', 'methods', 'employing', 'highdegree', 'piecewise', 'polynomial', 'basis', 'functions', 'on', 'coarse', 'finite', 'elementtype', 'meshes', 'the', 'spatial', 'approximation', 'is', 'based', 'upon', 'orthogonal', 'polynomials', 'such', 'as', 'legendre', 'or', 'chebychev', 'polynomials', 'modified', 'to', 'accommodate', 'c0continuous', 'expansions', 'computationally', 'and', 'theoretically', 'by', 'increasing', 'the', 'polynomial', 'order', 'p', 'highprecision', 'solutions', 'and', 'fast', 'convergence', 'can', 'be', 'obtained', 'and', 'in', 'particular', 'under', 'certain', 'regularity', 'assumptions', 'an', 'exponential', 'reduction', 'in', 'approximation', 'error', 'between', 'numerical', 'and', 'exact', 'solutions', 'can', 'be', 'achieved', 'this', 'method', 'has', 'now', 'been', 'applied', 'in', 'many', 'simulation', 'studies', 'of', 'both', 'fundamental', 'and', 'practical', 'engineering', 'flows', 'this', 'paper', 'briefly', 'describes', 'the', 'formulation', 'of', 'the', 'spectralhp', 'element', 'method', 'and', 'provides', 'an', 'overview', 'of', 'its', 'application', 'to', 'computational', 'fluid', 'dynamics', 'in', 'particular', 'it', 'focuses', 'on', 'the', 'use', 'the', 'spectralhp', 'element', 'method', 'in', 'transitional', 'flows', 'and', 'ocean', 'engineering', 'finally', 'some', 'of', 'the', 'major', 'challenges', 'to', 'be', 'overcome', 'in', 'order', 'to', 'use', 'the', 'spectralhp', 'element', 'method', 'in', 'more', 'complex', 'science', 'and', 'engineering', 'applications', 'are', 'discussed']] | [-0.08819693829420136, 0.04001331026413521, -0.11144058694901494, 0.0365284120770322, -0.08527639194935388, -0.11816502268011601, -0.015704573026449134, 0.3833713133555616, -0.316159341656576, -0.2605462290314322, 0.14758141721717238, -0.21111558422963053, -0.18162101503149364, 0.23526237705706302, -0.0788340884936446, 0.12963782546495362, 0.07134769434873768, -0.0290958300243654, -0.11577777708900791, -0.2389708243961839, 0.2691679542421261, 0.043066385562795434, 0.29628637164018273, 0.0444727070899438, 0.10191297023745545, -0.038282275845894234, -0.06272584746855532, 0.018661071133875218, -0.1399028053812715, 0.1554892359333748, 0.2864680433635078, 0.10919508018808148, 0.30419456236592, -0.44118302126517356, -0.21364569007230633, 0.0905903408107364, 0.1779511781016397, 0.09805807688763377, -0.06395507059936517, -0.2291069540001366, 0.09354375290031332, -0.16759298157183766, -0.18218339681948367, -0.1464661662170739, -0.03230085165234487, 0.08012970500878688, -0.27302431183829473, 0.037593447038031726, 0.042145140033021486, 0.10299478766018513, -0.014005434999479293, -0.13641276814156572, 0.046419987274667604, 0.06991738221618869, 0.023849257500842214, -0.003763078720001988, 0.0524728073818593, -0.07937099961725445, -0.0921023313260255, 0.4109296183602486, -0.043479368136724664, -0.27903011567201574, 0.1930099354486245, -0.0902070249969172, -0.14197868692306426, 0.11623230404112854, 0.17821619422457616, 0.14643337923731936, -0.10901933382574813, 0.13081990552237097, 0.010014720296088842, 0.12937354923608158, 0.0746396367621172, -0.003895522632253911, 0.09660823974688403, 0.16654766786229835, 0.08241537009262227, 0.11084629098731336, -0.024964491711563373, -0.12422793980881658, -0.283456848175238, -0.15459163142623908, -0.19138103911405527, -0.01906947760352854, -0.13764456649798082, -0.18275435114914626, 0.3899638924123235, 0.15228847812725274, 0.085990817942845, 0.0008294357597892512, 0.319414962459937, 0.14418342801529613, 0.018768261684740037, 0.06393882655214775, 0.18647883220180744, 0.17431268192197846, 0.08979187533259392, -0.21973723839333206, 0.061915618137354196, 0.15694297002924532] |
1,802.06744 | Thermal stability of metastable magnetic skyrmions: Entropic narrowing
and significance of internal eigenmodes | We compute annihilation rates of metastable magnetic skyrmions using a form
of Langer's theory in the intermediate-to-high damping (IHD) regime. For a
N\'eel skyrmion, a Bloch skyrmion, and an antiskyrmion, we look at two possible
paths to annihilation: collapse and escape through a boundary. We also study
the effects of a curved vs. a flat boundary, a second skyrmion and a
non-magnetic defect. We find that the skyrmion's internal modes play a dominant
role in the thermally activated transitions compared to the spin-wave
excitations and that the relative contribution of internal modes depends on the
nature of the transition process. Our calculations for a small skyrmion
stabilized at zero-field show that collapse on a defect is the most probable
path. In the absence of a defect, the annihilation is largely dominated by
escape mechanisms, even though in this case the activation energy is higher
than that of collapse processes. Escape through a flat boundary is found more
probable than through a curved boundary. The potential source of stability of
metastable skyrmions is therefore found not to lie in high activation energies,
nor in the dynamics at the transition state, but comes from entropic narrowing
in the saddle point region which leads to lowered attempt frequencies. This
narrowing effect is found to be primarily associated with the skyrmion's
internal modes.
| cond-mat.mes-hall cond-mat.stat-mech | we compute annihilation rates of metastable magnetic skyrmions using a form of langers theory in the intermediatetohigh damping ihd regime for a neel skyrmion a bloch skyrmion and an antiskyrmion we look at two possible paths to annihilation collapse and escape through a boundary we also study the effects of a curved vs a flat boundary a second skyrmion and a nonmagnetic defect we find that the skyrmions internal modes play a dominant role in the thermally activated transitions compared to the spinwave excitations and that the relative contribution of internal modes depends on the nature of the transition process our calculations for a small skyrmion stabilized at zerofield show that collapse on a defect is the most probable path in the absence of a defect the annihilation is largely dominated by escape mechanisms even though in this case the activation energy is higher than that of collapse processes escape through a flat boundary is found more probable than through a curved boundary the potential source of stability of metastable skyrmions is therefore found not to lie in high activation energies nor in the dynamics at the transition state but comes from entropic narrowing in the saddle point region which leads to lowered attempt frequencies this narrowing effect is found to be primarily associated with the skyrmions internal modes | [['we', 'compute', 'annihilation', 'rates', 'of', 'metastable', 'magnetic', 'skyrmions', 'using', 'a', 'form', 'of', 'langers', 'theory', 'in', 'the', 'intermediatetohigh', 'damping', 'ihd', 'regime', 'for', 'a', 'neel', 'skyrmion', 'a', 'bloch', 'skyrmion', 'and', 'an', 'antiskyrmion', 'we', 'look', 'at', 'two', 'possible', 'paths', 'to', 'annihilation', 'collapse', 'and', 'escape', 'through', 'a', 'boundary', 'we', 'also', 'study', 'the', 'effects', 'of', 'a', 'curved', 'vs', 'a', 'flat', 'boundary', 'a', 'second', 'skyrmion', 'and', 'a', 'nonmagnetic', 'defect', 'we', 'find', 'that', 'the', 'skyrmions', 'internal', 'modes', 'play', 'a', 'dominant', 'role', 'in', 'the', 'thermally', 'activated', 'transitions', 'compared', 'to', 'the', 'spinwave', 'excitations', 'and', 'that', 'the', 'relative', 'contribution', 'of', 'internal', 'modes', 'depends', 'on', 'the', 'nature', 'of', 'the', 'transition', 'process', 'our', 'calculations', 'for', 'a', 'small', 'skyrmion', 'stabilized', 'at', 'zerofield', 'show', 'that', 'collapse', 'on', 'a', 'defect', 'is', 'the', 'most', 'probable', 'path', 'in', 'the', 'absence', 'of', 'a', 'defect', 'the', 'annihilation', 'is', 'largely', 'dominated', 'by', 'escape', 'mechanisms', 'even', 'though', 'in', 'this', 'case', 'the', 'activation', 'energy', 'is', 'higher', 'than', 'that', 'of', 'collapse', 'processes', 'escape', 'through', 'a', 'flat', 'boundary', 'is', 'found', 'more', 'probable', 'than', 'through', 'a', 'curved', 'boundary', 'the', 'potential', 'source', 'of', 'stability', 'of', 'metastable', 'skyrmions', 'is', 'therefore', 'found', 'not', 'to', 'lie', 'in', 'high', 'activation', 'energies', 'nor', 'in', 'the', 'dynamics', 'at', 'the', 'transition', 'state', 'but', 'comes', 'from', 'entropic', 'narrowing', 'in', 'the', 'saddle', 'point', 'region', 'which', 'leads', 'to', 'lowered', 'attempt', 'frequencies', 'this', 'narrowing', 'effect', 'is', 'found', 'to', 'be', 'primarily', 'associated', 'with', 'the', 'skyrmions', 'internal', 'modes']] | [-0.15343319058798882, 0.21953960638085315, -0.09283171484000198, 0.08066575990097719, -0.07232750081308356, -0.0872893673537903, 0.09422215241295621, 0.3535066242733775, -0.2400721827756877, -0.24545238325776336, 0.054652095340419836, -0.2673645182704068, -0.09812742947456193, 0.1573170701570205, 0.03514484885628718, -0.04901008689978062, 0.017062446660655615, 0.05206967058238578, -0.034177880790818176, -0.1613599321463137, 0.31873642907058103, 0.046189386104169776, 0.2855284706493797, 0.08065908161825479, 0.05297952549914525, -0.046227614518912025, 0.07955953115639894, 0.0156154543858821, -0.1543319833994637, 0.0665601628479552, 0.20457398967464457, -0.04216040405827536, 0.2168673699058286, -0.4400893876915925, -0.20933525009106282, 0.08615398371685722, 0.20229276270046406, 0.17456327054222204, -0.06282493726651506, -0.2690624151821142, 0.0757546953040443, -0.13250139578283854, -0.1416381031687299, -0.040029690639205175, 0.04733237132140899, -0.04118318570730995, -0.2330079058878396, 0.12066062591152933, 0.07222403945911227, 0.023736513470379014, -0.1247852813796944, -0.0651349758157362, -0.11501584474324805, 0.05997202280466551, 0.04494421649870429, 0.040740411084349434, 0.19196653031195476, -0.16277316069128375, -0.12818235413439266, 0.38054636602617425, -0.04304817241585184, -0.15873010271998572, 0.1793493316657671, -0.1643105510060918, -0.08484499458835958, 0.21896165159433129, 0.11565415667860075, 0.13056714832357483, -0.08735120809981473, 0.04750170947486305, 0.04883380926248179, 0.15461159142153658, 0.08563378824986365, 0.03464773575324548, 0.2604635013936188, 0.17695271535606452, 0.06608292499990905, 0.16484166215228122, -0.1122221942237774, -0.1171763502382971, -0.3062242465604046, -0.14959243207651118, -0.1806509338923173, 0.06370432839799857, -0.058047128191428286, -0.18509092386365447, 0.35622047694701886, 0.11525161360437262, 0.21196756736039435, -0.01861988203164156, 0.23908111621247238, 0.11811856674397211, 0.0724360182388052, 0.0794506563834812, 0.2894811609304897, 0.1350014202905921, 0.09585687281780761, -0.2887165101042249, 0.04165618004889725, 0.01239253351460615] |
1,802.06745 | Environmental feedback drives cooperation in spatial social dilemmas | Exploiting others is beneficial individually but it could also be detrimental
globally. The reverse is also true: a higher cooperation level may change the
environment in a way that is beneficial for all competitors. To explore the
possible consequence of this feedback we consider a coevolutionary model where
the local cooperation level determines the payoff values of the applied
prisoner's dilemma game. We observe that the coevolutionary rule provides a
significantly higher cooperation level comparing to the traditional setup
independently of the topology of the applied interaction graph. Interestingly,
this cooperation supporting mechanism offers lonely defectors a high surviving
chance for a long period hence the relaxation to the final cooperating state
happens logarithmically slow. As a consequence, the extension of the
traditional evolutionary game by considering interactions with the environment
provides a good opportunity for cooperators, but their reward may arrive with
some delay.
| physics.soc-ph cs.GT q-bio.PE | exploiting others is beneficial individually but it could also be detrimental globally the reverse is also true a higher cooperation level may change the environment in a way that is beneficial for all competitors to explore the possible consequence of this feedback we consider a coevolutionary model where the local cooperation level determines the payoff values of the applied prisoners dilemma game we observe that the coevolutionary rule provides a significantly higher cooperation level comparing to the traditional setup independently of the topology of the applied interaction graph interestingly this cooperation supporting mechanism offers lonely defectors a high surviving chance for a long period hence the relaxation to the final cooperating state happens logarithmically slow as a consequence the extension of the traditional evolutionary game by considering interactions with the environment provides a good opportunity for cooperators but their reward may arrive with some delay | [['exploiting', 'others', 'is', 'beneficial', 'individually', 'but', 'it', 'could', 'also', 'be', 'detrimental', 'globally', 'the', 'reverse', 'is', 'also', 'true', 'a', 'higher', 'cooperation', 'level', 'may', 'change', 'the', 'environment', 'in', 'a', 'way', 'that', 'is', 'beneficial', 'for', 'all', 'competitors', 'to', 'explore', 'the', 'possible', 'consequence', 'of', 'this', 'feedback', 'we', 'consider', 'a', 'coevolutionary', 'model', 'where', 'the', 'local', 'cooperation', 'level', 'determines', 'the', 'payoff', 'values', 'of', 'the', 'applied', 'prisoners', 'dilemma', 'game', 'we', 'observe', 'that', 'the', 'coevolutionary', 'rule', 'provides', 'a', 'significantly', 'higher', 'cooperation', 'level', 'comparing', 'to', 'the', 'traditional', 'setup', 'independently', 'of', 'the', 'topology', 'of', 'the', 'applied', 'interaction', 'graph', 'interestingly', 'this', 'cooperation', 'supporting', 'mechanism', 'offers', 'lonely', 'defectors', 'a', 'high', 'surviving', 'chance', 'for', 'a', 'long', 'period', 'hence', 'the', 'relaxation', 'to', 'the', 'final', 'cooperating', 'state', 'happens', 'logarithmically', 'slow', 'as', 'a', 'consequence', 'the', 'extension', 'of', 'the', 'traditional', 'evolutionary', 'game', 'by', 'considering', 'interactions', 'with', 'the', 'environment', 'provides', 'a', 'good', 'opportunity', 'for', 'cooperators', 'but', 'their', 'reward', 'may', 'arrive', 'with', 'some', 'delay']] | [-0.17293511468050038, 0.11782702207886453, -0.12353779662697544, 0.13719261731422538, -0.09987260657523213, -0.19975417022240058, 0.16246917160420582, 0.38400459916427215, -0.2838290531445166, -0.28171496591691314, 0.054116042333269686, -0.20260391182683665, -0.1779074090179698, 0.07057785721142487, -0.08419830559367507, -0.08544874210141455, 0.07494122612948433, 0.05352039617678986, 0.028568410057301537, -0.30565137357936756, 0.3022023128474067, 0.11709542303378212, 0.2800203623378585, 0.022761095729495945, 0.08554385340258736, 0.012810396425554465, 0.01095498726634983, 0.052290693684159936, -0.0799301313482233, 0.044506448493258834, 0.28179062854956255, 0.16089408218635826, 0.3758448264063818, -0.41531275842852633, -0.1891299398696243, 0.139487343355371, 0.1608624119761175, 0.15726098376807982, -0.052260512410630955, -0.25965025684443016, 0.05886835467616289, -0.21956558979662327, -0.13846976131778851, -0.041755540238629124, -0.019596044744509433, -0.003363274688396406, -0.30228482439214815, 0.03650174968402255, 0.041037274770245984, 0.01520881120372435, -0.04474565824493766, -0.09597440662247868, -0.046489493320856626, 0.19381879289184922, 0.0370028247189676, 0.021903958759102008, 0.13079691521727063, -0.1555237732562718, -0.1474243681749393, 0.3950243339584819, -0.052950494463459175, -0.17250822916956104, 0.24363978096958377, -0.1483300776991608, -0.09473956775096855, 0.11051039760611181, 0.12587435115128756, 0.08803632326167206, -0.12680348769986424, 0.024439360842044497, -0.028602507748994335, 0.15521825827529717, 0.03482160039711744, 0.061170062669231716, 0.18761479343962054, 0.22021725018476618, 0.15839675766544353, 0.10523010133845924, -0.01201190419559335, -0.16892531446446182, -0.21543712041115967, -0.12610124521808505, -0.11737177129915177, 0.06561887487447982, -0.0986372099900297, -0.07596998957852866, 0.37398339414262566, 0.1382340264233664, 0.16649518167150432, 0.10400766970324812, 0.2762860656234211, 0.10119426190483802, 0.06789849897463211, 0.029113365687301447, 0.24679029318524107, 0.04362373572437028, 0.10579555534340185, -0.24880394248195506, 0.19185299525310381, -0.012296933048918586] |
1,802.06746 | Differential Cross Section for $\gamma d \rightarrow \omega d$ using
CLAS at Jefferson Lab | The cross section for coherent $\omega$-meson photoproduction off the
deuteron has been measured for the first time as a function of the momentum
transfer $t = (P_{\gamma}-P_{\omega})^2$ and photon energy $E_{\gamma}$ using
the CLAS detector at the Thomas Jefferson National Accelerator Facility. The
cross sections are measured in the energy range $1.4 < E_{\gamma} < 3.4$ GeV. A
model based on $\omega-N$ rescattering is consistent with the data at low and
intermediate momentum transfer, $|t|$. For $2.8 < E_{\gamma} < 3.4$ GeV, the
total cross-section of $\omega-N$ scattering, based on fits within the
framework of the Vector Meson Dominance model, is in the range of 30-40 mb.
| nucl-ex hep-ex | the cross section for coherent omegameson photoproduction off the deuteron has been measured for the first time as a function of the momentum transfer t p_gammap_omega2 and photon energy e_gamma using the clas detector at the thomas jefferson national accelerator facility the cross sections are measured in the energy range 14 e_gamma 34 gev a model based on omegan rescattering is consistent with the data at low and intermediate momentum transfer t for 28 e_gamma 34 gev the total crosssection of omegan scattering based on fits within the framework of the vector meson dominance model is in the range of 3040 mb | [['the', 'cross', 'section', 'for', 'coherent', 'omegameson', 'photoproduction', 'off', 'the', 'deuteron', 'has', 'been', 'measured', 'for', 'the', 'first', 'time', 'as', 'a', 'function', 'of', 'the', 'momentum', 'transfer', 't', 'p_gammap_omega2', 'and', 'photon', 'energy', 'e_gamma', 'using', 'the', 'clas', 'detector', 'at', 'the', 'thomas', 'jefferson', 'national', 'accelerator', 'facility', 'the', 'cross', 'sections', 'are', 'measured', 'in', 'the', 'energy', 'range', '14', 'e_gamma', '34', 'gev', 'a', 'model', 'based', 'on', 'omegan', 'rescattering', 'is', 'consistent', 'with', 'the', 'data', 'at', 'low', 'and', 'intermediate', 'momentum', 'transfer', 't', 'for', '28', 'e_gamma', '34', 'gev', 'the', 'total', 'crosssection', 'of', 'omegan', 'scattering', 'based', 'on', 'fits', 'within', 'the', 'framework', 'of', 'the', 'vector', 'meson', 'dominance', 'model', 'is', 'in', 'the', 'range', 'of', '3040', 'mb']] | [-0.05973541912493656, 0.20012437425885754, -0.09582705537576487, 0.12284094114133184, -0.0022414415558375937, -0.07701898890888632, 0.03985234331524018, 0.341462236782997, -0.177408355574059, -0.3532883183901558, -0.07343095907305211, -0.36540763569756013, 0.10581160043043518, 0.2266776298546223, 0.1094960402535957, 0.12672846261780746, 0.07065481086731842, 0.048044826143817734, -0.013345572182281626, -0.15564571574588518, 0.30755037446460215, 0.14264140553348284, 0.2746221093774432, 0.19392413773232758, 0.1426608636710184, 0.09129221789541166, -0.015943291753825573, -0.09704670238096526, -0.10376239644990552, 0.05261101522067986, 0.28819748740597156, 0.05884104687490012, 0.14032059786195802, -0.32487350554749517, -0.12234010196078828, 0.08810179740291937, 0.08522814893570618, 0.018483159888425086, -0.0037081617479314015, -0.24965910612614733, 0.06928944024072942, -0.24331908444366832, -0.08796665335701097, 0.004538959671402037, 0.042751022865811346, -0.002478735171037145, -0.25912877538305995, 0.0695583934683611, -0.04998055334654775, 0.050627928476153626, -0.10152927647335547, -0.2457644878379484, -0.03101323617594593, -0.002262361624305791, 0.02950809756985469, 0.14358987868187192, 0.1657624819343633, -0.13036881105070658, -0.12273273260406412, 0.35358074226296776, -0.04857336495551142, -0.09535700097532555, 0.05731694587036082, -0.23546086502547312, -0.08487825643842911, 0.2360650904034034, 0.2376241781610516, 0.10752485205516182, -0.17295868626546743, 0.13103320367667723, -0.0424808705280913, 0.19005921903518166, 0.13840509202137663, -3.9342292907214404e-05, 0.10233581032013835, 0.22042958205796337, -0.013642000094388086, 0.014718084183457021, -0.2310765434614392, -0.07335441201777741, -0.4199747910520228, -0.09459790261923381, -0.09094131440569711, 0.08272978550026028, -0.02542415907171942, -0.0006130650906943449, 0.3372510593236968, 0.011457448484062558, 0.3245649756771503, 0.039689501415532416, 0.3320397377604305, 0.1434335770295232, 0.11784231390730285, 0.10160207475932075, 0.2980095041676028, 0.16710744389000876, 0.1836065771795883, -0.20967716803903333, 0.020715529689251787, -0.00815455141560276] |
1,802.06747 | Borderline Magnetism: How Does Adding Magnesium to Paramagnetic CeCo$_3$
Make a 450 K Ferromagnet with Large Magnetic Anisotropy? | A recent experimental study (Phys. Rev. Appl. 9, 024023, 2018) on
paramagnetic CeCo$_3$ finds that Magnesium alloying induces a ferromagnetic
transition with intrinsic properties large enough for permanent magnet
applications. Here we explain these surprising results \textit{via} a first
principles study of the electronic structure and magnetism of Magnesium-alloyed
CeCo$_3$. We find the origin of this Magnesium-induced ferromagnetic transition
to be Stoner physics - the substantial increase in the Fermi-level
density-of-states $N(E_F)$ with Mg alloying. Our calculations suggest that both
Ce and Co atoms are important for generating large magnetic anisotropy
suggesting the viability of Co-3$d$, and Ce-4$f$ interaction for the generation
of magnetic anisotropy in magnetic materials. These results offer a new route
to the discovery of ferromagnetic materials and provide fundamental insight
into the magnetic properties of these alloys
| cond-mat.mtrl-sci | a recent experimental study phys rev appl 9 024023 2018 on paramagnetic ceco_3 finds that magnesium alloying induces a ferromagnetic transition with intrinsic properties large enough for permanent magnet applications here we explain these surprising results textitvia a first principles study of the electronic structure and magnetism of magnesiumalloyed ceco_3 we find the origin of this magnesiuminduced ferromagnetic transition to be stoner physics the substantial increase in the fermilevel densityofstates ne_f with mg alloying our calculations suggest that both ce and co atoms are important for generating large magnetic anisotropy suggesting the viability of co3d and ce4f interaction for the generation of magnetic anisotropy in magnetic materials these results offer a new route to the discovery of ferromagnetic materials and provide fundamental insight into the magnetic properties of these alloys | [['a', 'recent', 'experimental', 'study', 'phys', 'rev', 'appl', '9', '024023', '2018', 'on', 'paramagnetic', 'ceco_3', 'finds', 'that', 'magnesium', 'alloying', 'induces', 'a', 'ferromagnetic', 'transition', 'with', 'intrinsic', 'properties', 'large', 'enough', 'for', 'permanent', 'magnet', 'applications', 'here', 'we', 'explain', 'these', 'surprising', 'results', 'textitvia', 'a', 'first', 'principles', 'study', 'of', 'the', 'electronic', 'structure', 'and', 'magnetism', 'of', 'magnesiumalloyed', 'ceco_3', 'we', 'find', 'the', 'origin', 'of', 'this', 'magnesiuminduced', 'ferromagnetic', 'transition', 'to', 'be', 'stoner', 'physics', 'the', 'substantial', 'increase', 'in', 'the', 'fermilevel', 'densityofstates', 'ne_f', 'with', 'mg', 'alloying', 'our', 'calculations', 'suggest', 'that', 'both', 'ce', 'and', 'co', 'atoms', 'are', 'important', 'for', 'generating', 'large', 'magnetic', 'anisotropy', 'suggesting', 'the', 'viability', 'of', 'co3d', 'and', 'ce4f', 'interaction', 'for', 'the', 'generation', 'of', 'magnetic', 'anisotropy', 'in', 'magnetic', 'materials', 'these', 'results', 'offer', 'a', 'new', 'route', 'to', 'the', 'discovery', 'of', 'ferromagnetic', 'materials', 'and', 'provide', 'fundamental', 'insight', 'into', 'the', 'magnetic', 'properties', 'of', 'these', 'alloys']] | [-0.12934963720095322, 0.17162768943161946, 0.0010734395688678335, -0.006040497720571543, -0.0683171835500659, -0.09098935413254997, 0.09462766690311704, 0.3751038376931248, -0.22688042687794824, -0.33196304599556514, -0.025549764823769843, -0.31545115217537156, -0.1730393924160061, 0.17775968463878755, 0.051603910139226536, -0.04332258528479793, 0.006080258725665685, -0.09295746894332389, -0.10957629614010982, -0.21918287018028007, 0.23953800843423598, 0.041661108587318516, 0.3042418206821922, 0.1415133378353299, 0.009066641796380281, -0.028321918450281258, 0.12975648283870436, 0.03412845411051915, -0.1787939648971, 0.1173701894920554, 0.23936848430463487, -0.045009508923312104, 0.21409217566141756, -0.46489533559074553, -0.20194572136246078, 0.013137898305211011, 0.06889526321970689, 0.15152185689291264, -0.14135741974285795, -0.27948145678369546, 0.07294047076399915, -0.13232084698828422, -0.13627162492122707, -0.17409027896924165, 0.009666679251029736, 0.033631510101258755, -0.274430456481907, 0.09561340511945171, 0.12321762115452585, 0.11913214184064923, -0.12309536022522788, -0.16244613696036375, -0.050105508697387856, 0.029619657592187952, 0.04814501653799391, 0.05619350414151165, 0.133960577679017, -0.07294287597283897, -0.1376000558004135, 0.3705702432482613, -0.02175037077386079, 0.0001484468051298397, 0.20241316706382148, -0.193157204720155, -0.16278725907602531, 0.1503838467976357, 0.15885264508373023, 0.054190735562748504, -0.12752187855616873, 0.08380337588041728, 0.0018278176357280317, 0.16309822215075334, 0.000111693287209615, 0.08294512973328334, 0.26946089433608794, 0.20937710308550497, -0.003040857239091021, 0.1156623277072538, -0.1044977894786188, -0.03221443032215195, -0.2245852396214806, -0.23655826609772374, -0.214248987743411, 0.10459666940068284, -0.0789881965184885, -0.19484542590367981, 0.37000480809754976, 0.2084615168516436, 0.1847204998150233, -0.1116262908262296, 0.1917042224612967, 0.05009794655516304, 0.03586515949932009, 0.026364596531264425, 0.30096719101966013, 0.2149940211560548, 0.13559590931981802, -0.28467794857537887, 0.09505583385535421, -0.0006223086553706429] |
1,802.06748 | Breaking the Linear-Memory Barrier in MPC: Fast MIS on Trees with
Strongly Sublinear Memory | Recently, studying fundamental graph problems in the \emph{Massively Parallel
Computation (MPC) framework, inspired by the MapReduce paradigm, has gained a
lot of attention. An assumption common to a vast majority of approaches is to
allow $\widetilde{\Omega}(n)$ memory per machine, where $n$ is the number of
nodes in the graph and $\widetilde{\Omega}$ hides polylogarithmic factors.
However, as pointed out by Karloff et al. [SODA'10] and Czumaj et al.
[STOC'18], it might be unrealistic for a single machine to have linear or only
slightly sublinear memory.
In this paper, we thus study a more practical variant of the MPC model which
only requires substantially sublinear or even subpolynomial memory per machine.
In contrast to the linear-memory MPC model and also to streaming algorithms, in
this low-memory MPC setting, a single machine will only see a small number of
nodes in the graph. We introduce a new and strikingly simple technique to cope
with this imposed locality.
In particular, we show that the Maximal Independent Set (MIS) problem can be
solved efficiently, that is, in $O(\log^3 \log n)$ rounds, when the input graph
is a tree. This constitutes an almost exponential speed-up over the low-memory
MPC algorithm in $O(\sqrt{\log n})$-algorithm in a concurrent work by Ghaffari
and Uitto [SODA'19] and substantially reduces the local memory from
$\widetilde{\Omega}(n)$ required by the recent $O(\log \log n)$-round MIS
algorithm of Ghaffari et al. [PODC'18] to $n^{\alpha}$ for any $\alpha>0$,
without incurring a significant loss in the round complexity. Moreover, it
demonstrates how to make use of the all-to-all communication in the MPC model
to almost exponentially improve on the corresponding bound in the
$\mathsf{LOCAL}$ and $\mathsf{PRAM}$ models by Lenzen and Wattenhofer
[PODC'11].
| cs.DS | recently studying fundamental graph problems in the emphmassively parallel computation mpc framework inspired by the mapreduce paradigm has gained a lot of attention an assumption common to a vast majority of approaches is to allow widetildeomegan memory per machine where n is the number of nodes in the graph and widetildeomega hides polylogarithmic factors however as pointed out by karloff et al soda10 and czumaj et al stoc18 it might be unrealistic for a single machine to have linear or only slightly sublinear memory in this paper we thus study a more practical variant of the mpc model which only requires substantially sublinear or even subpolynomial memory per machine in contrast to the linearmemory mpc model and also to streaming algorithms in this lowmemory mpc setting a single machine will only see a small number of nodes in the graph we introduce a new and strikingly simple technique to cope with this imposed locality in particular we show that the maximal independent set mis problem can be solved efficiently that is in olog3 log n rounds when the input graph is a tree this constitutes an almost exponential speedup over the lowmemory mpc algorithm in osqrtlog nalgorithm in a concurrent work by ghaffari and uitto soda19 and substantially reduces the local memory from widetildeomegan required by the recent olog log nround mis algorithm of ghaffari et al podc18 to nalpha for any alpha0 without incurring a significant loss in the round complexity moreover it demonstrates how to make use of the alltoall communication in the mpc model to almost exponentially improve on the corresponding bound in the mathsflocal and mathsfpram models by lenzen and wattenhofer podc11 | [['recently', 'studying', 'fundamental', 'graph', 'problems', 'in', 'the', 'emphmassively', 'parallel', 'computation', 'mpc', 'framework', 'inspired', 'by', 'the', 'mapreduce', 'paradigm', 'has', 'gained', 'a', 'lot', 'of', 'attention', 'an', 'assumption', 'common', 'to', 'a', 'vast', 'majority', 'of', 'approaches', 'is', 'to', 'allow', 'widetildeomegan', 'memory', 'per', 'machine', 'where', 'n', 'is', 'the', 'number', 'of', 'nodes', 'in', 'the', 'graph', 'and', 'widetildeomega', 'hides', 'polylogarithmic', 'factors', 'however', 'as', 'pointed', 'out', 'by', 'karloff', 'et', 'al', 'soda10', 'and', 'czumaj', 'et', 'al', 'stoc18', 'it', 'might', 'be', 'unrealistic', 'for', 'a', 'single', 'machine', 'to', 'have', 'linear', 'or', 'only', 'slightly', 'sublinear', 'memory', 'in', 'this', 'paper', 'we', 'thus', 'study', 'a', 'more', 'practical', 'variant', 'of', 'the', 'mpc', 'model', 'which', 'only', 'requires', 'substantially', 'sublinear', 'or', 'even', 'subpolynomial', 'memory', 'per', 'machine', 'in', 'contrast', 'to', 'the', 'linearmemory', 'mpc', 'model', 'and', 'also', 'to', 'streaming', 'algorithms', 'in', 'this', 'lowmemory', 'mpc', 'setting', 'a', 'single', 'machine', 'will', 'only', 'see', 'a', 'small', 'number', 'of', 'nodes', 'in', 'the', 'graph', 'we', 'introduce', 'a', 'new', 'and', 'strikingly', 'simple', 'technique', 'to', 'cope', 'with', 'this', 'imposed', 'locality', 'in', 'particular', 'we', 'show', 'that', 'the', 'maximal', 'independent', 'set', 'mis', 'problem', 'can', 'be', 'solved', 'efficiently', 'that', 'is', 'in', 'olog3', 'log', 'n', 'rounds', 'when', 'the', 'input', 'graph', 'is', 'a', 'tree', 'this', 'constitutes', 'an', 'almost', 'exponential', 'speedup', 'over', 'the', 'lowmemory', 'mpc', 'algorithm', 'in', 'osqrtlog', 'nalgorithm', 'in', 'a', 'concurrent', 'work', 'by', 'ghaffari', 'and', 'uitto', 'soda19', 'and', 'substantially', 'reduces', 'the', 'local', 'memory', 'from', 'widetildeomegan', 'required', 'by', 'the', 'recent', 'olog', 'log', 'nround', 'mis', 'algorithm', 'of', 'ghaffari', 'et', 'al', 'podc18', 'to', 'nalpha', 'for', 'any', 'alpha0', 'without', 'incurring', 'a', 'significant', 'loss', 'in', 'the', 'round', 'complexity', 'moreover', 'it', 'demonstrates', 'how', 'to', 'make', 'use', 'of', 'the', 'alltoall', 'communication', 'in', 'the', 'mpc', 'model', 'to', 'almost', 'exponentially', 'improve', 'on', 'the', 'corresponding', 'bound', 'in', 'the', 'mathsflocal', 'and', 'mathsfpram', 'models', 'by', 'lenzen', 'and', 'wattenhofer', 'podc11']] | [-0.12655802616909906, 0.06646523670502508, -0.044217695756513554, 0.011288409992293627, -0.09320921363412506, -0.17594802282336686, 0.12301165653021869, 0.3551911746168992, -0.271857513962486, -0.3853814844869905, 0.06995889486279339, -0.2417366938631016, -0.1491764160920866, 0.1860702650250729, -0.13722145473401287, 0.08248215967496098, 0.057651345228724594, 0.022176853973521954, 0.0008078082723336087, -0.3403889160210922, 0.21715002373309322, 0.09206640926120734, 0.24571105448563618, 0.010725570291591187, 0.06869954056951597, 0.03181044112511531, -0.029704376467055194, 0.029092694582693555, -0.09067678008755643, 0.10108693780817299, 0.24196015776851035, 0.16989625389102944, 0.33133273204719577, -0.43103396948771894, -0.19237085578583732, 0.1425108876855423, 0.18042773388464142, 0.11665573203634402, -0.015656501172742098, -0.22607600393325641, 0.13561750461468128, -0.1593308802025772, -0.046856978558935225, -0.04248521712746609, 0.06106261261911304, -0.028767570183629652, -0.28477324085499817, 0.04528880644044235, 0.09433972805531489, -0.013870438578090182, 0.042824492209884164, -0.09277018474552919, 0.05695957215934026, 0.04303544994963212, -0.019670374489268633, 0.11779590912628919, 0.0591317624155501, -0.12032285016375008, -0.1470514177137779, 0.35605356716550884, -0.03586321907221443, -0.1504443426698412, 0.15390178185146025, -0.052065428756867295, -0.1797639762956856, 0.08337151601099996, 0.1983592963139354, 0.12058098104381416, -0.12453056842986607, 0.15955183342340643, -0.07568107103170069, 0.21241262398694677, 0.08480222117914646, 0.015539698935700235, 0.05226879748796044, 0.17634401282261092, 0.11520118029934734, 0.12130881730139394, -0.021915122153478916, -0.09702206865466131, -0.2214307864230014, -0.14264449128574969, -0.20431708793793976, 0.03848194483477898, -0.1432359073893167, -0.1351124810391209, 0.3393557526964556, 0.15575070084348597, 0.23459897572562718, 0.1255641998994785, 0.3055021911480085, 0.0617703308015566, 0.10341686050028161, 0.21450965994313095, 0.19866738161158368, 0.06421881223839053, 0.09612204934668693, -0.18924003458599112, 0.09896567761337523, 0.05536768327260183] |
1,802.06749 | Leveraged volume sampling for linear regression | Suppose an $n \times d$ design matrix in a linear regression problem is
given, but the response for each point is hidden unless explicitly requested.
The goal is to sample only a small number $k \ll n$ of the responses, and then
produce a weight vector whose sum of squares loss over all points is at most
$1+\epsilon$ times the minimum. When $k$ is very small (e.g., $k=d$), jointly
sampling diverse subsets of points is crucial. One such method called volume
sampling has a unique and desirable property that the weight vector it produces
is an unbiased estimate of the optimum. It is therefore natural to ask if this
method offers the optimal unbiased estimate in terms of the number of responses
$k$ needed to achieve a $1+\epsilon$ loss approximation.
Surprisingly we show that volume sampling can have poor behavior when we
require a very accurate approximation -- indeed worse than some i.i.d. sampling
techniques whose estimates are biased, such as leverage score sampling. We then
develop a new rescaled variant of volume sampling that produces an unbiased
estimate which avoids this bad behavior and has at least as good a tail bound
as leverage score sampling: sample size $k=O(d\log d + d/\epsilon)$ suffices to
guarantee total loss at most $1+\epsilon$ times the minimum with high
probability. Thus, we improve on the best previously known sample size for an
unbiased estimator, $k=O(d^2/\epsilon)$.
Our rescaling procedure leads to a new efficient algorithm for volume
sampling which is based on a determinantal rejection sampling technique with
potentially broader applications to determinantal point processes. Other
contributions include introducing the combinatorics needed for rescaled volume
sampling and developing tail bounds for sums of dependent random matrices which
arise in the process.
| cs.LG | suppose an n times d design matrix in a linear regression problem is given but the response for each point is hidden unless explicitly requested the goal is to sample only a small number k ll n of the responses and then produce a weight vector whose sum of squares loss over all points is at most 1epsilon times the minimum when k is very small eg kd jointly sampling diverse subsets of points is crucial one such method called volume sampling has a unique and desirable property that the weight vector it produces is an unbiased estimate of the optimum it is therefore natural to ask if this method offers the optimal unbiased estimate in terms of the number of responses k needed to achieve a 1epsilon loss approximation surprisingly we show that volume sampling can have poor behavior when we require a very accurate approximation indeed worse than some iid sampling techniques whose estimates are biased such as leverage score sampling we then develop a new rescaled variant of volume sampling that produces an unbiased estimate which avoids this bad behavior and has at least as good a tail bound as leverage score sampling sample size kodlog d depsilon suffices to guarantee total loss at most 1epsilon times the minimum with high probability thus we improve on the best previously known sample size for an unbiased estimator kod2epsilon our rescaling procedure leads to a new efficient algorithm for volume sampling which is based on a determinantal rejection sampling technique with potentially broader applications to determinantal point processes other contributions include introducing the combinatorics needed for rescaled volume sampling and developing tail bounds for sums of dependent random matrices which arise in the process | [['suppose', 'an', 'n', 'times', 'd', 'design', 'matrix', 'in', 'a', 'linear', 'regression', 'problem', 'is', 'given', 'but', 'the', 'response', 'for', 'each', 'point', 'is', 'hidden', 'unless', 'explicitly', 'requested', 'the', 'goal', 'is', 'to', 'sample', 'only', 'a', 'small', 'number', 'k', 'll', 'n', 'of', 'the', 'responses', 'and', 'then', 'produce', 'a', 'weight', 'vector', 'whose', 'sum', 'of', 'squares', 'loss', 'over', 'all', 'points', 'is', 'at', 'most', '1epsilon', 'times', 'the', 'minimum', 'when', 'k', 'is', 'very', 'small', 'eg', 'kd', 'jointly', 'sampling', 'diverse', 'subsets', 'of', 'points', 'is', 'crucial', 'one', 'such', 'method', 'called', 'volume', 'sampling', 'has', 'a', 'unique', 'and', 'desirable', 'property', 'that', 'the', 'weight', 'vector', 'it', 'produces', 'is', 'an', 'unbiased', 'estimate', 'of', 'the', 'optimum', 'it', 'is', 'therefore', 'natural', 'to', 'ask', 'if', 'this', 'method', 'offers', 'the', 'optimal', 'unbiased', 'estimate', 'in', 'terms', 'of', 'the', 'number', 'of', 'responses', 'k', 'needed', 'to', 'achieve', 'a', '1epsilon', 'loss', 'approximation', 'surprisingly', 'we', 'show', 'that', 'volume', 'sampling', 'can', 'have', 'poor', 'behavior', 'when', 'we', 'require', 'a', 'very', 'accurate', 'approximation', 'indeed', 'worse', 'than', 'some', 'iid', 'sampling', 'techniques', 'whose', 'estimates', 'are', 'biased', 'such', 'as', 'leverage', 'score', 'sampling', 'we', 'then', 'develop', 'a', 'new', 'rescaled', 'variant', 'of', 'volume', 'sampling', 'that', 'produces', 'an', 'unbiased', 'estimate', 'which', 'avoids', 'this', 'bad', 'behavior', 'and', 'has', 'at', 'least', 'as', 'good', 'a', 'tail', 'bound', 'as', 'leverage', 'score', 'sampling', 'sample', 'size', 'kodlog', 'd', 'depsilon', 'suffices', 'to', 'guarantee', 'total', 'loss', 'at', 'most', '1epsilon', 'times', 'the', 'minimum', 'with', 'high', 'probability', 'thus', 'we', 'improve', 'on', 'the', 'best', 'previously', 'known', 'sample', 'size', 'for', 'an', 'unbiased', 'estimator', 'kod2epsilon', 'our', 'rescaling', 'procedure', 'leads', 'to', 'a', 'new', 'efficient', 'algorithm', 'for', 'volume', 'sampling', 'which', 'is', 'based', 'on', 'a', 'determinantal', 'rejection', 'sampling', 'technique', 'with', 'potentially', 'broader', 'applications', 'to', 'determinantal', 'point', 'processes', 'other', 'contributions', 'include', 'introducing', 'the', 'combinatorics', 'needed', 'for', 'rescaled', 'volume', 'sampling', 'and', 'developing', 'tail', 'bounds', 'for', 'sums', 'of', 'dependent', 'random', 'matrices', 'which', 'arise', 'in', 'the', 'process']] | [-0.07599101468259238, 0.09712645201717567, -0.09767213166780217, 0.08202890323888756, -0.07311636072586787, -0.16595951993307986, 0.10813716627195043, 0.39030263511227054, -0.2655915591656806, -0.3021907499866303, 0.10392255462930693, -0.27868311636334175, -0.1285644453925956, 0.17199268851259744, -0.09509145791309988, 0.05958472343421683, 0.057883557741770474, 0.0637252624064368, -0.06002373627367242, -0.3044989812072669, 0.23671432623356686, 0.08367131699811232, 0.2694756165837915, -0.012279769664057678, 0.1384420022187432, 0.02981774086443635, -0.02194637160208537, 0.01911942938703866, -0.12054911536752726, 0.10393345070502626, 0.25778895210846603, 0.14516413354647245, 0.33593188933435786, -0.33210133805473735, -0.1563343311941363, 0.1734645640902886, 0.1498850213859766, 0.08529059513753393, -0.01904905776743359, -0.17490281165139782, 0.12965050371826128, -0.11398285222832152, -0.11525154293534534, -0.10878066141355795, 0.01153029671412738, 0.003158080366904133, -0.3736981860587831, 0.04624568795630636, 0.05703515684488805, 0.009208831567541029, 0.02593905919860035, -0.19475538117931201, 0.04131162847481115, 0.09909009979009405, 0.018743844731943682, 0.07305369775432949, 0.10441997521491096, -0.10692606314806129, -0.0792302912734235, 0.34431242769380027, -0.04728121729716766, -0.21838935237111937, 0.15848924253175412, -0.13602117596148075, -0.12847837475589197, 0.20239080628215636, 0.18707178884832512, 0.13099497432465493, -0.13690676846693256, 0.06665210675879286, -0.0599662504313586, 0.1591614827115908, 0.06842770726196204, 0.05632749148940687, 0.13572512891072805, 0.1638626463229146, 0.17473116442610512, 0.11829198398396978, -0.08674997572586361, -0.05595840139778548, -0.2955390735934143, -0.12606440362200272, -0.2571654488384401, 0.0714473269695528, -0.1696935132865353, -0.2118697829805553, 0.3211697976239842, 0.152682290568803, 0.24781258294668193, 0.11705302332187328, 0.28307262340448663, 0.1265813513147207, 0.052184632753907265, 0.12165239189550701, 0.1364105481165091, 0.09910507145907085, -0.014471789310659964, -0.1638000669972247, 0.12263917155311255, 0.07143016571471922] |
1,802.0675 | Energy efficiency optimization in MIMO interference channels: A
successive pseudoconvex approximation approach | In this paper, we consider the (global and sum) energy efficiency
optimization problem in downlink multi-input multi-output multi-cell systems,
where all users suffer from multi-user interference. This is a challenging
problem due to several reasons: 1) it is a nonconvex fractional programming
problem, 2) the transmission rate functions are characterized by
(complex-valued) transmit covariance matrices, and 3) the processing-related
power consumption may depend on the transmission rate. We tackle this problem
by the successive pseudoconvex approximation approach, and we argue that
pseudoconvex optimization plays a fundamental role in designing novel iterative
algorithms, not only because every locally optimal point of a pseudoconvex
optimization problem is also globally optimal, but also because a descent
direction is easily obtained from every optimal point of a pseudoconvex
optimization problem. The proposed algorithms have the following advantages: 1)
fast convergence as the structure of the original optimization problem is
preserved as much as possible in the approximate problem solved in each
iteration, 2) easy implementation as each approximate problem is suitable for
parallel computation and its solution has a closed-form expression, and 3)
guaranteed convergence to a stationary point or a Karush-Kuhn-Tucker point. The
advantages of the proposed algorithm are also illustrated numerically.
| math.OC eess.SP | in this paper we consider the global and sum energy efficiency optimization problem in downlink multiinput multioutput multicell systems where all users suffer from multiuser interference this is a challenging problem due to several reasons 1 it is a nonconvex fractional programming problem 2 the transmission rate functions are characterized by complexvalued transmit covariance matrices and 3 the processingrelated power consumption may depend on the transmission rate we tackle this problem by the successive pseudoconvex approximation approach and we argue that pseudoconvex optimization plays a fundamental role in designing novel iterative algorithms not only because every locally optimal point of a pseudoconvex optimization problem is also globally optimal but also because a descent direction is easily obtained from every optimal point of a pseudoconvex optimization problem the proposed algorithms have the following advantages 1 fast convergence as the structure of the original optimization problem is preserved as much as possible in the approximate problem solved in each iteration 2 easy implementation as each approximate problem is suitable for parallel computation and its solution has a closedform expression and 3 guaranteed convergence to a stationary point or a karushkuhntucker point the advantages of the proposed algorithm are also illustrated numerically | [['in', 'this', 'paper', 'we', 'consider', 'the', 'global', 'and', 'sum', 'energy', 'efficiency', 'optimization', 'problem', 'in', 'downlink', 'multiinput', 'multioutput', 'multicell', 'systems', 'where', 'all', 'users', 'suffer', 'from', 'multiuser', 'interference', 'this', 'is', 'a', 'challenging', 'problem', 'due', 'to', 'several', 'reasons', '1', 'it', 'is', 'a', 'nonconvex', 'fractional', 'programming', 'problem', '2', 'the', 'transmission', 'rate', 'functions', 'are', 'characterized', 'by', 'complexvalued', 'transmit', 'covariance', 'matrices', 'and', '3', 'the', 'processingrelated', 'power', 'consumption', 'may', 'depend', 'on', 'the', 'transmission', 'rate', 'we', 'tackle', 'this', 'problem', 'by', 'the', 'successive', 'pseudoconvex', 'approximation', 'approach', 'and', 'we', 'argue', 'that', 'pseudoconvex', 'optimization', 'plays', 'a', 'fundamental', 'role', 'in', 'designing', 'novel', 'iterative', 'algorithms', 'not', 'only', 'because', 'every', 'locally', 'optimal', 'point', 'of', 'a', 'pseudoconvex', 'optimization', 'problem', 'is', 'also', 'globally', 'optimal', 'but', 'also', 'because', 'a', 'descent', 'direction', 'is', 'easily', 'obtained', 'from', 'every', 'optimal', 'point', 'of', 'a', 'pseudoconvex', 'optimization', 'problem', 'the', 'proposed', 'algorithms', 'have', 'the', 'following', 'advantages', '1', 'fast', 'convergence', 'as', 'the', 'structure', 'of', 'the', 'original', 'optimization', 'problem', 'is', 'preserved', 'as', 'much', 'as', 'possible', 'in', 'the', 'approximate', 'problem', 'solved', 'in', 'each', 'iteration', '2', 'easy', 'implementation', 'as', 'each', 'approximate', 'problem', 'is', 'suitable', 'for', 'parallel', 'computation', 'and', 'its', 'solution', 'has', 'a', 'closedform', 'expression', 'and', '3', 'guaranteed', 'convergence', 'to', 'a', 'stationary', 'point', 'or', 'a', 'karushkuhntucker', 'point', 'the', 'advantages', 'of', 'the', 'proposed', 'algorithm', 'are', 'also', 'illustrated', 'numerically']] | [-0.16476690388082366, -0.03566658439472167, -0.046985915107088105, 0.07810237066469843, -0.08899407601160364, -0.2259754973694193, 0.058390570580465435, 0.3966343467020326, -0.3422430066034348, -0.25016217839885313, 0.1699887867093867, -0.22737833322261017, -0.2277933573115128, 0.17173972406167057, -0.10620245298431279, 0.09921086299194333, 0.08569969567870063, 0.007483987742094229, -0.105253074915828, -0.27154691904698586, 0.2880795366728133, 0.04880359389753354, 0.30402957608645803, 0.06010221216046825, 0.13578712369780988, 0.010453515875416647, 0.03457431208325851, 0.010853703862827534, -0.06682750656090311, 0.0939419965766549, 0.3321166035585162, 0.21105951770688547, 0.37268456911804587, -0.38050434241545233, -0.1992398325701931, 0.14906359150196719, 0.22381031531558343, 0.05556501948152377, -0.0750403198598169, -0.2113290955688842, 0.1178376878872796, -0.11856980471768314, -0.08089130761271174, -0.019876982259441806, -0.03890369680235068, 0.022894870814387545, -0.33575786949362313, 0.06465747559603628, 0.040843071929306134, -0.0027145510527653376, -0.086381694206126, -0.1295858880274487, 0.046877073283975175, 0.08547264804494464, 0.043473212287709534, 0.054726266625544265, 0.10457092763166968, -0.06671909764855911, -0.12641214303936857, 0.39592562833650397, 0.029965896959618824, -0.3033542203636972, 0.1327671966223855, -0.0529007654439545, -0.13610360520477924, 0.18119477767102193, 0.20468759190098904, 0.18925053248265136, -0.16852738269436587, 0.13610205610577872, -0.042642277169201256, 0.13141937676655197, 0.06717904397013663, 0.014184296726145677, 0.12811325913215188, 0.1874197944960524, 0.21390069252752578, 0.15591060139257648, -0.0346537544006938, -0.10683259941582249, -0.2437446944537864, -0.11633242870859727, -0.22831534472414095, 0.031712062257730676, -0.10292379397890387, -0.11555545412079253, 0.3763547049073333, 0.12753828081144772, 0.15245671981635192, 0.11292737916775161, 0.36132353476973045, 0.17002509336570523, -0.013682979108786887, 0.15651674562067996, 0.18538612723138861, 0.09580423354260585, 0.12577019226408065, -0.2311383527280255, 0.04600450213213047, 0.0904842707130945] |
1,802.06751 | Seiberg-Witten differential via primitive forms | Three-fold quasi-homogeneous isolated rational singularity is argued to
define a four dimensional $\mathcal{N}=2$ SCFT. The Seiberg-Witten geometry is
built on the mini-versal deformation of the singularity. We argue in this paper
that the corresponding Seiberg-Witten differential is given by the
Gelfand-Leray form of K. Saito's primitive form. Our result also extends the
Seiberg-Witten solution to include irrelevant deformations.
| hep-th math-ph math.AG math.MP | threefold quasihomogeneous isolated rational singularity is argued to define a four dimensional mathcaln2 scft the seibergwitten geometry is built on the miniversal deformation of the singularity we argue in this paper that the corresponding seibergwitten differential is given by the gelfandleray form of k saitos primitive form our result also extends the seibergwitten solution to include irrelevant deformations | [['threefold', 'quasihomogeneous', 'isolated', 'rational', 'singularity', 'is', 'argued', 'to', 'define', 'a', 'four', 'dimensional', 'mathcaln2', 'scft', 'the', 'seibergwitten', 'geometry', 'is', 'built', 'on', 'the', 'miniversal', 'deformation', 'of', 'the', 'singularity', 'we', 'argue', 'in', 'this', 'paper', 'that', 'the', 'corresponding', 'seibergwitten', 'differential', 'is', 'given', 'by', 'the', 'gelfandleray', 'form', 'of', 'k', 'saitos', 'primitive', 'form', 'our', 'result', 'also', 'extends', 'the', 'seibergwitten', 'solution', 'to', 'include', 'irrelevant', 'deformations']] | [-0.19185220504757658, -0.0030719760167091316, -0.1484768057306265, 0.0734890769275933, -0.08577454436152916, -0.1523214443667053, -0.08260847101236918, 0.2383431552363367, -0.27387478677877064, -0.1938069038382121, 0.04896241987469317, -0.27412134476391403, -0.2615814823014983, 0.0884756803159313, -0.15859468202588373, 0.01840757027846472, 0.008634014095276081, 0.08629848762286892, -0.12878519623813317, -0.3327259053476155, 0.4671506659481032, -0.04052699627033595, 0.21759997627794228, 0.023353156762133384, 0.0999167345319714, -0.010719381850855103, -0.0018431176270904213, -0.010469351710494736, -0.1598821400454246, 0.1370633970464355, 0.32009367028187063, 0.05283070277775927, 0.09397603564389885, -0.3826787933257633, -0.17212956823440717, 0.06933656888050509, 0.16172320760208472, 0.09396704655654471, -0.0009043933121198468, -0.22876013776865498, 0.09420593227821819, -0.17883945998318238, -0.23785805028606335, -0.10564134786997376, 0.02013595387789196, -0.06262104911729693, -0.21014134505570964, 0.02078211406027047, 0.08721751029249923, 0.09868788751291818, -0.06306700325763688, -0.057125512486452173, -0.1101453128583922, 0.03159342233316395, 0.05676069287663518, 0.09292222670247328, 0.1290580543352227, -0.11459951513561778, -0.06616908954135303, 0.3547620540805932, -0.03515023996668129, -0.22499851648824226, 0.08699137396339712, -0.14582863173062174, -0.1971805113014476, 0.1889750686602603, 0.029667670629790116, 0.173724424896826, -0.10331016181614892, 0.2151184120408163, -0.0630431451658108, 0.11316574884755216, 0.14287325897221936, -0.07737221568421429, 0.21495167708730903, 0.08325627538504014, 0.027720563025374352, 0.15801116861081843, -0.014932356216816297, -0.12449718577835452, -0.40793712706915264, -0.19206879825877218, -0.10451597585503397, 0.21573621136585958, -0.11422315585137956, -0.20191249781256093, 0.3472143399031383, 0.07602362963672053, 0.22475705115959563, 0.06692038783964155, 0.185356941050047, 0.09614213304955448, 0.05936480279016341, -0.004566955885946237, 0.20169137841379592, 0.1612738522797309, 0.03501872314493461, -0.1897402981151666, -0.09686700349416712, 0.27522023334489043] |
1,802.06752 | Multifractal analysis of charged particle multiplicity distribution in
the framework of Renyi entropy | A study of multifractality and multifractal specific heat has been carried
out for the produced shower particles in nuclear emulsion detector for
16O-AgBr, 28Si-AgBr and 32S-AgBr interactions at 4.5AGeV/c in the framework of
Renyi entropy. Experimental results have been compared with the prediction of
Ultra Relativistic Quantum Molecular Dynamics (UrQMD) model. Our analysis
reveals the presence of multifractality in the multiparticle production process
in high energy nucleus-nucleus interactions. Degree of multifractality is found
to be higher for the experimental data and it increases with the increase of
projectile mass. The investigation of quark-hadron phase transition in the
multiparticle production in 16O-AgBr, 28Si-AgBr and 32S-AgBr interactions at
4.5 AGeV/c in the framework of Ginzburg-Landau theory from the concept of
multifractality has also been presented. Evidence of constant multifractal
specific heat has been obtained for both experimental and UrQMD simulated data.
| nucl-ex | a study of multifractality and multifractal specific heat has been carried out for the produced shower particles in nuclear emulsion detector for 16oagbr 28siagbr and 32sagbr interactions at 45agevc in the framework of renyi entropy experimental results have been compared with the prediction of ultra relativistic quantum molecular dynamics urqmd model our analysis reveals the presence of multifractality in the multiparticle production process in high energy nucleusnucleus interactions degree of multifractality is found to be higher for the experimental data and it increases with the increase of projectile mass the investigation of quarkhadron phase transition in the multiparticle production in 16oagbr 28siagbr and 32sagbr interactions at 45 agevc in the framework of ginzburglandau theory from the concept of multifractality has also been presented evidence of constant multifractal specific heat has been obtained for both experimental and urqmd simulated data | [['a', 'study', 'of', 'multifractality', 'and', 'multifractal', 'specific', 'heat', 'has', 'been', 'carried', 'out', 'for', 'the', 'produced', 'shower', 'particles', 'in', 'nuclear', 'emulsion', 'detector', 'for', '16oagbr', '28siagbr', 'and', '32sagbr', 'interactions', 'at', '45agevc', 'in', 'the', 'framework', 'of', 'renyi', 'entropy', 'experimental', 'results', 'have', 'been', 'compared', 'with', 'the', 'prediction', 'of', 'ultra', 'relativistic', 'quantum', 'molecular', 'dynamics', 'urqmd', 'model', 'our', 'analysis', 'reveals', 'the', 'presence', 'of', 'multifractality', 'in', 'the', 'multiparticle', 'production', 'process', 'in', 'high', 'energy', 'nucleusnucleus', 'interactions', 'degree', 'of', 'multifractality', 'is', 'found', 'to', 'be', 'higher', 'for', 'the', 'experimental', 'data', 'and', 'it', 'increases', 'with', 'the', 'increase', 'of', 'projectile', 'mass', 'the', 'investigation', 'of', 'quarkhadron', 'phase', 'transition', 'in', 'the', 'multiparticle', 'production', 'in', '16oagbr', '28siagbr', 'and', '32sagbr', 'interactions', 'at', '45', 'agevc', 'in', 'the', 'framework', 'of', 'ginzburglandau', 'theory', 'from', 'the', 'concept', 'of', 'multifractality', 'has', 'also', 'been', 'presented', 'evidence', 'of', 'constant', 'multifractal', 'specific', 'heat', 'has', 'been', 'obtained', 'for', 'both', 'experimental', 'and', 'urqmd', 'simulated', 'data']] | [-0.06334937244366087, 0.17196460117873572, -0.16406548207220006, 0.10298602962282477, 0.06125088144258103, -0.09042942982769626, -0.016443342825582744, 0.3369983455084045, -0.18118111874826034, -0.31242314476848526, 0.0029714263895156737, -0.37415828550344005, -0.058936074328170544, 0.16567880401185797, 0.08069918906617471, 0.11834975430632338, 0.07238535897854223, 0.02697202906368629, -0.015183113316786201, -0.16833012732540203, 0.26791700872126967, 0.13444323526431723, 0.3059268791214837, 0.18597242504919825, 0.0686000767386491, -0.005322361842605888, -0.04206009683462873, 0.015199919929727912, -0.12033075109630932, 0.05113251696285956, 0.24732258960070527, 0.03940970009973492, 0.19197700769804857, -0.40809948205509605, -0.25950183290029494, 0.08749186731566784, 0.12746136046617346, 0.0935230769100599, -0.073734706011772, -0.30039561175576907, 0.06776154212146888, -0.22407742101720085, -0.12713826679186346, -0.08780420517381143, 0.022255070863620323, 0.029427499672986895, -0.25591579404906095, 0.1469482487794748, -0.0056951106127919905, 0.11991248041158542, -0.0499144822037231, -0.10961324690074167, -0.0507914665110601, 0.07415224658667713, 0.06973966426513097, 0.03662353735725286, 0.14858897272771335, -0.13174998803857735, -0.14397206764175174, 0.36102382500436814, -0.042324767040554434, -0.12379346341442536, 0.18193834977094359, -0.20936457681990064, -0.17934093881044913, 0.17873892571900368, 0.20046275465146585, 0.06841171114801374, -0.18177489042350584, 0.07418227259211777, 0.005269351631046876, 0.14116073766490445, 0.03681093413273201, 0.034692420281798524, 0.16270815888899104, 0.24601156937698013, -0.0654123358630493, 0.16905377605657765, -0.1333908938035807, -0.16506529561421998, -0.28918868475867543, -0.1429415631436688, -0.20006682365355494, 0.018154676919734544, -0.09579028252130015, -0.10027787067434367, 0.37619590255952273, 0.15059352015262395, 0.16785442829816877, -0.012946825323845534, 0.22905427667394498, 0.09149248437932007, 0.04757829236469286, 0.049903246755574775, 0.2949999109225567, 0.14089552051497295, 0.1833061763592174, -0.2567804237050415, 0.0742681378238451, 0.004873149637954638] |
1,802.06753 | The coolest extremely low-mass white dwarfs | Extremely low-mass white dwarf (ELM WD; $M_{\star}$ $\lesssim$ $0.18-0.20\ $
$M_{\odot}$) stars are thought to be formed in binary systems via stable or
unstable mass transfer. Although stable mass transfer predicts the formation of
ELM WDs with thick hydrogen (H) envelopes, and hence characterized by dominant
residual nuclear burning along the cooling branch, the formation of ELM WDs
with thinner H envelopes from unstable mass loss cannot be discarded. We
compute new evolutionary sequences for helium (He) core WD stars with thin H
envelope with the main aim of assessing the lowest $T_{\rm eff}$ that could be
reached by this type of stars. We generate a new grid of evolutionary sequences
of He core WD stars with thin H envelope in the mass range from $0.1554$ to
$0.2025 M_{\odot}$, and assess the changes in both the cooling times and
surface gravity induced by a reduction of the H envelope. We also determine,
taking into account the predictions of progenitor evolution, the lowest $T_{\rm
eff}$ reached by the resulting ELM WDs. We find that a slight reduction in the
H envelope yields a significant increase in the cooling rate of ELM WDs.
Because of this, ELM WDs with thin H envelope could cool down to $\sim 2500\
$K, in contrast with their canonical counterparts that cool down to $\sim 7000\
$K. In addition, we find that a reduction of the thickness of the H envelope
increases markedly the surface gravity ($g$) of these stars. If ELM WDs are
formed with thin H envelopes, they could be detected at very low $T_{\rm eff}$.
The detection of such cool ELM WDs would be indicative that they were formed
with thin H envelopes, thus opening the possibility of placing constraints to
the possible mechanisms of formation of this type of stars. Last but not least,
the increase in $g$ due to the reduction of the H envelope leads to
consequences in the spectroscopic determinations of these stars.
| astro-ph.SR | extremely lowmass white dwarf elm wd m_star lesssim 018020 m_odot stars are thought to be formed in binary systems via stable or unstable mass transfer although stable mass transfer predicts the formation of elm wds with thick hydrogen h envelopes and hence characterized by dominant residual nuclear burning along the cooling branch the formation of elm wds with thinner h envelopes from unstable mass loss cannot be discarded we compute new evolutionary sequences for helium he core wd stars with thin h envelope with the main aim of assessing the lowest t_rm eff that could be reached by this type of stars we generate a new grid of evolutionary sequences of he core wd stars with thin h envelope in the mass range from 01554 to 02025 m_odot and assess the changes in both the cooling times and surface gravity induced by a reduction of the h envelope we also determine taking into account the predictions of progenitor evolution the lowest t_rm eff reached by the resulting elm wds we find that a slight reduction in the h envelope yields a significant increase in the cooling rate of elm wds because of this elm wds with thin h envelope could cool down to sim 2500 k in contrast with their canonical counterparts that cool down to sim 7000 k in addition we find that a reduction of the thickness of the h envelope increases markedly the surface gravity g of these stars if elm wds are formed with thin h envelopes they could be detected at very low t_rm eff the detection of such cool elm wds would be indicative that they were formed with thin h envelopes thus opening the possibility of placing constraints to the possible mechanisms of formation of this type of stars last but not least the increase in g due to the reduction of the h envelope leads to consequences in the spectroscopic determinations of these stars | [['extremely', 'lowmass', 'white', 'dwarf', 'elm', 'wd', 'm_star', 'lesssim', '018020', 'm_odot', 'stars', 'are', 'thought', 'to', 'be', 'formed', 'in', 'binary', 'systems', 'via', 'stable', 'or', 'unstable', 'mass', 'transfer', 'although', 'stable', 'mass', 'transfer', 'predicts', 'the', 'formation', 'of', 'elm', 'wds', 'with', 'thick', 'hydrogen', 'h', 'envelopes', 'and', 'hence', 'characterized', 'by', 'dominant', 'residual', 'nuclear', 'burning', 'along', 'the', 'cooling', 'branch', 'the', 'formation', 'of', 'elm', 'wds', 'with', 'thinner', 'h', 'envelopes', 'from', 'unstable', 'mass', 'loss', 'can', 'not', 'be', 'discarded', 'we', 'compute', 'new', 'evolutionary', 'sequences', 'for', 'helium', 'he', 'core', 'wd', 'stars', 'with', 'thin', 'h', 'envelope', 'with', 'the', 'main', 'aim', 'of', 'assessing', 'the', 'lowest', 't_rm', 'eff', 'that', 'could', 'be', 'reached', 'by', 'this', 'type', 'of', 'stars', 'we', 'generate', 'a', 'new', 'grid', 'of', 'evolutionary', 'sequences', 'of', 'he', 'core', 'wd', 'stars', 'with', 'thin', 'h', 'envelope', 'in', 'the', 'mass', 'range', 'from', '01554', 'to', '02025', 'm_odot', 'and', 'assess', 'the', 'changes', 'in', 'both', 'the', 'cooling', 'times', 'and', 'surface', 'gravity', 'induced', 'by', 'a', 'reduction', 'of', 'the', 'h', 'envelope', 'we', 'also', 'determine', 'taking', 'into', 'account', 'the', 'predictions', 'of', 'progenitor', 'evolution', 'the', 'lowest', 't_rm', 'eff', 'reached', 'by', 'the', 'resulting', 'elm', 'wds', 'we', 'find', 'that', 'a', 'slight', 'reduction', 'in', 'the', 'h', 'envelope', 'yields', 'a', 'significant', 'increase', 'in', 'the', 'cooling', 'rate', 'of', 'elm', 'wds', 'because', 'of', 'this', 'elm', 'wds', 'with', 'thin', 'h', 'envelope', 'could', 'cool', 'down', 'to', 'sim', '2500', 'k', 'in', 'contrast', 'with', 'their', 'canonical', 'counterparts', 'that', 'cool', 'down', 'to', 'sim', '7000', 'k', 'in', 'addition', 'we', 'find', 'that', 'a', 'reduction', 'of', 'the', 'thickness', 'of', 'the', 'h', 'envelope', 'increases', 'markedly', 'the', 'surface', 'gravity', 'g', 'of', 'these', 'stars', 'if', 'elm', 'wds', 'are', 'formed', 'with', 'thin', 'h', 'envelopes', 'they', 'could', 'be', 'detected', 'at', 'very', 'low', 't_rm', 'eff', 'the', 'detection', 'of', 'such', 'cool', 'elm', 'wds', 'would', 'be', 'indicative', 'that', 'they', 'were', 'formed', 'with', 'thin', 'h', 'envelopes', 'thus', 'opening', 'the', 'possibility', 'of', 'placing', 'constraints', 'to', 'the', 'possible', 'mechanisms', 'of', 'formation', 'of', 'this', 'type', 'of', 'stars', 'last', 'but', 'not', 'least', 'the', 'increase', 'in', 'g', 'due', 'to', 'the', 'reduction', 'of', 'the', 'h', 'envelope', 'leads', 'to', 'consequences', 'in', 'the', 'spectroscopic', 'determinations', 'of', 'these', 'stars']] | [-0.07446262695474822, 0.21762803475871312, -0.031881165355530455, 0.07332784471342818, -0.07950182391626864, -0.08144262113432535, 0.10725087590765023, 0.37356642638289894, -0.20204444189289955, -0.3506535400431776, 0.06293159622328512, -0.2554392770146115, -0.001239712729952053, 0.17383370715594956, -0.07475826255804152, -0.06113354836398845, 0.13487649167600974, -0.03285501367537212, -0.10349534388005174, -0.2800330217818127, 0.3168419661236806, 0.0499502182642615, 0.10893906024933415, -0.026170069160049454, -0.0006478985356334193, -0.14527766501902958, 0.002862613763510258, -0.04588740751228004, -0.17910326070254673, 0.007736307265217691, 0.24470315964015968, 0.12280659830017843, 0.2439044295931264, -0.369591066717594, -0.2504711070360368, 0.07834281979760173, 0.2152648905901982, 0.04968836239896622, -0.0679654797145177, -0.1824659773652462, 0.13431776433366951, -0.22335304310848078, -0.12812500145436256, 0.024827383174964635, 0.06666207172757954, 0.021436624982770554, -0.25552557514214186, 0.08953369781618215, 0.12959491003927523, 0.03029078592030164, -0.089956669033802, -0.15903318454670048, -0.14242774964203544, 0.02922271578370856, 0.03079326568032981, 0.060213104831833314, 0.15722196563954347, -0.135050789550943, 0.05604370608482504, 0.38474892102770836, -0.16582889835084946, 0.010200378656943817, 0.2261309382439398, -0.15801908361261288, -0.09588736848771967, 0.18086482316468938, 0.13832595567586586, 0.16447861112355783, -0.11706279925915525, -0.013323495879314477, 0.04788187587627962, 0.18709666498478258, 0.10395678185033194, 0.03856352255852668, 0.35109155982640505, 0.17695259889256174, 0.01847093689021865, 0.0601736794686487, -0.19201800500506958, -0.021913703489398452, -0.2220188786416969, -0.13229843851859355, -0.09659078613719427, 0.09047534548464496, -0.10236214208093165, -0.16876450180863217, 0.2878590140856828, 0.10482111450604771, 0.23483848117937797, -0.006303108285034173, 0.24050772718035676, 0.14205241502600005, 0.13712008219592897, 0.1538058107173872, 0.294317319977671, 0.25533189054581423, 0.061923941379153864, -0.2845232306212625, 0.061558381089906064, 0.00048528171083875483] |
1,802.06754 | The Great Wall: Urca Cooling Layers in the Accreted NS Crust | Accreting neutron stars host a number of astronomical observables which can
be used to infer the properties of the underlying dense matter. These
observables are sensitive to the heating and cooling processes taking place in
the accreted neutron star (NS) crust. Within the past few years it has become
apparent that electron-capture/beta-decay (urca) cycles can operate within the
NS crust at high temperatures. Layers of nuclei undergoing urca cycling can
create a thermal barrier, or Great Wall, between heating occurring deep in the
crust and the regions above the urca layers. This paper briefly reviews the
urca process and the implications for observables from accreting neutron stars.
| astro-ph.HE | accreting neutron stars host a number of astronomical observables which can be used to infer the properties of the underlying dense matter these observables are sensitive to the heating and cooling processes taking place in the accreted neutron star ns crust within the past few years it has become apparent that electroncapturebetadecay urca cycles can operate within the ns crust at high temperatures layers of nuclei undergoing urca cycling can create a thermal barrier or great wall between heating occurring deep in the crust and the regions above the urca layers this paper briefly reviews the urca process and the implications for observables from accreting neutron stars | [['accreting', 'neutron', 'stars', 'host', 'a', 'number', 'of', 'astronomical', 'observables', 'which', 'can', 'be', 'used', 'to', 'infer', 'the', 'properties', 'of', 'the', 'underlying', 'dense', 'matter', 'these', 'observables', 'are', 'sensitive', 'to', 'the', 'heating', 'and', 'cooling', 'processes', 'taking', 'place', 'in', 'the', 'accreted', 'neutron', 'star', 'ns', 'crust', 'within', 'the', 'past', 'few', 'years', 'it', 'has', 'become', 'apparent', 'that', 'electroncapturebetadecay', 'urca', 'cycles', 'can', 'operate', 'within', 'the', 'ns', 'crust', 'at', 'high', 'temperatures', 'layers', 'of', 'nuclei', 'undergoing', 'urca', 'cycling', 'can', 'create', 'a', 'thermal', 'barrier', 'or', 'great', 'wall', 'between', 'heating', 'occurring', 'deep', 'in', 'the', 'crust', 'and', 'the', 'regions', 'above', 'the', 'urca', 'layers', 'this', 'paper', 'briefly', 'reviews', 'the', 'urca', 'process', 'and', 'the', 'implications', 'for', 'observables', 'from', 'accreting', 'neutron', 'stars']] | [-0.04251939958435887, 0.28078742000660945, -0.08182510956111452, 0.11336193410940877, -0.10204853061235176, -0.028639378254565428, 0.10174517391825025, 0.35198425230974295, -0.2664855316913915, -0.3356710123425385, 0.07230676715108478, -0.27417691724093735, 0.034331110541111313, 0.20674717889105865, 0.016519746378521032, -0.041633239406916614, 0.11002285667378807, 0.011218349279655706, -0.09960551898408118, -0.21010162162414384, 0.29223772732294956, 0.08013366176587539, 0.17588236370071206, 0.04709711305375369, 0.025195489358596224, -0.10847620579264707, 0.002700833186401792, -0.07059283580912172, -0.14518932879822524, -0.0009363609243114039, 0.3016711620543644, 0.09725308774109438, 0.16728708565340572, -0.5492511661723256, -0.2944466329834815, 0.12941236750284246, 0.15855991896154042, 0.059147095069385855, -0.07297868998984824, -0.21182340602302607, 0.03157003121099101, -0.25988173614835963, -0.09318101608176839, -0.027140666626367438, 0.04443504338873164, 0.040533532032672806, -0.23341719704275987, 0.09786874814319231, 0.08857101492829761, -0.043875797787892086, -0.10497977270608556, -0.11278142649592515, -0.035503092619485026, 0.06984179840150799, 0.07354838906689591, 0.024669600747314828, 0.28828774729111, -0.17348937148871868, 0.011650636243054046, 0.36741821539263186, -0.003937430104311064, -0.009370525420274375, 0.22553351157309734, -0.21645459484414392, -0.14973373437862633, 0.1564582009175968, 0.1736379353118674, 0.16306898626059574, -0.18242486847459144, -0.017490007705384655, 0.029638417750456423, 0.13725182329159547, 0.12665334249899354, 0.040405989147916016, 0.39953685692898083, 0.2688788801897317, -0.05226495373282441, 0.07279118537828151, -0.20980431907370967, -0.06598900667971598, -0.2475153739731056, -0.07372790991706457, -0.07737998021294293, 0.07944553513694906, -0.08699296659063482, -0.11327512814434913, 0.29176513731637793, 0.13103332042360222, 0.14410688627054388, -0.07487742881233506, 0.28251552878756003, 0.09876770317062454, 0.1240326436412222, 0.1376309904252302, 0.34445097323239093, 0.2577143865286039, 0.12486117517681054, -0.27201876027360206, 0.13124167293591318, 0.007678410192108098] |
1,802.06755 | The Color Glass Condensate formalism, Balitsky-JIMWLK evolution and
Lipatov's high energy effective action | We investigate the question whether Lipatov's high energy effective action is
capable to reproduce quark and gluon propagators which resum interaction with a
strong background field within high energy factorization. Such propagators are
frequently employed in calculations within the Color Glass Condensate
formalism, in particular when considering scattering of a dilute projectile on
a dense target nucleus or nucleon. We find that such propagators can be
obtained from the high energy effective action, if a special parametrization of
the gluonic field is used, first proposed by Lipatov in the original
publication on the high energy effective action. The obtained propagators are
used to rederive from the high energy effective action the leading order
Balitsky-JIMWLK evolution equation in covariant gauge. As an aside, our result
confirms the definition of the reggeized gluon as the logarithm of an adjoint
Wilson lines, proposed in the literature.
| hep-ph | we investigate the question whether lipatovs high energy effective action is capable to reproduce quark and gluon propagators which resum interaction with a strong background field within high energy factorization such propagators are frequently employed in calculations within the color glass condensate formalism in particular when considering scattering of a dilute projectile on a dense target nucleus or nucleon we find that such propagators can be obtained from the high energy effective action if a special parametrization of the gluonic field is used first proposed by lipatov in the original publication on the high energy effective action the obtained propagators are used to rederive from the high energy effective action the leading order balitskyjimwlk evolution equation in covariant gauge as an aside our result confirms the definition of the reggeized gluon as the logarithm of an adjoint wilson lines proposed in the literature | [['we', 'investigate', 'the', 'question', 'whether', 'lipatovs', 'high', 'energy', 'effective', 'action', 'is', 'capable', 'to', 'reproduce', 'quark', 'and', 'gluon', 'propagators', 'which', 'resum', 'interaction', 'with', 'a', 'strong', 'background', 'field', 'within', 'high', 'energy', 'factorization', 'such', 'propagators', 'are', 'frequently', 'employed', 'in', 'calculations', 'within', 'the', 'color', 'glass', 'condensate', 'formalism', 'in', 'particular', 'when', 'considering', 'scattering', 'of', 'a', 'dilute', 'projectile', 'on', 'a', 'dense', 'target', 'nucleus', 'or', 'nucleon', 'we', 'find', 'that', 'such', 'propagators', 'can', 'be', 'obtained', 'from', 'the', 'high', 'energy', 'effective', 'action', 'if', 'a', 'special', 'parametrization', 'of', 'the', 'gluonic', 'field', 'is', 'used', 'first', 'proposed', 'by', 'lipatov', 'in', 'the', 'original', 'publication', 'on', 'the', 'high', 'energy', 'effective', 'action', 'the', 'obtained', 'propagators', 'are', 'used', 'to', 'rederive', 'from', 'the', 'high', 'energy', 'effective', 'action', 'the', 'leading', 'order', 'balitskyjimwlk', 'evolution', 'equation', 'in', 'covariant', 'gauge', 'as', 'an', 'aside', 'our', 'result', 'confirms', 'the', 'definition', 'of', 'the', 'reggeized', 'gluon', 'as', 'the', 'logarithm', 'of', 'an', 'adjoint', 'wilson', 'lines', 'proposed', 'in', 'the', 'literature']] | [-0.058229159540985224, 0.18429542496540727, -0.1353243547035837, 0.137416704233827, -0.04869277132968125, -0.052239978904152044, -0.0017762159003869636, 0.353475670545147, -0.17505799635098532, -0.29044773494352594, -0.002411737771854586, -0.2624876407232344, -0.08022826267032879, 0.08610148973749963, -0.010131442056434762, 0.045652310780764045, 0.04815445853709862, 0.08807421314295616, -0.055522257141391196, -0.21438717464200005, 0.3507107527262264, 0.05822491287611998, 0.2699928739844085, 0.1449191625388457, 0.12209091925264134, 0.07436798517331741, -0.027630354326635184, -0.01586466537254465, -0.07520237158833543, 0.0686751660285192, 0.237067531841527, 0.027071090056919135, 0.174591290173479, -0.40237767007071656, -0.2117220930725831, 0.03864928807776708, 0.16972789945654, 0.13912013143388932, -0.022138598884644728, -0.25417701735232884, 0.04319228801120828, -0.22585965420927046, -0.17041524403998823, -0.13146284752577492, -0.0097769356277361, -0.01819524876252338, -0.2966328017556897, 0.055891072321390095, -0.044758388609788216, 0.004661133963404259, -0.06710446554633391, -0.14110215874128304, -0.032689542211657326, 0.10168291385211474, 0.08810219621298822, 0.11899766245029762, 0.13692366331490083, -0.22844417839330602, -0.075797126087748, 0.42061431811458166, -0.11624524138389168, -0.19356945776413162, 0.1450343947023987, -0.14775793824729125, -0.12270563461661495, 0.1536197515720582, 0.13591383234760562, 0.14514862360405065, -0.18828047193162276, 0.13321869889350765, -0.033048685698711375, 0.12769622009872764, 0.10176352170211347, 0.04449786895957704, 0.17700792343023566, 0.12741370994224818, -0.024729241297899426, 0.11825413152150537, -0.027776709044599657, -0.11666646317116447, -0.3500892052466011, -0.07797549708917435, -0.1640952663183525, 0.06349377995649991, -0.13374003910260532, -0.13997088936059834, 0.37257792404364354, 0.140681795414433, 0.18293594402892815, -0.00010308236375425037, 0.2991693592597763, 0.1810302301888009, 0.10153914084845268, 0.09288517470386895, 0.2510821107722871, 0.167693164351012, 0.09266274733309328, -0.28025648194866687, -0.0441987208461949, 0.15180548325578286] |
1,802.06756 | Sun-Sized Water Vapor Masers in Cepheus A | We present the first VLBI observations of a Galactic water maser (in Chepeus
A) made with a very long baseline interferometric array involving the
RadioAstron Earth-orbiting satellite station as one of its elements. We
detected two distinct components at -16.9 and 0.6 km/s with a fringe spacing of
66 microarcseconds. In total power, the 0.6 km/s component appears to be a
single Gaussian component of strength 580 Jy and width of 0.7 km/s.
Single-telescope monitoring showed that its lifetime was only 8~months. The
absence of a Zeeman pattern implies the longitudinal magnetic field component
is weaker than 120 mG. The space-Earth cross power spectrum shows two
unresolved components smaller than 15 microarcseconds, corresponding to a
linear scale of 1.6 x 10^11 cm, about the diameter of the Sun, for a distance
of 700 pc, separated by 0.54 km/s in velocity and by 160 +/-35 microarcseconds
in angle. This is the smallest angular structure ever observed in a Galactic
maser. The brightness temperatures are greater than 2 x 10^14K, and the line
widths are 0.5 km/s. Most of the flux (about 87%) is contained in a halo of
angular size of 400 +/- 150 microarcseconds. This structure is associated with
the compact HII region HW3diii. We have probably picked up the most prominent
peaks in the angular size range of our interferometer. We discuss three
dynamical models: (1) Keplerian motion around a central object, (2) two chance
overlapping clouds, and (3) vortices caused by flow around an obstacle (i.e.,
von Karman vortex street) with Strouhal number of about~0.3.
| astro-ph.GA | we present the first vlbi observations of a galactic water maser in chepeus a made with a very long baseline interferometric array involving the radioastron earthorbiting satellite station as one of its elements we detected two distinct components at 169 and 06 kms with a fringe spacing of 66 microarcseconds in total power the 06 kms component appears to be a single gaussian component of strength 580 jy and width of 07 kms singletelescope monitoring showed that its lifetime was only 8months the absence of a zeeman pattern implies the longitudinal magnetic field component is weaker than 120 mg the spaceearth cross power spectrum shows two unresolved components smaller than 15 microarcseconds corresponding to a linear scale of 16 x 1011 cm about the diameter of the sun for a distance of 700 pc separated by 054 kms in velocity and by 160 35 microarcseconds in angle this is the smallest angular structure ever observed in a galactic maser the brightness temperatures are greater than 2 x 1014k and the line widths are 05 kms most of the flux about 87 is contained in a halo of angular size of 400 150 microarcseconds this structure is associated with the compact hii region hw3diii we have probably picked up the most prominent peaks in the angular size range of our interferometer we discuss three dynamical models 1 keplerian motion around a central object 2 two chance overlapping clouds and 3 vortices caused by flow around an obstacle ie von karman vortex street with strouhal number of about03 | [['we', 'present', 'the', 'first', 'vlbi', 'observations', 'of', 'a', 'galactic', 'water', 'maser', 'in', 'chepeus', 'a', 'made', 'with', 'a', 'very', 'long', 'baseline', 'interferometric', 'array', 'involving', 'the', 'radioastron', 'earthorbiting', 'satellite', 'station', 'as', 'one', 'of', 'its', 'elements', 'we', 'detected', 'two', 'distinct', 'components', 'at', '169', 'and', '06', 'kms', 'with', 'a', 'fringe', 'spacing', 'of', '66', 'microarcseconds', 'in', 'total', 'power', 'the', '06', 'kms', 'component', 'appears', 'to', 'be', 'a', 'single', 'gaussian', 'component', 'of', 'strength', '580', 'jy', 'and', 'width', 'of', '07', 'kms', 'singletelescope', 'monitoring', 'showed', 'that', 'its', 'lifetime', 'was', 'only', '8months', 'the', 'absence', 'of', 'a', 'zeeman', 'pattern', 'implies', 'the', 'longitudinal', 'magnetic', 'field', 'component', 'is', 'weaker', 'than', '120', 'mg', 'the', 'spaceearth', 'cross', 'power', 'spectrum', 'shows', 'two', 'unresolved', 'components', 'smaller', 'than', '15', 'microarcseconds', 'corresponding', 'to', 'a', 'linear', 'scale', 'of', '16', 'x', '1011', 'cm', 'about', 'the', 'diameter', 'of', 'the', 'sun', 'for', 'a', 'distance', 'of', '700', 'pc', 'separated', 'by', '054', 'kms', 'in', 'velocity', 'and', 'by', '160', '35', 'microarcseconds', 'in', 'angle', 'this', 'is', 'the', 'smallest', 'angular', 'structure', 'ever', 'observed', 'in', 'a', 'galactic', 'maser', 'the', 'brightness', 'temperatures', 'are', 'greater', 'than', '2', 'x', '1014k', 'and', 'the', 'line', 'widths', 'are', '05', 'kms', 'most', 'of', 'the', 'flux', 'about', '87', 'is', 'contained', 'in', 'a', 'halo', 'of', 'angular', 'size', 'of', '400', '150', 'microarcseconds', 'this', 'structure', 'is', 'associated', 'with', 'the', 'compact', 'hii', 'region', 'hw3diii', 'we', 'have', 'probably', 'picked', 'up', 'the', 'most', 'prominent', 'peaks', 'in', 'the', 'angular', 'size', 'range', 'of', 'our', 'interferometer', 'we', 'discuss', 'three', 'dynamical', 'models', '1', 'keplerian', 'motion', 'around', 'a', 'central', 'object', '2', 'two', 'chance', 'overlapping', 'clouds', 'and', '3', 'vortices', 'caused', 'by', 'flow', 'around', 'an', 'obstacle', 'ie', 'von', 'karman', 'vortex', 'street', 'with', 'strouhal', 'number', 'of', 'about03']] | [-0.15908432780464452, 0.1587056678848409, -0.012070480083679851, 0.02294572615004386, -0.04411299729467447, -0.0915156509073273, 0.02004170826398786, 0.40452980591481424, -0.19020067120946765, -0.3787037481394303, 0.07713094463800794, -0.29605813704447753, 0.03526886903580679, 0.19242569532169335, -0.0036353102865011107, -0.02515375766712074, 0.0538724033130459, 0.010997619168912672, -0.05724754517311713, -0.16813116728126876, 0.24277367846357573, 0.06720692822542709, 0.18910855775238924, 0.002512757111696964, 0.1124503690428453, -0.10515998113173175, -0.04673361256570217, 0.01853496209900099, -0.10721845359860227, 0.07319519072177401, 0.21329342267463325, 0.06635343077855993, 0.24875130527931083, -0.3135676735908209, -0.16839263223035567, 0.047577027674853445, 0.15023281299615784, 0.02378157761033283, 0.0408494123971958, -0.2802012434078054, 0.11096133725008968, -0.17599978736802135, -0.20804286159879243, 0.10371708734520105, 0.11104981520767898, -0.0028579592912558066, -0.1936312908048378, 0.14137709217537492, 0.03336073210603461, 0.1527547511815713, -0.0564851351082325, -0.16209363239257044, -0.02872863324846983, 0.03554461945490207, -0.010813109797473804, 0.10760009695081953, 0.16461429893376817, -0.09103229786436337, -0.05354320296954616, 0.3979023969259143, -0.08589726816476703, -0.05658230246360083, 0.16178736380446124, -0.2374612723924294, -0.10162882114652974, 0.2352609186659593, 0.12636880243226767, 0.09610241702368179, -0.09839532280988264, -0.03883797057882968, -0.039492675299900935, 0.2753884285703242, 0.14150843854188414, 0.04709913152125311, 0.26616332189465663, 0.13974681864418387, 0.09603573713191661, 0.08781515062736547, -0.30754536573252866, -0.045485198830321164, -0.25076537560745776, -0.09491829935749306, -0.1324537199137146, 0.10549062398815179, -0.1534642950495203, -0.06507818589350617, 0.38453606526141026, 0.10812334938694754, 0.2585532071691079, 0.02620234203420995, 0.28756796612600943, 0.055873015106087956, 0.10243833028485042, 0.1353096616458133, 0.2944254437554257, 0.20202752199317087, 0.11136901153036323, -0.1838167121400129, 0.0019820828957342177, -0.02715040532411985] |
1,802.06757 | Deep Inference of Personality Traits by Integrating Image and Word Use
in Social Networks | Social media, as a major platform for communication and information exchange,
is a rich repository of the opinions and sentiments of 2.3 billion users about
a vast spectrum of topics. To sense the whys of certain social user's demands
and cultural-driven interests, however, the knowledge embedded in the 1.8
billion pictures which are uploaded daily in public profiles has just started
to be exploited since this process has been typically been text-based.
Following this trend on visual-based social analysis, we present a novel
methodology based on Deep Learning to build a combined image-and-text based
personality trait model, trained with images posted together with words found
highly correlated to specific personality traits. So the key contribution here
is to explore whether OCEAN personality trait modeling can be addressed based
on images, here called \emph{Mind{P}ics}, appearing with certain tags with
psychological insights. We found that there is a correlation between those
posted images and their accompanying texts, which can be successfully modeled
using deep neural networks for personality estimation. The experimental results
are consistent with previous cyber-psychology results based on texts or images.
In addition, classification results on some traits show that some patterns
emerge in the set of images corresponding to a specific text, in essence to
those representing an abstract concept. These results open new avenues of
research for further refining the proposed personality model under the
supervision of psychology experts.
| cs.CY cs.CL cs.CV | social media as a major platform for communication and information exchange is a rich repository of the opinions and sentiments of 23 billion users about a vast spectrum of topics to sense the whys of certain social users demands and culturaldriven interests however the knowledge embedded in the 18 billion pictures which are uploaded daily in public profiles has just started to be exploited since this process has been typically been textbased following this trend on visualbased social analysis we present a novel methodology based on deep learning to build a combined imageandtext based personality trait model trained with images posted together with words found highly correlated to specific personality traits so the key contribution here is to explore whether ocean personality trait modeling can be addressed based on images here called emphmindpics appearing with certain tags with psychological insights we found that there is a correlation between those posted images and their accompanying texts which can be successfully modeled using deep neural networks for personality estimation the experimental results are consistent with previous cyberpsychology results based on texts or images in addition classification results on some traits show that some patterns emerge in the set of images corresponding to a specific text in essence to those representing an abstract concept these results open new avenues of research for further refining the proposed personality model under the supervision of psychology experts | [['social', 'media', 'as', 'a', 'major', 'platform', 'for', 'communication', 'and', 'information', 'exchange', 'is', 'a', 'rich', 'repository', 'of', 'the', 'opinions', 'and', 'sentiments', 'of', '23', 'billion', 'users', 'about', 'a', 'vast', 'spectrum', 'of', 'topics', 'to', 'sense', 'the', 'whys', 'of', 'certain', 'social', 'users', 'demands', 'and', 'culturaldriven', 'interests', 'however', 'the', 'knowledge', 'embedded', 'in', 'the', '18', 'billion', 'pictures', 'which', 'are', 'uploaded', 'daily', 'in', 'public', 'profiles', 'has', 'just', 'started', 'to', 'be', 'exploited', 'since', 'this', 'process', 'has', 'been', 'typically', 'been', 'textbased', 'following', 'this', 'trend', 'on', 'visualbased', 'social', 'analysis', 'we', 'present', 'a', 'novel', 'methodology', 'based', 'on', 'deep', 'learning', 'to', 'build', 'a', 'combined', 'imageandtext', 'based', 'personality', 'trait', 'model', 'trained', 'with', 'images', 'posted', 'together', 'with', 'words', 'found', 'highly', 'correlated', 'to', 'specific', 'personality', 'traits', 'so', 'the', 'key', 'contribution', 'here', 'is', 'to', 'explore', 'whether', 'ocean', 'personality', 'trait', 'modeling', 'can', 'be', 'addressed', 'based', 'on', 'images', 'here', 'called', 'emphmindpics', 'appearing', 'with', 'certain', 'tags', 'with', 'psychological', 'insights', 'we', 'found', 'that', 'there', 'is', 'a', 'correlation', 'between', 'those', 'posted', 'images', 'and', 'their', 'accompanying', 'texts', 'which', 'can', 'be', 'successfully', 'modeled', 'using', 'deep', 'neural', 'networks', 'for', 'personality', 'estimation', 'the', 'experimental', 'results', 'are', 'consistent', 'with', 'previous', 'cyberpsychology', 'results', 'based', 'on', 'texts', 'or', 'images', 'in', 'addition', 'classification', 'results', 'on', 'some', 'traits', 'show', 'that', 'some', 'patterns', 'emerge', 'in', 'the', 'set', 'of', 'images', 'corresponding', 'to', 'a', 'specific', 'text', 'in', 'essence', 'to', 'those', 'representing', 'an', 'abstract', 'concept', 'these', 'results', 'open', 'new', 'avenues', 'of', 'research', 'for', 'further', 'refining', 'the', 'proposed', 'personality', 'model', 'under', 'the', 'supervision', 'of', 'psychology', 'experts']] | [-0.04661475334497013, 0.04189743314792006, -0.08674605691237253, 0.08624873916691253, -0.16539977547314658, -0.16947347012713618, 0.05586932215732953, 0.44218067042652665, -0.2497230844360895, -0.3436213621709676, 0.08338061781007271, -0.33100166790482755, -0.20339792431947581, 0.19463175548510298, -0.11477460646960835, 0.017429546836665154, 0.0806121750324985, 0.08079087783250187, 0.010452216288017412, -0.3051837303445958, 0.32942850841004157, 0.031563475340069376, 0.3309537638717286, 0.05092887361180078, 0.06738769349802105, -0.04484140855108392, -0.09252388982537166, 0.016795784294490378, -0.0944771984234244, 0.2010272566725537, 0.334815172731901, 0.21023267583043564, 0.3530747974122206, -0.41892290539990307, -0.23372633010149002, 0.050596155962672924, 0.13972273820781433, 0.09020888360344399, -0.0706758913866117, -0.38798994768312456, 0.0740225330469022, -0.15424585566211838, -0.01941224836871553, -0.0840501170605421, 0.00912660341155982, 0.009264370715266118, -0.2224808873717431, 0.03069037801815845, 0.033308253690214736, 0.1435045753010766, -0.0534517567631448, -0.10985933121761496, -0.0007829000231797606, 0.20750639101363194, 0.08167829426887059, 0.023618744892921577, 0.13791353517470448, -0.1749563844431405, -0.15420539126785818, 0.38117734305068257, -0.042182759553120196, -0.17381847533602512, 0.20587559157186536, -0.07112995907254024, -0.1647401135968709, 0.07385659737857099, 0.22240617281207528, 0.06351296302948622, -0.22368317268509827, -0.03151840307377484, -0.09234481299960666, 0.22768112689016656, 0.04899554616886515, 0.00917124695355885, 0.21560769774776675, 0.1984348686756607, -0.028896859711618674, 0.08048944435408543, -0.054125476385454445, -0.0767284200859096, -0.1818510923198207, -0.10661434204038643, -0.15412246833333854, 0.039569675251082535, -0.06110354312177592, -0.1321189733835487, 0.4006087205778922, 0.20613826881355138, 0.18646866465315617, 0.04322260930736258, 0.24534354850009807, 0.011023834266503432, 0.10155795138874932, 0.06022696512072277, 0.14195820813847804, 0.02377115379575853, 0.17294712918954142, -0.09810171028320157, 0.1369660352310576, 0.004807322668650142] |
1,802.06758 | Role of quantum coherence in the thermodynamics of energy transfer | Recent research on the thermodynamic arrow of time, at the microscopic scale,
has questioned the universality of its direction. Theoretical studies showed
that quantum correlations can be used to revert the natural heat flow (from the
hot body to the cold one), posing an apparent challenge to the second law of
thermodynamics. Such an "anomalous" heat current was observed in a recent
experiment (arXiv:1711.03323), by employing two spin systems initially quantum
correlated. Nevertheless, the precise relationship between this intriguing
phenomenon and the initial conditions that allow it is not fully evident. Here,
we address energy transfer in a wider perspective, identifying a nonclassical
contribution that applies to the reversion of the heat flow as well as to more
general forms of energy exchange. We derive three theorems that describe the
energy transfer between two microscopic systems, for arbitrary initial
bipartite states. Using these theorems, we obtain an analytical bound showing
that certain type of quantum coherence can optimize such a process,
outperforming incoherent states. This genuine quantum advantage is corroborated
through a characterization of the energy transfer between two qubits. For this
system, it is shown that a large enough amount of coherence is necessary and
sufficient to revert the thermodynamic arrow of time. As a second crucial
consequence of the presented theorems, we introduce a class of nonequilibrium
states that only allow unidirectional energy flow. In this way, we broaden the
set where the standard Clausius statement of the second law applies.
| quant-ph | recent research on the thermodynamic arrow of time at the microscopic scale has questioned the universality of its direction theoretical studies showed that quantum correlations can be used to revert the natural heat flow from the hot body to the cold one posing an apparent challenge to the second law of thermodynamics such an anomalous heat current was observed in a recent experiment arxiv171103323 by employing two spin systems initially quantum correlated nevertheless the precise relationship between this intriguing phenomenon and the initial conditions that allow it is not fully evident here we address energy transfer in a wider perspective identifying a nonclassical contribution that applies to the reversion of the heat flow as well as to more general forms of energy exchange we derive three theorems that describe the energy transfer between two microscopic systems for arbitrary initial bipartite states using these theorems we obtain an analytical bound showing that certain type of quantum coherence can optimize such a process outperforming incoherent states this genuine quantum advantage is corroborated through a characterization of the energy transfer between two qubits for this system it is shown that a large enough amount of coherence is necessary and sufficient to revert the thermodynamic arrow of time as a second crucial consequence of the presented theorems we introduce a class of nonequilibrium states that only allow unidirectional energy flow in this way we broaden the set where the standard clausius statement of the second law applies | [['recent', 'research', 'on', 'the', 'thermodynamic', 'arrow', 'of', 'time', 'at', 'the', 'microscopic', 'scale', 'has', 'questioned', 'the', 'universality', 'of', 'its', 'direction', 'theoretical', 'studies', 'showed', 'that', 'quantum', 'correlations', 'can', 'be', 'used', 'to', 'revert', 'the', 'natural', 'heat', 'flow', 'from', 'the', 'hot', 'body', 'to', 'the', 'cold', 'one', 'posing', 'an', 'apparent', 'challenge', 'to', 'the', 'second', 'law', 'of', 'thermodynamics', 'such', 'an', 'anomalous', 'heat', 'current', 'was', 'observed', 'in', 'a', 'recent', 'experiment', 'arxiv171103323', 'by', 'employing', 'two', 'spin', 'systems', 'initially', 'quantum', 'correlated', 'nevertheless', 'the', 'precise', 'relationship', 'between', 'this', 'intriguing', 'phenomenon', 'and', 'the', 'initial', 'conditions', 'that', 'allow', 'it', 'is', 'not', 'fully', 'evident', 'here', 'we', 'address', 'energy', 'transfer', 'in', 'a', 'wider', 'perspective', 'identifying', 'a', 'nonclassical', 'contribution', 'that', 'applies', 'to', 'the', 'reversion', 'of', 'the', 'heat', 'flow', 'as', 'well', 'as', 'to', 'more', 'general', 'forms', 'of', 'energy', 'exchange', 'we', 'derive', 'three', 'theorems', 'that', 'describe', 'the', 'energy', 'transfer', 'between', 'two', 'microscopic', 'systems', 'for', 'arbitrary', 'initial', 'bipartite', 'states', 'using', 'these', 'theorems', 'we', 'obtain', 'an', 'analytical', 'bound', 'showing', 'that', 'certain', 'type', 'of', 'quantum', 'coherence', 'can', 'optimize', 'such', 'a', 'process', 'outperforming', 'incoherent', 'states', 'this', 'genuine', 'quantum', 'advantage', 'is', 'corroborated', 'through', 'a', 'characterization', 'of', 'the', 'energy', 'transfer', 'between', 'two', 'qubits', 'for', 'this', 'system', 'it', 'is', 'shown', 'that', 'a', 'large', 'enough', 'amount', 'of', 'coherence', 'is', 'necessary', 'and', 'sufficient', 'to', 'revert', 'the', 'thermodynamic', 'arrow', 'of', 'time', 'as', 'a', 'second', 'crucial', 'consequence', 'of', 'the', 'presented', 'theorems', 'we', 'introduce', 'a', 'class', 'of', 'nonequilibrium', 'states', 'that', 'only', 'allow', 'unidirectional', 'energy', 'flow', 'in', 'this', 'way', 'we', 'broaden', 'the', 'set', 'where', 'the', 'standard', 'clausius', 'statement', 'of', 'the', 'second', 'law', 'applies']] | [-0.11894241076882558, 0.14975243172008681, -0.11237927393897336, 0.09134447097917736, -0.04373729566192978, -0.1384977492155538, 0.051000300544691235, 0.3270943912692861, -0.2878024601387168, -0.28886159946988066, 0.06600905797677115, -0.2597911880824961, -0.12089214688513336, 0.22122344485203127, -0.03620267960566196, 0.0694004948929718, 0.044156112736052536, 0.03743191434489948, -0.04555443916765661, -0.19072061380340663, 0.3255729532049207, 0.038030112837272895, 0.2979726653020783, 0.11203742272428367, 0.09767457742959815, -0.009170969811552935, 0.014517861321252917, 0.032115210267168674, -0.13492956241815374, 0.11982436903510897, 0.2517892346131252, 0.10167777461908019, 0.2593670389961359, -0.4377113047329139, -0.2320852102621599, 0.11837284205373654, 0.10206575319748218, 0.1505809769877194, -0.04686166633485503, -0.23613251804966817, 0.04169616231132945, -0.17394679868670782, -0.13829215451755583, -0.10031961751639966, 0.026894898456906177, -0.013450536159182753, -0.2293625093560208, 0.12140131567235389, 0.12482178435624339, 0.02931785549966557, -0.05261851109762499, -0.04338080880967207, 0.0038982760488278857, 0.15786140022052775, 0.02003753938784819, 0.0011434648421685372, 0.10805355615467449, -0.11346158954364917, -0.12312240270351267, 0.3583496996530616, -0.050947134431609344, -0.16668830355314834, 0.20312035548614246, -0.13596120531562994, -0.13103170611333748, 0.08572278972060904, 0.12420767484173133, 0.10514753340188585, -0.17250767794595492, 0.033804788237364485, -0.04864978602864156, 0.1618912174175917, 0.04163622493135997, 0.06213534031037341, 0.2206242372174093, 0.1500148427199326, 0.07722233478576407, 0.17759253480615989, -0.05554655868240655, -0.15310333573359472, -0.3214039755696508, -0.1944788962880184, -0.21913081028595882, 0.11375459135431375, -0.05046487126241088, -0.13002712634420466, 0.3796857451781446, 0.16891454730215597, 0.18863057079801937, 0.024913677242430588, 0.2778882324216456, 0.134075385009957, 0.04953713126842333, 0.06604256585994658, 0.256812470183854, 0.15680349930401213, 0.14245787236169904, -0.23970252935510525, 0.07500083820243975, 0.03353719232115156] |
1,802.06759 | Network Lifetime Maximization for Cellular-Based M2M Networks | High energy efficiency is critical for enabling massive machine-type
communications (MTC) over cellular networks. This work is devoted to energy
consumption modeling, battery lifetime analysis, lifetime-aware scheduling and
transmit power control for massive MTC over cellular networks. We consider a
realistic energy consumption model for MTC and model network battery-lifetime.
Analytic expressions are derived to demonstrate the impact of scheduling on
both the individual and network battery lifetimes. The derived expressions are
subsequently employed in the uplink scheduling and transmit power control for
mixed-priority MTC traffic in order to maximize the network lifetime. Besides
the main solutions, low-complexity solutions with limited feedback requirement
are investigated, and the results are extended to existing LTE networks. Also,
the energy efficiency, spectral efficiency, and network lifetime tradeoffs in
resource provisioning and scheduling for MTC over cellular networks are
investigated. The simulation results show that the proposed solutions can
provide substantial network lifetime improvement and network maintenance cost
reduction
| cs.IT math.IT | high energy efficiency is critical for enabling massive machinetype communications mtc over cellular networks this work is devoted to energy consumption modeling battery lifetime analysis lifetimeaware scheduling and transmit power control for massive mtc over cellular networks we consider a realistic energy consumption model for mtc and model network batterylifetime analytic expressions are derived to demonstrate the impact of scheduling on both the individual and network battery lifetimes the derived expressions are subsequently employed in the uplink scheduling and transmit power control for mixedpriority mtc traffic in order to maximize the network lifetime besides the main solutions lowcomplexity solutions with limited feedback requirement are investigated and the results are extended to existing lte networks also the energy efficiency spectral efficiency and network lifetime tradeoffs in resource provisioning and scheduling for mtc over cellular networks are investigated the simulation results show that the proposed solutions can provide substantial network lifetime improvement and network maintenance cost reduction | [['high', 'energy', 'efficiency', 'is', 'critical', 'for', 'enabling', 'massive', 'machinetype', 'communications', 'mtc', 'over', 'cellular', 'networks', 'this', 'work', 'is', 'devoted', 'to', 'energy', 'consumption', 'modeling', 'battery', 'lifetime', 'analysis', 'lifetimeaware', 'scheduling', 'and', 'transmit', 'power', 'control', 'for', 'massive', 'mtc', 'over', 'cellular', 'networks', 'we', 'consider', 'a', 'realistic', 'energy', 'consumption', 'model', 'for', 'mtc', 'and', 'model', 'network', 'batterylifetime', 'analytic', 'expressions', 'are', 'derived', 'to', 'demonstrate', 'the', 'impact', 'of', 'scheduling', 'on', 'both', 'the', 'individual', 'and', 'network', 'battery', 'lifetimes', 'the', 'derived', 'expressions', 'are', 'subsequently', 'employed', 'in', 'the', 'uplink', 'scheduling', 'and', 'transmit', 'power', 'control', 'for', 'mixedpriority', 'mtc', 'traffic', 'in', 'order', 'to', 'maximize', 'the', 'network', 'lifetime', 'besides', 'the', 'main', 'solutions', 'lowcomplexity', 'solutions', 'with', 'limited', 'feedback', 'requirement', 'are', 'investigated', 'and', 'the', 'results', 'are', 'extended', 'to', 'existing', 'lte', 'networks', 'also', 'the', 'energy', 'efficiency', 'spectral', 'efficiency', 'and', 'network', 'lifetime', 'tradeoffs', 'in', 'resource', 'provisioning', 'and', 'scheduling', 'for', 'mtc', 'over', 'cellular', 'networks', 'are', 'investigated', 'the', 'simulation', 'results', 'show', 'that', 'the', 'proposed', 'solutions', 'can', 'provide', 'substantial', 'network', 'lifetime', 'improvement', 'and', 'network', 'maintenance', 'cost', 'reduction']] | [-0.2545825363155089, -0.01868369067513865, 0.0568956985241837, 0.04120561251419846, -0.03739916329162524, -0.1973102307586255, 0.1098775574389626, 0.4114181573435762, -0.2358837297484522, -0.3247128652250455, 0.10372102894330264, -0.23152266678649908, -0.1453948094588674, 0.1961879969416247, -0.10441565214735425, 0.09960585516676598, 0.088074732428794, 0.02347821175456321, 0.018786807799806172, -0.2668514997756194, 0.24850826771865947, 0.14895022949629944, 0.43557632242152894, 0.08940376553477512, 0.023767607234832313, -0.03421942665990369, -0.024057916895900335, -0.03683645912869134, -0.11230933977226502, 0.12730493352921934, 0.335922919311165, 0.1876711146875583, 0.2766316272318363, -0.49469639377948504, -0.3343388046369297, 0.13137691538914845, 0.18260519771100162, 0.020456070707368306, -0.03837016504181829, -0.2065464111130222, 0.16683686680382642, -0.2971138312584824, -0.01200823473068429, -0.0711648832699223, -0.02341501893828702, 0.09081494225336939, -0.3102713157331534, 0.005403776216173082, -0.06289549023856476, -0.020264735621905405, -0.13324293558267242, -0.11029472560895716, -0.026789673555374535, 0.17053624490592506, 0.021737358548824547, -0.06925827253068145, 0.1400959795931342, -0.1455879522140558, -0.12394961914987956, 0.3645042765967767, 0.03097615088200637, -0.1953429072803142, 0.1517545278427599, -0.006600662546226255, -0.10548315862242401, 0.1606465817423038, 0.296083737620886, 0.051103735762630026, -0.19621176786379876, 0.016946622791389625, 0.06066983663347653, 0.1497152046379603, 0.02331735493593965, 0.1336188029385251, 0.14399459435653209, 0.3049055758583682, 0.1306625786024371, 0.10461692254247716, -0.08504730936906793, -0.15718409930982816, -0.17625900990408816, -0.12846337099943092, -0.17783512108734037, 0.05354463302429911, -0.09836555292428124, -0.02723794807892999, 0.4024967899472982, 0.13367632293945872, 0.07505185603243268, 0.2022433039957499, 0.41259450005562187, 0.14542798700383286, 0.09317007716258172, 0.16921383952204552, 0.17685499973595142, 0.08341892544762992, 0.22115988326122, -0.25814805893543985, 0.02073685977504485, -0.02539622185453529] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.