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.0186 | Effect of differential cross section in Breit-Wheeler pair beaming | The pair beaming in the Breit-Wheeler (BW) process is investigated. We
examine the effect of the BW differential cross section on pair angular and
energy distributions. Although, this study is relevant for laser induced
intense gamma-ray source collisions experiments, we apply the pair beaming in
astrophysical context, in particular for Active Galactic Nuclei (AGN).
| physics.plasm-ph astro-ph.HE | the pair beaming in the breitwheeler bw process is investigated we examine the effect of the bw differential cross section on pair angular and energy distributions although this study is relevant for laser induced intense gammaray source collisions experiments we apply the pair beaming in astrophysical context in particular for active galactic nuclei agn | [['the', 'pair', 'beaming', 'in', 'the', 'breitwheeler', 'bw', 'process', 'is', 'investigated', 'we', 'examine', 'the', 'effect', 'of', 'the', 'bw', 'differential', 'cross', 'section', 'on', 'pair', 'angular', 'and', 'energy', 'distributions', 'although', 'this', 'study', 'is', 'relevant', 'for', 'laser', 'induced', 'intense', 'gammaray', 'source', 'collisions', 'experiments', 'we', 'apply', 'the', 'pair', 'beaming', 'in', 'astrophysical', 'context', 'in', 'particular', 'for', 'active', 'galactic', 'nuclei', 'agn']] | [-0.09082402943426536, 0.16346590508948322, -0.018226212916757772, 0.219204025583605, -0.07262114729921988, -0.059262952051573885, 0.018887189691196436, 0.4534608425779475, -0.2056062901392579, -0.2641817103398757, -0.06660985066857258, -0.33599553859137277, 0.005029679448516281, 0.24790432352434705, 0.025574305681166826, 0.016777822420139005, 0.08254486839804384, -0.03960845805704594, 0.03947121772432217, -0.16365817368582444, 0.3591459259925479, 0.15366751873106868, 0.23105717933288328, 0.0722454487328866, 0.1019348681697415, 0.07030824404123619, -0.10797892886869333, -0.06006361771788862, -0.14864342861498395, 0.040460292694559835, 0.2482952808323144, 0.06522070736348352, 0.14429440520945247, -0.3359125969172628, -0.21548157700992845, 0.13425394102793048, 0.13573918656308065, 0.07148429039538044, -0.1264399713599468, -0.24675519357400913, 0.028031606528977, -0.24545368538410575, -0.10989117048922237, 0.053552476775453044, 0.08796340551365305, 0.06535649520810694, -0.256405811170461, 0.04832541131569693, 0.05604188495177637, 0.0336808655411005, -0.05249818502407935, -0.06225682800221774, -0.005575633366350774, -0.026882183962260133, 0.08166644712683693, 0.050705653153946276, 0.20718034306817032, -0.11951301586426173, -0.12031113258907916, 0.4249808731040469, -0.031630125207205616, -0.11630443141459385, 0.13477009569329243, -0.22778726165631302, -0.16436594868234047, 0.1465434283880448, 0.29186881178369123, 0.15680652399357684, -0.16926796205721242, 0.06304770884755137, 0.0077291281497174945, 0.12530563182749407, 0.07167054691645144, 0.084301072931676, 0.2292635040185242, 0.17139318400855968, -0.020659171441500937, 0.1409580853112318, -0.24901575744755705, -0.07940218066451726, -0.3479394886073553, -0.09181611079515682, -0.08731659101667227, 0.07887571906515707, -0.020901060921594897, -0.03661554863814403, 0.3452946543003674, 0.07256200173611028, 0.20200084654303888, -0.08549934642872324, 0.3119904514471138, 0.13079274831236237, -0.005627946634949358, 0.056033875051609894, 0.38013109589788924, 0.15380546361363182, 0.06362319485870777, -0.2674748684555568, 0.08663272130717006, 0.039375626758016924] |
1,802.01861 | Generating virtual scenarios of multivariate financial data for
quantitative trading applications | In this paper, we present a novel approach to the generation of virtual
scenarios of multivariate financial data of arbitrary length and composition of
assets. With this approach, decades of realistic time-synchronized data can be
simulated for a large number of assets, producing diverse scenarios to test and
improve quantitative investment strategies. Our approach is based on the
analysis and synthesis of the time-dependent individual and joint
characteristics of real financial time series, using stochastic sequences of
market trends to draw multivariate returns from time-dependent probability
functions preserving both distributional properties of asset returns and
time-dependent correlation among time series. Moreover, new time-synchronized
assets can be arbitrarily generated through a PCA-based procedure to obtain any
number of assets in the final virtual scenario. For the validation of such
simulated data, they are tested with an extensive set of measurements showing a
significant degree of agreement with the reference performance of real
financial series, better than that obtained with other classical and
state-of-the-art approaches.
| q-fin.CP cs.CE eess.SP | in this paper we present a novel approach to the generation of virtual scenarios of multivariate financial data of arbitrary length and composition of assets with this approach decades of realistic timesynchronized data can be simulated for a large number of assets producing diverse scenarios to test and improve quantitative investment strategies our approach is based on the analysis and synthesis of the timedependent individual and joint characteristics of real financial time series using stochastic sequences of market trends to draw multivariate returns from timedependent probability functions preserving both distributional properties of asset returns and timedependent correlation among time series moreover new timesynchronized assets can be arbitrarily generated through a pcabased procedure to obtain any number of assets in the final virtual scenario for the validation of such simulated data they are tested with an extensive set of measurements showing a significant degree of agreement with the reference performance of real financial series better than that obtained with other classical and stateoftheart approaches | [['in', 'this', 'paper', 'we', 'present', 'a', 'novel', 'approach', 'to', 'the', 'generation', 'of', 'virtual', 'scenarios', 'of', 'multivariate', 'financial', 'data', 'of', 'arbitrary', 'length', 'and', 'composition', 'of', 'assets', 'with', 'this', 'approach', 'decades', 'of', 'realistic', 'timesynchronized', 'data', 'can', 'be', 'simulated', 'for', 'a', 'large', 'number', 'of', 'assets', 'producing', 'diverse', 'scenarios', 'to', 'test', 'and', 'improve', 'quantitative', 'investment', 'strategies', 'our', 'approach', 'is', 'based', 'on', 'the', 'analysis', 'and', 'synthesis', 'of', 'the', 'timedependent', 'individual', 'and', 'joint', 'characteristics', 'of', 'real', 'financial', 'time', 'series', 'using', 'stochastic', 'sequences', 'of', 'market', 'trends', 'to', 'draw', 'multivariate', 'returns', 'from', 'timedependent', 'probability', 'functions', 'preserving', 'both', 'distributional', 'properties', 'of', 'asset', 'returns', 'and', 'timedependent', 'correlation', 'among', 'time', 'series', 'moreover', 'new', 'timesynchronized', 'assets', 'can', 'be', 'arbitrarily', 'generated', 'through', 'a', 'pcabased', 'procedure', 'to', 'obtain', 'any', 'number', 'of', 'assets', 'in', 'the', 'final', 'virtual', 'scenario', 'for', 'the', 'validation', 'of', 'such', 'simulated', 'data', 'they', 'are', 'tested', 'with', 'an', 'extensive', 'set', 'of', 'measurements', 'showing', 'a', 'significant', 'degree', 'of', 'agreement', 'with', 'the', 'reference', 'performance', 'of', 'real', 'financial', 'series', 'better', 'than', 'that', 'obtained', 'with', 'other', 'classical', 'and', 'stateoftheart', 'approaches']] | [-0.07574732057418834, 0.029655062671457247, -0.1026880428926345, 0.07613625821866027, -0.04871319921721527, -0.10969781676490158, 0.06810202137095728, 0.39833832379042006, -0.2545372905163951, -0.3327036807606385, 0.11316111568930028, -0.2801623778314861, -0.1355647757660849, 0.27494531181109555, -0.07471592708932168, 0.0939602110194945, 0.09399612606474501, -0.017602912792393174, -0.03292892348704048, -0.29145650998717804, 0.297966999777427, 0.050779727561845005, 0.3023721120817347, -0.013233700320781694, 0.11638063059311268, 0.017553350999608544, -0.10111317238513312, 0.03884389151910469, -0.07624094224374411, 0.1586715212970989, 0.27332586723528346, 0.17823174547266923, 0.3100487865890416, -0.4583411408371172, -0.1859675314380256, 0.13829654894277818, 0.05975993334524979, 0.06875265093714547, -0.028088830729255145, -0.29603381378096216, 0.06807665285680077, -0.19765310635102093, -0.10405785594695459, -0.12470028254609167, 0.020466547883601367, 0.0703492203086009, -0.34005371639876414, 0.0645256582961812, -0.016561435999782995, 0.0861714411972582, -0.0526453985638368, -0.11136569526115078, -0.0053985255136171735, 0.1691091642715037, 0.0987034862206826, -0.0292465190426018, 0.11612577846900851, -0.09381174327208563, -0.1850476069143756, 0.34894758935994896, -0.08520787137182376, -0.1842972779830602, 0.17993168648049532, -0.14082423937535543, -0.12701536904580527, 0.09858610137348618, 0.2265541397950732, 0.07979848619801866, -0.1693566731388675, 0.0281944230914493, -0.05352104515511474, 0.1902330949384022, 0.021864617634793183, 0.010181745646713928, 0.16404019949880594, 0.2011112182863925, 0.04992474820693395, 0.1268357828968673, -0.08227101657568174, -0.12699534192444198, -0.2628148448492109, -0.1383927809417339, -0.19101227349330288, 0.018663708819790622, -0.1647152492594034, -0.1881024346178386, 0.41184012306157064, 0.1777052135343172, 0.17151931674716756, 0.10469635973107412, 0.32588532415041527, 0.10295338374700046, 0.00548400655688798, 0.03811217803633743, 0.13091204859362057, 0.0017028190345543385, 0.10523877671685504, -0.15740059761250494, 0.13451233124960374, -0.01814531093817547] |
1,802.01862 | Ion Transport and Precipitation Kinetics as Key Aspects of Stress
Generation on Pore Walls Induced by Salt Crystallization | The stress generation on pore walls due to the growth of a sodium chloride
crystal in a confined aqueous solution is studied from evaporation experiments
in microfluidic channels in conjunction with numerical computations of crystal
growth. The study indicates that the stress build-up on the pore walls as the
result of the crystal growth is a highly transient process taking place over a
very short period of time (in less than 1s in our experiments). The analysis
makes clear that what matters for the stress generation is not the maximum
supersaturation at the onset of the crystal growth but the supersaturation at
the interface between the solution and the crystal when the latter is about to
be confined between the pore walls. It is shown that the stress generation can
be characterized with a simple stress diagram involving the pore aspect ratio
and the Damkh{\"o}ler number characterizing the competition between the
precipitation reaction kinetics and the ion transport towards the growing
crystal. This opens up the route for a better understanding of the damage of
porous materials induced by salt crystallization, an important issue in earth
sciences, reservoir engineering and civil engineering.
| physics.flu-dyn | the stress generation on pore walls due to the growth of a sodium chloride crystal in a confined aqueous solution is studied from evaporation experiments in microfluidic channels in conjunction with numerical computations of crystal growth the study indicates that the stress buildup on the pore walls as the result of the crystal growth is a highly transient process taking place over a very short period of time in less than 1s in our experiments the analysis makes clear that what matters for the stress generation is not the maximum supersaturation at the onset of the crystal growth but the supersaturation at the interface between the solution and the crystal when the latter is about to be confined between the pore walls it is shown that the stress generation can be characterized with a simple stress diagram involving the pore aspect ratio and the damkholer number characterizing the competition between the precipitation reaction kinetics and the ion transport towards the growing crystal this opens up the route for a better understanding of the damage of porous materials induced by salt crystallization an important issue in earth sciences reservoir engineering and civil engineering | [['the', 'stress', 'generation', 'on', 'pore', 'walls', 'due', 'to', 'the', 'growth', 'of', 'a', 'sodium', 'chloride', 'crystal', 'in', 'a', 'confined', 'aqueous', 'solution', 'is', 'studied', 'from', 'evaporation', 'experiments', 'in', 'microfluidic', 'channels', 'in', 'conjunction', 'with', 'numerical', 'computations', 'of', 'crystal', 'growth', 'the', 'study', 'indicates', 'that', 'the', 'stress', 'buildup', 'on', 'the', 'pore', 'walls', 'as', 'the', 'result', 'of', 'the', 'crystal', 'growth', 'is', 'a', 'highly', 'transient', 'process', 'taking', 'place', 'over', 'a', 'very', 'short', 'period', 'of', 'time', 'in', 'less', 'than', '1s', 'in', 'our', 'experiments', 'the', 'analysis', 'makes', 'clear', 'that', 'what', 'matters', 'for', 'the', 'stress', 'generation', 'is', 'not', 'the', 'maximum', 'supersaturation', 'at', 'the', 'onset', 'of', 'the', 'crystal', 'growth', 'but', 'the', 'supersaturation', 'at', 'the', 'interface', 'between', 'the', 'solution', 'and', 'the', 'crystal', 'when', 'the', 'latter', 'is', 'about', 'to', 'be', 'confined', 'between', 'the', 'pore', 'walls', 'it', 'is', 'shown', 'that', 'the', 'stress', 'generation', 'can', 'be', 'characterized', 'with', 'a', 'simple', 'stress', 'diagram', 'involving', 'the', 'pore', 'aspect', 'ratio', 'and', 'the', 'damkholer', 'number', 'characterizing', 'the', 'competition', 'between', 'the', 'precipitation', 'reaction', 'kinetics', 'and', 'the', 'ion', 'transport', 'towards', 'the', 'growing', 'crystal', 'this', 'opens', 'up', 'the', 'route', 'for', 'a', 'better', 'understanding', 'of', 'the', 'damage', 'of', 'porous', 'materials', 'induced', 'by', 'salt', 'crystallization', 'an', 'important', 'issue', 'in', 'earth', 'sciences', 'reservoir', 'engineering', 'and', 'civil', 'engineering']] | [-0.09249949496524672, 0.20942097372585403, -0.06318421113437056, -0.017608049836057207, -0.01555471798083233, -0.08180497901962767, 0.03657386901408083, 0.36022675030176643, -0.28311269915481685, -0.2963705478023972, 0.1017683390296352, -0.25587725008140605, -0.12803571997758936, 0.18608932481854373, 0.012141232057295892, 0.009064803135225364, 0.041137596721522, -0.02260901854027316, -0.020821171077650958, -0.20041472191985754, 0.24076727317178045, 0.08659956115663675, 0.34877772103624505, 0.1349360614866311, 0.06375757195372427, -0.03460350953023003, 0.030909880451310708, 0.01757566686183292, -0.17587664669938965, 0.09644020716927906, 0.23755557391382948, 0.01396070700382609, 0.2644127806239025, -0.47205257797077377, -0.24281488738329934, 0.051454135995719054, 0.11121947095175981, 0.13511173593865328, -0.09101029679484553, -0.21471283618721584, 0.035614615412921456, -0.11243381014298551, -0.11788221123184599, 0.0062060084578542144, 0.03173956471734256, 0.005649793005051062, -0.2394815952912051, 0.10296081498153117, 0.05366537498105415, 0.07324194023629446, -0.09403992533386339, -0.07096433191373092, -0.05745642197181846, 0.09955680629446327, 0.07401371048561496, 0.01570669779293751, 0.1957725376108325, -0.1690118044477044, -0.044121924768255646, 0.4252624893219683, -0.027315746677484175, -0.14351920059794335, 0.21313567102261385, -0.17619998212562415, -0.05909959959470867, 0.19900357256111986, 0.161290419412928, 0.09029848617867259, -0.13251384180345444, 0.006875529064899261, 0.004100203109388264, 0.19794601070581028, 0.1280761879664012, -0.039875642442831975, 0.22608054988573828, 0.2757436348044884, 0.05749256080211535, 0.17335676893670202, -0.0761353924299995, -0.10530606513423602, -0.2573899892085666, -0.22127308380053773, -0.18764598285157663, 0.03148353613337992, -0.1084326787224571, -0.1812397741414887, 0.3588974268092769, 0.0828341444081466, 0.1519560131892874, -0.020886537287364768, 0.21882552422914672, 0.04817477473684377, 0.0903769693010839, 0.02020040162502549, 0.2647244063991059, 0.14906888353121492, 0.1822026676409366, -0.28873877091386907, 0.15354089609576457, 0.019299671514671667] |
1,802.01863 | Quantum First Passage Time Problem-A Bohmian Perspective | The prediction of arrival time or first passage time statistics of a quantum particle is an open problem, which challenges the foundations of quantum theory. One of the most promising and insightful approaches to this problem stems from the de Broglie-Bohm pilot-wave theory (a.k.a Bohmian mechanics). Applying the fundamental postulates of this theory, we analyze a simplified first passage time experiment and derive the empirical passage time distribution $\Pi(\tau)$. Implications of our results are also discussed. | quant-ph | the prediction of arrival time or first passage time statistics of a quantum particle is an open problem which challenges the foundations of quantum theory one of the most promising and insightful approaches to this problem stems from the de brogliebohm pilotwave theory aka bohmian mechanics applying the fundamental postulates of this theory we analyze a simplified first passage time experiment and derive the empirical passage time distribution pitau implications of our results are also discussed | [['the', 'prediction', 'of', 'arrival', 'time', 'or', 'first', 'passage', 'time', 'statistics', 'of', 'a', 'quantum', 'particle', 'is', 'an', 'open', 'problem', 'which', 'challenges', 'the', 'foundations', 'of', 'quantum', 'theory', 'one', 'of', 'the', 'most', 'promising', 'and', 'insightful', 'approaches', 'to', 'this', 'problem', 'stems', 'from', 'the', 'de', 'brogliebohm', 'pilotwave', 'theory', 'aka', 'bohmian', 'mechanics', 'applying', 'the', 'fundamental', 'postulates', 'of', 'this', 'theory', 'we', 'analyze', 'a', 'simplified', 'first', 'passage', 'time', 'experiment', 'and', 'derive', 'the', 'empirical', 'passage', 'time', 'distribution', 'pitau', 'implications', 'of', 'our', 'results', 'are', 'also', 'discussed']] | [-0.089742854966684, 0.10730975258373196, -0.19108683781661584, 0.09517486207263764, -0.06216103678544689, -0.11929238976077422, 0.03465406140036832, 0.2719447290230739, -0.2913008215270422, -0.28659601928666234, 0.06890008033032675, -0.2669460722857988, -0.18477991185653464, 0.18251841029575044, -0.07135859107304561, 0.10962749616469648, 0.07176561101560334, 0.053080698095360083, -0.04295723283614375, -0.22495681312131255, 0.26512898105858385, 0.09969340907838686, 0.29451120459768726, 0.05144114111623678, 0.11699463577181297, 0.04473251944383312, -0.04718084927452238, -0.033264122760891426, -0.1522805512527396, 0.1406517313811683, 0.240056714484174, 0.18734364258125424, 0.3226199581925022, -0.4796044573825049, -0.2274333299995449, 0.05306064359549629, 0.10358947093328952, 0.1660459200762776, -0.07561620569934971, -0.3458131246366783, -0.019878021894807096, -0.13231075764633715, -0.17476360444714756, 0.026120993063638086, 0.03712341166101396, -0.04500851233636862, -0.15725367727052225, 0.1080024246226745, 0.041038510352863294, 0.0007869099223937251, -0.04884391444303267, -0.06522021913214733, 0.10893493627602431, 0.14907933379780794, 0.07683281390621376, 0.010686835145430737, 0.11270398838984731, -0.10721465198347639, -0.25379794424608054, 0.4293506126360674, -0.04299668100736055, -0.13056623104861692, 0.14524060636329905, -0.10909023659156733, -0.1890591238992975, 0.04578943744203762, 0.11381295931795121, 0.1458337112378917, -0.12850930405118943, 0.09867132398587848, -0.02324907226782096, 0.11900297741522081, 0.06563643688997745, 0.019161506548889998, 0.22131778258756785, 0.17412119409020402, 0.009690135607103767, 0.07171290618134663, -0.07253233179155934, -0.2475955665577203, -0.34568569711164426, -0.20053533013713987, -0.20354013603891394, 0.07218760539973645, -0.08308761993286776, -0.14863728851962246, 0.38115611390553805, 0.21719349136478022, 0.15517124041032634, 0.08442803617033764, 0.30803441974383433, 0.17697200458037274, -0.08467475842610982, 0.02448019428840397, 0.2316401192771369, 0.16348562888359944, 0.11632339304043471, -0.19119126444351614, 0.03260353245269997, 0.0809615536954401] |
1,802.01864 | Conformal Parametrisation of Loxodromes by Triples of Circles | We provide a parametrisation of a loxodrome by three specially arranged
cycles. The parametrisation is covariant under fractional linear
transformations of the complex plane and naturally encodes conformal properties
of loxodromes. Selected geometrical examples illustrate the usage of
parametrisation. Our work extends the set of objects in Lie sphere
geometry---circle, lines and points---to the natural maximal
conformally-invariant family, which also includes loxodromes.
| math.CV math.GR | we provide a parametrisation of a loxodrome by three specially arranged cycles the parametrisation is covariant under fractional linear transformations of the complex plane and naturally encodes conformal properties of loxodromes selected geometrical examples illustrate the usage of parametrisation our work extends the set of objects in lie sphere geometrycircle lines and pointsto the natural maximal conformallyinvariant family which also includes loxodromes | [['we', 'provide', 'a', 'parametrisation', 'of', 'a', 'loxodrome', 'by', 'three', 'specially', 'arranged', 'cycles', 'the', 'parametrisation', 'is', 'covariant', 'under', 'fractional', 'linear', 'transformations', 'of', 'the', 'complex', 'plane', 'and', 'naturally', 'encodes', 'conformal', 'properties', 'of', 'loxodromes', 'selected', 'geometrical', 'examples', 'illustrate', 'the', 'usage', 'of', 'parametrisation', 'our', 'work', 'extends', 'the', 'set', 'of', 'objects', 'in', 'lie', 'sphere', 'geometrycircle', 'lines', 'and', 'pointsto', 'the', 'natural', 'maximal', 'conformallyinvariant', 'family', 'which', 'also', 'includes', 'loxodromes']] | [-0.14386169901117682, 0.07837327583692968, -0.06791308692966898, 0.056110061761379865, -0.15286448973541458, -0.07804398289881646, -0.01158192241564393, 0.32604676235544805, -0.2383170975605026, -0.28329621042745806, 0.07304140032695917, -0.22941434793174267, -0.1847689097902427, 0.22820608626740674, -0.07107000354056557, 0.02287979827572902, 0.011183949701080564, 0.013006326125954122, -0.12532070852272834, -0.24635233227163553, 0.3695141898157696, -0.004663619088629881, 0.22725259040792783, -0.02054576088072887, 0.13966438938708356, 0.011969356225260222, -0.08705569916249563, 0.009248017333447933, -0.14069440729605656, 0.14698752254868547, 0.21096866571654876, 0.12857394269667566, 0.14113463647663593, -0.3647657384785513, -0.21178852093095582, 0.07930085303572317, 0.0942798723001033, 0.05473967614234425, 0.0086544899463964, -0.2717749043678244, 0.029256224818527698, -0.142865931460013, -0.18133344577314953, -0.10552090160393467, 0.008972800678263108, 0.01875105641471843, -0.23354488965123893, 0.013850343203618347, 0.12110867137089372, 0.10048996747160951, -0.02375033920397982, -0.0958398433867842, -0.058861751148166754, 0.06146437870338559, -0.03047291501813258, -0.03252456411137246, 0.14557728075888007, -0.0744057330613335, -0.10081871245056391, 0.43252714498570033, -0.028241838002577423, -0.24416274257625142, 0.1373645715803529, -0.11232804619551946, -0.19161660805887853, 0.09835968770397206, 0.1577962097711861, 0.16493842888933916, -0.15231444258242846, 0.16401968515128829, -0.11224218622470895, 0.0943225206884866, 0.1162446521067371, 0.03423360052596157, 0.18823760555436214, 0.10032799035931626, 0.061745855432430594, 0.20078917063947302, -0.008224017025592426, -0.12860235950599114, -0.40931079679479204, -0.14691906802666685, -0.10213818144402467, 0.035205825705391665, -0.14726633834992148, -0.1844742051480959, 0.45284767711224655, 0.05838341866110568, 0.214811118816336, 0.07340088304093419, 0.20873730150051414, 0.07444836852397808, 0.07806396400555968, 0.027362927817739545, 0.15630619656294584, 0.1602176056592725, 0.0018129877086418371, -0.15445489679307986, -0.04960775168146938, 0.11477026178035885] |
1,802.01865 | The spectral energy distribution of the hyperluminous, hot dust-obscured
galaxy W2246$-$0526 | Hot dust-obscured galaxies (Hot DOGs) are a luminous, dust-obscured
population recently discovered in the WISE All-Sky survey. Multiwavelength
follow-up observations suggest that they are mainly powered by accreting
supermassive black holes (SMBHs), lying in dense environments, and being in the
transition phase between extreme starburst and UV-bright quasars. Therefore,
they are good candidates for studying the interplay between SMBHs, star
formation and environment. W2246$-$0526 (thereafter, W2246), a Hot DOG at
$z\sim4.6$, has been taken as the most luminous galaxy known in the Universe.
Revealed by the multiwavelength images, the previous Herschel SPIRE photometry
of W2246 is contaminated by a foreground galaxy (W2246f), resulting in an
overestimation of its total IR luminosity by a factor of about 2. We perform
the rest-frame UV/optical-to-far-IR spectral energy distribution (SED) analysis
with SED3FIT and re-estimate its physical properties. The derived stellar mass
$M_\star = 4.3\times10^{11}~M_\odot$ makes it be among the most massive
galaxies with spectroscopic redshift $z>4.5$. Its structure is extremely
compact and requires an effective mechanism to puff-up. Most of ($>95\%$) its
IR luminosity is from AGN torus emission, revealing the rapid growth of the
central SMBH. We also predict that W2246 may have a significant molecular gas
reservoir based on the dust mass estimation.
| astro-ph.GA | hot dustobscured galaxies hot dogs are a luminous dustobscured population recently discovered in the wise allsky survey multiwavelength followup observations suggest that they are mainly powered by accreting supermassive black holes smbhs lying in dense environments and being in the transition phase between extreme starburst and uvbright quasars therefore they are good candidates for studying the interplay between smbhs star formation and environment w22460526 thereafter w2246 a hot dog at zsim46 has been taken as the most luminous galaxy known in the universe revealed by the multiwavelength images the previous herschel spire photometry of w2246 is contaminated by a foreground galaxy w2246f resulting in an overestimation of its total ir luminosity by a factor of about 2 we perform the restframe uvopticaltofarir spectral energy distribution sed analysis with sed3fit and reestimate its physical properties the derived stellar mass m_star 43times1011m_odot makes it be among the most massive galaxies with spectroscopic redshift z45 its structure is extremely compact and requires an effective mechanism to puffup most of 95 its ir luminosity is from agn torus emission revealing the rapid growth of the central smbh we also predict that w2246 may have a significant molecular gas reservoir based on the dust mass estimation | [['hot', 'dustobscured', 'galaxies', 'hot', 'dogs', 'are', 'a', 'luminous', 'dustobscured', 'population', 'recently', 'discovered', 'in', 'the', 'wise', 'allsky', 'survey', 'multiwavelength', 'followup', 'observations', 'suggest', 'that', 'they', 'are', 'mainly', 'powered', 'by', 'accreting', 'supermassive', 'black', 'holes', 'smbhs', 'lying', 'in', 'dense', 'environments', 'and', 'being', 'in', 'the', 'transition', 'phase', 'between', 'extreme', 'starburst', 'and', 'uvbright', 'quasars', 'therefore', 'they', 'are', 'good', 'candidates', 'for', 'studying', 'the', 'interplay', 'between', 'smbhs', 'star', 'formation', 'and', 'environment', 'w22460526', 'thereafter', 'w2246', 'a', 'hot', 'dog', 'at', 'zsim46', 'has', 'been', 'taken', 'as', 'the', 'most', 'luminous', 'galaxy', 'known', 'in', 'the', 'universe', 'revealed', 'by', 'the', 'multiwavelength', 'images', 'the', 'previous', 'herschel', 'spire', 'photometry', 'of', 'w2246', 'is', 'contaminated', 'by', 'a', 'foreground', 'galaxy', 'w2246f', 'resulting', 'in', 'an', 'overestimation', 'of', 'its', 'total', 'ir', 'luminosity', 'by', 'a', 'factor', 'of', 'about', '2', 'we', 'perform', 'the', 'restframe', 'uvopticaltofarir', 'spectral', 'energy', 'distribution', 'sed', 'analysis', 'with', 'sed3fit', 'and', 'reestimate', 'its', 'physical', 'properties', 'the', 'derived', 'stellar', 'mass', 'm_star', '43times1011m_odot', 'makes', 'it', 'be', 'among', 'the', 'most', 'massive', 'galaxies', 'with', 'spectroscopic', 'redshift', 'z45', 'its', 'structure', 'is', 'extremely', 'compact', 'and', 'requires', 'an', 'effective', 'mechanism', 'to', 'puffup', 'most', 'of', '95', 'its', 'ir', 'luminosity', 'is', 'from', 'agn', 'torus', 'emission', 'revealing', 'the', 'rapid', 'growth', 'of', 'the', 'central', 'smbh', 'we', 'also', 'predict', 'that', 'w2246', 'may', 'have', 'a', 'significant', 'molecular', 'gas', 'reservoir', 'based', 'on', 'the', 'dust', 'mass', 'estimation']] | [-0.03198655799534041, 0.08657841407114816, -0.09472580366454335, 0.14028053778302096, -0.12450442136246331, -0.04224040470209581, 0.047090425652603865, 0.4795593744861342, -0.07871506012422602, -0.33603088945929643, 0.0866954810721372, -0.3390215452575144, -0.02786508312197022, 0.17958381525753866, -0.038420074468488066, -0.035216965510068005, 0.020674981501004518, -0.14347180668787307, -0.003354042051499591, -0.2907884618711696, 0.3069818578731763, 0.12628133362159133, 0.1513311781312282, -0.05505794879970882, 0.07301158845134802, -0.1192394016103876, -0.12450503881656023, -0.06836563952823113, -0.13148817800412166, 0.03726247511804104, 0.2771260270478242, 0.1561725535536926, 0.25185606213006173, -0.3254124865087928, -0.23047960512530136, 0.08221062347447329, 0.2066805808619615, 0.002693143307364413, -0.11587584087784326, -0.2706683175424494, 0.0574952319946867, -0.18724041760005816, -0.14050903497976536, 0.05507202877405299, 0.06445983010736218, 0.014478018371048574, -0.1782755065903576, 0.17164445589492525, -0.005143024345113877, 0.07281375952939294, -0.12446672465279224, -0.05853470907444419, -0.12863224943177964, 0.07571067518497608, 0.01461235682803149, 0.09838937055224514, 0.24168924001824796, -0.19182258597765195, -0.006519407309515744, 0.39572046872950634, -0.025322642608258245, 0.07107454299218763, 0.26596249129661187, -0.22345214005920808, -0.20820878503359475, 0.15318363316402275, 0.14797646573231538, 0.13594096025323724, -0.20236217315167387, -0.00040476282120668043, -0.026212602420187345, 0.2288836361751274, -0.009304118649178773, 0.11945470465523576, 0.4057772440493715, 0.13217995091631285, 0.011398989372240494, 0.10471643860943672, -0.21782603610558815, -0.01652197194124135, -0.177468700733568, -0.0578971597822193, -0.18063567626071447, 0.14496095114142862, -0.1618316255872018, -0.07983710848707326, 0.3054094174793284, 0.08120970890740864, 0.24501769072304916, 0.039863711433118086, 0.3047127838812304, 0.06756034841088635, 0.12434894603092642, 0.14961672173717952, 0.3323833590363894, 0.15506097752296802, 0.05530936354937564, -0.23798825175677218, 0.054033132104858834, 0.0028238018062345834] |
1,802.01866 | Causal Linearizability: Compositionality for Partially Ordered
Executions | In the interleaving model of concurrency, where events are totally ordered,
linearizability is compositional: the composition of two linearizable objects
is guaranteed to be linearizable. However, linearizability is not compositional
when events are only partially ordered, as in many weak-memory models that
describe multicore memory systems. In this paper, we present causal
linearizability, a correctness condition for concurrent objects implemented in
weak-memory models. We abstract from the details of specific memory models by
defining our condition using Lamport's execution structures. We apply our
condition to the C11 memory model, providing a correctness condition for C11
objects. We develop a proof method for verifying objects implemented in C11 and
related models. Our method is an adaptation of simulation-based methods, but in
contrast to other such methods, it does not require that the implementation
totally order its events. We also show that causal linearizability reduces to
linearizability in the totally ordered case.
| cs.LO cs.PL | in the interleaving model of concurrency where events are totally ordered linearizability is compositional the composition of two linearizable objects is guaranteed to be linearizable however linearizability is not compositional when events are only partially ordered as in many weakmemory models that describe multicore memory systems in this paper we present causal linearizability a correctness condition for concurrent objects implemented in weakmemory models we abstract from the details of specific memory models by defining our condition using lamports execution structures we apply our condition to the c11 memory model providing a correctness condition for c11 objects we develop a proof method for verifying objects implemented in c11 and related models our method is an adaptation of simulationbased methods but in contrast to other such methods it does not require that the implementation totally order its events we also show that causal linearizability reduces to linearizability in the totally ordered case | [['in', 'the', 'interleaving', 'model', 'of', 'concurrency', 'where', 'events', 'are', 'totally', 'ordered', 'linearizability', 'is', 'compositional', 'the', 'composition', 'of', 'two', 'linearizable', 'objects', 'is', 'guaranteed', 'to', 'be', 'linearizable', 'however', 'linearizability', 'is', 'not', 'compositional', 'when', 'events', 'are', 'only', 'partially', 'ordered', 'as', 'in', 'many', 'weakmemory', 'models', 'that', 'describe', 'multicore', 'memory', 'systems', 'in', 'this', 'paper', 'we', 'present', 'causal', 'linearizability', 'a', 'correctness', 'condition', 'for', 'concurrent', 'objects', 'implemented', 'in', 'weakmemory', 'models', 'we', 'abstract', 'from', 'the', 'details', 'of', 'specific', 'memory', 'models', 'by', 'defining', 'our', 'condition', 'using', 'lamports', 'execution', 'structures', 'we', 'apply', 'our', 'condition', 'to', 'the', 'c11', 'memory', 'model', 'providing', 'a', 'correctness', 'condition', 'for', 'c11', 'objects', 'we', 'develop', 'a', 'proof', 'method', 'for', 'verifying', 'objects', 'implemented', 'in', 'c11', 'and', 'related', 'models', 'our', 'method', 'is', 'an', 'adaptation', 'of', 'simulationbased', 'methods', 'but', 'in', 'contrast', 'to', 'other', 'such', 'methods', 'it', 'does', 'not', 'require', 'that', 'the', 'implementation', 'totally', 'order', 'its', 'events', 'we', 'also', 'show', 'that', 'causal', 'linearizability', 'reduces', 'to', 'linearizability', 'in', 'the', 'totally', 'ordered', 'case']] | [-0.15635094905737787, 0.05357977698023508, -0.08299951586251457, 0.10246030925385033, -0.13839367483121653, -0.1469321870194593, 0.03424597574941193, 0.40857593558728694, -0.2763085825368762, -0.29878374265817303, 0.13122173704284554, -0.20218270576248568, -0.1384731623871873, 0.19360998038280133, -0.12854578201348582, 0.06260981285129674, 0.10361914885851244, 0.0222250267273436, -0.04291397760040127, -0.2956378348854681, 0.31276779575894276, -0.0058158244208122295, 0.22397601959023936, 0.01060689965263009, 0.0813732734726121, -0.007627557357773184, 0.005001546588415901, 0.04441413444156448, -0.06354161954091979, 0.09283293519634754, 0.2884275093640705, 0.19115495149667064, 0.22820902278646826, -0.4299001605870823, -0.16961041730518142, 0.09065204352761308, 0.09674494225531817, 0.10771660988839964, -0.010102157046397527, -0.2833062197997545, 0.15409803055847685, -0.15393782242511708, -0.09274099768760304, -0.13301184064010158, -0.010382156164074938, -0.01691475626336493, -0.25784365845223267, 0.04958582915811955, 0.19433477516829348, 0.09422559675450126, -0.08777894181742643, -0.02062209243265291, -0.030252410038374363, 0.050774988646347385, -0.008758946919503312, -0.025425916397944094, 0.07967409371398389, -0.07785314675265302, -0.17306493495901426, 0.3805002077358464, -0.001468081692388902, -0.24571152683347464, 0.2582908682866643, -0.04969549912648896, -0.22194032794175048, 0.08587088697900375, 0.16072134490745763, 0.1691536533056448, -0.1895628884517161, 0.1219457824555381, -0.02492066644753019, 0.19614285487681626, 0.053064008012103536, 0.004204953534839054, 0.1413008308286468, 0.20454847482809177, 0.06433853119572935, 0.14549017279370066, 0.012336543910205364, -0.09341560470561186, -0.3334227147946755, -0.1815745786515375, -0.12569818169344216, -0.039027565419479895, -0.05918522741635873, -0.22399516258738003, 0.3339573050290346, 0.2485359520931767, 0.1372790142800659, 0.11548821596273531, 0.32508136035564045, 0.07001648201762388, 0.12323247093707324, 0.12940538180992006, 0.15507397266415257, 0.09152362203380714, 0.11620213786450526, -0.12663370999352386, 0.15545974139434596, 0.08252620342498024] |
1,802.01867 | Automorphism group of a moduli space of framed bundles over a curve | Let $X$ be a smooth complex projective curve, and let $x\in X$ be a point. We
compute the automorphism group of the moduli space of framed vector bundles on
$X$ of rank $r \geq 2$ with a framing over $x$. It is shown that this
automorphism group is generated by the following three: (1) pullbacks using
automorphisms of the curve $X$ that fix the marked point $x$, (2) tensorization
with certain line bundles over $X$ and (3) the action of
$\operatorname{PGL}_r(\mathbb{C})$ through composition with the framing.
| math.AG | let x be a smooth complex projective curve and let xin x be a point we compute the automorphism group of the moduli space of framed vector bundles on x of rank r geq 2 with a framing over x it is shown that this automorphism group is generated by the following three 1 pullbacks using automorphisms of the curve x that fix the marked point x 2 tensorization with certain line bundles over x and 3 the action of operatornamepgl_rmathbbc through composition with the framing | [['let', 'x', 'be', 'a', 'smooth', 'complex', 'projective', 'curve', 'and', 'let', 'xin', 'x', 'be', 'a', 'point', 'we', 'compute', 'the', 'automorphism', 'group', 'of', 'the', 'moduli', 'space', 'of', 'framed', 'vector', 'bundles', 'on', 'x', 'of', 'rank', 'r', 'geq', '2', 'with', 'a', 'framing', 'over', 'x', 'it', 'is', 'shown', 'that', 'this', 'automorphism', 'group', 'is', 'generated', 'by', 'the', 'following', 'three', '1', 'pullbacks', 'using', 'automorphisms', 'of', 'the', 'curve', 'x', 'that', 'fix', 'the', 'marked', 'point', 'x', '2', 'tensorization', 'with', 'certain', 'line', 'bundles', 'over', 'x', 'and', '3', 'the', 'action', 'of', 'operatornamepgl_rmathbbc', 'through', 'composition', 'with', 'the', 'framing']] | [-0.22518229687120767, 0.08915229069808607, -0.11030093052369706, -0.04671308712020297, -0.04286322486860787, -0.16538710053462316, 0.03348088921869502, 0.42716420503223645, -0.368915355906767, -0.18510539864792544, 0.11388909648556043, -0.2715732403756941, -0.12625394588035038, 0.17805980157983653, -0.12408764733768561, -0.06651298723676626, 0.0006106654976439827, 0.136342714639271, -0.15241135905003722, -0.31732743323287543, 0.4310262739658356, -0.08920920659404467, 0.1765562013229903, 0.007733427026473424, 0.16611349685117602, 0.05392114439814845, 0.021210070611799463, 0.001468941442983444, -0.10591974230020937, 0.12629030414802186, 0.29229351348681926, 0.09462411968475755, 0.1659306953277658, -0.29714362234534586, -0.22737360052654848, 0.2625082270023139, 0.10284526253886082, -0.1527168547405916, 0.01372659722863532, -0.2617630434441654, 0.1753766669836991, -0.10926548882442362, -0.14919805720119791, -0.056974560942719965, 0.11356577541377834, 0.02083349088754724, -0.232416517484714, -0.10814013743006132, 0.049785693548619746, 0.16259606536477805, -0.03006541479159804, -0.10647298311814665, -0.1561561394154149, 0.06256633605260183, 0.013569660512182643, 0.19840554289026735, 0.11102546607418096, -0.0682669870528009, -0.07566040087053004, 0.37722490666543734, -0.09927395436474505, -0.22445433021468275, 0.06467897563296206, -0.2145042809904279, -0.1129796336788465, 0.2019450780004263, 0.10340348200269919, 0.20652061167809949, 0.0359822514521725, 0.2208294477327453, -0.131572869485792, 0.14500797779422583, 0.04133170444299193, -0.1073666237116627, 0.1458876785274376, 0.10458903960226214, 0.06748758348882855, 0.057905315522871474, -0.04695333642611171, 0.035813089438221035, -0.41285492830416737, -0.21878565261688301, -0.07768110818613101, 0.25193102105027615, -0.14295228126917636, -0.10326046600821429, 0.38452253599705943, 0.05593006251489415, 0.2714949879959664, 0.08824400408741306, 0.17533696800032084, 0.018739820227903478, 0.013535979937981156, 0.08148131282890544, 0.04200220522196854, 0.18359558205668103, -0.07519347595653551, -0.09901195654700345, -0.013756478703854715, 0.18673968135434038] |
1,802.01868 | Lossless Brownian information engine | We report on a lossless information engine that converts nearly all available
information from an error-free feedback protocol into mechanical work.
Combining high-precision detection at resolution of 1 nm with ultrafast
feedback control, the engine is tuned to extract the maximum work from
information on the position of a Brownian particle. We show that the work
produced by the engine achieves a bound set by a generalized second law of
thermodynamics, demonstrating for the first time the sharpness of this bound.
We validate a generalized Jarzynski equality for error-free feedback-controlled
information engines.
| cond-mat.stat-mech | we report on a lossless information engine that converts nearly all available information from an errorfree feedback protocol into mechanical work combining highprecision detection at resolution of 1 nm with ultrafast feedback control the engine is tuned to extract the maximum work from information on the position of a brownian particle we show that the work produced by the engine achieves a bound set by a generalized second law of thermodynamics demonstrating for the first time the sharpness of this bound we validate a generalized jarzynski equality for errorfree feedbackcontrolled information engines | [['we', 'report', 'on', 'a', 'lossless', 'information', 'engine', 'that', 'converts', 'nearly', 'all', 'available', 'information', 'from', 'an', 'errorfree', 'feedback', 'protocol', 'into', 'mechanical', 'work', 'combining', 'highprecision', 'detection', 'at', 'resolution', 'of', '1', 'nm', 'with', 'ultrafast', 'feedback', 'control', 'the', 'engine', 'is', 'tuned', 'to', 'extract', 'the', 'maximum', 'work', 'from', 'information', 'on', 'the', 'position', 'of', 'a', 'brownian', 'particle', 'we', 'show', 'that', 'the', 'work', 'produced', 'by', 'the', 'engine', 'achieves', 'a', 'bound', 'set', 'by', 'a', 'generalized', 'second', 'law', 'of', 'thermodynamics', 'demonstrating', 'for', 'the', 'first', 'time', 'the', 'sharpness', 'of', 'this', 'bound', 'we', 'validate', 'a', 'generalized', 'jarzynski', 'equality', 'for', 'errorfree', 'feedbackcontrolled', 'information', 'engines']] | [-0.09756527941309563, 0.07093488325446505, -0.09350250970632971, -0.005379589309956393, -0.07741462574441633, -0.1867966094540189, 0.13292790627430962, 0.3435499031683835, -0.28230867267626786, -0.3422026774522079, 0.09225587311970151, -0.30796598244721635, -0.07903033686781545, 0.29392978466627107, -0.05173389911752842, 0.06031385956979964, 0.06919296603249993, 0.06352834769463896, -0.02703595020727295, -0.1800982058706248, 0.26296348818679055, 0.1021128037065627, 0.29998462379950547, 0.07661152430607573, 0.1752026649698129, 0.0004629493620165664, -0.0349736336780631, -0.01689732494591938, -0.16207785513989106, 0.11713671025253185, 0.1928141896876142, 0.13638518386237, 0.27004148862729577, -0.3815990810120559, -0.223204747500384, 0.05639642486146287, 0.11285545795766191, 0.12795726322245016, -0.09572424279252553, -0.26714515882928896, 0.07938970232372293, -0.17548918515524786, -0.03309019975384454, -0.05276760362777049, -0.022069967321484633, 0.00871541983696775, -0.2912442259105813, 0.08051645557861775, 0.1342153437821569, 0.03166225462463563, -0.05656056507976483, -0.0073962545619629646, 0.030110724419659084, 0.1429079682692764, -0.09627336291241986, 0.00182542656725475, 0.19958380581912302, -0.11617438368747295, -0.17057136909368084, 0.3338764555519447, -0.06605837814530115, -0.14412344207116606, 0.0910278963704553, -0.11424039842803842, -0.12775308832161777, 0.1084328800131081, 0.1666303294731061, 0.12694581115971706, -0.1959652967710534, 0.008880633501457456, -0.03148870735996119, 0.25003791682968807, 0.0690610884162395, 0.03733950653417117, 0.1985050793433481, 0.18145712377483267, 0.05141832772642374, 0.20988232763382889, -0.07531333590715962, -0.10026977302850751, -0.31382175756658875, -0.18419932700192515, -0.2663295651879668, 0.06865022632004895, -0.09813064702219614, -0.057185678196180124, 0.355118492456234, 0.19220435642637312, 0.15955857598814677, 0.09883672438318962, 0.35107502675331803, 0.08375118162534224, 0.01979835187692357, 0.1227503924013075, 0.2578370841220021, 0.09857174734402772, 0.12752046237722464, -0.2255122744729464, 0.05540069361197074, 0.07241457314154578] |
1,802.01869 | Characterizing long-term optical, ultraviolet and X-ray variability in
different activity states of OJ 287 | We have studied long-term optical, ultraviolet (UV) and X-ray observations of
OJ 287 collected with the UVOT and XRT instruments mounted on board the Swift
satellite to quantify spectral and temporal variability patterns observed
during different activity states. We characterized the flux variations using
the data collected during almost 11 yr of the monitoring of the blazar.
Significant variability of the blazar has been detected both in the flux and
spectral index from the optical to X-ray regimes. We noted that the variability
patterns observed in the optical range are more pronounced than the ones in the
X-ray band. There is no clear relation between the optical/UV and X-ray
emission, neither during the quiescence state nor during outbursts. The most
significant flares in the optical/UV regime were detected in 2015 December-2016
January. The shortest variability time-scale is one day and it is limited by
the observation pointing. A low activity state of OJ 287 was observed at the
end of 2014, while the beginning of 2015 revealed a flat X-ray spectrum, which
has been observed for the first time. On one hand, this can be a spectral
upturn where the synchrotron and inverse Compton components meet, but on the
other hand, it can be generated by an additional emission component. The
spectral studies have not revealed any bluer-when-brighter or
redder-when-brighter chromatism in the colour-magnitude diagram for OJ 287 in
any state of the source's activity. A harder-when-brighter behaviour was
noticed for OJ 287 only in the case of the X-ray observations.
| astro-ph.HE | we have studied longterm optical ultraviolet uv and xray observations of oj 287 collected with the uvot and xrt instruments mounted on board the swift satellite to quantify spectral and temporal variability patterns observed during different activity states we characterized the flux variations using the data collected during almost 11 yr of the monitoring of the blazar significant variability of the blazar has been detected both in the flux and spectral index from the optical to xray regimes we noted that the variability patterns observed in the optical range are more pronounced than the ones in the xray band there is no clear relation between the opticaluv and xray emission neither during the quiescence state nor during outbursts the most significant flares in the opticaluv regime were detected in 2015 december2016 january the shortest variability timescale is one day and it is limited by the observation pointing a low activity state of oj 287 was observed at the end of 2014 while the beginning of 2015 revealed a flat xray spectrum which has been observed for the first time on one hand this can be a spectral upturn where the synchrotron and inverse compton components meet but on the other hand it can be generated by an additional emission component the spectral studies have not revealed any bluerwhenbrighter or redderwhenbrighter chromatism in the colourmagnitude diagram for oj 287 in any state of the sources activity a harderwhenbrighter behaviour was noticed for oj 287 only in the case of the xray observations | [['we', 'have', 'studied', 'longterm', 'optical', 'ultraviolet', 'uv', 'and', 'xray', 'observations', 'of', 'oj', '287', 'collected', 'with', 'the', 'uvot', 'and', 'xrt', 'instruments', 'mounted', 'on', 'board', 'the', 'swift', 'satellite', 'to', 'quantify', 'spectral', 'and', 'temporal', 'variability', 'patterns', 'observed', 'during', 'different', 'activity', 'states', 'we', 'characterized', 'the', 'flux', 'variations', 'using', 'the', 'data', 'collected', 'during', 'almost', '11', 'yr', 'of', 'the', 'monitoring', 'of', 'the', 'blazar', 'significant', 'variability', 'of', 'the', 'blazar', 'has', 'been', 'detected', 'both', 'in', 'the', 'flux', 'and', 'spectral', 'index', 'from', 'the', 'optical', 'to', 'xray', 'regimes', 'we', 'noted', 'that', 'the', 'variability', 'patterns', 'observed', 'in', 'the', 'optical', 'range', 'are', 'more', 'pronounced', 'than', 'the', 'ones', 'in', 'the', 'xray', 'band', 'there', 'is', 'no', 'clear', 'relation', 'between', 'the', 'opticaluv', 'and', 'xray', 'emission', 'neither', 'during', 'the', 'quiescence', 'state', 'nor', 'during', 'outbursts', 'the', 'most', 'significant', 'flares', 'in', 'the', 'opticaluv', 'regime', 'were', 'detected', 'in', '2015', 'december2016', 'january', 'the', 'shortest', 'variability', 'timescale', 'is', 'one', 'day', 'and', 'it', 'is', 'limited', 'by', 'the', 'observation', 'pointing', 'a', 'low', 'activity', 'state', 'of', 'oj', '287', 'was', 'observed', 'at', 'the', 'end', 'of', '2014', 'while', 'the', 'beginning', 'of', '2015', 'revealed', 'a', 'flat', 'xray', 'spectrum', 'which', 'has', 'been', 'observed', 'for', 'the', 'first', 'time', 'on', 'one', 'hand', 'this', 'can', 'be', 'a', 'spectral', 'upturn', 'where', 'the', 'synchrotron', 'and', 'inverse', 'compton', 'components', 'meet', 'but', 'on', 'the', 'other', 'hand', 'it', 'can', 'be', 'generated', 'by', 'an', 'additional', 'emission', 'component', 'the', 'spectral', 'studies', 'have', 'not', 'revealed', 'any', 'bluerwhenbrighter', 'or', 'redderwhenbrighter', 'chromatism', 'in', 'the', 'colourmagnitude', 'diagram', 'for', 'oj', '287', 'in', 'any', 'state', 'of', 'the', 'sources', 'activity', 'a', 'harderwhenbrighter', 'behaviour', 'was', 'noticed', 'for', 'oj', '287', 'only', 'in', 'the', 'case', 'of', 'the', 'xray', 'observations']] | [-0.07284343511098995, 0.13625357330363477, -0.09314290584810078, 0.11596188154723495, -0.08481029035057873, -0.11115765462815762, 0.05054397066286765, 0.5057144742608071, -0.1593508610803401, -0.37018653412302954, 0.14284444290213286, -0.33664114005491136, -0.06670651342067868, 0.23159628754574804, -0.0636703960262239, -0.00021459919912740589, 0.06659108904469759, -0.05645443735644221, -0.005919716610573232, -0.21305768027342856, 0.2331213047602214, 0.090165304150898, 0.24571460088063032, -0.005609675661893561, 0.08429480654234067, -0.01351782475109212, -0.07547369410097599, -0.01680741707608104, -0.04115081176828244, 0.027670893858070485, 0.2359747290564701, 0.09919797109300271, 0.18666431760415436, -0.3657880466450006, -0.2593249175734818, 0.10550630278885365, 0.11102089441171847, -0.04558964358177036, 0.010555753092921805, -0.26283057176228614, 0.015781966177746652, -0.13871650558710097, -0.10943013585917652, 0.07386339138820767, 0.09254729795083404, -0.012452108985045925, -0.16865905948076398, 0.08619334947131574, 0.023500138776609673, 0.1353620203398168, -0.1672255715597421, -0.020511001659557222, -0.07587585356459021, 0.10854049398656934, 0.09007030486036093, 0.05819914631173015, 0.08284286471270025, -0.10954452645871789, -0.1331695005868096, 0.3307679950240999, -0.05428373804065632, 0.06940501710027457, 0.1894266290422529, -0.24556112563982607, -0.21836480001546443, 0.19852783073484898, 0.11199371146946215, 0.09683457644097507, -0.13814506609365343, 0.02219441795849707, -0.014520393449813127, 0.2911195332687348, 0.059734669094905254, 0.07742430693237111, 0.2567861580811441, 0.11300352830346674, -0.02349386297658202, 0.13859552433458158, -0.2616180569762364, 0.006347337333019822, -0.23881889947503804, -0.04911196754709817, -0.15867481807433068, 0.0752129175986629, -0.06206339610327268, -0.10958389891893602, 0.44582101454958317, 0.07199361176043749, 0.20295776062551885, -0.012049388082232326, 0.26322914704633876, 0.14829297149274498, 0.07893448360450565, 0.1317727867346257, 0.3737746212258935, 0.0666571411555633, 0.18457931991573423, -0.22953558874782176, 0.10753467532619834, -0.023790054114535452] |
1,802.0187 | RDMAvisor: Toward Deploying Scalable and Simple RDMA as a Service in
Datacenters | RDMA is increasingly adopted by cloud computing platforms to provide low CPU
overhead, low latency, high throughput network services. On the other hand,
however, it is still challenging for developers to realize fast deployment of
RDMA-aware applications in the datacenter, since the performance is highly
related to many lowlevel details of RDMA operations. To address this problem,
we present a simple and scalable RDMA as Service (RaaS) to mitigate the impact
of RDMA operational details. RaaS provides careful message buffer management to
improve CPU/memory utilization and improve the scalability of RDMA operations.
These optimized designs lead to simple and flexible programming model for
common and knowledgeable users. We have implemented a prototype of RaaS, named
RDMAvisor, and evaluated its performance on a cluster with a large number of
connections. Our experiment results demonstrate that RDMAvisor achieves high
throughput for thousand of connections and maintains low CPU and memory
overhead through adaptive RDMA transport selection.
| cs.DC cs.NI cs.PF | rdma is increasingly adopted by cloud computing platforms to provide low cpu overhead low latency high throughput network services on the other hand however it is still challenging for developers to realize fast deployment of rdmaaware applications in the datacenter since the performance is highly related to many lowlevel details of rdma operations to address this problem we present a simple and scalable rdma as service raas to mitigate the impact of rdma operational details raas provides careful message buffer management to improve cpumemory utilization and improve the scalability of rdma operations these optimized designs lead to simple and flexible programming model for common and knowledgeable users we have implemented a prototype of raas named rdmavisor and evaluated its performance on a cluster with a large number of connections our experiment results demonstrate that rdmavisor achieves high throughput for thousand of connections and maintains low cpu and memory overhead through adaptive rdma transport selection | [['rdma', 'is', 'increasingly', 'adopted', 'by', 'cloud', 'computing', 'platforms', 'to', 'provide', 'low', 'cpu', 'overhead', 'low', 'latency', 'high', 'throughput', 'network', 'services', 'on', 'the', 'other', 'hand', 'however', 'it', 'is', 'still', 'challenging', 'for', 'developers', 'to', 'realize', 'fast', 'deployment', 'of', 'rdmaaware', 'applications', 'in', 'the', 'datacenter', 'since', 'the', 'performance', 'is', 'highly', 'related', 'to', 'many', 'lowlevel', 'details', 'of', 'rdma', 'operations', 'to', 'address', 'this', 'problem', 'we', 'present', 'a', 'simple', 'and', 'scalable', 'rdma', 'as', 'service', 'raas', 'to', 'mitigate', 'the', 'impact', 'of', 'rdma', 'operational', 'details', 'raas', 'provides', 'careful', 'message', 'buffer', 'management', 'to', 'improve', 'cpumemory', 'utilization', 'and', 'improve', 'the', 'scalability', 'of', 'rdma', 'operations', 'these', 'optimized', 'designs', 'lead', 'to', 'simple', 'and', 'flexible', 'programming', 'model', 'for', 'common', 'and', 'knowledgeable', 'users', 'we', 'have', 'implemented', 'a', 'prototype', 'of', 'raas', 'named', 'rdmavisor', 'and', 'evaluated', 'its', 'performance', 'on', 'a', 'cluster', 'with', 'a', 'large', 'number', 'of', 'connections', 'our', 'experiment', 'results', 'demonstrate', 'that', 'rdmavisor', 'achieves', 'high', 'throughput', 'for', 'thousand', 'of', 'connections', 'and', 'maintains', 'low', 'cpu', 'and', 'memory', 'overhead', 'through', 'adaptive', 'rdma', 'transport', 'selection']] | [-0.19888410376329346, -0.011169791656441443, -0.02036151121561693, 0.022740563225087444, -0.12783628829064106, -0.2330956820403195, 0.1353862735285541, 0.43666416867975366, -0.2378921928254283, -0.37272686804860633, 0.14462859745195986, -0.2145101957467218, -0.1251083335674226, 0.2285904288461543, -0.16385506956054774, 0.09743120110499678, 0.11620992461885542, -0.015325714425231632, -0.05701496546709484, -0.3078837520381226, 0.18679659730995332, 0.175136143249145, 0.35924990741776563, 0.12484854760389723, 0.10176769198906849, -0.0198539960759365, -0.022783096475736394, -0.054223616425154594, -0.03869884256883532, 0.14737609509395633, 0.31090743601050796, 0.21157921280785902, 0.3194828752600989, -0.4909666661074422, -0.17099724080419748, -0.0036651534614282727, 0.13531347255635734, 0.023790200227803694, -0.07352894210774723, -0.22976764537616085, 0.13302433557364324, -0.2747719642424429, -0.04495750494310571, -0.14721031885247968, -0.023402642134873086, 0.024842701547345764, -0.2602739017950186, -0.030536548464269137, -0.03704627242173679, 0.034212506514980104, 0.03209289094812502, -0.1036033504257065, 0.03981745741576795, 0.15798382338025416, -0.02008109390411822, 0.013855782647413627, 0.175844832212473, -0.13110195645532072, -0.1419980890604834, 0.399488682753795, 0.014809094813485808, -0.17839090313935121, 0.24165082288079506, 0.02314830225096732, -0.1605288434823025, 0.11101730096937212, 0.2565354278360475, 0.02970200410229925, -0.16000214928995496, 0.030164308339667302, 0.05869818739407998, 0.19807006519392675, 0.06750638955056865, 0.12820551248686696, 0.1290605252775185, 0.30335760304075204, 0.10614703405788785, 0.16159372093558422, -0.06006112502462274, -0.09455031750489347, -0.14828876572173855, -0.16670596907963817, -0.16763874837228201, -0.020890721375899795, -0.09152380836017766, -0.15664938178039864, 0.3705462519054776, 0.21123443230283478, 0.1419074914683372, 0.11602903272191815, 0.4255589014844389, 0.03776379725672243, 0.15096236426469606, 0.17290354451312628, 0.12810190481176933, 0.014608224152297473, 0.19721278601321424, -0.21461495765429361, 0.086099458218472, -0.049423010275076264] |
1,802.01871 | Riesz-projection-based theory of light-matter interaction in dispersive
nanoresonators | We introduce a theory to analyze the behavior of light emitters in
nanostructured environments rigorously. Based on spectral theory, the approach
opens the possibility to quantify precisely how an emitter decays to resonant
states of the structure and how it couples to a background, also in the
presence of general dispersive media. Quantification on this level is essential
for designing and analyzing topical nanophotonic setups, e.g., in quantum
technology applications. We use a numerical implementation of the theory for
computing modal and background decay rates of a single-photon emitter in a
diamond nanoresonator.
| physics.optics cond-mat.mes-hall | we introduce a theory to analyze the behavior of light emitters in nanostructured environments rigorously based on spectral theory the approach opens the possibility to quantify precisely how an emitter decays to resonant states of the structure and how it couples to a background also in the presence of general dispersive media quantification on this level is essential for designing and analyzing topical nanophotonic setups eg in quantum technology applications we use a numerical implementation of the theory for computing modal and background decay rates of a singlephoton emitter in a diamond nanoresonator | [['we', 'introduce', 'a', 'theory', 'to', 'analyze', 'the', 'behavior', 'of', 'light', 'emitters', 'in', 'nanostructured', 'environments', 'rigorously', 'based', 'on', 'spectral', 'theory', 'the', 'approach', 'opens', 'the', 'possibility', 'to', 'quantify', 'precisely', 'how', 'an', 'emitter', 'decays', 'to', 'resonant', 'states', 'of', 'the', 'structure', 'and', 'how', 'it', 'couples', 'to', 'a', 'background', 'also', 'in', 'the', 'presence', 'of', 'general', 'dispersive', 'media', 'quantification', 'on', 'this', 'level', 'is', 'essential', 'for', 'designing', 'and', 'analyzing', 'topical', 'nanophotonic', 'setups', 'eg', 'in', 'quantum', 'technology', 'applications', 'we', 'use', 'a', 'numerical', 'implementation', 'of', 'the', 'theory', 'for', 'computing', 'modal', 'and', 'background', 'decay', 'rates', 'of', 'a', 'singlephoton', 'emitter', 'in', 'a', 'diamond', 'nanoresonator']] | [-0.0925036013747255, 0.1186682890679109, -0.08160264704937256, 0.07140403860799407, -0.04571996541112982, -0.15256167458049874, 0.07029359548863384, 0.4077986436545528, -0.23362327607408648, -0.2668687644745073, 0.027304599980413114, -0.3012773907563138, -0.16705968774641083, 0.2480281873816444, -0.012889109531878143, 0.05929989871438793, 0.01115894600027992, -0.03225174512193408, -0.021850565333239813, -0.14221952421470516, 0.29658357612287967, 0.07135825172962962, 0.34031180546228446, 0.09206583682868269, 0.08358194399625063, 0.027976830800374348, 0.028658569439925174, -0.021129522282349808, -0.12024889877366443, 0.1978349741992681, 0.2623976948620972, 0.0894003841244886, 0.2793202586096501, -0.44176396833712694, -0.22502332709364153, 0.06154302971297374, 0.14499040053433224, 0.1668887222636371, -0.09309910378238608, -0.2969925214351225, 0.0565739160663979, -0.13235310275327936, -0.16422371214045392, -0.08387379415874038, -0.0034846464542531838, -0.03775020121216213, -0.2252633284798683, 0.018112766894108807, -0.0007805021139242316, 0.013152044411668534, -0.019132895649270586, 0.013953321719772472, 0.0763598676790954, 0.09255475521848727, -0.034321392708588194, -0.05475507290396709, 0.17971425556567727, -0.17067035414298537, -0.14731100002574105, 0.38347796680811314, -0.09186860714207894, -0.20097573249731013, 0.17352899391534587, -0.12779719584436225, -0.12105126061066183, 0.0882204273435217, 0.23246827443701126, 0.13256976197433648, -0.15865104438258856, 0.10177193162274317, 0.04471420260366573, 0.206222114183249, 0.046909639526719366, 0.14095177324000566, 0.19682404895623526, 0.22886742197818333, 0.027609318685066955, 0.16738186793662208, -0.07192878410099976, -0.06535122003806855, -0.3056848134885552, -0.18060498721697318, -0.15591554686186776, 0.07088462674179144, -0.05947603165095056, -0.18766875033296884, 0.40731761065782396, 0.1827674494074878, 0.11893814335632268, -0.01757505562116382, 0.3066288500383336, 0.10977487851394921, 0.025344776680632945, 0.004708930890085877, 0.2665209315106353, 0.19257442990658424, 0.10201590977889556, -0.24424757507519537, 0.0033137797598942354, -0.01518500732978986] |
1,802.01872 | Fast Piecewise-Affine Motion Estimation Without Segmentation | Current algorithmic approaches for piecewise affine motion estimation are
based on alternating motion segmentation and estimation. We propose a new
method to estimate piecewise affine motion fields directly without intermediate
segmentation. To this end, we reformulate the problem by imposing piecewise
constancy of the parameter field, and derive a specific proximal splitting
optimization scheme. A key component of our framework is an efficient
one-dimensional piecewise-affine estimator for vector-valued signals. The first
advantage of our approach over segmentation-based methods is its absence of
initialization. The second advantage is its lower computational cost which is
independent of the complexity of the motion field. In addition to these
features, we demonstrate competitive accuracy with other piecewise-parametric
methods on standard evaluation benchmarks. Our new regularization scheme also
outperforms the more standard use of total variation and total generalized
variation.
| cs.CV | current algorithmic approaches for piecewise affine motion estimation are based on alternating motion segmentation and estimation we propose a new method to estimate piecewise affine motion fields directly without intermediate segmentation to this end we reformulate the problem by imposing piecewise constancy of the parameter field and derive a specific proximal splitting optimization scheme a key component of our framework is an efficient onedimensional piecewiseaffine estimator for vectorvalued signals the first advantage of our approach over segmentationbased methods is its absence of initialization the second advantage is its lower computational cost which is independent of the complexity of the motion field in addition to these features we demonstrate competitive accuracy with other piecewiseparametric methods on standard evaluation benchmarks our new regularization scheme also outperforms the more standard use of total variation and total generalized variation | [['current', 'algorithmic', 'approaches', 'for', 'piecewise', 'affine', 'motion', 'estimation', 'are', 'based', 'on', 'alternating', 'motion', 'segmentation', 'and', 'estimation', 'we', 'propose', 'a', 'new', 'method', 'to', 'estimate', 'piecewise', 'affine', 'motion', 'fields', 'directly', 'without', 'intermediate', 'segmentation', 'to', 'this', 'end', 'we', 'reformulate', 'the', 'problem', 'by', 'imposing', 'piecewise', 'constancy', 'of', 'the', 'parameter', 'field', 'and', 'derive', 'a', 'specific', 'proximal', 'splitting', 'optimization', 'scheme', 'a', 'key', 'component', 'of', 'our', 'framework', 'is', 'an', 'efficient', 'onedimensional', 'piecewiseaffine', 'estimator', 'for', 'vectorvalued', 'signals', 'the', 'first', 'advantage', 'of', 'our', 'approach', 'over', 'segmentationbased', 'methods', 'is', 'its', 'absence', 'of', 'initialization', 'the', 'second', 'advantage', 'is', 'its', 'lower', 'computational', 'cost', 'which', 'is', 'independent', 'of', 'the', 'complexity', 'of', 'the', 'motion', 'field', 'in', 'addition', 'to', 'these', 'features', 'we', 'demonstrate', 'competitive', 'accuracy', 'with', 'other', 'piecewiseparametric', 'methods', 'on', 'standard', 'evaluation', 'benchmarks', 'our', 'new', 'regularization', 'scheme', 'also', 'outperforms', 'the', 'more', 'standard', 'use', 'of', 'total', 'variation', 'and', 'total', 'generalized', 'variation']] | [-0.07816867584122845, -0.024704305598327245, -0.08516645735935933, 0.027626787771908707, -0.12184247324493394, -0.13066362998615116, 0.0298224761178578, 0.42151335539963486, -0.3087294229024799, -0.30603213612435026, 0.11892235677936044, -0.19362797183610164, -0.16113992348711229, 0.21820633418322888, -0.12886541233217316, 0.0825131383138959, 0.07750453181050496, 0.0255779201137041, -0.11861829275009918, -0.27621600686124204, 0.2850035457644236, 0.008267078596452223, 0.315541641268907, 0.013903233912467623, 0.17862347399107, 0.02166008417244389, -0.031183386811423602, 0.017926273246316602, -0.08086434407541945, 0.2021361392559553, 0.19441311240001624, 0.12699824164888895, 0.3264444492020602, -0.3536873769932496, -0.2369529221193003, 0.10161457382622105, 0.1403060457564946, 0.11238466986062338, -0.04574471321914766, -0.2791191358397256, 0.05550334625529932, -0.14575766222447212, -0.05682758569592304, -0.129697381861077, -0.03673036619777611, 0.013849343398217556, -0.31459783416575016, 0.11144102839540183, 0.05212030672110311, 0.031652779832704744, -0.09425049172471096, -0.14395791363777288, 0.058199853665862625, 0.10717479692452322, 0.016885854988428418, 0.06550180693087515, 0.1452191899002377, -0.12510383459774138, -0.15740064647111263, 0.3490457894947769, -0.11584383177001085, -0.27541069842791605, 0.17328880175621486, -0.04668362260059412, -0.1505369549276613, 0.1447535823377322, 0.19836074176397342, 0.16252638224456736, -0.1372841295118117, 0.07468296751708363, -0.00831935088386509, 0.15294337078712625, 0.015241969011918599, -0.009006755546633669, 0.11352164514619968, 0.2079657366666109, 0.13659499069491624, 0.14669361737349987, -0.1304433371962062, -0.10666675564707882, -0.3065468263130378, -0.15205803530902337, -0.17344836114016152, -0.04944784235237027, -0.13850327959223807, -0.16976515069054857, 0.4069051703408516, 0.19589543792798353, 0.17156201283753253, 0.11934432815569244, 0.39885602758001926, 0.1268693503442415, 0.04758886045623404, 0.07970826456378867, 0.21149366153682123, 0.09813847157534268, 0.0409925252923728, -0.2406370018232256, 0.0615496787350319, 0.12915477712652576] |
1,802.01873 | Every Smile is Unique: Landmark-Guided Diverse Smile Generation | Each smile is unique: one person surely smiles in different ways (e.g.,
closing/opening the eyes or mouth). Given one input image of a neutral face,
can we generate multiple smile videos with distinctive characteristics? To
tackle this one-to-many video generation problem, we propose a novel deep
learning architecture named Conditional Multi-Mode Network (CMM-Net). To better
encode the dynamics of facial expressions, CMM-Net explicitly exploits facial
landmarks for generating smile sequences. Specifically, a variational
auto-encoder is used to learn a facial landmark embedding. This single
embedding is then exploited by a conditional recurrent network which generates
a landmark embedding sequence conditioned on a specific expression (e.g.,
spontaneous smile). Next, the generated landmark embeddings are fed into a
multi-mode recurrent landmark generator, producing a set of landmark sequences
still associated to the given smile class but clearly distinct from each other.
Finally, these landmark sequences are translated into face videos. Our
experimental results demonstrate the effectiveness of our CMM-Net in generating
realistic videos of multiple smile expressions.
| cs.CV | each smile is unique one person surely smiles in different ways eg closingopening the eyes or mouth given one input image of a neutral face can we generate multiple smile videos with distinctive characteristics to tackle this onetomany video generation problem we propose a novel deep learning architecture named conditional multimode network cmmnet to better encode the dynamics of facial expressions cmmnet explicitly exploits facial landmarks for generating smile sequences specifically a variational autoencoder is used to learn a facial landmark embedding this single embedding is then exploited by a conditional recurrent network which generates a landmark embedding sequence conditioned on a specific expression eg spontaneous smile next the generated landmark embeddings are fed into a multimode recurrent landmark generator producing a set of landmark sequences still associated to the given smile class but clearly distinct from each other finally these landmark sequences are translated into face videos our experimental results demonstrate the effectiveness of our cmmnet in generating realistic videos of multiple smile expressions | [['each', 'smile', 'is', 'unique', 'one', 'person', 'surely', 'smiles', 'in', 'different', 'ways', 'eg', 'closingopening', 'the', 'eyes', 'or', 'mouth', 'given', 'one', 'input', 'image', 'of', 'a', 'neutral', 'face', 'can', 'we', 'generate', 'multiple', 'smile', 'videos', 'with', 'distinctive', 'characteristics', 'to', 'tackle', 'this', 'onetomany', 'video', 'generation', 'problem', 'we', 'propose', 'a', 'novel', 'deep', 'learning', 'architecture', 'named', 'conditional', 'multimode', 'network', 'cmmnet', 'to', 'better', 'encode', 'the', 'dynamics', 'of', 'facial', 'expressions', 'cmmnet', 'explicitly', 'exploits', 'facial', 'landmarks', 'for', 'generating', 'smile', 'sequences', 'specifically', 'a', 'variational', 'autoencoder', 'is', 'used', 'to', 'learn', 'a', 'facial', 'landmark', 'embedding', 'this', 'single', 'embedding', 'is', 'then', 'exploited', 'by', 'a', 'conditional', 'recurrent', 'network', 'which', 'generates', 'a', 'landmark', 'embedding', 'sequence', 'conditioned', 'on', 'a', 'specific', 'expression', 'eg', 'spontaneous', 'smile', 'next', 'the', 'generated', 'landmark', 'embeddings', 'are', 'fed', 'into', 'a', 'multimode', 'recurrent', 'landmark', 'generator', 'producing', 'a', 'set', 'of', 'landmark', 'sequences', 'still', 'associated', 'to', 'the', 'given', 'smile', 'class', 'but', 'clearly', 'distinct', 'from', 'each', 'other', 'finally', 'these', 'landmark', 'sequences', 'are', 'translated', 'into', 'face', 'videos', 'our', 'experimental', 'results', 'demonstrate', 'the', 'effectiveness', 'of', 'our', 'cmmnet', 'in', 'generating', 'realistic', 'videos', 'of', 'multiple', 'smile', 'expressions']] | [-0.04045412307690329, -0.0005395467316436513, -0.05584522152444484, 0.12190657023627242, -0.11861378053861965, -0.2392479192704053, -0.028892203099974544, 0.47198495080285685, -0.31731719981947143, -0.2409931483917029, 0.041954787169432656, -0.2989021498800778, -0.24306489793419064, 0.17579486942708084, -0.18861130950972438, 0.07072415903974438, 0.1280330774564546, 0.09580266433405951, -0.0005597936895622009, -0.2330283528554435, 0.2857165129020492, -0.04007495494389753, 0.3268743897163559, -0.029707116523839918, 0.21002587869411288, -0.024834127041153474, -0.032708852275036185, -0.03467976397738179, -0.04054157162885886, 0.22612083665550994, 0.2789072161668162, 0.21500114572132234, 0.2874770204837593, -0.4273721332798099, -0.20606130569400946, 0.08102754461181509, 0.14174484184757868, 0.1526987950094669, -0.044122706596858845, -0.4187251781454174, 0.08376345225814276, -0.1423334101464872, 0.0381394906264798, -0.12773854106028631, -0.010182726387184387, -0.019912639242048922, -0.32535800436886436, 0.001909011574575632, 0.09099248851785754, 0.03694774607613842, -0.02740596916182989, -0.0630510590612752, 0.012485979602632409, 0.2507778246100515, 0.029196275223512203, 0.058576996094638074, 0.14568638693926028, -0.20595549964793197, -0.14015795534196956, 0.3620503907284995, -0.06592380900252554, -0.23687359529388388, 0.13544375314547613, -0.06108387711844066, -0.1447298267555264, 0.14729567925252657, 0.20776238727806387, 0.1158878682550361, -0.18720506210016405, -0.06000810888703776, -0.11497508088359609, 0.15497377674839255, 0.11609873300554549, 0.0038608670938850903, 0.26200849659138975, 0.20757749741158743, -0.012669531327513297, 0.18737598530921187, -0.1853702465464821, -0.047470341641001584, -0.22881679467518995, -0.08822196636138847, -0.1892667891338422, -0.01729089230520469, -0.1373085337889767, -0.17502231622320988, 0.4912964125254714, 0.19393318146901992, 0.25887636098408756, 0.13526469093489052, 0.32229044089497, 0.0407911240608217, 0.06743508027852285, 0.030204171127435273, 0.05506469922072095, -0.05546014855201242, 0.08961417043025083, -0.13331004993694767, 0.12699898931612374, 0.1554339027867039] |
1,802.01874 | Unbounded Largest Eigenvalue of Large Sample Covariance Matrices:
Asymptotics, Fluctuations and Applications | Given a large sample covariance matrix $S_N=\frac 1n\Gamma_N^{1/2}Z_N
Z_N^*\Gamma_N^{1/2}\, ,$ where $Z_N$ is a $N\times n$ matrix with i.i.d.
centered entries, and $\Gamma_N$ is a $N\times N$ deterministic Hermitian
positive semidefinite matrix, we study the location and fluctuations of
$\lambda_{\max}(S_N)$, the largest eigenvalue of $S_N$ as $N,n\to\infty$ and
$Nn^{-1} \to r\in(0,\infty)$ in the case where the empirical distribution
$\mu^{\Gamma_N}$ of eigenvalues of $\Gamma_N$ is tight (in $N$) and
$\lambda_{\max}(\Gamma_N)$ goes to $+\infty$. These conditions are in
particular met when $\mu^{\Gamma_N}$ weakly converges to a probability measure
with unbounded support on $\mathbb{R}^+$. We prove that asymptotically
$\lambda_{\max}(S_N)\sim \lambda_{\max}(\Gamma_N)$. Moreover when the
$\Gamma_N$'s are block-diagonal, and the following {\em spectral gap condition}
is assumed:$$\limsup_{N\to\infty}
\frac{\lambda_2(\Gamma_N)}{\lambda_{\max}(\Gamma_N)}<1,$$where
$\lambda_2(\Gamma_N)$ is the second largest eigenvalue of $\Gamma_N$, we prove
Gaussian fluctuations for $\lambda_{\max}(S_N)/\lambda_{\max}(\Gamma_N)$ at the
scale $\sqrt{n}$.In the particular case where $Z_N$ has i.i.d. Gaussian entries
and $\Gamma_N$ is the $N\times N$ autocovariance matrix of a long memory
Gaussian stationary process $({\mathcal X}_t)_{t\in\mathbb{Z}}$, the columns of
$\Gamma_N^{1/2} Z_N$ can be considered as $n$ i.i.d. samples of the random
vector $({\mathcal X}_1,\dots,{\mathcal X}_N)^T$. We then prove that $\Gamma_N$
is similar to a diagonal matrix which satisfies all the required assumptions of
our theorems, hence our results apply to this case.
| math.PR | given a large sample covariance matrix s_nfrac 1ngamma_n12z_n z_ngamma_n12 where z_n is a ntimes n matrix with iid centered entries and gamma_n is a ntimes n deterministic hermitian positive semidefinite matrix we study the location and fluctuations of lambda_maxs_n the largest eigenvalue of s_n as nntoinfty and nn1 to rin0infty in the case where the empirical distribution mugamma_n of eigenvalues of gamma_n is tight in n and lambda_maxgamma_n goes to infty these conditions are in particular met when mugamma_n weakly converges to a probability measure with unbounded support on mathbbr we prove that asymptotically lambda_maxs_nsim lambda_maxgamma_n moreover when the gamma_ns are blockdiagonal and the following em spectral gap condition is assumedlimsup_ntoinfty fraclambda_2gamma_nlambda_maxgamma_n1where lambda_2gamma_n is the second largest eigenvalue of gamma_n we prove gaussian fluctuations for lambda_maxs_nlambda_maxgamma_n at the scale sqrtnin the particular case where z_n has iid gaussian entries and gamma_n is the ntimes n autocovariance matrix of a long memory gaussian stationary process mathcal x_t_tinmathbbz the columns of gamma_n12 z_n can be considered as n iid samples of the random vector mathcal x_1dotsmathcal x_nt we then prove that gamma_n is similar to a diagonal matrix which satisfies all the required assumptions of our theorems hence our results apply to this case | [['given', 'a', 'large', 'sample', 'covariance', 'matrix', 's_nfrac', '1ngamma_n12z_n', 'z_ngamma_n12', 'where', 'z_n', 'is', 'a', 'ntimes', 'n', 'matrix', 'with', 'iid', 'centered', 'entries', 'and', 'gamma_n', 'is', 'a', 'ntimes', 'n', 'deterministic', 'hermitian', 'positive', 'semidefinite', 'matrix', 'we', 'study', 'the', 'location', 'and', 'fluctuations', 'of', 'lambda_maxs_n', 'the', 'largest', 'eigenvalue', 'of', 's_n', 'as', 'nntoinfty', 'and', 'nn1', 'to', 'rin0infty', 'in', 'the', 'case', 'where', 'the', 'empirical', 'distribution', 'mugamma_n', 'of', 'eigenvalues', 'of', 'gamma_n', 'is', 'tight', 'in', 'n', 'and', 'lambda_maxgamma_n', 'goes', 'to', 'infty', 'these', 'conditions', 'are', 'in', 'particular', 'met', 'when', 'mugamma_n', 'weakly', 'converges', 'to', 'a', 'probability', 'measure', 'with', 'unbounded', 'support', 'on', 'mathbbr', 'we', 'prove', 'that', 'asymptotically', 'lambda_maxs_nsim', 'lambda_maxgamma_n', 'moreover', 'when', 'the', 'gamma_ns', 'are', 'blockdiagonal', 'and', 'the', 'following', 'em', 'spectral', 'gap', 'condition', 'is', 'assumedlimsup_ntoinfty', 'fraclambda_2gamma_nlambda_maxgamma_n1where', 'lambda_2gamma_n', 'is', 'the', 'second', 'largest', 'eigenvalue', 'of', 'gamma_n', 'we', 'prove', 'gaussian', 'fluctuations', 'for', 'lambda_maxs_nlambda_maxgamma_n', 'at', 'the', 'scale', 'sqrtnin', 'the', 'particular', 'case', 'where', 'z_n', 'has', 'iid', 'gaussian', 'entries', 'and', 'gamma_n', 'is', 'the', 'ntimes', 'n', 'autocovariance', 'matrix', 'of', 'a', 'long', 'memory', 'gaussian', 'stationary', 'process', 'mathcal', 'x_t_tinmathbbz', 'the', 'columns', 'of', 'gamma_n12', 'z_n', 'can', 'be', 'considered', 'as', 'n', 'iid', 'samples', 'of', 'the', 'random', 'vector', 'mathcal', 'x_1dotsmathcal', 'x_nt', 'we', 'then', 'prove', 'that', 'gamma_n', 'is', 'similar', 'to', 'a', 'diagonal', 'matrix', 'which', 'satisfies', 'all', 'the', 'required', 'assumptions', 'of', 'our', 'theorems', 'hence', 'our', 'results', 'apply', 'to', 'this', 'case']] | [-0.1242371686503932, 0.16799879597652684, -0.022953588082405028, 0.04008940925547405, -0.00837048273959187, -0.15881869520476308, 0.022810139716477683, 0.3593642543688396, -0.2509692952096943, -0.1730909189034093, 0.15222270625032563, -0.34613123112007654, -0.14202919557580465, 0.08372066483171957, -0.055775132380746384, 0.09888313615757857, 0.03807953790691431, 0.12616388533284428, -0.07653688786361086, -0.26603549844785646, 0.3169143307097857, -0.007567292980609402, 0.23158460275535422, -6.7985646667019014e-06, 0.06414650770915692, -0.0025575782287545422, 0.014509998223436396, -0.0434694141981953, -0.11515902038652673, 0.03620127412135042, 0.2533559933535114, 0.1083220354286373, 0.25929789199563924, -0.3770087920077272, -0.10822820260379744, 0.24562940572047987, 0.1875971899247698, -0.0038156673066212887, 0.023638552962301638, -0.2674792049094654, 0.16044906645722848, -0.1010151644780611, -0.15340156007654493, -0.02191936952858082, 0.0667795474911409, 0.022862817830486243, -0.43597333998699744, 0.06832336677771603, 0.11680788404097961, -0.0076084615567558874, 0.013267832660486782, -0.2157482132866418, 0.026714525335738735, 0.09295747066398592, 0.039955861913885234, 0.008656336385781766, 0.09762925019497753, -0.027654205561585484, -0.03725484846990996, 0.3310416885451364, -0.08978545488489251, -0.2425650014211574, 0.04644448882199183, -0.2021358262557256, -0.15369725524277617, 0.09422533435156188, 0.14262519855996073, 0.1261530137390539, -0.0817760428952326, 0.20981178871638853, -0.1544588010693069, 0.1484463248803701, 0.053602539205683336, 0.016153462544103624, 0.07161490593395967, 0.07398412827282183, 0.12189224961724493, 0.15246089314603778, -0.04531942905860663, -0.08670071252216134, -0.33047600116540665, -0.1414412031280658, -0.3260773532399257, 0.18044135464675803, -0.19507530166079687, -0.20323102281338745, 0.3318742997493715, 0.09274152165494098, 0.24877383004293793, 0.16752768814456098, 0.19342767364115163, 0.14321657452013803, -0.019909779351550125, 0.12221026021025834, 0.05525190933978045, 0.2127367904590022, 0.0189022129646913, -0.15740238976309961, 0.057581221209137994, 0.08212284251899829] |
1,802.01875 | Integrated design optimization of structural bending filter and gain
schedules for rocket attitude control system | This paper proposes an integrated design optimization framework for the gain
schedules and bending filter for the longitudinal control of a rocket during
its ascent flight. Dynamic models representing the pitch/yaw motion of a rocket
considering the elements such as the rigid body dynamics, aerodynamics,
sloshing, bending, sensor/actuator, and flight computer are introduced. The
linear proportional and differential (PD) control law with scheduled
(time-varying) gains and bending filter parameters are identified as key
decision variables for stabilizing the pitch/yaw motion of the rocket. The
integrated optimal design problem that determines the decision variables to
minimize the worst-case peak associated with the first bending mode with
constraints on the stability margins during the flight of the rocket is
mathematically formulated. A case study on design of gain schedules and bending
filter for an actual sounding rocket using the proposed framework is conducted
to demonstrate its effectiveness.
| math.OC | this paper proposes an integrated design optimization framework for the gain schedules and bending filter for the longitudinal control of a rocket during its ascent flight dynamic models representing the pitchyaw motion of a rocket considering the elements such as the rigid body dynamics aerodynamics sloshing bending sensoractuator and flight computer are introduced the linear proportional and differential pd control law with scheduled timevarying gains and bending filter parameters are identified as key decision variables for stabilizing the pitchyaw motion of the rocket the integrated optimal design problem that determines the decision variables to minimize the worstcase peak associated with the first bending mode with constraints on the stability margins during the flight of the rocket is mathematically formulated a case study on design of gain schedules and bending filter for an actual sounding rocket using the proposed framework is conducted to demonstrate its effectiveness | [['this', 'paper', 'proposes', 'an', 'integrated', 'design', 'optimization', 'framework', 'for', 'the', 'gain', 'schedules', 'and', 'bending', 'filter', 'for', 'the', 'longitudinal', 'control', 'of', 'a', 'rocket', 'during', 'its', 'ascent', 'flight', 'dynamic', 'models', 'representing', 'the', 'pitchyaw', 'motion', 'of', 'a', 'rocket', 'considering', 'the', 'elements', 'such', 'as', 'the', 'rigid', 'body', 'dynamics', 'aerodynamics', 'sloshing', 'bending', 'sensoractuator', 'and', 'flight', 'computer', 'are', 'introduced', 'the', 'linear', 'proportional', 'and', 'differential', 'pd', 'control', 'law', 'with', 'scheduled', 'timevarying', 'gains', 'and', 'bending', 'filter', 'parameters', 'are', 'identified', 'as', 'key', 'decision', 'variables', 'for', 'stabilizing', 'the', 'pitchyaw', 'motion', 'of', 'the', 'rocket', 'the', 'integrated', 'optimal', 'design', 'problem', 'that', 'determines', 'the', 'decision', 'variables', 'to', 'minimize', 'the', 'worstcase', 'peak', 'associated', 'with', 'the', 'first', 'bending', 'mode', 'with', 'constraints', 'on', 'the', 'stability', 'margins', 'during', 'the', 'flight', 'of', 'the', 'rocket', 'is', 'mathematically', 'formulated', 'a', 'case', 'study', 'on', 'design', 'of', 'gain', 'schedules', 'and', 'bending', 'filter', 'for', 'an', 'actual', 'sounding', 'rocket', 'using', 'the', 'proposed', 'framework', 'is', 'conducted', 'to', 'demonstrate', 'its', 'effectiveness']] | [-0.1239610400243566, 0.09304946119363162, -0.07773107734573041, -0.01814764890707387, -0.10604578416537622, -0.14314985687940798, 0.004016402823818398, 0.38917259943896326, -0.297344205432154, -0.32530856706073574, 0.14647754556659995, -0.21989831233975188, -0.16922483102514826, 0.2011182477761959, -0.14140262511590945, 0.13124455909710378, 0.06973020544853703, -0.016444167864091436, 0.00747612957393044, -0.19191350805862198, 0.20192963740756287, 0.14388376962521982, 0.2895254449629835, -0.044946137449607765, 0.18970492571142727, 0.06483477767043072, -0.03398312507839552, 0.014467272027556238, -0.11272883714073345, 0.09979938601930465, 0.22947032786376376, 0.12130203688304454, 0.33027917984230765, -0.408414700627327, -0.18498693553746903, 0.06305055800696899, 0.068295470241393, 0.013287181458596526, -0.0315230077598244, -0.28138907352494524, 0.026834243063911283, -0.1694665950028515, -0.10674785131524349, -0.013318299555123366, 0.009370539909035995, 0.027684877881908727, -0.3004859798812661, -0.003548455109883999, 0.029115126693043215, 0.051942766515602326, -0.12876721554243103, -0.09869243808026458, -0.03706500340124656, 0.15167859490190086, 0.065686794919572, -0.03868240748756918, 0.19852077307516774, -0.09037119195282717, -0.1473792368192868, 0.4169396876261152, -0.012474920253815322, -0.21833408160841672, 0.10827046231334579, -0.06255325606927789, -0.03825055446058255, 0.1560917069557412, 0.2702625298166069, 0.0918956483997794, -0.17583752413248194, 0.004607787344139069, 0.025304646147736188, 0.15216599632022454, 0.07084283314902207, -0.045312121654619814, 0.18735322280273098, 0.21817483030388068, 0.13732494487716207, 0.16621950212685424, -0.12634077691673784, -0.13037799868877206, -0.31473533768560097, -0.13532474144394027, -0.12838408673354745, -0.04771354329804408, -0.07416840283278424, -0.1311550248189476, 0.38153017321280364, 0.11553046361383669, 0.12287441009077532, 0.09593193976786629, 0.3431699086446315, 0.12938610546226645, 0.03834728705696762, 0.07332857064902783, 0.2856343448290537, 0.10129441823168048, 0.1510864607475955, -0.3182828592393419, 0.10391126951716584, 0.0305329745956536] |
1,802.01876 | Testing the criterion for correct convergence in the complex Langevin
method | Recently the complex Langevin method (CLM) has been attracting attention as a
solution to the sign problem, which occurs in Monte Carlo calculations when the
effective Boltzmann weight is not real positive. An undesirable feature of the
method, however, was that it can happen in some parameter regions that the
method yields wrong results even if the Langevin process reaches equilibrium
without any problem. In our previous work, we proposed a practical criterion
for correct convergence based on the probability distribution of the drift term
that appears in the complex Langevin equation. Here we demonstrate the
usefulness of this criterion in two solvable theories with many dynamical
degrees of freedom, i.e., two-dimensional Yang-Mills theory with a complex
coupling constant and the chiral Random Matrix Theory for finite density QCD,
which were studied by the CLM before. Our criterion can indeed tell the
parameter regions in which the CLM gives correct results.
| hep-lat | recently the complex langevin method clm has been attracting attention as a solution to the sign problem which occurs in monte carlo calculations when the effective boltzmann weight is not real positive an undesirable feature of the method however was that it can happen in some parameter regions that the method yields wrong results even if the langevin process reaches equilibrium without any problem in our previous work we proposed a practical criterion for correct convergence based on the probability distribution of the drift term that appears in the complex langevin equation here we demonstrate the usefulness of this criterion in two solvable theories with many dynamical degrees of freedom ie twodimensional yangmills theory with a complex coupling constant and the chiral random matrix theory for finite density qcd which were studied by the clm before our criterion can indeed tell the parameter regions in which the clm gives correct results | [['recently', 'the', 'complex', 'langevin', 'method', 'clm', 'has', 'been', 'attracting', 'attention', 'as', 'a', 'solution', 'to', 'the', 'sign', 'problem', 'which', 'occurs', 'in', 'monte', 'carlo', 'calculations', 'when', 'the', 'effective', 'boltzmann', 'weight', 'is', 'not', 'real', 'positive', 'an', 'undesirable', 'feature', 'of', 'the', 'method', 'however', 'was', 'that', 'it', 'can', 'happen', 'in', 'some', 'parameter', 'regions', 'that', 'the', 'method', 'yields', 'wrong', 'results', 'even', 'if', 'the', 'langevin', 'process', 'reaches', 'equilibrium', 'without', 'any', 'problem', 'in', 'our', 'previous', 'work', 'we', 'proposed', 'a', 'practical', 'criterion', 'for', 'correct', 'convergence', 'based', 'on', 'the', 'probability', 'distribution', 'of', 'the', 'drift', 'term', 'that', 'appears', 'in', 'the', 'complex', 'langevin', 'equation', 'here', 'we', 'demonstrate', 'the', 'usefulness', 'of', 'this', 'criterion', 'in', 'two', 'solvable', 'theories', 'with', 'many', 'dynamical', 'degrees', 'of', 'freedom', 'ie', 'twodimensional', 'yangmills', 'theory', 'with', 'a', 'complex', 'coupling', 'constant', 'and', 'the', 'chiral', 'random', 'matrix', 'theory', 'for', 'finite', 'density', 'qcd', 'which', 'were', 'studied', 'by', 'the', 'clm', 'before', 'our', 'criterion', 'can', 'indeed', 'tell', 'the', 'parameter', 'regions', 'in', 'which', 'the', 'clm', 'gives', 'correct', 'results']] | [-0.08404615996343805, 0.1137725323114262, -0.13438240430064943, 0.0508006545087302, -0.07540414150841288, -0.14483334415897553, 0.035533970147864705, 0.3594707902274187, -0.24156271054761003, -0.2679579295156314, 0.0718053854517762, -0.2421446598955239, -0.2023663590199604, 0.16780666878527117, -0.0380196976591062, 0.08495982096141932, 0.07592117703143532, 0.06829966554751261, -0.07144980176987238, -0.2731476062554126, 0.2884048080620732, 0.052732438694019584, 0.27305779513896794, 0.0779952337743332, 0.13080716552429666, -0.010873661126744077, 0.022665434137652846, 0.0349216681615209, -0.12190804739912706, 0.05532414588879868, 0.22860394790151853, 0.09211325683840704, 0.3066084257061809, -0.39821752721431436, -0.2710486671498773, 0.1258226386148063, 0.15161966443653926, 0.15704547539307112, -0.0458589176198665, -0.2593759102569523, 0.09943180201291446, -0.15802295307400605, -0.15936474968981468, -0.11066501644805816, -0.0020390334631630916, -0.032838274361658225, -0.2883952820692088, 0.09911871758279613, 0.07132390421095909, 0.017559547116078895, -0.04373916084662277, -0.11995111322277133, -0.009700179559530208, 0.07415208204079647, 0.0507349891513694, 0.044725501039435483, 0.10324792784410498, -0.14390516606628254, -0.10528561286011476, 0.3687948299115462, -0.058544769197770255, -0.26295669582851283, 0.16820586303908946, -0.12825133884634007, -0.1440755278026278, 0.15493842593659432, 0.11020936474623468, 0.15464791548685078, -0.14411358360098198, 0.13083560325919238, -0.05964123200862637, 0.13664930232334882, 0.027575315164389793, -0.03784631183432625, 0.141006564191043, 0.12354709050581106, 0.05891147088714326, 0.10796008928870128, -0.05183096412131378, -0.1952039072203715, -0.2762794785929338, -0.1307115340790409, -0.20678840945505642, 0.05041488688078706, -0.11800731770107939, -0.1750528224102462, 0.3682769515200068, 0.1917905804095173, 0.19303497937600442, 0.043180777878648546, 0.2701693881821159, 0.15341341895257918, 0.03532865429944698, 0.042512097687380304, 0.22896657203033485, 0.13045789568919366, 0.08196361016001034, -0.23404606456856014, 0.07135369349521622, 0.10367654752917588] |
1,802.01877 | Testing for equivalence: an intersection-union permutation solution | The notion of testing for equivalence of two treatments is widely used in
clinical trials, pharmaceutical experiments,bioequivalence and quality control.
It is essentially approached within the intersection-union (IU) principle.
According to this principle the null hypothesis is stated as the set of effects
lying outside a suitably established interval and the alternative as the set of
effects lying inside that interval. The solutions provided in the literature
are mostly based on likelihood techniques, which in turn are rather difficult
to handle, except for cases lying within the regular exponential family and the
invariance principle. The main goal of present paper is to go beyond most of
the limitations of likelihood based methods, i.e. to work in a nonparametric
setting within the permutation frame. To obtain practical solutions, a new IU
permutation test is presented and discussed. A simple simulation study for
evaluating its main properties, and three application examples are also
presented.
| stat.AP | the notion of testing for equivalence of two treatments is widely used in clinical trials pharmaceutical experimentsbioequivalence and quality control it is essentially approached within the intersectionunion iu principle according to this principle the null hypothesis is stated as the set of effects lying outside a suitably established interval and the alternative as the set of effects lying inside that interval the solutions provided in the literature are mostly based on likelihood techniques which in turn are rather difficult to handle except for cases lying within the regular exponential family and the invariance principle the main goal of present paper is to go beyond most of the limitations of likelihood based methods ie to work in a nonparametric setting within the permutation frame to obtain practical solutions a new iu permutation test is presented and discussed a simple simulation study for evaluating its main properties and three application examples are also presented | [['the', 'notion', 'of', 'testing', 'for', 'equivalence', 'of', 'two', 'treatments', 'is', 'widely', 'used', 'in', 'clinical', 'trials', 'pharmaceutical', 'experimentsbioequivalence', 'and', 'quality', 'control', 'it', 'is', 'essentially', 'approached', 'within', 'the', 'intersectionunion', 'iu', 'principle', 'according', 'to', 'this', 'principle', 'the', 'null', 'hypothesis', 'is', 'stated', 'as', 'the', 'set', 'of', 'effects', 'lying', 'outside', 'a', 'suitably', 'established', 'interval', 'and', 'the', 'alternative', 'as', 'the', 'set', 'of', 'effects', 'lying', 'inside', 'that', 'interval', 'the', 'solutions', 'provided', 'in', 'the', 'literature', 'are', 'mostly', 'based', 'on', 'likelihood', 'techniques', 'which', 'in', 'turn', 'are', 'rather', 'difficult', 'to', 'handle', 'except', 'for', 'cases', 'lying', 'within', 'the', 'regular', 'exponential', 'family', 'and', 'the', 'invariance', 'principle', 'the', 'main', 'goal', 'of', 'present', 'paper', 'is', 'to', 'go', 'beyond', 'most', 'of', 'the', 'limitations', 'of', 'likelihood', 'based', 'methods', 'ie', 'to', 'work', 'in', 'a', 'nonparametric', 'setting', 'within', 'the', 'permutation', 'frame', 'to', 'obtain', 'practical', 'solutions', 'a', 'new', 'iu', 'permutation', 'test', 'is', 'presented', 'and', 'discussed', 'a', 'simple', 'simulation', 'study', 'for', 'evaluating', 'its', 'main', 'properties', 'and', 'three', 'application', 'examples', 'are', 'also', 'presented']] | [-0.07119379693099501, 0.03876501718992429, -0.08038251375623776, 0.10057771784432282, -0.06693888372673795, -0.13049765474267846, 0.07612852894913849, 0.3507031076248513, -0.24266782648852156, -0.2825460203966459, 0.15497132056390417, -0.22970137954072792, -0.11437669449442664, 0.2307516775704575, -0.08640716707608385, 0.08142837301391602, 0.036747151331988394, 0.056648314193458546, -0.05634841667519056, -0.24926402548710438, 0.3216772640404594, 0.03179291184892915, 0.311282950294642, 0.025477865084062103, 0.08103235883465568, 0.006449238748739886, -0.016938468641817372, 0.041950778996019025, -0.12188893159573307, 0.13641904650058673, 0.27987796834219764, 0.17635248015196808, 0.3181179902633492, -0.3647926364538093, -0.18329409776958605, 0.09785191433670752, 0.12238276445087884, 0.0850483559292513, -0.03283210224641598, -0.2552131615727153, 0.1009217579425035, -0.13083880173893558, -0.14055409770619298, -0.048191552649449486, 0.001961244862304618, 0.021911297639560522, -0.27843053770615467, 0.058028576798260595, 0.07489456441438455, 0.060998935323356596, -0.028949307162925257, -0.12065665795165577, 0.044296790622113065, 0.11357090493127556, 0.09898194732469821, 0.013468440154888081, 0.10945809952643336, -0.058813735279902225, -0.11173884174632316, 0.4066778829345165, -0.0022831288789281782, -0.22943244020559436, 0.1991793313310389, -0.10274913611155718, -0.15451636396052426, 0.07028836773366155, 0.16043839891694042, 0.13975652140435696, -0.18811139388284367, 0.08602939647990926, -0.022429574077443178, 0.11024756500819723, 0.08032242807140265, 0.0061206690278420815, 0.16855902645570406, 0.16979250556092387, 0.045033681338239734, 0.13721075798199814, -0.06305718413609641, -0.12302377635754941, -0.3705617631878087, -0.13433994235014482, -0.17920123038671615, -0.017298016849818906, -0.04727227978255301, -0.19428319231119773, 0.3779235383054698, 0.168640957106389, 0.1622658967170001, 0.0797068577588209, 0.27254797742757575, 0.08678491807882736, 0.038969418092550626, 0.04477375660904811, 0.23833944845639343, 0.13702090203435166, 0.02473393729764549, -0.14142908705691407, 0.08326257231632951, 0.06593177869872788] |
1,802.01878 | Localizing Weak Convergence in $\boldsymbol{ L_\infty}$ | In a general measure space $(X,\mathcal L,\lambda)$, a characterization of
weakly null sequences in $L_\infty (X,\mathcal L,\lambda)$ ($u_k
\rightharpoonup 0$) in terms of their pointwise behaviour almost everywhere is
derived from the Yosida-Hewitt identification of $L_\infty (X,\mathcal
L,\lambda)^*$ with finitely additive measures, and extreme points of the unit
ball in $L_\infty (X,\mathcal L,\lambda)^*$ with $\pm \mathfrak G$, where
$\mathfrak G$ denotes the set of finitely additive measures that take only
values 0 or $ 1$. When $(X,\tau)$ is a locally compact Hausdorff space with
Borel $\sigma$-algebra $\mathcal B$, the well-known identification of
$\mathfrak G$ with ultrafilters means that this criterion for nullity is
equivalent to localized behaviour on open neighbourhoods of points $x_0$ in the
one-point compactification of $X$. Notions of weak convergence at $x_0$ and the
essential range of $u$ at $x_0$ are natural consequences.When a finitely
additive measure $\nu$ represents $f \in L_\infty(X, \mathcal B, \lambda)^*$
and $\hat \nu$ is the Borel measure representing $f$ restricted to
$C_0(X,\tau)$, a minimax formula for $\hat \nu$ in terms $\nu$ is derived and
those $\nu$ for which $\hat \nu$ is singular with respect to $\lambda$ are
characterized.
| math.FA | in a general measure space xmathcal llambda a characterization of weakly null sequences in l_infty xmathcal llambda u_k rightharpoonup 0 in terms of their pointwise behaviour almost everywhere is derived from the yosidahewitt identification of l_infty xmathcal llambda with finitely additive measures and extreme points of the unit ball in l_infty xmathcal llambda with pm mathfrak g where mathfrak g denotes the set of finitely additive measures that take only values 0 or 1 when xtau is a locally compact hausdorff space with borel sigmaalgebra mathcal b the wellknown identification of mathfrak g with ultrafilters means that this criterion for nullity is equivalent to localized behaviour on open neighbourhoods of points x_0 in the onepoint compactification of x notions of weak convergence at x_0 and the essential range of u at x_0 are natural consequenceswhen a finitely additive measure nu represents f in l_inftyx mathcal b lambda and hat nu is the borel measure representing f restricted to c_0xtau a minimax formula for hat nu in terms nu is derived and those nu for which hat nu is singular with respect to lambda are characterized | [['in', 'a', 'general', 'measure', 'space', 'xmathcal', 'llambda', 'a', 'characterization', 'of', 'weakly', 'null', 'sequences', 'in', 'l_infty', 'xmathcal', 'llambda', 'u_k', 'rightharpoonup', '0', 'in', 'terms', 'of', 'their', 'pointwise', 'behaviour', 'almost', 'everywhere', 'is', 'derived', 'from', 'the', 'yosidahewitt', 'identification', 'of', 'l_infty', 'xmathcal', 'llambda', 'with', 'finitely', 'additive', 'measures', 'and', 'extreme', 'points', 'of', 'the', 'unit', 'ball', 'in', 'l_infty', 'xmathcal', 'llambda', 'with', 'pm', 'mathfrak', 'g', 'where', 'mathfrak', 'g', 'denotes', 'the', 'set', 'of', 'finitely', 'additive', 'measures', 'that', 'take', 'only', 'values', '0', 'or', '1', 'when', 'xtau', 'is', 'a', 'locally', 'compact', 'hausdorff', 'space', 'with', 'borel', 'sigmaalgebra', 'mathcal', 'b', 'the', 'wellknown', 'identification', 'of', 'mathfrak', 'g', 'with', 'ultrafilters', 'means', 'that', 'this', 'criterion', 'for', 'nullity', 'is', 'equivalent', 'to', 'localized', 'behaviour', 'on', 'open', 'neighbourhoods', 'of', 'points', 'x_0', 'in', 'the', 'onepoint', 'compactification', 'of', 'x', 'notions', 'of', 'weak', 'convergence', 'at', 'x_0', 'and', 'the', 'essential', 'range', 'of', 'u', 'at', 'x_0', 'are', 'natural', 'consequenceswhen', 'a', 'finitely', 'additive', 'measure', 'nu', 'represents', 'f', 'in', 'l_inftyx', 'mathcal', 'b', 'lambda', 'and', 'hat', 'nu', 'is', 'the', 'borel', 'measure', 'representing', 'f', 'restricted', 'to', 'c_0xtau', 'a', 'minimax', 'formula', 'for', 'hat', 'nu', 'in', 'terms', 'nu', 'is', 'derived', 'and', 'those', 'nu', 'for', 'which', 'hat', 'nu', 'is', 'singular', 'with', 'respect', 'to', 'lambda', 'are', 'characterized']] | [-0.17338225931126836, 0.1304535719228315, -0.05338485150055571, 0.03909807797114539, -0.054507013415446975, -0.1806058452597686, 0.02036504465242295, 0.3493655526621656, -0.3310891723024894, -0.11643887435087351, 0.0670913619834899, -0.3078627696677858, -0.0486071881630898, 0.1766272972243234, -0.13925039288229668, 0.028011535703166834, 0.03475235163229057, 0.16367295881794705, -0.07390997100590758, -0.18810379582938258, 0.35234874118487913, -0.06802463938308122, 0.19570219428483193, -0.023811161685683816, 0.12642590424002265, -0.050485808322983945, -7.913559982246095e-05, -0.010612453742446583, -0.2692648363124565, 0.06925638557404054, 0.28517449109630844, 0.08897195076876944, 0.2913485348101828, -0.22773652220564475, -0.07621368571442992, 0.2519912833787992, 0.12219105044297957, -0.1668634197481519, 0.07386107748799067, -0.32901407918729053, 0.17870702634944202, -0.10826415337294668, -0.13488118428286616, -0.07924631639680528, 0.1704883540438099, 0.00533858794529646, -0.3840245164030201, 0.06023410192670321, 0.09199278939650957, 0.09659613939360358, -0.044771659919725995, -0.146018220499992, -0.08860851343654629, 0.05707117897067552, 0.00024880735705105157, 0.17053845336028775, 0.11028366580677147, -0.050317694109373284, -0.059121214759735655, 0.3702624176518869, -0.11031737827163722, -0.2940851944795513, 0.13003386021847582, -0.2852572451229207, -0.12801302723320468, 0.13035870103963784, 0.052343943872703955, 0.129126147865983, -0.03452252150664508, 0.32636223273520654, -0.09693739939465669, 0.061364843274062435, 0.08446500279331723, 0.06662214641071662, 0.10586734239816675, 0.08373011369002308, 0.1255934570703635, 0.08168794533780234, 0.006822667981416069, 0.03107185721663492, -0.3910491201779703, -0.11847812967927573, -0.17239153417528372, 0.17913566681090742, -0.1256535236898344, -0.2250735981499899, 0.292805399070238, 0.025826582923380578, 0.20730995952860443, 0.12720052614503613, 0.18323435582691333, 0.0991380624710563, -0.02874617989924685, 0.07983641929228555, 0.07531824887597136, 0.19850272836245514, -0.0728103499680471, -0.14243000621810187, 0.005973474473109121, 0.18283430436257642] |
1,802.01879 | Effect of motility on the transport of bacteria populations through a
porous medium | The role of activity on the hydrodynamic dispersion of bacteria in a model
porous medium is studied by tracking thousands of bacteria in a microfluidic
chip containing randomly placed pillars. We first evaluate the spreading
dynamics of two populations of motile and non-motile bacteria injected at
different flow rates. In both cases, we observe that the mean and the variance
of the distances covered by the bacteria vary linearly with time and flow
velocity, a result qualitatively consistent with the standard geometric
dispersion picture. However, quantitatively, the motiles bacteria display a
systematic retardation effect when compared to the non-motile ones.
Furthermore, the shape of the traveled distance distribution in the flow
direction differs significantly for both the motile and the non-motile strain,
hence probing a markedly different exploration process. For the non-motile
bacteria, the distribution is Gaussian whereas for the motile ones, the
distribution displays a positive skewness and spreads exponentially downstream
akin to a Gamma distribution. The detailed microscopic study of the
trajectories reveals two salient effects characterizing the exploration process
of motile bacteria : (i) The emergence of an "active" retention effect due to
an extended exploration of the pore surfaces, (ii) an enhanced spreading at the
forefront due to the transport of bacteria along "fast-tracks" where they
acquire a velocity larger than the local flow velocity. We finally discuss the
practical applications of these effects on the large-scale macroscopic transfer
and contamination processes caused by microbes in natural environments.
| physics.flu-dyn cond-mat.soft physics.bio-ph | the role of activity on the hydrodynamic dispersion of bacteria in a model porous medium is studied by tracking thousands of bacteria in a microfluidic chip containing randomly placed pillars we first evaluate the spreading dynamics of two populations of motile and nonmotile bacteria injected at different flow rates in both cases we observe that the mean and the variance of the distances covered by the bacteria vary linearly with time and flow velocity a result qualitatively consistent with the standard geometric dispersion picture however quantitatively the motiles bacteria display a systematic retardation effect when compared to the nonmotile ones furthermore the shape of the traveled distance distribution in the flow direction differs significantly for both the motile and the nonmotile strain hence probing a markedly different exploration process for the nonmotile bacteria the distribution is gaussian whereas for the motile ones the distribution displays a positive skewness and spreads exponentially downstream akin to a gamma distribution the detailed microscopic study of the trajectories reveals two salient effects characterizing the exploration process of motile bacteria i the emergence of an active retention effect due to an extended exploration of the pore surfaces ii an enhanced spreading at the forefront due to the transport of bacteria along fasttracks where they acquire a velocity larger than the local flow velocity we finally discuss the practical applications of these effects on the largescale macroscopic transfer and contamination processes caused by microbes in natural environments | [['the', 'role', 'of', 'activity', 'on', 'the', 'hydrodynamic', 'dispersion', 'of', 'bacteria', 'in', 'a', 'model', 'porous', 'medium', 'is', 'studied', 'by', 'tracking', 'thousands', 'of', 'bacteria', 'in', 'a', 'microfluidic', 'chip', 'containing', 'randomly', 'placed', 'pillars', 'we', 'first', 'evaluate', 'the', 'spreading', 'dynamics', 'of', 'two', 'populations', 'of', 'motile', 'and', 'nonmotile', 'bacteria', 'injected', 'at', 'different', 'flow', 'rates', 'in', 'both', 'cases', 'we', 'observe', 'that', 'the', 'mean', 'and', 'the', 'variance', 'of', 'the', 'distances', 'covered', 'by', 'the', 'bacteria', 'vary', 'linearly', 'with', 'time', 'and', 'flow', 'velocity', 'a', 'result', 'qualitatively', 'consistent', 'with', 'the', 'standard', 'geometric', 'dispersion', 'picture', 'however', 'quantitatively', 'the', 'motiles', 'bacteria', 'display', 'a', 'systematic', 'retardation', 'effect', 'when', 'compared', 'to', 'the', 'nonmotile', 'ones', 'furthermore', 'the', 'shape', 'of', 'the', 'traveled', 'distance', 'distribution', 'in', 'the', 'flow', 'direction', 'differs', 'significantly', 'for', 'both', 'the', 'motile', 'and', 'the', 'nonmotile', 'strain', 'hence', 'probing', 'a', 'markedly', 'different', 'exploration', 'process', 'for', 'the', 'nonmotile', 'bacteria', 'the', 'distribution', 'is', 'gaussian', 'whereas', 'for', 'the', 'motile', 'ones', 'the', 'distribution', 'displays', 'a', 'positive', 'skewness', 'and', 'spreads', 'exponentially', 'downstream', 'akin', 'to', 'a', 'gamma', 'distribution', 'the', 'detailed', 'microscopic', 'study', 'of', 'the', 'trajectories', 'reveals', 'two', 'salient', 'effects', 'characterizing', 'the', 'exploration', 'process', 'of', 'motile', 'bacteria', 'i', 'the', 'emergence', 'of', 'an', 'active', 'retention', 'effect', 'due', 'to', 'an', 'extended', 'exploration', 'of', 'the', 'pore', 'surfaces', 'ii', 'an', 'enhanced', 'spreading', 'at', 'the', 'forefront', 'due', 'to', 'the', 'transport', 'of', 'bacteria', 'along', 'fasttracks', 'where', 'they', 'acquire', 'a', 'velocity', 'larger', 'than', 'the', 'local', 'flow', 'velocity', 'we', 'finally', 'discuss', 'the', 'practical', 'applications', 'of', 'these', 'effects', 'on', 'the', 'largescale', 'macroscopic', 'transfer', 'and', 'contamination', 'processes', 'caused', 'by', 'microbes', 'in', 'natural', 'environments']] | [-0.11125925538192452, 0.20417159667527682, -0.08394076758274754, 0.03246185450216331, -0.011362861040161307, -0.11001709331543999, 0.017356482364147684, 0.35720267671717637, -0.28675642265342993, -0.27248478643245466, 0.02235191566898842, -0.29534625064140324, -0.14870289323469585, 0.18048327828359997, -0.041265023895575875, -0.01061915216390745, 0.024620780729100296, -0.01671673583498061, 0.02297585783185336, -0.18165668339378913, 0.2600631414402167, 0.05249156290665269, 0.3210554419856939, 0.01804595551829567, 0.11910852380330718, -0.013568322242444156, -0.04068393206331493, 0.05497848729473882, -0.1555957959598151, 0.0982651462949906, 0.168456644854441, 0.045390892588771166, 0.2621208469395109, -0.4609350032449766, -0.260149065435939, 0.0980990337106598, 0.18735001127870762, 0.12916031011251664, -0.0704633057069727, -0.2730326388493009, 0.00973281219882197, -0.13086769076660432, -0.15976577627503755, 0.0021863286841317824, 0.05314590793130257, 0.06568014744043771, -0.21821454476719043, 0.12200976066899225, 0.03264773839687204, 0.08773025924293129, -0.07040398542975781, -0.10132125514232121, -0.057128015764361585, 0.16635142186245974, 0.07469597842011437, -0.027958708672558258, 0.25766444908236796, -0.1682200590686502, -0.05305287378127044, 0.3960051084420484, -0.047869320595541984, -0.190431411526162, 0.225741811971488, -0.17102270746782858, -0.045765584895862695, 0.16034237705326979, 0.23163897202595693, 0.1212443218768134, -0.14396109870737506, -0.022104116391963385, -0.005872548744861801, 0.12383525199539351, 0.06497581904777423, 0.0019306175461405242, 0.2053708422862804, 0.1908748170690198, 0.056864289980416795, 0.12061750458745349, -0.12826626465527272, -0.13661109523606102, -0.2357737919915795, -0.15650434251319398, -0.14468195628974914, 0.033511815600440094, -0.11779161665949553, -0.14977325134419653, 0.3960288942851921, 0.11263904496092178, 0.22968425176975368, 0.061368049786788524, 0.28015675783453503, 0.014003561427777781, 0.0642291639822391, 0.060319091262545234, 0.23029247006190995, 0.10159842898508059, 0.1305856525617414, -0.2775040574023056, 0.14053268944084737, -0.030448154781525662] |
1,802.0188 | Learning Image Representations by Completing Damaged Jigsaw Puzzles | In this paper, we explore methods of complicating self-supervised tasks for
representation learning. That is, we do severe damage to data and encourage a
network to recover them. First, we complicate each of three powerful
self-supervised task candidates: jigsaw puzzle, inpainting, and colorization.
In addition, we introduce a novel complicated self-supervised task called
"Completing damaged jigsaw puzzles" which is puzzles with one piece missing and
the other pieces without color. We train a convolutional neural network not
only to solve the puzzles, but also generate the missing content and colorize
the puzzles. The recovery of the aforementioned damage pushes the network to
obtain robust and general-purpose representations. We demonstrate that
complicating the self-supervised tasks improves their original versions and
that our final task learns more robust and transferable representations
compared to the previous methods, as well as the simple combination of our
candidate tasks. Our approach achieves state-of-the-art performance in transfer
learning on PASCAL classification and semantic segmentation.
| cs.CV | in this paper we explore methods of complicating selfsupervised tasks for representation learning that is we do severe damage to data and encourage a network to recover them first we complicate each of three powerful selfsupervised task candidates jigsaw puzzle inpainting and colorization in addition we introduce a novel complicated selfsupervised task called completing damaged jigsaw puzzles which is puzzles with one piece missing and the other pieces without color we train a convolutional neural network not only to solve the puzzles but also generate the missing content and colorize the puzzles the recovery of the aforementioned damage pushes the network to obtain robust and generalpurpose representations we demonstrate that complicating the selfsupervised tasks improves their original versions and that our final task learns more robust and transferable representations compared to the previous methods as well as the simple combination of our candidate tasks our approach achieves stateoftheart performance in transfer learning on pascal classification and semantic segmentation | [['in', 'this', 'paper', 'we', 'explore', 'methods', 'of', 'complicating', 'selfsupervised', 'tasks', 'for', 'representation', 'learning', 'that', 'is', 'we', 'do', 'severe', 'damage', 'to', 'data', 'and', 'encourage', 'a', 'network', 'to', 'recover', 'them', 'first', 'we', 'complicate', 'each', 'of', 'three', 'powerful', 'selfsupervised', 'task', 'candidates', 'jigsaw', 'puzzle', 'inpainting', 'and', 'colorization', 'in', 'addition', 'we', 'introduce', 'a', 'novel', 'complicated', 'selfsupervised', 'task', 'called', 'completing', 'damaged', 'jigsaw', 'puzzles', 'which', 'is', 'puzzles', 'with', 'one', 'piece', 'missing', 'and', 'the', 'other', 'pieces', 'without', 'color', 'we', 'train', 'a', 'convolutional', 'neural', 'network', 'not', 'only', 'to', 'solve', 'the', 'puzzles', 'but', 'also', 'generate', 'the', 'missing', 'content', 'and', 'colorize', 'the', 'puzzles', 'the', 'recovery', 'of', 'the', 'aforementioned', 'damage', 'pushes', 'the', 'network', 'to', 'obtain', 'robust', 'and', 'generalpurpose', 'representations', 'we', 'demonstrate', 'that', 'complicating', 'the', 'selfsupervised', 'tasks', 'improves', 'their', 'original', 'versions', 'and', 'that', 'our', 'final', 'task', 'learns', 'more', 'robust', 'and', 'transferable', 'representations', 'compared', 'to', 'the', 'previous', 'methods', 'as', 'well', 'as', 'the', 'simple', 'combination', 'of', 'our', 'candidate', 'tasks', 'our', 'approach', 'achieves', 'stateoftheart', 'performance', 'in', 'transfer', 'learning', 'on', 'pascal', 'classification', 'and', 'semantic', 'segmentation']] | [-0.0024506058422347553, -0.03405005942817919, -0.07338913797424469, 0.09216091202504202, -0.18107442340306654, -0.19487644623245903, 0.029362030045123465, 0.4484173886925925, -0.2895962913296645, -0.35898819736122517, 0.05337057508236458, -0.28033735194608944, -0.19518208427095338, 0.1517783674106438, -0.19160725166313822, 0.08793664232037868, 0.17522321250053902, 0.022628875201733054, -0.10037534900711072, -0.2896535558142711, 0.3044579201805276, 0.013888892809023397, 0.3021154629266998, 0.0481537378015869, 0.14064770188444894, -0.0021552133839577436, -0.04012127058533362, -0.027744601877801166, -0.04079214107944988, 0.19546025061590858, 0.31362034990216453, 0.2131143076628258, 0.30319940994045685, -0.43042301410172557, -0.22021948370516678, 0.10373548020703034, 0.15610829519831482, 0.1586809430066555, -0.05917690080103149, -0.32803488218614574, 0.10899384240649311, -0.15387376242824183, 0.018462433498883265, -0.1763860768096262, -0.059669259929723, -0.08127495367411536, -0.2567487552856343, 0.06514685831745184, 0.09118874417396876, -0.026960988246093068, -0.05412247006580988, -0.14373254473763222, 0.05804427637559468, 0.19754834466649196, 0.027279333134853763, 0.08114463487003423, 0.12508358659599966, -0.23959387690853032, -0.1927914692190641, 0.39237921409120285, -0.007828440885590036, -0.19990043699316964, 0.2156622284232002, -0.002806742681496883, -0.1982491594574214, 0.08155027350788063, 0.2102856174158522, 0.13294712588473967, -0.13532264118931622, -0.04411762206125533, -0.08156686355772463, 0.1845796318839693, 0.03513117320246146, -0.026023526803466573, 0.17721851364137675, 0.276628305853707, 0.03202427596942804, 0.1639380759881556, -0.12709654181553906, -0.03177168902858526, -0.20420859501803224, -0.11542362511700278, -0.16867705308566977, -0.05119396174793305, -0.05616406435839525, -0.1480507397069301, 0.43026114630076706, 0.2655834667207791, 0.2539544951559716, 0.11033016639021874, 0.38828713358438843, -0.026721305339862417, 0.12700776641899603, 0.1088842091381202, 0.1640559422630298, -0.0005278799954000153, 0.1253213393564566, -0.18263761024432892, 0.0774973408596095, 0.06557270707680454] |
1,802.01881 | Girth-regular graphs | We introduce a notion of a girth-regular graph as a $k$-regular graph for
which there exists a non-descending sequence $(a_1, a_2, \dots, a_k)$ (called
the signature) giving, for every vertex $u$ of the graph, the number of girth
cycles the edges with end-vertex $u$ lie on. Girth-regularity generalises two
very different aspects of symmetry in graph theory: that of vertex transitivity
and that of distance-regularity. For general girth-regular graphs, we give some
results on the extremal cases of signatures. We then focus on the cubic case
and provide a characterisation of cubic girth-regular graphs of girth up to
$5$.
| math.CO | we introduce a notion of a girthregular graph as a kregular graph for which there exists a nondescending sequence a_1 a_2 dots a_k called the signature giving for every vertex u of the graph the number of girth cycles the edges with endvertex u lie on girthregularity generalises two very different aspects of symmetry in graph theory that of vertex transitivity and that of distanceregularity for general girthregular graphs we give some results on the extremal cases of signatures we then focus on the cubic case and provide a characterisation of cubic girthregular graphs of girth up to 5 | [['we', 'introduce', 'a', 'notion', 'of', 'a', 'girthregular', 'graph', 'as', 'a', 'kregular', 'graph', 'for', 'which', 'there', 'exists', 'a', 'nondescending', 'sequence', 'a_1', 'a_2', 'dots', 'a_k', 'called', 'the', 'signature', 'giving', 'for', 'every', 'vertex', 'u', 'of', 'the', 'graph', 'the', 'number', 'of', 'girth', 'cycles', 'the', 'edges', 'with', 'endvertex', 'u', 'lie', 'on', 'girthregularity', 'generalises', 'two', 'very', 'different', 'aspects', 'of', 'symmetry', 'in', 'graph', 'theory', 'that', 'of', 'vertex', 'transitivity', 'and', 'that', 'of', 'distanceregularity', 'for', 'general', 'girthregular', 'graphs', 'we', 'give', 'some', 'results', 'on', 'the', 'extremal', 'cases', 'of', 'signatures', 'we', 'then', 'focus', 'on', 'the', 'cubic', 'case', 'and', 'provide', 'a', 'characterisation', 'of', 'cubic', 'girthregular', 'graphs', 'of', 'girth', 'up', 'to', '5']] | [-0.2080799413284249, 0.10379316804414421, -0.037371205650650115, 0.026527772100442753, -0.08904600958815034, -0.16495418460678538, 0.024783365708794827, 0.3841624126332451, -0.23951456630697512, -0.24978602289849397, 0.09291854331493188, -0.32608491547253665, -0.17742997225925175, 0.13725734784800028, -0.07324079012175147, -0.027092119943759194, 0.11792435258691085, 0.13547909739029318, -0.008819334061664283, -0.2544328384992324, 0.35588837613123564, -0.0864586431107826, 0.13048117989864277, 0.10130383233463734, 0.1118369509646555, 0.04018990900272466, 0.046424138112639894, 0.06380247045202553, -0.2380032200725305, 0.10514368025148857, 0.23985499510902683, 0.13514295053592293, 0.22551340748536952, -0.37117784267751147, -0.13119168357201377, 0.20092759744919914, 0.08536702611635687, 0.05749046107236182, -0.050053776549507996, -0.19570762751272366, 0.14901280934371205, -0.11992280324742825, -0.09804238396345125, -0.014947467418244983, 0.09783099206848717, 0.00041086254261282025, -0.2674072483573489, 0.001491243589897545, 0.14309128735223975, 0.07789004937156427, 0.08697866356684542, -0.16334763006663558, -0.04679496099041509, 0.09804501927372221, -0.057048610779836924, 0.058078247288774164, 0.003586174797252467, -0.11587424660861796, -0.18936126161727826, 0.38856010631258997, -0.025426904801267428, -0.1414976714345079, 0.11911660846208735, -0.1409975359102293, -0.2391235559789122, 0.07220975804731858, 0.1272784211786882, 0.15065520438270605, -0.06460909049587363, 0.14335130638685267, -0.10641168994943098, 0.09637806228152951, 0.14000456152977991, 0.05792679048763417, 0.11099315482210748, 0.11800899504379807, 0.1649964433104009, 0.17203053667884777, 0.018647376873188327, 0.017004129716803377, -0.3325092685789022, -0.08143753198222542, -0.18528231875780893, 0.10734313125817144, -0.2118994110517503, -0.24371998318071877, 0.47401644420638983, 0.08550871864236816, 0.2138462865116949, 0.1217148070216502, 0.13922643197144438, 0.02446081946789268, 0.05235091819337626, 0.10812164838568364, 0.11068909392574545, 0.20747225107244996, -0.02138648966175257, -0.1451187659748735, 0.003915154569953376, 0.18356603210107708] |
1,802.01882 | GRB 151027B - large-amplitude late-time radio variability | Deriving physical parameters from gamma-ray burst afterglow observations
remains a challenge, even now, 20 years after the discovery of afterglows. The
main reason for the lack of progress is that the peak of the synchrotron
emission is in the sub-mm range, thus requiring radio observations in
conjunction with X-ray/optical/near-infrared data in order to measure the
corresponding spectral slopes and consequently remove the ambiguity wrt. slow
vs. fast cooling and the ordering of the characteristic frequencies.
We observed GRB 151027B, the 1000th Swift-detected GRB, with GROND in the
optical-NIR, ALMA in the sub-millimeter, ATCA in the radio band, and combine
this with public Swift-XRT X-ray data.
While some observations at crucial times only return upper limits or
surprising features, the fireball model is narrowly constrained by our data
set, and allows us to draw a consistent picture with a fully-determined
parameter set. Surprisingly, we find rapid, large-amplitude flux density
variations in the radio band which are extreme not only for GRBs, but generally
for any radio source. We interpret these as scintillation effects, though the
extreme nature requires either the scattering screen to be at much smaller
distance than usually assumed, multiple screens, or a combination of the two.
| astro-ph.HE | deriving physical parameters from gammaray burst afterglow observations remains a challenge even now 20 years after the discovery of afterglows the main reason for the lack of progress is that the peak of the synchrotron emission is in the submm range thus requiring radio observations in conjunction with xrayopticalnearinfrared data in order to measure the corresponding spectral slopes and consequently remove the ambiguity wrt slow vs fast cooling and the ordering of the characteristic frequencies we observed grb 151027b the 1000th swiftdetected grb with grond in the opticalnir alma in the submillimeter atca in the radio band and combine this with public swiftxrt xray data while some observations at crucial times only return upper limits or surprising features the fireball model is narrowly constrained by our data set and allows us to draw a consistent picture with a fullydetermined parameter set surprisingly we find rapid largeamplitude flux density variations in the radio band which are extreme not only for grbs but generally for any radio source we interpret these as scintillation effects though the extreme nature requires either the scattering screen to be at much smaller distance than usually assumed multiple screens or a combination of the two | [['deriving', 'physical', 'parameters', 'from', 'gammaray', 'burst', 'afterglow', 'observations', 'remains', 'a', 'challenge', 'even', 'now', '20', 'years', 'after', 'the', 'discovery', 'of', 'afterglows', 'the', 'main', 'reason', 'for', 'the', 'lack', 'of', 'progress', 'is', 'that', 'the', 'peak', 'of', 'the', 'synchrotron', 'emission', 'is', 'in', 'the', 'submm', 'range', 'thus', 'requiring', 'radio', 'observations', 'in', 'conjunction', 'with', 'xrayopticalnearinfrared', 'data', 'in', 'order', 'to', 'measure', 'the', 'corresponding', 'spectral', 'slopes', 'and', 'consequently', 'remove', 'the', 'ambiguity', 'wrt', 'slow', 'vs', 'fast', 'cooling', 'and', 'the', 'ordering', 'of', 'the', 'characteristic', 'frequencies', 'we', 'observed', 'grb', '151027b', 'the', '1000th', 'swiftdetected', 'grb', 'with', 'grond', 'in', 'the', 'opticalnir', 'alma', 'in', 'the', 'submillimeter', 'atca', 'in', 'the', 'radio', 'band', 'and', 'combine', 'this', 'with', 'public', 'swiftxrt', 'xray', 'data', 'while', 'some', 'observations', 'at', 'crucial', 'times', 'only', 'return', 'upper', 'limits', 'or', 'surprising', 'features', 'the', 'fireball', 'model', 'is', 'narrowly', 'constrained', 'by', 'our', 'data', 'set', 'and', 'allows', 'us', 'to', 'draw', 'a', 'consistent', 'picture', 'with', 'a', 'fullydetermined', 'parameter', 'set', 'surprisingly', 'we', 'find', 'rapid', 'largeamplitude', 'flux', 'density', 'variations', 'in', 'the', 'radio', 'band', 'which', 'are', 'extreme', 'not', 'only', 'for', 'grbs', 'but', 'generally', 'for', 'any', 'radio', 'source', 'we', 'interpret', 'these', 'as', 'scintillation', 'effects', 'though', 'the', 'extreme', 'nature', 'requires', 'either', 'the', 'scattering', 'screen', 'to', 'be', 'at', 'much', 'smaller', 'distance', 'than', 'usually', 'assumed', 'multiple', 'screens', 'or', 'a', 'combination', 'of', 'the', 'two']] | [-0.05628625914657287, 0.12661827879522197, -0.06941191119636342, 0.11937132422433033, -0.13070310350536302, -0.10966232081109505, 0.07827293546870351, 0.46703091944020586, -0.20004853029668176, -0.3419400947840558, 0.12261551023597743, -0.2931236794094692, -0.03090882601610087, 0.22304270512630836, -0.0231677933629679, -0.004706304659586899, 0.07711547372572258, -0.07425699429706545, -0.06688667166997324, -0.19223054475391033, 0.26390146259122443, 0.1135054829652834, 0.241638194633703, 0.014483774993592663, 0.06815613281103595, -0.03857204638488744, -0.07984254574739211, -0.034514459759145785, -0.0679782339152787, 0.06465427391951155, 0.2579727278969529, 0.11096196159475588, 0.20183449813174373, -0.4145954154412617, -0.24608082683353694, 0.11973478661648468, 0.12443311246335219, 0.03663061125283178, 0.01104248826423199, -0.2621186851360595, 0.04808263361127567, -0.14354819691495144, -0.15907459143674021, 0.0377419818181919, 0.041322689295803995, 0.01745973934735095, -0.2227086761384871, 0.08455829688146249, -0.0035994431830837018, 0.06218004775741834, -0.09337569877040841, -0.037691890894550564, 0.008854565816720198, 0.07281524279531687, 0.07591819749981857, 0.07857567132282618, 0.09400466690139998, -0.14116262595682913, -0.0704866722538184, 0.39527929667803485, -0.047521308751926235, -0.021865633269531903, 0.21781622101888828, -0.22316875563905642, -0.19063331652912743, 0.19839103262362637, 0.10774313282346372, 0.05620342908791967, -0.15266707864801218, 0.0016493578837493185, 0.004586819685952373, 0.23028928079863184, 0.04729430371962641, 0.10124576794458841, 0.2770217413181132, 0.13401055197020242, 0.04135782427044067, 0.09267046852169328, -0.22090792735155249, -0.0009071969165533935, -0.2868495683222361, -0.06596244016563826, -0.18186596047178813, 0.09364808723698047, -0.1060299263020723, -0.12711193032812365, 0.3881330210811545, 0.1389290582383839, 0.21824244945310056, 0.07303118428212985, 0.31440483547324677, 0.09601971613541462, 0.09505851090148802, 0.11997513401519493, 0.30715032646833973, 0.08568446997363485, 0.12094290703163031, -0.18151253879372722, 0.1103905526388283, -0.03345907415436178] |
1,802.01883 | Bright squeezed vacuum in a nonlinear interferometer: frequency/temporal
Schmidt-mode description | Control over the spectral properties of the bright squeezed vacuum (BSV), a
highly multimode non-classical macroscopic state of light that can be generated
through high-gain parametric down conversion, is crucial for many applications.
In particular, in several recent experiments BSV is generated in a strongly
pumped SU(1,1) interferometer to achieve phase supersensitivity, perform
broadband homodyne detection, or tailor the frequency spectrum of squeezed
light. In this work, we present an analytical approach to the theoretical
description of BSV in the frequency domain based on the Bloch-Messiah reduction
and the Schmidt-mode formalism. As a special case we consider a strongly pumped
SU(1,1) interferometer. We show that different moments of the radiation at its
output depend on the phase, dispersion and the parametric gain in a nontrivial
way, thereby providing additional insights on the capabilities of nonlinear
interferometers. In particular, a dramatic change in the spectrum occurs as the
parametric gain increases.
| quant-ph | control over the spectral properties of the bright squeezed vacuum bsv a highly multimode nonclassical macroscopic state of light that can be generated through highgain parametric down conversion is crucial for many applications in particular in several recent experiments bsv is generated in a strongly pumped su11 interferometer to achieve phase supersensitivity perform broadband homodyne detection or tailor the frequency spectrum of squeezed light in this work we present an analytical approach to the theoretical description of bsv in the frequency domain based on the blochmessiah reduction and the schmidtmode formalism as a special case we consider a strongly pumped su11 interferometer we show that different moments of the radiation at its output depend on the phase dispersion and the parametric gain in a nontrivial way thereby providing additional insights on the capabilities of nonlinear interferometers in particular a dramatic change in the spectrum occurs as the parametric gain increases | [['control', 'over', 'the', 'spectral', 'properties', 'of', 'the', 'bright', 'squeezed', 'vacuum', 'bsv', 'a', 'highly', 'multimode', 'nonclassical', 'macroscopic', 'state', 'of', 'light', 'that', 'can', 'be', 'generated', 'through', 'highgain', 'parametric', 'down', 'conversion', 'is', 'crucial', 'for', 'many', 'applications', 'in', 'particular', 'in', 'several', 'recent', 'experiments', 'bsv', 'is', 'generated', 'in', 'a', 'strongly', 'pumped', 'su11', 'interferometer', 'to', 'achieve', 'phase', 'supersensitivity', 'perform', 'broadband', 'homodyne', 'detection', 'or', 'tailor', 'the', 'frequency', 'spectrum', 'of', 'squeezed', 'light', 'in', 'this', 'work', 'we', 'present', 'an', 'analytical', 'approach', 'to', 'the', 'theoretical', 'description', 'of', 'bsv', 'in', 'the', 'frequency', 'domain', 'based', 'on', 'the', 'blochmessiah', 'reduction', 'and', 'the', 'schmidtmode', 'formalism', 'as', 'a', 'special', 'case', 'we', 'consider', 'a', 'strongly', 'pumped', 'su11', 'interferometer', 'we', 'show', 'that', 'different', 'moments', 'of', 'the', 'radiation', 'at', 'its', 'output', 'depend', 'on', 'the', 'phase', 'dispersion', 'and', 'the', 'parametric', 'gain', 'in', 'a', 'nontrivial', 'way', 'thereby', 'providing', 'additional', 'insights', 'on', 'the', 'capabilities', 'of', 'nonlinear', 'interferometers', 'in', 'particular', 'a', 'dramatic', 'change', 'in', 'the', 'spectrum', 'occurs', 'as', 'the', 'parametric', 'gain', 'increases']] | [-0.13392308093107386, 0.15106784927765385, -0.09919906690546418, -0.0010883575719437444, -0.07156550409209808, -0.11307965458101975, 0.0480098503754293, 0.42404606543331336, -0.2271168210493688, -0.24808415431754302, 0.07699009760176675, -0.23093331166099282, -0.13208881508240214, 0.28186348589268456, -0.04642931854152339, 0.05746146290205206, 0.03974084425936359, -0.0020795768164348282, -0.04617721211452712, -0.15951052862344522, 0.2741518946545786, 0.04887919864873558, 0.34462528420930993, 0.01467070877302013, 0.1073642033496059, 0.008978587603384016, 0.010587909604241484, -0.05185359053863775, -0.0824075242128081, 0.09838663252545583, 0.23468263461348293, 0.09393852291278691, 0.2516252393115487, -0.4141218583005787, -0.23392634696308398, 0.1073403573538733, 0.13807441046986504, 0.1404907270615933, -0.045470229454726084, -0.2918183880986258, -0.004848231745871322, -0.1752892511290492, -0.13824929611057343, -0.09961970437680615, -0.04681677169685296, 0.012728625245942366, -0.24070914893062637, 0.051727129012071243, 0.07013415781337293, 0.012030844901682146, 0.0015475983104837321, -0.03795325122273609, -0.019207722191767605, 0.07503615801485143, -0.045676241679610874, -0.010470936277993774, 0.12678585322761296, -0.18861785108393883, -0.11382506070221031, 0.3563622957483815, -0.12648736212743233, -0.15157198866254232, 0.13269381319882112, -0.17364785262077248, -0.08694021924240233, 0.13317515068584365, 0.19966496597512956, 0.1256751644115695, -0.09199960894051364, 0.04620299541357055, -0.0171681273464526, 0.2139940207758481, 0.11001322139523323, 0.15428086548056077, 0.21332264870355194, 0.18311232840017283, 0.05218196944716455, 0.20088862842878627, -0.08081528690980354, -0.07511508974306061, -0.3071733208985737, -0.10855038687038401, -0.1788782249892368, 0.05636606276372835, -0.06122147288753951, -0.1418987278945294, 0.45340053045859674, 0.14421595549693367, 0.15542608306855712, -0.028484136634975073, 0.3481558131291562, 0.17850738994920964, 0.011303254562561343, -0.005306509234348699, 0.3154650345825959, 0.1405827783035652, 0.07496418433979579, -0.2756264096941649, -0.026303184503101863, -0.041473882250962844] |
1,802.01884 | Asymptotic invariants of ideals with Noetherian symbolic Rees algebra
and applications to cover ideals | Let $I$ be an ideal whose symbolic Rees algebra is Noetherian. For $m \geq
1$, the $m$-th symbolic defect, sdefect$(I,m)$, of $I$ is defined to be the
minimal number of generators of the module $\frac{I^{(m)}}{I^m}$. We prove that
sdefect$(I,m)$ is eventually quasi-polynomial as a function in $m$. We compute
the symbolic defect explicitly for certain monomial ideals arising from graphs,
termed cover ideals. We go on to give a formula for the Waldschmidt constant,
an asymptotic invariant measuring the growth of the degrees of generators of
symbolic powers, for ideals whose symbolic Rees algebra is Noetherian.
| math.AC | let i be an ideal whose symbolic rees algebra is noetherian for m geq 1 the mth symbolic defect sdefectim of i is defined to be the minimal number of generators of the module fracimim we prove that sdefectim is eventually quasipolynomial as a function in m we compute the symbolic defect explicitly for certain monomial ideals arising from graphs termed cover ideals we go on to give a formula for the waldschmidt constant an asymptotic invariant measuring the growth of the degrees of generators of symbolic powers for ideals whose symbolic rees algebra is noetherian | [['let', 'i', 'be', 'an', 'ideal', 'whose', 'symbolic', 'rees', 'algebra', 'is', 'noetherian', 'for', 'm', 'geq', '1', 'the', 'mth', 'symbolic', 'defect', 'sdefectim', 'of', 'i', 'is', 'defined', 'to', 'be', 'the', 'minimal', 'number', 'of', 'generators', 'of', 'the', 'module', 'fracimim', 'we', 'prove', 'that', 'sdefectim', 'is', 'eventually', 'quasipolynomial', 'as', 'a', 'function', 'in', 'm', 'we', 'compute', 'the', 'symbolic', 'defect', 'explicitly', 'for', 'certain', 'monomial', 'ideals', 'arising', 'from', 'graphs', 'termed', 'cover', 'ideals', 'we', 'go', 'on', 'to', 'give', 'a', 'formula', 'for', 'the', 'waldschmidt', 'constant', 'an', 'asymptotic', 'invariant', 'measuring', 'the', 'growth', 'of', 'the', 'degrees', 'of', 'generators', 'of', 'symbolic', 'powers', 'for', 'ideals', 'whose', 'symbolic', 'rees', 'algebra', 'is', 'noetherian']] | [-0.1925508940131754, 0.06926894078052462, -0.0642082935088985, 0.03256020933810261, -0.09606543143269836, -0.16896573598346404, -0.09171236645660653, 0.2826068672121212, -0.41019833937127104, -0.17253870574221697, 0.12996435882799046, -0.25287443886120475, -0.07306775005073637, 0.18825821683401622, -0.12288275437169177, -0.02081421019649634, 0.006085406380495237, 0.10639469458230881, -0.06219058507622811, -0.27425600584816706, 0.39205351926546583, 0.050618375576431715, 0.1481868789320992, 0.0189447534741253, 0.14291696744139798, 0.0013510037967134068, -0.0368125364384664, 0.01216457936642391, -0.22957536530399617, 0.1260476181864418, 0.33091758693798734, 0.16087331747265673, 0.2254793237753479, -0.3947070858073427, -0.021918833691386447, 0.22126447906096777, 0.15941659727143825, 0.005703741604442238, 0.049596054624686, -0.1625610026831348, 0.1745481197071332, -0.25542813165974554, -0.16459104879408754, -0.10188229496200238, 0.1369242987805797, 0.021199672796478074, -0.34262727004706217, -0.052482091591403046, 0.13586301707051773, 0.21374616500551022, -0.0074893376860086635, -0.08822472711464249, -0.07137158536602572, 0.05298150485000944, -0.08226606380995563, -0.02845481306975407, 0.10727761934701634, -0.08910037792458009, -0.1881785437430916, 0.3294519319409324, -0.03275363067144989, -0.2279514669771156, 0.062366484429046354, -0.18885988143262683, -0.12433909375460879, 0.12130344723181058, 0.041814964925569874, 0.1593789929744377, -0.01412776839588919, 0.21799334748998606, -0.13377275043517672, 0.058958336110076594, 0.11004644615315301, 0.023790747052439117, 0.15368677212065587, 0.08016175484805498, 0.060267338369001625, 0.1736050019195924, 0.05990697574921914, 0.0034447404485876843, -0.3610102775036007, -0.2201562573862893, -0.2051242042122589, 0.16902372540195063, -0.1746339812469218, -0.2011329332787183, 0.44136657509752497, 0.10844379932849958, 0.14624019123373494, 0.15416757372378181, 0.20560210306317575, 0.12868155664088385, 0.06600106915368908, 0.1166726153303859, 0.06635302844487372, 0.18215411270828416, -0.039541192347764646, -0.18066360334044582, 0.028273656754003416, 0.24738039279867324] |
1,802.01885 | A new construction of CAT(0) cube complexes | We introduce the notion of coupled link cube complex (CLCC) as a means of
constructing interesting cocompactly cubulated groups. CLCCs are defined
locally, making them a useful tool when precise control over the links is
required. In this paper we study some general properties of CLCCs, such as
their (co)homological dimension and criteria for hyperbolicity. Some examples
of fundamental groups of CLCCs are RAAGs, RACGs, surface groups and some
manifold groups. As immediate applications of our criteria we produce a number
of cubulated 3 and 4 manifolds with hyperbolic fundamental group.
| math.MG math.GR | we introduce the notion of coupled link cube complex clcc as a means of constructing interesting cocompactly cubulated groups clccs are defined locally making them a useful tool when precise control over the links is required in this paper we study some general properties of clccs such as their cohomological dimension and criteria for hyperbolicity some examples of fundamental groups of clccs are raags racgs surface groups and some manifold groups as immediate applications of our criteria we produce a number of cubulated 3 and 4 manifolds with hyperbolic fundamental group | [['we', 'introduce', 'the', 'notion', 'of', 'coupled', 'link', 'cube', 'complex', 'clcc', 'as', 'a', 'means', 'of', 'constructing', 'interesting', 'cocompactly', 'cubulated', 'groups', 'clccs', 'are', 'defined', 'locally', 'making', 'them', 'a', 'useful', 'tool', 'when', 'precise', 'control', 'over', 'the', 'links', 'is', 'required', 'in', 'this', 'paper', 'we', 'study', 'some', 'general', 'properties', 'of', 'clccs', 'such', 'as', 'their', 'cohomological', 'dimension', 'and', 'criteria', 'for', 'hyperbolicity', 'some', 'examples', 'of', 'fundamental', 'groups', 'of', 'clccs', 'are', 'raags', 'racgs', 'surface', 'groups', 'and', 'some', 'manifold', 'groups', 'as', 'immediate', 'applications', 'of', 'our', 'criteria', 'we', 'produce', 'a', 'number', 'of', 'cubulated', '3', 'and', '4', 'manifolds', 'with', 'hyperbolic', 'fundamental', 'group']] | [-0.1781101750821108, 0.0983191849405153, -0.07761867211924658, 0.10969954742532638, -0.13635586543112166, -0.14122013609545928, 0.03631102915775652, 0.40069396692431636, -0.2709874839263244, -0.2940153591748741, 0.16351379838306457, -0.22604430298217468, -0.20701123258719842, 0.26521423852278125, -0.1398256493266672, 0.012041725114815764, 0.012779326147089402, 0.07445913720358577, -0.045286950890699194, -0.27687876877219725, 0.4097405628559904, -0.03363798093050718, 0.20173947374310552, 0.045485405535954565, 0.08767537610967541, 0.02177690674757792, -0.06612580323384867, 0.05576141833638151, -0.1730848951705007, 0.15723271352342433, 0.29053280949818955, 0.0791545482688687, 0.25038486521742825, -0.3474404391522209, -0.20251673666967285, 0.16839981205347512, 0.12574966368782853, 0.04721144275067167, -0.07133991957331696, -0.2773909345890085, 0.10368032814520929, -0.14644365697685216, -0.1790674668038264, -0.09387014355613954, 0.019974531326442956, 0.04369111585999942, -0.17509232453174062, 0.0006570418054858844, 0.07913774174780377, 0.13430447555664513, -0.035262161363951036, -0.0778626156750963, -0.03403547611087561, 0.21521029906741912, -0.016841650746452313, -0.024732986519423624, 0.11590846873716348, -0.08071466951579269, -0.10654346849251953, 0.42451354897994964, 0.023308776365593076, -0.2291506482495202, 0.2339645314651231, -0.10046979783413311, -0.2021722702930371, 0.08283583592726952, 0.15167143740173844, 0.15905360961850318, -0.06270772673322224, 0.09710885978420265, -0.09636074283625931, 0.06843520663064231, 0.07535197254684237, 0.07646023213876307, 0.12347024217920585, 0.13422305386047811, 0.12484763593642532, 0.12835955515814323, 0.04527660036272007, 0.01614660138471259, -0.33365766492982707, -0.23882866801900995, -0.07283431359618488, 0.10749508660390145, -0.1152248389121572, -0.16634643443135752, 0.36911621019244195, 0.04122809352055709, 0.14657309660688042, 0.1016678804686914, 0.22900857349029846, 0.009144136677625486, 0.04463932330957808, 0.0630792209205942, 0.09621944513346534, 0.2332341509560744, -0.06092691464582458, -0.09393120468335434, -0.024315642048087387, 0.13800743878301647] |
1,802.01886 | Texygen: A Benchmarking Platform for Text Generation Models | We introduce Texygen, a benchmarking platform to support research on
open-domain text generation models. Texygen has not only implemented a majority
of text generation models, but also covered a set of metrics that evaluate the
diversity, the quality and the consistency of the generated texts. The Texygen
platform could help standardize the research on text generation and facilitate
the sharing of fine-tuned open-source implementations among researchers for
their work. As a consequence, this would help in improving the reproductivity
and reliability of future research work in text generation.
| cs.CL cs.IR cs.LG | we introduce texygen a benchmarking platform to support research on opendomain text generation models texygen has not only implemented a majority of text generation models but also covered a set of metrics that evaluate the diversity the quality and the consistency of the generated texts the texygen platform could help standardize the research on text generation and facilitate the sharing of finetuned opensource implementations among researchers for their work as a consequence this would help in improving the reproductivity and reliability of future research work in text generation | [['we', 'introduce', 'texygen', 'a', 'benchmarking', 'platform', 'to', 'support', 'research', 'on', 'opendomain', 'text', 'generation', 'models', 'texygen', 'has', 'not', 'only', 'implemented', 'a', 'majority', 'of', 'text', 'generation', 'models', 'but', 'also', 'covered', 'a', 'set', 'of', 'metrics', 'that', 'evaluate', 'the', 'diversity', 'the', 'quality', 'and', 'the', 'consistency', 'of', 'the', 'generated', 'texts', 'the', 'texygen', 'platform', 'could', 'help', 'standardize', 'the', 'research', 'on', 'text', 'generation', 'and', 'facilitate', 'the', 'sharing', 'of', 'finetuned', 'opensource', 'implementations', 'among', 'researchers', 'for', 'their', 'work', 'as', 'a', 'consequence', 'this', 'would', 'help', 'in', 'improving', 'the', 'reproductivity', 'and', 'reliability', 'of', 'future', 'research', 'work', 'in', 'text', 'generation']] | [-0.08208189501469447, 0.025726660673337228, -0.009399933747772593, 0.07217411793614949, -0.1458332755031403, -0.1298439979278059, 0.06943727716464888, 0.40192436886189337, -0.22000744226600297, -0.32455061184009537, 0.1149784605817827, -0.29437888265502726, -0.11608650089791892, 0.26080026977102866, -0.06932800442022695, 0.059414062606678766, 0.12070430148345292, 0.019014700416433203, -0.006664358673746888, -0.29596615045342, 0.2788371955764226, 0.08071529438761486, 0.3852457685438408, 0.11416097610807893, 0.03540781010153957, -0.06068508880509233, -0.09119172463066537, -0.027176470329074866, -0.07774044627289682, 0.2275555988890119, 0.30519509298929653, 0.2535000169882551, 0.3349656180520965, -0.3768817043058913, -0.22805230657104403, 0.08338273244655946, 0.17348628472113473, 0.08557291924477216, -0.1066815842271105, -0.31284230414100667, 0.10403476329189619, -0.21334611813654192, -0.03535505544807, -0.1158936842429367, -0.010507181509059261, 0.003674044334647161, -0.24686231613900003, -0.05533725738992375, 0.0759510036825139, 0.08629492426883768, -0.028834240339082582, -0.07853341648693789, 0.031508788056354126, 0.2002708438879133, 0.030931672240099448, 0.07101747406307947, 0.08803992563149553, -0.17650076203616746, -0.15871108637657017, 0.4234796627001329, -0.07571621582081373, -0.21354649191595276, 0.18712366829541596, -0.023620864958502352, -0.18025455392092804, -0.01775709316346117, 0.2528097495457835, 0.08127145977182822, -0.15435843401461502, 0.03566952587160896, 0.002650944119192321, 0.19844260418110274, 0.06199269742831926, 0.03887593016472899, 0.24981232078491963, 0.23797742118635637, -0.017706746923398565, 0.10308235650882125, -0.04250713020287962, -0.029420169641194992, -0.24913840635087003, -0.1949624531500211, -0.1628712381828915, -0.013282197662357992, -0.014008784158167227, -0.1560050669041547, 0.43774082912767137, 0.2640061436898329, 0.12061701811299744, 0.0364939345004545, 0.29693828378169035, -0.023418998379962763, 0.1261344620791285, 0.05124454116660424, 0.15305298482284838, -0.005383960566673936, 0.17136996461671183, -0.13273948382861403, 0.11638936302221158, 0.013464092869650234] |
1,802.01887 | Rotational phase dependence of magnetar bursts | The trigger for the short bursts observed in $\gamma$-rays from many magnetar
sources remains unknown. One particular open question in this context is the
localization of burst emission to a singular active region or a larger area
across the neutron star. While several observational studies have attempted to
investigate this question by looking at the phase dependence of burst
properties, results have been mixed. At the same time, it is not obvious a
priori that bursts from a localized active region would actually give rise to a
detectable phase-dependence, taking into account issues such as geometry,
relativistic effects, and intrinsic burst properties such brightness and
duration. In this paper, we build a simple theoretical model to investigate the
circumstances under which the latter effects could affect detectability of a
dependence of burst emission on rotational phase. We find that even for
strongly phase-dependent emission, inferred burst properties may not show a
rotational phase dependence depending on the geometry of the system and the
observer. Furthermore, the observed properties of bursts with durations short
as 10-20% of the spin period can vary strongly depending on the rotational
phase at which the burst was emitted. We also show that detectability of a
rotational phase dependence depends strongly on the minimum number of bursts
observed, and find that existing burst samples may simply be too small to rule
out a phase dependence.
| astro-ph.HE | the trigger for the short bursts observed in gammarays from many magnetar sources remains unknown one particular open question in this context is the localization of burst emission to a singular active region or a larger area across the neutron star while several observational studies have attempted to investigate this question by looking at the phase dependence of burst properties results have been mixed at the same time it is not obvious a priori that bursts from a localized active region would actually give rise to a detectable phasedependence taking into account issues such as geometry relativistic effects and intrinsic burst properties such brightness and duration in this paper we build a simple theoretical model to investigate the circumstances under which the latter effects could affect detectability of a dependence of burst emission on rotational phase we find that even for strongly phasedependent emission inferred burst properties may not show a rotational phase dependence depending on the geometry of the system and the observer furthermore the observed properties of bursts with durations short as 1020 of the spin period can vary strongly depending on the rotational phase at which the burst was emitted we also show that detectability of a rotational phase dependence depends strongly on the minimum number of bursts observed and find that existing burst samples may simply be too small to rule out a phase dependence | [['the', 'trigger', 'for', 'the', 'short', 'bursts', 'observed', 'in', 'gammarays', 'from', 'many', 'magnetar', 'sources', 'remains', 'unknown', 'one', 'particular', 'open', 'question', 'in', 'this', 'context', 'is', 'the', 'localization', 'of', 'burst', 'emission', 'to', 'a', 'singular', 'active', 'region', 'or', 'a', 'larger', 'area', 'across', 'the', 'neutron', 'star', 'while', 'several', 'observational', 'studies', 'have', 'attempted', 'to', 'investigate', 'this', 'question', 'by', 'looking', 'at', 'the', 'phase', 'dependence', 'of', 'burst', 'properties', 'results', 'have', 'been', 'mixed', 'at', 'the', 'same', 'time', 'it', 'is', 'not', 'obvious', 'a', 'priori', 'that', 'bursts', 'from', 'a', 'localized', 'active', 'region', 'would', 'actually', 'give', 'rise', 'to', 'a', 'detectable', 'phasedependence', 'taking', 'into', 'account', 'issues', 'such', 'as', 'geometry', 'relativistic', 'effects', 'and', 'intrinsic', 'burst', 'properties', 'such', 'brightness', 'and', 'duration', 'in', 'this', 'paper', 'we', 'build', 'a', 'simple', 'theoretical', 'model', 'to', 'investigate', 'the', 'circumstances', 'under', 'which', 'the', 'latter', 'effects', 'could', 'affect', 'detectability', 'of', 'a', 'dependence', 'of', 'burst', 'emission', 'on', 'rotational', 'phase', 'we', 'find', 'that', 'even', 'for', 'strongly', 'phasedependent', 'emission', 'inferred', 'burst', 'properties', 'may', 'not', 'show', 'a', 'rotational', 'phase', 'dependence', 'depending', 'on', 'the', 'geometry', 'of', 'the', 'system', 'and', 'the', 'observer', 'furthermore', 'the', 'observed', 'properties', 'of', 'bursts', 'with', 'durations', 'short', 'as', '1020', 'of', 'the', 'spin', 'period', 'can', 'vary', 'strongly', 'depending', 'on', 'the', 'rotational', 'phase', 'at', 'which', 'the', 'burst', 'was', 'emitted', 'we', 'also', 'show', 'that', 'detectability', 'of', 'a', 'rotational', 'phase', 'dependence', 'depends', 'strongly', 'on', 'the', 'minimum', 'number', 'of', 'bursts', 'observed', 'and', 'find', 'that', 'existing', 'burst', 'samples', 'may', 'simply', 'be', 'too', 'small', 'to', 'rule', 'out', 'a', 'phase', 'dependence']] | [-0.11679255569508243, 0.19296697595290938, -0.09032598665130516, 0.12653114921685338, -0.1092409391838683, -0.10505906352163272, 0.07479303375529085, 0.4151668330790743, -0.24372719327500295, -0.3271659044589538, 0.09403278642256772, -0.2582855925988813, -0.09980054597947828, 0.2265971099904954, -0.03234539134453323, -0.04391561329616925, 0.05424140765195444, 0.013280797789410147, -0.10143063218113214, -0.19650132109779117, 0.2851675292599019, 0.09097422575822108, 0.24791312323680847, 0.0591581175660442, 0.06818880101332368, -0.05106623118690431, -0.005349778355323957, 0.01169894201127918, -0.11978697663391168, -0.0025879323002617953, 0.20455289105315363, 0.10407343533756333, 0.2011537323482172, -0.4232505022194318, -0.2773309737447991, 0.13176060851728677, 0.15125254348355577, 0.08403411747960934, -0.04863946986949991, -0.26942173065007646, 0.0467270586810453, -0.16235087807879958, -0.13170808164238132, 0.024987658066878412, 0.06806864213975203, 0.048420729056380965, -0.19864820517542645, 0.08219637485781754, 0.07710643208689386, 0.03536479059590523, -0.07206418638739849, -0.023148960913287466, -0.004967405847131425, 0.09101145631048063, 0.09410334846328162, 0.0331314468693281, 0.14807813009145512, -0.1168969755485963, -0.06164880599175868, 0.3760945136713751, -0.05448742699301008, -0.0852659181834048, 0.18751486594072952, -0.21508447092644642, -0.18030379937888494, 0.18276092243852607, 0.16880860183322924, 0.10197671913179898, -0.12635630079698607, -0.012916833739809074, -0.0011026269428871215, 0.21913228141841393, 0.03153640838282988, 0.09978383959893251, 0.279132439039127, 0.1339033478881155, 0.023802437329223568, 0.13110913510594974, -0.1790202021737091, -0.03665163852254083, -0.28797832394311584, -0.057970444570136906, -0.1458713878149484, 0.09010984852625867, -0.046731528362175895, -0.15347269214623643, 0.4296751113590178, 0.12109903766627232, 0.22011875446710946, 0.023880772917774427, 0.2423344535476581, 0.10891336620089855, 0.052301526681520556, 0.07478421424438274, 0.3123876665023412, 0.08845164393497769, 0.07194664412357044, -0.2534664579734255, 0.1473510758869968, 0.001943960154477881] |
1,802.01888 | Growth and characterization of a Li2Mg2(MoO4)3 scintillating bolometer | Lithium magnesium molybdate (Li$_2$Mg$_2$(MoO$_4$)$_3$) crystals were grown
by the low-thermal-gradient Czochralski method. Luminescence properties of the
material (emission spectra, thermally stimulated luminescence, dependence of
intensity on temperature, phosphorescence) have been studied under X-Ray
excitation in the temperature interval from 8 K to 400 K, while at the same
being operated as a scintillating bolometer at 20 mK for the first time. We
demonstrated that Li$_2$Mg$_2$(MoO$_4)_3$ crystals are a potentially promising
detector material to search for neutrinoless double beta decay of $^{100}$Mo.
| physics.ins-det nucl-ex | lithium magnesium molybdate li_2mg_2moo_4_3 crystals were grown by the lowthermalgradient czochralski method luminescence properties of the material emission spectra thermally stimulated luminescence dependence of intensity on temperature phosphorescence have been studied under xray excitation in the temperature interval from 8 k to 400 k while at the same being operated as a scintillating bolometer at 20 mk for the first time we demonstrated that li_2mg_2moo_4_3 crystals are a potentially promising detector material to search for neutrinoless double beta decay of 100mo | [['lithium', 'magnesium', 'molybdate', 'li_2mg_2moo_4_3', 'crystals', 'were', 'grown', 'by', 'the', 'lowthermalgradient', 'czochralski', 'method', 'luminescence', 'properties', 'of', 'the', 'material', 'emission', 'spectra', 'thermally', 'stimulated', 'luminescence', 'dependence', 'of', 'intensity', 'on', 'temperature', 'phosphorescence', 'have', 'been', 'studied', 'under', 'xray', 'excitation', 'in', 'the', 'temperature', 'interval', 'from', '8', 'k', 'to', '400', 'k', 'while', 'at', 'the', 'same', 'being', 'operated', 'as', 'a', 'scintillating', 'bolometer', 'at', '20', 'mk', 'for', 'the', 'first', 'time', 'we', 'demonstrated', 'that', 'li_2mg_2moo_4_3', 'crystals', 'are', 'a', 'potentially', 'promising', 'detector', 'material', 'to', 'search', 'for', 'neutrinoless', 'double', 'beta', 'decay', 'of', '100mo']] | [-0.006805811423655081, 0.24769934675290803, -0.058288065410113034, -0.03496919209034406, 0.01683927212452775, -0.17495989981048468, 0.06308878769602956, 0.4828432872773537, -0.21047317229588575, -0.32718485922705903, 0.05273890141191409, -0.37763205213071427, 0.04457525979680351, 0.25955461544468056, 0.09934190186212145, 0.0842830948708461, -0.035798375969281114, -0.025202851545042062, -0.034421931769510236, -0.2138002485602717, 0.15853790631164102, 0.1504534214139692, 0.31563678643182863, 0.061873630711166305, 0.06368801107370778, -0.08126710338777379, 0.0789469894827815, -0.07549810265131955, -0.1486781917758694, -0.016756085265586976, 0.2860313474283188, -0.03233107128416341, 0.15859609592375876, -0.3906239057784971, -0.2200569609604493, 0.05903029678200808, 0.13447515030474036, 0.023431145830692935, -0.15267597911791003, -0.2679766359019883, 0.11931207734808515, -0.09072037753236445, -0.09580205033586325, 0.0045617483320492735, -0.009001503250549865, 0.009620544806423397, -0.2051334053549114, 0.023106229786254182, -0.035604748522709534, 0.08932842102337958, -0.08286615770569519, -0.21230561692927835, -0.012212123827938038, -0.02257573709504891, 0.010499545101878009, -0.02702479865519872, 0.26105575706173156, -0.052708511806647235, -0.08653616385764289, 0.31588008715712196, -0.12547975116043905, 0.05754429195665672, 0.1050827688761527, -0.22697119474340277, -0.13267181546845816, 0.3148832566287557, 0.10386201885493496, 0.1879285130343294, -0.20958594641872222, 0.03857805375363442, 0.03645749251605778, 0.2434468539387483, 0.17522746402935324, 0.07702181811585929, 0.23132423535460914, 0.24823201440799322, -0.03653211116826138, 0.14266582465247263, -0.2013873149481708, 0.062075792021955116, -0.20816238976637774, -0.19677614723037504, -0.13315148098848148, 0.08740188628199357, -0.02341003709802805, -0.14492146061332542, 0.3736410574881431, 0.050445994621590724, 0.13079908961736703, -0.03682863674586332, 0.2230549640069374, 0.043708212575530765, 0.12178186918432012, -0.04811776278516914, 0.2906057831560132, 0.20651665054662507, 0.14801514557492035, -0.2760914760800904, 0.09048224212837559, -0.026423671793434297] |
1,802.01889 | Divergent Perspectives on Expert Disagreement: Preliminary Evidence from
Climate Science, Climate Policy, Astrophysics, and Public Opinion | We report the results of an exploratory study that examines the judgments of
climate scientists, climate policy experts, astrophysicists, and non-experts (N
= 3,367) about the factors that contribute to the creation and persistence of
disagreement within climate science and astrophysics. We found that, as
compared to educated non-experts, climate experts believe that there is less
disagreement within climate science about climate change and that
methodological factors and personal or institutional biases play less
significant roles in generating existing disagreements than is commonly
reported or assumed. We also found that, commensurate with the greater inherent
uncertainty and data lacunae in their field, astrophysicists working on cosmic
rays were generally more willing to acknowledge expert disagreement, more open
to the idea that a set of data can have multiple valid interpretations, and
generally less quick to dismiss someone articulating a non-standard view as
non-expert, than climate scientists.
| physics.ao-ph physics.soc-ph | we report the results of an exploratory study that examines the judgments of climate scientists climate policy experts astrophysicists and nonexperts n 3367 about the factors that contribute to the creation and persistence of disagreement within climate science and astrophysics we found that as compared to educated nonexperts climate experts believe that there is less disagreement within climate science about climate change and that methodological factors and personal or institutional biases play less significant roles in generating existing disagreements than is commonly reported or assumed we also found that commensurate with the greater inherent uncertainty and data lacunae in their field astrophysicists working on cosmic rays were generally more willing to acknowledge expert disagreement more open to the idea that a set of data can have multiple valid interpretations and generally less quick to dismiss someone articulating a nonstandard view as nonexpert than climate scientists | [['we', 'report', 'the', 'results', 'of', 'an', 'exploratory', 'study', 'that', 'examines', 'the', 'judgments', 'of', 'climate', 'scientists', 'climate', 'policy', 'experts', 'astrophysicists', 'and', 'nonexperts', 'n', '3367', 'about', 'the', 'factors', 'that', 'contribute', 'to', 'the', 'creation', 'and', 'persistence', 'of', 'disagreement', 'within', 'climate', 'science', 'and', 'astrophysics', 'we', 'found', 'that', 'as', 'compared', 'to', 'educated', 'nonexperts', 'climate', 'experts', 'believe', 'that', 'there', 'is', 'less', 'disagreement', 'within', 'climate', 'science', 'about', 'climate', 'change', 'and', 'that', 'methodological', 'factors', 'and', 'personal', 'or', 'institutional', 'biases', 'play', 'less', 'significant', 'roles', 'in', 'generating', 'existing', 'disagreements', 'than', 'is', 'commonly', 'reported', 'or', 'assumed', 'we', 'also', 'found', 'that', 'commensurate', 'with', 'the', 'greater', 'inherent', 'uncertainty', 'and', 'data', 'lacunae', 'in', 'their', 'field', 'astrophysicists', 'working', 'on', 'cosmic', 'rays', 'were', 'generally', 'more', 'willing', 'to', 'acknowledge', 'expert', 'disagreement', 'more', 'open', 'to', 'the', 'idea', 'that', 'a', 'set', 'of', 'data', 'can', 'have', 'multiple', 'valid', 'interpretations', 'and', 'generally', 'less', 'quick', 'to', 'dismiss', 'someone', 'articulating', 'a', 'nonstandard', 'view', 'as', 'nonexpert', 'than', 'climate', 'scientists']] | [-0.05467276784976752, 0.13490423857934916, -0.07816536810473892, 0.1784389514427889, -0.173542294692216, -0.12512286009331203, 0.09471364116681547, 0.40750721279403257, -0.18456346813332417, -0.38691398489834933, 0.08822053467758514, -0.3140166529855723, -0.16237067707236214, 0.2124745283693332, -0.12297745935040816, -0.01461358309787666, 0.08943028559844042, 0.014576728404339018, -0.01806979232853086, -0.3005175265644131, 0.2673098012796956, 0.13716488879109764, 0.2438333459824709, 0.04380154817140308, 0.012021797071893475, -0.05744507132220516, -0.10696071361930205, -2.2640577035731284e-05, -0.12847720360205758, 0.16893754273749373, 0.3858744089202634, 0.21317424234906052, 0.3716777735743029, -0.46544175712584424, -0.2127637937793444, 0.09683729843075933, 0.10486418444920202, 0.07020904725610182, -0.00982755008173689, -0.27620398565356075, 0.02344133324583928, -0.19424692833603457, -0.10561375229073496, -0.09351761773808714, 0.05933253407109015, -0.05685794116640142, -0.19792027488864702, 0.05014752551937347, 0.039312245607916026, 0.17787491218347487, -0.044437287486126194, -0.19796180926134874, -0.010127544661598473, 0.17553181531036208, 0.13541396135335854, 0.049668652017135176, 0.15805087157782038, -0.1580565355284589, -0.12714257844049356, 0.4058463569473604, 0.008672997730198027, -0.15549203442602322, 0.21951704801156602, -0.16367431279785674, -0.12953662793633752, 0.06516156017234356, 0.16058564081884408, 0.008442170478018193, -0.15929260627398717, -0.02956433588727217, -0.011073536380868533, 0.24122800418769877, 0.08620314514746183, -0.024714837037829746, 0.24090641805709437, 0.13269617818135382, 0.05547000726941845, -0.004307010357171811, 0.008016636628850268, -0.12829857220760835, -0.21660030786437787, -0.10206477902187355, -0.09687378987156112, 0.07023820001170328, -0.05044978728993587, -0.1426684519565054, 0.3303207002580166, 0.28211022453896445, 0.10408169763997711, -0.010256443653408245, 0.26933604708776393, -0.011623377604149122, 0.052663954880072514, 0.08677420360839058, 0.22026614434374817, 0.02303770256292974, 0.13620790210552514, -0.1370484239373613, 0.17213940440259617, -0.08290444268234845] |
1,802.0189 | Calibration of EFOSC2 broadband linear imaging polarimetry | EFOSC2 (the European Southern Observatory Faint Object Spectrograph and
Camera v2) is one of the workhorse instruments on ESO's New Technology
Telescope (NTT), and is one of the most popular instruments at La Silla
observatory. It is mounted at a Nasmyth focus, and therefore exhibits strong,
wavelength and pointing-direction dependent instrumental polarisation. In this
document we describe our efforts to calibrate the broadband imaging polarimetry
mode, and provide a calibration for broadband B, V, R filters to a level that
satisfies most use cases (i.e. polarimetric calibration uncertainty ~0.1%). We
make our calibration codes public. This calibration effort can be used to
enhance the yield of future polarimetric programmes with EFOSC2, by allowing
good calibration with a greatly reduced number of standard star observations.
Similarly, our calibration model can be combined with archival calibration
observations to post-process data taken in past years, to form a EFOSC2 legacy
archive with substantial scientific potential.
| astro-ph.IM | efosc2 the european southern observatory faint object spectrograph and camera v2 is one of the workhorse instruments on esos new technology telescope ntt and is one of the most popular instruments at la silla observatory it is mounted at a nasmyth focus and therefore exhibits strong wavelength and pointingdirection dependent instrumental polarisation in this document we describe our efforts to calibrate the broadband imaging polarimetry mode and provide a calibration for broadband b v r filters to a level that satisfies most use cases ie polarimetric calibration uncertainty 01 we make our calibration codes public this calibration effort can be used to enhance the yield of future polarimetric programmes with efosc2 by allowing good calibration with a greatly reduced number of standard star observations similarly our calibration model can be combined with archival calibration observations to postprocess data taken in past years to form a efosc2 legacy archive with substantial scientific potential | [['efosc2', 'the', 'european', 'southern', 'observatory', 'faint', 'object', 'spectrograph', 'and', 'camera', 'v2', 'is', 'one', 'of', 'the', 'workhorse', 'instruments', 'on', 'esos', 'new', 'technology', 'telescope', 'ntt', 'and', 'is', 'one', 'of', 'the', 'most', 'popular', 'instruments', 'at', 'la', 'silla', 'observatory', 'it', 'is', 'mounted', 'at', 'a', 'nasmyth', 'focus', 'and', 'therefore', 'exhibits', 'strong', 'wavelength', 'and', 'pointingdirection', 'dependent', 'instrumental', 'polarisation', 'in', 'this', 'document', 'we', 'describe', 'our', 'efforts', 'to', 'calibrate', 'the', 'broadband', 'imaging', 'polarimetry', 'mode', 'and', 'provide', 'a', 'calibration', 'for', 'broadband', 'b', 'v', 'r', 'filters', 'to', 'a', 'level', 'that', 'satisfies', 'most', 'use', 'cases', 'ie', 'polarimetric', 'calibration', 'uncertainty', '01', 'we', 'make', 'our', 'calibration', 'codes', 'public', 'this', 'calibration', 'effort', 'can', 'be', 'used', 'to', 'enhance', 'the', 'yield', 'of', 'future', 'polarimetric', 'programmes', 'with', 'efosc2', 'by', 'allowing', 'good', 'calibration', 'with', 'a', 'greatly', 'reduced', 'number', 'of', 'standard', 'star', 'observations', 'similarly', 'our', 'calibration', 'model', 'can', 'be', 'combined', 'with', 'archival', 'calibration', 'observations', 'to', 'postprocess', 'data', 'taken', 'in', 'past', 'years', 'to', 'form', 'a', 'efosc2', 'legacy', 'archive', 'with', 'substantial', 'scientific', 'potential']] | [-0.052677188710069024, 0.04792518086811614, -0.11519886339885115, 0.023370942127095253, -0.1659372992449693, -0.18900783344893562, 0.013103274569155908, 0.44637148550538874, -0.18220439533369973, -0.37599891322720425, 0.17297691795882456, -0.3155572683926647, -0.0379335652336799, 0.26651570654708573, -0.10131452299441698, 0.00977515510843033, 0.1931828622573629, -0.1395058817404017, 0.0014409695533011725, -0.2584764991149874, 0.19348778228263142, 0.1765987810783631, 0.2601267129262996, -0.060714921167749444, 0.13610339602409238, -0.0054932790623348675, -0.13969476257037644, -0.00970603174302584, -0.11475441325537819, 0.08866653560555929, 0.335751910601428, 0.15145367707761115, 0.22264026371848505, -0.35945412644882074, -0.15449185677285965, 0.046466438099741936, 0.0736895110550651, -0.006403409817336213, -0.015171691148529532, -0.2980439424860162, 0.01053934368352708, -0.1627612504024916, -0.17139111759313783, -0.010782131498883053, -0.00017722412351740908, 0.026152213961379418, -0.2737527671624715, -0.04567673051458419, -0.1061116542901523, 0.13364611964191722, -0.06552918094968954, -0.14291830928626142, -0.023469136453492703, 0.15227187234894465, -0.036184598135897604, 0.10322088356885754, 0.06446615446340416, -0.13219605738586987, -0.026426981021310914, 0.35817460034856735, -0.1513953405595847, -0.04421848650799682, 0.16846050530851708, -0.20808765962596562, -0.19387666716406873, 0.10200547067053764, 0.1869070856322747, 0.09101340134893328, -0.17909567291842193, 0.07000214202963248, 0.030229938657497925, 0.2539250923949756, 0.03764149180878669, 0.08608184523868147, 0.2472363669819982, 0.18550467113686714, 0.05215682902462805, 0.08192346440797783, -0.30006590212806317, 0.023640058461317656, -0.2676705843815272, -0.12381371096029434, -0.1130676864720002, 0.04137633833725819, -0.07491890042478647, -0.09209037808059956, 0.3518903759317411, 0.2082086353630617, 0.09595603207650515, 0.014833718018848387, 0.3607447524154127, 0.035126072619054836, 0.16262737913126596, 0.016217824904285125, 0.3112630487654037, 0.08241237260691131, 0.18365671857883106, -0.16525320338689728, 0.019439223765192047, -0.00808168169121036] |
1,802.01891 | Comparison of Hartree-Fock and Hartree-Fock-Slater approximations for
calculation of radiation damage dynamics of light and heavy atoms in the
field of x-ray free electron laser | Simulations of radiation damage in single molecule imaging using a X-ray free
electron laser use atomic rates calculated in the lowest order. We investigate
the difference in ion yield predictions using Hartree-Fock and
Hartree-Fock-Slater pproximations for light and heavy elements of biological
significance. The results show that for the biologically abundant elements of
the second and third rows of the periodic table both approximations agree to
about 6%. For the heavier elements beyond the fourth row the discrepancy rices
to 11% for the range of the pulse parameters covered in this work. Presented
analysis can be used for an error estimation in a wide range of ab initio
simulations of the X-ray pulse interaction with biological molecules. We also
discuss other atomic structure effects and show that their account has
considerably smaller effect on the ion yields of respective elements compared
to the choice of the approximation.
| physics.atom-ph | simulations of radiation damage in single molecule imaging using a xray free electron laser use atomic rates calculated in the lowest order we investigate the difference in ion yield predictions using hartreefock and hartreefockslater pproximations for light and heavy elements of biological significance the results show that for the biologically abundant elements of the second and third rows of the periodic table both approximations agree to about 6 for the heavier elements beyond the fourth row the discrepancy rices to 11 for the range of the pulse parameters covered in this work presented analysis can be used for an error estimation in a wide range of ab initio simulations of the xray pulse interaction with biological molecules we also discuss other atomic structure effects and show that their account has considerably smaller effect on the ion yields of respective elements compared to the choice of the approximation | [['simulations', 'of', 'radiation', 'damage', 'in', 'single', 'molecule', 'imaging', 'using', 'a', 'xray', 'free', 'electron', 'laser', 'use', 'atomic', 'rates', 'calculated', 'in', 'the', 'lowest', 'order', 'we', 'investigate', 'the', 'difference', 'in', 'ion', 'yield', 'predictions', 'using', 'hartreefock', 'and', 'hartreefockslater', 'pproximations', 'for', 'light', 'and', 'heavy', 'elements', 'of', 'biological', 'significance', 'the', 'results', 'show', 'that', 'for', 'the', 'biologically', 'abundant', 'elements', 'of', 'the', 'second', 'and', 'third', 'rows', 'of', 'the', 'periodic', 'table', 'both', 'approximations', 'agree', 'to', 'about', '6', 'for', 'the', 'heavier', 'elements', 'beyond', 'the', 'fourth', 'row', 'the', 'discrepancy', 'rices', 'to', '11', 'for', 'the', 'range', 'of', 'the', 'pulse', 'parameters', 'covered', 'in', 'this', 'work', 'presented', 'analysis', 'can', 'be', 'used', 'for', 'an', 'error', 'estimation', 'in', 'a', 'wide', 'range', 'of', 'ab', 'initio', 'simulations', 'of', 'the', 'xray', 'pulse', 'interaction', 'with', 'biological', 'molecules', 'we', 'also', 'discuss', 'other', 'atomic', 'structure', 'effects', 'and', 'show', 'that', 'their', 'account', 'has', 'considerably', 'smaller', 'effect', 'on', 'the', 'ion', 'yields', 'of', 'respective', 'elements', 'compared', 'to', 'the', 'choice', 'of', 'the', 'approximation']] | [-0.04794443351749254, 0.13809471281992083, -0.020927642838876336, 0.07609910193722287, 0.02266386170769493, -0.07429450571103251, 0.060667792936366004, 0.40425098569400303, -0.24632820459911983, -0.3164518639470821, 0.04479842941987979, -0.3011349053855679, -0.07163495940717626, 0.21191633095939275, 0.015430322888128664, 0.04749418627662099, 0.08044645188165803, 0.01346496610315389, -0.0988165472366222, -0.20072401866272144, 0.26317378159688964, 0.0703746573680578, 0.21772670432325605, 0.06399200714435684, 0.06078775185287917, 0.02385838633309093, -0.025113456066034427, -0.006356229221014535, -0.13308735187885062, 0.15092646541896798, 0.23115879952730548, 0.05702140694962534, 0.22512225559370413, -0.4546013406847846, -0.2358147680930066, 0.04842349286996504, 0.13501100179624476, 0.13367340010861956, -0.08358310775467344, -0.21526640609755143, 0.07630681531018998, -0.17189016254389122, -0.14314442001002498, -0.05511828721181987, 0.017416357815469782, 0.07949623965486016, -0.28127838255182125, 0.05939515364936024, 0.004203390937668514, 0.06687017887422483, -0.09251258438708235, -0.17770574166605327, 0.011367782612318455, 0.10807534261472676, 0.01929491135404981, -0.0046486618541091785, 0.16556620265657004, -0.10039451562206274, -0.0856853089269812, 0.4297140744029965, -0.09268993573272856, -0.14703393349908803, 0.15543762651672396, -0.1855593446438035, -0.11171686433077063, 0.17091307886684798, 0.1427381767585159, 0.09967079594067924, -0.12572398095763263, 0.04227966557365319, -0.004709065250321993, 0.23005381647015208, 0.09761950708861934, 0.04571068423404677, 0.14887207483694162, 0.16208613836940072, 0.0007932259643782083, 0.09382989748571649, -0.1329329089079792, -0.08333851072669335, -0.2722784479209286, -0.13964065780053042, -0.15876271384959556, 3.220396569279367e-05, -0.09043059079893483, -0.14891769978766367, 0.3976675557317085, 0.16822319215303924, 0.15317195324125152, 0.0015718510545062998, 0.276996837415388, 0.10088550148225606, 0.051891034658781365, -0.006885492016420993, 0.2728282971521329, 0.16639459821593322, 0.058471063276344576, -0.25652803267748575, 0.07194325752390472, 0.024506304153139154] |
1,802.01892 | Projection onto Epigraph Sets for Rapid Self-Tuning Compressed Sensing
MRI | The compressed sensing (CS) framework leverages the sparsity of MR images to
reconstruct from undersampled acquisitions. CS reconstructions involve one or
more regularization parameters that weigh sparsity in transform domains against
fidelity to acquired data. While parameter selection is critical for
reconstruction quality, the optimal parameters are subject and dataset
specific. Thus, commonly practiced heuristic parameter selection generalizes
poorly to independent datasets. Recent studies have proposed to tune parameters
by estimating the risk of removing significant image coefficients. Line
searches are performed across the parameter space to identify the parameter
value that minimizes this risk. Although effective, these line searches yield
prolonged reconstruction times. Here, we propose a new self-tuning CS method
for multi-coil multi-acquisition reconstructions. The proposed method uses
computationally efficient projections onto epigraph sets of the $l_1$ and
total-variation norms to simultaneously achieve parameter selection and
regularization. In vivo demonstrations are provided for balanced steady-state
free precession, time-of-flight, and T1-weighted imaging. The proposed method
achieves nearly an order of magnitude improvement in computational efficiency
over line-search methods while maintaining near-optimal parameter selection.
| physics.med-ph | the compressed sensing cs framework leverages the sparsity of mr images to reconstruct from undersampled acquisitions cs reconstructions involve one or more regularization parameters that weigh sparsity in transform domains against fidelity to acquired data while parameter selection is critical for reconstruction quality the optimal parameters are subject and dataset specific thus commonly practiced heuristic parameter selection generalizes poorly to independent datasets recent studies have proposed to tune parameters by estimating the risk of removing significant image coefficients line searches are performed across the parameter space to identify the parameter value that minimizes this risk although effective these line searches yield prolonged reconstruction times here we propose a new selftuning cs method for multicoil multiacquisition reconstructions the proposed method uses computationally efficient projections onto epigraph sets of the l_1 and totalvariation norms to simultaneously achieve parameter selection and regularization in vivo demonstrations are provided for balanced steadystate free precession timeofflight and t1weighted imaging the proposed method achieves nearly an order of magnitude improvement in computational efficiency over linesearch methods while maintaining nearoptimal parameter selection | [['the', 'compressed', 'sensing', 'cs', 'framework', 'leverages', 'the', 'sparsity', 'of', 'mr', 'images', 'to', 'reconstruct', 'from', 'undersampled', 'acquisitions', 'cs', 'reconstructions', 'involve', 'one', 'or', 'more', 'regularization', 'parameters', 'that', 'weigh', 'sparsity', 'in', 'transform', 'domains', 'against', 'fidelity', 'to', 'acquired', 'data', 'while', 'parameter', 'selection', 'is', 'critical', 'for', 'reconstruction', 'quality', 'the', 'optimal', 'parameters', 'are', 'subject', 'and', 'dataset', 'specific', 'thus', 'commonly', 'practiced', 'heuristic', 'parameter', 'selection', 'generalizes', 'poorly', 'to', 'independent', 'datasets', 'recent', 'studies', 'have', 'proposed', 'to', 'tune', 'parameters', 'by', 'estimating', 'the', 'risk', 'of', 'removing', 'significant', 'image', 'coefficients', 'line', 'searches', 'are', 'performed', 'across', 'the', 'parameter', 'space', 'to', 'identify', 'the', 'parameter', 'value', 'that', 'minimizes', 'this', 'risk', 'although', 'effective', 'these', 'line', 'searches', 'yield', 'prolonged', 'reconstruction', 'times', 'here', 'we', 'propose', 'a', 'new', 'selftuning', 'cs', 'method', 'for', 'multicoil', 'multiacquisition', 'reconstructions', 'the', 'proposed', 'method', 'uses', 'computationally', 'efficient', 'projections', 'onto', 'epigraph', 'sets', 'of', 'the', 'l_1', 'and', 'totalvariation', 'norms', 'to', 'simultaneously', 'achieve', 'parameter', 'selection', 'and', 'regularization', 'in', 'vivo', 'demonstrations', 'are', 'provided', 'for', 'balanced', 'steadystate', 'free', 'precession', 'timeofflight', 'and', 't1weighted', 'imaging', 'the', 'proposed', 'method', 'achieves', 'nearly', 'an', 'order', 'of', 'magnitude', 'improvement', 'in', 'computational', 'efficiency', 'over', 'linesearch', 'methods', 'while', 'maintaining', 'nearoptimal', 'parameter', 'selection']] | [-0.04660899737631805, 0.025971087627869902, -0.03854156334748535, 0.03719059245747035, -0.10344505133753308, -0.17732334784851167, 0.051136843297587484, 0.4406094132045101, -0.2647962273701466, -0.34391985616964327, 0.12100790130483213, -0.23960860021078603, -0.12065232801520281, 0.2058985198920625, -0.13899946861733506, 0.1274453668903581, 0.10926237081936588, -0.027868390473607133, -0.10676257992217134, -0.267574204105044, 0.22759445138259474, 0.09350326715704764, 0.33828121103410946, -0.0454311954164393, 0.12236584354302378, 0.021820941258954004, -0.04636210189846942, 0.011116746597555923, -0.1333413085765831, 0.12151510311449432, 0.3116279688873732, 0.19908311641589177, 0.3018352473396916, -0.3702701302877805, -0.2619515161603323, 0.12126248434449767, 0.15405053348210507, 0.06532852089571203, -0.06962277661281237, -0.27826245653179255, 0.06357285719179155, -0.0780317059891686, -0.01624564911545701, -0.19194980925002883, -0.0463199930876558, -0.045554807957065305, -0.38563699646169225, 0.1327468510802951, -0.02629500832354833, 0.03251188136421876, -0.10421042728124758, -0.17171740618055267, 0.03454870440643227, 0.09416906014784654, 0.0757070226430613, 0.07142513991478895, 0.17201673949535698, -0.1194894915497781, -0.12000690740829258, 0.31597523602005634, -0.021059069289244454, -0.22058813934445898, 0.17786989070345902, -0.09183268089148867, -0.11374311226102486, 0.18484716139992194, 0.1878110110326374, 0.1296011330829018, -0.14567522337455627, 0.03934950662663777, 0.006210510333666223, 0.18800049184180925, 0.08443065384346346, 0.03382589738019284, 0.09079157136787117, 0.1757137160707868, 0.12770815893087126, 0.10711181941684443, -0.16877940417445034, -0.05958442794659708, -0.19738956872303837, -0.08635941782234118, -0.21211077842990614, -0.06238681241073188, -0.14372182187908247, -0.13930027427237934, 0.3931017789768992, 0.22176089801435625, 0.21972895912675328, 0.03628736989141302, 0.3731180258778952, 0.06068044136455982, 0.10814344682030896, 0.04414997884809885, 0.2372077344889844, 0.05691704827608444, 0.05011744410199291, -0.22599735418792188, 0.08294947358787684, 0.06820663202263286] |
1,802.01893 | Monte Carlo simulations of Gamma-ray space telescopes: a BoGEMMS
multi-purpose application | After the development of a BoGEMMS (Bologna Geant4 Multi-Mission Simulator)
template for the back- ground study of X-ray telescopes, a new extension is
built for the simulation of a Gamma-ray space mission (e.g. AGILE, Fermi),
conceived to work as a common, multi-purpose framework for the present and
future electron tracking gamma-ray space telescopes. The Gamma-ray extension
involves the Geant4 mass model, the physics list and, more important, the
production and treatment of the simulation output. From the user point of view,
the simulation set-up follows a tree structure, with the main level being the
selection of the simulation framework (the general, X-ray or gamma-ray
application) and the secondary levels being the detailed configuration of the
geometry and the output format. The BoGEMMS application to Gamma-ray missions
has been used to evaluate the instrument performances of a new generation of
Gamma-ray tele- scopes (e.g. Gamma-Light), and a full simulation of the AGILE
mission is currently under construction, to scientifically validate and
calibrate the simulator with real in-space data sets. A complete description of
the BoGEMMS Gamma-ray framework is presented here, with an overview of the
achieved results for the potential application to present and future
experiments (e.g., GAMMA-400 and Gamma-Light). The evaluation of the photon
conversion efficiency to beta particle pairs and the comparison to tabulated
data allows the preliminary physical validation of the overall architecture.
The Gamma-ray module application for the study of the Gamma-Light instrument
performances is reported as reference test case.
| astro-ph.IM | after the development of a bogemms bologna geant4 multimission simulator template for the back ground study of xray telescopes a new extension is built for the simulation of a gammaray space mission eg agile fermi conceived to work as a common multipurpose framework for the present and future electron tracking gammaray space telescopes the gammaray extension involves the geant4 mass model the physics list and more important the production and treatment of the simulation output from the user point of view the simulation setup follows a tree structure with the main level being the selection of the simulation framework the general xray or gammaray application and the secondary levels being the detailed configuration of the geometry and the output format the bogemms application to gammaray missions has been used to evaluate the instrument performances of a new generation of gammaray tele scopes eg gammalight and a full simulation of the agile mission is currently under construction to scientifically validate and calibrate the simulator with real inspace data sets a complete description of the bogemms gammaray framework is presented here with an overview of the achieved results for the potential application to present and future experiments eg gamma400 and gammalight the evaluation of the photon conversion efficiency to beta particle pairs and the comparison to tabulated data allows the preliminary physical validation of the overall architecture the gammaray module application for the study of the gammalight instrument performances is reported as reference test case | [['after', 'the', 'development', 'of', 'a', 'bogemms', 'bologna', 'geant4', 'multimission', 'simulator', 'template', 'for', 'the', 'back', 'ground', 'study', 'of', 'xray', 'telescopes', 'a', 'new', 'extension', 'is', 'built', 'for', 'the', 'simulation', 'of', 'a', 'gammaray', 'space', 'mission', 'eg', 'agile', 'fermi', 'conceived', 'to', 'work', 'as', 'a', 'common', 'multipurpose', 'framework', 'for', 'the', 'present', 'and', 'future', 'electron', 'tracking', 'gammaray', 'space', 'telescopes', 'the', 'gammaray', 'extension', 'involves', 'the', 'geant4', 'mass', 'model', 'the', 'physics', 'list', 'and', 'more', 'important', 'the', 'production', 'and', 'treatment', 'of', 'the', 'simulation', 'output', 'from', 'the', 'user', 'point', 'of', 'view', 'the', 'simulation', 'setup', 'follows', 'a', 'tree', 'structure', 'with', 'the', 'main', 'level', 'being', 'the', 'selection', 'of', 'the', 'simulation', 'framework', 'the', 'general', 'xray', 'or', 'gammaray', 'application', 'and', 'the', 'secondary', 'levels', 'being', 'the', 'detailed', 'configuration', 'of', 'the', 'geometry', 'and', 'the', 'output', 'format', 'the', 'bogemms', 'application', 'to', 'gammaray', 'missions', 'has', 'been', 'used', 'to', 'evaluate', 'the', 'instrument', 'performances', 'of', 'a', 'new', 'generation', 'of', 'gammaray', 'tele', 'scopes', 'eg', 'gammalight', 'and', 'a', 'full', 'simulation', 'of', 'the', 'agile', 'mission', 'is', 'currently', 'under', 'construction', 'to', 'scientifically', 'validate', 'and', 'calibrate', 'the', 'simulator', 'with', 'real', 'inspace', 'data', 'sets', 'a', 'complete', 'description', 'of', 'the', 'bogemms', 'gammaray', 'framework', 'is', 'presented', 'here', 'with', 'an', 'overview', 'of', 'the', 'achieved', 'results', 'for', 'the', 'potential', 'application', 'to', 'present', 'and', 'future', 'experiments', 'eg', 'gamma400', 'and', 'gammalight', 'the', 'evaluation', 'of', 'the', 'photon', 'conversion', 'efficiency', 'to', 'beta', 'particle', 'pairs', 'and', 'the', 'comparison', 'to', 'tabulated', 'data', 'allows', 'the', 'preliminary', 'physical', 'validation', 'of', 'the', 'overall', 'architecture', 'the', 'gammaray', 'module', 'application', 'for', 'the', 'study', 'of', 'the', 'gammalight', 'instrument', 'performances', 'is', 'reported', 'as', 'reference', 'test', 'case']] | [-0.05755509353039387, 0.05844006248431926, -0.0668793984730977, 0.1059723875481528, -0.09030189279681493, -0.08620703216534828, 0.024493626906218414, 0.38290165252830266, -0.19141401203134606, -0.3724185836984328, 0.09261681466869275, -0.2829568782455883, -0.07626810115608751, 0.28440797895647263, -0.014767329039918297, 0.07693075910670522, 0.13734687161401926, -0.020291623370070393, -0.03639797343816915, -0.21030346100619102, 0.27005162422924683, 0.2144020358598772, 0.29087162198912764, 0.025215220718822776, 0.11536193863822171, 0.020944961209909862, -0.07813852060698318, -0.04546580044959898, -0.1026744643557307, 0.12371124765704436, 0.26031836018794113, 0.18327239843625806, 0.21068297362687075, -0.37049502415636193, -0.20099304355918085, 0.05445647171752167, 0.06790230767337899, 0.01292200791151282, -0.06655963419567949, -0.3237830989130815, 0.038229776462041794, -0.23099826191805414, -0.15264630286835532, -0.029620160875696338, -0.022770407051997787, 0.03628937150409192, -0.23969420752130685, -0.06085281039529706, -0.007899215314613938, 0.06936383653727242, -0.09916537597228355, -0.0872224912046428, 0.01444308087612989, 0.13797621980382305, 0.01285177939753489, 0.0568259664579561, 0.132714149603235, -0.1131349841547819, -0.1430908500163245, 0.4036596008718259, -0.021581853435225326, -0.11124226737982083, 0.17551269778721187, -0.1258821015326697, -0.14636355760284994, 0.1191940178324319, 0.18594112076198704, 0.06857984967591095, -0.18065166302478525, 0.07505260882257205, 0.00589612432000507, 0.17023639135513505, 0.0023929818170221806, 0.0072050239517015245, 0.20907045179525766, 0.2714899959066143, 0.030308725546140974, 0.15925969474818635, -0.18918154373311785, -0.058118527862454146, -0.33293471240281386, -0.18107167233359892, -0.1518123754426653, 0.02759982120828251, -0.025848946903344557, -0.13587690780222905, 0.43039214029264306, 0.15289670608385844, 0.12158497825740174, 0.029165604682600915, 0.3673617869630885, 0.029982766969160104, 0.04693964491559982, 0.02075834521197871, 0.24442628159239474, 0.06594659596750582, 0.12182900584168702, -0.17911072187039448, 0.04460676855775585, 0.012245444807994329] |
1,802.01894 | The steerable graph Laplacian and its application to filtering image
data-sets | In recent years, improvements in various image acquisition techniques gave
rise to the need for adaptive processing methods, aimed particularly for large
datasets corrupted by noise and deformations. In this work, we consider
datasets of images sampled from a low-dimensional manifold (i.e. an
image-valued manifold), where the images can assume arbitrary planar rotations.
To derive an adaptive and rotation-invariant framework for processing such
datasets, we introduce a graph Laplacian (GL)-like operator over the dataset,
termed ${\textit{steerable graph Laplacian}}$. Essentially, the steerable GL
extends the standard GL by accounting for all (infinitely-many) planar
rotations of all images. As it turns out, similarly to the standard GL, a
properly normalized steerable GL converges to the Laplace-Beltrami operator on
the low-dimensional manifold. However, the steerable GL admits an improved
convergence rate compared to the GL, where the improved convergence behaves as
if the intrinsic dimension of the underlying manifold is lower by one.
Moreover, it is shown that the steerable GL admits eigenfunctions of the form
of Fourier modes (along the orbits of the images' rotations) multiplied by
eigenvectors of certain matrices, which can be computed efficiently by the FFT.
For image datasets corrupted by noise, we employ a subset of these
eigenfunctions to "filter" the dataset via a Fourier-like filtering scheme,
essentially using all images and their rotations simultaneously. We demonstrate
our filtering framework by de-noising simulated single-particle cryo-EM image
datasets.
| cs.CV cs.LG | in recent years improvements in various image acquisition techniques gave rise to the need for adaptive processing methods aimed particularly for large datasets corrupted by noise and deformations in this work we consider datasets of images sampled from a lowdimensional manifold ie an imagevalued manifold where the images can assume arbitrary planar rotations to derive an adaptive and rotationinvariant framework for processing such datasets we introduce a graph laplacian gllike operator over the dataset termed textitsteerable graph laplacian essentially the steerable gl extends the standard gl by accounting for all infinitelymany planar rotations of all images as it turns out similarly to the standard gl a properly normalized steerable gl converges to the laplacebeltrami operator on the lowdimensional manifold however the steerable gl admits an improved convergence rate compared to the gl where the improved convergence behaves as if the intrinsic dimension of the underlying manifold is lower by one moreover it is shown that the steerable gl admits eigenfunctions of the form of fourier modes along the orbits of the images rotations multiplied by eigenvectors of certain matrices which can be computed efficiently by the fft for image datasets corrupted by noise we employ a subset of these eigenfunctions to filter the dataset via a fourierlike filtering scheme essentially using all images and their rotations simultaneously we demonstrate our filtering framework by denoising simulated singleparticle cryoem image datasets | [['in', 'recent', 'years', 'improvements', 'in', 'various', 'image', 'acquisition', 'techniques', 'gave', 'rise', 'to', 'the', 'need', 'for', 'adaptive', 'processing', 'methods', 'aimed', 'particularly', 'for', 'large', 'datasets', 'corrupted', 'by', 'noise', 'and', 'deformations', 'in', 'this', 'work', 'we', 'consider', 'datasets', 'of', 'images', 'sampled', 'from', 'a', 'lowdimensional', 'manifold', 'ie', 'an', 'imagevalued', 'manifold', 'where', 'the', 'images', 'can', 'assume', 'arbitrary', 'planar', 'rotations', 'to', 'derive', 'an', 'adaptive', 'and', 'rotationinvariant', 'framework', 'for', 'processing', 'such', 'datasets', 'we', 'introduce', 'a', 'graph', 'laplacian', 'gllike', 'operator', 'over', 'the', 'dataset', 'termed', 'textitsteerable', 'graph', 'laplacian', 'essentially', 'the', 'steerable', 'gl', 'extends', 'the', 'standard', 'gl', 'by', 'accounting', 'for', 'all', 'infinitelymany', 'planar', 'rotations', 'of', 'all', 'images', 'as', 'it', 'turns', 'out', 'similarly', 'to', 'the', 'standard', 'gl', 'a', 'properly', 'normalized', 'steerable', 'gl', 'converges', 'to', 'the', 'laplacebeltrami', 'operator', 'on', 'the', 'lowdimensional', 'manifold', 'however', 'the', 'steerable', 'gl', 'admits', 'an', 'improved', 'convergence', 'rate', 'compared', 'to', 'the', 'gl', 'where', 'the', 'improved', 'convergence', 'behaves', 'as', 'if', 'the', 'intrinsic', 'dimension', 'of', 'the', 'underlying', 'manifold', 'is', 'lower', 'by', 'one', 'moreover', 'it', 'is', 'shown', 'that', 'the', 'steerable', 'gl', 'admits', 'eigenfunctions', 'of', 'the', 'form', 'of', 'fourier', 'modes', 'along', 'the', 'orbits', 'of', 'the', 'images', 'rotations', 'multiplied', 'by', 'eigenvectors', 'of', 'certain', 'matrices', 'which', 'can', 'be', 'computed', 'efficiently', 'by', 'the', 'fft', 'for', 'image', 'datasets', 'corrupted', 'by', 'noise', 'we', 'employ', 'a', 'subset', 'of', 'these', 'eigenfunctions', 'to', 'filter', 'the', 'dataset', 'via', 'a', 'fourierlike', 'filtering', 'scheme', 'essentially', 'using', 'all', 'images', 'and', 'their', 'rotations', 'simultaneously', 'we', 'demonstrate', 'our', 'filtering', 'framework', 'by', 'denoising', 'simulated', 'singleparticle', 'cryoem', 'image', 'datasets']] | [-0.09371677433826706, 0.03749616472100771, -0.07753402375476023, 0.04970436619720381, -0.07116859927320177, -0.1418938551662671, -0.014404648218501723, 0.4028212706088624, -0.27833998178655234, -0.2802811638283156, 0.1326400127454529, -0.2626766290008791, -0.183432601934167, 0.20104523689024545, -0.11935541133625037, 0.0886535534997825, 0.13317785663653858, 0.04936216646172848, -0.08696307740236048, -0.23902203990852222, 0.31618745961799327, 0.031482737346560555, 0.2829008787989913, -0.0523947417834955, 0.1445538426514517, 0.020683099004744954, -0.023877806651438956, 0.008679020634632911, -0.07739991455795929, 0.11983249488851237, 0.27621612755429265, 0.12542142272634282, 0.2503580125996563, -0.39982191830939423, -0.2165551471701139, 0.09977943670680434, 0.16505371044962708, 0.06416155974952704, -0.00255361165020994, -0.3565930197575847, 0.07699330551117098, -0.0932255631510531, -0.055702613927300325, -0.15632098462727267, 0.001618607423527875, -0.04088440342379767, -0.32510378137148455, 0.07743019614146149, 0.09438040790527202, 0.032324725047034104, -0.031576880687575755, -0.12312112642509813, -0.014151358312980759, 0.11904875654881754, -0.02012692271593744, 0.023923107915850506, 0.12484964189342165, -0.09352104077671976, -0.11293796237982578, 0.3678738562682792, -0.09677851933829354, -0.26332212518488546, 0.1267787649907147, -0.11366206311736157, -0.08852862866504728, 0.15196741278596487, 0.16104391841908125, 0.1299266431148914, -0.14324787192549393, 0.11438128744397287, -0.05893209119187256, 0.1536721544437094, 0.088802953815269, 0.005993234341865224, 0.11500644990535601, 0.14559240952294847, 0.10612603996476505, 0.142209262614431, -0.13805900076177566, -0.02700749861511229, -0.24466312272820326, -0.12036623799373948, -0.24844273095960787, 0.027688840790486904, -0.12857320915838855, -0.16819703219645446, 0.4056734706186019, 0.15675544672217057, 0.21373087827907464, 0.06569996127184992, 0.2930613232331466, 0.09292538772466948, 0.1107818718115692, 0.09322773405573273, 0.15402428485067826, 0.12234885449752014, 0.04433276532763879, -0.18342968830437012, -0.027411954433644865, 0.08620529817376055] |
1,802.01895 | Unified Models for Second-Order TV-Type Regularisation in Imaging - A
New Perspective Based on Vector Operators | We introduce a novel regulariser based on the natural vector field operations
gradient, divergence, curl and shear. For suitable choices of the weighting
parameters contained in our model it generalises well-known first- and
second-order TV-type regularisation methods including TV, ICTV and TGV$^2$ and
enables interpolation between them. To better understand the influence of each
parameter, we characterise the nullspaces of the respective regularisation
functionals. Analysing the continuous model, we conclude that it is not
sufficient to combine penalisation of the divergence and the curl to achieve
high-quality results, but interestingly it seems crucial that the penalty
functional includes at least one component of the shear or suitable boundary
conditions. We investigate which requirements regarding the choice of weighting
parameters yield a rotational invariant approach. To guarantee physically
meaningful reconstructions, implying that conservation laws for vectorial
differential operators remain valid, we need a careful discretisation that we
therefore discuss in detail.
| math.NA math.AP | we introduce a novel regulariser based on the natural vector field operations gradient divergence curl and shear for suitable choices of the weighting parameters contained in our model it generalises wellknown first and secondorder tvtype regularisation methods including tv ictv and tgv2 and enables interpolation between them to better understand the influence of each parameter we characterise the nullspaces of the respective regularisation functionals analysing the continuous model we conclude that it is not sufficient to combine penalisation of the divergence and the curl to achieve highquality results but interestingly it seems crucial that the penalty functional includes at least one component of the shear or suitable boundary conditions we investigate which requirements regarding the choice of weighting parameters yield a rotational invariant approach to guarantee physically meaningful reconstructions implying that conservation laws for vectorial differential operators remain valid we need a careful discretisation that we therefore discuss in detail | [['we', 'introduce', 'a', 'novel', 'regulariser', 'based', 'on', 'the', 'natural', 'vector', 'field', 'operations', 'gradient', 'divergence', 'curl', 'and', 'shear', 'for', 'suitable', 'choices', 'of', 'the', 'weighting', 'parameters', 'contained', 'in', 'our', 'model', 'it', 'generalises', 'wellknown', 'first', 'and', 'secondorder', 'tvtype', 'regularisation', 'methods', 'including', 'tv', 'ictv', 'and', 'tgv2', 'and', 'enables', 'interpolation', 'between', 'them', 'to', 'better', 'understand', 'the', 'influence', 'of', 'each', 'parameter', 'we', 'characterise', 'the', 'nullspaces', 'of', 'the', 'respective', 'regularisation', 'functionals', 'analysing', 'the', 'continuous', 'model', 'we', 'conclude', 'that', 'it', 'is', 'not', 'sufficient', 'to', 'combine', 'penalisation', 'of', 'the', 'divergence', 'and', 'the', 'curl', 'to', 'achieve', 'highquality', 'results', 'but', 'interestingly', 'it', 'seems', 'crucial', 'that', 'the', 'penalty', 'functional', 'includes', 'at', 'least', 'one', 'component', 'of', 'the', 'shear', 'or', 'suitable', 'boundary', 'conditions', 'we', 'investigate', 'which', 'requirements', 'regarding', 'the', 'choice', 'of', 'weighting', 'parameters', 'yield', 'a', 'rotational', 'invariant', 'approach', 'to', 'guarantee', 'physically', 'meaningful', 'reconstructions', 'implying', 'that', 'conservation', 'laws', 'for', 'vectorial', 'differential', 'operators', 'remain', 'valid', 'we', 'need', 'a', 'careful', 'discretisation', 'that', 'we', 'therefore', 'discuss', 'in', 'detail']] | [-0.10282594354263179, 0.052784890408401154, -0.11335940540743035, 0.09900801157581972, -0.12210214615648461, -0.1384344719935561, 0.029013686745767354, 0.38311333768069744, -0.28889689675683305, -0.27717278165289677, 0.09120950537475732, -0.21866318974895654, -0.16393248400374824, 0.1693872946764443, -0.09851582239482652, 0.08270159836959194, 0.04983723868232069, 0.006477208845820781, -0.1107719065794545, -0.23345260328937298, 0.3498163563136414, 0.030192752236601065, 0.29046378131779665, 0.03819508619788984, 0.15048747586646444, 0.004878982492546375, -0.0797800612116761, 0.03553986982906527, -0.16823465533879417, 0.12316202679239968, 0.1946113969929315, 0.10943767785608322, 0.28459899560894464, -0.389177297584939, -0.2206328992442404, 0.10514962362012246, 0.08265287611976492, 0.07512932483852539, -0.00515235512835175, -0.2081647840787883, 0.06829540559556335, -0.1158193067405247, -0.11382132855313201, -0.17479227521658144, -0.01742395247266678, 0.02127664241030485, -0.33611100182256576, 0.11737189848114409, 0.06697013286277463, 0.030627266529041366, -0.10445423547109287, -0.11405667383243437, -0.026849830331795256, 0.11295379534980433, 0.061024930243179, 0.029519771062139724, 0.10316588653006113, -0.12050807065758351, -0.046295260735221104, 0.3751066546962672, -0.060446934345039866, -0.2625790265376201, 0.1762188194827743, -0.1179750038726205, -0.16770415577559253, 0.07406007996886163, 0.1375197027027261, 0.11526428611988022, -0.15715428774647816, 0.06263979255792848, 0.014283581980979195, 0.16341181565705384, 0.05543591992652698, 0.03334646434774874, 0.13936341181397438, 0.11496670585050173, 0.13419347897335585, 0.10852694229657031, -0.07135140122330552, -0.09851221110659174, -0.3563956329245057, -0.15108132432214916, -0.12707958770664157, -6.794287165158076e-05, -0.10188738198436063, -0.18991837673191284, 0.3837326869551042, 0.20326482178643346, 0.18107987308365017, 0.0463960859043574, 0.2844671207272473, 0.13210180565609433, 0.09559071258991025, 0.06637674222253515, 0.23169879804088458, 0.13032537841275837, 0.06942650662244272, -0.21222229326943037, 0.0551340627496609, 0.08132832169428945] |
1,802.01896 | High accuracy methods for eigenvalues of elliptic operators by
nonconforming elements | In this paper, three high-accuracy methods for eigenvalues of second order
elliptic operators are proposed by using the nonconforming Crouzeix-Raviart(CR
for short) element and the nonconforming enriched Crouzeix-Raviart(ECR for
short) element. They are based on a crucial full one order superconvergence of
the first order mixed Raviart-Thomas(RT for short) element. The main ingredient
of such a superconvergence analysis is to employ a discrete Helmholtz
decomposition of the difference between the canonical interpolation and the
finite element solution of the RT element. In particular, it allows for some
vital cancellation between terms in one key sum of boundary terms.
Consequently, a full one order superconvergence follows from a special relation
between the CR element and the RT element, and the equivalence between the ECR
element and the RT element for these two nonconforming elements. These
superconvergence results improve those in literature from a half order to a
full one order for the RT element, the CR element and the ECR element. Based on
the aforementioned superconvergence of the RT element, asymptotic expansions of
eigenvalues are established and employed to achieve high accuracy extrapolation
methods for these two nonconforming elements. In contrast to a classic analysis
in literature, the novelty herein is to use not only the canonical
interpolations of these nonconforming elements but also that of the RT element
to analyze such asymptotic expansions. Based on the superconvergence of these
nonconforming elements, asymptotically exact a posteriori error estimators of
eigenvalues are constructed and analyzed for them. Finally, two post-processing
methods are proposed to improve accuracy of approximate eigenvalues by
employing these a posteriori error estimators.Numerical tests are provided to
justify and compare the performance of the aforementioned methods.
| math.NA | in this paper three highaccuracy methods for eigenvalues of second order elliptic operators are proposed by using the nonconforming crouzeixraviartcr for short element and the nonconforming enriched crouzeixraviartecr for short element they are based on a crucial full one order superconvergence of the first order mixed raviartthomasrt for short element the main ingredient of such a superconvergence analysis is to employ a discrete helmholtz decomposition of the difference between the canonical interpolation and the finite element solution of the rt element in particular it allows for some vital cancellation between terms in one key sum of boundary terms consequently a full one order superconvergence follows from a special relation between the cr element and the rt element and the equivalence between the ecr element and the rt element for these two nonconforming elements these superconvergence results improve those in literature from a half order to a full one order for the rt element the cr element and the ecr element based on the aforementioned superconvergence of the rt element asymptotic expansions of eigenvalues are established and employed to achieve high accuracy extrapolation methods for these two nonconforming elements in contrast to a classic analysis in literature the novelty herein is to use not only the canonical interpolations of these nonconforming elements but also that of the rt element to analyze such asymptotic expansions based on the superconvergence of these nonconforming elements asymptotically exact a posteriori error estimators of eigenvalues are constructed and analyzed for them finally two postprocessing methods are proposed to improve accuracy of approximate eigenvalues by employing these a posteriori error estimatorsnumerical tests are provided to justify and compare the performance of the aforementioned methods | [['in', 'this', 'paper', 'three', 'highaccuracy', 'methods', 'for', 'eigenvalues', 'of', 'second', 'order', 'elliptic', 'operators', 'are', 'proposed', 'by', 'using', 'the', 'nonconforming', 'crouzeixraviartcr', 'for', 'short', 'element', 'and', 'the', 'nonconforming', 'enriched', 'crouzeixraviartecr', 'for', 'short', 'element', 'they', 'are', 'based', 'on', 'a', 'crucial', 'full', 'one', 'order', 'superconvergence', 'of', 'the', 'first', 'order', 'mixed', 'raviartthomasrt', 'for', 'short', 'element', 'the', 'main', 'ingredient', 'of', 'such', 'a', 'superconvergence', 'analysis', 'is', 'to', 'employ', 'a', 'discrete', 'helmholtz', 'decomposition', 'of', 'the', 'difference', 'between', 'the', 'canonical', 'interpolation', 'and', 'the', 'finite', 'element', 'solution', 'of', 'the', 'rt', 'element', 'in', 'particular', 'it', 'allows', 'for', 'some', 'vital', 'cancellation', 'between', 'terms', 'in', 'one', 'key', 'sum', 'of', 'boundary', 'terms', 'consequently', 'a', 'full', 'one', 'order', 'superconvergence', 'follows', 'from', 'a', 'special', 'relation', 'between', 'the', 'cr', 'element', 'and', 'the', 'rt', 'element', 'and', 'the', 'equivalence', 'between', 'the', 'ecr', 'element', 'and', 'the', 'rt', 'element', 'for', 'these', 'two', 'nonconforming', 'elements', 'these', 'superconvergence', 'results', 'improve', 'those', 'in', 'literature', 'from', 'a', 'half', 'order', 'to', 'a', 'full', 'one', 'order', 'for', 'the', 'rt', 'element', 'the', 'cr', 'element', 'and', 'the', 'ecr', 'element', 'based', 'on', 'the', 'aforementioned', 'superconvergence', 'of', 'the', 'rt', 'element', 'asymptotic', 'expansions', 'of', 'eigenvalues', 'are', 'established', 'and', 'employed', 'to', 'achieve', 'high', 'accuracy', 'extrapolation', 'methods', 'for', 'these', 'two', 'nonconforming', 'elements', 'in', 'contrast', 'to', 'a', 'classic', 'analysis', 'in', 'literature', 'the', 'novelty', 'herein', 'is', 'to', 'use', 'not', 'only', 'the', 'canonical', 'interpolations', 'of', 'these', 'nonconforming', 'elements', 'but', 'also', 'that', 'of', 'the', 'rt', 'element', 'to', 'analyze', 'such', 'asymptotic', 'expansions', 'based', 'on', 'the', 'superconvergence', 'of', 'these', 'nonconforming', 'elements', 'asymptotically', 'exact', 'a', 'posteriori', 'error', 'estimators', 'of', 'eigenvalues', 'are', 'constructed', 'and', 'analyzed', 'for', 'them', 'finally', 'two', 'postprocessing', 'methods', 'are', 'proposed', 'to', 'improve', 'accuracy', 'of', 'approximate', 'eigenvalues', 'by', 'employing', 'these', 'a', 'posteriori', 'error', 'estimatorsnumerical', 'tests', 'are', 'provided', 'to', 'justify', 'and', 'compare', 'the', 'performance', 'of', 'the', 'aforementioned', 'methods']] | [-0.05856846040200046, 0.012199636549610413, -0.07761470101186972, 0.05995654005552181, -0.04300881994567511, -0.08921640911463634, 0.05159832376538138, 0.3711298360240274, -0.26705466034044356, -0.24756850135058928, 0.15041032445364574, -0.28939949463539705, -0.08902502635104971, 0.18974524272107707, -0.05488839823728762, 0.11795232996289984, 0.0635730353799809, 0.040581358571949624, -0.13447773941125613, -0.23057595811675102, 0.34448690130460613, -0.0013333897519133466, 0.2611628161374848, 0.036948330504239804, 0.09358621120145638, -0.07733184988047559, -0.05655754714924501, 0.020791380226120842, -0.10065561891572346, 0.17006356914053525, 0.29214678752413464, 0.038154993895373066, 0.27447634434409357, -0.41046746055708155, -0.19841663609685262, 0.09170322848019964, 0.1389422864404135, 0.08501118596049619, -0.07350316296558446, -0.20356427597977056, 0.15650181063429977, -0.1505038334882303, -0.12123295006720902, -0.07253735851165549, -0.03831441851414658, 0.07464440354579316, -0.34959408753460286, 0.04883643518355095, 0.05778347422738113, 0.07102880627002171, -0.00836582340137187, -0.18088997725735081, 0.02711973054123012, 0.16363765735131425, 0.03021804960410455, -0.05162639093786587, -0.012541698250107659, -0.02123811705150529, -0.06499968032222991, 0.4011505953217055, -0.05993762962654874, -0.2399212781121552, 0.16742238449700342, -0.12631501063031583, -0.08988285241068611, 0.11371481248421506, 0.14827623860671735, 0.15363879097196412, -0.10950387033528133, 0.07368386423726132, 0.02607411160449337, 0.15220538423406882, 0.06019217732120237, -0.0013374497469228047, 0.08266473395985316, 0.13519649018854202, 0.0680043515510475, 0.06559317858272229, -0.06140861354545253, -0.09236162493087269, -0.38119826197023793, -0.23034129484476445, -0.18721002528457578, -0.04391912751673975, -0.1507432264025428, -0.21505938707117414, 0.3980568497213143, 0.16531693029486927, 0.12026572959743194, 0.028027563934101836, 0.31777742468912307, 0.1370298313616601, 0.03472707331207864, 0.07921162423346834, 0.2323513924014787, 0.1856902043340257, 0.06017105589856265, -0.2559090822694385, 0.045161057638870926, 0.24258489762057614] |
1,802.01897 | A distinguishable single excited-impurity in a Bose-Einstein condensate | We investigate the properties of a distinguishable single excited state
impurity pinned in the center of a trapped Bose-Einstein condensate (BEC) in a
one-dimensional harmonic trapping potential by changing the bare mass of the
impurity and its interspecies interaction strength with the BEC. We model our
system by using two coupled differential equations for the condensate and the
single excited-impurity wave function, which we solve numerically. For
equilibrium, we obtain that an excited-impurity induces two bumps or dips on
the condensate for the attractive- or repulsive-interspecies coupling
strengths, respectively. Afterwards, we show that the excited-impurity induced
imprint upon the condensate wave function remains present during a
time-of-flight (TOF) expansion after having switched off the harmonic
confinement. We also investigate shock-waves or gray-solitons by switching off
the interspecies coupling strength in the presence of harmonic trapping
potential. During this process, we found out that the generation of gray
bi-soliton or gray quad-solitons (four-solitons) depends on the bare mass of
the excited-impurity in a harmonic trap.
| quant-ph | we investigate the properties of a distinguishable single excited state impurity pinned in the center of a trapped boseeinstein condensate bec in a onedimensional harmonic trapping potential by changing the bare mass of the impurity and its interspecies interaction strength with the bec we model our system by using two coupled differential equations for the condensate and the single excitedimpurity wave function which we solve numerically for equilibrium we obtain that an excitedimpurity induces two bumps or dips on the condensate for the attractive or repulsiveinterspecies coupling strengths respectively afterwards we show that the excitedimpurity induced imprint upon the condensate wave function remains present during a timeofflight tof expansion after having switched off the harmonic confinement we also investigate shockwaves or graysolitons by switching off the interspecies coupling strength in the presence of harmonic trapping potential during this process we found out that the generation of gray bisoliton or gray quadsolitons foursolitons depends on the bare mass of the excitedimpurity in a harmonic trap | [['we', 'investigate', 'the', 'properties', 'of', 'a', 'distinguishable', 'single', 'excited', 'state', 'impurity', 'pinned', 'in', 'the', 'center', 'of', 'a', 'trapped', 'boseeinstein', 'condensate', 'bec', 'in', 'a', 'onedimensional', 'harmonic', 'trapping', 'potential', 'by', 'changing', 'the', 'bare', 'mass', 'of', 'the', 'impurity', 'and', 'its', 'interspecies', 'interaction', 'strength', 'with', 'the', 'bec', 'we', 'model', 'our', 'system', 'by', 'using', 'two', 'coupled', 'differential', 'equations', 'for', 'the', 'condensate', 'and', 'the', 'single', 'excitedimpurity', 'wave', 'function', 'which', 'we', 'solve', 'numerically', 'for', 'equilibrium', 'we', 'obtain', 'that', 'an', 'excitedimpurity', 'induces', 'two', 'bumps', 'or', 'dips', 'on', 'the', 'condensate', 'for', 'the', 'attractive', 'or', 'repulsiveinterspecies', 'coupling', 'strengths', 'respectively', 'afterwards', 'we', 'show', 'that', 'the', 'excitedimpurity', 'induced', 'imprint', 'upon', 'the', 'condensate', 'wave', 'function', 'remains', 'present', 'during', 'a', 'timeofflight', 'tof', 'expansion', 'after', 'having', 'switched', 'off', 'the', 'harmonic', 'confinement', 'we', 'also', 'investigate', 'shockwaves', 'or', 'graysolitons', 'by', 'switching', 'off', 'the', 'interspecies', 'coupling', 'strength', 'in', 'the', 'presence', 'of', 'harmonic', 'trapping', 'potential', 'during', 'this', 'process', 'we', 'found', 'out', 'that', 'the', 'generation', 'of', 'gray', 'bisoliton', 'or', 'gray', 'quadsolitons', 'foursolitons', 'depends', 'on', 'the', 'bare', 'mass', 'of', 'the', 'excitedimpurity', 'in', 'a', 'harmonic', 'trap']] | [-0.16070030933478846, 0.23053706392320236, -0.05065920668421313, 0.034826604950342246, 0.0296628094103653, -0.15268213012604975, 0.04658780822501285, 0.38536071600974536, -0.24769167696940714, -0.2219943938893266, 0.018552542268298566, -0.28025412034476177, -0.0980868454062147, 0.14099418973346473, 0.07854561338826897, 0.017580866815478657, 0.03460987921716878, 0.04689864898537053, -0.05935790706280386, -0.21482031548512168, 0.3674540032632649, 0.008619403728516772, 0.23733184778975555, 0.12620349517674184, 0.10174631280533504, 0.05157828523515491, 0.07640612997493008, -0.03878173216871801, -0.13005309307695825, 0.04539430796139641, 0.11097502192023967, 0.003887226717779413, 0.23412933743093162, -0.44670164748094976, -0.19163490824503243, 0.1157356984273065, 0.18850658007431775, 0.17187311545058037, -0.09186640263433218, -0.3161782535142265, -0.04721442331501748, -0.15617018127813936, -0.18686382079904434, -0.05968479081930127, 0.03719011398497969, 0.06437934215646238, -0.2581459424174682, 0.1058028388169987, 0.05576374984375434, 0.02562084433156997, -0.11546484736245474, -0.0413754355358833, -0.03868996883247746, 0.037469941747258415, -0.0037249429611620143, 0.023334709566552193, 0.16720590275326686, -0.1648740339689539, -0.034017241562833075, 0.3476484944112599, -0.18020664781652157, -0.15582382067805156, 0.16188580028683647, -0.13127091293899867, -0.017967893881723283, 0.12818819674721454, 0.16997320639784447, 0.10167553201899864, -0.11257846998050809, 0.05330414951313287, -0.008767930959402292, 0.18930663115879726, 0.1414169991388917, 0.00859505036205519, 0.29225265155546365, 0.1708604748477228, 0.028445614215161185, 0.2066064698563423, -0.12821137852442915, -0.10995450815826188, -0.2541957653796999, -0.0991278336965479, -0.19090827062900645, 0.033997546860155124, -0.04702132952206739, -0.16429280371521598, 0.41005151644349097, 0.12192866706755012, 0.20145560018427205, -0.017390509129472775, 0.29035351471102333, 0.1725601093530713, 0.05421167365166184, 0.009692823963996488, 0.314816209388664, 0.13107344639283838, 0.08393205058673629, -0.33340124085661954, -0.029758580535417422, 0.06334391400014283] |
1,802.01898 | Stochasticity and Bell-type Quantum Field Theory | This paper critically discusses an objection proposed by H. Nikolic against
the naturalness of the stochastic dynamics implemented by the Bell-type Quantum
Field Theory, an extension of Bohmian Mechanics able to describe the phenomena
of particles creation and annihilation. Here I present: (i) Nikolic's ideas for
a pilot-wave theory accounting for QFT phenomenology evaluating the robustness
of his criticism, (ii) Bell's original proposal for a Bohmian QFT with a
particle ontology and (iii) the mentioned Bell-type QFT. I will argue that
although Bell's model should be interpreted as a heuristic example showing the
possibility to extend Bohm's pilot- wave theory to the domain of QFT, the same
judgement does not hold for the Bell-type QFT, which is candidate to be a
promising possible alternative proposal to the standard version of quantum
field theory. Finally, contra Nikolic, I will provide arguments in order to
show how a stochastic dynamics is perfectly compatible with a Bohmian quantum
theory.
| quant-ph physics.hist-ph | this paper critically discusses an objection proposed by h nikolic against the naturalness of the stochastic dynamics implemented by the belltype quantum field theory an extension of bohmian mechanics able to describe the phenomena of particles creation and annihilation here i present i nikolics ideas for a pilotwave theory accounting for qft phenomenology evaluating the robustness of his criticism ii bells original proposal for a bohmian qft with a particle ontology and iii the mentioned belltype qft i will argue that although bells model should be interpreted as a heuristic example showing the possibility to extend bohms pilot wave theory to the domain of qft the same judgement does not hold for the belltype qft which is candidate to be a promising possible alternative proposal to the standard version of quantum field theory finally contra nikolic i will provide arguments in order to show how a stochastic dynamics is perfectly compatible with a bohmian quantum theory | [['this', 'paper', 'critically', 'discusses', 'an', 'objection', 'proposed', 'by', 'h', 'nikolic', 'against', 'the', 'naturalness', 'of', 'the', 'stochastic', 'dynamics', 'implemented', 'by', 'the', 'belltype', 'quantum', 'field', 'theory', 'an', 'extension', 'of', 'bohmian', 'mechanics', 'able', 'to', 'describe', 'the', 'phenomena', 'of', 'particles', 'creation', 'and', 'annihilation', 'here', 'i', 'present', 'i', 'nikolics', 'ideas', 'for', 'a', 'pilotwave', 'theory', 'accounting', 'for', 'qft', 'phenomenology', 'evaluating', 'the', 'robustness', 'of', 'his', 'criticism', 'ii', 'bells', 'original', 'proposal', 'for', 'a', 'bohmian', 'qft', 'with', 'a', 'particle', 'ontology', 'and', 'iii', 'the', 'mentioned', 'belltype', 'qft', 'i', 'will', 'argue', 'that', 'although', 'bells', 'model', 'should', 'be', 'interpreted', 'as', 'a', 'heuristic', 'example', 'showing', 'the', 'possibility', 'to', 'extend', 'bohms', 'pilot', 'wave', 'theory', 'to', 'the', 'domain', 'of', 'qft', 'the', 'same', 'judgement', 'does', 'not', 'hold', 'for', 'the', 'belltype', 'qft', 'which', 'is', 'candidate', 'to', 'be', 'a', 'promising', 'possible', 'alternative', 'proposal', 'to', 'the', 'standard', 'version', 'of', 'quantum', 'field', 'theory', 'finally', 'contra', 'nikolic', 'i', 'will', 'provide', 'arguments', 'in', 'order', 'to', 'show', 'how', 'a', 'stochastic', 'dynamics', 'is', 'perfectly', 'compatible', 'with', 'a', 'bohmian', 'quantum', 'theory']] | [-0.048591741404285835, 0.11808888881726401, -0.15689715135301793, 0.13852172035521138, -0.1167097979705901, -0.20545881177569109, 0.009944782021545594, 0.2861526596329866, -0.22114934858175056, -0.2593237286493663, 0.0087867550514338, -0.23218661977819377, -0.17564590394256577, 0.147961344169603, -0.12260448630718936, 0.0526682116611365, 0.04107660100449838, 0.024891342816220956, -0.032672632438874236, -0.2637802132375298, 0.2816477540534951, 0.0946495505492954, 0.2896576606007593, 0.04731648267517167, 0.05800289685327199, 0.03612382255284296, -0.015163152582282501, 0.04776552672527971, -0.12205034535882371, 0.11930491942011061, 0.249773357312886, 0.22951147826688906, 0.29814121876392635, -0.4563844420196068, -0.22681658454239367, 0.04828526978230765, 0.12747098505159, 0.1755499499181526, -0.055991685753237576, -0.382199871894573, 0.0196358235372651, -0.17007042014550777, -0.1869564164339775, -0.081554625387634, 0.018191144451679242, -0.074656910139827, -0.21820179072899684, 0.05984219378987027, 0.07420188803225755, 0.017955985178630198, 0.00577895479284287, -0.040327420901326884, 0.0757038492108545, 0.007182402767601513, 0.026292583901405094, 0.035757431799485796, 0.14073894409342638, -0.11650197432797042, -0.23751001048442577, 0.40011211533940605, -0.0440308345793446, -0.23285452536337317, 0.15082218212323384, -0.09660523306473248, -0.14787353372817197, 0.023008408229197225, 0.043122909770857906, 0.08221549478269392, -0.1497293293175678, 0.10910748193235767, -0.04233720831924133, 0.14707591039327633, 0.021089055555902663, 0.06371088383959667, 0.24573569737615125, 0.09797986234170235, 0.000998695771540365, 0.06791533394416253, -0.03255537260443934, -0.18213444862612374, -0.4334969037122303, -0.22489733328261682, -0.18699679355167093, 0.09489658900701832, -0.033119393957050276, -0.15114386147789416, 0.34736014268841714, 0.24082088581015987, 0.09297722355732994, 0.052456491738708026, 0.2570836265000605, 0.10421534022541656, 0.010733528271122205, 0.026616653301302463, 0.27406462877538174, 0.14303350978560986, 0.12487972711002635, -0.19683182693176693, 0.010756868069931385, 0.0859453153661302] |
1,802.01899 | Theory of optical forces on small particles by multiple plane waves | We theoretically investigate the optical force exerted on an isotropic
particle illuminated by a superposition of plane waves. We derive explicit
analytical expressions for the exerted force up to quadrupolar
polarizabilities. Based on these analytical expressions, we demonstrate that an
illumination consisting of two tilted plane waves can provide a full control on
the optical force. In particular, optical pulling, pushing and lateral forces
can be obtained by the proper tuning of illumination parameters. Our findings
might unlock multiple applications based on a deterministic control of the
spatial motion of small particles.
| physics.optics | we theoretically investigate the optical force exerted on an isotropic particle illuminated by a superposition of plane waves we derive explicit analytical expressions for the exerted force up to quadrupolar polarizabilities based on these analytical expressions we demonstrate that an illumination consisting of two tilted plane waves can provide a full control on the optical force in particular optical pulling pushing and lateral forces can be obtained by the proper tuning of illumination parameters our findings might unlock multiple applications based on a deterministic control of the spatial motion of small particles | [['we', 'theoretically', 'investigate', 'the', 'optical', 'force', 'exerted', 'on', 'an', 'isotropic', 'particle', 'illuminated', 'by', 'a', 'superposition', 'of', 'plane', 'waves', 'we', 'derive', 'explicit', 'analytical', 'expressions', 'for', 'the', 'exerted', 'force', 'up', 'to', 'quadrupolar', 'polarizabilities', 'based', 'on', 'these', 'analytical', 'expressions', 'we', 'demonstrate', 'that', 'an', 'illumination', 'consisting', 'of', 'two', 'tilted', 'plane', 'waves', 'can', 'provide', 'a', 'full', 'control', 'on', 'the', 'optical', 'force', 'in', 'particular', 'optical', 'pulling', 'pushing', 'and', 'lateral', 'forces', 'can', 'be', 'obtained', 'by', 'the', 'proper', 'tuning', 'of', 'illumination', 'parameters', 'our', 'findings', 'might', 'unlock', 'multiple', 'applications', 'based', 'on', 'a', 'deterministic', 'control', 'of', 'the', 'spatial', 'motion', 'of', 'small', 'particles']] | [-0.19361598300747573, 0.14230201519176658, -0.08695368425232237, -0.025020616736425007, -0.10182083419362165, -0.09809174907454492, 0.022904435299215434, 0.4330038412514588, -0.2542610082081924, -0.2893462790095288, 0.036860588126886716, -0.22065241420742773, -0.16155679525969469, 0.2777463268658207, -0.018307097276429766, 0.03212534074238805, -0.011863821440467449, -0.023283730745353514, -0.02350215224609913, -0.13397571834249664, 0.27142271962846914, 0.029271198517602424, 0.2728263852793885, 0.06846329311678268, 0.15485812975194954, 0.06875733293734652, -0.002625518033038015, 0.031654355427472976, -0.17372480073588478, 0.1394161092137675, 0.12805557916062357, -0.0021362734323306736, 0.21717044641263783, -0.5309683330681013, -0.22233848774846157, 0.04288441060698065, 0.17004142998484895, 0.17146402254255247, -0.10833389830836297, -0.310581437089359, -0.02256487250206587, -0.12071966951834442, -0.1688881200958428, -0.09102319067587024, 0.036318434635177255, 0.10172934034072449, -0.2921200307572018, 0.044278096893559334, 0.023780739488480005, 0.07952961983645092, -0.13913861790206283, -0.06961233158717336, 0.01096719204519025, 0.1433527018905253, -0.006513138984977875, 0.008882121461362618, 0.22296827168548075, -0.14203339122215528, -0.1144795670634662, 0.3745948164318891, -0.07260956576741907, -0.2522503497159999, 0.16558310522257513, -0.13297797820237262, -0.004278592896931197, 0.14431262684419102, 0.22268993036983453, 0.11257638351019958, -0.16038943342257128, 0.006561907604918815, -0.04023785971651744, 0.1811374662363011, 0.14227414782078046, -0.00011019440084371878, 0.26245546697274497, 0.1183213402046417, 0.03293079215623236, 0.17739774348371176, -0.13532805673109935, -0.06314232759683838, -0.2749790805651371, -0.08216492614060965, -0.18429783800788951, 0.05275458067088672, -0.11627915960153863, -0.14224674220642317, 0.35667689509041933, 0.16491496406050157, 0.15366605615607745, 0.029422810680799834, 0.3687849725070207, 0.12487753382605582, 0.031536131479736905, 0.027569630441417838, 0.34465124105791684, 0.11340371614863651, 0.018118977212630536, -0.24875952083738925, 0.02056610736611259, 0.026012886275091896] |
1,802.019 | BoGEMMS: the Bologna Geant4 multi-mission simulator | BoGEMMS, (Bologna Geant4 Multi-Mission Simulator) is a software project for
fast simulation of payload on board of scientific satellites for prompt
background evaluation that has been developed at the INAF/IASF Bologna. By
exploiting the Geant4 set of libraries, BoGEMMS allows to interactively set the
geometrical and physical parameters (e.g. physics list, materials and
thicknesses), recording the interactions (e.g. energy deposit, position,
interacting particle) in NASA FITS and CERN root format output files and
filtering the output as a real observation in space, to finally produce the
background detected count rate and spectra. Four different types of output can
be produced by the BoGEMMS capturing different aspects of the interactions. The
simulator can also run in parallel jobs and store the results in a centralized
server via xrootd protocol. The BoGEMMS is a multi-mission tool, generally
designed to be applied to any high-energy mission for which the shielding and
instruments performances analysis is required.
| astro-ph.IM | bogemms bologna geant4 multimission simulator is a software project for fast simulation of payload on board of scientific satellites for prompt background evaluation that has been developed at the inafiasf bologna by exploiting the geant4 set of libraries bogemms allows to interactively set the geometrical and physical parameters eg physics list materials and thicknesses recording the interactions eg energy deposit position interacting particle in nasa fits and cern root format output files and filtering the output as a real observation in space to finally produce the background detected count rate and spectra four different types of output can be produced by the bogemms capturing different aspects of the interactions the simulator can also run in parallel jobs and store the results in a centralized server via xrootd protocol the bogemms is a multimission tool generally designed to be applied to any highenergy mission for which the shielding and instruments performances analysis is required | [['bogemms', 'bologna', 'geant4', 'multimission', 'simulator', 'is', 'a', 'software', 'project', 'for', 'fast', 'simulation', 'of', 'payload', 'on', 'board', 'of', 'scientific', 'satellites', 'for', 'prompt', 'background', 'evaluation', 'that', 'has', 'been', 'developed', 'at', 'the', 'inafiasf', 'bologna', 'by', 'exploiting', 'the', 'geant4', 'set', 'of', 'libraries', 'bogemms', 'allows', 'to', 'interactively', 'set', 'the', 'geometrical', 'and', 'physical', 'parameters', 'eg', 'physics', 'list', 'materials', 'and', 'thicknesses', 'recording', 'the', 'interactions', 'eg', 'energy', 'deposit', 'position', 'interacting', 'particle', 'in', 'nasa', 'fits', 'and', 'cern', 'root', 'format', 'output', 'files', 'and', 'filtering', 'the', 'output', 'as', 'a', 'real', 'observation', 'in', 'space', 'to', 'finally', 'produce', 'the', 'background', 'detected', 'count', 'rate', 'and', 'spectra', 'four', 'different', 'types', 'of', 'output', 'can', 'be', 'produced', 'by', 'the', 'bogemms', 'capturing', 'different', 'aspects', 'of', 'the', 'interactions', 'the', 'simulator', 'can', 'also', 'run', 'in', 'parallel', 'jobs', 'and', 'store', 'the', 'results', 'in', 'a', 'centralized', 'server', 'via', 'xrootd', 'protocol', 'the', 'bogemms', 'is', 'a', 'multimission', 'tool', 'generally', 'designed', 'to', 'be', 'applied', 'to', 'any', 'highenergy', 'mission', 'for', 'which', 'the', 'shielding', 'and', 'instruments', 'performances', 'analysis', 'is', 'required']] | [-0.07252113400561915, 0.1002520953329414, -0.09082960870095644, 0.07288253113697435, -0.0987515560978281, -0.14483010963981155, -0.0004318746756397042, 0.3872488948693073, -0.2101619138041499, -0.4203608442779655, 0.09687578199915223, -0.30424818834999434, -0.025162197908560068, 0.24878125520365227, -0.026144791936221854, 0.06997294682595465, 0.11984173207866405, -0.023042808719028054, 0.004208424789039722, -0.25604203356174277, 0.23068974154858296, 0.172409734308257, 0.29261400886001737, -0.0035379897297840883, 0.09487776368631208, 0.03669218644895439, -0.07235631350354821, -0.008059732028735144, -0.0809985573247651, 0.06785939404363531, 0.29624819099367444, 0.20376566272256347, 0.1943978374349136, -0.42815064411196446, -0.15511814566797827, 0.05527784315917909, 0.09477763652882928, 0.02385575766142555, -0.0472433583794186, -0.30785658699916857, 0.056991835779151304, -0.2153808266758383, -0.09028328148940322, -0.040488310563043244, -0.01172769370373168, 0.059310666151539564, -0.26280947680298994, -0.08172162603514628, -0.041977521778522604, 0.07753828259830187, -0.05140644043198561, -0.07637085782796194, -0.02516390857731108, 0.16994596166639692, -0.015289669631873075, 0.03422121664895707, 0.17925588346658627, -0.09836615108294425, -0.13422444436753936, 0.3937094400049449, -0.007235488390589583, -0.1300513967871666, 0.178662115987999, -0.09688293722951237, -0.12671933471365204, 0.14605459560993206, 0.2245040390871806, 0.03954820419217344, -0.2184627817675861, 0.08222826042865385, 0.018456382409127708, 0.22169186671574911, 0.06424063022303231, 0.0019739638630519897, 0.20772238996707731, 0.1817577481148095, -0.01703648295617218, 0.13971494595912815, -0.12519649933856986, -0.05829774413114791, -0.2691439859435157, -0.15557141466183416, -0.17402136013264846, -0.010737454979391343, -0.025599568527670473, -0.13021415595141744, 0.4070034801162585, 0.15081180588896173, 0.10362363158073885, 0.003781397795773361, 0.36181655940082336, 0.0022098330517978182, 0.10378460562940127, 0.07522201645827177, 0.1842675170088126, 0.03769152807802254, 0.16110274133887265, -0.16452984735095763, 0.07532358558976329, 0.02778129759807675] |
1,802.01901 | Odd and even modes of neutron spin resonance in the bilayer iron-based
superconductor CaKFe$_4$As$_4$ | We report an inelastic neutron scattering study on the spin resonance in the
bilayer iron-based superconductor CaKFe$_4$As$_4$. In contrast to its
quasi-two-dimensional electron structure, three strongly $L$-dependent modes of
spin resonance are found below $T_c=35$ K. The mode energies are below and
linearly scale with the total superconducting gaps summed on the nesting hole
and electron pockets, essentially in agreement with the results in cuprate and
heavy fermion superconductors. This observation supports the sign-reversed
Cooper pairing mechanism under multiple pairing channels and resolves the
long-standing puzzles concerning the broadening and dispersive spin resonance
peak in iron pnictides. More importantly, the triple resonant modes can be
classified into odd and even symmetries with respect to the distance of Fe-Fe
planes within the Fe-As bilayer unit. Thus, our results closely resemble those
in the bilayer cuprates with nondegenerate spin excitations, suggesting that
these two high-$T_c$ superconducting families share a common nature.
| cond-mat.supr-con cond-mat.mtrl-sci cond-mat.str-el | we report an inelastic neutron scattering study on the spin resonance in the bilayer ironbased superconductor cakfe_4as_4 in contrast to its quasitwodimensional electron structure three strongly ldependent modes of spin resonance are found below t_c35 k the mode energies are below and linearly scale with the total superconducting gaps summed on the nesting hole and electron pockets essentially in agreement with the results in cuprate and heavy fermion superconductors this observation supports the signreversed cooper pairing mechanism under multiple pairing channels and resolves the longstanding puzzles concerning the broadening and dispersive spin resonance peak in iron pnictides more importantly the triple resonant modes can be classified into odd and even symmetries with respect to the distance of fefe planes within the feas bilayer unit thus our results closely resemble those in the bilayer cuprates with nondegenerate spin excitations suggesting that these two hight_c superconducting families share a common nature | [['we', 'report', 'an', 'inelastic', 'neutron', 'scattering', 'study', 'on', 'the', 'spin', 'resonance', 'in', 'the', 'bilayer', 'ironbased', 'superconductor', 'cakfe_4as_4', 'in', 'contrast', 'to', 'its', 'quasitwodimensional', 'electron', 'structure', 'three', 'strongly', 'ldependent', 'modes', 'of', 'spin', 'resonance', 'are', 'found', 'below', 't_c35', 'k', 'the', 'mode', 'energies', 'are', 'below', 'and', 'linearly', 'scale', 'with', 'the', 'total', 'superconducting', 'gaps', 'summed', 'on', 'the', 'nesting', 'hole', 'and', 'electron', 'pockets', 'essentially', 'in', 'agreement', 'with', 'the', 'results', 'in', 'cuprate', 'and', 'heavy', 'fermion', 'superconductors', 'this', 'observation', 'supports', 'the', 'signreversed', 'cooper', 'pairing', 'mechanism', 'under', 'multiple', 'pairing', 'channels', 'and', 'resolves', 'the', 'longstanding', 'puzzles', 'concerning', 'the', 'broadening', 'and', 'dispersive', 'spin', 'resonance', 'peak', 'in', 'iron', 'pnictides', 'more', 'importantly', 'the', 'triple', 'resonant', 'modes', 'can', 'be', 'classified', 'into', 'odd', 'and', 'even', 'symmetries', 'with', 'respect', 'to', 'the', 'distance', 'of', 'fefe', 'planes', 'within', 'the', 'feas', 'bilayer', 'unit', 'thus', 'our', 'results', 'closely', 'resemble', 'those', 'in', 'the', 'bilayer', 'cuprates', 'with', 'nondegenerate', 'spin', 'excitations', 'suggesting', 'that', 'these', 'two', 'hight_c', 'superconducting', 'families', 'share', 'a', 'common', 'nature']] | [-0.22548813536067847, 0.2553168677861961, 0.0022338610701931553, 0.08744754827804738, -0.05585013985369556, -0.17806546827557976, 0.07447024854529347, 0.3709732032242558, -0.22856490402104887, -0.2692969931567613, -0.06986096918085791, -0.3956974408891354, -0.05532791371759329, 0.18169122853794614, 0.06221707900702903, 0.017352032757952583, -0.014722164575564297, -0.01421531058243803, -0.13302707682187492, -0.21944312979640263, 0.3696647773054743, -0.004980418434668635, 0.3378334533111696, 0.08607068665386995, -0.026752165537579236, 0.04807462676170552, 0.14170954345624792, -0.043497108904695186, -0.14368878926546352, 0.05726896461753829, 0.32363730757119685, -0.13772604039105638, 0.12994892593328464, -0.4347625346350911, -0.1939756574331015, -0.02590293950728468, 0.1838770527620737, 0.11483515777021043, -0.03775590269661562, -0.25802819851181796, 0.03318915743619908, -0.12779687407797807, -0.13369266952803308, -0.07845342855560719, -0.07219797121423825, -0.043497388487102814, -0.19516056465697665, 0.12649897602072135, 0.09492370087615642, 0.04822681859022359, -0.12263584198080935, -0.15651229515866805, -0.06498256152829256, -0.04993796644014986, 0.10797006203525548, 0.04977375708639974, 0.12142974105852379, -0.07722680590971298, -0.13992362490987303, 0.3337615821077929, -0.011762247821221733, -0.07194680525808016, 0.17164622541718386, -0.22041758843949316, -0.07754392941589341, 0.17248782576565203, 0.05622315102428311, 0.050012466014753024, -0.12589249892098942, 0.04528193878296234, -0.0992113728771565, 0.19014819997765525, 0.07402050441502266, 0.14756001520313353, 0.3105994988881001, 0.1796635875975512, 0.013690958768632766, 0.08158980089010091, -0.13784049141749338, -0.056656579422525354, -0.20911795012943912, -0.12334732875279843, -0.1703161037897902, 0.018054305994253908, -0.016957173982322077, -0.18142691218432644, 0.3983675320774342, 0.1124881163893922, 0.24081542055009286, -0.10159402678569628, 0.20752425228105542, 0.08129032141280461, 0.12377855073695222, 0.061100302240103356, 0.24222390304281805, 0.2051528271577145, 0.06660821638227366, -0.3635280241661176, 0.04151614148262574, -0.009173651580616983] |
1,802.01902 | Schauder bases and the decay rate of the heat equation | We consider the classical Cauchy problem for the linear heat equation and
integrable initial data in the Euclidean space $\mathbb{R}^N$. In the case
$N=1$ we show that given a weighted $L^p$-space $L_w^p(\mathbb{R})$ with $1
\leq p < \infty$ and a fast growing weight $w$, there is a Schauder basis
$(e_n)_{n=1}^\infty$ in $L_ w^p(\mathbb{R})$ with the following property: given
a positive integer $m $ there exists $n_m > 0$ such that, if the initial data
$f$ belongs to the closed linear space of $e_n$ with $n \geq n_m$, then the
decay rate of the solution of the heat equation is at least $t^{-m}$. The
result is also generalized to the case $N >1$ with a slightly weaker
formulation. The proof is based on a construction of a Schauder basis of
$L_w^p( \mathbb{R}^N)$, which annihilates an infinite sequence of bounded
functionals.
| math.FA | we consider the classical cauchy problem for the linear heat equation and integrable initial data in the euclidean space mathbbrn in the case n1 we show that given a weighted lpspace l_wpmathbbr with 1 leq p infty and a fast growing weight w there is a schauder basis e_n_n1infty in l_ wpmathbbr with the following property given a positive integer m there exists n_m 0 such that if the initial data f belongs to the closed linear space of e_n with n geq n_m then the decay rate of the solution of the heat equation is at least tm the result is also generalized to the case n 1 with a slightly weaker formulation the proof is based on a construction of a schauder basis of l_wp mathbbrn which annihilates an infinite sequence of bounded functionals | [['we', 'consider', 'the', 'classical', 'cauchy', 'problem', 'for', 'the', 'linear', 'heat', 'equation', 'and', 'integrable', 'initial', 'data', 'in', 'the', 'euclidean', 'space', 'mathbbrn', 'in', 'the', 'case', 'n1', 'we', 'show', 'that', 'given', 'a', 'weighted', 'lpspace', 'l_wpmathbbr', 'with', '1', 'leq', 'p', 'infty', 'and', 'a', 'fast', 'growing', 'weight', 'w', 'there', 'is', 'a', 'schauder', 'basis', 'e_n_n1infty', 'in', 'l_', 'wpmathbbr', 'with', 'the', 'following', 'property', 'given', 'a', 'positive', 'integer', 'm', 'there', 'exists', 'n_m', '0', 'such', 'that', 'if', 'the', 'initial', 'data', 'f', 'belongs', 'to', 'the', 'closed', 'linear', 'space', 'of', 'e_n', 'with', 'n', 'geq', 'n_m', 'then', 'the', 'decay', 'rate', 'of', 'the', 'solution', 'of', 'the', 'heat', 'equation', 'is', 'at', 'least', 'tm', 'the', 'result', 'is', 'also', 'generalized', 'to', 'the', 'case', 'n', '1', 'with', 'a', 'slightly', 'weaker', 'formulation', 'the', 'proof', 'is', 'based', 'on', 'a', 'construction', 'of', 'a', 'schauder', 'basis', 'of', 'l_wp', 'mathbbrn', 'which', 'annihilates', 'an', 'infinite', 'sequence', 'of', 'bounded', 'functionals']] | [-0.16505088088543793, 0.14468616318350214, -0.04986113658581013, 0.03543024534303555, -0.051844218248655476, -0.16902504011610509, 0.009095128276385367, 0.3165374873781531, -0.31562955856771396, -0.16809179731189533, 0.09332402945755232, -0.3332693941569082, -0.10442558838460679, 0.16602089946312285, -0.02744241035718443, 0.04722288075950053, 0.05423010651834477, 0.1198130802538498, -0.10429935524926374, -0.25222290753162835, 0.3530003878364998, -0.06499340034464612, 0.18616242050648407, -0.012431163704933081, 0.12725066910217747, 0.009774647369504647, 0.04111530496633815, -0.02942528338320343, -0.20163121015847488, 0.08353638665354986, 0.24647550826850242, 0.127471441248978, 0.3217770968304765, -0.3575089848355243, -0.15734647768807836, 0.2124185401743236, 0.134590203887818, -0.0020104483569993226, -0.054190654196440334, -0.20885763450042533, 0.12710613445238791, -0.09573840388338453, -0.18253385555699356, 0.01209158263925491, 0.11499605078558277, 0.018420275426784854, -0.3590374928373927, 0.06642802666913879, 0.14458659432716386, 0.023493301361463124, -0.10310351510910332, -0.1562151387298858, -0.0581518028708721, 0.019440419870407732, 0.011977446810832541, 0.13030659806427958, 0.0065228977114578385, -0.05832397840791067, -0.0471766302790983, 0.33958312030181403, -0.10749064607167602, -0.2816924361636358, 0.10212593932313971, -0.17182012082425935, -0.13615308817181931, 0.10296367409225918, 0.09682050110121027, 0.16262954561726042, -0.0420723275694632, 0.21171907491586345, -0.12129239583934161, 0.17401411199129949, 0.08466319077039011, 0.010714749777619551, 0.09691777318073577, 0.1287050875134878, 0.1448172383234465, 0.11840393378826461, -0.011870019139609951, -0.017158816064378822, -0.37922988238891486, -0.17803293868704154, -0.23523442509507103, 0.16416222550311035, -0.12677424070158363, -0.1793942442163825, 0.2951851747089759, 0.05280262459711963, 0.20549917502216714, 0.10547178053853795, 0.19875679198298885, 0.16924944705560915, -0.010274706478405716, 0.12094648557021878, 0.10981877823885446, 0.1367237414881111, 0.06258750119057477, -0.17671959076594926, -0.015059101199897538, 0.14734942815474433] |
1,802.01903 | Asymptotic behavior and critical coupling in scalar Yukawa model | The solution of the equation for the phion propagator in the leading order of
the $1/N$ -- expansion for a vector-matrix model with interaction
$g(\phi_a)^*\phi_b\chi_{ab}$ in four dimensions shows a change of the
asymptotic behavior in the deep Euclidean region in a vicinity of a certain
critical value of the coupling constant.
| hep-th | the solution of the equation for the phion propagator in the leading order of the 1n expansion for a vectormatrix model with interaction gphi_aphi_bchi_ab in four dimensions shows a change of the asymptotic behavior in the deep euclidean region in a vicinity of a certain critical value of the coupling constant | [['the', 'solution', 'of', 'the', 'equation', 'for', 'the', 'phion', 'propagator', 'in', 'the', 'leading', 'order', 'of', 'the', '1n', 'expansion', 'for', 'a', 'vectormatrix', 'model', 'with', 'interaction', 'gphi_aphi_bchi_ab', 'in', 'four', 'dimensions', 'shows', 'a', 'change', 'of', 'the', 'asymptotic', 'behavior', 'in', 'the', 'deep', 'euclidean', 'region', 'in', 'a', 'vicinity', 'of', 'a', 'certain', 'critical', 'value', 'of', 'the', 'coupling', 'constant']] | [-0.18315796434879303, 0.07518858989700675, -0.09824284737929702, 0.009870403055101633, 0.0028861666843295096, -0.05457843517884612, 0.046297152936458585, 0.2588022604957223, -0.22136469289660454, -0.2611068975925446, 0.09589018902741372, -0.31294193007051946, -0.14610322039574386, 0.11144007186871022, 0.04936777600494679, 0.04401286255568266, -0.0016693041007965802, 0.14646493086591364, -0.08731565284542739, -0.19438092097640036, 0.3428537611104548, -0.004716043719672598, 0.26486068801023066, 0.06123213909566402, 0.09870974147692323, -0.027951064687222242, 0.06223639035597443, 0.01961812493391335, -0.11445969216525555, 0.08995290802791715, 0.18510572013561613, 0.012418343424797059, 0.2903804383799434, -0.35458306651562455, -0.20868147926405073, 0.07524822568520903, 0.1925117015093565, 0.0994293272937648, -0.02280760483816266, -0.2337185431085527, 0.017703867414966226, -0.1777724811853841, -0.22033795995637775, -0.0212994316034019, 0.014305961541831494, -0.007480526589788496, -0.3294918353110552, 0.10115955927409231, 0.03125579718500376, 0.007073445841670036, -0.08478458408266305, -0.06588139425031841, 0.0377367239817977, 0.13252121163532138, 0.06424695074325427, 0.0630189397931099, 0.03303242032372509, -0.24606070368559813, -0.07396023306064307, 0.37172441095113756, -0.1316936204326339, -0.1956302138417959, 0.10490639679133892, -0.2155892526730895, -0.09664902535267174, 0.14622077628970145, 0.15575318701565266, 0.14248237943160347, -0.1261536387167871, 0.16618239346891642, 0.02106869801878929, 0.11732365503907204, 0.07350408513098955, 0.010094470512121916, 0.15568741155788302, 0.18771913081407546, 0.039815374091267584, 0.1678459952492267, -0.06638089815620334, -0.166128514111042, -0.3545753571391106, -0.17379754124209285, -0.16239784555975348, 0.05874251482076943, -0.23177876327186822, -0.21442943506874143, 0.41806853242218495, 0.13974978083744646, 0.23469137148931624, 0.04042957599274814, 0.23370901063084604, 0.15851690892130135, 0.08306113040540368, 0.07008087035268545, 0.2925069675408304, 0.09424838251899928, 0.12159363381564617, -0.26227176740765573, 0.042230645315721634, 0.12514593329280616] |
1,802.01904 | On the width of transitive sets: bounds on matrix coefficients of finite
groups | We say that a finite subset of the unit sphere in $\mathbf{R}^d$ is
transitive if there is a group of isometries which acts transitively on it. We
show that the width of any transitive set is bounded above by a constant times
$(\log d)^{-1/2}$.
This is a consequence of the following result: If $G$ is a finite group and
$\rho : G \rightarrow \mbox{U}_d(\mathbf{C})$ a unitary representation, and if
$v \in \mathbf{C}^d$ is a unit vector, there is another unit vector $w \in
\mathbf{C}^d$ such that \[ \sup_{g \in G} |\langle \rho(g) v, w \rangle| \leq
(1 + c \log d)^{-1/2}.\]
These results answer a question of Yufei Zhao. An immediate consequence of
our result is that the diameter of any quotient $S(\mathbf{R}^d)/G$ of the unit
sphere by a finite group $G$ of isometries is at least $\pi/2 - o_{d
\rightarrow \infty}(1)$.
| math.GR math.CO math.MG | we say that a finite subset of the unit sphere in mathbfrd is transitive if there is a group of isometries which acts transitively on it we show that the width of any transitive set is bounded above by a constant times log d12 this is a consequence of the following result if g is a finite group and rho g rightarrow mboxu_dmathbfc a unitary representation and if v in mathbfcd is a unit vector there is another unit vector w in mathbfcd such that sup_g in g langle rhog v w rangle leq 1 c log d12 these results answer a question of yufei zhao an immediate consequence of our result is that the diameter of any quotient smathbfrdg of the unit sphere by a finite group g of isometries is at least pi2 o_d rightarrow infty1 | [['we', 'say', 'that', 'a', 'finite', 'subset', 'of', 'the', 'unit', 'sphere', 'in', 'mathbfrd', 'is', 'transitive', 'if', 'there', 'is', 'a', 'group', 'of', 'isometries', 'which', 'acts', 'transitively', 'on', 'it', 'we', 'show', 'that', 'the', 'width', 'of', 'any', 'transitive', 'set', 'is', 'bounded', 'above', 'by', 'a', 'constant', 'times', 'log', 'd12', 'this', 'is', 'a', 'consequence', 'of', 'the', 'following', 'result', 'if', 'g', 'is', 'a', 'finite', 'group', 'and', 'rho', 'g', 'rightarrow', 'mboxu_dmathbfc', 'a', 'unitary', 'representation', 'and', 'if', 'v', 'in', 'mathbfcd', 'is', 'a', 'unit', 'vector', 'there', 'is', 'another', 'unit', 'vector', 'w', 'in', 'mathbfcd', 'such', 'that', 'sup_g', 'in', 'g', 'langle', 'rhog', 'v', 'w', 'rangle', 'leq', '1', 'c', 'log', 'd12', 'these', 'results', 'answer', 'a', 'question', 'of', 'yufei', 'zhao', 'an', 'immediate', 'consequence', 'of', 'our', 'result', 'is', 'that', 'the', 'diameter', 'of', 'any', 'quotient', 'smathbfrdg', 'of', 'the', 'unit', 'sphere', 'by', 'a', 'finite', 'group', 'g', 'of', 'isometries', 'is', 'at', 'least', 'pi2', 'o_d', 'rightarrow', 'infty1']] | [-0.19785150936632245, 0.18220912033306108, -0.04365982986572716, -0.04087610895469509, -0.06884203980228415, -0.14277876771779524, 0.05562002749906646, 0.3959176892518169, -0.2942198130129664, -0.1766264548704149, 0.07810156829655171, -0.34256507660503743, -0.11114330841228366, 0.16521996635685893, -0.08360443803378277, -0.06271451512972513, 0.04179769772346373, 0.16070630109213568, -0.07055995156643567, -0.2696125632634869, 0.30202110471824806, -0.08059099654287652, 0.1551256708835286, 0.0700189032246945, 0.1428551918240609, 0.012873709358757845, 0.03725624354556203, 0.00937807472612433, -0.1547254226077779, 0.01015294327021197, 0.21164327796065696, 0.12134955832044836, 0.291389795134051, -0.27790231065203747, -0.14519935475179443, 0.21125755944047814, 0.11408254060100902, -0.04561646533181408, -0.01802272308635077, -0.2368632522204684, 0.18148501455369923, -0.1326791762822756, -0.12963488662822378, 0.031597855017968905, 0.18166200721429454, -0.047110155845681824, -0.2949521107254205, 0.024657364955378902, 0.15645512523198568, 0.05640458607425292, 0.011360079591610917, -0.11190207245311251, -0.08893700770481869, 0.0837452789078708, -0.04061889536307582, 0.1985474945563409, 0.07736706504322312, -0.05601871715755098, -0.06778043829749718, 0.41067836911038114, -0.12466872509706903, -0.23911782178199953, 0.09387697545052678, -0.20270203887312502, -0.1435731673233763, 0.07384778409161502, 0.08366599869914353, 0.16879071061395937, -0.014687080391579205, 0.23617341188213753, -0.19402173154607968, 0.18329207506720666, 0.0695381436083052, -0.0359741661766613, 0.0878540889584218, 0.12376216460144389, 0.15657938379380437, 0.07115352398853887, 0.022431565153722962, 0.08624597749224415, -0.4123711711968537, -0.18010499909761604, -0.20833324588559293, 0.1814309246286198, -0.12388213118861637, -0.14035991812469784, 0.29796254234733405, 0.021056372920672098, 0.24980830986880595, 0.07008604540110186, 0.1944632533877329, 0.09482894237336478, 0.05561012670104564, 0.1445686328638759, 0.08889880666026363, 0.185491920210835, -0.10130775316652876, -0.17069907756436065, -0.01703641581762996, 0.15550979027143008] |
1,802.01905 | Induced Fuzzy Topological Spaces: A Characterization | We introduce a simple property, affine invariance, which characterizes within
the class of fuzzy topological spaces those which are induced from an
underlying topology on the space. We illustrate it by considering the simple
notions of compactness for such spaces.
| math.DS | we introduce a simple property affine invariance which characterizes within the class of fuzzy topological spaces those which are induced from an underlying topology on the space we illustrate it by considering the simple notions of compactness for such spaces | [['we', 'introduce', 'a', 'simple', 'property', 'affine', 'invariance', 'which', 'characterizes', 'within', 'the', 'class', 'of', 'fuzzy', 'topological', 'spaces', 'those', 'which', 'are', 'induced', 'from', 'an', 'underlying', 'topology', 'on', 'the', 'space', 'we', 'illustrate', 'it', 'by', 'considering', 'the', 'simple', 'notions', 'of', 'compactness', 'for', 'such', 'spaces']] | [-0.09575232842471451, 0.1458223166559037, -0.061285454360768196, 0.14626263990066946, -0.11222181431949138, -0.03815809999359772, 0.009237262373790144, 0.388031002227217, -0.37173700593411924, -0.22374841724522412, 0.10922326659201645, -0.20699917676392943, -0.2166816210374236, 0.197676601447165, -0.15423021800233983, 0.002089338144287467, -0.05145285348407924, 0.0632915090303868, -0.1426427239086479, -0.2071808279666584, 0.47866698503494265, -0.04101191689260304, 0.2777713902760297, 0.01847752897301689, 0.1469091984210536, 0.04891520931851119, -0.031632805557455866, 0.11196167030066136, -0.1883166433079168, 0.166239486890845, 0.19921926138922572, 0.12948343295720405, 0.2476731788367033, -0.34334701849147675, -0.21019995184615253, 0.1390979371732101, 0.032292035093996675, 0.03664646479301155, -0.0351010460552061, -0.3669368462637067, 0.11611789399757981, -0.15988404885865748, -0.11989631626638583, -0.15788326074834913, -0.027201307169161738, 0.024140820279717444, -0.2348647300968878, -0.03865327523089945, 0.13914968869648875, 0.08803190285107121, -0.09003466445137746, 0.007252313266508281, -0.032797884987667204, 0.07134806112153455, -0.028069676458835603, -0.016920503054279834, 0.09317683358676732, -0.0720472895540297, -0.14502104806306307, 0.3838925006333739, 0.008236202620901167, -0.2827646782621741, 0.19784054333576934, -0.08978798097232357, -0.19518197707366197, 0.06833300272701308, 0.11611238070763648, 0.11405971660278738, -0.08159066643565893, 0.17251094144303353, -0.07898203686345369, 0.06951469066552818, 0.041700922203017396, 0.11991909379139543, 0.15175538738258182, 0.18302226624218748, 0.1341590600204654, 0.17514981235726737, -0.0040199558192398396, -0.1318217178893974, -0.3620266594225541, -0.15296765100210905, -0.16562231499701738, 0.06523907084483653, -0.13950839877361432, -0.20223854812793435, 0.40730293066008016, 0.07308100261725485, 0.21567483604885637, 0.09763166984193958, 0.2278407484292984, 0.09935930755455047, 0.06456063793739304, 0.05627715077716857, 0.19993932988727464, 0.1379032819357235, -0.013462172623258084, -0.1316592038376257, 0.06551163548137992, 0.19554699007421733] |
1,802.01906 | Detecting Ultrasound Vibrations by Graphene Resonators | Ultrasound detection is one of the most important nondestructive subsurface
characterization tools of materials, whose goal is to laterally resolve the
subsurface structure with nanometer or even atomic resolution. In recent years,
graphene resonators attracted attention as loudspeaker and ultrasound radio,
showing its potential to realize communication systems with air-carried
ultrasound. Here we show a graphene resonator that detects ultrasound
vibrations propagating through the substrate on which it was fabricated. We
achieve ultimately a resolution of $\approx7$~pm/$\mathrm{\sqrt Hz}$ in
ultrasound amplitude at frequencies up to 100~MHz. Thanks to an extremely high
nonlinearity in the mechanical restoring force, the resonance frequency itself
can also be used for ultrasound detection. We observe a shift of 120~kHz at a
resonance frequency of 65~MHz for an induced vibration amplitude of 100~pm with
a resolution of 25~pm. Remarkably, the nonlinearity also explains the generally
observed asymmetry in the resonance frequency tuning of the resonator when
pulled upon with an electrostatic gate. This work puts forward a sensor design
that fits onto an atomic force microscope cantilever and therefore promises
direct ultrasound detection at the nanoscale for nondestructive subsurface
characterization.
| physics.app-ph cond-mat.mes-hall cond-mat.mtrl-sci | ultrasound detection is one of the most important nondestructive subsurface characterization tools of materials whose goal is to laterally resolve the subsurface structure with nanometer or even atomic resolution in recent years graphene resonators attracted attention as loudspeaker and ultrasound radio showing its potential to realize communication systems with aircarried ultrasound here we show a graphene resonator that detects ultrasound vibrations propagating through the substrate on which it was fabricated we achieve ultimately a resolution of approx7pmmathrmsqrt hz in ultrasound amplitude at frequencies up to 100mhz thanks to an extremely high nonlinearity in the mechanical restoring force the resonance frequency itself can also be used for ultrasound detection we observe a shift of 120khz at a resonance frequency of 65mhz for an induced vibration amplitude of 100pm with a resolution of 25pm remarkably the nonlinearity also explains the generally observed asymmetry in the resonance frequency tuning of the resonator when pulled upon with an electrostatic gate this work puts forward a sensor design that fits onto an atomic force microscope cantilever and therefore promises direct ultrasound detection at the nanoscale for nondestructive subsurface characterization | [['ultrasound', 'detection', 'is', 'one', 'of', 'the', 'most', 'important', 'nondestructive', 'subsurface', 'characterization', 'tools', 'of', 'materials', 'whose', 'goal', 'is', 'to', 'laterally', 'resolve', 'the', 'subsurface', 'structure', 'with', 'nanometer', 'or', 'even', 'atomic', 'resolution', 'in', 'recent', 'years', 'graphene', 'resonators', 'attracted', 'attention', 'as', 'loudspeaker', 'and', 'ultrasound', 'radio', 'showing', 'its', 'potential', 'to', 'realize', 'communication', 'systems', 'with', 'aircarried', 'ultrasound', 'here', 'we', 'show', 'a', 'graphene', 'resonator', 'that', 'detects', 'ultrasound', 'vibrations', 'propagating', 'through', 'the', 'substrate', 'on', 'which', 'it', 'was', 'fabricated', 'we', 'achieve', 'ultimately', 'a', 'resolution', 'of', 'approx7pmmathrmsqrt', 'hz', 'in', 'ultrasound', 'amplitude', 'at', 'frequencies', 'up', 'to', '100mhz', 'thanks', 'to', 'an', 'extremely', 'high', 'nonlinearity', 'in', 'the', 'mechanical', 'restoring', 'force', 'the', 'resonance', 'frequency', 'itself', 'can', 'also', 'be', 'used', 'for', 'ultrasound', 'detection', 'we', 'observe', 'a', 'shift', 'of', '120khz', 'at', 'a', 'resonance', 'frequency', 'of', '65mhz', 'for', 'an', 'induced', 'vibration', 'amplitude', 'of', '100pm', 'with', 'a', 'resolution', 'of', '25pm', 'remarkably', 'the', 'nonlinearity', 'also', 'explains', 'the', 'generally', 'observed', 'asymmetry', 'in', 'the', 'resonance', 'frequency', 'tuning', 'of', 'the', 'resonator', 'when', 'pulled', 'upon', 'with', 'an', 'electrostatic', 'gate', 'this', 'work', 'puts', 'forward', 'a', 'sensor', 'design', 'that', 'fits', 'onto', 'an', 'atomic', 'force', 'microscope', 'cantilever', 'and', 'therefore', 'promises', 'direct', 'ultrasound', 'detection', 'at', 'the', 'nanoscale', 'for', 'nondestructive', 'subsurface', 'characterization']] | [-0.13411591145106488, 0.1573593935790187, -0.034523265780363646, -0.07247173792372147, -0.08418534134204189, -0.15494040214511592, 0.0404224782218484, 0.4369388768138985, -0.2615202318029737, -0.27592636302320495, 0.07313202008242822, -0.26434582226857956, -0.13611966001982284, 0.2839401812434921, -0.037388906223026826, 0.0649005134095205, 0.05654855715110898, -0.006012547489566107, 0.013749060394345886, -0.11404074200610113, 0.19811355335017045, 0.11462307042384054, 0.33178037486634115, 0.08432617810968723, 0.12084101017616275, -0.00219553015453534, 0.05715493141259584, -0.02969950386452385, -0.1141734800176184, 0.12217108485702839, 0.2903665512877827, 0.002698580145240865, 0.2619295289222565, -0.45735941514269346, -0.24238582685809687, 0.03322013857319285, 0.15626660864864889, 0.15710569820819525, -0.07099404877323347, -0.2952435512820052, 0.05453277840279043, -0.10044748311500168, -0.14594942159795513, -0.07114181887009181, 0.0056138419830757715, -0.027683640158890434, -0.2447212854843302, 0.06403006867525013, 0.03716088464781125, 0.11370622671933638, -0.07093136682524345, -0.0054197438759729264, 0.027234045021598124, 0.07204242812084784, -0.012613052015917168, 0.05956956566984041, 0.21898705419929076, -0.14053254119676745, -0.07467989637645789, 0.3776032370980829, -0.052621033323682946, -0.13502266853530373, 0.20032309073075238, -0.18745706101827736, -0.04505749883440634, 0.17942286502932095, 0.15766662397007974, 0.05333031110931188, -0.12233153959960974, 0.004482322012255382, 0.051662481726250715, 0.2576373512352196, 0.19660105819477597, 0.050330072478714606, 0.22714220537390145, 0.22608645183629253, 0.10218589132806907, 0.14667102764489956, -0.1785905008398307, 0.07908356609857745, -0.19442491407713128, -0.1297923199234194, -0.20033011713272167, 0.06222429892772602, -0.032029820050552694, -0.16858959225420322, 0.397097941643248, 0.15121863666249233, 0.17216642850673655, -0.042765964416968116, 0.37098293710086083, 0.09862918049394567, 0.12111105876198659, -0.06701584531822138, 0.30896896593169204, 0.18114407560529394, 0.11457214078400284, -0.26764972960679895, 0.017421305181536204, -0.04256308853348148] |
1,802.01907 | IGR J19294+1816: a new Be-X ray binary revealed through infrared
spectroscopy | The aim of this work is to characterize the counterpart to the INTEGRAL High
Mass X-ray Binary candidate IGR J19294+1816 so as to establish its true nature.
We obtained H band spectra of the selected counterpart acquired with the NICS
instrument mounted on the Telescopio Nazionale Galileo (TNG) 3.5-m telescope
which represents the first infrared spectrum ever taken of this source. We
complement the spectral analysis with infrared photometry from UKIDSS, 2MASS,
WISE and NEOWISE databases. We classify the mass donor as a Be star.
Subsequently, we compute its distance by properly taking into account the
contamination produced by the circumstellar envelope. The findings indicate
that IGR J19294+1816 is a transient source with a B1Ve donor at a distance of
$d = 11 \pm 1$ kpc, and luminosities of the order of $10^{36-37}$ erg s$^{-1}$,
displaying the typical behaviour of a Be X-ray binary.
| astro-ph.HE | the aim of this work is to characterize the counterpart to the integral high mass xray binary candidate igr j192941816 so as to establish its true nature we obtained h band spectra of the selected counterpart acquired with the nics instrument mounted on the telescopio nazionale galileo tng 35m telescope which represents the first infrared spectrum ever taken of this source we complement the spectral analysis with infrared photometry from ukidss 2mass wise and neowise databases we classify the mass donor as a be star subsequently we compute its distance by properly taking into account the contamination produced by the circumstellar envelope the findings indicate that igr j192941816 is a transient source with a b1ve donor at a distance of d 11 pm 1 kpc and luminosities of the order of 103637 erg s1 displaying the typical behaviour of a be xray binary | [['the', 'aim', 'of', 'this', 'work', 'is', 'to', 'characterize', 'the', 'counterpart', 'to', 'the', 'integral', 'high', 'mass', 'xray', 'binary', 'candidate', 'igr', 'j192941816', 'so', 'as', 'to', 'establish', 'its', 'true', 'nature', 'we', 'obtained', 'h', 'band', 'spectra', 'of', 'the', 'selected', 'counterpart', 'acquired', 'with', 'the', 'nics', 'instrument', 'mounted', 'on', 'the', 'telescopio', 'nazionale', 'galileo', 'tng', '35m', 'telescope', 'which', 'represents', 'the', 'first', 'infrared', 'spectrum', 'ever', 'taken', 'of', 'this', 'source', 'we', 'complement', 'the', 'spectral', 'analysis', 'with', 'infrared', 'photometry', 'from', 'ukidss', '2mass', 'wise', 'and', 'neowise', 'databases', 'we', 'classify', 'the', 'mass', 'donor', 'as', 'a', 'be', 'star', 'subsequently', 'we', 'compute', 'its', 'distance', 'by', 'properly', 'taking', 'into', 'account', 'the', 'contamination', 'produced', 'by', 'the', 'circumstellar', 'envelope', 'the', 'findings', 'indicate', 'that', 'igr', 'j192941816', 'is', 'a', 'transient', 'source', 'with', 'a', 'b1ve', 'donor', 'at', 'a', 'distance', 'of', 'd', '11', 'pm', '1', 'kpc', 'and', 'luminosities', 'of', 'the', 'order', 'of', '103637', 'erg', 's1', 'displaying', 'the', 'typical', 'behaviour', 'of', 'a', 'be', 'xray', 'binary']] | [-0.07873341141568198, 0.044689313918873146, -0.12569588434172574, 0.06338388483867154, -0.1326708273043843, -0.10870939594126873, 0.07997200393827854, 0.43807977253011054, -0.183202505248462, -0.3442730871749671, 0.15008633169573504, -0.35814988564934347, -0.03269093895943223, 0.19917330070613667, -0.054904051447430484, -0.024375798780686006, 0.09954545460478566, -0.04987665773141426, -0.0336762050515158, -0.24357265196219607, 0.25394754982846496, 0.09517554671770626, 0.13847056899701696, -0.041191545779119945, 0.10140568830628091, -0.015815910663035653, -0.06663007637603091, -0.05692497178606064, -0.14887496505537717, 0.06853791053400382, 0.2407070018377129, 0.10406262285102133, 0.18525016510540007, -0.2881063384466342, -0.16843698401056179, 0.06343895615358557, 0.11723186017805384, -0.046957537424392425, -0.00827366837472948, -0.3300540318526979, 0.08194485181695098, -0.1874857549392781, -0.19642271443393888, 0.05984508189522512, 0.0374466970406629, 0.018563286232407095, -0.20107384434562514, 0.04657974531646115, -0.02662129945836479, 0.08535315645077116, -0.1929451948686314, -0.10534584641430553, -0.08625204319792142, 0.12682367203483633, -0.0022454549512871493, 0.10434757997167876, 0.08688349771261267, -0.08793186736976975, -0.024106566339138557, 0.36522708508720086, -0.08110718907531142, 0.048961224122350655, 0.18076224202921914, -0.19600364319667532, -0.1740056243000578, 0.17961380317468534, 0.12994076869079282, 0.13804165008836067, -0.21184832436013054, 0.04978413149711214, -0.0014482275489229267, 0.2389656247154295, 0.04542383594988761, 0.11673314992169087, 0.30461028217618075, 0.11306939887736071, -0.0021498925541039112, 0.16016511393261593, -0.3102755649780555, 0.05533863782680795, -0.2436360098538396, -0.11255152104748087, -0.2035495240625541, 0.11897204854481665, -0.09140650698100217, -0.10267555318655563, 0.3162480680552031, 0.102782206223965, 0.20279568562713954, 0.029540530139730164, 0.30030065464910927, 0.0936485466211904, 0.11104625517704322, 0.1011915769561526, 0.30497050236493767, 0.13478784572326585, 0.11311771181229684, -0.24595526335728388, 0.00047969177261099116, 0.05539506416233791] |
1,802.01908 | Cantor combinatorics and almost finiteness | In this survey we give a concise introduction to a continuous version of
Borel combinatorics. Our approach will have a certain algorithm-theoretic
nature and we will give special emphasis to the notion of almost finiteness
introduced by Matui as a continuous analogue of Borel hyperfiniteness. We also
show how the theory can be used to study spectral convergence for graph
Laplacians.
| math.DS math.CO | in this survey we give a concise introduction to a continuous version of borel combinatorics our approach will have a certain algorithmtheoretic nature and we will give special emphasis to the notion of almost finiteness introduced by matui as a continuous analogue of borel hyperfiniteness we also show how the theory can be used to study spectral convergence for graph laplacians | [['in', 'this', 'survey', 'we', 'give', 'a', 'concise', 'introduction', 'to', 'a', 'continuous', 'version', 'of', 'borel', 'combinatorics', 'our', 'approach', 'will', 'have', 'a', 'certain', 'algorithmtheoretic', 'nature', 'and', 'we', 'will', 'give', 'special', 'emphasis', 'to', 'the', 'notion', 'of', 'almost', 'finiteness', 'introduced', 'by', 'matui', 'as', 'a', 'continuous', 'analogue', 'of', 'borel', 'hyperfiniteness', 'we', 'also', 'show', 'how', 'the', 'theory', 'can', 'be', 'used', 'to', 'study', 'spectral', 'convergence', 'for', 'graph', 'laplacians']] | [-0.09832490765256807, 0.06779077725950629, -0.18564737567988535, 0.12962517370275842, -0.14394791709880034, -0.06880663715613385, 0.0418344908762568, 0.37573541095480323, -0.26920252150545515, -0.2373798755618433, 0.13635402429499663, -0.2097702255200905, -0.20465133398150404, 0.19010467209542792, -0.18522805981338025, 0.014701445214450359, 0.065248570064432, 0.04590259930118919, -0.0802989253308624, -0.27160372904278723, 0.3368614079973971, 0.030798998785515626, 0.2159431101443867, 0.118376094463747, 0.05216005446854979, 0.0309815738350153, -0.06265768678858877, 0.047629485939008495, -0.21451130914501845, 0.14740334612627823, 0.27794417707870406, 0.1460568055510521, 0.30661457739770415, -0.3641003308740134, -0.1617666808112214, 0.15774080217815936, 0.11189367726716834, 0.06571055031963624, -0.05453885107611616, -0.3032796655471126, 0.11620045627156893, -0.19744340085114043, -0.14884712926577776, -0.1401551056575651, 0.0008206312078982592, 0.047868596696450064, -0.22085651544233162, -0.021258881739049683, 0.1364627090127518, 0.07304634680040181, -0.010284701469451344, -0.06093401190203925, 0.02291105005812521, 0.08289980506136392, -0.010271930642193183, 0.02635815051617101, 0.04384533032619705, -0.03803667633716638, -0.16211272398165116, 0.3779628565379729, -0.10669615798008938, -0.24192475179831188, 0.15674841183548172, -0.14576348326906252, -0.2218622276520667, 0.04568713831637675, 0.17280196693415442, 0.11042933643523914, -0.11324460776910807, 0.13550248478131835, -0.10897680233853559, 0.07787438668310642, 0.06448158747516572, 0.06854134807363152, 0.13876636473772427, 0.11600525272078813, 0.1296394641472337, 0.22499959113192744, 0.032680395835389696, -0.055300886960079274, -0.3570594953683515, -0.14982167966663837, -0.13536247169443716, 0.16080248598009347, -0.04847059218809591, -0.21856055464595556, 0.4087309110599259, 0.17267731989268215, 0.17579875737040615, 0.12756613246941317, 0.20600843307329342, 0.1266524114102746, -0.0041095926164416595, -0.008695012261159717, 0.14490990706156784, 0.22522979624336587, 0.06913989285628001, -0.11635191071157654, -0.0086151944900242, 0.19389707329683006] |
1,802.01909 | New conjecture related to a conjecture of McIntosh | We introduce a new conjecture on products of two distinct primes that would
provide a partial answer to a conjecture of McIntosh. Also,
$\binom{2p-1}{p-1}-1$ is written in terms of a polynomial in prime $p$ over the
integers and we discuss one way this form may be useful.
| math.NT | we introduce a new conjecture on products of two distinct primes that would provide a partial answer to a conjecture of mcintosh also binom2p1p11 is written in terms of a polynomial in prime p over the integers and we discuss one way this form may be useful | [['we', 'introduce', 'a', 'new', 'conjecture', 'on', 'products', 'of', 'two', 'distinct', 'primes', 'that', 'would', 'provide', 'a', 'partial', 'answer', 'to', 'a', 'conjecture', 'of', 'mcintosh', 'also', 'binom2p1p11', 'is', 'written', 'in', 'terms', 'of', 'a', 'polynomial', 'in', 'prime', 'p', 'over', 'the', 'integers', 'and', 'we', 'discuss', 'one', 'way', 'this', 'form', 'may', 'be', 'useful']] | [-0.21981088665273527, 0.07934375840198735, -0.1495246342212498, 0.08665472212369027, -0.09469812910032013, -0.13096894720650237, 0.006461433398172907, 0.2883943156136767, -0.29190864057644555, -0.2496527204107817, 0.045022886322365833, -0.2333956530580864, -0.16597964039639287, 0.24127040722447893, -0.10049342481500428, -0.035716492839602994, 0.05298344579869476, 0.06279337239697191, -0.04335462125321931, -0.36581860532801924, 0.34795479873276275, -0.0629273516976315, 0.11173708635665801, 0.12299437059656433, 0.058600272639128176, -0.013161566300803552, -0.015550465069954162, 0.015763534860604483, -0.1512028917161882, 0.15203392434784252, 0.31871472428674286, 0.1789558441479407, 0.3122560871846002, -0.4060848337881591, -0.107247680294044, 0.1595483461961798, 0.1741936950660918, 0.05386159544223514, -0.05745005874094837, -0.1957473556065689, 0.1547546003256803, -0.1963356353302041, -0.14767943321140078, -0.11309300310423841, 0.048294193759236645, -0.013902815949657688, -0.30767001748166006, 0.020191309370642084, 0.09735331846193572, 0.07051371680268936, -0.021053149015642703, -0.14515558403977397, 0.09720698525400265, 0.07821388309821486, 0.007647277109853072, 0.021033788474438632, -0.02386703469750026, -0.0713246306910625, -0.1644651049181171, 0.3745383675331655, -0.08363834979093593, -0.20694129201381103, 0.13171586738494429, -0.16240388906115424, -0.20160742168841156, 0.07114559689374722, 0.16602241885645883, 0.1283721168242071, -0.07581613036682425, 0.08816997666271283, -0.18085358024615308, 0.11753290893671953, 0.15494126848795492, 0.015820230185256703, 0.21464982037634953, 0.04542793629124113, 0.07130755774636308, 0.17486262298948335, 0.012169798355266128, 0.02784284518059829, -0.3363210948427086, -0.2573650377276151, -0.12369367871028573, 0.14794160812364324, -0.05907996355982386, -0.1683919904348643, 0.4221145081607139, 0.12304722480526518, 0.20899131979145433, 0.062166902884517025, 0.22183238206755207, 0.11288087709766367, 0.04474649327280729, 0.025465269896971142, 0.10160820933220827, 0.1218716534583465, 0.010175642109496275, -0.08350751749442323, 0.06039762054570019, 0.11718964677951905] |
1,802.0191 | Programming infinite machines | For infinite machines which are free from the classical Thompson's lamp
paradox we show that they are not free from its inverted version. We provide a
program for infinite machines and an infinite mechanism which simulate this
paradox. While their finite analogs work predictably, the program and the
infinite mechanism demonstrate an undefined behavior. As in the case of
infinite Davies's machines, our examples are free from infinite masses,
infinite velocities, infinite forces, etc. Only infinite divisibility of space
and timeis assumed. Thus, the considered infinite devices are possible in a
continuous Newtonian Universe and they do not conflict with continuous
Newtonian mechanics. Some possible applications to the analysis of the
Navier-Stokes equations are discussed.
| cs.LO quant-ph | for infinite machines which are free from the classical thompsons lamp paradox we show that they are not free from its inverted version we provide a program for infinite machines and an infinite mechanism which simulate this paradox while their finite analogs work predictably the program and the infinite mechanism demonstrate an undefined behavior as in the case of infinite daviess machines our examples are free from infinite masses infinite velocities infinite forces etc only infinite divisibility of space and timeis assumed thus the considered infinite devices are possible in a continuous newtonian universe and they do not conflict with continuous newtonian mechanics some possible applications to the analysis of the navierstokes equations are discussed | [['for', 'infinite', 'machines', 'which', 'are', 'free', 'from', 'the', 'classical', 'thompsons', 'lamp', 'paradox', 'we', 'show', 'that', 'they', 'are', 'not', 'free', 'from', 'its', 'inverted', 'version', 'we', 'provide', 'a', 'program', 'for', 'infinite', 'machines', 'and', 'an', 'infinite', 'mechanism', 'which', 'simulate', 'this', 'paradox', 'while', 'their', 'finite', 'analogs', 'work', 'predictably', 'the', 'program', 'and', 'the', 'infinite', 'mechanism', 'demonstrate', 'an', 'undefined', 'behavior', 'as', 'in', 'the', 'case', 'of', 'infinite', 'daviess', 'machines', 'our', 'examples', 'are', 'free', 'from', 'infinite', 'masses', 'infinite', 'velocities', 'infinite', 'forces', 'etc', 'only', 'infinite', 'divisibility', 'of', 'space', 'and', 'timeis', 'assumed', 'thus', 'the', 'considered', 'infinite', 'devices', 'are', 'possible', 'in', 'a', 'continuous', 'newtonian', 'universe', 'and', 'they', 'do', 'not', 'conflict', 'with', 'continuous', 'newtonian', 'mechanics', 'some', 'possible', 'applications', 'to', 'the', 'analysis', 'of', 'the', 'navierstokes', 'equations', 'are', 'discussed']] | [-0.09992595117377198, 0.22007968206510312, -0.12521418646058957, 0.14357356504314459, -0.1193344490521628, -0.15376066556200385, 0.039209768524312454, 0.3625193570457075, -0.2925292016330944, -0.2636737243636795, 0.1466986729591356, -0.2854305893830631, -0.09920054779226041, 0.20734469351338466, -0.0750508930615109, 0.06923335614239635, 0.05550909020897487, 0.0920706595256216, -0.0433251695515102, -0.2520351852978701, 0.2721474063400503, -0.0032034085253658503, 0.23080631995209208, 0.031849731500867916, 0.14613784375074118, -0.019412883925859048, -0.00782065807801226, 0.040657854420588474, -0.12147063136982741, 0.049574972624364104, 0.2587933463449387, 0.09394526814070085, 0.27977428118819775, -0.4328315826861755, -0.22908684470761648, 0.15065807457608374, 0.1598034657497445, 0.12516546019798389, -0.034451094213063305, -0.24297042669444952, 0.04875904539114107, -0.21613776383557073, -0.18070934137681235, -0.046603999327382316, 0.01203114200261948, 0.045625036369260075, -0.1726029934720946, 0.050803566934621854, 0.12264577154799, 0.06248219826299211, -0.1335516549066043, -0.07969263483891668, -0.011634085625005158, 0.10079912210045301, 0.026725319722343398, -0.06985462848502008, 0.08569461997274472, -0.08459996771796242, -0.1495297992521006, 0.4205850702912911, -0.034672499869180765, -0.23936038706451654, 0.22132264195597204, -0.11771384129381698, -0.11925218747523816, 0.09715863613047354, 0.12437537132924342, 0.1333647811015987, -0.1149719903903568, 0.12596239329153752, -0.08208870069812173, 0.11479293087335385, 0.08176282779111163, 0.021815413642553207, 0.20490642296069342, 0.06132862645241877, 0.03608404011870532, 0.14141194782341304, 0.04823323764797786, -0.1262409005911373, -0.3676252463913482, -0.14721613871136113, -0.16143064742462468, 0.07566711255678218, -0.06561940415792734, -0.23455485824657524, 0.26152637142121143, 0.1610494274742213, 0.14161545294944358, 0.0975789610883626, 0.28535471441042004, 0.08802359369380966, 0.06524403141204106, 0.09356773039730995, 0.17336214787007875, 0.11314390711891262, 0.09095961444444306, -0.1864120854449499, 0.02625800391011264, 0.08029835888832483] |
1,802.01911 | Multilateration of the Local Position Measurement | The Local Position Measurement system (LPM) is one of the most precise
systems for 3D position estimation. It is able to operate in- and outdoor and
updates at a rate up to 1000 measurements per second. Previous scientific
publications focused on the time of arrival equation (TOA) provided by the LPM
and filtering after the numerical position estimation. This paper investigates
the advantages of the TOA over the time difference of arrival equation
transformation (TDOA) and the signal smoothing prior to its fitting. The LPM
was designed under the general assumption that the position of the base station
and position of the reference station are known. The information resulting from
this research can prove vital for the systems self-calibration, providing data
aiding in locating the relative position of the base station without prior
knowledge of the transponder and reference station positions.
| eess.SP | the local position measurement system lpm is one of the most precise systems for 3d position estimation it is able to operate in and outdoor and updates at a rate up to 1000 measurements per second previous scientific publications focused on the time of arrival equation toa provided by the lpm and filtering after the numerical position estimation this paper investigates the advantages of the toa over the time difference of arrival equation transformation tdoa and the signal smoothing prior to its fitting the lpm was designed under the general assumption that the position of the base station and position of the reference station are known the information resulting from this research can prove vital for the systems selfcalibration providing data aiding in locating the relative position of the base station without prior knowledge of the transponder and reference station positions | [['the', 'local', 'position', 'measurement', 'system', 'lpm', 'is', 'one', 'of', 'the', 'most', 'precise', 'systems', 'for', '3d', 'position', 'estimation', 'it', 'is', 'able', 'to', 'operate', 'in', 'and', 'outdoor', 'and', 'updates', 'at', 'a', 'rate', 'up', 'to', '1000', 'measurements', 'per', 'second', 'previous', 'scientific', 'publications', 'focused', 'on', 'the', 'time', 'of', 'arrival', 'equation', 'toa', 'provided', 'by', 'the', 'lpm', 'and', 'filtering', 'after', 'the', 'numerical', 'position', 'estimation', 'this', 'paper', 'investigates', 'the', 'advantages', 'of', 'the', 'toa', 'over', 'the', 'time', 'difference', 'of', 'arrival', 'equation', 'transformation', 'tdoa', 'and', 'the', 'signal', 'smoothing', 'prior', 'to', 'its', 'fitting', 'the', 'lpm', 'was', 'designed', 'under', 'the', 'general', 'assumption', 'that', 'the', 'position', 'of', 'the', 'base', 'station', 'and', 'position', 'of', 'the', 'reference', 'station', 'are', 'known', 'the', 'information', 'resulting', 'from', 'this', 'research', 'can', 'prove', 'vital', 'for', 'the', 'systems', 'selfcalibration', 'providing', 'data', 'aiding', 'in', 'locating', 'the', 'relative', 'position', 'of', 'the', 'base', 'station', 'without', 'prior', 'knowledge', 'of', 'the', 'transponder', 'and', 'reference', 'station', 'positions']] | [-0.13352973191298756, 0.037624140476464486, -0.06373021382085503, 0.008565286113319139, -0.08352005050075076, -0.11229619794320447, 0.08004085736676178, 0.3795644530154606, -0.2737499349329502, -0.33579119100691157, 0.11612380557389705, -0.2873178373110738, -0.0600838313632189, 0.1790654548073967, -0.08619976556919356, 0.0796355568702293, 0.08761005652721654, 0.09530140308115023, -0.0883699976327228, -0.2130428611033378, 0.26818211925883134, 0.14650409483740515, 0.32283431848557337, -0.0197646251292602, 0.14726023892921575, 0.07266621969488338, -0.11354335616772057, -0.07500359776647801, -0.09170815627552373, 0.09072287500578355, 0.24558617589241455, 0.16338140555948072, 0.26790279666529904, -0.39468545380794834, -0.21667172271652635, 0.0853499911837189, 0.09944716627636911, 0.08141347535816516, -0.013549543455646023, -0.32798230941308304, 0.059746002794923724, -0.12719116665766383, -0.09848526151560194, 0.023172451163384507, -0.011988807367226968, 0.06075586912268442, -0.27921011795187434, 0.05270821170340906, 0.03595952265624474, 0.043713138141530626, -0.06570619900037158, -0.11767930457375098, 0.00646342069293696, 0.21067825654944314, 0.04585728455163168, 0.049985517165623605, 0.1296398028770977, -0.09203069024976898, -0.0785936547562163, 0.39513396786142746, -0.03434519894777777, -0.21573476580050874, 0.125289870703474, -0.18635620745493375, -0.1009573032022685, 0.1364486086056799, 0.20139380894495662, 0.10447374907659089, -0.1606254121751016, 0.03685849702979788, 0.02509401646997542, 0.17477408946485173, 0.09645532528995306, 0.011217302681154949, 0.1559748556027321, 0.18047176525558192, 0.1391016970894709, 0.043680653163456484, -0.21020078707770412, -0.07722386663304047, -0.2932731123205195, -0.1359610363266411, -0.20380860571386228, -0.004988576003171979, -0.08193971079230104, -0.07080649446484678, 0.40176266643832975, 0.20468027105039738, 0.16075927259215544, 0.03616385426081664, 0.39430007475910456, 0.09158772111173508, 0.027578919158310542, 0.07273142477200228, 0.22213726048192656, 0.07517784691402517, 0.1534851122084437, -0.2084406914508568, 0.12120445272455929, 0.0125756698845496] |
1,802.01912 | Drag force in strongly coupled $\mathcal{N}=4$ SYM plasma in a magnetic
field | Applying AdS/CFT correspondence, we study the effect of a constant magnetic
field $\mathcal{B}$ on the drag force associated with a heavy quark moving
through a strongly-coupled $\mathcal{N}=4$ supersymmetric Yang-Mills (SYM)
plasma. The quark is considered moving transverse and parallel to
$\mathcal{B}$, respectively. It is shown that for transverse case, the drag
force is linearly dependent on $\mathcal{B}$ in all regions. While for parallel
case, the drag force increases monotonously with increasing $\mathcal{B}$ and
also reveals a linear behavior in the regions of strong $\mathcal{B}$. In
addition, we find that $\mathcal{B}$ has important effect for transverse case
than parallel.
| hep-th | applying adscft correspondence we study the effect of a constant magnetic field mathcalb on the drag force associated with a heavy quark moving through a stronglycoupled mathcaln4 supersymmetric yangmills sym plasma the quark is considered moving transverse and parallel to mathcalb respectively it is shown that for transverse case the drag force is linearly dependent on mathcalb in all regions while for parallel case the drag force increases monotonously with increasing mathcalb and also reveals a linear behavior in the regions of strong mathcalb in addition we find that mathcalb has important effect for transverse case than parallel | [['applying', 'adscft', 'correspondence', 'we', 'study', 'the', 'effect', 'of', 'a', 'constant', 'magnetic', 'field', 'mathcalb', 'on', 'the', 'drag', 'force', 'associated', 'with', 'a', 'heavy', 'quark', 'moving', 'through', 'a', 'stronglycoupled', 'mathcaln4', 'supersymmetric', 'yangmills', 'sym', 'plasma', 'the', 'quark', 'is', 'considered', 'moving', 'transverse', 'and', 'parallel', 'to', 'mathcalb', 'respectively', 'it', 'is', 'shown', 'that', 'for', 'transverse', 'case', 'the', 'drag', 'force', 'is', 'linearly', 'dependent', 'on', 'mathcalb', 'in', 'all', 'regions', 'while', 'for', 'parallel', 'case', 'the', 'drag', 'force', 'increases', 'monotonously', 'with', 'increasing', 'mathcalb', 'and', 'also', 'reveals', 'a', 'linear', 'behavior', 'in', 'the', 'regions', 'of', 'strong', 'mathcalb', 'in', 'addition', 'we', 'find', 'that', 'mathcalb', 'has', 'important', 'effect', 'for', 'transverse', 'case', 'than', 'parallel']] | [-0.17844554533046308, 0.24746525626895682, -0.03281853197864732, 0.008594814292392788, -0.05797478733691197, -0.14117997896154316, -0.008628879976102474, 0.37879752508383624, -0.20720280170896832, -0.20281676401156096, -0.009977995338422075, -0.30949099551962345, -0.06852624408558619, 0.18150705977685141, 0.003967283274598268, 0.03893251077519083, 0.058348244942287554, 0.09074333442460593, -0.05094133565031296, -0.2147746741823966, 0.2811592166711177, -0.027576230114744027, 0.31277069449424744, 0.11252678855208262, 0.10981718971565062, 0.03155897942618752, -5.0229343528650245e-05, 0.10678120996394404, -0.13327748918482957, 0.030465818214591364, 0.1754138121958727, -0.034160687034588536, 0.2081805194290925, -0.3972469204561595, -0.15599623962533565, 0.09054968703766259, 0.1971534753731471, 0.07206867243476896, -0.05666955907553511, -0.21308350794216885, 0.05619958588112222, -0.17598873704709872, -0.11145976571632284, -0.0380492668066706, 0.1193640126278909, -0.04455318142795384, -0.3436553444409249, 0.10771868915542988, 0.02941521268566044, 0.05459470736166956, -0.027827510790785357, -0.0935506728235442, -0.09247878628393293, 0.018909608688067684, 0.14765857574672495, 0.16449740355862874, 0.1977646678486573, -0.17904697729236618, -0.07295641472221029, 0.37136812549920717, -0.09744526407451545, -0.2515241039194623, 0.17453654978082192, -0.19904311407091363, -0.11558286355700277, 0.0962945465663714, 0.18482309448703818, 0.15456334819390002, -0.07588659750525745, 0.15369417685516445, -0.09654759310604054, 0.11420772386458228, 0.10603809339583528, 0.009308239808591197, 0.2330713383283238, 0.14474247086184974, 0.06453333618784589, 0.214820612963213, -0.05717029799386498, -0.06650284066207099, -0.36413569890951014, -0.1221256949653735, -0.07815518898400003, 0.043636438218230496, -0.11833858311773819, -0.15925268203641374, 0.30730563565157354, 0.11448432826342023, 0.2040717863591806, 0.01747050946008186, 0.28695782996257957, 0.10692079748711264, 0.08293180261995187, 0.08275125476493671, 0.2800591962259947, 0.22803287736463304, 0.12394120092551243, -0.28229851331989453, -0.036287109225000044, 0.10187299614202003] |
1,802.01913 | Extensions to the boundary of Riemann maps on varying domains in the
complex plane | We give a short proof of the convergence to the boundary of Riemann maps on
varying domains. Our proof provides a uniform approach to several ad-hoc
constructions that have recently appeared in the literature.
| math.CV | we give a short proof of the convergence to the boundary of riemann maps on varying domains our proof provides a uniform approach to several adhoc constructions that have recently appeared in the literature | [['we', 'give', 'a', 'short', 'proof', 'of', 'the', 'convergence', 'to', 'the', 'boundary', 'of', 'riemann', 'maps', 'on', 'varying', 'domains', 'our', 'proof', 'provides', 'a', 'uniform', 'approach', 'to', 'several', 'adhoc', 'constructions', 'that', 'have', 'recently', 'appeared', 'in', 'the', 'literature']] | [-0.16209249242263682, -0.005993904354160323, -0.17830934871316834, 0.0594799054430469, -0.11939130022245295, -0.09762325154288727, 0.03267868606181925, 0.3760685657753664, -0.1991926332908299, -0.2741689256406115, 0.14711816625169696, -0.20930927268722477, -0.1463023380321615, 0.25316709981245156, -0.13931698193225792, 0.045066443299326825, 0.04605217562878833, -0.02131133773090208, -0.11377725540660322, -0.3179724752964616, 0.3367963615147507, -0.01765402581761865, 0.26309041372116876, 0.14886920803281314, 0.09166273125447333, -0.05880428123397424, -0.06996800569707856, -0.005406079101650154, -0.20256341630289065, 0.1921034348608159, 0.21563893282676444, 0.08541872129118179, 0.27506985537269535, -0.43318876131054235, -0.2519590077401303, 0.06112739013727097, 0.14066591668490538, 0.14338747118873632, -0.07774511863381657, -0.2783797159243156, 0.11224318985991619, -0.12740105971255722, -0.10156702116022215, -0.07903333983438857, 0.021198861218769762, 0.06672890333677917, -0.2310767674489933, -0.010203506112756097, 0.15297496332513058, 0.07945102713454295, -0.06359215440940769, -0.1117218293605701, 0.07488117953899372, 0.09162415621583075, 0.09610506297801347, 0.062315222273087674, 0.03925115101532463, -0.030790128690354964, -0.1197741176275646, 0.281214093323797, -0.06425261891940061, -0.2257218111087294, 0.24788742065977523, -0.05921510204344111, -0.18622723818920991, 0.09998035628129454, 0.1363198255900951, 0.15300292028662035, -0.11551332583322245, 0.12161802040303454, -0.1273914828643148, 0.10326170143397416, 0.12525737882756136, 0.021964655983645248, 0.10179961982237942, 0.13742760437376358, 0.1364037031924133, 0.18761590162894742, -0.025253499460899654, -0.13155536758987343, -0.3393189243095763, -0.12619387029724963, -0.1687973200562684, 0.06710310609025114, -0.11060601963168558, -0.2640266135773238, 0.4196581167771536, 0.16575969552949948, 0.21066007675493464, 0.12908414548591657, 0.2710360691006131, 0.07182257643366671, 0.0740674785886179, 0.032531251226935315, 0.21226567709270647, 0.16854180684587097, 0.1465746947865495, -0.05853451925384648, 0.05451683352208313, 0.17506375686977715] |
1,802.01914 | Polynomial algorithm for $k$-partition minimization of monotone
submodular function | For a fixed $k$, this study considers $k$-partition minimization of
submodular system $(V, f)$ with a finite set $V$ and symmetric submodular
function $f: 2^{V} \mapsto \mathbb{R}$. Our algorithm uses the Queyranne's
(1998) algorithm for 2-partition minimization which arises at each step of the
recursive decomposition of subsets of the original $k$-partition minimization.
We show that the computational complexity of this minimizer is $O(n^{3(k-1)})$.
| math.OC | for a fixed k this study considers kpartition minimization of submodular system v f with a finite set v and symmetric submodular function f 2v mapsto mathbbr our algorithm uses the queyrannes 1998 algorithm for 2partition minimization which arises at each step of the recursive decomposition of subsets of the original kpartition minimization we show that the computational complexity of this minimizer is on3k1 | [['for', 'a', 'fixed', 'k', 'this', 'study', 'considers', 'kpartition', 'minimization', 'of', 'submodular', 'system', 'v', 'f', 'with', 'a', 'finite', 'set', 'v', 'and', 'symmetric', 'submodular', 'function', 'f', '2v', 'mapsto', 'mathbbr', 'our', 'algorithm', 'uses', 'the', 'queyrannes', '1998', 'algorithm', 'for', '2partition', 'minimization', 'which', 'arises', 'at', 'each', 'step', 'of', 'the', 'recursive', 'decomposition', 'of', 'subsets', 'of', 'the', 'original', 'kpartition', 'minimization', 'we', 'show', 'that', 'the', 'computational', 'complexity', 'of', 'this', 'minimizer', 'is', 'on3k1']] | [-0.17761450813757995, -0.02469077908123533, -0.0644641199060494, 0.006467411507083665, -0.061051279546633835, -0.1610745613625835, 0.08324435495194935, 0.3670236094012147, -0.3737555242601841, -0.23521585446146745, 0.015392567459789534, -0.29307387869745966, -0.14282214054320422, 0.09128019590640352, -0.0895044222060177, 0.07807258744206694, 0.054413041484261314, 0.04878163637430777, -0.09477799689205038, -0.28858134351182907, 0.26958041960403084, -0.07931216779564108, 0.21173090223104707, 0.04490513871941301, 0.16958672321948504, 0.09017590413032661, 0.03973319505189826, 0.0232750384343995, -0.16632375820775033, 0.10104583608843977, 0.26140191629972487, 0.26171589873376344, 0.4057863927076733, -0.30493879770593985, -0.1489048856236632, 0.2366032234193491, 0.08287317823204729, -0.03330878300836221, 0.00587784145618715, -0.18544798912221772, 0.11670160630629176, -0.10896774239483334, -0.05204274503159381, -0.0010852388564556363, 0.08290403324460226, 0.04177330447257393, -0.39085489907671533, 0.019624269375252346, 0.09123908042434663, 0.033928114063446486, -0.05184947605436993, -0.2259926852781237, -0.020033836571706667, -0.0026739674605547434, -0.017801127743922056, 0.19248470212037247, 0.09048442922473426, -0.02860456614178561, -0.08081915150840013, 0.3764853891990488, -0.05527911985307814, -0.1818217265582274, 0.09322685305498511, -0.08123922730899519, -0.15963634632394783, 0.15639703728938623, 0.15024194418497028, 0.18472760779753564, -0.1006619818952112, 0.21947532980832168, -0.17794483515714843, 0.12914567388084142, 0.045011360272173846, -0.030999348565403904, 0.047409606350970177, 0.1489924102576287, 0.23173436576071832, 0.22446485852733963, 0.022426290881066097, -0.012059528953469699, -0.344456106660858, -0.11393547806120108, -0.25528828980075935, 0.06394775789822378, -0.11618510205719051, -0.18262628399367845, 0.38800784587741843, 0.060964794075560005, 0.19020971531669298, 0.17924025038530725, 0.2709557296974318, 0.15510834340354435, 0.0006323956379977366, 0.12799223739328602, 0.04838870019311943, 0.11241661568379237, -0.005677421089439165, -0.2646018693903609, 0.03131896401533768, 0.17791607811500038] |
1,802.01915 | A Ginzburg-Landau type energy with weight and with convex potential near
zero | In this paper, we study the asymptotic behaviour of minimizing solutions of a
Ginzburg-Landau type functional with a positive weight and with convex
potential near $0$ and we estimate the energy in this case. We also generalize
a lower bound for the energy of unit vector field given initially by
Brezis-Merle-Rivi\`ere.
| math.AP | in this paper we study the asymptotic behaviour of minimizing solutions of a ginzburglandau type functional with a positive weight and with convex potential near 0 and we estimate the energy in this case we also generalize a lower bound for the energy of unit vector field given initially by brezismerleriviere | [['in', 'this', 'paper', 'we', 'study', 'the', 'asymptotic', 'behaviour', 'of', 'minimizing', 'solutions', 'of', 'a', 'ginzburglandau', 'type', 'functional', 'with', 'a', 'positive', 'weight', 'and', 'with', 'convex', 'potential', 'near', '0', 'and', 'we', 'estimate', 'the', 'energy', 'in', 'this', 'case', 'we', 'also', 'generalize', 'a', 'lower', 'bound', 'for', 'the', 'energy', 'of', 'unit', 'vector', 'field', 'given', 'initially', 'by', 'brezismerleriviere']] | [-0.1386054341122508, 0.09003016294911503, -0.06245920432731509, 0.04773281396832317, -0.039138772338628766, -0.09259503456763923, 0.10403619600692764, 0.3139415394514799, -0.24570719875395297, -0.2709068964421749, 0.1019936683261767, -0.28885694466531275, -0.18535906223230994, 0.14484047006815673, -0.045881052408367394, 0.03545173525810242, 0.014241705192252993, 0.10741806581616402, -0.08301887758076192, -0.2163916489109397, 0.39571102388203144, 0.022299972400069236, 0.2085830864496529, 0.07923302971292287, 0.06667012935504317, 0.026100379265844822, 0.06259045090526343, 0.049359889253973964, -0.2372091464046389, 0.18123111432883887, 0.21431454375386239, 0.07097559686750174, 0.31697407871484756, -0.3998698960989714, -0.19941175825893878, 0.18629577986896037, 0.13143474033102392, 0.07445816025137901, -0.07463613756000996, -0.20437205444555728, 0.12476192036643624, -0.13484520860016347, -0.19245874968357385, -0.030444561019539833, 0.004949782167095691, 0.08490851511247456, -0.29226080775260926, 0.0964858471736079, 0.06150693874806166, 0.05542217744514346, -0.20974570624530314, -0.10509359838441014, 0.027656192369759084, 0.0439031691942364, 0.06912888612598181, 0.0811973232892342, 0.030353632802143694, -0.15285352650098502, -0.0527145282831043, 0.27529372078832237, -0.13778271270915865, -0.2609922470152378, 0.13341730138286947, -0.1627758282981813, -0.10698871782049536, 0.08073090886697173, 0.20630249060690403, 0.1676882826909423, -0.13117856491357088, 0.13833854651777075, -0.040163372661918405, 0.10655018050223589, 0.0674837645329535, 0.018681165487505494, 0.13317808240652085, 0.14999320834875107, 0.11364340626634657, 0.20205402258783578, -0.08885254964232445, -0.07933747605420649, -0.35962771384976805, -0.20360973577597177, -0.21162252383306623, 0.07626234792172909, -0.0815543121745577, -0.16193370573222637, 0.426040988266468, 0.08645305072888732, 0.21655352398753167, 0.13188002532348037, 0.24596481036394835, 0.1857082061097026, 0.004320710245519876, 0.11878593601286411, 0.19746435567736625, 0.1150190130667761, 0.0788059289753437, -0.201184637863189, -0.015132296115043574, 0.07507920864969492] |
1,802.01916 | Domination, almost additivity, and thermodynamic formalism for planar
matrix cocycles | In topics such as the thermodynamic formalism of linear cocycles, the
dimension theory of self-affine sets, and the theory of random matrix products,
it has often been found useful to assume positivity of the matrix entries in
order to simplify or make feasible certain types of calculation. It is natural
to ask how positivity may be relaxed or generalised in a way which enables
similar calculations to be made in more general contexts. On the one hand one
may generalise by considering almost additive or asymptotically additive
potentials which mimic the properties enjoyed by the logarithm of the norm of a
positive matrix cocycle; on the other hand one may consider matrix cocycles
which are dominated, a condition which includes positive matrix cocycles but is
more general. In this article we explore the relationship between almost
additivity and domination for planar cocycles. We show in particular that a
locally constant linear cocycle in the plane is almost additive if and only if
it is either conjugate to a cocycle of isometries, or satisfies a property
slightly weaker than domination which is introduced in this paper. Applications
to matrix thermodynamic formalism are presented.
| math.DS | in topics such as the thermodynamic formalism of linear cocycles the dimension theory of selfaffine sets and the theory of random matrix products it has often been found useful to assume positivity of the matrix entries in order to simplify or make feasible certain types of calculation it is natural to ask how positivity may be relaxed or generalised in a way which enables similar calculations to be made in more general contexts on the one hand one may generalise by considering almost additive or asymptotically additive potentials which mimic the properties enjoyed by the logarithm of the norm of a positive matrix cocycle on the other hand one may consider matrix cocycles which are dominated a condition which includes positive matrix cocycles but is more general in this article we explore the relationship between almost additivity and domination for planar cocycles we show in particular that a locally constant linear cocycle in the plane is almost additive if and only if it is either conjugate to a cocycle of isometries or satisfies a property slightly weaker than domination which is introduced in this paper applications to matrix thermodynamic formalism are presented | [['in', 'topics', 'such', 'as', 'the', 'thermodynamic', 'formalism', 'of', 'linear', 'cocycles', 'the', 'dimension', 'theory', 'of', 'selfaffine', 'sets', 'and', 'the', 'theory', 'of', 'random', 'matrix', 'products', 'it', 'has', 'often', 'been', 'found', 'useful', 'to', 'assume', 'positivity', 'of', 'the', 'matrix', 'entries', 'in', 'order', 'to', 'simplify', 'or', 'make', 'feasible', 'certain', 'types', 'of', 'calculation', 'it', 'is', 'natural', 'to', 'ask', 'how', 'positivity', 'may', 'be', 'relaxed', 'or', 'generalised', 'in', 'a', 'way', 'which', 'enables', 'similar', 'calculations', 'to', 'be', 'made', 'in', 'more', 'general', 'contexts', 'on', 'the', 'one', 'hand', 'one', 'may', 'generalise', 'by', 'considering', 'almost', 'additive', 'or', 'asymptotically', 'additive', 'potentials', 'which', 'mimic', 'the', 'properties', 'enjoyed', 'by', 'the', 'logarithm', 'of', 'the', 'norm', 'of', 'a', 'positive', 'matrix', 'cocycle', 'on', 'the', 'other', 'hand', 'one', 'may', 'consider', 'matrix', 'cocycles', 'which', 'are', 'dominated', 'a', 'condition', 'which', 'includes', 'positive', 'matrix', 'cocycles', 'but', 'is', 'more', 'general', 'in', 'this', 'article', 'we', 'explore', 'the', 'relationship', 'between', 'almost', 'additivity', 'and', 'domination', 'for', 'planar', 'cocycles', 'we', 'show', 'in', 'particular', 'that', 'a', 'locally', 'constant', 'linear', 'cocycle', 'in', 'the', 'plane', 'is', 'almost', 'additive', 'if', 'and', 'only', 'if', 'it', 'is', 'either', 'conjugate', 'to', 'a', 'cocycle', 'of', 'isometries', 'or', 'satisfies', 'a', 'property', 'slightly', 'weaker', 'than', 'domination', 'which', 'is', 'introduced', 'in', 'this', 'paper', 'applications', 'to', 'matrix', 'thermodynamic', 'formalism', 'are', 'presented']] | [-0.12378518556215568, 0.14420908023384982, -0.09016123139751168, 0.08361840348940557, -0.09394901822815882, -0.17216685882037078, -0.001412181208555315, 0.3411140413894221, -0.31368314143037423, -0.21983943458326394, 0.13033893295020485, -0.26897899695904925, -0.2012360882702827, 0.18005295794258322, -0.09397906282538315, 0.049705431098118424, 0.042695320565447524, 0.09179931434482569, -0.09350379825627897, -0.26099508114324027, 0.3679840186863051, 0.01749183044497234, 0.22004568149228967, 0.053169751115395535, 0.08945451335481873, 0.014693855662092878, -0.04788408569826667, 0.05210629050755718, -0.11494371951891935, 0.10236842447375238, 0.2535576673678103, 0.0933242849666082, 0.2536985403809619, -0.40016777037574985, -0.20196332479948373, 0.19133430884297317, 0.10603431607402551, 0.06521123120122259, -0.002794836584295505, -0.23606134049380975, 0.12168701313809531, -0.17594172943305844, -0.136038177915907, -0.09690052421986668, 0.04112151133873946, -0.014666991963167675, -0.29069373960373923, 0.058634279390389565, 0.10699611602437169, 0.013700142348435898, -0.021679946419074742, -0.09051120615064671, -0.01753480615540563, 0.07706357117846589, 0.045846514928295314, 0.011972141686783289, 0.11730717030635181, -0.06994873547834383, -0.08701132349779073, 0.39656754301540786, -0.04447222453723043, -0.2544193237554282, 0.17778778065257939, -0.1615666531821868, -0.1753584692972557, 0.07579121399612632, 0.11871780667449154, 0.12424720055423677, -0.1369302766349089, 0.14647482247437438, -0.06971809433889575, 0.15020641149021685, 0.10327834577280252, 0.029699104567650163, 0.12298583387898059, 0.04666970812225676, 0.1456625044423466, 0.1393294222886349, 0.06910539401239173, -0.09749250121967634, -0.28387379900474724, -0.1370169537910518, -0.159706474933652, 0.1197642865627131, -0.08310626424016239, -0.2194421144279962, 0.37740185410075355, 0.11982201266740351, 0.18250496996430834, 0.06601937269745879, 0.2522894673760068, 0.1366638287090609, 0.06625480430011521, 0.05658798703855913, 0.19631883671293812, 0.1983211669018298, 0.03310676961458133, -0.10572584733381518, 0.08544339562164775, 0.12454927320747326] |
1,802.01917 | Hyper- and hybrid nonlocality | The controlled generation and identification of quantum correlations, usually
encoded in either qubits or continuous degrees of freedom, builds the
foundation of quantum information science. Recently, more sophisticated
approaches, involving a combination of two distinct degrees of freedom have
been proposed to improve on the traditional strategies. Hyperentanglement
describes simultaneous entanglement in more than one distinct degree of
freedom, whereas hybrid entanglement refers to entanglement shared between a
discrete and a continuous degree of freedom. In this work we propose a scheme
that allows to combine the two approaches, and to extend them to the strongest
form of quantum correlations. Specifically, we show how two identical,
initially separated particles can be manipulated to produce Bell nonlocality
among their spins, among their momenta, as well as across their spins and
momenta. We discuss possible experimental realizations with atomic and photonic
systems.
| quant-ph | the controlled generation and identification of quantum correlations usually encoded in either qubits or continuous degrees of freedom builds the foundation of quantum information science recently more sophisticated approaches involving a combination of two distinct degrees of freedom have been proposed to improve on the traditional strategies hyperentanglement describes simultaneous entanglement in more than one distinct degree of freedom whereas hybrid entanglement refers to entanglement shared between a discrete and a continuous degree of freedom in this work we propose a scheme that allows to combine the two approaches and to extend them to the strongest form of quantum correlations specifically we show how two identical initially separated particles can be manipulated to produce bell nonlocality among their spins among their momenta as well as across their spins and momenta we discuss possible experimental realizations with atomic and photonic systems | [['the', 'controlled', 'generation', 'and', 'identification', 'of', 'quantum', 'correlations', 'usually', 'encoded', 'in', 'either', 'qubits', 'or', 'continuous', 'degrees', 'of', 'freedom', 'builds', 'the', 'foundation', 'of', 'quantum', 'information', 'science', 'recently', 'more', 'sophisticated', 'approaches', 'involving', 'a', 'combination', 'of', 'two', 'distinct', 'degrees', 'of', 'freedom', 'have', 'been', 'proposed', 'to', 'improve', 'on', 'the', 'traditional', 'strategies', 'hyperentanglement', 'describes', 'simultaneous', 'entanglement', 'in', 'more', 'than', 'one', 'distinct', 'degree', 'of', 'freedom', 'whereas', 'hybrid', 'entanglement', 'refers', 'to', 'entanglement', 'shared', 'between', 'a', 'discrete', 'and', 'a', 'continuous', 'degree', 'of', 'freedom', 'in', 'this', 'work', 'we', 'propose', 'a', 'scheme', 'that', 'allows', 'to', 'combine', 'the', 'two', 'approaches', 'and', 'to', 'extend', 'them', 'to', 'the', 'strongest', 'form', 'of', 'quantum', 'correlations', 'specifically', 'we', 'show', 'how', 'two', 'identical', 'initially', 'separated', 'particles', 'can', 'be', 'manipulated', 'to', 'produce', 'bell', 'nonlocality', 'among', 'their', 'spins', 'among', 'their', 'momenta', 'as', 'well', 'as', 'across', 'their', 'spins', 'and', 'momenta', 'we', 'discuss', 'possible', 'experimental', 'realizations', 'with', 'atomic', 'and', 'photonic', 'systems']] | [-0.15052190478766403, 0.19701223676092922, -0.06670135296215969, 0.021525373388223152, -0.04366769822913089, -0.1981401084523116, 0.03434809583538611, 0.3760250277152019, -0.2512480360207909, -0.3280647256411612, 0.0126934094063472, -0.2847651044124047, -0.10914983452696886, 0.1650204643523986, -0.022069170665262, 0.06615276914089918, 0.00735146922275557, 0.010390513809397817, -0.07780076825666973, -0.2400937549171171, 0.29900280439739746, 0.009169115615908855, 0.28527848457784527, 0.021874445919612687, 0.13844157098459878, 0.05564216522034258, -0.015780444090653743, 0.012846911139786244, -0.09127646783459308, 0.17545822838687206, 0.2676532455320869, 0.1214522878988646, 0.26715268258537567, -0.44972928042656607, -0.2225768782131906, 0.10597582174731153, 0.14950554161997778, 0.17372129219916782, 0.022721329608923823, -0.2757962336630693, -0.007802175171673298, -0.18651852812805114, -0.11872582158539444, -0.14397870612197688, -0.02039659324301673, 0.0015558773851288216, -0.24179436926330838, 0.08339547290067588, 0.06536418101729526, 0.0641936247702688, 0.04872221535978107, -0.0769641610195062, -0.012303095212804952, 0.14993534868616346, -0.009143877867609262, -0.01592113359448766, 0.10008977498884113, -0.11159731004486925, -0.21997627386507312, 0.3552257048548199, 0.0029983893064906755, -0.22405742259829173, 0.2639476112156574, -0.10261139014536248, -0.1269633582394038, 0.05103085914493671, 0.18184213018643536, 0.12851142679740277, -0.14554578794133186, 0.0007752858148056215, 0.020880425428705555, 0.20651939572334024, 0.08311730274664504, 0.19890330169416431, 0.23261262350383083, 0.08504273545529162, 0.0681501617106343, 0.1840510193260083, -0.04243599707032055, -0.17846023924690338, -0.24556632636314524, -0.18298565921972373, -0.21961956789184894, 0.03892368629042591, -0.04674205597038963, -0.08822899282510792, 0.4258969899841499, 0.1485034434465758, 0.18506339429212468, -0.019325126701109443, 0.2930535849715982, 0.03566287918116099, 0.10624925120833463, 0.06386320668804858, 0.24867004749498198, 0.13824865573717812, 0.048508069527867646, -0.21204077575821428, 0.030436522510301853, -0.006955568492412567] |
1,802.01918 | Complexity of the laminar-turbulent boundary in pipe flow | Over the past decade, the edge of chaos has proven to be a fruitful starting
point for investigations of shear flows when the laminar base flow is linearly
stable. Numerous computational studies of shear flows demonstrated the
existence of states that separate laminar and turbulent regions of the state
space. In addition, some studies determined invariant solutions that reside on
this edge. In this paper, we study the unstable manifold of one such solution
with the aid of continuous symmetry-reduction, which we formulate here for the
first time for the simultaneous quotiening of axial and azimuthal symmetries.
Upon our investigation of the unstable manifold, we discover a previously
unknown traveling wave solution on the laminar-turbulent boundary with a
relatively complex structure. By means of low-dimensional projections, we
visualize different dynamical paths that connect these solutions to the
turbulence. Our numerical experiments demonstrate that the laminar-turbulent
boundary exhibits qualitatively different regions whose properties are
influenced by the nearby invariant solutions.
| physics.flu-dyn nlin.CD | over the past decade the edge of chaos has proven to be a fruitful starting point for investigations of shear flows when the laminar base flow is linearly stable numerous computational studies of shear flows demonstrated the existence of states that separate laminar and turbulent regions of the state space in addition some studies determined invariant solutions that reside on this edge in this paper we study the unstable manifold of one such solution with the aid of continuous symmetryreduction which we formulate here for the first time for the simultaneous quotiening of axial and azimuthal symmetries upon our investigation of the unstable manifold we discover a previously unknown traveling wave solution on the laminarturbulent boundary with a relatively complex structure by means of lowdimensional projections we visualize different dynamical paths that connect these solutions to the turbulence our numerical experiments demonstrate that the laminarturbulent boundary exhibits qualitatively different regions whose properties are influenced by the nearby invariant solutions | [['over', 'the', 'past', 'decade', 'the', 'edge', 'of', 'chaos', 'has', 'proven', 'to', 'be', 'a', 'fruitful', 'starting', 'point', 'for', 'investigations', 'of', 'shear', 'flows', 'when', 'the', 'laminar', 'base', 'flow', 'is', 'linearly', 'stable', 'numerous', 'computational', 'studies', 'of', 'shear', 'flows', 'demonstrated', 'the', 'existence', 'of', 'states', 'that', 'separate', 'laminar', 'and', 'turbulent', 'regions', 'of', 'the', 'state', 'space', 'in', 'addition', 'some', 'studies', 'determined', 'invariant', 'solutions', 'that', 'reside', 'on', 'this', 'edge', 'in', 'this', 'paper', 'we', 'study', 'the', 'unstable', 'manifold', 'of', 'one', 'such', 'solution', 'with', 'the', 'aid', 'of', 'continuous', 'symmetryreduction', 'which', 'we', 'formulate', 'here', 'for', 'the', 'first', 'time', 'for', 'the', 'simultaneous', 'quotiening', 'of', 'axial', 'and', 'azimuthal', 'symmetries', 'upon', 'our', 'investigation', 'of', 'the', 'unstable', 'manifold', 'we', 'discover', 'a', 'previously', 'unknown', 'traveling', 'wave', 'solution', 'on', 'the', 'laminarturbulent', 'boundary', 'with', 'a', 'relatively', 'complex', 'structure', 'by', 'means', 'of', 'lowdimensional', 'projections', 'we', 'visualize', 'different', 'dynamical', 'paths', 'that', 'connect', 'these', 'solutions', 'to', 'the', 'turbulence', 'our', 'numerical', 'experiments', 'demonstrate', 'that', 'the', 'laminarturbulent', 'boundary', 'exhibits', 'qualitatively', 'different', 'regions', 'whose', 'properties', 'are', 'influenced', 'by', 'the', 'nearby', 'invariant', 'solutions']] | [-0.1863778317754254, 0.1449877165193092, -0.1131654190919303, 0.020746289306656233, -0.05548330897147048, -0.08116862084200795, 0.01882763015536615, 0.3396431321176535, -0.29124899558675815, -0.2356265688645123, 0.13730843479028915, -0.24143422092605807, -0.17500859013275255, 0.18577065849617783, 0.004369776586919457, 0.08441232242606746, 0.08153261317240805, -4.2634821626581724e-05, -0.06417652296161727, -0.1921405556812128, 0.37346242162141297, 0.0007555885697255217, 0.2841355110197387, 0.0036234783562772636, 0.08158646475028576, -0.0652046526746848, -0.02683229420534512, 0.06653166186529406, -0.19971083040453075, 0.10192021906737012, 0.2431800841041428, 0.06315907405665781, 0.25146569664254076, -0.4483069322967925, -0.2700828624111188, 0.06501833623410733, 0.15982649594993342, 0.09613943239010847, -0.055764782490412106, -0.2962142928574187, 0.11182051871702829, -0.10767571219903287, -0.16650981823560088, -0.09277451882740081, 0.019952411816420056, 0.0242108999695511, -0.23493893650143785, 0.06464517396974931, 0.05161387830290389, 0.059422890850213135, -0.11015470484212701, -0.04693936128051409, -0.06065891298783731, 0.1287078875600717, 0.11029443828701455, 0.0338742382930521, 0.1057662056682372, -0.13289811313329147, -0.10135357172369863, 0.3426040227560303, -0.0316978629635753, -0.20958858818354387, 0.253618389786563, -0.1570892276646145, -0.13080656817006064, 0.172150606038992, 0.17860837098022428, 0.1482220500165337, -0.0869890772141671, 0.0473298246307664, -0.10384151366488828, 0.11212290827530477, 0.08276606177545706, -0.00019036484528568725, 0.19941564051057153, 0.16330272425702902, 0.11222920315988551, 0.13380337949610857, -0.07649579965155807, -0.14026622899772623, -0.2800868419573725, -0.14462120618517924, -0.15430140181126284, 0.035159059180093405, -0.07529915209997393, -0.17621636015209782, 0.44083880741278864, 0.11677730980305638, 0.2180552909996573, 0.00981781687631708, 0.2748100119819747, 0.08986430755474523, 0.011863076736667205, 0.11286126194179907, 0.27007370849845114, 0.126781545573539, 0.09338662799822073, -0.22210464995248314, 0.05345241634817676, 0.05312129266448083] |
1,802.01919 | Imaginary potential in strongly coupled $\mathcal{N}=4$ SYM plasma in a
magnetic field | We study the effect of a constant magnetic field on the imaginary part of a
quarkonia potential in a strongly-coupled $\mathcal{N}=4$ SYM plasma. We
consider the pair axis to be aligned perpendicularly and parallel to the
magnetic field, respectively. For both cases, we find that the presence of the
magnetic field tends to enhance the imaginary potential thus decreasing the the
thermal width. In addition, the magnetic field has a stronger effect on the
imaginary potential when the pair axis is perpendicular to the magnetic field
rather than parallel.
| hep-th | we study the effect of a constant magnetic field on the imaginary part of a quarkonia potential in a stronglycoupled mathcaln4 sym plasma we consider the pair axis to be aligned perpendicularly and parallel to the magnetic field respectively for both cases we find that the presence of the magnetic field tends to enhance the imaginary potential thus decreasing the the thermal width in addition the magnetic field has a stronger effect on the imaginary potential when the pair axis is perpendicular to the magnetic field rather than parallel | [['we', 'study', 'the', 'effect', 'of', 'a', 'constant', 'magnetic', 'field', 'on', 'the', 'imaginary', 'part', 'of', 'a', 'quarkonia', 'potential', 'in', 'a', 'stronglycoupled', 'mathcaln4', 'sym', 'plasma', 'we', 'consider', 'the', 'pair', 'axis', 'to', 'be', 'aligned', 'perpendicularly', 'and', 'parallel', 'to', 'the', 'magnetic', 'field', 'respectively', 'for', 'both', 'cases', 'we', 'find', 'that', 'the', 'presence', 'of', 'the', 'magnetic', 'field', 'tends', 'to', 'enhance', 'the', 'imaginary', 'potential', 'thus', 'decreasing', 'the', 'the', 'thermal', 'width', 'in', 'addition', 'the', 'magnetic', 'field', 'has', 'a', 'stronger', 'effect', 'on', 'the', 'imaginary', 'potential', 'when', 'the', 'pair', 'axis', 'is', 'perpendicular', 'to', 'the', 'magnetic', 'field', 'rather', 'than', 'parallel']] | [-0.20805039833132388, 0.17801094858833913, -0.019655605935062586, 0.02575343810257324, -0.10444612844828831, -0.07029958595155497, -0.03223600504354814, 0.4050080979640564, -0.22997668957379594, -0.26186681769034836, 0.030222133749028605, -0.24936959498530525, -0.07276849550184573, 0.16988158906715806, 0.08143631042389388, -0.06098396221196718, -0.006690182759729999, 0.08908832480011278, -0.04721899828651208, -0.21094111026934442, 0.31133393285105404, 0.013292276593490263, 0.28098414778144337, 0.13245070145957255, 0.0074578084187644925, 0.041755130906791095, 0.08127299782014295, 0.07742274420878642, -0.05942429752398761, 0.03851611002379756, 0.10200742322930627, -0.053392865237246234, 0.24518359900358017, -0.4484637678715955, -0.15111794646075938, 0.10038925333503174, 0.17838443607468618, 0.13515826476884357, -0.04542273578359588, -0.227594075284982, 0.09156065768290185, -0.09195379959680977, -0.19188660620764064, -0.010933491893196375, 0.04331693890389432, -0.022952489243569168, -0.31276991063456855, 0.05188432875811384, 0.041085439556267825, 0.0864552232970515, -0.10138830973693494, -0.10125220005055156, -0.03966350051877874, 0.05899457525091738, 0.13497129362207325, 0.1839825232445231, 0.2016505116146853, -0.18187615440718913, -0.09380487261047021, 0.35625484493676196, -0.12924764270117908, -0.18654711586370898, 0.16196652931380975, -0.20512849104844474, -0.05952186266148693, 0.13761602195628572, 0.20200927881523967, 0.1234714801193037, -0.08101562354167573, 0.13710916656516806, 0.0015199942974729484, 0.12057134078742329, 0.04376489618855916, -0.0017948211223054468, 0.27920768154638537, 0.07459658914078236, 0.034162609177390425, 0.2179558140662593, -0.12216357886268014, -0.08423549222780831, -0.2857850869343187, -0.19440697708554314, -0.151500601467959, 0.04565236215176207, -0.10022290158749354, -0.2243617249003957, 0.4181231702311655, 0.18375541070957532, 0.18145362580465832, -0.01760470267552673, 0.3391646912342377, 0.12723523643118947, 0.1021347768379773, 0.06525596429520611, 0.29653456531402267, 0.259321974109063, 0.16496019574991438, -0.3134363004728482, -0.026348878849255904, -0.008858732607090072] |
1,802.0192 | Certification of minimal approximant bases | For a given computational problem, a certificate is a piece of data that one
(the prover) attaches to the output with the aim of allowing efficient
verification (by the verifier) that this output is correct. Here, we consider
the minimal approximant basis problem, for which the fastest known algorithms
output a polynomial matrix of dimensions $m \times m$ and average degree $D/m$
using $O\tilde{~}(m^\omega \frac{D}{m})$ field operations. We propose a
certificate which, for typical instances of the problem, is computed by the
prover using $O(m^\omega \frac{D}{m})$ additional field operations and allows
verification of the approximant basis by a Monte Carlo algorithm with cost
bound $O(m^\omega + m D)$.
Besides theoretical interest, our motivation also comes from the fact that
approximant bases arise in most of the fastest known algorithms for linear
algebra over the univariate polynomials; thus, this work may help in designing
certificates for other polynomial matrix computations. Furthermore,
cryptographic challenges such as breaking records for discrete logarithm
computations or for integer factorization rely in particular on computing
minimal approximant bases for large instances: certificates can then be used to
provide reliable computation on outsourced and error-prone clusters.
| cs.SC | for a given computational problem a certificate is a piece of data that one the prover attaches to the output with the aim of allowing efficient verification by the verifier that this output is correct here we consider the minimal approximant basis problem for which the fastest known algorithms output a polynomial matrix of dimensions m times m and average degree dm using otildemomega fracdm field operations we propose a certificate which for typical instances of the problem is computed by the prover using omomega fracdm additional field operations and allows verification of the approximant basis by a monte carlo algorithm with cost bound omomega m d besides theoretical interest our motivation also comes from the fact that approximant bases arise in most of the fastest known algorithms for linear algebra over the univariate polynomials thus this work may help in designing certificates for other polynomial matrix computations furthermore cryptographic challenges such as breaking records for discrete logarithm computations or for integer factorization rely in particular on computing minimal approximant bases for large instances certificates can then be used to provide reliable computation on outsourced and errorprone clusters | [['for', 'a', 'given', 'computational', 'problem', 'a', 'certificate', 'is', 'a', 'piece', 'of', 'data', 'that', 'one', 'the', 'prover', 'attaches', 'to', 'the', 'output', 'with', 'the', 'aim', 'of', 'allowing', 'efficient', 'verification', 'by', 'the', 'verifier', 'that', 'this', 'output', 'is', 'correct', 'here', 'we', 'consider', 'the', 'minimal', 'approximant', 'basis', 'problem', 'for', 'which', 'the', 'fastest', 'known', 'algorithms', 'output', 'a', 'polynomial', 'matrix', 'of', 'dimensions', 'm', 'times', 'm', 'and', 'average', 'degree', 'dm', 'using', 'otildemomega', 'fracdm', 'field', 'operations', 'we', 'propose', 'a', 'certificate', 'which', 'for', 'typical', 'instances', 'of', 'the', 'problem', 'is', 'computed', 'by', 'the', 'prover', 'using', 'omomega', 'fracdm', 'additional', 'field', 'operations', 'and', 'allows', 'verification', 'of', 'the', 'approximant', 'basis', 'by', 'a', 'monte', 'carlo', 'algorithm', 'with', 'cost', 'bound', 'omomega', 'm', 'd', 'besides', 'theoretical', 'interest', 'our', 'motivation', 'also', 'comes', 'from', 'the', 'fact', 'that', 'approximant', 'bases', 'arise', 'in', 'most', 'of', 'the', 'fastest', 'known', 'algorithms', 'for', 'linear', 'algebra', 'over', 'the', 'univariate', 'polynomials', 'thus', 'this', 'work', 'may', 'help', 'in', 'designing', 'certificates', 'for', 'other', 'polynomial', 'matrix', 'computations', 'furthermore', 'cryptographic', 'challenges', 'such', 'as', 'breaking', 'records', 'for', 'discrete', 'logarithm', 'computations', 'or', 'for', 'integer', 'factorization', 'rely', 'in', 'particular', 'on', 'computing', 'minimal', 'approximant', 'bases', 'for', 'large', 'instances', 'certificates', 'can', 'then', 'be', 'used', 'to', 'provide', 'reliable', 'computation', 'on', 'outsourced', 'and', 'errorprone', 'clusters']] | [-0.1289360753688458, 0.020355532937557312, -0.07979704634462659, 0.07761107254584597, -0.09152123326360173, -0.18727652824332786, 0.07650533486409365, 0.3271953823095238, -0.3023069227120613, -0.3233142552041524, 0.16024133943436616, -0.22455726044033844, -0.13169538868666703, 0.232855099268459, -0.06027899471825819, 0.12680417583764506, 0.08650801858134768, 0.024478115180563937, -0.07416418826591374, -0.29039065245463436, 0.28282779880384035, 0.04723002039198134, 0.20189406997901765, -0.002508085219164354, 0.09232225222072589, 0.04232135356429058, -0.012382701978188108, -0.025600873702205717, -0.08514442471091202, 0.1510903204555271, 0.31196148499997484, 0.19646503428953724, 0.27764382085108474, -0.4296550992674924, -0.10223140162289948, 0.1310088657912471, 0.15104921585502656, 0.12080729051392425, -0.057907979340116315, -0.21290340401937027, 0.11475726863545542, -0.17270844976010266, -0.10217517628460317, -0.10794201823756905, 0.02675057462215222, -0.01329895984633146, -0.3203898284987018, 0.007567327887266623, 0.044956567327215056, 0.06006799256177368, 0.03539471608756513, -0.1384773273172008, 0.03844603339487032, 0.09164880798449991, -0.003448136538547162, 0.05329598083437697, 0.10414566206619949, -0.09205726142217581, -0.186037822165904, 0.3763753066569365, -0.02734095651555706, -0.20985602730432074, 0.13603525538802952, -0.07336561235574049, -0.17130060162823144, 0.12463248142016095, 0.1472770896482256, 0.13580724137482814, -0.10501324358220036, 0.13690144700986157, -0.05948929478087135, 0.2181009278242552, 0.06471889321566433, 0.018147421137404602, 0.15418363169741792, 0.11882701883520427, 0.07715693707829593, 0.15121524314792525, -0.0013103507196442603, -0.078683674979225, -0.2795687428298029, -0.17043461857168507, -0.23893402651757809, 0.011998570808587043, -0.12718792310766436, -0.15579009556362555, 0.3680494418116035, 0.16148892895104616, 0.13855300670602938, 0.13194478066210208, 0.3393435519213813, 0.09133990904618357, 0.08902233866723003, 0.12320507536138836, 0.13155534168503977, 0.10554483716527151, 0.06302336200857787, -0.1635650620153929, 0.12427433400440055, 0.1253358885268303] |
1,802.01921 | Dynamical regularities of US equities opening and closing auctions | We first investigate the evolution of opening and closing auctions volumes of
US equities along the years. We then report dynamical properties of pre-auction
periods: the indicative match price is strongly mean-reverting because the
imbalance is; the final auction price reacts to a single auction order
placement or cancellation in markedly different ways in the opening and closing
auctions when computed conditionally on imbalance improving or worsening
events; the indicative price reverts towards the mid price of the regular limit
order book but is not especially bound to the spread.
| q-fin.TR | we first investigate the evolution of opening and closing auctions volumes of us equities along the years we then report dynamical properties of preauction periods the indicative match price is strongly meanreverting because the imbalance is the final auction price reacts to a single auction order placement or cancellation in markedly different ways in the opening and closing auctions when computed conditionally on imbalance improving or worsening events the indicative price reverts towards the mid price of the regular limit order book but is not especially bound to the spread | [['we', 'first', 'investigate', 'the', 'evolution', 'of', 'opening', 'and', 'closing', 'auctions', 'volumes', 'of', 'us', 'equities', 'along', 'the', 'years', 'we', 'then', 'report', 'dynamical', 'properties', 'of', 'preauction', 'periods', 'the', 'indicative', 'match', 'price', 'is', 'strongly', 'meanreverting', 'because', 'the', 'imbalance', 'is', 'the', 'final', 'auction', 'price', 'reacts', 'to', 'a', 'single', 'auction', 'order', 'placement', 'or', 'cancellation', 'in', 'markedly', 'different', 'ways', 'in', 'the', 'opening', 'and', 'closing', 'auctions', 'when', 'computed', 'conditionally', 'on', 'imbalance', 'improving', 'or', 'worsening', 'events', 'the', 'indicative', 'price', 'reverts', 'towards', 'the', 'mid', 'price', 'of', 'the', 'regular', 'limit', 'order', 'book', 'but', 'is', 'not', 'especially', 'bound', 'to', 'the', 'spread']] | [-0.14556155346197944, 0.126931380239849, -0.08277566756613636, 0.12099959493975751, -0.08642888421014872, -0.1390297084934277, 0.16331301342821522, 0.39035287393738377, -0.29821538439627443, -0.3125987880748142, 0.1500606515858155, -0.29868792093867763, -0.08324324434330121, 0.1267767249020549, -0.10541846904978618, -0.020878734218814733, 0.04974076586116231, -0.026354115592378578, -0.012005524030949377, -0.28135317397628273, 0.2888329690426923, 0.08402988630650418, 0.2846113565388355, 0.0790950683876872, 0.06475113208874606, 0.01762020883799185, -0.036152541260705905, -0.01696513167299916, -0.14601339857104453, 0.1119984365068376, 0.23687555222363954, 0.03925756098744407, 0.308032173637217, -0.4013067110326518, -0.10341059439553973, 0.12155450902502524, 0.0984239789809027, 0.0461526947054133, -0.0034236162914005057, -0.2038333596703544, 0.017841122421374533, -0.1959508006576072, -0.09569456155203922, -0.02729090730256788, -0.01565080083216007, 0.005193909881322571, -0.2886544159885622, 0.059667103186124164, 0.0403060173923856, 0.03279801734377829, -0.06352392482843376, -0.11206253744391044, -0.04486099225625898, 0.15882973142623577, 0.130498313483667, -0.01586802334137512, 0.12603499896280215, -0.1678887102020423, -0.20043802570572564, 0.399837058267734, -0.05056747877996499, -0.09039105606275831, 0.13599609875570187, -0.22208431577623894, -0.098058892560474, 0.16950331416420555, 0.18646446609309758, 0.07904557669090546, -0.1043349097339303, 0.017056777828707872, -0.002582234476321492, 0.1832204543059336, 0.11830200561521094, 0.02997013288968651, 0.22529566300551543, 0.1831133821207423, 0.13600412747833165, 0.1354370541724094, -0.07205238141736874, -0.18455791412172526, -0.22825296271299378, -0.12552743429236973, -0.12520431446727742, 0.09204014819498, -0.08778411447132017, -0.16341640439219354, 0.4303353932801257, 0.1322715978420685, 0.19157022031631027, 0.06516566087774346, 0.26879901078979623, 0.13214736499855023, -0.0066369063733668805, 0.12413741519486302, 0.2082991064683105, -0.03411120393449504, 0.15219999194673978, -0.1818399761091876, 0.23309449852559339, 0.010747130970690357] |
1,802.01922 | Wake of super-hydrophobic falling spheres: influence of the air layer
deformation | We report an experimental investigation of the wake of free falling
super-hydrophobic spheres. The mutual interaction between the air layer
(plastron) encapsulating the super-hydrophobic spheres and the flow is
emphasised by studying the hydrodynamic performances. It is found that the air
plastron adapts its shape to the flow-induced stresses which compete with the
surface tension. This competition is characterised by introducing the Weber
number $\mathcal{W}e$, whilst the plastron deformation is estimated via the
aspect ratio $\chi$. While noticeable distortions are locally observed, the
plastron becomes more and more spherical in average (i.e. $\chi \rightarrow 1$)
as far as $\mathcal{W}e$ increases. In comparison to the reference spheres,
high deformation of the air plastron plastron (oblate shape) leads to lift and
drag increase, whereas low deformation (spherical shape) yields lift and drag
mitigation. Accordingly, taking into account the plastron deformation provides
an attractive way to explain the somehow discordant results reported in other
studies at comparable Reynolds numbers. If confirmed by additional studies, our
findings would imply that plastron compliance and its feedback on the flow,
which are currently neglected in most theoretical works and numerical
simulations, must be accounted for to design super-hydrophobic surfaces and/or
predict their performances.
| physics.flu-dyn | we report an experimental investigation of the wake of free falling superhydrophobic spheres the mutual interaction between the air layer plastron encapsulating the superhydrophobic spheres and the flow is emphasised by studying the hydrodynamic performances it is found that the air plastron adapts its shape to the flowinduced stresses which compete with the surface tension this competition is characterised by introducing the weber number mathcalwe whilst the plastron deformation is estimated via the aspect ratio chi while noticeable distortions are locally observed the plastron becomes more and more spherical in average ie chi rightarrow 1 as far as mathcalwe increases in comparison to the reference spheres high deformation of the air plastron plastron oblate shape leads to lift and drag increase whereas low deformation spherical shape yields lift and drag mitigation accordingly taking into account the plastron deformation provides an attractive way to explain the somehow discordant results reported in other studies at comparable reynolds numbers if confirmed by additional studies our findings would imply that plastron compliance and its feedback on the flow which are currently neglected in most theoretical works and numerical simulations must be accounted for to design superhydrophobic surfaces andor predict their performances | [['we', 'report', 'an', 'experimental', 'investigation', 'of', 'the', 'wake', 'of', 'free', 'falling', 'superhydrophobic', 'spheres', 'the', 'mutual', 'interaction', 'between', 'the', 'air', 'layer', 'plastron', 'encapsulating', 'the', 'superhydrophobic', 'spheres', 'and', 'the', 'flow', 'is', 'emphasised', 'by', 'studying', 'the', 'hydrodynamic', 'performances', 'it', 'is', 'found', 'that', 'the', 'air', 'plastron', 'adapts', 'its', 'shape', 'to', 'the', 'flowinduced', 'stresses', 'which', 'compete', 'with', 'the', 'surface', 'tension', 'this', 'competition', 'is', 'characterised', 'by', 'introducing', 'the', 'weber', 'number', 'mathcalwe', 'whilst', 'the', 'plastron', 'deformation', 'is', 'estimated', 'via', 'the', 'aspect', 'ratio', 'chi', 'while', 'noticeable', 'distortions', 'are', 'locally', 'observed', 'the', 'plastron', 'becomes', 'more', 'and', 'more', 'spherical', 'in', 'average', 'ie', 'chi', 'rightarrow', '1', 'as', 'far', 'as', 'mathcalwe', 'increases', 'in', 'comparison', 'to', 'the', 'reference', 'spheres', 'high', 'deformation', 'of', 'the', 'air', 'plastron', 'plastron', 'oblate', 'shape', 'leads', 'to', 'lift', 'and', 'drag', 'increase', 'whereas', 'low', 'deformation', 'spherical', 'shape', 'yields', 'lift', 'and', 'drag', 'mitigation', 'accordingly', 'taking', 'into', 'account', 'the', 'plastron', 'deformation', 'provides', 'an', 'attractive', 'way', 'to', 'explain', 'the', 'somehow', 'discordant', 'results', 'reported', 'in', 'other', 'studies', 'at', 'comparable', 'reynolds', 'numbers', 'if', 'confirmed', 'by', 'additional', 'studies', 'our', 'findings', 'would', 'imply', 'that', 'plastron', 'compliance', 'and', 'its', 'feedback', 'on', 'the', 'flow', 'which', 'are', 'currently', 'neglected', 'in', 'most', 'theoretical', 'works', 'and', 'numerical', 'simulations', 'must', 'be', 'accounted', 'for', 'to', 'design', 'superhydrophobic', 'surfaces', 'andor', 'predict', 'their', 'performances']] | [-0.12719183938157022, 0.18197265647361788, -0.09460173081133874, 0.029487176821330743, -0.06129529091841565, -0.13254227226855336, -0.01605661553794608, 0.3656970136160702, -0.24090123168006067, -0.3272733904686071, 0.07404425251061277, -0.27813072244017406, -0.1283883410860515, 0.20346125256657827, -0.08027751302478958, 0.015722364272336066, 0.04742832853562828, -0.021772550564344385, -0.036111676559424814, -0.20158093326209767, 0.2504339789481819, 0.12070328807505556, 0.30532769643025576, 0.10708691023980377, 0.04839013785544575, -0.017562704012778867, -0.010327040676386828, 0.07798596607996293, -0.188504777608577, 0.06911127750530158, 0.20868538269982317, 0.0034234016202390194, 0.215094081499628, -0.4526447141495755, -0.22587280100220955, 0.06349626362801242, 0.14325803456837452, 0.06781691010760114, -0.04216488655423155, -0.2457027109032544, 0.05831386284668679, -0.17661800477795567, -0.14268373583353638, -0.0679605081984726, 0.026434815408387765, 0.018122412422543754, -0.22277568309416587, 0.07818191340175425, 0.0807372398206463, 0.06840550420134503, -0.09180794362579166, -0.1274552116256803, -0.07890781466754598, 0.12272654028035, 0.1261739005786154, 0.024820655969628676, 0.21602574117164963, -0.16023412008585436, 0.0006362905130168509, 0.3991106506815265, -0.002904786269752507, -0.20112151721596416, 0.2135862421272748, -0.1377262804316839, -0.029636476521154507, 0.18506358640485912, 0.14950279676861267, 0.05203982129891587, -0.055968886364232466, -0.009298760561966267, -0.004511725053493747, 0.1646500292380676, 0.1028082558145359, -0.08381159714456213, 0.21542962774785643, 0.1785467457933928, 0.05152651274737519, 0.15050161157014927, -0.097111064322567, -0.078571647220069, -0.25927552652691827, -0.12542142419305247, -0.14765428712173143, 0.00414414594876509, -0.09547221405283302, -0.14050630152433505, 0.28528843060854425, 0.0760442193120075, 0.2038476809748179, 0.04815286902360959, 0.3065510178670325, 0.057608717936091125, 0.07852953380011589, 0.03672050656325321, 0.31995463733405327, 0.10694119734878695, 0.06963331774137158, -0.24546179000931193, 0.10890793213077117, 0.029975293869587596] |
1,802.01923 | Exploring the energy landscape of resistive switching in
antiferromagnetic Sr(3)Ir(2)O(7) | We study the resistive switching triggered by an applied electrical bias in
antiferromagnetic Mott insulator Sr(3)Ir(2)O(7). The switching was previously
associated with an electric-field driven structural transition. Here we use
time-resolved measurements of the switching to probe the energy barrier
associated with the transition. We quantify the changes in the energy barrier
height with respect to the applied bias and find a linear decrease of the
barrier with increasing bias. Our observations support the potential of
antiferromagnetic transition metal oxides for spintronic applications.
| cond-mat.mtrl-sci | we study the resistive switching triggered by an applied electrical bias in antiferromagnetic mott insulator sr3ir2o7 the switching was previously associated with an electricfield driven structural transition here we use timeresolved measurements of the switching to probe the energy barrier associated with the transition we quantify the changes in the energy barrier height with respect to the applied bias and find a linear decrease of the barrier with increasing bias our observations support the potential of antiferromagnetic transition metal oxides for spintronic applications | [['we', 'study', 'the', 'resistive', 'switching', 'triggered', 'by', 'an', 'applied', 'electrical', 'bias', 'in', 'antiferromagnetic', 'mott', 'insulator', 'sr3ir2o7', 'the', 'switching', 'was', 'previously', 'associated', 'with', 'an', 'electricfield', 'driven', 'structural', 'transition', 'here', 'we', 'use', 'timeresolved', 'measurements', 'of', 'the', 'switching', 'to', 'probe', 'the', 'energy', 'barrier', 'associated', 'with', 'the', 'transition', 'we', 'quantify', 'the', 'changes', 'in', 'the', 'energy', 'barrier', 'height', 'with', 'respect', 'to', 'the', 'applied', 'bias', 'and', 'find', 'a', 'linear', 'decrease', 'of', 'the', 'barrier', 'with', 'increasing', 'bias', 'our', 'observations', 'support', 'the', 'potential', 'of', 'antiferromagnetic', 'transition', 'metal', 'oxides', 'for', 'spintronic', 'applications']] | [-0.14997855539108257, 0.1560704679069171, -0.002123683988374759, 0.020482292185616063, -0.06270940377410636, -0.13994988842295056, 0.11776821289761329, 0.43825871878898287, -0.2987761651839029, -0.3134114083150929, 0.0343052795611277, -0.3168830887515502, -0.13803203848291593, 0.1792337029992816, 0.02604927714487695, 0.013758040044501603, -0.06775174064404633, -0.05408475025702851, -0.11150339526315052, -0.15729831726884985, 0.2749831357925951, 0.05962713459977902, 0.29962383232539497, 0.08140380544369165, 0.05079715227685779, -0.03518261263393853, 0.1113167959966708, 0.041274780159288774, -0.20876761225714202, 0.049540890598931235, 0.2468441673834999, -0.12561833085099527, 0.2410685589245285, -0.463466792490827, -0.20213428186252713, 0.05604064338616129, 0.07705918643399175, 0.1516107577291957, -0.15500729267362012, -0.2867359588797911, 0.03876536733930908, -0.18369772670094867, -0.1341746022198237, -0.06290736782970469, -0.015374925458826214, 0.07152662436612489, -0.28028723292322044, 0.07978785812226405, 0.05217193297660315, 0.10362209250634334, -0.1133999046869576, -0.065799491496824, -0.07260988126172269, 0.08203940816975412, 0.05584595823682934, 0.098245105389169, 0.1887512391837067, -0.11085816586869825, -0.16505065483478717, 0.26901384706171344, -0.054004795759557245, -0.05294186431151557, 0.1615682682078556, -0.1659851058397487, -0.047805270031431174, 0.1726182043406529, 0.126025916514806, 0.05863134668444295, -0.11939847379563803, 0.0645805957821108, 0.11548112192561469, 0.18644914390092873, 0.01877582135767373, 0.01827341064260936, 0.2235132384181292, 0.2379791473476104, 0.08623243410544223, 0.1955610807783094, -0.15253956014632686, -0.06062437122665256, -0.22866017944235578, -0.1779320868382971, -0.2192364538267973, 0.06741275459651398, -0.08073167700347833, -0.19595802809863563, 0.4145292939550905, 0.2160173666338066, 0.1891115322731525, -0.05018125646130507, 0.24185094716874547, 0.19434675818354072, 0.0807062874783773, -0.015993015526468497, 0.2638276877914028, 0.20567319935176476, 0.16566621761275344, -0.3157488187909665, 0.14007649257083435, -0.07469260063112142] |
1,802.01924 | Tool-mediated HCI Modeling Instruction in a Campus_based Software
Quality Course | The Keystroke Level Model (KLM) and Fitts Law constitute core teaching
subjects in most HCI courses, as well as many courses on software design and
evaluation. The KLM Form Analyzer (KLM_FA) has been introduced as a
practitioner s tool to facilitate web form design and evaluation, based on
these established HCI predictive models. It was also hypothesized that KLMFA
can also be used for educational purposes, since it provides step by step
tracing of the KLM modeling for any web form filling task, according to various
interaction strategies or users characteristics. In our previous work, we found
that KLM-FA supports teaching and learning of HCI modeling in the context of
distance education. This paper reports a study investigating the learning
effectiveness of KLM-FA in the context of campus-based higher education.
Students of a software quality course completed a knowledge test after the
lecture- based instruction (pre-test condition) and after being involved in a
KLMFA mediated learning activity (post-test condition). They also provided
posttest ratings for their educational experience and the tool s usability.
Results showed that KLM-FA can significantly improve learning of the HCI
modeling. In addition, participating students rated their perceived educational
experience as very satisfactory and the perceived usability of KLM-FA as good
to excellent.
| cs.HC cs.CY | the keystroke level model klm and fitts law constitute core teaching subjects in most hci courses as well as many courses on software design and evaluation the klm form analyzer klm_fa has been introduced as a practitioner s tool to facilitate web form design and evaluation based on these established hci predictive models it was also hypothesized that klmfa can also be used for educational purposes since it provides step by step tracing of the klm modeling for any web form filling task according to various interaction strategies or users characteristics in our previous work we found that klmfa supports teaching and learning of hci modeling in the context of distance education this paper reports a study investigating the learning effectiveness of klmfa in the context of campusbased higher education students of a software quality course completed a knowledge test after the lecture based instruction pretest condition and after being involved in a klmfa mediated learning activity posttest condition they also provided posttest ratings for their educational experience and the tool s usability results showed that klmfa can significantly improve learning of the hci modeling in addition participating students rated their perceived educational experience as very satisfactory and the perceived usability of klmfa as good to excellent | [['the', 'keystroke', 'level', 'model', 'klm', 'and', 'fitts', 'law', 'constitute', 'core', 'teaching', 'subjects', 'in', 'most', 'hci', 'courses', 'as', 'well', 'as', 'many', 'courses', 'on', 'software', 'design', 'and', 'evaluation', 'the', 'klm', 'form', 'analyzer', 'klm_fa', 'has', 'been', 'introduced', 'as', 'a', 'practitioner', 's', 'tool', 'to', 'facilitate', 'web', 'form', 'design', 'and', 'evaluation', 'based', 'on', 'these', 'established', 'hci', 'predictive', 'models', 'it', 'was', 'also', 'hypothesized', 'that', 'klmfa', 'can', 'also', 'be', 'used', 'for', 'educational', 'purposes', 'since', 'it', 'provides', 'step', 'by', 'step', 'tracing', 'of', 'the', 'klm', 'modeling', 'for', 'any', 'web', 'form', 'filling', 'task', 'according', 'to', 'various', 'interaction', 'strategies', 'or', 'users', 'characteristics', 'in', 'our', 'previous', 'work', 'we', 'found', 'that', 'klmfa', 'supports', 'teaching', 'and', 'learning', 'of', 'hci', 'modeling', 'in', 'the', 'context', 'of', 'distance', 'education', 'this', 'paper', 'reports', 'a', 'study', 'investigating', 'the', 'learning', 'effectiveness', 'of', 'klmfa', 'in', 'the', 'context', 'of', 'campusbased', 'higher', 'education', 'students', 'of', 'a', 'software', 'quality', 'course', 'completed', 'a', 'knowledge', 'test', 'after', 'the', 'lecture', 'based', 'instruction', 'pretest', 'condition', 'and', 'after', 'being', 'involved', 'in', 'a', 'klmfa', 'mediated', 'learning', 'activity', 'posttest', 'condition', 'they', 'also', 'provided', 'posttest', 'ratings', 'for', 'their', 'educational', 'experience', 'and', 'the', 'tool', 's', 'usability', 'results', 'showed', 'that', 'klmfa', 'can', 'significantly', 'improve', 'learning', 'of', 'the', 'hci', 'modeling', 'in', 'addition', 'participating', 'students', 'rated', 'their', 'perceived', 'educational', 'experience', 'as', 'very', 'satisfactory', 'and', 'the', 'perceived', 'usability', 'of', 'klmfa', 'as', 'good', 'to', 'excellent']] | [-0.009567842060109464, 0.04357795907275342, -0.10070180261007897, 0.08624826921093301, -0.12388736831206011, -0.19331741312336995, 0.05597798813506393, 0.41185044271916876, -0.16029213909570855, -0.3961289517581463, 0.04971575950217013, -0.24238818924328903, -0.17150724308633405, 0.2247012202264514, -0.10384833024496712, 0.035527508558773596, 0.08945568847787998, 0.05182955401336275, -0.02607305870652653, -0.3221314956593077, 0.2636932001858041, 0.13408799337268604, 0.34794202345173536, 0.08319615793255408, 0.051965186560935364, 0.00623629604034671, -0.059206358841109294, -0.007213413569169039, -0.06986804757797495, 0.15225750109771402, 0.3943196749779795, 0.23248292939941875, 0.40650171804718854, -0.39284481771472024, -0.15611391159671745, 0.008703797726278625, 0.12821841354527305, 0.042826907859161135, -0.08846389733186764, -0.34058998867687656, 0.051101495838928514, -0.22954275712325442, -0.08575543249820973, -0.0843667073538754, -0.007419692105670437, -0.005506546220674021, -0.23160824666322186, -0.02477001834521638, 0.07751202095717351, 0.16405630662764717, -0.05027013347688608, -0.14756344242657465, 0.014643886307731453, 0.22176191989764027, 0.07584180972118658, 0.04774446960882193, 0.1689011510984018, -0.16667372529031482, -0.16216982938462823, 0.3883687664504822, -0.012110826836490049, -0.15669242108649598, 0.21549515634911454, -0.06559534612134463, -0.12827824359169093, 0.023948121177623186, 0.22322203915838787, 0.055635679116445624, -0.1665568254070311, 0.025978298499760015, 0.035380706368241366, 0.18298843941316237, 0.06216163941170657, -0.02466667073029207, 0.17107512300561478, 0.20127578886089528, -0.026747854022456833, 0.09378676661006288, 0.025201285805371475, -0.07153566703171946, -0.247039365568539, -0.20582030044936733, -0.15465937351308218, -0.005198883382240083, -0.03349596003429658, -0.11906058789776047, 0.3747426526541481, 0.18952585907607544, 0.07368380911648273, 0.02501686088422813, 0.287399101753651, 0.03392883227093191, 0.07620260197805559, 0.05565793091720879, 0.19605381688906628, 0.030358584986136455, 0.1862811426245948, -0.1596524459945901, 0.16330835954399733, 0.030926417695108527] |
1,802.01925 | Extended decay properties for generalized BBM equations | In this note we show that all small solutions of the BBM equation must decay
to zero as $t\to +\infty$ in large portions of the physical space, extending
previous known results, and only assuming data in the energy space. Our results
also include decay on the left portion of the physical line, unlike the
standard KdV dynamics.
| math.AP math-ph math.MP | in this note we show that all small solutions of the bbm equation must decay to zero as tto infty in large portions of the physical space extending previous known results and only assuming data in the energy space our results also include decay on the left portion of the physical line unlike the standard kdv dynamics | [['in', 'this', 'note', 'we', 'show', 'that', 'all', 'small', 'solutions', 'of', 'the', 'bbm', 'equation', 'must', 'decay', 'to', 'zero', 'as', 'tto', 'infty', 'in', 'large', 'portions', 'of', 'the', 'physical', 'space', 'extending', 'previous', 'known', 'results', 'and', 'only', 'assuming', 'data', 'in', 'the', 'energy', 'space', 'our', 'results', 'also', 'include', 'decay', 'on', 'the', 'left', 'portion', 'of', 'the', 'physical', 'line', 'unlike', 'the', 'standard', 'kdv', 'dynamics']] | [-0.0978905881771393, 0.10977062997980076, -0.0371188996278011, 0.06240161456649698, -0.07492497284782298, -0.07357856255482163, 0.020077787919721583, 0.28802045630781276, -0.28074839168734717, -0.2272603535338452, 0.12524209582255008, -0.31397199718967866, -0.07998055513752134, 0.206556687327592, -0.03586605797407397, 0.06583092288163148, 0.07738565307175904, 0.053780548372551015, -0.04191996070981156, -0.23111710475202193, 0.33630431097066193, -0.005436889794573449, 0.21931286506648912, 0.050434969578003676, 0.04603682526411783, -0.027444072602839584, -0.026640935131070905, -0.05105114056781882, -0.19146581246221964, 0.018329893729012264, 0.17437948129679026, 0.08981232176812594, 0.22761912638190807, -0.3939521448654041, -0.22677860570777403, 0.13488983513231864, 0.21794451523588546, 0.0953661408111976, -0.008157491318375003, -0.29868782375400005, 0.08793825612060334, -0.1168956712476517, -0.1602322392394407, -0.047662231450279556, 0.014067758993948238, 0.05598045360468524, -0.22732599128625894, 0.070065832120395, 0.08301453380600403, -0.050249591257357805, -0.11745322003078304, -0.13577867475779434, -0.04409915141418184, 0.10590964475679293, 0.12346123856606714, 0.008302567616562572, 0.06627873511854232, -0.10444918228721801, -0.05848169577585762, 0.3746960113282528, -0.1404495584337335, -0.25253915776939767, 0.2006828554889612, -0.22026139754687615, -0.17235199667578727, 0.13599820856593156, 0.11479683759573259, 0.1189356492362557, -0.08216455057590154, 0.17099382900408255, -0.08346672846298468, 0.15723720222319426, 0.05093077777705172, 0.065668130317997, 0.1037390463446316, 0.1413795091048406, 0.03892404202110412, 0.09009400296858266, -0.0682537981059827, -0.13577507258997412, -0.38872381959829416, -0.15343491564782566, -0.16263289999813169, 0.067286445334423, -0.07010335917150594, -0.14455713828404745, 0.3554341170708077, 0.15440262175214134, 0.2565646765655593, 0.10391427852670874, 0.28536798746178027, 0.08929651154597339, 0.06261566066460912, 0.0976328507163807, 0.2546038371755889, 0.07150728788161487, 0.15507943691326337, -0.20672857017141946, 0.010899519212870743, 0.05300289774803739] |
1,802.01926 | Ionization injection in a laser wakefield accelerator subject to a
transverse magnetic field | The effect of an external transverse magnetic field on ionization injection
of electrons in a laser wakefield accelerator (LWFA) is investigated by
theoretical analysis and particle-in-cell simulations. On application of a few
tens of Tesla magnetic field, both the electron trapping condition and the
wakefield structure changes significantly such that injection occurs over a
shorter distance and at an enhanced rate. Furthermore, beam loading is
compensated for, as a result of the intrinsic trapezoidal-shaped longitudinal
charge density profile of injected electrons. The nonlinear ionization
injection and consequent compensation of beam loading lead to a reduction in
the energy spread and an enhancement of both the charge and final peak energy
of the electron beam from a LWFA immersed in the magnetic field.
| physics.plasm-ph | the effect of an external transverse magnetic field on ionization injection of electrons in a laser wakefield accelerator lwfa is investigated by theoretical analysis and particleincell simulations on application of a few tens of tesla magnetic field both the electron trapping condition and the wakefield structure changes significantly such that injection occurs over a shorter distance and at an enhanced rate furthermore beam loading is compensated for as a result of the intrinsic trapezoidalshaped longitudinal charge density profile of injected electrons the nonlinear ionization injection and consequent compensation of beam loading lead to a reduction in the energy spread and an enhancement of both the charge and final peak energy of the electron beam from a lwfa immersed in the magnetic field | [['the', 'effect', 'of', 'an', 'external', 'transverse', 'magnetic', 'field', 'on', 'ionization', 'injection', 'of', 'electrons', 'in', 'a', 'laser', 'wakefield', 'accelerator', 'lwfa', 'is', 'investigated', 'by', 'theoretical', 'analysis', 'and', 'particleincell', 'simulations', 'on', 'application', 'of', 'a', 'few', 'tens', 'of', 'tesla', 'magnetic', 'field', 'both', 'the', 'electron', 'trapping', 'condition', 'and', 'the', 'wakefield', 'structure', 'changes', 'significantly', 'such', 'that', 'injection', 'occurs', 'over', 'a', 'shorter', 'distance', 'and', 'at', 'an', 'enhanced', 'rate', 'furthermore', 'beam', 'loading', 'is', 'compensated', 'for', 'as', 'a', 'result', 'of', 'the', 'intrinsic', 'trapezoidalshaped', 'longitudinal', 'charge', 'density', 'profile', 'of', 'injected', 'electrons', 'the', 'nonlinear', 'ionization', 'injection', 'and', 'consequent', 'compensation', 'of', 'beam', 'loading', 'lead', 'to', 'a', 'reduction', 'in', 'the', 'energy', 'spread', 'and', 'an', 'enhancement', 'of', 'both', 'the', 'charge', 'and', 'final', 'peak', 'energy', 'of', 'the', 'electron', 'beam', 'from', 'a', 'lwfa', 'immersed', 'in', 'the', 'magnetic', 'field']] | [-0.14618337085684302, 0.22508057679293475, -0.03577771876961543, 0.05135388627121622, 0.03835839230078654, -0.09045826482632366, -1.2523660695821536e-05, 0.40336762768689727, -0.25304744095678944, -0.34285208126377376, 0.0019040768460340065, -0.250405168313472, 0.03153101977754812, 0.25950979339874913, 0.04210559211167522, 0.0024822100874830463, 0.032240888951193605, -0.04095939655986722, -0.059728188328559466, -0.14970339863889348, 0.2750566531913584, 0.17521312308390855, 0.324325470772923, 0.1329593279429513, 0.13776316095647387, 0.02436894411984526, 0.059676765998611686, 0.01576606523184503, -0.08324152049752855, 0.03924710023724789, 0.14056799239402668, -1.0406329357599626e-05, 0.27782145364889416, -0.4728828918601035, -0.24588208709038092, -0.0028466721977580523, 0.15717513210399717, 0.12252739176428953, -0.15919158486725732, -0.21450949917532136, 0.026572878579380083, -0.1945097306056223, -0.1393090590307886, 0.001681695936522523, -0.012909134694367464, 0.09522877999993622, -0.314714678752591, 0.06988690547897007, 0.0780516675459679, 0.0811395787282801, -0.10734006839319606, -0.04141187308676785, -0.03243775118035493, 0.009809982620339964, 0.08441062172546555, 0.11519444854090326, 0.2627646503970027, -0.15102930610892593, -0.07900374359642079, 0.3482036363089182, -0.058387490012301285, -0.12878119647044872, 0.1262159179972454, -0.20970892771452543, 0.020115142775943777, 0.23847024658404778, 0.20461857634153766, 0.07901623634694022, -0.08698597200621362, 0.019576801999556054, 0.0342073162252343, 0.16128983715411704, 0.11027967709032666, 0.02481341036609145, 0.2031094631443533, 0.19013695139819603, 0.07111539348929388, 0.10980876864193649, -0.1838804737962477, -0.005115554973360945, -0.28991867061399046, -0.1368215588822228, -0.15848699459409127, 0.09816577537920418, -0.05685011329073039, -0.14584760702421248, 0.4759883290484975, 0.12544589634436293, 0.14445255583411723, -0.10024055215524372, 0.3605049336481778, 0.1518072939895811, 0.03742557421677792, 0.04761133698716027, 0.24865067326158408, 0.17370275333409244, 0.13544815298089696, -0.3107358369762536, 0.016995991904624416, -0.02079066721012541] |
1,802.01927 | Engineering topological phases in the Luttinger semimetal $\alpha$-Sn | $\alpha$-Sn is well known as a typical Luttinger semimetal with a quadratic
band touching at the $\Gamma$ point. Based on the effective $k\cdot p$ analysis
as well as first-principles calculations, we demonstrate that multiple
topological phases with a rich diagram, including topological insulator, Dirac
semimetal, and Weyl semimetal phases, can be induced and engineered in
$\alpha$-Sn by external strains, magnetic fields, and circularly polarized
light (CPL). Intriguingly, not only the conventional type-I Weyl nodes, but
also type-II Weyl nodes and double-Weyl nodes can be generated directly from
the quadratic semimetal by applying a magnetic field or CPL. Our results apply
equally well to other Luttinger semimetals with similar crystal and electronic
structures, and thus open an avenue for realizing and engineering multiple
topological phases on a versatile platform.
| cond-mat.mes-hall | alphasn is well known as a typical luttinger semimetal with a quadratic band touching at the gamma point based on the effective kcdot p analysis as well as firstprinciples calculations we demonstrate that multiple topological phases with a rich diagram including topological insulator dirac semimetal and weyl semimetal phases can be induced and engineered in alphasn by external strains magnetic fields and circularly polarized light cpl intriguingly not only the conventional typei weyl nodes but also typeii weyl nodes and doubleweyl nodes can be generated directly from the quadratic semimetal by applying a magnetic field or cpl our results apply equally well to other luttinger semimetals with similar crystal and electronic structures and thus open an avenue for realizing and engineering multiple topological phases on a versatile platform | [['alphasn', 'is', 'well', 'known', 'as', 'a', 'typical', 'luttinger', 'semimetal', 'with', 'a', 'quadratic', 'band', 'touching', 'at', 'the', 'gamma', 'point', 'based', 'on', 'the', 'effective', 'kcdot', 'p', 'analysis', 'as', 'well', 'as', 'firstprinciples', 'calculations', 'we', 'demonstrate', 'that', 'multiple', 'topological', 'phases', 'with', 'a', 'rich', 'diagram', 'including', 'topological', 'insulator', 'dirac', 'semimetal', 'and', 'weyl', 'semimetal', 'phases', 'can', 'be', 'induced', 'and', 'engineered', 'in', 'alphasn', 'by', 'external', 'strains', 'magnetic', 'fields', 'and', 'circularly', 'polarized', 'light', 'cpl', 'intriguingly', 'not', 'only', 'the', 'conventional', 'typei', 'weyl', 'nodes', 'but', 'also', 'typeii', 'weyl', 'nodes', 'and', 'doubleweyl', 'nodes', 'can', 'be', 'generated', 'directly', 'from', 'the', 'quadratic', 'semimetal', 'by', 'applying', 'a', 'magnetic', 'field', 'or', 'cpl', 'our', 'results', 'apply', 'equally', 'well', 'to', 'other', 'luttinger', 'semimetals', 'with', 'similar', 'crystal', 'and', 'electronic', 'structures', 'and', 'thus', 'open', 'an', 'avenue', 'for', 'realizing', 'and', 'engineering', 'multiple', 'topological', 'phases', 'on', 'a', 'versatile', 'platform']] | [-0.19406972357501218, 0.22397362458389125, -0.04899147499600076, 0.00895404081347806, -0.14310156137798913, -0.2851846513185592, 0.13638403332151938, 0.3939868933230173, -0.2907143573720532, -0.3083259046288731, -0.009091568267649563, -0.3208908185988548, -0.21233539566765103, 0.20531105768532143, 0.06974509310384747, 0.03805912590905791, -0.05601109864801401, -0.0571748163056327, -0.1228561460502533, -0.2309894182772041, 0.3116488159430446, -0.02391266421182081, 0.3364124987347168, 0.027122253666675533, 0.008344860772922402, 0.009272242372389883, 0.14753143827692838, 0.09143535348994192, -0.0862067001856417, 0.02236074784923403, 0.26901125456788577, -0.1270269291708246, 0.13339244474627776, -0.42990008312335704, -0.25419614988641115, 0.007575160339001741, 0.13334072347424808, 0.12610435111128027, -0.11455378888604173, -0.3760018464672612, 0.08817782989535772, -0.14280155221604218, -0.11110512217601354, -0.1470065796165727, -0.0725963304967081, -0.040209732139373955, -0.2114419148529123, 0.04534077211837939, -0.014093042478634743, 0.0879306592827902, -0.08660703020359506, -0.10636668559709506, -0.11457491279725218, 0.043596979603535146, 0.029955856528658842, 0.058630782121326774, 0.11552072644190048, -0.11476999563819845, -0.1825899110554019, 0.45556859286443796, -0.03932721507590031, -0.0961948049662169, 0.19127748258506472, -0.0942534062581899, -0.08020841630423092, 0.11366204226214904, 0.09228336116530045, 0.07742123906791676, -0.08672799644045881, 0.11873423145561901, -0.02520807380210499, 0.1065997639127545, -0.0027645464870147407, 0.056376433221885236, 0.3281764549028594, 0.13214770823833533, 0.06112093842239119, 0.11238538514271568, -0.08562227107904619, 0.009681921119408798, -0.2718935984166819, -0.2024196300044423, -0.2713226726882567, 0.07455078951636551, -0.0699325568751874, -0.22381801602568885, 0.4663851460609294, 0.06205575614967529, 0.17310845940664876, -0.07086021386021457, 0.24803140500443988, 0.08636608082633757, 0.07850469286859152, 0.0816004435528157, 0.21252447798178764, 0.1275715620831761, 0.06694255513548342, -0.2002802535371302, 0.004867175590334227, 0.013447529850964202] |
1,802.01928 | Computing Popov and Hermite forms of rectangular polynomial matrices | We consider the computation of two normal forms for matrices over the
univariate polynomials: the Popov form and the Hermite form. For matrices which
are square and nonsingular, deterministic algorithms with satisfactory cost
bounds are known. Here, we present deterministic, fast algorithms for
rectangular input matrices. The obtained cost bound for the Popov form matches
the previous best known randomized algorithm, while the cost bound for the
Hermite form improves on the previous best known ones by a factor which is at
least the largest dimension of the input matrix.
| cs.SC | we consider the computation of two normal forms for matrices over the univariate polynomials the popov form and the hermite form for matrices which are square and nonsingular deterministic algorithms with satisfactory cost bounds are known here we present deterministic fast algorithms for rectangular input matrices the obtained cost bound for the popov form matches the previous best known randomized algorithm while the cost bound for the hermite form improves on the previous best known ones by a factor which is at least the largest dimension of the input matrix | [['we', 'consider', 'the', 'computation', 'of', 'two', 'normal', 'forms', 'for', 'matrices', 'over', 'the', 'univariate', 'polynomials', 'the', 'popov', 'form', 'and', 'the', 'hermite', 'form', 'for', 'matrices', 'which', 'are', 'square', 'and', 'nonsingular', 'deterministic', 'algorithms', 'with', 'satisfactory', 'cost', 'bounds', 'are', 'known', 'here', 'we', 'present', 'deterministic', 'fast', 'algorithms', 'for', 'rectangular', 'input', 'matrices', 'the', 'obtained', 'cost', 'bound', 'for', 'the', 'popov', 'form', 'matches', 'the', 'previous', 'best', 'known', 'randomized', 'algorithm', 'while', 'the', 'cost', 'bound', 'for', 'the', 'hermite', 'form', 'improves', 'on', 'the', 'previous', 'best', 'known', 'ones', 'by', 'a', 'factor', 'which', 'is', 'at', 'least', 'the', 'largest', 'dimension', 'of', 'the', 'input', 'matrix']] | [-0.10715705247388946, 0.05333985947072506, -0.006198564197661148, 0.07145314669986773, -0.054212036113151243, -0.15225940921550823, 0.06203249466036343, 0.3364069621285631, -0.23586212296504527, -0.28592258823725086, 0.12621675843579902, -0.2632804285734892, -0.17640034204555882, 0.22016544287196463, -0.03979471277723658, 0.1283485498533183, 0.03919987818484919, 0.06881390721019771, -0.127504879390795, -0.35143555347135086, 0.2949678209959529, 0.04551706536569529, 0.22638072778677776, -0.037965200652575325, 0.08808402207990487, -0.017046285265435775, -0.03027244591050678, -0.055610873306997946, -0.1082767287372715, 0.11249714422091428, 0.22696152183537682, 0.15552123045393576, 0.23977332449414665, -0.4104587382533484, -0.12582901004287933, 0.13468088227091357, 0.15364532272020975, 0.10729812482475407, -0.008174450039708367, -0.21891856607463625, 0.044500043344063066, -0.10854113689727253, -0.12064637348521501, -0.07350276014250186, -0.012905601769064863, 0.03192730614747335, -0.3462257193194495, 0.0843389770662826, 0.07773980307910178, -0.013368342071771622, -0.02063647082282437, -0.27601191596024566, 0.09694917727158302, 0.0795872058861682, -0.04267623717249888, 0.022897512869288525, 0.04027323427500151, -0.10757756011250118, -0.1291679488081071, 0.34085986820153064, -0.056105177477002145, -0.21155213307485812, 0.12497743086682425, -0.14270311833566263, -0.11073521828899781, 0.16092736328848534, 0.15741861357043188, 0.09580352182189623, -0.11439534215670492, 0.127439848440958, -0.12024648626748886, 0.12362599294089402, 0.11808637159152163, 0.030637311055842373, 0.04220828214246366, 0.09786302335560322, 0.1187225566426706, 0.12577577192957204, 0.009222902559364836, -0.12730104084023172, -0.25764131574994986, -0.14561099305153927, -0.24682145190114776, 0.001682896384348472, -0.1708940705022542, -0.19075426392826356, 0.38592483876273037, 0.050477665279888444, 0.2052523148763511, 0.19461324045486333, 0.33289758692392046, 0.14071965069613523, 0.048727998675571545, 0.1783379560802132, 0.1941218481036938, 0.13747787060888692, 0.015656694491756044, -0.16983865533127554, 0.1097716996860173, 0.1678046441430019] |
1,802.01929 | Propagation of chaos for the VPFP equation with a polynomial cut-off | We consider a $N$-particle system interacting through the Newtonian potential
with a polynomial cut-off in the presence of noise in velocity. We rigorously
prove the propagation of chaos for this interacting stochastic particle system.
Taking the cut-off like $N^{-\delta}$ with $\delta < 1/d$ in the force, we
provide a quantitative error estimate between the empirical measure associated
to that $N$-particle system and the solutions of the $d$-dimensional
Vlasov-Poisson-Fokker-Planck system. We also study the propagation of chaos for
the Vlasov-Fokker-Planck equation with less singular interaction forces than
the Newtonian one.
| math.AP | we consider a nparticle system interacting through the newtonian potential with a polynomial cutoff in the presence of noise in velocity we rigorously prove the propagation of chaos for this interacting stochastic particle system taking the cutoff like ndelta with delta 1d in the force we provide a quantitative error estimate between the empirical measure associated to that nparticle system and the solutions of the ddimensional vlasovpoissonfokkerplanck system we also study the propagation of chaos for the vlasovfokkerplanck equation with less singular interaction forces than the newtonian one | [['we', 'consider', 'a', 'nparticle', 'system', 'interacting', 'through', 'the', 'newtonian', 'potential', 'with', 'a', 'polynomial', 'cutoff', 'in', 'the', 'presence', 'of', 'noise', 'in', 'velocity', 'we', 'rigorously', 'prove', 'the', 'propagation', 'of', 'chaos', 'for', 'this', 'interacting', 'stochastic', 'particle', 'system', 'taking', 'the', 'cutoff', 'like', 'ndelta', 'with', 'delta', '1d', 'in', 'the', 'force', 'we', 'provide', 'a', 'quantitative', 'error', 'estimate', 'between', 'the', 'empirical', 'measure', 'associated', 'to', 'that', 'nparticle', 'system', 'and', 'the', 'solutions', 'of', 'the', 'ddimensional', 'vlasovpoissonfokkerplanck', 'system', 'we', 'also', 'study', 'the', 'propagation', 'of', 'chaos', 'for', 'the', 'vlasovfokkerplanck', 'equation', 'with', 'less', 'singular', 'interaction', 'forces', 'than', 'the', 'newtonian', 'one']] | [-0.17354401961942625, 0.09847869620319795, -0.11275033064355905, 0.0828720247518504, 0.007017308142332529, -0.13475506973389367, -0.001100889904509214, 0.2909758731706957, -0.2688276450234381, -0.23565769370708783, 0.05110565049240408, -0.3194318408813243, -0.156102563210218, 0.16041168110810264, 0.027433614955622364, 0.08538768402385441, 0.07005503581074829, 0.07959468946401929, -0.0402432141259355, -0.16103633488158017, 0.34600126585626806, 0.0428377844880081, 0.1565426729714752, 0.016777648040178148, 0.11905358303126624, 0.02775766687806357, 0.03224087429275228, 0.0013986395841295068, -0.16435191036634933, 0.07779759436380118, 0.12338948997057742, 0.024270956989229573, 0.2850891054099934, -0.4301873936042698, -0.23912726041056553, 0.14761346618814225, 0.16945842807134878, 0.12084077602379363, -0.017673505721507932, -0.31452275353314524, 0.011401459090517495, -0.17871567530726845, -0.23089195400561122, -0.0347215825882317, 0.028219533438624985, 0.09204507049501197, -0.28021679228087043, 0.14854864633492648, 0.06032279326940294, 0.057263108721764926, -0.08287019601530946, -0.04677414189262146, 0.03280266420915723, 0.08336776462701065, 0.025660909356454133, 0.025292496982729062, 0.09014933364233002, -0.15266474810249003, -0.06255703516283327, 0.3912572786026761, -0.13617051088212148, -0.28119024744426663, 0.2131887987806377, -0.1773059551137108, -0.09566929407248442, 0.11959060959369791, 0.19505512866784225, 0.050253027788130566, -0.1610464250605384, 0.09128221613288835, -0.010083831402219155, 0.14784035735118034, 0.05577976503197781, 0.027049619741526178, 0.14068843619051305, 0.1812498435293409, 0.09036756131205369, 0.15496235324958849, -0.08363150366626955, -0.16161467098969629, -0.32608998502308334, -0.15899530168495735, -0.16999715505781668, 0.07416991298404438, -0.14872829578482857, -0.19110686730974438, 0.34938474016433413, 0.20633723548698155, 0.13967671661256728, 0.09802556763381952, 0.27975731425579975, 0.19748820654455235, -0.03125690659164155, 0.08595275977330114, 0.27751523127186706, 0.1270928808900697, 0.10387019326762212, -0.28695302438625897, -0.001743810219605538, 0.10586731632197784] |
1,802.0193 | Code Reuse With Transformation Objects | We present an approach for a lightweight datatype-generic programming in
Objective Caml programming language aimed at better code reuse. We show, that a
large class of transformations usually expressed via recursive functions with
pattern matching can be implemented using the single per-type traversal
function and the set of object-encoded transformations, which we call
transformation objects. Object encoding allows transformations to be modified,
inherited and extended in a conventional object-oriented manner. However, the
data representation is kept untouched which preserves the ability to construct
and pattern-match it in the usual way. Our approach equally works for regular
and polymorphic variant types which makes it possible to combine data types and
their transformations from statically typed and separately compiled components.
We also present an implementation which allows us to automatically derive most
functionality from a slightly augmented type descriptions.
| cs.PL | we present an approach for a lightweight datatypegeneric programming in objective caml programming language aimed at better code reuse we show that a large class of transformations usually expressed via recursive functions with pattern matching can be implemented using the single pertype traversal function and the set of objectencoded transformations which we call transformation objects object encoding allows transformations to be modified inherited and extended in a conventional objectoriented manner however the data representation is kept untouched which preserves the ability to construct and patternmatch it in the usual way our approach equally works for regular and polymorphic variant types which makes it possible to combine data types and their transformations from statically typed and separately compiled components we also present an implementation which allows us to automatically derive most functionality from a slightly augmented type descriptions | [['we', 'present', 'an', 'approach', 'for', 'a', 'lightweight', 'datatypegeneric', 'programming', 'in', 'objective', 'caml', 'programming', 'language', 'aimed', 'at', 'better', 'code', 'reuse', 'we', 'show', 'that', 'a', 'large', 'class', 'of', 'transformations', 'usually', 'expressed', 'via', 'recursive', 'functions', 'with', 'pattern', 'matching', 'can', 'be', 'implemented', 'using', 'the', 'single', 'pertype', 'traversal', 'function', 'and', 'the', 'set', 'of', 'objectencoded', 'transformations', 'which', 'we', 'call', 'transformation', 'objects', 'object', 'encoding', 'allows', 'transformations', 'to', 'be', 'modified', 'inherited', 'and', 'extended', 'in', 'a', 'conventional', 'objectoriented', 'manner', 'however', 'the', 'data', 'representation', 'is', 'kept', 'untouched', 'which', 'preserves', 'the', 'ability', 'to', 'construct', 'and', 'patternmatch', 'it', 'in', 'the', 'usual', 'way', 'our', 'approach', 'equally', 'works', 'for', 'regular', 'and', 'polymorphic', 'variant', 'types', 'which', 'makes', 'it', 'possible', 'to', 'combine', 'data', 'types', 'and', 'their', 'transformations', 'from', 'statically', 'typed', 'and', 'separately', 'compiled', 'components', 'we', 'also', 'present', 'an', 'implementation', 'which', 'allows', 'us', 'to', 'automatically', 'derive', 'most', 'functionality', 'from', 'a', 'slightly', 'augmented', 'type', 'descriptions']] | [-0.06118902898635025, 0.02448533676689732, -0.11758245778856453, 0.08351240755334773, -0.16971209977787954, -0.17284892261269744, 0.052584996415384076, 0.40233560658439443, -0.33116958363033416, -0.33546479190872225, 0.07217470158012239, -0.21765673621751677, -0.1655310791787795, 0.17851317362273456, -0.07444380010236744, 0.029192750520909343, 0.039040515674450604, -0.0018249207900630103, -0.09394237489430923, -0.21344926132372133, 0.29722740691569116, 0.029863395590197156, 0.2915628019306395, -0.044712202568297034, 0.1231159908162361, 0.05549029457486338, -0.045658161092109774, 0.03071051250660309, -0.05975370086687488, 0.1410348887814002, 0.2881388101019655, 0.22475943591583658, 0.21510815812205827, -0.4178002738937115, -0.12983925225454623, 0.048150941485504584, 0.13713030478813582, 0.1471330771136477, -0.03910174392577675, -0.2767270716528098, 0.09360468007141241, -0.18565163616504934, -0.08309913728282683, -0.14524006576630874, -0.01585704729443899, -0.027400215858317634, -0.2726537666654352, -0.03155485998369706, 0.06639551607271035, 0.0318558709833909, -0.043487409856687816, -0.06589535423726947, 0.00041860100916690297, 0.10522734795317605, -0.026941999491235172, 0.04549019672838902, 0.12160874469964593, -0.05546715104935208, -0.10526760999044335, 0.4008682712291678, -0.05689395873169242, -0.2532058706731294, 0.2435196382523928, -0.020381243763215564, -0.18017685743807643, 0.08912542590319558, 0.15743573589457405, 0.14886565680650096, -0.20871785010590596, 0.0644282319470895, 0.0027897282262091283, 0.21357137034819634, 0.07689302798912481, 0.037919978931960134, 0.19902536593317227, 0.1419583150392605, 0.02815930832870503, 0.1922690192565184, -0.016358502730037326, -0.07076018531332483, -0.2881323990791484, -0.1317524198623788, -0.11035517143189079, -0.03901558142086422, -0.05773419577011804, -0.1739469541443719, 0.3927729203262263, 0.1748469090089202, 0.1631500495114812, 0.13112787759207464, 0.29627587199556055, 0.09382017391779097, 0.17651782747599537, 0.10944060528719866, 0.11848307992331683, 0.037636390057633876, 0.09075544464263927, -0.15207570831256884, 0.07913219384262683, 0.0769927696497352] |
1,802.01931 | Sharp quantization for Lane-Emden problems in dimension two | In this short note, we prove a sharp quantization for positive solutions of
Lane-Emden problems in a bounded planar domain. This result has been
conjectured by De Marchis, Ianni and Pacella [6, Remark 1.2].
| math.AP | in this short note we prove a sharp quantization for positive solutions of laneemden problems in a bounded planar domain this result has been conjectured by de marchis ianni and pacella 6 remark 12 | [['in', 'this', 'short', 'note', 'we', 'prove', 'a', 'sharp', 'quantization', 'for', 'positive', 'solutions', 'of', 'laneemden', 'problems', 'in', 'a', 'bounded', 'planar', 'domain', 'this', 'result', 'has', 'been', 'conjectured', 'by', 'de', 'marchis', 'ianni', 'and', 'pacella', '6', 'remark', '12']] | [-0.16262653676764757, 0.07038864149062922, -0.09158182073610299, 0.0750062627873073, -0.052548871375620365, -0.14399328379129822, -0.02357197440031803, 0.28209195161859196, -0.2170123364494154, -0.2829672885550694, 0.13691409239122135, -0.2561820409627575, -0.1992044925238147, 0.16630381475569625, -0.18099757396813596, 0.0807270494317918, 0.041367783973162826, 0.007217679469084198, -0.04777887345037677, -0.2934529788679246, 0.29771980663027725, -0.09948955069888722, 0.18157709574778425, 0.158260605213317, 0.10227367361287841, -0.02272969168243986, 0.004393184839776068, 0.01009474474598061, -0.2551403097018148, 0.056721763840566077, 0.2778828778501713, 0.06747228580273011, 0.3067876163757209, -0.35334948337439337, -0.1980211086232554, 0.12495392263217857, 0.19036898942607822, 0.12719918953988588, -0.09994129363489761, -0.26588120068790333, 0.15369449053524117, -0.1494888612492518, -0.19579102512392582, 0.03392869149419395, 0.11693271102778839, 0.0035824903823209533, -0.24290367249738087, 0.08174944412189, 0.21601460428174699, 0.06303548100263331, -0.1069799992396976, -0.11883856399182344, 0.10223012727995713, 0.0006758646446872841, 0.001452849613446178, 0.09947089222965366, -0.07496066677920295, -0.04746653294811646, -0.14497853341427716, 0.26447408217372315, -0.07903172558342869, -0.2196020774373954, 0.12314126629269484, -0.16080712658268484, -0.19881304545384465, 0.09271057974547148, 0.06295990907220227, 0.19083470683262654, -0.08378776323727587, 0.2193960763609291, -0.08115235318175772, 0.1555839232310201, 0.24451047134105908, -0.06491688969121738, 0.09573612387546084, 0.08145000527358869, 0.13196040225695027, 0.1632659271020781, 0.0031335727650333533, -0.02096781126138839, -0.2790794793347066, -0.15980787140627703, -0.19106176382664478, 0.15116065066082007, -0.06829665572987517, -0.16742271393763297, 0.3186470458114689, 0.03463099103872523, 0.1784568287319306, 0.11062033437756878, 0.14514883280251967, 0.12358405031828266, -0.0273799668771751, 0.10927854531980825, 0.23456251062452793, 0.13970586071214217, 0.1976596387949857, -0.12131796698844427, -0.024191717631324675, 0.13239037828426456] |
1,802.01932 | When does a perturbed Moser-Trudinger inequality admit an extremal? | In this paper, we are interested in several questions raised mainly in [17].
We consider the perturbed Moser-Trudinger inequality $I\_\alpha^g(\Omega)$
below, at the critical level $\alpha=4\pi$, where $g$, satisfying $g(t)\to 0$
as $t\to +\infty$, can be seen as a perturbation with respect to the original
case $g\equiv 0$. Under some additional assumptions, ensuring basically that
$g$ does not oscillates too fast as $t\to +\infty$, we identify a new condition
on $g$ for this inequality to have an extremal. This condition covers the case
$g\equiv 0$ studied in [3,12,23]. We prove also that this condition is sharp in
the sense that, if it is not satisfied, $I\_{4\pi}^g(\Omega)$ may have no
extremal.
| math.AP | in this paper we are interested in several questions raised mainly in 17 we consider the perturbed mosertrudinger inequality i_alphagomega below at the critical level alpha4pi where g satisfying gtto 0 as tto infty can be seen as a perturbation with respect to the original case gequiv 0 under some additional assumptions ensuring basically that g does not oscillates too fast as tto infty we identify a new condition on g for this inequality to have an extremal this condition covers the case gequiv 0 studied in 31223 we prove also that this condition is sharp in the sense that if it is not satisfied i_4pigomega may have no extremal | [['in', 'this', 'paper', 'we', 'are', 'interested', 'in', 'several', 'questions', 'raised', 'mainly', 'in', '17', 'we', 'consider', 'the', 'perturbed', 'mosertrudinger', 'inequality', 'i_alphagomega', 'below', 'at', 'the', 'critical', 'level', 'alpha4pi', 'where', 'g', 'satisfying', 'gtto', '0', 'as', 'tto', 'infty', 'can', 'be', 'seen', 'as', 'a', 'perturbation', 'with', 'respect', 'to', 'the', 'original', 'case', 'gequiv', '0', 'under', 'some', 'additional', 'assumptions', 'ensuring', 'basically', 'that', 'g', 'does', 'not', 'oscillates', 'too', 'fast', 'as', 'tto', 'infty', 'we', 'identify', 'a', 'new', 'condition', 'on', 'g', 'for', 'this', 'inequality', 'to', 'have', 'an', 'extremal', 'this', 'condition', 'covers', 'the', 'case', 'gequiv', '0', 'studied', 'in', '31223', 'we', 'prove', 'also', 'that', 'this', 'condition', 'is', 'sharp', 'in', 'the', 'sense', 'that', 'if', 'it', 'is', 'not', 'satisfied', 'i_4pigomega', 'may', 'have', 'no', 'extremal']] | [-0.15405236337378267, 0.1253616669227735, -0.05118597626597399, 0.08349624544692537, -0.062279347991127346, -0.20649087903577656, 0.022655232194145874, 0.34721564719719544, -0.28207060449889726, -0.24320790348851698, 0.14188851668787678, -0.2867065063544682, -0.11448795377779919, 0.17454932098986492, -0.1392561586884161, 0.01982811845927721, 0.038589042664638584, 0.11927782710464228, -0.06069473369446184, -0.24157866289661753, 0.3153865118244929, -0.02416426838109536, 0.18986884202985538, 0.11125620100813519, 0.026575719032968792, -0.038217574380160796, 0.08385441688199838, 0.005296143193152689, -0.2288115445956161, -0.019811029874143148, 0.25522441964685205, 0.11151645527930841, 0.3179013329779818, -0.35178438551901353, -0.15769449246914258, 0.1875193445876773, 0.18814117832641516, 0.01697072631989916, -0.012591202032663638, -0.23388853425692235, 0.16396809044027968, -0.0805337609191026, -0.19206411010984864, -0.05321692106358352, 0.03041636345996743, -0.001718935523448246, -0.3022342291438863, 0.08800558449805802, 0.1556837027936819, 0.02574172896732177, -0.03424106923685897, -0.11162262294397113, -0.01500891832013925, 0.05817970012181572, 0.09031815571333504, 0.07955299610344116, 0.05853648684209301, -0.09919672234072571, -0.02775180553463066, 0.3452755171983015, -0.10725266791525341, -0.23310519447993663, 0.14328025469024266, -0.18790152322589643, -0.24589931617623995, 0.04065615523695236, 0.09516165181107464, 0.1770857944641085, -0.10463087922405628, 0.1892256726200382, -0.08006471745847236, 0.11908698536544329, 0.13490742464948977, 0.028416246250050053, 0.09698046758061364, 0.07503448017551342, 0.15468675302385929, 0.1335474303335927, -0.007597824543093642, 0.0001350868582015946, -0.3954917802231475, -0.12698579910433008, -0.1676867197755547, 0.1497747093308828, -0.04380128565909607, -0.15921332992258527, 0.2908726958646661, 0.1486732503277294, 0.21932484174945524, 0.07484288933088205, 0.19587445585500626, 0.15503737648971203, 0.0059914463792838865, 0.11957339624918642, 0.24110557053021953, 0.11917454529376258, 0.10386341924202584, -0.12405600384587333, 0.06921868540701412, 0.05905977970964852] |
1,802.01933 | A Survey Of Methods For Explaining Black Box Models | In the last years many accurate decision support systems have been
constructed as black boxes, that is as systems that hide their internal logic
to the user. This lack of explanation constitutes both a practical and an
ethical issue. The literature reports many approaches aimed at overcoming this
crucial weakness sometimes at the cost of scarifying accuracy for
interpretability. The applications in which black box decision systems can be
used are various, and each approach is typically developed to provide a
solution for a specific problem and, as a consequence, delineating explicitly
or implicitly its own definition of interpretability and explanation. The aim
of this paper is to provide a classification of the main problems addressed in
the literature with respect to the notion of explanation and the type of black
box system. Given a problem definition, a black box type, and a desired
explanation this survey should help the researcher to find the proposals more
useful for his own work. The proposed classification of approaches to open
black box models should also be useful for putting the many research open
questions in perspective.
| cs.CY cs.AI cs.LG | in the last years many accurate decision support systems have been constructed as black boxes that is as systems that hide their internal logic to the user this lack of explanation constitutes both a practical and an ethical issue the literature reports many approaches aimed at overcoming this crucial weakness sometimes at the cost of scarifying accuracy for interpretability the applications in which black box decision systems can be used are various and each approach is typically developed to provide a solution for a specific problem and as a consequence delineating explicitly or implicitly its own definition of interpretability and explanation the aim of this paper is to provide a classification of the main problems addressed in the literature with respect to the notion of explanation and the type of black box system given a problem definition a black box type and a desired explanation this survey should help the researcher to find the proposals more useful for his own work the proposed classification of approaches to open black box models should also be useful for putting the many research open questions in perspective | [['in', 'the', 'last', 'years', 'many', 'accurate', 'decision', 'support', 'systems', 'have', 'been', 'constructed', 'as', 'black', 'boxes', 'that', 'is', 'as', 'systems', 'that', 'hide', 'their', 'internal', 'logic', 'to', 'the', 'user', 'this', 'lack', 'of', 'explanation', 'constitutes', 'both', 'a', 'practical', 'and', 'an', 'ethical', 'issue', 'the', 'literature', 'reports', 'many', 'approaches', 'aimed', 'at', 'overcoming', 'this', 'crucial', 'weakness', 'sometimes', 'at', 'the', 'cost', 'of', 'scarifying', 'accuracy', 'for', 'interpretability', 'the', 'applications', 'in', 'which', 'black', 'box', 'decision', 'systems', 'can', 'be', 'used', 'are', 'various', 'and', 'each', 'approach', 'is', 'typically', 'developed', 'to', 'provide', 'a', 'solution', 'for', 'a', 'specific', 'problem', 'and', 'as', 'a', 'consequence', 'delineating', 'explicitly', 'or', 'implicitly', 'its', 'own', 'definition', 'of', 'interpretability', 'and', 'explanation', 'the', 'aim', 'of', 'this', 'paper', 'is', 'to', 'provide', 'a', 'classification', 'of', 'the', 'main', 'problems', 'addressed', 'in', 'the', 'literature', 'with', 'respect', 'to', 'the', 'notion', 'of', 'explanation', 'and', 'the', 'type', 'of', 'black', 'box', 'system', 'given', 'a', 'problem', 'definition', 'a', 'black', 'box', 'type', 'and', 'a', 'desired', 'explanation', 'this', 'survey', 'should', 'help', 'the', 'researcher', 'to', 'find', 'the', 'proposals', 'more', 'useful', 'for', 'his', 'own', 'work', 'the', 'proposed', 'classification', 'of', 'approaches', 'to', 'open', 'black', 'box', 'models', 'should', 'also', 'be', 'useful', 'for', 'putting', 'the', 'many', 'research', 'open', 'questions', 'in', 'perspective']] | [-0.07845460093623209, -0.019808073357837755, -0.07157743152777624, 0.11198573118156713, -0.13945718606650506, -0.1685952084295897, 0.06771928992226173, 0.3510834811680505, -0.23251083731884137, -0.3357899258126449, 0.15188917280655637, -0.264782922818204, -0.1397914504214777, 0.22054382673155962, -0.13897351802670924, 0.07997842620439453, 0.06036841099494663, 0.05191422016113116, -0.034103385948781026, -0.2664384666081194, 0.3108192778062126, 0.09050758687890662, 0.2641976003487007, 0.07138035550926124, 0.08045612490715702, -0.02364319960029009, -0.029104430155079488, 0.05586592712611689, -0.10519304512482726, 0.157922206285192, 0.30971140797217467, 0.1993598624869027, 0.37081607267179567, -0.3931142808869481, -0.23701316006506956, 0.10019156675148026, 0.17012433155880147, 0.14144514104207148, -0.060809383116065874, -0.26271775575941836, 0.09649863201965396, -0.2041217704485778, -0.1366920183291254, -0.07822166515056185, 0.04195841229470123, -0.03082997527520132, -0.21071146679921937, 0.007395343337323183, 0.10976269462907626, 0.03962629937703478, -0.07287997842333584, -0.09745331246054063, 0.042405219546787484, 0.16762879975367864, 0.07149523004773073, 0.05104901629079984, 0.10833960484318517, -0.1581994414623098, -0.16161030266242882, 0.397725604752929, 0.04210479325316239, -0.21605895865587113, 0.22922392224174234, -0.08775481482102211, -0.16360733482250236, 0.06307407021433944, 0.17946183505852747, 0.10777748074969681, -0.18660506088243614, 0.04857792192880246, -0.028061918056387778, 0.15067848425140887, 0.05621062192063698, 0.06141262929684118, 0.29795833101050684, 0.19500082581931644, 0.03312672347459264, 0.12261396025955353, -0.004447744222884269, -0.07309007813708614, -0.2813881771011359, -0.1688941379371776, -0.13722670795497202, 0.00879320759407204, -0.044049063580567475, -0.15834825938446043, 0.36034925971888815, 0.20525107069743567, 0.20881497212964029, 0.0273760681656827, 0.31539201297108893, 0.08797843689060993, 0.05484003633002588, 0.03491999687242281, 0.20748396245914552, 0.08145429711642108, 0.12154636851957311, -0.15292653610769144, 0.09813597101120926, 0.057127926817528256] |
1,802.01934 | Synthesis of Membrane-Electrode Assembly for Fuel Cells by Means of
(Sub)-Atmospheric Plasma Processes | An easy procedure to build up membrane-electrode assemblies for applications
dedicated to miniaturized PEMFC using H2 or CH3OH by a two-steps atmospheric
plasma process is reported. Firstly, catalyst nanoparticles are grafted on
carbon substrates by spraying a Pt colloidal solution in the post-discharge of
an RF atmospheric plasma torch. In the second step, the resulting decorated
electrodes are covered by plasma synthesized polymeric membranes in the
discharge of a DBD. The sulfonated polystyrene membranes are synthesized by
injecting simultaneously styrene and trifluoromethanesulfonic acid monomers, in
the presence of a carrier gas (Ar or He). The membranes are chemically
characterized by XPS, ToF-SIMS, and FTIR (IRRAS) and their deposition rate is
investigated by SEM.
| physics.app-ph physics.plasm-ph | an easy procedure to build up membraneelectrode assemblies for applications dedicated to miniaturized pemfc using h2 or ch3oh by a twosteps atmospheric plasma process is reported firstly catalyst nanoparticles are grafted on carbon substrates by spraying a pt colloidal solution in the postdischarge of an rf atmospheric plasma torch in the second step the resulting decorated electrodes are covered by plasma synthesized polymeric membranes in the discharge of a dbd the sulfonated polystyrene membranes are synthesized by injecting simultaneously styrene and trifluoromethanesulfonic acid monomers in the presence of a carrier gas ar or he the membranes are chemically characterized by xps tofsims and ftir irras and their deposition rate is investigated by sem | [['an', 'easy', 'procedure', 'to', 'build', 'up', 'membraneelectrode', 'assemblies', 'for', 'applications', 'dedicated', 'to', 'miniaturized', 'pemfc', 'using', 'h2', 'or', 'ch3oh', 'by', 'a', 'twosteps', 'atmospheric', 'plasma', 'process', 'is', 'reported', 'firstly', 'catalyst', 'nanoparticles', 'are', 'grafted', 'on', 'carbon', 'substrates', 'by', 'spraying', 'a', 'pt', 'colloidal', 'solution', 'in', 'the', 'postdischarge', 'of', 'an', 'rf', 'atmospheric', 'plasma', 'torch', 'in', 'the', 'second', 'step', 'the', 'resulting', 'decorated', 'electrodes', 'are', 'covered', 'by', 'plasma', 'synthesized', 'polymeric', 'membranes', 'in', 'the', 'discharge', 'of', 'a', 'dbd', 'the', 'sulfonated', 'polystyrene', 'membranes', 'are', 'synthesized', 'by', 'injecting', 'simultaneously', 'styrene', 'and', 'trifluoromethanesulfonic', 'acid', 'monomers', 'in', 'the', 'presence', 'of', 'a', 'carrier', 'gas', 'ar', 'or', 'he', 'the', 'membranes', 'are', 'chemically', 'characterized', 'by', 'xps', 'tofsims', 'and', 'ftir', 'irras', 'and', 'their', 'deposition', 'rate', 'is', 'investigated', 'by', 'sem']] | [-0.015884423554896124, 0.2528794253459306, 0.011926124498925425, -0.08994081353876854, 0.07953225909308954, -0.18643857418474827, 0.03819113541050518, 0.5025313244539905, -0.20835074261677536, -0.2994132207367908, 0.057208503439853134, -0.29679412110285325, -0.06747834990012713, 0.15938215995292096, -0.03734092752406882, 0.0779380224978509, 0.022770936562764375, -0.14651523252779788, 0.02675504102265801, -0.1873265902384777, 0.197168991596184, 0.13229807794771412, 0.2777918667447838, 0.08202557136008347, 0.09338084268383681, -0.07047313095853579, 0.0303427830084481, -0.0006374343753453683, -0.1552235395087998, 0.10153583119284701, 0.23571544216564772, -0.03148997490167279, 0.18073599810119378, -0.5367891328239983, -0.28187441676378844, -0.03510096982883459, 0.13130502782931383, 0.044283522585068236, -0.1332153660255823, -0.24878457403657112, 0.07460282320495357, -0.12963064302351665, -0.07227933439267376, -0.011075026583222842, -0.03693432163404809, 0.09045011675916612, -0.25113615242933685, 0.03532753660428253, 0.025100464691323314, 0.10492400519380515, -0.08188658453608778, -0.12988207932900298, -0.0909980022771792, 0.06431681498414202, 0.012733020728443411, -0.027257392123680224, 0.3583375225774944, -0.07194790136577053, -0.015208785693076524, 0.3627410408617421, -0.060006048166277734, -0.14228023984892801, 0.20781098939478398, -0.08033449698070233, -0.05632063775238666, 0.2563944678324994, 0.08771530109542337, 0.15667163976044818, -0.2545300124551762, 0.022605057899438015, 0.010950166097080166, 0.20612432667138902, 0.20666460661556232, -0.10166042288130318, 0.23079232633198526, 0.23394288938619534, -0.008586780622400429, 0.2029916451926428, -0.11072105755817822, 0.041987021834674204, -0.13969417557289654, -0.25811606017788025, -0.18138052320785142, 0.043136245154098356, -0.04614105215732707, -0.18814496578733353, 0.3103701802986589, -0.0009031848241151734, 0.13261200469833884, -0.08017174397087233, 0.26520708220460537, -0.0027794900519604033, 0.03962735701352358, -0.04966058395802975, 0.2003171494886787, 0.20554957808417385, 0.18545237474397502, -0.2296327095587251, 0.1150254319972274, 0.04744864034847441] |
1,802.01935 | Manipulation of two quantum systems through their mutual interaction in
presence of a radiation field | In cavity QED, the mutual interaction between natural atomic systems in
presence of a radiation field was ignored due to its negligible impact compared
with the coupling to the field. The newly engineered artificial atomic systems
(such as quantum dots and superconducting circuits) proposed for quantum
information processing enjoy strong interaction with same type of systems or
even with other types in hybrid structures, which is coherently controllable
and moreover they can be efficiently coupled to radiation fields. We present an
exact analytic solution for the time evolution of a composite system of two
interacting two-level quantum systems coupled to a single mode radiation field,
which can be realized in cavity (circuit) QED. We show how the non-classical
dynamical properties of the composite system are affected and can be tuned by
introducing and varying the mutual coupling between the two systems.
Particularly, the collapse-revival pattern shows a splitting during the revival
intervals as the coupling ratio (system-system to system-field) increases,
which is a sign of an interruption in the system-radiation energy exchange
process. Furthermore, the time evolution of the bipartite entanglement between
the two systems is found to vary significantly depending on the coupling ratio
as well as the initial state of the composite system resulting in either an
oscillatory behavior or a collapse-revival like pattern. Increasing the
coupling ratio enhances the entanglement, raises its oscillation average value
and emphasizes the collapse-revival like pattern. However, raising the coupling
ratio beyond unity increases the revival time considerably. The effect of the
other system parameters such as detuning and radiation field intensity on the
system dynamics has been investigated as well.
| quant-ph | in cavity qed the mutual interaction between natural atomic systems in presence of a radiation field was ignored due to its negligible impact compared with the coupling to the field the newly engineered artificial atomic systems such as quantum dots and superconducting circuits proposed for quantum information processing enjoy strong interaction with same type of systems or even with other types in hybrid structures which is coherently controllable and moreover they can be efficiently coupled to radiation fields we present an exact analytic solution for the time evolution of a composite system of two interacting twolevel quantum systems coupled to a single mode radiation field which can be realized in cavity circuit qed we show how the nonclassical dynamical properties of the composite system are affected and can be tuned by introducing and varying the mutual coupling between the two systems particularly the collapserevival pattern shows a splitting during the revival intervals as the coupling ratio systemsystem to systemfield increases which is a sign of an interruption in the systemradiation energy exchange process furthermore the time evolution of the bipartite entanglement between the two systems is found to vary significantly depending on the coupling ratio as well as the initial state of the composite system resulting in either an oscillatory behavior or a collapserevival like pattern increasing the coupling ratio enhances the entanglement raises its oscillation average value and emphasizes the collapserevival like pattern however raising the coupling ratio beyond unity increases the revival time considerably the effect of the other system parameters such as detuning and radiation field intensity on the system dynamics has been investigated as well | [['in', 'cavity', 'qed', 'the', 'mutual', 'interaction', 'between', 'natural', 'atomic', 'systems', 'in', 'presence', 'of', 'a', 'radiation', 'field', 'was', 'ignored', 'due', 'to', 'its', 'negligible', 'impact', 'compared', 'with', 'the', 'coupling', 'to', 'the', 'field', 'the', 'newly', 'engineered', 'artificial', 'atomic', 'systems', 'such', 'as', 'quantum', 'dots', 'and', 'superconducting', 'circuits', 'proposed', 'for', 'quantum', 'information', 'processing', 'enjoy', 'strong', 'interaction', 'with', 'same', 'type', 'of', 'systems', 'or', 'even', 'with', 'other', 'types', 'in', 'hybrid', 'structures', 'which', 'is', 'coherently', 'controllable', 'and', 'moreover', 'they', 'can', 'be', 'efficiently', 'coupled', 'to', 'radiation', 'fields', 'we', 'present', 'an', 'exact', 'analytic', 'solution', 'for', 'the', 'time', 'evolution', 'of', 'a', 'composite', 'system', 'of', 'two', 'interacting', 'twolevel', 'quantum', 'systems', 'coupled', 'to', 'a', 'single', 'mode', 'radiation', 'field', 'which', 'can', 'be', 'realized', 'in', 'cavity', 'circuit', 'qed', 'we', 'show', 'how', 'the', 'nonclassical', 'dynamical', 'properties', 'of', 'the', 'composite', 'system', 'are', 'affected', 'and', 'can', 'be', 'tuned', 'by', 'introducing', 'and', 'varying', 'the', 'mutual', 'coupling', 'between', 'the', 'two', 'systems', 'particularly', 'the', 'collapserevival', 'pattern', 'shows', 'a', 'splitting', 'during', 'the', 'revival', 'intervals', 'as', 'the', 'coupling', 'ratio', 'systemsystem', 'to', 'systemfield', 'increases', 'which', 'is', 'a', 'sign', 'of', 'an', 'interruption', 'in', 'the', 'systemradiation', 'energy', 'exchange', 'process', 'furthermore', 'the', 'time', 'evolution', 'of', 'the', 'bipartite', 'entanglement', 'between', 'the', 'two', 'systems', 'is', 'found', 'to', 'vary', 'significantly', 'depending', 'on', 'the', 'coupling', 'ratio', 'as', 'well', 'as', 'the', 'initial', 'state', 'of', 'the', 'composite', 'system', 'resulting', 'in', 'either', 'an', 'oscillatory', 'behavior', 'or', 'a', 'collapserevival', 'like', 'pattern', 'increasing', 'the', 'coupling', 'ratio', 'enhances', 'the', 'entanglement', 'raises', 'its', 'oscillation', 'average', 'value', 'and', 'emphasizes', 'the', 'collapserevival', 'like', 'pattern', 'however', 'raising', 'the', 'coupling', 'ratio', 'beyond', 'unity', 'increases', 'the', 'revival', 'time', 'considerably', 'the', 'effect', 'of', 'the', 'other', 'system', 'parameters', 'such', 'as', 'detuning', 'and', 'radiation', 'field', 'intensity', 'on', 'the', 'system', 'dynamics', 'has', 'been', 'investigated', 'as', 'well']] | [-0.1935482012903255, 0.19294833015860452, -0.04062806157576625, 0.045631535799749254, -0.00604790071032467, -0.1559241525711115, 0.010609393499875337, 0.35463924715051265, -0.2941829797494389, -0.3381103875781741, 0.0721769586714745, -0.26784663521841673, -0.12514258335668887, 0.20109689787330196, 0.01886114059452121, 0.04135309325396833, 0.025325320172734027, 0.04810113292832751, -0.04943100444942866, -0.18700757309269467, 0.3214000650901305, 0.07346860665918681, 0.3021171582977842, 0.05841665886593669, 0.06824281960132807, 0.007637242380222689, 0.07127277814950585, 0.03250318363811193, -0.045855681605511504, 0.04004043049862685, 0.17858199110430795, 0.07088291084250847, 0.2463811201458511, -0.4315305732344085, -0.20904874335189633, 0.0967516661825466, 0.18515513193957536, 0.13941314013645206, -0.037471633635579926, -0.27786887982992753, -0.013363663841401705, -0.1664426681657116, -0.10908352653757575, -0.04214563895337814, 0.008290041841510753, 0.03342842196061168, -0.274919997081021, 0.06072404099173132, 0.048162371595891554, 0.04834737294887224, -0.02799493010061678, -0.05116716038901359, -0.021891784484058704, 0.1257171437409375, 0.02335789772014357, 0.018233646633023265, 0.16794227182076832, -0.16320119953534673, -0.11391772025121788, 0.37725141909922216, -0.11615139158043229, -0.18277132306910687, 0.22077712730359816, -0.12189393779105936, -0.05197872976752431, 0.10403809607314986, 0.16675231884772565, 0.08145283709876658, -0.1090439833248948, 0.059596644580618856, 0.03846791492991345, 0.2275456339783604, 0.056177217483673984, 0.11814250992715694, 0.23405534932424737, 0.1556873158211663, 0.028602006806807124, 0.17484895497026823, -0.04982840593674042, -0.14597004383614057, -0.23010038020445056, -0.14426625626726766, -0.1798399664536389, 0.049061859166947254, -0.09019333517672895, -0.16497114499375112, 0.39211782540477225, 0.14784641641066568, 0.1799052119262042, -0.02117744937830357, 0.27881861815738324, 0.18467587989594522, 0.09080969086544735, 0.013055152799196197, 0.31288548612318345, 0.13526132615276154, 0.10171635629092989, -0.31783515044526384, 0.06570002871429485, -0.01818951429827104] |
1,802.01936 | Hidden regular variation, copula models, and the limit behavior of
conditional excess risk measures | Risk measures like Marginal Expected Shortfall and Marginal Mean Excess
quantify conditional risk and in particular, aid in the understanding of
systemic risk. In many such scenarios, models exhibiting heavy tails in the
margins and asymptotic tail independence in the joint behavior play a
fundamental role. The notion of hidden regular variation has the advantage that
it models both properties: asymptotic tail independence as well as heavy tails.
An alternative approach to addressing these features is via copulas. First, we
elicit connections between hidden regular variation and the behavior of tail
copula parameters extending previous works in this area. Then we study the
asymptotic behavior of the aforementioned conditional excess risk measures;
first under hidden regular variation and then under restrictions on the tail
copula parameters, not necessarily assuming hidden regular variation. We
provide a broad variety of examples of models admitting heavy tails and
asymptotic tail independence along with hidden regular variation and with the
appropriate limit behavior for the risk measures of interest.
| math.PR stat.ME | risk measures like marginal expected shortfall and marginal mean excess quantify conditional risk and in particular aid in the understanding of systemic risk in many such scenarios models exhibiting heavy tails in the margins and asymptotic tail independence in the joint behavior play a fundamental role the notion of hidden regular variation has the advantage that it models both properties asymptotic tail independence as well as heavy tails an alternative approach to addressing these features is via copulas first we elicit connections between hidden regular variation and the behavior of tail copula parameters extending previous works in this area then we study the asymptotic behavior of the aforementioned conditional excess risk measures first under hidden regular variation and then under restrictions on the tail copula parameters not necessarily assuming hidden regular variation we provide a broad variety of examples of models admitting heavy tails and asymptotic tail independence along with hidden regular variation and with the appropriate limit behavior for the risk measures of interest | [['risk', 'measures', 'like', 'marginal', 'expected', 'shortfall', 'and', 'marginal', 'mean', 'excess', 'quantify', 'conditional', 'risk', 'and', 'in', 'particular', 'aid', 'in', 'the', 'understanding', 'of', 'systemic', 'risk', 'in', 'many', 'such', 'scenarios', 'models', 'exhibiting', 'heavy', 'tails', 'in', 'the', 'margins', 'and', 'asymptotic', 'tail', 'independence', 'in', 'the', 'joint', 'behavior', 'play', 'a', 'fundamental', 'role', 'the', 'notion', 'of', 'hidden', 'regular', 'variation', 'has', 'the', 'advantage', 'that', 'it', 'models', 'both', 'properties', 'asymptotic', 'tail', 'independence', 'as', 'well', 'as', 'heavy', 'tails', 'an', 'alternative', 'approach', 'to', 'addressing', 'these', 'features', 'is', 'via', 'copulas', 'first', 'we', 'elicit', 'connections', 'between', 'hidden', 'regular', 'variation', 'and', 'the', 'behavior', 'of', 'tail', 'copula', 'parameters', 'extending', 'previous', 'works', 'in', 'this', 'area', 'then', 'we', 'study', 'the', 'asymptotic', 'behavior', 'of', 'the', 'aforementioned', 'conditional', 'excess', 'risk', 'measures', 'first', 'under', 'hidden', 'regular', 'variation', 'and', 'then', 'under', 'restrictions', 'on', 'the', 'tail', 'copula', 'parameters', 'not', 'necessarily', 'assuming', 'hidden', 'regular', 'variation', 'we', 'provide', 'a', 'broad', 'variety', 'of', 'examples', 'of', 'models', 'admitting', 'heavy', 'tails', 'and', 'asymptotic', 'tail', 'independence', 'along', 'with', 'hidden', 'regular', 'variation', 'and', 'with', 'the', 'appropriate', 'limit', 'behavior', 'for', 'the', 'risk', 'measures', 'of', 'interest']] | [-0.06257537739690054, 0.07061403024682394, -0.1465033562162496, 0.18626171144741502, -0.06968516845143202, -0.11714139120145277, 0.06210631445635844, 0.39874008706573283, -0.25970609775095277, -0.27033480583041003, 0.11458014442133858, -0.29022852009388084, -0.14010604582726954, 0.12141903731125323, -0.11971791476349938, 0.08438680686169502, -0.02156019246657238, 0.044082465975467736, -0.03453772385943343, -0.21209781154228205, 0.3075834022312792, 0.0736778573217717, 0.31806161596693777, 0.021723983181370633, 0.08046009447990042, 0.03728091012630047, -0.012295083743943409, 0.02429276460951025, -0.12331346361637716, 0.15440816623017645, 0.20301628343381295, 0.12885247697545724, 0.3222293971614404, -0.3724832919510928, -0.24498718406327746, 0.1770779864862561, 0.11037371153802131, -0.0069459361475751255, -0.026693934075195682, -0.27861231532173625, 0.02865500625392253, -0.21752089597284793, -0.17891817211674413, -0.08165219816746133, 0.01045149215355967, 0.056532987106281025, -0.29428368077444084, 0.11371378455819055, 0.12234060922425917, 0.09802038752558556, -0.030567937592665354, -0.13763050776835756, -0.002125526573791197, 0.11543685359259447, 0.1879890444984829, -0.08578880800244709, 0.13124756459428957, -0.16392684749779152, -0.10476178779746546, 0.2602657088826439, -0.11852580323025133, -0.1968247299957456, 0.19365214371037753, -0.17469467463564467, -0.19345032652896463, 0.09587891496661487, 0.19544229993427342, 0.08271717577749356, -0.16908165419361357, 0.10298800787810856, -0.03754452743539304, 0.11722412868614562, 0.07722296676259827, 0.11649914867329327, 0.20328596898100593, 0.1323150190708199, 0.06793769657520125, 0.16475251202725552, -0.09837928732546668, -0.1451984154822474, -0.33164197834152165, -0.11263345680499422, -0.1150639822480805, -0.0006957191110511, -0.17207032011929463, -0.21086204565609945, 0.39317050926161534, 0.13191488633553186, 0.23531466143375093, 0.1161054125253224, 0.22981393493034624, 0.11386045613202661, 0.007226878692480651, 0.0843569864377831, 0.1637782337228683, 0.12033007869666273, 0.011374429870171078, -0.15633778500681123, 0.23044277030805296, 0.013463821914047002] |
1,802.01937 | Atiyah classes of Lie bialgebras | The Atiyah class was originally introduced by M.F. Atiyah. It has many
developments in recent years. One important case is the Atiyah classes of Lie
algebra pairs. In this paper, we study the Atiyah class of the Lie algebra pair
associated with a Lie bialgebra $(g,g^*)$. A simple description of the Atiyah
class and the first scalar Atiyah class is given by the Lie algebra structures
on $g$ and $g^*$. As its application, the Atiyah classes for some special cases
are investigated.
| math.QA math-ph math.MP math.RA | the atiyah class was originally introduced by mf atiyah it has many developments in recent years one important case is the atiyah classes of lie algebra pairs in this paper we study the atiyah class of the lie algebra pair associated with a lie bialgebra gg a simple description of the atiyah class and the first scalar atiyah class is given by the lie algebra structures on g and g as its application the atiyah classes for some special cases are investigated | [['the', 'atiyah', 'class', 'was', 'originally', 'introduced', 'by', 'mf', 'atiyah', 'it', 'has', 'many', 'developments', 'in', 'recent', 'years', 'one', 'important', 'case', 'is', 'the', 'atiyah', 'classes', 'of', 'lie', 'algebra', 'pairs', 'in', 'this', 'paper', 'we', 'study', 'the', 'atiyah', 'class', 'of', 'the', 'lie', 'algebra', 'pair', 'associated', 'with', 'a', 'lie', 'bialgebra', 'gg', 'a', 'simple', 'description', 'of', 'the', 'atiyah', 'class', 'and', 'the', 'first', 'scalar', 'atiyah', 'class', 'is', 'given', 'by', 'the', 'lie', 'algebra', 'structures', 'on', 'g', 'and', 'g', 'as', 'its', 'application', 'the', 'atiyah', 'classes', 'for', 'some', 'special', 'cases', 'are', 'investigated']] | [-0.15815813068538995, 0.06097922468467093, -0.0028646084502702805, 0.11620863898026916, -0.1996233006740534, -0.16475417284953703, -0.09363589282914224, 0.36955945136979584, -0.30720868882745866, -0.2770034362357564, 0.10317026277742826, -0.2037199645263438, -0.20131897465212317, 0.2097802627036666, -0.16500373142657848, -0.0385468912590579, 0.08501158795523935, 0.14134027098487245, -0.10729782249233345, -0.29085448523734914, 0.4747367264566625, 0.011544034634603233, 0.21222447374801537, 0.02979108837160577, 0.08068439776146012, 0.029054167140956697, -0.019499179566415344, -0.040451929292474945, -0.0925293774344027, 0.11187455570325255, 0.3094310610123524, 0.034546795125096674, 0.26920660317125844, -0.2715089410520727, -0.1663257656164649, 0.16605536200151574, 0.06481354579147769, 0.008434729085576425, -0.05279542193726761, -0.33464128036540364, 0.09956200676970184, -0.21765947203356317, -0.08251000712512106, -0.006471378497336424, 0.12103183506192958, -0.020373797674504358, -0.16103254428428665, -0.041671741083718655, 0.0995803223354969, 0.10953641920236916, -0.04534924560277609, -0.06970804809342797, -0.049406146721505534, 0.04371056445056527, -0.013372098987286047, 0.06149939621128596, 0.11960567062061916, -0.06878027999943985, -0.1999509925741089, 0.3672577189054431, -0.008036954044477969, -0.17539194314854173, 0.15319497093967185, -0.16539317282575478, -0.2661341321484254, 0.0980154797051488, 0.05777480868940673, 0.19684762531528022, -0.06473926250629763, 0.22743834854847547, -0.14807599007220165, -0.09083490718792124, 0.08619616860410244, -0.023085206167817843, 0.1334687881313673, 0.1512288174467025, 0.02572817104178617, 0.128699782270393, 0.0041794975809241845, -0.011988025249504462, -0.36963775769875545, -0.2127311917067301, -0.10154426371587849, 0.15485585042241415, -0.023367655730065207, -0.10134693083535062, 0.48423287981167074, 0.07916636986476255, 0.1870792313456172, 0.08316035797001749, 0.15266053355014997, 0.12789092560883658, 0.13001225592863813, 0.04936560165000761, 0.1638134642544617, 0.3703787841595618, 0.03446807432919741, -0.09318955564053684, -0.06377174533625338, 0.25362015673436406] |
1,802.01938 | Multiplicativity of the idempotent splittings of the Burnside ring and
the G-sphere spectrum | We provide a complete characterization of the equivariant commutative ring
structures of all the factors in the idempotent splitting of the G-equivariant
sphere spectrum, including their Hill-Hopkins-Ravenel norms, where G is any
finite group. Our results describe explicitly how these structures depend on
the subgroup lattice and conjugation in G. Algebraically, our analysis
characterizes the multiplicative transfers on the localization of the Burnside
ring of G at any idempotent element, which is of independent interest to group
theorists. As an application, we obtain an explicit description of the
incomplete sets of norm functors which are present in the idempotent splitting
of the equivariant stable homotopy category.
| math.AT math.GR | we provide a complete characterization of the equivariant commutative ring structures of all the factors in the idempotent splitting of the gequivariant sphere spectrum including their hillhopkinsravenel norms where g is any finite group our results describe explicitly how these structures depend on the subgroup lattice and conjugation in g algebraically our analysis characterizes the multiplicative transfers on the localization of the burnside ring of g at any idempotent element which is of independent interest to group theorists as an application we obtain an explicit description of the incomplete sets of norm functors which are present in the idempotent splitting of the equivariant stable homotopy category | [['we', 'provide', 'a', 'complete', 'characterization', 'of', 'the', 'equivariant', 'commutative', 'ring', 'structures', 'of', 'all', 'the', 'factors', 'in', 'the', 'idempotent', 'splitting', 'of', 'the', 'gequivariant', 'sphere', 'spectrum', 'including', 'their', 'hillhopkinsravenel', 'norms', 'where', 'g', 'is', 'any', 'finite', 'group', 'our', 'results', 'describe', 'explicitly', 'how', 'these', 'structures', 'depend', 'on', 'the', 'subgroup', 'lattice', 'and', 'conjugation', 'in', 'g', 'algebraically', 'our', 'analysis', 'characterizes', 'the', 'multiplicative', 'transfers', 'on', 'the', 'localization', 'of', 'the', 'burnside', 'ring', 'of', 'g', 'at', 'any', 'idempotent', 'element', 'which', 'is', 'of', 'independent', 'interest', 'to', 'group', 'theorists', 'as', 'an', 'application', 'we', 'obtain', 'an', 'explicit', 'description', 'of', 'the', 'incomplete', 'sets', 'of', 'norm', 'functors', 'which', 'are', 'present', 'in', 'the', 'idempotent', 'splitting', 'of', 'the', 'equivariant', 'stable', 'homotopy', 'category']] | [-0.18710808575434504, 0.06045773114711442, -0.11062642098827297, 0.058397014750571886, -0.07941528334598637, -0.06394327171849755, -0.015600537004845464, 0.3813795422748575, -0.3745666651345157, -0.19120758962993212, 0.1032113185303971, -0.22437262407697314, -0.10792549884930816, 0.16850091345643378, -0.1226274416219654, -0.05753604360451957, 0.05474362814060922, 0.13998496803298005, -0.08144768993897399, -0.22952965282415533, 0.4052280247879197, 0.0034437523473862487, 0.24328846641408333, 0.05735825466097526, 0.07896284012229375, 0.017700222172589868, -0.04640369564031233, -0.0307129236017266, -0.13646931116324235, 0.15299764856199716, 0.3233034291989961, 0.06438131990477625, 0.20217317930655554, -0.3711828194593765, -0.1088440562576442, 0.16598647541173225, 0.10862846822117649, 0.020394903680151504, -0.034277921946684144, -0.27736854095468827, 0.12271397272212747, -0.21748798114757212, -0.10824719360010382, -0.11645300999143214, 0.10086629850754761, 0.03322668998905255, -0.2693644608239169, -0.024502043946171708, 0.1075865490195113, 0.1413199509546723, -0.08005048374684949, -0.10433628620527122, -0.03004479207941946, 0.15938469760102342, -0.030819375502859365, -0.016681486622096516, 0.1422454290584011, -0.05950002395987229, -0.1270932993980098, 0.4107085431592082, -0.06701250414293751, -0.19764185805787454, 0.11127464273364616, -0.16742096931831735, -0.13979861121361126, 0.15613310545120598, 0.06670126261822176, 0.1714107738017052, -0.0006597997567985418, 0.22700359304556358, -0.16350077421246273, 0.11109318228807512, 0.05113039124221102, 0.04694450209092981, 0.12154199504776735, 0.08498433818557423, 0.09460403309104841, 0.11529320935094904, 0.030871925084798964, -0.011031871999807234, -0.3895869409349167, -0.15205834038722557, -0.1251640513128566, 0.13786919372933829, -0.11215411760514264, -0.2235165479030671, 0.44296446829190794, 0.08805385983619347, 0.15291790467388225, 0.06537386040282347, 0.23022562682734066, 0.0573044397510184, 0.054256404980683244, 0.038510494180164244, 0.1329902483431517, 0.23952909877066905, -0.07606669662977164, -0.19710820244256197, -0.030411112302351953, 0.20915730690302434] |
1,802.01939 | The redshift of the BL Lac object TXS 0506+056 | The bright BL Lac object TXS 0506+056 is a most likely counterpart of the
IceCube neutrino event EHE 170922A. The lack of this redshift prevents a
comprehensive understanding of the modeling of the source. We present high
signal-to-noise optical spectroscopy, in the range 4100-9000 $\textrm{\AA}$,
obtained at the 10.4m Gran Telescopio Canarias. The spectrum is characterized
by a power law continuum and is marked by faint interstellar features. In the
regions unaffected by these features, we found three very weak (EW $\sim$ 0.1
$\textrm{\AA}$) emission lines that we identify with [O II] 3727
$\textrm{\AA}$, [O III] 5007 $\textrm{\AA}$, and [N II] 6583 $\textrm{\AA}$,
yielding the redshift z = 0.3365$\pm$0.0010.
| astro-ph.GA astro-ph.HE | the bright bl lac object txs 0506056 is a most likely counterpart of the icecube neutrino event ehe 170922a the lack of this redshift prevents a comprehensive understanding of the modeling of the source we present high signaltonoise optical spectroscopy in the range 41009000 textrmaa obtained at the 104m gran telescopio canarias the spectrum is characterized by a power law continuum and is marked by faint interstellar features in the regions unaffected by these features we found three very weak ew sim 01 textrmaa emission lines that we identify with o ii 3727 textrmaa o iii 5007 textrmaa and n ii 6583 textrmaa yielding the redshift z 03365pm00010 | [['the', 'bright', 'bl', 'lac', 'object', 'txs', '0506056', 'is', 'a', 'most', 'likely', 'counterpart', 'of', 'the', 'icecube', 'neutrino', 'event', 'ehe', '170922a', 'the', 'lack', 'of', 'this', 'redshift', 'prevents', 'a', 'comprehensive', 'understanding', 'of', 'the', 'modeling', 'of', 'the', 'source', 'we', 'present', 'high', 'signaltonoise', 'optical', 'spectroscopy', 'in', 'the', 'range', '41009000', 'textrmaa', 'obtained', 'at', 'the', '104m', 'gran', 'telescopio', 'canarias', 'the', 'spectrum', 'is', 'characterized', 'by', 'a', 'power', 'law', 'continuum', 'and', 'is', 'marked', 'by', 'faint', 'interstellar', 'features', 'in', 'the', 'regions', 'unaffected', 'by', 'these', 'features', 'we', 'found', 'three', 'very', 'weak', 'ew', 'sim', '01', 'textrmaa', 'emission', 'lines', 'that', 'we', 'identify', 'with', 'o', 'ii', '3727', 'textrmaa', 'o', 'iii', '5007', 'textrmaa', 'and', 'n', 'ii', '6583', 'textrmaa', 'yielding', 'the', 'redshift', 'z', '03365pm00010']] | [-0.08588236815163068, 0.07729194551883709, 0.007545778044455108, 0.10955123427168777, -0.08852001339019765, -0.17905638545662875, 0.05605866328502695, 0.4561544293094249, -0.1270928291304569, -0.3359302871195333, 0.03734019894729413, -0.3326079099882571, 0.02313508975230867, 0.1450883063199442, -0.008997738583102113, -0.08484615091833153, 0.03169220078381754, -0.1380599197887239, 0.004002202067446585, -0.18565975158652734, 0.27428974092361474, 0.14114684550801204, 0.2293096147433278, -0.02701770108902738, 0.08533319434139966, -0.08508766561835295, -0.12176969442405694, -0.037488377963503204, -0.10475350376031461, 0.02974642975965426, 0.2763489587143773, 0.13339379315841057, 0.18929468816855832, -0.2593231327920443, -0.1573592135682702, 0.08580183024030356, 0.1764109760217945, 0.003604355563930724, -0.03122337433880949, -0.3561927200605472, 0.07786792300920795, -0.13495949367615617, -0.15900324453111916, 0.12630949890507118, 0.04625765401870012, 0.015980686730749552, -0.2042891066698801, 0.08978069621537413, -0.03161351115864125, 0.108370725107601, -0.0775740585001629, -0.09258040339641628, -0.08219702353346206, 0.028820715671671288, -0.006662788426148749, 0.03589126484335533, 0.09541386090706856, -0.1786212030554279, -0.025060473072032134, 0.38658700821300346, -0.11682413279167599, 0.08185945517782654, 0.20629669984004328, -0.22998765098108423, -0.2105624720897703, 0.24028668262596642, 0.07156476923125973, 0.16097781919531934, -0.1527039919780301, 0.10508302544310157, -0.01462050944655424, 0.23980320177617528, 0.023965118856479724, 0.1222574146397944, 0.28459082943875164, 0.08847199085922468, -0.015902586769135224, 0.04746404677197071, -0.32167686989442223, 0.08384234255978039, -0.30114417154247697, -0.10212359910032578, -0.11625949143032943, 0.12895977287109764, -0.11170787325189892, -0.10233927269333175, 0.3393156712475632, 0.06991668888367712, 0.22856178237568764, 0.058094915827470166, 0.2606762889861351, 0.1117542158590541, 0.05233007894740218, 0.07144123594764443, 0.32532924615911074, 0.11962759625610142, 0.15605999483239083, -0.2493167131119186, 0.044859095120392295, 0.06710651942883573] |
1,802.0194 | Three-disk microswimmer in a supported fluid membrane | A model of three-disk micromachine swimming in a quasi two-dimensional
supported membrane is proposed. We calculate the average swimming velocity as a
function of the disk size and the arm length. Due to the presence of the
hydrodynamic screening length in the quasi two-dimensional fluid, the geometric
factor appearing in the average velocity exhibits three different asymptotic
behaviors depending on the microswimmer size and the hydrodynamic screening
length. This is in sharp contrast with a microswimmer in a three-dimensional
bulk fluid that shows only a single scaling behavior. We also find that the
maximum velocity is obtained when the disks are equal-sized, whereas it is
minimized when the average arm lengths are identical. The intrinsic drag of the
disks on the substrate does not alter the scaling behaviors of the geometric
factor.
| cond-mat.soft | a model of threedisk micromachine swimming in a quasi twodimensional supported membrane is proposed we calculate the average swimming velocity as a function of the disk size and the arm length due to the presence of the hydrodynamic screening length in the quasi twodimensional fluid the geometric factor appearing in the average velocity exhibits three different asymptotic behaviors depending on the microswimmer size and the hydrodynamic screening length this is in sharp contrast with a microswimmer in a threedimensional bulk fluid that shows only a single scaling behavior we also find that the maximum velocity is obtained when the disks are equalsized whereas it is minimized when the average arm lengths are identical the intrinsic drag of the disks on the substrate does not alter the scaling behaviors of the geometric factor | [['a', 'model', 'of', 'threedisk', 'micromachine', 'swimming', 'in', 'a', 'quasi', 'twodimensional', 'supported', 'membrane', 'is', 'proposed', 'we', 'calculate', 'the', 'average', 'swimming', 'velocity', 'as', 'a', 'function', 'of', 'the', 'disk', 'size', 'and', 'the', 'arm', 'length', 'due', 'to', 'the', 'presence', 'of', 'the', 'hydrodynamic', 'screening', 'length', 'in', 'the', 'quasi', 'twodimensional', 'fluid', 'the', 'geometric', 'factor', 'appearing', 'in', 'the', 'average', 'velocity', 'exhibits', 'three', 'different', 'asymptotic', 'behaviors', 'depending', 'on', 'the', 'microswimmer', 'size', 'and', 'the', 'hydrodynamic', 'screening', 'length', 'this', 'is', 'in', 'sharp', 'contrast', 'with', 'a', 'microswimmer', 'in', 'a', 'threedimensional', 'bulk', 'fluid', 'that', 'shows', 'only', 'a', 'single', 'scaling', 'behavior', 'we', 'also', 'find', 'that', 'the', 'maximum', 'velocity', 'is', 'obtained', 'when', 'the', 'disks', 'are', 'equalsized', 'whereas', 'it', 'is', 'minimized', 'when', 'the', 'average', 'arm', 'lengths', 'are', 'identical', 'the', 'intrinsic', 'drag', 'of', 'the', 'disks', 'on', 'the', 'substrate', 'does', 'not', 'alter', 'the', 'scaling', 'behaviors', 'of', 'the', 'geometric', 'factor']] | [-0.17206217250680889, 0.15824964981187473, -0.11103171246323848, 0.0008058280738733822, -0.026136422677981584, -0.10360109276900237, -0.021154318900891776, 0.34985884789829, -0.24884625376823047, -0.2678741795772856, 0.029080364261365805, -0.2600703398189084, -0.14334455529531237, 0.17452649755763228, -0.0409529774633208, 0.031835029212137066, 0.00028512208143982923, 0.04425018388693305, -0.05904013628605753, -0.20224462566318724, 0.24745647072665056, 0.04419986331468505, 0.2948424399188353, 0.03229850833833387, 0.09410391911285731, -0.008470742024876403, 0.030012406535785307, 0.10375869346105239, -0.20690647305651289, 0.0494356663354362, 0.12484309799567034, -0.03333184010416241, 0.21701684373406213, -0.4062241726681929, -0.2073215308570952, 0.04621749318021378, 0.1738344602539049, 0.1173150682765426, -0.0001394985522369318, -0.19330197547661196, 0.06666817132270697, -0.11993375224428195, -0.15809632543294522, 0.037384383962489665, 0.06003000138144037, 0.05607941088259615, -0.23448850085718953, 0.1447817704825094, 0.0782281960304262, 0.0684983068971302, -0.06930485800628296, -0.08361955094821469, -0.039275974209886044, 0.12343524424244551, 0.08354967193603939, 0.015572452220085048, 0.20749627479182725, -0.17692925945580515, -0.040708367451743194, 0.39807603051039303, -0.07405267794313135, -0.22265964472722827, 0.2176827356416845, -0.1890048561335513, -0.03086241417225789, 0.15102537763199175, 0.17159523003537094, 0.10088780892053337, -0.09580476025836436, 0.050766509237071274, -0.10154976463298115, 0.2017760225571692, 0.08306613053145791, -0.0033313972861364937, 0.20361718534012185, 0.18399138478421126, 0.04522344193008559, 0.1661439833061939, -0.14386915977493944, -0.11286623095105769, -0.28390362749244313, -0.15312753769279824, -0.1885993862048384, 0.04056064903951748, -0.16495569435518878, -0.2043505672393649, 0.3682930215374764, 0.08837828469801355, 0.242528710380253, 0.08045764086118927, 0.2903493367572964, 0.10651920400612819, 0.09477231644489097, 0.12111959898505699, 0.27496123730882327, 0.07821476550430595, 0.061366100986064834, -0.3143052624954814, 0.09210002563354051, 0.07334792156082888] |
1,802.01941 | Theta correspondence and the Prasad conjecture for SL(2) | We use relations between the base change representations and theta lifts, to
give a new proof to the local period problems of SL(2) over a nonarchimedean
quadratic field extension E/F. Then we will verify the Prasad conjecture for
SL(2). With a similar strategy, we obtain a certain result for the Prasad
conjecture for Sp(4).
| math.RT | we use relations between the base change representations and theta lifts to give a new proof to the local period problems of sl2 over a nonarchimedean quadratic field extension ef then we will verify the prasad conjecture for sl2 with a similar strategy we obtain a certain result for the prasad conjecture for sp4 | [['we', 'use', 'relations', 'between', 'the', 'base', 'change', 'representations', 'and', 'theta', 'lifts', 'to', 'give', 'a', 'new', 'proof', 'to', 'the', 'local', 'period', 'problems', 'of', 'sl2', 'over', 'a', 'nonarchimedean', 'quadratic', 'field', 'extension', 'ef', 'then', 'we', 'will', 'verify', 'the', 'prasad', 'conjecture', 'for', 'sl2', 'with', 'a', 'similar', 'strategy', 'we', 'obtain', 'a', 'certain', 'result', 'for', 'the', 'prasad', 'conjecture', 'for', 'sp4']] | [-0.19634897853420288, 0.029679304575202643, -0.17114012491785818, 0.09445689058069277, -0.15222138808005387, -0.14839718863368034, 0.03525478215198274, 0.27853748933584604, -0.3268096433193595, -0.25876083233635183, 0.0670545797329396, -0.19107648359473656, -0.18460358786224215, 0.24595999998833845, -0.11312905636495324, -0.026001505165671308, 0.0035124737424431026, 0.06263986535163389, -0.14017653094466637, -0.3202213138272917, 0.32678946551728855, -0.03673918327937523, 0.22081840776458936, 0.0900269201439288, 0.10185139903074338, 0.08838116345685665, 0.028695686915954057, -0.06658000267472947, -0.1684379824868369, 0.1506845143934091, 0.29086160187230065, 0.08059619330042214, 0.21683682635409274, -0.36654400002832216, -0.10938798489600972, 0.1708484515633986, 0.09057215877153256, 0.08934681360713309, -0.01720629976544943, -0.2970038962515968, 0.12670638206354515, -0.19431865677513457, -0.18665670843243046, -0.1058960190491268, 0.0498590816299569, -0.04299066475316606, -0.3111388401249079, 0.011343354937034074, 0.08779580246105238, 0.1617464160512167, -0.1210127950783957, -0.06495371676498542, 0.004788983182084781, 0.08180780622556254, 0.05101035459449998, 0.07814691612427985, 0.029640689345628576, -0.09925525016323836, -0.15299325723511478, 0.3046457379090565, -0.11136334279069195, -0.1914843450240032, 0.12921353926261267, -0.141042388268505, -0.19796253970168806, 0.030714643687975628, 0.12297379573876108, 0.1189080198743829, -0.008207096959705706, 0.17370422524119797, -0.18040330525211715, 0.09058689266331149, 0.11799715830151129, -0.031964883449728844, 0.1628958283820086, 0.020179375859529333, 0.11053611509312221, 0.15757144238213422, -0.0032031736422882037, -0.026298390367258066, -0.34943999519088753, -0.2330843155030851, -0.07740978468468206, 0.12923531165924268, -0.08900110063081633, -0.1293660293471206, 0.4115666522196046, 0.1128011699291636, 0.18029717449098825, 0.1993490900301064, 0.16791264830088173, 0.11682995862038634, 0.07594000686017184, 0.0650626227380363, 0.14478317600743915, 0.24074884784338926, 0.02115036987621958, -0.13609457373860534, -0.05406820785288734, 0.1879437904442764] |
1,802.01942 | Hadron resonance gas EoS and the fluidity of matter produced in HIC | We study the equation of state (EoS) of the hot and dense hadron gas by
incorporating the excluded volume corrections into the ideal hadron resonance
gas model (HRG). The total hadron mass spectrum of the model is the sum of
discrete mass spectrum consisting all the experimentally known hadrons and the
exponentially rising continuous Hagedorn states. We confront the EoS of the
model with lattice quantum chromodynamics (LQCD) results at finite baryon
chemical potential. We find that this modified HRG model reproduce the LQCD
results up to T = 160 MeV at zero as well as finite baryon chemical potential.
We further estimate the shear viscosity coefficient within ambit of this model
in the context of heavy-ion collision experiments.
| hep-ph nucl-th | we study the equation of state eos of the hot and dense hadron gas by incorporating the excluded volume corrections into the ideal hadron resonance gas model hrg the total hadron mass spectrum of the model is the sum of discrete mass spectrum consisting all the experimentally known hadrons and the exponentially rising continuous hagedorn states we confront the eos of the model with lattice quantum chromodynamics lqcd results at finite baryon chemical potential we find that this modified hrg model reproduce the lqcd results up to t 160 mev at zero as well as finite baryon chemical potential we further estimate the shear viscosity coefficient within ambit of this model in the context of heavyion collision experiments | [['we', 'study', 'the', 'equation', 'of', 'state', 'eos', 'of', 'the', 'hot', 'and', 'dense', 'hadron', 'gas', 'by', 'incorporating', 'the', 'excluded', 'volume', 'corrections', 'into', 'the', 'ideal', 'hadron', 'resonance', 'gas', 'model', 'hrg', 'the', 'total', 'hadron', 'mass', 'spectrum', 'of', 'the', 'model', 'is', 'the', 'sum', 'of', 'discrete', 'mass', 'spectrum', 'consisting', 'all', 'the', 'experimentally', 'known', 'hadrons', 'and', 'the', 'exponentially', 'rising', 'continuous', 'hagedorn', 'states', 'we', 'confront', 'the', 'eos', 'of', 'the', 'model', 'with', 'lattice', 'quantum', 'chromodynamics', 'lqcd', 'results', 'at', 'finite', 'baryon', 'chemical', 'potential', 'we', 'find', 'that', 'this', 'modified', 'hrg', 'model', 'reproduce', 'the', 'lqcd', 'results', 'up', 'to', 't', '160', 'mev', 'at', 'zero', 'as', 'well', 'as', 'finite', 'baryon', 'chemical', 'potential', 'we', 'further', 'estimate', 'the', 'shear', 'viscosity', 'coefficient', 'within', 'ambit', 'of', 'this', 'model', 'in', 'the', 'context', 'of', 'heavyion', 'collision', 'experiments']] | [-0.030085619555794144, 0.23812997274069211, -0.1191333298910788, 0.07463435802147013, -0.009824307737289928, -0.08266299086922811, 0.050024240330982385, 0.2886627622390703, -0.22358674833045925, -0.2545682736909238, 0.006446612354612641, -0.33315837841038987, 0.02578844785683155, 0.10417557183960927, 0.09913169440095139, 0.12104747529630944, 0.07017716824696636, 0.04191128723323345, -0.047290253829826615, -0.23343542357117442, 0.3188944721626023, 0.07017093298510822, 0.20905745604028136, 0.16797114059455315, 0.07996074847435042, -0.049055972199697616, -0.009215324714590432, 0.010336574316971887, -0.20054262074459614, 0.0231458198854313, 0.20609777124788045, 0.02397804466170906, 0.16197556203381175, -0.3527514822386458, -0.26667824493310716, 0.13393689128195363, 0.11953838476595485, 0.14108130261617696, -0.04293637472536352, -0.2440116109121275, 0.07232871023795993, -0.2861789283579436, -0.20410297038743935, -0.10589878331333147, -0.03339702495121223, -0.005589779847206832, -0.262865889785906, 0.177058079206953, -0.035960305498920826, 0.011942045889415984, -0.09920217593050545, -0.19964003082270088, -0.06708685692766744, 0.021421419642076403, 0.016437373016526827, 0.06508659987939301, 0.17694854306972632, -0.16610674697795283, -0.06556732792770333, 0.4572649554949317, -0.09477936878989814, -0.09711079643565719, 0.1542940541738802, -0.2034310550247398, -0.12082505735205644, 0.12501374895731776, 0.18250008000423973, 0.03589433257199698, -0.17229143676142825, 0.12778347200946882, -0.06923295133668235, 0.16101829952292018, 0.04102245290463759, 0.015452827149370716, 0.2434883209624154, 0.1940733618260819, -0.042026954126875786, 0.10597715632135632, -0.058919647011029835, -0.13636350385071236, -0.3757607223055625, -0.07342919743604075, -0.20060052379464605, 0.020461858525453926, -0.10562999701592085, -0.13732040064089726, 0.35940988585195044, 0.11872078869018261, 0.26755762722449755, 0.013499999371499328, 0.32517173191753485, 0.10434721140940753, 0.05490597080186767, 0.07743962909000278, 0.2167347519701915, 0.2092370659180017, 0.15860245793158093, -0.3337148860357386, -0.04933299417449635, 0.07652773658381933] |
1,802.01943 | Attribute-Guided Network for Cross-Modal Zero-Shot Hashing | Zero-Shot Hashing aims at learning a hashing model that is trained only by
instances from seen categories but can generate well to those of unseen
categories. Typically, it is achieved by utilizing a semantic embedding space
to transfer knowledge from seen domain to unseen domain. Existing efforts
mainly focus on single-modal retrieval task, especially Image-Based Image
Retrieval (IBIR). However, as a highlighted research topic in the field of
hashing, cross-modal retrieval is more common in real world applications. To
address the Cross-Modal Zero-Shot Hashing (CMZSH) retrieval task, we propose a
novel Attribute-Guided Network (AgNet), which can perform not only IBIR, but
also Text-Based Image Retrieval (TBIR). In particular, AgNet aligns different
modal data into a semantically rich attribute space, which bridges the gap
caused by modality heterogeneity and zero-shot setting. We also design an
effective strategy that exploits the attribute to guide the generation of hash
codes for image and text within the same network. Extensive experimental
results on three benchmark datasets (AwA, SUN, and ImageNet) demonstrate the
superiority of AgNet on both cross-modal and single-modal zero-shot image
retrieval tasks.
| cs.CV | zeroshot hashing aims at learning a hashing model that is trained only by instances from seen categories but can generate well to those of unseen categories typically it is achieved by utilizing a semantic embedding space to transfer knowledge from seen domain to unseen domain existing efforts mainly focus on singlemodal retrieval task especially imagebased image retrieval ibir however as a highlighted research topic in the field of hashing crossmodal retrieval is more common in real world applications to address the crossmodal zeroshot hashing cmzsh retrieval task we propose a novel attributeguided network agnet which can perform not only ibir but also textbased image retrieval tbir in particular agnet aligns different modal data into a semantically rich attribute space which bridges the gap caused by modality heterogeneity and zeroshot setting we also design an effective strategy that exploits the attribute to guide the generation of hash codes for image and text within the same network extensive experimental results on three benchmark datasets awa sun and imagenet demonstrate the superiority of agnet on both crossmodal and singlemodal zeroshot image retrieval tasks | [['zeroshot', 'hashing', 'aims', 'at', 'learning', 'a', 'hashing', 'model', 'that', 'is', 'trained', 'only', 'by', 'instances', 'from', 'seen', 'categories', 'but', 'can', 'generate', 'well', 'to', 'those', 'of', 'unseen', 'categories', 'typically', 'it', 'is', 'achieved', 'by', 'utilizing', 'a', 'semantic', 'embedding', 'space', 'to', 'transfer', 'knowledge', 'from', 'seen', 'domain', 'to', 'unseen', 'domain', 'existing', 'efforts', 'mainly', 'focus', 'on', 'singlemodal', 'retrieval', 'task', 'especially', 'imagebased', 'image', 'retrieval', 'ibir', 'however', 'as', 'a', 'highlighted', 'research', 'topic', 'in', 'the', 'field', 'of', 'hashing', 'crossmodal', 'retrieval', 'is', 'more', 'common', 'in', 'real', 'world', 'applications', 'to', 'address', 'the', 'crossmodal', 'zeroshot', 'hashing', 'cmzsh', 'retrieval', 'task', 'we', 'propose', 'a', 'novel', 'attributeguided', 'network', 'agnet', 'which', 'can', 'perform', 'not', 'only', 'ibir', 'but', 'also', 'textbased', 'image', 'retrieval', 'tbir', 'in', 'particular', 'agnet', 'aligns', 'different', 'modal', 'data', 'into', 'a', 'semantically', 'rich', 'attribute', 'space', 'which', 'bridges', 'the', 'gap', 'caused', 'by', 'modality', 'heterogeneity', 'and', 'zeroshot', 'setting', 'we', 'also', 'design', 'an', 'effective', 'strategy', 'that', 'exploits', 'the', 'attribute', 'to', 'guide', 'the', 'generation', 'of', 'hash', 'codes', 'for', 'image', 'and', 'text', 'within', 'the', 'same', 'network', 'extensive', 'experimental', 'results', 'on', 'three', 'benchmark', 'datasets', 'awa', 'sun', 'and', 'imagenet', 'demonstrate', 'the', 'superiority', 'of', 'agnet', 'on', 'both', 'crossmodal', 'and', 'singlemodal', 'zeroshot', 'image', 'retrieval', 'tasks']] | [-0.03312804728107117, -0.028990278987258037, -0.060195853395435546, 0.10607766050590192, -0.15076841045918185, -0.20103307067032503, 0.014422223638837873, 0.5081659602580098, -0.29100394007449937, -0.3465086947968703, 0.06040050200578667, -0.26883962827255836, -0.15907172123012975, 0.19144645195301768, -0.18076441266658153, 0.07959537965634911, 0.15034501593938823, 0.06328201165625373, -0.09385948039138806, -0.3056054383703431, 0.35752292720358925, 0.014813718399148707, 0.38688235256378933, 0.043696107774299414, 0.09489584647942503, -0.030906187762293535, -0.06669617554575394, -0.04142610344274159, -0.004998687493347163, 0.20518647192709022, 0.39839400828810734, 0.2494960009662361, 0.2755211063234483, -0.3254136218831448, -0.26781957190862654, 0.06765658515742269, 0.16381377350581064, 0.11111761285408103, -0.09108967454763627, -0.4106399691795225, 0.04962770684390713, -0.17056712911774716, 0.15547055551386965, -0.17260545082285075, -0.009124932604799794, -0.08405525730442687, -0.3015614179157689, -0.006598213601871894, 0.12721591062730672, 0.08153453235656528, -0.05798698021993462, -0.10912188863918437, 0.05193503736781409, 0.16104507414126865, 0.03538952321129835, 0.1175378184044723, 0.1329162031844818, -0.23610399171050986, -0.15971695597080968, 0.4215449638727863, -0.05707594609193209, -0.17495096108144792, 0.20859723804534366, -0.02307060077039283, -0.13478734604172452, 0.07167288571225196, 0.2364243197828363, 0.1652545903856724, -0.14201329017089584, 0.016979285835000385, -0.08817713428814869, 0.2298211528430298, 0.08769019413739443, 0.010030829473951106, 0.18361381769225021, 0.26953213712816143, 0.021713946125138613, 0.18065316170206724, -0.13759093261179173, -0.08123812064959926, -0.14588150762858154, -0.08273889481827965, -0.2305078954162276, -0.07368429342413382, -0.08641696606051061, -0.11690127158847947, 0.36112619441339355, 0.27184728767438715, 0.22916619887175618, 0.05038737971993363, 0.3565553968225074, -0.08102597918763946, 0.15800508546858688, 0.05997781794042047, 0.13394458300439316, -0.031016668048292652, 0.18099454674333082, -0.13697096181370444, 0.07961262126011237, 0.07698321863772127] |
1,802.01944 | $q$-Analogues of two Ramanujan-type formulas for $1/\pi$ | We give $q$-analogues of the following two Ramanujan-type formulas for
$1/\pi$: \begin{align*} \sum_{k=0}^\infty (6k+1)\frac{(\frac{1}{2})_k^3}{k!^3
4^k} =\frac{4}{\pi} \quad\text{and}\quad \sum_{k=0}^\infty
(-1)^k(6k+1)\frac{(\frac{1}{2})_k^3}{k!^3 8^k } =\frac{2\sqrt{2}}{\pi}.
\end{align*} Our proof is based on two $q$-WZ pairs found by the first author
in his earlier work.
| math.NT math.CO | we give qanalogues of the following two ramanujantype formulas for 1pi beginalign sum_k0infty 6k1fracfrac12_k3k3 4k frac4pi quadtextandquad sum_k0infty 1k6k1fracfrac12_k3k3 8k frac2sqrt2pi endalign our proof is based on two qwz pairs found by the first author in his earlier work | [['we', 'give', 'qanalogues', 'of', 'the', 'following', 'two', 'ramanujantype', 'formulas', 'for', '1pi', 'beginalign', 'sum_k0infty', '6k1fracfrac12_k3k3', '4k', 'frac4pi', 'quadtextandquad', 'sum_k0infty', '1k6k1fracfrac12_k3k3', '8k', 'frac2sqrt2pi', 'endalign', 'our', 'proof', 'is', 'based', 'on', 'two', 'qwz', 'pairs', 'found', 'by', 'the', 'first', 'author', 'in', 'his', 'earlier', 'work']] | [-0.20101177718283403, 0.07022259203303191, -0.08504671912588593, 0.02787562658260059, -0.06526896032866919, -0.14991346653550863, 0.007711424854480558, 0.2749972484178013, -0.15757674018904153, -0.20475102360877726, 0.04442010245272993, -0.4199088442449768, -0.16325606537349005, 0.26353972322411007, -0.08566064109254512, -0.01518007428644018, -0.04740334007268151, 0.03412808239873913, -0.024276129914344184, -0.3537049683638745, 0.32033595887737143, -0.14303004717092133, 0.16548453183430764, 0.08365247797013985, 0.08812727581243962, 0.04998210584583123, -0.015747580560855567, -0.15942811407148838, -0.28857727051298654, 0.06927885177234809, 0.2594698595090045, 0.07600473274942487, 0.2415917966928747, -0.35317121704833376, 0.00544916769851827, 0.04276723199937907, 0.15389803665069243, -0.008530020054119328, -0.021033835716985375, -0.30400992629842627, 0.08918484724644157, -0.09816561794529359, -0.07096495643620276, -0.04557610491368299, 0.07007784003184901, 0.05669571156613529, -0.2804581288558741, 0.10433451009966019, 0.155562213039957, 0.08267797677156825, -0.008231562678702176, -0.33381760492920876, 0.10427175923379967, 0.03652318462263793, 0.04792160873896339, 0.07197960949916807, -0.07441802685045534, 0.013083288808249764, -0.13558367210336858, 0.25018135406490827, -0.05611499379544208, -0.10757919028401375, 0.01709228578127093, -0.1723714700848278, -0.2754195601090841, 0.05746961638538374, 0.0015524102103275557, 0.22685246480007967, -0.17274627894059652, 0.09080327540222141, -0.13560708568224478, 0.11792886098070691, 0.23806436409035492, -0.037812813055805035, 0.04545095678056694, 0.013221573472643891, -0.052682796105121575, 0.13652869161321884, 0.04467443056637421, 0.021153840055275295, -0.35098077957000995, -0.22483937594936126, -0.16574581583134002, 0.1565343411380632, -0.047185051733524434, -0.041226514097717076, 0.3133525742871118, 0.11155617850211759, 0.19669579060023856, 0.19462155827528071, 0.2251452002609666, 0.11151982982604143, -0.041916512004617185, 0.01140976206968642, 0.10462376347277313, 0.14780355408503157, 0.12886482933794874, -0.13811334499364925, 0.0018742980254400107, 0.2796598888881918] |
1,802.01945 | Simulation of deflecting structures for dielectric laser driven
accelerators | In laser illuminated dielectric accelerators (DLA) high acceleration
gradients can be achieved, due to high damage thresholds of the materials at
optical frequencies. This is a necessity in developing more compact particle
accelerator technologies. The Accelerator on a CHip International Program
funded by the Gordon and Betty Moore Foundation is researching such devices.
Means to manipulate the beam, i.e. focusing and deflection, are needed for the
proper operation of such devices. These means should rely on the same
technologies for manufacturing and powering like the accelerating structures.
In this study different concepts for dielectric laser driven deflecting
structures are investigated via particle-in-cell (PIC) simulations and compared
afterwards. The comparison is conducted with respect to the suitability for
beam manipulation. Another interesting application will be investigated as a
diagnostic device for ultra short electron bunches from conventional
accelerators functioning like a radio frequency transverse deflecting cavity
(TDS).
| physics.acc-ph | in laser illuminated dielectric accelerators dla high acceleration gradients can be achieved due to high damage thresholds of the materials at optical frequencies this is a necessity in developing more compact particle accelerator technologies the accelerator on a chip international program funded by the gordon and betty moore foundation is researching such devices means to manipulate the beam ie focusing and deflection are needed for the proper operation of such devices these means should rely on the same technologies for manufacturing and powering like the accelerating structures in this study different concepts for dielectric laser driven deflecting structures are investigated via particleincell pic simulations and compared afterwards the comparison is conducted with respect to the suitability for beam manipulation another interesting application will be investigated as a diagnostic device for ultra short electron bunches from conventional accelerators functioning like a radio frequency transverse deflecting cavity tds | [['in', 'laser', 'illuminated', 'dielectric', 'accelerators', 'dla', 'high', 'acceleration', 'gradients', 'can', 'be', 'achieved', 'due', 'to', 'high', 'damage', 'thresholds', 'of', 'the', 'materials', 'at', 'optical', 'frequencies', 'this', 'is', 'a', 'necessity', 'in', 'developing', 'more', 'compact', 'particle', 'accelerator', 'technologies', 'the', 'accelerator', 'on', 'a', 'chip', 'international', 'program', 'funded', 'by', 'the', 'gordon', 'and', 'betty', 'moore', 'foundation', 'is', 'researching', 'such', 'devices', 'means', 'to', 'manipulate', 'the', 'beam', 'ie', 'focusing', 'and', 'deflection', 'are', 'needed', 'for', 'the', 'proper', 'operation', 'of', 'such', 'devices', 'these', 'means', 'should', 'rely', 'on', 'the', 'same', 'technologies', 'for', 'manufacturing', 'and', 'powering', 'like', 'the', 'accelerating', 'structures', 'in', 'this', 'study', 'different', 'concepts', 'for', 'dielectric', 'laser', 'driven', 'deflecting', 'structures', 'are', 'investigated', 'via', 'particleincell', 'pic', 'simulations', 'and', 'compared', 'afterwards', 'the', 'comparison', 'is', 'conducted', 'with', 'respect', 'to', 'the', 'suitability', 'for', 'beam', 'manipulation', 'another', 'interesting', 'application', 'will', 'be', 'investigated', 'as', 'a', 'diagnostic', 'device', 'for', 'ultra', 'short', 'electron', 'bunches', 'from', 'conventional', 'accelerators', 'functioning', 'like', 'a', 'radio', 'frequency', 'transverse', 'deflecting', 'cavity', 'tds']] | [-0.11465885503694402, 0.1788346433233827, -0.04197133403934845, 0.051537713438610556, -0.08667729853665175, -0.17756661066581328, -0.012857215095483635, 0.4505458375668689, -0.21990803836474884, -0.31024942980729975, 0.08379049245220264, -0.2665975059558835, -0.0589302020300537, 0.3188350009835606, -0.012415207940798048, 0.08708037365840314, 0.041352129860283575, -0.07745854954047078, -0.009744371593712943, -0.1363470678868359, 0.24986154861008264, 0.17761383502909991, 0.3418670700135807, 0.03746925833896568, 0.11604341585189104, -0.0021322076125166135, -0.008272754343996807, 0.0025012582502238557, -0.05828607092573218, 0.11158169533145193, 0.268963980909488, 0.08074666309642466, 0.29955120262536794, -0.48300670984154087, -0.2286446498362475, 0.012127630365534036, 0.140379055012464, 0.07416181739623824, -0.13670615135257097, -0.25816213058894627, 0.05968611910125904, -0.1786025874284798, -0.1639054094117106, -0.03284950843495508, -0.008959929487502126, 0.10751741139492504, -0.21369858605353392, -0.06031908346013141, -0.0023723421905393876, 0.08768540321632404, -0.04646051432144005, -0.075899152742214, 0.045194149246975165, 0.06620719273054768, -0.03977847217712934, 0.04511288871306109, 0.21282106686434518, -0.13735431566442147, -0.1341975666869636, 0.40219805541142106, 0.005213255632018084, -0.15667325356809345, 0.2131703513405726, -0.16749400938286968, -0.06152747866493484, 0.11201546562848332, 0.2030673860125754, 0.07352185044565225, -0.14625497671180684, 0.041649339138530195, 0.08962484565244554, 0.14784636648295268, 0.16142688944859251, 0.06684903108693455, 0.26355392510256387, 0.2443897639822266, 0.02976816583884089, 0.1408354451844775, -0.08982768908385443, 0.00034465276546878355, -0.2531765951497531, -0.16090693300564404, -0.1578946512438475, 0.06374925213448515, -0.0013789030789455067, -0.11575820745440991, 0.3730985449678073, 0.12457941383225461, 0.07320087921665344, -0.05525434693187628, 0.3625937182000162, 0.07645783677564819, 0.1156400127140231, 0.05035909034362803, 0.2659794510189087, 0.114240222079488, 0.1541517617385069, -0.18732662273615547, 0.03704880413356913, 0.002096634393251718] |
1,802.01946 | The additive hazard estimator is consistent for continuous-time marginal
structural models | Marginal structural models (MSMs) allow for causal analysis of longitudinal
data. The MSMs were originally developed as discrete time models. Recently,
continuous-time MSMs were presented as a conceptually appealing alternative for
survival analysis. In applied analyses, it is often assumed that the
theoretical treatment weights are known, but these weights are usually unknown
and must be estimated from the data. Here we provide a sufficient condition for
a class of continuous-time MSMs to be consistent even when the weights are
estimated, and we show how additive hazard models can be used to estimate such
weights. Our results suggest that the continuous-time weights perform better
than IPTW when the underlying treatment process is continuous. Furthermore, we
may wish to transform effect estimates of hazards to other scales that are
easier to interpret causally. We show that a general transformation strategy
can be used on weighted cumulative hazard estimates to obtain a range of other
parameters in survival analysis, and demonstrate how this strategy can be
applied on data using our R packages ahw and transform.hazards.
| stat.ME | marginal structural models msms allow for causal analysis of longitudinal data the msms were originally developed as discrete time models recently continuoustime msms were presented as a conceptually appealing alternative for survival analysis in applied analyses it is often assumed that the theoretical treatment weights are known but these weights are usually unknown and must be estimated from the data here we provide a sufficient condition for a class of continuoustime msms to be consistent even when the weights are estimated and we show how additive hazard models can be used to estimate such weights our results suggest that the continuoustime weights perform better than iptw when the underlying treatment process is continuous furthermore we may wish to transform effect estimates of hazards to other scales that are easier to interpret causally we show that a general transformation strategy can be used on weighted cumulative hazard estimates to obtain a range of other parameters in survival analysis and demonstrate how this strategy can be applied on data using our r packages ahw and transformhazards | [['marginal', 'structural', 'models', 'msms', 'allow', 'for', 'causal', 'analysis', 'of', 'longitudinal', 'data', 'the', 'msms', 'were', 'originally', 'developed', 'as', 'discrete', 'time', 'models', 'recently', 'continuoustime', 'msms', 'were', 'presented', 'as', 'a', 'conceptually', 'appealing', 'alternative', 'for', 'survival', 'analysis', 'in', 'applied', 'analyses', 'it', 'is', 'often', 'assumed', 'that', 'the', 'theoretical', 'treatment', 'weights', 'are', 'known', 'but', 'these', 'weights', 'are', 'usually', 'unknown', 'and', 'must', 'be', 'estimated', 'from', 'the', 'data', 'here', 'we', 'provide', 'a', 'sufficient', 'condition', 'for', 'a', 'class', 'of', 'continuoustime', 'msms', 'to', 'be', 'consistent', 'even', 'when', 'the', 'weights', 'are', 'estimated', 'and', 'we', 'show', 'how', 'additive', 'hazard', 'models', 'can', 'be', 'used', 'to', 'estimate', 'such', 'weights', 'our', 'results', 'suggest', 'that', 'the', 'continuoustime', 'weights', 'perform', 'better', 'than', 'iptw', 'when', 'the', 'underlying', 'treatment', 'process', 'is', 'continuous', 'furthermore', 'we', 'may', 'wish', 'to', 'transform', 'effect', 'estimates', 'of', 'hazards', 'to', 'other', 'scales', 'that', 'are', 'easier', 'to', 'interpret', 'causally', 'we', 'show', 'that', 'a', 'general', 'transformation', 'strategy', 'can', 'be', 'used', 'on', 'weighted', 'cumulative', 'hazard', 'estimates', 'to', 'obtain', 'a', 'range', 'of', 'other', 'parameters', 'in', 'survival', 'analysis', 'and', 'demonstrate', 'how', 'this', 'strategy', 'can', 'be', 'applied', 'on', 'data', 'using', 'our', 'r', 'packages', 'ahw', 'and', 'transformhazards']] | [0.010121378818862574, 0.08827923972776897, -0.14570986591604387, 0.15892762095682186, -0.12047913099292579, -0.16669720852595948, 0.049207920270842004, 0.4567220953921246, -0.2668804650758068, -0.3005289474561767, 0.16872016729673284, -0.2223699800182827, -0.16998078857195228, 0.224668413498114, -0.08792579173500281, 0.08172763676685822, 0.08473662525445201, 0.026957799924360207, -0.02780858235200867, -0.2648016271224722, 0.25585180912085614, 0.07052720641733559, 0.2666384556823475, -0.014996326845247559, 0.044446709474953446, 0.0017663761242401115, -0.06501134650289016, 0.03868619396979379, -0.13820526703767788, 0.08705923887142955, 0.29143916742030046, 0.1521632231089698, 0.2813564789763024, -0.4203191876010753, -0.2610939122021718, 0.13741261820744743, 0.13118337752801085, 0.11945390915714724, 0.01690028548876208, -0.2593872748629385, 0.08582365342116709, -0.15712369611313523, -0.07761819847198853, -0.14287834089969523, -0.02420614307832926, 0.04356209198107705, -0.36953630160843565, 0.09991203803916547, 0.031046150361870004, 0.012690698083620085, -0.07848601100890529, -0.15701569188968278, -0.03452025595673382, 0.1324919964918504, 0.05600261455114124, -0.00412491244077141, 0.123048810881216, -0.04516499423622262, -0.1284812280128515, 0.32675682134969636, -0.05554659242735334, -0.25209715498373086, 0.20475287622837132, -0.09194557836041027, -0.15257955643857374, 0.08777704283454303, 0.203833514331775, 0.10394156987908794, -0.206151194684512, 0.006254899734495814, -0.00847631390883349, 0.16159872026291006, -0.014183577486492564, -0.003355788119437801, 0.1612047417235539, 0.14123590667880964, 0.04219030096942862, 0.11965280210702182, -0.09171009594154934, -0.08610294506950088, -0.261195415381862, -0.11159101778338122, -0.180835401417341, 0.03744472591896801, -0.07204101480195721, -0.14911004263355376, 0.352899999118161, 0.2046579594687416, 0.20645150145364188, 0.11494389401077358, 0.25971971080722395, 0.14306945082302433, 0.06440928609443416, 0.05439341915121605, 0.1936041403421049, 0.09492673967737532, 0.02675553886991449, -0.14581797327061163, 0.16537656860837582, 0.004254119461239857] |
1,802.01947 | K-frames in Hilbert $C^*$-modules | In this paper, firstly we investigate conditions under which the action of an
operator on a $K$-frame, remain again a $K$-frame for Hilbert module E. We also
give a generalization of Douglas Theorem and we shall use it to prove the sum
of two $K$-frame under certain condition is again a $K$-frame. Finally, we
characterize the $K$-frame generators for a unitary system in terms of
operators.
| math.OA | in this paper firstly we investigate conditions under which the action of an operator on a kframe remain again a kframe for hilbert module e we also give a generalization of douglas theorem and we shall use it to prove the sum of two kframe under certain condition is again a kframe finally we characterize the kframe generators for a unitary system in terms of operators | [['in', 'this', 'paper', 'firstly', 'we', 'investigate', 'conditions', 'under', 'which', 'the', 'action', 'of', 'an', 'operator', 'on', 'a', 'kframe', 'remain', 'again', 'a', 'kframe', 'for', 'hilbert', 'module', 'e', 'we', 'also', 'give', 'a', 'generalization', 'of', 'douglas', 'theorem', 'and', 'we', 'shall', 'use', 'it', 'to', 'prove', 'the', 'sum', 'of', 'two', 'kframe', 'under', 'certain', 'condition', 'is', 'again', 'a', 'kframe', 'finally', 'we', 'characterize', 'the', 'kframe', 'generators', 'for', 'a', 'unitary', 'system', 'in', 'terms', 'of', 'operators']] | [-0.17530238182481492, 0.0942048800945596, -0.11241952075876972, 0.051698878040593685, -0.01292194166418278, -0.09831697220744734, 0.03516977881681117, 0.36513020069987484, -0.2950742897210699, -0.15565223680018928, 0.12501392542793782, -0.21841948778566087, -0.20494897130199455, 0.19408928039907056, -0.1618723185260244, -0.006654102016579021, 0.0798581638514544, 0.11757086557124487, -0.11119030850629012, -0.2621094570354079, 0.402372680294017, 0.03862682404702134, 0.21562162954642466, 0.09761734717264489, 0.1712505808452878, 0.028828418168069966, 0.014348629466963537, -0.012605872322720561, -0.17645289806761977, 0.09290109880296796, 0.20177391171455383, 0.10892107411442946, 0.2716735366618995, -0.3775036389883043, -0.1071140313676248, 0.18578795888320063, 0.07918969078243455, 0.04001182340840442, -0.005332990350187615, -0.226254156988227, 0.10926496455530552, -0.20093083353430935, -0.1362402981401167, -0.0935656124951713, 0.017762028640418343, -0.04597970901170012, -0.31937268585192435, -0.01282189938523736, 0.13339734331450678, 0.05788264233221222, -0.12170160136531305, -0.03527419100635487, 0.0449432817033746, 0.050794518094114734, 0.013675271036018703, -0.01735515493871362, 0.04878387756109463, -0.08125007134918688, -0.062153140689726126, 0.35616163237754145, -0.07916000801505464, -0.26450839518061414, 0.12498434904299563, -0.11079171511598608, -0.15721924330644083, -0.003495559589337614, 0.1297744670600602, 0.1600691469061668, -0.15975797004207518, 0.13669275754805174, -0.1399556475186149, 0.06529145916415886, 0.10624238073995168, 0.06018694167053609, 0.09799895306103722, 0.08506032024425539, 0.1500740713355216, 0.21589063103734094, 0.005404708924646856, -0.02947537487400978, -0.40253250973976473, -0.2251482769056703, -0.12186992399140516, 0.10321046121305588, -0.04089583841017553, -0.15570092376208666, 0.42699565018781205, 0.15272249562214268, 0.20626584547712948, 0.10805654193973169, 0.2193335518734812, 0.1715520935302431, 0.008786499994157843, 0.07479235503794343, 0.17247713467628328, 0.1681958048491541, 0.047147701868335855, -0.1728237735012292, -0.038789225911552254, 0.1716576088784319] |
1,802.01948 | Random cliques in random graphs and sharp thresholds for $F$-factors | We show that for each $r\ge 4$, in a density range extending up to, and
slightly beyond, the threshold for a $K_r$-factor, the copies of $K_r$ in the
random graph $G(n,p)$ are randomly distributed, in the (one-sided) sense that
the hypergraph that they form contains a copy of a binomial random hypergraph
with almost exactly the right density. Thus Jeff Kahn's recent asymptotically
sharp bound for the threshold in Shamir's hypergraph matching problem implies a
corresponding bound for the threshold for $G(n,p)$ to contain a $K_r$-factor.
The case $r=3$ is more difficult, and has been settled by Annika Heckel. We
also prove a corresponding result for $K_r^{(t)}$-factors in random $t$-uniform
hypergraphs, as well as (in some cases weaker) generalizations replacing $K_r$
by certain other (hyper)graphs.
| math.CO math.PR | we show that for each rge 4 in a density range extending up to and slightly beyond the threshold for a k_rfactor the copies of k_r in the random graph gnp are randomly distributed in the onesided sense that the hypergraph that they form contains a copy of a binomial random hypergraph with almost exactly the right density thus jeff kahns recent asymptotically sharp bound for the threshold in shamirs hypergraph matching problem implies a corresponding bound for the threshold for gnp to contain a k_rfactor the case r3 is more difficult and has been settled by annika heckel we also prove a corresponding result for k_rtfactors in random tuniform hypergraphs as well as in some cases weaker generalizations replacing k_r by certain other hypergraphs | [['we', 'show', 'that', 'for', 'each', 'rge', '4', 'in', 'a', 'density', 'range', 'extending', 'up', 'to', 'and', 'slightly', 'beyond', 'the', 'threshold', 'for', 'a', 'k_rfactor', 'the', 'copies', 'of', 'k_r', 'in', 'the', 'random', 'graph', 'gnp', 'are', 'randomly', 'distributed', 'in', 'the', 'onesided', 'sense', 'that', 'the', 'hypergraph', 'that', 'they', 'form', 'contains', 'a', 'copy', 'of', 'a', 'binomial', 'random', 'hypergraph', 'with', 'almost', 'exactly', 'the', 'right', 'density', 'thus', 'jeff', 'kahns', 'recent', 'asymptotically', 'sharp', 'bound', 'for', 'the', 'threshold', 'in', 'shamirs', 'hypergraph', 'matching', 'problem', 'implies', 'a', 'corresponding', 'bound', 'for', 'the', 'threshold', 'for', 'gnp', 'to', 'contain', 'a', 'k_rfactor', 'the', 'case', 'r3', 'is', 'more', 'difficult', 'and', 'has', 'been', 'settled', 'by', 'annika', 'heckel', 'we', 'also', 'prove', 'a', 'corresponding', 'result', 'for', 'k_rtfactors', 'in', 'random', 'tuniform', 'hypergraphs', 'as', 'well', 'as', 'in', 'some', 'cases', 'weaker', 'generalizations', 'replacing', 'k_r', 'by', 'certain', 'other', 'hypergraphs']] | [-0.11303273450724445, 0.146589484248505, -0.04517081356225688, 0.058074657065740436, -0.0121022418912378, -0.17506870255065074, 0.049910559960198206, 0.34982756505430235, -0.23727172276875402, -0.2909661550303829, 0.0959486821074741, -0.30611171140564514, -0.11972400021632432, 0.13609223745450316, -0.10061906497223211, 0.06549280687983407, 0.05019738144416851, 0.12391117442643544, 0.033351239398098934, -0.25229632292352194, 0.2910041182204608, -0.013696180793960563, 0.20167317644399058, 0.06226501311175525, 0.010085819007592185, 0.04259266362327044, 0.04994838642525166, 0.07925286546997384, -0.17904815969879684, 0.07161406657685236, 0.24548413047231124, 0.11574456846478899, 0.2887987001173076, -0.3611600310045493, -0.19025743232093384, 0.16094713951995382, 0.1575652932877973, 0.09708409456700301, -0.03496122880722873, -0.2309164512548481, 0.1773786139407302, -0.14605788524132832, -0.1226619479559423, 0.0035962000504502507, 0.058946153790247244, 0.011192178826962338, -0.33428980170779665, 0.038944645400958704, 0.1462980799966675, -0.015288995502547163, 0.04592334165344717, -0.17816149622972932, -0.012380745973758643, 0.05859257937332646, -0.0337637879825617, 0.05517465280956726, 0.04233622842956884, -0.14622282251867383, -0.11823328065048506, 0.34901366237795256, -0.07330062752207894, -0.1672118485057879, 0.10565165379924364, -0.13953854602410412, -0.21177452435091015, 0.11372153341128934, 0.07427754935228312, 0.13256473390416043, -0.08984789883977444, 0.14897832905656094, -0.15263800959095175, 0.11130169406533241, 0.1760181107421856, 0.05005049926181587, 0.10906345014256182, 0.08934897396209665, 0.1969553158479193, 0.1834316679174424, 0.010889956468075026, -0.05933802549108924, -0.29105180984393497, -0.10640734876983142, -0.2205007189510726, 0.07810602270242792, -0.1617457995219366, -0.19498632068089286, 0.3739086585043029, 0.10533422369082443, 0.22909254285690114, 0.13947447038591518, 0.2256991572174259, 0.09091816558388108, 0.02079295562427552, 0.1619024021802928, 0.15840288765893554, 0.17968582280636688, 0.006641184976973311, -0.05384661014417003, 0.06541232987532208, 0.09275566426785205] |
1,802.01949 | Invertibility of Generalized Bessel multipliers in Hilbert
$C^{*}$-modules | In this note, a general version of Bessel multipliers in Hilbert
$C^*$-modules is presented and then, many results obtained for multipliers are
extended. Also the conditions for invertibility of generalized multipliers are
investigated in details. The invertibility of multipliers is very important
because it helps us to obtain more reconstruction formula.
| math.OA | in this note a general version of bessel multipliers in hilbert cmodules is presented and then many results obtained for multipliers are extended also the conditions for invertibility of generalized multipliers are investigated in details the invertibility of multipliers is very important because it helps us to obtain more reconstruction formula | [['in', 'this', 'note', 'a', 'general', 'version', 'of', 'bessel', 'multipliers', 'in', 'hilbert', 'cmodules', 'is', 'presented', 'and', 'then', 'many', 'results', 'obtained', 'for', 'multipliers', 'are', 'extended', 'also', 'the', 'conditions', 'for', 'invertibility', 'of', 'generalized', 'multipliers', 'are', 'investigated', 'in', 'details', 'the', 'invertibility', 'of', 'multipliers', 'is', 'very', 'important', 'because', 'it', 'helps', 'us', 'to', 'obtain', 'more', 'reconstruction', 'formula']] | [-0.08730296407798853, 0.0530142443090239, -0.10668575365607645, 0.14697917484377018, -0.11270004683219846, -0.13023346833606234, -0.07133110783373316, 0.4071262719876626, -0.2882643134205365, -0.2038073405879093, 0.1793492207983874, -0.17978317201064498, -0.15116466837478618, 0.2763979090925525, -0.1403444536651174, 0.05663375520859571, 0.08048914191678312, 0.009062436098853746, -0.16216991131659597, -0.2783770068895583, 0.3018484468590103, 0.07296218133905866, 0.2032351392120415, 0.08301401814884123, 0.04524059984467778, 0.04703488419124601, -0.06247013946082078, -0.06189571929109447, -0.11742897620242015, 0.15128122248193798, 0.31084033006838724, 0.09215215874799326, 0.27832409889236387, -0.40874964451672985, -0.13520343651008956, 0.09715668944751515, 0.18419882280788585, -0.00828978521566765, -0.10303209938123759, -0.2829892064682117, 0.08805555858484962, -0.13269514413367883, -0.15688184743710593, -0.1320117638975966, 0.01794803036632491, 0.06008960829306078, -0.32216443844577847, 0.04409881297204479, 0.13077536654457741, 0.005601743692714794, -0.14106780118948103, -0.10768040256602142, 0.05153507321123399, 0.03517765609328361, 0.025102521977661288, -0.04405948674927155, 0.07176983754570578, -0.03657231441991148, -0.037417212145074326, 0.36301078179887697, 0.024117480033287304, -0.3350515043472542, 0.1586816092478294, -0.16552424810680688, -0.1633965201931549, 0.07240749725743252, 0.09286957387766782, 0.1800068506112724, -0.18536158514154308, 0.12872385669969863, -0.12613973705390213, 0.06154080115112604, 0.12569453386480317, 0.07437143335689553, 0.045745756020586864, 0.07157299333416364, 0.17850062639941006, 0.19387832549218015, -0.027331285315620547, -0.061920131775824463, -0.3349954781359902, -0.23611244743498153, -0.16185009303758396, -0.011278793654021095, -0.04899362972269848, -0.12924336757186763, 0.47488702351556106, 0.188722168588463, 0.145794714079695, 0.03267619357097382, 0.24594610243780063, 0.1514977462608002, 0.06314125357597482, 0.0448133623702269, 0.20962171850945144, 0.24955416529201993, 0.12482551019638777, -0.11818631130325444, 0.004721410408177797, 0.22452588885219074] |
1,802.0195 | Frames and numerical approximation II: generalized sampling | In a previous paper [Adcock & Huybrechs, 2019] we described the numerical
approximation of functions using redundant sets and frames. Redundancy in the
function representation offers enormous flexibility compared to using a basis,
but ill-conditioning often prevents the numerical computation of best
approximations. We showed that, in spite of said ill-conditioning,
approximations with regularization may still provide accuracy up to order
$\sqrt{\epsilon}$, where $\epsilon$ is a small truncation threshold. When using
frames, i.e. complete systems that are generally redundant but which provide
infinite representations with coefficients of bounded norm, this accuracy can
actually be achieved for all functions in a space. Here, we generalize that
setting in two ways. We assume information or samples from $f$ from a wide
class of linear operators acting on $f$, rather than inner products associated
with the best approximation projection. This enables the analysis of fully
discrete approximations based, for instance, on function values only. Next, we
allow oversampling, leading to least-squares approximations. We show that this
leads to much improved accuracy on the order of $\epsilon$ rather than
$\sqrt{\epsilon}$. Overall, we demonstrate that numerical function
approximation using redundant representations may lead to highly accurate
approximations in spite of having to solve ill-conditioned systems of
equations.
| math.NA cs.NA | in a previous paper adcock huybrechs 2019 we described the numerical approximation of functions using redundant sets and frames redundancy in the function representation offers enormous flexibility compared to using a basis but illconditioning often prevents the numerical computation of best approximations we showed that in spite of said illconditioning approximations with regularization may still provide accuracy up to order sqrtepsilon where epsilon is a small truncation threshold when using frames ie complete systems that are generally redundant but which provide infinite representations with coefficients of bounded norm this accuracy can actually be achieved for all functions in a space here we generalize that setting in two ways we assume information or samples from f from a wide class of linear operators acting on f rather than inner products associated with the best approximation projection this enables the analysis of fully discrete approximations based for instance on function values only next we allow oversampling leading to leastsquares approximations we show that this leads to much improved accuracy on the order of epsilon rather than sqrtepsilon overall we demonstrate that numerical function approximation using redundant representations may lead to highly accurate approximations in spite of having to solve illconditioned systems of equations | [['in', 'a', 'previous', 'paper', 'adcock', 'huybrechs', '2019', 'we', 'described', 'the', 'numerical', 'approximation', 'of', 'functions', 'using', 'redundant', 'sets', 'and', 'frames', 'redundancy', 'in', 'the', 'function', 'representation', 'offers', 'enormous', 'flexibility', 'compared', 'to', 'using', 'a', 'basis', 'but', 'illconditioning', 'often', 'prevents', 'the', 'numerical', 'computation', 'of', 'best', 'approximations', 'we', 'showed', 'that', 'in', 'spite', 'of', 'said', 'illconditioning', 'approximations', 'with', 'regularization', 'may', 'still', 'provide', 'accuracy', 'up', 'to', 'order', 'sqrtepsilon', 'where', 'epsilon', 'is', 'a', 'small', 'truncation', 'threshold', 'when', 'using', 'frames', 'ie', 'complete', 'systems', 'that', 'are', 'generally', 'redundant', 'but', 'which', 'provide', 'infinite', 'representations', 'with', 'coefficients', 'of', 'bounded', 'norm', 'this', 'accuracy', 'can', 'actually', 'be', 'achieved', 'for', 'all', 'functions', 'in', 'a', 'space', 'here', 'we', 'generalize', 'that', 'setting', 'in', 'two', 'ways', 'we', 'assume', 'information', 'or', 'samples', 'from', 'f', 'from', 'a', 'wide', 'class', 'of', 'linear', 'operators', 'acting', 'on', 'f', 'rather', 'than', 'inner', 'products', 'associated', 'with', 'the', 'best', 'approximation', 'projection', 'this', 'enables', 'the', 'analysis', 'of', 'fully', 'discrete', 'approximations', 'based', 'for', 'instance', 'on', 'function', 'values', 'only', 'next', 'we', 'allow', 'oversampling', 'leading', 'to', 'leastsquares', 'approximations', 'we', 'show', 'that', 'this', 'leads', 'to', 'much', 'improved', 'accuracy', 'on', 'the', 'order', 'of', 'epsilon', 'rather', 'than', 'sqrtepsilon', 'overall', 'we', 'demonstrate', 'that', 'numerical', 'function', 'approximation', 'using', 'redundant', 'representations', 'may', 'lead', 'to', 'highly', 'accurate', 'approximations', 'in', 'spite', 'of', 'having', 'to', 'solve', 'illconditioned', 'systems', 'of', 'equations']] | [-0.09018699047504924, 0.03466241563204676, -0.08143282204764546, 0.05010326686664485, -0.07139549533487298, -0.10664120563073083, 0.07361936476663686, 0.3908514978643507, -0.26227341913618146, -0.2965546225546859, 0.11258117743767798, -0.2582345855142921, -0.1678300714911893, 0.19759571536327714, -0.09623858133258181, 0.07759875140800432, 0.10730786341940984, 0.02815509873587871, -0.15047071778564713, -0.2725930747622624, 0.2956785843614489, 0.04412073575425893, 0.21249712514458224, 0.01024152230587788, 0.1035236519551836, -0.020417553049046546, -0.03281219455529936, 0.028411008348775794, -0.08122569893228501, 0.15220902232133085, 0.27931076545035466, 0.09343662106664852, 0.3217460620752536, -0.42982125918380915, -0.19587770749349148, 0.1336292509213672, 0.18399808044428936, 0.103823238054174, -0.016173226732644253, -0.22306942102732136, 0.10672779169748538, -0.1804833044949919, -0.10318167270394042, -0.17384015844436362, -0.021701317788101734, 0.027059822373557835, -0.3516746667539701, 0.08834122800268233, 0.05312178221065551, 0.020832016860949806, -0.0651325799850747, -0.13685158369364217, 0.05357473767711781, 0.06869621305100736, 0.021950620806310325, 0.05179751508985646, 0.05710809990065172, -0.10673497873474844, -0.07028880309546366, 0.3842954816762358, -0.06518104394621332, -0.2852502606853159, 0.19601092018823693, -0.15777771149296313, -0.10317419416387566, 0.14326940411236136, 0.18114260414848105, 0.13329368086269824, -0.09751063409064954, 0.09747383817073568, -0.016866486070211975, 0.19843853040481918, 0.10230943884933368, 0.057487789327278736, 0.09665242861490697, 0.13429230685927906, 0.10431020193500444, 0.11830650230345782, -0.015283193492505233, -0.08808178917272017, -0.28800888805184516, -0.09048731089154899, -0.17019132175541019, 0.0449579684168566, -0.10357013917986478, -0.17440662724897266, 0.3579857884370722, 0.17705275601125323, 0.20969148479634897, 0.10512379290361423, 0.30066241828724743, 0.13736884915153497, 0.08800180225545773, 0.10334871812083293, 0.2066853583487682, 0.08411130645428784, 0.019772911409381776, -0.1466645238560159, 0.09278161302558147, 0.10627400354736892] |
1,802.01951 | Directed, elliptic and triangular flow of protons in Au+Au reactions at
1.23 AGeV: A theoretical analysis of the recent HADES data | Recently, the HADES experiment at GSI has provided preliminary data on the
directed flow, $v_1$ elliptic flow, $v_2$ and triangular flow, $v_3$ of protons
in Au+Au reactions at a beam energy of 1.23 A GeV. Here we present a
theoretical discussion of these flow harmonics within the UrQMD transport
approach. We show that all flow harmonics, including the triangular flow,
provide a consistent picture of the expansion of the system, if potential
interactions are taken into account. Investigating the dependence of the flow
harmonics on the nuclear interaction potentials it is shown that especially
$v_3$ can serve as a sensitive probe for the nuclear equation of state at such
low energies. The triangular flow and its excitation function with respect to
the reaction-plane were calculated for the first time and indicate a complex
interplay of the time-evolution of the system and the initial conditions at low
beam-energies. Our study also indicates a significant softening of the equation
of state at beam energies above $E_{\mathrm{lab}}> 7$A GeV which can be
explored by at the future FAIR facility.
| nucl-th | recently the hades experiment at gsi has provided preliminary data on the directed flow v_1 elliptic flow v_2 and triangular flow v_3 of protons in auau reactions at a beam energy of 123 a gev here we present a theoretical discussion of these flow harmonics within the urqmd transport approach we show that all flow harmonics including the triangular flow provide a consistent picture of the expansion of the system if potential interactions are taken into account investigating the dependence of the flow harmonics on the nuclear interaction potentials it is shown that especially v_3 can serve as a sensitive probe for the nuclear equation of state at such low energies the triangular flow and its excitation function with respect to the reactionplane were calculated for the first time and indicate a complex interplay of the timeevolution of the system and the initial conditions at low beamenergies our study also indicates a significant softening of the equation of state at beam energies above e_mathrmlab 7a gev which can be explored by at the future fair facility | [['recently', 'the', 'hades', 'experiment', 'at', 'gsi', 'has', 'provided', 'preliminary', 'data', 'on', 'the', 'directed', 'flow', 'v_1', 'elliptic', 'flow', 'v_2', 'and', 'triangular', 'flow', 'v_3', 'of', 'protons', 'in', 'auau', 'reactions', 'at', 'a', 'beam', 'energy', 'of', '123', 'a', 'gev', 'here', 'we', 'present', 'a', 'theoretical', 'discussion', 'of', 'these', 'flow', 'harmonics', 'within', 'the', 'urqmd', 'transport', 'approach', 'we', 'show', 'that', 'all', 'flow', 'harmonics', 'including', 'the', 'triangular', 'flow', 'provide', 'a', 'consistent', 'picture', 'of', 'the', 'expansion', 'of', 'the', 'system', 'if', 'potential', 'interactions', 'are', 'taken', 'into', 'account', 'investigating', 'the', 'dependence', 'of', 'the', 'flow', 'harmonics', 'on', 'the', 'nuclear', 'interaction', 'potentials', 'it', 'is', 'shown', 'that', 'especially', 'v_3', 'can', 'serve', 'as', 'a', 'sensitive', 'probe', 'for', 'the', 'nuclear', 'equation', 'of', 'state', 'at', 'such', 'low', 'energies', 'the', 'triangular', 'flow', 'and', 'its', 'excitation', 'function', 'with', 'respect', 'to', 'the', 'reactionplane', 'were', 'calculated', 'for', 'the', 'first', 'time', 'and', 'indicate', 'a', 'complex', 'interplay', 'of', 'the', 'timeevolution', 'of', 'the', 'system', 'and', 'the', 'initial', 'conditions', 'at', 'low', 'beamenergies', 'our', 'study', 'also', 'indicates', 'a', 'significant', 'softening', 'of', 'the', 'equation', 'of', 'state', 'at', 'beam', 'energies', 'above', 'e_mathrmlab', '7a', 'gev', 'which', 'can', 'be', 'explored', 'by', 'at', 'the', 'future', 'fair', 'facility']] | [-0.1134957182666819, 0.17869141476494926, -0.15698674953309819, 0.06375249165043767, 0.012640965133905412, -0.09549513053947262, -0.0566197985863047, 0.3678057647815772, -0.2579386416237269, -0.2788378894026391, 0.0424930179139067, -0.32866078894053186, 0.003311963166509356, 0.19812249226495623, 0.07663819104765675, 0.06311778031256315, 0.11737744658254087, 0.05120392233549085, -0.026362747148211515, -0.14884833246752222, 0.29497441425121257, 0.09791727644524403, 0.2559054054838738, 0.16910981335211545, 0.10507158061555986, 0.000687796853017062, 0.024985318537801504, 0.029041648017508644, -0.15822895624167618, 0.07277180687657424, 0.22957572948753036, 0.017402000351409826, 0.1856978603452444, -0.41085179585431303, -0.21260652140847275, 0.0734863577264228, 0.11937012034601399, 0.09348344878626189, -0.08935546564337399, -0.24308361522587282, 0.06730880277331121, -0.1890708121604153, -0.13792969993531837, -0.07549476215748914, -0.007009644891534533, 0.07500188375756676, -0.2932433339421238, 0.1118129459886612, 0.02368342268147639, 0.07887500956122365, -0.07243771357528334, -0.16411914646758566, -0.07708369552024773, 0.07381227916771813, 0.03119667511566409, 0.06360050042692039, 0.11583013802101569, -0.12675185844302178, -0.07550430001957076, 0.4244048813624041, -0.014459654414760215, -0.13025515249797276, 0.14662486330206906, -0.20622582230716943, -0.1151045276550576, 0.1512821460408824, 0.23073477277000035, 0.08518550850717085, -0.13844653275396143, 0.008055189043349986, -0.04741827319243125, 0.14820594575888077, 0.05593755164183676, -0.0154118244163692, 0.19147314823631728, 0.18753006021891322, 0.06186713162011334, 0.1153525747816145, -0.0834236302732357, -0.08096879781356879, -0.34853605952379957, -0.08959696436018151, -0.14899045387016877, 0.03389195746343051, -0.08226800656178966, -0.05014088494753066, 0.4360520440446479, 0.0875205117144755, 0.23152136032602616, -0.02440967874002776, 0.2784425833821297, 0.12693386001578932, 0.04741031727088349, 0.09332318813406995, 0.28273478503205945, 0.1413724849891982, 0.18218630941318614, -0.277561542325254, 0.0295351900080485, 0.03691553996077605] |
1,802.01952 | Volume growth, curvature, and Buser-type inequalities in graphs | We study the volume growth of metric balls as a function of the radius in
discrete spaces, and focus on the relationship between volume growth and
discrete curvature. We improve volume growth bounds under a lower bound on the
so-called Ollivier curvature, and discuss similar results under other types of
discrete Ricci curvature. Following recent work in the continuous setting of
Riemannian manifolds (by the first author), we then bound the eigenvalues of
the Laplacian of a graph under bounds on the volume growth. In particular, the
spectral gap of the graph can be bounded using a weighted discrete Hardy
inequality and the higher eigenvalues of the graph can be bounded by the
eigenvalues of a tridiagonal matrix times a multiplicative factor, both of
which only depend on the volume growth of the graph. As a direct application,
we relate the eigenvalues to the Cheeger isoperimetric constant. Using these
methods, we describe classes of graphs for which the Cheeger inequality is
tight on the second eigenvalue. We also describe a method for proving Buser's
inequality in graphs, particularly under a lower bound assumption on curvature.
| math.CO | we study the volume growth of metric balls as a function of the radius in discrete spaces and focus on the relationship between volume growth and discrete curvature we improve volume growth bounds under a lower bound on the socalled ollivier curvature and discuss similar results under other types of discrete ricci curvature following recent work in the continuous setting of riemannian manifolds by the first author we then bound the eigenvalues of the laplacian of a graph under bounds on the volume growth in particular the spectral gap of the graph can be bounded using a weighted discrete hardy inequality and the higher eigenvalues of the graph can be bounded by the eigenvalues of a tridiagonal matrix times a multiplicative factor both of which only depend on the volume growth of the graph as a direct application we relate the eigenvalues to the cheeger isoperimetric constant using these methods we describe classes of graphs for which the cheeger inequality is tight on the second eigenvalue we also describe a method for proving busers inequality in graphs particularly under a lower bound assumption on curvature | [['we', 'study', 'the', 'volume', 'growth', 'of', 'metric', 'balls', 'as', 'a', 'function', 'of', 'the', 'radius', 'in', 'discrete', 'spaces', 'and', 'focus', 'on', 'the', 'relationship', 'between', 'volume', 'growth', 'and', 'discrete', 'curvature', 'we', 'improve', 'volume', 'growth', 'bounds', 'under', 'a', 'lower', 'bound', 'on', 'the', 'socalled', 'ollivier', 'curvature', 'and', 'discuss', 'similar', 'results', 'under', 'other', 'types', 'of', 'discrete', 'ricci', 'curvature', 'following', 'recent', 'work', 'in', 'the', 'continuous', 'setting', 'of', 'riemannian', 'manifolds', 'by', 'the', 'first', 'author', 'we', 'then', 'bound', 'the', 'eigenvalues', 'of', 'the', 'laplacian', 'of', 'a', 'graph', 'under', 'bounds', 'on', 'the', 'volume', 'growth', 'in', 'particular', 'the', 'spectral', 'gap', 'of', 'the', 'graph', 'can', 'be', 'bounded', 'using', 'a', 'weighted', 'discrete', 'hardy', 'inequality', 'and', 'the', 'higher', 'eigenvalues', 'of', 'the', 'graph', 'can', 'be', 'bounded', 'by', 'the', 'eigenvalues', 'of', 'a', 'tridiagonal', 'matrix', 'times', 'a', 'multiplicative', 'factor', 'both', 'of', 'which', 'only', 'depend', 'on', 'the', 'volume', 'growth', 'of', 'the', 'graph', 'as', 'a', 'direct', 'application', 'we', 'relate', 'the', 'eigenvalues', 'to', 'the', 'cheeger', 'isoperimetric', 'constant', 'using', 'these', 'methods', 'we', 'describe', 'classes', 'of', 'graphs', 'for', 'which', 'the', 'cheeger', 'inequality', 'is', 'tight', 'on', 'the', 'second', 'eigenvalue', 'we', 'also', 'describe', 'a', 'method', 'for', 'proving', 'busers', 'inequality', 'in', 'graphs', 'particularly', 'under', 'a', 'lower', 'bound', 'assumption', 'on', 'curvature']] | [-0.11811064544159013, 0.09147489281383821, -0.0836105896034152, 0.07539602030584638, -0.08098068630977256, -0.08409903222141234, 0.04057889906437816, 0.32577670382939883, -0.260346778660912, -0.27058293463007826, 0.16471917115504275, -0.2656088857106059, -0.16982620404529813, 0.1995885038823896, -0.10849492425300382, 0.06486203293190212, 0.04376874808222055, 0.10032335002529057, -0.0753956691827625, -0.264218710091695, 0.40125424000057014, -0.0006957099244401262, 0.2384751869969674, 0.15915410337793465, 0.05465425794088357, -0.03208074143307434, -0.004509956173196032, 0.04421878877171391, -0.24129152576866988, 0.1850737168717928, 0.16115993632859474, 0.10135478062202802, 0.2705852951451733, -0.39997618775311355, -0.19013491297593793, 0.191816168771805, 0.08889230424538255, 0.030584432251399032, -0.02511811574442765, -0.29355946699711116, 0.08375762550009264, -0.0805423135239933, -0.09570111272372053, -0.033333441537074945, -0.00954315133795545, 0.03345026765176019, -0.2570491881814559, 0.11679009700908224, 0.11000002822964577, 0.018202502184824363, -0.08623795246554387, -0.11739502499836522, 0.0012944739865692887, 0.08499681068382955, 0.01483352317575466, -0.019037056375748, 0.08837081411400356, -0.06496216844817673, -0.11028245530166739, 0.31899828970230915, -0.10964415846518366, -0.2430422645313917, 0.0930892554287975, -0.15111046335785774, -0.16022235814330948, 0.05568490326907989, 0.22150016618716353, 0.15385724430954134, -0.07573156120331102, 0.16730918195224492, -0.06774059150154023, 0.12107165072969085, 0.13742014905437827, 0.0233905825040278, 0.06183429151093839, 0.12180050385335611, 0.1976598806559687, 0.1655493067766263, -0.004834712494866344, -0.08362867086465042, -0.32628075847955973, -0.1952607749064604, -0.2777730491591265, 0.08511450213153621, -0.21109075636769695, -0.19692720846222664, 0.41009754805347404, 0.00696933498555744, 0.2237478090330606, 0.1467687272605159, 0.23288424498326069, 0.11979953810648136, 0.03940914624773369, 0.10901770231037124, 0.2006992969234046, 0.21616935201266127, 0.054101427156176114, -0.17071084566304234, 0.04013385756658642, 0.16762824202557347] |
1,802.01953 | The contribution of faint AGNs to the ionizing background at z~4 | Finding the sources responsible for the hydrogen reionization is one of the
most pressing issues in cosmology. Bright QSOs are known to ionize their
surrounding neighborhood, but they are too few to ensure the required HI
ionizing background. A significant contribution by faint AGNs, however, could
solve the problem, as recently advocated on the basis of a relatively large
space density of faint active nuclei at z>4. We have carried out an exploratory
spectroscopic program to measure the HI ionizing emission of 16 faint AGNs
spanning a broad U-I color interval, with I~21-23 and 3.6<z<4.2. These AGNs are
three magnitudes fainter than the typical SDSS QSOs (M1450<~-26) which are
known to ionize their surrounding IGM at z>~4. The LyC escape fraction has been
detected with S/N ratio of ~10-120 and is between 44 and 100% for all the
observed faint AGNs, with a mean value of 74% at 3.6<z<4.2 and
-25.1<M1450<-23.3, in agreement with the value found in the literature for much
brighter QSOs (M1450<~-26) at the same redshifts. The LyC escape fraction of
our faint AGNs does not show any dependence on the absolute luminosities or on
the observed U-I colors. Assuming that the LyC escape fraction remains close to
~75% down to M1450~-18, we find that the AGN population can provide between 16
and 73% (depending on the adopted luminosity function) of the whole ionizing UV
background at z~4, measured through the Lyman forest. This contribution
increases to 25-100% if other determinations of the ionizing UV background are
adopted. Extrapolating these results to z~5-7, there are possible indications
that bright QSOs and faint AGNs can provide a significant contribution to the
reionization of the Universe, if their space density is high at M1450~-23.
| astro-ph.GA | finding the sources responsible for the hydrogen reionization is one of the most pressing issues in cosmology bright qsos are known to ionize their surrounding neighborhood but they are too few to ensure the required hi ionizing background a significant contribution by faint agns however could solve the problem as recently advocated on the basis of a relatively large space density of faint active nuclei at z4 we have carried out an exploratory spectroscopic program to measure the hi ionizing emission of 16 faint agns spanning a broad ui color interval with i2123 and 36z42 these agns are three magnitudes fainter than the typical sdss qsos m145026 which are known to ionize their surrounding igm at z4 the lyc escape fraction has been detected with sn ratio of 10120 and is between 44 and 100 for all the observed faint agns with a mean value of 74 at 36z42 and 251m1450233 in agreement with the value found in the literature for much brighter qsos m145026 at the same redshifts the lyc escape fraction of our faint agns does not show any dependence on the absolute luminosities or on the observed ui colors assuming that the lyc escape fraction remains close to 75 down to m145018 we find that the agn population can provide between 16 and 73 depending on the adopted luminosity function of the whole ionizing uv background at z4 measured through the lyman forest this contribution increases to 25100 if other determinations of the ionizing uv background are adopted extrapolating these results to z57 there are possible indications that bright qsos and faint agns can provide a significant contribution to the reionization of the universe if their space density is high at m145023 | [['finding', 'the', 'sources', 'responsible', 'for', 'the', 'hydrogen', 'reionization', 'is', 'one', 'of', 'the', 'most', 'pressing', 'issues', 'in', 'cosmology', 'bright', 'qsos', 'are', 'known', 'to', 'ionize', 'their', 'surrounding', 'neighborhood', 'but', 'they', 'are', 'too', 'few', 'to', 'ensure', 'the', 'required', 'hi', 'ionizing', 'background', 'a', 'significant', 'contribution', 'by', 'faint', 'agns', 'however', 'could', 'solve', 'the', 'problem', 'as', 'recently', 'advocated', 'on', 'the', 'basis', 'of', 'a', 'relatively', 'large', 'space', 'density', 'of', 'faint', 'active', 'nuclei', 'at', 'z4', 'we', 'have', 'carried', 'out', 'an', 'exploratory', 'spectroscopic', 'program', 'to', 'measure', 'the', 'hi', 'ionizing', 'emission', 'of', '16', 'faint', 'agns', 'spanning', 'a', 'broad', 'ui', 'color', 'interval', 'with', 'i2123', 'and', '36z42', 'these', 'agns', 'are', 'three', 'magnitudes', 'fainter', 'than', 'the', 'typical', 'sdss', 'qsos', 'm145026', 'which', 'are', 'known', 'to', 'ionize', 'their', 'surrounding', 'igm', 'at', 'z4', 'the', 'lyc', 'escape', 'fraction', 'has', 'been', 'detected', 'with', 'sn', 'ratio', 'of', '10120', 'and', 'is', 'between', '44', 'and', '100', 'for', 'all', 'the', 'observed', 'faint', 'agns', 'with', 'a', 'mean', 'value', 'of', '74', 'at', '36z42', 'and', '251m1450233', 'in', 'agreement', 'with', 'the', 'value', 'found', 'in', 'the', 'literature', 'for', 'much', 'brighter', 'qsos', 'm145026', 'at', 'the', 'same', 'redshifts', 'the', 'lyc', 'escape', 'fraction', 'of', 'our', 'faint', 'agns', 'does', 'not', 'show', 'any', 'dependence', 'on', 'the', 'absolute', 'luminosities', 'or', 'on', 'the', 'observed', 'ui', 'colors', 'assuming', 'that', 'the', 'lyc', 'escape', 'fraction', 'remains', 'close', 'to', '75', 'down', 'to', 'm145018', 'we', 'find', 'that', 'the', 'agn', 'population', 'can', 'provide', 'between', '16', 'and', '73', 'depending', 'on', 'the', 'adopted', 'luminosity', 'function', 'of', 'the', 'whole', 'ionizing', 'uv', 'background', 'at', 'z4', 'measured', 'through', 'the', 'lyman', 'forest', 'this', 'contribution', 'increases', 'to', '25100', 'if', 'other', 'determinations', 'of', 'the', 'ionizing', 'uv', 'background', 'are', 'adopted', 'extrapolating', 'these', 'results', 'to', 'z57', 'there', 'are', 'possible', 'indications', 'that', 'bright', 'qsos', 'and', 'faint', 'agns', 'can', 'provide', 'a', 'significant', 'contribution', 'to', 'the', 'reionization', 'of', 'the', 'universe', 'if', 'their', 'space', 'density', 'is', 'high', 'at', 'm145023']] | [0.002338302092263576, 0.1269491155458373, -0.016715513270798843, 0.1350059223063761, -0.0860366517886358, -0.08373181901314036, 0.0800719001037926, 0.47974776645402833, -0.10267485217619957, -0.3747955940273802, 0.03598056638920982, -0.3703230614656253, 0.039559159758214966, 0.17823586285716117, -0.02963811067598687, -0.03470628122573833, -0.020269878057759618, -0.10194339745552766, -0.010940521967888134, -0.3305713529799416, 0.27080722941280705, 0.08374097647434538, 0.17712199449075205, 0.009672596677885616, 0.09350034131606308, -0.11520439226832577, -0.11729471045226827, -0.014399773469203176, -0.12548002922301335, 0.008391784930631975, 0.27989807073951495, 0.1472323776096894, 0.27234397425117907, -0.31093308950239784, -0.1858629570796494, 0.1582039351102691, 0.22046437227782467, 0.0665509596341777, -0.05933305462788696, -0.2449879880258242, 0.0852285631649055, -0.12081440596120825, -0.15651527195050977, 0.07648415340548582, 0.058703732602836206, 0.012432563509069221, -0.1801728615818868, 0.11141668561684634, -0.039403091859331336, 0.05502575138308081, -0.08249082193719996, -0.10415313991302766, -0.08751739485152335, 0.07385498126514847, 0.031172270262075946, 0.09401569677691651, 0.2184954656620883, -0.18303414530773052, 0.0005994949015765198, 0.40507123170803816, -0.03970962176117281, 0.007758262234366758, 0.23190825134902412, -0.22751914799072198, -0.1897658754031078, 0.22708181270048533, 0.13123734742369408, 0.09993022642962446, -0.12101886536428429, -0.012559612896478322, -0.011926926676661368, 0.24051152937709344, -0.0012753755257663313, 0.10669568238759625, 0.30801250588565743, 0.06113844856221417, 0.05770371796139634, 0.0642767068986707, -0.19282724048155578, 0.04486136394132614, -0.27580485460667836, -0.062124786052906666, -0.12502524767840947, 0.13696813208286587, -0.13266219103354573, -0.13640219741563955, 0.3104672084498599, 0.15205342245846315, 0.21712161684644135, 0.10531782787940415, 0.3075337933631957, 0.1254415109479171, 0.09270561717359, 0.1181924553169442, 0.3728675058057754, 0.14583632223045837, 0.06818709282636548, -0.2036430403928101, 0.08016349491411114, -0.004258313580014363] |
1,802.01954 | Probing the Interface of a Phase-Separated State in a Repulsive
Bose-Fermi Mixture | We probe the interface between a phase-separated Bose-Fermi mixture
consisting of a small BEC of $^{41}$K residing in a large Fermi sea of $^6$Li.
We quantify the residual spatial overlap between the two components by
measuring three-body recombination losses for variable strength of the
interspecies repulsion. A comparison with a numerical mean-field model
highlights the importance of the kinetic energy term for the condensed bosons
in maintaining the thin interface far into the phase-separated regime. Our
results demonstrate a corresponding smoothing of the phase transition in a
system of finite size.
| quant-ph cond-mat.quant-gas | we probe the interface between a phaseseparated bosefermi mixture consisting of a small bec of 41k residing in a large fermi sea of 6li we quantify the residual spatial overlap between the two components by measuring threebody recombination losses for variable strength of the interspecies repulsion a comparison with a numerical meanfield model highlights the importance of the kinetic energy term for the condensed bosons in maintaining the thin interface far into the phaseseparated regime our results demonstrate a corresponding smoothing of the phase transition in a system of finite size | [['we', 'probe', 'the', 'interface', 'between', 'a', 'phaseseparated', 'bosefermi', 'mixture', 'consisting', 'of', 'a', 'small', 'bec', 'of', '41k', 'residing', 'in', 'a', 'large', 'fermi', 'sea', 'of', '6li', 'we', 'quantify', 'the', 'residual', 'spatial', 'overlap', 'between', 'the', 'two', 'components', 'by', 'measuring', 'threebody', 'recombination', 'losses', 'for', 'variable', 'strength', 'of', 'the', 'interspecies', 'repulsion', 'a', 'comparison', 'with', 'a', 'numerical', 'meanfield', 'model', 'highlights', 'the', 'importance', 'of', 'the', 'kinetic', 'energy', 'term', 'for', 'the', 'condensed', 'bosons', 'in', 'maintaining', 'the', 'thin', 'interface', 'far', 'into', 'the', 'phaseseparated', 'regime', 'our', 'results', 'demonstrate', 'a', 'corresponding', 'smoothing', 'of', 'the', 'phase', 'transition', 'in', 'a', 'system', 'of', 'finite', 'size']] | [-0.15659583207209604, 0.20766981512917063, -0.055262613985278125, 0.05728198381673012, 0.05634348372324974, -0.13328832200124532, 0.0809507329799849, 0.32040351099119735, -0.23825628861048065, -0.271294660620637, -0.029156899815271763, -0.29991033362163294, -0.05395228085415131, 0.12166009836953011, 0.08345119019581394, 0.014428637935242686, 0.03896342483758517, -0.055230235222952215, -0.10881409475805012, -0.17773165542550468, 0.3342769549786021, 5.038694611617497e-05, 0.283222186194917, 0.1182384184602607, 0.10213173473903725, 9.157769714615174e-06, 0.04805661725637677, 0.014173848621015037, -0.1311613435109893, 0.08555380061555368, 0.22565480734088592, -0.03625034583236122, 0.2891427572448175, -0.3934945757168212, -0.22406699946457212, 0.10002973808518069, 0.1630770547627625, 0.16763919783285358, -0.06462075039974649, -0.31429103918752255, -0.054127933865587056, -0.2116464315760103, -0.14356504015849678, -0.0459732812123148, 0.0017411953028915756, 0.04380817210895347, -0.2684688879168019, 0.12626118147246806, 0.050922292980600845, 0.0831143988275921, -0.09566132809741648, -0.11331969731267295, -0.031003462721255946, 0.09491136044540166, 0.007791418314829551, -0.0064435187371570495, 0.11779947055933568, -0.20661674892263754, -0.0023932865524029993, 0.3644566793649734, -0.11792009599905993, -0.1600866275071934, 0.2411321468733169, -0.1468919874578305, -0.046504876105585596, 0.1736129442649474, 0.1816854192721811, 0.03484557091084483, -0.12237104196306113, 0.07693477781428086, -0.04019785536821563, 0.20970469319189972, 0.03729711344035772, 0.022685490241581268, 0.2611960723259292, 0.2673908632944573, 0.001654231569593501, 0.20290229675503305, -0.17146244504908612, -0.14463412530392736, -0.2739752108016266, -0.15325475448568526, -0.22999655103802188, -0.03974851263062722, -0.10153570070166837, -0.19422033975146466, 0.3819577199314813, 0.11324490576593595, 0.2563661001827363, -0.003329482454049227, 0.29437677276187707, 0.07880462103415854, 0.03276902822532005, 0.022774809500673315, 0.27596350464007846, 0.15162939998157487, 0.05432708890981343, -0.32125642244796176, 0.01639059900848584, 0.0666948973027232] |
1,802.01955 | Development of a Home Automation System Using Wireless Sensor/Actuator
Nodes | This work presents the design and implementation of a wireless home
monitoring and automation system consisting of wireless sensor/actuator nodes,
wireless camera, and a home server. The low-cost wireless sensor/actuator node
features temperature, light intensity and motion sensors, and actuator driver
circuits for the control of motors, heaters, and lights. Server and client
programs used to monitor and control the home were also developed. The home
server receives and processes sensor readings, such as temperature and light
intensity readings, and also transmits user commands to wireless nodes. The
system provides ambient condition monitoring, graphing of sensor data,
intrusion detection, automated device control, and video monitoring in order to
achieve improved security and comfort in the home. In addition, users have the
flexibility of determining sensor-actuator interaction at run-time. The
developed system could also put the home in various configurable modes based on
user requests, time or environmental cues.
| eess.SP cs.NI | this work presents the design and implementation of a wireless home monitoring and automation system consisting of wireless sensoractuator nodes wireless camera and a home server the lowcost wireless sensoractuator node features temperature light intensity and motion sensors and actuator driver circuits for the control of motors heaters and lights server and client programs used to monitor and control the home were also developed the home server receives and processes sensor readings such as temperature and light intensity readings and also transmits user commands to wireless nodes the system provides ambient condition monitoring graphing of sensor data intrusion detection automated device control and video monitoring in order to achieve improved security and comfort in the home in addition users have the flexibility of determining sensoractuator interaction at runtime the developed system could also put the home in various configurable modes based on user requests time or environmental cues | [['this', 'work', 'presents', 'the', 'design', 'and', 'implementation', 'of', 'a', 'wireless', 'home', 'monitoring', 'and', 'automation', 'system', 'consisting', 'of', 'wireless', 'sensoractuator', 'nodes', 'wireless', 'camera', 'and', 'a', 'home', 'server', 'the', 'lowcost', 'wireless', 'sensoractuator', 'node', 'features', 'temperature', 'light', 'intensity', 'and', 'motion', 'sensors', 'and', 'actuator', 'driver', 'circuits', 'for', 'the', 'control', 'of', 'motors', 'heaters', 'and', 'lights', 'server', 'and', 'client', 'programs', 'used', 'to', 'monitor', 'and', 'control', 'the', 'home', 'were', 'also', 'developed', 'the', 'home', 'server', 'receives', 'and', 'processes', 'sensor', 'readings', 'such', 'as', 'temperature', 'and', 'light', 'intensity', 'readings', 'and', 'also', 'transmits', 'user', 'commands', 'to', 'wireless', 'nodes', 'the', 'system', 'provides', 'ambient', 'condition', 'monitoring', 'graphing', 'of', 'sensor', 'data', 'intrusion', 'detection', 'automated', 'device', 'control', 'and', 'video', 'monitoring', 'in', 'order', 'to', 'achieve', 'improved', 'security', 'and', 'comfort', 'in', 'the', 'home', 'in', 'addition', 'users', 'have', 'the', 'flexibility', 'of', 'determining', 'sensoractuator', 'interaction', 'at', 'runtime', 'the', 'developed', 'system', 'could', 'also', 'put', 'the', 'home', 'in', 'various', 'configurable', 'modes', 'based', 'on', 'user', 'requests', 'time', 'or', 'environmental', 'cues']] | [-0.236164438343179, 0.037236395502790204, -0.02937869357914236, -0.07938555904547684, -0.11391935657042809, -0.3077142700062108, 0.13057171083307145, 0.4096047822889444, -0.23280470615026314, -0.348682087921613, 0.11284862362741921, -0.31259739777463413, -0.11627906803639505, 0.19073859182331157, -0.1880423093302729, 0.10914799894797741, 0.049010398840338795, 0.055163744794569806, 0.09621186602728542, -0.2127300687354511, 0.2039122912699256, 0.08250356743087035, 0.355116823404977, 0.07694385119877453, 0.1273725874276794, 0.06034988865124162, -0.0388350634351121, -0.06553137174971099, -0.030408792864732647, 0.08950568942000738, 0.3829656998265843, 0.17710897367057465, 0.28353668213192673, -0.4893686624143172, -0.2102281300074144, 0.04413190901254278, 0.10626068379379167, 0.007459047634305584, -0.06020519770036854, -0.37942668611838204, 0.0767599174538879, -0.25020149304858735, -0.091956301073141, -0.008769375517511287, 0.0033370785201220095, 0.08730127069646039, -0.28806139421775134, -0.09091901629309743, -0.04517969568700504, 0.12824727593593904, -0.08716816095182219, 0.004429049203895989, -0.03426792467016148, 0.25701525069401926, -0.021186880005139706, -0.025482185081125715, 0.3102348586292686, -0.1301519512623624, -0.11626524768920767, 0.3717189552372548, 0.04614090042682742, -0.13162158152978942, 0.1859159610828863, -0.020424675740729516, -0.11441759112278453, 0.081553515248202, 0.30728407377200956, 0.04413286751966823, -0.23817903801446427, -0.01753857723520628, 0.10437598345625038, 0.188085419187209, 0.08074844368683123, 0.08597328761793874, 0.17268490448524873, 0.22938211666218736, 0.15000381510283142, 0.09573065725507567, -0.1325625917902594, -0.031042404922757397, -0.2069107945827528, -0.15813686822641743, -0.1862467823304689, -0.010909009237169615, -0.09110539455650724, -0.07868353192493119, 0.41931267510910797, 0.2316072874236852, 0.06702071526622702, 0.05575027859241173, 0.4473550862985084, 0.0382309625250904, 0.10569506961650946, 0.11697620110007355, 0.14505460207677773, 0.0024808405511509125, 0.2803563212227026, -0.1764920775957934, 0.12679857703089412, -0.033417510556220706] |
1,802.01956 | Characterization of self-injected electron beams from LWFA experiments
at SPARC_LAB | The plasma-based acceleration is an encouraging technique to overcome the
limits of the accelerating gradient in the conventional RF acceleration. A
plasma accelerator is able to provide accelerating fields up to hundreds of
$GeV/m$, paving the way to accelerate particles to several MeV over a short
distance (below the millimetre range). Here the characteristics of preliminary
electron beams obtained with the self-injection mechanism produced with the
FLAME high-power laser at the SPARC_LAB test facility are shown. In detail,
with an energy laser on focus of $1.5\ J$ and a pulse temporal length (FWHM) of
$40\ fs$, we obtained an electron plasma density due to laser ionization of
about $6 \times 10^{18}\ cm^{-3}$, electron energy up to $350\ MeV$ and beam
charge in the range $(50 - 100)\ pC$.
| physics.acc-ph hep-ex | the plasmabased acceleration is an encouraging technique to overcome the limits of the accelerating gradient in the conventional rf acceleration a plasma accelerator is able to provide accelerating fields up to hundreds of gevm paving the way to accelerate particles to several mev over a short distance below the millimetre range here the characteristics of preliminary electron beams obtained with the selfinjection mechanism produced with the flame highpower laser at the sparc_lab test facility are shown in detail with an energy laser on focus of 15 j and a pulse temporal length fwhm of 40 fs we obtained an electron plasma density due to laser ionization of about 6 times 1018 cm3 electron energy up to 350 mev and beam charge in the range 50 100 pc | [['the', 'plasmabased', 'acceleration', 'is', 'an', 'encouraging', 'technique', 'to', 'overcome', 'the', 'limits', 'of', 'the', 'accelerating', 'gradient', 'in', 'the', 'conventional', 'rf', 'acceleration', 'a', 'plasma', 'accelerator', 'is', 'able', 'to', 'provide', 'accelerating', 'fields', 'up', 'to', 'hundreds', 'of', 'gevm', 'paving', 'the', 'way', 'to', 'accelerate', 'particles', 'to', 'several', 'mev', 'over', 'a', 'short', 'distance', 'below', 'the', 'millimetre', 'range', 'here', 'the', 'characteristics', 'of', 'preliminary', 'electron', 'beams', 'obtained', 'with', 'the', 'selfinjection', 'mechanism', 'produced', 'with', 'the', 'flame', 'highpower', 'laser', 'at', 'the', 'sparc_lab', 'test', 'facility', 'are', 'shown', 'in', 'detail', 'with', 'an', 'energy', 'laser', 'on', 'focus', 'of', '15', 'j', 'and', 'a', 'pulse', 'temporal', 'length', 'fwhm', 'of', '40', 'fs', 'we', 'obtained', 'an', 'electron', 'plasma', 'density', 'due', 'to', 'laser', 'ionization', 'of', 'about', '6', 'times', '1018', 'cm3', 'electron', 'energy', 'up', 'to', '350', 'mev', 'and', 'beam', 'charge', 'in', 'the', 'range', '50', '100', 'pc']] | [-0.067672854735824, 0.23034891082781941, -0.015089549267239223, 0.029955166767857325, -0.0020753945261570003, -0.10288327949682588, 0.01572011120426725, 0.45854672983171435, -0.2367259627281446, -0.3753438815254513, 0.002107389877168975, -0.26643026637932743, 0.09876534251833526, 0.29151765500858984, 0.021881388954994245, 0.040673770853794936, 0.0243859863079219, -0.024920040420504053, -0.05465468858629025, -0.17893394701344173, 0.19525592315458054, 0.2146069841591392, 0.27962092751216355, 0.1290575532337988, 0.1574673001401449, -0.0721453449786934, 0.03470246279290208, -0.09147779765267541, -0.1327562437538978, 0.07657368759822658, 0.23208753343700894, 0.037647146848947044, 0.2875597166212818, -0.4438989042619786, -0.23281853279377532, 0.021290599949672584, 0.12604167382049514, 0.07081566764753107, -0.07433680374281643, -0.24630306537930421, 0.08851189422237826, -0.1780031548563655, -0.20761850617979982, 0.031128520622673468, -0.005907240584052688, 0.09341190125807886, -0.25833684075477087, 0.029670996180786863, -0.0014133169059091667, 0.03338663032879745, -0.04287216803205647, -0.09328649545044411, 0.0766947014645974, -0.017073060352883234, 0.05392968319869769, 0.13231211367950546, 0.20214162581768913, -0.09707047933470604, -0.06959791992759831, 0.3735987142344394, -0.06099934816199142, -0.05386848485199955, 0.18698583860830295, -0.20377489558868403, -0.006726834886362703, 0.25195034468678507, 0.15585544643241647, 0.09594062039826623, -0.14469091098491602, 0.0005045663812894404, 0.05081052116694031, 0.21333347379750622, 0.1780993176191517, 0.042806536454238056, 0.1995153849225814, 0.20001292779242372, 0.06882891208520085, 0.08166675175188154, -0.20245686035023958, -0.006398125100646197, -0.25875358399385073, -0.09553242928355815, -0.12191336788237095, 0.08040351913710249, -0.0612778330410145, -0.06881679496686634, 0.4420428185276394, 0.17382814852506157, 0.160735644178289, -0.030638980173219844, 0.3040108808140292, 0.08841799784774386, 0.05196030022334454, 0.08677519833133739, 0.2606731626685474, 0.16688768522113592, 0.14997044039842505, -0.20634141817366278, -0.06774000552167574, -0.03311656281080713] |
1,802.01957 | Analytical Cost Metrics : Days of Future Past | As we move towards the exascale era, the new architectures must be capable of
running the massive computational problems efficiently. Scientists and
researchers are continuously investing in tuning the performance of
extreme-scale computational problems. These problems arise in almost all areas
of computing, ranging from big data analytics, artificial intelligence, search,
machine learning, virtual/augmented reality, computer vision, image/signal
processing to computational science and bioinformatics. With Moore's law
driving the evolution of hardware platforms towards exascale, the dominant
performance metric (time efficiency) has now expanded to also incorporate
power/energy efficiency. Therefore, the major challenge that we face in
computing systems research is: "how to solve massive-scale computational
problems in the most time/power/energy efficient manner?"
The architectures are constantly evolving making the current performance
optimizing strategies less applicable and new strategies to be invented. The
solution is for the new architectures, new programming models, and applications
to go forward together. Doing this is, however, extremely hard. There are too
many design choices in too many dimensions. We propose the following strategy
to solve the problem: (i) Models - Develop accurate analytical models (e.g.
execution time, energy, silicon area) to predict the cost of executing a given
program, and (ii) Complete System Design - Simultaneously optimize all the cost
models for the programs (computational problems) to obtain the most
time/area/power/energy efficient solution. Such an optimization problem evokes
the notion of codesign.
| cs.PF cs.PL | as we move towards the exascale era the new architectures must be capable of running the massive computational problems efficiently scientists and researchers are continuously investing in tuning the performance of extremescale computational problems these problems arise in almost all areas of computing ranging from big data analytics artificial intelligence search machine learning virtualaugmented reality computer vision imagesignal processing to computational science and bioinformatics with moores law driving the evolution of hardware platforms towards exascale the dominant performance metric time efficiency has now expanded to also incorporate powerenergy efficiency therefore the major challenge that we face in computing systems research is how to solve massivescale computational problems in the most timepowerenergy efficient manner the architectures are constantly evolving making the current performance optimizing strategies less applicable and new strategies to be invented the solution is for the new architectures new programming models and applications to go forward together doing this is however extremely hard there are too many design choices in too many dimensions we propose the following strategy to solve the problem i models develop accurate analytical models eg execution time energy silicon area to predict the cost of executing a given program and ii complete system design simultaneously optimize all the cost models for the programs computational problems to obtain the most timeareapowerenergy efficient solution such an optimization problem evokes the notion of codesign | [['as', 'we', 'move', 'towards', 'the', 'exascale', 'era', 'the', 'new', 'architectures', 'must', 'be', 'capable', 'of', 'running', 'the', 'massive', 'computational', 'problems', 'efficiently', 'scientists', 'and', 'researchers', 'are', 'continuously', 'investing', 'in', 'tuning', 'the', 'performance', 'of', 'extremescale', 'computational', 'problems', 'these', 'problems', 'arise', 'in', 'almost', 'all', 'areas', 'of', 'computing', 'ranging', 'from', 'big', 'data', 'analytics', 'artificial', 'intelligence', 'search', 'machine', 'learning', 'virtualaugmented', 'reality', 'computer', 'vision', 'imagesignal', 'processing', 'to', 'computational', 'science', 'and', 'bioinformatics', 'with', 'moores', 'law', 'driving', 'the', 'evolution', 'of', 'hardware', 'platforms', 'towards', 'exascale', 'the', 'dominant', 'performance', 'metric', 'time', 'efficiency', 'has', 'now', 'expanded', 'to', 'also', 'incorporate', 'powerenergy', 'efficiency', 'therefore', 'the', 'major', 'challenge', 'that', 'we', 'face', 'in', 'computing', 'systems', 'research', 'is', 'how', 'to', 'solve', 'massivescale', 'computational', 'problems', 'in', 'the', 'most', 'timepowerenergy', 'efficient', 'manner', 'the', 'architectures', 'are', 'constantly', 'evolving', 'making', 'the', 'current', 'performance', 'optimizing', 'strategies', 'less', 'applicable', 'and', 'new', 'strategies', 'to', 'be', 'invented', 'the', 'solution', 'is', 'for', 'the', 'new', 'architectures', 'new', 'programming', 'models', 'and', 'applications', 'to', 'go', 'forward', 'together', 'doing', 'this', 'is', 'however', 'extremely', 'hard', 'there', 'are', 'too', 'many', 'design', 'choices', 'in', 'too', 'many', 'dimensions', 'we', 'propose', 'the', 'following', 'strategy', 'to', 'solve', 'the', 'problem', 'i', 'models', 'develop', 'accurate', 'analytical', 'models', 'eg', 'execution', 'time', 'energy', 'silicon', 'area', 'to', 'predict', 'the', 'cost', 'of', 'executing', 'a', 'given', 'program', 'and', 'ii', 'complete', 'system', 'design', 'simultaneously', 'optimize', 'all', 'the', 'cost', 'models', 'for', 'the', 'programs', 'computational', 'problems', 'to', 'obtain', 'the', 'most', 'timeareapowerenergy', 'efficient', 'solution', 'such', 'an', 'optimization', 'problem', 'evokes', 'the', 'notion', 'of', 'codesign']] | [-0.09721304885585726, 0.03433496505392343, -0.05882463189586166, 0.06142282954637527, -0.13515926664279374, -0.206533779464475, 0.02403536918739389, 0.39756076387753375, -0.3247960509002691, -0.3852622523055678, 0.14573091257157753, -0.24704599486722145, -0.15385697771229648, 0.24575497518006678, -0.12138962781157911, 0.12529860734087248, 0.11579355689173099, -0.04360219652465146, -0.032092025263929305, -0.29238043088948223, 0.2367681137412936, 0.09058092626427035, 0.3018555148654351, 0.028134253208138813, 0.0678858439002527, -0.05537534932799255, -0.007991589710140292, -0.0010963413255272567, -0.08541701446266156, 0.19114214661177747, 0.37016928103944985, 0.2404675841077863, 0.38582237673524233, -0.47181134169347516, -0.19392161337587563, 0.12759707620924537, 0.15281847106358068, 0.09597789179991066, -0.07383615698823373, -0.21822723024316865, 0.05512099688660653, -0.1586032307656881, -0.0936859203460959, -0.11193814651155012, 0.026939708160560776, -0.024389120531070927, -0.22371155430924514, -0.034116197702912486, -0.00797448232073553, 0.023934846966377727, -0.030695674928470647, -0.132161200660838, 0.07801531483755753, 0.16270792610053572, 0.025493079159267445, 0.024170026772480924, 0.15644243119874904, -0.18441879506125197, -0.18044918316029776, 0.40709885262601475, 0.04124069686284721, -0.17974029490765783, 0.2180344193610446, -0.014818061649358632, -0.19203273437908916, 0.10293734625780157, 0.2516127916320069, 0.08566943348669806, -0.1666979004751608, 0.09836022062648096, 0.08193489582481561, 0.15149529211573412, 0.027982540856880535, 0.012534296000792113, 0.2128382024550644, 0.24858197002842125, 0.10048497596445875, 0.11622566780299946, -0.015529737930462164, -0.13678798063691439, -0.19948029803968634, -0.15713352563495522, -0.16018521551346307, -0.010714455416226494, -0.07695089149917424, -0.1451781126285953, 0.3482081524395783, 0.22463391124256304, 0.10894588295403602, 0.09545858555065934, 0.36515555064917343, 0.0928987583730694, 0.11336780945722628, 0.14179129972762894, 0.1930181316004434, 0.023317583921847733, 0.21465325734503235, -0.18245794790189912, 0.05779545099773843, -0.005351308051363698] |
1,802.01958 | Multimodal Image Captioning for Marketing Analysis | Automatically captioning images with natural language sentences is an
important research topic. State of the art models are able to produce
human-like sentences. These models typically describe the depicted scene as a
whole and do not target specific objects of interest or emotional relationships
between these objects in the image. However, marketing companies require to
describe these important attributes of a given scene. In our case, objects of
interest are consumer goods, which are usually identifiable by a product logo
and are associated with certain brands. From a marketing point of view, it is
desirable to also evaluate the emotional context of a trademarked product,
i.e., whether it appears in a positive or a negative connotation. We address
the problem of finding brands in images and deriving corresponding captions by
introducing a modified image captioning network. We also add a third output
modality, which simultaneously produces real-valued image ratings. Our network
is trained using a classification-aware loss function in order to stimulate the
generation of sentences with an emphasis on words identifying the brand of a
product. We evaluate our model on a dataset of images depicting interactions
between humans and branded products. The introduced network improves mean class
accuracy by 24.5 percent. Thanks to adding the third output modality, it also
considerably improves the quality of generated captions for images depicting
branded products.
| cs.CV | automatically captioning images with natural language sentences is an important research topic state of the art models are able to produce humanlike sentences these models typically describe the depicted scene as a whole and do not target specific objects of interest or emotional relationships between these objects in the image however marketing companies require to describe these important attributes of a given scene in our case objects of interest are consumer goods which are usually identifiable by a product logo and are associated with certain brands from a marketing point of view it is desirable to also evaluate the emotional context of a trademarked product ie whether it appears in a positive or a negative connotation we address the problem of finding brands in images and deriving corresponding captions by introducing a modified image captioning network we also add a third output modality which simultaneously produces realvalued image ratings our network is trained using a classificationaware loss function in order to stimulate the generation of sentences with an emphasis on words identifying the brand of a product we evaluate our model on a dataset of images depicting interactions between humans and branded products the introduced network improves mean class accuracy by 245 percent thanks to adding the third output modality it also considerably improves the quality of generated captions for images depicting branded products | [['automatically', 'captioning', 'images', 'with', 'natural', 'language', 'sentences', 'is', 'an', 'important', 'research', 'topic', 'state', 'of', 'the', 'art', 'models', 'are', 'able', 'to', 'produce', 'humanlike', 'sentences', 'these', 'models', 'typically', 'describe', 'the', 'depicted', 'scene', 'as', 'a', 'whole', 'and', 'do', 'not', 'target', 'specific', 'objects', 'of', 'interest', 'or', 'emotional', 'relationships', 'between', 'these', 'objects', 'in', 'the', 'image', 'however', 'marketing', 'companies', 'require', 'to', 'describe', 'these', 'important', 'attributes', 'of', 'a', 'given', 'scene', 'in', 'our', 'case', 'objects', 'of', 'interest', 'are', 'consumer', 'goods', 'which', 'are', 'usually', 'identifiable', 'by', 'a', 'product', 'logo', 'and', 'are', 'associated', 'with', 'certain', 'brands', 'from', 'a', 'marketing', 'point', 'of', 'view', 'it', 'is', 'desirable', 'to', 'also', 'evaluate', 'the', 'emotional', 'context', 'of', 'a', 'trademarked', 'product', 'ie', 'whether', 'it', 'appears', 'in', 'a', 'positive', 'or', 'a', 'negative', 'connotation', 'we', 'address', 'the', 'problem', 'of', 'finding', 'brands', 'in', 'images', 'and', 'deriving', 'corresponding', 'captions', 'by', 'introducing', 'a', 'modified', 'image', 'captioning', 'network', 'we', 'also', 'add', 'a', 'third', 'output', 'modality', 'which', 'simultaneously', 'produces', 'realvalued', 'image', 'ratings', 'our', 'network', 'is', 'trained', 'using', 'a', 'classificationaware', 'loss', 'function', 'in', 'order', 'to', 'stimulate', 'the', 'generation', 'of', 'sentences', 'with', 'an', 'emphasis', 'on', 'words', 'identifying', 'the', 'brand', 'of', 'a', 'product', 'we', 'evaluate', 'our', 'model', 'on', 'a', 'dataset', 'of', 'images', 'depicting', 'interactions', 'between', 'humans', 'and', 'branded', 'products', 'the', 'introduced', 'network', 'improves', 'mean', 'class', 'accuracy', 'by', '245', 'percent', 'thanks', 'to', 'adding', 'the', 'third', 'output', 'modality', 'it', 'also', 'considerably', 'improves', 'the', 'quality', 'of', 'generated', 'captions', 'for', 'images', 'depicting', 'branded', 'products']] | [-0.03891391686461698, 0.05259495266980118, -0.03039035473154178, 0.10196136593397052, -0.12986961044664788, -0.14165217921909717, 0.037061985997432795, 0.4462473070886624, -0.2574638101221943, -0.3492998230577287, 0.06058848630437661, -0.3149870594896309, -0.16641572861185483, 0.17725036615429254, -0.14983181376272375, 0.015698789923057496, 0.10241938988271228, 0.10815576229848571, -0.022346635526339816, -0.29469904488163395, 0.34794837316531724, 0.011444985556105772, 0.2965258419962583, 0.008745568726308274, 0.13961047020338074, -0.03709499779165731, -0.07575302915689577, -0.0017970572765874633, -0.04495694413678909, 0.18959498071155786, 0.32479724584835995, 0.20765524662754223, 0.30089503045294536, -0.3657436586375273, -0.18825105015557628, 0.09547440730337356, 0.0973677823890571, 0.0788676226249401, -0.03673786094290548, -0.36678279321252677, 0.06935571653030075, -0.1902404888595983, 0.02011448725560357, -0.10677529054858799, 0.003202136696173667, -0.00040497839595568747, -0.2756332942092716, 0.025087892130958044, 0.07687773663647103, 0.07447659754013929, -0.06479711113036149, -0.08646815379259286, -0.025444966093804856, 0.22299347698860508, 0.0532293075277168, 0.04849319579971216, 0.13851550737629761, -0.24544426979257689, -0.12238329393487121, 0.4129426941141352, -0.04018837952229136, -0.22724360253175233, 0.18630710628034697, -0.0721339481538749, -0.1101115800929046, 0.10137198496660269, 0.19500941822729032, 0.12697587617744296, -0.15852071881831228, -0.02118936323939386, -0.08084721613658576, 0.20910731848680125, 0.09298441526144408, -0.0008375264435738056, 0.23587612613358092, 0.19921656975497468, 0.004501956279037168, 0.180358874274896, -0.05994456211893676, -0.03579670553350494, -0.2135138212921316, -0.13456054080932126, -0.1496518982809272, 0.010517316262160643, -0.08276902938545849, -0.16552817034466938, 0.4170233472250402, 0.2088806988443442, 0.214855241098416, 0.06021810968737915, 0.29710520973831817, 0.025028537823566916, 0.1045251014801833, 0.02561183591784389, 0.13239993688415502, 0.007918227234276364, 0.12438634131733026, -0.10030203258727786, 0.120765918653945, 0.059543807651697624] |
1,802.01959 | Collective classical motion on hyperbolic spacetimes of any dimensions | The geodesics equations on de Sitter and anti-de Sitter spacetimes of any
dimensions, are the starting point for deriving the general form of the
Boltzmann equation in terms of conserved quantities. The simple equation for
the non-equilibrium Marle and Anderson-Witting models are derived and the
distributions of the Boltzmann-Marle model on these manifolds are written down
first in terms of conserved quantities and then as functions of canonical
variables.
| gr-qc | the geodesics equations on de sitter and antide sitter spacetimes of any dimensions are the starting point for deriving the general form of the boltzmann equation in terms of conserved quantities the simple equation for the nonequilibrium marle and andersonwitting models are derived and the distributions of the boltzmannmarle model on these manifolds are written down first in terms of conserved quantities and then as functions of canonical variables | [['the', 'geodesics', 'equations', 'on', 'de', 'sitter', 'and', 'antide', 'sitter', 'spacetimes', 'of', 'any', 'dimensions', 'are', 'the', 'starting', 'point', 'for', 'deriving', 'the', 'general', 'form', 'of', 'the', 'boltzmann', 'equation', 'in', 'terms', 'of', 'conserved', 'quantities', 'the', 'simple', 'equation', 'for', 'the', 'nonequilibrium', 'marle', 'and', 'andersonwitting', 'models', 'are', 'derived', 'and', 'the', 'distributions', 'of', 'the', 'boltzmannmarle', 'model', 'on', 'these', 'manifolds', 'are', 'written', 'down', 'first', 'in', 'terms', 'of', 'conserved', 'quantities', 'and', 'then', 'as', 'functions', 'of', 'canonical', 'variables']] | [-0.11846717089578948, 0.13645029204952366, -0.1012602449833032, 0.11811552947277532, -0.03510897264213247, -0.0864819036111893, -0.06127984842340298, 0.2492771579829209, -0.19872090634068146, -0.22989916120765402, 0.08285469173878322, -0.30595062199213047, -0.10298890374628279, 0.18334088159163536, -0.0003578880637445871, 0.07976706547196954, 0.0015902893124696087, 0.03887604098931393, -0.13191966468002647, -0.2333259483498028, 0.41229883706032794, 0.012855931667967098, 0.24995774618240402, -0.02578754471751916, 0.21085197242962964, -0.028172493789016324, -0.004663948935237439, 0.02151897076435168, -0.1982304563964991, 0.08329564137110378, 0.21442323552877068, 0.11498501702376149, 0.13510238082723364, -0.44278233191546273, -0.24539878327563844, 0.07872401481932577, 0.15823829470216022, 0.14682454900021719, 0.035756001204443985, -0.290006265098996, 0.021163615113704615, -0.11965260390356622, -0.17727309443494854, -0.13152210320592583, 0.02756951715769794, 0.05281199247110635, -0.21235563082839637, 0.17263697318883395, 0.04370184317368137, 0.032026889884625286, -0.165468324913972, -0.13441898429814234, -0.09361312019310015, 0.10796260188662392, 0.08107978417983223, -0.004699316991986159, 0.10502820344203535, -0.14068361144403324, -0.10903889576301855, 0.39578063779181855, -0.0639993779186625, -0.33266775452477093, 0.13374885932802605, -0.14504038345972625, -0.12823449046460583, 0.03761068004293039, 0.1471462718635688, 0.23222348110421615, -0.2103681331500411, 0.1958920246209292, -0.0008860751986503601, 0.04117854023292346, 0.11276019025621388, 0.02028550836000838, 0.21684143255355165, 0.031038080027107808, -0.012130067067439942, 0.09933222186587312, 0.03589674368199399, -0.1998305657205706, -0.4188975696999799, -0.20561759347123476, -0.1713321769664831, 0.08611155423226163, -0.19588530059434775, -0.23112552551388302, 0.35884553392294466, 0.07976206363630756, 0.14643342278021224, 0.10028977467514136, 0.21503444410422268, 0.19968165820019373, -0.0075297228827634274, 0.11455629756400253, 0.2046881113826256, 0.14782203162801177, 0.11138619047671776, -0.19044878659085096, -0.016027586877017337, 0.15793534054640024] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.